---

IdTable< T > Class Template Reference

Stores physical copies of each mesh and then different sorted orders of each. More...

#include <id_table.h>

Collaboration diagram for IdTable< T >:

[legend]List of all members.

Public Methods
void	eraseAll ()
int	add (const T &s)
	Adds a T to the universe. More...
void	kill (int id)
	Pushes a T onto the delete queue for future deletion. More...
T *	getById (int id)
	Returns the ID of this T given the name. More...
void	updateDeleteList ()
	Removes all units on the delete queue and kills them foreverer. More...
void	draw ()
	Goes through the mesh-sorted draw list in order and renders the Ts to screen. More...
void	update ()
	Gets the command from each AI and attempts to follow said command if possible (obstacles/other Ts willing). More...
template<class Coll> void	collideWithOther (Coll *coll, int surface, double minRadius, double maxRadius)
	Goes through bolt list and checks them against each mesh. FIXME combine somehow with update. More...
void	collideWithBolts ()
	Goes through bolt list and checks them against each mesh. FIXME combine somehow with update. More...
void	fixCollideOrder ()
void	collideWithSame ()
	Goes through all other T s ( Spectre or Bolt )s inside of this table and Collides them against each other. More...
Protected Methods
bool	del (int id)
	Erases a T from the maps, freeing all memory do not do this during list traversal. More...
Private Types
typedef MutableSet< T, MeshIdLess >	MeshMapClass
	A map that will store each T in texture-sorted, mesh-sorted order. More...
typedef KeyMutableSet< typename T::CollideKey, T, CollideKeyLess >	CollideMapClass
typedef Hashtable< int, T *, 65535 >	IdMap
Private Methods
void	incrementAndCheck (typename CollideMapClass::iterator &iter)
Private Attributes
std::vector< int >	deleteQueue
MeshMapClass	meshMap
	This class has the physical copy of the memory itself, stored in mesh-sorted order. More...
IdMap	idMap
	A pointer to the mesh that is stored previously hashed on the ID int. More...
CollideMapClass	collideMap
	A pointer to the T sorted by surface then by radius. More...

---

Detailed Description

template<class T>
class IdTable< T >

Stores physical copies of each mesh and then different sorted orders of each.

---

Member Typedef Documentation

template<class T> typedef KeyMutableSet<typename T::CollideKey, T, CollideKeyLess> IdTable< T >::CollideMapClass [private]

template<class T> typedef Hashtable<int, T *, 65535 > IdTable< T >::IdMap [private]

template<class T> typedef MutableSet<T, MeshIdLess> IdTable< T >::MeshMapClass [private]

A map that will store each T in texture-sorted, mesh-sorted order.

---

Member Function Documentation

template<class T> int IdTable< T >::add (  const T &    s )  [inline]

Adds a T to the universe. { static int numgen=0; typename MeshMapClass::iterator iter= meshMap.insert(s); T *collidableToInsert=&(*iter).get(); collideMap.insert(collidableToInsert); collidableToInsert->setId(numgen++); idMap.Put(collidableToInsert->getId(),collidableToInsert); return collidableToInsert->getId(); }

template<class T> void IdTable< T >::collideWithBolts (    )  [inline]

