-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathResultSet.cpp
More file actions
89 lines (64 loc) · 1.42 KB
/
ResultSet.cpp
File metadata and controls
89 lines (64 loc) · 1.42 KB
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
/*
* ResultSet.cpp
*
* A dynamic array class to handle uncertain range query results
*/
#include "ResultSet.h"
#include<iostream>
#include<string>
using namespace std;
ResultSet::ResultSet(int size) {
this->size = size;
this->nextPos = 0;
this->results = new int[size];
}
ResultSet::~ResultSet() {
delete [] results;
}
int ResultSet::getSize() {
return nextPos;
}
int* ResultSet::getResults() {
int* nonEmptyResults = new int[nextPos];
for (int i = 0; i < nextPos; i++) {
nonEmptyResults[i] = results[i];
}
return nonEmptyResults;
}
void ResultSet::insert(int value) {
results[nextPos++] = value;
if (nextPos == size) {
resize();
}
}
/* for combining the in-memory and disk results */
int* ResultSet::combine(ResultSet rs) {
int otherSize = rs.getSize();
int* otherResults = rs.getResults();
int* combinedSet = new int[size + otherSize];
for (int i = 0; i < size; i++) {
combinedSet[i] = results[i];
}
for (int i = 0; i < otherSize; i++) {
combinedSet[i + size] = otherResults[i];
}
return combinedSet;
}
void ResultSet::resize() {
nextPos = 0;
int newSize = size * 2;
int* newResults = new int[newSize];
for (int i = 0; i < size; i++) {
newResults[i] = results[i];
}
delete [] results;
results = newResults;
}
void ResultSet::print() {
string output = "[ ";
for (int i = 0; i < nextPos; i++) {
output += " " + to_string(results[i]);
}
output += "]";
cout << output << endl;
}