honey_positionlist.h

Go to the documentation of this file.

 
/* Copyright (C) 2005-2024 Olly Betts
 *
 * 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_HONEY_POSITIONLIST_H
#define XAPIAN_INCLUDED_HONEY_POSITIONLIST_H
 
#include <xapian/types.h>
 
#include "backends/positionlist.h"
#include "bitstream.h"
#include "honey_cursor.h"
#include "honey_lazytable.h"
#include "pack.h"
 
#include <string>
#include <string_view>
 
class HoneyBasePositionList : public PositionList {
    HoneyBasePositionList(const HoneyBasePositionList&) = delete;
 
    HoneyBasePositionList& operator=(const HoneyBasePositionList&) = delete;
 
  protected:
    BitReader rd;
 
    Xapian::termpos current_pos;
 
    Xapian::termpos last;
 
    Xapian::termcount size;
 
    bool have_started;
 
    void set_data(const std::string& data);
 
  public:
    HoneyBasePositionList() {}
 
    Xapian::termcount get_approx_size() const;
 
    Xapian::termpos back() const;
 
    Xapian::termpos get_position() const;
 
    bool next();
 
    bool skip_to(Xapian::termpos termpos);
};
 
class HoneyPositionList : public HoneyBasePositionList {
    std::string pos_data;
 
    HoneyPositionList(const HoneyPositionList&) = delete;
 
    HoneyPositionList& operator=(const HoneyPositionList&) = delete;
 
  public:
    explicit
    HoneyPositionList(std::string&& data);
};
 
class HoneyRePositionList : public HoneyBasePositionList {
    HoneyCursor cursor;
 
    HoneyRePositionList(const HoneyRePositionList&) = delete;
 
    HoneyRePositionList& operator=(const HoneyRePositionList&) = delete;
 
  public:
    explicit
    HoneyRePositionList(const HoneyTable& table)
        : cursor(&table) {}
 
    void assign_data(std::string&& data);
 
    void read_data(Xapian::docid did, const std::string& term);
};
 
class HoneyPositionTable : public HoneyLazyTable {
  public:
    static std::string make_key(Xapian::docid did, std::string_view term) {
        std::string key;
        pack_string_preserving_sort(key, term);
        pack_uint_preserving_sort(key, did);
        return key;
    }
 
    HoneyPositionTable(const std::string& dbdir, bool readonly)
        : HoneyLazyTable("position", dbdir + "/position.", readonly) { }
 
    HoneyPositionTable(int fd, off_t offset_, bool readonly_)
        : HoneyLazyTable("position", fd, offset_, readonly_) { }
 
    HoneyPositionList* open_position_list(Xapian::docid did,
                                          std::string_view term) const {
        std::string pos_data;
        if (!get_exact_entry(make_key(did, term), pos_data))
            return nullptr;
 
        return new HoneyPositionList(std::move(pos_data));
    }
 
    void pack(std::string& s, const Xapian::VecCOW<Xapian::termpos>& vec) const;
 
    void set_positionlist(Xapian::docid did, std::string_view tname,
                          std::string_view s) {
        add(make_key(did, tname), s);
    }
 
    void delete_positionlist(Xapian::docid did, std::string_view tname) {
        del(make_key(did, tname));
    }
 
    Xapian::termcount positionlist_count(Xapian::docid did,
                                         std::string_view term) const;
};
 
#endif /* XAPIAN_INCLUDED_HONEY_POSITIONLIST_H */