Safe Haskell	Safe-Inferred
Language	Haskell2010

Modelling.PetriNet.Reach.Type

Description

originally from Autotool (https:/gitlab.imn.htwk-leipzig.deautotool/all0) based on revision: ad25a990816a162fdd13941ff889653f22d6ea0a based on file: collectionsrcPetri/Type.hs

Synopsis

type Connection s t = ([s], t, [s])
newtype State s = State {
- unState :: Map s Int
}
mapState :: Ord b => (a -> b) -> State a -> State b
mark :: Ord s => State s -> s -> Int
data Capacity s
- = Unbounded
- | AllBounded Int
- | Bounded (Map s Int)
mapCapacity :: Ord a => (s -> a) -> Capacity s -> Capacity a
data Net s t = Net {
- places :: Set s
- transitions :: Set t
- connections :: [Connection s t]
- capacity :: Capacity s
- start :: State s
}
bimapNet :: (Ord a, Ord b) => (s -> a) -> (t -> b) -> Net s t -> Net a b
allNonNegative :: State a -> Bool
conforms :: Ord k => Capacity k -> State k -> Bool
newtype Place = Place Int
newtype ShowPlace = ShowPlace Place
showPlace :: Place -> String
parsePlacePrec :: Int -> Parser Place
newtype Transition = Transition Int
newtype ShowTransition = ShowTransition Transition
showTransition :: Transition -> String
parseTransitionPrec :: Int -> Parser Transition
newtype TransitionsList = TransitionsList {
- transitionsList :: [Transition]
}
parseTransitionsListPrec :: Int -> Parser TransitionsList
example :: (Net Place Transition, State Place)
hasIsolatedNodes :: (Ord s, Ord t) => Net s t -> Bool

Documentation

type Connection s t = ([s], t, [s]) Source #

newtype State s Source #

Constructors

State
Fields unState :: Map s Int

Instances

Instances details

