Searched defs:nodes (Results 1 - 6 of 6) sorted by relevance

/frameworks/base/core/java/android/view/accessibility/
H A DAccessibilityCache.java31 * It is updated when windows change or nodes change.
68 * the cache will either refresh some nodes or evict some nodes.
119 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
120 if (nodes == null) {
123 AccessibilityNodeInfo cachedInfo = nodes.get(sourceId);
146 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
147 if (nodes == null) {
150 AccessibilityNodeInfo info = nodes.get(accessibilityNodeId);
211 LongSparseArray<AccessibilityNodeInfo> nodes
315 clearSubTreeRecursiveLocked(LongSparseArray<AccessibilityNodeInfo> nodes, long rootNodeId) argument
[all...]
/frameworks/base/libs/hwui/
H A DRenderNode.h185 static size_t findNonNegativeIndex(const Vector<ZDrawRenderNodeOpPair>& nodes) { argument
186 for (size_t i = 0; i < nodes.size(); i++) {
187 if (nodes[i].key >= 0.0f) return i;
189 return nodes.size();
/frameworks/testing/espresso/espresso-lib/src/main/java/com/google/android/apps/common/testing/ui/espresso/util/
H A DTreeIterables.java139 * Converts a tree into an Iterable of the tree's nodes presented in a given traversal order.
155 final LinkedList<T> nodes = Lists.newLinkedList();
156 nodes.add(root);
160 if (nodes.isEmpty()) {
163 T nextItem = checkNotNull(traversalStrategy.next(nodes), "Null items not allowed!");
164 traversalStrategy.combineNewChildren(nodes, treeViewer.children(nextItem));
175 <T> void combineNewChildren(LinkedList<T> nodes, Collection<T> newChildren) {
176 nodes.addAll(newChildren);
180 <T> void combineNewChildren(LinkedList<T> nodes, Collection<T> newChildren) {
181 nodes
185 combineNewChildren(LinkedList<T> nodes, Collection<T> newChildren) argument
186 next(LinkedList<T> nodes) argument
[all...]
/frameworks/base/core/java/android/view/
H A DAccessibilityInteractionController.java439 // focus instead fetching all provider nodes to do the search here.
917 private void enforceNodeTreeConsistent(List<AccessibilityNodeInfo> nodes) { argument
920 final int nodeCount = nodes.size();
922 AccessibilityNodeInfo node = nodes.get(i);
926 // If the nodes are a tree it does not matter from
984 // Check for disconnected nodes.
/frameworks/base/graphics/java/android/graphics/drawable/
H A DVectorDrawable.java1291 public void setPathData(PathParser.PathDataNode[] nodes) { argument
1292 if (!PathParser.canMorph(mNodes, nodes)) {
1294 mNodes = PathParser.deepCopyNodes(nodes);
1296 PathParser.updateNodes(mNodes, nodes);
/frameworks/testing/espresso/libs/
H A Dguava-14.0.1.jarMETA-INF/MANIFEST.MF META-INF/ META-INF/maven/ META-INF/maven/com. ...

Completed in 268 milliseconds