From aa86a5454bb155afb01476d30ef75ff8adec7842 Mon Sep 17 00:00:00 2001
From: Simon Cruanes <simon.cruanes.2007@m4x.org>
Date: Thu, 13 Nov 2014 11:44:59 +0100
Subject: [PATCH] new benchmark, benchs.ml; drop use of "bench" package

---
 _oasis                |  11 +-
 benchs/bench_batch.ml |   6 +-
 benchs/bench_tbl.ml   | 422 ++++++++++++++++++++++++++++++++++++++++
 benchs/benchs.ml      | 437 +++---------------------------------------
 4 files changed, 463 insertions(+), 413 deletions(-)
 create mode 100644 benchs/bench_tbl.ml

diff --git a/_oasis b/_oasis
index 17d82e36..1d02eee1 100644
--- a/_oasis
+++ b/_oasis
@@ -155,7 +155,16 @@ Executable benchs
   CompiledObject:   native
   Build$:           flag(bench)
   MainIs:           benchs.ml
-  BuildDepends:     containers,containers.string,containers.misc,bench,containers.advanced
+  BuildDepends:     containers,benchmark
+
+Executable bench_tbl
+  Path:             benchs/
+  Install:          false
+  CompiledObject:   native
+  Build$:           flag(bench)
+  MainIs:           bench_tbl.ml
+  BuildDepends:     containers, containers.string, containers.misc,
+                    benchmark, containers.advanced
 
 Executable bench_conv
   Path:     benchs/
diff --git a/benchs/bench_batch.ml b/benchs/bench_batch.ml
index 0e478e28..9846d851 100644
--- a/benchs/bench_batch.ml
+++ b/benchs/bench_batch.ml
@@ -55,9 +55,9 @@ module Make(C : COLL) = struct
     Benchmark.tabulate res
 
   let bench () =
-    bench_for 1 100;
-    bench_for 4 100_000;
-    bench_for 4 1_000_000;
+    bench_for ~time:1 100;
+    bench_for ~time:4 100_000;
+    bench_for ~time:4 1_000_000;
     ()
 end
 
