mirror of
https://github.com/c-cube/ocaml-containers.git
synced 2025-12-06 03:05:28 -05:00
small update of the makefile
This commit is contained in:
parent
1fa268138e
commit
9774added9
2 changed files with 7 additions and 3 deletions
|
|
@ -5,7 +5,7 @@ A bunch of containers,written in different occasions. Not all
|
||||||
containers are properly tested (see `tests/` and `make tests`
|
containers are properly tested (see `tests/` and `make tests`
|
||||||
if you have installed `OUnit`).
|
if you have installed `OUnit`).
|
||||||
|
|
||||||
The design is centerred around polymorphism rather than functors. Such
|
The design is mostly centered around polymorphism rather than functors. Such
|
||||||
structures comprise:
|
structures comprise:
|
||||||
|
|
||||||
- `PHashtbl`, a polymorphic hashtable (with open addressing)
|
- `PHashtbl`, a polymorphic hashtable (with open addressing)
|
||||||
|
|
@ -18,6 +18,8 @@ structures comprise:
|
||||||
basic graph functions that work even on infinite graphs, and printing to DOT.
|
basic graph functions that work even on infinite graphs, and printing to DOT.
|
||||||
- `FQueue`, a purely functional queue structure
|
- `FQueue`, a purely functional queue structure
|
||||||
- `Heap`, a purely functional polymorphic heap
|
- `Heap`, a purely functional polymorphic heap
|
||||||
|
- `Bij`, a GADT-based bijection language used to serialize/deserialize your
|
||||||
|
data structures
|
||||||
|
|
||||||
Other structures are:
|
Other structures are:
|
||||||
|
|
||||||
|
|
@ -43,7 +45,9 @@ If you have comments, requests, or bugfixes, please share them! :-)
|
||||||
|
|
||||||
## Build
|
## Build
|
||||||
|
|
||||||
There are no dependencies (`Sequence` is included). Type:
|
There are no dependencies (`Sequence` is included).
|
||||||
|
The `Bij` module requires OCaml `>= 4.00`. Type:
|
||||||
|
|
||||||
|
|
||||||
$ make
|
$ make
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -48,7 +48,7 @@ let bij_term =
|
||||||
let test_rec () =
|
let test_rec () =
|
||||||
let t = App [Const "foo"; App [Const "bar"; Int 1; Int 2]; Int 3; Const "hello"] in
|
let t = App [Const "foo"; App [Const "bar"; Int 1; Int 2]; Int 3; Const "hello"] in
|
||||||
let s = SexpStr.to_string ~bij:bij_term t in
|
let s = SexpStr.to_string ~bij:bij_term t in
|
||||||
Printf.printf "to: %s\n" s;
|
(* Printf.printf "to: %s\n" s; *)
|
||||||
let t' = SexpStr.of_string ~bij:bij_term s in
|
let t' = SexpStr.of_string ~bij:bij_term s in
|
||||||
OUnit.assert_equal t t'
|
OUnit.assert_equal t t'
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Add table
Reference in a new issue