Struct Seq

pub struct Seq<T>(/* private fields */);

A data-structure implementing an immutable sequence of values.

An amortized running time is given for each operation, with n referring to the length of the sequence and i being the integral index used by some operations. These bounds hold even in a persistent (shared) setting.

This implementation is based on Haskell’s Data.Sequence library (http://hackage.haskell.org/package/containers/docs/Data-Sequence.html), and the following paper:

• Ralf Hinze and Ross Paterson, “Finger trees: a simple general-purpose data structure”, Journal of Functional Programming 16:2 (2006) pp 197-217. http://staff.city.ac.uk/~ross/papers/FingerTree.html

Implementations

impl<T: 'static> Seq<T>

pub fn empty() -> Seq<T>

The empty sequence. Time: O(1)

pub fn singleton(x: T) -> Seq<T>

A sequence with a single value. Time O(1)

pub fn push_front(&self, x: T) -> Seq<T>

A new sequence that is self with x added to the front. Time: O(1)

pub fn push_back(&self, x: T) -> Seq<T>

A new sequence that is self with x added to the back. Time: O(1)

pub fn append(&self, other: &Seq<T>) -> Seq<T>

The concatenation of self with other. Time: O(log(min(n1,n2)))

pub fn is_empty(&self) -> bool

Is the sequence empty?. Time: O(1)

pub fn len(&self) -> usize

The number of elements in the sequence. Time: O(1)

pub fn front(&self) -> Option<&T>

The first element in the sequence, if it exists. Time: O(1)

pub fn back(&self) -> Option<&T>

The back element, if it exsts. Time: O(1)

pub fn pop_front(&self) -> Seq<T>

A new sequence that is self with the front element removed, together with the front element (if it exists). Time: O(1)

pub fn pop_back(&self) -> Seq<T>

A new sequence that is self with the back element removed, together with the back element (if it exists). Time: O(1)

pub fn adjust<F>(&self, i: usize, func: F) -> Seq<T>

where F: FnOnce(&T) -> T,

A new sequence with the element at index i replaced by f(self[i]). Time: O(log(min(i,n-i)))

If i is out of range, returns a clone of self.

pub fn update(&self, i: usize, x: T) -> Seq<T>

A new sequence with the element at index i replaced by x. Time: O(log(min(i,n-i)))

If i is out of range, returns a clone of self.

pub fn truncate(&self, count: usize) -> Seq<T>

A new sequence consisting of only the first count elements. Time: O(log(min(count, n - count)))

If count >= self.len(), then returns a clone of self.

pub fn skip(&self, count: usize) -> Seq<T>

A new sequence consisting of only the last count elements. Time: O(log(min(count,n - count)))

If count >= self.len(), then returns a clone of self.

pub fn split(&self, n: usize) -> (Seq<T>, Seq<T>)

Two new sequences, consisting of the first count elements, and the remaining elements, respectively. Time: O(log(min(count,n-count)))

If count >= self.len(), then the first sequence is a clone of self and the second is empty.

pub fn remove(&self, i: usize) -> Seq<T>

A new sequence with the element at index i removed, together with the element at index i, if it exists. Time: O(log(min(i,n-i)))

If i is out of range, then the returned sequence is a clone of self, and the element is None.

pub fn insert(&self, i: usize, x: T) -> Seq<T>

A new sequence with x inserted at index i. Time: O(log(min(i,n-i)))

If i < self.len(), then x will immediately precede self[i] in the new sequence.

if i >= self.len(), then x will be the last element in the new sequence.

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

Get the element at index i, if it exists. Time: O(log(min(i,n-i)))

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

An iterator over the sequence. Time: O(1)

Trait Implementations

impl<T: 'static> Clone for Seq<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Seq<T>

where T: Debug + 'static,

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

Formats the value using the given formatter.

impl<T: 'static> From<Vec<T>> for Seq<T>

fn from(v: Vec<T>) -> Seq<T>

Converts to this type from the input type.

impl<T: 'static> FromIterator<T> for Seq<T>

fn from_iter<I>(iter: I) -> Self

where I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<T: 'static> Index<usize> for Seq<T>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'a, T: 'static> IntoIterator for &'a Seq<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) -> Iter<'a, T>

Creates an iterator from a value.

impl<T> Ord for Seq<T>

where T: Ord + 'static,

fn cmp(&self, other: &Seq<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 Seq<T>

where T: PartialEq + 'static,

fn eq(&self, other: &Seq<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 Seq<T>

where T: PartialOrd + 'static,

fn partial_cmp(&self, other: &Seq<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 Seq<T>

where T: Eq + 'static,