Cross Reference: /frameworks/base/core/java/android/view/accessibility/AccessibilityCache.java

Lines Matching refs:nodes
33  * It is updated when windows change or nodes change.
121      * the cache will either refresh some nodes or evict some nodes.
196         LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
197         if (nodes == null) {
200         AccessibilityNodeInfo cachedInfo = nodes.get(sourceId);
223             LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
224             if (nodes == null) {
227             AccessibilityNodeInfo info = nodes.get(accessibilityNodeId);
295             LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
296             if (nodes == null) {
297                 nodes = new LongSparseArray<>();
298                 mNodeCache.put(windowId, nodes);
302             AccessibilityNodeInfo oldInfo = nodes.get(sourceId);
312                     if (nodes.get(sourceId) == null) {
338             nodes.put(sourceId, clone);
379      * Clears nodes for the window with the given id
385         LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
386         if (nodes == null) {
389         // Recycle the nodes before clearing the cache.
390         final int nodeCount = nodes.size();
392             AccessibilityNodeInfo info = nodes.valueAt(i);
393             nodes.removeAt(i);
410         LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
411         if (nodes != null) {
412             clearSubTreeRecursiveLocked(nodes, rootNodeId);
417      * Clears a subtree given a pointer to the root id and the nodes
420      * @param nodes The nodes in the hosting window.
423     private void clearSubTreeRecursiveLocked(LongSparseArray<AccessibilityNodeInfo> nodes,
425         AccessibilityNodeInfo current = nodes.get(rootNodeId);
429         nodes.remove(rootNodeId);
433             clearSubTreeRecursiveLocked(nodes, childNodeId);
439      * Check the integrity of the cache which is nodes from different windows
441      * window, for every window there are no duplicates nodes, all nodes for a
484                 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.valueAt(i);
485                 if (nodes.size() <= 0) {
492                 final int nodeCount = nodes.size();
494                     AccessibilityNodeInfo node = nodes.valueAt(j);
525                     AccessibilityNodeInfo nodeParent = nodes.get(node.getParentNodeId());
530                             AccessibilityNodeInfo child = nodes.get(nodeParent.getChildId(k));
545                         AccessibilityNodeInfo child = nodes.get(node.getChildId(k));
547                             AccessibilityNodeInfo parent = nodes.get(child.getParentNodeId());