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. data HashMap k v

   unordered-containers	Data.HashMap.Internal

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

2. bitmapIndexedOrFull :: Bitmap -> Array (HashMap k v) -> HashMap k v

   unordered-containers	Data.HashMap.Internal

   Create a BitmapIndexed or Full node.

3. filterMapAux :: (HashMap k v1 -> Maybe (HashMap k v2)) -> (Leaf k v1 -> Maybe (Leaf k v2)) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Internal

   Common implementation for filterWithKey and mapMaybeWithKey, allowing the former to former to reuse terms.

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

   unordered-containers	Data.HashMap.Internal

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

5. fullBitmap :: Bitmap

   unordered-containers	Data.HashMap.Internal

   A bitmap with the maxChildren least significant bits set, i.e. 0xFF_FF_FF_FF.

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

   unordered-containers	Data.HashMap.Internal

   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
   

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

   unordered-containers	Data.HashMap.Internal

   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
   

8. foldMap :: Monoid m => (a -> m) -> Array a -> m

   unordered-containers	Data.HashMap.Internal.Array

   No documentation available.

9. INV2_Bitmap_unexpected_1_bits :: Bitmap -> Error k

   unordered-containers	Data.HashMap.Internal.Debug

   No documentation available.

10. INV3_bad_BitmapIndexed_size :: Int -> Error k

    unordered-containers	Data.HashMap.Internal.Debug

    No documentation available.

Page 412 of many | Previous | Next