Goes through bolt list and checks them against each mesh. FIXME combine somehow with update. { //lower_bound!!! IdTable<Bolt> *btable=&world->surfaces[0]->boltField;//Just in case. typename CollideMapClass::iterator thisiter=collideMap.begin(); for (; thisiter!=collideMap.end(); ++thisiter) { const typename T::CollideKey &collideKey = ((*thisiter)->getCollideKey()); int surface=collideKey.surface; btable=&world->surfaces[surface]->boltField; T * c = (*thisiter); float cRadius=c->getRadius(); btable->collideWithOther(c,surface,collideKey.radius-fudgeFactor-cRadius,collideKey.radius+fudgeFactor+cRadius); } }

template<class T> template<class Coll> void IdTable< T >::collideWithOther (  Coll *    coll, int    surface, double    minRadius, double    maxRadius )  [inline]

Goes through bolt list and checks them against each mesh. FIXME combine somehow with update. { typename CollideMapClass::iterator othiter; typename T::CollideKey collideKey (surface,minRadius); othiter=this->collideMap.lower_bound(collideKey); while (othiter!=this->collideMap.end()&&(*othiter)->getCollideKey().radius<=maxRadius) { (*othiter)->collide(coll); ++othiter; } }

template<class T> void IdTable< T >::collideWithSame (    )  [inline]

Goes through all other T s ( Spectre or Bolt )s inside of this table and Collides them against each other. { for (typename CollideMapClass::iterator thisiter=collideMap.begin(); thisiter!=collideMap.end(); ++thisiter) { const typename T::CollideKey &collideKey = ((*thisiter)->getCollideKey()); for (typename CollideMapClass::iterator backward=thisiter;;) { if (backward==collideMap.begin()) break; --backward; const typename T::CollideKey &backCollideKey = ((*backward)->getCollideKey()); if ((backCollideKey.radius<(collideKey.radius-fudgeFactor-(2 * (*thisiter)->getRadius())))||(backCollideKey.surface!=collideKey.surface)) { break; } (*thisiter)->collide(*backward); } bool reachedthisiter=false; typename CollideMapClass::iterator otheriter=thisiter; ++otheriter; for (;otheriter!=collideMap.end();++otheriter) { const typename T::CollideKey &forwardCollideKey = ((*otheriter)->getCollideKey()); if (forwardCollideKey.radius>(collideKey.radius+fudgeFactor+(2 * (*thisiter )->getRadius()))||forwardCollideKey.surface!=collideKey.surface) { break; } (*thisiter)->collide(*otheriter); } } }

template<class T> bool IdTable< T >::del (  int    id )  [inline, protected]

Erases a T from the maps, freeing all memory do not do this during list traversal. { using std::vector; T *spec=idMap.Get(id); if (!spec) { return false; } idMap.Delete(id); { typename CollideMapClass::iterator iter=collidemap.find(spec->getCollideKey()); while (iter!=collidemap.end()) { if (spec==(*iter).second) { collidemap.erase(iter); } iter++; } } typename MeshMapClass::iterator iter=meshmap.find(spec); if (&(*iter)==spec) { meshmap.erase(iter); break; } return true; }

template<class T> void IdTable< T >::draw (    )

Goes through the mesh-sorted draw list in order and renders the Ts to screen.

template<class T> void IdTable< T >::eraseAll (    )  [inline]

{ meshMap.clear(); // idMap=IdMap(); //Does not work :-( collideMap.clear(); deleteQueue.clear(); }

template<class T> void IdTable< T >::fixCollideOrder (    )  [inline]

{ for (typename CollideMapClass::iterator thisiter=collideMap.begin(); thisiter!=collideMap.end(); incrementAndCheck(thisiter)) {} }

template<class T> T* IdTable< T >::getById (  int    id )  [inline]

Returns the ID of this T given the name. { typename IdMap::iterator iter = idMap.find(id); if (iter!=iter.end()) { return (*iter).second; } else { return NULL; } }

template<class T> void IdTable< T >::incrementAndCheck (  typename CollideMapClass::iterator &    iter )  [inline, private]

{ iter=collideMap.changeKey(iter,(*iter)->recalculateCollideKey()); }

template<class T> void IdTable< T >::kill (  int    id )  [inline]

Pushes a T onto the delete queue for future deletion. { deleteQueue.push_back (id); }

template<class T> void IdTable< T >::update (    )

Gets the command from each AI and attempts to follow said command if possible (obstacles/other Ts willing).

template<class T> void IdTable< T >::updateDeleteList (    )  [inline]

Removes all units on the delete queue and kills them foreverer. { while (!deleteQueue.empty()){ Del (deleteQueue.back()); deleteQueue.pop_back(); } }

---

Member Data Documentation

template<class T> CollideMapClass IdTable< T >::collideMap [private]

A pointer to the T sorted by surface then by radius.

template<class T> std::vector<int> IdTable< T >::deleteQueue [private]

template<class T> IdMap IdTable< T >::idMap [private]

A pointer to the mesh that is stored previously hashed on the ID int.

template<class T> MeshMapClass IdTable< T >::meshMap [private]

This class has the physical copy of the memory itself, stored in mesh-sorted order.

---

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

• id_table.h

---