module Rmap:This module implements an imperative map based on a mutable AVL tree. It is much faster than the OCaml standard map. In terms of constants, it is about 3 times slower than Hashtbl, however it has better guarenteed time complexity. Most people wanting a hashtbl replacement will want to usesig..end
Hashtree, which has the same
guarentee and much better constants (they are comparable to
Hashtbl). This module is exposed to make it easy to build
derived data structures more than to be directly used.
see Hashtree for function descriptions and individual time
complexity.
Hashtree, which has the same
guarentee and much better constants (they are comparable to
Hashtbl). This module is exposed to make it easy to build
derived data structures more than to be directly used.
see Hashtree for function descriptions and individual time
complexity.
type ('a, 'b) t
include Sexpable.S2
include Binable.S2
val create : unit -> ('a, 'b) tval invariant : ('a, 'b) t -> unitval add : ('a, 'b) t -> key:'a -> data:'b -> unitval remove : ('a, 'b) t -> 'a -> unitval find : ('a, 'b) t -> 'a -> 'b optionval fold : ('a, 'b) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'cval iter : ('a, 'b) t -> f:(key:'a -> data:'b -> unit) -> unitmodule type Key =sig..end
module type S =sig..end
module Make: