| /external/guava/guava-tests/test/com/google/common/collect/ |
| HashBiMapTest.java | 92 // The next two tests verify that map entries are not accessed after they're
100 iterator.next();
101 iterator.next();
103 iterator.next();
115 iterator.next();
116 iterator.next();
118 iterator.next();
|
| /external/icu4c/test/intltest/ |
| tstnrapi.cpp | 27 if(norm.next()!=0xe4) {
28 dataerrln("error in Normalizer(CharacterIterator).next()");
33 if(copy.next()!=0xac00) {
34 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).next()");
46 if(clone->next()!=0x4e3d) {
47 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next()");
51 errln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next().hashCode()==copy.hashCode()");
103 if(copy.next()!=0x308 || copy.next()!=0x1100) {
135 if(norm.first()!=0x61 || norm.next()!=0x308 || norm.last()!=0x2f800)
[all...] |
| /external/iproute2/misc/ |
| nstat.c | 75 struct nstat_ent *next; member in struct:nstat_ent
147 n->next = db;
153 db = db->next;
154 n->next = kern_db;
181 char *next; local
182 if ((next = strchr(p, ' ')) != NULL)
183 *next++ = 0;
184 else if ((next = strchr(p, '\n')) != NULL)
185 *next++ = 0;
195 n->next = db
[all...] |
| /external/mesa3d/src/gallium/state_trackers/d3d1x/dxgi/src/ |
| dxgi_loader.cpp | 75 const char *cur, *next; local
80 next = strchr(cur, ':');
81 len = (next) ? next - cur : strlen(cur);
86 cur = (next) ? next + 1 : NULL;
|
| /external/mesa3d/src/glsl/glcpp/ |
| glcpp.h | 11 * The above copyright notice and this permission notice (including the next
40 struct string_node *next; member in struct:string_node
100 struct token_node *next; member in struct:token_node
111 struct argument_node *next; member in struct:argument_node
143 struct expansion_node *next; member in struct:expansion_node
155 struct skip_node *next; member in struct:skip_node
161 struct active_list *next; member in struct:active_list
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| TCPMessageProcessor.java | 186 TCPMessageChannel next = (TCPMessageChannel) it.next(); local
187 next.close();
192 TCPMessageChannel next = (TCPMessageChannel) incomingMCIterator.next(); local
193 next.close();
|
| /external/skia/src/pathops/ |
| SkIntersectionHelper.h | 71 bool isAdjacent(const SkIntersectionHelper& next) {
72 return fContour == next.fContour && fIndex + 1 == next.fIndex;
75 bool isFirstLast(const SkIntersectionHelper& next) {
76 return fContour == next.fContour && fIndex == 0
77 && next.fIndex == fLast - 1;
|
| /external/zlib/src/ |
| inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
203 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = here;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next table *
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_iter.pass.cpp | 31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
39 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
47 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
62 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
70 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
78 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter.pass.cpp | 31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
39 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
47 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
69 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
77 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
85 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| erase_iter_iter.pass.cpp | 32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
40 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
48 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
63 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
71 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
79 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
|
| /system/core/fastbootd/ |
| protocol.c | 47 struct fastboot_cmd *next; member in struct:fastboot_cmd
54 struct fastboot_var *next; member in struct:fastboot_var
70 cmd->next = cmdlist;
84 var->next = varlist;
93 for (var = varlist; var; var = var->next) {
157 for (cmd = cmdlist; cmd; cmd = cmd->next) {
|
| /system/core/libutils/ |
| LinearAllocator.cpp | 88 Page* next() { return mNextPage; } function in class:android::LinearAllocator::Page
89 void setNext(Page* next) { mNextPage = next; }
124 Page* next = p->next(); local
128 p = next;
|
| /system/core/libzipfile/ |
| zipfile.c | 35 Zipentry* next = entry->next; local
37 entry = next;
51 entry = entry->next;
143 entry = entry->next;
156 entry = entry->next;
|
| /system/core/sh/ |
| nodes.c.pat | 101 lp = lp->next;
131 lp = lp->next;
132 lpp = &(*lpp)->next;
|
| /libcore/luni/src/main/java/java/util/ |
| HashMap.java | 308 e != null; e = e.next) {
338 e != null; e = e.next) {
369 for (HashMapEntry e = tab[i]; e != null; e = e.next) {
380 for (HashMapEntry e = tab[i]; e != null; e = e.next) {
407 for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
471 for (HashMapEntry<K, V> e = first; e != null; e = e.next) {
553 HashMapEntry<K, V> oldNext = e.next;
557 e.next = newNext;
606 for (HashMapEntry<K, V> n = e.next; n != null; e = n, n = n.next) {
741 HashMapEntry<K, V> next; field in class:HashMap.HashMapEntry
792 HashMapEntry<K, V> next = null; local
812 HashMapEntry<K, V> next = entryToReturn.next; local
833 public K next() { return nextEntry().key; } method in class:HashMap.KeyIterator
838 public V next() { return nextEntry().value; } method in class:HashMap.ValueIterator
843 public Entry<K, V> next() { return nextEntry(); } method in class:HashMap.EntryIterator
[all...] |
| /bionic/libc/bionic/ |
| malloc_debug_leak.cpp | 121 entry = entry->next;
153 entry->next = gHashTable.slots[slot];
161 if (entry->next != NULL) {
162 entry->next->prev = entry;
183 e1 = e1->next;
193 HashEntry* next = entry->next; local
195 if (prev != NULL) entry->prev->next = next;
196 if (next != NULL) entry->next->prev = prev
[all...] |
| /device/asus/flo/camera/QCamera2/stack/common/ |
| cam_queue.h | 79 pos = head->next;
103 pos = head->next;
107 pos = pos->next;
|
| /external/bison/src/ |
| derives.c | 34 struct rule_list *next; member in struct:rule_list
83 p->next = dset[lhs - ntokens];
101 p = p->next;
|
| /external/chromium/third_party/libevent/ |
| http-internal.h | 55 TAILQ_ENTRY(evhttp_connection) (next);
95 TAILQ_ENTRY(evhttp_cb) next; member in struct:evhttp_cb
108 TAILQ_ENTRY(evhttp_bound_socket) (next);
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
| ContentData.cpp | 60 for (const ContentData* contentData = next(); contentData; contentData = contentData->next()) {
63 lastNewData = lastNewData->next();
|
| /external/chromium_org/third_party/libevent/ |
| http-internal.h | 55 TAILQ_ENTRY(evhttp_connection) (next);
95 TAILQ_ENTRY(evhttp_cb) next; member in struct:evhttp_cb
108 TAILQ_ENTRY(evhttp_bound_socket) (next);
|
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| ft_hash.c | 72 HashElem *next_elem = elem->next;
211 pNew->next = pHead;
213 if( pHead->prev ){ pHead->prev->next = pNew; }
217 pNew->next = pH->first;
245 next_elem = elem->next;
273 elem = elem->next;
289 elem->prev->next = elem->next;
291 pH->first = elem->next;
293 if( elem->next ){
[all...] |
| fts1_hash.c | 79 fts1HashElem *next_elem = elem->next;
169 pNew->next = pHead;
171 if( pHead->prev ){ pHead->prev->next = pNew; }
175 pNew->next = pH->first;
203 next_elem = elem->next;
231 elem = elem->next;
247 elem->prev->next = elem->next;
249 pH->first = elem->next;
251 if( elem->next ){
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts2/ |
| fts2_hash.c | 84 fts2HashElem *next_elem = elem->next;
174 pNew->next = pHead;
176 if( pHead->prev ){ pHead->prev->next = pNew; }
180 pNew->next = pH->first;
208 next_elem = elem->next;
236 elem = elem->next;
252 elem->prev->next = elem->next;
254 pH->first = elem->next;
256 if( elem->next ){
[all...] |
