You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@lucene.apache.org by jp...@apache.org on 2019/05/28 07:55:39 UTC
[lucene-solr] branch branch_8x updated: LUCENE-8135: Fix number of
clauses randomization.
This is an automated email from the ASF dual-hosted git repository.
jpountz pushed a commit to branch branch_8x
in repository https://gitbox.apache.org/repos/asf/lucene-solr.git
The following commit(s) were added to refs/heads/branch_8x by this push:
new dd5fcd3 LUCENE-8135: Fix number of clauses randomization.
dd5fcd3 is described below
commit dd5fcd3dec7a7d0435b37b146298beb961690a5f
Author: Adrien Grand <jp...@gmail.com>
AuthorDate: Tue May 28 09:53:58 2019 +0200
LUCENE-8135: Fix number of clauses randomization.
---
lucene/core/src/test/org/apache/lucene/search/TestWANDScorer.java | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/lucene/core/src/test/org/apache/lucene/search/TestWANDScorer.java b/lucene/core/src/test/org/apache/lucene/search/TestWANDScorer.java
index 2a48cb3..40caaec 100644
--- a/lucene/core/src/test/org/apache/lucene/search/TestWANDScorer.java
+++ b/lucene/core/src/test/org/apache/lucene/search/TestWANDScorer.java
@@ -225,7 +225,7 @@ public class TestWANDScorer extends LuceneTestCase {
for (int iter = 0; iter < 100; ++iter) {
int start = random().nextInt(10);
- int numClauses = 2;//random().nextInt(1 << random().nextInt(5));
+ int numClauses = random().nextInt(1 << random().nextInt(5));
BooleanQuery.Builder builder = new BooleanQuery.Builder();
for (int i = 0; i < numClauses; ++i) {
builder.add(maybeWrap(new TermQuery(new Term("foo", Integer.toString(start + i)))), Occur.SHOULD);