mzuenni tests

10 files changed, 470 insertions, 0 deletions

diff --git a/test/math/transforms/andTransform.cpp b/test/math/transforms/andTransform.cpp
new file mode 100644
index 0000000..fa029f6
--- /dev/null
+++ b/test/math/transforms/andTransform.cpp
@@ -0,0 +1,38 @@
+#include "../../util.h"
+#include <math/transforms/andTransform.cpp>
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = 1ll << Random::integer<int>(0, 10);
+		auto expected = Random::integers<ll>(n, -1000, 1000);
+		auto got = expected;
+		fft(got, false);
+		fft(got, true);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 23;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, -1000, 1000);
+	vector<ll> b = Random::integers<ll>(N, -1000, 1000);
+	t.start();
+	fft(a, true);
+	fft(b, false);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * a[i];
+	for (ll i = 0; i < N; i++) hash += i * b[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();
+}
+
diff --git a/test/math/transforms/bitwiseTransforms.cpp b/test/math/transforms/bitwiseTransforms.cpp
new file mode 100644
index 0000000..132740c
--- /dev/null
+++ b/test/math/transforms/bitwiseTransforms.cpp
@@ -0,0 +1,38 @@
+#include "../../util.h"
+#include <math/transforms/bitwiseTransforms.cpp>
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = 1ll << Random::integer<int>(0, 10);
+		auto expected = Random::integers<ll>(n, -1000, 1000);
+		auto got = expected;
+		bitwiseConv(got, false);
+		bitwiseConv(got, true);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 23;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, -1000, 1000);
+	vector<ll> b = Random::integers<ll>(N, -1000, 1000);
+	t.start();
+	bitwiseConv(a, true);
+	bitwiseConv(b, false);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * a[i];
+	for (ll i = 0; i < N; i++) hash += i * b[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();
+}
+
diff --git a/test/math/transforms/fft.cpp b/test/math/transforms/fft.cpp
new file mode 100644
index 0000000..858676b
--- /dev/null
+++ b/test/math/transforms/fft.cpp
@@ -0,0 +1,51 @@
+#include "../../util.h"
+#include <math/transforms/fft.cpp>
+
+vector<cplx> to_cplx(const vector<ll>& in) {
+	vector<cplx> res(sz(in));
+	for (int i = 0; i < sz(in); i++) res[i] = in[i];
+	return res;
+}
+
+vector<ll> from_cplx(const vector<cplx>& in) {
+	vector<ll> res(sz(in));
+	for (int i = 0; i < sz(in); i++) res[i] = llround(real(in[i]));
+	return res;
+}
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = 1ll << Random::integer<int>(0, 10);
+		auto expected = Random::integers<ll>(n, -1000, 1000);
+		vector<cplx> tmp = to_cplx(expected);
+		fft(tmp, false);
+		fft(tmp, true);
+		auto got = from_cplx(tmp);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 21;
+void performance_test() {
+	timer t;
+	auto a = to_cplx(Random::integers<ll>(N, -1000, 1000));
+	auto b = to_cplx(Random::integers<ll>(N, -1000, 1000));
+	t.start();
+	fft(a, true);
+	fft(b, false);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * llround(real(a[i]));
+	for (ll i = 0; i < N; i++) hash += i * llround(real(b[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();
+}
+
diff --git a/test/math/transforms/fftMul.cpp b/test/math/transforms/fftMul.cpp
new file mode 100644
index 0000000..5933864
--- /dev/null
+++ b/test/math/transforms/fftMul.cpp
@@ -0,0 +1,62 @@
+#include "../../util.h"
+#include <math/modPowIterativ.cpp>
+#include <math/transforms/fft.cpp>
+#pragma GCC diagnostic ignored "-Wnarrowing"
+#include <math/transforms/fftMul.cpp>
+
+vector<ll> from_cplx(const vector<cplx>& in) {
+	vector<ll> res(sz(in));
+	for (int i = 0; i < sz(in); i++) res[i] = llround(real(in[i]));
+	return res;
+}
+
+vector<ll> naive(const vector<ll>& a, const vector<ll>& b) {
+	vector<ll> res;
+	for (ll i = 1;; i *= 2) {
+		if (sz(a) + sz(b) <= i) {
+			res.resize(i, 0);
+			break;
+		}
+	}
+	for (int i = 0; i < sz(a); i++) {
+		for (int j = 0; j < sz(b); j++) {
+			res[i+j] += a[i] * b[j];
+		}
+	}
+	return res;
+}
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = Random::integer<int>(1, 100);
+		int m = Random::integer<int>(1, 100);
+		auto a = Random::integers<ll>(n, -1000, 1000);
+		auto b = Random::integers<ll>(m, -1000, 1000);
+		auto expected = naive(a, b);
+		auto got = from_cplx(mul(a, b));
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 20;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, -1000, 1000);
+	vector<ll> b = Random::integers<ll>(N, -1000, 1000);
+	t.start();
+	auto got = from_cplx(mul(a, b));
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * got[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();
+}
+
diff --git a/test/math/transforms/multiplyBitwise.cpp b/test/math/transforms/multiplyBitwise.cpp
new file mode 100644
index 0000000..bc73290
--- /dev/null
+++ b/test/math/transforms/multiplyBitwise.cpp
@@ -0,0 +1,55 @@
+#include "../../util.h"
+#include <math/modPowIterativ.cpp>
+#include <math/transforms/bitwiseTransforms.cpp>
+#include <math/transforms/multiplyBitwise.cpp>
+
+vector<ll> naive(const vector<ll>& a, const vector<ll>& b) {
+	vector<ll> res;
+	for (ll i = 1;; i *= 2) {
+		if (sz(a) <= i && sz(b) <= i) {
+			res.resize(i, 0);
+			break;
+		}
+	}
+	for (int i = 0; i < sz(a); i++) {
+		for (int j = 0; j < sz(b); j++) {
+			res[i&j] += a[i] * b[j];
+		}
+	}
+	return res;
+}
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = Random::integer<int>(1, 100);
+		int m = Random::integer<int>(1, 100);
+		auto a = Random::integers<ll>(n, -1000, 1000);
+		auto b = Random::integers<ll>(m, -1000, 1000);
+		auto expected = naive(a, b);
+		auto got = mul(a, b);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 22;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, -1000, 1000);
+	vector<ll> b = Random::integers<ll>(N, -1000, 1000);
+	t.start();
+	auto got = mul(a, b);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * got[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();
+}
+
diff --git a/test/math/transforms/multiplyFFT.cpp b/test/math/transforms/multiplyFFT.cpp
new file mode 100644
index 0000000..782be1b
--- /dev/null
+++ b/test/math/transforms/multiplyFFT.cpp
@@ -0,0 +1,55 @@
+#include "../../util.h"
+#include <math/modPowIterativ.cpp>
+#include <math/transforms/fft.cpp>
+#include <math/transforms/multiplyFFT.cpp>
+
+vector<ll> naive(const vector<ll>& a, const vector<ll>& b) {
+	vector<ll> res;
+	for (ll i = 1;; i *= 2) {
+		if (sz(a) + sz(b) <= i) {
+			res.resize(i, 0);
+			break;
+		}
+	}
+	for (int i = 0; i < sz(a); i++) {
+		for (int j = 0; j < sz(b); j++) {
+			res[i+j] += a[i] * b[j];
+		}
+	}
+	return res;
+}
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = Random::integer<int>(1, 100);
+		int m = Random::integer<int>(1, 100);
+		auto a = Random::integers<ll>(n, -1000, 1000);
+		auto b = Random::integers<ll>(m, -1000, 1000);
+		auto expected = naive(a, b);
+		auto got = mul(a, b);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 19;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, -1000, 1000);
+	vector<ll> b = Random::integers<ll>(N, -1000, 1000);
+	t.start();
+	auto got = mul(a, b);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * got[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();
+}
+
diff --git a/test/math/transforms/multiplyNTT.cpp b/test/math/transforms/multiplyNTT.cpp
new file mode 100644
index 0000000..70fc137
--- /dev/null
+++ b/test/math/transforms/multiplyNTT.cpp
@@ -0,0 +1,56 @@
+#include "../../util.h"
+#include <math/modPowIterativ.cpp>
+#include <math/transforms/ntt.cpp>
+#include <math/transforms/multiplyNTT.cpp>
+
+vector<ll> naive(const vector<ll>& a, const vector<ll>& b) {
+	vector<ll> res;
+	for (ll i = 1;; i *= 2) {
+		if (sz(a) + sz(b) <= i) {
+			res.resize(i, 0);
+			break;
+		}
+	}
+	for (int i = 0; i < sz(a); i++) {
+		for (int j = 0; j < sz(b); j++) {
+			res[i+j] += a[i] * b[j];
+			res[i+j] %= mod;
+		}
+	}
+	return res;
+}
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = Random::integer<int>(1, 100);
+		int m = Random::integer<int>(1, 100);
+		auto a = Random::integers<ll>(n, 0, mod);
+		auto b = Random::integers<ll>(m, 0, mod);
+		auto expected = naive(a, b);
+		auto got = mul(a, b);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 20;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, 0, mod);
+	vector<ll> b = Random::integers<ll>(N, 0, mod);
+	t.start();
+	auto got = mul(a, b);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * got[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();
+}
+
diff --git a/test/math/transforms/ntt.cpp b/test/math/transforms/ntt.cpp
new file mode 100644
index 0000000..cd32073
--- /dev/null
+++ b/test/math/transforms/ntt.cpp
@@ -0,0 +1,39 @@
+#include "../../util.h"
+#include <math/modPowIterativ.cpp>
+#include <math/transforms/ntt.cpp>
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = 1ll << Random::integer<int>(0, 10);
+		auto expected = Random::integers<ll>(n, 0, mod);
+		auto got = expected;
+		ntt(got, false);
+		ntt(got, true);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 22;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, 0, mod);
+	vector<ll> b = Random::integers<ll>(N, 0, mod);
+	t.start();
+	ntt(a, true);
+	ntt(b, false);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * a[i];
+	for (ll i = 0; i < N; i++) hash += i * b[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();
+}
+
diff --git a/test/math/transforms/orTransform.cpp b/test/math/transforms/orTransform.cpp
new file mode 100644
index 0000000..0ec9155
--- /dev/null
+++ b/test/math/transforms/orTransform.cpp
@@ -0,0 +1,38 @@
+#include "../../util.h"
+#include <math/transforms/orTransform.cpp>
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = 1ll << Random::integer<int>(0, 10);
+		auto expected = Random::integers<ll>(n, -1000, 1000);
+		auto got = expected;
+		fft(got, false);
+		fft(got, true);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 23;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, -1000, 1000);
+	vector<ll> b = Random::integers<ll>(N, -1000, 1000);
+	t.start();
+	fft(a, true);
+	fft(b, false);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * a[i];
+	for (ll i = 0; i < N; i++) hash += i * b[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();
+}
+
diff --git a/test/math/transforms/xorTransform.cpp b/test/math/transforms/xorTransform.cpp
new file mode 100644
index 0000000..17b0f6f
--- /dev/null
+++ b/test/math/transforms/xorTransform.cpp
@@ -0,0 +1,38 @@
+#include "../../util.h"
+#include <math/transforms/xorTransform.cpp>
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = 1ll << Random::integer<int>(0, 10);
+		auto expected = Random::integers<ll>(n, -1000, 1000);
+		auto got = expected;
+		fft(got, false);
+		fft(got, true);
+		if (got != expected) cerr << "error" << FAIL;
+		queries += n;
+	}
+	cerr << "tested queries: " << queries << endl;
+}
+
+constexpr int N = 1ll << 23;
+void performance_test() {
+	timer t;
+	vector<ll> a = Random::integers<ll>(N, -1000, 1000);
+	vector<ll> b = Random::integers<ll>(N, -1000, 1000);
+	t.start();
+	fft(a, true);
+	fft(b, false);
+	t.stop();
+	hash_t hash = 0;
+	for (ll i = 0; i < N; i++) hash += i * a[i];
+	for (ll i = 0; i < N; i++) hash += i * b[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();
+}
+