Lines Matching refs:of
6 * it under the terms of the GNU Lesser General Public License as published
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 (** Basic Implementation of polymorphic tries (ie. prefix trees) *)
19 (** The type of tries. ['a list] is the type of keys, ['b] the type of values.
21 of type ['a * 'b option]. *)
38 (** [unset k v] removes the association of value [v] with the key [k] in the trie [t].
40 every nodes of [t] containing no values and having no chil. *)
43 (** [iter f t] applies the function [f] to every node of the trie [t].
44 As nodes of the trie [t] do not necessary contains a value, the second argument of
49 If [p] is not a valid path of [t], it iterates on the longest valid prefix of [p]. *)
52 (** [fold f t x] fold [f] over every nodes of [t], with [x] as initial value. *)
55 (** [map f t] maps [f] over every values stored in [t]. The return value of [f] is of type 'c option
60 If [p] is not a valid path of [t], it returns an empty trie. *)