diff options
| author | Aria Shrimpton <me@aria.rip> | 2024-02-08 14:39:45 +0000 |
|---|---|---|
| committer | Aria Shrimpton <me@aria.rip> | 2024-02-08 14:39:45 +0000 |
| commit | e43fef5b73b74849e0f85df48a62b29be52534b3 (patch) | |
| tree | d50c4823cfcab02b21e8221891e537aebcc34a40 /thesis/parts/implementation.tex | |
| parent | 0c8a5fce0ceb51fcdce8e6307ee4d5e12fcb8a16 (diff) | |
some writing
Diffstat (limited to 'thesis/parts/implementation.tex')
| -rw-r--r-- | thesis/parts/implementation.tex | 4 |
1 files changed, 0 insertions, 4 deletions
diff --git a/thesis/parts/implementation.tex b/thesis/parts/implementation.tex index 884f675..f5d8d1f 100644 --- a/thesis/parts/implementation.tex +++ b/thesis/parts/implementation.tex @@ -34,13 +34,9 @@ on drop, creates new file in folder specified by env variable primrose results generated in \code{primrose::codegen}, which is called in \code{candelabra::profiler} picks the first valid candidate - performance doesn't really matter for this case each drop generates a file, so we get details of every individual collection allocated -\todo{immediately aggregate these into summary statistics, for speed} -\todo{mention benchmark repetition} estimate a cost for each candidate: op(avg\_n) * op\_times for each op pick the smallest one -\todo{update for nsplit stuff} -\todo{mention difficulties with lazy vecs} \todo{Caching} \todo{Other implementation details?} |