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

List:       kde-devel
Subject:    Re: Which data structure for random deletion?
From:       Dirk Mueller <mueller () kde ! org>
Date:       2002-02-01 16:56:01
[Download RAW message or body]

On Don, 31 Jan 2002, Erik Sigra wrote:

> I will chose a random index between 0 and N - 1 and perform an operation on 
> items[index]. This should be repeated K times (while N decreases). 
> Items[index] must be removed from the container so that it will not be chosen 
> again.

A dictionary and a map is fast for both lookup and deletion. 


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