405 lines
13 KiB
C++
405 lines
13 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 <QFileInfo>
|
|
#include <QDebug>
|
|
#include <QtConcurrent>
|
|
#include <QThread>
|
|
#include <chinese-segmentation.h>
|
|
#include <QUrl>
|
|
#include "file-searcher.h"
|
|
#include "global-settings.h"
|
|
|
|
size_t FileSearcher::uniqueSymbol1 = 0;
|
|
size_t FileSearcher::uniqueSymbol2 = 0;
|
|
size_t FileSearcher::uniqueSymbol3 = 0;
|
|
QMutex FileSearcher::m_mutex1;
|
|
QMutex FileSearcher::m_mutex2;
|
|
QMutex FileSearcher::m_mutex3;
|
|
FileSearcher::FileSearcher(QObject *parent) : QObject(parent)
|
|
{
|
|
}
|
|
|
|
FileSearcher::~FileSearcher()
|
|
{
|
|
}
|
|
|
|
int FileSearcher::getCurrentIndexCount()
|
|
{
|
|
try
|
|
{
|
|
Xapian::Database db(INDEX_PATH);
|
|
return db.get_doccount();
|
|
}
|
|
catch(const Xapian::Error &e)
|
|
{
|
|
qWarning() <<QString::fromStdString(e.get_description());
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
void FileSearcher::onKeywordSearch(QString keyword,QQueue<QString> *searchResultFile,QQueue<QString> *searchResultDir,QQueue<QPair<QString,QStringList>> *searchResultContent)
|
|
{
|
|
m_mutex1.lock();
|
|
++uniqueSymbol1;
|
|
m_mutex1.unlock();
|
|
m_mutex2.lock();
|
|
++uniqueSymbol2;
|
|
m_mutex2.unlock();
|
|
m_mutex3.lock();
|
|
++uniqueSymbol3;
|
|
m_mutex3.unlock();
|
|
|
|
m_search_result_file = searchResultFile;
|
|
m_search_result_dir = searchResultDir;
|
|
m_search_result_content = searchResultContent;
|
|
|
|
//file
|
|
QtConcurrent::run([&, uniqueSymbol1, keyword](){
|
|
if(!m_search_result_file->isEmpty())
|
|
m_search_result_file->clear();
|
|
int begin = 0;
|
|
int num = 5;
|
|
int resultCount = 0;
|
|
int total = 0;
|
|
while(total < 100)
|
|
{
|
|
resultCount = keywordSearchfile(uniqueSymbol1,keyword,"0",1,begin,num);
|
|
if(resultCount == 0 || resultCount == -1)
|
|
break;
|
|
total += resultCount;
|
|
begin += num;
|
|
}
|
|
return;
|
|
});
|
|
// Q_EMIT this->resultFile(m_search_result_file);
|
|
//dir
|
|
QtConcurrent::run([&, uniqueSymbol2, keyword](){
|
|
if(!m_search_result_dir->isEmpty())
|
|
m_search_result_dir->clear();
|
|
int begin = 0;
|
|
int num = 5;
|
|
int resultCount = 0;
|
|
int total = 0;
|
|
while(total<100)
|
|
{
|
|
resultCount = keywordSearchfile(uniqueSymbol2,keyword,"1",1,begin,num);
|
|
if(resultCount == 0 || resultCount == -1)
|
|
break;
|
|
total += resultCount;
|
|
begin += num;
|
|
}
|
|
return;
|
|
});
|
|
// Q_EMIT this->resultDir(m_search_result_dir);
|
|
//content
|
|
QtConcurrent::run([&, uniqueSymbol3, keyword](){
|
|
if(!m_search_result_content->isEmpty())
|
|
m_search_result_content->clear();
|
|
int begin = 0;
|
|
int num = 5;
|
|
int resultCount = 0;
|
|
int total = 0;
|
|
|
|
while(total<50)
|
|
{
|
|
resultCount = keywordSearchContent(uniqueSymbol3,keyword,begin,num);
|
|
if(resultCount == 0 || resultCount == -1)
|
|
break;
|
|
total += resultCount;
|
|
begin += num;
|
|
}
|
|
return;
|
|
});
|
|
// Q_EMIT this->resultContent(m_search_result_content);
|
|
}
|
|
|
|
int FileSearcher::keywordSearchfile(size_t uniqueSymbol, QString keyword, QString value, unsigned slot, int begin, int num)
|
|
{
|
|
try
|
|
{
|
|
qDebug() << "--keywordSearchfile start--";
|
|
Xapian::Database db(INDEX_PATH);
|
|
Xapian::Query query = creatQueryForFileSearch(keyword,db);
|
|
Xapian::Enquire enquire(db);
|
|
|
|
Xapian::Query queryFile;
|
|
if(!value.isEmpty())
|
|
{
|
|
std::string slotValue = value.toStdString();
|
|
Xapian::Query queryValue = Xapian::Query(Xapian::Query::OP_VALUE_RANGE,slot,slotValue,slotValue);
|
|
queryFile = Xapian::Query(Xapian::Query::OP_AND,query,queryValue);
|
|
}
|
|
else
|
|
{
|
|
queryFile = query;
|
|
}
|
|
|
|
qDebug() << "keywordSearchfile:"<<QString::fromStdString(queryFile.get_description());
|
|
|
|
enquire.set_query(queryFile);
|
|
Xapian::MSet result = enquire.get_mset(begin, num);
|
|
int resultCount = result.size();
|
|
qDebug()<< "keywordSearchfile results count=" <<resultCount;
|
|
if(result.size() == 0)
|
|
return 0;
|
|
if(getResult(uniqueSymbol, result, value) == -1)
|
|
return -1;
|
|
|
|
qDebug()<< "--keywordSearchfile finish--";
|
|
return resultCount;
|
|
}
|
|
catch(const Xapian::Error &e)
|
|
{
|
|
qWarning() <<QString::fromStdString(e.get_description());
|
|
qDebug()<< "--keywordSearchfile finish--";
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
int FileSearcher::keywordSearchContent(size_t uniqueSymbol, QString keyword, int begin, int num)
|
|
{
|
|
try
|
|
{
|
|
qDebug()<<"--keywordSearchContent search start--";
|
|
|
|
Xapian::Database db(CONTENT_INDEX_PATH);
|
|
Xapian::Enquire enquire(db);
|
|
Xapian::QueryParser qp;
|
|
qp.set_default_op(Xapian::Query::OP_AND);
|
|
qp.set_database(db);
|
|
|
|
QVector<SKeyWord> sKeyWord = ChineseSegmentation::getInstance()->callSegement(keyword);
|
|
//Creat a query
|
|
std::string words;
|
|
for(int i=0;i<sKeyWord.size();i++)
|
|
{
|
|
words.append(sKeyWord.at(i).word).append(" ");
|
|
}
|
|
Xapian::Query query = qp.parse_query(words);
|
|
|
|
// std::vector<Xapian::Query> v;
|
|
// for(int i=0;i<sKeyWord.size();i++)
|
|
// {
|
|
// v.push_back(Xapian::Query(sKeyWord.at(i).word));
|
|
// qDebug()<<QString::fromStdString(sKeyWord.at(i).word);
|
|
// }
|
|
// Xapian::Query queryPhrase =Xapian::Query(Xapian::Query::OP_AND, v.begin(), v.end());
|
|
qDebug()<<"keywordSearchContent:"<<QString::fromStdString(query.get_description());
|
|
|
|
enquire.set_query(query);
|
|
|
|
Xapian::MSet result = enquire.get_mset(begin, num);
|
|
int resultCount = result.size();
|
|
if(result.size() == 0)
|
|
return 0;
|
|
qDebug()<< "keywordSearchContent results count=" <<resultCount;
|
|
|
|
if(getContentResult(uniqueSymbol, result, words) == -1)
|
|
return -1;
|
|
|
|
qDebug()<< "--keywordSearchContent search finish--";
|
|
return resultCount;
|
|
}
|
|
catch(const Xapian::Error &e)
|
|
{
|
|
qWarning() <<QString::fromStdString(e.get_description());
|
|
qDebug()<< "--keywordSearchContent search finish--";
|
|
return -1;
|
|
}
|
|
}
|
|
Xapian::Query FileSearcher::creatQueryForFileSearch(QString keyword, Xapian::Database &db)
|
|
{
|
|
// Xapian::QueryParser qp;
|
|
// qp.set_default_op(Xapian::Query::OP_PHRASE);
|
|
// qp.set_database(db);
|
|
auto userInput = keyword.toLower();
|
|
// userInput = userInput.replace(".","").simplified();
|
|
// userInput = QString(QUrl::toPercentEncoding(userInput)).replace(""," ").simplified();
|
|
|
|
// std::string queryStr = keyword.replace(".","").replace(" ","").replace(""," ").simplified().toStdString();
|
|
// std::string s =db.get_spelling_suggestion(queryStr,10);
|
|
// qDebug()<<"spelling_suggestion!"<<QString::fromStdString(s);
|
|
|
|
// qDebug()<<"queryStr!"<<QString::fromStdString(queryStr);
|
|
//Creat a query
|
|
// Xapian::Query queryPhrase = qp.parse_query(userInput.toStdString(),Xapian::QueryParser::FLAG_PHRASE|Xapian::QueryParser::FLAG_SYNONYM);
|
|
std::vector<Xapian::Query> v;
|
|
for(int i=0;i<userInput.size();i++)
|
|
{
|
|
v.push_back(Xapian::Query(QUrl::toPercentEncoding(userInput.at(i)).toStdString()));
|
|
// qDebug()<<QString::fromStdString(Xapian::Query(QString(userInput.at(i)).toStdString()).get_description());
|
|
}
|
|
Xapian::Query queryPhrase =Xapian::Query(Xapian::Query::OP_PHRASE, v.begin(), v.end());
|
|
// Xapian::Query queryNear =Xapian::Query(Xapian::Query::OP_NEAR, v.begin(), v.end());
|
|
|
|
// Xapian::Query query = Xapian::Query(Xapian::Query::OP_AND,queryNear,queryPhrase);
|
|
// qDebug()<<QString::fromStdString(query.get_description());
|
|
return queryPhrase;
|
|
}
|
|
|
|
Xapian::Query FileSearcher::creatQueryForContentSearch(QString keyword, Xapian::Database &db)
|
|
{
|
|
|
|
}
|
|
|
|
int FileSearcher::getResult(size_t uniqueSymbol, Xapian::MSet &result, QString value)
|
|
{
|
|
//QStringList *pathTobeDelete = new QStringList;
|
|
//Delete those path doc which is not already exist.
|
|
|
|
// QStringList searchResult = QStringList();
|
|
|
|
for (auto it = result.begin(); it != result.end(); ++it)
|
|
{
|
|
Xapian::Document doc = it.get_document();
|
|
std::string data = doc.get_data();
|
|
Xapian::weight docScoreWeight = it.get_weight();
|
|
Xapian::percent docScorePercent = it.get_percent();
|
|
QString path = QString::fromStdString(data);
|
|
|
|
if(isBlocked(path))
|
|
continue;
|
|
|
|
QFileInfo info(path);
|
|
|
|
if(!info.exists())
|
|
{
|
|
// pathTobeDelete->append(QString::fromStdString(data));
|
|
qDebug()<<path<<"is not exist!!";
|
|
}
|
|
else
|
|
{
|
|
switch (value.toInt())
|
|
{
|
|
case 1:
|
|
m_mutex1.lock();
|
|
if(uniqueSymbol == FileSearcher::uniqueSymbol1)
|
|
{
|
|
m_search_result_dir->enqueue(path);
|
|
m_mutex1.unlock();
|
|
}
|
|
else
|
|
{
|
|
m_mutex1.unlock();
|
|
return -1;
|
|
}
|
|
|
|
break;
|
|
case 0:
|
|
m_mutex2.lock();
|
|
if(uniqueSymbol == FileSearcher::uniqueSymbol2)
|
|
{
|
|
m_search_result_file->enqueue(path);
|
|
m_mutex2.unlock();
|
|
}
|
|
else
|
|
{
|
|
m_mutex2.unlock();
|
|
return -1;
|
|
}
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
// searchResult.append(path);
|
|
}
|
|
qDebug()<< "doc="<< path << ",weight=" <<docScoreWeight << ",percent=" << docScorePercent;
|
|
}
|
|
// if(!pathTobeDelete->isEmpty())
|
|
// deleteAllIndex(pathTobeDelete)
|
|
return 0;
|
|
}
|
|
|
|
int FileSearcher::getContentResult(size_t uniqueSymbol, Xapian::MSet &result, std::string &keyWord)
|
|
{
|
|
//QStringList *pathTobeDelete = new QStringList;
|
|
//Delete those path doc which is not already exist.
|
|
|
|
QString wordTobeFound = QString::fromStdString(keyWord).section(" ",0,0);
|
|
int size = wordTobeFound.size();
|
|
int totalSize = QString::fromStdString(keyWord).size();
|
|
if(totalSize < 5)
|
|
totalSize = 5;
|
|
// QMap<QString,QStringList> searchResult;
|
|
|
|
for (auto it = result.begin(); it != result.end(); ++it)
|
|
{
|
|
Xapian::Document doc = it.get_document();
|
|
std::string data = doc.get_data();
|
|
double docScoreWeight = it.get_weight();
|
|
Xapian::percent docScorePercent = it.get_percent();
|
|
QString path = QString::fromStdString(doc.get_value(1));
|
|
|
|
if(isBlocked(path))
|
|
continue;
|
|
|
|
QFileInfo info(path);
|
|
|
|
if(!info.exists())
|
|
{
|
|
// pathTobeDelete->append(QString::fromStdString(data));
|
|
qDebug()<<path<<"is not exist!!";
|
|
continue;
|
|
}
|
|
// Construct snippets containing keyword.
|
|
QStringList snippets;
|
|
auto term = doc.termlist_begin();
|
|
term.skip_to(wordTobeFound.toStdString());
|
|
int count =0;
|
|
for(auto pos = term.positionlist_begin();pos != term.positionlist_end()&&count < 6;++pos)
|
|
{
|
|
QByteArray snippetByte = QByteArray::fromStdString(data);
|
|
QString snippet = "..."+QString(snippetByte.left(*pos)).right(size +totalSize) + QString(snippetByte.mid(*pos,-1)).left(size+totalSize) + "...";
|
|
// qDebug()<<snippet;
|
|
snippets.append(snippet);
|
|
++count;
|
|
}
|
|
m_mutex3.lock();
|
|
if(uniqueSymbol == FileSearcher::uniqueSymbol3)
|
|
{
|
|
|
|
m_search_result_content->enqueue(qMakePair(path,snippets));
|
|
m_mutex3.unlock();
|
|
}
|
|
else
|
|
{
|
|
m_mutex3.unlock();
|
|
return -1;
|
|
}
|
|
// searchResult.insert(path,snippets);
|
|
qDebug()<< "path="<< path << ",weight=" <<docScoreWeight << ",percent=" << docScorePercent;
|
|
}
|
|
// if(!pathTobeDelete->isEmpty())
|
|
// deleteAllIndex(pathTobeDelete)
|
|
return 0;
|
|
}
|
|
|
|
bool FileSearcher::isBlocked(QString &path)
|
|
{
|
|
QStringList blockList = GlobalSettings::getInstance()->getBlockDirs();
|
|
for(QString i : blockList)
|
|
{
|
|
if(path.startsWith(i.prepend("/")))
|
|
return true;
|
|
}
|
|
return false;
|
|
|
|
}
|