/lucene-3.6.0/solr/core/src/java/org/apache/solr/search/ |
H A D | SortSpec.java | 30 int num; field in class:SortSpec 33 public SortSpec(Sort sort, int num) { argument 34 this(sort,0,num); 37 public SortSpec(Sort sort, int offset, int num) { argument 40 this.num=num; 76 public int getCount() { return num; } 80 return "start="+offset+ "&rows="+num + (sort==null ? "" : "&sort="+sort);
|
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/util/ |
H A D | TestBitUtil.java | 47 long num = 100000; 48 assertEquals( 5, BitUtil.ntz(num) ); 49 assertEquals( 5, BitUtil.ntz2(num) ); 50 assertEquals( 5, BitUtil.ntz3(num) ); 52 num = 10; 53 assertEquals( 1, BitUtil.ntz(num) ); 54 assertEquals( 1, BitUtil.ntz2(num) ); 55 assertEquals( 1, BitUtil.ntz3(num) ); 58 num = 1L << i; 59 assertEquals( i, BitUtil.ntz(num) ); [all...] |
H A D | TestRecyclingByteBlockAllocator.java | 54 int num = atLeast(97); 55 for (int i = 0; i < num; i++) { 77 int num = 1 + random.nextInt(39); 78 for (int j = 0; j < num; j++) { 114 int num = 1 + random.nextInt(39); 115 for (int j = 0; j < num; j++) {
|
H A D | TestArrayUtil.java | 52 int num = atLeast(10000); 53 for (int iter = 0; iter < num; iter++) { 116 int num = atLeast(50); 117 for (int i = 0; i < num; i++) { 145 int num = atLeast(50); 146 for (int i = 0; i < num; i++) { 155 int num = atLeast(50); 156 for (int i = 0; i < num; i++) {
|
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/util/ |
H A D | TestBitUtil.java | 47 long num = 100000; 48 assertEquals( 5, BitUtil.ntz(num) ); 49 assertEquals( 5, BitUtil.ntz2(num) ); 50 assertEquals( 5, BitUtil.ntz3(num) ); 52 num = 10; 53 assertEquals( 1, BitUtil.ntz(num) ); 54 assertEquals( 1, BitUtil.ntz2(num) ); 55 assertEquals( 1, BitUtil.ntz3(num) ); 58 num = 1L << i; 59 assertEquals( i, BitUtil.ntz(num) ); [all...] |
H A D | TestRecyclingByteBlockAllocator.java | 54 int num = atLeast(97); 55 for (int i = 0; i < num; i++) { 77 int num = 1 + random.nextInt(39); 78 for (int j = 0; j < num; j++) { 114 int num = 1 + random.nextInt(39); 115 for (int j = 0; j < num; j++) {
|
H A D | TestArrayUtil.java | 52 int num = atLeast(10000); 53 for (int iter = 0; iter < num; iter++) { 116 int num = atLeast(50); 117 for (int i = 0; i < num; i++) { 145 int num = atLeast(50); 146 for (int i = 0; i < num; i++) { 155 int num = atLeast(50); 156 for (int i = 0; i < num; i++) {
|
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/taxonomy/directory/ |
H A D | ParentArray.java | 75 int num = indexReader.maxDoc(); 77 prefetchParentOrdinal = new int[num]; 85 if (num>0) { 91 if (first==num) { 95 int[] newarray = new int[num]; 105 if (!positions.skipTo(first) && first < num) { 108 for (int i=first; i<num; i++) { 124 if ( i+1 < num ) {
|
/lucene-3.6.0/solr/scripts/ |
H A D | backupcleaner | 25 unset days num data_dir user verbose debug 34 usage: $prog -D <days> | -N <num> [-d dir] [-u username] [-v] [-V] 36 -N <num> keep the most recent <num> number of backups and 52 num="$OPTARG" 74 if [[ -z ${days} && -z ${num} ]] 113 elif [[ -n ${num} ]] 115 logMessage cleaning up all backups except for the most recent ${num} ones 121 startpos=`expr $num + 1` 122 if [[ $count -gt $num ]] [all...] |
H A D | snapcleaner | 25 unset days num data_dir user verbose debug 34 usage: $prog -D <days> | -N <num> [-d dir] [-u username] [-v] [-V] 36 -N <num> keep the most recent <num> number of snapshots and 52 num="$OPTARG" 74 if [[ -z ${days} && -z ${num} ]] 125 elif [[ -n ${num} ]] 127 logMessage cleaning up all snapshots except for the most recent ${num} ones 133 startpos=`expr $num + 1` 134 if [[ $count -gt $num ]] [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
H A D | RecyclingByteBlockAllocator.java | 139 * @param num 143 public synchronized int freeBlocks(int num) { argument 144 assert num >= 0; 147 if (num > freeBlocks) { 151 stop = freeBlocks - num; 152 count = num;
|
/lucene-3.6.0/lucene/contrib/spellchecker/src/java/org/apache/lucene/search/suggest/fst/ |
H A D | FSTCompletion.java | 198 * @param num 203 public List<Completion> lookup(CharSequence key, int num) { argument 216 return lookupSortedAlphabetically(keyUtf8, num); 218 return lookupSortedByWeight(keyUtf8, num, false); 231 private List<Completion> lookupSortedAlphabetically(BytesRef key, int num) argument 233 // Greedily get num results from each weight branch. 234 List<Completion> res = lookupSortedByWeight(key, num, true); 238 if (res.size() > num) { 239 res = res.subList(0, num); 249 * <code>num</cod 253 lookupSortedByWeight(BytesRef key, int num, boolean collectAll) argument 352 collect(List<Completion> res, int num, int bucket, BytesRef output, Arc<Object> arc) argument [all...] |
H A D | FSTLookup.java | 276 * @param num At most this number of suggestions will be returned. 281 public List<LookupResult> lookup(CharSequence key, boolean onlyMorePopular, int num) { argument 292 return lookupSortedAlphabetically(key, num); 294 return lookupSortedByWeight(key, num, false); 306 private List<LookupResult> lookupSortedAlphabetically(CharSequence key, int num) throws IOException { argument 307 // Greedily get num results from each weight branch. 308 List<LookupResult> res = lookupSortedByWeight(key, num, true); 317 if (res.size() > num) { 318 res = res.subList(0, num); 326 * @param collectAll If <code>true</code>, the routine terminates immediately when <code>num</cod 330 lookupSortedByWeight(CharSequence key, int num, boolean collectAll) argument 422 collect(List<LookupResult> res, int num, long weight, StringBuilder output, Arc<Object> arc) argument [all...] |
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/search/params/ |
H A D | ScoreFacetRequest.java | 36 public ScoreFacetRequest(CategoryPath path, int num) { argument 37 super(path, num);
|
H A D | CountFacetRequest.java | 40 * @param num number of child categories for which count info is requeted. 45 public CountFacetRequest(CategoryPath path, int num) { argument 46 super(path, num);
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/document/ |
H A D | NumberTools.java | 93 String num = Long.toString(l, RADIX); 95 int padLen = STR_SIZE - num.length() - buf.length(); 99 buf.append(num);
|
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/analysis/ |
H A D | TestCharTokenizers.java | 44 int num = 1024 + random.nextInt(1024); 45 num *= RANDOM_MULTIPLIER; 46 for (int i = 1; i < num; i++) { 247 int num = 10000 * RANDOM_MULTIPLIER; 248 for (int i = 0; i < num; i++) { 264 checkRandomData(random, analyzer, num); 285 int num = 10000 * RANDOM_MULTIPLIER; 286 for (int i = 0; i < num; i++) { 302 checkRandomData(random, analyzer, num);
|
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/ |
H A D | TestMultiValuedNumericRangeQuery.java | 49 int num = atLeast(500); 50 for (int l = 0; l < num; l++) { 63 num = atLeast(50); 64 for (int i = 0; i < num; i++) {
|
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/ |
H A D | TestMultiValuedNumericRangeQuery.java | 49 int num = atLeast(500); 50 for (int l = 0; l < num; l++) { 63 num = atLeast(50); 64 for (int i = 0; i < num; i++) {
|
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/search/params/association/ |
H A D | AssociationFloatSumFacetRequest.java | 43 public AssociationFloatSumFacetRequest(CategoryPath path, int num) { argument 44 super(path, num);
|
H A D | AssociationIntSumFacetRequest.java | 43 public AssociationIntSumFacetRequest(CategoryPath path, int num) { argument 44 super(path, num);
|
/lucene-3.6.0/solr/core/src/test/org/apache/solr/search/ |
H A D | TestFoldingMultitermQuery.java | 42 String num = Integer.toString(i); 44 assertU(adoc("id", num, 45 "int_f", num, 46 "float_f", num, 47 "long_f", num, 48 "double_f", num, 49 "byte_f", num, 50 "short_f", num,
|
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/index/ |
H A D | TestRollingUpdates.java | 110 final int num; field in class:TestRollingUpdates.IndexingThread 112 public IndexingThread(LineFileDocs docs, IndexWriter writer, int num) { argument 116 this.num = num; 122 for (int i = 0; i < num; i++) {
|
H A D | TestTermdocPerf.java | 40 private int num; field in class:RepeatingTokenStream 55 num--; 56 if (num >= 0) { 68 num = random.nextInt(maxTF) + 1; 70 num = 0;
|
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/index/ |
H A D | TestRollingUpdates.java | 110 final int num; field in class:TestRollingUpdates.IndexingThread 112 public IndexingThread(LineFileDocs docs, IndexWriter writer, int num) { argument 116 this.num = num; 122 for (int i = 0; i < num; i++) {
|