public boolean lastChild() {
        if (mNode == null || mNode.getChildCount() < 1) {
            return false;
        }
        for (int i = mNode.getChildCount() - 1; i >= 0; --i) {
            AccessibilityNodeInfoCompat newNode = mNode.getChild(i);
            if (newNode == null) {
                return false;
            }
            if (AccessibilityNodeInfoUtils.isVisibleOrLegacy(newNode)) {
                reset(newNode);
                return true;
            }
            newNode.recycle();
        }
        return false;
    }
public boolean lastChild ( ) { if ( mNode == null || mNode . getChildCount ( ) < 1 ) { return false ; } for ( int i = mNode . getChildCount ( ) - 1 ; i >= 0 ; -- i ) { AccessibilityNodeInfoCompat newNode = mNode . getChild ( i ) ; if ( newNode == null ) { return false ; } if ( AccessibilityNodeInfoUtils . isVisibleOrLegacy ( newNode ) ) { reset ( newNode ) ; return true ; } newNode . recycle ( ) ; } return false ; }
Traverses to the last child of this node, returning {@code true}
on success.