simon/ocaml-containers
1
0
Fork 0
mirror of https://github.com/c-cube/ocaml-containers.git synced 2025-12-06 11:15:31 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

use raw quickcheck test

Browse source
This commit is contained in:
Simon Cruanes 2015-09-15 12:26:02 +02:00
parent b12e7e7f8f
commit 4eb20ab3db
1 changed files with 11 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
src/data/CCWBTree.ml
View file

@ -447,17 +447,17 @@ module MakeFull(K : KEY) : S with type key = K.t = struct
let rl, o, rr = split k r in let rl, o, rr = split k r in
node_ k' v' l rl, o, rr node_ k' v' l rl, o, rr
(*$Q & ~small:List.length (*$QR & ~small:List.length ~count:20
Q.(list (pair small_int small_int)) ( fun lst -> \ Q.(list (pair small_int small_int)) ( fun lst ->
let lst = CCList.Set.uniq ~eq:(CCFun.compose_binop fst (=)) lst in \ let lst = CCList.sort_uniq ~cmp:(CCFun.compose_binop fst CCInt.compare) lst in
let m = M.of_list lst in \ let m = M.of_list lst in
List.for_all (fun (k,v) -> \ List.for_all (fun (k,v) ->
let l, v', r = M.split k m in \ let l, v', r = M.split k m in
v' = Some v \ v' = Some v
&& (M.to_seq l |> Sequence.for_all (fun (k',_) -> k' < k)) \ && (M.to_seq l |> Sequence.for_all (fun (k',_) -> k' < k))
&& (M.to_seq r |> Sequence.for_all (fun (k',_) -> k' > k)) \ && (M.to_seq r |> Sequence.for_all (fun (k',_) -> k' > k))
&& M.balanced m \ && M.balanced m
&& M.cardinal l + M.cardinal r + 1 = List.length lst \ && M.cardinal l + M.cardinal r + 1 = List.length lst
) lst) ) lst)
*) *)