Package lupos.autocomplete.misc

Examples of lupos.autocomplete.misc.Item

160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
            possibilitiesList.addAll(this.findExistingElements(
                hashmapKey, testWord, indexBeforeCurrentWord,
                this.readerLocal, this.parserLocal));
          //ansonsten nur testWord
          } else {
            possibilitiesList.add(new Item(testWord, caseSensitiv));
          }
        //TestException = PE
        } else if (testException.substring(0, 2).equals("PE")) {
          if (this.parseErrorWordPE(testException).equals("<EOF>")) {
            //Analog
            if (hashmapKey != null) {
              possibilitiesList.addAll(this.findExistingElements(
                  hashmapKey, testWord,
                  indexBeforeCurrentWord, this.readerLocal,
                  this.parserLocal));

            } else {
              possibilitiesList.add(new Item(testWord,
                  caseSensitiv));
            }
          }
        }
View Full Code Here
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
            possibilitiesList.addAll(this.findExistingElements(
                hashmapKey, testWord, indexBeforeCurrentWord,
                this.readerLocal, this.parserLocal));
          //ansonsten nur testWord
          } else {
            possibilitiesList.add(new Item(testWord, caseSensitiv));
          }
        //TestException = PE
        } else if (testException.substring(0, 2).equals("PE")) {
          mainError = this.parseErrorWordPE(exception);
          subError = this.parseErrorWordPE(testException);
          if (mainError.equals(subError) || subError.equals("<EOF>")) {
            //Analog
            if (hashmapKey != null) {
              possibilitiesList.addAll(this.findExistingElements(
                  hashmapKey, testWord,
                  indexBeforeCurrentWord, this.readerLocal,
                  this.parserLocal));

            } else {
              possibilitiesList.add(new Item(testWord,
                  caseSensitiv));
            }
          }
        }
      }
View Full Code Here
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
            possibilitiesList.addAll(this.findExistingElements(
                hashmapKey, testWord, indexBeforeCurrentWord,
                this.readerLocal, this.parserLocal));
          //ansonsten nur testWord
          } else {
            possibilitiesList.add(new Item(testWord, caseSensitiv));
          }
        //TestException = PE
        } else if (testException.substring(0, 2).equals("PE")) {
          mainError = this.parseErrorWordLE(exception);
          subError = this.parseErrorWordPE(testException);
          if (mainError.equals(subError) || subError.equals("<EOF>")) {
            //Analog
            if (hashmapKey != null) {
              possibilitiesList.addAll(this.findExistingElements(
                  hashmapKey, testWord,
                  indexBeforeCurrentWord, this.readerLocal,
                  this.parserLocal));

            } else {
              possibilitiesList.add(new Item(testWord,
                  caseSensitiv));
            }
          }
        }
      }
View Full Code Here
451
452
453
454
455
456
457
458
459
460
461
      String[] splittedToken;
      while ((token = p.getNextToken(content)) != null) {
        splittedToken = token.toString().split(" ");
        if (splittedToken[2].equals(description)
            && !(arrayList.contains(splittedToken[9]))) {
          arrayList.add(new Item(splittedToken[9], true));
        }
      }
    }
    return arrayList;
  }
