Newer
Older
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
#include <cfloat>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include "Node.hpp"
namespace nbody {
using namespace std;
Node::Node(Tree* tree) {
initBox(this->bb);
this->afterSubtree = NULL;
this->prev = this;
this->next = this;
this->leaf = true;
this->tree = tree;
this->prevSibling = NULL;
this->nextSibling = NULL;
this->parent = NULL;
}
Node::~Node() {
}
Box Node::getBB() {
return this->bb;
}
void Node::setBB(Box bb) {
this->bb = bb;
}
bool Node::isSplitable() {
bool result = true;
if (this->bodies.size() <= this->tree->maxLeafBodies) {
result = false;
}
if (volume(this->bb) <= FLT_EPSILON) {
result = false;
}
return result;
}
void Node::extendBBforBodies() {
extendForBodies(this->bb, this->bodies);
}
void Node::extendBBtoCube() {
extendToCube(this->bb);
}
vector<Body> Node::getBodies() {
return this->bodies;
}
void Node::insertBefore(Node* node) {
node->next = this;
node->prev = this->prev;
this->prev->next = node;
this->prev = node;
}
void Node::insertAfter(Node* node) {
this->next->insertBefore(node);
}
void Node::unlink() {
this->next->prev = this->prev;
this->prev->next = this->next;
this->next = this;
this->prev = this;
}
bool Node::isCorrect() {
if (this->afterSubtree == NULL) {
cerr << "after subtree null" << endl;
return false;
}
if (!isCorrectBox(this->bb)) {
cerr << "bb wrong" << endl;
return false;
}
for (int i = 0; i < 3; i++) {
if (this->bb.min[i] > this->bb.max[i]) {
cerr << "bb " << i << " min " << this->bb.min[i] << " max " << this->bb.max[i] << endl;
return false;
}
}
for (vector<Body>::iterator it = this->bodies.begin(); it != this->bodies.end(); it++) {
if (!isContained(*it, this->bb)) {
cerr << "bb out of bounds" << endl;
return false;
}
}
if (!this->leaf) {
Node* current = this->next;
int children = 0;
while (current != NULL && current != this->afterSubtree) {
current = current->afterSubtree;
children++;
}
if (current == NULL) {
cerr << "afterSubtree null" << endl;
return false;
}
if (children != this->tree->numberOfChildren()) {
cerr << "wrong number of children " << children << endl;
return false;
}
current = this->next;
for (int i = 0; i < this->tree->numberOfChildren(); i++) {
current = current->afterSubtree;
}
if (current != this->afterSubtree) {
cerr << "last sibling afterSubtree inconsistent" << endl;
return false;
}
}
if (!this->leaf && this->bodies.size() > 0) {
cerr << "non-empty inner node" << endl;
return false;
}
if (this->leaf && this->nextSibling != NULL && this->next != this->nextSibling) {
cerr << "wrong next sibling" << endl;
return false;
}
return true;
}
void Node::update() {
double position[3] = {0.0, 0.0, 0.0};
double mass = 0.0;
if (this->leaf) {
for (vector<Body>::iterator it = this->bodies.begin(); it != this->bodies.end(); it++) {
mass += it->mass;
for (int i = 0; i < 3; i++) {
position[i] += it->position[i] * it->mass;
}
}
} else {
for (Node* node = this->next; node != this->tree->nodes && node != NULL; node = node->afterSubtree) {
mass += node->representative.mass;
}
}
for (int i = 0; i < 3; i++) {
this->representative.position[i] = position[i] / mass;
}
this->representative.mass = mass;
}
double Node::getL() {
return maxSidelength(this->bb);
}
void Node::print(int parallelId) {
printBB(parallelId, this->bb);
for (vector<Body>::iterator it = this->bodies.begin(); it != this->bodies.end(); it++) {
cout << " ";
printBody(parallelId, *it);
}
}
bool Node::sufficientForBody(Body body) {
double distance = 0.0;
for (int i = 0; i < 3; i++) {
distance += (this->representative.position[i] - body.position[i]) * (this->representative.position[i] - body.position[i]);
}
return sqrt(distance) > this->getL();
}
bool Node::sufficientForBox(Box box) {
return distanceToBox(this->bb, box) > this->getL();
}
void Node::setBodies(vector<Body> bodies) {
this->bodies = bodies;
}
void Node::extractLocalBodiesTo(vector<Body>& bodies) {
vector<Body> result;
vector<Body>::iterator it = this->bodies.begin();
while (it != this->bodies.end()) {
if (!it->refinement) {
bodies.push_back(*it);
}
it = this->bodies.erase(it);
}
}
}