diff --git a/benchs/bench_tbl.ml b/benchs/bench_tbl.ml
new file mode 100644
index 00000000..94787857
--- /dev/null
+++ b/benchs/bench_tbl.ml
@@ -0,0 +1,422 @@
+
+(** Benchmarking *)
+(** {2 hashtables} *)
+
+module IHashtbl = Hashtbl.Make(struct
+  type t = int
+  let equal i j = i = j
+  let hash i = i
+end)
+
+module IFlatHashtbl = FlatHashtbl.Make(struct
+  type t = int
+  let equal i j = i = j
+  let hash i = i
+end)
+
+module IFHashtbl = FHashtbl.Tree(struct
+  type t = int
+  let equal i j = i = j
+  let hash i = i
+end)
+
+module IPersistentHashtbl = CCPersistentHashtbl.Make(struct
+  type t = int
+  let equal i j = i = j
+  let hash i = i
+end)
+
+module IMap = Map.Make(struct
+  type t = int
+  let compare i j = i - j
+end)
+
+module ICCHashtbl = CCFlatHashtbl.Make(struct
+  type t = int
+  let equal i j = i = j
+  let hash i = i
+end)
+
+let phashtbl_add n =
+  let h = PHashtbl.create 50 in
+  for i = n downto 0 do
+    PHashtbl.add h i i;
+  done;
+  h
+
+let hashtbl_add n =
+  let h = Hashtbl.create 50 in
+  for i = n downto 0 do
+    Hashtbl.add h i i;
+  done;
+  h
+
+let ihashtbl_add n =
+  let h = IHashtbl.create 50 in
+  for i = n downto 0 do
+    IHashtbl.add h i i;
+  done;
+  h
+
+let iflathashtbl_add n =
+  let h = IFlatHashtbl.create 50 in
+  for i = n downto 0 do
+    IFlatHashtbl.replace h i i;
+  done;
+  h
+
+let ifhashtbl_add n =
+  let h = ref (IFHashtbl.empty 32) in
+  for i = n downto 0 do
+    h := IFHashtbl.replace !h i i;
+  done;
+  !h
+
+let skiplist_add n =
+  let l = SkipList.create compare in
+  for i = n downto 0 do
+    SkipList.add l i i;
+  done;
+  l
+
+let ipersistenthashtbl_add n =
+  let h = ref (IPersistentHashtbl.create 32) in
+  for i = n downto 0 do
+    h := IPersistentHashtbl.replace !h i i;
+  done;
+  !h
+
+let imap_add n =
+  let h = ref IMap.empty in
+  for i = n downto 0 do
+    h := IMap.add i i !h;
+  done;
+  !h
+
+let icchashtbl_add n =
+  let h = ICCHashtbl.create 50 in
+  for i = n downto 0 do
+    ICCHashtbl.add h i i;
+  done;
+  h
+
+let bench_maps1 () =
+  Format.printf "----------------------------------------@.";
+  let n = 100 in
+  let res = Benchmark.throughputN 3
+    ["phashtbl_add", (fun n -> ignore (phashtbl_add n)), n;
+     "hashtbl_add", (fun n -> ignore (hashtbl_add n)), n;
+     "ihashtbl_add", (fun n -> ignore (ihashtbl_add n)), n;
+     "iflathashtbl_add", (fun n -> ignore (iflathashtbl_add n)), n;
+     "ifhashtbl_add", (fun n -> ignore (ifhashtbl_add n)), n;
+     "ipersistenthashtbl_add", (fun n -> ignore (ipersistenthashtbl_add n)), n;
+     "skiplist_add", (fun n -> ignore (skiplist_add n)), n;
+     "imap_add", (fun n -> ignore (imap_add n)), n;
+     "ccflathashtbl_add", (fun n -> ignore (icchashtbl_add n)), n;
+    ]
+  in
+  Benchmark.tabulate res
+
+let phashtbl_replace n =
+  let h = PHashtbl.create 50 in
+  for i = 0 to n do
+    PHashtbl.replace h i i;
+  done;
+  for i = n downto 0 do
+    PHashtbl.replace h i i;
+  done;
+  h
+
+let hashtbl_replace n =
+  let h = Hashtbl.create 50 in
+  for i = 0 to n do
+    Hashtbl.replace h i i;
+  done;
+  for i = n downto 0 do
+    Hashtbl.replace h i i;
+  done;
+  h
+
+let ihashtbl_replace n =
+  let h = IHashtbl.create 50 in
+  for i = 0 to n do
+    IHashtbl.replace h i i;
+  done;
+  for i = n downto 0 do
+    IHashtbl.replace h i i;
+  done;
+  h
+
+let iflathashtbl_replace n =
+  let h = IFlatHashtbl.create 50 in
+  for i = 0 to n do
+    IFlatHashtbl.replace h i i;
+  done;
+  for i = n downto 0 do
+    IFlatHashtbl.replace h i i;
+  done;
+  h
+
+let ifhashtbl_replace n =
+  let h = ref (IFHashtbl.empty 32) in
+  for i = 0 to n do
+    h := IFHashtbl.replace !h i i;
+  done;
+  for i = n downto 0 do
+    h := IFHashtbl.replace !h i i;
+  done;
+  !h
+
+let ipersistenthashtbl_replace n =
+  let h = ref (IPersistentHashtbl.create 32) in
+  for i = 0 to n do
+    h := IPersistentHashtbl.replace !h i i;
+  done;
+  for i = n downto 0 do
+    h := IPersistentHashtbl.replace !h i i;
+  done;
+  !h
+
+let skiplist_replace n =
+  let l = SkipList.create compare in
+  for i = 0 to n do
+    SkipList.add l i i;
+  done;
+  for i = n downto 0 do
+    SkipList.add l i i;
+  done;
+  l
+
+let imap_replace n =
+  let h = ref IMap.empty in
+  for i = 0 to n do
+    h := IMap.add i i !h;
+  done;
+  for i = n downto 0 do
+    h := IMap.add i i !h;
+  done;
+  !h
+
+let icchashtbl_replace n =
+  let h = ICCHashtbl.create 50 in
+  for i = 0 to n do
+    ICCHashtbl.add h i i;
+  done;
+  for i = n downto 0 do
+    ICCHashtbl.add h i i;
+  done;
+  h
+
+let bench_maps2 () =
+  Format.printf "----------------------------------------@.";
+  let n = 100 in
+  let res = Benchmark.throughputN 3
+    ["phashtbl_replace", (fun n -> ignore (phashtbl_replace n)), n;
+     "hashtbl_replace", (fun n -> ignore (hashtbl_replace n)), n;
+     "ihashtbl_replace", (fun n -> ignore (ihashtbl_replace n)), n;
+     "iflathashtbl_replace", (fun n -> ignore (iflathashtbl_replace n)), n;
+     "ifhashtbl_replace", (fun n -> ignore (ifhashtbl_replace n)), n;
+     "ipersistenthashtbl_replace", (fun n -> ignore (ipersistenthashtbl_replace n)), n;
+     "skiplist_replace", (fun n -> ignore (skiplist_replace n)), n;
+     "imap_replace", (fun n -> ignore (imap_replace n)), n;
+     "ccflathashtbl_replace", (fun n -> ignore (icchashtbl_replace n)), n;
+    ]
+  in
+  Benchmark.tabulate res
+
+let my_len = 250
+
+let phashtbl_find h =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (PHashtbl.find h i);
+    done
+
+let hashtbl_find h =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (Hashtbl.find h i);
+    done
+
+let ihashtbl_find h =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (IHashtbl.find h i);
+    done
+
+let iflathashtbl_find h =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (IFlatHashtbl.find h i);
+    done
+
+let ifhashtbl_find h =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (IFHashtbl.find h i);
+    done
+
+let ipersistenthashtbl_find h =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (IPersistentHashtbl.find h i);
+    done
+
+let skiplist_find l =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (SkipList.find l i);
+    done
+
+let array_find a =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (Array.get a i);
+    done
+
+let imap_find m =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (IMap.find i m);
+    done
+
+let icchashtbl_find m =
+  fun n ->
+    for i = 0 to n-1 do
+      ignore (ICCHashtbl.get_exn i m);
+    done
+
+let bench_maps3 () =
+  List.iter
+    (fun len ->
+      let h = phashtbl_add len in
+      let h' = hashtbl_add len in
+      let h'' = ihashtbl_add len in
+      let h''' = iflathashtbl_add len in
+      let h'''' = ifhashtbl_add len in
+      let h''''' = ipersistenthashtbl_add len in
+      let l = skiplist_add len in
+      let a = Array.init len (fun i -> string_of_int i) in
+      let m = imap_add len in
+      let h'''''' = icchashtbl_add len in
+      Format.printf "----------------------------------------@.";
+      Format.printf "try on size %d@.@.@." len;
+      let res = Benchmark.throughputN 3 [
+        "phashtbl_find", (fun () -> phashtbl_find h len), ();
+        "hashtbl_find", (fun () -> hashtbl_find h' len), ();
+        "ihashtbl_find", (fun () -> ihashtbl_find h'' len), ();
+        "iflathashtbl_find", (fun () -> iflathashtbl_find h''' len), ();
+        "ifhashtbl_find", (fun () -> ifhashtbl_find h'''' len), ();
+        "ipersistenthashtbl_find", (fun () -> ipersistenthashtbl_find h''''' len), ();
+        "skiplist_find", (fun () -> skiplist_find l len), ();
+        "array_find", (fun () -> array_find a len), ();
+        "imap_find", (fun () -> imap_find m len), ();
+        "cchashtbl_find", (fun () -> icchashtbl_find h'''''' len), ();
+      ] in
+      Benchmark.tabulate res)
+    [10;20;100;1000;10000]
+
+let bench_maps() =
+  bench_maps1 ();
+  bench_maps2 ();
+  bench_maps3 ();
+  ()
+
+(** {2 Sequence/Gen} *)
+
+let bench_enum () =
+  let n = 1_000_000 in
+  let seq () = CCSequence.fold (+) 0 (CCSequence.int_range ~start:0 ~stop:n) in
+  let enum () = CCGen.fold (+) 0 (CCGen.int_range 0 n) in
+  let res = Benchmark.throughputN 3
+    [ "sequence.fold", seq, ();
+      "gen.fold", enum, ();
+    ] in
+  Benchmark.tabulate res;
+
+  let n = 100_000 in
+  let seq () =
+    let open CCSequence in
+    let seq = int_range ~start:0 ~stop:n in
+    let seq = flatMap (fun x -> int_range ~start:x ~stop:(x+10)) seq in
+    fold (+) 0 seq in
+  let enum () =
+    let open CCGen in
+    let seq = int_range 0 n in
+    let seq = flat_map (fun x -> int_range x (x+10)) seq in
+    fold (+) 0 seq in
+  let res = Benchmark.throughputN 3
+    [ "sequence.flatMap", seq, ();
+      "gen.flatMap", enum, ();
+    ] in
+  Benchmark.tabulate res
+
+(** {2 Cache} *)
+
+(** Cached fibonacci function *)
+module Fibo(C : Cache.S with type key = int) = struct
+  let fib ~size =
+    let fib fib' n =
+      match n with
+      | 0 -> 0
+      | 1 -> 1
+      | 2 -> 1
+      | n ->
+        fib' (n-1) + fib' (n-2)
+    in
+    let cache = C.create size in
+    let cached_fib x = C.with_cache_rec cache fib x in
+    cached_fib
+end
+
+module LinearIntCache = Cache.Linear(struct
+  type t = int
+  let equal i j = i = j
+end)
+
+module ReplacingIntCache = Cache.Replacing(struct
+  type t = int
+  let equal i j = i = j
+  let hash i = i
+end)
+
+module LRUIntCache = Cache.LRU(struct
+  type t = int
+  let equal i j = i = j
+  let hash i = i
+end)
+
+module DummyIntCache = Cache.Dummy(struct type t = int end)
+
+let bench_cache () =
+  (* Fibonacci for those caching implementations *)
+  let module LinearFibo = Fibo(LinearIntCache) in
+  let module ReplacingFibo = Fibo(ReplacingIntCache) in
+  let module LRUFibo= Fibo(LRUIntCache) in
+  let module DummyFibo = Fibo(DummyIntCache) in
+  (* benchmark caches with fibo function *)
+  let bench_fib fib () =
+    ignore (List.map fib [5;10;20;30;35]);
+    ()
+  in
+  let res = Benchmark.throughputN 3
+    [ "linear_fib", bench_fib (LinearFibo.fib ~size:5), ();
+      "replacing_fib", bench_fib (ReplacingFibo.fib ~size:256), ();
+      "LRU_fib", bench_fib (LRUFibo.fib ~size:256), ();
+      "dummy_fib", bench_fib (DummyFibo.fib ~size:5), ();
+    ] in
+  Benchmark.tabulate res;
+  ()
+
+let _ =
+  match Sys.argv with
+  | [| _; "maps" |] -> bench_maps ()
+  | [| _; "enum" |] -> bench_enum ()
+  | [| _; "cache" |] -> bench_cache ()
+  | [| _; ("-help" | "--help") |] -> print_endline "./benchs [maps|enum|cache]"
+  | [| _ |] ->
+      bench_enum ();
+      bench_maps ();
+      bench_cache ();
+      ()
+  | _ -> failwith "unknown argument (-help)"
diff --git a/benchs/benchs.ml b/benchs/benchs.ml
index 3a871049..63d26ef9 100644
--- a/benchs/benchs.ml
+++ b/benchs/benchs.ml
@@ -1,419 +1,38 @@
+(** Generic benchs *)
 
