diff options
| author | mzuenni <mzuenni@users.noreply.github.com> | 2024-07-28 22:54:40 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-07-28 22:54:40 +0200 |
| commit | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (patch) | |
| tree | 96d75baff33d5a04b5a60f1a41f514a26c716874 /string/suffixArray.cpp | |
| parent | 8c33b4e0d3030cfed17fc64b4fe41133339f6d87 (diff) | |
Test (#4)
* update
* moved content in subdir
* rename file
* add test setup
* add test setup
* add github action
* automaticly test all cpp files
* timeout after 10s
* setulimit and dont zero memory
* test build pdf
* install latexmk
* update
* update
* ngerman
* fonts
* removed old code
* add first test
* added tests
* test in sorted order
* more tests
* simplified test
* more tests
* fix suffix tree
* fixes and improvements
* done ust lst directly
* fix swap
* add links to pdf
* fix constants
* add primorial
* add comment
* various improvements
* more tests
* added missing stuf
* more tests
* fix tests
* more tests
* more tests
* more tests
* fix recursion?
* test trie
* more tests
* only use python temporarily for listings
* only use python temporarily for listings
* more tests
* fix longestCommonSubstring
* more tests
* more tests
* made code more similiar
* fix?
* more tests
* more tests
* more tests
* add ahoCorasick test + limit 4GB stack size
* more tests
* fix test
* add additional test
* more tests
* more tests
* fix?
* better fix
* fix virtual tree
* more tests
* more tests
* recursive closest pair
* more tests
* decrease limit
* new tests
* more tests
* fix name
* more tests
* add test
* new test
* more tests
* more tests
* more tests
* more tests
* new test and content
* new code
* new code
* larger tests
* fix and test
* new test
* new test
* update pdf
* remove comments
* new test
* more tests
* more testcases
* more tests
* increased limit
* more tests
* more tests
* more tests
* new tests
* more tests
* shortened code
* new test
* add basic tests for bigint
* more tests
* removed old files
* new test
* ignore some files
* more auto more ccw
* fix test
* more tests
* fix
* new tests
* more tests
* more tests
* stronger test
* actually verify delaunay...
* more tests
* fix header
* more tests
* run tests parallel?
* test parralel?
* add --missing
* separate workflows
* test
* is the pdf checked?
* separate workflows
* fix workflow
* more workflows
---------
Co-authored-by: Yidi <noob999noob999@gmail.com>
Diffstat (limited to 'string/suffixArray.cpp')
| -rw-r--r-- | string/suffixArray.cpp | 38 |
1 files changed, 0 insertions, 38 deletions
diff --git a/string/suffixArray.cpp b/string/suffixArray.cpp deleted file mode 100644 index 8b698d2..0000000 --- a/string/suffixArray.cpp +++ /dev/null @@ -1,38 +0,0 @@ -constexpr int MAX_CHAR = 256; -struct SuffixArray { - int n; - vector<int> SA, LCP; - vector<vector<int>> P; - - SuffixArray(const string& s) : n(sz(s)), SA(n), LCP(n), - P(__lg(2 * n - 1) + 1, vector<int>(n)) { - P[0].assign(all(s)); - iota(all(SA), 0); - sort(all(SA), [&](int a, int b) {return s[a] < s[b];}); - vector<int> x(n); - for (int k = 1, c = 1; c < n; k++, c *= 2) { - iota(all(x), n - c); - for (int ptr = c; int i : SA) if (i >= c) x[ptr++] = i - c; - - vector<int> cnt(k == 1 ? MAX_CHAR : n); - for (int i : P[k-1]) cnt[i]++; - partial_sum(all(cnt), begin(cnt)); - for (int i : x | views::reverse) SA[--cnt[P[k-1][i]]] = i; - - auto p = [&](int i) {return i < n ? P[k-1][i] : -1;}; - for (int i = 1; i < n; i++) { - int a = SA[i-1], b = SA[i]; - P[k][b] = P[k][a] + (p(a) != p(b) || p(a+c) != p(b+c)); - }} - for (int i = 1; i < n; i++) LCP[i] = lcp(SA[i-1], SA[i]); - } - - int lcp(int x, int y) {//x & y are text-indices, not SA-indices - if (x == y) return n - x; - int res = 0; - for (int i = sz(P) - 1; i >= 0 && max(x, y) + res < n; i--) { - if (P[i][x + res] == P[i][y + res]) res |= 1 << i; - } - return res; - } -}; |