#include <collide_map.h>

Inheritance diagram for CollideArray:

Classes
class	CollidableBackref

Public Types
typedef Collidable *	iterator

typedef std::vector< Collidable >	ResizableArray

Public Member Functions
void	SetLocationIndex (unsigned int li)

bool	Iterable (iterator)

void	UpdateBoltInfo (iterator iter, Collidable::CollideRef ref)

void	flatten ()

void	flatten (CollideArray &example)

iterator	insert (const Collidable &newKey, iterator hint)

iterator	insert (const Collidable &newKey)

iterator	changeKey (iterator iter, const Collidable &newKey)

iterator	changeKey (iterator iter, const Collidable &newKey, iterator tless, iterator tmore)

iterator	begin ()

iterator	end ()

iterator	lower_bound (const Collidable &)

void	erase (iterator iter)

void	checkSet ()

	CollideArray (unsigned int location_index)

Public Attributes
std::vector< float >	max_radius

unsigned int	location_index

ResizableArray	sorted

ResizableArray	unsorted

std::vector< std::list < CollidableBackref > >	toflattenhints

unsigned int	count

Static Public Attributes
static float	max_bolt_radius = 0

Detailed Description

Definition at line 86 of file collide_map.h.

Member Typedef Documentation

typedef Collidable* CollideArray::iterator

Definition at line 110 of file collide_map.h.

typedef std::vector< Collidable > CollideArray::ResizableArray

Definition at line 112 of file collide_map.h.

Constructor & Destructor Documentation

CollideArray::CollideArray ( unsigned int location_index)

inline

Definition at line 135 of file collide_map.h.

References location_index.

                                                 : toflattenhints( 1 )
         , count( 0 )
     {
         this->location_index = location_index;
     }

Member Function Documentation

iterator CollideArray::begin ( )

inline

Definition at line 124 of file collide_map.h.

References sorted.

Referenced by GameCockpit::AutoLanding(), Mission::call_unit_launch(), changeKey(), CollideChecker< T, canbebolt >::CheckCollisions(), CollideChecker< T, canbebolt >::CheckCollisionsInner(), checkSet(), end(), erase(), findObjectsFromPosition(), flatten(), insert(), Iterable(), lower_bound(), Unit::RemoveFromSystem(), and UpdateBoltInfo().

     {
         return sorted.size() != 0 ? &*sorted.begin() : NULL;
     }

CollideArray::iterator CollideArray::changeKey	(	CollideArray::iterator	iter,
		const Collidable &	newKey
	)

Definition at line 44 of file collide_map.cpp.

References begin(), end(), and unsorted.

Referenced by changeKey(), and Bolt::Update().

 {
     if ( iter >= this->begin() && iter < this->end() ) {
         iterator tmp = &*( this->unsorted.begin()+( iter-this->begin() ) );
         *tmp = newKey;
     } else {
         *iter = newKey;
     }
     return iter;
 }

CollideArray::iterator CollideArray::changeKey	(	CollideArray::iterator	iter,
		const Collidable &	newKey,
		CollideArray::iterator	tless,
		CollideArray::iterator	tmore
	)

Definition at line 55 of file collide_map.cpp.

References changeKey().

 {
     return this->changeKey( iter, newKey );
 }

void CollideArray::checkSet ( )

Definition at line 240 of file collide_map.cpp.

References begin(), and end().

Referenced by Unit::RemoveFromSystem().

 {
     if ( this->begin() != this->end() )
         for (iterator newiter = this->begin(), iter = newiter++; newiter != this->end(); iter = newiter++)
             assert( *iter < *newiter );
 }

iterator CollideArray::end ( )

inline

Definition at line 128 of file collide_map.h.

References begin(), and sorted.

Referenced by GameCockpit::AutoLanding(), changeKey(), CollideChecker< T, canbebolt >::CheckCollisions(), CollideChecker< T, canbebolt >::CheckCollisionsInner(), checkSet(), erase(), findObjectsFromPosition(), CommunicatingAI::GetRandomUnit(), insert(), Iterable(), lower_bound(), Unit::RemoveFromSystem(), and UpdateBoltInfo().

     {
         return this->begin()+sorted.size();
     }

void CollideArray::erase ( iterator iter)

Definition at line 8 of file collide_map.cpp.

References begin(), count, end(), i, Collidable::radius, Collidable::ref, toflattenhints, CollideArray::CollidableBackref::toflattenhints_offset, Collidable::CollideRef::unit, and unsorted.

Referenced by BoltDestroyGeneric(), Unit::RemoveFromSystem(), and StarSystem::RemoveUnit().

 {
     count -= 1;
     if ( target >= this->begin() && target < this->end() ) {
         target->radius   = 0;
         target->ref.unit = NULL;
         size_t diff = ( target-this->begin() );
         if (this->unsorted.size() > diff) {
             //for secondary collide arrays that have no unsorted array
             iterator tmp = &*(this->unsorted.begin()+diff);
             tmp->radius   = 0;
             tmp->ref.unit = NULL;
         }
         return;
     } else if (target == NULL) {
         return;
     } else {
         CollidableBackref *targ = static_cast< CollidableBackref* > (&*target);
         std::list< CollidableBackref > *targlist = &toflattenhints[targ->toflattenhints_offset];
         std::list< CollidableBackref >::iterator endlist = targlist->end();
         for (std::list< CollidableBackref >::iterator i = targlist->begin(); i != endlist; ++i)
             if (&*i == target) {
                 targlist->erase( i );
                 return;
             }
     }
 }

void CollideArray::flatten ( )

Definition at line 121 of file collide_map.cpp.

References begin(), count, f, vsalg::for_each(), i, index, j, location_index, max_radius, size, sorted, toflattenhints, Unit::UNIT_BOLT, Unit::UNIT_ONLY, and unsorted.

Referenced by flatten(), and StarSystem::UpdateUnitPhysics().

 {
     sorted.resize( count );
     max_radius.resize( count );
     size_t len   = unsorted.size();
     size_t index = count;
     RadiusUpdate< -1, true >collideUpdate( this );
     for (ptrdiff_t i = len; i >= 0; i--) {
         Collidable *tmp;
         if (i < static_cast<ptrdiff_t>(len) && (tmp = &unsorted[i])->radius != 0.0f) {
             sorted[--index] = *tmp;
             collideUpdate( *tmp, index );
         }
         
         std::list< CollidableBackref >::iterator listend = toflattenhints[i].end();
         for (std::list< CollidableBackref >::iterator j = toflattenhints[i].begin();
              j != listend;
              ++j)
             if (j->radius != 0) {
                 sorted[--index] = *j;
                 collideUpdate( *j, index );
             }
         toflattenhints[i].resize( 0 );
     }
 
     std::sort( sorted.begin(), sorted.end() );
     unsorted = sorted;
 
     toflattenhints.resize( count+1 );
     if (location_index == Unit::UNIT_BOLT) {
         size_t i    = 0;
         size_t size = sorted.size();
         ResizableArray::iterator iter = sorted.begin();
         UpdateBackpointers< Unit::UNIT_BOLT >update;
         RadiusUpdate< 1, false > radUpdate( this );
         for (i = 0; i != size; ++i, ++iter) {
             update( *iter );
             radUpdate( *iter, i );
         }
     } else if (location_index == Unit::UNIT_ONLY) {
         for_each( sorted.begin(), sorted.end(), UpdateBackpointers< Unit::UNIT_ONLY > () );
     } else {
         assert( 0 && "Only Support arrays of units_only and mixed units bolts" );         //right now only support 2 array types;
     }
 }

void CollideArray::flatten ( CollideArray & example)

Definition at line 197 of file collide_map.cpp.

References count, flatten(), vsalg::for_each(), location_index, sorted, toflattenhints, and Unit::UNIT_ONLY.

 {
     if (location_index == Unit::UNIT_ONLY) {
         sorted.resize( count );
         for_each( toflattenhints.begin(), toflattenhints.end(), resizezero() );
         toflattenhints.resize( count+1 );
 
         for_each( sorted.begin(), sorted.end(), CopyExample( hint.sorted.begin(), hint.sorted.end() ) );
     } else {
         printf( "Trying to use flatten hint on a array with both bolts and units\n" );
         flatten();
     }
 }

CollideArray::iterator CollideArray::insert	(	const Collidable &	newKey,
		iterator	hint
	)

Definition at line 211 of file collide_map.cpp.

References begin(), count, end(), max_bolt_radius, Collidable::radius, SIMULATION_ATOM, sorted, toflattenhints, and unsorted.

Referenced by Bolt::Bolt(), Unit::CollideAll(), insert(), and Unit::UpdateCollideQueue().

 {
     if (newKey.radius < -max_bolt_radius*SIMULATION_ATOM)
         max_bolt_radius = -newKey.radius/SIMULATION_ATOM;
     if ( this->begin() == this->end() ) {
         count += 1;
         this->unsorted.push_back( newKey );
         this->toflattenhints.resize( 2 );
         this->sorted.push_back( newKey );
         return &sorted.back();
     } else if ( hint >= this->begin() && hint <= this->end() ) {
         count += 1;
         size_t len = hint-this->begin();
         std::list< CollidableBackref > *hintlist = &toflattenhints[len];
         return &*hintlist->insert( hintlist->end(), CollidableBackref( newKey, len ) );
     } else {
         return this->insert( newKey );         //don't use hint;
     }
 }

CollideArray::iterator CollideArray::insert ( const Collidable & newKey)

Definition at line 236 of file collide_map.cpp.

References insert(), and lower_bound().

 {
     return this->insert( newKey, this->lower_bound( newKey ) );
 }

bool CollideArray::Iterable ( CollideArray::iterator a)

Definition at line 255 of file collide_map.cpp.

References begin(), and end().

Referenced by CollideChecker< T, canbebolt >::CheckCollisions(), and findObjectsFromPosition().

 {
     return a >= begin() && a < end();
 }

CollideArray::iterator CollideArray::lower_bound ( const Collidable & newKey)

Definition at line 231 of file collide_map.cpp.

References begin(), and end().

Referenced by GameStarSystem::Draw(), CommunicatingAI::GetRandomUnit(), and insert().

 {
     return ::std::lower_bound( this->begin(), this->end(), newKey );
 }

void CollideArray::SetLocationIndex ( unsigned int li)

inline

Definition at line 106 of file collide_map.h.

References location_index.

     {
         location_index = li;
     }

void CollideArray::UpdateBoltInfo	(	CollideArray::iterator	iter,
		Collidable::CollideRef	ref
	)

Definition at line 35 of file collide_map.cpp.

References begin(), end(), is_null(), and unsorted.

Referenced by BoltDestroyGeneric().

 {
     if ( iter >= this->begin() && iter < this->end() ) {
         ( *( unsorted.begin()+( iter-this->begin() ) ) ).ref = ref;         //update both unsorted and sorted
         (*iter).ref = ref;
     } else if ( !is_null( iter ) ) {
         (*iter).ref = ref;
     }
 }