| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _string.h | 9 * or implied. Any use is at your own risk.
230 const_reference at(size_type __n) const { return _M_non_dbg_impl.at(__n); } function in class:basic_string
231 reference at(size_type __n) { return _M_non_dbg_impl.at(__n); } function in class:basic_string
|
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _vector.h | 6 * or implied. Any use is at your own risk.
103 reference at(size_type __n) { return cast_traits::to_value_type_ref(_M_impl.at(__n)); } function in class:vector
104 const_reference at(size_type __n) const { return cast_traits::to_value_type_cref(_M_impl.at(__n)); } function in class:vector
|
| /bionic/libc/regex/ |
| engine.c | 53 #define at sat macro
65 #define at lat macro
107 static void at(struct match *, char *, char *, char *, sopno, sopno);
115 #define AT(t, p1, p2, s1, s2) at(m, t, p1, p2, s1, s2)
120 #define AT(t, p1, p2, s1, s2) /* nothing */
307 AT("diss", start, stop, startst, stopst);
488 AT("back", start, stop, startst, stopst);
569 AT("hard", sp, stop, ss, stopst);
669 - fast - step through the string at top spee
977 at(struct match *m, char *title, char *start, char *stop, sopno startst, function
1019 #undef at macro
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| ValueEncoder.java | 6 * You may obtain a copy of the License at
333 int at = 0; local
340 out.annotate(0, " elements[" + at + "]:");
341 at++;
|
| /dalvik/dx/src/com/android/dx/cf/direct/ |
| DirectClassFile.java | 6 * You may obtain a copy of the License at
475 int at = cpParser.getEndOffset(); local
476 int accessFlags = bytes.getUnsignedShort(at); // u2 access_flags;
477 int cpi = bytes.getUnsignedShort(at + 2); // u2 this_class;
479 cpi = bytes.getUnsignedShort(at + 4); // u2 super_class;
481 int count = bytes.getUnsignedShort(at + 6); // u2 interfaces_count
484 observer.parsed(bytes, at, 2,
487 observer.parsed(bytes, at + 2, 2, "this_class: " + thisClass);
488 observer.parsed(bytes, at + 4, 2, "super_class: " +
490 observer.parsed(bytes, at + 6, 2
[all...] |
| /dalvik/dx/src/com/android/dx/dex/file/ |
| ValueEncoder.java | 6 * You may obtain a copy of the License at
331 int at = 0; local
338 out.annotate(0, " elements[" + at + "]:");
339 at++;
|
| /dalvik/vm/ |
| Misc.cpp | 6 * You may obtain a copy of the License at
38 * If "mode" is kHexDumpLocal, we start at offset zero, and show a full
115 * We can overrun logcat easily by writing at full speed. On the
251 // At this point, 'c' is a string of the form "fully/qualified/Type;"
325 size_t at = strlen(str); local
328 if ((at >= 2) && (str[0] == 'L') && (str[at - 1] == ';')) {
329 at -= 2; /* Two fewer chars to copy. */
333 newStr = (char*)malloc(at + 1); /* Add one for the '\0'. */
337 newStr[at] = '\0'
360 char* at; local
[all...] |
| /external/chromium/googleurl/src/ |
| url_canon.h | 66 // Accessor for returning a character at a given position. The input offset
68 inline char at(int offset) const { function in class:url_canon::CanonOutputT
72 // Sets the character at the given position. The given position MUST be less
86 // write many characters at once, it can make sure there is enough capacity,
123 // Grow the buffer to hold at least one more item. Hopefully we won't have
145 // Grows the given buffer so that it can fit at least |min_additional|
266 // the output is empty. The beginning of the host will be at offset 0, and
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
| ValueEncoder.java | 6 * You may obtain a copy of the License at
331 int at = 0; local
338 out.annotate(0, " elements[" + at + "]:");
339 at++;
|
| /external/guava/guava/src/com/google/common/collect/ |
| ArrayTable.java | 6 * You may obtain a copy of the License at
65 * lists of allowed keys and values. See the {@link #at}, {@link #set}, {@link
224 public V at(int rowIndex, int columnIndex) { method in class:ArrayTable
|
| /external/iptables/libiptc/ |
| linux_list.h | 20 * Check at compile time that something is of a particular type.
288 struct list_head *at = head->next; local
293 last->next = at;
294 at->prev = last;
313 * The list at @list is reinitialised
|
| /external/javassist/src/main/javassist/compiler/ |
| MemberResolver.java | 261 int at = argTypes[n]; local
262 if (t != at)
264 && (at == SHORT || at == BYTE || at == CHAR))
|
| /external/kernel-headers/original/linux/ |
| list.h | 311 struct list_head *at = head->next; local
316 last->next = at;
317 at->prev = last;
336 * The list at @list is reinitialised
|
| /external/openssl/crypto/bn/ |
| bn_gf2m.c | 232 const BIGNUM *at, *bt; local
237 if (a->top < b->top) { at = b; bt = a; }
238 else { at = a; bt = b; }
240 if(bn_wexpand(r, at->top) == NULL)
245 r->d[i] = at->d[i] ^ bt->d[i];
247 for (; i < at->top; i++)
249 r->d[i] = at->d[i];
252 r->top = at->top;
|
| /external/stlport/stlport/stl/ |
| _string_sum.h | 6 * or implied. Any use is at your own risk.
119 const_reference at(size_type __n) const function in class:__bstr_sum
120 { return _M_get_storage().at(__n); }
|
| /external/stlport/stlport/stl/pointers/ |
| _deque.h | 6 * or implied. Any use is at your own risk.
144 reference at(size_type __n) function in class:deque
145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
146 const_reference at(size_type __n) const function in class:deque
147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| Vector.h | 7 * version 2 of the License, or (at your option) any later version.
535 T& at(size_t i) function in class:WTF::Vector
540 const T& at(size_t i) const
546 T& operator[](size_t i) { return at(i); }
547 const T& operator[](size_t i) const { return at(i); }
558 T& first() { return at(0); }
559 const T& first() const { return at(0); }
560 T& last() { return at(size() - 1); }
561 const T& last() const { return at(size() - 1); }
753 if (at(i) == value
[all...] |
| /libcore/luni/src/main/native/ |
| cbigint.cpp | 7 * the License. You may obtain a copy of the License at
26 #define at(i) (i) macro
28 #define at(i) ((i)^1) macro
230 HIGH_IN_U64 (product) + result[at (resultIndex)] +
232 result[at (resultIndex)] = LOW_U32_FROM_VAR (product);
235 HIGH_IN_U64 (product) + result[at (resultIndex)] +
237 result[at (resultIndex)] = LOW_U32_FROM_VAR (product);
242 result[at (resultIndex)] += HIGH_U32_FROM_VAR (product);
243 if (result[at (resultIndex)] < HIGH_U32_FROM_VAR (product))
247 while (++result[at (resultIndex)] == 0
[all...] |
| /libcore/luni/src/test/java/libcore/java/io/ |
| OldInputStreamReaderTest.java | 7 * the License. You may obtain a copy of the License at
266 int at = 0; local
276 if (at < prefixLength) {
279 (int) c + " at " + at);
282 char decoded = decodedSuffix[at - prefixLength];
285 (int) c + " at " + at);
288 at++;
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _string_sum.h | 6 * or implied. Any use is at your own risk.
119 const_reference at(size_type __n) const function in class:__bstr_sum
120 { return _M_get_storage().at(__n); }
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _deque.h | 6 * or implied. Any use is at your own risk.
144 reference at(size_type __n) function in class:deque
145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
146 const_reference at(size_type __n) const function in class:deque
147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
|
| /ndk/sources/host-tools/ndk-stack/regex/ |
| engine.c | 53 #define at sat macro
65 #define at lat macro
107 static void at(struct match *, char *, char *, char *, sopno, sopno);
115 #define AT(t, p1, p2, s1, s2) at(m, t, p1, p2, s1, s2)
120 #define AT(t, p1, p2, s1, s2) /* nothing */
307 AT("diss", start, stop, startst, stopst);
488 AT("back", start, stop, startst, stopst);
569 AT("hard", sp, stop, ss, stopst);
669 - fast - step through the string at top spee
977 at(struct match *m, char *title, char *start, char *stop, sopno startst, function
1019 #undef at macro
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_vector.h | 9 // Free Software Foundation; either version 3, or (at your option)
293 * used, then this will do at most 2N calls to the copy
607 * see at().)
630 * see at().)
645 /// Safety check used only from at().
666 at(size_type __n) function in class:vector
684 at(size_type __n) const function in class:vector
691 * Returns a read/write reference to the data at the first
699 * Returns a read-only (constant) reference to the data at the first
707 * Returns a read/write reference to the data at the las
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| hashtable_policy.h | 8 // Free Software Foundation; either version 3, or (at your option)
483 // The only tricky part is that we're caching the element count at
551 // DR 761. unordered_map needs an at() member function.
553 at(const _Key& __k);
556 at(const _Key& __k) const;
584 at(const _Key& __k) function in class:std::__detail::_Map_base
594 __throw_out_of_range(__N("_Map_base::at"));
602 at(const _Key& __k) const function in class:std::__detail::_Map_base
612 __throw_out_of_range(__N("_Map_base::at"));
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| hashtable_policy.h | 8 // Free Software Foundation; either version 3, or (at your option)
456 // The only tricky part is that we're caching the element count at
526 // DR 761. unordered_map needs an at() member function.
528 at(const _Key& __k);
531 at(const _Key& __k) const;
577 at(const _Key& __k) function in class:__detail::_Map_base
587 __throw_out_of_range(__N("_Map_base::at"));
595 at(const _Key& __k) const function in class:__detail::_Map_base
605 __throw_out_of_range(__N("_Map_base::at"));
|
