HomeSort by relevance Sort by last modified time
    Searched full:nextchild (Results 1 - 25 of 56) sorted by null

1 2 3

  /external/autotest/frontend/client/src/autotest/common/
DomUtils.java 9 Element nextChild = child.getNextSiblingElement();
11 child = nextChild;
  /external/llvm/include/llvm/ADT/
SCCIterator.h 52 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
56 : Node(Node), NextChild(Child), MinVisited(Min) {}
60 NextChild == Other.NextChild &&
156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
158 NodeType *childN = *VisitStack.back().NextChild++;
181 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 54 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
62 NextChild == Other.NextChild &&
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++;
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 54 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
62 NextChild == Other.NextChild &&
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++;
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 54 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
62 NextChild == Other.NextChild &&
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++;
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 54 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
62 NextChild == Other.NextChild &&
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++;
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 54 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
62 NextChild == Other.NextChild &&
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++;
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 54 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
62 NextChild == Other.NextChild &&
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++;
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 54 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
62 NextChild == Other.NextChild &&
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++;
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 54 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
62 NextChild == Other.NextChild &&
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++;
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  /external/webrtc/webrtc/libjingle/xmpp/
discoitemsquerytask.cc 37 child = child->NextChild()) {
pubsub_task.cc 139 child = child->NextChild()) {
166 child = child->NextChild()) {
xmppengineimpl_iq.cc 210 child = child->NextChild()) {
  /external/compiler-rt/test/asan/TestCases/Linux/
swapcontext_annotation.cc 45 void NextChild() {
50 printf("NextChild: %p\n", x);
86 makecontext(&next_child_context, (void (*)())NextChild, 0);
  /tools/loganalysis/src/com/android/loganalysis/util/
RegexTrie.java 131 RegexTrie<V> nextChild = mChildren.get(curKey);
132 if (nextChild == null) {
133 nextChild = new RegexTrie<V>();
134 mChildren.put(curKey, nextChild);
136 return nextChild.recursivePut(value, nextKeys);
  /tools/tradefederation/core/src/com/android/tradefed/util/
RegexTrie.java 131 RegexTrie<V> nextChild = mChildren.get(curKey);
132 if (nextChild == null) {
133 nextChild = new RegexTrie<V>();
134 mChildren.put(curKey, nextChild);
136 return nextChild.recursivePut(value, nextKeys);
  /external/webrtc/webrtc/libjingle/xmllite/
xmlelement_unittest.cc 58 elt.FirstChild()->AsElement()->FirstChild()->NextChild();
162 pelCopy = new XmlElement(*(element->FirstChild()->NextChild()->AsElement()));
195 EXPECT_EQ(element->FirstChild()->NextChild(),
xmlelement.h 29 XmlChild* NextChild() { return next_child_; }
30 const XmlChild* NextChild() const { return next_child_; }
xmlelement.cc 91 for (pChild = elt.first_child_; pChild; pChild = pChild->NextChild()) {
438 next_child = child->NextChild();
xmlprinter.cc 121 child = child->NextChild();
  /packages/apps/Settings/src/com/android/settings/
MasterClear.java 281 View nextChild = vGroup.getChildAt(i);
282 getContentDescription(nextChild, description);
  /frameworks/base/core/java/com/android/internal/widget/
ResolverDrawerLayout.java 586 final View nextChild = getChildAt(i);
587 if (nextChild.getVisibility() == GONE) {
590 clipEdge = Math.min(clipEdge, nextChild.getTop());
    [all...]
  /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/stack/
StackScrollAlgorithm.java 209 View nextChild = algorithmState.visibleChildren.get(childIndex + 1);
210 if (!draggedViews.contains(nextChild)) {
214 nextChild);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/resources/
ResourceHelper.java 376 Node nextChild = lastElement != null ? lastElement.getNextSibling() : null;
378 root.insertBefore(indentNode, nextChild);
390 root.insertBefore(element, nextChild);
  /packages/apps/Car/libs/car-stream-ui-lib/src/com/android/car/view/
CarLayoutManager.java     [all...]

Completed in 1130 milliseconds

1 2 3