Searched refs:fringe (Results 1 – 3 of 3) sorted by relevance
1156 Queue<AccessibilityNodeInfo> fringe = new LinkedList<>(); in checkFindAccessibilityNodeInfoResultIntegrity() local1157 fringe.add(root); in checkFindAccessibilityNodeInfoResultIntegrity()1158 while (!fringe.isEmpty()) { in checkFindAccessibilityNodeInfoResultIntegrity()1159 AccessibilityNodeInfo current = fringe.poll(); in checkFindAccessibilityNodeInfoResultIntegrity()1170 fringe.add(child); in checkFindAccessibilityNodeInfoResultIntegrity()
1228 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>(); in enforceNodeTreeConsistent() local1229 fringe.add(root); in enforceNodeTreeConsistent()1231 while (!fringe.isEmpty()) { in enforceNodeTreeConsistent()1232 AccessibilityNodeInfo current = fringe.poll(); in enforceNodeTreeConsistent()1268 fringe.add(child); in enforceNodeTreeConsistent()
3562 final Queue<AccessibilityNodeInfo> fringe = new LinkedList<>(); in findFocusedVirtualNode() local3563 fringe.offer(current); in findFocusedVirtualNode()3565 while (!fringe.isEmpty()) { in findFocusedVirtualNode()3566 current = fringe.poll(); in findFocusedVirtualNode()3580 fringe.offer(child); in findFocusedVirtualNode()