summaryrefslogtreecommitdiff
path: root/test/math/linearSieve.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/math/linearSieve.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/math/linearSieve.cpp')
-rw-r--r--test/math/linearSieve.cpp71
1 files changed, 71 insertions, 0 deletions
diff --git a/test/math/linearSieve.cpp b/test/math/linearSieve.cpp
new file mode 100644
index 0000000..8ea822b
--- /dev/null
+++ b/test/math/linearSieve.cpp
@@ -0,0 +1,71 @@
+#include "../util.h"
+namespace expected {
+#include <math/primeSieve.cpp>
+}
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#include <math/linearSieve.cpp>
+
+void stress_test() {
+ expected::primeSieve();
+ expected::primes.resize(primes.size());
+ if (expected::primes != primes) cerr << "error: primes" << FAIL;
+ int queries = 0;
+ for (int i = 1; i < 1'000'000; i++) {
+ auto got = sieved[i];
+ auto expected = naive(i);
+ if (got != expected) cerr << i << ", got: " << got << ", expected: " << expected << FAIL;
+ queries++;
+ }
+ for (int i = 0; i < 1'000'000; i++) {
+ ll x = Random::integer<ll>(2, N);
+ auto got = sieved[x];
+ auto expected = naive(x);
+ if (got != expected) cerr << x << ", got: " << got << ", expected: " << expected << FAIL;
+ queries++;
+ }
+ cerr << "tested queries: " << queries << endl;
+}
+
+void test_tiny() {
+ if (mu( 3, 3, 1) != -1) cerr << "error: 1" << FAIL;
+ if (mu( 9, 3, 2) != 0) cerr << "error: 2" << FAIL;
+ if (mu(27, 3, 3) != 0) cerr << "error: 3" << FAIL;
+
+ if (phi( 3, 3, 1) != 2) cerr << "error: 4" << FAIL;
+ if (phi( 9, 3, 2) != 6) cerr << "error: 5" << FAIL;
+ if (phi(27, 3, 3) != 18) cerr << "error: 6" << FAIL;
+
+ if (div( 3, 3, 1) != 2) cerr << "error: 7" << FAIL;
+ if (div( 9, 3, 2) != 3) cerr << "error: 8" << FAIL;
+ if (div(27, 3, 3) != 4) cerr << "error: 9" << FAIL;
+
+ if (divSum( 3, 3, 1) != 4) cerr << "error: 10" << FAIL;
+ if (divSum( 9, 3, 2) != 13) cerr << "error: 11" << FAIL;
+ if (divSum(27, 3, 3) != 40) cerr << "error: 12" << FAIL;
+
+ if (square( 3, 3, 1) != 1) cerr << "error: 13" << FAIL;
+ if (square( 9, 3, 2) != 9) cerr << "error: 14" << FAIL;
+ if (square(27, 3, 3) != 9) cerr << "error: 15" << FAIL;
+
+ if (squareFree( 3, 3, 1) != 3) cerr << "error: 13" << FAIL;
+ if (squareFree( 9, 3, 2) != 3) cerr << "error: 14" << FAIL;
+ if (squareFree(27, 3, 3) != 3) cerr << "error: 15" << FAIL;
+ cerr << "tested tiny" << endl;
+}
+
+void performance_test() {
+ timer t;
+ t.start();
+ sieve();
+ hash_t hash = sz(primes);
+ t.stop();
+ if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
+ cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
+}
+
+int main() {
+ performance_test();
+ stress_test();
+ test_tiny();
+}
+