Make.Trieinclude Core_kernel.Bin_prot.Binable.S1 with type 'a t := 'a tval bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1val bin_write_t : ('a, 'a t) Bin_prot.Write.writer1val bin_read_t : ('a, 'a t) Bin_prot.Read.reader1val __bin_read_t__ : ('a, int -> 'a t) Bin_prot.Read.reader1val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writerval bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.readerval bin_t : ('a, 'a t) Bin_prot.Type_class.S1.ttype key = Corpus.keya key type that is used to lookup data
val create : unit -> 'a tcreate () creates new empty trie
add trie ~key ~data associates data with key. If trie already has some value associated with key, then the value will be overwritten (rebound)
change trie key f if trie has data associated with key then f will be called with Some data, otherwise it will be called with None. If f returns None then there will be no data associated with key, if f returns Some thing, then thing will be associated with key
walk trie key ~init ~f walks down the tree starting from the root and ending with the last token of the key. Function f is fold over values associated with all substrings of the key, starting from a zero substring.
longest_match trie key find a value associated with a longest substring of key. Returns a pair - a length of matched key and the value, associated with that key.
val length : 'a t -> intlength trie returns the number of values in trie
val pp :
(Stdlib.Format.formatter -> 'a -> unit) ->
Stdlib.Format.formatter ->
'a t ->
unitpp pp_val creates a printer for a given value printer pp_val. Example:
let int_trie = String.Trie.pp pp_int
will create a printer for a String.Trie that is populated by integers.