forked from openkylin/ukui-search
115 lines
2.9 KiB
C++
115 lines
2.9 KiB
C++
/*
|
|
* Copyright (C) 2020, KylinSoft Co., 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 3 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/>.
|
|
*
|
|
* Authors: zhangpengfei <zhangpengfei@kylinos.cn>
|
|
*
|
|
*/
|
|
#include "document.h"
|
|
#include <QDebug>
|
|
using namespace UkuiSearch;
|
|
void Document::setData(QString &data) {
|
|
if(data.isEmpty())
|
|
return;
|
|
m_document.set_data(data.toStdString());
|
|
}
|
|
|
|
void Document::addPosting(std::string term, QVector<size_t> offset, int weight) {
|
|
if(term == "")
|
|
return;
|
|
if(term.length() > 240)
|
|
term = QString::fromStdString(term).left(30).toStdString();
|
|
|
|
for(size_t i : offset) {
|
|
m_document.add_posting(term, i, weight);
|
|
}
|
|
}
|
|
|
|
void Document::addPosting(std::string &term, std::vector<size_t> &offset, int weight) {
|
|
if(term == "")
|
|
return;
|
|
if(term.length() > 240)
|
|
term = QString::fromStdString(term).left(30).toStdString();
|
|
|
|
for(size_t i : offset) {
|
|
m_document.add_posting(term, i, weight);
|
|
}
|
|
}
|
|
|
|
void Document::addPosting(std::string term, unsigned int offset, int weight) {
|
|
if(term == "")
|
|
return;
|
|
if(term.length() > 240)
|
|
term = QString::fromStdString(term).left(30).toStdString();
|
|
|
|
m_document.add_posting(term, offset, weight);
|
|
}
|
|
|
|
void Document::addTerm(QString term) {
|
|
if(term.isEmpty())
|
|
return;
|
|
m_document.add_term(term.toStdString());
|
|
}
|
|
|
|
void Document::addTerm(std::string term) {
|
|
if(term.empty())
|
|
return;
|
|
m_document.add_term(term);
|
|
}
|
|
|
|
void Document::addValue(unsigned slot, QString value)
|
|
{
|
|
m_document.add_value(slot, value.toStdString());
|
|
}
|
|
|
|
void Document::addSortableSerialiseValue(unsigned slot, QString value)
|
|
{
|
|
m_document.add_value(slot, Xapian::sortable_serialise(value.toDouble()));
|
|
}
|
|
|
|
void Document::setUniqueTerm(QString term) {
|
|
if(term.isEmpty())
|
|
return;
|
|
m_document.add_term(term.toStdString());
|
|
|
|
m_uniqueTerm = std::move(term.toStdString());
|
|
}
|
|
|
|
void Document::setUniqueTerm(std::string term) {
|
|
if(term.empty())
|
|
return;
|
|
m_document.add_term(term);
|
|
m_uniqueTerm = std::move(term);
|
|
}
|
|
|
|
std::string Document::getUniqueTerm() const
|
|
{
|
|
return m_uniqueTerm;
|
|
}
|
|
|
|
Xapian::Document Document::getXapianDocument() const{
|
|
return m_document;
|
|
}
|
|
|
|
void Document::setIndexTime(const QString &time)
|
|
{
|
|
m_time = time.toStdString();
|
|
}
|
|
|
|
const std::string Document::indexTime() const
|
|
{
|
|
return m_time;
|
|
}
|