Struct List 

pub struct List<T, B> { /* private fields */ }

List object.

Implementations

impl<T, B> List<T, B>

pub fn new(objects: Vec<IndexedObject<T, B>>) -> Self

Creates a new list object.

pub fn len(&self) -> usize

Returns the number of objects in the list.

pub fn is_empty(&self) -> bool

Checks whether the list holds no objects.

pub fn entry(&self) -> &[IndexedObject<T, B>]

Returns the objects of the @list entry, in list order.

Alias for as_slice.

pub fn entry_mut(&mut self) -> &mut Vec<IndexedObject<T, B>>

Mutably borrows the objects of the @list entry.

pub fn as_slice(&self) -> &[IndexedObject<T, B>]

Returns the objects of the list as a slice, in list order.

pub fn as_mut_slice(&mut self) -> &mut [IndexedObject<T, B>]

Returns the objects of the list as a mutable slice, in list order.

pub fn into_entry(self) -> Vec<IndexedObject<T, B>>

Consumes the list, returning the objects of its @list entry.

pub fn push(&mut self, object: IndexedObject<T, B>)

Appends an object to the end of the list.

pub fn pop(&mut self) -> Option<IndexedObject<T, B>>

Removes the last object of the list and returns it.

pub fn iter(&self) -> Iter<'_, IndexedObject<T, B>>

Returns an iterator over the objects of the list, in list order.

pub fn iter_mut(&mut self) -> IterMut<'_, IndexedObject<T, B>>

Returns a mutable iterator over the objects of the list, in list order.

pub fn canonicalize_with(&mut self, buffer: &mut Buffer)

Puts every literal of the list into canonical form, using the given buffer to render numbers.

pub fn canonicalize(&mut self)

Puts every literal of the list into canonical form.

pub fn map_ids<U, C>( self, map_iri: impl FnMut(T) -> U, map_id: impl FnMut(Id<T, B>) -> Id<U, C>, ) -> List<U, C>

where U: Eq + Hash, C: Eq + Hash,

Rewrites every IRI and identifier of the list (recursively) with the given functions.

Trait Implementations

impl<T, B> Any<T, B> for List<T, B>

fn as_ref(&self) -> Ref<'_, T, B>

Borrows the object as a value, node or list reference.

fn id(&self) -> Option<&Id<T, B>>

Returns the identifier (@id) of the object, if it is a node object with one.

fn language<'a>(&'a self) -> Option<&'a LenientLangTag>

where T: 'a, B: 'a,

Returns the language tag of this value, if it carries one.

fn is_value(&self) -> bool

Checks whether the object is a value object.

fn is_node(&self) -> bool

Checks whether the object is a node object.

fn is_graph(&self) -> bool

Checks whether the object is a graph object (a node object with a @graph entry).

fn is_list(&self) -> bool

Checks whether the object is a list object.

impl<T: Clone, B: Clone> Clone for List<T, B>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, B: Debug> Debug for List<T, B>

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

Formats the value using the given formatter.

impl<T, B> Drop for List<T, B>

fn drop(&mut self)

Drops the list’s objects iteratively, as Node drops its own.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl<T: Eq + Hash, B: Eq + Hash> Eq for List<T, B>

impl<T: Hash, B: Hash> Hash for List<T, B>

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<'a, T, B> IntoIterator for &'a List<T, B>

type Item = &'a Indexed<Object<T, B>>

The type of the elements being iterated over.

type IntoIter = Iter<'a, Indexed<Object<T, B>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T, B> IntoIterator for &'a mut List<T, B>

type Item = &'a mut Indexed<Object<T, B>>

The type of the elements being iterated over.

type IntoIter = IterMut<'a, Indexed<Object<T, B>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, B> IntoIterator for List<T, B>

type Item = Indexed<Object<T, B>>

The type of the elements being iterated over.

type IntoIter = IntoIter<Indexed<Object<T, B>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, B, N: Vocabulary<Iri = T, BlankId = B>> IntoJsonWithContext<N> for List<T, B>

