Question

我试图遍历双端队列，并以最小的抵达时间擦除元素。该函数在前两次工作，然后显示“迭代器不可解除”错误并停止工作。

我的Processor.h：

#pragma once

#include <deque>
#include "Job.h"
#include <ctime>

using namespace std;

class Processor {
public:
    deque<Job> priorityQueue;
    Job runningJob;
    bool isProcessing;
    int processingTime;
    int runningTime;
    int overallJobs;
    int numJobs[4];     //0 is A, 1 is B, 2 is C, 3 is D
    int runningJobNumber;
    int interruptedJobs;

    Processor();

    void simulate();

    Job findNextJob();
};

我的findNextJob()：

Job Processor::findNextJob() {
    Job nextJob = priorityQueue.front();

    deque<Job>::const_iterator iter = priorityQueue.begin();
    deque<Job>::const_iterator location;

    while (iter <= priorityQueue.end()) {
        if (iter->arrivalTime < nextJob.arrivalTime) {
            nextJob = *iter;
            location = iter;
            iter++;
        }
        else {
            iter++;
        }
    }

    priorityQueue.erase(location);

    return nextJob;
}

最后，我在哪里调用函数：

void Processor::simulate() {
    srand(time(NULL));

    char newJobType;

    while (processingTime <= 50) {
        newJobType = 65 + rand() % 4;
        Job newJob(newJobType);
        newJob.arrivalTime += runningTime;

        processingTime += newJob.processingTime;

        priorityQueue.push_back(newJob);
        cout << endl << newJob.type << " " << newJob.arrivalTime;
        runningTime++;
    }
    runningTime = 0;

    int jobFinishTime;
    Job nextJob;

    nextJob = findNextJob();

    while (priorityQueue.size()) {
        cout << endl << runningTime << ") " << "Queue size: " << priorityQueue.size();
        if (!isProcessing) {
            cout << " CPU 1 Idle;";

            if (nextJob.arrivalTime == runningTime) {
                runningJob = nextJob;

                //irrelevant code here

                nextJob = findNextJob();
            }
        }

        if (isProcessing && (runningJob.arrivalTime + runningJob.processingTime) != runningTime) {

            //irrelevant code here

            if (nextJob.arrivalTime <= runningTime) {
                runningJob = nextJob;

                //irrelevant code here

                nextJob = findNextJob();
            }
        }
        if (nextJob.priority > runningJob.priority && nextJob.arrivalTime <= runningTime) {
                //irrelevant code here
        }



        runningTime++;
    }



}

findNextJob()成功运行了两次或三次，然后出现错误。任何帮助将不胜感激。

Answer 1

在C ++中，结束迭代器“指向”最后一个元素。

findNextJob允许迭代器iter等于priorityQueue.end()，因此取消引用是无效的。

while (iter <= priorityQueue.end()) {
    // ...
}

“无法取消双端队列迭代器”错误

1 个答案: