pub struct List<T, B, M> { /* private fields */ }
Expand description
List object.
Implementations§
source§impl<T, B, M> List<T, B, M>
impl<T, B, M> List<T, B, M>
pub fn new( key_metadata: M, value: Meta<Vec<Meta<Indexed<Object<T, B, M>, M>, M>, Global>, M> ) -> List<T, B, M>
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
sourcepub fn entry(
&self
) -> &Entry<Vec<Meta<Indexed<Object<T, B, M>, M>, M>, Global>, M>
pub fn entry( &self ) -> &Entry<Vec<Meta<Indexed<Object<T, B, M>, M>, M>, Global>, M>
Returns a reference to the “@list” entry of the list object.
pub fn entry_mut( &mut self ) -> &mut Entry<Vec<Meta<Indexed<Object<T, B, M>, M>, M>, Global>, M>
pub fn into_entry( self ) -> Entry<Vec<Meta<Indexed<Object<T, B, M>, M>, M>, Global>, M>
pub fn push(&mut self, object: Meta<Indexed<Object<T, B, M>, M>, M>)
pub fn pop(&mut self) -> Option<Meta<Indexed<Object<T, B, M>, M>, M>>
pub fn iter(&self) -> Iter<'_, Meta<Indexed<Object<T, B, M>, M>, M>>
pub fn iter_mut(&mut self) -> IterMut<'_, Meta<Indexed<Object<T, B, M>, M>, M>>
pub fn as_slice(&self) -> &[Meta<Indexed<Object<T, B, M>, M>, M>]
pub fn as_mut_slice(&mut self) -> &mut [Meta<Indexed<Object<T, B, M>, M>, M>]
sourcepub fn canonicalize_with(&mut self, buffer: &mut Buffer)
pub fn canonicalize_with(&mut self, buffer: &mut Buffer)
Puts this list object literals into canonical form using the given
buffer
.
The buffer is used to compute the canonical form of numbers.
sourcepub fn canonicalize(&mut self)
pub fn canonicalize(&mut self)
Puts this list object literals into canonical form.
Trait Implementations§
source§impl<T, B, M> Any<T, B, M> for List<T, B, M>
impl<T, B, M> Any<T, B, M> for List<T, B, M>
fn as_ref(&self) -> Ref<'_, T, B, M>
fn id_entry<'a>(&'a self) -> Option<&'a Entry<Id<T, B>, M>>where M: 'a,
fn id<'a>(&'a self) -> Option<&'a Meta<Id<T, B>, M>>where M: 'a,
fn language<'a>(&'a self) -> Option<LenientLanguageTag<'a>>where T: 'a, B: 'a, M: 'a,
fn is_value(&self) -> bool
fn is_node(&self) -> bool
fn is_graph(&self) -> bool
fn is_list(&self) -> bool
source§impl<'a, T, B, M> IntoIterator for &'a List<T, B, M>
impl<'a, T, B, M> IntoIterator for &'a List<T, B, M>
source§impl<'a, T, B, M> IntoIterator for &'a mut List<T, B, M>
impl<'a, T, B, M> IntoIterator for &'a mut List<T, B, M>
source§impl<T, B, M> IntoIterator for List<T, B, M>
impl<T, B, M> IntoIterator for List<T, B, M>
source§impl<T, B, M, N> IntoJsonWithContextMeta<M, N> for List<T, B, M>where
M: Clone,
N: Vocabulary<Iri = T, BlankId = B>,
impl<T, B, M, N> IntoJsonWithContextMeta<M, N> for List<T, B, M>where M: Clone, N: Vocabulary<Iri = T, BlankId = B>,
source§impl<T, B, M> PartialEq<List<T, B, M>> for List<T, B, M>where
T: Eq + Hash,
B: Eq + Hash,
M: PartialEq<M>,
impl<T, B, M> PartialEq<List<T, B, M>> for List<T, B, M>where T: Eq + Hash, B: Eq + Hash, M: PartialEq<M>,
source§impl<T, B, M> Relabel<T, B, M> for List<T, B, M>
impl<T, B, M> Relabel<T, B, M> for List<T, B, M>
fn relabel_with<N, G>( &mut self, vocabulary: &mut N, generator: &mut G, relabeling: &mut HashMap<B, Meta<Id<T, B>, M>, BuildHasherDefault<AHasher>, Global> )where N: Vocabulary<Iri = T, BlankId = B>, G: MetaGenerator<N, M>, M: Clone, T: Clone + Eq + Hash, B: Clone + Eq + Hash,
source§impl<T, B, M> StrippedHash for List<T, B, M>where
T: Hash,
B: Hash,
impl<T, B, M> StrippedHash for List<T, B, M>where T: Hash, B: Hash,
fn stripped_hash<H>(&self, state: &mut H)where H: Hasher,
source§impl<T, B, M> StrippedPartialEq<List<T, B, M>> for List<T, B, M>where
T: Eq + Hash,
B: Eq + Hash,
impl<T, B, M> StrippedPartialEq<List<T, B, M>> for List<T, B, M>where T: Eq + Hash, B: Eq + Hash,
fn stripped_eq(&self, other: &List<T, B, M>) -> bool
impl<T, B, M> Eq for List<T, B, M>where T: Eq + Hash, B: Eq + Hash, M: Eq,
impl<T, B, M> StrippedEq for List<T, B, M>where T: Eq + Hash, B: Eq + Hash,
Auto Trait Implementations§
impl<T, B, M> RefUnwindSafe for List<T, B, M>where B: RefUnwindSafe, M: RefUnwindSafe, T: RefUnwindSafe,
impl<T, B, M> Send for List<T, B, M>where B: Send, M: Send, T: Send,
impl<T, B, M> Sync for List<T, B, M>where B: Sync, M: Sync, T: Sync,
impl<T, B, M> Unpin for List<T, B, M>where M: Unpin, T: Unpin,
impl<T, B, M> UnwindSafe for List<T, B, M>where B: UnwindSafe, M: UnwindSafe, T: UnwindSafe,
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<I, B, M, T> CompactIndexedFragment<I, B, M> for Twhere
T: Any<I, B, M>,
impl<I, B, M, T> CompactIndexedFragment<I, B, M> for Twhere T: Any<I, B, M>,
fn compact_indexed_fragment<N, C, L, 'a>( &'a self, vocabulary: &'a mut N, meta: &'a M, index: Option<&'a Entry<String, M>>, active_context: &'a Context<I, B, C, M>, type_scoped_context: &'a Context<I, B, C, M>, active_property: Option<Meta<&'a str, &'a M>>, loader: &'a mut L, options: Options ) -> Pin<Box<dyn Future<Output = Result<Meta<Value<M>, M>, Meta<Error<<L as ContextLoader<I, M>>::ContextError>, M>>> + Send + 'a, Global>>where L: Loader<I, M> + ContextLoader<I, M> + Send + Sync, N: Send + Sync + VocabularyMut<Iri = I, BlankId = B>, I: Clone + Hash + Eq + Send + Sync, B: Clone + Hash + Eq + Send + Sync, M: Clone + Send + Sync, C: ProcessMeta<I, B, M>, <L as ContextLoader<I, M>>::Context: Into<C>,
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.