Struct TupleOfArrays 

pub struct TupleOfArrays<A, B>(/* private fields */);

Trait Implementations

impl<A: ByteOrd + Size, B: ByteOrd> ByteOrd for TupleOfArrays<A, B>

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

impl<A: Clone, B: Clone> Clone for TupleOfArrays<A, B>

fn clone(&self) -> TupleOfArrays<A, B>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Copy, B: Copy> Copy for TupleOfArrays<A, B>

impl<A: Default, B: Default> Default for TupleOfArrays<A, B>

fn default() -> TupleOfArrays<A, B>

Returns the “default value” for a type.

impl<A: Eq, B: Eq> Eq for TupleOfArrays<A, B>

impl<A: Extend<L>, B: Extend<R>, L, R> Extend<(L, R)> for TupleOfArrays<A, B>

fn extend<T: IntoIterator<Item = (L, R)>>(&mut self, iter: 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<A: FromIterator<L>, B: FromIterator<R>, L, R> FromIterator<(L, R)> for TupleOfArrays<A, B>

fn from_iter<T: IntoIterator<Item = (L, R)>>(iter: T) -> Self

Creates a value from an iterator.

impl<A: IntoIterator, B: IntoIterator> IntoIterator for TupleOfArrays<A, B>

type Item = (<A as IntoIterator>::Item, <B as IntoIterator>::Item)

The type of the elements being iterated over.

type IntoIter = Zip<<A as IntoIterator>::IntoIter, <B 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, A, B> IntoIterator for &'a TupleOfArrays<A, B>

where &'a A: IntoIterator, &'a B: IntoIterator,

type Item = (<&'a A as IntoIterator>::Item, <&'a B as IntoIterator>::Item)

The type of the elements being iterated over.

type IntoIter = Zip<<&'a A as IntoIterator>::IntoIter, <&'a B 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, A, B> IntoIterator for &'a mut TupleOfArrays<A, B>

where &'a mut A: IntoIterator, &'a mut B: IntoIterator,

type Item = (<&'a mut A as IntoIterator>::Item, <&'a mut B as IntoIterator>::Item)

The type of the elements being iterated over.

type IntoIter = Zip<<&'a mut A as IntoIterator>::IntoIter, <&'a mut B 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, B> ListHashes for TupleOfArrays<A, B>

where A: ListHashes, B: ListHashes,

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

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl<A: Ord, B: Ord> Ord for TupleOfArrays<A, B>

fn cmp(&self, other: &TupleOfArrays<A, B>) -> 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<A: Parse<I> + PlainCollection<Item = Ae>, B: Parse<I> + PlainCollection<Item = Be>, I: ParseInput, Ae: Size, Be: Size> Parse<I> for TupleOfArrays<A, B>

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

Parse consuming the whole stream.

impl<A: PartialEq, B: PartialEq> PartialEq for TupleOfArrays<A, B>

fn eq(&self, other: &TupleOfArrays<A, B>) -> 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<A: PartialOrd, B: PartialOrd> PartialOrd for TupleOfArrays<A, B>

fn partial_cmp(&self, other: &TupleOfArrays<A, B>) -> 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<A: PlainCollection, B: PlainCollection> PlainCollection for TupleOfArrays<A, B>

impl<A, B> Size for TupleOfArrays<A, B>

where A: Size, B: Size, TArr<U0, TArr<<A as Size>::Size, TArr<<B as Size>::Size, ATerm>>>: FoldAdd<Output: Unsigned>,

const SIZE: usize

type Size = <TArr<UTerm, TArr<<A as Size>::Size, TArr<<B as Size>::Size, ATerm>>> as FoldAdd>::Output

impl<A: PartialEq, B: PartialEq> StructuralPartialEq for TupleOfArrays<A, B>

impl<A, B> Tagged for TupleOfArrays<A, B>

where A: Tagged, B: Tagged,

const TAGS: Tags

const HASH: Hash = _

impl<A: ToOutput, B: ToOutput> ToOutput for TupleOfArrays<A, B>

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<A, B> Topological for TupleOfArrays<A, B>

where A: Topological, B: Topological,

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

fn topology(&self) -> TopoVec