Struct RowRef

#[repr(transparent)]
pub struct RowRef([u8]);

A contiguous slice of bytes that are row data.

A RowRef is to Row as str is to String.

Tuple Fields

0: [u8]

Implementations

impl RowRef

pub fn from_slice(row: &[u8]) -> &RowRef

Create a RowRef from a slice of data.

We do not check that the provided slice is valid Row data, will panic on read if the data is invalid.

pub fn unpack(&self) -> Vec<Datum<'_>>

Unpack self into a Vec<Datum> for efficient random access.

pub fn unpack_first(&self) -> Datum<'_>

Return the first Datum in self

Panics if the RowRef is empty.

pub fn iter(&self) -> DatumListIter<'_>

Iterate the Datum elements of the RowRef.

pub fn byte_len(&self) -> usize

Return the byte length of this RowRef.

pub fn data(&self) -> &[u8]

For debugging only.

pub fn is_empty(&self) -> bool

True iff there is no data in this RowRef.

Trait Implementations

impl AsRef<RowRef> for Row

fn as_ref(&self) -> &RowRef

Converts this type into a shared reference of the (usually inferred) input type.

impl Borrow<RowRef> for Row

fn borrow(&self) -> &RowRef

Immutably borrows from an owned value.

impl Debug for RowRef

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

Debug representation using the internal datums

impl Hash for RowRef

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

impl<'a> IntoIterator for &'a RowRef

type Item = Datum<'a>

The type of the elements being iterated over.

type IntoIter = DatumListIter<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> DatumListIter<'a>

Creates an iterator from a value.

impl Ord for RowRef

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

This method returns an Ordering between self and other.

impl PartialEq for RowRef

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

These implementations order first by length, and then by slice contents. This allows many comparisons to complete without dereferencing memory. Warning: These order by the u8 array representation, and NOT by Datum::cmp.

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<BC: Push<u64>> Push<&RowRef> for Rows<BC>

fn push(&mut self, item: &RowRef)

Pushes an item onto self.

fn extend(&mut self, iter: impl IntoIterator<Item = T>)

Pushes elements of an iterator onto self.

impl ToOwned for RowRef

type Owned = Row

The resulting type after obtaining ownership.

fn to_owned(&self) -> Self::Owned

Creates owned data from borrowed data, usually by cloning.

fn clone_into(&self, target: &mut Self::Owned)

Uses borrowed data to replace owned data, usually by cloning.

impl Eq for RowRef

impl StructuralPartialEq for RowRef