Modulemassiv-1.0.5.0Haskell2010

Data.Massiv.Array.Mutable.Algorithms

4 values

Packagemassiv-1.0.5.0
Exports4
LanguageHaskell2010
LicenceBSD-3-Clause
SourceSort.hs

valuequicksortM_

:: (Ord e, Manifest r e, MonadPrimBase s m)
=> Scheduler s ()
-> MVector s r e
-> m ()

Manifest version of quicksort

valuequicksortByM_

:: (Manifest r e, MonadPrimBase s m)
=> e -> e -> m Ordering
-> Scheduler s ()
-> MVector s r e
-> m ()

Same as quicksortM_, but instead of Ord constraint expects a custom Ordering.

valueunstablePartitionM

:: (Manifest r e, PrimMonad m)
=> MVector (PrimState m) r e
-> (e -> m Bool)
Predicate
-> m Ix1

Partition elements of the supplied mutable vector according to the predicate.

Example

Example6 expressions

>>> import Data.Massiv.Array as A>>> import Data.Massiv.Array.Mutable.Algorithms>>> :set -XOverloadedLists>>> m <- thaw ([2,1,50,10,20,8] :: Array P Ix1 Int)>>> unstablePartitionM m (pure . (<= 10))4>>> freeze Seq mArray P Seq (Sz1 6)  [ 2, 1, 8, 10, 20, 50 ]

valueiterateUntilM

:: (Load r' ix e, Manifest r e, MonadIO m)
=> (Int -> Array r ix e -> MArray RealWorld r ix e -> m Bool)
Convergence condition. Accepts current iteration counter, pure array at previous state and a mutable at the current state, therefore after each iteration its contents can be modifed if necessary.
-> (Int -> Array r ix e -> m (Array r' ix e))
A modifying function to apply at each iteration. The size of resulting array may differ if necessary.
-> Array r ix e
Initial source array
-> m (Array r ix e)

Monadic version of iterateUntil where at each iteration mutable version of an array is available. However it is less efficient then the pure alternative, because an intermediate array must be copied at each iteration.