MagicHaskeller.IOGenerator

Documentation

arbitraries :: Arbitrary a => [a]

arbs :: Arbitrary a => Int -> StdGen -> [a]

showIOPairsHTML :: String -> [ShownIOPair] -> String

showIOPairsWithFormsHTML

Arguments

:: String

CGI.myPath, which is usually "cgi-binMagicHaskeller.cgi"

-> String

predicate before escaping single quotes

-> String

-> [ShownIOPair]

-> String

showIOPairsHTML' :: (Int -> ShownIOPair -> String) -> String -> [ShownIOPair] -> String

nubOn :: Eq a => (b -> a) -> [b] -> [b]

nubSortedOn :: Ord a => (b -> a) -> [b] -> [b]

nubSortedOn' :: Ord a => (b -> a) -> [b] -> [b]

type ShownIOPair = ([AnnShowS], String)

iopairToInputs :: ShownIOPair -> [String]

assToString :: AnnShowS -> String

type AnnShowS

Arguments

 = (String -> String)

annotater

-> String

-> String

showIOPairHTML :: ShownIOPair -> String

showIOPairWithFormHTML :: String -> Int -> ([AnnShowS], String) -> String

mkForm :: String -> Int -> ShownIOPair -> String

showsInputs :: Foldable t => t ((a -> a) -> [Char] -> [Char]) -> [Char] -> [Char]

escapeQuote :: Char -> [Char]

class IOGenerator a where

Methods

generateIOPairs :: a -> [ShownIOPair]

Instances

Show a => IOGenerator a

IOGenerator r => IOGenerator (Bool -> r)

IOGenerator r => IOGenerator (Char -> r)

IOGenerator r => IOGenerator (Double -> r)

IOGenerator r => IOGenerator (Float -> r)

IOGenerator r => IOGenerator (Int -> r)

IOGenerator r => IOGenerator (Integer -> r)

IOGenerator r => IOGenerator (Ordering -> r)

IOGenerator r => IOGenerator (String -> r)

IOGenerator r => IOGenerator (() -> r)

(ShowArbitrary a, IOGenerator r) => IOGenerator (a -> r)

generateIOPairsLitNum :: (Num a, Ord a, Show a, IOGenerator b) => [a] -> (a -> b) -> [ShownIOPair]

integrals :: Integral i => [i]

mhGenerateIOPairs :: (ShowArbitrary a, IOGenerator b) => (a -> b) -> [ShownIOPair]

class ShowArbitrary a where

ShowArbitrary is a variant of Arbitrary for presenting I/O example pairs. It uses everythingF for generating printable functions. Here `good presentation' is more important than `good randomness'.

Methods

showArbitraries :: [(AnnShowS, a)]

Instances

ShowArbitrary Bool

ShowArbitrary Char

ShowArbitrary Double

ShowArbitrary Float

ShowArbitrary Int

ShowArbitrary Integer

ShowArbitrary Ordering

ShowArbitrary ()

ShowArbitrary a => ShowArbitrary [a]

ShowArbitrary a => ShowArbitrary (Maybe a)

(Integral i, Random i, Show i) => ShowArbitrary (Ratio i)

(Typeable * a, Typeable * b) => ShowArbitrary (a -> b)

(ShowArbitrary a, ShowArbitrary b) => ShowArbitrary (Either a b)

(ShowArbitrary a, ShowArbitrary b) => ShowArbitrary (a, b)

(ShowArbitrary a, ShowArbitrary b, ShowArbitrary c) => ShowArbitrary (a, b, c)

sas :: Show a => (a -> Bool) -> [a] -> [(AnnShowS, a)]

sasNum :: (Show a, Arbitrary a, Num a, Ord a) => [(AnnShowS, a)]

sasFalse :: Show a => [a] -> [(AnnShowS, a)]

sasIntegral :: (Show a, Arbitrary a, Integral a, Ord a) => [(AnnShowS, a)]

mapSA :: [Char] -> (t -> t1) -> (t2 -> String -> [Char], t) -> (t2 -> ShowS, t1)

skip :: Int -> [a] -> [a]

chopBy :: [Int] -> [a] -> [[a]]

cvt :: [(AnnShowS, a)] -> (AnnShowS, [a])

showsList :: [(a -> a) -> [Char] -> [Char]] -> (a -> a) -> ShowS

generateIOPairsFun :: (Ord a, Show a, Arbitrary a, IOGenerator b) => Bool -> (a -> b) -> [ShownIOPair]

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

class NearEq a where

Methods

(~=) :: a -> a -> Bool infix 4

Instances

NearEq Bool

NearEq Char

NearEq Double

NearEq Float

NearEq Int

NearEq Integer

NearEq Ordering

NearEq ()

NearEq a => NearEq [a]

NearEq a => NearEq (Maybe a)

(NearEq i, Integral i) => NearEq (Ratio i)

(NearEq a, NearEq b) => NearEq (Either a b)

(NearEq a, NearEq b) => NearEq (a, b)

(NearEq a, NearEq b, NearEq c) => NearEq (a, b, c)