/external/srec/config/en.us/dictionary/ |
cmu2nuance.cpp | 78 const char* next = 0; local 80 (next=xlate(p, "AA1 R", ")r")) || // odd AA D 81 (next=xlate(p, "AA0", "o")) || // odd AA D 82 (next=xlate(p, "AA1", "o")) || // odd AA D 83 (next=xlate(p, "AA2", "o")) || // odd AA D 85 (next=xlate(p, "AE0", "a")) || // at AE T 86 (next=xlate(p, "AE1", "a")) || // at AE T 87 (next=xlate(p, "AE2", "a")) || // at AE T 89 // (next=xlate(p, "AH0 L", "L")) || // drops accuracy by 1% 90 (next=xlate(p, "AH0 N", "~")) || // hut HH AH T - from jea [all...] |
/external/clang/test/CodeGen/ |
pragma-pack-1.c | 6 struct ref *next; member in struct:ref
|
debug-info-var-location.c | 4 // CHECK-NEXT: byte 145 9 struct s *next; member in struct:s 16 struct s *sp = s->next;
|
/external/libusb-compat/libusb/ |
usbi.h | 28 ent->next = begin; \ 29 ent->next->prev = ent; \ 31 ent->next = NULL; \ 39 ent->prev->next = ent->next; \ 41 begin = ent->next; \ 42 if (ent->next) \ 43 ent->next->prev = ent->prev; \ 45 ent->next = NULL; \
|
/external/elfutils/libdwfl/ |
dwfl_end.c | 62 Dwfl_Module *next = dwfl->modulelist; local 63 while (next != NULL) 65 Dwfl_Module *dead = next; 66 next = dead->next;
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
erase_after_many.pass.cpp | 25 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4)); 26 assert(i == next(c.cbefore_begin(), 4)); 28 assert(*next(c.begin(), 0) == 0); 29 assert(*next(c.begin(), 1) == 1); 30 assert(*next(c.begin(), 2) == 2); 31 assert(*next(c.begin(), 3) == 3); 32 assert(*next(c.begin(), 4) == 4); 33 assert(*next(c.begin(), 5) == 5); 34 assert(*next(c.begin(), 6) == 6) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multiset/ |
erase_iter_iter.pass.cpp | 38 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); 40 assert(i == next(m.begin(), 5)); 41 assert(*next(m.begin(), 0) == 1); 42 assert(*next(m.begin(), 1) == 2); 43 assert(*next(m.begin(), 2) == 3); 44 assert(*next(m.begin(), 3) == 4); 45 assert(*next(m.begin(), 4) == 5); 46 assert(*next(m.begin(), 5) == 6); 47 assert(*next(m.begin(), 6) == 7) [all...] |
erase_key.pass.cpp | 42 assert(*next(m.begin(), 0) == 3); 43 assert(*next(m.begin(), 1) == 3); 44 assert(*next(m.begin(), 2) == 3); 45 assert(*next(m.begin(), 3) == 5); 46 assert(*next(m.begin(), 4) == 5); 47 assert(*next(m.begin(), 5) == 5); 48 assert(*next(m.begin(), 6) == 7); 49 assert(*next(m.begin(), 7) == 7); 50 assert(*next(m.begin(), 8) == 7); 55 assert(*next(m.begin(), 0) == 3) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/set/ |
erase_iter_iter.pass.cpp | 38 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); 40 assert(i == next(m.begin(), 5)); 41 assert(*next(m.begin(), 0) == 1); 42 assert(*next(m.begin(), 1) == 2); 43 assert(*next(m.begin(), 2) == 3); 44 assert(*next(m.begin(), 3) == 4); 45 assert(*next(m.begin(), 4) == 5); 46 assert(*next(m.begin(), 5) == 6); 47 assert(*next(m.begin(), 6) == 7) [all...] |
/external/qemu/android/utils/ |
list.h | 19 * - List entries contain references to the next, and the previous entry in the 22 * in its 'next' reference, and the "list head" references the "last" entry in 24 * - The list is empty if its 'next' and 'previous' references are addressing the 29 /* Next entry in the list */ 30 ACList* next; member in struct:ACList 39 list->next = list->prev = list; 46 return list->next == list; 53 ACList* const next = list->next; local 54 entry->next = next 75 ACList* const next = entry->next; local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.modifiers/ |
erase_key.pass.cpp | 42 assert(next(m.begin(), 0)->first == 1); 43 assert(next(m.begin(), 0)->second == 1); 44 assert(next(m.begin(), 1)->first == 1); 45 assert(next(m.begin(), 1)->second == 1.5); 46 assert(next(m.begin(), 2)->first == 1); 47 assert(next(m.begin(), 2)->second == 2); 48 assert(next(m.begin(), 3)->first == 3); 49 assert(next(m.begin(), 3)->second == 1); 50 assert(next(m.begin(), 4)->first == 3); 51 assert(next(m.begin(), 4)->second == 1.5) [all...] |
insert_iter_iter.pass.cpp | 44 assert(next(m.begin())->first == 1); 45 assert(next(m.begin())->second == 1.5); 46 assert(next(m.begin(), 2)->first == 1); 47 assert(next(m.begin(), 2)->second == 2); 48 assert(next(m.begin(), 3)->first == 2); 49 assert(next(m.begin(), 3)->second == 1); 50 assert(next(m.begin(), 4)->first == 2); 51 assert(next(m.begin(), 4)->second == 1.5); 52 assert(next(m.begin(), 5)->first == 2); 53 assert(next(m.begin(), 5)->second == 2) [all...] |
erase_iter.pass.cpp | 39 I i = m.erase(next(m.cbegin(), 3)); 41 assert(i == next(m.begin(), 3)); 44 assert(next(m.begin())->first == 1); 45 assert(next(m.begin())->second == 1.5); 46 assert(next(m.begin(), 2)->first == 1); 47 assert(next(m.begin(), 2)->second == 2); 48 assert(next(m.begin(), 3)->first == 2); 49 assert(next(m.begin(), 3)->second == 1.5); 50 assert(next(m.begin(), 4)->first == 2); 51 assert(next(m.begin(), 4)->second == 2) [all...] |
/external/iptables/libiptc/ |
linux_list.h | 48 * sometimes we already know the next/prev entries and we can 54 struct list_head *next, *prev; member in struct:list_head 63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 70 * the prev/next entries already! 74 struct list_head *next) 76 next->prev = new; 77 new->next = next; 79 prev->next = new; 92 __list_add(new, head, head->next); 279 struct list_head *next = head->next; local 514 struct hlist_node *next, **pprev; member in struct:hlist_node 534 struct hlist_node *next = n->next; local [all...] |
/bionic/libc/stdio/ |
glue.h | 40 struct glue *next; member in struct:glue
|
/dalvik/dexgen/src/com/android/dexgen/util/ |
IntIterator.java | 25 * Checks to see if the iterator has a next value. 27 * @return true if next() will succeed 32 * Returns the next value in the iterator. 34 * @return next value 35 * @throws java.util.NoSuchElementException if no next element exists 37 int next(); method in interface:IntIterator
|
/dalvik/dx/src/com/android/dx/util/ |
IntIterator.java | 25 * Checks to see if the iterator has a next value. 27 * @return true if next() will succeed 32 * Returns the next value in the iterator. 34 * @return next value 35 * @throws java.util.NoSuchElementException if no next element exists 37 int next(); method in interface:IntIterator
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ |
DTMAxisTraverser.java | 38 * nodeHandle=myTraverser.next(myContext,nodeHandle)) 61 return next(context, context); 80 return next(context, context, extendedTypeID); 84 * Traverse to the next node after the current node. 94 * @return the next node in the iteration, or DTM.NULL. 97 public abstract int next(int context, int current); method in class:DTMAxisTraverser 100 * Traverse to the next node after the current node that is matched 112 * @return the next node in the iteration, or DTM.NULL. 115 public abstract int next(int context, int current, int extendedTypeID); method in class:DTMAxisTraverser
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
IntIterator.java | 25 * Checks to see if the iterator has a next value. 27 * @return true if next() will succeed 32 * Returns the next value in the iterator. 34 * @return next value 35 * @throws java.util.NoSuchElementException if no next element exists 37 int next(); method in interface:IntIterator
|
/external/linux-tools-perf/util/include/linux/ |
list.h | 26 begin->prev->next = end->next; 27 end->next->prev = begin->prev; 36 for (; pos != (head); pos = pos->next)
|
/external/mockito/src/org/mockito/internal/progress/ |
SequenceNumber.java | 11 public static synchronized int next() {
method in class:SequenceNumber
|
/libcore/luni/src/main/java/java/util/ |
Iterator.java | 24 * methods {@code next} and {@code hasNext()} may throw a {@code ConcurrentModificationException}. 38 * @see #next 43 * Returns the next object and advances the iterator. 45 * @return the next object. 50 public E next(); method in interface:Iterator 53 * Removes the last object returned by {@code next} from the collection. 54 * This method can only be called once between each call to {@code next}. 60 * if {@code next} has not been called, or {@code remove} has 61 * already been called after the last call to {@code next}.
|
/external/clang/test/CodeGenCXX/ |
function-template-specialization.cpp | 3 T* next(T* ptr, const U& diff); 6 T* next(T* ptr, const U& diff) { function 12 iptr = next(iptr, diff); 15 fptr = next(fptr, diff); 19 T* next(T* ptr, const U& diff); 22 iptr = next(iptr, diff); 25 dptr = next(dptr, diff);
|
/external/libvpx/libvpx/nestegg/halloc/src/ |
hlist.h | 32 hlist_item_t * next; member in struct:hlist_head 37 hlist_item_t * next; member in struct:hlist_item 50 #define __hlist_init_item(i) { &hlist_null, &(i).next } 76 for (i = (h)->next; i != &hlist_null; i = i->next) 79 for (i = (h)->next, tmp = i->next; \ 81 i = tmp, tmp = i->next) 89 h->next = &hlist_null; 95 i->prev = &i->next; 101 hlist_item_t * next; local 112 hlist_item_t * next; local [all...] |
/external/webkit/Source/JavaScriptCore/wtf/ |
DecimalNumber.cpp | 108 UChar* next = buffer; local 116 *next++ = '-'; 117 *next++ = '0'; 118 *next++ = '.'; 120 *next++ = '0'; 122 *next++ = m_significand[i]; 124 return next - buffer; 134 *next++ = '-'; 136 *next++ = m_significand[i]; 138 *next++ = '0' 164 UChar* next = buffer; local [all...] |