tris/recoll
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fixed tabs/indents

Browse Source
This commit is contained in:
Jean-Francois Dockes 2020-05-19 19:19:43 +02:00
parent 5f76c2527d
commit 1865f1ff63
1 changed files with 208 additions and 208 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

416
src/qtgui/advsearch_w.cpp
View File

@ -52,29 +52,29 @@ void AdvSearch::init()
{ {
(void)new HelpClient(this); (void)new HelpClient(this);
HelpClient::installMap((const char *)objectName().toUtf8(), HelpClient::installMap((const char *)objectName().toUtf8(),
"RCL.SEARCH.GUI.COMPLEX"); "RCL.SEARCH.GUI.COMPLEX");
// signals and slots connections // signals and slots connections
connect(delFiltypPB, SIGNAL(clicked()), this, SLOT(delFiltypPB_clicked())); connect(delFiltypPB, SIGNAL(clicked()), this, SLOT(delFiltypPB_clicked()));
connect(searchPB, SIGNAL(clicked()), this, SLOT(runSearch())); connect(searchPB, SIGNAL(clicked()), this, SLOT(runSearch()));
connect(filterDatesCB, SIGNAL(toggled(bool)), connect(filterDatesCB, SIGNAL(toggled(bool)),
this, SLOT(filterDatesCB_toggled(bool))); this, SLOT(filterDatesCB_toggled(bool)));
connect(filterSizesCB, SIGNAL(toggled(bool)), connect(filterSizesCB, SIGNAL(toggled(bool)),
this, SLOT(filterSizesCB_toggled(bool))); this, SLOT(filterSizesCB_toggled(bool)));
connect(restrictFtCB, SIGNAL(toggled(bool)), connect(restrictFtCB, SIGNAL(toggled(bool)),
this, SLOT(restrictFtCB_toggled(bool))); this, SLOT(restrictFtCB_toggled(bool)));
connect(restrictCtCB, SIGNAL(toggled(bool)), connect(restrictCtCB, SIGNAL(toggled(bool)),
this, SLOT(restrictCtCB_toggled(bool))); this, SLOT(restrictCtCB_toggled(bool)));
connect(dismissPB, SIGNAL(clicked()), this, SLOT(close())); connect(dismissPB, SIGNAL(clicked()), this, SLOT(close()));
connect(browsePB, SIGNAL(clicked()), this, SLOT(browsePB_clicked())); connect(browsePB, SIGNAL(clicked()), this, SLOT(browsePB_clicked()));
connect(addFiltypPB, SIGNAL(clicked()), this, SLOT(addFiltypPB_clicked())); connect(addFiltypPB, SIGNAL(clicked()), this, SLOT(addFiltypPB_clicked()));
connect(delAFiltypPB, SIGNAL(clicked()), connect(delAFiltypPB, SIGNAL(clicked()),
this, SLOT(delAFiltypPB_clicked())); this, SLOT(delAFiltypPB_clicked()));
connect(addAFiltypPB, SIGNAL(clicked()), connect(addAFiltypPB, SIGNAL(clicked()),
this, SLOT(addAFiltypPB_clicked())); this, SLOT(addAFiltypPB_clicked()));
connect(saveFileTypesPB, SIGNAL(clicked()), connect(saveFileTypesPB, SIGNAL(clicked()),
this, SLOT(saveFileTypes())); this, SLOT(saveFileTypes()));
connect(addClausePB, SIGNAL(clicked()), this, SLOT(addClause())); connect(addClausePB, SIGNAL(clicked()), this, SLOT(addClause()));
connect(delClausePB, SIGNAL(clicked()), this, SLOT(delClause())); connect(delClausePB, SIGNAL(clicked()), this, SLOT(delClause()));
@ -86,31 +86,31 @@ void AdvSearch::init()
// Create preconfigured clauses // Create preconfigured clauses
for (unsigned int i = 0; i < iclausescnt; i++) { for (unsigned int i = 0; i < iclausescnt; i++) {
addClause(initclausetypes[i], false); addClause(initclausetypes[i], false);
} }
// Tune initial state according to last saved // Tune initial state according to last saved
{ {
vector<SearchClauseW *>::iterator cit = m_clauseWins.begin(); vector<SearchClauseW *>::iterator cit = m_clauseWins.begin();
unsigned int existing = m_clauseWins.size(); unsigned int existing = m_clauseWins.size();
for (unsigned int i = 0; i < prefs.advSearchClauses.size(); i++) { for (unsigned int i = 0; i < prefs.advSearchClauses.size(); i++) {
if (i < existing) { if (i < existing) {
(*cit)->tpChange(prefs.advSearchClauses[i]); (*cit)->tpChange(prefs.advSearchClauses[i]);
cit++; cit++;
} else { } else {
addClause(prefs.advSearchClauses[i], false); addClause(prefs.advSearchClauses[i], false);
} }
} }
} }
(*m_clauseWins.begin())->wordsLE->setFocus(); (*m_clauseWins.begin())->wordsLE->setFocus();
// Initialize min/max mtime from extrem values in the index // Initialize min/max mtime from extrem values in the index
int minyear, maxyear; int minyear, maxyear;
if (rcldb) { if (rcldb) {
rcldb->maxYearSpan(&minyear, &maxyear); rcldb->maxYearSpan(&minyear, &maxyear);
minDateDTE->setDisplayFormat("yyyy-MM-dd"); minDateDTE->setDisplayFormat("yyyy-MM-dd");
maxDateDTE->setDisplayFormat("yyyy-MM-dd"); maxDateDTE->setDisplayFormat("yyyy-MM-dd");
minDateDTE->setDate(QDate(minyear, 1, 1)); minDateDTE->setDate(QDate(minyear, 1, 1));
maxDateDTE->setDate(QDate(maxyear, 12, 31)); maxDateDTE->setDate(QDate(maxyear, 12, 31));
} }
// Initialize lists of accepted and ignored mime types from config // Initialize lists of accepted and ignored mime types from config
@ -159,7 +159,7 @@ void AdvSearch::saveCnf()
// Save my state // Save my state
prefs.advSearchClauses.clear(); prefs.advSearchClauses.clear();
for (const auto& clause : m_clauseWins) { for (const auto& clause : m_clauseWins) {
prefs.advSearchClauses.push_back(clause->sTpCMB->currentIndex()); prefs.advSearchClauses.push_back(clause->sTpCMB->currentIndex());
} }
} }
@ -176,9 +176,9 @@ void AdvSearch::addClause(int tp, bool updsaved)
w->show(); w->show();
w->tpChange(tp); w->tpChange(tp);
if (m_clauseWins.size() > iclausescnt) { if (m_clauseWins.size() > iclausescnt) {
delClausePB->setEnabled(true); delClausePB->setEnabled(true);
} else { } else {
delClausePB->setEnabled(false); delClausePB->setEnabled(false);
} }
if (updsaved) { if (updsaved) {
saveCnf(); saveCnf();
@ -188,13 +188,13 @@ void AdvSearch::addClause(int tp, bool updsaved)
void AdvSearch::delClause(bool updsaved) void AdvSearch::delClause(bool updsaved)
{ {
if (m_clauseWins.size() <= iclausescnt) if (m_clauseWins.size() <= iclausescnt)
return; return;
delete m_clauseWins.back(); delete m_clauseWins.back();
m_clauseWins.pop_back(); m_clauseWins.pop_back();
if (m_clauseWins.size() > iclausescnt) { if (m_clauseWins.size() > iclausescnt) {
delClausePB->setEnabled(true); delClausePB->setEnabled(true);
} else { } else {
delClausePB->setEnabled(false); delClausePB->setEnabled(false);
} }
if (updsaved) { if (updsaved) {
saveCnf(); saveCnf();
@ -212,10 +212,10 @@ void AdvSearch::delFiltypPB_clicked()
{ {
QList<QListWidgetItem *> items = yesFiltypsLB->selectedItems(); QList<QListWidgetItem *> items = yesFiltypsLB->selectedItems();
for (QList<QListWidgetItem *>::iterator it = items.begin(); for (QList<QListWidgetItem *>::iterator it = items.begin();
it != items.end(); it++) { it != items.end(); it++) {
int row = yesFiltypsLB->row(*it); int row = yesFiltypsLB->row(*it);
QListWidgetItem *item = yesFiltypsLB->takeItem(row); QListWidgetItem *item = yesFiltypsLB->takeItem(row);
noFiltypsLB->insertItem(0, item); noFiltypsLB->insertItem(0, item);
} }
guiListsToIgnTypes(); guiListsToIgnTypes();
} }
@ -225,13 +225,13 @@ void AdvSearch::addFiltypPB_clicked()
{ {
QList<QListWidgetItem *> items = noFiltypsLB->selectedItems(); QList<QListWidgetItem *> items = noFiltypsLB->selectedItems();
for (QList<QListWidgetItem *>::iterator it = items.begin(); for (QList<QListWidgetItem *>::iterator it = items.begin();
it != items.end(); it++) { it != items.end(); it++) {
int row = noFiltypsLB->row(*it); int row = noFiltypsLB->row(*it);
QListWidgetItem *item = noFiltypsLB->takeItem(row); QListWidgetItem *item = noFiltypsLB->takeItem(row);
yesFiltypsLB->insertItem(0, item); yesFiltypsLB->insertItem(0, item);
} }
guiListsToIgnTypes(); guiListsToIgnTypes();
} }
// Compute list of ignored mime type from widget lists // Compute list of ignored mime type from widget lists
void AdvSearch::guiListsToIgnTypes() void AdvSearch::guiListsToIgnTypes()
@ -240,8 +240,8 @@ void AdvSearch::guiListsToIgnTypes()
noFiltypsLB->sortItems(); noFiltypsLB->sortItems();
m_ignTypes.clear(); m_ignTypes.clear();
for (int i = 0; i < noFiltypsLB->count();i++) { for (int i = 0; i < noFiltypsLB->count();i++) {
QListWidgetItem *item = noFiltypsLB->item(i); QListWidgetItem *item = noFiltypsLB->item(i);
m_ignTypes.append(item->text()); m_ignTypes.append(item->text());
} }
} }
void AdvSearch::addAFiltypPB_clicked() void AdvSearch::addAFiltypPB_clicked()
@ -281,7 +281,7 @@ void AdvSearch::restrictCtCB_toggled(bool on)
m_ignByCats = on; m_ignByCats = on;
// Only reset the list if we're enabled. Else this is init from prefs // Only reset the list if we're enabled. Else this is init from prefs
if (restrictCtCB->isEnabled()) if (restrictCtCB->isEnabled())
m_ignTypes.clear(); m_ignTypes.clear();
fillFileTypes(); fillFileTypes();
} }
@ -293,32 +293,32 @@ void AdvSearch::fillFileTypes()
QStringList ql; QStringList ql;
if (m_ignByCats == false) { if (m_ignByCats == false) {
vector<string> types = theconfig->getAllMimeTypes(); vector<string> types = theconfig->getAllMimeTypes();
rcldb->getAllDbMimeTypes(types); rcldb->getAllDbMimeTypes(types);
sort(types.begin(), types.end()); sort(types.begin(), types.end());
types.erase(unique(types.begin(), types.end()), types.end()); types.erase(unique(types.begin(), types.end()), types.end());
for (vector<string>::iterator it = types.begin(); for (vector<string>::iterator it = types.begin();
it != types.end(); it++) { it != types.end(); it++) {
QString qs = QString::fromUtf8(it->c_str()); QString qs = QString::fromUtf8(it->c_str());
if (m_ignTypes.indexOf(qs) < 0) if (m_ignTypes.indexOf(qs) < 0)
ql.append(qs); ql.append(qs);
} }
} else { } else {
vector<string> cats; vector<string> cats;
theconfig->getMimeCategories(cats); theconfig->getMimeCategories(cats);
for (vector<string>::const_iterator it = cats.begin(); for (vector<string>::const_iterator it = cats.begin();
it != cats.end(); it++) { it != cats.end(); it++) {
map<QString, QString>::const_iterator it1; map<QString, QString>::const_iterator it1;
QString cat; QString cat;
if ((it1 = cat_translations.find(QString::fromUtf8(it->c_str()))) if ((it1 = cat_translations.find(QString::fromUtf8(it->c_str())))
!= cat_translations.end()) { != cat_translations.end()) {
cat = it1->second; cat = it1->second;
} else { } else {
cat = QString::fromUtf8(it->c_str()); cat = QString::fromUtf8(it->c_str());
} }
if (m_ignTypes.indexOf(cat) < 0) if (m_ignTypes.indexOf(cat) < 0)
ql.append(cat); ql.append(cat);
} }
} }
yesFiltypsLB->insertItems(0, ql); yesFiltypsLB->insertItems(0, ql);
} }
@ -355,21 +355,21 @@ size_t AdvSearch::stringToSize(QString qsize)
size_t size = size_t(-1); size_t size = size_t(-1);
qsize.replace(QRegExp("[\\s]+"), ""); qsize.replace(QRegExp("[\\s]+"), "");
if (!qsize.isEmpty()) { if (!qsize.isEmpty()) {
string csize(qs2utf8s(qsize)); string csize(qs2utf8s(qsize));
char *cp; char *cp;
size = strtoll(csize.c_str(), &cp, 10); size = strtoll(csize.c_str(), &cp, 10);
if (*cp != 0) { if (*cp != 0) {
switch (*cp) { switch (*cp) {
case 'k': case 'K': size *= 1E3;break; case 'k': case 'K': size *= 1E3;break;
case 'm': case 'M': size *= 1E6;break; case 'm': case 'M': size *= 1E6;break;
case 'g': case 'G': size *= 1E9;break; case 'g': case 'G': size *= 1E9;break;
case 't': case 'T': size *= 1E12;break; case 't': case 'T': size *= 1E12;break;
default: default:
QMessageBox::warning(0, "Recoll", QMessageBox::warning(0, "Recoll",
tr("Bad multiplier suffix in size filter")); tr("Bad multiplier suffix in size filter"));
size = size_t(-1); size = size_t(-1);
} }
} }
} }
return size; return size;
} }
@ -379,65 +379,65 @@ void AdvSearch::runSearch()
{ {
string stemLang = prefs.stemlang(); string stemLang = prefs.stemlang();
std::shared_ptr<SearchData> sdata(new SearchData(conjunctCMB->currentIndex() == 0 ? std::shared_ptr<SearchData> sdata(new SearchData(conjunctCMB->currentIndex() == 0 ?
SCLT_AND : SCLT_OR, stemLang)); SCLT_AND : SCLT_OR, stemLang));
bool hasclause = false; bool hasclause = false;
for (vector<SearchClauseW*>::iterator it = m_clauseWins.begin(); for (vector<SearchClauseW*>::iterator it = m_clauseWins.begin();
it != m_clauseWins.end(); it++) { it != m_clauseWins.end(); it++) {
SearchDataClause *cl; SearchDataClause *cl;
if ((cl = (*it)->getClause())) { if ((cl = (*it)->getClause())) {
sdata->addClause(cl); sdata->addClause(cl);
hasclause = true; hasclause = true;
} }
} }
if (!hasclause) if (!hasclause)
return; return;
if (restrictFtCB->isChecked() && noFiltypsLB->count() > 0) { if (restrictFtCB->isChecked() && noFiltypsLB->count() > 0) {
for (int i = 0; i < yesFiltypsLB->count(); i++) { for (int i = 0; i < yesFiltypsLB->count(); i++) {
if (restrictCtCB->isChecked()) { if (restrictCtCB->isChecked()) {
QString qcat = yesFiltypsLB->item(i)->text(); QString qcat = yesFiltypsLB->item(i)->text();
map<QString,QString>::const_iterator qit; map<QString,QString>::const_iterator qit;
string cat; string cat;
if ((qit = cat_rtranslations.find(qcat)) != if ((qit = cat_rtranslations.find(qcat)) !=
cat_rtranslations.end()) { cat_rtranslations.end()) {
cat = qs2utf8s(qit->second); cat = qs2utf8s(qit->second);
} else { } else {
cat = qs2utf8s(qcat); cat = qs2utf8s(qcat);
} }
vector<string> types; vector<string> types;
theconfig->getMimeCatTypes(cat, types); theconfig->getMimeCatTypes(cat, types);
for (vector<string>::const_iterator it = types.begin(); for (vector<string>::const_iterator it = types.begin();
it != types.end(); it++) { it != types.end(); it++) {
sdata->addFiletype(*it); sdata->addFiletype(*it);
} }
} else { } else {
sdata->addFiletype(qs2utf8s(yesFiltypsLB->item(i)->text())); sdata->addFiletype(qs2utf8s(yesFiltypsLB->item(i)->text()));
} }
} }
} }
if (filterDatesCB->isChecked()) { if (filterDatesCB->isChecked()) {
QDate mindate = minDateDTE->date(); QDate mindate = minDateDTE->date();
QDate maxdate = maxDateDTE->date(); QDate maxdate = maxDateDTE->date();
DateInterval di; DateInterval di;
di.y1 = mindate.year(); di.y1 = mindate.year();
di.m1 = mindate.month(); di.m1 = mindate.month();
di.d1 = mindate.day(); di.d1 = mindate.day();
di.y2 = maxdate.year(); di.y2 = maxdate.year();
di.m2 = maxdate.month(); di.m2 = maxdate.month();
di.d2 = maxdate.day(); di.d2 = maxdate.day();
sdata->setDateSpan(&di); sdata->setDateSpan(&di);
} }
if (filterSizesCB->isChecked()) { if (filterSizesCB->isChecked()) {
size_t size = stringToSize(minSizeLE->text()); size_t size = stringToSize(minSizeLE->text());
sdata->setMinSize(size); sdata->setMinSize(size);
size = stringToSize(maxSizeLE->text()); size = stringToSize(maxSizeLE->text());
sdata->setMaxSize(size); sdata->setMaxSize(size);
} }
if (!subtreeCMB->currentText().isEmpty()) { if (!subtreeCMB->currentText().isEmpty()) {
QString current = subtreeCMB->currentText(); QString current = subtreeCMB->currentText();
Rcl::SearchDataClausePath *pathclause = new Rcl::SearchDataClausePath( Rcl::SearchDataClausePath *pathclause = new Rcl::SearchDataClausePath(
qs2path(current), direxclCB->isChecked()); qs2path(current), direxclCB->isChecked());
@ -451,25 +451,25 @@ void AdvSearch::runSearch()
sdata = nsdata; sdata = nsdata;
} }
// Keep history clean and sorted. Maybe there would be a // Keep history clean and sorted. Maybe there would be a
// simpler way to do this // simpler way to do this
list<QString> entries; list<QString> entries;
for (int i = 0; i < subtreeCMB->count(); i++) { for (int i = 0; i < subtreeCMB->count(); i++) {
entries.push_back(subtreeCMB->itemText(i)); entries.push_back(subtreeCMB->itemText(i));
} }
entries.push_back(subtreeCMB->currentText()); entries.push_back(subtreeCMB->currentText());
entries.sort(); entries.sort();
entries.unique(); entries.unique();
LOGDEB("Subtree list now has " << (entries.size()) << " entries\n" ); LOGDEB("Subtree list now has " << (entries.size()) << " entries\n" );
subtreeCMB->clear(); subtreeCMB->clear();
for (list<QString>::iterator it = entries.begin(); for (list<QString>::iterator it = entries.begin();
it != entries.end(); it++) { it != entries.end(); it++) {
subtreeCMB->addItem(*it); subtreeCMB->addItem(*it);
} }
subtreeCMB->setCurrentIndex(subtreeCMB->findText(current)); subtreeCMB->setCurrentIndex(subtreeCMB->findText(current));
prefs.asearchSubdirHist.clear(); prefs.asearchSubdirHist.clear();
for (int index = 0; index < subtreeCMB->count(); index++) for (int index = 0; index < subtreeCMB->count(); index++)
prefs.asearchSubdirHist.push_back(subtreeCMB->itemText(index)); prefs.asearchSubdirHist.push_back(subtreeCMB->itemText(index));
} }
saveCnf(); saveCnf();
g_advshistory && g_advshistory->push(sdata); g_advshistory && g_advshistory->push(sdata);
@ -483,114 +483,114 @@ void AdvSearch::runSearch()
void AdvSearch::fromSearch(std::shared_ptr<SearchData> sdata) void AdvSearch::fromSearch(std::shared_ptr<SearchData> sdata)
{ {
if (sdata->m_tp == SCLT_OR) if (sdata->m_tp == SCLT_OR)
conjunctCMB->setCurrentIndex(1); conjunctCMB->setCurrentIndex(1);
else else
conjunctCMB->setCurrentIndex(0); conjunctCMB->setCurrentIndex(0);
while (sdata->m_query.size() > m_clauseWins.size()) { while (sdata->m_query.size() > m_clauseWins.size()) {
addClause(); addClause();
} }
subtreeCMB->setEditText(""); subtreeCMB->setEditText("");
direxclCB->setChecked(0); direxclCB->setChecked(0);
for (unsigned int i = 0; i < sdata->m_query.size(); i++) { for (unsigned int i = 0; i < sdata->m_query.size(); i++) {
// Set fields from clause // Set fields from clause
if (sdata->m_query[i]->getTp() == SCLT_SUB) { if (sdata->m_query[i]->getTp() == SCLT_SUB) {
LOGERR("AdvSearch::fromSearch: SUB clause found !\n" ); LOGERR("AdvSearch::fromSearch: SUB clause found !\n" );
continue; continue;
} }
if (sdata->m_query[i]->getTp() == SCLT_PATH) { if (sdata->m_query[i]->getTp() == SCLT_PATH) {
SearchDataClausePath *cs = SearchDataClausePath *cs =
dynamic_cast<SearchDataClausePath*>(sdata->m_query[i]); dynamic_cast<SearchDataClausePath*>(sdata->m_query[i]);
// We can only use one such clause. There should be only one too // We can only use one such clause. There should be only one too
// if this is sfrom aved search data. // if this is sfrom aved search data.
QString qdir = path2qs(cs->gettext()); QString qdir = path2qs(cs->gettext());
subtreeCMB->setEditText(qdir); subtreeCMB->setEditText(qdir);
direxclCB->setChecked(cs->getexclude()); direxclCB->setChecked(cs->getexclude());
continue; continue;
} }
SearchDataClauseSimple *cs = SearchDataClauseSimple *cs =
dynamic_cast<SearchDataClauseSimple*>(sdata->m_query[i]); dynamic_cast<SearchDataClauseSimple*>(sdata->m_query[i]);
m_clauseWins[i]->setFromClause(cs); m_clauseWins[i]->setFromClause(cs);
} }
for (unsigned int i = sdata->m_query.size(); i < m_clauseWins.size(); i++) { for (unsigned int i = sdata->m_query.size(); i < m_clauseWins.size(); i++) {
m_clauseWins[i]->clear(); m_clauseWins[i]->clear();
} }
restrictCtCB->setChecked(0); restrictCtCB->setChecked(0);
if (!sdata->m_filetypes.empty()) { if (!sdata->m_filetypes.empty()) {
restrictFtCB_toggled(1); restrictFtCB_toggled(1);
delAFiltypPB_clicked(); delAFiltypPB_clicked();
for (unsigned int i = 0; i < sdata->m_filetypes.size(); i++) { for (unsigned int i = 0; i < sdata->m_filetypes.size(); i++) {
QString ft = QString::fromUtf8(sdata->m_filetypes[i].c_str()); QString ft = QString::fromUtf8(sdata->m_filetypes[i].c_str());
QList<QListWidgetItem *> lst = QList<QListWidgetItem *> lst =
noFiltypsLB->findItems(ft, Qt::MatchExactly); noFiltypsLB->findItems(ft, Qt::MatchExactly);
if (!lst.isEmpty()) { if (!lst.isEmpty()) {
int row = noFiltypsLB->row(lst[0]); int row = noFiltypsLB->row(lst[0]);
QListWidgetItem *item = noFiltypsLB->takeItem(row); QListWidgetItem *item = noFiltypsLB->takeItem(row);
yesFiltypsLB->insertItem(0, item); yesFiltypsLB->insertItem(0, item);
} }
} }
yesFiltypsLB->sortItems(); yesFiltypsLB->sortItems();
} else { } else {
addAFiltypPB_clicked(); addAFiltypPB_clicked();
restrictFtCB_toggled(0); restrictFtCB_toggled(0);
} }
if (sdata->m_haveDates) { if (sdata->m_haveDates) {
filterDatesCB->setChecked(1); filterDatesCB->setChecked(1);
DateInterval &di(sdata->m_dates); DateInterval &di(sdata->m_dates);
QDate mindate(di.y1, di.m1, di.d1); QDate mindate(di.y1, di.m1, di.d1);
QDate maxdate(di.y2, di.m2, di.d2); QDate maxdate(di.y2, di.m2, di.d2);
minDateDTE->setDate(mindate); minDateDTE->setDate(mindate);
maxDateDTE->setDate(maxdate); maxDateDTE->setDate(maxdate);
} else { } else {
filterDatesCB->setChecked(0); filterDatesCB->setChecked(0);
QDate date; QDate date;
minDateDTE->setDate(date); minDateDTE->setDate(date);
maxDateDTE->setDate(date); maxDateDTE->setDate(date);
} }
if (sdata->m_maxSize != -1 || sdata->m_minSize != -1) { if (sdata->m_maxSize != -1 || sdata->m_minSize != -1) {
filterSizesCB->setChecked(1); filterSizesCB->setChecked(1);
QString sz; QString sz;
if (sdata->m_minSize != -1) { if (sdata->m_minSize != -1) {
sz.setNum(sdata->m_minSize); sz.setNum(sdata->m_minSize);
minSizeLE->setText(sz); minSizeLE->setText(sz);
} else { } else {
minSizeLE->setText(""); minSizeLE->setText("");
} }
if (sdata->m_maxSize != -1) { if (sdata->m_maxSize != -1) {
sz.setNum(sdata->m_maxSize); sz.setNum(sdata->m_maxSize);
maxSizeLE->setText(sz); maxSizeLE->setText(sz);
} else { } else {
maxSizeLE->setText(""); maxSizeLE->setText("");
} }
} else { } else {
filterSizesCB->setChecked(0); filterSizesCB->setChecked(0);
minSizeLE->setText(""); minSizeLE->setText("");
maxSizeLE->setText(""); maxSizeLE->setText("");
} }
} }
void AdvSearch::slotHistoryNext() void AdvSearch::slotHistoryNext()
{ {
if (g_advshistory == 0) if (g_advshistory == 0)
return; return;
std::shared_ptr<Rcl::SearchData> sd = g_advshistory->getnewer(); std::shared_ptr<Rcl::SearchData> sd = g_advshistory->getnewer();
if (!sd) if (!sd)
return; return;
fromSearch(sd); fromSearch(sd);
} }
void AdvSearch::slotHistoryPrev() void AdvSearch::slotHistoryPrev()
{ {
if (g_advshistory == 0) if (g_advshistory == 0)
return; return;
std::shared_ptr<Rcl::SearchData> sd = g_advshistory->getolder(); std::shared_ptr<Rcl::SearchData> sd = g_advshistory->getolder();
if (!sd) if (!sd)
return; return;
fromSearch(sd); fromSearch(sd);
} }