private Node<K, V> firstEquivalentAll( Comparable<? super V> comp ) {
        Node<K, V> node = mAllRoot;
        Node<K, V> ret  = null;

        while( node != null ) {
            int c = comp.compareTo( node.mValue );

            if( c < 0 ) {
                node = node.mAllLeft;

            } else if( c > 0 ) {
                node = node.mAllRight;

            } else {
                ret = node;
                node = node.mAllLeft;
            }
        }

        return ret;
    }