Searched refs:Find (Results 1 - 25 of 109) sorted by last modified time

12345

/haiku/src/apps/diskprobe/
H A DProbeView.cpp186 void Find(off_t startAt, const uint8* data,
965 Find(startAt, data, dataSize, caseInsensitive, progressMonitor);
976 EditorLooper::Find(off_t startAt, const uint8* data, size_t dataSize, function in class:EditorLooper
985 off_t foundAt = fEditor.Find(startAt, data, dataSize, caseInsensitive,
1313 menu->AddItem(item = new BMenuItem(B_TRANSLATE("Find" B_UTF8_ELLIPSIS),
1316 menu->AddItem(fFindAgainMenuItem = new BMenuItem(B_TRANSLATE("Find again"),
/haiku/src/add-ons/kernel/network/protocols/l2cap/
H A DL2capEndpointManager.cpp44 if (fBoundEndpoints.Find(address.l2cap_psm) != NULL)
73 return fBoundEndpoints.Find(psm);
88 if (fChannelEndpoints.Find(cid) != NULL)
119 return fChannelEndpoints.Find(cid);
/haiku/src/add-ons/kernel/bluetooth/btCoreData/
H A DConnectionInterface.cpp235 if (conn->fInUseIdents.Find(ident) == conn->fInUseIdents.End()) {
254 auto iter = conn->fInUseIdents.Find(ident);
/haiku/headers/private/kernel/util/
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 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))
/haiku/src/apps/terminal/
H A DTermWindow.cpp526 .AddItem(B_TRANSLATE("Find" B_UTF8_ELLIPSIS), MENU_FIND_STRING, 'F')
527 .AddItem(B_TRANSLATE("Find previous"), MENU_FIND_PREVIOUS, 'G',
531 .AddItem(B_TRANSLATE("Find next"), MENU_FIND_NEXT, 'G')
816 BAlert* alert = new BAlert(B_TRANSLATE("Find failed"),
830 findresult = _ActiveTermView()->Find(fFindString, fForwardSearch,
834 BAlert* alert = new BAlert(B_TRANSLATE("Find failed"),
845 // Enable the menu items Find Next and Find Previous
853 findresult = _ActiveTermView()->Find(fFindString,
857 BAlert* alert = new BAlert(B_TRANSLATE("Find faile
[all...]
H A DTermViewStates.cpp880 if (!textBuffer->Find(":", searchPos, true, true, false, foundStart,
H A DTermView.cpp2890 // Find a string, and select it if found
2892 TermView::Find(const BString &str, bool forwardSearch, bool matchCase, function in class:TermView
2913 if (!fTextBuffer->Find(str.String(), start, forwardSearch, matchCase,
3100 // TODO: Find out if what we did it's ok, currently we don't consider
/haiku/src/system/kernel/vm/
H A Dvm.cpp1727 // during boot time. Find the appropriate vm_page objects and stick
6281 return VMAreas::Find(name);
/haiku/src/add-ons/kernel/drivers/audio/usb/
H A DDevice.cpp506 USBTerminal.PushBack(fAudioControl.Find(fStreams[i]->TerminalLink()));
H A DAudioStreamingInterface.cpp489 _AudioControl* control = fControlInterface->Find(TerminalLink());
/haiku/src/kits/tracker/
H A DFindPanel.h149 void Find();
H A DFindPanel.cpp215 BWindow(BRect(), B_TRANSLATE("Find"), B_TITLED_WINDOW,
534 FindWindow::Find() function in class:BPrivate::FindWindow
646 Find();
/haiku/src/system/kernel/events/
H A Devent_queue.cpp530 select_event* event = fEventTree.Find(key);
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DInode.cpp734 // Find the last item or one with the same name we have to add
1330 status_t status = tree->Find((uint8*)name, (uint16)strlen(name), &id);
2531 if (fTree->Find((uint8*)name, (uint16)strlen(name), &id) < B_OK)
2573 if (fTree->Find((uint8*)name, (uint16)strlen(name), &id) == B_OK) {
2652 if (tree->Find((uint8*)name, (uint16)strlen(name), &offset) == B_OK) {
H A DBPlusTree.cpp61 inline int32 Find(off_t value) const function in struct:BFS::duplicate_array
2277 BPlusTree::Find(const uint8* key, uint16 keyLength, off_t* _value) function in class:BFS::BPlusTree
2803 /*! This is more or less a copy of BPlusTree::Find() - but it just
2808 TreeIterator::Find(const uint8* key, uint16 keyLength) function in class:BFS::TreeIterator
3123 int32 index = Find(value);
/haiku/src/add-ons/kernel/file_systems/ext2/
H A Dkernel_interface.cpp1575 status_t status = attribute.Find(index);
/haiku/src/apps/mail/
H A DMailWindow.cpp365 menu->AddItem(new BMenuItem(B_TRANSLATE("Find" B_UTF8_ELLIPSIS),
367 menu->AddItem(new BMenuItem(B_TRANSLATE("Find again"),
1245 // Find the next message that should be displayed
1447 FindWindow::Find(this);
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DQuery.cpp25 status_t Find(const uint8 *const key, size_t keyLength);
47 IndexIterator::Find(const uint8 *const key, size_t keyLength) function in class:IndexIterator
51 // TODO: We actually don't want an exact Find() here, but rather a
53 fInitialized = fIndex->Find(key, keyLength, &fIterator);
214 return indexIterator->Find((const uint8*)value, size);
/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/
H A Dtest.cpp387 status_t status = iterator.Find((uint8*)gKeys[i].data, gKeys[i].length);
394 printf("TreeIterator::Find() returned: %s\n", strerror(status));
/haiku/src/tests/add-ons/kernel/file_systems/bfs/array/
H A Darray.cpp38 else if (gArray.Find(num) < 0) {
50 if (gArray.Find(num) < 0) {
/haiku/src/kits/media/
H A DMediaRoster.cpp253 int32 index = sRegisteredNodes.Find(LocalNode(node));
/haiku/src/kits/app/
H A DMessage.cpp2437 /* Relay functions from here on (Add... -> AddData, Find... -> FindData) */
2448 BMessage::Find##typeName(const char* name, type* p) const \
2450 return Find##typeName(name, 0, p); \
2455 BMessage::Find##typeName(const char* name, int32 index, type* p) const \
2530 BMessage::Find##typeName(const char* name, int32 index) const \
2533 Find##typeName(name, index, &val); \
2565 if (Find##typeName(name, index, &value) == B_OK) \
2634 if (Find##typeName(name, index, &value) == B_OK) \
2899 // Find*() clobbers the object even on failure
/haiku/src/build/libbe/app/
H A DMessage.cpp1624 /* Relay functions from here on (Add... -> AddData, Find... -> FindData) */
1634 BMessage::Find##typeName(const char *name, type *p) const \
1650 BMessage::Find##typeName(const char *name, int32 index, type *p) const \
1716 BMessage::Find##typeName(const char *name, int32 index) const \
1719 Find##typeName(name, index, &val); \
/haiku/src/bin/bfs_tools/lib/
H A DInode.cpp1194 if (name && (status = fTree->Find((uint8 *)name, (uint16)strlen(name),
1224 if ((status = fTree->Find((uint8 *)name, (uint16)strlen(name),

Completed in 253 milliseconds

12345