Which data structure from the Concurrent collections package will be suitable for implementing an address book?
Asked
Active
Viewed 620 times
0
-
what language? If java then ConcurrentSkipListMap. – Justin Nov 27 '13 at 13:42
-
1java_geek sounds like java. – erbdex Nov 27 '13 at 13:54
-
1What does your data look like? Which operations do you want to support (and how efficiently)? Which one do you think is the most suitable (and why)? – Bernhard Barker Nov 27 '13 at 14:04
-
I would infact use a Trie. Is there some data structure similar to trie in the concurrent package? – java_geek Nov 27 '13 at 14:55
-
@Dukeling : Basically want to add/delete/edit/search entries in my address book – java_geek Nov 27 '13 at 15:21
-
depends on how you'll use it. if only by name, HashMap-away! if also wanna sort/search, do a TreeSet-- s tree structure backed by HashMap – Roam Nov 30 '13 at 07:53