e29d75a961
By having the `pp.proofs` feature use `⋯` when omitting proofs, when users copy/paste terms from the InfoView the elaborator can give an error message explaining why the term cannot be elaborated. Also adds `pp.proofs.threshold` option to allow users to pretty print shallow proof terms. By default, only atomic proof terms are pretty printed. This adjustment was suggested in PR #3201, which added `⋯` and the related `pp.deepTerms` option.
17 lines
939 B
Text
17 lines
939 B
Text
heapSort.lean:15:4-15:15: warning: declaration uses 'sorry'
|
||
heapSort.lean:15:4-15:15: warning: declaration uses 'sorry'
|
||
heapSort.lean:15:4-15:15: warning: declaration uses 'sorry'
|
||
heapSort.lean:43:4-43:10: warning: declaration uses 'sorry'
|
||
heapSort.lean:58:4-58:13: warning: declaration uses 'sorry'
|
||
heapSort.lean:58:4-58:13: warning: declaration uses 'sorry'
|
||
heapSort.lean:58:4-58:13: warning: declaration uses 'sorry'
|
||
heapSort.lean:102:4-102:13: warning: declaration uses 'sorry'
|
||
heapSort.lean:102:4-102:13: warning: declaration uses 'sorry'
|
||
Array.heapSort.loop._eq_1.{u_1} {α : Type u_1} (lt : α → α → Bool) (a : BinaryHeap α fun y x => lt x y)
|
||
(out : Array α) :
|
||
Array.heapSort.loop lt a out =
|
||
match e : BinaryHeap.max a with
|
||
| none => out
|
||
| some x =>
|
||
let_fun this := (⋯ : BinaryHeap.size (BinaryHeap.popMax a) < BinaryHeap.size a);
|
||
Array.heapSort.loop lt (BinaryHeap.popMax a) (Array.push out x)
|