From 34c882ab75a60699429421684a9867cce0a22110 Mon Sep 17 00:00:00 2001
From: Gloria Mundi <gloria@gloria-mundi.eu>
Date: Thu, 2 May 2024 20:42:43 +0200
Subject: wavelet tree changes + tests

---
 datastructures/test/waveletTree.cpp | 38 +++++++++++++++++++++++++++++++++++++
 1 file changed, 38 insertions(+)
 create mode 100644 datastructures/test/waveletTree.cpp

(limited to 'datastructures/test/waveletTree.cpp')

diff --git a/datastructures/test/waveletTree.cpp b/datastructures/test/waveletTree.cpp
new file mode 100644
index 0000000..c5da1d2
--- /dev/null
+++ b/datastructures/test/waveletTree.cpp
@@ -0,0 +1,38 @@
+#include "../waveletTree.cpp"
+
+void test(int n) {
+	vector<ll> values(n);
+	for (ll &x: values) x = util::randint();
+	vector<ll> backup = values;
+	WaveletTree wave(values);
+	assert(values == backup);
+	for (int i = 0; i < n; i++) {
+		int l = util::randint(n+1);
+		int r = util::randint(n+1);
+		if (l > r) swap(l, r);
+		ll bound = util::randint();
+		int res = 0;
+		for (ll x: values | views::take(r) | views::drop(l)) {
+			if (x < bound) res++;
+		}
+		assert(wave.countSmaller(l, r, bound) == res);
+	}
+	for (int i = 0; 5*i < n; i++) {
+		int l = util::randint(n);
+		int m = util::randint(n);
+		int r = util::randint(n);
+		if (l > m) swap(l, m);
+		if (m > r) swap(m, r);
+		if (l > m) swap(l, m);
+		r++;
+		int k = m-l;
+		vector<ll> part(values.begin()+l, values.begin()+r);
+		ranges::nth_element(part, part.begin() + k);
+		assert(wave.kth(l, r, k) == part[k]);
+	}
+}
+
+int main() {
+	test(1000);
+	test(1);
+}
-- 
cgit v1.2.3