SoccerFun.Prelude

Collection of functions of more general purpose.

Documentation

avg :: Fractional a => [a] -> a

zero :: Num a => a

one :: Num a => a

iterateStn :: Int -> (s -> (a, s)) -> s -> ([a], s)

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

spanfilter :: (a -> Bool) -> [a] -> ([a], [a])

spanfilter cond xs = (filter cond xs, filter (not . cond) xs)

spanfilterSt :: (a -> s -> (Bool, s)) -> [a] -> s -> (([a], [a]), s)

break' :: (a -> Bool) -> [a] -> ([a], [a], [a])

break cond (A ++ B ++ C) = (A,B,C) where for each x in A: not cond x /\ for each x in B: cond x /\ if C=(x:_): not cond x

break1 :: (a -> Bool) -> [a] -> ([a], a, [a])

break1 cond (A ++ [B] ++ C) = (A,B,C) where for each x in A: not cond x /\ cond B /\ if C=(x:_): not cond x

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

unbreak (a,b,c) = a ++ b ++ c

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

unbreak1 (a,b,c) = a ++ [b] ++ c

type AssocList k v = [(k, v)]

boundedBy :: Ord a => a -> (a, a) -> a

isbetween :: Ord a => a -> a -> a -> Bool

isbetween x low up returns True iff low <= x <= up

minmax :: Ord a => (a, a) -> (a, a)

minmax (a,b) = (a,b) if a<=b; (b,a) otherwise

perhaps :: (a -> Bool) -> Maybe a -> Bool

perhaps p Nothing = False, and perhaps p (Just a) = p a

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

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