CS106B/pqueue-vector.cpp at master · mefuru/CS106B · GitHub

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
/*************************************************************
 * File: pqueue-vector.cpp
 *
 * Implementation file for the VectorPriorityQueue
 * class.
 */

#include "pqueue-vector.h"
#include "error.h"
#include "vector.h"
#include <string>

using namespace std;

VectorPriorityQueue::VectorPriorityQueue() {
    Vector<string> priorityQueue;

}

VectorPriorityQueue::~VectorPriorityQueue() {
    // empty
}

int VectorPriorityQueue::size() {
    int size = priorityQueue.size();
    return size;

}

bool VectorPriorityQueue::isEmpty() {
    int size = priorityQueue.size();
    if (size==0){
        return true;
    } else {
        return false;
    }
}

void VectorPriorityQueue::enqueue(string value) {
    priorityQueue.add(value);
}

string VectorPriorityQueue::peek() {
    if (priorityQueue.size()==0){
        error("Priority queue is empty");
    }
    string s = priorityQueue[0];
    for (int i =0; i< priorityQueue.size(); i++){
        string t = priorityQueue[i];
        if (s>t){
            s = t;
        }
    }
    return s;
}

string VectorPriorityQueue::dequeueMin() {
    if (priorityQueue.size()==0){
        error("Priority queue is empty");
    }
    string s = priorityQueue[0];
    int location = 0;
    for (int i =0; i< priorityQueue.size(); i++){
        string t = priorityQueue[i];
        if (s>t){
            s = t;
            location=i;
        }
    }
    priorityQueue.removeAt(location);
    return s;
}