Container Classes

[Boudewijn Rempt]

On Wednesday 29 June 2005 13:43, Michael Thaler wrote:
> Hello,
>
> to optimize the scaling code further, I want to store the numbers of the
> rows we have read at step n. At the step n+1 I first want to check if we
> already read the row and if not, read it using readBytes. Now I have to
> store the numbers of rows in some container and do a lookup if we already
> read that row. These lookups should of course be quite quick. Also
> inserting and removing elements should be fast. Most of the time I remove
> the first element and remove the last one, but not always. And of course
> every element should be only stored in the container once. What is the best
> container class to do that? I looked at QValueList and QValueVector. Or are
> there any STL classes that are better. For enlarging the image, I will at
> most have 7 lines, so I have only seven elements. For scaling down it can
> be fwidth / yscale * 2 + 1 elements, so it can be more.

I think that QValueList would work best here.

-- 
Boudewijn Rempt 
http://www.valdyas.org/fading/index.cgi
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: not available
Url : http://mail.kde.org/pipermail/kimageshop/attachments/20050629/471f01ec/attachment.pgp