Ideas.Utils.Prelude

A collection of general utility functions

Documentation

data Some f

Constructors

Some (f a)

newtype ShowString

Constructors

ShowString

Fields

• fromShowString :: String

Instances

Eq ShowString

Defined in Ideas.Utils.Prelude

Methods

(==) :: ShowString -> ShowString -> Bool

(/=) :: ShowString -> ShowString -> Bool

Ord ShowString

Defined in Ideas.Utils.Prelude

Methods

compare :: ShowString -> ShowString -> Ordering

(<) :: ShowString -> ShowString -> Bool

(<=) :: ShowString -> ShowString -> Bool

(>) :: ShowString -> ShowString -> Bool

(>=) :: ShowString -> ShowString -> Bool

max :: ShowString -> ShowString -> ShowString

min :: ShowString -> ShowString -> ShowString

Read ShowString

Defined in Ideas.Utils.Prelude

Methods

readsPrec :: Int -> ReadS ShowString

readList :: ReadS [ShowString]

readPrec :: ReadPrec ShowString

readListPrec :: ReadPrec [ShowString]

Show ShowString

Defined in Ideas.Utils.Prelude

Methods

showsPrec :: Int -> ShowString -> ShowS

show :: ShowString -> String

showList :: [ShowString] -> ShowS

IsTerm ShowString

Defined in Ideas.Common.Rewriting.Term

Methods

toTerm :: ShowString -> Term

toTermList :: [ShowString] -> Term

fromTerm :: MonadPlus m => Term -> m ShowString

fromTermList :: MonadPlus m => Term -> m [ShowString]

Reference ShowString

Defined in Ideas.Common.Environment

Methods

makeRef :: IsId n => n -> Ref ShowString

makeRefList :: IsId n => n -> Ref [ShowString]

readInt :: String -> Maybe Int

readM :: (Monad m, Read a) => String -> m a

subsets :: [a] -> [[a]]

isSubsetOf :: Eq a => [a] -> [a] -> Bool

cartesian :: [a] -> [b] -> [(a, b)]

distinct :: Eq a => [a] -> Bool

allsame :: Eq a => [a] -> Bool

fixpoint :: Eq a => (a -> a) -> a -> a

splitAtElem :: Eq a => a -> [a] -> Maybe ([a], [a])

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

timedSeconds :: Int -> IO a -> IO a

getDiffTime :: IO a -> IO (a, NominalDiffTime)

fst3 :: (a, b, c) -> a

snd3 :: (a, b, c) -> b

thd3 :: (a, b, c) -> c

headM :: Monad m => [a] -> m a

findIndexM :: Monad m => (a -> Bool) -> [a] -> m Int

elementAt :: Monad m => Int -> [a] -> m a

changeAt :: Monad m => Int -> (a -> a) -> [a] -> m [a]

replaceAt :: Monad m => Int -> a -> [a] -> m [a]

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

mwhen :: Monoid a => Bool -> a -> a

munless :: Monoid a => Bool -> a -> a