summaryrefslogtreecommitdiff
path: root/Common
Commit message (Expand)AuthorAgeFilesLines
...
* CompleteTree.popLastIsHeap finished.Andreas Grois2024-06-291-2/+14
* Continue on popLast proof. popLastLeavesRoot finished.Andreas Grois2024-06-281-13/+59
* Continue on popLast validity proof. Still incomplete.Andreas Grois2024-06-271-5/+57
* Heap: Trivial part of popLastIsHeap proof.Andreas Grois2024-03-311-0/+16
* Make BinaryTree.PopLast function work with unfoldAndreas Grois2024-01-301-32/+34
* Make Find function take a predicate. Simplify PopLast.Andreas Grois2024-01-251-27/+26
* Minor, rename wellDefinedLt to wellDefinedLeAndreas Grois2024-01-131-4/+4
* Change heap from less-than to less-than-or-equal.Andreas Grois2024-01-131-148/+83
* Fix Heap Insert preserves Heap Proof. Preconditions were wrong.Andreas Grois2024-01-131-18/+59
* Rename not_equal to antisymm, because that's what it is.Andreas Grois2024-01-101-7/+7
* (Finally) rename BalancedTree to CompleteTreeAndreas Grois2024-01-101-52/+52
* Implement actual BinaryHeap.insert function.Andreas Grois2024-01-101-0/+6
* Proof that heap insert preserves a heap is done!Andreas Grois2024-01-101-3/+73
* Heap.insert: Insert-Left is proven now.Andreas Grois2024-01-101-7/+45
* More progress on heap.insert proofAndreas Grois2024-01-091-8/+25
* Further progress on heap insert proof.Andreas Grois2024-01-081-12/+10
* Progress on the proof that heap.insert keeps the heap intact.Andreas Grois2024-01-081-0/+17
* Unfinished proof that insert keeps heap a heapAndreas Grois2024-01-051-31/+99
* Even more cleanup in HeapAndreas Grois2023-12-182-6/+6
* More cleanup of code in BinaryHeap.Andreas Grois2023-12-182-55/+61
* Partial cleanup of HeapAndreas Grois2023-12-182-119/+118
* Heap now has balancing conditions completeAndreas Grois2023-12-181-18/+174
* Heap: At least one subtree needs to be perfect now.Andreas Grois2023-12-151-13/+113
* Rename file to BinaryHeap, as it isn't a BTreeAndreas Grois2023-12-131-29/+29
* BinTreeHeap: Add condition le m nAndreas Grois2023-12-121-19/+51
* Incomplete Heap implementation.Andreas Grois2023-12-111-0/+140
* Day 8 Part 2Andreas Grois2023-12-092-13/+11
* Day 7Andreas Grois2023-12-083-0/+27
* Day 6Andreas Grois2023-12-071-0/+4
* Allow error messages in parsing (for debugging)Andreas Grois2023-12-071-1/+1
* Day5, part 1Andreas Grois2023-12-061-5/+7
* Day 3Andreas Grois2023-12-032-1/+29
* Quicksort. Might be useful later.Andreas Grois2023-12-031-0/+24
* Day 2Andreas Grois2023-12-021-0/+4
* Day 1Andreas Grois2023-12-013-0/+21