Searched defs:entries (Results 1 - 6 of 6) sorted by relevance
/lucene-3.6.0/lucene/contrib/spellchecker/src/java/org/apache/lucene/search/suggest/ |
H A D | BufferingTermFreqIteratorWrapper.java | 32 protected BytesRefList entries = new BytesRefList(); field in class:BufferingTermFreqIteratorWrapper 42 entries.append(spare); 57 if (++curPos < entries.size()) { 58 entries.get(spare, curPos);
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/index/ |
H A D | CompoundFileWriter.java | 36 * fileCount entries with the following structure:</li> 42 * fileCount entries with the raw data of the corresponding file</li> 46 * file. The {directory} that follows has that many entries. Each directory entry 82 private LinkedList<FileEntry> entries; field in class:CompoundFileWriter 103 entries = new LinkedList<FileEntry>(); 148 entries.add(entry); 161 if (entries.isEmpty()) 162 throw new IllegalStateException("No entries to merge have been defined"); 174 // Write the number of entries 175 os.writeVInt(entries [all...] |
H A D | CompoundFileReader.java | 50 private HashMap<String,FileEntry> entries = new HashMap<String,FileEntry>(); field in class:CompoundFileReader 105 entries.put(id, entry); 138 entries.clear(); 155 FileEntry entry = entries.get(id); 157 throw new FileNotFoundException("No sub-file with id " + id + " found (fileName=" + fileName + " files: " + entries.keySet() + ")"); 166 String[] res = entries.keySet().toArray(new String[entries.size()]); 178 return entries.containsKey(IndexFileNames.stripSegmentName(name)); 213 FileEntry e = entries.get(IndexFileNames.stripSegmentName(name));
|
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/taxonomy/writercache/cl2o/ |
H A D | CollisionMap.java | 55 private Entry[] entries; field in class:CollisionMap 70 this.entries = new Entry[this.capacity]; 85 Entry[] src = this.entries; 103 this.entries = newEntries; 109 Entry e = this.entries[bucketIndex]; 123 Entry e = this.entries[bucketIndex]; 137 for (Entry e = this.entries[bucketIndex]; e != null; e = e.next) { 157 for (Entry e = this.entries[bucketIndex]; e != null; e = e.next) { 186 Entry e = this.entries[bucketIndex]; 187 this.entries[bucketInde 228 EntryIterator(Entry[] entries, int size) argument [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
H A D | FieldCacheSanityChecker.java | 31 * Provides methods for sanity checking that entries in the FieldCache 122 // It's OK to have dup entries, where one is eg 230 // we have cache entries for the kid 251 // now the entries for the descendants 329 private final CacheEntry[] entries; field in class:FieldCacheSanityChecker.Insanity 330 public Insanity(InsanityType type, String msg, CacheEntry... entries) { argument 335 if (null == entries || 0 == entries.length) { 341 this.entries = entries; [all...] |
/lucene-3.6.0/lucene/contrib/spellchecker/src/java/org/apache/lucene/search/suggest/fst/ |
H A D | FSTLookup.java | 176 List<Entry> entries = new ArrayList<Entry>(); 183 entries.add(new Entry(termChars, tfit.weight())); 193 if (entries.size() > 0) { 194 redistributeWeightsProportionalMinMax(entries, buckets); 195 encodeWeightPrefix(entries); 200 this.automaton = buildAutomaton(entries); 448 * Builds the final automaton from a list of entries. 450 private FST<Object> buildAutomaton(List<Entry> entries) throws IOException { argument 451 if (entries.size() == 0) 470 Collections.sort(entries, com 508 encodeWeightPrefix(List<Entry> entries) argument 523 redistributeWeightsProportionalMinMax(List<Entry> entries, int buckets) argument [all...] |
Completed in 11 milliseconds