Find
if (AVLTreeNode* node = fTree.Find(&key))
Value* Find(const Key& key) const;
AVLTreeNode* Find(const void* key) const;
if (AVLTreeNode* node = fTree.Find(&key))
Iterator Find(const Key& key);
return Find(value, Begin());
return Find(value, Begin());
Iterator Find(const Value &value);
Iterator Find(const Value &value, const Iterator &start);
ConstIterator Find(const Value &value) const;
ConstIterator Find(const Value &value, const ConstIterator &start) const;
Iterator Find(const Key &key);
ConstIterator Find(const Key &key) const;
Iterator Find(const Value &value);
ConstIterator Find(const Value &value) const;
{ return sTree.Find(id); }
static area_id Find(const char* name);
int Find(const value &v) const
int Find(const value &v) const
Job* Find(node_ref* node);
SettingsArgvDispatcher* Find(const char*);
return Find(value, Begin());
return Find(value, Begin());
Iterator Find(const Value &value);
Iterator Find(const Value &value, const Iterator &start);
ConstIterator Find(const Value &value) const;
ConstIterator Find(const Value &value, const ConstIterator &start) const;
if (conn->fInUseIdents.Find(ident) == conn->fInUseIdents.End()) {
auto iter = conn->fInUseIdents.Find(ident);
_HarvestRecordFeatureUnits(Find(unit->fInputPins[i]), Map);
_HarvestOutputFeatureUnits(Find(unit->fInputPins[i]), Map);
_AudioControl* control = Find(selector->fInputPins[i]);
_AudioControl* control = Find(mixer->fInputPins[iPin]);
if (RecordControlsMap.Find(control->ID()) != RecordControlsMap.End()
|| OutputControlsMap.Find(control->ID()) != OutputControlsMap.End())
_AudioControl* sourceControl = Find(control->SourceID());
_AudioControl* control = Find(ID_FROM_CTLID(Info->values[i].id));
_AudioControl* control = Find(ID_FROM_CTLID(Info->values[i].id));
_AudioControl* control = fInterface->Find(fInputPins[i]);
_AudioControl* control = fInterface->Find(fSourceID);
control = fInterface->Find(fSourceID);
_AudioControl* control = fInterface->Find(SourceID());
_AudioControl* Find(uint8 id);
_AudioControl* control = fControlInterface->Find(TerminalLink());
USBTerminal.PushBack(fAudioControl.Find(fStreams[i]->TerminalLink()));
bool isInTable = fMulticastHashes.Find(hash) != fMulticastHashes.End();
int32 index = Find(value);
status_t Find(const uint8* key, uint16 keyLength,
status_t Find(const uint8* key, uint16 keyLength);
status = tree->Find((uint8*)name, (uint16)strlen(name), &id);
status_t status = tree->Find((uint8*)name, (uint16)strlen(name), &id);
status_t status = tree->Find((uint8*)name, (uint16)strlen(name), &id);
if (fTree->Find((uint8*)name, (uint16)strlen(name), &id) < B_OK)
if (fTree->Find((uint8*)name, (uint16)strlen(name), &id) == B_OK) {
if (tree->Find((uint8*)name, (uint16)strlen(name), &offset) == B_OK) {
return iterator->Find((const uint8*)value, size);
status = tree->Find((const uint8*)oldName, strlen(oldName), &id);
if (newTree->Find((const uint8*)newName, strlen(newName), &clobber)
status = tree->Find((uint8*)file, (uint16)strlen(file), _vnodeID);
status_t Find(const btrfs_key& key);
CachedExtent* found = Find(node->offset);
CachedExtent* found = Find(node->offset);
CachedExtent* found = Find(offset);
Inode* Find(ino_t id);
Inode* Find(const char* name);
Inode* inode = volume->Find(name);
inode = volume->Find(id);
Inode* inode = volume->Find(oldName);
if (volume->Find(newName) != NULL)
if (Find(name) == B_OK) {
status = Find(name);
Find(cookie->name);
status_t Find(const char* name);
status_t Find(int32 index);
status_t status = attribute.Find(index);
it = fHandleToDelegation.Find(handle);
AVLTreeMap<ino_t, FileInfo>::Iterator iterator = fMap.Find(id);
AVLTreeMap<ino_t, FileInfo>::Iterator iterator = fMap.Find(id);
AVLTreeMap<ino_t, FileInfo>::Iterator iterator = fMap.Find(id);
AVLTreeMap<uid_t, AccessEntry>::Iterator it = fAccessCache.Find(uid);
AVLTreeMap<uid_t, AccessEntry>::Iterator it = fAccessCache.Find(uid);
bool Find(const void* key, size_t length,
Node** foundNode = fNodes->Find(
if (!indexIterator->index->Find(value, size, *indexIterator))
Node** foundNode = fNodes->Find(SizeIndexPrimaryKey(node, oldSize), node,
inline Value* Find(const PrimaryKey& primaryKey,
TreeMapIterator it = fTreeMap.Find(Key(primaryKey, secondaryKey));
Attribute **foundAttribute = fAttributes->Find(
bool Find(const uint8 *key, size_t length,
Node **foundNode = fNodes->Find(LastModifiedIndexPrimaryKey(node,
= fEntries->Find(NameIndexPrimaryKey(entry, oldName), entry, &it);
return indexIterator->Find((const uint8*)value, size);
status_t Find(const uint8 *const key, size_t keyLength);
fInitialized = fIndex->Find(key, keyLength, &fIterator);
Node **foundNode = fNodes->Find(SizeIndexPrimaryKey(node, oldSize),
inline Value *Find(const PrimaryKey &primaryKey,
TreeMapIterator it = fTreeMap.Find(Key(primaryKey, secondaryKey));
status_t Find(const char *filename, ino_t *id);
status = dir->Find(file, vnodeID);
return fChannelEndpoints.Find(cid);
if (fBoundEndpoints.Find(address.l2cap_psm) != NULL)
return fBoundEndpoints.Find(psm);
if (fChannelEndpoints.Find(cid) != NULL)
list_item* Find(int32 index) const;
session* session = (struct session*)fSessionList->Find(sessionIndex);
off_t Find(off_t startPosition, const uint8* data,
void Find(off_t startAt, const uint8* data,
Find(startAt, data, dataSize, caseInsensitive, progressMonitor);
off_t foundAt = fEditor.Find(startAt, data, dataSize, caseInsensitive,
Find();
fFindWindow->fFindPanel->Find();
Find(window);
static void Find(BWindow* window);
void Find();
FindWindow::Find(this);
bool Find(const char* pattern, const TermPos& start,
if (!fTextBuffer->Find(str.String(), start, forwardSearch, matchCase,
bool Find(const BString& str, bool forwardSearch,
if (!textBuffer->Find(":", searchPos, true, true, false, foundStart,
findresult = _ActiveTermView()->Find(fFindString, fForwardSearch,
findresult = _ActiveTermView()->Find(fFindString,
if (tree.Find((uint8 *)key,keyLength,&value) < B_OK)
status_t Find(uint8 *key, uint16 keyLength, off_t *value);
if (name && (status = fTree->Find((uint8 *)name, (uint16)strlen(name),
if ((status = fTree->Find((uint8 *)name, (uint16)strlen(name),
BMessage::Find##typeName(const char *name, type *p) const \
BMessage::Find##typeName(const char *name, int32 index, type *p) const \
BMessage::Find##typeName(const char *name, int32 index) const \
Find##typeName(name, index, &val); \
BMessage::Find##typeName(const char* name, type* p) const \
return Find##typeName(name, 0, p); \
BMessage::Find##typeName(const char* name, int32 index, type* p) const \
BMessage::Find##typeName(const char* name, int32 index) const \
Find##typeName(name, index, &val); \
if (Find##typeName(name, index, &value) == B_OK) \
if (Find##typeName(name, index, &value) == B_OK) \
static replicant_data* Find(BList const *list, BMessage const *msg);
static replicant_data* Find(BList const *list, BView const *view, bool allowZombie);
static replicant_data* Find(BList const *list, unsigned long id);
int32 index = sRegisteredNodes.Find(LocalNode(node));
Job* job = Find(node);
Job* job = Find(node);
SettingsArgvDispatcher* handler = ((Settings*)castToThis)->Find(*argv);
if (Find(setting->Name()))
int32 index = Find(name, type);
int32 index = Find(name, type);
int32 index = Find(name, type);
int32 Find(const char* name, uint32 type) const;
int32 Find(const char* name, uint32 type) const;
int32 Find(const char* name, uint32 type) const;
AttributeStreamConstValue<Type>::Find(const char* name, uint32 type) const
Find();
void Find();
fCurrentPrinter = Printer::Find(fPrinterName);
return Printer::Find(name.String());
return Transport::Find(name);
if (Printer::Find(&node) != NULL)
Printer* printer = Printer::Find(node);
fDefaultPrinter = Printer::Find(printerName);
fDefaultPrinter = Printer::Find(fSettings->DefaultPrinter());
static Printer* Find(const BString& name);
static Printer* Find(node_ref* node);
Resource* r = Find(transport, address, connection);
Resource* Find(const char* transport, const char* address, const char* connection);
if (Transport::Find(path.Leaf()) != NULL)
static Transport* Find(const BString& name);
if (fTree.Find((uint8 *)name, strlen(name), &id) < B_OK)
PartitionMap::Iterator iterator = fPartitions->Find(id);
DiskSystemMap::Iterator it = fDiskSystems->Find(id);
select_event* event = fEventTree.Find(key);
if (fRangeTree.Find(range->base) != range) {
return VMAreas::Find(name);
else if (gArray.Find(num) < 0) {
if (gArray.Find(num) < 0) {
status_t status = iterator.Find((uint8*)gKeys[i].data, gKeys[i].length);
static status_t Find(BMessage& msg, const char* name, int32 index,
static status_t Find(BMessage& msg, const char* name, int32 index,
static status_t Find(BMessage& msg, const char* name, int32 index, Type* val)
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 0, &out) == B_NAME_NOT_FOUND);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 0, &out) == B_OK);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 0, &out) == B_OK);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 1, &out) == B_NAME_NOT_FOUND);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", i, &out) == B_OK);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", rIndex, &out) == B_OK);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", 0, &out) == B_OK);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", i, &out) == B_OK);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, NULL, 0, &out) == B_BAD_VALUE);
CPPUNIT_ASSERT(FuncPolicy::Find(msg, "item", i, &out) == B_OK);
static status_t Find(BMessage& msg, const char* name, int32 index,
static status_t Find(BMessage& msg, const char* name, int32 index,
static status_t Find(BMessage& msg, const char* name, int32 index,
static status_t Find(BMessage& msg, const char* name, int32 index,
message.Find##type("data", i, &value); \
MyIterator myIt = fMyMap.Find(key);
MyConstIterator myIt = fMyMap.Find(key);
Iterator it = v.Find(key);
ConstIterator cit = cv.Find(key);
Iterator it = v.Find(key);
ConstIterator cit = cv.Find(key);
MyIterator myIt = fMySet.Find(value);
MyConstIterator myIt = fMySet.Find(value);
Iterator it = v.Find(value);
ConstIterator cit = cv.Find(value);
Iterator it = v.Find(value);
ConstIterator cit = cv.Find(value);
MyIterator myIt = fMyVector.Find(value);
CPPUNIT_ASSERT(fMyVector.Find(value) == fMyVector.End());
CPPUNIT_ASSERT(fMyVector.Find(value) == fMyVector.End());
MyIterator myIt = fMyVector.Find(value, _start.fMyIterator);
CPPUNIT_ASSERT(fMyVector.Find(value, _start.fMyIterator) == fMyVector.End());
CPPUNIT_ASSERT(fMyVector.Find(value, start.fMyIterator) == fMyVector.End());
MyConstIterator myIt = fMyVector.Find(value);
CPPUNIT_ASSERT(fMyVector.Find(value) == fMyVector.End());
CPPUNIT_ASSERT(fMyVector.Find(value) == fMyVector.End());
MyConstIterator myIt = fMyVector.Find(value, _start.fMyIterator);
CPPUNIT_ASSERT(fMyVector.Find(value, _start.fMyIterator) == fMyVector.End());
CPPUNIT_ASSERT(fMyVector.Find(value, start.fMyIterator) == fMyVector.End());
it = v.Find(v[i], ++it);
cit = cv.Find(cv[i], ++cit);
typename TestClass::Iterator it = v.Find(value);
typename TestClass::ConstIterator cit = cv.Find(value);