/external/mockito/src/org/mockito/internal/progress/ |
H A D | SequenceNumber.java | 11 public static synchronized int next() {
method in class:SequenceNumber
|
/external/owasp/sanitizer/src/main/org/owasp/html/ |
H A D | TokenStream.java | 32 HtmlToken next(); method in interface:TokenStream
|
/external/libcxx/test/std/containers/associative/map/map.modifiers/ |
H A D | erase_key.pass.cpp | 45 assert(next(m.begin())->first == 2); 46 assert(next(m.begin())->second == 2.5); 47 assert(next(m.begin(), 2)->first == 3); 48 assert(next(m.begin(), 2)->second == 3.5); 49 assert(next(m.begin(), 3)->first == 4); 50 assert(next(m.begin(), 3)->second == 4.5); 51 assert(next(m.begin(), 4)->first == 5); 52 assert(next(m.begin(), 4)->second == 5.5); 53 assert(next(m.begin(), 5)->first == 6); 54 assert(next( [all...] |
H A D | erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3)); 42 assert(i == next(m.begin(), 3)); 45 assert(next(m.begin())->first == 2); 46 assert(next(m.begin())->second == 2.5); 47 assert(next(m.begin(), 2)->first == 3); 48 assert(next(m.begin(), 2)->second == 3.5); 49 assert(next(m.begin(), 3)->first == 5); 50 assert(next(m.begin(), 3)->second == 5.5); 51 assert(next(m.begin(), 4)->first == 6); 52 assert(next( [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | kernel-list.h | 9 * sometimes we already know the next/prev entries and we can 15 struct list_head *next, *prev; member in struct:list_head 21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 32 * the prev/next entries already! 36 struct list_head * next) 38 next->prev = new; 39 new->next = next; 41 prev->next = new; 49 __list_add(new, head, head->next); 34 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument 67 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/elfutils/src/lib/ |
H A D | list.h | 36 assert (_newp->next == NULL); \ 39 (first) = _newp->next = _newp->previous = _newp; \ 42 _newp->next = (first); \ 44 _newp->previous->next = _newp->next->previous = _newp; \ 55 || ({ __typeof (elem) _runp = first->next; \ 60 _runp = _runp->next; \ 62 if (unlikely (_elem->next == _elem)) \ 66 _elem->next->previous = _elem->previous; \ 67 _elem->previous->next [all...] |
/external/elfutils/src/libdwfl/ |
H A D | dwfl_end.c | 44 Dwfl_Module *next = dwfl->modulelist; local 45 while (next != NULL) 47 Dwfl_Module *dead = next; 48 next = dead->next;
|
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
H A D | erase_key.pass.cpp | 44 assert(next(m.begin(), 0)->first == 1); 45 assert(next(m.begin(), 0)->second == 1); 46 assert(next(m.begin(), 1)->first == 1); 47 assert(next(m.begin(), 1)->second == 1.5); 48 assert(next(m.begin(), 2)->first == 1); 49 assert(next(m.begin(), 2)->second == 2); 50 assert(next(m.begin(), 3)->first == 3); 51 assert(next(m.begin(), 3)->second == 1); 52 assert(next(m.begin(), 4)->first == 3); 53 assert(next( [all...] |
H A D | insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 1); 46 assert(next(m.begin())->second == 1.5); 47 assert(next(m.begin(), 2)->first == 1); 48 assert(next(m.begin(), 2)->second == 2); 49 assert(next(m.begin(), 3)->first == 2); 50 assert(next(m.begin(), 3)->second == 1); 51 assert(next(m.begin(), 4)->first == 2); 52 assert(next(m.begin(), 4)->second == 1.5); 53 assert(next(m.begin(), 5)->first == 2); 54 assert(next( [all...] |
/external/f2fs-tools/include/ |
H A D | list.h | 14 struct list_head *next, *prev; member in struct:list_head 24 list->next = list; 30 struct list_head *next) 32 next->prev = new; 33 new->next = next; 35 prev->next = new; 40 __list_add(new, head, head->next); 48 static inline void __list_del(struct list_head * prev, struct list_head * next) argument 50 next 28 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \ 48 (elem)->prev->next = (elem)->next; \ 49 (elem)->next = elem; \ 62 (elem)->next = (list)->next; \ 63 (list)->next->prev = elem; \ 64 (list)->next = elem; \ 75 (elem)->next = list; \ 77 (list)->prev->next [all...] |
/external/mesa3d/src/mesa/main/ |
H A D | simple_list.h | 45 struct simple_node *next; member in struct:simple_node 56 (elem)->next->prev = (elem)->prev; \ 57 (elem)->prev->next = (elem)->next; \ 69 (elem)->next = (list)->next; \ 70 (list)->next->prev = elem; \ 71 (list)->next = elem; \ 82 (elem)->next = list; \ 84 (list)->prev->next [all...] |
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | erase_key.pass.cpp | 44 assert(*next(m.begin(), 0) == 3); 45 assert(*next(m.begin(), 1) == 3); 46 assert(*next(m.begin(), 2) == 3); 47 assert(*next(m.begin(), 3) == 5); 48 assert(*next(m.begin(), 4) == 5); 49 assert(*next(m.begin(), 5) == 5); 50 assert(*next(m.begin(), 6) == 7); 51 assert(*next(m.begin(), 7) == 7); 52 assert(*next(m.begin(), 8) == 7); 57 assert(*next( [all...] |
/external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
H A D | copy.pass.cpp | 46 assert(*next(m.begin(), 0) == 1); 47 assert(*next(m.begin(), 1) == 1); 48 assert(*next(m.begin(), 2) == 1); 49 assert(*next(m.begin(), 3) == 2); 50 assert(*next(m.begin(), 4) == 2); 51 assert(*next(m.begin(), 5) == 2); 52 assert(*next(m.begin(), 6) == 3); 53 assert(*next(m.begin(), 7) == 3); 54 assert(*next(m.begin(), 8) == 3); 60 assert(*next(m [all...] |
H A D | copy_assign.pass.cpp | 47 assert(*next(m.begin(), 0) == 1); 48 assert(*next(m.begin(), 1) == 1); 49 assert(*next(m.begin(), 2) == 1); 50 assert(*next(m.begin(), 3) == 2); 51 assert(*next(m.begin(), 4) == 2); 52 assert(*next(m.begin(), 5) == 2); 53 assert(*next(m.begin(), 6) == 3); 54 assert(*next(m.begin(), 7) == 3); 55 assert(*next(m.begin(), 8) == 3); 61 assert(*next(m [all...] |
H A D | iter_iter_comp.pass.cpp | 44 assert(*next(m.begin(), 0) == 1); 45 assert(*next(m.begin(), 1) == 1); 46 assert(*next(m.begin(), 2) == 1); 47 assert(*next(m.begin(), 3) == 2); 48 assert(*next(m.begin(), 4) == 2); 49 assert(*next(m.begin(), 5) == 2); 50 assert(*next(m.begin(), 6) == 3); 51 assert(*next(m.begin(), 7) == 3); 52 assert(*next(m.begin(), 8) == 3);
|
H A D | copy_alloc.pass.cpp | 45 assert(*next(m.begin(), 0) == 1); 46 assert(*next(m.begin(), 1) == 1); 47 assert(*next(m.begin(), 2) == 1); 48 assert(*next(m.begin(), 3) == 2); 49 assert(*next(m.begin(), 4) == 2); 50 assert(*next(m.begin(), 5) == 2); 51 assert(*next(m.begin(), 6) == 3); 52 assert(*next(m.begin(), 7) == 3); 53 assert(*next(m.begin(), 8) == 3); 59 assert(*next(m [all...] |
H A D | iter_iter_alloc.pass.cpp | 49 assert(*next(m.begin(), 0) == 1); 50 assert(*next(m.begin(), 1) == 1); 51 assert(*next(m.begin(), 2) == 1); 52 assert(*next(m.begin(), 3) == 2); 53 assert(*next(m.begin(), 4) == 2); 54 assert(*next(m.begin(), 5) == 2); 55 assert(*next(m.begin(), 6) == 3); 56 assert(*next(m.begin(), 7) == 3); 57 assert(*next(m.begin(), 8) == 3); 80 assert(*next( [all...] |
/external/e2fsprogs/lib/blkid/ |
H A D | list.h | 19 * sometimes we already know the next/prev entries and we can 25 struct list_head *next, *prev; member in struct:list_head 31 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 38 * the prev/next entries already! 42 struct list_head * next) 44 next->prev = add; 45 add->next = next; 47 prev->next = add; 60 __list_add(add, head, head->next); 40 __list_add(struct list_head * add, struct list_head * prev, struct list_head * next) argument 83 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/v8/tools/ |
H A D | consarray.js | 56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null); 72 * Returns the current item, moves to the next one. 74 ConsArray.prototype.next = function() { 77 this.currCell_ = this.currCell_.next; 89 ConsArray.Cell = function(data, next) { 91 this.next = next;
|
/external/parameter-framework/test/tokenizer/ |
H A D | Test.cpp | 48 THEN("next() api should work") { 49 CHECK(tokenizer.next() == "a"); 50 CHECK(tokenizer.next() == "bcd"); 51 CHECK(tokenizer.next() == "ef"); 52 CHECK(tokenizer.next() == ""); 67 THEN("next() api should work") { 68 CHECK(tokenizer.next() == ""); 80 THEN("next() api should work") { 81 CHECK(tokenizer.next() == "a"); 82 CHECK(tokenizer.next() [all...] |
/external/fio/lib/ |
H A D | flist_sort.c | 23 tail->next = a; 24 a = a->next; 26 tail->next = b; 27 b = b->next; 29 tail = tail->next; 31 tail->next = a?:b; 32 return head.next; 53 tail->next = a; 55 a = a->next; 57 tail->next [all...] |
/external/libcxx/test/std/containers/associative/map/map.ops/ |
H A D | equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0)); 44 assert(r.second == next(m.begin(), 1)); 46 assert(r.first == next(m.begin(), 1)); 47 assert(r.second == next(m.begin(), 2)); 49 assert(r.first == next(m.begin(), 2)); 50 assert(r.second == next(m.begin(), 3)); 52 assert(r.first == next(m.begin(), 3)); 53 assert(r.second == next(m.begin(), 4)); 55 assert(r.first == next(m.begin(), 4)); 56 assert(r.second == next( [all...] |
/external/clang/test/CodeGen/ |
H A D | disable-tail-calls.c | 4 struct List *next; member in struct:List 15 return find(head->next, data);
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | erase_after_one.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4)); 30 assert(*next(c.begin(), 0) == 0); 31 assert(*next(c.begin(), 1) == 1); 32 assert(*next(c.begin(), 2) == 2); 33 assert(*next(c.begin(), 3) == 3); 35 i = c.erase_after(next(c.cbefore_begin(), 0)); 38 assert(*next(c.begin(), 0) == 1); 39 assert(*next(c.begin(), 1) == 2); 40 assert(*next(c.begin(), 2) == 3); 42 i = c.erase_after(next( [all...] |