Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Data structures
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Warp <warplayer@f...>
Subject: [Caml-list] Data structures
Hi
As I saw someone ( F. Pottier ) posting his new "Queue" module, I was
thinking perhaps the standard library I'm using could be of some help. You
can now get it on http://warplayer.free.fr .

It includes :

(nice) Global variable support ( global which can be defined or not - this
is  'a option ref )
Mutable List ( adding index-based functions ) support
Mutable Binary Tree with add , find, remove in logarithmic time and one
Optimize function

few String functions :
   val find_sub : string -> string -> int
   val split : string -> string -> string * string
   val split_char : string -> char -> string * string
   val rsplit_char : string -> char -> string * string

and little Misc.

All of theses are of course Proposals to be include in the official OCaml
Standard Library.
Theses data structures have been quite used and tested.

- direct link : http://warplayer.free.fr/files/mtlib.zip -

Nicolas Cannasse

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners