aboutsummaryrefslogtreecommitdiff
path: root/TODO
diff options
context:
space:
mode:
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.