Revision e56b7faf8786109a8d865fc8b02966906f49cd28 authored by Cambridge on 30 April 2018, 06:07:45 UTC, committed by Tom Quinn on 05 July 2018, 21:16:48 UTC
Change-Id: I1c58c774f3b21e3fdf085809bb49381f963ab52b
1 parent d84c8e1
GenericTreeNode.cpp
#include "config.h"
#include "GenericTreeNode.h"
namespace Tree {
GenericTreeNode *BinaryTreeNode::clone() const {
//BinaryTreeNode *tmp = new BinaryTreeNode();
//*tmp = *this;
//return tmp;
return new BinaryTreeNode(*this);
};
void BinaryTreeNode::pup(PUP::er &p, int depth) {
//CkPrintf("Pupper of BinaryTreeNode(%d) called for %s (%d)\n",depth,p.isPacking()?"Packing":p.isUnpacking()?"Unpacking":"Sizing",p.isSizing()?((PUP::sizer*)&p)->size():((PUP::mem*)&p)->size());
GenericTreeNode::pup(p);
int isNull;
for (int i=0; i<2; ++i) {
isNull = (children[i]==NULL || depth==0) ? 0 : 1;
p | isNull;
CkAssert(isNull==0 || isNull==1);
if (isNull != 0 && depth != 0) {
if (p.isUnpacking()) children[i] = new BinaryTreeNode();
children[i]->pup(p, depth-1);
if (p.isUnpacking()) children[i]->parent = this;
}
}
};
}
Computing file changes ...