Lines Matching defs:infos

199                     List<AccessibilityNodeInfo> infos = getFindAccessibilityNodeInfosResultAndClear(
201 finalizeAndCacheAccessibilityNodeInfos(infos, connectionId);
202 if (infos != null && !infos.isEmpty()) {
203 return infos.get(0);
246 List<AccessibilityNodeInfo> infos = getFindAccessibilityNodeInfosResultAndClear(
248 if (infos != null) {
249 finalizeAndCacheAccessibilityNodeInfos(infos, connectionId);
250 return infos;
294 List<AccessibilityNodeInfo> infos = getFindAccessibilityNodeInfosResultAndClear(
296 if (infos != null) {
297 finalizeAndCacheAccessibilityNodeInfos(infos, connectionId);
298 return infos;
507 public void setFindAccessibilityNodeInfosResult(List<AccessibilityNodeInfo> infos,
511 if (infos != null) {
517 new ArrayList<AccessibilityNodeInfo>(infos);
519 mFindAccessibilityNodeInfosResult = infos;
620 * @param infos The {@link AccessibilityNodeInfo}s.
623 private void finalizeAndCacheAccessibilityNodeInfos(List<AccessibilityNodeInfo> infos,
625 if (infos != null) {
626 final int infosCount = infos.size();
628 AccessibilityNodeInfo info = infos.get(i);
684 * Checks whether the infos are a fully connected tree with no duplicates.
686 * @param infos The result list to check.
688 private void checkFindAccessibilityNodeInfoResultIntegrity(List<AccessibilityNodeInfo> infos) {
689 if (infos.size() == 0) {
693 AccessibilityNodeInfo root = infos.get(0);
694 final int infoCount = infos.size();
697 AccessibilityNodeInfo candidate = infos.get(j);
722 AccessibilityNodeInfo child = infos.get(j);
729 final int disconnectedCount = infos.size() - seen.size();