summaryrefslogtreecommitdiff
path: root/test/string/suffixArray.cpp
diff options
context:
space:
mode:
authormzuenni <mzuenni@users.noreply.github.com>2024-07-28 22:54:40 +0200
committerGitHub <noreply@github.com>2024-07-28 22:54:40 +0200
commit8d11c6c8213f46f0fa19826917c255edd5d43cb1 (patch)
tree96d75baff33d5a04b5a60f1a41f514a26c716874 /test/string/suffixArray.cpp
parent8c33b4e0d3030cfed17fc64b4fe41133339f6d87 (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 'test/string/suffixArray.cpp')
-rw-r--r--test/string/suffixArray.cpp61
1 files changed, 61 insertions, 0 deletions
diff --git a/test/string/suffixArray.cpp b/test/string/suffixArray.cpp
new file mode 100644
index 0000000..4945d8e
--- /dev/null
+++ b/test/string/suffixArray.cpp
@@ -0,0 +1,61 @@
+#include "../util.h"
+#include <string/suffixArray.cpp>
+
+vector<int> naive(string_view s) {
+ vector<int> SA(sz(s));
+ iota(all(SA), 0);
+ sort(all(SA), [s](int a, int b){
+ return s.substr(a) < s.substr(b);
+ });
+ return SA;
+}
+
+int lcp(string_view s, int x, int y) {
+ int res = 0;
+ while (x + res < sz(s) && y + res < sz(s) && s[x + res] == s[y + res]) res++;
+ return res;
+}
+
+void stress_test() {
+ ll queries = 0;
+ for (int i = 0; i < 100; i++) {
+ int n = Random::integer<int>(1, 100);
+ auto s = Random::string(n, "abc");
+ SuffixArray sa(s);
+ vector<int> got = sa.SA;
+ vector<int> expected = naive(s);
+ vector<int> SA(n);
+ if (got != expected) cerr << "error: SA" << FAIL;
+ got = sa.LCP;
+ swap(SA, expected);
+ for (int x = 0; x < n; x++) {
+ for (int y = 0; y < n; y++) {
+ int gotLCP = sa.lcp(x, y);
+ int expectedLCP = lcp(s, x, y);
+ if (gotLCP != expectedLCP) cerr << "error: lcp" << FAIL;
+ }
+ if (x > 0) expected[x] = lcp(s, SA[x-1], SA[x]);
+ }
+ if (got != expected) cerr << "error: LCP" << FAIL;
+ queries += n;
+ }
+ cerr << "tested random queries: " << queries << endl;
+}
+
+constexpr int N = 200'000;
+void performance_test() {
+ timer t;
+ auto s = Random::string(N, "a") + Random::string(N, "ab") + Random::string(N, "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789$#");
+ t.start();
+ SuffixArray sa(s);
+ t.stop();
+ hash_t hash = 0;
+ for (int i = 0; i < sz(sa.SA); i++) hash += i*sa.SA[i];
+ if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
+ cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
+}
+
+int main() {
+ stress_test();
+ performance_test();
+}