public Set<Symbol> getSymbolsWithKnownStatistics() { return symbolStatistics.keySet(); }
@Override public Iterator<E> iterator() { return map.keySet().iterator(); } @Override
@Override public Iterator<E> iterator() { return map.keySet().iterator(); } @Override
/** * @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); }
/** * @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 Set<Symbol> getSymbolsWithKnownStatistics() { return symbolStatistics.keySet(); }
public Set<Symbol> getSymbolsWithKnownStatistics() { return symbolStatistics.keySet(); }
@Override public Set<Key<?>> keys() { return values.keySet(); }
@Override public Iterator<E> iterator() { return map.keySet().iterator(); } @Override
@Override public Iterator<E> iterator() { return map.keySet().iterator(); }
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));
/** * @return * @see java.util.Map#keySet() */ @Override public SetX<K> keySet() { return SetX.fromIterable(map.keySet()); }
/** * @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); }
/** * @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); }
@Override protected boolean matchesSafely(FixedRekord<T> actualRekord, Description mismatchDescription) { mismatchDescription.appendText("a rekord that looks like ").appendValue(actualRekord); if (!expectedProperties.keySet().equals(actualRekord.keys().toSet())) { return false; } for (Map.Entry<Key<T, ?>, Matcher<?>> property : expectedProperties.entrySet()) { Key<T, ?> expectedKey = property.getKey(); Matcher<?> expectedValue = property.getValue(); if (!expectedValue.matches(actualRekord.get(expectedKey))) { return false; } } return true; } }