mirror of
https://github.com/c-cube/iter.git
synced 2025-12-06 11:15:32 -05:00
07cc9df645
an extended version of Map, with additional conversion functions relative to Sequence. One can Adapt an already existing Map module, or Make an extended Map directly
71 lines
3.1 KiB
OCaml
71 lines
3.1 KiB
OCaml
|
|
(** {2 Test sequences} *)
|
|
|
|
(** print a list of items using the printing function *)
|
|
let pp_list ?(sep=", ") pp_item formatter l =
|
|
Sequence.pp_seq ~sep pp_item formatter (Sequence.of_list l)
|
|
|
|
(** Set of integers *)
|
|
module ISet = Set.Make(struct type t = int let compare = compare end)
|
|
let iset = (module ISet : Set.S with type elt = int and type t = ISet.t)
|
|
|
|
module OrderedString = struct type t = string let compare = compare end
|
|
module SMap = Sequence.Map.Make(OrderedString)
|
|
|
|
let my_map = SMap.of_seq (Sequence.of_list ["1", 1; "2", 2; "3", 3; "answer", 42])
|
|
|
|
let sexpr = "(foo bar (bazz quux hello 42) world (zoo foo bar (1 2 (3 4))))"
|
|
|
|
let _ =
|
|
(* lists *)
|
|
let l = [0;1;2;3;4;5;6] in
|
|
let l' = Sequence.to_list
|
|
(Sequence.filter (fun x -> x mod 2 = 0) (Sequence.of_list l)) in
|
|
let l'' = Sequence.to_list
|
|
(Sequence.take 3 (Sequence.drop 1 (Sequence.of_list l))) in
|
|
let h = Hashtbl.create 3 in
|
|
for i = 0 to 5 do
|
|
Hashtbl.add h i (i*i);
|
|
done;
|
|
let l2 = Sequence.to_list
|
|
(Sequence.map (fun (x, y) -> (string_of_int x) ^ " -> " ^ (string_of_int y))
|
|
(Sequence.of_hashtbl h))
|
|
in
|
|
let l3 = Sequence.to_list (Sequence.rev (Sequence.int_range ~start:0 ~stop:42)) in
|
|
let set = List.fold_left (fun set x -> ISet.add x set) ISet.empty [4;3;100;42] in
|
|
let l4 = Sequence.to_list (Sequence.of_set iset set) in
|
|
Format.printf "l=@[<h>[%a]@]@." (pp_list Format.pp_print_int) l;
|
|
Format.printf "l'=@[<h>[%a]@]@." (pp_list Format.pp_print_int) l';
|
|
Format.printf "l''=@[<h>[%a]@]@." (pp_list Format.pp_print_int) l'';
|
|
Format.printf "l2=@[<h>[%a]@]@." (pp_list Format.pp_print_string) l2;
|
|
Format.printf "l3=@[<h>[%a]@]@." (pp_list Format.pp_print_int) l3;
|
|
Format.printf "s={@[<h>%a@]}@." (Sequence.pp_seq Format.pp_print_int) (Sequence.of_set iset set);
|
|
Format.printf "l4=@[<h>[%a]@]@." (pp_list Format.pp_print_int) l4;
|
|
Format.printf "l3[:5]+l4=@[<h>[%a]@]@." (Sequence.pp_seq Format.pp_print_int)
|
|
(Sequence.of_array
|
|
(Sequence.to_array (Sequence.append
|
|
(Sequence.take 5 (Sequence.of_list l3)) (Sequence.of_list l4))));
|
|
(* maps *)
|
|
Format.printf "@[<h>map: %a@]@."
|
|
(Sequence.pp_seq (fun formatter (k,v) -> Format.fprintf formatter "\"%s\" -> %d" k v))
|
|
(SMap.to_seq my_map);
|
|
let module MyMapSeq = Sequence.Map.Adapt(Map.Make(OrderedString)) in
|
|
let my_map' = MyMapSeq.of_seq (Sequence.of_list ["1", 1; "2", 2; "3", 3; "answer", 42]) in
|
|
Format.printf "@[<h>map: %a@]@."
|
|
(Sequence.pp_seq (fun formatter (k,v) -> Format.fprintf formatter "\"%s\" -> %d" k v))
|
|
(MyMapSeq.to_seq my_map');
|
|
(* sum *)
|
|
let n = 100000000 in
|
|
let sum = Sequence.fold (+) 0 (Sequence.take n (Sequence.repeat 1)) in
|
|
Format.printf "%dx1 = %d@." n sum;
|
|
assert (n=sum);
|
|
(* sexpr *)
|
|
let s = Sexpr.of_seq (Sexpr.lex (Sequence.of_str sexpr)) in
|
|
let s = Sexpr.of_seq (Sequence.map
|
|
(function | `Atom s -> `Atom (String.capitalize s) | tok -> tok)
|
|
(Sexpr.traverse s))
|
|
in
|
|
Format.printf "@[<hov2>transform @[<h>%s@] into @[<h>%a@]@]@." sexpr (Sexpr.pp_sexpr ~indent:false) s;
|
|
Format.printf "@[<hv2> cycle:%a@]@." Sexpr.pp_tokens
|
|
(Sequence.concat (Sequence.take 10 (Sequence.repeat (Sexpr.traverse s))));
|
|
()
|