Printable View
Let's say I have a 2D array, that has 10 rows, and new rows keep coming into the program. When a new row comes in, I want all the rows to be moved up one index number, and have the oldest one removed from the array. Is there a single function, or a simple way to do this, or am I going to have to do a whole bunch of swapping?
You could also do a modified sort of linked list thing... with a permanent head node that doesn't actually store data, but is just a pointer to the first dynamically allocated node. When you get a new "row" you could create a new node for it, stick it on the end, and then change the head node to point at the second node in the list and delete the first... making the second the first. That was confusing. It would also require a lot of calls to new and delete if you're doing this a lot. Salem's way might be better - I didn't take time to really read his code carefully. It probably depends on how much you are going to be doing this.
.... About 25 times per second... I'll try Salem's way....Quote:
It probably depends on how much you are going to be doing this.
Why not use a vector? push_front and erase come to mind and the rest is done for you.
That's not a bad idea. Having a 1d array of classes would actually solve a lot of other problems for me.