Searched refs:fringe (Results 1 – 3 of 3) sorted by relevance
881 Queue<AccessibilityNodeInfo> fringe = new LinkedList<>(); in checkFindAccessibilityNodeInfoResultIntegrity() local882 fringe.add(root); in checkFindAccessibilityNodeInfoResultIntegrity()883 while (!fringe.isEmpty()) { in checkFindAccessibilityNodeInfoResultIntegrity()884 AccessibilityNodeInfo current = fringe.poll(); in checkFindAccessibilityNodeInfoResultIntegrity()895 fringe.add(child); in checkFindAccessibilityNodeInfoResultIntegrity()
1079 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>(); in enforceNodeTreeConsistent() local1080 fringe.add(root); in enforceNodeTreeConsistent()1082 while (!fringe.isEmpty()) { in enforceNodeTreeConsistent()1083 AccessibilityNodeInfo current = fringe.poll(); in enforceNodeTreeConsistent()1119 fringe.add(child); in enforceNodeTreeConsistent()
2960 final Queue<AccessibilityNodeInfo> fringe = new LinkedList<>(); in findFocusedVirtualNode() local2961 fringe.offer(current); in findFocusedVirtualNode()2963 while (!fringe.isEmpty()) { in findFocusedVirtualNode()2964 current = fringe.poll(); in findFocusedVirtualNode()2978 fringe.offer(child); in findFocusedVirtualNode()