code: public boolean nextSibling() {
          if (mNode == null) {
              return false;
          }
          AccessibilityNodeInfoCompat parent = mNode.getParent();
          if (parent == null) {
              return false;
          }
          try {
              int childCount = parent.getChildCount();
              int childNumber = getChildNumber(parent);
              if (childNumber < 0) {
                  return false;
              }
              for (int i = childNumber + 1; i < childCount; ++i) {
                  AccessibilityNodeInfoCompat newNode =
                          parent.getChild(i);
                  if (newNode == null) {
                      return false;
                  }
                  if (AccessibilityNodeInfoUtils.isVisibleOrLegacy(newNode)) {
                      reset(newNode);
                      return true;
                  }
                  newNode.recycle();
              }
          } finally {
              parent.recycle();
          }
          return false;
      }
docs: Traverses to the next sibling of this node within its parent, returning
  {@code true} on success.