PrioritizedUnit Class Reference

#include <PrioritizedUnit.h>

Inheritance diagram for PrioritizedUnit:

[legend]Collaboration diagram for PrioritizedUnit:

[legend]List of all members.

Public Member Functions
	PrioritizedUnit (int x, int y, unit *target, Prioritized *alg)
	The constructor.
virtual	~PrioritizedUnit (void)
	Deleting the unit -- clean-up.
tDirection	makeMove (mapProvider *, reservationProvider *, simulationInfo *simInfo)
	The new makeMove only gives a map.
tDirection	makeMove (mapProvider *, reservationProvider *, simulationInfo *simInfo, PrioritizedGroup *g)
	The main procedure --- make move.
void	startNewTrial ()
	Reset the unit for a new trial.
double	getAmountLearned ()
	Returns the amount learned at all levels.
bool	done ()
	The unit is done when the amount of learning on the trial is 0.0 and no tiles are explored by wA*.
char const *	getName ()
	Returns the algorithm's name.
int	getNumAbsLevels ()
	Returns the number of abstraction levels used by the algorithm.
void	logStats (statCollection *stats)
	Report Prioritized-specific stats.
Private Attributes
PrioritizedlevelData *	unitData
Prioritized *	algorithm
Friends
class	PrioritizedGroup

---

Constructor & Destructor Documentation

PrioritizedUnit::PrioritizedUnit (  int  _x, int  _y, unit *  _target, Prioritized *  alg )

The constructor.

PrioritizedUnit::~PrioritizedUnit (  void   )  [virtual]

Deleting the unit -- clean-up.

---

Member Function Documentation

bool PrioritizedUnit::done (   )  [virtual]

The unit is done when the amount of learning on the trial is 0.0 and no tiles are explored by wA*. Reimplemented from searchUnit.

double PrioritizedUnit::getAmountLearned (   )

Returns the amount learned at all levels.

char const * PrioritizedUnit::getName (   )  [virtual]

Returns the algorithm's name. Reimplemented from searchUnit.

int PrioritizedUnit::getNumAbsLevels (   )

Returns the number of abstraction levels used by the algorithm.

void PrioritizedUnit::logStats (  statCollection *  stats  )  [virtual]

Report Prioritized-specific stats. Reimplemented from searchUnit.

tDirection PrioritizedUnit::makeMove (  mapProvider *  mp, reservationProvider *  rp, simulationInfo *  simInfo, PrioritizedGroup *  group )

The main procedure --- make move.

tDirection PrioritizedUnit::makeMove (  mapProvider *  , reservationProvider *  , simulationInfo *  simInfo )  [inline, virtual]

The new makeMove only gives a map. The unit simulation won't calculate an mapAbstraction unless it has to. Thus, in simple pathfinding tests, the overhead is saved. Reimplemented from searchUnit.

void PrioritizedUnit::startNewTrial (   )

Reset the unit for a new trial.

---

Friends And Related Function Documentation

friend class PrioritizedGroup [friend]

---

Member Data Documentation

Prioritized* PrioritizedUnit::algorithm [private]

Reimplemented from searchUnit.

PrioritizedlevelData* PrioritizedUnit::unitData [private]

---

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

• /apps/RTS/PrioritizedUnit.h
• /apps/RTS/PrioritizedUnit.cpp

---