/** * Initialize the {@link NodeDisjunctionScorerQueue}. */ private NodeDisjunctionScorerQueue initNodeScorerQueue() throws IOException { final NodeDisjunctionScorerQueue nodeQueue = new NodeDisjunctionScorerQueue(nrScorers); for (final NodeScorer s : scorers) { nodeQueue.put(s); } return nodeQueue; }
@Override public float scoreInNode() throws IOException { if (currentDoc == -1) { // if nextCandidateDocument not called for the first time return 0; } nodeScorerQueue.countAndSumMatchers(); return nodeScorerQueue.scoreInNode(); }
@Override public boolean nextCandidateDocument() throws IOException { boolean more = true; // The first time nextCandidateDocument is called, we must not advance the // underlying scorers as they have been already advanced during the queue init if (currentDoc != -1) { // if not called for the first time more = nodeScorerQueue.nextCandidateDocumentAndAdjustElsePop(); } currentDoc = nodeScorerQueue.doc(); currentNode = nodeScorerQueue.node(); return more; }
@Override public boolean nextNode() throws IOException { final boolean more = nodeScorerQueue.nextNodeAndAdjust(); currentNode = nodeScorerQueue.node(); return more; }
@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()); }
@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); }
final NodeDisjunctionScorerQueue q = new NodeDisjunctionScorerQueue(3); q.put(this.getScorer(ntq("term1"))); q.put(this.getScorer(ntq("term2"))); q.put(this.getScorer(ntq("term3"))); assertEquals(0, q.doc()); assertTrue(q.skipToCandidateAndAdjustElsePop(3)); 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()); assertTrue(q.skipToCandidateAndAdjustElsePop(2)); assertEquals(3, q.doc()); // queue should have not moved q.skipToCandidateAndAdjustElsePop(3); assertEquals(3, q.doc()); // queue should have not moved assertTrue(q.skipToCandidateAndAdjustElsePop(4)); 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());
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()); assertEquals(node(0,0), q.node()); assertFalse(q.nextNodeAndAdjust()); assertEquals(DocsAndNodesIterator.NO_MORE_NOD, q.node()); assertTrue(q.nextCandidateDocumentAndAdjustElsePop()); assertEquals(1, q.doc()); assertTrue(q.nextNodeAndAdjust()); assertEquals(node(1,0), q.node()); assertFalse(q.nextNodeAndAdjust()); assertEquals(DocsAndNodesIterator.NO_MORE_NOD, q.node()); assertTrue(q.nextCandidateDocumentAndAdjustElsePop()); assertEquals(2, q.doc()); 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()); assertFalse(q.nextCandidateDocumentAndAdjustElsePop()); assertEquals(DocsAndNodesIterator.NO_MORE_DOC, q.doc());
@Test public void testNextCandidateDocumentAndAdjustElsePop() throws IOException { this.addDocument("\"term1\" \"term2\" . \"term3\" . \"term4\" . "); this.addDocument("\"term5\" \"term2\" . \"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"))); assertEquals(0, q.doc()); assertEquals(4, q.size()); assertTrue(q.nextCandidateDocumentAndAdjustElsePop()); assertEquals(1, q.doc()); assertEquals(3, q.size()); // term4 scorer should have been removed assertFalse(q.nextCandidateDocumentAndAdjustElsePop()); assertEquals(DocsAndNodesIterator.NO_MORE_DOC, q.doc()); assertEquals(DocsAndNodesIterator.NO_MORE_NOD, q.node()); }
@Override public boolean skipToCandidate(final int target) throws IOException { final boolean more = nodeScorerQueue.skipToCandidateAndAdjustElsePop(target); currentDoc = nodeScorerQueue.doc(); 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()); }
/** * Move all the scorers that have document equals to the top document to the * next node and adjust the heap. * * @return If the least scorer has no more nodes, returns false. */ public final boolean nextNodeAndAdjust() throws IOException { /* * TODO: stecam: I had a NPE in this method with topHSN. However, * I cannot reproduce it. Try to find the case it does occur. */ // count number of scorers having the same document and node // counting the number of scorers and then performing the iterations of // all the scorers allows to avoid a node array copy (i.e., current node cache) if (size > 0 && nrMatchersInNode < 0) { this.countAndSumMatchers(); } // Move the scorers to the next node for (int i = 0; i < nrMatchersInNode; i++) { topHSN.scorer.nextNode(); this.adjustTop(); } // reset nrMatchersInNode nrMatchersInNode = -1; // if top node has sentinel value, it means that there is no more nodes return this.node() != DocsAndNodesIterator.NO_MORE_NOD; }
/** * Returns the number of subscorers matching the current node. Initially * invalid, until {@link #nextCandidateDocument()} is called the first time. * @throws IOException */ public int nrMatchers() throws IOException { // update the number of matched scorers nodeScorerQueue.countAndSumMatchers(); return nodeScorerQueue.nrMatchersInNode(); }
/** * Test method for {@link org.sindice.siren.search.node.NodeDisjunctionScorerQueue#top()}. * @throws IOException * @throws CorruptIndexException */ @Test public void testTop() throws IOException { this.addDocument("\"term1\" . "); this.addDocument("\"term2\" . "); this.addDocument("\"term3\" . \"term4\" . "); final NodeDisjunctionScorerQueue q = new NodeDisjunctionScorerQueue(5); final NodeScorer s1 = this.getScorer(ntq("term1")); final NodeScorer s2 = this.getScorer(ntq("term2")); final NodeScorer s3 = this.getScorer(ntq("term3")); final NodeScorer s4 = this.getScorer(ntq("term4")); q.put(s3); assertSame(s3, q.top()); q.put(s2); assertSame(s2, q.top()); // s2 should be the least scorer q.put(s4); assertSame(s2, q.top()); q.put(s1); assertSame(s1, q.top()); // s1 should be the least scorer }