/haiku/headers/private/kernel/util/ |
H A D | VectorSet.h | 72 Iterator FindClose(const Value &value, bool less); 73 ConstIterator FindClose(const Value &value, bool less) const; 344 to it is returned. Otherwise \a less indicates whether an iterator to 347 If \a less is \c true and the first element in the set has a greater 348 value than the specified one, End() is returned. Similarly, when \a less 354 inverts the meaning of \a less, i.e. if \c true, greater values will 360 one according to \a less. 364 _VECTOR_SET_CLASS_NAME::FindClose(const Value &value, bool less) argument 370 // is needed for !less. 371 if (exists || !less) [all...] |
H A D | VectorMap.h | 100 Iterator FindClose(const Key &key, bool less); 101 ConstIterator FindClose(const Key &key, bool less) const; 567 to it is returned. Otherwise \a less indicates whether an iterator to 570 If \a less is \c true and the first entry in the map has a greater 571 key than the specified one, End() is returned. Similarly, when \a less 577 inverts the meaning of \a less, i.e. if \c true, greater values will 583 one according to \a less. 587 _VECTOR_MAP_CLASS_NAME::FindClose(const Key &key, bool less) argument 593 // is needed for !less. 594 if (exists || !less) [all...] |
H A D | AVLTree.h | 62 Value* FindClosest(const Key& key, bool less) const; 345 AVLTree<Definition>::FindClosest(const Key& key, bool less) const 347 if (AVLTreeNode* node = fTree.FindClosest(&key, less))
|
H A D | DoublyLinkedList.h | 367 void Sort(const Less& less); 654 DOUBLY_LINKED_LIST_CLASS_NAME::Sort(const Less& less) argument 662 if (less(element, leastElement))
|
H A D | AVLTreeBase.h | 61 AVLTreeNode* FindClosest(const void* key, bool less) const;
|
H A D | AVLTreeMap.h | 78 Iterator FindClose(const Key& key, bool less); 363 _AVL_TREE_MAP_CLASS_NAME::FindClose(const Key& key, bool less) argument 365 if (AVLTreeNode* node = fTree.FindClosest(&key, less))
|
/haiku/src/preferences/appearance/ |
H A D | FakeScrollBar.cpp | 111 float less = floorf(rect.Width() / 3); local 112 BRect thumbRect(rect.left + less, rect.top, rect.right - less,
|
/haiku/headers/libs/agg/ |
H A D | agg_array.h | 779 // use is when the average reqired size is much less than the block size. 920 void quick_sort(Array& arr, Less less) argument 952 if(less(*e1, *e2)) swap_elements(*e1, *e2); 956 if(less(*e1, *e2)) swap_elements(*e1, *e2); 960 if(less(*e1, *e2)) swap_elements(*e1, *e2); 964 do i++; while( less(arr[i], arr[base]) ); 965 do j--; while( less(arr[base], arr[j]) ); 1000 for(; less(*(e1 = &(arr[j + 1])), *(e2 = &(arr[j]))); j--) 1060 unsigned binary_search_pos(const Array& arr, const Value& val, Less less) argument 1067 if(less(va [all...] |
/haiku/headers/cpp/ |
H A D | function.h | 66 using __STD::less;
|
H A D | stl_multiset.h | 42 template <class _Key, class _Compare = less<_Key>,
|
H A D | stl_queue.h | 115 class _Compare = less<typename _Sequence::value_type> >
|
H A D | stl_set.h | 42 template <class _Key, class _Compare = less<_Key>,
|
H A D | stl_map.h | 42 template <class _Key, class _Tp, class _Compare = less<_Key>,
|
H A D | stl_multimap.h | 42 template <class _Key, class _Tp, class _Compare = less<_Key>,
|
/haiku/src/system/kernel/vm/ |
H A D | VMUserAddressSpace.h | 24 virtual VMArea* FindClosestArea(addr_t address, bool less)
|
H A D | VMKernelAddressSpace.h | 29 virtual VMArea* FindClosestArea(addr_t address, bool less)
|
H A D | VMUserAddressSpace.cpp | 148 VMUserAddressSpace::FindClosestArea(addr_t address, bool less) const 150 VMUserArea* area = fAreas.FindClosest(address, less);
|
H A D | VMKernelAddressSpace.cpp | 176 VMKernelAddressSpace::FindClosestArea(addr_t address, bool less) const 178 Range* range = fRangeTree.FindClosest(address, less);
|
/haiku/src/tests/system/kernel/util/ |
H A D | VectorSetTest.cpp | 356 Iterator FindClose(const Value &value, bool less) argument 358 MyIterator myIt = fMySet.FindClose(value, less); 361 if (less) 368 if (less) { 385 ConstIterator FindClose(const Value &value, bool less) const 387 MyConstIterator myIt = fMySet.FindClose(value, less); 390 if (less) 397 if (less) { 755 // less 769 // less [all...] |
H A D | OrderedMapTest.h | 504 Iterator FindClose(const Key &key, bool less) argument 506 MyIterator myIt = fMyMap.FindClose(key, less); 509 if (less) 516 if (less) { 533 ConstIterator FindClose(const Key &key, bool less) const 535 MyConstIterator myIt = fMyMap.FindClose(key, less); 538 if (less) 545 if (less) { 1005 // less 1025 // less [all...] |
/haiku/src/system/kernel/util/ |
H A D | AVLTreeBase.cpp | 163 AVLTreeBase::FindClosest(const void* key, bool less) const 183 int expectedCmp = (less ? 1 : -1); 186 // The node's value is less although we were asked for a greater 189 if (less)
|
/haiku/headers/private/kernel/boot/ |
H A D | menu.h | 144 void SortItems(bool (*less)(const MenuItem*,
|
/haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
H A D | TwoKeyAVLTree.h | 318 bool less, Iterator* iterator = NULL); 490 TWO_KEY_AVL_TREE_CLASS_NAME::FindFirstClosest(const PrimaryKey& key, bool less, argument 503 int expectedCmp = less ? 1 : -1; 508 // The node's value is less although we were asked for a greater 511 node = less ? Previous(node) : Next(node);
|
/haiku/src/bin/ |
H A D | leak_analyser.sh | 151 echo "$ALLOCATIONS^total leaks: $COUNT" | tr '^' '\n' | less
|
/haiku/headers/private/kernel/vm/ |
H A D | VMAddressSpace.h | 82 virtual VMArea* FindClosestArea(addr_t address, bool less) const
|