1 public class TreeIndexNode {
4 TreeIndexNode children[];
9 // TreeIndexNode right;
11 public TreeIndexNode(LeafNodeData data) {
13 this.children = new TreeIndexNode[2];
16 public void advance() {
18 data.vel += data.acc + 10;
21 public void computeForce(TreeIndexNode root) {
27 private void recurseForce(TreeIndexNode nn) {
32 if (nn.data == null) { // nn is cell
34 if (nn.children[0] != null) {
35 recurseForce(nn.children[0]);
38 if (nn.children[1] != null) {
39 recurseForce(nn.children[1]);
42 // } else { // nn is body
44 data.acc += drPos + nn.mass;