Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

1. toMap :: KeyMap v -> Map Key v

   aeson	Data.Aeson.KeyMap

   Convert a KeyMap to a Map.

2. toMapText :: KeyMap v -> Map Text v

   aeson	Data.Aeson.KeyMap

   Convert a KeyMap to a Map Text.

3. contramapToJSONKeyFunction :: (b -> a) -> ToJSONKeyFunction a -> ToJSONKeyFunction b

   aeson	Data.Aeson.Types

   Contravariant map, as ToJSONKeyFunction is a contravariant functor.

4. type Bitmap = Word

   unordered-containers	Data.HashMap.Internal

   A bitmap as contained by a BitmapIndexed node, or a fullBitmap corresponding to a Full node. Only the lower maxChildren bits are used. The remaining bits must be zeros.

5. BitmapIndexed :: Bitmap -> !Array (HashMap k v) -> HashMap k v

   unordered-containers	Data.HashMap.Internal

   Invariants:

   • Only the lower maxChildren bits of the Bitmap may be set. The remaining upper bits must be 0. (INV2)
   • The array of a BitmapIndexed node stores at least 1 and at most maxChildren - 1 sub-nodes. (INV3)
   • The number of sub-nodes is equal to the number of 1-bits in its Bitmap. (INV4)
   • If a BitmapIndexed node has only one sub-node, this sub-node must be a BitmapIndexed or a Full node. (INV5)

6. 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.

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

   unordered-containers	Data.HashMap.Internal

   Create a BitmapIndexed or Full node.

8. 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.

9. 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.

10. fullBitmap :: Bitmap

    unordered-containers	Data.HashMap.Internal

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

Page 413 of many | Previous | Next