Hoogle Search
Within LTS Haskell 24.5 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
map :: (Shape sh, Source r a) => (a -> b) -> Array r sh a -> Array D sh brepa Data.Array.Repa.Operators.Mapping Apply a worker function to each element of an array, yielding a new array with the same extent.
map :: Ord b => (a -> b) -> SortedList a -> SortedList bsorted-list Data.SortedList Map a function over all the elements of a sorted list. Note that map will hang if the argument is an infinite list. Even though SortedList can't be made an instance of Functor, map does hold the Functor laws (for finite lists). We can't however write an instance because of the Ord instance requirement on the type of the elements of the result list. Therefore, while SortedList is not a functor type in general, it is when restricted to elements of orderable types (for finite lists). The complexity range goes from O(n) (if the function is monotonically increasing) to O(n²) (if the function is monotonically decreasing). These are the best and worst case scenarios. We provide an alternative (mapDec) where monotonically decreasing functions are the best case scenario.
map :: Primitive amp => (y0 -> y1) -> T rate amp (T y0) -> T rate amp (T y1)synthesizer-dimensional Synthesizer.Dimensional.Amplitude.Displacement No documentation available.
map :: T sample0 sample1 -> T s sample0 sample1synthesizer-dimensional Synthesizer.Dimensional.Causal.Process No documentation available.
-
LambdaHack Game.LambdaHack.Core.Prelude map f xs is the list obtained by applying f to each element of xs, i.e.,
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn] map f [x1, x2, ...] == [f x1, f x2, ...]
this means that map id == idExamples
>>> map (+1) [1, 2, 3] [2,3,4]
>>> map id [1, 2, 3] [1,2,3]
>>> map (\n -> 3 * n + 1) [1, 2, 3] [4,7,10]
-
LambdaHack Game.LambdaHack.Core.Prelude map f xs is the list obtained by applying f to each element of xs, i.e.,
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn] map f [x1, x2, ...] == [f x1, f x2, ...]
this means that map id == idExamples
>>> map (+1) [1, 2, 3] [2,3,4]
>>> map id [1, 2, 3] [1,2,3]
>>> map (\n -> 3 * n + 1) [1, 2, 3] [4,7,10]
map :: (a -> b) -> Stream a -> Stream bStream Data.Stream Apply a function uniformly over all elements of a sequence.
map :: Ix i => (Bool -> Bool) -> BitArray i -> BitArray ibitwise Data.Array.BitArray Bitwise map. Implementation lifts from Bool to Bits and maps large chunks at a time.
map :: Ix i => (Bool -> Bool) -> IOBitArray i -> IO (IOBitArray i)bitwise Data.Array.BitArray.IO Bitwise map. Implementation lifts from Bool to Bits and maps large chunks at a time.
map :: Ix i => (Bool -> Bool) -> STBitArray s i -> ST s (STBitArray s i)bitwise Data.Array.BitArray.ST Bitwise map. Implementation lifts from Bool to Bits and maps large chunks at a time.