thread safe data structure for get and set

Question

I find myself in need of a data structure which only needs the ability to enter objects, retrieve and delete them (I have no interest in its size and etc..). This data structure will be accessed from multiple threads both adding and getting specific objects. Currently I am using in my program a concurrent HashMap:

key = object.hashCode()
data = object

The question: I was wondering this is the best way to go ?

Note:

I do not add any object twice
the only hashMap methods i use are get, put, remove.

Thanks alot!

ConcurrentHashMap is the way to go – MeBigFatGuy Dec 19 '16 at 13:58 — MeBigFatGuy, Dec 19 '16 at 13:58

score 0 · Accepted Answer · edited May 23 '17 at 12:30

0

Have a look at java.util.concurrent.atomic package.

A small toolkit of classes that support lock-free thread-safe programming on single variables.

AtomicReference is one solution.

Refer to related SE question:

When to use AtomicReference in Java?

edited May 23 '17 at 12:30

Community

1
1

answered Dec 19 '16 at 14:00

Ravindra babu

37,698
11
250
211

couldn't edit comment sorry. correct me if i am wrong, you propose to wrap the hashMap with atomic reference? – Gal Sheldon Dec 19 '16 at 14:30
Yes. Exactly. Replace String with your data structure. – Ravindra babu Dec 19 '16 at 15:04

score -1 · Answer 2 · answered Dec 19 '16 at 13:58

-1

You could use a HashTable what is a thread safe version of HashMap. https://docs.oracle.com/javase/7/docs/api/java/util/Hashtable.html

answered Dec 19 '16 at 13:58

shalama

1,133
1
11
25

thread safe data structure for get and set

2 Answers2