Safe Haskell	Safe-Inferred
Language	Haskell2010

Modelling.Auxiliary.Common

Contents

Orphan instances

Synopsis

data ModellingTasksException = NeverHappens
data Object = Object {
- oName :: String
- oIndex :: Int
}
class Randomise a where
- randomise :: (MonadRandom m, MonadThrow m) => a -> m a
- isRandomisable :: a -> Maybe String
class RandomiseLayout a where
- randomiseLayout :: (MonadRandom m, MonadThrow m) => a -> m a
class RandomiseNames a where
- hasRandomisableNames :: a -> Maybe String
- randomiseNames :: (MonadRandom m, MonadThrow m) => a -> m a
newtype ShuffleExcept g a = ShuffleExcept {
- unShuffleExcept :: RandT g (Either SomeException) a
}
data TaskGenerationException = NoInstanceAvailable
findFittingRandomElements :: MonadRandom m => Bool -> [a] -> [a -> m Bool] -> m (Maybe [a])
getFirstInstance :: MonadThrow m => [a] -> m a
lensRulesL :: LensRules
lowerFirst :: String -> String
mapIndicesTo :: (Eq a, MonadThrow m) => [a] -> [a] -> m [(Int, Int)]
oneOf :: MonadRandom m => [a] -> m a
parseInt :: Parser Int
parseWith :: MonadThrow m => (Int -> Parser a) -> String -> m a
skipSpaces :: Parser ()
toMap :: (Ord a, Ord b) => Set (a, b) -> Map a (Set b)
upperFirst :: String -> String
upperToDash :: String -> String
weightedShuffle :: (MonadRandom m, Eq a, Real w) => [(a, w)] -> m [a]

Documentation

data ModellingTasksException Source #

Constructors

NeverHappens

Instances

Instances details

Exception ModellingTasksException Source #
Instance details Defined in Modelling.Auxiliary.Common Methods toException :: ModellingTasksException -> SomeException # fromException :: SomeException -> Maybe ModellingTasksException # displayException :: ModellingTasksException -> String #
Show ModellingTasksException Source #
Instance details Defined in Modelling.Auxiliary.Common Methods showsPrec :: Int -> ModellingTasksException -> ShowS # show :: ModellingTasksException -> String # showList :: [ModellingTasksException] -> ShowS #

data Object Source #

Constructors

Object
Fields oName :: String oIndex :: Int

Instances

Instances details

Show Object Source #
Instance details Defined in Modelling.Auxiliary.Common Methods showsPrec :: Int -> Object -> ShowS # show :: Object -> String # showList :: [Object] -> ShowS #
Eq Object Source #
Instance details Defined in Modelling.Auxiliary.Common Methods (==) :: Object -> Object -> Bool # (/=) :: Object -> Object -> Bool #
Ord Object Source #
Instance details Defined in Modelling.Auxiliary.Common Methods compare :: Object -> Object -> Ordering # (<) :: Object -> Object -> Bool # (<=) :: Object -> Object -> Bool # (>) :: Object -> Object -> Bool # (>=) :: Object -> Object -> Bool # max :: Object -> Object -> Object # min :: Object -> Object -> Object #

class Randomise a where Source #

The class of types that allow some form of randomisation.

Minimal complete definition

randomise

Methods

randomise :: (MonadRandom m, MonadThrow m) => a -> m a Source #

Shuffles every component without affecting basic overall properties

isRandomisable :: a -> Maybe String Source #

Checks the randomisability of the given value * returns Nothing, if it is randomisable * returns Just the explanation why not, otherwise

Instances

Instances details

