154 lines
5.4 KiB
Text
154 lines
5.4 KiB
Text
/-
|
||
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
|
||
Released under Apache 2.0 license as described in the file LICENSE.
|
||
Author: Leonardo de Moura
|
||
-/
|
||
prelude
|
||
import init.control.except init.control.reader init.control.state
|
||
universes u v
|
||
|
||
namespace Lean
|
||
|
||
inductive Format
|
||
| nil : Format
|
||
| line : Format
|
||
| text : String → Format
|
||
| nest : Nat → Format → Format
|
||
| compose : Bool → Format → Format → Format
|
||
| choice : Format → Format → Format
|
||
|
||
namespace Format
|
||
instance : HasAppend Format := ⟨compose false⟩
|
||
instance : HasCoe String Format := ⟨text⟩
|
||
|
||
def join (xs : List Format) : Format :=
|
||
xs.foldl (++) ""
|
||
|
||
def flatten : Format → Format
|
||
| nil := nil
|
||
| line := text " "
|
||
| f@(text _) := f
|
||
| (nest _ f) := flatten f
|
||
| (choice f _) := flatten f
|
||
| f@(compose true _ _) := f
|
||
| f@(compose false f₁ f₂) := compose true (flatten f₁) (flatten f₂)
|
||
|
||
def group : Format → Format
|
||
| nil := nil
|
||
| f@(text _) := f
|
||
| f@(compose true _ _) := f
|
||
| f := choice (flatten f) f
|
||
|
||
structure SpaceResult :=
|
||
(found := false)
|
||
(exceeded := false)
|
||
(space := 0)
|
||
|
||
/-
|
||
TODO: mark as `@[inline]` as soon as we fix the code inliner.
|
||
-/
|
||
private def merge (w : Nat) (r₁ : SpaceResult) (r₂ : Thunk SpaceResult) : SpaceResult :=
|
||
if r₁.exceeded || r₁.found then r₁
|
||
else let y := r₂.get in
|
||
if y.exceeded || y.found then y
|
||
else let newSpace := r₁.space + y.space in
|
||
{ space := newSpace, exceeded := newSpace > w }
|
||
|
||
def spaceUptoLine : Format → Nat → SpaceResult
|
||
| nil w := {}
|
||
| line w := { found := true }
|
||
| (text s) w := { space := s.length, exceeded := s.length > w }
|
||
| (compose _ f₁ f₂) w := merge w (spaceUptoLine f₁ w) (spaceUptoLine f₂ w)
|
||
| (nest _ f) w := spaceUptoLine f w
|
||
| (choice f₁ f₂) w := spaceUptoLine f₂ w
|
||
|
||
def spaceUptoLine' : List (Nat × Format) → Nat → SpaceResult
|
||
| [] w := {}
|
||
| (p::ps) w := merge w (spaceUptoLine p.2 w) (spaceUptoLine' ps w)
|
||
|
||
def be : Nat → Nat → String → List (Nat × Format) → String
|
||
| w k out [] := out
|
||
| w k out ((i, nil)::z) := be w k out z
|
||
| w k out ((i, (compose _ f₁ f₂))::z) := be w k out ((i, f₁)::(i, f₂)::z)
|
||
| w k out ((i, (nest n f))::z) := be w k out ((i+n, f)::z)
|
||
| w k out ((i, text s)::z) := be w (k + s.length) (out ++ s) z
|
||
| w k out ((i, line)::z) := be w i ((out ++ "\n").pushn ' ' i) z
|
||
| w k out ((i, choice f₁ f₂)::z) :=
|
||
let r := merge w (spaceUptoLine f₁ w) (spaceUptoLine' z w) in
|
||
if r.exceeded then be w k out ((i, f₂)::z) else be w k out ((i, f₁)::z)
|
||
|
||
def pretty (f : Format) (w : Nat := 80) : String :=
|
||
be w 0 "" [(0, f)]
|
||
|
||
@[inline] def bracket (l : String) (f : Format) (r : String) : Format :=
|
||
group (nest l.length $ l ++ f ++ r)
|
||
|
||
@[inline] def paren (f : Format) : Format :=
|
||
bracket "(" f ")"
|
||
|
||
@[inline] def sbracket (f : Format) : Format :=
|
||
bracket "[" f "]"
|
||
|
||
end Format
|
||
|
||
open Lean.Format
|
||
|
||
class HasToFormat (α : Type u) :=
|
||
(toFormat : α → Format)
|
||
|
||
export Lean.HasToFormat (toFormat)
|
||
|
||
def toFmt {α : Type u} [HasToFormat α] : α → Format :=
|
||
toFormat
|
||
|
||
instance toStringToFormat {α : Type u} [HasToString α] : HasToFormat α :=
|
||
⟨text ∘ toString⟩
|
||
|
||
-- note: must take precendence over the above instance to avoid premature formatting
|
||
instance formatHasToFormat : HasToFormat Format :=
|
||
⟨id⟩
|
||
|
||
instance stringHasToFormat : HasToFormat String := ⟨Format.text⟩
|
||
|
||
def Format.joinSep {α : Type u} [HasToFormat α] : List α → Format → Format
|
||
| [] sep := nil
|
||
| [a] sep := toFmt a
|
||
| (a::as) sep := toFmt a ++ sep ++ Format.joinSep as sep
|
||
|
||
def Format.prefixJoin {α : Type u} [HasToFormat α] (pre : Format) : List α → Format
|
||
| [] := nil
|
||
| (a::as) := pre ++ toFmt a ++ Format.prefixJoin as
|
||
|
||
def Format.joinSuffix {α : Type u} [HasToFormat α] : List α → Format → Format
|
||
| [] suffix := nil
|
||
| (a::as) suffix := toFmt a ++ suffix ++ Format.joinSuffix as suffix
|
||
|
||
def List.toFormat {α : Type u} [HasToFormat α] : List α → Format
|
||
| [] := "[]"
|
||
| xs := sbracket $ Format.joinSep xs ("," ++ line)
|
||
|
||
instance listHasToFormat {α : Type u} [HasToFormat α] : HasToFormat (List α) :=
|
||
⟨List.toFormat⟩
|
||
|
||
instance prodHasToFormat {α : Type u} {β : Type v} [HasToFormat α] [HasToFormat β] : HasToFormat (Prod α β) :=
|
||
⟨λ ⟨a, b⟩, paren $ toFormat a ++ "," ++ line ++ toFormat b⟩
|
||
|
||
instance natHasToFormat : HasToFormat Nat := ⟨λ n, toString n⟩
|
||
instance uint16HasToFormat : HasToFormat Uint16 := ⟨λ n, toString n⟩
|
||
instance uint32HasToFormat : HasToFormat Uint32 := ⟨λ n, toString n⟩
|
||
instance uint64HasToFormat : HasToFormat Uint64 := ⟨λ n, toString n⟩
|
||
instance usizeHasToFormat : HasToFormat Usize := ⟨λ n, toString n⟩
|
||
|
||
instance formatHasToString : HasToString Format := ⟨pretty⟩
|
||
|
||
protected def Format.repr : Format → Format
|
||
| nil := "Format.nil"
|
||
| line := "Format.line"
|
||
| (text s) := paren $ "Format.text" ++ line ++ repr s
|
||
| (nest n f) := paren $ "Format.nest" ++ line ++ repr n ++ line ++ Format.repr f
|
||
| (compose b f₁ f₂) := paren $ "Format.compose " ++ repr b ++ line ++ Format.repr f₁ ++ line ++ Format.repr f₂
|
||
| (choice f₁ f₂) := paren $ "Format.choice" ++ line ++ Format.repr f₁ ++ line ++ Format.repr f₂
|
||
|
||
instance : HasRepr Format := ⟨Format.pretty ∘ Format.repr⟩
|
||
|
||
end Lean
|