Struct RdfUnordered 

pub struct RdfUnordered<T>(pub T);

Utility wrapper to turn lists into unordered collections.

Tuple Fields

0: T

Trait Implementations

impl<T: Clone> Clone for RdfUnordered<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Copy> Copy for RdfUnordered<T>

impl<T: Debug> Debug for RdfUnordered<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for RdfUnordered<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Eq> Eq for RdfUnordered<T>

impl<T: PartialEq> PartialEq for RdfUnordered<T>

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

Equality operator ==.

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

Inequality operator !=.

impl<R: Clone + Ord, T: SerializeLinkedDataUnordered<R>> SerializeLinkedData<R> for RdfUnordered<T>

fn serialize_rdf<S>( &self, serializer: S, graph: Option<&R>, ) -> Result<S::Ok, S::Error>

where S: LinkedDataSerializer<R>,

fn serialize_rdf_subjects<S>( &self, serializer: S, predicate: &R, object: &R, graph: Option<&R>, ) -> Result<S::Ok, S::Error>

where S: LinkedDataSerializer<R>,

fn serialize_rdf_objects<S>( &self, serializer: S, subject: &R, predicate: &R, graph: Option<&R>, ) -> Result<S::Ok, S::Error>

where S: LinkedDataSerializer<R>,

fn serialize_rdf_graph<S>( &self, serializer: S, graph: Option<&R>, ) -> Result<S::Ok, S::Error>

where S: LinkedDataSerializer<R>,

Serialize quads, ignoring top level resources.

impl<T: PartialEq> StructuralPartialEq for RdfUnordered<T>