@ -540,7 +540,7 @@ impl<'a> From<TripleRef<'a>> for rio::Triple<'a> {
}
}
/// A possible owned graph name.
/// A possible owned graph name.
/// It is the union of [IRIs](https://www.w3.org/TR/rdf11-concepts/#dfn-iri), [blank nodes](https://www.w3.org/TR/rdf11-concepts/#dfn-blank-node) and the [default graph name](https://www.w3.org/TR/rdf11-concepts/#dfn-default-graph).
/// It is the union of [IRIs](https://www.w3.org/TR/rdf11-concepts/#dfn-iri), [blank nodes](https://www.w3.org/TR/rdf11-concepts/#dfn-blank-node), and the [default graph name](https://www.w3.org/TR/rdf11-concepts/#dfn-default-graph).
#[derive(Eq, PartialEq, Debug, Clone, Hash)]
#[derive(Eq, PartialEq, Debug, Clone, Hash)]
pubenumGraphName{
pubenumGraphName{
NamedNode(NamedNode),
NamedNode(NamedNode),
@ -649,7 +649,7 @@ impl From<GraphName> for Option<NamedOrBlankNode> {
}
}
/// A possible borrowed graph name.
/// A possible borrowed graph name.
/// It is the union of [IRIs](https://www.w3.org/TR/rdf11-concepts/#dfn-iri), [blank nodes](https://www.w3.org/TR/rdf11-concepts/#dfn-blank-node) and the [default graph name](https://www.w3.org/TR/rdf11-concepts/#dfn-default-graph).
/// It is the union of [IRIs](https://www.w3.org/TR/rdf11-concepts/#dfn-iri), [blank nodes](https://www.w3.org/TR/rdf11-concepts/#dfn-blank-node), and the [default graph name](https://www.w3.org/TR/rdf11-concepts/#dfn-default-graph).
/// It is implemented using the canonicalization approach presented in
/// It is implemented using the canonicalization approach presented in
/// [Canonical Forms for Isomorphic and Equivalent RDF Graphs: Algorithms for Leaning and Labelling Blank Nodes, Aidan Hogan, 2017](http://aidanhogan.com/docs/rdf-canonicalisation.pdf)
/// [Canonical Forms for Isomorphic and Equivalent RDF Graphs: Algorithms for Leaning and Labelling Blank Nodes, Aidan Hogan, 2017](http://aidanhogan.com/docs/rdf-canonicalisation.pdf)
///
///
/// Warning: This implementation worst-case complexity is in O(b!) with b the number of blank node node in the input graphs.
/// Warning: This implementation worst-case complexity is in O(b!) with b the number of blank nodes in the input graphs.
pubfnis_isomorphic(&self,other: &Self)-> bool{
pubfnis_isomorphic(&self,other: &Self)-> bool{
iso_canonicalize(self)==iso_canonicalize(other)
iso_canonicalize(self)==iso_canonicalize(other)
}
}
@ -1086,7 +1086,7 @@ impl MemoryPreparedQuery {
}
}
}
}
/// Allows to insert and delete quads during an ACID transaction with the [`MemoryStore`](struct.MemoryStore.html).
/// Allows inserting and deleting quads during an ACID transaction with the [`MemoryStore`](struct.MemoryStore.html).