public MapPSet<E> minusAll(final Collection<?> list) { PMap<E,Object> map = this.map.minusAll(list); return from(map); } }
public MapPSet<E> minusAll(final Collection<?> list) { PMap<E,Object> map = this.map.minusAll(list); return from(map); } }
/** * @param <K> * @param <V> * @param intMap * @return a map backed by an empty version of intMap, * i.e. backed by intMap.minusAll(intMap.keySet()) */ public static <K,V> HashPMap<K,V> empty(final PMap<Integer,PSequence<Entry<K,V>>> intMap) { return new HashPMap<K,V>(intMap.minusAll(intMap.keySet()), 0); }
/** * @param <E> * @param map * @return a PBag backed by an empty version of map, i.e. by map.minusAll(map.keySet()) */ public static <E> MapPBag<E> empty(final PMap<E,Integer> map) { return new MapPBag<E>(map.minusAll(map.keySet()), 0); }
public MapPBag<E> minusAll(final Collection<?> list) { // removes _all_ elements found in list, i.e. counts are irrelevant: PMap<E,Integer> map = this.map.minusAll(list); return new MapPBag<E>(map, size(map)); // (completely recomputes size) }
public MapPBag<E> minusAll(final Collection<?> list) { // removes _all_ elements found in list, i.e. counts are irrelevant: PMap<E,Integer> map = this.map.minusAll(list); return new MapPBag<E>(map, size(map)); // (completely recomputes size) }
/** * @param <K> * @param <V> * @param intMap * @return a map backed by an empty version of intMap, * i.e. backed by intMap.minusAll(intMap.keySet()) */ public static <K,V> HashPMap<K,V> empty(final PMap<Integer,PSequence<Entry<K,V>>> intMap) { return new HashPMap<K,V>(intMap.minusAll(intMap.keySet()), 0); }
/** * @param <E> * @param map * @return a PBag backed by an empty version of map, i.e. by map.minusAll(map.keySet()) */ public static <E> MapPBag<E> empty(final PMap<E,Integer> map) { return new MapPBag<E>(map.minusAll(map.keySet()), 0); }
UtilityTest.assertEqualsAndHash(HashTreePMap.empty(), pmap.minusAll(pmap.keySet())); UtilityTest.assertEqualsAndHash(pmap, pmap.plusAll(pmap));
UtilityTest.assertEqualsAndHash(IntTreePMap.empty(), pmap.minusAll(pmap.keySet())); UtilityTest.assertEqualsAndHash(pmap, pmap.plusAll(pmap));
/** * @param keys * @return * @see org.pcollections.PMap#minusAll(java.util.Collection) */ @Override public PersistentMapX<K, V> minusAll(final Collection<?> keys) { return withMap(map.minusAll(keys)); }
public MapPSet<E> minusAll(final Collection<?> list) { PMap<E,Object> map = this.map.minusAll(list); return from(map); } }
public MapPSet<E> minusAll(final Collection<?> list) { PMap<E, Object> map = this.map.minusAll(list); return from(map); }
@Override public Record without(Collection<Key<?>> keys) { return new HashRecord(this.values.minusAll(keys)); }
/** * @param <E> * @param map * @return a PBag backed by an empty version of map, i.e. by map.minusAll(map.keySet()) */ public static <E> MapPBag<E> empty(final PMap<E,Integer> map) { return new MapPBag<E>(map.minusAll(map.keySet()), 0); }
public MapPBag<E> minusAll(final Collection<?> list) { // removes _all_ elements found in list, i.e. counts are irrelevant: PMap<E, Integer> map = this.map.minusAll(list); return new MapPBag<E>(map, size(map)); // (completely recomputes size) }
public MapPBag<E> minusAll(final Collection<?> list) { // removes _all_ elements found in list, i.e. counts are irrelevant: PMap<E,Integer> map = this.map.minusAll(list); return new MapPBag<E>(map, size(map)); // (completely recomputes size) }
/** * @param <E> * @param map * @return a PBag backed by an empty version of map, i.e. by map.minusAll(map.keySet()) */ public static <E> MapPBag<E> empty(final PMap<E, Integer> map) { return new MapPBag<E>(map.minusAll(map.keySet()), 0); }
/** * @param <K> * @param <V> * @param intMap * @return a map backed by an empty version of intMap, * i.e. backed by intMap.minusAll(intMap.keySet()) */ public static <K,V> HashPMap<K,V> empty(final PMap<Integer,PSequence<Entry<K,V>>> intMap) { return new HashPMap<K,V>(intMap.minusAll(intMap.keySet()), 0); }
/** * @param <K> * @param <V> * @param intMap * @return a map backed by an empty version of intMap, * i.e. backed by intMap.minusAll(intMap.keySet()) */ public static <K, V> HashPMap<K, V> empty(final PMap<Integer, PSequence<Entry<K, V>>> intMap) { return new HashPMap<K, V>(intMap.minusAll(intMap.keySet()), 0); }