Programmation Fonctionnelle, TP3

(** A module for a dictionary of lists of keys *)
module Make : functor (K : Set.OrderedType) ->
sig
type key = K.t
(** ['a t] is the type of dictionaries. A dictionary binds some [key list] to values of type ['a],
they can be understood as partial applications from [key list] to ['a].
*)
type 'a t
(** [empty] is the empty dictionary, no list of keys are bound *)
val empty : 'a t
(** [add list value dict] adds the binding between [list] and [value] to [dict]
if [list] was already bound, the previous binding is simply replaced.
*)
val add : key list -> 'a -> 'a t -> 'a t
(** [mem list dict] checks if [list] is bound to some value in the dictionary [dict] *)
val mem : key list -> 'a t -> bool
(** [find list dict] returns the value to which [list] is bound in [dict],
but raises an error if [list] is not bound
*)
val find : key list -> 'a t -> 'a
(** [longest stream dict] finds the longest prefix of [stream] that is bound in [dict].
If no prefix is bound, it returns [None].
Otherwise, it returns [Some (prefix,remains)] where [prefix] is the list of keys bound in [dict],
and [remains] is the stream of keys following [prefix] in [stream].
*)
val longest : key Stream_lzw.t -> 'a t -> (key list * key Stream_lzw.t) option
(** [fold] is the usual folding function, defined on dictionaries,
it applies its first argument to all the bindings defined in the dictionary in second argument.
*)
val fold : (key list -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
end

Programmation Fonctionnelle, TP3 : trie.mli