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()
1107 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>(); in enforceNodeTreeConsistent() local1108 fringe.add(root); in enforceNodeTreeConsistent()1110 while (!fringe.isEmpty()) { in enforceNodeTreeConsistent()1111 AccessibilityNodeInfo current = fringe.poll(); in enforceNodeTreeConsistent()1147 fringe.add(child); in enforceNodeTreeConsistent()
3037 final Queue<AccessibilityNodeInfo> fringe = new LinkedList<>(); in findFocusedVirtualNode() local3038 fringe.offer(current); in findFocusedVirtualNode()3040 while (!fringe.isEmpty()) { in findFocusedVirtualNode()3041 current = fringe.poll(); in findFocusedVirtualNode()3055 fringe.offer(child); in findFocusedVirtualNode()