Is there an efficient way to shift a list and be guaranteed
to shift past undef'd list members? I need the numbered
insertions to keep track of events in a turn-based system,
and need to keep the list constantly shrinking so passed
events don't keep on taking memory, but the list will be
mostly empty, with probably about 5% of the members being
full. I want to avoid the need to pass by all the members
that are not defined for speed reasons.