Lets rethink about update function again
Lets make this function fast, but specific optimizations to this program.
- what can we say is true about the update function?
2 things that are true
- the head of the array is the only bullet that can collide with other bullet or player
- we have combined both arrays into one
lets use this information and craft a better update function
- lets come up with three rules that make sense for our game
- if b && b2 exists, only check bullet collision
- if b check p2 collision
- if b2 check p collision
branch off of fto
git checkout -b blazingly-fast
It may have made a difference, perhaps a tiny one
why would we want to do this? how can you apply this?
- should we try for more?