module Haskell.X where
import Data.List
import Data.Ord
import Control.Arrow
exhaustively :: Eq a => (a -> a) -> a -> a
exhaustively = exhaustivelyBy (==)
exhaustivelyBy :: (a -> a -> Bool) -> (a -> a) -> a -> a
exhaustivelyBy predicate func dat = case predicate dat result of
True -> result
False -> exhaustivelyBy predicate func result
where result = func dat
exhaustivelyM :: (Eq a, Monad m) => (a -> m a) -> a -> m a
exhaustivelyM = exhaustivelyByM (==)
exhaustivelyByM :: Monad m => (a -> a -> Bool) -> (a -> m a) -> a -> m a
exhaustivelyByM predicate func dat = do
result <- func dat
case predicate dat result of
True -> return result
False -> exhaustivelyByM predicate func result
uniqSort :: (Ord a) => [a] -> [a]
uniqSort = map head . group . sort
aggregateBy :: (a -> a -> Ordering) -> [a] -> [[a]]
aggregateBy x = groupBy (\a b -> x a b == EQ) . sortBy x
aggregate :: (Ord a) => [a] -> [[a]]
aggregate = aggregateBy compare
aggregateAL :: (Ord a) => [(a,b)] -> [(a,[b])]
aggregateAL = map (fst . head &&& map snd) . aggregateBy (comparing fst)
tr :: Eq a => a -> a -> [a] -> [a]
tr n r (x:xs)
| x == n = r : tr n r xs
| otherwise = x : tr n r xs
tr _ _ [] = []