Struct ArenaSlice 

pub struct ArenaSlice<T> { /* private fields */ }

Interning arena for slices of type T.

Implementations

impl<T> ArenaSlice<T>

pub fn with_capacity(slices: usize, items: usize) -> Self

Creates a new arena with pre-allocated space to store at least the given number of slices, totalling the given number of items of type T.

pub fn slices(&self) -> usize

Returns the number of slices in this arena.

Note that because ArenaSlice is a concurrent data structure, this is only a snapshot as viewed by this thread, and the result may change if other threads are inserting values.

pub fn items(&self) -> usize

Returns the total number of items of type T in this arena.

Note that because ArenaSlice is a concurrent data structure, this is only a snapshot as viewed by this thread, and the result may change if other threads are inserting values.

pub fn is_empty(&self) -> bool

Checks if this arena is empty.

Note that because ArenaSlice is a concurrent data structure, this is only a snapshot as viewed by this thread, and the result may change if other threads are inserting values.

impl<T> ArenaSlice<T>

where T: Eq + Hash,

pub fn find(&self, value: &[T]) -> Option<InternedSlice<T>>

Returns the given value’s InternedSlice handle if it is already interned.

Otherwise, this simply returns None without adding the value to this arena.

impl<T> ArenaSlice<T>

where T: GetSize,

pub fn print_summary(&self, prefix: &str, title: &str, total_bytes: usize)

Available on crate feature debug only.

Prints a summary of the storage used by this arena to stdout.

impl<T> ArenaSlice<T>

where T: Default + Eq + Hash,

pub fn intern_owned(&self, value: Vec<T>) -> InternedSlice<T>

Interns the given value in this arena.

If the value was already interned in this arena, its interning index will simply be returned. Otherwise it will be stored into the arena.

pub fn intern_array<const N: usize>(&self, value: [T; N]) -> InternedSlice<T>

Interns the given value in this arena.

If the value was already interned in this arena, its interning index will simply be returned. Otherwise it will be stored into the arena.

pub fn push_owned_mut(&mut self, value: Vec<T>) -> InternedSlice<T>

Available on crate feature raw only.

Unconditionally push a value, without validating that it’s already interned.

pub fn push_array_mut<const N: usize>( &mut self, value: [T; N], ) -> InternedSlice<T>

Available on crate feature raw only.

Unconditionally push a value, without validating that it’s already interned.

impl<T> ArenaSlice<T>

where T: Default + Clone + Eq + Hash,

pub fn intern(&self, value: &[T]) -> InternedSlice<T>

Interns the given value in this arena.

If the value was already interned in this arena, its interning index will simply be returned. Otherwise it will be stored into the arena.

If T is Copy, it may be more efficient to call intern_copy() instead.

pub fn push_mut(&mut self, value: &[T]) -> u32

Available on crate feature raw only.

Unconditionally push a value, without validating that it’s already interned.

If T is Copy, calling push_copy_mut() may be more efficient.

impl<T> ArenaSlice<T>

where T: Default + Copy + Eq + Hash,

pub fn intern_copy(&self, value: &[T]) -> InternedSlice<T>

Interns the given value in this arena.

If the value was already interned in this arena, its interning index will simply be returned. Otherwise it will be stored into the arena.

If T is only Clone, you can call intern() instead. If T is also not Clone, you can call intern_owned() or intern_array().

pub fn push_copy_mut(&mut self, value: &[T]) -> u32

Available on crate feature raw only.

Unconditionally push a value, without validating that it’s already interned.

If T is only Clone, you can call push_mut() instead.

impl<T> ArenaSlice<T>

pub fn lookup(&self, interned: InternedSlice<T>) -> &[T]

Retrieves the given InternedSlice value from this arena.

The caller is responsible for ensuring that the same arena was used to intern this value, otherwise an arbitrary value will be returned or a panic will happen.

Trait Implementations

impl<T> Clone for ArenaSlice<T>

where T: Default + Clone + Eq + Hash,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for ArenaSlice<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for ArenaSlice<T>

fn default() -> Self

Returns the “default value” for a type.

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

where T: Default + Clone + Eq + Hash + Deserialize<'de>,

Available on crate feature serde only.

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> GetSize for ArenaSlice<T>

where T: GetSize,

Available on crate feature get-size2 only.

fn get_heap_size_with_tracker<Tr: GetSizeTracker>( &self, tracker: Tr, ) -> (usize, Tr)

Determines how many bytes this object occupies inside the heap while using a tracker.

fn get_stack_size() -> usize

Determines how may bytes this object occupies inside the stack.

fn get_heap_size(&self) -> usize

Determines how many bytes this object occupies inside the heap.

fn get_size(&self) -> usize

Determines the total size of the object.

fn get_size_with_tracker<T>(&self, tracker: T) -> (usize, T)

where T: GetSizeTracker,

Determines the total size of the object while using a tracker.

impl<T> PartialEq for ArenaSlice<T>

where T: Eq + Hash,

fn eq(&self, other: &Self) -> 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 ArenaSlice<T>

where T: Serialize,

Available on crate feature serde only.

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> Eq for ArenaSlice<T>

where T: Eq + Hash,