Searched defs:NUM_DOCS (Results 1 - 16 of 16) sorted by relevance

/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/
H A DTestSearchWithThreads.java34 final int NUM_DOCS = atLeast(10000); field in class:TestSearchWithThreads
50 for(int docCount=0;docCount<NUM_DOCS;docCount++) {
H A DTestFieldCache.java38 private int NUM_DOCS; field in class:TestFieldCache
44 NUM_DOCS = atLeast(1000);
53 for (int i = 0; i < NUM_DOCS; i++){
98 assertTrue("doubles Size: " + doubles.length + " is not: " + NUM_DOCS, doubles.length == NUM_DOCS);
107 assertTrue("longs Size: " + longs.length + " is not: " + NUM_DOCS, longs.length == NUM_DOCS);
116 assertTrue("bytes Size: " + bytes.length + " is not: " + NUM_DOCS, bytes.length == NUM_DOCS);
125 assertTrue("shorts Size: " + shorts.length + " is not: " + NUM_DOCS, short
[all...]
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/
H A DTestSearchWithThreads.java34 final int NUM_DOCS = atLeast(10000); field in class:TestSearchWithThreads
50 for(int docCount=0;docCount<NUM_DOCS;docCount++) {
H A DTestFieldCache.java38 private int NUM_DOCS; field in class:TestFieldCache
44 NUM_DOCS = atLeast(1000);
53 for (int i = 0; i < NUM_DOCS; i++){
98 assertTrue("doubles Size: " + doubles.length + " is not: " + NUM_DOCS, doubles.length == NUM_DOCS);
107 assertTrue("longs Size: " + longs.length + " is not: " + NUM_DOCS, longs.length == NUM_DOCS);
116 assertTrue("bytes Size: " + bytes.length + " is not: " + NUM_DOCS, bytes.length == NUM_DOCS);
125 assertTrue("shorts Size: " + shorts.length + " is not: " + NUM_DOCS, short
[all...]
/lucene-3.6.0/lucene/contrib/facet/src/test/org/apache/lucene/facet/index/
H A DFacetsPayloadProcessorProviderTest.java48 private static final int NUM_DOCS = 100; field in class:FacetsPayloadProcessorProviderTest
74 fsp.addFacetRequest(new CountFacetRequest(new CategoryPath("tag"), NUM_DOCS));
86 assertEquals(NUM_DOCS ,weight);
98 for (int i = 1; i <= NUM_DOCS; i++) {
101 for (int j = i; j <= NUM_DOCS; j++) {
102 int facetValue = asc? j: NUM_DOCS - j;
/lucene-3.6.0/lucene/contrib/misc/src/test/org/apache/lucene/index/
H A DTestFieldNormModifier.java39 public static int NUM_DOCS = 5; field in class:TestFieldNormModifier
58 for (int i = 0; i < NUM_DOCS; i++) {
121 final float[] scores = new float[NUM_DOCS];
150 for (int i = 0; i < NUM_DOCS; i++) {
187 for (int i = 0; i < NUM_DOCS; i++) {
213 final float[] scores = new float[NUM_DOCS];
241 for (int i = 0; i < NUM_DOCS; i++) {
H A DTestIndexSorter.java35 private static final int NUM_DOCS = 4; field in class:TestIndexSorter
58 for (int i = 0; i < NUM_DOCS; i++) {
113 assertEquals(reader.numDocs(), NUM_DOCS);
119 int origId = NUM_DOCS - i - 1;
H A DTestMultiPassIndexSplitter.java28 int NUM_DOCS = 11; field in class:TestMultiPassIndexSplitter
37 for (int i = 0; i < NUM_DOCS; i++) {
70 assertTrue(ir.numDocs() - NUM_DOCS / 3 <= 1); // rounding error
80 assertTrue(ir.numDocs() - NUM_DOCS / 3 <= 1);
88 assertTrue(ir.numDocs() - NUM_DOCS / 3 <= 1);
115 assertTrue(ir.numDocs() - NUM_DOCS / 3 <= 1);
121 assertTrue(ir.numDocs() - NUM_DOCS / 3 <= 1);
127 assertTrue(ir.numDocs() - NUM_DOCS / 3 <= 1);
133 t = new Term("id", (NUM_DOCS - 1) + "");
/lucene-3.6.0/lucene/contrib/misc/src/test/org/apache/lucene/misc/
H A DTestLengthNormModifier.java43 public static int NUM_DOCS = 5; field in class:TestLengthNormModifier
62 for (int i = 0; i < NUM_DOCS; i++) {
128 final float[] scores = new float[NUM_DOCS];
158 for (int i = 0; i < NUM_DOCS; i++) {
202 for (int i = 0; i < NUM_DOCS; i++) {
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/index/
H A DTestLazyBug.java44 public static int NUM_DOCS = TEST_NIGHTLY ? 500 : 50; field in class:TestLazyBug
91 for (int d = 1; d <= NUM_DOCS; d++) {
136 doTest(new int[] { NUM_DOCS-1 });
140 doTest(new int[] { NUM_DOCS-1, NUM_DOCS/2 });
144 doTest(new int[] { NUM_DOCS/2, NUM_DOCS-1 });
H A DTestPayloadProcessorProvider.java121 private static final int NUM_DOCS = 10; field in class:TestPayloadProcessorProvider
133 verifyPayloadExists(dirs[i], new Term("p", "p1"), NUM_DOCS);
134 verifyPayloadExists(dirs[i], new Term("p", "p2"), NUM_DOCS);
147 for (int i = 0; i < NUM_DOCS; i++) {
191 verifyPayloadExists(dir, new Term("p", "p1"), NUM_DOCS);
192 verifyPayloadExists(dir, new Term("p", "p2"), NUM_DOCS);
218 numExpectedPayloads = NUM_DOCS * dirs.length
219 + (addToEmptyIndex ? 0 : NUM_DOCS);
238 doTest(random, false, NUM_DOCS, false);
241 doTest(random, false, NUM_DOCS, tru
[all...]
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/util/
H A DTestFieldCacheSanityChecker.java39 private static final int NUM_DOCS = 1000; field in class:TestFieldCacheSanityChecker
56 for (int i = 0; i < NUM_DOCS; i++){
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/index/
H A DTestLazyBug.java44 public static int NUM_DOCS = TEST_NIGHTLY ? 500 : 50; field in class:TestLazyBug
91 for (int d = 1; d <= NUM_DOCS; d++) {
136 doTest(new int[] { NUM_DOCS-1 });
140 doTest(new int[] { NUM_DOCS-1, NUM_DOCS/2 });
144 doTest(new int[] { NUM_DOCS/2, NUM_DOCS-1 });
H A DTestPayloadProcessorProvider.java121 private static final int NUM_DOCS = 10; field in class:TestPayloadProcessorProvider
133 verifyPayloadExists(dirs[i], new Term("p", "p1"), NUM_DOCS);
134 verifyPayloadExists(dirs[i], new Term("p", "p2"), NUM_DOCS);
147 for (int i = 0; i < NUM_DOCS; i++) {
191 verifyPayloadExists(dir, new Term("p", "p1"), NUM_DOCS);
192 verifyPayloadExists(dir, new Term("p", "p2"), NUM_DOCS);
218 numExpectedPayloads = NUM_DOCS * dirs.length
219 + (addToEmptyIndex ? 0 : NUM_DOCS);
238 doTest(random, false, NUM_DOCS, false);
241 doTest(random, false, NUM_DOCS, tru
[all...]
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/util/
H A DTestFieldCacheSanityChecker.java39 private static final int NUM_DOCS = 1000; field in class:TestFieldCacheSanityChecker
56 for (int i = 0; i < NUM_DOCS; i++){
/lucene-3.6.0/lucene/contrib/facet/src/examples/org/apache/lucene/facet/example/multiCL/
H A DMultiCLIndexer.java53 public static int NUM_DOCS = 100; field in class:MultiCLIndexer
106 String[] docTitles = new String[NUM_DOCS];
107 String[] docTexts = new String[NUM_DOCS];
108 CategoryPath[][] cPaths = new CategoryPath[NUM_DOCS][NUM_FACETS_PER_DOC];
111 for (int docNum = 0; docNum < NUM_DOCS; docNum++) {

Completed in 73 milliseconds