Searched refs:Find (Results 26 - 50 of 109) sorted by path

12345

/haiku/src/servers/print/
H A DPrinter.cpp55 // Find [static]
67 Printer::Find(const BString& name) function in class:Printer
79 Printer::Find(node_ref* node) function in class:Printer
H A DPrinter.h58 static Printer* Find(const BString& name);
59 static Printer* Find(node_ref* node);
H A DResourceManager.cpp76 ResourceManager::Find(const char* transport, const char* address, const char* connection) { function in class:ResourceManager
87 Resource* r = Find(transport, address, connection);
H A DResourceManager.h43 Resource* Find(const char* transport, const char* address, const char* connection);
H A DTransport.cpp22 // Find [static]
34 Transport::Find(const BString& name) function in class:Transport
96 if (Transport::Find(path.Leaf()) != NULL)
129 // Find transport_features symbol, to determine if we need to keep
H A DTransport.h33 static Transport* Find(const BString& name);
/haiku/src/system/boot/loader/file_systems/bfs/
H A DDirectory.cpp91 if (fTree.Find((uint8 *)name, strlen(name), &id) < B_OK)
/haiku/src/tests/kits/app/bmessage/
H A DMessageBStringItemTest.h27 static status_t Find(BMessage& msg, const char* name, int32 index,
50 status_t TBStringFuncPolicy::Find(BMessage& msg, const char* name, function in class:TBStringFuncPolicy
H A DMessageFlattenableItemTest.h101 static status_t Find(BMessage& msg, const char* name, int32 index, function in struct:TFlattenableFuncPolicy
H A DMessageItemTest.h38 // status_t Find(BMessage&, const char*, int32, Type*)
100 static status_t Find(BMessage& msg, const char* name, int32 index, Type* val) function in struct:TMessageItemFuncPolicy
154 // status_t Find(BMessage&, const char*, int32, Type*)
213 CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 0, &out) == B_NAME_NOT_FOUND);
245 CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 0, &out) == B_OK);
278 CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 0, &out) == B_OK);
304 CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 1, &out) == B_NAME_NOT_FOUND);
345 CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", i, &out) == B_OK);
382 CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", rIndex, &out) == B_OK);
416 CPPUNIT_ASSERT(FuncPolicy::Find(ms
[all...]
H A DMessageMessageItemTest.h29 static status_t Find(BMessage& msg, const char* name, int32 index,
64 inline status_t TMessageFuncPolicy::Find(BMessage& msg, const char* name, function in class:TMessageFuncPolicy
H A DMessageMessengerItemTest.h31 static status_t Find(BMessage& msg, const char* name, int32 index, function in struct:TMessengerFuncPolicy
H A DMessagePointerItemTest.h29 static status_t Find(BMessage& msg, const char* name, int32 index, function in struct:TPointerFuncPolicy
H A DMessageRefItemTest.h31 static status_t Find(BMessage& msg, const char* name, int32 index, function in struct:TRefFuncPolicy
H A DMessageSpeedTest.cpp121 message.Find##type("data", i, &value); \
/haiku/src/tests/system/kernel/util/
H A DOrderedMapTest.h478 Iterator Find(const Key &key) function in class:TestMap
480 MyIterator myIt = fMyMap.Find(key);
491 ConstIterator Find(const Key &key) const function in class:TestMap
493 MyConstIterator myIt = fMyMap.Find(key);
943 Iterator it = v.Find(key);
944 ConstIterator cit = cv.Find(key);
954 Iterator it = v.Find(key);
955 ConstIterator cit = cv.Find(key);
H A DVectorSetTest.cpp334 Iterator Find(const Value &value) function in class:TestSet
336 MyIterator myIt = fMySet.Find(value);
345 ConstIterator Find(const Value &value) const function in class:TestSet
347 MyConstIterator myIt = fMySet.Find(value);
701 Iterator it = v.Find(value);
702 ConstIterator cit = cv.Find(value);
708 Iterator it = v.Find(value);
709 ConstIterator cit = cv.Find(value);
H A DVectorTest.cpp431 Iterator Find(const Value &value) function in class:TestVector
438 MyIterator myIt = fMyVector.Find(value);
443 CHK(fMyVector.Find(value) == fMyVector.End());
447 CHK(fMyVector.Find(value) == fMyVector.End());
451 Iterator Find(const Value &value, const Iterator &_start) function in class:TestVector
458 MyIterator myIt = fMyVector.Find(value,
464 CHK(fMyVector.Find(value, _start.fMyIterator) == fMyVector.End());
468 CHK(fMyVector.Find(value, start.fMyIterator) == fMyVector.End());
472 ConstIterator Find(const Value &value) const function in class:TestVector
479 MyConstIterator myIt = fMyVector.Find(valu
492 ConstIterator Find(const Value &value, const ConstIterator &_start) const function in class:TestVector
[all...]
/haiku/headers/private/kernel/util/
H A DAVLTree.h61 Value* Find(const Key& key) const;
335 AVLTree<Definition>::Find(const Key& key) const function in class:AVLTree
337 if (AVLTreeNode* node = fTree.Find(&key))
H A DAVLTreeBase.h60 AVLTreeNode* Find(const void* key) const;
H A DVector.h72 Iterator Find(const Value &value);
73 Iterator Find(const Value &value, const Iterator &start);
74 ConstIterator Find(const Value &value) const;
75 ConstIterator Find(const Value &value, const ConstIterator &start) const;
612 // Find
622 _VECTOR_CLASS_NAME::Find(const Value &value) function in class:_VECTOR_CLASS_NAME
624 return Find(value, Begin());
627 // Find
639 _VECTOR_CLASS_NAME::Find(const Value &value, const Iterator &start) function in class:_VECTOR_CLASS_NAME
647 // Find
657 _VECTOR_CLASS_NAME::Find(const Value &value) const function in class:_VECTOR_CLASS_NAME
674 _VECTOR_CLASS_NAME::Find(const Value &value, const ConstIterator &start) const function in class:_VECTOR_CLASS_NAME
[all...]
H A DVectorMap.h98 Iterator Find(const Key &key);
99 ConstIterator Find(const Key &key) const;
526 // Find
535 _VECTOR_MAP_CLASS_NAME::Find(const Key &key) function in class:_VECTOR_MAP_CLASS_NAME
544 // Find
553 _VECTOR_MAP_CLASS_NAME::Find(const Key &key) const function in class:_VECTOR_MAP_CLASS_NAME
572 is \c false and the last entry's key is smaller. Find() invoked on an
613 is \c false and the last entry's key is smaller. Find() invoked on an
H A DVectorSet.h70 Iterator Find(const Value &value);
71 ConstIterator Find(const Value &value) const;
303 // Find
312 _VECTOR_SET_CLASS_NAME::Find(const Value &value) function in class:_VECTOR_SET_CLASS_NAME
321 // Find
330 _VECTOR_SET_CLASS_NAME::Find(const Value &value) const function in class:_VECTOR_SET_CLASS_NAME
349 is \c false and the last element is smaller. Find() invoked on an empty
390 is \c false and the last element is smaller. Find() invoked on an empty
/haiku/headers/private/kernel/vm/
H A DVMArea.h219 { return sTree.Find(id); }
221 static area_id Find(const char* name);
/haiku/headers/private/print/
H A DJobs.h110 Job* Find(node_ref* node);

Completed in 289 milliseconds

12345