/
ctkWorkflow.cpp
1080 lines (907 loc) · 35.3 KB
/
ctkWorkflow.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*=========================================================================
Library: CTK
Copyright (c) Kitware Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0.txt
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
=========================================================================*/
// Qt includes
#include <QStateMachine>
#include <QState>
// CTK includes
#include "ctkWorkflow.h"
#include "ctkWorkflowStep.h"
#include "ctkWorkflowStep_p.h"
#include "ctkWorkflowTransitions.h"
#include "ctkLogger.h"
// STD includes
#include <iostream>
//--------------------------------------------------------------------------
static ctkLogger logger("org.commontk.libs.core.ctkWorkflow");
//--------------------------------------------------------------------------
// --------------------------------------------------------------------------
// ctkWorkflowPrivate methods
// --------------------------------------------------------------------------
ctkWorkflowPrivate::ctkWorkflowPrivate(ctkWorkflow& object)
:q_ptr(&object)
{
this->InitialStep = 0;
this->CurrentStep = 0;
this->OriginStep = 0;
this->DestinationStep = 0;
this->GoToStep = 0;
this->StartingStep = 0;
this->TransitionToPreviousStartingStep = 0;
// By default, go back to the origin step upon success of the goToStep(targetId) attempt.
this->GoBackToOriginStepUponSuccess = true;
this->ARTIFICIAL_BRANCH_ID_PREFIX = "ctkWorkflowArtificialBranchId_";
}
// --------------------------------------------------------------------------
ctkWorkflowPrivate::~ctkWorkflowPrivate()
{
}
// --------------------------------------------------------------------------
void ctkWorkflowPrivate::addStep(ctkWorkflowStep* step)
{
Q_Q(ctkWorkflow);
Q_ASSERT(step);
Q_ASSERT(!q->hasStep(step->id()));
Q_ASSERT(!this->StateMachine->isRunning());
// Add the states, creating them if necessary
this->StateMachine->addState(step->processingState());
this->StateMachine->addState(step->validationState());
// Update the map of steps to transitions and the <state,step> map
this->StepToForwardAndBackwardStepMap.insert(step, new forwardAndBackwardSteps);
this->StateToStepMap[step->processingState()] = step;
this->StateToStepMap[step->validationState()] = step;
// Setup the signal/slot that triggers the attempt to go to the next step
QObject::connect(step->validationState(), SIGNAL(entered()),
q, SLOT(attemptToGoToNextStep()));
// Setup the signal/slot that triggers the evaluation of the validation results
// after validate(const QString&) is called
this->connect(
step->ctkWorkflowStepQObject(), SIGNAL(validationComplete(bool,QString)),
q, SLOT(evaluateValidationResults(bool,QString)));
this->connect(
step->ctkWorkflowStepQObject(), SIGNAL(onEntryComplete()),
SLOT(processingAfterOnEntry()));
this->connect(
step->ctkWorkflowStepQObject(), SIGNAL(onExitComplete()),
SLOT(processingAfterOnExit()));
}
// --------------------------------------------------------------------------
bool ctkWorkflowPrivate::hasDuplicateTransition(ctkWorkflowStep* origin, ctkWorkflowStep* destination,
const ctkWorkflow::TransitionDirectionality directionality)
{
Q_Q(ctkWorkflow);
Q_ASSERT(origin);
Q_ASSERT(destination);
Q_ASSERT(directionality == ctkWorkflow::Forward || ctkWorkflow::Backward);
ctkWorkflowPrivate::StepListType stepList;
ctkWorkflowStep* targetStep = 0;
if (directionality == ctkWorkflow::Forward)
{
stepList = q->forwardSteps(origin);
targetStep = destination;
}
else if (directionality == ctkWorkflow::Backward)
{
stepList = q->backwardSteps(destination);
targetStep = origin;
}
foreach(ctkWorkflowStep * step, stepList)
{
if (step == targetStep)
{
return true;
}
}
return false;
}
// --------------------------------------------------------------------------
bool ctkWorkflowPrivate::hasTransitionWithSameBranchId(ctkWorkflowStep* origin, ctkWorkflowStep* destination,
const QString& branchId,
const ctkWorkflow::TransitionDirectionality directionality)
{
Q_ASSERT(origin);
Q_ASSERT(destination);
Q_ASSERT(directionality == ctkWorkflow::Forward || ctkWorkflow::Backward);
Q_ASSERT(!branchId.isEmpty());
QList<QString> branchIdList;
if (directionality == ctkWorkflow::Forward)
{
branchIdList = this->forwardBranchIds(origin);
}
else if (directionality == ctkWorkflow::Backward)
{
branchIdList = this->backwardBranchIds(destination);
}
foreach(QString id, branchIdList)
{
if (QString::compare(id, branchId, Qt::CaseInsensitive) == 0)
{
return true;
}
}
return false;
}
// --------------------------------------------------------------------------
void ctkWorkflowPrivate::createTransitionToNextStep(ctkWorkflowStep* origin,
ctkWorkflowStep* destination,
const QString& branchId)
{
Q_Q(ctkWorkflow);
Q_ASSERT(origin);
Q_ASSERT(destination);
Q_ASSERT(!q->hasTransition(origin, destination, branchId, ctkWorkflow::Forward));
QString id;
// create an artificial branchId if one is not given
if (branchId.isEmpty())
{
id.setNum(this->numberOfForwardSteps(origin));
id.prepend(this->ARTIFICIAL_BRANCH_ID_PREFIX);
}
else
{
id = branchId;
}
// Create the transition
ctkWorkflowInterstepTransition* transition = new ctkWorkflowInterstepTransition(ctkWorkflowInterstepTransition::TransitionToNextStep, id);
transition->setTargetState(destination->processingState());
origin->validationState()->addTransition(transition);
// Update the step to transitions map
this->StepToForwardAndBackwardStepMap.value(origin)->appendForwardStep(destination, id);
// Setup the signal/slot that shows and hides the steps' user interfaces
// on transition to the next step
QObject::connect(transition, SIGNAL(triggered()), q, SLOT(performTransitionBetweenSteps()));
}
// --------------------------------------------------------------------------
void ctkWorkflowPrivate::createTransitionToPreviousStep(ctkWorkflowStep* origin,
ctkWorkflowStep* destination,
const QString& branchId)
{
Q_Q(ctkWorkflow);
Q_ASSERT(origin);
Q_ASSERT(destination);
Q_ASSERT(!q->hasTransition(origin, destination, branchId, ctkWorkflow::Backward));
QString id;
// create an artificial branchId if one is not given
if (branchId.isEmpty())
{
id.setNum(this->numberOfBackwardSteps(destination));
id.prepend(this->ARTIFICIAL_BRANCH_ID_PREFIX);
}
else
{
id = branchId;
}
ctkWorkflowInterstepTransition* transition = new ctkWorkflowInterstepTransition(ctkWorkflowInterstepTransition::TransitionToPreviousStep, id);
transition->setTargetState(origin->processingState());
destination->processingState()->addTransition(transition);
// Update the step to transitions map
this->StepToForwardAndBackwardStepMap.value(destination)->appendBackwardStep(origin, id);
// Setup the signal/slot that shows and hides the steps' user
// interfaces on transition to the previous step
QObject::connect(transition, SIGNAL(triggered()), q, SLOT(performTransitionBetweenSteps()));
}
// --------------------------------------------------------------------------
void ctkWorkflowPrivate::createTransitionToPreviousStartingStep(ctkWorkflowStep* startingStep,
ctkWorkflowStep* currentStep)
{
Q_Q(ctkWorkflow);
Q_ASSERT(startingStep);
Q_ASSERT(currentStep);
if (!this->TransitionToPreviousStartingStep)
{
ctkWorkflowInterstepTransition* transition = new ctkWorkflowInterstepTransition(
ctkWorkflowInterstepTransition::TransitionToPreviousStartingStepAfterSuccessfulGoToFinishStep);
// Setup the signal/slot that shows and hides the steps' user interfaces
// on transition to the previous step
QObject::connect(transition, SIGNAL(triggered()), q, SLOT(performTransitionBetweenSteps()));
this->TransitionToPreviousStartingStep = transition;
}
QState* currentState;
// looping on the finish step
if (startingStep == currentStep)
{
currentState = currentStep->validationState();
}
else
{
currentState = currentStep->processingState();
}
this->TransitionToPreviousStartingStep->setTargetState(startingStep->processingState());
currentState->addTransition(this->TransitionToPreviousStartingStep);
}
// --------------------------------------------------------------------------
ctkWorkflowStep* ctkWorkflowPrivate::stepFromId(const QString& id)const
{
foreach(ctkWorkflowStep* step, this->StepToForwardAndBackwardStepMap.keys())
{
Q_ASSERT(step);
if (QString::compare(step->id(), id, Qt::CaseInsensitive) == 0)
{
return step;
}
}
return 0;
}
// --------------------------------------------------------------------------
QList<QString> ctkWorkflowPrivate::forwardBranchIds(ctkWorkflowStep* step)const
{
Q_ASSERT(step);
return this->StepToForwardAndBackwardStepMap.value(step)->forwardBranchIds();
}
// --------------------------------------------------------------------------
QList<QString> ctkWorkflowPrivate::backwardBranchIds(ctkWorkflowStep* step)const
{
Q_ASSERT(step);
return this->StepToForwardAndBackwardStepMap.value(step)->backwardBranchIds();
}
//---------------------------------------------------------------------------
void ctkWorkflowPrivate::validateInternal(ctkWorkflowStep* step)
{
Q_ASSERT(step);
logger.debug(QString("validateInternal - validating input from %1").arg(step->name()));
if (step->hasValidateCommand())
{
step->invokeValidateCommand(this->DesiredBranchId);
}
else
{
step->validate(this->DesiredBranchId);
}
}
// --------------------------------------------------------------------------
void ctkWorkflowPrivate::onEntryInternal(
ctkWorkflowStep* step,
ctkWorkflowStep* comingFrom,
const ctkWorkflowInterstepTransition::InterstepTransitionType& transitionType)
{
Q_ASSERT(step);
logger.debug(QString("onEntryInternal - entering input from %1").arg(step->name()));
//Ensure we are transitioning between steps or starting the workflow
Q_ASSERT(transitionType == ctkWorkflowInterstepTransition::TransitionToNextStep
|| transitionType == ctkWorkflowInterstepTransition::TransitionToPreviousStep
|| transitionType == ctkWorkflowInterstepTransition::StartingWorkflow
|| transitionType == ctkWorkflowInterstepTransition::TransitionToPreviousStartingStepAfterSuccessfulGoToFinishStep);
if (step->hasOnEntryCommand())
{
step->invokeOnEntryCommand(comingFrom, transitionType);
}
else
{
step->onEntry(comingFrom, transitionType);
}
}
// --------------------------------------------------------------------------
void ctkWorkflowPrivate::processingAfterOnEntry()
{
Q_Q(ctkWorkflow);
logger.debug("processingAfterOnEntry");
if (!this->DestinationStep)
{
logger.error("processingAfterOnEntry - Called processingAfterOnEntry without "
"having set a destination step");
return;
}
// Update the currentStep and previous step
this->CurrentStep = this->DestinationStep;
// Reset the pointers used internally for performing a transition
this->OriginStep = 0;
this->DestinationStep = 0;
// // Reset the pointers used internally for performing a transition
// // back to the starting step
// if (d->TransitionToPreviousStartingStep)
// {
// std::cout << "TRANSITION TO PREVIOUS STARTING STEP EXISTS" << std::endl;
// //d->TransitionToPreviousStartingStep->sourceState()->removeTransition(d->TransitionToPreviousStartingStep);
// //std::cout << "removed" << std::endl;
// // d->TransitionToPreviousStartingStep = 0;
// //destination->processingState()->removeTransition(d->TransitionToPreviousStartingStep);
// //delete d->TransitionToPreviousStartingStep;
// // d->TransitionToPreviousStartingStep = 0;
// std::cout << "here" << std::endl;
// }
// If we are trying to get to the finish step, then check if we are
// finished.
if (this->GoToStep)
{
if (this->CurrentStep == this->GoToStep)
{
q->goToStepSucceeded();
}
// if we're not finished, continue transitioning to the next step
else
{
q->goForward();
}
}
else
{
emit q->currentStepChanged(this->CurrentStep);
}
}
// --------------------------------------------------------------------------
void ctkWorkflowPrivate::onExitInternal(
ctkWorkflowStep* step,
ctkWorkflowStep* goingTo,
const ctkWorkflowInterstepTransition::InterstepTransitionType& transitionType)
{
Q_ASSERT(step);
logger.debug(QString("onExitInternal - exiting %1").arg(step->name()));
// Ensure we are transitioning between steps or starting the workflow
Q_ASSERT (transitionType == ctkWorkflowInterstepTransition::TransitionToNextStep ||
transitionType == ctkWorkflowInterstepTransition::TransitionToPreviousStep ||
transitionType == ctkWorkflowInterstepTransition::StoppingWorkflow ||
transitionType == ctkWorkflowInterstepTransition::TransitionToPreviousStartingStepAfterSuccessfulGoToFinishStep);
if (step->hasOnExitCommand())
{
step->invokeOnExitCommand(goingTo, transitionType);
}
else
{
step->onExit(goingTo, transitionType);
}
}
// --------------------------------------------------------------------------
void ctkWorkflowPrivate::processingAfterOnExit()
{
// enter the destination step if we have one
if (this->DestinationStep)
{
this->onEntryInternal(this->DestinationStep, this->OriginStep, this->TransitionType);
}
// reset the pointers used internally for performing a transition if we're done
else
{
this->OriginStep = 0;
this->DestinationStep = 0;
// we've exited the CurrentStep and haven't gone into another step, so we no longer have a
// currentStep.
this->CurrentStep = 0;
}
}
// --------------------------------------------------------------------------
ctkWorkflowStep* ctkWorkflowPrivate::stepFromState(const QAbstractState* state)
{
if (state)
{
return this->StateToStepMap.value(state);
}
return 0;
}
// --------------------------------------------------------------------------
int ctkWorkflowPrivate::numberOfForwardSteps(ctkWorkflowStep* step)
{
Q_Q(ctkWorkflow);
return q->forwardSteps(step).length();
}
// --------------------------------------------------------------------------
int ctkWorkflowPrivate::numberOfBackwardSteps(ctkWorkflowStep* step)
{
Q_Q(ctkWorkflow);
return q->backwardSteps(step).length();
}
// --------------------------------------------------------------------------
bool ctkWorkflowPrivate::pathExists(const QString& goalId, ctkWorkflowStep* origin)const
{
Q_Q(const ctkWorkflow);
Q_ASSERT(!goalId.isEmpty());
Q_ASSERT(this->CurrentStep);
QString originId;
if (origin)
{
originId = origin->id();
}
else
{
originId = this->CurrentStep->id();
}
// there exists a path from the origin to the goal if:
// - there is a goal AND
// - either:
// - the origin is already the goal
// - there is a path from at least one of the origin's successors to the goal
return (q->hasStep(goalId)
&& ((QString::compare(goalId, originId, Qt::CaseInsensitive) == 0)
|| (q->canGoForward(origin)))); // <-- TODO insert logic here for looking at graph
}
// --------------------------------------------------------------------------
bool ctkWorkflowPrivate::pathExistsFromNextStep(const QString& goalId, const QString& branchId)const
{
Q_ASSERT(!goalId.isEmpty());
Q_ASSERT(!branchId.isEmpty());
Q_ASSERT(this->CurrentStep);
// return whether there exists a path from the the step that will be followed (given the branchId) to the goal
ctkWorkflowStep* nextStep = this->StepToForwardAndBackwardStepMap.value(this->CurrentStep)->forwardStep(branchId);
if (!nextStep)
{
return false;
}
else
{
return this->pathExists(goalId, nextStep);
}
}
// --------------------------------------------------------------------------
// ctkWorkflow methods
// --------------------------------------------------------------------------
ctkWorkflow::ctkWorkflow(QObject* _parent) : Superclass(_parent)
, d_ptr(new ctkWorkflowPrivate(*this))
{
Q_D(ctkWorkflow);
d->StateMachine = new QStateMachine(this);
}
// --------------------------------------------------------------------------
ctkWorkflow::~ctkWorkflow()
{
Q_D(ctkWorkflow);
if (d->StateMachine->isRunning())
{
d->StateMachine->stop();
}
}
// --------------------------------------------------------------------------
bool ctkWorkflow::addTransition(ctkWorkflowStep* origin, ctkWorkflowStep* destination,
const QString& branchId,
const ctkWorkflow::TransitionDirectionality directionality)
{
Q_D(ctkWorkflow);
if (d->StateMachine->isRunning())
{
logger.warn("addTransition - Cannot add a transition while the workflow is started !");
return false;
}
// Set origin id if empty
if (origin && origin->id().isEmpty())
{
origin->setId(QString("step%1").arg(d->StepToForwardAndBackwardStepMap.count()));
}
// cannot currently create a transition between two steps of the same id, which is equivalent to
// adding a transition from a step to itself
if (origin && destination && (QString::compare(origin->id(), destination->id(), Qt::CaseInsensitive) == 0))
{
logger.error("addTransition - Workflow does not currently support a transition"
" from a step to itself. Use GoToStep instead !");
return false;
}
// add the origin step if it doesn't exist in the workflow yet
if (origin && !this->hasStep(origin->id()))
{
d->addStep(origin);
}
// Set destination id if empty
if (destination && destination->id().isEmpty())
{
destination->setId(QString("step%1").arg(d->StepToForwardAndBackwardStepMap.count()));
}
// add the destination step if it doesn't exist in the workflow yet
if (destination && !this->hasStep(destination->id()))
{
d->addStep(destination);
}
if (origin && destination)
{
// ensure we haven't already added a transition with the same origin, destination and directionality
if (this->hasTransition(origin, destination, branchId, directionality))
{
logger.warn("addTransition - Cannot create a transition that matches a "
"previously created transtiion");
return false;
}
// create the forward transition
if (directionality == ctkWorkflow::Forward
|| directionality == ctkWorkflow::Bidirectional)
{
d->createTransitionToNextStep(origin, destination, branchId);
}
// create the backward transition
if (directionality == ctkWorkflow::Backward
|| directionality == ctkWorkflow::Bidirectional)
{
d->createTransitionToPreviousStep(origin, destination, branchId);
}
}
// Set initialStep if needed
if (origin && d->StepToForwardAndBackwardStepMap.count() == 2 && !this->initialStep())
{
this->setInitialStep(origin);
}
return true;
}
// --------------------------------------------------------------------------
bool ctkWorkflow::hasTransition(ctkWorkflowStep* origin, ctkWorkflowStep* destination,
const QString& branchId,
const ctkWorkflow::TransitionDirectionality directionality)
{
Q_D(ctkWorkflow);
// we have a bidirectional transition if we have both a forward and a backward transition
if (directionality == ctkWorkflow::Bidirectional)
{
return this->hasTransition(origin, destination, branchId, ctkWorkflow::Forward)
&& this->hasTransition(origin, destination, branchId, ctkWorkflow::Backward);
}
else
{
if (branchId.isEmpty())
{
return d->hasDuplicateTransition(origin, destination, directionality);
}
else
{
return d->hasDuplicateTransition(origin, destination, directionality)
|| d->hasTransitionWithSameBranchId(origin, destination, branchId, directionality);
}
}
}
// --------------------------------------------------------------------------
QList<ctkWorkflowStep*> ctkWorkflow::forwardSteps(ctkWorkflowStep* step)const
{
Q_D(const ctkWorkflow);
// use the given step if provided, otherwise use the workflow's current step
if (step && d->StepToForwardAndBackwardStepMap.contains(step))
{
return d->StepToForwardAndBackwardStepMap.value(step)->forwardSteps();
}
else if (d->CurrentStep && d->StepToForwardAndBackwardStepMap.contains(d->CurrentStep))
{
return d->StepToForwardAndBackwardStepMap.value(d->CurrentStep)->forwardSteps();
}
else
{
return QList<ctkWorkflowStep*>();
}
}
// --------------------------------------------------------------------------
QList<ctkWorkflowStep*> ctkWorkflow::backwardSteps(ctkWorkflowStep* step)const
{
Q_D(const ctkWorkflow);
// use the current step if provided, otherwise use the workflow's current step
if (step && d->StepToForwardAndBackwardStepMap.contains(step))
{
return d->StepToForwardAndBackwardStepMap.value(step)->backwardSteps();
}
else if (d->CurrentStep && d->StepToForwardAndBackwardStepMap.contains(d->CurrentStep))
{
return d->StepToForwardAndBackwardStepMap.value(d->CurrentStep)->backwardSteps();
}
else
{
return QList<ctkWorkflowStep*>();
}
}
// --------------------------------------------------------------------------
QList<ctkWorkflowStep*> ctkWorkflow::finishSteps()const
{
Q_D(const ctkWorkflow);
// iterate through our list of steps, and keep the steps that don't have anything following them
QList<ctkWorkflowStep*> finishSteps;
foreach (ctkWorkflowStep* step, d->StepToForwardAndBackwardStepMap.keys())
{
if (!this->canGoForward(step))
{
finishSteps.append(step);
}
}
return finishSteps;
}
// --------------------------------------------------------------------------
bool ctkWorkflow::canGoForward(ctkWorkflowStep* step)const
{
return (!this->forwardSteps(step).isEmpty());
}
// --------------------------------------------------------------------------
bool ctkWorkflow::canGoBackward(ctkWorkflowStep* step)const
{
return (!this->backwardSteps(step).isEmpty());
}
// --------------------------------------------------------------------------
bool ctkWorkflow::canGoToStep(const QString& targetId, ctkWorkflowStep* step)const
{
Q_D(const ctkWorkflow);
return d->pathExists(targetId, step);
}
// --------------------------------------------------------------------------
bool ctkWorkflow::hasStep(const QString& id)const
{
Q_D(const ctkWorkflow);
return d->stepFromId(id);
}
// --------------------------------------------------------------------------
// Convenience method to set the QStateMachine's initialState to a
// specific step's processing state.
CTK_GET_CPP(ctkWorkflow, ctkWorkflowStep*, initialStep, InitialStep);
CTK_SET_CPP(ctkWorkflow, ctkWorkflowStep*, setInitialStep, InitialStep);
// --------------------------------------------------------------------------
CTK_GET_CPP(ctkWorkflow, ctkWorkflowStep*, currentStep, CurrentStep);
// --------------------------------------------------------------------------
void ctkWorkflow::start()
{
Q_D(ctkWorkflow);
if (!d->InitialStep)
{
logger.warn("start - Cannot start workflow without an initial step");
return;
}
// Setup to do the entry processing for the initial setp
d->StateMachine->setInitialState(d->InitialStep->processingState());
d->OriginStep = 0;
d->DestinationStep = d->InitialStep;
d->TransitionType = ctkWorkflowInterstepTransition::StartingWorkflow;
d->onEntryInternal(d->DestinationStep, d->OriginStep, d->TransitionType);
d->StateMachine->start();
}
// --------------------------------------------------------------------------
bool ctkWorkflow::isRunning()const
{
Q_D(const ctkWorkflow);
return d->StateMachine->isRunning();
}
// --------------------------------------------------------------------------
void ctkWorkflow::stop()
{
Q_D(ctkWorkflow);
if (!d->StateMachine->isRunning())
{
return;
}
// Setup to do the exit processing for the current step
if (d->CurrentStep)
{
d->OriginStep = d->CurrentStep;
d->DestinationStep = 0;
d->TransitionType = ctkWorkflowInterstepTransition::StoppingWorkflow;
d->onExitInternal(d->OriginStep, d->DestinationStep, d->TransitionType);
}
d->StateMachine->stop();
}
// --------------------------------------------------------------------------
void ctkWorkflow::goForward(const QString& desiredBranchId)
{
Q_D(ctkWorkflow);
if (!this->isRunning())
{
logger.warn("goForward - The workflow is not running !");
return;
}
// if we're just going to the next step and not to a 'goTo' step, then check to make sure that
// there exists a step following the current step
if (!d->GoToStep)
{
if (!this->canGoForward())
{
logger.warn("goForward - Attempt to goForward from a finish step !");
return;
}
}
d->DesiredBranchId = desiredBranchId;
logger.info("goForward - posting ValidationTransition");
d->StateMachine->postEvent(
new ctkWorkflowIntrastepTransitionEvent(ctkWorkflowIntrastepTransition::ValidationTransition));
}
// --------------------------------------------------------------------------
void ctkWorkflow::goBackward(const QString& desiredBranchId)
{
Q_D(ctkWorkflow);
if (!this->isRunning())
{
logger.warn("goBackward - The workflow is not running !");
return;
}
if (!this->canGoBackward())
{
logger.warn("goBackward - Attempt to goBackward from first step !");
return;
}
ctkWorkflowStep* previousStep = d->StepToPreviousStepMap[d->CurrentStep];
Q_ASSERT(previousStep);
QString branchId = d->StepToForwardAndBackwardStepMap.value(d->CurrentStep)->backwardBranchId(previousStep);
Q_ASSERT(!branchId.isEmpty());
d->DesiredBranchId = desiredBranchId;
logger.info("goBackward - posting TransitionToPreviousStep");
d->StateMachine->postEvent(
new ctkWorkflowInterstepTransitionEvent(ctkWorkflowInterstepTransition::TransitionToPreviousStep, branchId));
}
// --------------------------------------------------------------------------
CTK_GET_CPP(ctkWorkflow, bool, goBackToOriginStepUponSuccess, GoBackToOriginStepUponSuccess);
CTK_SET_CPP(ctkWorkflow, bool, setGoBackToOriginStepUponSuccess, GoBackToOriginStepUponSuccess);
// --------------------------------------------------------------------------
void ctkWorkflow::goToStep(const QString& targetId)
{
Q_D(ctkWorkflow);
if (!this->isRunning())
{
logger.warn("goToStep - The workflow is not running !");
return;
}
// TODO currently returns true only if the workflow is running - need logic here
if (!this->canGoToStep(targetId))
{
logger.warn(QString("goToStep - Cannot goToStep %1 ").arg(targetId));
return;
}
#ifndef QT_NO_DEBUG
ctkWorkflowStep* step = d->stepFromId(targetId);
Q_ASSERT(step);
#endif
logger.info(QString("goToStep - Attempting to go to finish step %1").arg(targetId));
// if (step == d->CurrentStep)
// {
// qDebug() << "we are already in the desired finish step";
// return;
// }
d->GoToStep = d->stepFromId(targetId);
d->StartingStep = d->CurrentStep;
this->goForward();
}
// --------------------------------------------------------------------------
void ctkWorkflow::attemptToGoToNextStep()
{
logger.info("attemptToGoToNextStep - Attempting to go to the next step ");
Q_D(ctkWorkflow);
Q_ASSERT(d->CurrentStep);
//Q_ASSERT(this->canGoForward(d->CurrentStep));
d->validateInternal(d->CurrentStep);
}
// --------------------------------------------------------------------------
void ctkWorkflow::evaluateValidationResults(bool validationSucceeded, const QString& branchId)
{
if (validationSucceeded)
{
this->goToNextStepAfterSuccessfulValidation(branchId);
}
else
{
this->goToProcessingStateAfterValidationFailed();
}
}
// --------------------------------------------------------------------------
// if ctkWorkflowStep::validationComplete() did not provide a branchId, then:
// - if there is one step following the current step, we will follow that transition
// - if there are multiple steps following the current step, then we will follow the first
// transition that was added
// (either way this corresponds to following the first forwardBranchId we've recorded)
// if ctkWorkflowStep::validationComplete() provided a branchId, then:
// - if there is one transition following the current step that was not created using a branchId,
// then we will follow it
// - otherwise do a conditional branching based on the branchId provided by validationComplete()
void ctkWorkflow::goToNextStepAfterSuccessfulValidation(const QString& branchId)
{
Q_D(ctkWorkflow);
logger.debug("goToNextStepAfterSuccessfulValidation - Calidation succeeded");
logger.info("goToNextStepAfterSuccessfulValidation - Posting TransitionToNextStep");
// we may already be in the 'goTo' step - i.e. looping on a finish step
if (d->GoToStep && d->CurrentStep == d->GoToStep)
{
this->goToStepSucceeded();
return;
}
QString transitionBranchId;
// these values are helpful for the logic below
QString firstForwardBranchId = d->StepToForwardAndBackwardStepMap.value(d->CurrentStep)->firstForwardBranchId();
int numberOfForwardSteps = d->numberOfForwardSteps(d->CurrentStep);
Q_ASSERT(!firstForwardBranchId.isEmpty());
Q_ASSERT(numberOfForwardSteps);
// validationComplete() does not give us a branchId
if (branchId.isEmpty())
{
transitionBranchId = firstForwardBranchId;
if (numberOfForwardSteps > 1)
{
logger.warn("goToNextStepAfterSuccessfulValidation - ctkWorkflowStep::ValidatComplete() "
"did not provide branchId at a branch in the workflow - will follow first "
"transition that was created");
}
}
// validationComplete() gives us a branchId
else
{
if (numberOfForwardSteps == 1 && firstForwardBranchId.contains(d->ARTIFICIAL_BRANCH_ID_PREFIX))
{
transitionBranchId = firstForwardBranchId;
logger.warn("goToNextStepAfterSuccessfulValidation - ctkWorkflowStep::ValidationComplete()"
" returns a branchId, but was overridden by the workflow");
}
else
{
transitionBranchId = branchId;
}
}
// if we are trying to go to a 'goTo' step, check that the selected branch will still take us along a path that leads to the 'goTo' step, and fail if not
if (d->GoToStep && !d->pathExistsFromNextStep(d->GoToStep->id(), transitionBranchId))
{
this->goToProcessingStateAfterValidationFailed();
return;
}
d->StateMachine->postEvent(new ctkWorkflowInterstepTransitionEvent(ctkWorkflowInterstepTransition::TransitionToNextStep, transitionBranchId));
}
// --------------------------------------------------------------------------
void ctkWorkflow::goToProcessingStateAfterValidationFailed()
{
logger.debug("goToNextStepAfterSuccessfulValidation - Validation failed");
Q_D(ctkWorkflow);
// Validation failed in the process of attempting to go to the finish step
if (d->GoToStep)
{
this->goToStepFailed();
}
logger.info("goToNextStepAfterSuccessfulValidation - Posting ValidationFailedTransition");
d->StateMachine->postEvent(new ctkWorkflowIntrastepTransitionEvent(ctkWorkflowIntrastepTransition::ValidationFailedTransition));
}
// --------------------------------------------------------------------------
void ctkWorkflow::performTransitionBetweenSteps()
{
Q_D(ctkWorkflow);
logger.debug("performTransitionBetweenSteps - Performing transition between steps");
// Alternative: could find the origin and destination step based on