View Full Code Here
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
    final String currentWord = this.getCurrentWord(textDocument, cursorPosition);
    final int cwLength = currentWord.length();
    final List<Item> returnList = new ArrayList<Item>();

    ArrayList<Item> possibilitiesList = null;
    Item element_i;
    //prueft das aktuelle Dokument bis zur (Text)cursorPosition auf Fehler
    final String exception = this.handleException(textDocument.substring(0, cursorPosition));

    if (exception.substring(0,2).equals("PE")) {
      possibilitiesList = this.testforTokensPE(exception, textDocument, this.getTokenMap(),cursorPosition);
    }else if (exception.substring(0,2).equals("LE")) {
      possibilitiesList = this.testForTokensLE(exception, textDocument, this.getTokenMap(), cursorPosition);
    }  else {
      possibilitiesList = this.testforTokensNE(textDocument, this.getTokenMap(), cursorPosition);
    }
    if (possibilitiesList!=null) {
      //hier werden unpassende Vorschlaege aussortiert
      for (int i = 0; i < possibilitiesList.size(); i++) {
        element_i = possibilitiesList.get(i);
        if (currentWord.equals("")||currentWord.equals(" ")) {
          returnList.add(element_i);
        } else if (cwLength <= element_i.getValue().length()) {

          if (element_i.getCaseSensitiv()) {
            if (currentWord.substring(0, cwLength).equals(
                element_i.getValue().substring(0, cwLength))) {
              returnList.add(element_i);
            }
            //Wenn nicht case Sensitiv equalsIgnoreCase-Methode statt equals
          } else {
            if (currentWord.substring(0, cwLength).equalsIgnoreCase(
                element_i.getValue().substring(0, cwLength))) {
              returnList.add(element_i);

          }
          }
        }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
78
79
        cursorPosition - currentWord.length()).length();
    //tokens des Dokuments bis zum aktuellen Wort werden in hashmap gespeichert
    final HashMap<Item, Integer> hashmap = this.tokensToMap(this.readerLocal, this.parserLocal,
        indexBeforeCurrentWord);

    Item rw_element_i;
    //restliche reservedWords werden ergaenzt
    for (int i = 0; i < this.reservedWords.size(); i++) {
      rw_element_i = new Item(this.reservedWords.get(i).toString(), false);
      if (!hashmap.containsKey(rw_element_i)) {
        hashmap.put(rw_element_i, 0);
      }
    }
    final List<Entry<Item, Integer>> list = new ArrayList<Entry<Item, Integer>>(
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
          || splittedTokenLine[2].equals("PREFIXLABEL")
          || splittedTokenLine[2].equals("URI")
          || splittedTokenLine[2].equals("RESERVEDWORD"))) {

        final String tokenString = splittedTokenLine[9];
        Item item_i;
        if (semanticWebType.equals("RESERVEDWORD")) {
          item_i = new Item(tokenString, false);
        } else {
          item_i = new Item(tokenString, true);
        }

        if (!(hashmap.containsKey(item_i))) {
          hashmap.put(item_i, 1);
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
      /*
       * Falls currenWord leer ist bzw aus einem Leerzeichen besteht
       * werden alle reservedWords hinzugefuegt
       */
      if (currentWord.equals("") || currentWord.equals(" ")) {
        returnList.add(new Item(rw_element_i, false));
        // System.out.println(rw_element_i);

        /*
         * die Laenge von currentWord muss <= aller Laengen der
         * reservedWords sein
         */
      } else if ((cwLength) <= rw_element_i.length()) {

        /*
         * Vergleicht i-tes reservedWord mit currentWord, auch komplett
         * gross bzw klein geschrieben
         */
        if (currentWord.substring(0, cwLength).equalsIgnoreCase(
            rw_element_i.substring(0, cwLength))) {
          returnList.add(new Item(rw_element_i, false));
        }
      }
    }
    return this.generateWeight(returnList);
  }
View Full Code Here
TOP

Related Classes of lupos.autocomplete.misc.Item

  • lupos.autocomplete.strategies.aos.AlphabeticOrderStrategy
  • lupos.autocomplete.strategies.diao.DocumentInputAndAlphabeticOrderStrategy
  • lupos.autocomplete.strategies.diof.DocumentInputAndOrderByFrequencyStrategy
  • lupos.autocomplete.strategies.ps.ParserIdentificationStrategy
  • lupos.autocomplete.strategies.ps.ParserIdentificationStrategyRDF
  • lupos.autocomplete.strategies.ps.ParserIdentificationStrategyRIF
  • lupos.autocomplete.strategies.ps.ParserIdentificationStrategySPARQL
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.