dfd3d18530
This PR significantly improves the test coverage of the language server, providing at least a single basic test for every request that is used by the client. It also implements infrastructure for testing all of these requests, e.g. the ability to run interactive tests in a project context and refactors the interactive test runner to be more maintainable. Finally, it also fixes a small bug with the recently implemented unknown identifier code actions for auto-implicits (#10442) that was discovered in testing, where the "import all unambiguous unknown identifiers" code action didn't work correctly on auto-implicit identifiers.
40 lines
842 B
Text
40 lines
842 B
Text
namespace Foo
|
|
namespace Bla
|
|
|
|
theorem ex1 {a b : Nat} (h : a ≤ b) : a + a ≤ b + b :=
|
|
sorry
|
|
|
|
theorem ex2 {a b : Nat} (h : a ≤ b) : a + 2 ≤ b + 2 :=
|
|
sorry
|
|
|
|
theorem ex3 {a b c d : Nat} (h : a ≤ b) (h : c ≤ d) : a + c ≤ b + d :=
|
|
sorry
|
|
|
|
theorem ax1 {a b : Nat} (h : a ≤ b) : a - a ≤ b - b :=
|
|
sorry
|
|
|
|
end Bla
|
|
end Foo
|
|
|
|
theorem tst1 (h : a ≤ b) : a + 2 ≤ b + 2 :=
|
|
Foo.Bla.
|
|
--^ completion
|
|
#print ""
|
|
|
|
open Foo in
|
|
theorem tst2 (h : a ≤ b) : a + 2 ≤ b + 2 :=
|
|
Bla.
|
|
--^ completion
|
|
#print ""
|
|
|
|
theorem tst3 (h : a ≤ b) : a + 2 ≤ b + 2 :=
|
|
let aux := Foo.Bla. -- we don't have the expected type here
|
|
--^ completion
|
|
aux
|
|
|
|
#print ""
|
|
|
|
theorem tst4 (h : a ≤ b) : a + 2 ≤ b + 2 :=
|
|
let aux := Foo.Bla.e -- we don't have the expected type here
|
|
--^ completion
|
|
aux
|