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.
ixmap :: (IArray a e, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> a i earray Data.Array.IArray Returns a new array derived from the original array by applying a function to each of the indices.
ixAt :: At m => Index m -> Traversal' m (IxValue m)lens Control.Lens.At A definition of ix for types with an At instance. This is the default if you don't specify a definition for ix.
ixAt :: At m => Index m -> Traversal' m (IxValue m)lens Control.Lens.Combinators A definition of ix for types with an At instance. This is the default if you don't specify a definition for ix.
-
lens Data.Array.Lens This Setter can be used to derive a new IArray from an old IArray by applying a function to each of the indices to look it up in the old IArray. This is a contravariant Setter.
ixmap ≡ over . ixmapped ixmapped ≡ setting . ixmap over (ixmapped b) f arr ! i ≡ arr ! f i bounds (over (ixmapped b) f arr) ≡ b
ixAt :: At m => Index m -> Traversal' m (IxValue m)microlens Lens.Micro.Internal No documentation available.
-
ghc GHC.Builtin.Names No documentation available.
-
ghc GHC.Builtin.Names No documentation available.
ixLaws :: (Ix a, Arbitrary a, Show a) => Proxy a -> Lawsquickcheck-classes Test.QuickCheck.Classes Tests the various Ix properties:
inRange (l,u) i == elem i (range (l,u))
range (l,u) !! index (l,u) i == i, when inRange (l,u) imap (index (l,u)) (range (l,u)) == [0 .. rangeSize (l,u) - 1]
rangeSize (l,u) == length (range (l,u))
ixAt :: At m => Index m -> AffineTraversal' m (IxValue m)optics-core Optics.At.Core A definition of ix for types with an At instance. This is the default if you don't specify a definition for ix.
ixAt :: At m => Index m -> Traversal' m (IxValue m)diagrams-lib Diagrams.Prelude A definition of ix for types with an At instance. This is the default if you don't specify a definition for ix.