8 files changed, 11 insertions, 28 deletions
diff --git a/test/datastructures/fenwickTree.cpp b/test/datastructures/fenwickTree.cpp
index c1ef6bf..f2a490a 100644
--- a/test/datastructures/fenwickTree.cpp
+++ b/test/datastructures/fenwickTree.cpp
@@ -23,7 +23,7 @@ void stress_test() {
 				int i = Random::integer<int>(0, n);
 				ll got = prefix_sum(i);
 				ll expected = 0;
-				for (int j = 0; j <= i; j++) expected += naive[j];
+				for (int j = 0; j < i; j++) expected += naive[j];
 				if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
 			}
 		}
@@ -42,7 +42,7 @@ void performance_test() {
 		int i = Random::integer<int>(0, N);
 		int j = Random::integer<int>(0, N);
 		ll x = Random::integer<ll>(-1000, 1000);
-		
+
 		t.start();
 		update(i, x);
 		hash ^= prefix_sum(j);
diff --git a/test/datastructures/fenwickTree2.cpp b/test/datastructures/fenwickTree2.cpp
index aa99576..d332dc8 100644
--- a/test/datastructures/fenwickTree2.cpp
+++ b/test/datastructures/fenwickTree2.cpp
@@ -23,7 +23,7 @@ void stress_test() {
 				int i = Random::integer<int>(0, n);
 				ll got = prefix_sum(i);
 				ll expected = 0;
-				for (int j = 0; j <= i; j++) expected += naive[j];
+				for (int j = 0; j < i; j++) expected += naive[j];
 				if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
 			}
 		}
@@ -44,7 +44,7 @@ void performance_test() {
 		int j = Random::integer<int>(0, N);
 		int k = Random::integer<int>(0, N);
 		ll x = Random::integer<ll>(-1000, 1000);
-		
+
 		t.start();
 		update(i, j, x);
 		hash ^= prefix_sum(k);
diff --git a/test/datastructures/lazyPropagation.cpp b/test/datastructures/lazyPropagation.cpp
index 7002061..7b0e448 100644
--- a/test/datastructures/lazyPropagation.cpp
+++ b/test/datastructures/lazyPropagation.cpp
@@ -45,7 +45,7 @@ void performance_test() {
 		auto [l1, r1] = Random::pair<int>(0, N + 1);
 		auto [l2, r2] = Random::pair<int>(0, N + 1);
 		ll x1 = Random::integer<ll>(-1000, 1000);
-		
+
 		t.start();
 		tree.update(l1, r1, x1);
 		hash ^= tree.query(l2, r2);
diff --git a/test/datastructures/pbds.cpp b/test/datastructures/pbds.cpp
deleted file mode 100644
index 9080332..0000000
--- a/test/datastructures/pbds.cpp
+++ /dev/null
@@ -1,11 +0,0 @@
-#include "../util.h"
-#include <datastructures/pbds.cpp>
-
-int main() {
-	Tree<int> t1, t2;
-	swap(t1, t2);
-	hashSet<int> s1, s2;
-	swap(s1, s2);
-	hashMap<int, int> m1, m2;
-	swap(m1, m2);
-}
-\ No newline at end of file
diff --git a/test/datastructures/sparseTable.cpp b/test/datastructures/sparseTable.cpp
index 7577694..2cfded9 100644
--- a/test/datastructures/sparseTable.cpp
+++ b/test/datastructures/sparseTable.cpp
@@ -8,7 +8,7 @@ void stress_test() {
 		int n = Random::integer<int>(1, 100);
 		vector<ll> naive = Random::integers<ll>(n, -1000, 1000);
 		SparseTable st;
-		st.init(&naive);
+		st.init(naive);
 		for (int operations = 0; operations < 1000; operations++) {
 			queries++;
 			int l = Random::integer<int>(0, n+1);
@@ -31,12 +31,12 @@ void performance_test() {
 	vector<ll> naive = Random::integers<ll>(N, -1000, 1000);
 	t.start();
 	SparseTable st;
-	st.init(&naive);
+	st.init(naive);
 	t.stop();
 	hash_t hash = 0;
 	for (int operations = 0; operations < N; operations++) {
 		auto [l, r] = Random::pair<int>(0, N+1);
-		
+
 		t.start();
 		hash += st.queryIdempotent(l, r);
 		t.stop();
diff --git a/test/datastructures/sparseTableDisjoint.cpp b/test/datastructures/sparseTableDisjoint.cpp
index 77bb005..258f4db 100644
--- a/test/datastructures/sparseTableDisjoint.cpp
+++ b/test/datastructures/sparseTableDisjoint.cpp
@@ -7,7 +7,7 @@ void stress_test() {
 		int n = Random::integer<int>(1, 100);
 		vector<ll> naive = Random::integers<ll>(n, -1000, 1000);
 		DisjointST st;
-		st.init(&naive);
+		st.init(naive);
 		for (int operations = 0; operations < 1000; operations++) {
 			queries++;
 			int l = Random::integer<int>(0, n+1);
@@ -28,12 +28,12 @@ void performance_test() {
 	vector<ll> naive = Random::integers<ll>(N, -1000, 1000);
 	t.start();
 	DisjointST st;
-	st.init(&naive);
+	st.init(naive);
 	t.stop();
 	hash_t hash = 0;
 	for (int operations = 0; operations < N; operations++) {
 		auto [l, r] = Random::pair<int>(0, N+1);
-		
+
 		t.start();
 		hash += st.query(l, r);
 		t.stop();
diff --git a/test/datastructures/stlHashMap.cpp b/test/datastructures/stlHashMap.cpp
deleted file mode 100644
index 77976fd..0000000
--- a/test/datastructures/stlHashMap.cpp
+++ /dev/null
@@ -1,4 +0,0 @@
-#include "../util.h"
-#include <datastructures/stlHashMap.cpp>
-
-int main() {}
-\ No newline at end of file
diff --git a/test/datastructures/stlTree.cpp b/test/datastructures/stlTree.cpp
deleted file mode 100644
index 7bacbee..0000000
--- a/test/datastructures/stlTree.cpp
+++ /dev/null
@@ -1,2 +0,0 @@
-#include "../util.h"
-#include <datastructures/stlTree.cpp>