pub enum ValueKind {
Show 30 variants
U8,
U16,
U32,
U64,
U128,
I8,
I16,
I32,
I64,
I128,
F32,
F64,
ComplexNumber,
RationalNumber,
String,
Bool,
Id,
Index,
Empty,
Any,
Matrix(Box<ValueKind>, Vec<usize>),
Enum(u64),
Record(Vec<(String, ValueKind)>),
Map(Box<ValueKind>, Box<ValueKind>),
Atom(u64),
Table(Vec<(String, ValueKind)>, usize),
Tuple(Vec<ValueKind>),
Reference(Box<ValueKind>),
Set(Box<ValueKind>, Option<usize>),
Option(Box<ValueKind>),
}
Variants§
U8
U16
U32
U64
U128
I8
I16
I32
I64
I128
F32
F64
ComplexNumber
RationalNumber
String
Bool
Id
Index
Empty
Any
Matrix(Box<ValueKind>, Vec<usize>)
Enum(u64)
Record(Vec<(String, ValueKind)>)
Map(Box<ValueKind>, Box<ValueKind>)
Atom(u64)
Table(Vec<(String, ValueKind)>, usize)
Tuple(Vec<ValueKind>)
Reference(Box<ValueKind>)
Set(Box<ValueKind>, Option<usize>)
Option(Box<ValueKind>)
Implementations§
Source§impl ValueKind
impl ValueKind
pub fn to_feature_kind(&self) -> FeatureKind
pub fn collection_kind(&self) -> Option<ValueKind>
pub fn deref_kind(&self) -> ValueKind
pub fn is_convertible_to(&self, other: &ValueKind) -> bool
pub fn is_compatible(k1: ValueKind, k2: ValueKind) -> bool
pub fn align(&self) -> usize
Trait Implementations§
Source§impl<'de> Deserialize<'de> for ValueKind
impl<'de> Deserialize<'de> for ValueKind
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for ValueKind
impl StructuralPartialEq for ValueKind
Auto Trait Implementations§
impl Freeze for ValueKind
impl RefUnwindSafe for ValueKind
impl Send for ValueKind
impl Sync for ValueKind
impl Unpin for ValueKind
impl UnwindSafe for ValueKind
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.