Hoogle Search
Within LTS Haskell 23.18 (ghc-9.8.4)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
badSafeIndex :: Int -> Int -> Intbase GHC.Arr Used to throw exceptions in array bounds-checking functions. ⚠ This function throws SomeException in all cases.
Examples
>>> badSafeIndex 2 5 *** Exception: Error in array index; 2 not in range [0..5)
-
base GHC.Base Used to implement quot for the Integral typeclass. This performs integer division on its two parameters, truncated towards zero.
Example
>>> quotInt 10 2 5
>>> quot 10 2 5
-
base GHC.Base Used to implement rem for the Integral typeclass. This gives the remainder after integer division of its two parameters, satisfying
((x `quot` y) * y) + (x `rem` y) == x
Example
>>> remInt 3 2 1
>>> rem 3 2 1
-
base GHC.Base Used to implement div for the Integral typeclass. This performs integer division on its two parameters, truncated towards negative infinity.
Example
>>> 10 `divInt` 2 5
>>> 10 `div` 2 5
-
base GHC.Base Used to implement mod for the Integral typeclass. This performs the modulo operation, satisfying
((x `div` y) * y) + (x `mod` y) == x
Example
>>> 7 `modInt` 3 1
>>> 7 `mod` 3 1
-
base GHC.Float Used to prevent exponent over/underflow when encoding floating point numbers. This is also the same as
\(x,y) -> max (-x) (min x y)
Example
>>> clamp (-10) 5 10
-
text Data.Text.Internal Checked multiplication. Calls error if the result would overflow.
-
ghc-bignum GHC.Num.BigNat Greatest common divisor between two Int Warning: result may become negative if (at least) one argument is minBound
-
storable-record Foreign.Storable.FixedArray No documentation available.
stepStartAdjust :: Int -> Int -> Intmassiv Data.Massiv.Core.Index Helper for adjusting stride of a chunk
Page 1 of many | Next