/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_algo.h | 367 // search 559 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2); 588 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, 622 _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1), 658 _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, 675 * @param first1 Start of range to search. 676 * @param last1 End of range to search. 719 * @param first1 Start of range to search. 720 * @param last1 End of range to search. 4510 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function 4582 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_algo.h | 367 // search 559 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2); 588 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, 622 _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1), 658 _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, 675 * @param first1 Start of range to search. 676 * @param last1 End of range to search. 719 * @param first1 Start of range to search. 720 * @param last1 End of range to search. 4510 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function 4582 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function [all...] |
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
_algo.c | 112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1, function 244 // search_n. Search for __count consecutive copies of __val. [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_algo.h | 367 // search 559 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2); 588 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, 622 _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1), 658 _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, 675 * @param first1 Start of range to search. 676 * @param last1 End of range to search. 719 * @param first1 Start of range to search. 720 * @param last1 End of range to search. 4510 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function 4582 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function [all...] |
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
_algo.c | 112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1, function 244 // search_n. Search for __count consecutive copies of __val. [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_algo.h | 367 // search 559 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2); 588 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, 622 _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1), 658 _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, 675 * @param first1 Start of range to search. 676 * @param last1 End of range to search. 719 * @param first1 Start of range to search. 720 * @param last1 End of range to search. 4510 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function 4582 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function [all...] |
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
_algo.c | 112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1, function 244 // search_n. Search for __count consecutive copies of __val. [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
stl_algo.h | 367 // search 559 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2); 588 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, 622 _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1), 658 _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, 675 * @param first1 Start of range to search. 676 * @param last1 End of range to search. 719 * @param first1 Start of range to search. 720 * @param last1 End of range to search. 4510 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function 4582 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function [all...] |
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
_algo.c | 112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1, function 244 // search_n. Search for __count consecutive copies of __val. [all...] |
/system/core/sdcard/ |
sdcard.c | 233 * Performs a case-insensitive search for the file and sets the buffer to the path 234 * of the first matching file. If 'search' is zero or if no match is found, sets 241 char* buf, size_t bufsize, int search) 257 if (search && access(buf, F_OK)) { 771 int search = old_parent_node != new_parent_node local 774 new_child_path, sizeof(new_child_path), search))) { [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
org.apache.lucene.analysis_1.9.1.v20100518-1140.jar | |
org.eclipse.pde.api.tools_1.0.202.v20100820_r361.jar | |
/external/clang/lib/Sema/ |
SemaDeclObjC.cpp | 2752 void search(const ObjCProtocolList &protocols) { function in class:__anon5861::OverrideSearch 2758 void search(ObjCContainerDecl *container) { function in class:__anon5861::OverrideSearch [all...] |
/external/dnsmasq/src/ |
rfc2131.c | 225 int search; local 228 search = SUBOPT_CIRCUIT_ID; 230 search = SUBOPT_REMOTE_ID; 232 search = SUBOPT_SUBSCR_ID; 236 if ((sopt = option_find1(option_ptr(opt, 0), option_ptr(opt, option_len(opt)), search, 1)) && 285 we search again. If we don't have have a giaddr or explicit subnet selector, 578 /* Search again now we have a hostname. [all...] |
/external/icu4c/i18n/ |
usearch.cpp | 148 * @param strsrch string search data 290 * @param strsrch string search data 365 * @param strsrch string search data 547 * consideration. Forwards search will take the end accents into consideration 548 * for the default shift values and the backwards search will take the prefix 578 * @param strsrch string search data 587 UBreakIterator *breakiterator = strsrch->search->internalBreakIter; 609 * @param strsrch string search data 618 UBreakIterator *breakiterator = strsrch->search->breakIter; 639 const UChar *text = strsrch->search->text 3185 USearch *search = strsrch->search; local 3291 USearch *search = strsrch->search; local [all...] |
/external/quake/quake/src/QW/client/ |
common.c | 90 The "game directory" is the first tree on the search path and directory that all generated files (savegames, screenshots, demos, config files) will be saved to. This can be overridden with the "-game" command line parameter. The game directory can never be changed while quake is executing. This is a precacution against having a malicious server instruct clients to write files over areas they shouldn't. 93 specified, when a file is found by the normal search path, it will be mirrored 1257 int memsearch (byte *start, int count, int search) 1262 if (start[i] == search) 1370 Con_Printf ("Current search path:\n"); 1472 Finds the file in the search path. 1480 searchpath_t *search; local 1489 // search through the path, one element at a time 1491 for (search = com_searchpaths ; search ; search = search->next 1715 searchpath_t *search; local 1760 searchpath_t *search, *next; local [all...] |
/external/quake/quake/src/WinQuake/ |
common.cpp | 87 The "game directory" is the first tree on the search path and directory that all generated files (savegames, screenshots, demos, config files) will be saved to. This can be overridden with the "-game" command line parameter. The game directory can never be changed while quake is executing. This is a precacution against having a malicious server instruct clients to write files over areas they shouldn't. 90 specified, when a file is found by the normal search path, it will be mirrored 1216 int memsearch (const byte *start, int count, int search) 1221 if (start[i] == search) 1295 Con_Printf ("Current search path:\n"); 1394 Finds the file in the search path. 1400 searchpath_t *search; local 1413 // search through the path, one element at a time 1415 search = com_searchpaths; 1419 search = search->next 1725 searchpath_t *search; local 1769 searchpath_t *search; local [all...] |
/external/webkit/Source/WebCore/editing/ |
TextIterator.cpp | 59 // Buffer that knows how to compare with a search target. 60 // Keeps enough of the previous text to be able to search in the future, but no more. 79 size_t search(size_t& startOffset); 2159 inline size_t SearchBuffer::search(size_t& start) function in class:WebCore::SearchBuffer 2299 inline size_t SearchBuffer::search(size_t& start) function in class:WebCore::SearchBuffer [all...] |
/external/webkit/Tools/Scripts/webkitpy/thirdparty/ |
BeautifulSoup.py | 8 it easy to navigate, search, and modify the tree. 341 found = strainer.search(i) 902 def search(self, markup): member in class:SoupStrainer [all...] |
/libcore/luni/src/main/java/java/io/ |
ObjectStreamClass.java | 1105 Class<?> search = cl; local [all...] |
/libcore/xml/src/main/java/org/kxml2/io/ |
KXmlParser.java | 469 search: 491 continue search; local [all...] |
/packages/apps/Email/src/com/android/email/activity/ |
UIControllerBase.java | 637 // Show/hide the original search icon. 643 * This initiates the search entry mode - see {@link #onSearchSubmit} for when the search 674 * Determines the mailbox to search, if a search was to be initiated now. 675 * This will return {@code null} if the UI is not focused on any particular mailbox to search 684 // If already in a search, future searches will search the original mailbox. 693 * @return whether or not this account should do a global search instead when a user 694 * initiates a search on the given mailbox 815 MenuItem search = menu.findItem(R.id.search); local [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
stl_algo.h | 319 // search 544 = _GLIBCXX_STD_A::search(__first1, __last1, __first2, __last2); 573 = _GLIBCXX_STD_A::search(__first1, __last1, __first2, 607 _RevIterator1 __rresult = _GLIBCXX_STD_A::search(_RevIterator1(__last1), 643 _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, 660 * @param first1 Start of range to search. 661 * @param last1 End of range to search. 704 * @param first1 Start of range to search. 705 * @param last1 End of range to search. 4683 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function 4755 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
stl_algo.h | 319 // search 544 = _GLIBCXX_STD_A::search(__first1, __last1, __first2, __last2); 573 = _GLIBCXX_STD_A::search(__first1, __last1, __first2, 607 _RevIterator1 __rresult = _GLIBCXX_STD_A::search(_RevIterator1(__last1), 643 _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, 660 * @param first1 Start of range to search. 661 * @param last1 End of range to search. 704 * @param first1 Start of range to search. 705 * @param last1 End of range to search. 4683 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function 4755 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
stl_algo.h | 319 // search 544 = _GLIBCXX_STD_A::search(__first1, __last1, __first2, __last2); 573 = _GLIBCXX_STD_A::search(__first1, __last1, __first2, 607 _RevIterator1 __rresult = _GLIBCXX_STD_A::search(_RevIterator1(__last1), 643 _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, 660 * @param first1 Start of range to search. 661 * @param last1 End of range to search. 704 * @param first1 Start of range to search. 705 * @param last1 End of range to search. 4683 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function 4755 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, function [all...] |