Searched refs:search (Results 1 - 25 of 26) sorted by relevance

12

/haiku/src/system/libroot/posix/musl/search/
H A Dtsearch.h1 #include <search.h>
H A Dtfind.c1 #include <search.h>
H A Dtdestroy.c3 #include <search.h>
H A Dinsque.c1 #include <search.h>
H A Dtwalk.c1 #include <search.h>
H A Dlsearch.c1 #include <search.h>
H A Dtdelete.c2 #include <search.h>
H A Dtsearch.c2 #include <search.h>
H A Dhsearch.c4 #include <search.h>
/haiku/headers/compatibility/gnu/
H A Dstring.h20 const void *search, size_t searchLength);
/haiku/src/libs/alm/
H A DTab.cpp30 bool HasLayout(BALMLayout* search) argument
32 if (layout == search)
34 return next ? next->HasLayout(search) : false;
/haiku/src/libs/glut/
H A Dbeos_x11.cpp42 *Returns pointer to first char ins search which is also in what, else NULL.
44 static char *strscan (char *search, char *what)
49 while ((c = *(search++))) {
52 return (--search);
/haiku/src/tests/add-ons/index_server/fulltext_search/
H A DBeaconSearcher.cpp21 using namespace lucene::search ;
87 hits = fMultiSearcher->search(luceneQuery) ;
101 hits = indexSearcher->search(luceneQuery) ;
/haiku/headers/cpp/
H A Dalgo.h44 using __STD::search;
H A Dstl_algo.h278 // search.
281 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1, function
325 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1, function
1720 // Binary search (lower_bound, upper_bound, equal_range, binary_search).
2689 = search(__first1, __last1, __first2, __last2);
2714 = search(__first1, __last1, __first2, __last2, __comp);
2740 _RevIter1 __rresult = search(_RevIter1(__last1), __rlast1,
2765 _RevIter1 __rresult = search(_RevIter1(__last1), __rlast1,
/haiku/src/kits/network/libnetservices2/
H A DHttpBuffer.cpp120 auto result = std::search(offset, fBuffer.cend(), kNewLine.cbegin(), kNewLine.cend());
/haiku/src/apps/webpositive/
H A DBrowserWindow.h217 BString _EncodeURIComponent(const BString& search);
219 void _VisitSearchEngine(const BString& search);
H A DBrowserWindow.cpp566 B_TRANSLATE_COMMENT("Find previous occurrence of search terms",
571 B_TRANSLATE_COMMENT("Find next occurrence of search terms",
2575 BrowserWindow::_EncodeURIComponent(const BString& search) argument
2578 // search string to WebKit, if we want queries like "4+3" to not be
2581 BString result = search;
2606 BrowserWindow::_VisitSearchEngine(const BString& search) argument
2608 BString searchQuery = search;
2611 search.CopyCharsInto(searchPrefix, 0, 2);
2613 // Default search URL
2616 // Check if the string starts with one of the search engin
[all...]
/haiku/3rdparty/mmu_man/scripts/
H A DHardwareChecker.sh292 echo "<h3><tt>pkgman search -a</tt></h3>"
295 pkgman search -a
/haiku/src/tests/kits/app/bmessage/
H A DMessageSpeedTest.cpp84 BString search; \
85 search << rand() % count; \
86 const char *string = search.String(); \
/haiku/src/kits/tracker/
H A DFindPanel.cpp741 // add popup for search criteria
1039 // no disk selected, for now revert to search all disks
1664 // search for marked item in the list
1712 BMenuItem* search; local
1713 for (int32 i = 2; (search = MimeTypeMenu()->ItemAt(i)) != NULL; i++) {
1714 if (item == search || search->Label() == NULL)
1717 if (strcmp(item->Label(), search->Label()) == 0) {
1718 search->SetMarked(true);
1722 BMenu* submenu = search
[all...]
/haiku/src/add-ons/kernel/network/stack/
H A Dradix.c352 /* printf("about to search\n"); */
590 * the search and satisfaction test and put the
614 rn_addmask(void *n_arg, int search, int skip) argument
651 if (x || search)
/haiku/src/apps/mail/
H A DContent.cpp476 bool search = true;
478 if ((search && is_quote_char(line[next]))
481 else if (search && line[next] != ' ' && line[next] != '\t')
482 search = false;
/haiku/src/apps/activitymonitor/
H A DActivityView.cpp328 // search in left part
342 // search in right part
756 ActivityView::FindDataSource(const DataSource* search) argument
762 if (!strcmp(source->Name(), search->Name()))
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Ddir.c226 * @dir_ni: ntfs inode of the directory in which to search for the name
227 * @uname: Unicode name for which to search in the directory
344 /* The names are not equal, continue the search. */
465 /* The names are not equal, continue the search. */
642 * @parent: A directory inode to begin the search (may be NULL)
647 * then the root directory '.' will be used as the base for the search.
753 * if not in cache, translate, search, then
1949 search:
2009 * If case sensitive search failed, then try once again
2015 goto search;
[all...]

Completed in 336 milliseconds

12