Enum HeapKind 

#[repr(u8)]
pub enum HeapKind {
    String = 0,
    TypedObject = 1,
    Closure = 2,
    Decimal = 3,
    BigInt = 4,
    DataTable = 5,
    Future = 6,
    TaskGroup = 7,
    TypedArray = 8,
    Temporal = 9,
    TableView = 10,
    Content = 11,
    Instant = 12,
    IoHandle = 13,
    NativeScalar = 14,
    NativeView = 15,
    Char = 16,
    HashMap = 17,
    FilterExpr = 18,
    Reference = 19,
    SharedCell = 20,
    HashSet = 21,
    Iterator = 22,
    Deque = 23,
    Channel = 24,
    PriorityQueue = 25,
    Range = 26,
    Result = 27,
    Option = 28,
    TraitObject = 29,
    Mutex = 30,
    Atomic = 31,
    Lazy = 32,
    ModuleFn = 33,
    Matrix = 34,
    MatrixSlice = 35,
}

Discriminator for HeapValue variants, usable without full pattern match.

One variant per surviving HeapValue arm — no dead variants expressible. Trimmed in Phase 2b alongside the NativeKind::Ptr(HeapKind) extension; see docs/defections.md 2026-05-06 (HeapKind trim + NativeKind::Ptr extension) for the audit findings and rejected alternatives.

The previous 77-variant surface (with (removed) / (deprecated) annotations) preserved ordinals “for ABI stability”; the bulldozer deleted the tags.rs ordinal-stability test that made that contract load-bearing, so the dead variants no longer had a justification to remain in the source.

Variants

String = 0

TypedObject = 1

Closure = 2

Decimal = 3

BigInt = 4

DataTable = 5

Future = 6

TaskGroup = 7

TypedArray = 8

Temporal = 9

TableView = 10

Content = 11

Instant = 12

IoHandle = 13

NativeScalar = 14

NativeView = 15

Char = 16

HashMap = 17

FilterExpr = 18

Reference = 19

SharedCell = 20

HashSet = 21

Iterator = 22

Deque = 23

Channel = 24

PriorityQueue = 25

Range = 26

Result = 27

Option = 28

TraitObject = 29

Mutex = 30

Atomic = 31

Lazy = 32

ModuleFn = 33

Matrix = 34

MatrixSlice = 35

Implementations

impl HeapKind

pub const MAX_VARIANT: Self = HeapKind::HashMap

The last (highest-numbered) variant in HeapKind. IMPORTANT: Update this when adding new HeapKind variants.

pub fn from_u16(v: u16) -> Option<Self>

Convert a u16 discriminant to a HeapKind, returning None if out of range.

pub fn from_u8(v: u8) -> Option<Self>

Convert a u8 discriminant to a HeapKind, returning None if out of range.

Trait Implementations

impl Clone for HeapKind

fn clone(&self) -> HeapKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HeapKind

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for HeapKind

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for HeapKind

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for HeapKind

fn eq(&self, other: &HeapKind) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for HeapKind

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for HeapKind

impl Eq for HeapKind

impl StructuralPartialEq for HeapKind