mirror of
https://github.com/c-cube/ocaml-containers.git
synced 2025-12-07 03:35:30 -05:00
e1064845a7
stuff, replaced by translation to/from Bencode; switch now based on strings rather than chars to choose branch; fix uses a lazy value rather than a function
89 lines
2.7 KiB
OCaml
89 lines
2.7 KiB
OCaml
|
|
open OUnit
|
|
|
|
let pp_int_list l =
|
|
let b = Buffer.create 4 in
|
|
Format.fprintf (Format.formatter_of_buffer b) "%a@?"
|
|
(Sequence.pp_seq Format.pp_print_int) (Sequence.of_list l);
|
|
Buffer.contents b
|
|
|
|
let test_intlist n () =
|
|
let bij = Bij.(list_ int_) in
|
|
let l = Sequence.to_list (Sequence.int_range ~start:0 ~stop:n) in
|
|
let s = Bij.TrBencode.to_string ~bij l in
|
|
let l' = Bij.TrBencode.of_string ~bij s in
|
|
OUnit.assert_equal ~printer:pp_int_list l l'
|
|
|
|
type term =
|
|
| Const of string
|
|
| Int of int
|
|
| App of term list
|
|
|
|
let bij_term =
|
|
let bij = Bij.(fix
|
|
(fun bij ->
|
|
switch
|
|
~inject:(function
|
|
| Const s -> "const", BranchTo (string_, s)
|
|
| Int i -> "int", BranchTo (int_, i)
|
|
| App l -> "app", BranchTo (list_ (Lazy.force bij), l))
|
|
~extract:(function
|
|
| "const" -> BranchFrom (string_, fun x -> Const x)
|
|
| "int" -> BranchFrom (int_, fun x -> Int x)
|
|
| "app" -> BranchFrom (list_ (Lazy.force bij), fun l -> App l)
|
|
| _ -> raise (DecodingError "unexpected case switch")))
|
|
)
|
|
in
|
|
bij
|
|
|
|
let test_rec () =
|
|
let t = App [Const "foo"; App [Const "bar"; Int 1; Int 2]; Int 3; Const "hello"] in
|
|
let s = Bij.TrBencode.to_string ~bij:bij_term t in
|
|
(* Printf.printf "to: %s\n" s; *)
|
|
let t' = Bij.TrBencode.of_string ~bij:bij_term s in
|
|
OUnit.assert_equal t t'
|
|
|
|
let random_str len =
|
|
let s = String.make len ' ' in
|
|
for i = 0 to len - 1 do
|
|
s.[i] <- "abcdefghijklmnopqrstuvwxyz".[Random.int 26]
|
|
done;
|
|
s
|
|
|
|
let rec random_term depth =
|
|
if depth = 0
|
|
then if Random.bool ()
|
|
then Const (random_str (1 + Random.int 5))
|
|
else Int (Random.int 20)
|
|
else
|
|
let len = Random.int (1 + Random.int 10) in
|
|
let seq = Sequence.map (fun _ -> random_term (depth-1))
|
|
(Sequence.int_range ~start:1 ~stop:len) in
|
|
App (Sequence.to_list seq)
|
|
|
|
let test_term_random ?(depth=5) n () =
|
|
for i = 0 to n - 1 do
|
|
let t = random_term depth in
|
|
let s = Bij.TrBencode.to_string ~bij:bij_term t in
|
|
let t' = Bij.TrBencode.of_string ~bij:bij_term s in
|
|
OUnit.assert_equal t t'
|
|
done
|
|
|
|
let test_complicated () =
|
|
let bij = Bij.(triple int_ (pair bool_ (many float_))
|
|
(map ~inject:(fun (a,b) -> (b,a)) ~extract:(fun (b,a) -> a,b) (pair int_ bool_))) in
|
|
let x = (1, (true, [1.; 2.; 3.]), (false, 42)) in
|
|
let s = Bij.TrBencode.to_string ~bij x in
|
|
let x' = Bij.TrBencode.of_string ~bij s in
|
|
OUnit.assert_equal x x'
|
|
|
|
let suite =
|
|
"test_bij" >:::
|
|
[ "test_intlist10" >:: test_intlist 10
|
|
; "test_intlist100" >:: test_intlist 100
|
|
; "test_intlist10_000" >:: test_intlist 10_000
|
|
; "test_rec" >:: test_rec
|
|
; "test_term_random100" >:: test_term_random 100
|
|
; "test_term_random100_depth10" >:: test_term_random ~depth:10 100
|
|
; "test_complicated" >:: test_complicated
|
|
]
|