Struct Sequence 

pub struct Sequence<T>(pub T);

Tuple Fields

0: T

Trait Implementations

impl<T> ByteOrd for Sequence<T>

where for<'a> &'a T: IntoIterator<Item: ByteOrd + InlineOutput>,

fn bytes_cmp(&self, other: &Self) -> Ordering

impl<T: Clone> Clone for Sequence<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Copy> Copy for Sequence<T>

impl<T: Debug> Debug for Sequence<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for Sequence<T>

fn default() -> Sequence<T>

Returns the “default value” for a type.

impl<T> Deref for Sequence<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T> DerefMut for Sequence<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T> Eq for Sequence<T>

where for<'a> &'a T: IntoIterator<Item: Eq>,

impl<T: FromIterator<A>, A> FromIterator<A> for Sequence<T>

fn from_iter<I: IntoIterator<Item = A>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: IntoIterator> IntoIterator for Sequence<T>

type Item = <T as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <T as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

where &'a T: IntoIterator,

type Item = <&'a T as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'a T as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

where &'a mut T: IntoIterator,

type Item = <&'a mut T as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'a mut T as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> ListHashes for Sequence<T>

where for<'a> &'a T: IntoIterator<Item: ListHashes>,

fn list_hashes(&self, f: &mut impl FnMut(Hash))

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl<T> Ord for Sequence<T>

where for<'a> &'a T: IntoIterator<Item: Ord>,

fn cmp(&self, other: &Self) -> 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: IntoIterator<Item = A> + FromIterator<A>, A: ParseInline<I>, I: ParseInput> Parse<I> for Sequence<T>

fn parse(input: I) -> Result<Self>

Parse consuming the whole stream.

impl<T> PartialEq for Sequence<T>

where for<'a> &'a T: IntoIterator<Item: PartialEq>,

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

where for<'a> &'a T: IntoIterator<Item: PartialOrd>,

fn partial_cmp(&self, other: &Self) -> 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: IntoIterator> PlainCollection for Sequence<T>

impl<T> ToOutput for Sequence<T>

where for<'a> &'a T: IntoIterator<Item: InlineOutput>,

fn to_output(&self, output: &mut impl Output)

fn data_hash(&self) -> Hash

fn mangle_hash(&self) -> Hash

fn output<T: Output + Default>(&self) -> T

fn vec(&self) -> Vec<u8>

impl<T> Topological for Sequence<T>

where for<'a> &'a T: IntoIterator<Item: Topological>,

fn traverse(&self, visitor: &mut impl PointVisitor)

fn topology(&self) -> TopoVec

impl<T: IntoIterator> VecLike for Sequence<T>