| /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/bison/src/ |
| AnnotationList.h | 39 /** The next node in the list or \c NULL if none. */
40 struct AnnotationList *next; member in struct:AnnotationList
|
| reader.h | 32 struct merger_list* next; member in struct:merger_list
|
| /external/chromium_org/components/policy/core/common/ |
| generate_policy_source_unittest.cc | 77 const char** next = kExpectedProperties; local
79 !it.IsAtEnd(); it.Advance(), ++next) {
80 ASSERT_TRUE(*next != NULL);
81 EXPECT_STREQ(*next, it.key());
85 EXPECT_TRUE(*next == NULL);
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeTraversal.h | 34 // Does a pre-order traversal of the tree to find the next node after this one.
38 Node* next(const Node&);
39 Node* next(const Node&, const Node* stayWithin);
40 Node* next(const ContainerNode&);
41 Node* next(const ContainerNode&, const Node* stayWithin);
43 // Like next, but skips children and starts with the next sibling.
52 // Like previous, but skips children and starts with the next sibling.
55 // Like next, but visits parents after their children.
79 inline Node* next(const Node& current) { return traverseNextTemplate(current); function in namespace:WebCore::NodeTraversal
80 inline Node* next(const ContainerNode& current) { return traverseNextTemplate(current); } function in namespace:WebCore::NodeTraversal
93 inline Node* next(const Node& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); } function in namespace:WebCore::NodeTraversal
94 inline Node* next(const ContainerNode& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); } function in namespace:WebCore::NodeTraversal
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| BidiRun.h | 51 BidiRun* next() { return static_cast<BidiRun*>(m_next); } function in struct:WebCore::BidiRun
|
| RenderLayerStackingNodeIterator.cpp | 39 RenderLayerStackingNode* RenderLayerStackingNodeIterator::next() function in class:WebCore::RenderLayerStackingNodeIterator
71 RenderLayerStackingNode* RenderLayerStackingNodeReverseIterator::next() function in class:WebCore::RenderLayerStackingNodeReverseIterator
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| fpositer.cpp | 90 UBool FieldPositionIterator::next(FieldPosition& fp) { function in class:FieldPositionIterator
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/ |
| sp_quad_pipe.h | 15 * next paragraph) shall be included in all copies or substantial portions
47 struct quad_stage *next; member in struct:quad_stage
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
| parse.h | 9 struct Symbol *next; member in struct:Symbol
|
| /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/e2fsprogs/lib/et/ |
| error_table.h | 18 struct et_list *next; member in struct:et_list
|
| /external/iproute2/genl/ |
| genl_utils.h | 9 struct genl_util *next; member in struct:genl_util
|
| /external/ipsec-tools/src/racoon/ |
| grabmyaddr.h | 38 struct myaddrs *next; member in struct:myaddrs
|
| throttle.h | 39 TAILQ_ENTRY(throttle_entry) next; member in struct:throttle_entry
|
| /external/linux-tools-perf/util/ |
| parse-events.h | 23 struct tracepoint_path *next; member in struct:tracepoint_path
|
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_quad_pipe.h | 15 * next paragraph) shall be included in all copies or substantial portions
47 struct quad_stage *next; member in struct:quad_stage
|
| /external/mockito/src/org/mockito/internal/progress/ |
| SequenceNumber.java | 11 public static synchronized int next() {
method in class:SequenceNumber
|
| /external/oprofile/opjitconv/ |
| conversion.c | 20 struct jitentry * entry, * next; local
22 for (entry = jitentry_list; entry; entry = next) {
25 next = entry->next;
33 struct jitentry_debug_line * entry, * next; local
35 for (entry = jitentry_debug_line_list; entry; entry = next) {
36 next = entry->next;
|
| /external/qemu/android/ |
| config.h | 24 AConfig* next; member in struct:AConfig
|
| /external/qemu/ |
| notify.c | 34 Notifier *notifier, *next; local
36 QTAILQ_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
|
| /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/stlport/test/eh/ |
| test_push_front.h | 38 typename C::const_iterator next = c.begin(); local
40 EH_ASSERT( EH_STD::equal( original.begin(), original.end(), ++next ) );
|
| /external/valgrind/main/include/ |
| pub_tool_hashtable.h | 45 struct _VgHashNode * next; member in struct:_VgHashNode
81 next one. Returns NULL if the last one has been passed, or if
|
