pub struct TableNode {
pub value: LuaValue,
pub key: LuaValue,
pub next: i32,
}Expand description
One node in a table’s hash part.
C: Node = NodeKey + TValue i_val. The collision chain is a
signed offset into the same node vector.
Fields§
§value: LuaValueValue stored at this key. C: gval(n).
key: LuaValueKey stored in this node. C: n->u.key_val + n->u.key_tt.
next: i32Collision-chain offset (positive or negative; zero means end of chain).
C: n->u.next (int).
Auto Trait Implementations§
impl Freeze for TableNode
impl !RefUnwindSafe for TableNode
impl !Send for TableNode
impl !Sync for TableNode
impl Unpin for TableNode
impl UnsafeUnpin for TableNode
impl !UnwindSafe for TableNode
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more