random-tree-0.6.0.5: Create random trees

Safe Haskell	None
Language	Haskell2010

Math.RandomTree.Types

Description

Collects all types used in the program

Documentation

data TreeState a #

Constructors

TreeState
Fields size :: Int

Instances

MonadState (TreeState Int) ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods get :: ReaderStateRandom (TreeState Int) # put :: TreeState Int -> ReaderStateRandom () # state :: (TreeState Int -> (a, TreeState Int)) -> ReaderStateRandom a #

data TreeConfig #

Constructors

TreeConfig
Fields maxSize :: Int minSize :: Int minChildren :: Int maxChildren :: Int

Instances

MonadReader TreeConfig ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods ask :: ReaderStateRandom TreeConfig # local :: (TreeConfig -> TreeConfig) -> ReaderStateRandom a -> ReaderStateRandom a # reader :: (TreeConfig -> a) -> ReaderStateRandom a #

newtype ReaderStateRandom a #

Constructors

ReaderStateRandom
Fields runReaderStateRandom :: ReaderT TreeConfig (StateT (TreeState Int) (MaybeT (Rand StdGen))) a

Instances

Monad ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods (>>=) :: ReaderStateRandom a -> (a -> ReaderStateRandom b) -> ReaderStateRandom b # (>>) :: ReaderStateRandom a -> ReaderStateRandom b -> ReaderStateRandom b # return :: a -> ReaderStateRandom a # fail :: String -> ReaderStateRandom a #
Functor ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods fmap :: (a -> b) -> ReaderStateRandom a -> ReaderStateRandom b # (<$) :: a -> ReaderStateRandom b -> ReaderStateRandom a #
Applicative ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods pure :: a -> ReaderStateRandom a # (<>) :: ReaderStateRandom (a -> b) -> ReaderStateRandom a -> ReaderStateRandom b # liftA2 :: (a -> b -> c) -> ReaderStateRandom a -> ReaderStateRandom b -> ReaderStateRandom c # (>) :: ReaderStateRandom a -> ReaderStateRandom b -> ReaderStateRandom b # (<*) :: ReaderStateRandom a -> ReaderStateRandom b -> ReaderStateRandom a #
MonadPlus ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods mzero :: ReaderStateRandom a # mplus :: ReaderStateRandom a -> ReaderStateRandom a -> ReaderStateRandom a #
MonadRandom ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods getRandomR :: Random a => (a, a) -> ReaderStateRandom a # getRandom :: Random a => ReaderStateRandom a # getRandomRs :: Random a => (a, a) -> ReaderStateRandom [a] # getRandoms :: Random a => ReaderStateRandom [a] #
Alternative ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods empty :: ReaderStateRandom a # (<\|>) :: ReaderStateRandom a -> ReaderStateRandom a -> ReaderStateRandom a # some :: ReaderStateRandom a -> ReaderStateRandom [a] # many :: ReaderStateRandom a -> ReaderStateRandom [a] #
MonadReader TreeConfig ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods ask :: ReaderStateRandom TreeConfig # local :: (TreeConfig -> TreeConfig) -> ReaderStateRandom a -> ReaderStateRandom a # reader :: (TreeConfig -> a) -> ReaderStateRandom a #
MonadState (TreeState Int) ReaderStateRandom #
Instance details Defined in Math.RandomTree.Types Methods get :: ReaderStateRandom (TreeState Int) # put :: TreeState Int -> ReaderStateRandom () # state :: (TreeState Int -> (a, TreeState Int)) -> ReaderStateRandom a #