Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. ix :: forall (n :: Nat) a f . (Storable a, Functor f) => Finite n -> (a -> f a) -> Vector n a -> f (Vector n a)

   vector-sized	Data.Vector.Storable.Sized

   Lens to access (O(1)) and update (O(n)) an arbitrary element by its index.

2. ix :: forall (n :: Nat) a f . (Unbox a, Functor f) => Finite n -> (a -> f a) -> Vector n a -> f (Vector n a)

   vector-sized	Data.Vector.Unboxed.Sized

   Lens to access (O(1)) and update (O(n)) an arbitrary element by its index.

3. ix :: Eq k => k -> Lens' (k -> v) v

   lens-family	Lens.Family2.Stock

   Lens on a given point of a function.

4. ix :: (Eq k, Functor f) => k -> LensLike' f (k -> v) v

   lens-family-core	Lens.Family.Stock

   ix :: Eq k => k -> Lens' (k -> v) v
   

   Lens on a given point of a function.

5. ix :: Ixed m => Index m -> Optic' (IxKind m) NoIx m (IxValue m)

   optics-extra	Optics.At

   NB: Setting the value of this AffineTraversal will only set the value in at if it is already present. If you want to be able to insert missing values, you want at.

   >>> [1,2,3,4] & ix 2 %~ (*10)
   [1,2,30,4]
   

   >>> "abcd" & ix 2 .~ 'e'
   "abed"
   

   >>> "abcd" ^? ix 2
   Just 'c'
   

   >>> [] ^? ix 2
   Nothing
   

6. ix :: C -> Int

   boltzmann-samplers	Boltzmann.Data.Oracle

   No documentation available.

7. module Data.Ix

   The Ix class is used to map a contiguous subrange of values in type onto integers. It is used primarily for array indexing (see the array package). Ix uses row-major order.

8. class Ord a => Ix a

   base	Data.Ix

   The Ix class is used to map a contiguous subrange of values in a type onto integers. It is used primarily for array indexing (see the array package). The first argument (l,u) of each of these operations is a pair specifying the lower and upper bounds of a contiguous subrange of values. An implementation is entitled to assume the following laws about these operations:

   • 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))

9. class Ord a => Ix a

   base	GHC.Arr

   The Ix class is used to map a contiguous subrange of values in a type onto integers. It is used primarily for array indexing (see the array package). The first argument (l,u) of each of these operations is a pair specifying the lower and upper bounds of a contiguous subrange of values. An implementation is entitled to assume the following laws about these operations:

   • 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))

10. module GHC.Ix

    GHC's Ix typeclass implementation.

Page 2 of many | Previous | Next