| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
|
| /external/icu4c/tools/toolutil/ |
| uparse.c | 41 char *end=uprv_strchr(s, 0); local
42 while(s<end && U_IS_INV_WHITESPACE(*(end-1))) {
43 *--end = 0;
45 return end;
189 char *end; local
209 value=(uint32_t)uprv_strtoul(s, &end, 16);
210 if(end<=s || (!U_IS_INV_WHITESPACE(*end) && *end!=';' && *end!=0) || value>=0x110000)
238 char *end; local
298 char *end; local
[all...] |
| /libcore/luni/src/main/java/java/lang/ |
| AbstractStringBuilder.java | 151 final void append0(CharSequence s, int start, int end) {
155 if ((start | end) < 0 || start > end || end > s.length()) {
159 int length = end - start;
169 ((String) s)._getChars(start, end, value, count);
175 for (int i = start; i < end; i++) {
215 private StringIndexOutOfBoundsException startEndAndLength(int start, int end) {
216 throw new StringIndexOutOfBoundsException(count, start, end - start);
219 final void delete0(int start, int end) {
454 int end = count - 1; local
[all...] |
| /external/qemu/android/ |
| qemu-setup.c | 63 char* end = p + sizeof(buffer); local
64 p = bufprint_app_dir(p, end);
65 if (p >= end)
77 get_report_console_options( char* end, int *maxtries )
81 if (end == NULL || *end == 0)
84 if (end[0] != ',') {
88 end += 1;
89 while (*end) {
90 char* p = strchr(end, ',');
123 char* end; local
266 char* end; local
303 char* end; local
[all...] |
| /external/oprofile/opjitconv/ |
| parse_dump.c | 33 char const * end; local
35 end = rec->code_addr ? ptr + size : NULL;
51 // if nothing else is known the symbol lives till the end of the
70 /* If end == NULL, the dump does not include code, and this sanity
73 if (end && (ptr + entry->code_size + padding_count != end)) {
116 static void parse_code_debug_info(void const * ptr, void const * end,
124 debug_line->end = end;
137 static int parse_entries(void const * ptr, void const * end,
[all...] |
| /external/expat/lib/ |
| xmltok.h | 13 #define XML_TOK_TRAILING_RSQB -5 /* ] or ]] at the end of the scan; might be
19 #define XML_TOK_TRAILING_CR -3 /* A CR at the end of the scan;
155 const char *end,
159 const char *end,
176 /* Scan the string starting at ptr until the end of the next complete
190 set to point to the character following the end of that token.
198 #define XmlTok(enc, state, ptr, end, nextTokPtr) \
199 (((enc)->scanners[state])(enc, ptr, end, nextTokPtr))
201 #define XmlPrologTok(enc, ptr, end, nextTokPtr) \
202 XmlTok(enc, XML_PROLOG_STATE, ptr, end, nextTokPtr
[all...] |
| /external/stlport/test/unit/ |
| uninitialized_test.cpp | 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
96 for (; it != end; ++it) {
108 TrivialCopyStruct* end = src + count; local
109 for (; it != end; ++it) {
114 for (it = dst+0, end = dst+count; it != end; ++it) {
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| uninitialized_test.cpp | 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
96 for (; it != end; ++it) {
108 TrivialCopyStruct* end = src + count; local
109 for (; it != end; ++it) {
114 for (it = dst+0, end = dst+count; it != end; ++it) {
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| uninitialized_test.cpp | 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
96 for (; it != end; ++it) {
108 TrivialCopyStruct* end = src + count; local
109 for (; it != end; ++it) {
114 for (it = dst+0, end = dst+count; it != end; ++it) {
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
[all...] |
| /system/core/run-as/ |
| package.c | 254 /* Skip any space or tab character from 'p' until 'end' is reached.
258 skip_spaces(const char* p, const char* end)
260 while (p < end && is_space(*p))
266 /* Skip any non-space and non-tab character from 'p' until 'end'.
270 skip_non_spaces(const char* p, const char* end)
272 while (p < end && !is_space(*p))
278 /* Find the first occurence of 'ch' between 'p' and 'end'
279 * Return its position, or 'end' if none is found.
282 find_first(const char* p, const char* end, char ch)
284 while (p < end && *p != ch
437 const char* end = find_first(p, buffer_end, '\\n'); local
[all...] |
| /frameworks/base/core/java/android/text/util/ |
| Linkify.java | 96 public final boolean acceptMatch(CharSequence s, int start, int end) {
114 public final boolean acceptMatch(CharSequence s, int start, int end) {
117 for (int i = start; i < end; i++) {
162 * @param end The index of the last character in s that was
167 boolean acceptMatch(CharSequence s, int start, int end);
240 applyLink(link.url, link.start, link.end, text);
369 int end = m.end(); local
373 allowed = matchFilter.acceptMatch(s, start, end);
380 applyLink(url, start, end, s)
431 int end = m.end(); local
460 int end = start + length; local
542 int end; field in class:LinkSpec
[all...] |
| /bionic/libc/arch-mips/bionic/ |
| __get_sp.S | 39 .end __get_sp
|
| /bionic/libc/kernel/arch-x86/asm/ |
| cacheflush.h | 26 #define flush_cache_range(vma, start, end) do { } while (0)
32 #define flush_icache_range(start, end) do { } while (0)
36 #define flush_cache_vmap(start, end) do { } while (0)
37 #define flush_cache_vunmap(start, end) do { } while (0)
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/neg_float/d/ |
| T_neg_float_5.d | 11 .end method
18 .end method
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/neg_int/d/ |
| T_neg_int_6.d | 11 .end method
18 .end method
|
| /development/ndk/platforms/android-9/arch-x86/include/asm/ |
| cacheflush.h | 26 #define flush_cache_range(vma, start, end) do { } while (0)
32 #define flush_icache_range(start, end) do { } while (0)
36 #define flush_cache_vmap(start, end) do { } while (0)
37 #define flush_cache_vunmap(start, end) do { } while (0)
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRLexerRuleReturnScope.h | 42 @end
|
| ANTLRTreeVisitorAction.h | 56 @end
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRLexerRuleReturnScope.h | 42 @end
|
| ANTLRTreeVisitorAction.h | 56 @end
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRLexerRuleReturnScope.h | 42 @end
|
