module Modelling.ActivityDiagram.EnterAs.Config where
import Modelling.ActivityDiagram.Config (AdConfig(..))
import Modelling.ActivityDiagram.EnterAS (EnterASConfig(..))
task2023_35 :: EnterASConfig
task2023_35 :: EnterASConfig
task2023_35 = EnterASConfig {
adConfig :: AdConfig
adConfig = AdConfig {
actionLimits :: (Int, Int)
actionLimits = (Int
12, Int
12),
objectNodeLimits :: (Int, Int)
objectNodeLimits = (Int
5, Int
5),
maxNamedNodes :: Int
maxNamedNodes = Int
17,
decisionMergePairs :: Int
decisionMergePairs = Int
3,
forkJoinPairs :: Int
forkJoinPairs = Int
1,
activityFinalNodes :: Int
activityFinalNodes = Int
0,
flowFinalNodes :: Int
flowFinalNodes = Int
2,
cycles :: Int
cycles = Int
1
},
hideBranchConditions :: Bool
hideBranchConditions = Bool
True,
maxInstances :: Maybe Integer
maxInstances = Integer -> Maybe Integer
forall a. a -> Maybe a
Just Integer
2000,
objectNodeOnEveryPath :: Maybe Bool
objectNodeOnEveryPath = Bool -> Maybe Bool
forall a. a -> Maybe a
Just Bool
True,
answerLength :: (Int, Int)
answerLength = (Int
10, Int
10),
printSolution :: Bool
printSolution = Bool
True,
extraText :: Maybe (Map Language String)
extraText = Maybe (Map Language String)
forall a. Maybe a
Nothing
}
task2023_36 :: EnterASConfig
task2023_36 :: EnterASConfig
task2023_36 = EnterASConfig {
adConfig :: AdConfig
adConfig = AdConfig {
actionLimits :: (Int, Int)
actionLimits = (Int
14, Int
14),
objectNodeLimits :: (Int, Int)
objectNodeLimits = (Int
6, Int
6),
maxNamedNodes :: Int
maxNamedNodes = Int
20,
decisionMergePairs :: Int
decisionMergePairs = Int
1,
forkJoinPairs :: Int
forkJoinPairs = Int
2,
activityFinalNodes :: Int
activityFinalNodes = Int
0,
flowFinalNodes :: Int
flowFinalNodes = Int
2,
cycles :: Int
cycles = Int
1
},
hideBranchConditions :: Bool
hideBranchConditions = Bool
True,
maxInstances :: Maybe Integer
maxInstances = Integer -> Maybe Integer
forall a. a -> Maybe a
Just Integer
2000,
objectNodeOnEveryPath :: Maybe Bool
objectNodeOnEveryPath = Bool -> Maybe Bool
forall a. a -> Maybe a
Just Bool
False,
answerLength :: (Int, Int)
answerLength = (Int
14, Int
14),
printSolution :: Bool
printSolution = Bool
True,
extraText :: Maybe (Map Language String)
extraText = Maybe (Map Language String)
forall a. Maybe a
Nothing
}
task2024_41 :: EnterASConfig
task2024_41 :: EnterASConfig
task2024_41 = EnterASConfig {
adConfig :: AdConfig
adConfig = AdConfig {
actionLimits :: (Int, Int)
actionLimits = (Int
12, Int
12),
objectNodeLimits :: (Int, Int)
objectNodeLimits = (Int
5, Int
5),
maxNamedNodes :: Int
maxNamedNodes = Int
17,
decisionMergePairs :: Int
decisionMergePairs = Int
3,
forkJoinPairs :: Int
forkJoinPairs = Int
1,
activityFinalNodes :: Int
activityFinalNodes = Int
0,
flowFinalNodes :: Int
flowFinalNodes = Int
2,
cycles :: Int
cycles = Int
2
},
hideBranchConditions :: Bool
hideBranchConditions = Bool
True,
maxInstances :: Maybe Integer
maxInstances = Integer -> Maybe Integer
forall a. a -> Maybe a
Just Integer
2000,
objectNodeOnEveryPath :: Maybe Bool
objectNodeOnEveryPath = Bool -> Maybe Bool
forall a. a -> Maybe a
Just Bool
True,
answerLength :: (Int, Int)
answerLength = (Int
11, Int
11),
printSolution :: Bool
printSolution = Bool
True,
extraText :: Maybe (Map Language String)
extraText = Maybe (Map Language String)
forall a. Maybe a
Nothing
}
task2024_42 :: EnterASConfig
task2024_42 :: EnterASConfig
task2024_42 = EnterASConfig
task2023_36
task2024_68 :: EnterASConfig
task2024_68 :: EnterASConfig
task2024_68 = EnterASConfig
task2024_41
task2024_69 :: EnterASConfig
task2024_69 :: EnterASConfig
task2024_69 = EnterASConfig
task2023_36