| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/ |
| map.h | 8 // Free Software Foundation; either version 3, or (at your option)
225 at(const key_type& __k) function in class:__profile::map
228 return _Base::at(__k);
232 at(const key_type& __k) const function in class:__profile::map
235 return _Base::at(__k);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_map.h | 8 // Free Software Foundation; either version 3, or (at your option)
501 at(const key_type& __k) function in class:map
505 __throw_out_of_range(__N("map::at"));
510 at(const key_type& __k) const function in class:map
514 __throw_out_of_range(__N("map::at"));
[all...] |
| unordered_map.h | 8 // Free Software Foundation; either version 3, or (at your option)
73 * at most one of each key value) that associates values of another type
90 * Base is _Hashtable, dispatched at compile time via template
612 at(const key_type& __k) function in class:unordered_map
613 { return _M_h.at(__k); }
616 at(const key_type& __k) const function in class:unordered_map
617 { return _M_h.at(__k); }
771 * Base is _Hashtable, dispatched at compile time via template
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/profile/ |
| map.h | 8 // Free Software Foundation; either version 3, or (at your option)
230 at(const key_type& __k) function in class:__profile::map
233 return _Base::at(__k);
237 at(const key_type& __k) const function in class:__profile::map
240 return _Base::at(__k);
|
| /system/core/libsparse/ |
| sparse_read.c | 6 * You may obtain a copy of the License at
54 char *at = ""; local
67 at = malloc(size + 1);
68 if (at == NULL) {
73 vsnprintf(at, size, fmt, argp);
75 at[size] = 0;
76 s = " at ";
81 sparse_print_verbose("EOF while reading file%s%s\n", s, at);
85 sparse_print_verbose("Invalid sparse file format%s%s\n", s, at);
88 s, at);
[all...] |
| /bionic/libc/upstream-netbsd/libc/regex/ |
| engine.c | 89 #define at sat macro
101 #define at lat macro
148 static void at(struct match *m, char *title, char *start, char *stop, sopno startst, sopno stopst);
161 #define AT(t, p1, p2, s1, s2) at(m, t, p1, p2, s1, s2)
166 #define AT(t, p1, p2, s1, s2) /* nothing */
380 AT("diss", start, stop, startst, stopst);
587 AT("back", start, stop, startst, stopst);
668 AT("hard", sp, stop, ss, stopst);
767 - fast - step through the string at top spee
1129 at( function
1186 #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
485 int at = cpParser.getEndOffset(); local
486 int accessFlags = bytes.getUnsignedShort(at); // u2 access_flags;
487 int cpi = bytes.getUnsignedShort(at + 2); // u2 this_class;
489 cpi = bytes.getUnsignedShort(at + 4); // u2 super_class;
491 int count = bytes.getUnsignedShort(at + 6); // u2 interfaces_count
494 observer.parsed(bytes, at, 2,
497 observer.parsed(bytes, at + 2, 2, "this_class: " + thisClass);
498 observer.parsed(bytes, at + 4, 2, "super_class: " +
500 observer.parsed(bytes, at + 6, 2
[all...] |
| /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/chromium_org/third_party/openssl/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/chromium_org/url/ |
| url_canon.h | 42 // Accessor for returning a character at a given position. The input offset
44 inline char at(int offset) const { function in class:url_canon::CanonOutputT
48 // Sets the character at the given position. The given position MUST be less
62 // write many characters at once, it can make sure there is enough capacity,
99 // Grow the buffer to hold at least one more item. Hopefully we won't have
121 // Grows the given buffer so that it can fit at least |min_additional|
244 // the output is empty. The beginning of the host will be at offset 0, and
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-bch.cc | 83 block()->dominated_blocks()->at(current_dominated_block_) : NULL;
108 Element* at(int index) const { return &(elements_.at(index)); } function in class:v8::internal::BASE_EMBEDDED
109 Element* at(HBasicBlock* block) const { return at(block->block_id()); } function in class:v8::internal::BASE_EMBEDDED
112 at(block->block_id())->set_has_check();
121 at(i)->InitializeLoop(data);
138 * semantics as performing it at every loop iteration, which could cause
146 at(i)->ResetCurrentDominatedBlock();
154 if (at(current)->has_check() || !at(current)->is_in_loop())
[all...] |
| /external/clang/include/clang/AST/ |
| CanonicalType.h | 101 /// // look at Ptr's pointee type
158 /// \brief Determines whether this canonical type is at least as qualified as
704 ArrayType_cannot_be_used_with_getAs<U> at; local
705 (void)at;
719 ArrayType_cannot_be_used_with_getAs<U> at; local
720 (void)at;
|
| /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)); }
|
| /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
232 HIGH_IN_U64 (product) + result[at (resultIndex)] +
234 result[at (resultIndex)] = LOW_U32_FROM_VAR (product);
237 HIGH_IN_U64 (product) + result[at (resultIndex)] +
239 result[at (resultIndex)] = LOW_U32_FROM_VAR (product);
244 result[at (resultIndex)] += HIGH_U32_FROM_VAR (product);
245 if (result[at (resultIndex)] < HIGH_U32_FROM_VAR (product))
249 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); }
|
