#[repr(u8)]pub enum Kind {
Show 16 variants
Set = 0,
IntFcn = 1,
Fcn = 2,
Interval = 3,
Subset = 4,
FcnSet = 5,
RecSet = 6,
SeqSet = 7,
Nat = 8,
Int = 9,
Product = 10,
Union = 11,
Lambda = 12,
SetPred = 13,
BigInt = 14,
SetEnum = 15,
}Expand description
The kind of a compound node.
Variants§
Set = 0
A finite set: sorted distinct elements.
IntFcn = 1
A function over lo..lo+len-1: its values.
Fcn = 2
Any other function: len sorted keys, then len values.
Interval = 3
lo..hi: data = [hi].
Subset = 4
SUBSET S: data = [S].
FcnSet = 5
[D -> R]: data = [D, R].
RecSet = 6
[f1 : S1, ...]: n sorted field names, then n sets.
SeqSet = 7
Seq(S): data = [S].
Nat = 8
Nat.
Int = 9
Int.
Product = 10
S1 \X ... \X Sn: the factors.
Union = 11
A \cup B, kept lazy: data = [A, B].
Lambda = 12
[x \in D |-> e] before it is materialized: lo is the closure id
(the evaluator’s), data = [D, captures...]. Lazy.
SetPred = 13
{x \in S : P} before it is enumerated: lo is the closure id,
data = [S, captures...]. Lazy.
BigInt = 14
An integer outside the inline 61-bit range: lo is the sign, data
the magnitude’s 32-bit digits (least significant first) as inline
integers. Not a set (int.rs).
SetEnum = 15
A set enumeration that TLC has not normalized yet
(SetEnumValue with isNorm false): its elements in construction
order, duplicates kept. Carries flags::UNNORM. A view, never an
identity: it is normalized like any finite symbolic set
(03-value-model.md §8).
Implementations§
Source§impl Kind
impl Kind
Sourcepub const fn is_symbolic(self) -> bool
pub const fn is_symbolic(self) -> bool
Whether the kind is a symbolic set that the heap can enumerate on its
own (not Kind::SetPred, which needs the evaluator).