124 lines
3.2 KiB
OCaml
124 lines
3.2 KiB
OCaml
|
module M = Map.Make(struct type t = int let compare = compare end)
|
||
|
|
|
||
|
|
let img x m = try Some(M.find x m) with Not_found -> None
|
||
|
|
|
||
|
|
let testvals = [0;1;2;3;4;5;6;7;8;9]
|
||
|
|
|
||
|
|
let check msg cond =
|
||
|
|
if not (List.for_all cond testvals) then
|
||
|
|
Printf.printf "Test %s FAILED\n%!" msg
|
||
|
|
|
||
|
|
let checkbool msg b =
|
||
|
|
if not b then
|
||
|
|
Printf.printf "Test %s FAILED\n%!" msg
|
||
|
|
|
||
|
|
let uncurry (f: 'a -> 'b -> 'c) (x, y: 'a * 'b) : 'c = f x y
|
||
|
|
|
||
|
|
let test x v s1 s2 =
|
||
|
|
|
||
|
|
checkbool "is_empty"
|
||
|
|
(M.is_empty s1 = List.for_all (fun i -> img i s1 = None) testvals);
|
||
|
|
|
||
|
|
check "mem"
|
||
|
|
(fun i -> M.mem i s1 = (img i s1 <> None));
|
||
|
|
|
||
|
|
check "add"
|
||
|
|
(let s = M.add x v s1 in
|
||
|
|
fun i -> img i s = (if i = x then Some v else img i s1));
|
||
|
|
|
||
|
|
check "singleton"
|
||
|
|
(let s = M.singleton x v in
|
||
|
|
fun i -> img i s = (if i = x then Some v else None));
|
||
|
|
|
||
|
|
check "remove"
|
||
|
|
(let s = M.remove x s1 in
|
||
|
|
fun i -> img i s = (if i = x then None else img i s1));
|
||
|
|
|
||
|
|
check "merge-union"
|
||
|
|
(let f _ o1 o2 =
|
||
|
|
match o1, o2 with
|
||
|
|
| Some v1, Some v2 -> Some (v1 +. v2)
|
||
|
|
| None, _ -> o2
|
||
|
|
| _, None -> o1 in
|
||
|
|
let s = M.merge f s1 s2 in
|
||
|
|
fun i -> img i s = f i (img i s1) (img i s2));
|
||
|
|
|
||
|
|
check "merge-inter"
|
||
|
|
(let f _ o1 o2 =
|
||
|
|
match o1, o2 with
|
||
|
|
| Some v1, Some v2 -> Some (v1 -. v2)
|
||
|
|
| _, _ -> None in
|
||
|
|
let s = M.merge f s1 s2 in
|
||
|
|
fun i -> img i s = f i (img i s1) (img i s2));
|
||
|
|
|
||
|
|
checkbool "bindings"
|
||
|
|
(let rec extract = function
|
||
|
|
| [] -> []
|
||
|
|
| hd :: tl ->
|
||
|
|
match img hd s1 with
|
||
|
|
| None -> extract tl
|
||
|
|
| Some v ->(hd, v) :: extract tl in
|
||
|
|
M.bindings s1 = extract testvals);
|
||
|
|
|
||
|
|
checkbool "for_all"
|
||
|
|
(let p x y = x mod 2 = 0 in
|
||
|
|
M.for_all p s1 = List.for_all (uncurry p) (M.bindings s1));
|
||
|
|
|
||
|
|
checkbool "exists"
|
||
|
|
(let p x y = x mod 3 = 0 in
|
||
|
|
M.exists p s1 = List.exists (uncurry p) (M.bindings s1));
|
||
|
|
|
||
|
|
checkbool "filter"
|
||
|
|
(let p x y = x >= 3 && x <= 6 in
|
||
|
|
M.bindings(M.filter p s1) = List.filter (uncurry p) (M.bindings s1));
|
||
|
|
|
||
|
|
checkbool "partition"
|
||
|
|
(let p x y = x >= 3 && x <= 6 in
|
||
|
|
let (st,sf) = M.partition p s1
|
||
|
|
and (lt,lf) = List.partition (uncurry p) (M.bindings s1) in
|
||
|
|
M.bindings st = lt && M.bindings sf = lf);
|
||
|
|
|
||
|
|
checkbool "cardinal"
|
||
|
|
(M.cardinal s1 = List.length (M.bindings s1));
|
||
|
|
|
||
|
|
checkbool "min_binding"
|
||
|
|
(try
|
||
|
|
let (k,v) = M.min_binding s1 in
|
||
|
|
img k s1 = Some v && M.for_all (fun i _ -> k <= i) s1
|
||
|
|
with Not_found ->
|
||
|
|
M.is_empty s1);
|
||
|
|
|
||
|
|
checkbool "max_binding"
|
||
|
|
(try
|
||
|
|
let (k,v) = M.max_binding s1 in
|
||
|
|
img k s1 = Some v && M.for_all (fun i _ -> k >= i) s1
|
||
|
|
with Not_found ->
|
||
|
|
M.is_empty s1);
|
||
|
|
|
||
|
|
checkbool "choose"
|
||
|
|
(try
|
||
|
|
let (x,v) = M.choose s1 in img x s1 = Some v
|
||
|
|
with Not_found ->
|
||
|
|
M.is_empty s1);
|
||
|
|
|
||
|
|
check "split"
|
||
|
|
(let (l, p, r) = M.split x s1 in
|
||
|
|
fun i ->
|
||
|
|
if i < x then img i l = img i s1
|
||
|
|
else if i > x then img i r = img i s1
|
||
|
|
else p = img i s1)
|
||
|
|
|
||
|
|
let rkey() = Random.int 10
|
||
|
|
|
||
|
|
let rdata() = Random.float 1.0
|
||
|
|
|
||
|
|
let rmap() =
|
||
|
|
let s = ref M.empty in
|
||
|
|
for i = 1 to Random.int 10 do s := M.add (rkey()) (rdata()) !s done;
|
||
|
|
!s
|
||
|
|
|
||
|
|
let _ =
|
||
|
|
Random.init 42;
|
||
|
|
for i = 1 to 25000 do test (rkey()) (rdata()) (rmap()) (rmap()) done
|
||
|
|
|