multimatch.h

Go to the documentation of this file.

/* Copyright 1999,2000,2001 BrightStation PLC
 * Copyright 2002,2003,2004,2005,2006,2007,2009,2011,2013,2014,2015,2016 Olly Betts
 * Copyright 2009 Lemur Consulting Ltd
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
 * USA
 */

#ifndef OM_HGUARD_MULTIMATCH_H
#define OM_HGUARD_MULTIMATCH_H

#include "submatch.h"

#include <vector>

#include "xapian/query.h"
#include "xapian/weight.h"

class MultiMatch
{
    private:
        std::vector<Xapian::Internal::intrusive_ptr<SubMatch> > leaves;

        const Xapian::Database db;

        Xapian::Query query;

        Xapian::doccount collapse_max;

        Xapian::valueno collapse_key;

        int percent_cutoff;

        double weight_cutoff;

        Xapian::Enquire::docid_order order;

        Xapian::valueno sort_key;

        Xapian::Enquire::Internal::sort_setting sort_by;

        bool sort_value_forward;

        double time_limit;

        const Xapian::Weight * weight;

        bool recalculate_w_max;

        vector<bool> is_remote;

        const vector<Xapian::Internal::opt_intrusive_ptr<Xapian::MatchSpy>> & matchspies;

        double getorrecalc_maxweight(PostList *pl);

        MultiMatch(const MultiMatch &);

        void operator=(const MultiMatch &);

    public:
        MultiMatch(const Xapian::Database &db_,
                   const Xapian::Query & query,
                   Xapian::termcount qlen,
                   const Xapian::RSet * omrset,
                   Xapian::doccount collapse_max_,
                   Xapian::valueno collapse_key_,
                   int percent_cutoff_,
                   double weight_cutoff_,
                   Xapian::Enquire::docid_order order_,
                   Xapian::valueno sort_key_,
                   Xapian::Enquire::Internal::sort_setting sort_by_,
                   bool sort_value_forward_,
                   double time_limit_,
                   Xapian::Weight::Internal & stats,
                   const Xapian::Weight *wtscheme,
                   const vector<Xapian::Internal::opt_intrusive_ptr<Xapian::MatchSpy>> & matchspies_,
                   bool have_sorter, bool have_mdecider);

        void get_mset(Xapian::doccount first,
                      Xapian::doccount maxitems,
                      Xapian::doccount check_at_least,
                      Xapian::MSet & mset,
                      Xapian::Weight::Internal & stats,
                      const Xapian::MatchDecider * mdecider,
                      const Xapian::KeyMaker * sorter);

        void recalc_maxweight() {
            recalculate_w_max = true;
        }

        bool full_db_has_positions() const {
            return db.has_positions();
        }
};

#endif /* OM_HGUARD_MULTIMATCH_H */