simplified Symbol based on lazy Symbol.Interpretation -- reduced odd "functorial style";
tuned implicit build/init messages;
1 /* Title: Pure/Thy/completion.scala
4 Completion of symbols and keywords.
9 import scala.util.matching.Regex
10 import scala.util.parsing.combinator.RegexParsers
13 private object Completion
15 /** word completion **/
17 val word_regex = "[a-zA-Z0-9_']+".r
18 def is_word(s: CharSequence): Boolean = word_regex.pattern.matcher(s).matches
20 object Parse extends RegexParsers
22 override val whiteSpace = "".r
24 def reverse_symbol: Parser[String] = """>[A-Za-z0-9_']+\^?<\\""".r
25 def reverse_symb: Parser[String] = """[A-Za-z0-9_']{2,}\^?<\\""".r
26 def word: Parser[String] = "[a-zA-Z0-9_']{2,}".r
28 def read(in: CharSequence): Option[String] =
30 val reverse_in = new Library.Reverse(in)
31 parse((reverse_symbol | reverse_symb | word) ^^ (_.reverse), reverse_in) match {
32 case Success(result, _) => Some(result)
43 protected val words_lex = Scan.Lexicon()
44 protected val words_map = Map[String, String]()
46 protected val abbrevs_lex = Scan.Lexicon()
47 protected val abbrevs_map = Map[String, (String, String)]()
52 def + (keyword: String, replace: String): Completion =
56 override val words_lex = old.words_lex + keyword
57 override val words_map = old.words_map + (keyword -> replace)
58 override val abbrevs_lex = old.abbrevs_lex
59 override val abbrevs_map = old.abbrevs_map
63 def + (keyword: String): Completion = this + (keyword, keyword)
65 def add_symbols: Completion =
68 (for ((x, _) <- Symbol.names) yield (x, x)).toList :::
69 (for ((x, y) <- Symbol.names) yield (y, x)).toList :::
70 (for ((x, y) <- Symbol.abbrevs if Completion.is_word(y)) yield (y, x)).toList
73 (for ((x, y) <- Symbol.abbrevs if !Completion.is_word(y))
74 yield (y.reverse.toString, (y, x))).toList
78 override val words_lex = old.words_lex ++ words.map(_._1)
79 override val words_map = old.words_map ++ words
80 override val abbrevs_lex = old.abbrevs_lex ++ abbrs.map(_._1)
81 override val abbrevs_map = old.abbrevs_map ++ abbrs
88 def complete(line: CharSequence): Option[(String, List[String])] =
90 abbrevs_lex.parse(abbrevs_lex.keyword, new Library.Reverse(line)) match {
91 case abbrevs_lex.Success(reverse_a, _) =>
92 val (word, c) = abbrevs_map(reverse_a)
95 Completion.Parse.read(line) match {
97 words_lex.completions(word).map(words_map(_)) match {
99 case cs => Some(word, cs.sortWith(_ < _))