fn into_json_with(self, vocabulary: &N) -> Value

Converts this value into JSON, resolving the identifiers it holds against the given vocabulary.

impl<T, B, I: Interpretation> LinkedData<I> for List<T, B>

where T: LinkedDataResource<I> + LinkedDataSubject<I>, B: LinkedDataResource<I> + LinkedDataSubject<I>,

fn visit<S>(&self, visitor: S) -> Result<S::Ok, S::Error>

where S: Visitor<I>,

Visit the RDF dataset represented by this type.

impl<T, B, I: Interpretation> LinkedDataGraph<I> for List<T, B>

where T: LinkedDataResource<I> + LinkedDataSubject<I>, B: LinkedDataResource<I> + LinkedDataSubject<I>,

fn visit_graph<S>(&self, visitor: S) -> Result<S::Ok, S::Error>

where S: GraphVisitor<I>,

Visits the subjects of the graph represented by this value.

impl<T, B, I: Interpretation> LinkedDataPredicateObjects<I> for List<T, B>

where T: LinkedDataResource<I> + LinkedDataSubject<I>, B: LinkedDataResource<I> + LinkedDataSubject<I>,

fn visit_objects<S>(&self, visitor: S) -> Result<S::Ok, S::Error>

where S: PredicateObjectsVisitor<I>,

Visits the objects this predicate points at.

impl<T, B, I: Interpretation> LinkedDataResource<I> for List<T, B>

fn interpretation( &self, _interpretation: &mut I, ) -> ResourceInterpretation<'_, I>

Returns the interpretation of this resource, inserting it into interpretation if required.

fn lexical_representation<'a>( &'a self, interpretation: &'a mut I, ) -> Option<CowRdfTerm<'a>>

where I: ReverseInterpretation + ReverseLocalInterpretation,

Returns the lexical term representing this resource, if any.

fn reference_interpretation( &self, interpretation: &mut I, ) -> ResourceInterpretation<'_, I>

Returns the interpretation to use when this resource appears as a reference rather than as a subject with properties.

impl<T, B, I: Interpretation> LinkedDataSubject<I> for List<T, B>

where T: LinkedDataResource<I> + LinkedDataSubject<I>, B: LinkedDataResource<I> + LinkedDataSubject<I>,

fn visit_subject<S>(&self, visitor: S) -> Result<S::Ok, S::Error>

where S: SubjectVisitor<I>,

Visits the properties of the subject represented by this value.

impl<T: Eq + Hash, B: Eq + Hash> MappedEq for List<T, B>

type BlankId = B

Blank node identifier type the renaming applies to.

fn mapped_eq<'a, 'b, F: Clone + Fn(&'a B) -> &'b B>( &'a self, other: &Self, f: F, ) -> bool

where B: 'a + 'b,

Structural equality with mapped blank identifiers.

impl<T, B> PartialEq for List<T, B>

where T: Eq + Hash, B: Eq + Hash,

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

Equality operator ==.

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

Inequality operator !=.

impl<T, B> Relabel<T, B> for List<T, B>

fn relabel_with<N: VocabularyMut<Iri = T, BlankId = B>, G: LocalGenerator>( &mut self, vocabulary: &mut N, generator: &mut G, relabeling: &mut HashMap<B, ValidId<T, B>>, ) -> Result<(), GeneratedIdError>

where T: Clone + Eq + Hash, B: Clone + Eq + Hash,

Relabels every blank node, recording the mapping so shared nodes keep the same new identifier.

fn relabel<G: LocalGenerator>( &mut self, generator: &mut G, relabeling: &mut HashMap<B, ValidId<T, B>>, ) -> Result<(), GeneratedIdError>

where T: Clone + Eq + Hash, B: Clone + Eq + Hash, (): Vocabulary<Iri = T, BlankId = B>,

Relabels every blank node, recording the mapping.