Randomise MatchCdOdInstance Source #
Instance details Defined in Modelling.CdOd.MatchCdOd Methods randomise :: (MonadRandom m, MonadThrow m) => MatchCdOdInstance -> m MatchCdOdInstance Source # isRandomisable :: MatchCdOdInstance -> Maybe String Source #
Randomise NameCdErrorInstance Source #
Instance details Defined in Modelling.CdOd.NameCdError Methods randomise :: (MonadRandom m, MonadThrow m) => NameCdErrorInstance -> m NameCdErrorInstance Source # isRandomisable :: NameCdErrorInstance -> Maybe String Source #
Randomise RepairCdInstance Source #
Instance details Defined in Modelling.CdOd.RepairCd Methods randomise :: (MonadRandom m, MonadThrow m) => RepairCdInstance -> m RepairCdInstance Source # isRandomisable :: RepairCdInstance -> Maybe String Source #
Randomise SelectValidCdInstance Source #
Instance details Defined in Modelling.CdOd.SelectValidCd Methods randomise :: (MonadRandom m, MonadThrow m) => SelectValidCdInstance -> m SelectValidCdInstance Source # isRandomisable :: SelectValidCdInstance -> Maybe String Source #

class RandomiseLayout a where Source #

The class of types that allow changing its layout randomly.

Methods

randomiseLayout :: (MonadRandom m, MonadThrow m) => a -> m a Source #

Instances

Instances details

RandomiseLayout DifferentNamesInstance Source #
Instance details Defined in Modelling.CdOd.DifferentNames Methods randomiseLayout :: (MonadRandom m, MonadThrow m) => DifferentNamesInstance -> m DifferentNamesInstance Source #
RandomiseLayout MatchCdOdInstance Source #
Instance details Defined in Modelling.CdOd.MatchCdOd Methods randomiseLayout :: (MonadRandom m, MonadThrow m) => MatchCdOdInstance -> m MatchCdOdInstance Source #
RandomiseLayout NameCdErrorInstance Source #
Instance details Defined in Modelling.CdOd.NameCdError Methods randomiseLayout :: (MonadRandom m, MonadThrow m) => NameCdErrorInstance -> m NameCdErrorInstance Source #
RandomiseLayout RepairCdInstance Source #
Instance details Defined in Modelling.CdOd.RepairCd Methods randomiseLayout :: (MonadRandom m, MonadThrow m) => RepairCdInstance -> m RepairCdInstance Source #
RandomiseLayout SelectValidCdInstance Source #
Instance details Defined in Modelling.CdOd.SelectValidCd Methods randomiseLayout :: (MonadRandom m, MonadThrow m) => SelectValidCdInstance -> m SelectValidCdInstance Source #

class RandomiseNames a where Source #

The class of types that allow swapping (some of) its components names randomly.

Minimal complete definition

randomiseNames

Methods

hasRandomisableNames :: a -> Maybe String Source #

Checks the randomisability of names for the given value * returns Nothing, if it is randomisable * returns Just the explanation why not, otherwise

randomiseNames :: (MonadRandom m, MonadThrow m) => a -> m a Source #

Shuffles the order of names of an instance, swapping names of components

Instances

Instances details

RandomiseNames DifferentNamesInstance Source #
Instance details Defined in Modelling.CdOd.DifferentNames Methods hasRandomisableNames :: DifferentNamesInstance -> Maybe String Source # randomiseNames :: (MonadRandom m, MonadThrow m) => DifferentNamesInstance -> m DifferentNamesInstance Source #
RandomiseNames MatchCdOdInstance Source #
Instance details Defined in Modelling.CdOd.MatchCdOd Methods hasRandomisableNames :: MatchCdOdInstance -> Maybe String Source # randomiseNames :: (MonadRandom m, MonadThrow m) => MatchCdOdInstance -> m MatchCdOdInstance Source #
RandomiseNames NameCdErrorInstance Source #
Instance details Defined in Modelling.CdOd.NameCdError Methods hasRandomisableNames :: NameCdErrorInstance -> Maybe String Source # randomiseNames :: (MonadRandom m, MonadThrow m) => NameCdErrorInstance -> m NameCdErrorInstance Source #
RandomiseNames RepairCdInstance Source #
Instance details Defined in Modelling.CdOd.RepairCd Methods hasRandomisableNames :: RepairCdInstance -> Maybe String Source # randomiseNames :: (MonadRandom m, MonadThrow m) => RepairCdInstance -> m RepairCdInstance Source #
RandomiseNames SelectValidCdInstance Source #
Instance details Defined in Modelling.CdOd.SelectValidCd Methods hasRandomisableNames :: SelectValidCdInstance -> Maybe String Source # randomiseNames :: (MonadRandom m, MonadThrow m) => SelectValidCdInstance -> m SelectValidCdInstance Source #

