/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/search/ |
H A D | ScoredDocIDs.java | 40 public int size(); method in interface:ScoredDocIDs
|
H A D | FloatArrayAllocator.java | 24 * of a certain size. These float arrays are needed temporarily during 34 // An FloatArrayAllocater deals with integer arrays of a fixed size, size. 35 private int size; field in class:FloatArrayAllocator 38 * Construct an allocator for float arrays of size <CODE>size</CODE>, 41 * Note that the pool size only restricts the number of arrays that hang 53 public FloatArrayAllocator(int size, int maxArrays) { argument 55 this.size = size; [all...] |
H A D | Heap.java | 55 public int size(); method in interface:Heap
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/index/ |
H A D | SegmentMergeQueue.java | 24 SegmentMergeQueue(int size) { argument 25 initialize(size);
|
H A D | LogDocMergePolicy.java | 22 /** This is a {@link LogMergePolicy} that measures size of a 28 /** Default minimum segment size. @see setMinMergeDocs */ 41 protected long size(SegmentInfo info) throws IOException { method in class:LogDocMergePolicy 45 /** Sets the minimum size for the lowest level segments. 46 * Any segments below this size are considered to be on 47 * the same level (even if they vary drastically in size) 58 /** Get the minimum size for a segment to remain
|
H A D | ParallelPostingsArray.java | 26 final int size; field in class:ParallelPostingsArray 31 ParallelPostingsArray(final int size) { argument 32 this.size = size; 33 textStarts = new int[size]; 34 intStarts = new int[size]; 35 byteStarts = new int[size]; 42 ParallelPostingsArray newInstance(int size) { argument 43 return new ParallelPostingsArray(size); 47 int newSize = ArrayUtil.oversize(size [all...] |
H A D | TermFreqVector.java | 36 public int size(); method in interface:TermFreqVector 61 * at the same time. Returns an array that has the same size as the number
|
H A D | LogByteSizeMergePolicy.java | 22 /** This is a {@link LogMergePolicy} that measures size of a 23 * segment as the total byte size of the segment's files. */ 26 /** Default minimum segment size. @see setMinMergeMB */ 29 /** Default maximum segment size. A segment of this size 33 /** Default maximum segment size. A segment of this size 44 protected long size(SegmentInfo info) throws IOException { method in class:LogByteSizeMergePolicy 49 * byte size of the segment's files, in MB) that may be 64 * size o [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/ |
H A D | PhraseQueue.java | 23 PhraseQueue(int size) { argument 24 initialize(size);
|
H A D | FieldDocSortedHitQueue.java | 47 * @param size The number of hits to retain. Must be greater than zero. 49 FieldDocSortedHitQueue (int size) { argument 50 initialize (size);
|
H A D | HitQueue.java | 27 * Creates a new instance with <code>size</code> elements. If 29 * with sentinel objects and set its {@link #size()} to <code>size</code>. In 30 * that case, you should not rely on {@link #size()} to get the number of 46 * // First, pop all the sentinel elements (there are pq.size() - totalHits). 47 * for (int i = pq.size() - totalHits; i > 0; i--) pq.pop(); 57 * length <code>size</code>. 59 * @param size 60 * the requested size of this queue. 65 HitQueue(int size, boolea argument [all...] |
/lucene-3.6.0/lucene/contrib/spellchecker/src/java/org/apache/lucene/search/spell/ |
H A D | NGramDistance.java | 28 * matches of n-gram sub-strings and adds a null-character prefix of size n-1 39 * Creates an N-Gram distance measure using n-grams of the specified size. 40 * @param size The size of the n-gram to be used to compute the string distance. 42 public NGramDistance(int size) { argument 43 this.n = size; 47 * Creates an N-Gram distance measure using n-grams of size 2.
|
H A D | SuggestWordQueue.java | 41 * @param size The size of the queue 43 public SuggestWordQueue (int size) { argument 44 initialize(size); 49 * Specify the size of the queue and the comparator to use for sorting. 50 * @param size The size 53 public SuggestWordQueue(int size, Comparator<SuggestWord> comparator){ argument 54 initialize(size);
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/analysis/ |
H A D | BaseCharFilter.java | 67 private int size = 0; field in class:BaseCharFilter 80 int hi = size - 1; 105 0 : diffs[size-1]; 125 } else if (size == offsets.length) { 130 assert (size == 0 || off >= offsets[size]) 131 : "Offset #" + size + "(" + off + ") is less than the last recorded offset " 132 + offsets[size] + "\n" + Arrays.toString(offsets) + "\n" + Arrays.toString(diffs); 134 if (size == 0 || off != offsets[size [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
H A D | MapBackedSet.java | 47 public int size() { method in class:MapBackedSet 48 return map.size();
|
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/store/ |
H A D | TestHugeRamFile.java | 36 protected byte[] newBuffer(int size) { argument 37 capacity += size; 40 byte buf[] = singleBuffers.get(Integer.valueOf(size)); 42 buf = new byte[size]; 43 //System.out.println("allocate: "+size); 44 singleBuffers.put(Integer.valueOf(size),buf); 48 //System.out.println("allocate: "+size); System.out.flush(); 49 return new byte[size];
|
H A D | TestNRTCachingDirectory.java | 149 /** Creates a file of the specified size with sequential data. The first 153 private void createSequenceFile(Directory dir, String name, byte start, int size) throws IOException { argument 155 for (int i=0; i < size; i++) {
|
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/store/ |
H A D | TestHugeRamFile.java | 36 protected byte[] newBuffer(int size) { argument 37 capacity += size; 40 byte buf[] = singleBuffers.get(Integer.valueOf(size)); 42 buf = new byte[size]; 43 //System.out.println("allocate: "+size); 44 singleBuffers.put(Integer.valueOf(size),buf); 48 //System.out.println("allocate: "+size); System.out.flush(); 49 return new byte[size];
|
H A D | TestNRTCachingDirectory.java | 149 /** Creates a file of the specified size with sequential data. The first 153 private void createSequenceFile(Directory dir, String name, byte start, int size) throws IOException { argument 155 for (int i=0; i < size; i++) {
|
/lucene-3.6.0/lucene/contrib/analyzers/kuromoji/src/tools/java/org/apache/lucene/analysis/ja/util/ |
H A D | TokenInfoDictionaryWriter.java | 29 public TokenInfoDictionaryWriter(int size) { argument 30 super(TokenInfoDictionary.class, size);
|
/lucene-3.6.0/lucene/contrib/benchmark/src/java/org/apache/lucene/benchmark/byTask/feeds/ |
H A D | QueryMaker.java | 31 * Create the next query, of the given size. 32 * @param size the size of the query - number of terms, etc. 33 * @exception Exception if cannot make the query, or if size>0 was specified but this feature is not supported. 35 public Query makeQuery (int size) throws Exception; argument
|
/lucene-3.6.0/lucene/contrib/benchmark/src/java/org/apache/lucene/benchmark/byTask/stats/ |
H A D | Report.java | 26 private int size; field in class:Report 30 public Report (String text, int size, int reported, int outOf) { argument 32 this.size = size; 48 return size;
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/search/ |
H A D | DocList.java | 23 * This list contains a subset of the complete list of documents actually matched: <code>size()</code> 39 public int size(); method in interface:DocList 44 * to <code>offset()</code> and <code>size()</code>). 45 * Hence it's always true that matches() >= size() 98 int size; 113 size++; 126 public int size() { 127 return size;
|
/lucene-3.6.0/lucene/contrib/grouping/src/java/org/apache/lucene/search/grouping/ |
H A D | SentinelIntSet.java | 35 * @param size The minimum number of elements this set should be able to hold without re-hashing (i.e. the slots are guaranteed not to change) 38 public SentinelIntSet(int size, int emptyVal) { argument 40 int tsize = Math.max(org.apache.lucene.util.BitUtil.nextHighestPowerOfTwo(size), 1); 42 if (size >= rehashCount) { // should be able to hold "size" w/o rehashing 60 public int size() { return count; } method in class:SentinelIntSet
|
/lucene-3.6.0/lucene/contrib/highlighter/src/java/org/apache/lucene/search/highlight/ |
H A D | SimpleFragmenter.java | 24 * {@link Fragmenter} implementation which breaks text up into same-size 39 * @param fragmentSize size in number of characters of each fragment 67 * @return size in number of characters of each fragment 74 * @param size size in characters of each fragment 76 public void setFragmentSize(int size) { argument 77 fragmentSize = size;
|