KNearestSmoothCompute Class Reference

Class for computation over k nearest neighbors. More...

#include <smooth.h>

Inheritance diagram for KNearestSmoothCompute:

Public Member Functions
	KNearestSmoothCompute (TreePiece *_tp, SmoothParams *_params, int nSm, int iLhF, double dfB2OS2)
void	bucketCompare (TreePiece *tp, GravityParticle *p, GenericTreeNode *node, GravityParticle *particles, Vector3D< double > offset, State *state)
void	initSmoothPrioQueue (int iBucket, State *state)
int	openCriterion (TreePiece *ownerTP, GenericTreeNode *node, int reqID, State *state)
void	startNodeProcessEvent (State *state)
void	finishNodeProcessEvent (TreePiece *owner, State *state)
	Allow book-keeping when finished with a node.
void	nodeRecvdEvent (TreePiece *owner, int chunk, State *state, int bucket)
	Allow book-keeping of a cache receive event.
void	recvdParticlesFull (GravityParticle *egp, int num, int chunk, int reqID, State *state, TreePiece *tp, Tree::NodeKey &remoteBucket)
void	walkDone (State *state)
State *	getNewState (int d1)
State *	getNewState (int d1, int d2)
State *	getNewState ()
Public Member Functions inherited from SmoothCompute
	SmoothCompute (TreePiece *_tp, SmoothParams *_params)
int	doWork (GenericTreeNode *node, TreeWalk *tw, State *state, int chunk, int reqID, bool isRoot, bool &didcomp, int awi)
	Work to be done at each node.
void	reassoc (void *ce, int ar, Opt *o)
void	nodeMissedEvent (int reqID, int chunk, State *state, TreePiece *tp)
	Allow book-keeping of a cache miss.
Public Member Functions inherited from Compute
void	setOpt (Opt *opt)
virtual void	stateReady (State *state, TreePiece *owner, int chunk, int start, int end)
virtual void	stateReadyPar (TreePiece *tp, int start, int end, CkVec< OffsetNode > &clist, CkVec< RemotePartInfo > &rpilist, CkVec< LocalPartInfo > &lpilist)
virtual void	fillLists (State *state_, TreePiece *tp, int chunk, int start, int end, CkVec< OffsetNode > &clistforb, CkVec< RemotePartInfo > &rplistforb, CkVec< LocalPartInfo > &lplistforb)
virtual void	init (void *cE, int activeRung, Opt *opt)
	Associate computeEntity (target bucket or node), activeRung and Optimization with this Compute object.
ComputeType	getSelfType ()
OptType	getOptType ()
int	getActiveRung ()
virtual void	initState (State *state)
virtual void	recvdParticles (ExternalGravityParticle *egp, int num, int chunk, int reqID, State *state, TreePiece *tp, Tree::NodeKey &remoteBucket)
	Allow book-keeping of a cache receive event.
virtual void	setComputeEntity (void *ce)
virtual void *	getComputeEntity ()
virtual void	freeState (State *state)

Additional Inherited Members
Public Attributes inherited from SmoothCompute
SmoothParams *	params
Public Attributes inherited from Compute
int	nActive
Protected Member Functions inherited from Compute
	Compute (ComputeType t)
Protected Attributes inherited from SmoothCompute
TreePiece *	tp
Protected Attributes inherited from Compute
Opt *	opt
void *	computeEntity
int	activeRung
ComputeType	type

Detailed Description

Class for computation over k nearest neighbors.

Member Function Documentation

bucketCompare()

void KNearestSmoothCompute::bucketCompare ( TreePiece * ownerTP, GravityParticle * p, GenericTreeNode * node, GravityParticle * particles, Vector3D< double > offset, State * state )

virtual

Test a given particle against all the priority queues in the bucket.

Implements SmoothCompute.

finishNodeProcessEvent()

void KNearestSmoothCompute::finishNodeProcessEvent ( TreePiece * owner, State * state )

inlinevirtual

Allow book-keeping when finished with a node.

Reimplemented from Compute.

getNewState() [1/3]

State * KNearestSmoothCompute::getNewState ( )

inlinevirtual

Reimplemented from Compute.

getNewState() [2/3]

State * KNearestSmoothCompute::getNewState ( int d1 )

virtual

Reimplemented from Compute.

getNewState() [3/3]

State * KNearestSmoothCompute::getNewState ( int d1, int d2 )

inlinevirtual

Reimplemented from Compute.

nodeRecvdEvent()

void KNearestSmoothCompute::nodeRecvdEvent ( TreePiece * owner, int chunk, State * state, int bucket )

virtual

Allow book-keeping of a cache receive event.

Reimplemented from Compute.

openCriterion()

int KNearestSmoothCompute::openCriterion ( TreePiece * ownerTP, GenericTreeNode * node, int reqID, State * state )

virtual

Opening criterion for the smoothBucket walk. Return true if we must open the node.

Implements Compute.

recvdParticlesFull()

void KNearestSmoothCompute::recvdParticlesFull ( GravityParticle * part, int num, int chunk, int reqID, State * state, TreePiece * tp, Tree::NodeKey & remoteBucket )

virtual

Process particles received from missed Cache request

Reimplemented from Compute.

startNodeProcessEvent()

void KNearestSmoothCompute::startNodeProcessEvent ( State * state )

inlinevirtual

virtual functions to allow for book-keeping these are essentially notifications to the Compute object from the TreeWalk that certain events have taken place - the Compute reacts accordingly.

Reimplemented from Compute.

walkDone()

void KNearestSmoothCompute::walkDone ( State * state )

virtual

Reimplemented from Compute.

---

The documentation for this class was generated from the following files:

• smooth.h
• smooth.cpp