void Place::produceTokens(unsigned int nbOfTokens, unsigned int colorLabel, int tokensTime)
{
unsigned int oldNumberOfTokens = getNbOfTokens(colorLabel);
for (unsigned int i = 0; i < nbOfTokens; ++i) {
Token token(tokensTime);
m_tokenByColor[colorLabel - 1].push_back(token);
}
if(tokensTime < 0){tokensTime = 0;}
if ((oldNumberOfTokens < NB_OF_TOKEN_TO_ACTIVE_ARC) && (getNbOfTokens(colorLabel) >= NB_OF_TOKEN_TO_ACTIVE_ARC)) { // CB WTF : Si un token et deux arcs sortant, bug ?
arcList outGoingArcs = outGoingArcsOf(colorLabel);
for (unsigned int i = 0 ; i < outGoingArcs.size() ; ++i) {
Arc* arc = outGoingArcs[i];
// if (!arc->getCondition()) { // CB check if the arc can be activated
// continue;
// }
Transition* transitionTo = dynamic_cast<Transition*>(arc->getTo());
if (!transitionTo) {
throw IncoherentStateException();
}
transitionTo->setArcAsActive(arc, tokensTime, true);
if (transitionTo->isStatic()) {
if(arc->getRelativeMinValue().getValue() < (int) tokensTime) {
getPetriNet()->pushTransitionToCrossWhenAcceleration(transitionTo);
}
} else {
if(arc->getRelativeMaxValue().getValue() < (int) tokensTime) {
getPetriNet()->pushTransitionToCrossWhenAcceleration(transitionTo);
}
}
}
}
}
void Place::produceTokens(unsigned int nbOfTokens, unsigned int colorLabel, unsigned int tokensTime) {
unsigned int oldNumberOfTokens = getNbOfTokens(colorLabel);
for (unsigned int i = 0; i < nbOfTokens; ++i) {
Token token;
token.setRemainingTime(tokensTime);
m_tokenByColor[colorLabel - 1].push_back(token);
}
if ((oldNumberOfTokens < NB_OF_TOKEN_TO_ACTIVE_ARC) && (getNbOfTokens(colorLabel) >= NB_OF_TOKEN_TO_ACTIVE_ARC)) {
arcList outGoingArcs = outGoingArcsOf(colorLabel);
for (unsigned int i = 0 ; i < outGoingArcs.size() ; ++i) {
Arc* arc = outGoingArcs[i];
if (!(dynamic_cast<Transition*>(arc->getTo()))) {
throw IncoherentStateException();
}
Transition* transitionTo = ((Transition*) arc->getTo());
transitionTo->setArcAsActive(arc, tokensTime, true);
if (transitionTo->isStatic()) {
if(arc->getRelativeMinValue().getValue() < (int) tokensTime) {
getPetriNet()->pushTransitionToCrossWhenAcceleration(transitionTo);
}
} else {
if(arc->getRelativeMaxValue().getValue() < (int) tokensTime) {
getPetriNet()->pushTransitionToCrossWhenAcceleration(transitionTo);
}
}
}
}
}
void Transition::merge(Transition* transitionToMerge)
{
for (unsigned int i = 0 ; i < transitionToMerge->m_externActions.size() ; ++i) {
m_externActions.push_back(transitionToMerge->m_externActions[i]);
}
arcList mergeInGoingArcs = transitionToMerge->inGoingArcsOf();
arcList mergeOutGoingArcs = transitionToMerge->outGoingArcsOf();
for (unsigned int i = 0; i < mergeInGoingArcs.size() ; ++i) {
Arc* currentArc = mergeInGoingArcs[i];
ExtendedInt relativeMinValue = currentArc->getRelativeMinValue();
ExtendedInt relativeMaxValue = currentArc->getRelativeMaxValue();
ExtendedInt absoluteMinValue = currentArc->getAbsoluteMinValue();
ExtendedInt absoluteMaxValue = currentArc->getAbsoluteMaxValue();
Place* inGoingPlace = (Place*) currentArc->getFrom();
Arc* newArc = getPetriNet()->createArc(inGoingPlace, this);
newArc->changeAbsoluteTime(absoluteMinValue, absoluteMaxValue);
newArc->changeRelativeTime(relativeMinValue, relativeMaxValue);
getPetriNet()->deleteArc(inGoingPlace, transitionToMerge);
}
createBitArray();
for (unsigned int i = 0; i < mergeOutGoingArcs.size() ; ++i) {
Arc* currentArc = mergeOutGoingArcs[i];
Place* outGoingPlace = (Place*) currentArc->getTo();
getPetriNet()->createArc(this, outGoingPlace);
getPetriNet()->deleteArc(transitionToMerge, outGoingPlace);
}
}
