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>

1 files changed, 0 insertions, 72 deletions

diff --git a/string/suffixTree.cpp b/string/suffixTree.cpp
deleted file mode 100644
index caeeecf..0000000
--- a/string/suffixTree.cpp
+++ /dev/null
@@ -1,72 +0,0 @@
-struct SuffixTree {
-	struct Vert {
-		int start, end, suf;
-		map<char, int> next;
-	};
-	string s;
-	int needsSuffix, pos, remainder, curVert, curEdge, curLen;
-	// Each Vertex gives its children range as [start, end)
-	vector<Vert> tree = {Vert{-1, -1, 0 {}}};
-
-	SuffixTree(const string& s) : s(s) {
-		needsSuffix = remainder = curVert = curEdge = curLen = 0;
-		pos = -1;
-		for (int i = 0; i < sz(s); i++) extend();
-	}
-
-	int newVert(int start, int end) {
-		tree.push_back({start, end, 0, {}});
-		return sz(tree) - 1;
-	}
-
-	void addSuffixLink(int vert) {
-		if (needsSuffix) tree[needsSuffix].suf = vert;
-		needsSuffix = vert;
-	}
-
-	bool fullImplicitEdge(int vert) {
-		len = min(tree[vert].end, pos + 1) - tree[vert].start;
-		if (curLen >= len) {
-			curEdge += len;
-			curLen -= len;
-			curVert = vert;
-			return true;
-		} else {
-			return false;
-	}}
-
-	void extend() {
-		pos++;
-		needsSuffix = 0;
-		remainder++;
-		while (remainder) {
-			if (curLen == 0) curEdge = pos;
-			if (!tree[curVert].next.count(s[curEdge])) {
-				int leaf = newVert(pos, sz(s));
-				tree[curVert].next[s[curEdge]] = leaf;
-				addSuffixLink(curVert);
-			} else {
-				int nxt = tree[curVert].next[s[curEdge]];
-				if (fullImplicitEdge(nxt)) continue;
-				if (s[tree[nxt].start + curLen] == s[pos]) {
-					curLen++;
-					addSuffixLink(curVert);
-					break;
-				}
-				int split = newVert(tree[nxt].start,
-				                    tree[nxt].start + curLen);
-				tree[curVert].next[s[curEdge]] = split;
-				int leaf = newVert(pos, sz(s));
-				tree[split].next[s[pos]] = leaf;
-				tree[nxt].start += curLen;
-				tree[split].next[s[tree[nxt].start]] = nxt;
-				addSuffixLink(split);
-			}
-			remainder--;
-			if (curVert == 0 && curLen) {
-				curLen--;
-				curEdge = pos - remainder + 1;
-			} else {
-				curVert = tree[curVert].suf ? tree[curVert].suf : 0;
-	}}}
-};
\ No newline at end of file