Struct ListRef

pub struct ListRef<T>(/* private fields */);

A handle to a list stored in a ListPool.

The handle can be used to yield the actual slice, given the pool, but has much smaller overhead than a separately-owned Vec: e.g., 8 bytes on 64-bit systems, rather than 24 bytes, and no separate memory allocation overhead.

Implementations

impl<T> ListRef<T>

pub fn len(&self) -> usize

Return the number of items in this list. (We do not need the pool to compute this.)

pub fn is_empty(&self) -> bool

Return whether this list is empty. (We do not need the pool to compute this.)

Trait Implementations

impl<T: Clone> Clone for ListRef<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ListRef<T>

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

Formats the value using the given formatter.

impl<T> Default for ListRef<T>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for ListRef<T>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl HasValues<FunctionBody> for ListRef<Value>

fn values<'a>( &'a self, f: &'a FunctionBody, ) -> Box<dyn Iterator<Item = <FunctionBody as Func>::Value> + 'a>

fn values_mut<'a>( &'a mut self, g: &'a mut FunctionBody, ) -> Box<dyn Iterator<Item = &'a mut <FunctionBody as Func>::Value> + 'a>

where FunctionBody: 'a,

impl<T: Hash> Hash for ListRef<T>

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<T: Clone + Debug> Index<ListRef<T>> for ListPool<T>

type Output = [T]

The returned type after indexing.

fn index(&self, index: ListRef<T>) -> &[T]

Performs the indexing (container[index]) operation.

impl<T: Clone + Debug> IndexMut<ListRef<T>> for ListPool<T>

fn index_mut(&mut self, index: ListRef<T>) -> &mut [T]

Performs the mutable indexing (container[index]) operation.

impl<T: PartialEq> PartialEq for ListRef<T>

fn eq(&self, other: &ListRef<T>) -> 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> Serialize for ListRef<T>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Copy> Copy for ListRef<T>

impl<T: Eq> Eq for ListRef<T>

impl<T> StructuralPartialEq for ListRef<T>