Struct cranelift_entity::ListPool

pub struct ListPool<T: EntityRef + ReservedValue> { /* private fields */ }

A memory pool for storing lists of T.

Implementations

impl<T: EntityRef + ReservedValue> ListPool<T>

pub fn new() -> Self

Create a new list pool.

pub fn with_capacity(len: usize) -> Self

Create a new list pool with the given capacity for data pre-allocated.

pub fn capacity(&self) -> usize

Get the capacity of this pool. This will be somewhat higher than the total length of lists that can be stored without reallocating, because of internal metadata overheads. It is mostly useful to allow another pool to be allocated that is likely to hold data transferred from this one without the need to grow.

pub fn clear(&mut self)

Clear the pool, forgetting about all lists that use it.

This invalidates any existing entity lists that used this pool to allocate memory.

The pool’s memory is not released to the operating system, but kept around for faster allocation in the future.

Trait Implementations

impl<T: Clone + EntityRef + ReservedValue> Clone for ListPool<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + EntityRef + ReservedValue> Debug for ListPool<T>

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

Formats the value using the given formatter.

impl<T: EntityRef + ReservedValue> Default for ListPool<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Hash + EntityRef + ReservedValue> Hash for ListPool<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: EntityRef + ReservedValue> PartialEq<ListPool<T>> for ListPool<T>

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.