Perf.Algos

Algorithms and functions for testing purposes

command-line options

data Example

Algorithm examples for testing

Constructors

ExampleSumFuse

ExampleSum

ExampleLengthF

ExampleConstFuse

ExampleMapInc

ExampleNoOp

Instances

Show Example

Defined in Perf.Algos

Methods

showsPrec :: Int -> Example -> ShowS

show :: Example -> String

showList :: [Example] -> ShowS

Eq Example

Defined in Perf.Algos

Methods

(==) :: Example -> Example -> Bool

(/=) :: Example -> Example -> Bool

allExamples :: [Example]

All the example algorithms.

parseExample :: Parser Example

Parse command-line options for algorithm examples.

data ExamplePattern a

Unification of example function applications

Constructors

PatternSumFuse Text (Num a => a -> a) a

PatternSum Text (Num a => [a] -> a) [a]

PatternLengthF Text ([a] -> Int) [a]

PatternConstFuse Text (Int -> ()) Int

PatternMapInc Text ([Int] -> [Int]) [Int]

PatternNoOp Text (() -> ()) ()

examplePattern :: Example -> Int -> ExamplePattern Int

Convert an Example to an ExamplePattern.

exampleLabel :: ExamplePattern a -> Text

Labels

testExample :: (Semigroup a, MonadIO m) => ExamplePattern Int -> PerfT m a ()

Convert an ExamplePattern to a PerfT.

statExamples :: MonadIO m => Int -> Int -> (Int -> Measure m [a]) -> m (Map Text [a])

run an example measurement.

sum algorithms

data SumPattern a

Unification of sum function applications

Constructors

SumFuse Text (Int -> Int) Int

SumFusePoly Text ((Enum a, Num a) => a -> a) a

SumPoly Text (Num a => [a] -> a) [a]

SumMono Text ([Int] -> Int) [Int]

allSums :: Int -> [SumPattern Int]

All the sum algorithms.

testSum :: (Semigroup a, MonadIO m) => SumPattern Int -> PerfT m a Int

Convert an SumPattern to a PerfT.

statSums :: MonadIO m => Int -> Int -> (Int -> Measure m [a]) -> m (Map Text [a])

Run a sum algorithm measurement.

sumTail :: Num a => [a] -> a

tail resursive

sumTailLazy :: Num a => [a] -> a

lazy recursion.

sumFlip :: Num a => [a] -> a

With argument order flipped

sumFlipLazy :: Num a => [a] -> a

Lazy with argument order flipped.

sumCo :: Num a => [a] -> a

Co-routine style

sumCoGo :: Num a => [a] -> a

Co-routine, go style

sumCoCase :: Num a => [a] -> a

Co-routine, case-style

sumAux :: Num a => [a] -> a

Auxillary style.

sumFoldr :: Num a => [a] -> a

foldr style

sumCata :: Num a => [a] -> a

cata style

sumSum :: Num a => [a] -> a

sum

sumMono :: [Int] -> Int

Monomorphic sum

sumPoly :: Num a => [a] -> a

Polymorphic sum

sumLambda :: Num a => [a] -> a

Lambda-style sum

sumF :: Num a => [a] -> a

GHC-style foldr method.

sumFuse :: Int -> Int

Fusion check

sumFusePoly :: (Enum a, Num a) => a -> a

Fusion under polymorph

sumFuseFoldl' :: Int -> Int

foldl' fusion

sumFuseFoldr :: Int -> Int

foldr fusion

length algorithms

data LengthPattern a

Unification of length function applications

Constructors

LengthPoly Text ([a] -> Int) [a]

LengthMono Text ([Int] -> Int) [Int]

allLengths :: Int -> [LengthPattern Int]

All the length algorithms.

testLength :: (Semigroup a, MonadIO m) => LengthPattern Int -> PerfT m a Int

Convert an LengthPattern to a PerfT.

statLengths :: MonadIO m => Int -> Int -> (Int -> Measure m [a]) -> m (Map Text [a])

Run a lengths algorithm

length

lengthTail :: [a] -> Int

tail resursive

lengthTailLazy :: [a] -> Int

lazy recursion.

lengthFlip :: [a] -> Int

With argument order flipped

lengthFlipLazy :: [a] -> Int

Lazy with argument order flipped.

lengthCo :: [a] -> Int

Co-routine style

lengthCoCase :: [a] -> Int

Co-routine style as a Case statement.

lengthAux :: [a] -> Int

Auxillary version.

lengthFoldr :: [a] -> Int

foldr style

lengthFoldrConst :: [a] -> Int

foldr style with explicit const usage.

lengthF :: [a] -> Int

GHC style

lengthFMono :: [Int] -> Int

Monomorphic, GHC style

recursion patterns

recurseTail :: (a -> b -> b) -> b -> [a] -> b

Tail recursion

recurseTailLazy :: (a -> b -> b) -> b -> [a] -> b

Lazy tail recursion

recurseFlip :: (a -> b -> b) -> b -> [a] -> b

Tail resursion with flipped argument order.

recurseFlipLazy :: (a -> b -> b) -> b -> [a] -> b

Lazy tail resursion with flipped argument order.

recurseCo :: (a -> b -> b) -> b -> [a] -> b

Coroutine

recurseCoLazy :: (a -> b -> b) -> b -> [a] -> b

Lazy, coroutine

recurseCata :: (a -> b -> b) -> b -> [a] -> b

Cata style

miscellaneous

mapInc :: [Int] -> [Int]

Increment a list.

constFuse :: Int -> ()

Test of const fusion

splitHalf :: [a] -> ([a], [a])

Split a list.