Math.Combinat.Helper

Miscellaneous helper functions

debugging

debug :: Show a => a -> b -> b

pairs

swap :: (a, b) -> (b, a)

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

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

lists

sum' :: Num a => [a] -> a

interleave :: [a] -> [a] -> [a]

equality and ordering

equating :: Eq b => (a -> b) -> a -> a -> Bool

reverseOrdering :: Ordering -> Ordering

reverseComparing :: Ord b => (a -> b) -> a -> a -> Ordering

reverseCompare :: Ord a => a -> a -> Ordering

reverseSort :: Ord a => [a] -> [a]

groupSortBy :: (Eq b, Ord b) => (a -> b) -> [a] -> [[a]]

nubOrd :: Ord a => [a] -> [a]

increasing / decreasing sequences

isWeaklyIncreasing :: Ord a => [a] -> Bool

isStrictlyIncreasing :: Ord a => [a] -> Bool

isWeaklyDecreasing :: Ord a => [a] -> Bool

isStrictlyDecreasing :: Ord a => [a] -> Bool

first / last

mapWithLast :: (Bool -> a -> b) -> [a] -> [b]

The boolean argument will True only for the last element

mapWithFirst :: (Bool -> a -> b) -> [a] -> [b]

mapWithFirstLast :: (Bool -> Bool -> a -> b) -> [a] -> [b]

older helpers for ASCII drawing

mkLinesUniformWidth :: [String] -> [String]

extend lines with spaces so that they have the same line

mkBlocksUniformHeight :: [[String]] -> [[String]]

mkUniformBlocks :: [[String]] -> [[String]]

hConcatLines :: [[String]] -> [String]

vConcatLines :: [[String]] -> [String]

counting

count :: Eq a => a -> [a] -> Int

histogram :: (Eq a, Ord a) => [a] -> [(a, Int)]

maybe

fromJust :: Maybe a -> a

bool

intToBool :: Int -> Bool

boolToInt :: Bool -> Int

iteration

nest :: Int -> (a -> a) -> a -> a

unfold1 :: (a -> Maybe a) -> a -> [a]

unfold :: (b -> (a, Maybe b)) -> b -> [a]

unfoldEither :: (b -> Either c (b, a)) -> b -> (c, [a])

unfoldM :: Monad m => (b -> m (a, Maybe b)) -> b -> m [a]

mapAccumM :: Monad m => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, [y])

long zipwith

longZipWith :: a -> b -> (a -> b -> c) -> [a] -> [b] -> [c]

random

type Rand g = RandT g Identity

A simple random monad to make life suck less

runRand :: Rand g a -> g -> (a, g)

flipRunRand :: Rand s a -> s -> (s, a)

newtype RandT g m a

The Rand monad transformer

Constructors

RandT (StateT g m a)

Instances

Monad m => Monad (RandT g m)

Defined in Math.Combinat.Helper

Methods

(>>=) :: RandT g m a -> (a -> RandT g m b) -> RandT g m b

(>>) :: RandT g m a -> RandT g m b -> RandT g m b

return :: a -> RandT g m a

fail :: String -> RandT g m a

Functor m => Functor (RandT g m)

Defined in Math.Combinat.Helper

Methods

fmap :: (a -> b) -> RandT g m a -> RandT g m b

(<$) :: a -> RandT g m b -> RandT g m a

Monad m => Applicative (RandT g m)

Defined in Math.Combinat.Helper

Methods

pure :: a -> RandT g m a

(<*>) :: RandT g m (a -> b) -> RandT g m a -> RandT g m b

liftA2 :: (a -> b -> c) -> RandT g m a -> RandT g m b -> RandT g m c

(*>) :: RandT g m a -> RandT g m b -> RandT g m b

(<*) :: RandT g m a -> RandT g m b -> RandT g m a

runRandT :: RandT g m a -> g -> m (a, g)

flipRunRandT :: Monad m => RandT s m a -> s -> m (s, a)

This may be occasionally useful

rand :: (g -> (a, g)) -> Rand g a

Puts a standard-conforming random function into the monad

randRoll :: (RandomGen g, Random a) => Rand g a

randChoose :: (RandomGen g, Random a) => (a, a) -> Rand g a

randProxy1 :: Rand g (f n) -> Proxy n -> Rand g (f n)