|
a/src/qtgui/advsearch_w.cpp |
|
b/src/qtgui/advsearch_w.cpp |
|
... |
|
... |
| 422 |
sdata->setMaxSize(size);
|
422 |
sdata->setMaxSize(size);
|
| 423 |
}
|
423 |
}
|
| 424 |
|
424 |
|
| 425 |
if (!subtreeCMB->currentText().isEmpty()) {
|
425 |
if (!subtreeCMB->currentText().isEmpty()) {
|
| 426 |
QString current = subtreeCMB->currentText();
|
426 |
QString current = subtreeCMB->currentText();
|
|
|
427 |
|
|
|
428 |
Rcl::SearchDataClausePath *pathclause =
|
|
|
429 |
new Rcl::SearchDataClausePath((const char*)current.toLocal8Bit(),
|
|
|
430 |
direxclCB->isChecked());
|
|
|
431 |
if (sdata->getTp() == SCLT_AND) {
|
|
|
432 |
sdata->addClause(pathclause);
|
|
|
433 |
} else {
|
|
|
434 |
STD_SHARED_PTR<SearchData>
|
|
|
435 |
nsdata(new SearchData(SCLT_AND, stemLang));
|
| 427 |
sdata->addClause(new Rcl::SearchDataClausePath(
|
436 |
nsdata->addClause(new Rcl::SearchDataClauseSub(sdata));
|
| 428 |
(const char*)current.toLocal8Bit(),
|
437 |
nsdata->addClause(pathclause);
|
| 429 |
direxclCB->isChecked()));
|
438 |
sdata = nsdata;
|
|
|
439 |
}
|
|
|
440 |
|
| 430 |
// Keep history clean and sorted. Maybe there would be a
|
441 |
// Keep history clean and sorted. Maybe there would be a
|
| 431 |
// simpler way to do this
|
442 |
// simpler way to do this
|
| 432 |
list<QString> entries;
|
443 |
list<QString> entries;
|
| 433 |
for (int i = 0; i < subtreeCMB->count(); i++) {
|
444 |
for (int i = 0; i < subtreeCMB->count(); i++) {
|
| 434 |
entries.push_back(subtreeCMB->itemText(i));
|
445 |
entries.push_back(subtreeCMB->itemText(i));
|