mirror of
https://github.com/lucaspalomodevelop/meshlab.git
synced 2026-03-16 01:24:36 +00:00
131 lines
3.2 KiB
C++
131 lines
3.2 KiB
C++
#include "searcher.h"
|
|
#include "mlexception.h"
|
|
|
|
WordActionsMap::WordActionsMap()
|
|
:wordacts()
|
|
{
|
|
|
|
}
|
|
|
|
void WordActionsMap::addWordsPerAction(QAction& act,const QStringList& words)
|
|
{
|
|
foreach(QString word,words)
|
|
wordacts[word].push_back(&act);
|
|
}
|
|
|
|
void WordActionsMap::removeActionReferences(QAction& act )
|
|
{
|
|
for(QMap<QString,QList<QAction*> >::iterator it = wordacts.begin();it != wordacts.end();++it)
|
|
it.value().removeAll(&act);
|
|
}
|
|
|
|
bool WordActionsMap::getActionsPerWord( const QString& word,QList<QAction*>& res ) const
|
|
{
|
|
QMap< QString,QList<QAction*> >::const_iterator it = wordacts.find(word);
|
|
if (it != wordacts.end())
|
|
{
|
|
res = it.value();
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
WordActionsMapAccessor::WordActionsMapAccessor()
|
|
:map(),sepexp(),ignexp()
|
|
{
|
|
sepexp.setPattern("\\W+");
|
|
ignexp.setPattern("\\b(an|the|of|it|as|in|by|and|or|for)\\b|\\b[a-z]\\b|'s\\b|\\.|<[^>]*>");
|
|
}
|
|
|
|
void WordActionsMapAccessor::addWordsPerAction(QAction& act,const QString& st )
|
|
{
|
|
QStringList wlist;
|
|
purifiedSplit(st,wlist);
|
|
addSubStrings(wlist);
|
|
map.addWordsPerAction(act,wlist);
|
|
}
|
|
|
|
int WordActionsMapAccessor::rankedMatchesPerInputString( const QString& input,RankedMatches& rm ) const
|
|
{
|
|
QStringList inputlist;
|
|
purifiedSplit(input,inputlist);
|
|
return rm.computeRankedMatches(inputlist,map);
|
|
}
|
|
|
|
void WordActionsMapAccessor::purifiedSplit( const QString& input,QStringList& res ) const
|
|
{
|
|
res.clear();
|
|
QString tmp = input;
|
|
tmp = tmp.toLower();
|
|
tmp.remove(ignexp);
|
|
res = tmp.split(sepexp,QString::SkipEmptyParts);
|
|
res.removeDuplicates();
|
|
}
|
|
|
|
void WordActionsMapAccessor::addSubStrings( QStringList& res ) const
|
|
{
|
|
QStringList resWithPrefix;
|
|
foreach(QString str, res)
|
|
{
|
|
QString strPref = str;
|
|
resWithPrefix.push_back(strPref);
|
|
for(int i=0;i<str.length()-3;++i)
|
|
{
|
|
strPref.chop(1);
|
|
resWithPrefix.push_back(strPref);
|
|
}
|
|
}
|
|
resWithPrefix.removeDuplicates();
|
|
res = resWithPrefix;
|
|
}
|
|
|
|
RankedMatches::RankedMatches()
|
|
:wordmatchesperaction(),ranking()
|
|
{
|
|
}
|
|
|
|
int RankedMatches::computeRankedMatches( const QStringList& inputst,const WordActionsMap& map )
|
|
{
|
|
wordmatchesperaction.clear();
|
|
ranking.clear();
|
|
ranking.resize(inputst.size());
|
|
foreach(const QString& st,inputst)
|
|
{
|
|
QList<QAction*> res;
|
|
bool found = map.getActionsPerWord(st,res);
|
|
if (found)
|
|
{
|
|
foreach(QAction* act,res)
|
|
++wordmatchesperaction[act];
|
|
}
|
|
}
|
|
int maxindex = -1;
|
|
for(QMap<QAction*,int>::iterator it = wordmatchesperaction.begin();it != wordmatchesperaction.end();++it)
|
|
{
|
|
int index = it.value() - 1;
|
|
if (index >= ranking.size())
|
|
{
|
|
throw InvalidInvariantException("WARNING! Index contained in wordmatchesperaction it's out-of-bound.");
|
|
return 0;
|
|
}
|
|
if (index > maxindex)
|
|
maxindex = index;
|
|
ranking[index].push_back(it.key());
|
|
}
|
|
return maxindex + 1;
|
|
}
|
|
|
|
void RankedMatches::getActionsWithNMatches( const int n,QList<QAction*>& res )
|
|
{
|
|
res.clear();
|
|
int index = n -1;
|
|
if ((index >= ranking.size()) || (n < 1))
|
|
{
|
|
throw InvalidInvariantException(QString("WARNING! Parameter n MUST be in the range [1..") + QString::number(ranking.size()) + "].");
|
|
return;
|
|
}
|
|
res = ranking[index];
|
|
}
|
|
|
|
|