Home
last modified time | relevance | path

Searched refs:depthFirstSearch (Results 1 – 3 of 3) sorted by relevance

/packages/apps/Car/RotaryController/src/com/android/car/rotary/
DTreeTraverser.java80 AccessibilityNodeInfo depthFirstSearch(@NonNull AccessibilityNodeInfo node, in depthFirstSearch() method in TreeTraverser
82 return depthFirstSearch(node, /* skipPredicate= */ null, targetPredicate); in depthFirstSearch()
94 AccessibilityNodeInfo depthFirstSearch(@NonNull AccessibilityNodeInfo node, in depthFirstSearch() method in TreeTraverser
108 AccessibilityNodeInfo result = depthFirstSearch(child, skipPredicate, targetPredicate); in depthFirstSearch()
DNavigator.java386 return mTreeTraverser.depthFirstSearch( in findFocusParkingViewInRoot()
400 return mTreeTraverser.depthFirstSearch(root, /* targetPredicate= */ Utils::isSurfaceView); in findSurfaceViewInRoot()
601 AccessibilityNodeInfo focusableDescendant = mTreeTraverser.depthFirstSearch(webView, in webViewHasFocusableDescendants()
720 return mTreeTraverser.depthFirstSearch(clientNode, this::isHostNode); in getDescendantHostRoot()
796 return mTreeTraverser.depthFirstSearch(node, in findFirstFocusableDescendant()
807 return mTreeTraverser.depthFirstSearch(node, in findFirstOrphan()
926 AccessibilityNodeInfo candidate = mTreeTraverser.depthFirstSearch(node, in isCandidate()
1096 return mTreeTraverser.depthFirstSearch(root, in findFirstFocusableDescendantInVirtualRoot()
1133 return mTreeTraverser.depthFirstSearch(root,
/packages/apps/Car/RotaryController/tests/unit/src/com/android/car/rotary/
DTreeTraverserTest.java176 AccessibilityNodeInfo result = mTreeTraverser.depthFirstSearch( in testDepthFirstSearch()
189 result = mTreeTraverser.depthFirstSearch(mNode0, /* skipPredicate= */ null, in testDepthFirstSearch()
195 result = mTreeTraverser.depthFirstSearch(mNode0, /* skipPredicate= */ null, in testDepthFirstSearch()
201 result = mTreeTraverser.depthFirstSearch(mNode0, /* skipPredicate= */ null, in testDepthFirstSearch()
209 result = mTreeTraverser.depthFirstSearch(mNode0, in testDepthFirstSearch()
225 result = mTreeTraverser.depthFirstSearch(mNode0, in testDepthFirstSearch()