Struct BufferMap 

pub struct BufferMap { /* private fields */ }

Small-N buffer lookup keyed by interned Arc<str> names.

Typical reference interpreter programs have ≤ 8 declared buffers. A linear scan over 8 entries is branch-predicted and hits L1 cache; hashing each access (as HashMap<String, Buffer> did) burned a SipHash-1-3 on every load/store in the inner interpreter loop. This struct preserves the public get / get_mut / insert shape consumers depend on while eliminating the per-lookup hash + heap traffic.

Implementations

impl BufferMap

pub fn new() -> Self

Construct an empty map.

pub fn get(&self, name: &str) -> Option<&Buffer>

Look up a buffer by name.

pub fn get_mut(&mut self, name: &str) -> Option<&mut Buffer>

Look up a mutable buffer by name.

pub fn insert( &mut self, name: impl Into<Arc<str>>, buffer: Buffer, ) -> Option<Buffer>

Insert or overwrite a buffer. Returns the previous value when the key already existed.

pub fn iter(&self) -> impl Iterator<Item = (&str, &Buffer)>

Iterate (name, buffer) pairs in insertion order.

pub fn into_iter_pairs(self) -> impl Iterator<Item = (Arc<str>, Buffer)>

Move-iterate (name, buffer) pairs.

pub fn len(&self) -> usize

Number of entries.

pub fn is_empty(&self) -> bool

True when empty.

Trait Implementations

impl Debug for BufferMap

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

Formats the value using the given formatter.

impl Default for BufferMap

fn default() -> BufferMap

Returns the “default value” for a type.