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.

  1. fromHashMapText :: HashMap Text v -> KeyMap v

    aeson Data.Aeson.KeyMap

    Convert a HashMap Textto a KeyMap.

  2. fromMap :: Map Key v -> KeyMap v

    aeson Data.Aeson.KeyMap

    Convert a Map to a KeyMap.

  3. fromMapText :: Map Text v -> KeyMap v

    aeson Data.Aeson.KeyMap

    Convert a Map Textto a KeyMap.

  4. toHashMap :: KeyMap v -> HashMap Key v

    aeson Data.Aeson.KeyMap

    Convert a KeyMap to a HashMap.

  5. toHashMapText :: KeyMap v -> HashMap Text v

    aeson Data.Aeson.KeyMap

    Convert a KeyMap to a HashMap Text.

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

    aeson Data.Aeson.KeyMap

    Convert a KeyMap to a Map.

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

    aeson Data.Aeson.KeyMap

    Convert a KeyMap to a Map Text.

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

    aeson Data.Aeson.Types

    Contravariant map, as ToJSONKeyFunction is a contravariant functor.

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

  10. 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)

Page 411 of many | Previous | Next