-(** Benchmarking *)
-(** {2 hashtables} *)
+let draw_line () =
+  output_string stdout (CCString.repeat "*" 80);
+  output_char stdout '\n'
 
-module IHashtbl = Hashtbl.Make(struct
-  type t = int
-  let equal i j = i = j
-  let hash i = i
-end)
+module L = struct
 
-module IFlatHashtbl = FlatHashtbl.Make(struct
-  type t = int
-  let equal i j = i = j
-  let hash i = i
-end)
+  let f_ x =
+    if x mod 10 = 0 then []
+    else if x mod 5 = 1 then [x;x+1]
+    else [x;x+1;x+2;x+3]
 
-module IFHashtbl = FHashtbl.Tree(struct
-  type t = int
-  let equal i j = i = j
-  let hash i = i
-end)
+  let bench_flatmap ?(time=2) n =
+    draw_line ();
+    Printf.printf "flat_map for %d elements\n" n;
+    let l = CCList.(1 -- n) in
+    let res = Benchmark.throughputN time
+      [ "flat_map", CCList.flat_map f_, l
+      ; "flatten o CCList.map", (fun l -> List.flatten (CCList.map f_ l)), l
+      ; "flatten o map", (fun l -> List.flatten (List.map f_ l)), l
+      ] in
+    Benchmark.tabulate res
 
