Struct Interner

pub struct Interner<I: Internable> { /* private fields */ }

The main interning data structure. This lives in the scene builder thread, and handles hashing and interning unique data structures. It also manages a free-list for the items in the data store, which is synchronized via an update list of additions / removals.

Implementations

impl<I: Internable> Interner<I>

pub fn intern<F>(&mut self, data: &I::Key, fun: F) -> Handle<I>

where F: FnOnce() -> I::InternData,

Intern a data structure, and return a handle to that data. The handle can then be stored in the frame builder, and safely accessed via the data store that lives in the frame builder thread. The provided closure is invoked to build the local data about an interned structure if the key isn’t already interned.

pub fn end_frame_and_get_pending_updates(&mut self) -> UpdateList<I::Key>

Retrieve the pending list of updates for an interner that need to be applied to the data store. Also run a GC step that removes old entries.

Trait Implementations

impl<I: Internable> Default for Interner<I>

fn default() -> Self

Returns the “default value” for a type.

impl<I: Internable> Index<Handle<I>> for Interner<I>

Retrieve the local data for an item from the interner via handle

type Output = <I as Internable>::InternData

The returned type after indexing.

fn index(&self, handle: Handle<I>) -> &I::InternData

Performs the indexing (container[index]) operation.

impl<I> MallocSizeOf for Interner<I>

where I: MallocSizeOf + Internable,

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.