void IndexWriter::_fetchMatchingInvertedLists( indri::utility::greedy_vector<WriterIndexContext*>& lists, invertedlist_pqueue& queue ) { lists.clear(); WriterIndexContext* first = queue.top(); lists.push_back( first ); const char* firstTerm = first->iterator->currentEntry()->termData->term; queue.pop(); while( queue.size() && !strcmp( firstTerm, queue.top()->iterator->currentEntry()->termData->term ) ) { lists.push_back( queue.top() ); queue.pop(); } }
// Moved work of identifying matches of an extent from ExtentRestriction to here. // This allows the computation for the list of matches for an extent to be // overridden. ExtentParent, ExtentChild, and ExtentDescendant are among the // classes that need to do this, as the parent/child/descedant relationships // are not based on extent containment - these relationships may be among // arbitrary fields in a document. virtual const indri::utility::greedy_vector<indri::index::Extent>& matches( indri::index::Extent &extent ) { int begin = extent.begin; int end = extent.end; const indri::utility::greedy_vector<indri::index::Extent>& exts = extents(); _matches.clear(); for( size_t i = 0 ; i < exts.size(); i++ ) { if ( begin <= exts[i].begin && end >= exts[i].end ) { _matches.push_back( exts[i] ); } else if ( exts[i].begin > end ) { break; } } return _matches; }
// Moved work of identifying matches of an extent from ExtentRestriction to here. // This allows the computation for the list of matches for an extent to be // overridden. ExtentParent, ExtentChild, and ExtentDescendant are among the // classes that need to do this, as the parent/child/descedant relationships // are not based on extent containment - these relationships may be among // arbitrary fields in a document. virtual const indri::utility::greedy_vector<indri::index::Extent>& matches( indri::index::Extent &extent ) { int begin = extent.begin; int end = extent.end; _matches.clear(); const indri::utility::greedy_vector<indri::index::Extent>& exts = extents(); // if there's no extents or we have no length - just return if (begin == end || exts.size()==0) return _matches; // if we are dealing with child extents, we need to reverse the // list pointer to the last good position while((_lastpos > 0) && (exts[_lastpos-1].begin >= begin)){ _lastpos--; } // now, we make sure we're in the correct position // after this loop, _lastpos->begin >= begin while((_lastpos < exts.size()) && (exts[_lastpos].begin < begin)){ _lastpos++; } // for default DocListIteratorNode, any extent: begin+1 == end. while((_lastpos < exts.size()) && (exts[_lastpos].begin < end)) { if(exts[_lastpos].end <= end) { indri::index::Extent ext(exts[_lastpos]); _matches.push_back(ext); } // end if(_exts[_lastpos].end<=end) _lastpos++; } // end while(_lastpos<_exts.size()&&_exts[_lastpos].begin<end) /*** *** old method of matching child extents - deprecated * * for( size_t i = 0 ; i < exts.size(); i++ ) { * if ( begin <= exts[i].begin && end >= exts[i].end ) { * _matches.push_back( exts[i] ); * } else if ( exts[i].begin > end ) { * break; * } * } **/ return _matches; }
void indri::infnet::ExtentAndNode::_and( indri::utility::greedy_vector<indri::index::Extent>& out, const indri::utility::greedy_vector<indri::index::Extent>& one, const indri::utility::greedy_vector<indri::index::Extent>& two ) { indri::utility::greedy_vector<indri::index::Extent>::const_iterator oneIter = one.begin(); indri::utility::greedy_vector<indri::index::Extent>::const_iterator twoIter = two.begin(); out.clear(); indri::index::Extent current; current.begin = 0; current.end = 0; while( oneIter != one.end() && twoIter != two.end() ) { indri::index::Extent intersection; // compute the intersection (may be 0 length) intersection.begin = lemur_compat::max( oneIter->begin, twoIter->begin ); intersection.end = lemur_compat::min( oneIter->end, twoIter->end ); intersection.begin = lemur_compat::min( intersection.begin, intersection.end ); if( current.end < intersection.begin ) { // if last intersection had non-zero length, put it out in the vector if( current.begin < current.end ) out.push_back( current ); current = intersection; } else { // this intersection touches the last intersection, // so we'll just put them together current.end = intersection.end; } if( oneIter->end == intersection.end ) { oneIter++; } if( twoIter->end == intersection.end ) { twoIter++; } } if( current.begin != current.end ) _extents.push_back( current ); }