Re: [Ocaml-lib-devel] Another library for me to implement

[Michal M. <mal...@pl...>]

On Thu, Mar 20, 2003 at 11:30:08AM -0600, Brian Hurt wrote:
> 
> Ordered set.
> 
> Basically, a general balanced tree.  Insert, delete, search all O(log n), 
> access nth element O(log n), convert to sorted list O(n).  

Like Set.Make?

-- 
: Michal Moskal ::::: malekith/at/pld-linux.org :  GCS {C,UL}++++$ a? !tv
: PLD Linux ::::::: Wroclaw University, CS Dept :  {E-,w}-- {b++,e}>+++ h