Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. INV4_bitmap_array_size_mismatch :: Bitmap -> Int -> Error k

   unordered-containers	Data.HashMap.Internal.Debug

   No documentation available.

2. INV5_BitmapIndexed_invalid_single_subtree :: Error k

   unordered-containers	Data.HashMap.Internal.Debug

   No documentation available.

3. data HashMap k v

   unordered-containers	Data.HashMap.Internal.Strict

   A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.

4. foldMapWithKey :: Monoid m => (k -> v -> m) -> HashMap k v -> m

   unordered-containers	Data.HashMap.Internal.Strict

   Reduce the map by applying a function to each element and combining the results with a monoid operation.

5. isSubmapOf :: (Hashable k, Eq v) => HashMap k v -> HashMap k v -> Bool

   unordered-containers	Data.HashMap.Internal.Strict

   Inclusion of maps. A map is included in another map if the keys are subsets and the corresponding values are equal:

   isSubmapOf m1 m2 = keys m1 `isSubsetOf` keys m2 &&
   and [ v1 == v2 | (k1,v1) <- toList m1; let v2 = m2 ! k1 ]
   

   Examples

   >>> fromList [(1,'a')] `isSubmapOf` fromList [(1,'a'),(2,'b')]
   True
   

   >>> fromList [(1,'a'),(2,'b')] `isSubmapOf` fromList [(1,'a')]
   False
   

6. isSubmapOfBy :: Hashable k => (v1 -> v2 -> Bool) -> HashMap k v1 -> HashMap k v2 -> Bool

   unordered-containers	Data.HashMap.Internal.Strict

   Inclusion of maps with value comparison. A map is included in another map if the keys are subsets and if the comparison function is true for the corresponding values:

   isSubmapOfBy cmpV m1 m2 = keys m1 `isSubsetOf` keys m2 &&
   and [ v1 `cmpV` v2 | (k1,v1) <- toList m1; let v2 = m2 ! k1 ]
   

   Examples

   >>> isSubmapOfBy (<=) (fromList [(1,'a')]) (fromList [(1,'b'),(2,'c')])
   True
   

   >>> isSubmapOfBy (<=) (fromList [(1,'b')]) (fromList [(1,'a'),(2,'c')])
   False
   

7. data HashMap k v

   unordered-containers	Data.HashMap.Lazy

   A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.

8. foldMapWithKey :: Monoid m => (k -> v -> m) -> HashMap k v -> m

   unordered-containers	Data.HashMap.Lazy

   Reduce the map by applying a function to each element and combining the results with a monoid operation.

9. isSubmapOf :: (Hashable k, Eq v) => HashMap k v -> HashMap k v -> Bool

   unordered-containers	Data.HashMap.Lazy

   Inclusion of maps. A map is included in another map if the keys are subsets and the corresponding values are equal:

   isSubmapOf m1 m2 = keys m1 `isSubsetOf` keys m2 &&
   and [ v1 == v2 | (k1,v1) <- toList m1; let v2 = m2 ! k1 ]
   

   Examples

   >>> fromList [(1,'a')] `isSubmapOf` fromList [(1,'a'),(2,'b')]
   True
   

   >>> fromList [(1,'a'),(2,'b')] `isSubmapOf` fromList [(1,'a')]
   False
   

10. isSubmapOfBy :: Hashable k => (v1 -> v2 -> Bool) -> HashMap k v1 -> HashMap k v2 -> Bool

    unordered-containers	Data.HashMap.Lazy

    Inclusion of maps with value comparison. A map is included in another map if the keys are subsets and if the comparison function is true for the corresponding values:

    isSubmapOfBy cmpV m1 m2 = keys m1 `isSubsetOf` keys m2 &&
    and [ v1 `cmpV` v2 | (k1,v1) <- toList m1; let v2 = m2 ! k1 ]
    

    Examples

    >>> isSubmapOfBy (<=) (fromList [(1,'a')]) (fromList [(1,'b'),(2,'c')])
    True
    

    >>> isSubmapOfBy (<=) (fromList [(1,'b')]) (fromList [(1,'a'),(2,'c')])
    False
    

Page 413 of many | Previous | Next