i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

GenericIndexIterator::SetTo(): Find fuzzily

Browse Source 
Use TwoKeyAVLTree::FindFirstClosest() instead of FindFirst(), so, if the
value isn't in the index, we find the closest greater value. That's the
semantics Index::InternalFind() is expected to have.
This commit is contained in:
Ingo Weinhold
2011-11-25 06:19:17 +01:00
parent abaf82e5a9
commit 84989de15b
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/add-ons/kernel/file_systems/packagefs/IndexImpl.h
+4 -2
View File
@@ -148,10 +148,12 @@ GenericIndexIterator<Policy>::SetTo(Index* index, const Value& value,
return false; return false;
typename NodeTree::Iterator iterator; typename NodeTree::Iterator iterator;
if (ignoreValue) if (ignoreValue) {
Policy::GetNodeTree(fIndex)->GetIterator(&iterator); Policy::GetNodeTree(fIndex)->GetIterator(&iterator);
else if (Policy::GetNodeTree(fIndex)->FindFirst(value, &iterator) == NULL) } else if (Policy::GetNodeTree(fIndex)->FindFirstClosest(value, false,
&iterator) == NULL) {
return false; return false;
}
fNextTreeNode = iterator.CurrentNode(); fNextTreeNode = iterator.CurrentNode();
return fNextTreeNode != NULL; return fNextTreeNode != NULL;