module BatMultiPMap:sig..end
This is a polymorphic multi-map, i.e. an association from 1 to many.
Author(s): Xavier Leroy, Nicolas Cannasse, Markus Mottle, David Teller
type ('a, 'b) t
val empty : ('a, 'b) tcompare as key comparison function.val is_empty : ('a, 'b) t -> boolval create : ('a -> 'a -> int) -> ('b -> 'b -> int) -> ('a, 'b) tval add : 'a -> 'b -> ('a, 'b) t -> ('a, 'b) tadd x y m returns a map containing the same bindings as
m, plus a binding of x to y.val find : 'a -> ('a, 'b) t -> 'b BatSet.PSet.tfind x m returns the current binding of x in mval remove_all : 'a -> ('a, 'b) t -> ('a, 'b) tremove_all x m returns a map containing the same bindings as
m, except for x which is unbound in the returned map.val remove : 'a -> 'b -> ('a, 'b) t -> ('a, 'b) tremove k d m returns a map containing the same bindings as
m, except for k which is not bound to d anymore in the returned
map. If k was not bound to d, nothing is changed. If the operation
removes the last binding of k, then k is also removed from the set
of keys.val mem : 'a -> ('a, 'b) t -> boolmem x m returns true if m contains at least a binding for x,
and false otherwise.val iter : ('a -> 'b BatSet.PSet.t -> unit) -> ('a, 'b) t -> unititer f m applies f to all bindings in map m.
f receives the key as first argument, and the associated value
as second argument. The order in which the bindings are passed to
f is unspecified. Only current bindings are presented to f:
bindings hidden by more recent bindings are not passed to f.val map : ('b BatSet.PSet.t -> 'c BatSet.PSet.t) ->
(('b -> 'b -> int) -> 'c -> 'c -> int) ->
('a, 'b) t -> ('a, 'c) tmap f m returns a map with same domain as m, where the
associated value a of all bindings of m has been
replaced by the result of the application of f to a.
The order in which the associated values are passed to f
is unspecified.val mapi : ('a -> 'b BatSet.PSet.t -> 'c BatSet.PSet.t) ->
(('b -> 'b -> int) -> 'c -> 'c -> int) ->
('a, 'b) t -> ('a, 'c) tmap, but the function receives as arguments both the
key and the associated value for each binding of the map.val fold : ('b BatSet.PSet.t -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'cfold f m a computes (f kN dN ... (f k1 d1 (f k0 d0 a))...),
where k0,k1..kN are the keys of all bindings in m,
and d0,d1..dN are the associated data.
The order in which the bindings are presented to f is
unspecified.val foldi : ('a -> 'b BatSet.PSet.t -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'cfold, but the function receives as arguments both the
key and the associated value for each binding of the map.val modify : 'a ->
('b BatSet.PSet.t -> 'b BatSet.PSet.t) ->
('a, 'b) t -> ('a, 'b) tmodify x f m replaces the binding for x with f applied to
these values.Not_found is x is unbound in mval modify_def : 'b BatSet.PSet.t ->
'a ->
('b BatSet.PSet.t -> 'b BatSet.PSet.t) ->
('a, 'b) t -> ('a, 'b) tmodify_def dfl x f m performs as modify x f m but it adds
f dfl in m instead of raising Not_found if x was unbound.val modify_opt : 'a ->
('b BatSet.PSet.t option -> 'b BatSet.PSet.t option) ->
('a, 'b) t -> ('a, 'b) tmodify_opt x f m allows to modify the bindings for k in m
or absence thereof.val enum : ('a, 'b) t -> ('a * 'b) BatEnum.tval of_enum : ?keys:('a -> 'a -> int) ->
?data:('b -> 'b -> int) -> ('a * 'b) BatEnum.t -> ('a, 'b) tcompare by default.module Infix:sig..end
BatMultiPMap
val print : ?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> 'b -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> ('b, 'c) t -> unit