Hi,

Suppose I have a collection of elements that I will create once at the 
beginining, visit in an unknown order and delete one by one when they are 
visited.
What is the most efficient data structure for this in julia?

I believe this would be an unordered_set (C++) or HashSet (java?), i.e. a 
Set implemented via a dictionary. (But I am not a computer scientist, so 
please correct me if I am wrong!)
Should I in fact, then, just use a "Set" in julia?

If, instead, I can add *and* remove elements in a "random" way, is the 
answer the same?

Thanks,
David.

Reply via email to