Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. mapBoolSpecIdent :: (String -> String) -> BoolSpec -> BoolSpec

    ogma-language-smv Language.SMV.Substitution

    No documentation available.

  2. mapNumExprIdent :: (String -> String) -> NumExpr -> NumExpr

    ogma-language-smv Language.SMV.Substitution

    No documentation available.

  3. mapMaybe :: Fractional prob => (a -> Maybe b) -> T prob a -> T prob b

    probability Numeric.Probability.Distribution

    No documentation available.

  4. mapEntry :: (Functor f, HasField s "mapEntry" a) => LensLike' f s a

    proto-lens-protobuf-types Proto.Google.Protobuf.Descriptor_Fields

    No documentation available.

  5. mapAccumLWithKey :: forall s k a b c . (a -> Key s k -> b -> (a, c)) -> a -> HashMap s k b -> (a, HashMap s k c)

    refined-containers Data.HashMap.Refined

    Thread an accumularing argument through the map in ascending order of hashes.

  6. mapAccumRWithKey :: forall s k a b c . (a -> Key s k -> b -> (a, c)) -> a -> HashMap s k b -> (a, HashMap s k c)

    refined-containers Data.HashMap.Refined

    Thread an accumularing argument through the map in descending order of hashes.

  7. mapEither :: forall s k a b c . Hashable k => (a -> Either b c) -> HashMap s k a -> Some2HashMapWith (PartitionProof 'Hashed s k) k b c

    refined-containers Data.HashMap.Refined

    Apply a function to all values in a map and collect the Left and Right results into separate (disjoint) maps.

  8. mapEitherWithKey :: forall s k a b c . Hashable k => (Key s k -> a -> Either b c) -> HashMap s k a -> Some2HashMapWith (PartitionProof 'Hashed s k) k b c

    refined-containers Data.HashMap.Refined

    Apply a function to all values in a map, together with their corresponding keys, and collect the Left and Right results into separate (disjoint) maps.

  9. mapKeys :: forall s k1 k2 a . Hashable k2 => (Key s k1 -> k2) -> HashMap s k1 a -> SomeHashMapWith (MapProof 'Hashed s k1 k2) k2 a

    refined-containers Data.HashMap.Refined

    mapKeys f m applies f to each key of m and collects the results into a new map. For keys that were mapped to the same new key, the value is picked in an unspecified way.

  10. mapKeysWith :: forall s k1 k2 a . Hashable k2 => (a -> a -> a) -> (Key s k1 -> k2) -> HashMap s k1 a -> SomeHashMapWith (MapProof 'Hashed s k1 k2) k2 a

    refined-containers Data.HashMap.Refined

    mapKeysWith c f m applies f to each key of m and collects the results into a new map. For keys that were mapped to the same new key, c acts as the combining function for corresponding values.

Page 388 of many | Previous | Next