-
Notifications
You must be signed in to change notification settings - Fork 15
/
Copy pathHashEquiJoin.cpp
47 lines (35 loc) · 1.03 KB
/
HashEquiJoin.cpp
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
#include <db/HashEquiJoin.h>
using namespace db;
HashEquiJoin::HashEquiJoin(JoinPredicate p, DbIterator *child1, DbIterator *child2) {
// TODO pa3.1: some code goes here
}
JoinPredicate *HashEquiJoin::getJoinPredicate() {
// TODO pa3.1: some code goes here
}
const TupleDesc &HashEquiJoin::getTupleDesc() const {
// TODO pa3.1: some code goes here
}
std::string HashEquiJoin::getJoinField1Name() {
// TODO pa3.1: some code goes here
}
std::string HashEquiJoin::getJoinField2Name() {
// TODO pa3.1: some code goes here
}
void HashEquiJoin::open() {
// TODO pa3.1: some code goes here
}
void HashEquiJoin::close() {
// TODO pa3.1: some code goes here
}
void HashEquiJoin::rewind() {
// TODO pa3.1: some code goes here
}
std::vector<DbIterator *> HashEquiJoin::getChildren() {
// TODO pa3.1: some code goes here
}
void HashEquiJoin::setChildren(std::vector<DbIterator *> children) {
// TODO pa3.1: some code goes here
}
std::optional<Tuple> HashEquiJoin::fetchNext() {
// TODO pa3.1: some code goes here
}