blob: b729dabc212d66ba8039a88e73a345ddc7c9e361 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
|
import AvlVerification.Tree
import AvlVerification.BinarySearchTree
import AvlVerification.Specifications
namespace Implementation
open Primitives
open avl_verification
open Tree (AVLTree AVLTree.set)
open Specifications (OrdSpecDualityEq ordOfOrdSpec ltOfRustOrder gtOfRustOrder)
variable (T: Type) (H: avl_verification.Ord T) (Ospec: @OrdSpecDualityEq T H)
@[pspec]
def AVLTreeSet.find_loop_spec
(a: T) (t: Option (AVLNode T)):
BST.Invariant t -> a ∈ AVLTree.set t -> AVLTreeSet.find_loop _ H a t = Result.ok true := fun Hbst Hmem => by
match t with
| none => trivial
| some (AVLNode.mk b left right) =>
rw [AVLTreeSet.find_loop]
dsimp only
have : ∀ a b, ∃ o, H.cmp a b = .ok o := Ospec.infallible
progress keep Hordering as ⟨ ordering ⟩
cases ordering
all_goals dsimp only
. refine' AVLTreeSet.find_loop_spec a right (BST.right Hbst) _
-- b < a
-- Hbst fournit que a ∈ right
sorry
. refine' AVLTreeSet.find_loop_spec a left (BST.left Hbst) _
-- symmétrie du précédent.
sorry
def AVLTreeSet.find_spec
(a: T) (t: AVLTreeSet T):
BST.Invariant t.root -> a ∈ AVLTree.set t.root ->
t.find _ H a = Result.ok true := fun Hbst Hmem => by
rw [AVLTreeSet.find]; progress
end Implementation
|
