| /haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
| H A D | TwoKeyAVLTree.h | 463 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); in FindFirst() local
472 return &strategy.GetValue(node); in FindFirst()
481 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); in FindFirstClosest() local
493 fGetPrimaryKey(strategy.GetValue(strategy.GetNode(node)))); in FindFirstClosest()
508 return &strategy.GetValue(node); in FindFirstClosest()
517 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); in FindLast() local
522 strategy.GetValue(node))); in FindLast()
526 fGetPrimaryKey(strategy.GetValue( in FindLast()
527 strategy.GetNode(node->right)))) == 0) { in FindLast()
528 node = strategy.GetNode(node->right); in FindLast()
[all …]
|
| /haiku/src/add-ons/kernel/file_systems/ramfs/ |
| H A D | TwoKeyAVLTree.h | 376 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); in FindFirst() local
381 strategy.GetValue(node))); in FindFirst()
385 fGetPrimaryKey(strategy.GetValue( in FindFirst()
386 strategy.GetNode(node->left)))) == 0) { in FindFirst()
387 node = strategy.GetNode(node->left); in FindFirst()
391 return &strategy.GetValue(node); in FindFirst()
395 node = strategy.GetNode(node->left); in FindFirst()
397 node = strategy.GetNode(node->right); in FindFirst()
408 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); in FindLast() local
413 strategy.GetValue(node))); in FindLast()
[all …]
|
| /haiku/src/tests/system/kernel/util/ |
| H A D | VectorTest.cpp | 596 GenericPushPopFrontTest(ValueStrategy strategy, int32 maxNumber) in GenericPushPopFrontTest() argument
601 v.PushFront(strategy.Generate()); in GenericPushPopFrontTest()
605 v.PushFront(strategy.Generate()); in GenericPushPopFrontTest()
625 GenericPushPopBackTest(ValueStrategy strategy, int32 maxNumber) in GenericPushPopBackTest() argument
630 v.PushBack(strategy.Generate()); in GenericPushPopBackTest()
634 v.PushBack(strategy.Generate()); in GenericPushPopBackTest()
654 GenericInsertTest1(ValueStrategy strategy, int32 maxNumber) in GenericInsertTest1() argument
660 v.Insert(strategy.Generate(), index); in GenericInsertTest1()
668 GenericInsertTest2(ValueStrategy strategy, int32 maxNumber) in GenericInsertTest2() argument
674 v.Insert(strategy.Generate(), v.IteratorForIndex(index)); in GenericInsertTest2()
[all …]
|
| H A D | VectorSetTest.cpp | 523 ValueStrategy strategy; in GenericInsertTest() local
526 v.Insert(strategy.Generate()); in GenericInsertTest()
555 GenericFill(TestClass &v, ValueStrategy strategy, int32 maxNumber) in GenericFill() argument
559 v.Insert(strategy.Generate()); in GenericFill()
573 ValueStrategy strategy; in GenericRemoveTest() local
575 GenericFill(v, strategy, maxNumber); in GenericRemoveTest()
614 ValueStrategy strategy; in GenericEraseTest() local
616 GenericFill(v, strategy, maxNumber); in GenericEraseTest()
653 ValueStrategy strategy; in GenericMakeEmptyTest() local
656 GenericFill(v, strategy, maxNumber); in GenericMakeEmptyTest()
[all …]
|
| H A D | OrderedMapTest.h | 794 GenericFill(TestClass &v, EntryStrategy strategy, int32 maxNumber) in GenericFill() argument
802 strategy.Generate(key, value); in GenericFill()
|
| /haiku/src/tests/kits/net/netservices2/ |
| H A D | testserver.py | 214 strategy = match.group('strategy')
218 if strategy == 'basic':
222 elif strategy == 'digest':
228 'Unimplemented authorization strategy ' + strategy)
|
| /haiku/src/tests/kits/net/service/ |
| H A D | testserver.py | 214 strategy = match.group('strategy')
218 if strategy == 'basic':
222 elif strategy == 'digest':
228 'Unimplemented authorization strategy ' + strategy)
|
| /haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
| H A D | IndexImpl.h | 218 typename Policy::NodeTree::NodeStrategy strategy; in GetNode() local
219 return strategy.GetValue(treeNode); in GetNode()
|
| /haiku/headers/private/kernel/util/ |
| H A D | AVLTreeMap.h | 58 AVLTreeMap(const NodeStrategy& strategy
251 _AVL_TREE_MAP_CLASS_NAME::AVLTreeMap(const NodeStrategy& strategy) in AVLTreeMap() argument
253 fStrategy(strategy) in AVLTreeMap()
|
| /haiku/src/tools/gensyscalls/ |
| H A D | Jamfile | 9 # The strategy to achieve this is:
|
| /haiku/data/system/data/fortunes/ |
| H A D | OS Fortunes | 18 "The reason for the success of this somewhat communist-sounding strategy, while the failure of comm…
|
| H A D | Art | 462 I suggest a new strategy, Artoo: let the Wookie win.
982 …So Richard and I decided to try to catch [the small shark]. With a great deal of strategy and effo…
|
| H A D | Songs & Poems | 4605 who through strategy and stealth
|
| /haiku/src/add-ons/kernel/drivers/audio/echo/generic/ |
| H A D | license.txt | 25 strategy to use in any particular case, based on the explanations below.
|
| /haiku/data/system/data/licenses/ |
| H A D | GNU LGPL v2.1 | 25 strategy to use in any particular case, based on the explanations below.
|
| /haiku/src/apps/mail/ |
| H A D | words | 24672 strategy/MS
|