| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Fix compilation with Lean 4.10. | Andreas Grois | 2024-08-13 | 9 | -102/+92 |
| | | |||||
| * | heapPopOnlyRemovesRoot is finally done | Andreas Grois | 2024-08-13 | 3 | -566/+83 |
| | | |||||
| * | Finish heapRemoveLastWithIndexRelation. That was a piece of work... | Andreas Grois | 2024-08-12 | 1 | -22/+62 |
| | | |||||
| * | Start heapRemoveLastWithIndexRelationLt | Andreas Grois | 2024-08-12 | 1 | -1/+51 |
| | | |||||
| * | Continue heapRemoveLastWithIndexRelation. | Andreas Grois | 2024-08-11 | 4 | -6/+19 |
| | | | | | Case for index equal removed index. | ||||
| * | Finish heapRemoveLastWithIndexRelationGt | Andreas Grois | 2024-08-11 | 2 | -52/+84 |
| | | | | | | | and optimize it a bit. All that omega and simp was really increasing compilation time... So, a lot of smaller proofs in that function are now done by hand instead. | ||||
| * | Continue heapRemoveLastWithIndexRelationGt | Andreas Grois | 2024-08-10 | 2 | -23/+84 |
| | | |||||
| * | continue heapRemoveLastWithIndexRelationGt | Andreas Grois | 2024-08-10 | 1 | -10/+23 |
| | | |||||
| * | Continue on heapRemoveLastWithIndexRelation | Andreas Grois | 2024-08-09 | 4 | -12/+40 |
| | | |||||
| * | First branch of heapRemoveLastWithIndexRelationGt | Andreas Grois | 2024-08-09 | 1 | -5/+19 |
| | | |||||
| * | heapRemoveLastWithIndexRelation - continued | Andreas Grois | 2024-08-08 | 2 | -54/+89 |
| | | |||||
| * | Minor | Andreas Grois | 2024-08-08 | 1 | -0/+6 |
| | | |||||
| * | Unfinished heapPop proof work | Andreas Grois | 2024-08-08 | 2 | -0/+177 |
| | | |||||
| * | heapPopReturnsRoot | Andreas Grois | 2024-08-04 | 4 | -3/+29 |
| | | |||||
| * | Update TODO | Andreas Grois | 2024-08-04 | 1 | -19/+9 |
| | | |||||
| * | heapUpdateRootContainsUpdatedElement | Andreas Grois | 2024-08-04 | 1 | -0/+38 |
| | | |||||
| * | Finish heapUpdateRootOnlyUpdtesRoot. | Andreas Grois | 2024-08-04 | 1 | -5/+37 |
| | | |||||
| * | Continue heapUpdateRootOnlyUpdatesRoot | Andreas Grois | 2024-08-04 | 1 | -1/+12 |
| | | |||||
| * | Continue HeapUpdateRootOnlyUpdatesRoot. Left side finished. | Andreas Grois | 2024-08-04 | 2 | -6/+79 |
| | | |||||
| * | Oops | Andreas Grois | 2024-08-03 | 1 | -0/+48 |
| | | |||||
| * | Partial proof that HeapUpdateRoot only changes the root. | Andreas Grois | 2024-08-03 | 2 | -1/+2 |
| | | |||||
| * | Proves about heapRemoveLast. | Andreas Grois | 2024-08-02 | 2 | -3/+93 |
| | | |||||
| * | Split AdditionalProofs into several files. | Andreas Grois | 2024-08-01 | 3 | -827/+826 |
| | | |||||
| * | Split HeapProofs into several smaller files. | Andreas Grois | 2024-07-31 | 9 | -687/+702 |
| | | |||||
| * | Update TODO file | Andreas Grois | 2024-07-30 | 1 | -6/+3 |
| | | |||||
| * | Finish heapRemoveLastWithIndexOnlyRemovesOneElement. | Andreas Grois | 2024-07-30 | 1 | -8/+130 |
| | | | | | | It could use some cleanup though. Compiling it takes quite long already... | ||||
| * | Minor progress on heapRemoveLastWithIndexOnlyRemovesOneElement | Andreas Grois | 2024-07-30 | 1 | -5/+109 |
| | | |||||
| * | Finish left half of heapRemoveLastWithIndexOnlyRemovesOneElement. | Andreas Grois | 2024-07-28 | 1 | -30/+69 |
| | | |||||
| * | Continue heapRemoveLastWithIndexOnlyRemovesOneElement. Progress! | Andreas Grois | 2024-07-28 | 2 | -28/+19 |
| | | |||||
| * | Minor, some trial and error. | Andreas Grois | 2024-07-28 | 2 | -8/+59 |
| | | |||||
| * | Continue heapRemoveLastWithIndexOnlyRemovesOneElement. | Andreas Grois | 2024-07-28 | 1 | -11/+35 |
| | | | | | One of 4 branches done. | ||||
| * | Continue on heapRemoveLastWithIndexOnlyRemovesOneElement. | Andreas Grois | 2024-07-28 | 1 | -22/+53 |
| | | |||||
| * | Progress? | Andreas Grois | 2024-07-27 | 1 | -3/+34 |
| | | |||||
| * | Continue heapRemoveLastWithIndexOnlyRemovesOneElement | Andreas Grois | 2024-07-27 | 2 | -14/+109 |
| | | |||||
| * | Partial implementation of heapRemoveLastWithIndexOnlyRemovesOneElement | Andreas Grois | 2024-07-26 | 5 | -12/+79 |
| | | |||||
| * | Finish contains_iff_index_exists | Andreas Grois | 2024-07-25 | 2 | -10/+92 |
| | | |||||
| * | Start contains_iff_index_exists implementation. Unfinished. | Andreas Grois | 2024-07-24 | 6 | -35/+190 |
| | | |||||
| * | Fix performance issue in CompleteTree.contains. | Andreas Grois | 2024-07-24 | 1 | -6/+7 |
| | | |||||
| * | Minor: Fix indentation. Sorry. | Andreas Grois | 2024-07-24 | 1 | -12/+12 |
| | | |||||
| * | Add CompleteTree.contains. Decidable Predicate. | Andreas Grois | 2024-07-24 | 1 | -0/+28 |
| | | | | | This is a preparation step for additional proofs. | ||||
| * | Add CompleteTree/AdditionalOperations.lean for non-heap operations. | Andreas Grois | 2024-07-23 | 4 | -48/+53 |
| | | |||||
| * | Split code in multiple source files. Separate proofs and logic. | Andreas Grois | 2024-07-23 | 9 | -1148/+1220 |
| | | |||||
| * | Add GetElem instances. | Andreas Grois | 2024-07-22 | 2 | -14/+43 |
| | | |||||
| * | Initial commit. | Andreas Grois | 2024-07-22 | 11 | -0/+1543 |
