calculon

library calculon

module Calculon

module Command

module Config

module Log

module Lwt_err

module Plugin_factoids

module Plugin_history

module Plugin_social

module Plugin_state

module Plugin_vote

module Prelude

module Rand_distrib

module StrMap


module Run_main

module Talk



library calculon.extras

module Calculon_extras

module Irclog

module Plugin_markcough

module Gen

module Parse_logs

module Table



include Map.S with type key = string
val empty : 'a t
The empty map.
val is_empty : 'a t > bool
Test whether a map is empty or not.
mem x m
returns true
if m
contains a binding for x
, and false
otherwise.
add key data m
returns a map containing the same bindings as m
, plus a binding of key
to data
. If key
was already bound in m
to a value that is physically equal to data
, m
is returned unchanged (the result of the function is then physically equal to m
). Otherwise, the previous binding of key
in m
disappears.
singleton x y
returns the oneelement map that contains a binding y
for x
.
remove x m
returns a map containing the same bindings as m
, except for x
which is unbound in the returned map. If x
was not in m
, m
is returned unchanged (the result of the function is then physically equal to m
).
merge f m1 m2
computes a map whose keys are a subset of the keys of m1
and of m2
. The presence of each such binding, and the corresponding value, is determined with the function f
. In terms of the find_opt
operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2)
for any key x
, provided that f x None None = None
.
Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.
equal cmp m1 m2
tests whether the maps m1
and m2
are equal, that is, contain equal keys and associate them with equal data. cmp
is the equality predicate used to compare the data associated with the keys.
iter 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 bindings are passed to f
in increasing order with respect to the ordering over the type of the keys.
fold f m init
computes (f kN dN ... (f k1 d1 init)...)
, where k1 ... kN
are the keys of all bindings in m
(in increasing order), and d1 ... dN
are the associated data.
for_all f m
checks if all the bindings of the map satisfy the predicate f
.
exists f m
checks if at least one binding of the map satisfies the predicate f
.
filter f m
returns the map with all the bindings in m
that satisfy predicate p
. If every binding in m
satisfies f
, m
is returned unchanged (the result of the function is then physically equal to m
)
filter_map f m
applies the function f
to every binding of m
, and builds a map from the results. For each binding (k, v)
in the input map:
 if
f k v
isNone
thenk
is not in the result,  if
f k v
isSome v'
then the binding(k, v')
is in the output map.
For example, the following function on maps whose values are lists
filter_map
(fun _k li > match li with [] > None  _::tl > Some tl)
m
drops all bindings of m
whose value is an empty list, and pops the first element of each value that is nonempty.
partition f m
returns a pair of maps (m1, m2)
, where m1
contains all the bindings of m
that satisfy the predicate f
, and m2
is the map with all the bindings of m
that do not satisfy f
.
val cardinal : 'a t > int
Return the number of bindings of a map.
Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare
, where Ord
is the argument given to Stdlib.Map.Make
.
Return the binding with the smallest key in a given map (with respect to the Ord.compare
ordering), or raise Not_found
if the map is empty.
Same as min_binding
, but returns the binding with the largest key in the given map.
Return one binding of the given map, or raise Not_found
if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.
split x m
returns a triple (l, data, r)
, where l
is the map with all the bindings of m
whose key is strictly less than x
; r
is the map with all the bindings of m
whose key is strictly greater than x
; data
is None
if m
contains no binding for x
, or Some v
if m
binds v
to x
.
find x m
returns the current value of x
in m
, or raises Not_found
if no binding for x
exists.
find_last f m
, where f
is a monotonically decreasing function, returns the binding of m
with the highest key k
such that f k
, or raises Not_found
if no such key exists.
find_last_opt f m
, where f
is a monotonically decreasing function, returns an option containing the binding of m
with the highest key k
such that f k
, or None
if no such key exists.
map 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 bindings are passed to f
in increasing order with respect to the ordering over the type of the keys.
Same as map
, but the function receives as arguments both the key and the associated value for each binding of the map.
Maps and Sequences
get_or k m ~default
returns the value associated to k
if present, and returns default
otherwise (if k
doesn't belong in m
).
update k f m
calls f (Some v)
if find k m = v
, otherwise it calls f None
. In any case, if the result is None
k
is removed from m
, and if the result is Some v'
then add k v' m
is returned.
Safe version of min_binding
.
Safe version of max_binding
.
Find smallest binding satisfying the monotonic predicate. See Map.S.find_first
.
Safe version of find_first
.
val merge_safe :
f:( key > [ `Left of 'a  `Right of 'b  `Both of 'a * 'b ] > 'c option ) >
'a t >
'b t >
'c t
merge_safe ~f a b
merges the maps a
and b
together.
Union of both maps, using the function to combine bindings that belong to both inputs.
val add_iter : 'a t > (key * 'a) CCMap.iter > 'a t
Like add_list
.
val of_iter : (key * 'a) CCMap.iter > 'a t
Like of_list
.
val to_iter : 'a t > (key * 'a) CCMap.iter
Like to_list
.
val of_seq : (key * 'a) CCMap.sequence > 'a t
val add_seq : 'a t > (key * 'a) CCMap.sequence > 'a t
val to_seq : 'a t > (key * 'a) CCMap.sequence
Build a map from the given list of bindings k_i > v_i
, added in order using add
. If a key occurs several times, only its last binding will be present in the result.
val keys : _ t > key CCMap.iter
Iterate on keys only.
val values : 'a t > 'a CCMap.iter
Iterate on values only.
val pp :
?start:string >
?stop:string >
?arrow:string >
?sep:string >
key CCMap.printer >
'a CCMap.printer >
'a t CCMap.printer