ok i think i already got my question answered. but for the sake of curiosity, here is what im doing: im trying to make a collision detection using grids. each grid will contain objects(which each has about 20 variables) that will hold which object(s) has its part in that grid. so these objects will move around, and before each frame is drawn, each grid will be checked for collision detection.
so basically, (i think) how fast you add/remove/find objects from a vector really affect the performance of my program. if you have any better idea to implement it, feel free to correct me :) thanks in advance :) --- On Mon, 4/20/09, Paul Herring <[email protected]> wrote: > From: Paul Herring <[email protected]> > Subject: Re: [c-prog] vector of pointer > To: [email protected] > Date: Monday, April 20, 2009, 4:12 PM > On Mon, Apr 20, 2009 at 8:58 PM, Christopher Coale > <[email protected]> wrote: > > And that's exactly what the rest of you are doing - > guestimating. None > of you have any idea what the OP's program does, nor > where it spends > most of its time - and I suspect the OP doesn't either; > hence my > question. > > -- > PJH > > http://shabbleland.myminicity.com/ind > http://www.chavgangs.com/register.php?referer=9375
