mirror of
https://github.com/Kunzisoft/KeePassDX.git
synced 2025-12-04 15:49:33 +01:00
102 lines
3.1 KiB
Java
102 lines
3.1 KiB
Java
/*
|
|
* Copyright 2018 Jeremy Jamet / Kunzisoft.
|
|
*
|
|
* This file is part of KeePass DX.
|
|
*
|
|
* KeePass DX 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.
|
|
*
|
|
* KeePass DX 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 KeePass DX. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
*/
|
|
package com.kunzisoft.keepass.database;
|
|
|
|
import com.kunzisoft.keepass.utils.StrUtil;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.Collections;
|
|
import java.util.Comparator;
|
|
import java.util.List;
|
|
|
|
public class EntrySearchV4 {
|
|
|
|
private PwGroupV4 root;
|
|
|
|
public EntrySearchV4(PwGroupV4 root) {
|
|
this.root = root;
|
|
}
|
|
|
|
public void searchEntries(SearchParameters sp, List<PwEntryV4> listStorage) {
|
|
if (sp == null) { return; }
|
|
if (listStorage == null) { return; }
|
|
|
|
List<String> terms = StrUtil.splitSearchTerms(sp.searchString);
|
|
if (terms.size() <= 1 || sp.regularExpression) {
|
|
searchEntriesSingle(sp, listStorage);
|
|
return;
|
|
}
|
|
|
|
// Search longest term first
|
|
Comparator<String> stringLengthComparator = (lhs, rhs) -> lhs.length() - rhs.length();
|
|
Collections.sort(terms, stringLengthComparator);
|
|
|
|
String fullSearch = sp.searchString;
|
|
List<PwEntryV4> pg = root.getChildEntries();
|
|
for (int i = 0; i < terms.size(); i ++) {
|
|
List<PwEntryV4> pgNew = new ArrayList<>();
|
|
|
|
sp.searchString = terms.get(i);
|
|
|
|
boolean negate = false;
|
|
if (sp.searchString.startsWith("-")) {
|
|
sp.searchString = sp.searchString.substring(1);
|
|
negate = sp.searchString.length() > 0;
|
|
}
|
|
|
|
if (!searchEntriesSingle(sp, pgNew)) {
|
|
pg = null;
|
|
break;
|
|
}
|
|
|
|
List<PwEntryV4> complement = new ArrayList<>();
|
|
if (negate) {
|
|
for (PwEntryV4 entry: pg) {
|
|
if (!pgNew.contains(entry)) {
|
|
complement.add(entry);
|
|
}
|
|
}
|
|
pg = complement;
|
|
}
|
|
else {
|
|
pg = pgNew;
|
|
}
|
|
}
|
|
|
|
if (pg != null) {
|
|
listStorage.addAll(pg);
|
|
}
|
|
sp.searchString = fullSearch;
|
|
|
|
}
|
|
|
|
private boolean searchEntriesSingle(SearchParameters spIn, List<PwEntryV4> listStorage) {
|
|
SearchParameters sp = (SearchParameters) spIn.clone();
|
|
EntryHandler<PwEntryV4> eh;
|
|
if (sp.searchString.length() <= 0) {
|
|
eh = new EntrySearchHandlerAll<>(sp, listStorage);
|
|
} else {
|
|
eh = new EntrySearchHandlerV4(sp, listStorage);
|
|
}
|
|
return root.preOrderTraverseTree(null, eh);
|
|
}
|
|
|
|
}
|