00001 00004 /* Copyright (C) 2006,2007 Olly Betts 00005 * 00006 * This program is free software; you can redistribute it and/or modify 00007 * it under the terms of the GNU General Public License as published by 00008 * the Free Software Foundation; either version 2 of the License, or 00009 * (at your option) any later version. 00010 * 00011 * This program is distributed in the hope that it will be useful, 00012 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00014 * GNU General Public License for more details. 00015 * 00016 * You should have received a copy of the GNU General Public License 00017 * along with this program; if not, write to the Free Software 00018 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 00019 */ 00020 00021 #ifndef XAPIAN_INCLUDED_EMPTYSUBMATCH_H 00022 #define XAPIAN_INCLUDED_EMPTYSUBMATCH_H 00023 00024 #include "submatch.h" 00025 00026 class EmptySubMatch : public SubMatch { 00028 void operator=(const EmptySubMatch &); 00029 00031 EmptySubMatch(const EmptySubMatch &); 00032 00033 public: 00035 EmptySubMatch() {} 00036 00038 bool prepare_match(bool nowait, Stats & total_stats); 00039 00041 void start_match(Xapian::doccount first, 00042 Xapian::doccount maxitems, 00043 Xapian::doccount check_at_least, 00044 const Stats & total_stats); 00045 00047 PostList * get_postlist_and_term_info(MultiMatch *matcher, 00048 map<string, Xapian::MSet::Internal::TermFreqAndWeight> *termfreqandwts); 00049 }; 00050 00051 #endif /* XAPIAN_INCLUDED_EMPTYSUBMATCH_H */