From 8d11c6c8213f46f0fa19826917c255edd5d43cb1 Mon Sep 17 00:00:00 2001 From: mzuenni Date: Sun, 28 Jul 2024 22:54:40 +0200 Subject: 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 --- datastructures/datastructures.tex | 136 -------------------------------------- 1 file changed, 136 deletions(-) delete mode 100644 datastructures/datastructures.tex (limited to 'datastructures/datastructures.tex') diff --git a/datastructures/datastructures.tex b/datastructures/datastructures.tex deleted file mode 100644 index d35dfb0..0000000 --- a/datastructures/datastructures.tex +++ /dev/null @@ -1,136 +0,0 @@ -\section{Datenstrukturen} - -\begin{algorithm}{Segmentbaum} - \begin{methods} - \method{SegTree}{baut den Baum auf}{n} - \method{query}{findet Summe über [l, r)}{\log(n)} - \method{update}{ändert einen Wert}{\log(n)} - \end{methods} - \sourcecode{datastructures/segmentTree.cpp} - - \subsubsection{Lazy Propagation} - Assignment modifications, sum queries \\ - \method{lower\_bound}{erster Index in [l, r) $\geq$ x (erfordert max-combine)}{\log(n)} - \sourcecode{datastructures/lazyPropagation.cpp} -\end{algorithm} - -\begin{algorithm}{Wavelet Tree} - \begin{methods} - \method{Constructor}{baut den Baum auf}{n\*\log(n)} - \method{kth}{sort $[l, r)[k]$}{\log(n)} - \method{countSmaller}{Anzahl elemente in $[l, r)$ kleiner als $k$}{\log(n)} - \end{methods} - \sourcecode{datastructures/waveletTree.cpp} -\end{algorithm} -\columnbreak - -\begin{algorithm}{Fenwick Tree} - \begin{methods} - \method{init}{baut den Baum auf}{n\*\log(n)} - \method{prefix\_sum}{summe von [0, i]}{\log(n)} - \method{update}{addiert ein Delta zu einem Element}{\log(n)} - \end{methods} - \sourcecode{datastructures/fenwickTree.cpp} - - \begin{methods} - \method{init}{baut den Baum auf}{n\*\log(n)} - \method{prefix\_sum}{summe von [0, i]}{\log(n)} - \method{update}{addiert ein Delta zu allen Elementen [l, r)}{\log(n)} - \end{methods} - \sourcecode{datastructures/fenwickTree2.cpp} -\end{algorithm} - -\begin{algorithm}{STL-Rope (Implicit Cartesian Tree)} - \sourcecode{datastructures/stlRope.cpp} -\end{algorithm} -\columnbreak - -\begin{algorithm}{(Implicit) Treap (Cartesian Tree)} - \begin{methods} - \method{insert}{fügt wert $\mathit{val}$ an stelle $i$ ein (verschiebt alle Positionen >= $i$)}{\log(n)} - \method{remove}{löscht werte $[i,i+\mathit{count})$}{\log(n)} - \end{methods} - \sourcecode{datastructures/treap2.cpp} -\end{algorithm} - -\begin{algorithm}{Range Minimum Query} - \begin{methods} - \method{init}{baut Struktur auf}{n\*\log(n)} - \method{queryIdempotent}{Index des Minimums in [l, r)}{1} - \end{methods} - \begin{itemize} - \item \code{better}-Funktion muss idempotent sein! - \end{itemize} - \sourcecode{datastructures/sparseTable.cpp} -\end{algorithm} - -\begin{algorithm}{STL-Bitset} - \sourcecode{datastructures/bitset.cpp} -\end{algorithm} - -\begin{algorithm}{Link-Cut-Tree} - \begin{methods} - \method{Constructor}{baut Wald auf}{n} - \method{connected}{prüft ob zwei Knoten im selben Baum liegen}{\log(n)} - \method{link}{fügt $\{x,y\}$ Kante ein}{\log(n)} - \method{cut}{entfernt $\{x,y\}$ Kante}{\log(n)} - \method{lca}{berechnet LCA von $x$ und $y$}{\log(n)} - \method{query}{berechnet \code{query} auf den Knoten des $xy$-Pfades}{\log(n)} - \method{modify}{erhöht jeden wert auf dem $xy$-Pfad}{\log(n)} - \end{methods} - \sourcecode{datastructures/LCT.cpp} -\end{algorithm} -\clearpage - -\begin{algorithm}{Lichao} - \sourcecode{datastructures/lichao.cpp} -\end{algorithm} - -\begin{algorithm}{Policy Based Data Structures} - \textbf{Wichtig:} Verwende \code{p.swap(p2)} anstatt \code{swap(p, p2)}! - \sourcecode{datastructures/stlPriorityQueue.cpp} - \columnbreak - \sourcecode{datastructures/pbds.cpp} -\end{algorithm} - -\begin{algorithm}{Lower/Upper Envelope (Convex Hull Optimization)} - Um aus einem lower envelope einen upper envelope zu machen (oder umgekehrt), einfach beim Einfügen der Geraden $m$ und $b$ negieren. - \sourcecode{datastructures/monotonicConvexHull.cpp} - \sourcecode{datastructures/dynamicConvexHull.cpp} -\end{algorithm} - -\begin{algorithm}{Union-Find} - \begin{methods} - \method{init}{legt $n$ einzelne Unions an}{n} - \method{findSet}{findet den Repräsentanten}{\log(n)} - \method{unionSets}{vereint 2 Mengen}{\log(n)} - \method{m\*findSet + n\*unionSets}{Folge von Befehlen}{n+m\*\alpha(n)} - \end{methods} - \sourcecode{datastructures/unionFind.cpp} -\end{algorithm} -\columnbreak - -\begin{algorithm}{Persistent} - \begin{methods} - \method{get}{berechnet Wert zu Zeitpunkt $t$}{\log(t)} - \method{set}{ändert Wert zu Zeitpunkt $t$}{\log(t)} - \method{reset}{setzt die Datenstruktur auf Zeitpunkt $t$}{1} - \end{methods} - \sourcecode{datastructures/persistent.cpp} - \sourcecode{datastructures/persistentArray.cpp} -\end{algorithm} - -\begin{algorithm}[optional]{Range Minimum Query} - \begin{methods} - \method{init}{baut Struktur auf}{n\*\log(n)} - \method{query}{Index des Minimums in [l, r)}{1} - \end{methods} - \sourcecode{datastructures/RMQ.cpp} -\end{algorithm} - -\begin{algorithm}[optional]{Erste unbenutzte natürliche Zahl} - \begin{methods} - \method{get\_first\_unused}{findet kleinste unbenutzte Zahl}{\log(n)} - \end{methods} - \sourcecode{datastructures/firstUnused.cpp} -\end{algorithm} -- cgit v1.2.3