|
Boost : |
From: Nigel Stewart (nigels_at_[hidden])
Date: 2003-06-11 11:36:10
> This strikes me as a good compromise. For one thing, it leaves the
> door open to inserting in a manner that resizes the capacity. (Except
> for the problem that if the buffer is full, every insert will require O(n)
> time)
I later realised an important point: insert will be O(n)
anyway, given the need to make room for the inserted items.
So, it seems that allowing automatic resizing in this
case does not cost anything in terms of performence
implications.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk