inductive Lean.DataValue : Type

• ofString: String → Lean.DataValue
• ofBool: Bool → Lean.DataValue
• ofName: Lake.Name → Lean.DataValue
• ofNat: Nat → Lean.DataValue
• ofInt: Int → Lean.DataValue
• ofSyntax: Lean.Syntax → Lean.DataValue

Value stored in a key-value map.

instance Lean.instInhabitedDataValue : Inhabited Lean.DataValue

instance Lean.instBEqDataValue : BEq Lean.DataValue

instance Lean.instReprDataValue : Repr Lean.DataValue

@[export lean_data_value_beq]

def Lean.DataValue.beqExp (a : Lean.DataValue) (b : Lean.DataValue) : Bool

@[export lean_mk_bool_data_value]

def Lean.mkBoolDataValueEx (b : Bool) : Lean.DataValue

@[export lean_data_value_bool]

def Lean.DataValue.getBoolEx : Lean.DataValue → Bool

def Lean.DataValue.sameCtor : Lean.DataValue → Lean.DataValue → Bool

@[export lean_data_value_to_string]

def Lean.DataValue.str : Lean.DataValue → String

instance Lean.instToStringDataValue : ToString Lean.DataValue

instance Lean.instCoeStringDataValue : Coe String Lean.DataValue

instance Lean.instCoeBoolDataValue : Coe Bool Lean.DataValue

instance Lean.instCoeNameDataValue : Coe Lake.Name Lean.DataValue

instance Lean.instCoeNatDataValue : Coe Nat Lean.DataValue

instance Lean.instCoeIntDataValue : Coe Int Lean.DataValue

instance Lean.instCoeSyntaxDataValue : Coe Lean.Syntax Lean.DataValue

structure Lean.KVMap : Type

• entries : List (Lake.Name × Lean.DataValue)

A key-value map. We use it to represent user-selected options and Expr.mdata.

Remark: we do not use RBMap here because we need to manipulate KVMap objects in C++ and RBMap is implemented in Lean. So, we use just a List until we can generate C++ code from Lean code.

instance Lean.instInhabitedKVMap : Inhabited Lean.KVMap

instance Lean.instReprKVMap : Repr Lean.KVMap

instance Lean.KVMap.instToStringKVMap : ToString Lean.KVMap

def Lean.KVMap.empty : Lean.KVMap

def Lean.KVMap.isEmpty : Lean.KVMap → Bool

def Lean.KVMap.size (m : Lean.KVMap) : Nat

def Lean.KVMap.findCore : List (Lake.Name × Lean.DataValue) → Lake.Name → Option Lean.DataValue

Equations

• Lean.KVMap.findCore [] x = none
• Lean.KVMap.findCore ((k, v) :: m) x = if (k == x) = true then some v else Lean.KVMap.findCore m x

def Lean.KVMap.find : Lean.KVMap → Lake.Name → Option Lean.DataValue

def Lean.KVMap.findD (m : Lean.KVMap) (k : Lake.Name) (d₀ : Lean.DataValue) : Lean.DataValue

def Lean.KVMap.insertCore : List (Lake.Name × Lean.DataValue) → Lake.Name → Lean.DataValue → List (Lake.Name × Lean.DataValue)

Equations

• Lean.KVMap.insertCore [] x x = [(x, x)]
• Lean.KVMap.insertCore ((k, v) :: m) x x = if (k == x) = true then (k, x) :: m else (k, v) :: Lean.KVMap.insertCore m x x

def Lean.KVMap.insert : Lean.KVMap → Lake.Name → Lean.DataValue → Lean.KVMap

def Lean.KVMap.contains (m : Lean.KVMap) (n : Lake.Name) : Bool

def Lean.KVMap.getString (m : Lean.KVMap) (k : Lake.Name) (defVal : optParam String "") : String

def Lean.KVMap.getNat (m : Lean.KVMap) (k : Lake.Name) (defVal : optParam Nat 0) : Nat