-module IPersistentHashtbl = CCPersistentHashtbl.Make(struct
-  type t = int
-  let equal i j = i = j
-  let hash i = i
-end)
-
-module IMap = Map.Make(struct
-  type t = int
-  let compare i j = i - j
-end)
-
-module ICCHashtbl = CCFlatHashtbl.Make(struct
-  type t = int
-  let equal i j = i = j
-  let hash i = i
-end)
-
-let phashtbl_add n =
-  let h = PHashtbl.create 50 in
-  for i = n downto 0 do
-    PHashtbl.add h i i;
-  done;
-  h
-
-let hashtbl_add n =
-  let h = Hashtbl.create 50 in
-  for i = n downto 0 do
-    Hashtbl.add h i i;
-  done;
-  h
-
-let ihashtbl_add n =
-  let h = IHashtbl.create 50 in
-  for i = n downto 0 do
-    IHashtbl.add h i i;
-  done;
-  h
-
-let iflathashtbl_add n =
-  let h = IFlatHashtbl.create 50 in
-  for i = n downto 0 do
-    IFlatHashtbl.replace h i i;
-  done;
-  h
-
-let ifhashtbl_add n =
-  let h = ref (IFHashtbl.empty 32) in
-  for i = n downto 0 do
-    h := IFHashtbl.replace !h i i;
-  done;
-  !h
-
-let skiplist_add n =
-  let l = SkipList.create compare in
-  for i = n downto 0 do
-    SkipList.add l i i;
-  done;
-  l
-
-let ipersistenthashtbl_add n =
-  let h = ref (IPersistentHashtbl.create 32) in
-  for i = n downto 0 do
-    h := IPersistentHashtbl.replace !h i i;
-  done;
-  !h
-
-let imap_add n =
-  let h = ref IMap.empty in
-  for i = n downto 0 do
-    h := IMap.add i i !h;
-  done;
-  !h
-
-let icchashtbl_add n =
-  let h = ICCHashtbl.create 50 in
-  for i = n downto 0 do
-    ICCHashtbl.add h i i;
-  done;
-  h
-
-let bench_maps1 () =
-  Format.printf "----------------------------------------@.";
-  let res = Bench.bench_n
-    ["phashtbl_add", (fun n -> ignore (phashtbl_add n));
-     "hashtbl_add", (fun n -> ignore (hashtbl_add n));
-     "ihashtbl_add", (fun n -> ignore (ihashtbl_add n));
-     "iflathashtbl_add", (fun n -> ignore (iflathashtbl_add n));
-     "ifhashtbl_add", (fun n -> ignore (ifhashtbl_add n));
-     "ipersistenthashtbl_add", (fun n -> ignore (ipersistenthashtbl_add n));
-     "skiplist_add", (fun n -> ignore (skiplist_add n));
-     "imap_add", (fun n -> ignore (imap_add n));
-     "ccflathashtbl_add", (fun n -> ignore (icchashtbl_add n))
-    ]
-  in
-  Bench.summarize 1. res
-
-let phashtbl_replace n =
-  let h = PHashtbl.create 50 in
-  for i = 0 to n do
-    PHashtbl.replace h i i;
-  done;
-  for i = n downto 0 do
-    PHashtbl.replace h i i;
-  done;
-  h
-
-let hashtbl_replace n =
-  let h = Hashtbl.create 50 in
-  for i = 0 to n do
-    Hashtbl.replace h i i;
-  done;
-  for i = n downto 0 do
-    Hashtbl.replace h i i;
-  done;
-  h
-
-let ihashtbl_replace n =
-  let h = IHashtbl.create 50 in
-  for i = 0 to n do
-    IHashtbl.replace h i i;
-  done;
-  for i = n downto 0 do
-    IHashtbl.replace h i i;
-  done;
-  h
-
-let iflathashtbl_replace n =
-  let h = IFlatHashtbl.create 50 in
-  for i = 0 to n do
-    IFlatHashtbl.replace h i i;
-  done;
-  for i = n downto 0 do
-    IFlatHashtbl.replace h i i;
-  done;
-  h
-
-let ifhashtbl_replace n =
-  let h = ref (IFHashtbl.empty 32) in
-  for i = 0 to n do
-    h := IFHashtbl.replace !h i i;
-  done;
-  for i = n downto 0 do
-    h := IFHashtbl.replace !h i i;
-  done;
-  !h
-
-let ipersistenthashtbl_replace n =
-  let h = ref (IPersistentHashtbl.create 32) in
-  for i = 0 to n do
-    h := IPersistentHashtbl.replace !h i i;
-  done;
-  for i = n downto 0 do
-    h := IPersistentHashtbl.replace !h i i;
-  done;
-  !h
-
-let skiplist_replace n =
-  let l = SkipList.create compare in
-  for i = 0 to n do
-    SkipList.add l i i;
-  done;
-  for i = n downto 0 do
-    SkipList.add l i i;
-  done;
-  l
-
-let imap_replace n =
-  let h = ref IMap.empty in
-  for i = 0 to n do
-    h := IMap.add i i !h;
-  done;
-  for i = n downto 0 do
-    h := IMap.add i i !h;
-  done;
-  !h
-
-let icchashtbl_replace n =
-  let h = ICCHashtbl.create 50 in
-  for i = 0 to n do
-    ICCHashtbl.add h i i;
-  done;
-  for i = n downto 0 do
-    ICCHashtbl.add h i i;
-  done;
-  h
-
-let bench_maps2 () =
-  Format.printf "----------------------------------------@.";
-  let res = Bench.bench_n
-    ["phashtbl_replace", (fun n -> ignore (phashtbl_replace n));
-     "hashtbl_replace", (fun n -> ignore (hashtbl_replace n));
-     "ihashtbl_replace", (fun n -> ignore (ihashtbl_replace n));
-     "iflathashtbl_replace", (fun n -> ignore (iflathashtbl_replace n));
-     "ifhashtbl_replace", (fun n -> ignore (ifhashtbl_replace n));
-     "ipersistenthashtbl_replace", (fun n -> ignore (ipersistenthashtbl_replace n));
-     "skiplist_replace", (fun n -> ignore (skiplist_replace n));
-     "imap_replace", (fun n -> ignore (imap_replace n));
-     "ccflathashtbl_replace", (fun n -> ignore (icchashtbl_replace n));
-    ]
-  in
-  Bench.summarize 1. res
-
-let my_len = 250
-
-let phashtbl_find h =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (PHashtbl.find h i);
-    done
-     
-let hashtbl_find h =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (Hashtbl.find h i);
-    done
-     
-let ihashtbl_find h =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (IHashtbl.find h i);
-    done
-     
-let iflathashtbl_find h =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (IFlatHashtbl.find h i);
-    done
-     
-let ifhashtbl_find h =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (IFHashtbl.find h i);
-    done
-     
-let ipersistenthashtbl_find h =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (IPersistentHashtbl.find h i);
-    done
-
-let skiplist_find l =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (SkipList.find l i);
-    done
-
-let array_find a =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (Array.get a i);
-    done
-
-let imap_find m =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (IMap.find i m);
-    done
-
-let icchashtbl_find m =
-  fun n ->
-    for i = 0 to n-1 do
-      ignore (ICCHashtbl.get_exn i m);
-    done
-
-let bench_maps3 () =
-  List.iter
-    (fun len ->
-      let h = phashtbl_add len in
-      let h' = hashtbl_add len in
-      let h'' = ihashtbl_add len in
-      let h''' = iflathashtbl_add len in
-      let h'''' = ifhashtbl_add len in
-      let h''''' = ipersistenthashtbl_add len in
-      let l = skiplist_add len in
-      let a = Array.init len (fun i -> string_of_int i) in
-      let m = imap_add len in
-      let h'''''' = icchashtbl_add len in
-      Format.printf "----------------------------------------@.";
-      Format.printf "try on size %d@.@.@." len;
-      Bench.bench [
-        "phashtbl_find", (fun () -> phashtbl_find h len);
-        "hashtbl_find", (fun () -> hashtbl_find h' len);
-        "ihashtbl_find", (fun () -> ihashtbl_find h'' len);
-        "iflathashtbl_find", (fun () -> iflathashtbl_find h''' len);
-        "ifhashtbl_find", (fun () -> ifhashtbl_find h'''' len);
-        "ipersistenthashtbl_find", (fun () -> ipersistenthashtbl_find h''''' len);
-        "skiplist_find", (fun () -> skiplist_find l len);
-        "array_find", (fun () -> array_find a len);
-        "imap_find", (fun () -> imap_find m len);
-        "cchashtbl_find", (fun () -> icchashtbl_find h'''''' len);
-      ])
-    [10;20;100;1000;10000]
-
-let bench_maps() =
-  bench_maps1 ();
-  bench_maps2 ();
-  bench_maps3 ();
-  ()
-
-(** {2 Sequence/Gen} *)
-
-let bench_enum () =
-  let n = 1_000_000 in
-  let seq () = CCSequence.fold (+) 0 (CCSequence.int_range ~start:0 ~stop:n) in
-  let enum () = CCGen.fold (+) 0 (CCGen.int_range 0 n) in
-  Bench.bench
-    [ "sequence.fold", seq;
-      "gen.fold", enum;
-    ];
-
-  let n = 100_000 in
-  let seq () =
-    let open CCSequence in
-    let seq = int_range ~start:0 ~stop:n in
-    let seq = flatMap (fun x -> int_range ~start:x ~stop:(x+10)) seq in
-    fold (+) 0 seq in
-  let enum () =
-    let open CCGen in
-    let seq = int_range 0 n in
-    let seq = flat_map (fun x -> int_range x (x+10)) seq in
-    fold (+) 0 seq in
-  Bench.bench
-    [ "sequence.flatMap", seq;
-      "gen.flatMap", enum;
-    ]
-
-(** {2 Cache} *)
-
-(** Cached fibonacci function *)
-module Fibo(C : Cache.S with type key = int) = struct
-  let fib ~size =
-    let rec fib fib' n =
-      match n with
-      | 0 -> 0
-      | 1 -> 1
-      | 2 -> 1
-      | n ->
-        fib' (n-1) + fib' (n-2)
-    in
-    let cache = C.create size in
-    let cached_fib x = C.with_cache_rec cache fib x in
-    cached_fib
+  let run() =
+    bench_flatmap 100;
+    bench_flatmap 10_000;
+    bench_flatmap ~time:4 100_000;
+    ()
 end
 
