CustomPrelude

Documentation

module BasicPrelude

module Control.Monad.Loops

Applicative operators for monads

(<&>) :: Monad m => m (a -> b) -> m a -> m b

Equivalent to *

(<@>) :: Monad m => (a -> b) -> m a -> m b

Equivalent to $

Splitting variants

splitWhen :: (a -> Bool) -> [a] -> [[a]]

Split lists at delimiter specified by a condition Drops empty groups (similar to words)

splitOn :: Eq a => a -> [a] -> [[a]]

Split lists at the specified delimiter Drops empty groups (similar to words)

Fold variants

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

A Standard strict version of foldl

foldlMaybe :: (a -> b -> Maybe a) -> a -> [b] -> a

Specialised foldl' with short circuit evaluation A Nothing stops processing for the rest of the list

foldlStrictMaybe :: (a -> b -> Maybe a) -> a -> [b] -> a

Strict version of specialised foldl' with short circuit evaluation

Points free programming

(.:) :: (c -> d) -> (a -> b -> c) -> a -> b -> d

Seamless composition of a one and a two arg function

oo :: (c -> d) -> (a -> b -> c) -> a -> b -> d

An alias for (.:)

ooo :: (d -> e) -> (a -> b -> c -> d) -> a -> b -> c -> e

Seamless composition of a one and a three arg function

oooo :: (e -> f) -> (a -> b -> c -> d -> e) -> a -> b -> c -> d -> f

Seamless composition of a one and a four arg function

Misc

bool :: a -> a -> Bool -> a

Bool deconstructor in the spirit of either and maybe Similar to the lambda-if proposal

More Monad Loops

whileIterateM :: Monad m => (a -> m Bool) -> (a -> m a) -> a -> m a

whileIterateM b f a will execute action (f a) while (b a) is true and also feed the results back to the next iteration. NOTE: Suggestions for a better name are welcome!

ifM :: Monad m => m Bool -> m a -> m a -> m a

Monadic version of the if condition

Math

nextPowerOf2 :: Int -> Int

Computes the next power of two for integers Works only on a 32/64 bit machine (is there any other kind?)