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

benchs: add funvec.flatten, quite terrible

Browse source
This commit is contained in:
Simon Cruanes 2023-11-16 15:32:13 -05:00
parent 3a296ba127
commit 71dcc0937c
No known key found for this signature in database
GPG key ID: EBFFF6F283F3A2B4
1 changed files with 13 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
benchs/run_benchs.ml
View file

@ -149,11 +149,13 @@ module L = struct
let bench_flatten ?(time = 2) n = let bench_flatten ?(time = 2) n =
let fold_right_append_ l () = let fold_right_append_ l () =
ignore (List.fold_right List.append l [] : _ list) opaque_ignore (List.fold_right List.append l [] : _ list)
and cc_fold_right_append_ l () = and cc_fold_right_append_ l () =
ignore (CCList.fold_right CCList.append l [] : _ list) opaque_ignore (CCList.fold_right CCList.append l [] : _ list)
and sek_flatten s () = and sek_flatten s () =
ignore (Sek.Persistent.flatten s : _ Sek.Persistent.t) opaque_ignore (Sek.Persistent.flatten s : _ Sek.Persistent.t)
and funvec_flatten v () =
opaque_ignore (CCFun_vec.fold_rev ~x:CCFun_vec.empty ~f:(fun acc x -> CCFun_vec.append x acc) v : _ CCFun_vec.t)
in in
let l = let l =
CCList.mapi (fun i x -> CCList.(x -- (x + min i 100))) CCList.(1 -- n) CCList.mapi (fun i x -> CCList.(x -- (x + min i 100))) CCList.(1 -- n)
@ -162,11 +164,13 @@ module L = struct
Sek.Persistent.of_list (Sek.Persistent.create 0) Sek.Persistent.of_list (Sek.Persistent.create 0)
(List.map (Sek.Persistent.of_list 0) l) (List.map (Sek.Persistent.of_list 0) l)
in in
let v = CCFun_vec.of_list (List.map CCFun_vec.of_list l) in
B.throughputN time ~repeat B.throughputN time ~repeat
[ [
"CCList.flatten", (fun () -> ignore (CCList.flatten l)), (); "CCList.flatten", (fun () -> ignore (CCList.flatten l)), ();
"List.flatten", (fun () -> ignore (List.flatten l)), (); "List.flatten", (fun () -> ignore (List.flatten l)), ();
"fold_right append", fold_right_append_ l, (); "fold_right append", fold_right_append_ l, ();
"funvec.(fold_right append)", (funvec_flatten v), ();
"CCList.(fold_right append)", cc_fold_right_append_ l, (); "CCList.(fold_right append)", cc_fold_right_append_ l, ();
"Sek.flatten", sek_flatten sek, (); "Sek.flatten", sek_flatten sek, ();
] ]
@ -220,7 +224,7 @@ module L = struct
let bench_set ?(time = 2) n = let bench_set ?(time = 2) n =
let l = CCList.(0 -- (n - 1)) in let l = CCList.(0 -- (n - 1)) in
let ral = CCRAL.of_list l in let ral = CCRAL.of_list l in
(* let v = CCFun_vec.of_list l in *) (* let v = CCFun_vec.of_list l in *)
let bv = BatVect.of_list l in let bv = BatVect.of_list l in
let sek = Sek.Persistent.of_array 0 (Array.of_list l) in let sek = Sek.Persistent.of_array 0 (Array.of_list l) in
let map = let map =
@ -234,10 +238,10 @@ module L = struct
for i = 0 to n - 1 do for i = 0 to n - 1 do
opaque_ignore (CCRAL.set l i (-i)) opaque_ignore (CCRAL.set l i (-i))
done done
(* (* TODO: implement set
and bench_funvec l () = and bench_funvec l () =
for _i = 0 to n-1 do opaque_ignore ((* TODO *)) done for _i = 0 to n-1 do opaque_ignore (CCFun_vec.set (* TODO *)) done
*) *)
and bench_batvec l () = and bench_batvec l () =
for i = 0 to n - 1 do for i = 0 to n - 1 do
opaque_ignore (BatVect.set l i (-i)) opaque_ignore (BatVect.set l i (-i))
@ -250,8 +254,8 @@ module L = struct
B.throughputN time ~repeat B.throughputN time ~repeat
[ [
"Map.add", bench_map map, (); "Map.add", bench_map map, ();
"RAL.set", bench_ral ral, () "RAL.set", bench_ral ral, ();
(* ; "funvec.set", bench_funvec v, () *); (* "funvec.set", bench_funvec v, (); *)
"batvec.set", bench_batvec bv, (); "batvec.set", bench_batvec bv, ();
"Sek.Persistent.set", bench_sek sek, (); "Sek.Persistent.set", bench_sek sek, ();
] ]