From 4eb20ab3dbd23d24183e50b50024d08efac5ae25 Mon Sep 17 00:00:00 2001
From: Simon Cruanes <simon.cruanes.2007@m4x.org>
Date: Tue, 15 Sep 2015 12:26:02 +0200
Subject: [PATCH] use raw quickcheck test

---
 src/data/CCWBTree.ml | 22 +++++++++++-----------
 1 file changed, 11 insertions(+), 11 deletions(-)

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