(Data s, Ord s) => Data (State s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> State s -> c (State s) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (State s) # toConstr :: State s -> Constr # dataTypeOf :: State s -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (State s)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (State s)) # gmapT :: (forall b. Data b => b -> b) -> State s -> State s # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> State s -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> State s -> r # gmapQ :: (forall d. Data d => d -> u) -> State s -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> State s -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> State s -> m (State s) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> State s -> m (State s) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> State s -> m (State s) #
Generic (State s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Associated Types type Rep (State s) :: Type -> Type # Methods from :: State s -> Rep (State s) x # to :: Rep (State s) x -> State s #
(Ord s, Read s) => Read (State s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods readsPrec :: Int -> ReadS (State s) # readList :: ReadS [State s] # readPrec :: ReadPrec (State s) # readListPrec :: ReadPrec [State s] #
Show s => Show (State s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods showsPrec :: Int -> State s -> ShowS # show :: State s -> String # showList :: [State s] -> ShowS #
Ord s => Eq (State s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods (==) :: State s -> State s -> Bool # (/=) :: State s -> State s -> Bool #
Ord s => Ord (State s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods compare :: State s -> State s -> Ordering # (<) :: State s -> State s -> Bool # (<=) :: State s -> State s -> Bool # (>) :: State s -> State s -> Bool # (>=) :: State s -> State s -> Bool # max :: State s -> State s -> State s # min :: State s -> State s -> State s #
type Rep (State s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type type Rep (State s) = D1 ('MetaData "State" "Modelling.PetriNet.Reach.Type" "modelling-tasks-0.0.0.1-5lkaY76HE6k79qLVIy6Ku2" 'True) (C1 ('MetaCons "State" 'PrefixI 'True) (S1 ('MetaSel ('Just "unState") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map s Int))))

mapState :: Ord b => (a -> b) -> State a -> State b Source #

mark :: Ord s => State s -> s -> Int Source #

data Capacity s Source #

Constructors

Unbounded
AllBounded Int
Bounded (Map s Int)

Instances

Instances details

(Data s, Ord s) => Data (Capacity s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Capacity s -> c (Capacity s) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Capacity s) # toConstr :: Capacity s -> Constr # dataTypeOf :: Capacity s -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Capacity s)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Capacity s)) # gmapT :: (forall b. Data b => b -> b) -> Capacity s -> Capacity s # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Capacity s -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Capacity s -> r # gmapQ :: (forall d. Data d => d -> u) -> Capacity s -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Capacity s -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Capacity s -> m (Capacity s) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Capacity s -> m (Capacity s) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Capacity s -> m (Capacity s) #
Generic (Capacity s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Associated Types type Rep (Capacity s) :: Type -> Type # Methods from :: Capacity s -> Rep (Capacity s) x # to :: Rep (Capacity s) x -> Capacity s #
(Ord s, Read s) => Read (Capacity s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods readsPrec :: Int -> ReadS (Capacity s) # readList :: ReadS [Capacity s] # readPrec :: ReadPrec (Capacity s) # readListPrec :: ReadPrec [Capacity s] #
Show s => Show (Capacity s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods showsPrec :: Int -> Capacity s -> ShowS # show :: Capacity s -> String # showList :: [Capacity s] -> ShowS #
Eq s => Eq (Capacity s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods (==) :: Capacity s -> Capacity s -> Bool # (/=) :: Capacity s -> Capacity s -> Bool #
Ord s => Ord (Capacity s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods compare :: Capacity s -> Capacity s -> Ordering # (<) :: Capacity s -> Capacity s -> Bool # (<=) :: Capacity s -> Capacity s -> Bool # (>) :: Capacity s -> Capacity s -> Bool # (>=) :: Capacity s -> Capacity s -> Bool # max :: Capacity s -> Capacity s -> Capacity s # min :: Capacity s -> Capacity s -> Capacity s #
type Rep (Capacity s) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type type Rep (Capacity s) = D1 ('MetaData "Capacity" "Modelling.PetriNet.Reach.Type" "modelling-tasks-0.0.0.1-5lkaY76HE6k79qLVIy6Ku2" 'False) (C1 ('MetaCons "Unbounded" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "AllBounded" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :+: C1 ('MetaCons "Bounded" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map s Int)))))

mapCapacity :: Ord a => (s -> a) -> Capacity s -> Capacity a Source #

data Net s t Source #

Constructors

Net
Fields places :: Set s transitions :: Set t connections :: [Connection s t] capacity :: Capacity s start :: State s

Instances

Instances details

(Data s, Data t, Ord s, Ord t) => Data (Net s t) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Net s t -> c (Net s t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Net s t) # toConstr :: Net s t -> Constr # dataTypeOf :: Net s t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Net s t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Net s t)) # gmapT :: (forall b. Data b => b -> b) -> Net s t -> Net s t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Net s t -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Net s t -> r # gmapQ :: (forall d. Data d => d -> u) -> Net s t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Net s t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Net s t -> m (Net s t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Net s t -> m (Net s t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Net s t -> m (Net s t) #
Generic (Net s t) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Associated Types type Rep (Net s t) :: Type -> Type # Methods from :: Net s t -> Rep (Net s t) x # to :: Rep (Net s t) x -> Net s t #
(Read s, Read t, Ord s, Ord t) => Read (Net s t) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods readsPrec :: Int -> ReadS (Net s t) # readList :: ReadS [Net s t] # readPrec :: ReadPrec (Net s t) # readListPrec :: ReadPrec [Net s t] #
(Show s, Show t) => Show (Net s t) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods showsPrec :: Int -> Net s t -> ShowS # show :: Net s t -> String # showList :: [Net s t] -> ShowS #
(Eq t, Ord s) => Eq (Net s t) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods (==) :: Net s t -> Net s t -> Bool # (/=) :: Net s t -> Net s t -> Bool #
(Ord s, Ord t) => Ord (Net s t) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods compare :: Net s t -> Net s t -> Ordering # (<) :: Net s t -> Net s t -> Bool # (<=) :: Net s t -> Net s t -> Bool # (>) :: Net s t -> Net s t -> Bool # (>=) :: Net s t -> Net s t -> Bool # max :: Net s t -> Net s t -> Net s t # min :: Net s t -> Net s t -> Net s t #
type Rep (Net s t) Source #
Instance details Defined in Modelling.PetriNet.Reach.Type type Rep (Net s t) = D1 ('MetaData "Net" "Modelling.PetriNet.Reach.Type" "modelling-tasks-0.0.0.1-5lkaY76HE6k79qLVIy6Ku2" 'False) (C1 ('MetaCons "Net" 'PrefixI 'True) ((S1 ('MetaSel ('Just "places") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set s)) :: S1 ('MetaSel ('Just "transitions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set t))) :: (S1 ('MetaSel ('Just "connections") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Connection s t]) :: (S1 ('MetaSel ('Just "capacity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Capacity s)) :: S1 ('MetaSel ('Just "start") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (State s))))))

bimapNet :: (Ord a, Ord b) => (s -> a) -> (t -> b) -> Net s t -> Net a b Source #

allNonNegative :: State a -> Bool Source #

conforms :: Ord k => Capacity k -> State k -> Bool Source #

newtype Place Source #

Constructors

Place Int

Instances

Instances details

Data Place Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Place -> c Place # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Place # toConstr :: Place -> Constr # dataTypeOf :: Place -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Place) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Place) # gmapT :: (forall b. Data b => b -> b) -> Place -> Place # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Place -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Place -> r # gmapQ :: (forall d. Data d => d -> u) -> Place -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Place -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Place -> m Place # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Place -> m Place # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Place -> m Place #
Enum Place Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods succ :: Place -> Place # pred :: Place -> Place # toEnum :: Int -> Place # fromEnum :: Place -> Int # enumFrom :: Place -> [Place] # enumFromThen :: Place -> Place -> [Place] # enumFromTo :: Place -> Place -> [Place] # enumFromThenTo :: Place -> Place -> Place -> [Place] #
Generic Place Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Associated Types type Rep Place :: Type -> Type # Methods from :: Place -> Rep Place x # to :: Rep Place x -> Place #
Read Place Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods readsPrec :: Int -> ReadS Place # readList :: ReadS [Place] # readPrec :: ReadPrec Place # readListPrec :: ReadPrec [Place] #
Show Place Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods showsPrec :: Int -> Place -> ShowS # show :: Place -> String # showList :: [Place] -> ShowS #
Eq Place Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods (==) :: Place -> Place -> Bool # (/=) :: Place -> Place -> Bool #
Ord Place Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods compare :: Place -> Place -> Ordering # (<) :: Place -> Place -> Bool # (<=) :: Place -> Place -> Bool # (>) :: Place -> Place -> Bool # (>=) :: Place -> Place -> Bool # max :: Place -> Place -> Place # min :: Place -> Place -> Place #
type Rep Place Source #
Instance details Defined in Modelling.PetriNet.Reach.Type type Rep Place = D1 ('MetaData "Place" "Modelling.PetriNet.Reach.Type" "modelling-tasks-0.0.0.1-5lkaY76HE6k79qLVIy6Ku2" 'True) (C1 ('MetaCons "Place" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)))

newtype ShowPlace Source #

Constructors

ShowPlace Place

Instances

Instances details

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

showPlace :: Place -> String Source #

parsePlacePrec :: Int -> Parser Place Source #

newtype Transition Source #

Constructors

Transition Int

Instances

Instances details

Data Transition Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Transition -> c Transition # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Transition # toConstr :: Transition -> Constr # dataTypeOf :: Transition -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Transition) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Transition) # gmapT :: (forall b. Data b => b -> b) -> Transition -> Transition # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Transition -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Transition -> r # gmapQ :: (forall d. Data d => d -> u) -> Transition -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Transition -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Transition -> m Transition # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Transition -> m Transition # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Transition -> m Transition #
Enum Transition Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods succ :: Transition -> Transition # pred :: Transition -> Transition # toEnum :: Int -> Transition # fromEnum :: Transition -> Int # enumFrom :: Transition -> [Transition] # enumFromThen :: Transition -> Transition -> [Transition] # enumFromTo :: Transition -> Transition -> [Transition] # enumFromThenTo :: Transition -> Transition -> Transition -> [Transition] #
Generic Transition Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Associated Types type Rep Transition :: Type -> Type # Methods from :: Transition -> Rep Transition x # to :: Rep Transition x -> Transition #
Read Transition Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods readsPrec :: Int -> ReadS Transition # readList :: ReadS [Transition] # readPrec :: ReadPrec Transition # readListPrec :: ReadPrec [Transition] #
Show Transition Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods showsPrec :: Int -> Transition -> ShowS # show :: Transition -> String # showList :: [Transition] -> ShowS #
Eq Transition Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods (==) :: Transition -> Transition -> Bool # (/=) :: Transition -> Transition -> Bool #
Ord Transition Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods compare :: Transition -> Transition -> Ordering # (<) :: Transition -> Transition -> Bool # (<=) :: Transition -> Transition -> Bool # (>) :: Transition -> Transition -> Bool # (>=) :: Transition -> Transition -> Bool # max :: Transition -> Transition -> Transition # min :: Transition -> Transition -> Transition #
type Rep Transition Source #
Instance details Defined in Modelling.PetriNet.Reach.Type type Rep Transition = D1 ('MetaData "Transition" "Modelling.PetriNet.Reach.Type" "modelling-tasks-0.0.0.1-5lkaY76HE6k79qLVIy6Ku2" 'True) (C1 ('MetaCons "Transition" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)))

newtype ShowTransition Source #

Constructors

ShowTransition Transition

Instances

Instances details

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

showTransition :: Transition -> String Source #

parseTransitionPrec :: Int -> Parser Transition Source #

newtype TransitionsList Source #

Constructors

TransitionsList
Fields transitionsList :: [Transition]

Instances

Instances details

Generic TransitionsList Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Associated Types type Rep TransitionsList :: Type -> Type # Methods from :: TransitionsList -> Rep TransitionsList x # to :: Rep TransitionsList x -> TransitionsList #
Show TransitionsList Source #
Instance details Defined in Modelling.PetriNet.Reach.Type Methods showsPrec :: Int -> TransitionsList -> ShowS # show :: TransitionsList -> String # showList :: [TransitionsList] -> ShowS #
type Rep TransitionsList Source #
Instance details Defined in Modelling.PetriNet.Reach.Type type Rep TransitionsList = D1 ('MetaData "TransitionsList" "Modelling.PetriNet.Reach.Type" "modelling-tasks-0.0.0.1-5lkaY76HE6k79qLVIy6Ku2" 'True) (C1 ('MetaCons "TransitionsList" 'PrefixI 'True) (S1 ('MetaSel ('Just "transitionsList") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Transition])))

parseTransitionsListPrec :: Int -> Parser TransitionsList Source #

example :: (Net Place Transition, State Place) Source #

hasIsolatedNodes :: (Ord s, Ord t) => Net s t -> Bool Source #

Check if a net has any isolated nodes (nodes with no connections)