andpostlist.h

Go to the documentation of this file.

 
/* Copyright (C) 2007,2009,2011,2017,2021 Olly Betts
 * Copyright (C) 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, see
 * <https://www.gnu.org/licenses/>.
 */
 
#ifndef XAPIAN_INCLUDED_ANDPOSTLIST_H
#define XAPIAN_INCLUDED_ANDPOSTLIST_H
 
#include "backends/postlist.h"
#include "omassert.h"
#include "postlisttree.h"
 
#include <algorithm>
 
class AndPostList : public PostList {
    struct ComparePostListTermFreqAscending {
        bool operator()(const PostList *a, const PostList *b) const {
            return a->get_termfreq() < b->get_termfreq();
        }
    };
 
    AndPostList& operator=(const AndPostList&) = delete;
 
    AndPostList(const AndPostList&) = delete;
 
    Xapian::docid did = 0;
 
    size_t n_kids;
 
    PostList** plist = nullptr;
 
    double* max_wt = nullptr;
 
    double max_total = 0.0;
 
    PostListTree *matcher;
 
    double new_min(double w_min, size_t n) {
        return w_min - (max_total - max_wt[n]);
    }
 
    void next_helper(size_t n, double w_min) {
        PostList * res = plist[n]->next(new_min(w_min, n));
        if (res) {
            delete plist[n];
            plist[n] = res;
            if (max_wt[n] > 0)
                matcher->force_recalc();
        }
    }
 
    void skip_to_helper(size_t n, Xapian::docid did_min, double w_min) {
        PostList * res = plist[n]->skip_to(did_min, new_min(w_min, n));
        if (res) {
            delete plist[n];
            plist[n] = res;
            if (max_wt[n] > 0)
                matcher->force_recalc();
        }
    }
 
    void check_helper(size_t n, Xapian::docid did_min, double w_min,
                      bool &valid) {
        PostList * res = plist[n]->check(did_min, new_min(w_min, n), valid);
        if (res) {
            delete plist[n];
            plist[n] = res;
            if (max_wt[n] > 0)
                matcher->force_recalc();
        }
    }
 
    void allocate_plist_and_max_wt();
 
    PostList * find_next_match(double w_min);
 
  public:
    template<class RandomItor>
    AndPostList(RandomItor pl_begin, RandomItor pl_end, PostListTree* matcher_)
        : n_kids(pl_end - pl_begin), matcher(matcher_)
    {
        allocate_plist_and_max_wt();
 
        // Copy the postlists in ascending termfreq order, since it will
        // be more efficient to look at the shorter lists first, and skip
        // the longer lists based on those.
        std::partial_sort_copy(pl_begin, pl_end, plist, plist + n_kids,
                               ComparePostListTermFreqAscending());
 
        Xapian::docid first = 1, last = Xapian::docid(-1);
        AndPostList::get_docid_range(first, last);
        if (rare(last < first)) {
            // This probably always gets handled at a higher level.
            termfreq = 0;
            return;
        }
 
        // We calculate the estimate assuming independence.
        double r = (last - first + 1);
        for (size_t i = 0; i < n_kids; ++i) {
            auto est = plist[i]->get_termfreq();
            first = 1;
            last = Xapian::docid(-1);
            plist[i]->get_docid_range(first, last);
            // If this wasn't true then AndPostList::get_docid_range() should
            // have returned last < first which is handled above.
            Assert(last >= first);
            r *= double(est) / (last - first + 1);
        }
        termfreq = static_cast<Xapian::doccount>(r + 0.5);
    }
 
    AndPostList(PostList* l, PostList* r,
                double lmax, double rmax,
                PostListTree* matcher_, Xapian::doccount termfreq_)
        : n_kids(2), max_total(lmax + rmax), matcher(matcher_)
    {
        // Just copy the estimate from the PostList which decayed.
        termfreq = termfreq_;
 
        // Even if we're the decay product of an OrPostList, we may want to
        // swap here, as the subqueries may also have decayed and so their
        // estimated termfreqs may have changed.
        if (l->get_termfreq() < r->get_termfreq()) {
            std::swap(l, r);
            std::swap(lmax, rmax);
        }
        allocate_plist_and_max_wt();
        // Put the least frequent postlist first.
        plist[0] = r;
        plist[1] = l;
        max_wt[0] = rmax;
        max_wt[1] = lmax;
    }
 
    ~AndPostList();
 
    Xapian::docid get_docid() const;
 
    double get_weight(Xapian::termcount doclen,
                      Xapian::termcount unique_terms,
                      Xapian::termcount wdfdocmax) const;
 
    bool at_end() const;
 
    double recalc_maxweight();
 
    PostList* next(double w_min);
 
    PostList* skip_to(Xapian::docid, double w_min);
 
    void get_docid_range(Xapian::docid& first, Xapian::docid& last) const;
 
    std::string get_description() const;
 
    Xapian::termcount get_wdf() const;
 
    Xapian::termcount count_matching_subqs() const;
 
    void gather_position_lists(OrPositionList* orposlist);
};
 
#endif // XAPIAN_INCLUDED_ANDPOSTLIST_H