Skip to content

HORIZON HASKELL Docs lts/ghc-10.0.x77a86622026-10-31Search packagesCtrl K

Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 77a8662 · 2026-10-31

Modulestatistics-0.16.5.0Haskell2010

Statistics.Function

Useful functions.

Contents

Scanning
Sorting
Indexing
Bit twiddling
Comparison
Arithmetic
Vectors
Combinators

Synopsis

value minMax
value sort
value gsort
value sortBy
value partialSort
value indexed
value indices
value nextHighestPowerOfTwo
value within
value square
value unsafeModify
value for
value rfor

Packagestatistics-0.16.5.0
Exports13
LanguageHaskell2010
LicenceBSD-2-Clause
SourceFunction.hs

Scanning

valueminMax :: Vector v Double => v Double -> (Double, Double)

Compute the minimum and maximum of a vector in one pass.

Sorting

valuesort :: Vector Double -> Vector Double

Sort a vector.

valuegsort :: (Ord e, Vector v e) => v e -> v e

Sort a vector.

valuesortBy :: Vector v e => Comparison e -> v e -> v e

Sort a vector using a custom ordering.

valuepartialSort

:: (Vector v e, Ord e)
=> Int
The number k of least elements.
-> v e
-> v e

Partially sort a vector, such that the least k elements will be at the front.

Indexing

valueindexed :: (Vector v e, Vector v (Int, e)) => v e -> v (Int, e)

Zip a vector with its indices.

valueindices :: (Vector v a, Vector v Int) => v a -> v Int

Return the indices of a vector.

Bit twiddling

valuenextHighestPowerOfTwo :: Int -> Int

Efficiently compute the next highest power of two for a non-negative integer. If the given value is already a power of two, it is returned unchanged. If negative, zero is returned.

Comparison

valuewithin

:: Int
Number of ULPs of accuracy desired.
-> Double
-> Double
-> Bool

Compare two Double values for approximate equality, using Dawson's method.

The required accuracy is specified in ULPs (units of least precision). If the two numbers differ by the given number of ULPs or less, this function returns True.

Arithmetic

valuesquare :: Double -> Double

Multiply a number by itself.

Vectors

valueunsafeModify :: MVector s Double -> Int -> (Double -> Double) -> ST s ()

Combinators

valuefor :: Monad m => Int -> Int -> (Int -> m ()) -> m ()

Simple for loop. Counts from start to end-1.

valuerfor :: Monad m => Int -> Int -> (Int -> m ()) -> m ()

Simple reverse-for loop. Counts from start-1 to end (which must be less than start).