5651a11ac8
See https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/Opt.20out.20of.20.22included.20section.20variable.20is.20not.20used.22.20linter
43 lines
1.6 KiB
Text
43 lines
1.6 KiB
Text
/-
|
|
Copyright (c) 2022 Lars König. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
Authors: Lars König
|
|
-/
|
|
prelude
|
|
import Lean.Data.Options
|
|
import Lean.Server.InfoUtils
|
|
import Lean.Linter.Basic
|
|
|
|
namespace Lean.Linter
|
|
|
|
open Lean.Elab
|
|
|
|
/-- Go upwards through the given `tree` starting from the smallest node that
|
|
contains the given `range` and collect all `MacroExpansionInfo`s on the way up.
|
|
The result is `some []` if no `MacroExpansionInfo` was found on the way and
|
|
`none` if no `InfoTree` node was found that covers the given `range`.
|
|
|
|
Return the result reversed, s.t. the macro expansion that would be applied to
|
|
the original syntax first is the first element of the returned list. -/
|
|
def collectMacroExpansions? {m} [Monad m] (range : String.Range) (tree : Elab.InfoTree) : m <| Option <| List Elab.MacroExpansionInfo := do
|
|
if let .some <| .some result ← go then
|
|
return some result.reverse
|
|
else
|
|
return none
|
|
where
|
|
go : m <| Option <| Option <| List Elab.MacroExpansionInfo := tree.visitM (postNode := fun _ i _ results => do
|
|
let results := results |>.filterMap id |>.filterMap id
|
|
|
|
-- we expect that at most one InfoTree child returns a result
|
|
if let results :: _ := results then
|
|
if let .ofMacroExpansionInfo i := i then
|
|
return some <| i :: results
|
|
else
|
|
return some results
|
|
else if i.contains range.start && i.contains (includeStop := true) range.stop then
|
|
if let .ofMacroExpansionInfo i := i then
|
|
return some [i]
|
|
else
|
|
return some []
|
|
else
|
|
return none)
|