Struct DictTable 

pub struct DictTable { /* private fields */ }

Implementations

impl DictTable

pub fn new() -> Self

pub fn with_capacity(n: usize) -> Self

pub fn try_with_capacity(n: usize) -> Result<Self, Layout>

As DictTable::with_capacity, but returns the layout the allocator refused instead of aborting.

pub fn record(n: usize) -> Self

An empty table in shape mode, for Dyn records.

pub fn try_record(n: usize) -> Result<Self, Layout>

As DictTable::record, but returns the layout the allocator refused instead of aborting.

pub fn shape(&self) -> Option<&'static Shape>

The hidden class, if the table is in shape mode.

pub fn slot_value(&self, slot: usize) -> Option<Value>

The value in slot of a shape-mode table.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn version(&self) -> u64

pub fn heap_bytes(&self) -> usize

pub fn trace(&self, t: &mut Tracer)

Called with the world stopped.

pub fn trace_written(&self, t: &mut Tracer)

For a minor collection of the owner: marks the entries written since the last one (see WordBuf::note_written) and forgets them. Entry i covers words i * W..i * W + W of the entry buffer in table mode, word i in shape mode.

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

Live entries in insertion order.

pub fn entry(&self, idx: usize) -> Entry

The entry at idx (a tombstone if out of range).

pub fn raw_len(&self) -> usize

Number of entry slots in use, tombstones included (for indexed iteration that tolerates growth).

pub fn raw_entry(&self, i: usize) -> Option<Entry>

pub fn first_live(&self) -> Option<usize>

pub fn probe(&self, hash: u64, key: Value) -> Probe

pub fn read_optimistic<R>(&self, f: &impl Fn(&DictTable) -> R) -> Option<R>

Runs the read f without the lock, retrying while writes overlap it. None means it kept colliding with writers; the caller should take the lock. f must only read the table.

pub unsafe fn set_value_at(&self, idx: usize, v: Value, access: Access)

Safety

The caller has write access (see above).

pub unsafe fn insert_new( &self, hash: u64, key: Value, value: Value, access: Access, )

Appends a new entry (the caller has established the key is absent). Aborts if the table cannot grow; see DictTable::try_insert_new.

Safety

The caller has write access.

pub unsafe fn try_insert_new( &self, hash: u64, key: Value, value: Value, access: Access, ) -> Result<(), Layout>

As DictTable::insert_new, but if the allocator refuses to grow the table, returns the refused layout and leaves the table as it was.

Safety

The caller has write access.

pub unsafe fn remove_at(&self, idx: usize, access: Access) -> Value

Removes the entry at idx, returning its value.

Safety

The caller has write access.

pub unsafe fn clear(&self, access: Access)

Safety

The caller has write access.

impl DictTable

pub fn try_clone(&self) -> Result<Self, Layout>

A copy of the table, or the layout the allocator refused.

Trait Implementations

impl Clone for DictTable

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for DictTable

fn default() -> Self

Returns the “default value” for a type.

impl Drop for DictTable

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.