Struct SList 

pub struct SList { /* private fields */ }

Implementations

impl SList

pub fn new(max_length: i64) -> Self

pub fn iter(&self) -> impl DoubleEndedIterator<Item = &SValue>

pub fn delete_all(&mut self)

pub fn length(&self) -> i64

pub fn textual_representation(&self) -> String

pub fn contains_item(&self, item: &SValue) -> bool

pub fn delete_nth<Q>( &mut self, one_based_n: &SValue, sink: &mut Q, ) -> Option<SValue>

where Q: QuirkSink<NthItemOfListQ> + QuirkSink<SValueToNumberQ> + QuirkSink<NumberTooBigForIntQ>,

Deletes the item at the position one_based_n if one_based_n can be converted into an integer in range [1; self.length()].

Returns the removed item if it was removed:

• Some(item): one_based_n referred to a valid position, item removed
• None: one_based_n was invalid (0, too big, …), nothing changed

pub fn append_item(&mut self, item: SValue) -> Result<(), SListAlreadyFull>

Appends an item to the end of the list

pub fn insert_item_at<Q>( &mut self, one_based_n: &SValue, item: SValue, sink: &mut Q, ) -> Result<bool, SListAlreadyFull>

where Q: QuirkSink<NthItemOfListQ> + QuirkSink<SValueToNumberQ> + QuirkSink<NumberTooBigForIntQ>,

Inserts the item at the position one_based_n if one_based_n can be converted into an integer in range [1; self.length() + 1].

One more than length will be identical to appending.

Returns if the list was changed (bool).

• true: one_based_n referred to a valid position, item inserted
• false: one_based_n was invalid (0, too big, …), nothing changed

pub fn replace_nth_item<Q>( &mut self, one_based_n: &SValue, new_val: SValue, sink: &mut Q, ) -> bool

where Q: QuirkSink<NthItemOfListQ> + QuirkSink<SValueToNumberQ> + QuirkSink<NumberTooBigForIntQ>,

Replaces the n-th item with new_val if one_based_n can be converted into an integer in range [1; self.length()]

pub fn nth_item<Q>(&self, one_based_n: &SValue, sink: &mut Q) -> SValue

where Q: QuirkSink<NthItemOfListQ> + QuirkSink<SValueToNumberQ> + QuirkSink<NumberTooBigForIntQ>,

pub fn first_index_of_item_in_list(&self, item: &SValue) -> i64

pub fn set_max_length( &mut self, max: i64, ) -> Result<(), ListLongerThanNewMaximum>

pub fn max_length(&self) -> i64

pub fn data(&self) -> &[SValue]

pub fn make_readonly(self) -> ReadonlySList

Trait Implementations

impl Clone for SList

fn clone(&self) -> SList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SList

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

Formats the value using the given formatter.

impl<C: Into<SValue>> FromIterator<C> for SList

Be careful that this will set the maximum length to the iterators length. If further insertions should be possible, reset the max length using Self::set_max_length afterwards.

fn from_iter<T: IntoIterator<Item = C>>(iter: T) -> Self

Creates a value from an iterator.

impl IntoIterator for SList

type Item = SValue

The type of the elements being iterated over.

type IntoIter = IntoIter<SValue>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for SList

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for SList