twee-0.1: An equational theorem prover

Safe HaskellSafe
LanguageHaskell2010

Twee.Utils

Description

Miscellaneous utility functions.

Documentation

repeatM :: Monad m => m a -> m [a] Source #

partitionBy :: Ord b => (a -> b) -> [a] -> [[a]] Source #

collate :: Ord a => ([b] -> c) -> [(a, b)] -> [(a, c)] Source #

isSorted :: Ord a => [a] -> Bool Source #

isSortedBy :: Ord b => (a -> b) -> [a] -> Bool Source #

usort :: Ord a => [a] -> [a] Source #

usortBy :: (a -> a -> Ordering) -> [a] -> [a] Source #

sortBy' :: Ord b => (a -> b) -> [a] -> [a] Source #

usortBy' :: Ord b => (a -> b) -> [a] -> [a] Source #

unbuffered :: IO a -> IO a Source #

newtype Max a Source #

Constructors

Max 

Fields

Instances

Ord a => Monoid (Max a) Source # 

Methods

mempty :: Max a #

mappend :: Max a -> Max a -> Max a #

mconcat :: [Max a] -> Max a #

getMaxWith :: Ord a => a -> Max a -> a Source #

newtype Min a Source #

Constructors

Min 

Fields

Instances

Ord a => Monoid (Min a) Source # 

Methods

mempty :: Min a #

mappend :: Min a -> Min a -> Min a #

mconcat :: [Min a] -> Min a #

getMinWith :: Ord a => a -> Min a -> a Source #

labelM :: Monad m => (a -> m b) -> [a] -> m [(a, b)] Source #