/lucene-3.6.0/lucene/contrib/spellchecker/src/java/org/apache/lucene/search/spell/ |
H A D | SuggestWordFrequencyComparator.java | 23 * Frequency first, then score. Must have 28 public int compare(SuggestWord first, SuggestWord second) { argument 29 // first criteria: the frequency 30 if (first.freq > second.freq) { 33 if (first.freq < second.freq) { 37 // second criteria (if first criteria is equal): the score 38 if (first.score > second.score) { 41 if (first.score < second.score) { 45 return second.string.compareTo(first.string);
|
H A D | SuggestWordScoreComparator.java | 23 * Score first, then frequency 27 public int compare(SuggestWord first, SuggestWord second) { argument 28 // first criteria: the distance 29 if (first.score > second.score) { 32 if (first.score < second.score) { 36 // second criteria (if first criteria is equal): the popularity 37 if (first.freq > second.freq) { 41 if (first.freq < second.freq) { 45 return second.string.compareTo(first.string);
|
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/util/encoding/ |
H A D | VInt8IntDecoder.java | 36 int first = in.read(); 37 if (first < 0) { 43 value |= first & 0x7F; 44 if ((first & 0x80) == 0) {
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/search/function/ |
H A D | MaxFloatFunction.java | 35 boolean first = true; 38 if (first) { 39 first = false;
|
H A D | MinFloatFunction.java | 35 boolean first = true; 38 if (first) { 39 first = false;
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/fst/ |
H A D | UpToTwoPositiveIntOutputs.java | 29 * is preserved in the TwoLongs case, ie .first is the first 44 public final long first; field in class:UpToTwoPositiveIntOutputs.TwoLongs 47 public TwoLongs(long first, long second) { argument 48 this.first = first; 50 assert first >= 0; 56 return "TwoLongs:" + first + "," + second; 63 return first == other.first 98 get(long first, long second) argument 221 merge(Object first, Object second) argument [all...] |
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/util/ |
H A D | TestRamUsageEstimatorOnWildAnimals.java | 38 ListElement first = new ListElement(); 39 ListElement last = first; 43 RamUsageEstimator.sizeOf(first); // cause SOE or pass.
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/analysis/ |
H A D | FilteringTokenFilter.java | 35 private boolean first = true; // only used when not preserving gaps field in class:FilteringTokenFilter 61 if (first) { 62 // first token having posinc=0 is illegal. 66 first = false; 79 first = true;
|
/lucene-3.6.0/solr/client/ruby/solr-ruby/lib/solr/response/ |
H A D | ping.rb | 19 @ok = REXML::XPath.first(@doc, './solr/ping') ? true : false
|
H A D | xml.rb | 29 result = REXML::XPath.first(@doc, './response/lst[@name="responseHeader"]/int[@name="status"]')
|
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/taxonomy/directory/ |
H A D | ParentArray.java | 74 int first; 88 first = 1; 90 first = prefetchParentOrdinal.length; 91 if (first==num) { 105 if (!positions.skipTo(first) && first < num) { 106 throw new CorruptIndexException("Missing parent data for category " + first); 108 for (int i=first; i<num; i++) {
|
/lucene-3.6.0/solr/solrj/src/java/org/apache/noggit/ |
H A D | TextSerializer.java | 28 boolean first = true; 30 if (first) { 31 first = false; 44 boolean first = true; 46 if (first) { 47 first = false;
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/ |
H A D | TopDocs.java | 93 // Returns true if first is < second 94 public boolean lessThan(ShardRef first, ShardRef second) { argument 95 assert first != second; 96 final float firstScore = shardHits[first.shardIndex][first.hitIndex].score; 105 if (first.shardIndex < second.shardIndex) { 107 } else if (first.shardIndex > second.shardIndex) { 112 assert first.hitIndex != second.hitIndex; 113 return first.hitIndex < second.hitIndex; 158 // Returns true if first i 160 lessThan(ShardRef first, ShardRef second) argument [all...] |
H A D | ConjunctionScorer.java | 50 // Sort the array the first time... 56 // match on first document keeps preserved): 64 // The reason is this: assume there are 5 scorers, whose first docs are 1, 66 // doNext() here advances all the first scorers to 5 (or a larger doc ID 69 // 2, 1, 5 and then doNext() will stop immediately, since the first scorer's 78 // If first-time skip distance is any predictor of 79 // scorer sparseness, then we should always try to skip first on 81 // Keep last scorer in it's last place (it will be the first 95 int first = 0; 98 while ((firstScorer = scorers[first]) [all...] |
H A D | BooleanScorer.java | 30 * 2K docs. So it scores docs 0-2K first, then docs 2K-4K, 51 * skips the first to to the last. If the first ever equals 54 * be evaluated first, then the optional terms can all skip 83 bucket.next = table.first; // push onto valid list 84 table.first = bucket; 155 Bucket first = null; // head of valid list field in class:BooleanScorer.BucketTable 245 bucketTable.first = null; 260 tmp.next = bucketTable.first; 261 bucketTable.first [all...] |
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/util/ |
H A D | Vint8.java | 33 * byte. The first encoded byte contains the highest nonzero bits from the 188 byte first = bytes[pos.pos]; 190 value |= first & 0x7F; 191 if ((first & 0x80) == 0) { 210 int first = in.read(); 211 if (first < 0) { 214 value |= first & 0x7F; 215 if ((first & 0x80) == 0) {
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/spans/ |
H A D | NearSpansUnordered.java | 43 private SpansCell first; // linked list of spans field in class:NearSpansUnordered 52 private boolean firstTime = true; // true before first next() 177 while (more && first.doc() < last.doc()) { 178 more = first.skipTo(last.doc()); // skip first upto last 208 for (SpansCell cell = first; more && cell!=null; cell=cell.next) { 245 for (SpansCell cell = first; cell != null; cell = cell.next) { 277 more = cell.next(); // move to first entry 288 first = cell; 294 last.next = first; // mov [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
H A D | SimpleStringInterner.java | 59 Entry first = this.cache[slot]; 64 for(Entry e=first; e!=null; e=e.next) { 78 this.cache[slot] = new Entry(s, h, first);
|
/lucene-3.6.0/lucene/contrib/benchmark/src/java/org/apache/lucene/benchmark/byTask/tasks/ |
H A D | RepAllTask.java | 53 boolean first = true; 60 if (!first) { 63 first = false;
|
H A D | RepSelectByPrefTask.java | 51 boolean first = true; 59 if (!first) { 62 first = false;
|
/lucene-3.6.0/solr/solrj/src/java/org/apache/solr/common/params/ |
H A D | MapSolrParams.java | 58 boolean first=true; 64 if (!first) sb.append('&'); 65 first=false;
|
H A D | MultiMapSolrParams.java | 71 boolean first=true; 78 if (!first) sb.append('&'); 79 first=false;
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/response/ |
H A D | JSONResponseWriter.java | 130 boolean first=true; 135 if (first) { 136 first=false; 199 boolean first=true; 203 if (first) { 204 first=false; 234 boolean first=true; 238 if (first) { 239 first=false; 329 boolean first [all...] |
/lucene-3.6.0/solr/core/src/java/org/apache/solr/schema/ |
H A D | FieldProperties.java | 85 boolean first=true; 87 if (!first) sb.append(','); 88 first=false;
|
/lucene-3.6.0/solr/client/ruby/solr-ruby/lib/solr/ |
H A D | field.rb | 25 name_key = (params.keys - VALID_PARAMS).first
|