Legend:
Library
Module
Module type
Parameter
Class
Class type
Library
Module
Module type
Parameter
Class
Class type
Radix tree that can do longest-prefix searches on string keys
include Sexplib0.Sexpable.S1 with type 'a t := 'a t
val t_of_sexp : (Sexplib0.Sexp.t -> 'a) -> Sexplib0.Sexp.t -> 'a t
val sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.t
val empty : 'a t
An empty tree
insert key value tree
returns a new tree with the mapping key
to value
val longest_prefix : string -> 'a t -> 'a option
longest_prefix key tree
finds the key k
which shares the longest prefix with key
and returns the associated value.
val fold : (string -> 'a -> 'b -> 'b) -> 'b -> 'a t -> 'b
fold f initial t
folds f
over all bindings in t