pub type LexOrderingRef<'a> = &'a [PhysicalSortExpr];
Expand description

LexOrderingRef is a type alias for lexicographical ordering reference &[PhysicalSortExpr]

Trait Implementations§

1.0.0 · source§

impl<T> Default for &[T]

source§

fn default() -> &[T]

Creates an empty slice.

1.0.0 · source§

impl<'a, T> IntoIterator for &'a [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?
source§

fn into_iter(self) -> Iter<'a, T>

Creates an iterator from a value. Read more
1.0.0 · source§

impl<A, B, const N: usize> PartialEq<[A; N]> for &[B]where B: PartialEq<A>,

source§

fn eq(&self, other: &[A; N]) -> bool

This method tests for self and other values to be equal, and is used by ==.
source§

fn ne(&self, other: &[A; N]) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
1.46.0 · source§

impl<T, U, A> PartialEq<Vec<U, A>> for &[T]where A: Allocator, T: PartialEq<U>,

source§

fn eq(&self, other: &Vec<U, A>) -> bool

This method tests for self and other values to be equal, and is used by ==.
source§

fn ne(&self, other: &Vec<U, A>) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
§

impl<T, U, A> PartialEq<Vec<U, A>> for &[T]where A: Allocator, T: PartialEq<U>,

§

fn eq(&self, other: &Vec<U, A>) -> bool

This method tests for self and other values to be equal, and is used by ==.
§

fn ne(&self, other: &Vec<U, A>) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.