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

List:       kde-devel
Subject:    Re: (followup) Re: [despammed] Best way to recursive folders?
From:       Luis Pedro Coelho <luis_pedro () netcabo ! pt>
Date:       2003-05-04 20:04:31
[Download RAW message or body]

Le Dimanche 4 Mai 2003 21:58, Esben Mose Hansen a écrit :
> The "right" implementation would be a hash
> of list, of course, but that's probably not worth the bother unless you
> have such a hash implementation lying around.

std::set should come pretty close to this. Not O(1) of hash tables, but 
O(logN) which is already pretty good (and there are no worst-case scenarios, 
I think).

HTH,
-- 
Luis Pedro Coelho

"Technology does not always equal progress."
Douglas Coupland
 
>> Visit http://mail.kde.org/mailman/listinfo/kde-devel#unsub to unsubscribe <<

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