Skip to main content

HeapKind

Enum HeapKind 

Source
#[repr(u8)]
pub enum HeapKind {
Show 72 variants String = 0, Array = 1, TypedObject = 2, Closure = 3, Decimal = 4, BigInt = 5, HostClosure = 6, DataTable = 7, TypedTable = 8, RowView = 9, ColumnRef = 10, IndexedTable = 11, Range = 12, Enum = 13, Some = 14, Ok = 15, Err = 16, Future = 17, TaskGroup = 18, TraitObject = 19, ExprProxy = 20, FilterExpr = 21, Time = 22, Duration = 23, TimeSpan = 24, Timeframe = 25, TimeReference = 26, DateTimeExpr = 27, DataDateTimeRef = 28, TypeAnnotation = 29, TypeAnnotatedValue = 30, PrintResult = 31, SimulationCall = 32, FunctionRef = 33, DataReference = 34, Number = 35, Bool = 36, None = 37, Unit = 38, Function = 39, ModuleFunction = 40, HashMap = 41, Content = 42, Instant = 43, IoHandle = 44, SharedCell = 45, NativeScalar = 46, NativeView = 47, IntArray = 48, FloatArray = 49, BoolArray = 50, Matrix = 51, Iterator = 52, Generator = 53, Mutex = 54, Atomic = 55, Lazy = 56, I8Array = 57, I16Array = 58, I32Array = 59, U8Array = 60, U16Array = 61, U32Array = 62, U64Array = 63, F32Array = 64, Set = 65, Deque = 66, PriorityQueue = 67, Channel = 68, Char = 69, ProjectedRef = 70, FloatArraySlice = 71,
}
Expand description

Discriminator for HeapValue variants, usable without full pattern match.

The discriminant order is ABI-stable (checked by tests in tags.rs). New variants MUST be appended at the end.

Variants§

§

String = 0

§

Array = 1

§

TypedObject = 2

§

Closure = 3

§

Decimal = 4

§

BigInt = 5

§

HostClosure = 6

§

DataTable = 7

§

TypedTable = 8

§

RowView = 9

§

ColumnRef = 10

§

IndexedTable = 11

§

Range = 12

§

Enum = 13

§

Some = 14

§

Ok = 15

§

Err = 16

§

Future = 17

§

TaskGroup = 18

§

TraitObject = 19

§

ExprProxy = 20

§

FilterExpr = 21

§

Time = 22

§

Duration = 23

§

TimeSpan = 24

§

Timeframe = 25

§

TimeReference = 26

§

DateTimeExpr = 27

§

DataDateTimeRef = 28

§

TypeAnnotation = 29

§

TypeAnnotatedValue = 30

§

PrintResult = 31

§

SimulationCall = 32

§

FunctionRef = 33

§

DataReference = 34

§

Number = 35

§

Bool = 36

§

None = 37

§

Unit = 38

§

Function = 39

§

ModuleFunction = 40

§

HashMap = 41

§

Content = 42

§

Instant = 43

§

IoHandle = 44

§

SharedCell = 45

§

NativeScalar = 46

§

NativeView = 47

§

IntArray = 48

§

FloatArray = 49

§

BoolArray = 50

§

Matrix = 51

§

Iterator = 52

§

Generator = 53

§

Mutex = 54

§

Atomic = 55

§

Lazy = 56

§

I8Array = 57

§

I16Array = 58

§

I32Array = 59

§

U8Array = 60

§

U16Array = 61

§

U32Array = 62

§

U64Array = 63

§

F32Array = 64

§

Set = 65

§

Deque = 66

§

PriorityQueue = 67

§

Channel = 68

§

Char = 69

§

ProjectedRef = 70

§

FloatArraySlice = 71

Implementations§

Source§

impl HeapKind

Source

pub const MAX_VARIANT: Self = HeapKind::FloatArraySlice

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

Source

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

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

Source

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

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

Trait Implementations§

Source§

impl Clone for HeapKind

Source§

fn clone(&self) -> HeapKind

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for HeapKind

Source§

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

Formats the value using the given formatter. Read more
Source§

impl PartialEq for HeapKind

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

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

impl Copy for HeapKind

Source§

impl Eq for HeapKind

Source§

impl StructuralPartialEq for HeapKind

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,