00001 /*========================================================================== 00002 * Copyright (c) 2004 University of Massachusetts. All Rights Reserved. 00003 * 00004 * Use of the Lemur Toolkit for Language Modeling and Information Retrieval 00005 * is subject to the terms of the software license set forth in the LICENSE 00006 * file included with this software, and also available at 00007 * http://www.lemurproject.org/license.html 00008 * 00009 *========================================================================== 00010 */ 00011 00012 00013 // 00014 // ExtentInsideNode 00015 // 00016 // 23 February 2004 -- tds 00017 // 00018 // The difference between an include node and an 00019 // and node is that in the include node, the inner 00020 // extent must be contained completely within an 00021 // outer extent. 00022 // 00023 00024 #ifndef INDRI_EXTENTINSIDENODE_HPP 00025 #define INDRI_EXTENTINSIDENODE_HPP 00026 00027 #include "indri/ListIteratorNode.hpp" 00028 #include "indri/greedy_vector" 00029 #include "indri/Extent.hpp" 00030 00031 class ExtentInsideNode : public ListIteratorNode { 00032 ListIteratorNode* _inner; 00033 ListIteratorNode* _outer; 00034 greedy_vector<Extent> _extents; 00035 std::string _name; 00036 00037 public: 00038 ExtentInsideNode( const std::string& name, ListIteratorNode* inner, ListIteratorNode* outer ); 00039 00040 void prepare( int documentID ); 00041 const greedy_vector<Extent>& extents(); 00042 int nextCandidateDocument(); 00043 const std::string& getName() const; 00044 void annotate( class Annotator& annotator, int documentID, int begin, int end ); 00045 }; 00046 00047 #endif // INDRI_EXTENTISIDENODE_HPP 00048