newtype ShuffleExcept g a Source #

Constructors

ShuffleExcept
Fields unShuffleExcept :: RandT g (Either SomeException) a

Instances

Instances details

RandomGen g => MonadRandom (ShuffleExcept g) Source #
Instance details Defined in Modelling.Auxiliary.Common Methods getRandomR :: Random a => (a, a) -> ShuffleExcept g a getRandom :: Random a => ShuffleExcept g a getRandomRs :: Random a => (a, a) -> ShuffleExcept g [a] getRandoms :: Random a => ShuffleExcept g [a]
Applicative (ShuffleExcept g) Source #
Instance details Defined in Modelling.Auxiliary.Common Methods pure :: a -> ShuffleExcept g a # (<>) :: ShuffleExcept g (a -> b) -> ShuffleExcept g a -> ShuffleExcept g b # liftA2 :: (a -> b -> c) -> ShuffleExcept g a -> ShuffleExcept g b -> ShuffleExcept g c # (>) :: ShuffleExcept g a -> ShuffleExcept g b -> ShuffleExcept g b # (<*) :: ShuffleExcept g a -> ShuffleExcept g b -> ShuffleExcept g a #
Functor (ShuffleExcept g) Source #
Instance details Defined in Modelling.Auxiliary.Common Methods fmap :: (a -> b) -> ShuffleExcept g a -> ShuffleExcept g b # (<$) :: a -> ShuffleExcept g b -> ShuffleExcept g a #
Monad (ShuffleExcept g) Source #
Instance details Defined in Modelling.Auxiliary.Common Methods (>>=) :: ShuffleExcept g a -> (a -> ShuffleExcept g b) -> ShuffleExcept g b # (>>) :: ShuffleExcept g a -> ShuffleExcept g b -> ShuffleExcept g b # return :: a -> ShuffleExcept g a #
MonadThrow (ShuffleExcept g) Source #
Instance details Defined in Modelling.Auxiliary.Common Methods throwM :: Exception e => e -> ShuffleExcept g a #

data TaskGenerationException Source #

Constructors

NoInstanceAvailable

Instances

Instances details

Exception TaskGenerationException Source #
Instance details Defined in Modelling.Auxiliary.Common Methods toException :: TaskGenerationException -> SomeException # fromException :: SomeException -> Maybe TaskGenerationException # displayException :: TaskGenerationException -> String #
Show TaskGenerationException Source #
Instance details Defined in Modelling.Auxiliary.Common Methods showsPrec :: Int -> TaskGenerationException -> ShowS # show :: TaskGenerationException -> String # showList :: [TaskGenerationException] -> ShowS #

findFittingRandomElements Source #

Arguments

:: MonadRandom m
=> Bool	useDifferentElements flag
-> [a]	available elements
-> [a -> m Bool]	predicates to satisfy
-> m (Maybe [a])

Find fitting random elements with sophisticated distribution logic Tries valid divisors in descending order with retry mechanism for each divisor

getFirstInstance :: MonadThrow m => [a] -> m a Source #

lensRulesL :: LensRules Source #

lowerFirst :: String -> String Source #

mapIndicesTo :: (Eq a, MonadThrow m) => [a] -> [a] -> m [(Int, Int)] Source #

oneOf :: MonadRandom m => [a] -> m a Source #

parseInt :: Parser Int Source #

parseWith :: MonadThrow m => (Int -> Parser a) -> String -> m a Source #

skipSpaces :: Parser () Source #

toMap :: (Ord a, Ord b) => Set (a, b) -> Map a (Set b) Source #

upperFirst :: String -> String Source #

upperToDash :: String -> String Source #

weightedShuffle :: (MonadRandom m, Eq a, Real w) => [(a, w)] -> m [a] Source #

Shuffle a list of elements from type a based on given weights of type w, where higher weight indicates a bigger probability of the element occurring at a lower index of the list. The total weight of all elements must not be zero.

Orphan instances

MonadThrow m => MonadThrow (RandT g m) Source #
Instance details Methods throwM :: Exception e => e -> RandT g m a #