module Rdf_mem: sig
.. end
Memory storage, using tree-based sets.
val dbg : ?loc:string -> ?level:int -> (unit -> string) -> unit
module Triples: sig
.. end
type
t = {
}
type
error = string
exception Error of error
val string_of_error : 'a -> 'a
val open_graph : ?options:'a list -> Rdf_uri.uri -> t
val add_triple : t ->
sub:Triples.Map.key ->
pred:Triples.Map.key -> obj:Triples.Set.elt -> unit
val rem_triple : t ->
sub:Triples.Map.key ->
pred:Triples.Map.key -> obj:Triples.Set.elt -> unit
val subjects_of : t ->
pred:Triples.Map.key ->
obj:Triples.Map.key -> Triples.Set.elt list
val predicates_of : t ->
sub:Triples.Map.key ->
obj:Triples.Set.elt -> Triples.Map.key list
val objects_of : t ->
sub:Triples.Map.key ->
pred:Triples.Map.key -> Triples.Set.elt list
val find : ?sub:Triples.Map.key ->
?pred:Triples.Map.key ->
?obj:Triples.Map.key ->
t ->
(Triples.Map.key * Triples.Map.key * Triples.Set.elt)
list
val exists : ?sub:Triples.Map.key ->
?pred:Triples.Map.key ->
?obj:Triples.Map.key -> t -> bool
val subjects : t -> Triples.Map.key list
val predicates : t -> Triples.Map.key list
val objects : t -> Triples.Map.key list
val transaction_start : t -> unit
val transaction_commit : t -> unit
val transaction_rollback : t -> unit
val new_blank_id : t -> Rdf_node.blank_id
module Mem: sig
.. end