View Source RDF.Graph (RDF.ex v1.1.1)
A set of RDF triples with an optional name.
RDF.Graph
implements:
- Elixir's
Access
behaviour - Elixir's
Enumerable
protocol - Elixir's
Collectable
protocol - Elixir's
Inspect
protocol - the
RDF.Data
protocol
Link to this section Summary
Functions
Adds triples to a RDF.Graph
.
Adds RDF-star annotations to the given set of statements.
Adds prefixes
to the given graph
.
Returns the RDF.Graph
of all annotations.
Returns the base IRI of the given graph
.
Builds an RDF.Graph
from a description of its content in a graph DSL.
Canonicalizes the blank nodes of a graph according to the RDF Dataset Canonicalization spec.
Changes the graph name of graph
.
Removes all triples from graph
.
Clears the base IRI of the given graph
.
Clears the base IRI and all prefixes of the given graph
.
Clears all prefixes of the given graph
.
Deletes statements from a RDF.Graph
.
Deletes RDF-star annotations of a given set of statements.
See RDF.Star.Graph.delete_annotations/3
.
Deletes all statements with the given subjects
.
Deletes prefixes
from the given graph
.
Checks if a RDF.Graph
contains statements about the given resource.
Returns the description of the given subject
in the given graph
.
All RDF.Description
s within a RDF.Graph
.
Returns if the given graph
is empty.
Checks if two RDF.Graph
s are equal.
Fetches the description of the given subject.
Gets the description of the given subject
in the given graph
.
Gets and updates the description of the given subject, in a single pass.
Checks if the given input
statements exist within graph
.
Checks whether two graphs are equal, regardless of the concrete names of the blank nodes they contain.
Returns a nested map of a RDF.Graph
where each element from its triples is mapped with the given function.
Returns the graph name IRI of graph
.
Creates an RDF.Graph
.
Creates an RDF.Graph
initialized with data.
The set of all resources used in the objects within a RDF.Graph
.
Pops an arbitrary triple from a RDF.Graph
.
Pops the description of the given subject.
The set of all properties used in the predicates of the statements within a RDF.Graph
.
Returns the prefixes of the given graph
as a RDF.PrefixMap
.
Adds statements to a RDF.Graph
overwriting existing statements with the subjects given in the input
data.
Adds RDF-star annotations to the given set of statements overwriting all existing annotations with the given properties.
Adds RDF-star annotations to the given set of statements overwriting all existing annotations.
Adds statements to a RDF.Graph
and overwrites all existing statements with the same subject-predicate combinations given in the input
data.
The list of all statements within a RDF.Graph
as quads.
Execute the given query
against the given graph
.
Returns a Stream
for the execution of the given query
against the given graph
.
The set of all resources used within a RDF.Graph
.
Sets the base IRI of the given graph
.
The number of statements within a RDF.Graph
.
The number of subjects within a RDF.Graph
.
The set of all subjects used in the statements within a RDF.Graph
.
Creates a graph from another one by limiting its statements to those using one of the given subjects
.
The list of all statements within a RDF.Graph
.
Updates the description of the subject
in graph
with the given function.
Returns a nested map of the native Elixir values of a RDF.Graph
.
Returns the RDF.Graph
without all annotations.
Returns the RDF.Graph
without all statements including quoted triples on subject or object position.
Link to this section Types
@type get_and_update_description_fun() :: (RDF.Description.t() -> {RDF.Description.t(), input()} | :pop)
@type graph_description() :: %{ required(RDF.Star.Statement.subject()) => RDF.Description.t() }
@type input() :: RDF.Star.Statement.coercible() | {RDF.Star.Statement.coercible_subject(), RDF.Description.input()} | RDF.Description.t() | t() | %{ required(RDF.Star.Statement.coercible_subject()) => %{ required(RDF.Star.Statement.coercible_predicate()) => RDF.Star.Statement.coercible_object() | [RDF.Star.Statement.coercible_object()] } } | [input()]
@type t() :: %RDF.Graph{ base_iri: RDF.IRI.t() | nil, descriptions: graph_description(), name: RDF.IRI.t() | nil, prefixes: RDF.PrefixMap.t() | nil }
@type update_description_fun() :: (RDF.Description.t() -> RDF.Description.t())
Link to this section Functions
Adds triples to a RDF.Graph
.
The input
can be provided
- as a single statement tuple
- a nested subject-predicate-object map
- a
RDF.Description
- a
RDF.Graph
- or a list with any combination of the former
When the statements to be added are given as another RDF.Graph
,
the graph name must not match graph name of the graph to which the statements
are added. As opposed to that, RDF.Data.merge/2
will produce a RDF.Dataset
containing both graphs.
Also when the statements to be added are given as another RDF.Graph
, the
prefixes of this graph will be added. In case of conflicting prefix mappings
the original prefix from graph
will be kept.
RDF-star annotations to be added to all of the given statements can be specified with
the :add_annotations
, :put_annotations
or :put_annotation_properties
keyword
options. They have different addition semantics similar to the add_annotations/3
,
put_annotations/3
and put_annotation_properties/3
counterparts.
@spec add_annotations(t(), input(), RDF.Description.input() | nil) :: t()
Adds RDF-star annotations to the given set of statements.
The set of statements
can be given in any input form (see add/3
).
The predicate-objects pairs to be added as annotations can be given as a tuple, a list of tuples or a map.
@spec add_prefixes( t(), RDF.PrefixMap.t() | map() | keyword() | nil, RDF.PrefixMap.conflict_resolver() | nil ) :: t()
Adds prefixes
to the given graph
.
The prefixes
mappings can be given as any structure convertible to a
RDF.PrefixMap
.
When a prefix with another mapping already exists it will be overwritten with
the new one. This behaviour can be customized by providing a conflict_resolver
function. See RDF.PrefixMap.merge/3
for more on that.
Returns the RDF.Graph
of all annotations.
Note: The graph includes only triples where the subject is a quoted triple. Triples where only the object is a quoted triple are NOT included.
Returns the base IRI of the given graph
.
Builds an RDF.Graph
from a description of its content in a graph DSL.
All available opts of new/2
are also supported here.
For a description of the DSL see this guide.
Canonicalizes the blank nodes of a graph according to the RDF Dataset Canonicalization spec.
example
Example
iex> RDF.Graph.new([{~B<foo>, EX.p(), ~B<bar>}, {~B<bar>, EX.p(), ~B<foo>}])
...> |> RDF.Graph.canonicalize()
RDF.Graph.new([{~B<c14n0>, EX.p(), ~B<c14n1>}, {~B<c14n1>, EX.p(), ~B<c14n0>}])
@spec change_name(t(), RDF.Star.Statement.coercible_graph_name()) :: t()
Changes the graph name of graph
.
Removes all triples from graph
.
This function is useful for getting an empty graph based on the settings of another graph, as this function keeps graph name, base IRI and default prefixes as they are and just removes the triples.
Clears the base IRI of the given graph
.
Clears the base IRI and all prefixes of the given graph
.
Clears all prefixes of the given graph
.
Deletes statements from a RDF.Graph
.
When the statements to be deleted are given as another RDF.Graph
,
the graph name must not match graph name of the graph from which the statements
are deleted. If you want to delete only statements with matching graph names, you can
use RDF.Data.delete/2
.
The optional :delete_annotations
keyword option allows to set which of
the RDF-star annotations of the deleted statements should be deleted.
Any of the possible values of delete_annotations/3
can be provided here.
By default no annotations of the deleted statements will be removed.
Alternatively, the :add_annotations
, :put_annotations
or :put_annotation_properties
keyword options can be used to add annotations about the deleted statements
with the addition semantics similar to the respective add_annotations/3
,
put_annotations/3
and put_annotation_properties/3
counterparts.
Deletes RDF-star annotations of a given set of statements.
The statements
can be given in any input form (see add/3
).
If true
is given as the third argument or is delete_annotations/2
is used,
all annotations of the given statements
are deleted.
If a single predicate or list of predicates is given only statements with
these predicates from the annotations of the given statements
are deleted.
@spec delete_annotations( t(), input(), boolean() | RDF.Star.Statement.coercible_predicate() | [RDF.Star.Statement.coercible_predicate()] ) :: t()
See RDF.Star.Graph.delete_annotations/3
.
@spec delete_descriptions( t(), RDF.Star.Statement.coercible_subject() | [RDF.Star.Statement.coercible_subject()], keyword() ) :: t()
Deletes all statements with the given subjects
.
If subjects
contains subjects that are not in graph
, they're simply ignored.
The optional :delete_annotations
keyword option allows to set which of
the RDF-star annotations of the deleted statements should be deleted.
Any of the possible values of delete_annotations/3
can be provided here.
By default no annotations of the deleted statements will be removed.
Alternatively, the :add_annotations
, :put_annotations
or :put_annotation_properties
keyword options can be used to add annotations about the deleted statements
with the addition semantics similar to the respective add_annotations/3
,
put_annotations/3
and put_annotation_properties/3
counterparts.
@spec delete_prefixes(t(), RDF.PrefixMap.t()) :: t()
Deletes prefixes
from the given graph
.
The prefixes
can be a single prefix or a list of prefixes.
Prefixes not in prefixes of the graph are simply ignored.
@spec describes?(t(), RDF.Star.Statement.coercible_subject()) :: boolean()
Checks if a RDF.Graph
contains statements about the given resource.
examples
Examples
iex> RDF.Graph.new([{EX.S1, EX.p1, EX.O1}]) |> RDF.Graph.describes?(EX.S1)
true
iex> RDF.Graph.new([{EX.S1, EX.p1, EX.O1}]) |> RDF.Graph.describes?(EX.S2)
false
@spec description(t(), RDF.Star.Statement.coercible_subject()) :: RDF.Description.t()
Returns the description of the given subject
in the given graph
.
As opposed to get/3
this function returns an empty RDF.Description
when
the subject does not exist in the given graph
.
examples
Examples
iex> RDF.Graph.new([{EX.S1, EX.P1, EX.O1}, {EX.S2, EX.P2, EX.O2}])
...> |> RDF.Graph.description(EX.S1)
RDF.Description.new(EX.S1, init: {EX.P1, EX.O1})
iex> RDF.Graph.description(RDF.Graph.new(), EX.Foo)
RDF.Description.new(EX.Foo)
@spec descriptions(t()) :: [RDF.Description.t()]
All RDF.Description
s within a RDF.Graph
.
Returns if the given graph
is empty.
Note: You should always prefer this over the use of Enum.empty?/1
as it is significantly faster.
Checks if two RDF.Graph
s are equal.
Two RDF.Graph
s are considered to be equal if they contain the same triples
and have the same name. The prefixes of the graph are irrelevant for equality.
@spec fetch(t(), RDF.Star.Statement.coercible_subject()) :: {:ok, RDF.Description.t()} | :error
Fetches the description of the given subject.
When the subject can not be found :error
is returned.
examples
Examples
iex> RDF.Graph.new([{EX.S1, EX.P1, EX.O1}, {EX.S2, EX.P2, EX.O2}])
...> |> RDF.Graph.fetch(EX.S1)
{:ok, RDF.Description.new(EX.S1, init: {EX.P1, EX.O1})}
iex> RDF.Graph.new() |> RDF.Graph.fetch(EX.foo)
:error
@spec get(t(), RDF.Star.Statement.coercible_subject(), any()) :: RDF.Description.t() | any()
Gets the description of the given subject
in the given graph
.
When the subject can not be found the optionally given default value or
nil
is returned.
examples
Examples
iex> RDF.Graph.new([{EX.S1, EX.P1, EX.O1}, {EX.S2, EX.P2, EX.O2}])
...> |> RDF.Graph.get(EX.S1)
RDF.Description.new(EX.S1, init: {EX.P1, EX.O1})
iex> RDF.Graph.get(RDF.Graph.new(), EX.Foo)
nil
iex> RDF.Graph.get(RDF.Graph.new(), EX.Foo, :bar)
:bar
@spec get_and_update( t(), RDF.Star.Statement.coercible_subject(), get_and_update_description_fun() ) :: {RDF.Description.t(), t()}
Gets and updates the description of the given subject, in a single pass.
Invokes the passed function on the RDF.Description
of the given subject;
this function should return either {description_to_return, new_description}
or :pop
.
If the passed function returns {description_to_return, new_description}
, the
return value of get_and_update
is {description_to_return, new_graph}
where
new_graph
is the input Graph
updated with new_description
for
the given subject.
If the passed function returns :pop
the description for the given subject is
removed and a {removed_description, new_graph}
tuple gets returned.
examples
Examples
iex> RDF.Graph.new({EX.S, EX.P, EX.O})
...> |> RDF.Graph.get_and_update(EX.S, fn current_description ->
...> {current_description, {EX.P, EX.NEW}}
...> end)
{RDF.Description.new(EX.S, init: {EX.P, EX.O}), RDF.Graph.new({EX.S, EX.P, EX.NEW})}
Checks if the given input
statements exist within graph
.
Checks whether two graphs are equal, regardless of the concrete names of the blank nodes they contain.
examples
Examples
iex> RDF.Graph.new([{~B<foo>, EX.p(), ~B<bar>}, {~B<bar>, EX.p(), 42}])
...> |> RDF.Graph.isomorphic?(
...> RDF.Graph.new([{~B<b1>, EX.p(), ~B<b2>}, {~B<b2>, EX.p(), 42}]))
true
iex> RDF.Graph.new([{~B<foo>, EX.p(), ~B<bar>}, {~B<bar>, EX.p(), 42}])
...> |> RDF.Graph.isomorphic?(
...> RDF.Graph.new([{~B<b1>, EX.p(), ~B<b2>}, {~B<b3>, EX.p(), 42}]))
false
@spec map(t(), RDF.Star.Statement.term_mapping()) :: map()
Returns a nested map of a RDF.Graph
where each element from its triples is mapped with the given function.
The function fun
will receive a tuple {statement_position, rdf_term}
where
statement_position
is one of the atoms :subject
, :predicate
or :object
,
while rdf_term
is the RDF term to be mapped. When the given function returns
nil
this will be interpreted as an error and will become the overhaul result
of the map/2
call.
Note: RDF-star statements where the subject or object is a triple will be ignored.
examples
Examples
iex> RDF.Graph.new([
...> {~I<http://example.com/S1>, ~I<http://example.com/p>, ~L"Foo"},
...> {~I<http://example.com/S2>, ~I<http://example.com/p>, RDF.XSD.integer(42)}
...> ])
...> |> RDF.Graph.map(fn
...> {:predicate, predicate} ->
...> predicate
...> |> to_string()
...> |> String.split("/")
...> |> List.last()
...> |> String.to_atom()
...> {_, term} ->
...> RDF.Term.value(term)
...> end)
%{
"http://example.com/S1" => %{p: ["Foo"]},
"http://example.com/S2" => %{p: [42]}
}
@spec name(t()) :: RDF.Star.Statement.graph_name()
Returns the graph name IRI of graph
.
@spec new() :: t()
Creates an empty unnamed RDF.Graph
.
Creates an RDF.Graph
.
If a keyword list with options is given an empty graph is created. Otherwise an unnamed graph initialized with the given data is created.
See new/2
for available arguments and the different ways to provide data.
examples
Examples
RDF.Graph.new(name: EX.GraphName)
RDF.Graph.new(init: {EX.S, EX.p, EX.O})
RDF.Graph.new({EX.S, EX.p, EX.O})
Creates an RDF.Graph
initialized with data.
The initial RDF triples can be provided
- as a single statement tuple
- a nested subject-predicate-object map
- a
RDF.Description
- a
RDF.Graph
- a
RDF.Dataset
- or a list with any combination of the former
Available options:
name
: the name of the graph to be createdprefixes
: some prefix mappings which should be stored alongside the graph and will be used for example when serializing in a format with prefix supportbase_iri
: a base IRI which should be stored alongside the graph and will be used for example when serializing in a format with base IRI supportinit
: some data with which the graph should be initialized; the data can be provided in any form accepted byadd/3
and above that also with a function returning the initialization data in any of these forms
examples
Examples
RDF.Graph.new({EX.S, EX.p, EX.O})
RDF.Graph.new({EX.S, EX.p, EX.O}, name: EX.GraphName)
RDF.Graph.new({EX.S, EX.p, [EX.O1, EX.O2]})
RDF.Graph.new([{EX.S1, EX.p1, EX.O1}, {EX.S2, EX.p2, EX.O2}])
RDF.Graph.new(RDF.Description.new(EX.S, EX.P, EX.O))
RDF.Graph.new([graph, description, triple])
RDF.Graph.new({EX.S, EX.p, EX.O}, name: EX.GraphName, base_iri: EX.base)
The set of all resources used in the objects within a RDF.Graph
.
Note: This function does collect only IRIs and BlankNodes, not Literals.
examples
Examples
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p2, EX.O2},
...> {EX.S3, EX.p1, EX.O2},
...> {EX.S4, EX.p2, RDF.bnode(:bnode)},
...> {EX.S5, EX.p3, "foo"}])
...> |> RDF.Graph.objects()
MapSet.new([RDF.iri(EX.O1), RDF.iri(EX.O2), RDF.bnode(:bnode)])
@spec pop(t()) :: {RDF.Star.Statement.t() | nil, t()}
Pops an arbitrary triple from a RDF.Graph
.
@spec pop(t(), RDF.Star.Statement.coercible_subject()) :: {RDF.Description.t() | nil, t()}
Pops the description of the given subject.
Removes the description of the given subject
from graph
.
Returns a tuple containing the description of the given subject
and the updated graph without this description.
nil
is returned instead of the description if graph
does
not contain a description of the given subject
.
examples
Examples
iex> RDF.Graph.new([{EX.S1, EX.P1, EX.O1}, {EX.S2, EX.P2, EX.O2}])
...> |> RDF.Graph.pop(EX.S1)
{
RDF.Description.new(EX.S1, init: {EX.P1, EX.O1}),
RDF.Graph.new({EX.S2, EX.P2, EX.O2})
}
iex> RDF.Graph.new({EX.S, EX.P, EX.O})
...> |> RDF.Graph.pop(EX.Missing)
{nil, RDF.Graph.new({EX.S, EX.P, EX.O})}
The set of all properties used in the predicates of the statements within a RDF.Graph
.
examples
Examples
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p2, EX.O2},
...> {EX.S1, EX.p2, EX.O3}])
...> |> RDF.Graph.predicates()
MapSet.new([EX.p1, EX.p2])
@spec prefixes(t()) :: RDF.PrefixMap.t() | nil
Returns the prefixes of the given graph
as a RDF.PrefixMap
.
Adds statements to a RDF.Graph
overwriting existing statements with the subjects given in the input
data.
When the statements to be added are given as another RDF.Graph
, the prefixes
of this graph will be added. In case of conflicting prefix mappings the
original prefix from graph
will be kept.
RDF-star annotations to be added to all of the given statements can be specified with
the :add_annotations
, :put_annotations
or :put_annotation_properties
keyword
options. They have different addition semantics similar to the add_annotations/3
,
put_annotations/3
and put_annotation_properties/3
counterparts.
What should happen with the annotations of statements which got deleted during the overwrite, can be controlled with these keyword options:
:delete_annotations_on_deleted
: deletes all or some annotations of the deleted statements (seedelete_annotations/3
on possible values):add_annotations_on_deleted
,:put_annotations_on_deleted
,:put_annotation_properties_on_deleted
: add annotations about the deleted statements with the respective addition semantics similar to the keyword options with the_on_deleted
suffix mentioned above
examples
Examples
iex> RDF.Graph.new([{EX.S1, EX.P1, EX.O1}, {EX.S2, EX.P2, EX.O2}])
...> |> RDF.Graph.put([{EX.S1, EX.P3, EX.O3}])
RDF.Graph.new([{EX.S1, EX.P3, EX.O3}, {EX.S2, EX.P2, EX.O2}])
@spec put_annotation_properties(t(), input(), RDF.Description.input() | nil) :: t()
Adds RDF-star annotations to the given set of statements overwriting all existing annotations with the given properties.
The set of statements
can be given in any input form (see add/3
).
The predicate-objects pairs to be added as annotations can be given as a tuple, a list of tuples or a map.
@spec put_annotations(t(), input(), RDF.Description.input() | nil) :: t()
Adds RDF-star annotations to the given set of statements overwriting all existing annotations.
The set of statements
can be given in any input form (see add/3
).
The predicate-objects pairs to be added as annotations can be given as a tuple, a list of tuples or a map.
Adds statements to a RDF.Graph
and overwrites all existing statements with the same subject-predicate combinations given in the input
data.
When the statements to be added are given as another RDF.Graph
, the prefixes
of this graph will be added. In case of conflicting prefix mappings the
original prefix from graph
will be kept.
RDF-star annotations to be added to all of the given statements can be specified with
the :add_annotations
, :put_annotations
or :put_annotation_properties
keyword
options. They have different addition semantics similar to the add_annotations/3
,
put_annotations/3
and put_annotation_properties/3
counterparts.
What should happen with the annotations of statements which got deleted during the overwrite, can be controlled with these keyword options:
:delete_annotations_on_deleted
: deletes all or some annotations of the deleted statements (seedelete_annotations/3
on possible values):add_annotations_on_deleted
,:put_annotations_on_deleted
,:put_annotation_properties_on_deleted
: add annotations about the deleted statements with the respective addition semantics similar to the keyword options with the_on_deleted
suffix mentioned above
examples
Examples
iex> RDF.Graph.new([{EX.S1, EX.P1, EX.O1}, {EX.S2, EX.P2, EX.O2}])
...> |> RDF.Graph.put_properties([{EX.S1, EX.P2, EX.O3}, {EX.S2, EX.P2, EX.O3}])
RDF.Graph.new([{EX.S1, EX.P1, EX.O1}, {EX.S1, EX.P2, EX.O3}, {EX.S2, EX.P2, EX.O3}])
@spec quads( t(), keyword() ) :: [RDF.Star.Quad.t()]
The list of all statements within a RDF.Graph
as quads.
When the optional :filter_star
flag is set to true
RDF-star triples with
a triple as subject or object will be filtered. The default value is false
.
examples
Examples
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p2, EX.O2},
...> {EX.S1, EX.p2, EX.O3}
...> ], name: EX.Graph)
...> |> RDF.Graph.quads()
[{RDF.iri(EX.S1), RDF.iri(EX.p1), RDF.iri(EX.O1), RDF.iri(EX.Graph)},
{RDF.iri(EX.S1), RDF.iri(EX.p2), RDF.iri(EX.O3), RDF.iri(EX.Graph)},
{RDF.iri(EX.S2), RDF.iri(EX.p2), RDF.iri(EX.O2), RDF.iri(EX.Graph)}]
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p2, EX.O2},
...> {EX.S1, EX.p2, EX.O3}])
...> |> RDF.Graph.quads()
[{RDF.iri(EX.S1), RDF.iri(EX.p1), RDF.iri(EX.O1), nil},
{RDF.iri(EX.S1), RDF.iri(EX.p2), RDF.iri(EX.O3), nil},
{RDF.iri(EX.S2), RDF.iri(EX.p2), RDF.iri(EX.O2), nil}]
Execute the given query
against the given graph
.
This is just a convenience delegator function to RDF.Query.execute!/3
with
the first two arguments swapped so it can be used in a pipeline on a RDF.Graph
.
See RDF.Query.execute/3
and RDF.Query.execute!/3
for more information and examples.
Returns a Stream
for the execution of the given query
against the given graph
.
This is just a convenience delegator function to RDF.Query.stream!/3
with
the first two arguments swapped so it can be used in a pipeline on a RDF.Graph
.
See RDF.Query.stream/3
and RDF.Query.stream!/3
for more information and examples.
The set of all resources used within a RDF.Graph
.
examples
Examples
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p1, EX.O2},
...> {EX.S2, EX.p2, RDF.bnode(:bnode)},
...> {EX.S3, EX.p1, "foo"}])
...> |> RDF.Graph.resources()
MapSet.new([RDF.iri(EX.S1), RDF.iri(EX.S2), RDF.iri(EX.S3),
RDF.iri(EX.O1), RDF.iri(EX.O2), RDF.bnode(:bnode), EX.p1, EX.p2])
Sets the base IRI of the given graph
.
The base_iri
can be given as anything accepted by RDF.IRI.coerce_base/1
.
@spec statement_count(t()) :: non_neg_integer()
The number of statements within a RDF.Graph
.
examples
Examples
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p2, EX.O2},
...> {EX.S1, EX.p2, EX.O3}])
...> |> RDF.Graph.statement_count()
3
See RDF.Graph.triples/2
.
@spec subject_count(t()) :: non_neg_integer()
The number of subjects within a RDF.Graph
.
examples
Examples
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p2, EX.O2},
...> {EX.S1, EX.p2, EX.O3}])
...> |> RDF.Graph.subject_count()
2
The set of all subjects used in the statements within a RDF.Graph
.
examples
Examples
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p2, EX.O2},
...> {EX.S1, EX.p2, EX.O3}])
...> |> RDF.Graph.subjects()
MapSet.new([RDF.iri(EX.S1), RDF.iri(EX.S2)])
@spec take( t(), [RDF.Star.Statement.coercible_subject()] | Enum.t() | nil, [RDF.Star.Statement.coercible_predicate()] | Enum.t() | nil ) :: t()
Creates a graph from another one by limiting its statements to those using one of the given subjects
.
If subjects
contains IRIs that are not used in the graph
, they're simply ignored.
The optional properties
argument allows to limit also properties of the subject descriptions.
If nil
is passed as the subjects
, the subjects will not be limited.
@spec triples( t(), keyword() ) :: [RDF.Star.Triple.t()]
The list of all statements within a RDF.Graph
.
When the optional :filter_star
flag is set to true
RDF-star triples with
a triple as subject or object will be filtered. The default value is false
.
examples
Examples
iex> RDF.Graph.new([
...> {EX.S1, EX.p1, EX.O1},
...> {EX.S2, EX.p2, EX.O2},
...> {EX.S1, EX.p2, EX.O3}])
...> |> RDF.Graph.triples()
[{RDF.iri(EX.S1), RDF.iri(EX.p1), RDF.iri(EX.O1)},
{RDF.iri(EX.S1), RDF.iri(EX.p2), RDF.iri(EX.O3)},
{RDF.iri(EX.S2), RDF.iri(EX.p2), RDF.iri(EX.O2)}]
@spec update( t(), RDF.Star.Statement.coercible_subject(), RDF.Description.input() | nil, update_description_fun() ) :: t()
Updates the description of the subject
in graph
with the given function.
If subject
is present in graph
with description
as description,
fun
is invoked with argument description
and its result is used as the new
description of subject
. If subject
is not present in graph
,
initial
is inserted as the description of subject
. If no initial
value is
given, the graph
remains unchanged. If nil
is returned by fun
, the
respective description will be removed from graph
.
The initial value and the returned objects by the update function will be tried
te coerced to proper RDF descriptions before added. If the initial or returned
description is a RDF.Description
with another subject, the respective
statements are added with subject
as subject.
examples
Examples
iex> RDF.Graph.new({EX.S, EX.p, EX.O})
...> |> RDF.Graph.update(EX.S,
...> fn description -> Description.add(description, {EX.p, EX.O2})
...> end)
RDF.Graph.new([{EX.S, EX.p, EX.O}, {EX.S, EX.p, EX.O2}])
iex> RDF.Graph.new({EX.S, EX.p, EX.O})
...> |> RDF.Graph.update(EX.S,
...> fn _ -> Description.new(EX.S2, init: {EX.p2, EX.O2})
...> end)
RDF.Graph.new([{EX.S, EX.p2, EX.O2}])
iex> RDF.Graph.new()
...> |> RDF.Graph.update(EX.S, Description.new(EX.S, init: {EX.p, EX.O}),
...> fn description -> Description.add(description, {EX.p, EX.O2})
...> end)
RDF.Graph.new([{EX.S, EX.p, EX.O}])
Returns a nested map of the native Elixir values of a RDF.Graph
.
When a :context
option is given with a RDF.PropertyMap
, predicates will
be mapped to the terms defined in the RDF.PropertyMap
, if present.
examples
Examples
iex> RDF.Graph.new([
...> {~I<http://example.com/S1>, ~I<http://example.com/p>, ~L"Foo"},
...> {~I<http://example.com/S2>, ~I<http://example.com/p>, RDF.XSD.integer(42)}
...> ])
...> |> RDF.Graph.values()
%{
"http://example.com/S1" => %{"http://example.com/p" => ["Foo"]},
"http://example.com/S2" => %{"http://example.com/p" => [42]}
}
iex> RDF.Graph.new([
...> {~I<http://example.com/S1>, ~I<http://example.com/p>, ~L"Foo"},
...> {~I<http://example.com/S2>, ~I<http://example.com/p>, RDF.XSD.integer(42)}
...> ])
...> |> RDF.Graph.values(context: [p: ~I<http://example.com/p>])
%{
"http://example.com/S1" => %{p: ["Foo"]},
"http://example.com/S2" => %{p: [42]}
}
Returns the RDF.Graph
without all annotations.
Note: This function excludes only triples where the subject is a quoted triple.
If you want to exclude also triples where the object is a quoted triple,
you'll have to use RDF.Graph.without_star_statements/1
.
Returns the RDF.Graph
without all statements including quoted triples on subject or object position.
This function is relatively costly, since it requires a full walk-through of all triples.
In many cases quoted triples are only used on subject position, where you can use
the significantly faster RDF.Graph.without_annotations/1
.