@SuppressWarnings("unchecked") protected final Deque<N> initStack(){
  Deque<N> stack=new ArrayDeque<>(8);
  for (int i=curNode.getChildCount() - 1; i >= curChildIndex; i--)   stack.addFirst((N)curNode.getChild(i));
  return stack;
}

@ SuppressWarnings ( "unchecked" ) protected final Deque < N > initStack ( ) { Deque < N > stack = new ArrayDeque < > ( 8 ) ; for ( int i = curNode . getChildCount ( ) - 1 ; i >= curChildIndex ; i -- ) stack . addFirst ( ( N ) curNode . getChild ( i ) ) ; return stack ; }
initiate a stack containing , in left - to - right order , the child nodes covered by this spliterator
