Node < Node < N , E > , E > function ( final Node < N , E > arg0 ) { final Node < N , E > [ ] loc0 = children . clone ( ) ; loc0 [ 0 ] = arg0 ; return new InnerNode < > ( loc0 ) ; }
returns a version of this node where the first sub-node is the given one . concode_field_sep Node<N,E>[] children concode_elem_sep long[] bounds concode_field_sep int arity concode_elem_sep Node<N,E> getSub concode_elem_sep long size concode_elem_sep NodeLike<Node<N,E>,E> slice concode_elem_sep long checkInvariants concode_elem_sep boolean insert concode_elem_sep void toString concode_elem_sep String toString concode_elem_sep Node<Node<N,E>,E> replaceLast concode_elem_sep Node<Node<N,E>,E> reverse concode_elem_sep NodeLike<Node<N,E>,E>[] remove concode_elem_sep int append