@Override public boolean nextNode() throws IOException { final boolean more = nodeScorerQueue.nextNodeAndAdjust(); currentNode = nodeScorerQueue.node(); return more; }
@Test public void testNextNodeHeapTraversal() throws IOException { this.addDocument("\"term1 term3\" \"term5 term2\" . \"term1 term3\" . \"term5 term4 term3\" . "); final NodeDisjunctionScorerQueue q = new NodeDisjunctionScorerQueue(4); q.put(this.getScorer(ntq("term2"))); q.put(this.getScorer(ntq("term3"))); q.put(this.getScorer(ntq("term4"))); q.put(this.getScorer(ntq("term5"))); // test if the heap traversal is done properly. for (int i = 0; i < 4; i++) { q.nextNodeAndAdjust(); } assertFalse(q.nextNodeAndAdjust()); }
assertTrue(q.nextNodeAndAdjust()); assertEquals(node(0,0), q.node()); assertFalse(q.nextNodeAndAdjust()); assertEquals(DocsAndNodesIterator.NO_MORE_NOD, q.node()); assertTrue(q.nextNodeAndAdjust()); assertEquals(node(1,0), q.node()); assertFalse(q.nextNodeAndAdjust()); assertEquals(DocsAndNodesIterator.NO_MORE_NOD, q.node()); assertTrue(q.nextNodeAndAdjust()); assertEquals(node(0,1), q.node()); assertTrue(q.nextNodeAndAdjust()); assertEquals(node(1,0), q.node()); assertFalse(q.nextNodeAndAdjust()); assertEquals(DocsAndNodesIterator.NO_MORE_NOD, q.node());
@Test public void testNrMatches() throws IOException { this.addDocument("\"term1\" \"term2\" . \"term3\" . \"term4\" . "); this.addDocument("\"term2\" \"term3\" . \"term5\" . "); this.addDocument("\"term2\" \"term1 term5\" . "); final NodeDisjunctionScorerQueue q = new NodeDisjunctionScorerQueue(2); q.put(this.getScorer(ntq("term1"))); q.put(this.getScorer(ntq("term5"))); assertEquals(0, q.doc()); assertTrue(q.nextNodeAndAdjust()); q.countAndSumMatchers(); // there must be 1 matchers for node {0,0} assertEquals(1, q.nrMatchersInNode()); assertTrue(q.nextCandidateDocumentAndAdjustElsePop()); assertEquals(1, q.doc()); assertTrue(q.nextNodeAndAdjust()); q.countAndSumMatchers(); // there must be 1 matchers for node {1,0} assertEquals(1, q.nrMatchersInNode()); assertTrue(q.nextCandidateDocumentAndAdjustElsePop()); assertEquals(2, q.doc()); assertTrue(q.nextNodeAndAdjust()); q.countAndSumMatchers(); // there must be 2 matchers for node {0,1} assertEquals(2, q.nrMatchersInNode()); }
assertEquals(3, q.doc()); assertEquals(2, q.size()); // term2 should have been removed assertTrue(q.nextNodeAndAdjust()); assertEquals(node(0,0), q.node()); assertTrue(q.nextNodeAndAdjust()); assertEquals(node(1,0), q.node()); assertFalse(q.nextNodeAndAdjust()); assertEquals(DocsAndNodesIterator.NO_MORE_NOD, q.node()); assertEquals(4, q.doc()); assertEquals(1, q.size()); // term1 should have been removed assertTrue(q.nextNodeAndAdjust()); assertEquals(node(0,0), q.node()); assertTrue(q.nextNodeAndAdjust()); assertEquals(node(1,0), q.node()); assertFalse(q.nextNodeAndAdjust()); assertEquals(DocsAndNodesIterator.NO_MORE_NOD, q.node());
@Test public void testScoreSum() throws IOException { this.addDocument("\"term1 term2 term3\" . \"term4\" . "); final NodeScorer s1 = this.getScorer(ntq("term1")); final NodeScorer s2 = this.getScorer(ntq("term2")); final NodeScorer s3 = this.getScorer(ntq("term3")); final NodeDisjunctionScorerQueue q = new NodeDisjunctionScorerQueue(3); q.put(s1); q.put(s2); q.put(s3); assertEquals(0, q.doc()); assertTrue(q.nextNodeAndAdjust()); q.countAndSumMatchers(); // there must be 3 matchers assertEquals(3, q.nrMatchersInNode()); final float scoreInNode = q.scoreInNode(); assertEquals(s1.scoreInNode() + s2.scoreInNode() + s3.scoreInNode(), scoreInNode, 0f); assertTrue(scoreInNode != 0); }