Searched refs:FindClosest (Results 1 - 11 of 11) sorted by path

/haiku/headers/private/kernel/util/
H A DAVLTreeMap.h365 if (AVLTreeNode* node = fTree.FindClosest(&key, less))
H A DSplayTree.h226 Node* FindClosest(const Key& key, bool greater, bool orEqual) function in class:SplayTree
566 Node* FindClosest(const Key& key, bool greater, bool orEqual) function in class:IteratableSplayTree
568 return fTree.FindClosest(key, greater, orEqual);
593 return Iterator(this, fTree.FindClosest(key, greater, orEqual));
598 return ConstIterator(this, FindClosest(key, greater, orEqual));
H A DAVLTree.h62 Value* FindClosest(const Key& key, bool less) const;
345 AVLTree<Definition>::FindClosest(const Key& key, bool less) const function in class:AVLTree
347 if (AVLTreeNode* node = fTree.FindClosest(&key, less))
H A DAVLTreeBase.h61 AVLTreeNode* FindClosest(const void* key, bool less) const;
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DAttributeIndex.cpp177 return index->fNodes->FindClosest(value, false);
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DExtentAllocator.cpp110 CachedExtent* node = FindClosest(lowerBound, false);
/haiku/src/system/boot/loader/
H A Dheap.cpp472 FreeChunk* chunk = sFreeChunkTree.FindClosest(FreeChunkKey(size), true,
/haiku/src/system/kernel/util/
H A DAVLTreeBase.cpp163 AVLTreeBase::FindClosest(const void* key, bool less) const function in class:AVLTreeBase
/haiku/src/system/kernel/vm/
H A DVMKernelAddressSpace.cpp165 Range* range = fRangeTree.FindClosest(address, true);
178 Range* range = fRangeTree.FindClosest(address, less);
434 Range* range = fRangeTree.FindClosest(address, false);
547 Range* insertBeforeRange = fRangeTree.FindClosest(range->base, true);
712 Range* range = fRangeTree.FindClosest(start, true);
763 Range* range = fRangeTree.FindClosest(start, true);
789 Range* range = fRangeTree.FindClosest(start, true);
H A DVMUserAddressSpace.cpp138 VMUserArea* area = fAreas.FindClosest(address, true);
150 VMUserArea* area = fAreas.FindClosest(address, less);
355 VMUserArea* area = fAreas.FindClosest(address, false);
451 VMUserArea* reserved = fAreas.FindClosest(start, true);
568 VMUserArea* next = fAreas.FindClosest(start + size, false);
570 ? fAreas.Previous(next) : fAreas.FindClosest(start + size, true);
/haiku/src/system/runtime_loader/
H A Dheap.cpp345 FreeChunk* chunk = sFreeChunkTree.FindClosest(key, true, true);
351 chunk = sFreeChunkTree.FindClosest(key, true, true);

Completed in 88 milliseconds