Init.Data.ToString.Basic

source

class ToString (α : Type u) :

Type u

toString : α → String

Instances

source

instance instToStringIdType {α : Type u_1} [inst : ToString α] :

ToString (id α)

Equations

instToStringIdType = inferInstanceAs (ToString α)

source

instance instToStringId {α : Type u_1} [inst : ToString α] :

ToString (Id α)

Equations

instToStringId = inferInstanceAs (ToString α)

source

instance instToStringString:

ToString String

Equations

instToStringString = { toString := fun s => s }

source

instance instToStringSubstring:

ToString Substring

Equations

instToStringSubstring = { toString := fun s => Substring.toString s }

source

instance instToStringIterator:

ToString String.Iterator

Equations

instToStringIterator = { toString := fun it => String.Iterator.remainingToString it }

source

instance instToStringBool:

ToString Bool

Equations

instToStringBool = { toString := fun b => bif b then "true" else "false" }

source

instance instToStringDecidable {p : Prop} :

ToString (Decidable p)

Equations

instToStringDecidable = { toString := fun h => match h with | isTrue h => "true" | isFalse h => "false" }

source

def List.toStringAux {α : Type u} [inst : ToString α] :

Bool → List α → String

Equations

List.toStringAux _fun_discr [] = ""
List.toStringAux true (x :: xs) = toString x ++ List.toStringAux false xs
List.toStringAux false (x :: xs) = ", " ++ toString x ++ List.toStringAux false xs

source

def List.toString {α : Type u} [inst : ToString α] :

List α → String

Equations

List.toString _fun_discr = match _fun_discr with | [] => "[]" | x :: xs => "[" ++ List.toStringAux true (x :: xs) ++ "]"

source

instance instToStringList {α : Type u} [inst : ToString α] :

ToString (List α)

Equations

instToStringList = { toString := List.toString }

source

instance instToStringPUnit:

ToString PUnit

Equations

instToStringPUnit = { toString := fun x => "()" }

source

instance instToStringULift {α : Type u} [inst : ToString α] :

ToString (ULift α)

Equations

instToStringULift = { toString := fun v => toString v.down }

source

instance instToStringUnit:

ToString Unit

Equations

instToStringUnit = { toString := fun x => "()" }

source

instance instToStringNat:

ToString Nat

Equations

instToStringNat = { toString := fun n => Nat.repr n }

source

instance instToStringPos:

ToString String.Pos

Equations

instToStringPos = { toString := fun p => Nat.repr p.byteIdx }

source

instance instToStringInt:

ToString Int

Equations

instToStringInt = { toString := fun x => match x with | Int.ofNat m => toString m | Int.negSucc m => "-" ++ toString (Nat.succ m) }

source

instance instToStringChar:

ToString Char

Equations

instToStringChar = { toString := fun c => Char.toString c }

source

instance instToStringFin (n : Nat) :

ToString (Fin n)

Equations

instToStringFin n = { toString := fun f => toString f.val }

source

instance instToStringUInt8:

ToString UInt8

Equations

instToStringUInt8 = { toString := fun n => toString (UInt8.toNat n) }

source

instance instToStringUInt16:

ToString UInt16

Equations

instToStringUInt16 = { toString := fun n => toString (UInt16.toNat n) }

source

instance instToStringUInt32:

ToString UInt32

Equations

instToStringUInt32 = { toString := fun n => toString (UInt32.toNat n) }

source

instance instToStringUInt64:

ToString UInt64

Equations

instToStringUInt64 = { toString := fun n => toString (UInt64.toNat n) }

source

instance instToStringUSize:

ToString USize

Equations

instToStringUSize = { toString := fun n => toString (USize.toNat n) }

source

instance instToStringFormat:

ToString Lean.Format

Equations

instToStringFormat = { toString := fun f => Lean.Format.pretty f }

source

def addParenHeuristic (s : String) :

String

Equations

One or more equations did not get rendered due to their size.

source

instance instToStringOption {α : Type u} [inst : ToString α] :

ToString (Option α)

Equations

instToStringOption = { toString := fun x => match x with | none => "none" | some a => "(some " ++ addParenHeuristic (toString a) ++ ")" }

source

instance instToStringSum {α : Type u} {β : Type v} [inst : ToString α] [inst : ToString β] :

ToString (α ⊕ β)

Equations

One or more equations did not get rendered due to their size.

source

instance instToStringProd {α : Type u} {β : Type v} [inst : ToString α] [inst : ToString β] :

ToString (α × β)

Equations

instToStringProd = { toString := fun x => match x with | (a, b) => "(" ++ toString a ++ ", " ++ toString b ++ ")" }

source

instance instToStringSigma {α : Type u} {β : α → Type v} [inst : ToString α] [inst : (x : α) → ToString (β x)] :

ToString (Sigma β)

Equations

instToStringSigma = { toString := fun x => match x with | { fst := a, snd := b } => "⟨" ++ toString a ++ ", " ++ toString b ++ "⟩" }

source

instance instToStringSubtype {α : Type u} {p : α → Prop} [inst : ToString α] :

ToString (Subtype p)

Equations

instToStringSubtype = { toString := fun s => toString s.val }

source

def String.toInt? (s : String) :

Option Int

Equations

String.toInt? s = if String.get s 0 = Char.ofNat 45 then do let v ← Substring.toNat? (Substring.drop (String.toSubstring s) 1) pure (-Int.ofNat v) else Int.ofNat <$> String.toNat? s

source

def String.isInt (s : String) :

Bool

Equations

String.isInt s = if String.get s 0 = Char.ofNat 45 then Substring.isNat (Substring.drop (String.toSubstring s) 1) else String.isNat s

source

def String.toInt! (s : String) :

Int

Equations

String.toInt! s = match String.toInt? s with | some v => v | none => panic "Int expected"

source

instance instToStringExcept {ε : Type u_1} {α : Type u_2} [inst : ToString ε] [inst : ToString α] :

ToString (Except ε α)

Equations

instToStringExcept = { toString := fun x => match x with | Except.error e => "error: " ++ toString e | Except.ok a => "ok: " ++ toString a }

source

instance instReprExcept {ε : Type u_1} {α : Type u_2} [inst : Repr ε] [inst : Repr α] :

Repr (Except ε α)

Equations

One or more equations did not get rendered due to their size.