| /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;
|
| /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...] |
| /frameworks/base/telephony/java/com/android/internal/telephony/ |
| ATResponseParser.java | 27 private int next = 0; field in class:ATResponseParser
92 return next < line.length();
100 if (next == 0) {
104 if (next >= len) {
111 char c = line.charAt(next++);
117 if (next >= len) {
120 c = line.charAt(next++);
121 tokStart = next - 1;
122 while (c != '"' && next < len) {
123 c = line.charAt(next++)
[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)
|
| /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/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...] |
| /external/e2fsprogs/lib/ext2fs/ |
| 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
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
39 struct list_head * next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
52 __list_add(new, head, head->next);
[all...] |
| /external/elfutils/lib/ |
| list.h | 57 assert (_newp->next == NULL); \
60 (first) = _newp->next = _newp->previous = _newp; \
63 _newp->next = (first); \
65 _newp->previous->next = _newp->next->previous = _newp; \
76 || ({ __typeof (elem) _runp = first->next; \
81 _runp = _runp->next; \
83 if (unlikely (_elem->next == _elem)) \
87 _elem->next->previous = _elem->previous; \
88 _elem->previous->next = _elem->next;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| simple_list.h | 41 struct simple_node *next; member in struct:simple_node
52 (elem)->next->prev = (elem)->prev; \
53 (elem)->prev->next = (elem)->next; \
65 (elem)->next = (list)->next; \
66 (list)->next->prev = elem; \
67 (list)->next = elem; \
78 (elem)->next = list; \
80 (list)->prev->next = elem;
[all...] |
| /external/kernel-headers/original/linux/ |
| list.h | 16 * sometimes we already know the next/prev entries and we can
22 struct list_head *next, *prev; member in struct:list_head
32 list->next = list;
40 * the prev/next entries already!
44 struct list_head *next)
46 next->prev = new;
47 new->next = next;
49 prev->next = new;
62 __list_add(new, head, head->next);
302 struct list_head *next = head->next; local
597 struct hlist_node *next, **pprev; member in struct:hlist_node
621 struct hlist_node *next = n->next; local
678 struct hlist_node *next = old->next; local
[all...] |
| /external/dhcpcd/ |
| if-pref.c | 81 if (!ifaces || !ifaces->next)
84 ifaces = ifaces->next;
85 sorted->next = NULL;
86 for (ifp = ifaces; ifp && (ifn = ifp->next, 1); ifp = ifn) {
89 ifp->next = sorted;
94 for (ift = sorted; ift->next; ift = ift->next) {
95 if (ifcmp(ifp, ift->next) == -1) {
96 ifp->next = ift->next;
[all...] |
| /external/v8/src/ |
| unbound-queue-inl.h | 39 : value(value), next(NULL) {
43 Node* next; member in struct:v8::internal::UnboundQueue::Node
63 first_ = tmp->next;
71 Node* next = reinterpret_cast<Node*>(divider_)->next; local
72 *rec = next->value;
73 OS::ReleaseStore(÷r_, reinterpret_cast<AtomicWord>(next));
79 Node*& next = reinterpret_cast<Node*>(last_)->next; local
80 next = new Node(rec)
89 Node* next = reinterpret_cast<Node*>(divider_)->next; local
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| 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
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 * the prev/next entries already!
45 struct list_head * next)
47 next->prev = add;
48 add->next = next;
50 prev->next = add;
63 __list_add(add, head, head->next);
[all...] |
