5b08bf18c5
@kha It will be awesome to automate the following idiom with a macro :)
```
def defIndent := 4
def getIndent (o : Options) : Nat := o.get `format.indent defIndent
@[init] def indentOption : IO Unit :=
registerOption `format.indent { defValue := defIndent, group := "format", descr := "indentation" }
```
134 lines
4.3 KiB
Text
134 lines
4.3 KiB
Text
/-
|
||
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
|
||
Released under Apache 2.0 license as described in the file LICENSE.
|
||
Authors: Leonardo de Moura
|
||
-/
|
||
prelude
|
||
import init.lean.name init.data.option.basic init.data.int
|
||
|
||
namespace Lean
|
||
|
||
inductive DataValue
|
||
| ofString (v : String)
|
||
| ofBool (v : Bool)
|
||
| ofName (v : Name)
|
||
| ofNat (v : Nat)
|
||
| ofInt (v : Int)
|
||
|
||
def DataValue.beq : DataValue → DataValue → Bool
|
||
| (DataValue.ofString s₁) (DataValue.ofString s₂) := s₁ = s₂
|
||
| (DataValue.ofNat n₁) (DataValue.ofNat n₂) := n₂ = n₂
|
||
| (DataValue.ofBool b₁) (DataValue.ofBool b₂) := b₁ = b₂
|
||
| _ _ := false
|
||
|
||
instance DataValue.HasBeq : HasBeq DataValue := ⟨DataValue.beq⟩
|
||
|
||
instance string2DataValue : HasCoe String DataValue := ⟨DataValue.ofString⟩
|
||
instance bool2DataValue : HasCoe Bool DataValue := ⟨DataValue.ofBool⟩
|
||
instance name2DataValue : HasCoe Name DataValue := ⟨DataValue.ofName⟩
|
||
instance nat2DataValue : HasCoe Nat DataValue := ⟨DataValue.ofNat⟩
|
||
instance int2DataValue : HasCoe Int DataValue := ⟨DataValue.ofInt⟩
|
||
|
||
/- 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. -/
|
||
structure KVMap :=
|
||
(entries : List (Name × DataValue) := [])
|
||
|
||
namespace KVMap
|
||
def findCore : List (Name × DataValue) → Name → Option DataValue
|
||
| [] k' := none
|
||
| ((k,v)::m) k' := if k = k' then some v else findCore m k'
|
||
|
||
def find : KVMap → Name → Option DataValue
|
||
| ⟨m⟩ k := findCore m k
|
||
|
||
def insertCore : List (Name × DataValue) → Name → DataValue → List (Name × DataValue)
|
||
| [] k' v' := [(k',v')]
|
||
| ((k,v)::m) k' v' := if k = k' then (k, v') :: m else (k, v) :: insertCore m k' v'
|
||
|
||
def insert : KVMap → Name → DataValue → KVMap
|
||
| ⟨m⟩ k v := ⟨insertCore m k v⟩
|
||
|
||
def contains (m : KVMap) (n : Name) : Bool :=
|
||
(m.find n).isSome
|
||
|
||
def getString (m : KVMap) (k : Name) (defVal := "") : String :=
|
||
match m.find k with
|
||
| some (DataValue.ofString v) := v
|
||
| _ := defVal
|
||
|
||
def getNat (m : KVMap) (k : Name) (defVal := 0) : Nat :=
|
||
match m.find k with
|
||
| some (DataValue.ofNat v) := v
|
||
| _ := defVal
|
||
|
||
def getInt (m : KVMap) (k : Name) (defVal : Int := 0) : Int :=
|
||
match m.find k with
|
||
| some (DataValue.ofInt v) := v
|
||
| _ := defVal
|
||
|
||
def getBool (m : KVMap) (k : Name) (defVal := false) : Bool :=
|
||
match m.find k with
|
||
| some (DataValue.ofBool v) := v
|
||
| _ := defVal
|
||
|
||
def getName (m : KVMap) (k : Name) (defVal := Name.anonymous) : Name :=
|
||
match m.find k with
|
||
| some (DataValue.ofName v) := v
|
||
| _ := defVal
|
||
|
||
def setString (m : KVMap) (k : Name) (v : String) : KVMap :=
|
||
m.insert k (DataValue.ofString v)
|
||
|
||
def setNat (m : KVMap) (k : Name) (v : Nat) : KVMap :=
|
||
m.insert k (DataValue.ofNat v)
|
||
|
||
def setInt (m : KVMap) (k : Name) (v : Int) : KVMap :=
|
||
m.insert k (DataValue.ofInt v)
|
||
|
||
def setBool (m : KVMap) (k : Name) (v : Bool) : KVMap :=
|
||
m.insert k (DataValue.ofBool v)
|
||
|
||
def setName (m : KVMap) (k : Name) (v : Name) : KVMap :=
|
||
m.insert k (DataValue.ofName v)
|
||
|
||
def subset : KVMap → KVMap → Bool
|
||
| ⟨[]⟩ m₂ := true
|
||
| ⟨(k, v₁)::m₁⟩ m₂ :=
|
||
(match m₂.find k with
|
||
| some v₂ := v₁ == v₂ && subset ⟨m₁⟩ m₂
|
||
| none := false)
|
||
|
||
def eqv (m₁ m₂ : KVMap) : Bool :=
|
||
subset m₁ m₂ && subset m₂ m₁
|
||
|
||
instance : HasBeq KVMap := ⟨eqv⟩
|
||
|
||
class isKVMapVal (α : Type) :=
|
||
(defVal : α)
|
||
(set : KVMap → Name → α → KVMap)
|
||
(get : KVMap → Name → α → α)
|
||
|
||
export isKVMapVal (set)
|
||
|
||
@[inline] def get {α : Type} [isKVMapVal α] (m : KVMap) (k : Name) (defVal := isKVMapVal.defVal α) : α :=
|
||
isKVMapVal.get m k defVal
|
||
|
||
instance boolVal : isKVMapVal Bool :=
|
||
{ defVal := false, set := setBool, get := λ k n v, getBool k n v }
|
||
|
||
instance natVal : isKVMapVal Nat :=
|
||
{ defVal := 0, set := setNat, get := λ k n v, getNat k n v }
|
||
|
||
instance intVal : isKVMapVal Int :=
|
||
{ defVal := 0, set := setInt, get := λ k n v, getInt k n v }
|
||
|
||
instance nameVal : isKVMapVal Name :=
|
||
{ defVal := Name.anonymous, set := setName, get := λ k n v, getName k n v }
|
||
|
||
instance stringVal : isKVMapVal String :=
|
||
{ defVal := "", set := setString, get := λ k n v, getString k n v }
|
||
|
||
end KVMap
|
||
end Lean
|