Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. ixmapWithP :: (Ix i, Ix i', IArray a e, IArray a' e') => (i', i') -> (i' -> i) -> (e -> e') -> a i e -> a' i' e'

    carray Data.Array.CArray

    Perform an operation on the elements, independent of their location.

  2. ixmapP :: (Ix i, Ix i', IArray a e, IArray a' e) => (i', i') -> (i' -> i) -> a i e -> a' i' e

    carray Data.Array.CArray.Base

    More polymorphic version of ixmap.

  3. ixmapWith :: (Ix i, Ix i', IArray a e, IArray a e') => (i', i') -> (i' -> i) -> (e -> e') -> a i e -> a i' e'

    carray Data.Array.CArray.Base

    Less polymorphic version.

  4. ixmapWithInd :: (Ix i, Ix i', IArray a e, IArray a e') => (i', i') -> (i' -> i) -> (i -> e -> i' -> e') -> a i e -> a i' e'

    carray Data.Array.CArray.Base

    Less polymorphic version.

  5. ixmapWithIndP :: (Ix i, Ix i', IArray a e, IArray a' e') => (i', i') -> (i' -> i) -> (i -> e -> i' -> e') -> a i e -> a' i' e'

    carray Data.Array.CArray.Base

    Generic slice and map. This takes the new range, the inverse map on indices, and function to produce the next element. It is the most general operation in its class.

  6. ixmapWithP :: (Ix i, Ix i', IArray a e, IArray a' e') => (i', i') -> (i' -> i) -> (e -> e') -> a i e -> a' i' e'

    carray Data.Array.CArray.Base

    Perform an operation on the elements, independent of their location.

  7. ixmap :: (Ix i, Ix j) => (i, i) -> (i -> j) -> Array j e -> Array i e

    ghc-internal GHC.Internal.Arr

    ixmap allows for transformations on array indices. It may be thought of as providing function composition on the right with the mapping that the original array embodies. A similar transformation of array values may be achieved using fmap from the Array instance of the Functor class.

  8. ixF :: forall (x :: k) . IxedF k m => IndexF m x -> Traversal' m (IxValueF m x)

    parameterized-utils Data.Parameterized.Classes

    Given an index into a container, build a traversal that visits the given element in the container, if it exists.

  9. ixF' :: forall (x :: k) . IxedF' k m => IndexF m x -> Lens' m (IxValueF m x)

    parameterized-utils Data.Parameterized.Classes

    Given an index into a container, build a lens that points into the given element in the container.

  10. ixPing :: IxPing a procs => Proxy a -> HandlesOf procs -> IO Pinged

    tmp-proc System.TmpProc.Docker

    Pings the handle whose index is specified by the proxy type.

Page 7 of many | Previous | Next