-module LinearIntCache = Cache.Linear(struct
-  type t = int
-  let equal i j = i = j
-end)
+(* TODO *)
 
-module ReplacingIntCache = Cache.Replacing(struct
-  type t = int
-  let equal i j = i = j
-  let hash i = i
-end)
-
-module LRUIntCache = Cache.LRU(struct
-  type t = int
-  let equal i j = i = j
-  let hash i = i
-end)
-
-module DummyIntCache = Cache.Dummy(struct type t = int end)
-
-let bench_cache () =
-  (* Fibonacci for those caching implementations *)
-  let module LinearFibo = Fibo(LinearIntCache) in
-  let module ReplacingFibo = Fibo(ReplacingIntCache) in
-  let module LRUFibo= Fibo(LRUIntCache) in
-  let module DummyFibo = Fibo(DummyIntCache) in
-  (* benchmark caches with fibo function *)
-  let bench_fib fib () = 
-    ignore (List.map fib [5;10;20;30;35]);
-    ()
-  in
-  let conf = Bench.config in
-  conf.Bench.samples <- 100;
-  Bench.bench
-    [ "linear_fib", bench_fib (LinearFibo.fib ~size:5);
-      "replacing_fib", bench_fib (ReplacingFibo.fib ~size:256);
-      "LRU_fib", bench_fib (LRUFibo.fib ~size:256);
-      "dummy_fib", bench_fib (DummyFibo.fib ~size:5);
-    ];
-  conf.Bench.samples <- 1000;
+let () =
+  L.run ();
   ()
 
-let _ =
-  match Sys.argv with
-  | [| _; "maps" |] -> bench_maps ()
-  | [| _; "enum" |] -> bench_enum ()
-  | [| _; "cache" |] -> bench_cache ()
-  | [| _; ("-help" | "--help") |] -> print_endline "./benchs [maps|enum|cache]"
-  | [| _ |] ->
-      bench_enum ();
-      bench_maps ();
-      bench_cache ();
-      ()
-  | _ -> failwith "unknown argument (-help)"
+