def Lean.KVMap.getInt (m : Lean.KVMap) (k : Lake.Name) (defVal : optParam Int 0) : Int

def Lean.KVMap.getBool (m : Lean.KVMap) (k : Lake.Name) (defVal : optParam Bool false) : Bool

def Lean.KVMap.getName (m : Lean.KVMap) (k : Lake.Name) (defVal : optParam Lake.Name Lean.Name.anonymous) : Lake.Name

def Lean.KVMap.getSyntax (m : Lean.KVMap) (k : Lake.Name) (defVal : optParam Lean.Syntax Lean.Syntax.missing) : Lean.Syntax

def Lean.KVMap.setString (m : Lean.KVMap) (k : Lake.Name) (v : String) : Lean.KVMap

def Lean.KVMap.setNat (m : Lean.KVMap) (k : Lake.Name) (v : Nat) : Lean.KVMap

def Lean.KVMap.setInt (m : Lean.KVMap) (k : Lake.Name) (v : Int) : Lean.KVMap

def Lean.KVMap.setBool (m : Lean.KVMap) (k : Lake.Name) (v : Bool) : Lean.KVMap

def Lean.KVMap.setName (m : Lean.KVMap) (k : Lake.Name) (v : Lake.Name) : Lean.KVMap

def Lean.KVMap.setSyntax (m : Lean.KVMap) (k : Lake.Name) (v : Lean.Syntax) : Lean.KVMap

@[inline]

def Lean.KVMap.forIn {δ : Type w} {m : Type w → Type w'} [Monad m] (kv : Lean.KVMap) (init : δ) (f : Lake.Name × Lean.DataValue → δ → m (ForInStep δ)) : m δ

instance Lean.KVMap.instForInKVMapProdNameDataValue {m : Type u_1 → Type u_2} : ForIn m Lean.KVMap (Lake.Name × Lean.DataValue)

def Lean.KVMap.subsetAux : List (Lake.Name × Lean.DataValue) → Lean.KVMap → Bool

Equations

• Lean.KVMap.subsetAux [] x = true
• Lean.KVMap.subsetAux ((k, v₁) :: m₁) x = match Lean.KVMap.find x k with | some v₂ => v₁ == v₂ && Lean.KVMap.subsetAux m₁ x | none => false

def Lean.KVMap.subset : Lean.KVMap → Lean.KVMap → Bool

def Lean.KVMap.eqv (m₁ : Lean.KVMap) (m₂ : Lean.KVMap) : Bool

instance Lean.KVMap.instBEqKVMap : BEq Lean.KVMap

class Lean.KVMap.Value (α : Type) : Type

• toDataValue : α → Lean.DataValue
• ofDataValue? : Lean.DataValue → Option α

@[inline]

def Lean.KVMap.get? {α : Type} [Lean.KVMap.Value α] (m : Lean.KVMap) (k : Lake.Name) : Option α

@[inline]

def Lean.KVMap.get {α : Type} [Lean.KVMap.Value α] (m : Lean.KVMap) (k : Lake.Name) (defVal : α) : α

@[inline]

def Lean.KVMap.set {α : Type} [Lean.KVMap.Value α] (m : Lean.KVMap) (k : Lake.Name) (v : α) : Lean.KVMap

instance Lean.KVMap.instValueDataValue : Lean.KVMap.Value Lean.DataValue

instance Lean.KVMap.instValueBool : Lean.KVMap.Value Bool

instance Lean.KVMap.instValueNat : Lean.KVMap.Value Nat

instance Lean.KVMap.instValueInt : Lean.KVMap.Value Int

instance Lean.KVMap.instValueName : Lean.KVMap.Value Lake.Name

instance Lean.KVMap.instValueString : Lean.KVMap.Value String

instance Lean.KVMap.instValueSyntax : Lean.KVMap.Value Lean.Syntax