Union spacetimedb_primitives::ColList

#[repr(C)]
pub union ColList {
    /* private fields */
}

This represents a non-empty list of ColId but packed into a u64 in a way that takes advantage of the fact that in almost all cases, we won’t store a ColId larger than 62. In the rare case that we store larger ids, we fall back to a thin vec approach.

The list does not guarantee a stable order.

Implementations

impl ColList

pub fn new(col: ColId) -> Self

Returns a list with a single column. As long col is below 62, this will not allocate.

pub fn head(&self) -> ColId

Returns the head of the list.

pub fn contains(&self, needle: ColId) -> bool

Returns whether needle is contained in the list.

This an be faster than using list.iter().any(|c| c == needle).

pub fn iter(&self) -> impl '_ + Iterator<Item = ColId>

Returns an iterator over all the columns in this list.

pub fn to_u32_vec(&self) -> Vec<u32>

Convert to a Vec<u32>.

pub fn len(&self) -> u32

Returns the length of the list.

pub fn is_empty(&self) -> bool

Returns false. A ColList is never empty.

pub fn is_singleton(&self) -> bool

Is this a list of a single column?

pub fn push(&mut self, col: ColId)

Push col onto the list.

If col >= 63 or if this list was already heap allocated, it will now be heap allocated.

Trait Implementations

impl Clone for ColList

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ColList

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

Formats the value using the given formatter.

impl Drop for ColList

fn drop(&mut self)

Executes the destructor for this type.

impl From<ColId> for ColList

fn from(value: ColId) -> Self

Converts to this type from the input type.

impl From<u32> for ColList

fn from(value: u32) -> Self

Converts to this type from the input type.

impl Hash for ColList

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for ColList

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 + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for ColList

fn eq(&self, other: &Self) -> bool

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

fn ne(&self, other: &Rhs) -> bool

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

impl PartialOrd for ColList

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

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for ColList

impl Send for ColList

impl Sync for ColList