void DirectXGraphics::renderGame(Game *game)
{
GameStateManager *gsm = game->getGSM();
World *world = gsm->getWorld();
GameText *text = game->getText();
// CHECK TO SEE IF WE STILL HAVE THE GPU
HRESULT result = graphicsDevice->TestCooperativeLevel();
// IF WE HAVE THE GPU, RENDER THE GAME
if (SUCCEEDED(result))
{
// NOW PREPARE TO RENDER THE LISTS USING
// BATCH TEXTURE RENDERING
startDirectXFrameRendering();
spriteHandler->Begin(D3DXSPRITE_ALPHABLEND);
// RENDER THE WORLD RENDER LIST
renderWorldRenderList();
// RENDER THE GUI RENDER LIST
renderGUIRenderList();
// RENDER THE TEXT
renderText(text);
// WRAP UP RENDERING RESOURCES
if (FAILED(spriteHandler->End()))
{
text->writeDebugOutput("\nspriteHandler->End(): FAILED");
}
endDirectXFrameRendering();
}
// WE'VE LOST THE GPU, SLEEP UNTIL WE GET IT BACK
else if (result == D3DERR_DEVICELOST)
{
spriteHandler->OnLostDevice();
textFont->OnLostDevice();
Sleep(100);
}
// WE'VE GOT IT BACK, RELOAD EVERYTHING. NOTE THAT
// WE'LL ONLY GET THIS MESSAGE ONCE.
else if (result == D3DERR_DEVICENOTRESET)
{
if (FAILED(graphicsDevice->Reset(&presentParameters)))
{
game->getText()->writeDebugOutput("\ngraphicsDevice->Reset: FAILED - Reloading GPU images");
game->reloadAllDevices();
}
else
{
spriteHandler->OnResetDevice();
textFont->OnResetDevice();
}
}
}
/*
This is where all game physics starts each frame. It is called each frame
by the game statem manager after player input and AI have been processed. It
updates the physical state of all dynamic objects in the game and
moves all objects to their end of frame positions, updates all necessary
object velocities, and calls all collision event handlers.
*/
void Physics::update(Game *game)
{
// WE'LL USE A CONTINUOUS COLLISION SYSTEM TO ENSURE TEMPORAL
// COHERENCE, WHICH MEANS WE'LL MAKE SURE COLLISIONS ARE RESOLVED
// IN THE ORDER WITH WHICH THEY HAPPEN. WE DON'T WANT GAME EVENTS
// TO APPEAR TO HAPPEN IN THE WRONG ORDER. WE'LL TRY TO MAKE IT
// A LITTLE MORE EFFICIENT BY EMPLOYING A VARIATION ON THE
// SWEEP AND PRUNE ALGORITHM FOR DYNAMIC-DYNAMIC OBJECT COLLISIONS
// IN CASE WE'RE DOING THE ONE UPDATE STEP AT A TIME
// THIS MAKES SURE THE UPDATE DOESN'T GET CALLED AGAIN
// NEXT FRAME WITHOUT THE USER EXPLICITY REQUESTING IT
// BY PRESSING THE 'T' KEY (for Time sTep)
activatedForSingleUpdate = false;
// WE'LL NEED THE WORLD TO ACCESS THE SPRITES AND WORLD LAYERS
GameStateManager *gsm = game->getGSM();
World *world = gsm->getWorld();
// NOTE THAT WE MAKE SURE THE activeCollisions VECTOR IS
// EMPTIED BEFORE THIS METHOD EXITS, SO WE CAN ASSUME
// IT'S EMPTY NOW. activeCollisions CONTAINS ALL THE COLLISIONS
// DETECTED SO FAR THIS FRAME. THESE ARE THE THINGS WE MUST
// RESOLVE.
// START THE CLOCK AT 0, THAT MEANS 0% OF THE WAY THROUGH THE FRAME.
// NOTE THAT TIME 0 IS THE MOST DANGEROUS TIME FOR DETECTING COLLISIONS
// BECAUSE THEY CAN BE EASILY OVERLOOKED. THE SAME FOR SIMULTANEOUS
// COLLISIONS. TO MINIMIZE RIGID BODY PENETRATION, SUCH CIRCUMSTANCES
// ARE TYPICALLY HANDLED AS SPECIAL CASES
currentCollisionTime = 0.0f;
// FIRST WE NEED TO DO COLLISION TESTING PREP WORK FOR SPRITES
// APPLY ACCELERATION AND GRAVITY TO VELOCITY
// INIT TILE COLLISION INFO
// SET ON TILE LAST FRAME USING ON TILE THIS FRAME
// SET ON TILE THIS FRAME TO FALSE
// GET COLLISIONS WITH ALL TILES TO HAPPEN DURING THIS FRAME
// PUT THESE COLLISIONS INTO A SORTABLE DATA STRUCTURE
// INIT SPRITE'S SWEPT SHAPE INFO
// FOR ALL SPRITES, INCLUDING THE BOTS AND PLAYER
vector<CollidableObject*>::iterator spritesIt = sortedSweptShapes[LEFT_EDGE]->begin();
while (spritesIt != sortedSweptShapes[LEFT_EDGE]->end())
{
CollidableObject *sprite = (*spritesIt);
prepSpriteForCollisionTesting(world, sprite);
getAllTileCollisionsForAGivenSprite(world, sprite, 1.0f);
spritesIt++;
}
// PREPARE FOR SPRITE-SPRITE COLLISION TESTING
// SWEEP AND PRUNE DATA STRUCTURES PREP WORK
// SORT S_AND_P VECTOR SORTED BY START X OF SWEPT SHAPE
// SORT S_AND_P VECTOR SORTED BY END X OF SWEPT SHAPE
// WE DON'T NEED THE Y-AXIS SORTED, BUT WOULD IF THIS
// WERE A 3D SYSTEM TO SAVE ON COMPARISONS.
// WE'RE USING C++'s STL sort METHOD AND ARE PROVIDING
// A CUSTOM MEANS FOR COMPARISON
sort(sortedSweptShapes[LEFT_EDGE]->begin(), sortedSweptShapes[LEFT_EDGE]->end(), SweptShapesComparitorByLeft());
sort(sortedSweptShapes[RIGHT_EDGE]->begin(), sortedSweptShapes[RIGHT_EDGE]->end(), SweptShapesComparitorByRight());
// RECORD SORTED POSITIONS WITH EACH SPRITE. THEY NEED TO KNOW WHERE
// THEY ARE IN THOSE DATA STRUCTURES SUCH THAT WE CAN JUMP INTO
// THOSE DATA STRUCTURES TO TEST COLLISIONS WITH NEIGHBORS
updateSweptShapeIndices();
// YOU'LL NEED TO TEST FOR SPRITE-TO-SPRITE COLLISIONS HERE
// *** LOOP STARTS HERE. WE'LL DO THIS UNTIL THERE ARE NO
// MORE COLLISIONS TO RESOLVE FOR THIS FRAME
while (activeCollisions.size() > 0)
{
// SORT COLLISION OBJECTS BY TIME OF COLLISION
// NOTE THAT I'M JUST EMPLOYING THE STL'S List
// CLASS' SORT METHOD BY PROVIDING MY OWN
// MEANS FOR COMPARING Collision OBJECTS
activeCollisions.sort(CollisionComparitor());
// GET FIRST COLLISION - NOTE THAT WE HAVE THE COLLISIONS SORTED
// IN DESCENDING ORDER, SO TO TAKE THE EARLIEST ONE, WE REMOVE IT
// FOM THE BACK OF THE SORTED LIST
Collision *earliestCollision = activeCollisions.back();
activeCollisions.pop_back();
float collisionTime = earliestCollision->getTimeOfCollision();
// MOVE ALL SPRITES UP TO TIME OF FIRST COLLISION USING
// APPROPRIATELY SCALED VELOCITIES
moveAllSpritesUpToBufferedTimeOfCollision(earliestCollision);
// AND ADVANCE COLLISION TIME
currentCollisionTime = collisionTime;
// AND UPDATE THE VELOCITIES OF THE SPRITE(S) INVOLVED IN THE COLLISION
performCollisionResponse(earliestCollision);
// EXECUTE COLLISION EVENT CODE
// TEST TO SEE TYPES OF OBJECTS AND APPROPRIATE RESPONSE
// ACCORDING TO CUSTOMIZED COLLISION EVENT HANDLER
collisionListener->respondToCollision(game, earliestCollision);
// FOR THE TWO OBJECTS INVOLVED IN THE COLLISION
// REMOVE ALL OTHER COLLISIONS INVOLVING THEM
// SINCE THEY ARE NOW OBSOLETE. THE REASON BEING
// THE OBJECT COLLISION NOW LIKELY HAS A
// DIFFERENT VECTOR
// UPDATE THEIR SWEPT SHAPES
// TEST THEM AGAINST TILES AGAIN
CollidableObject *co1 = earliestCollision->getCO1();
CollidableObject *co2 = earliestCollision->getCO2();
removeActiveCOCollisions(co1);
co1->updateSweptShape(1.0f - currentCollisionTime);
getAllTileCollisionsForAGivenSprite(world, co1, 1.0f - currentCollisionTime);
// ONLY DO IT FOR THE SECOND ONE IF IT'S NOT A TILE
if (!earliestCollision->isCollisionWithTile())
{
removeActiveCOCollisions(co2);
co2->updateSweptShape(1.0f - currentCollisionTime);
getAllTileCollisionsForAGivenSprite(world, co2, 1.0f - currentCollisionTime);
}
else
{
spriteToTileCollisionsThisFrame[co1].insert(earliestCollision->getTile());
recycledCollidableObjectsList.push_back(co2);
}
// NOW WE NEED TO SEE IF THE SPRITES INVOLVED IN THE JUST
// RESOLVED COLLISION ARE GOING TO BE INVOLVED IN ANY MORE
// WITH OTHER SPRITES BUT WE DON'T WANT TO CHECK ALL OF THEM,
// WE ONLY WANT TO CHECK NEIGHBORS, BUT FIRST WE HAVE TO
// MAKE SURE THE SPRITE(S) THAT WE JUST RESOLVED ARE IN THEIR
// PROPER SWEPT SHAPE LOCATIONS WITHOUT HAVING TO RESORT EVERTYHING
// IF IT WAS ONLY ONE SPRITE WITH A TILE THIS IS EASY TO DO
if (earliestCollision->isCollisionWithTile())
{
reorderCollidableObject(co1);
}
// YOU'LL HAVE TO WORRY ABOUT REORDERING STUFF FOR COLLISIONS
// BETWEEN TWO SPRITES
// NOW TEST NEIGHBORS OF SPRITES INVOLVED IN RESOLVED COLLISION
// AGAINST NEIGHBORS IN SWEPT SHAPE DATA STRUCTURES. YOU'LL HAVE
// TO FIGURE OUT HOW TO DO THIS AND HOW TO RESOLVE SUCH COLLISIONS
// RECYCLE THE COLLISION SINCE WE'RE NOW DONE WITH IT
recycledCollisions.push_back(earliestCollision);
}
// APPLY THE REMAINING TIME TO MOVE THE SPRITES. NOTE THAT
// THIS IS ACTUALLY A VERY RISKY, TRICKY STEP BECAUSE IT COULD
// MOVE OBJECTS ALMOST TO THE POINT OF COLLISION, WHICH MAY THEN
// BE DETECTED ALMOST AT TIME 0 NEXT FRAME. THERE ARE OTHER TRICKY
// ISSUES RELATED TO OUR BUFFER AS WELL, SO WE CHEAT A LITTLE HERE
// AND SCALE THE TIME REMAINING DOWN A LITTE
if (currentCollisionTime < 1.0f)
moveAllSpritesToEndOfFrame();
// INIT TILE COLLISION INFO
// SET ON TILE LAST FRAME USING ON TILE THIS FRAME
// SET ON TILE THIS FRAME TO FALSE
spritesIt = sortedSweptShapes[LEFT_EDGE]->begin();
while (spritesIt != sortedSweptShapes[LEFT_EDGE]->end())
{
CollidableObject *sprite = (*spritesIt);
sprite->advanceOnTileStatus();
spritesIt++;
}
// WE'RE NOT GOING TO ALLOW MULTIPLE COLLISIONS TO HAPPEN IN A FRAME
// BETWEEN THE SAME TWO OBJECTS
spriteToTileCollisionsThisFrame.clear();
}
/*
This is where all game physics starts each frame. It is called each frame
by the game statem manager after player input and AI have been processed. It
updates the physical state of all dynamic objects in the game and
moves all objects to their end of frame positions, updates all necessary
object velocities, and calls all collision event handlers.
*/
void Physics::update(Game *game)
{
// WE'LL USE A CONTINUOUS COLLISION SYSTEM TO ENSURE TEMPORAL
// COHERENCE, WHICH MEANS WE'LL MAKE SURE COLLISIONS ARE RESOLVED
// IN THE ORDER WITH WHICH THEY HAPPEN. WE DON'T WANT GAME EVENTS
// TO APPEAR TO HAPPEN IN THE WRONG ORDER. WE'LL TRY TO MAKE IT
// A LITTLE MORE EFFICIENT BY EMPLOYING A VARIATION ON THE
// SWEEP AND PRUNE ALGORITHM FOR DYNAMIC-DYNAMIC OBJECT COLLISIONS
// IN CASE WE'RE DOING THE ONE UPDATE STEP AT A TIME
// THIS MAKES SURE THE UPDATE DOESN'T GET CALLED AGAIN
// NEXT FRAME WITHOUT THE USER EXPLICITY REQUESTING IT
// BY PRESSING THE 'T' KEY (for Time sTep)
activatedForSingleUpdate = false;
// WE'LL NEED THE WORLD TO ACCESS THE SPRITES AND WORLD LAYERS
GameStateManager *gsm = game->getGSM();
World *world = gsm->getWorld();
// NOTE THAT WE MAKE SURE THE activeCollisions VECTOR IS
// EMPTIED BEFORE THIS METHOD EXITS, SO WE CAN ASSUME
// IT'S EMPTY NOW. activeCollisions CONTAINS ALL THE COLLISIONS
// EMPTIED BEFORE THIS METHOD EXITS, SO WE CAN ASSUME
// IT'S EMPTY NOW. activeCollisions CONTAINS ALL THE COLLISIONS
// DETECTED SO FAR THIS FRAME. THESE ARE THE THINGS WE MUST
// RESOLVE.
// START THE CLOCK AT 0, THAT MEANS 0% OF THE WAY THROUGH THE FRAME.
// NOTE THAT TIME 0 IS THE MOST DANGEROUS TIME FOR DETECTING COLLISIONS
// BECAUSE THEY CAN BE EASILY OVERLOOKED. THE SAME FOR SIMULTANEOUS
// COLLISIONS. TO MINIMIZE RIGID BODY PENETRATION, SUCH CIRCUMSTANCES
// ARE TYPICALLY HANDLED AS SPECIAL CASES
currentCollisionTime = 0.0f;
// FIRST WE NEED TO DO COLLISION TESTING PREP WORK FOR SPRITES
// APPLY ACCELERATION AND GRAVITY TO VELOCITY
// INIT TILE COLLISION INFO
// SET ON TILE LAST FRAME USING ON TILE THIS FRAME
// SET ON TILE THIS FRAME TO FALSE
// GET COLLISIONS WITH ALL TILES TO HAPPEN DURING THIS FRAME
// PUT THESE COLLISIONS INTO A SORTABLE DATA STRUCTURE
// INIT SPRITE'S SWEPT SHAPE INFO
// FOR ALL SPRITES, INCLUDING THE BOTS AND PLAYER
vector<CollidableObject*>::iterator spritesIt = sortedSweptShapes[LEFT_EDGE]->begin();
while (spritesIt != sortedSweptShapes[LEFT_EDGE]->end())
{
CollidableObject *sprite = (*spritesIt);
prepSpriteForCollisionTesting(world, sprite);
getAllTileCollisionsForAGivenSprite(world, sprite, 1.0f);
spritesIt++;
}
// PREPARE FOR SPRITE-SPRITE COLLISION TESTING
// SWEEP AND PRUNE DATA STRUCTURES PREP WORK
// SORT S_AND_P VECTOR SORTED BY START X OF SWEPT SHAPE
// SORT S_AND_P VECTOR SORTED BY END X OF SWEPT SHAPE
// WE DON'T NEED THE Y-AXIS SORTED, BUT WOULD IF THIS
// WERE A 3D SYSTEM TO SAVE ON COMPARISONS.
// WE'RE USING C++'s STL sort METHOD AND ARE PROVIDING
// A CUSTOM MEANS FOR COMPARISON
sort(sortedSweptShapes[LEFT_EDGE]->begin(), sortedSweptShapes[LEFT_EDGE]->end(), SweptShapesComparitorByLeft());
sort(sortedSweptShapes[RIGHT_EDGE]->begin(), sortedSweptShapes[RIGHT_EDGE]->end(), SweptShapesComparitorByRight());
// RECORD SORTED POSITIONS WITH EACH SPRITE. THEY NEED TO KNOW WHERE
// THEY ARE IN THOSE DATA STRUCTURES SUCH THAT WE CAN JUMP INTO
// THOSE DATA STRUCTURES TO TEST COLLISIONS WITH NEIGHBORS
updateSweptShapeIndices();
// YOU'LL NEED TO TEST FOR SPRITE-TO-SPRITE COLLISIONS HERE
// *** LOOP STARTS HERE. WE'LL DO THIS UNTIL THERE ARE NO
// MORE COLLISIONS TO RESOLVE FOR THIS FRAME
while (activeCollisions.size() > 0)
{
// SORT COLLISION OBJECTS BY TIME OF COLLISION
// NOTE THAT I'M JUST EMPLOYING THE STL'S List
// CLASS' SORT METHOD BY PROVIDING MY OWN
// MEANS FOR COMPARING Collision OBJECTS
activeCollisions.sort(CollisionComparitor());
// GET FIRST COLLISION - NOTE THAT WE HAVE THE COLLISIONS SORTED
// IN DESCENDING ORDER, SO TO TAKE THE EARLIEST ONE, WE REMOVE IT
// FOM THE BACK OF THE SORTED LIST
Collision *earliestCollision = activeCollisions.back();
activeCollisions.pop_back();
float collisionTime = earliestCollision->getTimeOfCollision();
// MOVE ALL SPRITES UP TO TIME OF FIRST COLLISION USING
// APPROPRIATELY SCALED VELOCITIES
moveAllSpritesUpToBufferedTimeOfCollision(earliestCollision);
// AND ADVANCE COLLISION TIME
currentCollisionTime = collisionTime;
// AND UPDATE THE VELOCITIES OF THE SPRITE(S) INVOLVED IN THE COLLISION
performCollisionResponse(earliestCollision);
// EXECUTE COLLISION EVENT CODE
// TEST TO SEE TYPES OF OBJECTS AND APPROPRIATE RESPONSE
// ACCORDING TO CUSTOMIZED COLLISION EVENT HANDLER
collisionListener->respondToCollision(game, earliestCollision);
// FOR THE TWO OBJECTS INVOLVED IN THE COLLISION
// REMOVE ALL OTHER COLLISIONS INVOLVING THEM
// SINCE THEY ARE NOW OBSOLETE. THE REASON BEING
// THE OBJECT COLLISION NOW LIKELY HAS A
// DIFFERENT VECTOR
// UPDATE THEIR SWEPT SHAPES
// TEST THEM AGAINST TILES AGAIN
CollidableObject *co1 = earliestCollision->getCO1();
CollidableObject *co2 = earliestCollision->getCO2();
removeActiveCOCollisions(co1);
co1->updateSweptShape(1.0f - currentCollisionTime);
getAllTileCollisionsForAGivenSprite(world, co1, 1.0f - currentCollisionTime);
// ONLY DO IT FOR THE SECOND ONE IF IT'S NOT A TILE
if (!earliestCollision->isCollisionWithTile())
{
removeActiveCOCollisions(co2);
co2->updateSweptShape(1.0f - currentCollisionTime);
getAllTileCollisionsForAGivenSprite(world, co2, 1.0f - currentCollisionTime);
}
else
{
spriteToTileCollisionsThisFrame[co1].insert(earliestCollision->getTile());
recycledCollidableObjectsList.push_back(co2);
}
// NOW WE NEED TO SEE IF THE SPRITES INVOLVED IN THE JUST
// RESOLVED COLLISION ARE GOING TO BE INVOLVED IN ANY MORE
// WITH OTHER SPRITES BUT WE DON'T WANT TO CHECK ALL OF THEM,
// WE ONLY WANT TO CHECK NEIGHBORS, BUT FIRST WE HAVE TO
// MAKE SURE THE SPRITE(S) THAT WE JUST RESOLVED ARE IN THEIR
// PROPER SWEPT SHAPE LOCATIONS WITHOUT HAVING TO RESORT EVERTYHING
// IF IT WAS ONLY ONE SPRITE WITH A TILE THIS IS EASY TO DO
if (earliestCollision->isCollisionWithTile())
{
reorderCollidableObject(co1);
}
// YOU'LL HAVE TO WORRY ABOUT REORDERING STUFF FOR COLLISIONS
// BETWEEN TWO SPRITES
// NOW TEST NEIGHBORS OF SPRITES INVOLVED IN RESOLVED COLLISION
// AGAINST NEIGHBORS IN SWEPT SHAPE DATA STRUCTURES. YOU'LL HAVE
// TO FIGURE OUT HOW TO DO THIS AND HOW TO RESOLVE SUCH COLLISIONS
// RECYCLE THE COLLISION SINCE WE'RE NOW DONE WITH IT
recycledCollisions.push_back(earliestCollision);
}
// APPLY THE REMAINING TIME TO MOVE THE SPRITES. NOTE THAT
// THIS IS ACTUALLY A VERY RISKY, TRICKY STEP BECAUSE IT COULD
// MOVE OBJECTS ALMOST TO THE POINT OF COLLISION, WHICH MAY THEN
// BE DETECTED ALMOST AT TIME 0 NEXT FRAME. THERE ARE OTHER TRICKY
// ISSUES RELATED TO OUR BUFFER AS WELL, SO WE CHEAT A LITTLE HERE
// AND SCALE THE TIME REMAINING DOWN A LITTE
if (currentCollisionTime < 1.0f)
moveAllSpritesToEndOfFrame();
// INIT TILE COLLISION INFO
// SET ON TILE LAST FRAME USING ON TILE THIS FRAME
// SET ON TILE THIS FRAME TO FALSE
spritesIt = sortedSweptShapes[LEFT_EDGE]->begin();
while (spritesIt != sortedSweptShapes[LEFT_EDGE]->end())
{
CollidableObject *sprite = (*spritesIt);
sprite->advanceOnTileStatus();
spritesIt++;
}
// while(!colliding){
for (b2Contact* contact = game->getbworld()->GetContactList(); contact; contact = contact->GetNext()) {
b2Body* a = contact->GetFixtureA()->GetBody();
b2Body* b = contact->GetFixtureB()->GetBody();
AnimatedSprite* c = (AnimatedSprite*) a->GetUserData();
AnimatedSprite* d = (AnimatedSprite*) b->GetUserData();
unsigned int x = c->getSpriteType()->getSpriteTypeID();
unsigned int y = d->getSpriteType()->getSpriteTypeID();
switch(x){
case 0: // player
break;
case 1: //
break;
case 2:
GarbageMon *e;
e= (GarbageMon*)c;
//co.remove(e);
//game->getbworld()->DestroyBody(e->getBody());
//e->collisionResponse(game);
break;
case 4:
//Trash *f = (Trash*)c;
//f->collisionResponse(game);
break;
}
switch(y){
// if (x == 0) {
case 0: // player
break;
case 1: //
break;
case 2:
// colliding = true;
GarbageMon *g;
g= (GarbageMon*)d;
co.push_back(g);
co.remove(g);
//g->setCurrentState(L"DYING");
g->getPhysicalProperties()->setPosition(9999.9f, 9999.9f);
game->playExplosion();
//wstring s = c->getCurrentState();
g->getBody()->ApplyLinearImpulse(b2Vec2(99999.9f, 0.0f), g->getBody()->GetPosition(), true);
//game->getbworld()->DestroyBody(g->getBody());
//g->getBody()->DestroyFixture(g->getBody()->GetFixtureList());
//g->getBody()->GetWorld()->DestroyBody(g->getBody());
g->collisionResponse(game);
//colliding = false;
break;
case 5:
Trash *h = (Trash*)d;
co.remove(h);
//h->collisionResponse(game);
break;
}
}
//}
//}
//update sprites according to box2d thingies
list<CollidableObject*>::iterator i = co.begin();
while (i != co.end()) {
CollidableObject* c = *i;
PhysicalProperties* p = c->getPhysicalProperties();
p->setX(c->getBody()->GetPosition().x * pikachu);
p->setY(c->getBody()->GetPosition().y * pikachu);
i++;
}
float32 time = 1.0f/1.25f;
int32 vel = 8;
int32 pos = 3;
game->getbworld()->Step (time, vel, pos);
for (b2Contact* contact = game->getbworld()->GetContactList(); contact; contact = contact->GetNext()) {
b2Fixture* a = contact->GetFixtureA();
b2Fixture* b = contact->GetFixtureB();
AnimatedSprite* a2 = (AnimatedSprite*) a->GetBody()->GetUserData();
AnimatedSprite* b2 = (AnimatedSprite*) b->GetBody()->GetUserData();
if(a2->getSpriteType()->getSpriteTypeID() == 0 && b2->getSpriteType()->getSpriteTypeID() == 2){
b->GetBody()->ApplyLinearImpulse(a->GetBody()->GetWorldVector(b2Vec2(0,-2)), b->GetBody()->GetPosition(), true);
b->GetBody()->SetLinearVelocity(b2Vec2 (0,0));
SpriteManager *sm = game->getGSM()->getSpriteManager();
int health = (int) _wtoi(sm->getHealthBar()->getCurrentState().c_str());
if (health <= 10){
// WHEN PLAYER RUNS OUT OF HEALTH, SKIP TO NEXT DAY
// PENALTY LIES IN THE PLAYER NOT ACHIEVING THE DAY'S GOALS
// AND HAVE TO SUFFER INCREASE IN POLLUTION BAR
sm->getHealthBar()->setCurrentState(to_wstring(100));
}
else{
//OutputDebugStringW(L"HI");
sm->getHealthBar()->setCurrentState(to_wstring(health - 10));
}
}
//contact->GetFixtureB()->GetBody()->DestroyFixture(a);
}
// WE'RE NOT GOING TO ALLOW MULTIPLE COLLISIONS TO HAPPEN IN A FRAME
// BETWEEN THE SAME TWO OBJECTS
spriteToTileCollisionsThisFrame.clear();
}
int OrthographicGridPathfinder::getGridHeight()
{
GameStateManager *gsm = game->getGSM();
World *world = gsm->getWorld();
return world->getWorldHeight()/numRows;
}
int OrthographicGridPathfinder::getGridWidth()
{
GameStateManager *gsm = game->getGSM();
World *world = gsm->getWorld();
return world->getWorldWidth()/numColumns;
}
void OrthographicGridPathfinder::buildPath( list<PathNode> *pathToFill,
float startX, float startY,
float endX, float endY)
{
// SO BUILD THE PATH
pathToFill->clear();
vector<bool> *pathGridPointer = &pathGrid;
GameStateManager *gsm = game->getGSM();
World *world = gsm->getWorld();
int gridWidth = getGridWidth();
int gridHeight = getGridHeight();
// DETERMINE THE START COLUMN AND START ROW
int startColumn = (int)(startX/gridWidth);
int startRow = (int)(startY/gridHeight);
// DETERMINE THE END COLUMN AND END ROW
int endColumn = (int)(endX/gridWidth);
int endRow = (int)(endY/gridHeight);
// IF THE DESTINATION IS A COLLIDABLE TILE LOCATION
// THEN EXIT
int endIndex = getGridIndex(endColumn, endRow);
bool endIndexIsWalkable = pathGrid[getGridIndex(endColumn, endRow)];
if (!endIndexIsWalkable)
return;
map<int, PathNode> openNodes;
map<int, PathNode> closedNodes;
// list<PathNode> openList;
// list<PathNode> closedList;
bool pathFound = false;
bool nodesToAdd[9];
PathNode startNode;
startNode.column = startColumn;
startNode.row = startRow;
startNode.parentNode = NULL;
startNode.G = 0;
PathNode endNode;
endNode.column = endColumn;
endNode.row = endRow;
endNode.parentNode = NULL;
startNode.H = calculateH(startNode, &endNode);
// openList.push_back(startNode);
int nodeIndex = getGridIndex(startColumn, startRow);
openNodes[nodeIndex] = startNode;
while (!pathFound)
{
// IF THERE ARE NO MORE NODES TO SEARCH THROUGH TO FIND
// OUR DESTINATION THEN WE'RE DONE
// if (openList.size() == 0)
if (openNodes.size() == 0)
{
pathToFill->clear();
return;
}
// FIRST GET THE CLOSEST NODE FROM THE OPEN LIST
// PathNode *foundNode = findCheapestNode(&openList);
PathNode *foundNode = findCheapestNode(&openNodes);
PathNode cheapestNode;
cheapestNode.column = foundNode->column;
cheapestNode.row = foundNode->row;
cheapestNode.G = foundNode->G;
cheapestNode.H = foundNode->H;
cheapestNode.parentNode = foundNode->parentNode;
// removeNodeFromList(&cheapestNode, &openList);
openNodes.erase(getGridIndex(cheapestNode.column, cheapestNode.row));
// IS THE CHEAPEST NODE THE DESTINATION?
if ((cheapestNode.column == endNode.column) && (cheapestNode.row == endNode.row))
{
// WE'VE REACHED THE DESTINATION
pathFound = true;
PathNode *traveller = &cheapestNode;
while (traveller != NULL)
{
PathNode nodeToAdd;
nodeToAdd.column = traveller->column;
nodeToAdd.row = traveller->row;
pathToFill->push_front(nodeToAdd);
traveller = traveller->parentNode;
}
}
else
{
// WE'LL NEED TO LOOK AT THE CHEAPEST NODE'S NEIGHBORS
// FIRST LET'S PUT IT INTO THE CLOSED LIST SO WE DON'T
// END UP IN AN INFINITELY CIRCULAR LOOP
// closedList.push_back(cheapestNode);
closedNodes[getGridIndex(cheapestNode.column, cheapestNode.row)] = cheapestNode;
// PathNode *nodeJustAdded = &closedList.back();
PathNode *nodeJustAdded = &closedNodes[getGridIndex(cheapestNode.column, cheapestNode.row)];
// NOW FIGURE OUT WHICH NEIGHBORS MIGHT BE USABLE
// findNeighborsToCheck(world, nodesToAdd, nodeJustAdded, &closedList);
findNeighborsToCheck(nodesToAdd, nodeJustAdded, &closedNodes);
// NOW ADD THE NEIGHBORS TO OUR OPEN LIST
// addNeighbors(nodesToAdd, nodeJustAdded, &endNode, &openList, &closedList);
addNeighbors(nodesToAdd, nodeJustAdded, &endNode, &openNodes, &closedNodes);
}
}
PathNode lastNode = pathToFill->back();
destinationPathfindingCell.setCenterX(getColumnCenterX(lastNode.column));
destinationPathfindingCell.setCenterY(getRowCenterY(lastNode.row));
destinationPathfindingCell.setWidth(this->getGridWidth());
destinationPathfindingCell.setHeight(this->getGridHeight());
}
void Physics::update(Game *game)
{
// REMEMBER, AT THIS POINT, ALL PLAYER INPUT AND AI
// HAVE ALREADY BEEN PROCESSED AND BOT AND PLAYER
// STATES, VELOCITIES, AND ACCELERATIONS HAVE ALREADY
// BEEN UPDATED. NOW WE HAVE TO PROCESS THE PHYSICS
// OF ALL THESE OBJECTS INTERACTING WITH EACH OTHER
// AND THE STATIC GAME WORLD. THIS MEANS WE NEED TO
// DETECT AND RESOLVE COLLISIONS IN THE ORDER THAT
// THEY WILL HAPPEN, AND WITH EACH COLLISION, EXECUTE
// ANY GAMEPLAY RESPONSE CODE, UPDATE VELOCITIES, AND
// IN THE END, UPDATE POSITIONS
// FIRST, YOU SHOULD START BY ADDING ACCELERATION TO ALL
// VELOCITIES, WHICH INCLUDES GRAVITY, NOTE THE EXAMPLE
// BELOW DOES NOT DO THAT
// FOR NOW, WE'LL JUST ADD THE VELOCITIES TO THE
// POSITIONS, WHICH MEANS WE'RE NOT APPLYING GRAVITY OR
// ACCELERATION AND WE ARE NOT DOING ANY COLLISION
// DETECTION OR RESPONSE
float timer = 0;
GameStateManager *gsm = game->getGSM();
SpriteManager *sm = gsm->getSpriteManager();
World *w = gsm->getWorld();
GameRules* gR = game->getGameRules();
vector<WorldLayer*> *layers = w->getLayers();
AnimatedSprite *player;
PhysicalProperties *pp;
TiledLayer *tL;
list<Collision*> collisions;
//finding TileLayer
for(unsigned int i = 0; i < layers->size(); i++)
{
WorldLayer *currentLayer = (*layers)[i];
if(currentLayer->hasCollidableTiles() == true)
{
tL = dynamic_cast<TiledLayer*>(currentLayer);
if(tL != 0)
{
i = layers->size();
}//end if
}//end if
}
player = sm->getPlayer();
pp = player->getPhysicalProperties();
//UPDATING ALL VELOCITIES AND DOING TILE COLLISION
pp->incVelocity(this,pp->getAccelerationX(), pp->getAccelerationY() + gravity);
collideTestWithTiles(player, tL, &collisions);
list<Bot*>::iterator botIterator = sm->getBotsIterator();
while (botIterator != sm->getEndOfBotsIterator())
{
Bot *bot = (*botIterator);
pp = bot->getPhysicalProperties();
pp->incVelocity(this, pp->getAccelerationX(), pp->getAccelerationY());
if(pp->isGravAffected() == true)
pp->incVelocity(this, 0, gravity);
collideTestWithTiles(bot, tL, &collisions);
botIterator++;
}
//HERE, COLLIDE SPRITES WITH OTHER SPRITES
collideTestWithSprites(game, player, &collisions);
botIterator = sm->getBotsIterator();
while (botIterator != sm->getEndOfBotsIterator())
{
Bot *bot = (*botIterator);
if(bot->isCurrentlyCollidable() == true);
collideTestWithSprites(game, bot, &collisions);
botIterator++;
}
//SORT COLLISIONS
collisions.sort(compare_collisionTime);
//RESOLVING ALL THE COLLISIONS
while(collisions.empty() == false)
{
Collision* currentCollision = collisions.front();
collisions.pop_front();
float colTime = currentCollision->getTOC();
CollidableObject* co1 = currentCollision->getCO1();
CollidableObject* co2 = currentCollision->getCO2();
if(colTime >= 0 && colTime <= 1)
{
pp = co1->getPhysicalProperties();
//pp->setVelocity(pp->getVelocityX()*9.99f,pp->getVelocityY()*9.99f);
pp = co2->getPhysicalProperties();
//pp->setVelocity(pp->getVelocityX()*9.99f,pp->getVelocityY()*9.99f);
pp = player->getPhysicalProperties();
pp->setPosition(pp->getX() + (pp->getVelocityX()*(colTime-timer)),pp->getY() + (pp->getVelocityY()*(colTime-timer)));
botIterator = sm->getBotsIterator();
while (botIterator != sm->getEndOfBotsIterator())
{
Bot *bot = (*botIterator);
pp = bot->getPhysicalProperties();
pp->setPosition(pp->getX() + (pp->getVelocityX()*(colTime-timer)), pp->getY() + (pp->getVelocityY()*(colTime-timer)));
botIterator++;
}
gsm->updateViewport(game, colTime-timer);
resolveCollision(game, currentCollision);
gR->gameSpecificResolve(game, currentCollision);
boolean deleteLast = false;
list<Collision*>::iterator cIterator = collisions.begin();
list<Collision*>::iterator lastIterator;
while(cIterator != collisions.end())
{
if(deleteLast == true)
{
collisions.erase(lastIterator);
}
deleteLast = false;
Collision* check = (*cIterator);
if(check->contains(co1) || check->contains(co2))
{
CollidableObject* checkStatic = check->getCO2();
if(checkStatic->isStaticObject())
{
coStackCounter ++;
coStack[coStackCounter] = checkStatic;
}
collisionStackCounter ++;
collisionStack[collisionStackCounter] = check;
lastIterator = cIterator;
deleteLast = true;
}
else
{
//check->calculateTimes();
}
cIterator++;
}
if(deleteLast == true)
{
collisions.erase(lastIterator);
}
collideTestWithTiles(co1, tL, &collisions);
collideTestWithSprites(game, co1, &collisions);
if(co2->isStaticObject() == false)
{
collideTestWithTiles(co2, tL, &collisions);
collideTestWithSprites(game, co2, &collisions);
}
collisions.sort(compare_collisionTime);
timer += (colTime-timer);
}//end if
if(co2->isStaticObject() == true)
{
coStackCounter ++;
coStack[coStackCounter] = co2;
}
collisionStackCounter ++;
collisionStack[collisionStackCounter] = currentCollision;
}
if(timer < 1)
{
gsm->updateViewport(game, 1-timer);
pp = player->getPhysicalProperties();
pp->setPosition(pp->getX() + (pp->getVelocityX()*(1-timer)),pp->getY() + (pp->getVelocityY()*(1-timer)));
//pp->setVelocity(0.0f, pp->getVelocityY());
botIterator = sm->getBotsIterator();
while (botIterator != sm->getEndOfBotsIterator())
{
Bot *bot = (*botIterator);
pp = bot->getPhysicalProperties();
pp->setPosition(pp->getX() + (pp->getVelocityX()*(1-timer)), pp->getY() + (pp->getVelocityY()*(1-timer)));
botIterator++;
}
gsm->updateViewport(game, 1-timer);
}
pp = player->getPhysicalProperties();
if(pp->getX() < 0)
{
pp->setX(0);
}
if(pp->getY() < 0)
{
pp->setY(0);
}
//pp->setVelocity(0.0f, pp->getVelocityY());
/*pp->setPosition(pp->getX() + pp->getVelocityX(), pp->getY() + pp->getVelocityY());
// FOR NOW THE PLAYER IS DIRECTLY CONTROLLED BY THE KEYBOARD,
// SO WE'LL NEED TO TURN OFF ANY VELOCITY APPLIED BY INPUT
// SO THE NEXT FRAME IT DOESN'T GET ADDED
pp->setVelocity(0.0f, pp->getVelocityY());
// AND NOW MOVE ALL THE BOTS
list<Bot*>::iterator botIterator = sm->getBotsIterator();
while (botIterator != sm->getEndOfBotsIterator())
{
Bot *bot = (*botIterator);
pp = bot->getPhysicalProperties();
pp->setPosition(pp->getX() + pp->getVelocityX(), pp->getY() + pp->getVelocityY());
botIterator++;
}*/
}
/*
This is where all game physics starts each frame. It is called each frame
by the game statem manager after player input and AI have been processed. It
updates the physical state of all dynamic objects in the game and
moves all objects to their end of frame positions, updates all necessary
object velocities, and calls all collision event handlers.
*/
void Physics::update(Game *game)
{
GameStateManager *gsm = game->getGSM();
SpriteManager *spm = gsm->getSpriteManager();
AnimatedSprite *player = spm->getPlayer();
if (once == 0) {
/* b2PolygonShape groundBox;
groundBox.SetAsBox(50.0f, 10.0f);
groundBody->CreateFixture(&groundBox, 0.0f);
*/
b2BodyDef bodyDef;
bodyDef.type = b2_dynamicBody;
bodyDef.position.Set(600, 9280);
body = world->CreateBody(&bodyDef);
b2PolygonShape dynamicBox;
dynamicBox.SetAsBox(32.0f, 32.0f);
b2FixtureDef fixtureDef;
fixtureDef.shape = &dynamicBox;
// Set the box density to be non-zero, so it will be dynamic.
fixtureDef.density = 1.0f;
// Override the default friction.
fixtureDef.friction = 0.3f;
// Add the shape to the body.
body->CreateFixture(&fixtureDef);
//body->SetLinearVelocity(b2Vec2(0,-1000));
//body->SetUserData(player);
player->setBody(body);
// This is our little game loop.
once += 1;
}
body->ApplyForce( world->GetGravity(), body->GetWorldCenter(), true );
float32 timeStep = 1.0f / 60.0f;
int32 velocityIterations = 6;
int32 positionIterations = 2;
world->Step(timeStep, velocityIterations, positionIterations);
// Now print the position and angle of the body.
b2Vec2 position = body->GetPosition();
//b2Vec2 position2 = body2->GetPosition();
float32 angle = body->GetAngle();
printf("%4.2f %4.2f %4.2f\n", position.x, position.y, angle);
if (f == 0) {
World *woorld = gsm->getWorld();
vector<WorldLayer*> *layers = woorld->getLayers();
CollidableObject *sprite = NULL;
for (int i = 0; i < woorld->getNumLayers(); i++)
{
WorldLayer *layer = layers->at(i);
if (layer->hasCollidableTiles())
{
layer->findTileCollisionsForSprite(this,sprite);
}
}
f++;
}
if (player->getinvincible() == true) {
if (invincibletimer == 0) {
invincibletimer = 100;
}
invincibletimer -= 1;
if (invincibletimer == 0) {
player->setinvincible(false);
}
}
if (z!=0)z--;
if (z==0)
if (player->getinvincible() == false)
for (b2ContactEdge* edge = body->GetContactList(); edge; edge = edge->next)
if (edge->contact->IsTouching()) {
z=50;
if(game->getPlayerLife() > 0)
{game->decreasePlayerLife();
PlaySound(L"data/sounds/explosion.wav", NULL, SND_FILENAME|SND_SYNC);}
else
{
if(game->getLives() > 1) {
game->decreaseLives();
}
else if(game->getLives() == 1 && game->getPlayerLife() == 0)
{
GameStateManager *gsm = game->getGSM();
once = 0;
//body->SetTransform(b2Vec2((600-position.x),(9280-position.y)),body->GetAngle());
Viewport *viewport = game->getGUI()->getViewport();
viewport->setViewportX(0);
viewport->setViewportY(8880);
gsm->gameOver();
PlaySound(L"data/sounds/end.wav", NULL, SND_FILENAME|SND_SYNC);
}
game->setPlayerLife();
}
}
/*if (f > 0)
{
if(game->getPlayerLife() > 0)
game->decreasePlayerLife();
else
{
if(game->getLives() > 1)
game->decreaseLives();
else if(game->getLives() == 1 && game->getPlayerLife() == 0)
{
GameStateManager *gsm = game->getGSM();
gsm->setCurrentGameState(GS_GAME_OVER);
}
game->setPlayerLife();
}
}*/
//OutputDebug(L"My output string.");
// activatedForSingleUpdate = false;
//// WE'LL NEED THE WORLD TO ACCESS THE SPRITES AND WORLD LAYERS
//World *woorld = gsm->getWorld();
//currentCollisionTime = 0.0f;
//// FOR ALL SPRITES, INCLUDING THE BOTS AND PLAYER
//vector<CollidableObject*>::iterator spritesIt = sortedSweptShapes[LEFT_EDGE]->begin();
//while (spritesIt != sortedSweptShapes[LEFT_EDGE]->end())
//{
// CollidableObject *sprite = (*spritesIt);
// prepSpriteForCollisionTesting(woorld, sprite);
// getAllTileCollisionsForAGivenSprite(woorld, sprite, 1.0f);
// spritesIt++;
//}
//// PREPARE FOR SPRITE-SPRITE COLLISION TESTING
// // SWEEP AND PRUNE DATA STRUCTURES PREP WORK
// // SORT S_AND_P VECTOR SORTED BY START X OF SWEPT SHAPE
// // SORT S_AND_P VECTOR SORTED BY END X OF SWEPT SHAPE
// // WE DON'T NEED THE Y-AXIS SORTED, BUT WOULD IF THIS
// // WERE A 3D SYSTEM TO SAVE ON COMPARISONS.
//// WE'RE USING C++'s STL sort METHOD AND ARE PROVIDING
//// A CUSTOM MEANS FOR COMPARISON
//sort(sortedSweptShapes[LEFT_EDGE]->begin(), sortedSweptShapes[LEFT_EDGE]->end(), SweptShapesComparitorByLeft());
//sort(sortedSweptShapes[RIGHT_EDGE]->begin(), sortedSweptShapes[RIGHT_EDGE]->end(), SweptShapesComparitorByRight());
//
//// RECORD SORTED POSITIONS WITH EACH SPRITE. THEY NEED TO KNOW WHERE
//// THEY ARE IN THOSE DATA STRUCTURES SUCH THAT WE CAN JUMP INTO
//// THOSE DATA STRUCTURES TO TEST COLLISIONS WITH NEIGHBORS
//updateSweptShapeIndices();
//// YOU'LL NEED TO TEST FOR SPRITE-TO-SPRITE COLLISIONS HERE
//// *** LOOP STARTS HERE. WE'LL DO THIS UNTIL THERE ARE NO
//// MORE COLLISIONS TO RESOLVE FOR THIS FRAME
//while (activeCollisions.size() > 0)
//{
// // SORT COLLISION OBJECTS BY TIME OF COLLISION
// // NOTE THAT I'M JUST EMPLOYING THE STL'S List
// // CLASS' SORT METHOD BY PROVIDING MY OWN
// // MEANS FOR COMPARING Collision OBJECTS
// activeCollisions.sort(CollisionComparitor());
// // GET FIRST COLLISION - NOTE THAT WE HAVE THE COLLISIONS SORTED
// // IN DESCENDING ORDER, SO TO TAKE THE EARLIEST ONE, WE REMOVE IT
// // FOM THE BACK OF THE SORTED LIST
// Collision *earliestCollision = activeCollisions.back();
// activeCollisions.pop_back();
// float collisionTime = earliestCollision->getTimeOfCollision();
// // MOVE ALL SPRITES UP TO TIME OF FIRST COLLISION USING
// // APPROPRIATELY SCALED VELOCITIES
// moveAllSpritesUpToBufferedTimeOfCollision(earliestCollision);
// // AND ADVANCE COLLISION TIME
// currentCollisionTime = collisionTime;
// // AND UPDATE THE VELOCITIES OF THE SPRITE(S) INVOLVED IN THE COLLISION
// performCollisionResponse(earliestCollision);
// // EXECUTE COLLISION EVENT CODE
// // TEST TO SEE TYPES OF OBJECTS AND APPROPRIATE RESPONSE
// // ACCORDING TO CUSTOMIZED COLLISION EVENT HANDLER
// collisionListener->respondToCollision(game, earliestCollision);
// CollidableObject *co1 = earliestCollision->getCO1();
// CollidableObject *co2 = earliestCollision->getCO2();
// removeActiveCOCollisions(co1);
// co1->updateSweptShape(1.0f - currentCollisionTime);
// getAllTileCollisionsForAGivenSprite(woorld, co1, 1.0f - currentCollisionTime);
// // ONLY DO IT FOR THE SECOND ONE IF IT'S NOT A TILE
// if (!earliestCollision->isCollisionWithTile())
// {
// removeActiveCOCollisions(co2);
// co2->updateSweptShape(1.0f - currentCollisionTime);
// getAllTileCollisionsForAGivenSprite(woorld, co2, 1.0f - currentCollisionTime);
// }
// else
// {
// spriteToTileCollisionsThisFrame[co1].insert(earliestCollision->getTile());
// recycledCollidableObjectsList.push_back(co2);
// }
//
// // IF IT WAS ONLY ONE SPRITE WITH A TILE THIS IS EASY TO DO
// if (earliestCollision->isCollisionWithTile())
// {
// reorderCollidableObject(co1);
// }
// // YOU'LL HAVE TO WORRY ABOUT REORDERING STUFF FOR COLLISIONS
// // BETWEEN TWO SPRITES
//
// // NOW TEST NEIGHBORS OF SPRITES INVOLVED IN RESOLVED COLLISION
// // AGAINST NEIGHBORS IN SWEPT SHAPE DATA STRUCTURES. YOU'LL HAVE
// // TO FIGURE OUT HOW TO DO THIS AND HOW TO RESOLVE SUCH COLLISIONS
//
// // RECYCLE THE COLLISION SINCE WE'RE NOW DONE WITH IT
// recycledCollisions.push_back(earliestCollision);
//}
//// APPLY THE REMAINING TIME TO MOVE THE SPRITES. NOTE THAT
//// THIS IS ACTUALLY A VERY RISKY, TRICKY STEP BECAUSE IT COULD
//// MOVE OBJECTS ALMOST TO THE POINT OF COLLISION, WHICH MAY THEN
//// BE DETECTED ALMOST AT TIME 0 NEXT FRAME. THERE ARE OTHER TRICKY
//// ISSUES RELATED TO OUR BUFFER AS WELL, SO WE CHEAT A LITTLE HERE
//// AND SCALE THE TIME REMAINING DOWN A LITTE
//if (currentCollisionTime < 1.0f)
// moveAllSpritesToEndOfFrame();
//// INIT TILE COLLISION INFO
//// SET ON TILE LAST FRAME USING ON TILE THIS FRAME
//// SET ON TILE THIS FRAME TO FALSE
//spritesIt = sortedSweptShapes[LEFT_EDGE]->begin();
//while (spritesIt != sortedSweptShapes[LEFT_EDGE]->end())
//{
// CollidableObject *sprite = (*spritesIt);
// sprite->advanceOnTileStatus();
// spritesIt++;
//}
//// WE'RE NOT GOING TO ALLOW MULTIPLE COLLISIONS TO HAPPEN IN A FRAME
//// BETWEEN THE SAME TWO OBJECTS
//spriteToTileCollisionsThisFrame.clear();
//
}
