Standardized tests for data structures (#84)

Author: Chillee

fuzz-tests/data-structures/FenwickTree2d.cpp

@@ -41,4 +41,5 @@ int main() {
 			}
 		}
 	}
+	cout<<"Tests passed!"<<endl;
 }

fuzz-tests/data-structures/LazySegmentTree.cpp

@@ -11,7 +11,6 @@ typedef pair<int, int> pii;
 typedef vector<int> vi;
 
 #include "../../content/data-structures/LazySegmentTree.h"
-// #include "../../content/data-structures/old.h"
 
 static unsigned R;
 int ra() {
@@ -53,5 +52,5 @@ int main() {
 			rep(k,i,j) v[k] = x;
 		}
 	}
-	exit(0);
+	cout<<"Tests passed"<<endl;
 }

fuzz-tests/data-structures/LineContainer.cpp

@@ -51,7 +51,7 @@ struct HullDynamic : public multiset<Line> { // will maintain upper hull for max
 };
 }
 
-int main2() {
+int test2() {
 	LineContainer mh;
 	const int K = 10;
 	ll x[K], v[K];
@@ -102,4 +102,6 @@ int main() {
 			assert(mh.query(x) == mh2.query(x));
 		}
 	}
+	test2();
+	cout<<"Tests passed!"<<endl;
 }

fuzz-tests/data-structures/LinkCutTree.cpp

@@ -14,41 +14,38 @@ typedef vector<int> vi;
 #include "../../content/data-structures/UnionFind.h"
 
 int main() {
-	int s = (int)time(0);
-	cout << s << endl;
-	srand(s);
-	for (;;) {
+	srand(2);
+	LinkCut lczero(0);
+	rep(it,0,10000) {
 		int N = rand() % 20 + 1;
-		rep(it,0,1000) {
-			LinkCut lc(N);
-			UF uf(N);
-			vector<pii> edges;
-			rep(it2,0,1000) {
-				int v = (rand() >> 4) & 3;
-				if (v == 0 && !edges.empty()) { // remove
-					int r = (rand() >> 4) % sz(edges);
-					pii ed = edges[r];
-					swap(edges[r], edges.back());
-					edges.pop_back();
-					if (rand() & 16)
-						lc.cut(ed.first, ed.second);
-					else
-						lc.cut(ed.second, ed.first);
+		LinkCut lc(N);
+		UF uf(N);
+		vector<pii> edges;
+		rep(it2,0,1000) {
+			int v = (rand() >> 4) & 3;
+			if (v == 0 && !edges.empty()) { // remove
+				int r = (rand() >> 4) % sz(edges);
+				pii ed = edges[r];
+				swap(edges[r], edges.back());
+				edges.pop_back();
+				if (rand() & 16)
+					lc.cut(ed.first, ed.second);
+				else
+					lc.cut(ed.second, ed.first);
+			} else {
+				int a = (rand() >> 4) % N;
+				int b = (rand() >> 4) % N;
+				uf.e.assign(N, -1);
+				trav(ed, edges) uf.join(ed.first, ed.second);
+				bool c = uf.same_set(a, b);
+				if (!c && v != 1) {
+					lc.link(a, b);
+					edges.emplace_back(a, b);
 				} else {
-					int a = (rand() >> 4) % N;
-					int b = (rand() >> 4) % N;
-					uf.e.assign(N, -1);
-					trav(ed, edges) uf.join(ed.first, ed.second);
-					bool c = uf.same_set(a, b);
-					if (!c && v != 1) {
-						lc.link(a, b);
-						edges.emplace_back(a, b);
-					} else {
-						assert(lc.connected(a, b) == c);
-					}
+					assert(lc.connected(a, b) == c);
 				}
 			}
 		}
-		clog << '.';
 	}
+	cout<<"Tests passed!"<<endl;
 }

fuzz-tests/data-structures/RMQ.cpp

@@ -25,4 +25,5 @@ int main() {
 			assert(n == m);
 		}
 	}
+	cout<<"Tests passed!"<<endl;
 }

fuzz-tests/data-structures/SegmentTree.cpp

@@ -120,6 +120,5 @@ int main() {
 			}
 		}
 	}
-
-	exit(0);
+	cout<<"Tests passed!"<<endl;
 }

fuzz-tests/data-structures/Treap.cpp

@@ -83,4 +83,5 @@ int main() {
 		});
 		// cerr << endl;
 	}
+	cout<<"Tests passed!"<<endl;
 }