Safe Haskell	None
Language	GHC2021

Control.Concurrent.DivideConquer.Linear

Contents

Synopsis

divideAndConquer :: forall (α :: Lifetime) (β :: Lifetime) (t :: Type -> Type) a. (Traversable t, Consumable (t ()), α >= β) => Int -> DivideConquer α t a -> Mut α a %1 -> BO β (Mut α a)
data DivideConquer (α :: Lifetime) (t :: Type -> Type) a = DivideConquer {
- divide :: forall (β :: Lifetime). α >= β => Mut β a %1 -> BO β (Result β t a)
}
qsortDC :: forall a (α :: Lifetime) (β :: Lifetime). (Ord a, Copyable a, α >= β) => Int -> Int -> Mut α (Vector a) %1 -> BO β (Mut α (Vector a))

Documentation

Arguments

:: forall (α :: Lifetime) (β :: Lifetime) (t :: Type -> Type) a. (Traversable t, Consumable (t ()), α >= β)
=> Int	The # of workers.
-> DivideConquer α t a
-> Mut α a
-> BO β (Mut α a)

Constructors

DivideConquer
Fields divide :: forall (β :: Lifetime). α >= β => Mut β a %1 -> BO β (Result β t a)

Examples

Arguments

:: forall a (α :: Lifetime) (β :: Lifetime). (Ord a, Copyable a, α >= β)
=> Int	The # of workers.
-> Int	Threshold for the length of vector to switch to sequential sort.
-> Mut α (Vector a)
-> BO β (Mut α (Vector a))