What data structure discards the oldest item when a new one is added?
<p>I've been trying to remember this and it's driving me crazy.</p>

<p>Basically, it's like a small array, of let's say size five, and as you add items it starts to fill up. When it's full, and you add a new item, the oldest one (first added) is removed.</p>

<p>You can access the values by something like variable[0], variable[1] etc, where variable [0] is the oldest value, and variable 4 the newest.</p>

<p>Any ideas on what this is called? Is it a standard C++ type, or did I just see it somewhere as a custom class?</p>
