Hmm, good point. :)
Okay, so I guess the fact that MemCopy is faster is relatively moot except for rare cases where you're downsizing an array and only removing elements that you *know* are empty.
Lucky for me, that's exactly what I'm doing. ;) It's actually (potentially, depending on my hash table size) a lot faster than looping through the table to get the correct # of elements and initiating the array to the 'correct' size. I kill an unnecessary loop and replace it with a fast MemCopy.
Okay, so I guess the fact that MemCopy is faster is relatively moot except for rare cases where you're downsizing an array and only removing elements that you *know* are empty.
Lucky for me, that's exactly what I'm doing. ;) It's actually (potentially, depending on my hash table size) a lot faster than looping through the table to get the correct # of elements and initiating the array to the 'correct' size. I kill an unnecessary loop and replace it with a fast MemCopy.