Struct Shape 

pub struct Shape {
    pub parent: Option<ShapeId>,
    pub key: PropertyKey,
    pub flags: PropertyFlags,
    pub slot: u32,
    pub count: u32,
    pub width: u32,
    pub prototype: Option<ObjectId>,
    pub kind: ObjectKind,
    pub transitions: Transitions,
    pub table: OnceCell<Box<HashMap<PropertyKey, (u32, PropertyFlags), BuildHasherDefault<FxHasher>>>>,
    pub validity: ValidityCellId,
    pub dictionary: Option<Box<Dictionary>>,
}

Fields

parent: Option<ShapeId>

Transition-tree parent; None for roots and dictionary shapes.

key: PropertyKey

The property this node adds (meaningless when count == 0).

flags: PropertyFlags

slot: u32

count: u32

Properties up to and including this node.

width: u32

Slots used up to and including this node: count plus one per accessor, whose getter and setter take two.

prototype: Option<ObjectId>

kind: ObjectKind

transitions: Transitions

table: OnceCell<Box<HashMap<PropertyKey, (u32, PropertyFlags), BuildHasherDefault<FxHasher>>>>

Key → (slot, flags), built on the first lookup past TABLE_THRESHOLD properties.

validity: ValidityCellId

The prototype’s validity cell as last seen, or NONE.

dictionary: Option<Box<Dictionary>>

Implementations

impl Shape

pub fn is_dictionary(&self) -> bool

pub fn has_table(&self) -> bool

Whether the lookup table has been built.

Trait Implementations

impl Record for Shape

fn vacant() -> Self

The poison value written over a freed slot. It must own no heap memory.

fn extra_bytes(&self) -> usize

Bytes owned outside the arena slot (string contents, tables), counted toward the heap cap.