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.
-
hw-prim HaskellWorks.Data.Vector.Storable No documentation available.
map2I :: (a -> Bool) -> (a -> [[a]]) -> [a] -> [a]intermediate-structures Data.IntermediateStructures1 Function that applies additional function f :: a -> [[a]] to a if p :: a -> Bool and p a = True
mapI :: (a -> Bool) -> (a -> [a]) -> [a] -> [a]intermediate-structures Data.IntermediateStructures1 Function that applies additional function f :: a -> [a] to a if p :: a -> Bool and p a = True
mapI_ :: (Foldable t, Monoidal f) => (a -> f ()) -> t a -> f ()invertible Control.Invertible.Monoidal Map each element to a monoidal and sequenceI_ the results.
mapMaybeI :: Monoidal f => (a -> f (Maybe b)) -> [a] -> f [b]invertible Control.Invertible.Monoidal Map each element to a Maybe monoidal and sequence the results (like traverse and mapMaybe).
mapFree :: (forall a' . () => f a' -> m a') -> Free f a -> Free m ainvertible Control.Invertible.Monoidal.Free Transform the type constructor within a Free.
mapConstraint :: (Monad m, Functor m) => (JType -> m JType) -> Constraint -> m Constraintjmacro Language.Javascript.JMacro.TypeCheck No documentation available.
mapAccum :: (a -> b -> (a, c)) -> a -> Map ph k b -> (a, Map ph k c)justified-containers Data.Map.Justified O(n). The function mapAccum threads an accumulating argument through the map in ascending order of keys.
mapAccumWithKey :: (a -> Key ph k -> b -> (a, c)) -> a -> Map ph k b -> (a, Map ph k c)justified-containers Data.Map.Justified O(n). The function mapAccumWithKey threads an accumulating argument through the map in ascending order of keys.
mapWithKey :: (Key ph k -> a -> b) -> Map ph k a -> Map ph k bjustified-containers Data.Map.Justified O(n). Map a function over all keys and values in the map.