summaryrefslogtreecommitdiff
path: root/test/string/rollingHashCf.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/rollingHashCf.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/rollingHashCf.cpp')
-rw-r--r--test/string/rollingHashCf.cpp94
1 files changed, 94 insertions, 0 deletions
diff --git a/test/string/rollingHashCf.cpp b/test/string/rollingHashCf.cpp
new file mode 100644
index 0000000..79003de
--- /dev/null
+++ b/test/string/rollingHashCf.cpp
@@ -0,0 +1,94 @@
+#include "../util.h"
+#include <string/rollingHashCf.cpp>
+
+constexpr ll RandomQ = 318LL << 53;
+
+string thueMorse(ll n) {
+ string res = "a";
+ while (sz(res) < n) {
+ string tmp = res;
+ for (char& c : tmp) c ^= 1;
+ res += tmp;
+ }
+ return res;
+}
+
+auto getHash(const string& s) {
+ return Hash(s, RandomQ)(0, sz(s));
+}
+
+void testThueMorse() {
+ set<decltype(getHash(""))> got;
+ set<string> expected;
+ string s = thueMorse(1000);
+ Hash h(s, RandomQ);
+ for (int l = 0; l < sz(s); l++) {
+ for (int r = l + 1; r <= sz(s); r++) {
+ got.insert(h(l, r));
+ expected.insert(s.substr(l, r - l));
+ }
+ }
+ if (sz(got) != sz(expected)) cerr << "error: thueMorse" << FAIL;
+ cerr << "thueMorse: ok" << endl;
+}
+
+void testTiny() {
+ if (getHash("aa") == getHash("a")) cerr << "error: tiny" << FAIL;
+ if (getHash("00") == getHash("0")) cerr << "error: tiny" << FAIL;
+ if (getHash("AA") == getHash("A")) cerr << "error: tiny" << FAIL;
+ cerr << "tiny: ok" << endl;
+}
+
+void testSmall() {
+ set<decltype(getHash(""))> got;
+ ll expected = 0;
+ auto dfs = [&](auto&& self, string pref)->void {
+ expected++;
+ got.insert(getHash(pref));
+ if(sz(pref) >= 5) return;
+ for (char c = 'a'; c <= 'z'; c++) {
+ self(self, pref + c);
+ }
+ };
+ dfs(dfs, "");
+ if (sz(got) != expected) cerr << "error: small" << FAIL;
+ cerr << "small: ok" << endl;
+}
+
+void stress_test() {
+ set<decltype(getHash(""))> got;
+ set<string> expected;
+ string s = Random::string(1000, "abc");
+ Hash h(s, RandomQ);
+ for (int l = 0; l < sz(s); l++) {
+ for (int r = l + 1; r <= sz(s); r++) {
+ got.insert(h(l, r));
+ expected.insert(s.substr(l, r - l));
+ }
+ }
+ if (sz(got) != sz(expected)) cerr << "error: stress test" << FAIL;
+ cerr << "stress test: ok" << endl;
+}
+
+constexpr int N = 1'000'000;
+void performance_test() {
+ timer t;
+ auto s = Random::string(N, "a") + Random::string(N, "ab") + Random::string(N, "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789$#");
+ hash_t hash = 0;
+ t.start();
+ Hash h(s, RandomQ);
+ for (ll i = 0; i < N; i++) {
+ hash += h(i, i + 2*N);
+ }
+ t.stop();
+ if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
+ cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
+}
+
+int main() {
+ testThueMorse();
+ testTiny();
+ testSmall();
+ stress_test();
+ performance_test();
+}