Method setStepOrder

tools/parser/block_processor.cpp:750–795

    }
    
    void setStepOrder(const std::vector<StepNum> &subStepList) {
        std::unordered_set<StepNum> allSubSteps;
        size_t j = 0;
        for (auto &step : steps) {
            for (size_t i = 0; i < step.stages.size(); i++) {
                allSubSteps.insert({j, i});
            }
            j++;
        }
        
        // Make sure that subStepList includes every step once
        for (const auto &stepNum : subStepList) {
            auto it = allSubSteps.find(stepNum);
            if (it != allSubSteps.end()) {
                allSubSteps.erase(it);
            } else {
                throw std::runtime_error("Queue step order cannot include substep multiple times");
            }
        }
        
        if (!allSubSteps.empty()) {
            throw std::runtime_error("Queue step order list must include all defined steps");
        }
        
        QueueStage *prevStage = nullptr;
        for (const auto &stepNum : subStepList) {
            auto &stage = steps[stepNum.threadNum].stages[stepNum.subStepNum];
            stage->stepNum = stepNum;
            if (prevStage != nullptr) {
                stage->linkBack(*prevStage);
            } else {
                stage->prevDone = &importDone;
            }
            prevStage = stage.get();
        }
        
        auto lastStepNum = subStepList.back();
        auto &lastStage = steps[lastStepNum.threadNum].stages[lastStepNum.subStepNum];
        
        // Add finishedQueue as the last queue after the last actual processing step
        lastStage->nextQueue = &finishedQueue;
        lastStage->nextDone = &processingDone;
        
        auto firstStepNum = subStepList.front();
        firstStage = steps[firstStepNum.threadNum].stages[firstStepNum.subStepNum].get();
    }
    
    TxQueue &inputQueue() {
        assert(firstStage != nullptr);