Class Maps.FilteredEntryBiMap<K,​V>

  • All Implemented Interfaces:
    BiMap<K,​V>, java.util.Map<K,​V>
    Enclosing class:
    Maps

    static final class Maps.FilteredEntryBiMap<K,​V>
    extends Maps.FilteredEntryMap<K,​V>
    implements BiMap<K,​V>
    • Field Detail

      • inverse

        private final BiMap<V,​K> inverse
    • Constructor Detail

      • FilteredEntryBiMap

        FilteredEntryBiMap​(BiMap<K,​V> delegate,
                           Predicate<? super java.util.Map.Entry<K,​V>> predicate)
      • FilteredEntryBiMap

        private FilteredEntryBiMap​(BiMap<K,​V> delegate,
                                   Predicate<? super java.util.Map.Entry<K,​V>> predicate,
                                   BiMap<V,​K> inverse)
    • Method Detail

      • inversePredicate

        private static <K,​V> Predicate<java.util.Map.Entry<V,​K>> inversePredicate​(Predicate<? super java.util.Map.Entry<K,​V>> forwardPredicate)
      • unfiltered

        BiMap<K,​V> unfiltered()
      • forcePut

        public V forcePut​(@Nullable
                          K key,
                          @Nullable
                          V value)
        Description copied from interface: BiMap
        An alternate form of put that silently removes any existing entry with the value value before proceeding with the BiMap.put(K, V) operation. If the bimap previously contained the provided key-value mapping, this method has no effect.

        Note that a successful call to this method could cause the size of the bimap to increase by one, stay the same, or even decrease by one.

        Warning: If an existing entry with this value is removed, the key for that entry is discarded and not returned.

        Specified by:
        forcePut in interface BiMap<K,​V>
        Parameters:
        key - the key with which the specified value is to be associated
        value - the value to be associated with the specified key
        Returns:
        the value which was previously associated with the key, which may be null, or null if there was no previous entry
      • inverse

        public BiMap<V,​K> inverse()
        Description copied from interface: BiMap
        Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key. The two bimaps are backed by the same data; any changes to one will appear in the other.

        Note:There is no guaranteed correspondence between the iteration order of a bimap and that of its inverse.

        Specified by:
        inverse in interface BiMap<K,​V>
        Returns:
        the inverse view of this bimap
      • values

        public java.util.Set<V> values()
        Description copied from interface: BiMap

        Because a bimap has unique values, this method returns a Set, instead of the Collection specified in the Map interface.

        Specified by:
        values in interface BiMap<K,​V>
        Specified by:
        values in interface java.util.Map<K,​V>
        Overrides:
        values in class Maps.ViewCachingAbstractMap<K,​V>