aboutsummaryrefslogtreecommitdiff
path: root/thesis
diff options
context:
space:
mode:
Diffstat (limited to 'thesis')
-rw-r--r--thesis/parts/implementation.tex9
1 files changed, 5 insertions, 4 deletions
diff --git a/thesis/parts/implementation.tex b/thesis/parts/implementation.tex
index 706dbd5..7af691e 100644
--- a/thesis/parts/implementation.tex
+++ b/thesis/parts/implementation.tex
@@ -19,8 +19,6 @@ Table \ref{table:library} shows the library of container types we used.
Most come from the Rust standard library, with the exceptions of \code{SortedVec} and \code{SortedUniqueVec}, which use \code{Vec} internally.
The library source can be found in \code{src/crates/library}.
-\todo{This might be expanded}
-
\begin{table}[h]
\centering
\begin{tabular}{|c|c|c|}
@@ -28,8 +26,11 @@ The library source can be found in \code{src/crates/library}.
\hline
\code{LinkedList} & Doubly-linked list \\
\code{Vec} & Contiguous growable array \\
+ \code{VecSet} & Vec with no duplicates \\
+ \code{VecMap} & A Vec of (K, V) tuples, used as a Mapping \\
\code{SortedVec} & Vec kept in sorted order \\
- \code{SortedUniqueVec} & Vec kept in sorted order, with no duplicates \\
+ \code{SortedVecSet} & Vec kept in sorted order, with no duplicates \\
+ \code{VecMap} & A Vec of (K, V) tuples sorted by key, used as a Mapping \\
\code{HashMap} & Hash map with quadratic probing \\
\code{HashSet} & Hash map with empty values \\
\code{BTreeMap} & B-Tree\citep{bayer_organization_1970} map with linear search. \\
@@ -39,7 +40,7 @@ The library source can be found in \code{src/crates/library}.
\label{table:library}
\end{table}
-We also added new syntax to the language to support defining properties that only make sense for mappings (\code{dictProperty}), however this was unused.
+We also added new syntax to Primrose's domain-specific language to support defining properties that only make sense for mappings (\code{dictProperty}), however this was unused.
%% Resiliency, etc
While performing integration testing, we found and fixed several other issues with the existing code: