xapian-core/api/leafpostlist.h

   1 /** @file leafpostlist.h
   2  * @brief Abstract base class for leaf postlists.
   3  */
   4 /* Copyright (C) 2007,2009,2011,2013,2015 Olly Betts
   5  * Copyright (C) 2009 Lemur Consulting Ltd
   6  *
   7  * This program is free software; you can redistribute it and/or
   8  * modify it under the terms of the GNU General Public License as
   9  * published by the Free Software Foundation; either version 2 of the
  10  * License, or (at your option) any later version.
  11  *
  12  * This program is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  * GNU General Public License for more details.
  16  *
  17  * You should have received a copy of the GNU General Public License
  18  * along with this program; if not, write to the Free Software
  19  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
  20  */
  21
  22 #ifndef XAPIAN_INCLUDED_LEAFPOSTLIST_H
  23 #define XAPIAN_INCLUDED_LEAFPOSTLIST_H
  24
  25 #include "postlist.h"
  26
  27 #include <string>
  28
  29 namespace Xapian {
  30     class Weight;
  31 }
  32
  33 /** Abstract base class for leaf postlists.
  34  *
  35  *  This class provides the following features in addition to the PostList
  36  *  class:
  37  */
  38 class LeafPostList : public PostList {
  39     /// Don't allow assignment.
  40     void operator=(const LeafPostList &);
  41
  42     /// Don't allow copying.
  43     LeafPostList(const LeafPostList &);
  44
  45   protected:
  46     const Xapian::Weight * weight;
  47
  48     bool need_doclength, need_unique_terms;
  49
  50     /// The term name for this postlist (empty for an alldocs postlist).
  51     std::string term;
  52
  53     /// Only constructable as a base class for derived classes.
  54     explicit LeafPostList(const std::string & term_)
  55         : weight(0), need_doclength(false), need_unique_terms(false),
  56           term(term_) { }
  57
  58   public:
  59     ~LeafPostList();
  60
  61     /** Set the weighting scheme to use during matching.
  62      *
  63      *  If this isn't called, get_weight() and get_maxweight() will both
  64      *  return 0.
  65      *
  66      *  You should not call this more than once on a particular object.
  67      *
  68      *  @param weight_  The weighting object to use.  Must not be NULL.
  69      */
  70     void set_termweight(const Xapian::Weight * weight_);
  71
  72     double resolve_lazy_termweight(Xapian::Weight * weight_,
  73                                    Xapian::Weight::Internal * stats,
  74                                    Xapian::termcount qlen,
  75                                    Xapian::termcount wqf,
  76                                    double factor)
  77     {
  78         weight_->init_(*stats, qlen, term, wqf, factor);
  79         // There should be an existing LazyWeight set already.
  80         Assert(weight);
  81         const Xapian::Weight * const_weight_ = weight_;
  82         swap(weight, const_weight_);
  83         delete const_weight_;
  84         need_doclength = weight->get_sumpart_needs_doclength_();
  85         stats->termfreqs[term].max_part += weight->get_maxpart();
  86         return stats->termfreqs[term].max_part;
  87     }
  88
  89     /** Return the exact term frequency.
  90      *
  91      *  Leaf postlists have an exact termfreq, which get_termfreq_min(),
  92      *  get_termfreq_max(), and get_termfreq_est() all report.
  93      */
  94     virtual Xapian::doccount get_termfreq() const = 0;
  95
  96     Xapian::doccount get_termfreq_min() const;
  97     Xapian::doccount get_termfreq_max() const;
  98     Xapian::doccount get_termfreq_est() const;
  99
 100     double get_maxweight() const;
 101     double get_weight() const;
 102     double recalc_maxweight();
 103
 104     TermFreqs get_termfreq_est_using_stats(
 105         const Xapian::Weight::Internal & stats) const;
 106
 107     Xapian::termcount count_matching_subqs() const;
 108
 109     /** Open another postlist from the same database.
 110      *
 111      *  @param term_    The term to open a postlist for.  If term_ is near to
 112      *                  this postlist's term, then this can be a lot more
 113      *                  efficient (and if it isn't very near, there's not
 114      *                  much of a penalty).  Using this method can make a
 115      *                  wildcard expansion much more memory efficient.
 116      *
 117      *  @return         The new postlist object, or NULL if not supported
 118      *                  (in which case the caller should probably the postlist
 119      *                  via the database instead).
 120      */
 121     virtual LeafPostList * open_nearby_postlist(const std::string & term_) const;
 122 };
 123
 124 #endif // XAPIAN_INCLUDED_LEAFPOSTLIST_H