sig
module Set :
sig
type elt = Rdf_node.Ord_type.t
type t = Set.Make(Rdf_node.Ord_type).t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val of_list : elt list -> t
end
module Map :
sig
type key = Rdf_node.Ord_type.t
type 'a t = 'a Map.Make(Rdf_node.Ord_type).t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
end
type t = Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t
val empty : 'a Rdf_mem.Triples.Map.t
val add :
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t ->
Rdf_mem.Triples.Map.key ->
Rdf_mem.Triples.Map.key ->
Rdf_mem.Triples.Set.elt ->
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t
val rem :
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t ->
Rdf_mem.Triples.Map.key ->
Rdf_mem.Triples.Map.key ->
Rdf_mem.Triples.Set.elt ->
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t
val find :
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t ->
Rdf_mem.Triples.Map.key ->
Rdf_mem.Triples.Map.key -> Rdf_mem.Triples.Set.t
val find_list :
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t ->
Rdf_mem.Triples.Map.key ->
Rdf_mem.Triples.Map.key -> Rdf_mem.Triples.Set.elt list
val find2_list :
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t ->
Rdf_mem.Triples.Map.key ->
Rdf_mem.Triples.Set.elt -> Rdf_mem.Triples.Map.key list
val triples_y :
'a ->
'b ->
Rdf_mem.Triples.Set.t ->
('a * 'b * Rdf_mem.Triples.Set.elt) list ->
('a * 'b * Rdf_mem.Triples.Set.elt) list
val triples_x :
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t ->
Rdf_mem.Triples.Map.key ->
(Rdf_mem.Triples.Map.key * Rdf_mem.Triples.Map.key *
Rdf_mem.Triples.Set.elt)
list ->
(Rdf_mem.Triples.Map.key * Rdf_mem.Triples.Map.key *
Rdf_mem.Triples.Set.elt)
list
val triples :
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t ->
(Rdf_mem.Triples.Map.key * Rdf_mem.Triples.Map.key *
Rdf_mem.Triples.Set.elt)
list
val x_list :
Rdf_mem.Triples.Set.t Rdf_mem.Triples.Map.t Rdf_mem.Triples.Map.t ->
Rdf_mem.Triples.Map.key list
end