📄 testbooleanminshouldmatch.java
字号:
verifyNrHits(q, 1); } public void testOneReqSomeProhibAndSomeOptional() throws Exception { /* one required, two prohibited, some optional */ BooleanQuery q = new BooleanQuery(); q.add(new TermQuery(new Term("data", "6" )), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "5" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "4" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "3" )), BooleanClause.Occur.MUST_NOT);//false, true ); q.add(new TermQuery(new Term("data", "2" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "1" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "C" )), BooleanClause.Occur.MUST_NOT);//false, true ); q.setMinimumNumberShouldMatch(3); // 3 of 4 optional verifyNrHits(q, 1); } public void testSomeReqSomeProhibAndSomeOptional() throws Exception { /* two required, two prohibited, some optional */ BooleanQuery q = new BooleanQuery(); q.add(new TermQuery(new Term("all", "all")), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "6" )), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "5" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "4" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "3" )), BooleanClause.Occur.MUST_NOT);//false, true ); q.add(new TermQuery(new Term("data", "2" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "1" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "C" )), BooleanClause.Occur.MUST_NOT);//false, true ); q.setMinimumNumberShouldMatch(3); // 3 of 4 optional verifyNrHits(q, 1); } public void testMinHigherThenNumOptional() throws Exception { /* two required, two prohibited, some optional */ BooleanQuery q = new BooleanQuery(); q.add(new TermQuery(new Term("all", "all")), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "6" )), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "5" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "4" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "3" )), BooleanClause.Occur.MUST_NOT);//false, true ); q.add(new TermQuery(new Term("data", "2" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "1" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "C" )), BooleanClause.Occur.MUST_NOT);//false, true ); q.setMinimumNumberShouldMatch(90); // 90 of 4 optional ?!?!?! verifyNrHits(q, 0); } public void testMinEqualToNumOptional() throws Exception { /* two required, two optional */ BooleanQuery q = new BooleanQuery(); q.add(new TermQuery(new Term("all", "all" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "6" )), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "3" )), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "2" )), BooleanClause.Occur.SHOULD);//false, false); q.setMinimumNumberShouldMatch(2); // 2 of 2 optional verifyNrHits(q, 1); } public void testOneOptionalEqualToMin() throws Exception { /* two required, one optional */ BooleanQuery q = new BooleanQuery(); q.add(new TermQuery(new Term("all", "all" )), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "3" )), BooleanClause.Occur.SHOULD);//false, false); q.add(new TermQuery(new Term("data", "2" )), BooleanClause.Occur.MUST);//true, false); q.setMinimumNumberShouldMatch(1); // 1 of 1 optional verifyNrHits(q, 1); } public void testNoOptionalButMin() throws Exception { /* two required, no optional */ BooleanQuery q = new BooleanQuery(); q.add(new TermQuery(new Term("all", "all" )), BooleanClause.Occur.MUST);//true, false); q.add(new TermQuery(new Term("data", "2" )), BooleanClause.Occur.MUST);//true, false); q.setMinimumNumberShouldMatch(1); // 1 of 0 optional verifyNrHits(q, 0); } public void testRandomQueries() throws Exception { final Random rnd = new Random(0); String field="data"; String[] vals = {"1","2","3","4","5","6","A","Z","B","Y","Z","X","foo"}; int maxLev=4; // callback object to set a random setMinimumNumberShouldMatch TestBoolean2.Callback minNrCB = new TestBoolean2.Callback() { public void postCreate(BooleanQuery q) { BooleanClause[] c =q.getClauses(); int opt=0; for (int i=0; i<c.length;i++) { if (c[i].getOccur() == BooleanClause.Occur.SHOULD) opt++; } q.setMinimumNumberShouldMatch(rnd.nextInt(opt+2)); } }; // increase number of iterations for more complete testing for (int i=0; i<1000; i++) { int lev = rnd.nextInt(maxLev); BooleanQuery q1 = TestBoolean2.randBoolQuery(new Random(i), lev, field, vals, null); // BooleanQuery q2 = TestBoolean2.randBoolQuery(new Random(i), lev, field, vals, minNrCB); BooleanQuery q2 = TestBoolean2.randBoolQuery(new Random(i), lev, field, vals, null); // only set minimumNumberShouldMatch on the top level query since setting // at a lower level can change the score. minNrCB.postCreate(q2); // Can't use Hits because normalized scores will mess things // up. The non-sorting version of search() that returns TopDocs // will not normalize scores. TopDocs top1 = s.search(q1,null,100); TopDocs top2 = s.search(q2,null,100); QueryUtils.check(q1,s); QueryUtils.check(q2,s); // The constrained query // should be a superset to the unconstrained query. if (top2.totalHits > top1.totalHits) { TestCase.fail("Constrained results not a subset:\n" + CheckHits.topdocsString(top1,0,0) + CheckHits.topdocsString(top2,0,0) + "for query:" + q2.toString()); } for (int hit=0; hit<top2.totalHits; hit++) { int id = top2.scoreDocs[hit].doc; float score = top2.scoreDocs[hit].score; boolean found=false; // find this doc in other hits for (int other=0; other<top1.totalHits; other++) { if (top1.scoreDocs[other].doc == id) { found=true; float otherScore = top1.scoreDocs[other].score; // check if scores match if (Math.abs(otherScore-score)>1.0e-6f) { TestCase.fail("Doc " + id + " scores don't match\n" + CheckHits.topdocsString(top1,0,0) + CheckHits.topdocsString(top2,0,0) + "for query:" + q2.toString()); } } } // check if subset if (!found) TestCase.fail("Doc " + id + " not found\n" + CheckHits.topdocsString(top1,0,0) + CheckHits.topdocsString(top2,0,0) + "for query:" + q2.toString()); } } // System.out.println("Total hits:"+tot); } protected void printHits(String test, Hits h) throws Exception { System.err.println("------- " + test + " -------"); DecimalFormat f = new DecimalFormat("0.000000"); for (int i = 0; i < h.length(); i++) { Document d = h.doc(i); float score = h.score(i); System.err.println("#" + i + ": " + f.format(score) + " - " + d.get("id") + " - " + d.get("data")); } }}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -