31763
|
1 |
/* Title: Pure/Thy/completion.scala
|
|
2 |
Author: Makarius
|
|
3 |
|
|
4 |
Completion of symbols and keywords.
|
|
5 |
*/
|
|
6 |
|
|
7 |
package isabelle
|
|
8 |
|
|
9 |
import scala.util.matching.Regex
|
|
10 |
import scala.util.parsing.combinator.RegexParsers
|
|
11 |
|
|
12 |
|
|
13 |
private object Completion
|
|
14 |
{
|
|
15 |
/** word completion **/
|
|
16 |
|
|
17 |
val word_regex = "[a-zA-Z0-9_']+".r
|
|
18 |
def is_word(s: CharSequence): Boolean = word_regex.pattern.matcher(s).matches
|
|
19 |
|
|
20 |
object Parse extends RegexParsers
|
|
21 |
{
|
|
22 |
override val whiteSpace = "".r
|
|
23 |
|
31765
|
24 |
def rev_symbol: Parser[String] = """>[A-Za-z0-9_']+<\\""".r
|
|
25 |
def rev_symb: Parser[String] = """[A-Za-z0-9_']{2,}<\\""".r
|
31763
|
26 |
def word: Parser[String] = "[a-zA-Z0-9_']{3,}".r
|
|
27 |
|
|
28 |
def read(in: CharSequence): Option[String] =
|
|
29 |
{
|
34141
|
30 |
val rev_in = new Library.Reverse(in)
|
31765
|
31 |
parse((rev_symbol | rev_symb | word) ^^ (_.reverse), rev_in) match {
|
31763
|
32 |
case Success(result, _) => Some(result)
|
|
33 |
case _ => None
|
|
34 |
}
|
|
35 |
}
|
|
36 |
}
|
|
37 |
}
|
|
38 |
|
|
39 |
class Completion
|
|
40 |
{
|
|
41 |
/* representation */
|
|
42 |
|
31780
|
43 |
protected val words_lex = Scan.Lexicon()
|
|
44 |
protected val words_map = Map[String, String]()
|
31763
|
45 |
|
31780
|
46 |
protected val abbrevs_lex = Scan.Lexicon()
|
|
47 |
protected val abbrevs_map = Map[String, (String, String)]()
|
31763
|
48 |
|
|
49 |
|
|
50 |
/* adding stuff */
|
|
51 |
|
|
52 |
def + (keyword: String): Completion =
|
|
53 |
{
|
|
54 |
val old = this
|
|
55 |
new Completion {
|
|
56 |
override val words_lex = old.words_lex + keyword
|
|
57 |
override val words_map = old.words_map + (keyword -> keyword)
|
|
58 |
override val abbrevs_lex = old.abbrevs_lex
|
|
59 |
override val abbrevs_map = old.abbrevs_map
|
|
60 |
}
|
|
61 |
}
|
|
62 |
|
|
63 |
def + (symbols: Symbol.Interpretation): Completion =
|
|
64 |
{
|
|
65 |
val words =
|
|
66 |
(for ((x, _) <- symbols.names) yield (x, x)).toList :::
|
|
67 |
(for ((x, y) <- symbols.names) yield (y, x)).toList :::
|
|
68 |
(for ((x, y) <- symbols.abbrevs if Completion.is_word(y)) yield (y, x)).toList
|
|
69 |
|
|
70 |
val abbrs =
|
|
71 |
(for ((x, y) <- symbols.abbrevs if !Completion.is_word(y))
|
31765
|
72 |
yield (y.reverse.toString, (y, x))).toList
|
31763
|
73 |
|
|
74 |
val old = this
|
|
75 |
new Completion {
|
|
76 |
override val words_lex = old.words_lex ++ words.map(_._1)
|
31765
|
77 |
override val words_map = old.words_map ++ words
|
31763
|
78 |
override val abbrevs_lex = old.abbrevs_lex ++ abbrs.map(_._1)
|
|
79 |
override val abbrevs_map = old.abbrevs_map ++ abbrs
|
|
80 |
}
|
|
81 |
}
|
|
82 |
|
|
83 |
|
|
84 |
/* complete */
|
|
85 |
|
31765
|
86 |
def complete(line: CharSequence): Option[(String, List[String])] =
|
31763
|
87 |
{
|
34141
|
88 |
abbrevs_lex.parse(abbrevs_lex.keyword, new Library.Reverse(line)) match {
|
|
89 |
case abbrevs_lex.Success(rev_a, _) =>
|
31765
|
90 |
val (word, c) = abbrevs_map(rev_a)
|
34093
|
91 |
if (word == c) None
|
|
92 |
else Some(word, List(c))
|
31765
|
93 |
case _ =>
|
|
94 |
Completion.Parse.read(line) match {
|
|
95 |
case Some(word) =>
|
34093
|
96 |
words_lex.completions(word).map(words_map(_)).filter(_ != word) match {
|
31765
|
97 |
case Nil => None
|
34141
|
98 |
case cs => Some(word, cs.sort(_ < _))
|
31765
|
99 |
}
|
|
100 |
case None => None
|
|
101 |
}
|
|
102 |
}
|
31763
|
103 |
}
|
|
104 |
}
|