Struct TableNode 

pub struct TableNode {
    pub value: LuaValue,
    pub key: LuaValue,
    pub next: i32,
    pub dead: bool,
}

One node in a table’s hash part.

signed offset into the same node vector.

Fields

value: LuaValue

Value stored at this key. C: gval(n).

key: LuaValue

Key stored in this node. C: n->u.key_val + n->u.key_tt.

next: i32

Collision-chain offset (positive or negative; zero means end of chain).

dead: bool

Dead-key tombstone, mirroring C’s LUA_TDEADKEY (lgc.c clearkey). Set by the GC traversal when this node’s value is nil: the key object becomes collectible, so the key field may DANGLE from this point on. Probes must never dereference a dead key — normal get/set equality treats dead nodes as no-match (C: the tt check fails), and only the next-position lookup matches them, by raw pointer bits (C: equalkey with deadok). set_key resurrects the node. Lives in the struct’s padding; size stays 40 bytes.