[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-devel
Subject:    Re: Which data structure for random deletion?
From:       Rob Kaper <cap () capsi ! com>
Date:       2002-01-31 12:57:30
[Download RAW message or body]

On Thursday 31 January 2002 12:56, Adriaan de Groot wrote:
> Do it backwards: use a QList<int> or QList<index_t> and fill the list
> first with K distinct elements. Since that list is short compared to the
> list of size N, operations on it are relatively quick.

QPtrList for KDE3/Qt3, though.

Rob
-- 
Rob Kaper     | "They that can give up essential liberty to obtain a little
cap@capsi.com | temporary safety deserve neither liberty nor safety."
www.capsi.com | - Benjamin Franklin, Historical Review of Pennsylvania, 1759

>> Visit http://mail.kde.org/mailman/listinfo/kde-devel#unsub to unsubscribe <<
[prev in list] [next in list] [prev in thread] [next in thread]