Package org.apache.lucene.search.suggest.fst

Examples of org.apache.lucene.search.suggest.fst.FSTLookup$Entry

45
46
47
48
49
50
51
52
  private FSTLookup lookup;

  public void setUp() throws Exception {
    super.setUp();

    lookup = new FSTLookup();
    lookup.build(new TermFreqArrayIterator(evalKeys()));
  }
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
        "four/0",
        "fourblah/1",
        "fourteen/1",
        "fourier/0");

    lookup = new FSTLookup(10, false);
    lookup.build(new TermFreqArrayIterator(evalKeys()));
   
    // 'one' is not promoted after collecting two higher ranking results.
    assertMatchEquals(lookup.lookup("one", true, 2), 
        "oneness/1",
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
  }

  public void testMultilingualInput() throws Exception {
    List<TermFreq> input = LookupBenchmarkTest.readTop50KWiki();

    lookup = new FSTLookup();
    lookup.build(new TermFreqArrayIterator(input));

    for (TermFreq tf : input) {
      assertTrue("Not found: " + tf.term, lookup.get(_TestUtil.bytesToCharSequence(tf.term, random)) != null);
      assertEquals(tf.term.utf8ToString(), lookup.lookup(_TestUtil.bytesToCharSequence(tf.term, random), true, 1).get(0).key.toString());
View Full Code Here
149
150
151
152
153
154
155
156
157
158
      assertEquals(tf.term.utf8ToString(), lookup.lookup(_TestUtil.bytesToCharSequence(tf.term, random), true, 1).get(0).key.toString());
    }
  }

  public void testEmptyInput() throws Exception {
    lookup = new FSTLookup();
    lookup.build(new TermFreqArrayIterator(new TermFreq[0]));
   
    assertMatchEquals(lookup.lookup("", true, 10));
  }
View Full Code Here
161
162
163
164
165
166
167
168
169
170
171
    List<TermFreq> freqs = new ArrayList<TermFreq>();
    Random rnd = random;
    for (int i = 0; i < 5000; i++) {
      freqs.add(new TermFreq("" + rnd.nextLong(), rnd.nextInt(100)));
    }
    lookup = new FSTLookup();
    lookup.build(new TermFreqArrayIterator(freqs.toArray(new TermFreq[freqs.size()])));

    for (TermFreq tf : freqs) {
      final CharSequence term = _TestUtil.bytesToCharSequence(tf.term, random);
      for (int i = 1; i < term.length(); i++) {
View Full Code Here
42
43
44
45
46
47
48
49
  private FSTLookup lookup;

  public void setUp() throws Exception {
    super.setUp();

    lookup = new FSTLookup();
    lookup.build(new TermFreqArrayIterator(evalKeys()));
  }
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
        "four/0.0",
        "fourblah/1.0",
        "fourteen/1.0",
        "fourier/0.0");

    lookup = new FSTLookup(10, false);
    lookup.build(new TermFreqArrayIterator(evalKeys()));
   
    // 'one' is not promoted after collecting two higher ranking results.
    assertMatchEquals(lookup.lookup("one", true, 2), 
        "oneness/1.0",
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
  }

  public void testMultilingualInput() throws Exception {
    List<TermFreq> input = LookupBenchmarkTest.readTop50KWiki();

    lookup = new FSTLookup();
    lookup.build(new TermFreqArrayIterator(input));

    for (TermFreq tf : input) {
      assertTrue("Not found: " + tf.term, lookup.get(tf.term) != null);
      assertEquals(tf.term, lookup.lookup(tf.term, true, 1).get(0).key);
View Full Code Here
146
147
148
149
150
151
152
153
154
155
      assertEquals(tf.term, lookup.lookup(tf.term, true, 1).get(0).key);
    }
  }

  public void testEmptyInput() throws Exception {
    lookup = new FSTLookup();
    lookup.build(new TermFreqArrayIterator(new TermFreq[0]));
   
    assertMatchEquals(lookup.lookup("", true, 10));
  }
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
    List<TermFreq> freqs = new ArrayList<TermFreq>();
    Random rnd = random;
    for (int i = 0; i < 5000; i++) {
      freqs.add(new TermFreq("" + rnd.nextLong(), rnd.nextInt(100)));
    }
    lookup = new FSTLookup();
    lookup.build(new TermFreqArrayIterator(freqs.toArray(new TermFreq[freqs.size()])));

    for (TermFreq tf : freqs) {
      final String term = tf.term;
      for (int i = 1; i < term.length(); i++) {
View Full Code Here
TOP

Related Classes of org.apache.lucene.search.suggest.fst.FSTLookup$Entry

  • ca.uhn.fhir.model.dstu.composite.CodeableConceptDt
  • ca.uhn.fhir.model.dstu.composite.ResourceReferenceDt
  • ca.uhn.fhir.model.primitive.BooleanDt
  • ca.uhn.fhir.model.primitive.DateTimeDt
  • com.fasterxml.jackson.core.JsonLocation
  • com.google.gwt.event.dom.client.ClickHandler
  • com.sun.tools.javac.file.RelativePath.RelativeDirectory
  • com.sun.tools.javac.file.RelativePath.RelativeFile
  • com.tll.client.ui.P
  • com.tll.client.ui.SimpleHyperLink
    • 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.