Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
ixLaws :: (Ix a, Arbitrary a, Show a) => Proxy a -> Lawsquickcheck-classes-base Test.QuickCheck.Classes.Base 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))
-
vector-sized Data.Vector.Generic.Sized Type-safe lens to access (O(1)) and update (O(n)) an arbitrary element by its index which should be supplied via TypeApplications.
-
vector-sized Data.Vector.Sized Type-safe lens to access (O(1)) and update (O(n)) an arbitrary element by its index which should be supplied via TypeApplications.
-
vector-sized Data.Vector.Storable.Sized Type-safe lens to access (O(1)) and update (O(n)) an arbitrary element by its index which should be supplied via TypeApplications.
-
vector-sized Data.Vector.Unboxed.Sized Type-safe lens to access (O(1)) and update (O(n)) an arbitrary element by its index which should be supplied via TypeApplications.
-
deriving-compat Data.Deriving.Internal No documentation available.
ixmap :: (Ix i, Ix j) => (i, i) -> (i -> j) -> Array j e -> Array i eghc-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.
ixmapP :: (Ix i, Ix i', IArray a e, IArray a' e) => (i', i') -> (i' -> i) -> a i e -> a' i' ecarray Data.Array.CArray More polymorphic version of ixmap.
-
carray Data.Array.CArray Less polymorphic version.
-
carray Data.Array.CArray Less polymorphic version.