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.

Exact lookup

1. ixLaws :: (Ix a, Arbitrary a, Show a) => Proxy a -> Laws

   quickcheck-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) i

   map (index (l,u)) (range (l,u)) == [0 .. rangeSize (l,u) - 1]
   

   rangeSize (l,u) == length (range (l,u))
   

2. ix' :: forall (i :: Nat) (v :: Type -> Type) (n :: Nat) a f . (Vector v a, Functor f, KnownNat i, KnownNat n, (i + 1) <= n) => (a -> f a) -> Vector v n a -> f (Vector v n a)

   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.

3. ix' :: forall (i :: Nat) (n :: Nat) a f . (Functor f, KnownNat i, KnownNat n, (i + 1) <= n) => (a -> f a) -> Vector n a -> f (Vector n a)

   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.

4. ix' :: forall (i :: Nat) (n :: Nat) a f . (Storable a, Functor f, KnownNat i, KnownNat n, (i + 1) <= n) => (a -> f a) -> Vector n a -> f (Vector n a)

   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.

5. ix' :: forall (i :: Nat) (n :: Nat) a f . (Unbox a, Functor f, KnownNat i, KnownNat n, (i + 1) <= n) => (a -> f a) -> Vector n a -> f (Vector n a)

   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.

6. ixTypeName :: Name

   deriving-compat	Data.Deriving.Internal

   No documentation available.

7. 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

   More polymorphic version of ixmap.

8. 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

   Less polymorphic version.

9. 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

   Less polymorphic version.

10. 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

    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.

Page 6 of many | Previous | Next