Searched refs:fringe (Results 1 – 4 of 4) sorted by relevance
360 final ArrayList<SyncGroup> fringe = mTmpFringe; in dependsOn()361 fringe.clear(); in dependsOn()362 fringe.add(this); in dependsOn()363 for (int head = 0; head < fringe.size(); ++head) { in dependsOn()364 final SyncGroup next = fringe.get(head); in dependsOn()366 fringe.clear(); in dependsOn()370 if (fringe.contains(next.mDependencies.get(i))) continue; in dependsOn()371 fringe.add(next.mDependencies.get(i)); in dependsOn()374 fringe.clear(); in dependsOn()
1540 Queue<AccessibilityNodeInfo> fringe = new ArrayDeque<>(); in checkFindAccessibilityNodeInfoResultIntegrity() local1541 fringe.add(root); in checkFindAccessibilityNodeInfoResultIntegrity()1542 while (!fringe.isEmpty()) { in checkFindAccessibilityNodeInfoResultIntegrity()1543 AccessibilityNodeInfo current = fringe.poll(); in checkFindAccessibilityNodeInfoResultIntegrity()1554 fringe.add(child); in checkFindAccessibilityNodeInfoResultIntegrity()
1399 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>(); in enforceNodeTreeConsistent() local1400 fringe.add(root); in enforceNodeTreeConsistent()1402 while (!fringe.isEmpty()) { in enforceNodeTreeConsistent()1403 AccessibilityNodeInfo current = fringe.poll(); in enforceNodeTreeConsistent()1439 fringe.add(child); in enforceNodeTreeConsistent()
4777 final Queue<AccessibilityNodeInfo> fringe = new ArrayDeque<>(); in findFocusedVirtualNode() local4778 fringe.offer(current); in findFocusedVirtualNode()4780 while (!fringe.isEmpty()) { in findFocusedVirtualNode()4781 current = fringe.poll(); in findFocusedVirtualNode()4795 fringe.offer(child); in findFocusedVirtualNode()