Bigraph.RelImplementation of finite binary relations over non negative integers.
val pp :
Ppx_deriving_runtime.Format.formatter ->
t ->
Ppx_deriving_runtime.unitval to_yojson : t -> Yojson.Safe.tval of_yojson : Yojson.Safe.t -> t Ppx_deriving_yojson_runtime.error_orThese follow the standard Map module conventions.
val cardinal : t -> intval empty : tval is_empty : t -> boolval mem : int -> t -> boolval of_list : (int * int list) list -> tInverse of Rel.to_list. Note that in case of clashing pairs only the right-most is used.
val show : t -> stringReturn the string representation of a binary relation. Example:
{(1, {1, 2, 3}), (2, {3, 4})}add i set r adds set to the values associated to i in relation r. All the elements of set and i must be non negative.