| /ndk/sources/third_party/googletest/googletest/include/gtest/ |
| gtest.h | [all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| asynchat.py | 295 # Given 'haystack', see if any prefix of 'needle' is at its end. This
310 def find_prefix_at_end (haystack, needle):
312 while l and not haystack.endswith(needle[:l]):
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| asynchat.py | 295 # Given 'haystack', see if any prefix of 'needle' is at its end. This
310 def find_prefix_at_end (haystack, needle):
312 while l and not haystack.endswith(needle[:l]):
|
| /external/chromium_org/testing/gtest/src/ |
| gtest.cc | [all...] |
| /external/chromium_org/third_party/mesa/src/src/gtest/src/ |
| gtest.cc | [all...] |
| /external/gtest/src/ |
| gtest.cc | [all...] |
| /external/llvm/utils/unittest/googletest/src/ |
| gtest.cc | [all...] |
| /external/mesa3d/src/gtest/src/ |
| gtest.cc | [all...] |
| /external/protobuf/gtest/src/ |
| gtest.cc | [all...] |
| /ndk/sources/third_party/googletest/googletest/src/ |
| gtest.cc | [all...] |
| /frameworks/base/tools/aapt/ |
| Package.cpp | 395 bool endsWith(const char* haystack, const char* needle)
397 size_t a = strlen(haystack);
400 return strcasecmp(haystack+(a-b), needle) == 0;
|
| /bootable/recovery/edify/ |
| expr.c | 225 char* haystack = Evaluate(state, argv[1]); local
226 if (haystack == NULL) {
231 char* result = strdup(strstr(haystack, needle) ? "t" : "");
233 free(haystack);
|
| /packages/apps/UnifiedEmail/src/com/android/mail/providers/ |
| Conversation.java | 690 * found in the collection of conversations specified as the haystack. False
693 * @param haystack
695 * @return true if the needle was found in the haystack, false otherwise.
697 public final static boolean contains(Collection<Conversation> haystack, Conversation needle) {
698 // If the haystack is empty, it cannot contain anything.
699 if (haystack == null || haystack.size() <= 0) {
707 for (final Conversation c : haystack) {
|
| /external/aac/libSYS/src/ |
| genericStds.cpp | 192 const char *FDKstrstr(const char *haystack, const char *needle) { return strstr(haystack, needle); }
|
| /external/libsepol/src/ |
| conditional.c | 170 * haystack) that has a matching expression. If found, return a
175 cond_node_t * needle, cond_node_t * haystack,
178 while (haystack) {
179 if (cond_expr_equal(needle, haystack)) {
181 return haystack;
183 haystack = haystack->next;
|
| /external/compiler-rt/lib/dfsan/ |
| dfsan_custom.cc | 759 SANITIZER_INTERFACE_ATTRIBUTE char *__dfsw_strstr(char *haystack, char *needle,
763 char *ret = strstr(haystack, needle);
767 size_t len = ret ? ret + strlen(needle) - haystack : strlen(haystack) + 1;
769 dfsan_union(dfsan_read_label(haystack, len),
|
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| SDL_string.c | 433 char *SDL_strstr(const char *haystack, const char *needle)
436 while ( *haystack ) {
437 if ( SDL_strncmp(haystack, needle, length) == 0 ) {
438 return (char *)haystack;
440 ++haystack;
[all...] |
| /libcore/libart/src/main/java/java/lang/ |
| String.java | 1819 char[] haystack = haystackString.value; local
[all...] |
| /external/chromium_org/chrome/browser/spellchecker/ |
| feedback_sender_unittest.cc | 47 // Returns the number of times that |needle| appears in |haystack| without
49 int CountOccurences(const std::string& haystack, const std::string& needle) {
51 for (size_t pos = haystack.find(needle);
53 pos = haystack.find(needle, pos + needle.length())) {
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DateMath.cpp | 525 const char *haystack = "janfebmaraprmayjunjulaugsepoctnovdec"; local
526 const char *str = strstr(haystack, needle);
528 int position = static_cast<int>(str - haystack);
|
| /external/chromium_org/third_party/re2/re2/ |
| nfa.cc | 394 // Returns whether haystack contains needle's memory.
395 static bool StringPieceContains(const StringPiece haystack, const StringPiece needle) {
396 return haystack.begin() <= needle.begin() &&
397 haystack.end() >= needle.end();
|
| /external/regex-re2/re2/ |
| nfa.cc | 394 // Returns whether haystack contains needle's memory.
395 static bool StringPieceContains(const StringPiece haystack, const StringPiece needle) {
396 return haystack.begin() <= needle.begin() &&
397 haystack.end() >= needle.end();
|
| /external/valgrind/main/shared/ |
| vg_replace_strmem.c | [all...] |
| /external/chromium_org/third_party/protobuf/src/google/protobuf/compiler/ |
| importer_unittest.cc | 55 #define EXPECT_SUBSTRING(needle, haystack) \
56 EXPECT_PRED_FORMAT2(testing::IsSubstring, (needle), (haystack))
|
| /external/protobuf/src/google/protobuf/compiler/ |
| importer_unittest.cc | 55 #define EXPECT_SUBSTRING(needle, haystack) \
56 EXPECT_PRED_FORMAT2(testing::IsSubstring, (needle), (haystack))
|
