Struct ds::BTreeSeq

pub struct BTreeSeq<T> { /* private fields */ }

Implementations

impl<T> BTreeSeq<T>

pub fn new() -> BTreeSeq<T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn push_back(&mut self, elt: T)

pub fn push_front(&mut self, elt: T)

pub fn pop_back(&mut self) -> Option<T>

pub fn pop_front(&mut self) -> Option<T>

pub fn adjoin(&mut self, elt: T, other: BTreeSeq<T>)

pub fn append(&mut self, other: BTreeSeq<T>)

pub fn split_off(&mut self, at: usize) -> BTreeSeq<T>

pub fn iter<'a>(&'a self) -> Iter<'a, T>

pub fn iter_mut<'a>(&'a mut self) -> IterMut<'a, T>

pub fn into_iter(self) -> IntoIter<T>

pub fn range<'a>(&'a self, range: impl RangeBounds<usize>) -> Range<'a, T>

pub fn range_mut<'a>( &'a mut self, range: impl RangeBounds<usize>, ) -> RangeMut<'a, T>

pub fn bisect<'a, F>(&'a self, predicate: F) -> (Option<&'a T>, usize)

where F: Fn(&T) -> bool,

pub fn bisect_mut<'a, F>( &'a mut self, predicate: F, ) -> (Option<&'a mut T>, usize)

where F: Fn(&T) -> bool,

pub fn insert(&mut self, at: usize, elt: T)

pub fn remove(&mut self, at: usize) -> T

pub fn rotate(&mut self, new_first: usize)

pub unsafe fn get_unchecked(&self, index: usize) -> &T

Safety

i < self.len()

pub unsafe fn get_unchecked_mut(&mut self, index: usize) -> &mut T

Safety

i < self.len()

pub fn get(&self, index: usize) -> Option<&T>

pub fn get_mut(&mut self, index: usize) -> Option<&mut T>

Trait Implementations

impl<T> Clone for BTreeSeq<T>

where T: Clone,

fn clone(&self) -> BTreeSeq<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for BTreeSeq<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for BTreeSeq<T>

fn default() -> BTreeSeq<T>

Returns the “default value” for a type.

impl<T> Drop for BTreeSeq<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T> Extend<T> for BTreeSeq<T>

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = T>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

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

Reserves capacity in a collection for the given number of additional elements.

impl<T> FromIterator<T> for BTreeSeq<T>

fn from_iter<I>(iter: I) -> BTreeSeq<T>

where I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<T> Index<usize> for BTreeSeq<T>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &<BTreeSeq<T> as Index<usize>>::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for BTreeSeq<T>

fn index_mut( &mut self, index: usize, ) -> &mut <BTreeSeq<T> as Index<usize>>::Output

Performs the mutable indexing (container[index]) operation.

impl<'a, T> IntoIterator for &'a BTreeSeq<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a BTreeSeq<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut BTreeSeq<T>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a mut BTreeSeq<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for BTreeSeq<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <BTreeSeq<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> Ord for BTreeSeq<T>

where T: Ord,

fn cmp(&self, other: &BTreeSeq<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T> PartialEq for BTreeSeq<T>

where T: PartialEq,

fn eq(&self, other: &BTreeSeq<T>) -> 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<T> PartialOrd for BTreeSeq<T>

where T: PartialOrd,

fn partial_cmp(&self, other: &BTreeSeq<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Eq for BTreeSeq<T>

where T: Eq,