public LongList intersection(final LongList b) {
        if (N.isNullOrEmpty(b)) {
            return new LongList();
        }

        final Multiset<Long> bOccurrences = b.toMultiset();

        final LongList c = new LongList(N.min(9, size(), b.size()));

        for (int i = 0, len = size(); i < len; i++) {
            if (bOccurrences.getAndRemove(elementData[i]) > 0) {
                c.add(elementData[i]);
            }
        }

        return c;
    }
public LongList intersection ( final LongList b ) { if ( N . isNullOrEmpty ( b ) ) { return new LongList ( ) ; } final Multiset < Long > bOccurrences = b . toMultiset ( ) ; final LongList c = new LongList ( N . min ( 9 , size ( ) , b . size ( ) ) ) ; for ( int i = 0 , len = size ( ) ; i < len ; i ++ ) { if ( bOccurrences . getAndRemove ( elementData [ i ] ) > 0 ) { c . add ( elementData [ i ] ) ; } } return c ; }
@param b
@return
@see IntList#intersection(IntList)