From 4dca559b1a7d4ad6b104bec3f0d909cb68259fe4 Mon Sep 17 00:00:00 2001
From: Aria Shrimpton <me@aria.rip>
Date: Sun, 10 Mar 2024 18:39:02 +0000
Subject: more writing

---
 thesis/parts/results.tex | 1 -
 1 file changed, 1 deletion(-)

(limited to 'thesis/parts/results.tex')

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.
 
-- 
cgit v1.2.3

