[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:       Thiago Macieira <thiagom () wanadoo ! fr>
Date:       2003-05-04 20:17:18
[Download RAW message or body]

[Attachment #2 (multipart/signed)]


Luis Pedro Coelho wrote:
>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).

SGI STL has std::hashset. You could check for its availability.

-- 
  Thiago Macieira  -  Registered Linux user #65028
   thiagom@mail.com           
    ICQ UIN: 1967141   PGP/GPG: 0x6EF45358; fingerprint:
    E067 918B B660 DBD1 105C  966C 33F5 F005 6EF4 5358

[Attachment #5 (application/pgp-signature)]

>> Visit http://mail.kde.org/mailman/listinfo/kde-devel#unsub to unsubscribe <<


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