Struct SideTable 

pub struct SideTable<V> { /* private fields */ }

A (node → payload) side channel: analysis verdicts recorded beside the HIR rather than written into it (D2 — the HIR stays immutable).

Generic over the payload so a second kind of verdict can ride the same plumbing instead of a parallel structure being invented for it. Backed by a BTreeMap so iteration order is deterministic (house rule — never iterate a HashMap where order affects output); Self::iter is what a consumer that wants every verdict (e.g. an IDE building an overlay) walks.

Implementations

impl<V> SideTable<V>

pub fn new() -> Self

An empty table.

pub fn insert(&mut self, key: NodeKey, value: V) -> Option<V>

Record value for the node at key, returning any previous entry.

pub fn get(&self, key: NodeKey) -> Option<&V>

The payload recorded for the node at key, if any.

pub fn at(&self, file: FileId, range: TextRange) -> Option<&V>

The payload recorded for the node at range in file, if any — the convenience spelling for a consumer holding an HIR node rather than a pre-built NodeKey.

pub fn iter(&self) -> impl Iterator<Item = (NodeKey, &V)>

Every recorded entry, in deterministic (file, range) order.

pub fn len(&self) -> usize

How many nodes carry a payload.

pub fn is_empty(&self) -> bool

Whether no node carries a payload.

Trait Implementations

impl<V: Clone> Clone for SideTable<V>

fn clone(&self) -> SideTable<V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug> Debug for SideTable<V>

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

Formats the value using the given formatter.

impl<V> Default for SideTable<V>

fn default() -> Self

Returns the “default value” for a type.

impl<V: Eq> Eq for SideTable<V>

impl<V: PartialEq> PartialEq for SideTable<V>

fn eq(&self, other: &SideTable<V>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<V: PartialEq> StructuralPartialEq for SideTable<V>