Searched refs:fringe (Results 1 – 3 of 3) sorted by relevance
994 Queue<AccessibilityNodeInfo> fringe = new LinkedList<>(); in checkFindAccessibilityNodeInfoResultIntegrity() local995 fringe.add(root); in checkFindAccessibilityNodeInfoResultIntegrity()996 while (!fringe.isEmpty()) { in checkFindAccessibilityNodeInfoResultIntegrity()997 AccessibilityNodeInfo current = fringe.poll(); in checkFindAccessibilityNodeInfoResultIntegrity()1008 fringe.add(child); in checkFindAccessibilityNodeInfoResultIntegrity()
1146 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>(); in enforceNodeTreeConsistent() local1147 fringe.add(root); in enforceNodeTreeConsistent()1149 while (!fringe.isEmpty()) { in enforceNodeTreeConsistent()1150 AccessibilityNodeInfo current = fringe.poll(); in enforceNodeTreeConsistent()1186 fringe.add(child); in enforceNodeTreeConsistent()
3351 final Queue<AccessibilityNodeInfo> fringe = new LinkedList<>(); in findFocusedVirtualNode() local3352 fringe.offer(current); in findFocusedVirtualNode()3354 while (!fringe.isEmpty()) { in findFocusedVirtualNode()3355 current = fringe.poll(); in findFocusedVirtualNode()3369 fringe.offer(child); in findFocusedVirtualNode()