diff options
| author | Andreas Grois <andi@grois.info> | 2024-08-25 22:48:10 +0200 |
|---|---|---|
| committer | Andreas Grois <andi@grois.info> | 2024-08-25 22:48:10 +0200 |
| commit | e47e4b79142bcee5bcdc4647dc71c7ce3954cf0b (patch) | |
| tree | 3995eda489d8abe05329c0f7c1640d79da57cc10 /TODO | |
| parent | a067c3ad82441726543b739e4b57b9a3018f9416 (diff) | |
indexOfNoneImpPredFalse
Diffstat (limited to 'TODO')
| -rw-r--r-- | TODO | 1 |
1 files changed, 1 insertions, 0 deletions
@@ -9,6 +9,7 @@ This is a rough outline of upcoming tasks: [x] This automatically serves as a proof for CompleteTree.heapRemoveLast, once it is shown that they yield the same tree - Done by showing how indices relate between both trees. +[x] Prove that if CompleteTree.indexOf returns none, no index exists for which the predicate is true. [ ] Prove that if CompleteTree.indexOf returns some, CompleteTree.get with that result fulfills the predicate. [x] Prove that CompleteTree.heapUpdateRoot indeed exchanges the value at the root. - Done by showing that the new tree contains all elements except the root, and the updated value. |
