Package lupos.autocomplete.misc

Examples of lupos.autocomplete.misc.Item

67
68
69
70
71
72
73
74
75
76
    while ((token = p.getNextToken(content)) != null) {
      final String[] splittedTokenLine = token.toString().split(" ");
      if ((splittedTokenLine[2].equals("QUALIFIEDURI") || splittedTokenLine[2]
          .equals("VARIABLE") || splittedTokenLine[2].equals("PREFIXLABEL")|| splittedTokenLine[2].equals("URI"))
          && !(tokensList.contains(splittedTokenLine[9]))) {
        tokensList.add(new Item(splittedTokenLine[9], true));
      }
    }
    return tokensList;
  }
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
    final int indexBeforeCurrentWord = textDocument.substring(0, cursorPosition - currentWord.length()).length();
    final List<Item> tokensList = this.tokensToList(this.readerLocal, this.parserLocal, indexBeforeCurrentWord);

    for (int i = 0; i < tokensList.size(); i++) {
      final Item tl_element_i = tokensList.get(i);
      /*
       * Falls currenWord leer ist bzw aus einem Leerzeichen besteht
       * werden alle Elemente von tokensList hinzugefuegt
       */
      if (currentWord.equals("") || currentWord.equals(" ")) {
        returnList.add(tl_element_i);
        /*
         * die Laenge von currentWord muss <= aller Laengen der Elemente
         * von tokensList sein
         */
      } else if ((cwLength) <= tl_element_i.getValue().length()) {
        /*
         * Vergleicht i-tes Element von tokensList mit currentWord, auch
         * komplett gross bzw klein geschrieben
         */
        if (currentWord.substring(0, cwLength).equals(
            tl_element_i.getValue().substring(0, cwLength))) {
          returnList.add(tl_element_i);
        }
      }
    }
    for (int i = 0; i < this.reservedWords.size(); i++) {
      final Item rw_element_i = new Item(this.reservedWords.get(i).toString(), false);
      /*
       * Falls currenWord leer ist bzw aus einem Leerzeichen besteht
       * werden alle reservedWords hinzugefuegt
       */
      if (currentWord.equals("") || currentWord.equals(" ")) {
        returnList.add(rw_element_i);
        /*
         * die Laenge von currentWord muss <= aller Laengen der
         * reservedWords sein
         */
      } else if ((cwLength) <= rw_element_i.getValue().length()) {
        /*
         * Vergleicht i-tes reservedWord mit currentWord, auch komplett
         * gross bzw klein geschrieben
         */
        if (currentWord.substring(0, cwLength).equalsIgnoreCase(
            rw_element_i.getValue().substring(0, cwLength))) {
          returnList.add(rw_element_i);
        }
      }
    }

View Full Code Here
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
            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
272
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
            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 (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
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
            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
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
  public List<Item> findExistingElements(final String hashmapKey,
      final String hashmapValue, final int indexBeforeCurrentWord,
      final LuposDocumentReader r, final ILuposParser p) {
    final ArrayList<Item> arrayList = new ArrayList<Item>();
    if (hashmapKey.equals("<ANON>") || hashmapKey.equals("<NIL>")) {
      arrayList.add(new Item(hashmapValue, true));
      return arrayList;
    }
    String description;
    if (hashmapKey.equals("<IRI_REF>")) {
      description = "URI";
    } else if (hashmapKey.equals("<PNAME_LN>")) {
      description = "QUALIFIEDURI";
    } else if (hashmapKey.startsWith("<STRING_LITERAL")) {
      description = "LITERAL";
    } else if (hashmapKey.equals("<BLANKNODELABEL>")) {
      description = "BLANKNODE";
    } else if (hashmapKey.equals("<VAR>")) {
      description = "VARIABLE";
    } else if (hashmapKey.equals("<INTEGER>")) {
      description = "INTEGER";
    } else if (hashmapKey.equals("<DECIMAL>")
        || hashmapKey.equals("<DOUBLE>")) {
      description = "DECIMAL";
    } else {
      description = null;
    }
    if (description != null) {
      final String content = r.getText().substring(0,
          indexBeforeCurrentWord);
      p.setReaderTokenFriendly(r, 0, content.length());
      ILuposToken token;
      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));

        }
      }

    }
View Full Code Here
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
                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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
  public List<Item> findExistingElements(final String hashmapKey,
      final String hashmapValue, final int indexBeforeCurrentWord,
      final LuposDocumentReader r, final ILuposParser p) {
    final ArrayList<Item> arrayList = new ArrayList<Item>();
    if (hashmapKey.equals("<ANON>") || hashmapKey.equals("<NIL>")) {
      arrayList.add(new Item(hashmapValue, true));
      return arrayList;
    }
    String description;
    if (hashmapKey.equals("<IRI_REF>")) {
      description = "URI";
    } else if (hashmapKey.equals("<PNAME_LN>")) {
      description = "QUALIFIEDURI";
    } else if (hashmapKey.startsWith("<STRING_LITERAL")) {
      description = "LITERAL";
    } else if (hashmapKey.equals("<BLANKNODELABEL>")) {
      description = "BLANKNODE";
    } else if (hashmapKey.equals("<VAR>")) {
      description = "VARIABLE";
    } else if (hashmapKey.equals("<INTEGER>")) {
      description = "INTEGER";
    } else if (hashmapKey.equals("<DECIMAL>")
        || hashmapKey.equals("<DOUBLE>")) {
      description = "DECIMAL";
    } else {
      description = null;
    }
    if (description != null) {
      final String content = r.getText().substring(0,
          indexBeforeCurrentWord);
      p.setReaderTokenFriendly(r, 0, content.length());
      ILuposToken token;
      String[] splittedToken;
      String tokenElement;
      int pos;
      while ((token = p.getNextToken(content)) != null) {
        splittedToken = token.toString().split(" ");
        if (!splittedToken[2].equals("ERROR")) {
          if (!splittedToken[9].startsWith("\"")) {
            tokenElement = splittedToken[9].toLowerCase();
          } else {
            pos = token.toString().indexOf("\"");
            tokenElement = token
                .toString()
                .substring(pos,
                    token.toString().length())
                .toLowerCase();
          }
          if (splittedToken[2].equals(description)
              && !(arrayList.contains(tokenElement))) {
            arrayList.add(new Item(tokenElement, true));
          }
        }

      }
View Full Code Here
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
            possibilitiesList.addAll(this.findExistingElements(
                hashmapKey, testWord, indexBeforeCurrentWord,
                this.readerLocal, this.parserLocal));
          //ansonsten nur testWord
          } else {
            possibilitiesList.add(new Item(testWord, caseSensitiv));
          }
        } else if (testException.substring(0, 2).equals("PE")) {
          if (hashmapKey != null) {
            possibilitiesList.addAll(this.findExistingElements(
                hashmapKey, testWord, indexBeforeCurrentWord,
                this.readerLocal, this.parserLocal));

          } 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));
              possibilitiesList.remove(currentWord);

            } else {
              possibilitiesList.add(new Item(testWord,
                  caseSensitiv));
            }
          }
        }
      }
View Full Code Here
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
            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));
              possibilitiesList.remove(currentWord);

            } else {
              possibilitiesList.add(new Item(testWord,
                  caseSensitiv));
            }
          }
        }
      }
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.