final Node<K, V> nextNode() {
            if( mNext == null ) { throw new NoSuchElementException(); }

            if( mModCount != mIterModCount ) { throw new ConcurrentModificationException(); }

            mPrev = mNext;

            if( mForward ) {
                mNext = nextNodeAll( mNext );
            } else {
                mNext = prevNodeAll( mNext );
            }

            if( mNext != null && mComp != null && mComp.compareTo( mNext.mValue ) != 0 ) {
                mNext = null;
            }

            return mPrev;
        }