aboutsummaryrefslogtreecommitdiff
path: root/TODO
diff options
context:
space:
mode:
authorAndreas Grois <andi@grois.info>2024-08-31 00:05:44 +0200
committerAndreas Grois <andi@grois.info>2024-08-31 00:05:44 +0200
commit79726a8a669ff879db4ae14b8e27af357dd7c7b7 (patch)
tree40773a8a948c7131b54abbc9f54607c1b1611c37 /TODO
parent30139d5f88eedeb16d0f41c6f7ee7cfc036fe2dc (diff)
Clean up indexOfAuxAddsCurrentIndex slightly.v0.1.0
Diffstat (limited to 'TODO')
-rw-r--r--TODO2
1 files changed, 1 insertions, 1 deletions
diff --git a/TODO b/TODO
index 5ad9eb6..3108a5d 100644
--- a/TODO
+++ b/TODO
@@ -10,7 +10,7 @@ This is a rough outline of upcoming tasks:
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 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.
[x] Prove that heapPop leaves all values in the tree, except the root.