1 module Array = ArrayLabels
8 val set : ('k, 'v) t -> k:'k -> v:'v -> ('k, 'v) t
10 val get : ('k, 'v) t -> k:'k -> 'v option
12 val member : ('k, 'v) t -> k:'k -> bool
15 module BinaryTree : TREE = struct
17 | Node of 'k * 'v * ('k, 'v) t * ('k, 'v) t
24 | Leaf -> Node (k, v, Leaf, Leaf)
25 | Node (k', v', l, r) when k < k' -> Node (k', v', set l ~k ~v, r)
26 | Node (k', v', l, r) when k > k' -> Node (k', v', l, set r ~k ~v)
27 | Node (k, _, l, r) -> Node (k, v, l, r)
32 | Node (k', _, l, _) when k < k' -> get l ~k
33 | Node (k', _, _, r) when k > k' -> get r ~k
34 | Node (_, v, _, _) -> Some v
39 | Node (k', _, l, _) when k < k' -> member l ~k
40 | Node (k', _, _, r) when k > k' -> member r ~k
45 let tree_a = BinaryTree.empty in
46 let tree_a = BinaryTree.set tree_a ~k:"k1" ~v:"v1" in
47 let tree_a = BinaryTree.set tree_a ~k:"k2" ~v:"v2" in
48 assert (BinaryTree.member tree_a ~k:"k1");
49 assert (BinaryTree.member tree_a ~k:"k2");
50 assert (Some "v1" = BinaryTree.get tree_a ~k:"k1");
51 assert (Some "v2" = BinaryTree.get tree_a ~k:"k2");
55 ~init:BinaryTree.empty
56 ~f:(fun t k -> BinaryTree.set t ~k ~v:())
58 Printf.printf "%B\n" (BinaryTree.member tree_b ~k:"a")