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. class Ord a => Ix a

   base	GHC.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))

2. module Data.Ix

   No documentation available.

3. class Ix (f :: Type -> Type)

   non-empty	Data.NonEmpty.Class

   No documentation available.

4. type family Ix (n :: Nat) = (r :: Type) | r -> n

   massiv	Data.Massiv.Core.Index

   Defines n-dimensional index by relating a general IxN with few base cases.

5. class Ord a => Ix a

   ghc-internal	GHC.Internal.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))

6. module GHC.Internal.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.

7. class Ord a => Ix a

   ghc-internal	GHC.Internal.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))

8. module GHC.Internal.Ix

   GHC's Ix typeclass implementation.

9. class Ord a => Ix a

   ghc-internal	GHC.Internal.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))

10. module Rebase.Data.Ix

    No documentation available.

Page 3 of many | Previous | Next