Struct GraphCollection 

pub struct GraphCollection { /* private fields */ }

Implementations

impl GraphCollection

pub fn new(id: &IriOrBlankNode) -> Self

pub fn with_collection<I: Iterator<Item = NamedGraphDescription>>( self, graphs: I, ) -> Self

pub fn named_graph_descriptions( &self, ) -> impl Iterator<Item = &NamedGraphDescription>

Trait Implementations

impl Clone for GraphCollection

fn clone(&self) -> GraphCollection

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphCollection

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphCollection

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for GraphCollection

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for GraphCollection

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for GraphCollection

fn eq(&self, other: &GraphCollection) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GraphCollection

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for GraphCollection

impl StructuralPartialEq for GraphCollection