diff options
| author | Aria Shrimpton <me@aria.rip> | 2024-03-10 18:39:02 +0000 |
|---|---|---|
| committer | Aria Shrimpton <me@aria.rip> | 2024-03-10 18:39:02 +0000 |
| commit | 4dca559b1a7d4ad6b104bec3f0d909cb68259fe4 (patch) | |
| tree | 9d67e912f13ddb8d661c7f0915d9efd55c255245 /thesis/parts/results.tex | |
| parent | 6a08fd153587608d66a088bd5deee9eeee40c5c0 (diff) | |
more writing
Diffstat (limited to 'thesis/parts/results.tex')
| -rw-r--r-- | thesis/parts/results.tex | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/thesis/parts/results.tex b/thesis/parts/results.tex index 2e2373a..b07e581 100644 --- a/thesis/parts/results.tex +++ b/thesis/parts/results.tex @@ -28,7 +28,6 @@ To help readability, we group these into regular \code{Container} implementation \label{fig:cm_insert} \end{figure} - For \code{Vec}, we see that insertion is incredibly cheap, and gets slightly cheaper as the size of the container increases. This is to be expected, as Rust's Vector implementation grows by a multiple whenever it reaches its maximum capacity, so we would expect amortised inserts to require less resizes as $n$ increases. |