pub enum GraphStrategy {
Key,
Template(String),
Fixed(NamedNode),
DefaultGraph,
}Expand description
Which graph a document’s default-graph triples go to.
Variants§
Key
The key itself, as a named graph IRI (the default).
Template(String)
An IRI template; {key} is replaced by the percent-encoded key.
Fixed(NamedNode)
One named graph shared by all documents.
DefaultGraph
The default graph.
Implementations§
Source§impl GraphStrategy
impl GraphStrategy
Sourcepub fn owns_target(&self) -> bool
pub fn owns_target(&self) -> bool
Does each document get a graph of its own? (Then replace and remove clear it whole.)
Trait Implementations§
Source§impl Clone for GraphStrategy
impl Clone for GraphStrategy
Source§impl Debug for GraphStrategy
impl Debug for GraphStrategy
Source§impl Default for GraphStrategy
impl Default for GraphStrategy
impl Eq for GraphStrategy
Source§impl PartialEq for GraphStrategy
impl PartialEq for GraphStrategy
impl StructuralPartialEq for GraphStrategy
Auto Trait Implementations§
impl Freeze for GraphStrategy
impl RefUnwindSafe for GraphStrategy
impl Send for GraphStrategy
impl Sync for GraphStrategy
impl Unpin for GraphStrategy
impl UnsafeUnpin for GraphStrategy
impl UnwindSafe for GraphStrategy
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> BorrowUnordered for T
impl<T> BorrowUnordered for T
fn as_unordered(&self) -> &Unordered<T>
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.