-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdata_collection.cpp
More file actions
58 lines (51 loc) · 1.57 KB
/
data_collection.cpp
File metadata and controls
58 lines (51 loc) · 1.57 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
#include "data_collection.h"
namespace compaction {
void compaction::DataCollection::AppendTuple(std::vector<compaction::Attribute> &tuple) {
collection_.push_back(tuple);
++n_tuples_;
}
void compaction::DataCollection::AppendChunk(compaction::DataChunk &chunk) {
assert(types_ == chunk.types_);
collection_.resize(chunk.count_ + n_tuples_);
vector<Attribute> tuple(types_.size());
for (size_t i = 0; i < chunk.count_; ++i) {
for (size_t j = 0; j < tuple.size(); ++j) {
auto idx = chunk.data_[j].selection_vector_[i];
tuple[j] = chunk.data_[j].GetValue(idx);
}
collection_[n_tuples_ + i] = tuple;
}
n_tuples_ += chunk.count_;
}
compaction::DataChunk compaction::DataCollection::FetchChunk(size_t start, size_t end) {
DataChunk chunk(types_);
for (size_t i = start; i < end; ++i) {
chunk.AppendTuple(collection_[i]);
}
return chunk;
}
void compaction::DataCollection::Print(size_t n_tuple) {
n_tuple = std::min(n_tuple, n_tuples_);
for (size_t i = 0; i < n_tuple; ++i) {
auto &tuple = collection_[i];
for (size_t j = 0; j < tuple.size(); ++j) {
switch (types_[j]) {
case AttributeType::INTEGER: {
std::cout << std::get<size_t>(tuple[j]) << ", ";
break;
}
case AttributeType::DOUBLE: {
std::cout << std::get<double>(tuple[j]) << ", ";
break;
}
case AttributeType::STRING: {
std::cout << std::get<std::string>(tuple[j]) << ", ";
break;
}
case AttributeType::INVALID:break;
}
}
std::cout << "\n";
}
}
}