section \<open>2-3 Tree Implementation of Maps\<close>
theory Tree23_Map imports
Tree23_Set
Map_Specs begin
fun lookup :: "('a::linorder * 'b) tree23 \ 'a \ 'b option" where "lookup Leaf x = None" | "lookup (Node2 l (a,b) r) x = (case cmp x a of
LT \<Rightarrow> lookup l x |
GT \<Rightarrow> lookup r x |
EQ \<Rightarrow> Some b)" | "lookup (Node3 l (a1,b1) m (a2,b2) r) x = (case cmp x a1 of
LT \<Rightarrow> lookup l x |
EQ \<Rightarrow> Some b1 |
GT \<Rightarrow> (case cmp x a2 of
LT \<Rightarrow> lookup m x |
EQ \<Rightarrow> Some b2 |
GT \<Rightarrow> lookup r x))"
fun upd :: "'a::linorder \ 'b \ ('a*'b) tree23 \ ('a*'b) up\<^sub>i" where "upd x y Leaf = Of Leaf (x,y) Leaf" | "upd x y (Node2 l ab r) = (case cmp x (fst ab) of
LT \<Rightarrow> (case upd x y l of
Eq\<^sub>i l' => Eq\<^sub>i (Node2 l' ab r)
| Of l1 ab' l2 => Eq\<^sub>i (Node3 l1 ab' l2 ab r)) |
EQ \<Rightarrow> Eq\<^sub>i (Node2 l (x,y) r) |
GT \<Rightarrow> (case upd x y r of
Eq\<^sub>i r' => Eq\<^sub>i (Node2 l ab r')
| Of r1 ab' r2 => Eq\<^sub>i (Node3 l ab r1 ab' r2)))" | "upd x y (Node3 l ab1 m ab2 r) = (case cmp x (fst ab1) of
LT \<Rightarrow> (case upd x y l of
Eq\<^sub>i l' => Eq\<^sub>i (Node3 l' ab1 m ab2 r)
| Of l1 ab' l2 => Of (Node2 l1 ab' l2) ab1 (Node2 m ab2 r)) |
EQ \<Rightarrow> Eq\<^sub>i (Node3 l (x,y) m ab2 r) |
GT \<Rightarrow> (case cmp x (fst ab2) of
LT \<Rightarrow> (case upd x y m of
Eq\<^sub>i m' => Eq\<^sub>i (Node3 l ab1 m' ab2 r)
| Of m1 ab' m2 => Of (Node2 l ab1 m1) ab' (Node2 m2 ab2 r)) |
EQ \<Rightarrow> Eq\<^sub>i (Node3 l ab1 m (x,y) r) |
GT \<Rightarrow> (case upd x y r of
Eq\<^sub>i r' => Eq\<^sub>i (Node3 l ab1 m ab2 r')
| Of r1 ab' r2 => Of (Node2 l ab1 m) ab2 (Node2 r1 ab' r2))))"
definition update :: "'a::linorder \ 'b \ ('a*'b) tree23 \ ('a*'b) tree23" where "update a b t = tree\<^sub>i(upd a b t)"
fun del :: "'a::linorder \ ('a*'b) tree23 \ ('a*'b) up\<^sub>d" where "del x Leaf = Eq\<^sub>d Leaf" | "del x (Node2 Leaf ab1 Leaf) = (if x=fst ab1 then Uf Leaf else Eq\<^sub>d(Node2 Leaf ab1 Leaf))" | "del x (Node3 Leaf ab1 Leaf ab2 Leaf) = Eq\<^sub>d(if x=fst ab1 then Node2 Leaf ab2 Leaf
else if x=fst ab2 then Node2 Leaf ab1 Leaf else Node3 Leaf ab1 Leaf ab2 Leaf)" | "del x (Node2 l ab1 r) = (case cmp x (fst ab1) of
LT \<Rightarrow> node21 (del x l) ab1 r |
GT \<Rightarrow> node22 l ab1 (del x r) |
EQ \<Rightarrow> let (ab1',t) = split_min r in node22 l ab1' t)" | "del x (Node3 l ab1 m ab2 r) = (case cmp x (fst ab1) of
LT \<Rightarrow> node31 (del x l) ab1 m ab2 r |
EQ \<Rightarrow> let (ab1',m') = split_min m in node32 l ab1' m' ab2 r |
GT \<Rightarrow> (case cmp x (fst ab2) of
LT \<Rightarrow> node32 l ab1 (del x m) ab2 r |
EQ \<Rightarrow> let (ab2',r') = split_min r in node33 l ab1 m ab2' r' |
GT \<Rightarrow> node33 l ab1 m ab2 (del x r)))"
definition delete :: "'a::linorder \ ('a*'b) tree23 \ ('a*'b) tree23" where "delete x t = tree\<^sub>d(del x t)"
subsection \<open>Functional Correctness\<close>
lemma lookup_map_of: "sorted1(inorder t) \ lookup t x = map_of (inorder t) x" by (induction t) (auto simp: map_of_simps split: option.split)
lemma inorder_upd: "sorted1(inorder t) \ inorder(tree\<^sub>i(upd x y t)) = upd_list x y (inorder t)" by(induction t) (auto simp: upd_list_simps split: up\<^sub>i.splits)
corollary inorder_update: "sorted1(inorder t) \ inorder(update x y t) = upd_list x y (inorder t)" by(simp add: update_def inorder_upd)
lemma inorder_del: "\ complete t ; sorted1(inorder t) \ \
inorder(tree\<^sub>d (del x t)) = del_list x (inorder t)" by(induction t rule: del.induct)
(auto simp: del_list_simps inorder_nodes split_minD split!: if_split prod.splits)
corollary inorder_delete: "\ complete t ; sorted1(inorder t) \ \
inorder(delete x t) = del_list x (inorder t)" by(simp add: delete_def inorder_del)
subsection \<open>Balancedness\<close>
lemma complete_upd: "complete t \ complete (tree\<^sub>i(upd x y t)) \ h\<^sub>i(upd x y t) = height t" by (induct t) (auto split!: if_split up\<^sub>i.split)(* 16 secs in 2015 *)
corollary complete_update: "complete t \ complete (update x y t)" by (simp add: update_def complete_upd)
lemma height_del: "complete t \ h\<^sub>d(del x t) = height t" by(induction x t rule: del.induct)
(auto simp add: heights max_def height_split_min split: prod.split)
lemma complete_tree\<^sub>d_del: "complete t \<Longrightarrow> complete(tree\<^sub>d(del x t))" by(induction x t rule: del.induct)
(auto simp: completes complete_split_min height_del height_split_min split: prod.split)
corollary complete_delete: "complete t \ complete(delete x t)" by(simp add: delete_def complete_tree\<^sub>d_del)
subsection \<open>Overall Correctness\<close>
interpretation M: Map_by_Ordered where empty = empty and lookup = lookup and update = update and delete = delete and inorder = inorder and inv = complete proof (standard, goal_cases) case 1 thus ?caseby(simp add: empty_def) next case 2 thus ?caseby(simp add: lookup_map_of) next case 3 thus ?caseby(simp add: inorder_update) next case 4 thus ?caseby(simp add: inorder_delete) next case 5 thus ?caseby(simp add: empty_def) next case 6 thus ?caseby(simp add: complete_update) next case 7 thus ?caseby(simp add: complete_delete) qed
end
¤ Dauer der Verarbeitung: 0.22 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
