Does java have a “LinkedConcurrentHashMap” data structure?

by

You can wrap the map in a Collections.synchronizedMap to get a synchronized hashmap that maintains insertion order. This is not as efficient as a ConcurrentHashMap (and doesn’t implement the extra interface methods of ConcurrentMap) but it does get you the (somewhat) thread safe behavior.

Even the mighty Google Collections doesn’t appear to have solved this particular problem yet. However, there is one project that does try to tackle the problem.

I say somewhat on the synchronization, because iteration is still not thread safe in the sense that concurrent modification exceptions can happen.

More Related Contents:

  1. How does array work? How to create a basic array data structure using java? [closed]
  2. Data Structure in Java
  3. How to check if an integer is in a set of given ranges? [closed]
  4. How to implement a tree data-structure in Java?
  5. JTable design to synchronize with back-end data-structure
  6. How to print binary tree diagram in Java?
  7. How to implement a Map with multiple keys? [duplicate]
  8. How to detect a loop in a linked list?
  9. How would you implement an LRU cache in Java?
  10. How do I create a Linked List Data Structure in Java? [closed]
  11. What is the best way to combine two lists into a map (Java)?
  12. Why should I use Deque over Stack?
  13. JAXB: How should I marshal complex nested data structures?
  14. Data structures that can map a range of keys to a value
  15. What are the time complexities of various data structures?
  16. How to create a 2 way map in java
  17. Trie data structures – Java [closed]
  18. Why doesn’t java.util.Set have get(int index)?
  19. Java: Avoid inserting duplicate in arraylist
  20. Anagram algorithm in java
  21. Sample Directed Graph and Topological Sort Code [closed]
  22. ArrayList Vs LinkedList
  23. When to use a List over an Array in Java?
  24. LRU cache in Java with Generics and O(1) operations
  25. Time Complexity for Java ArrayList
  26. Automatically sorted by values map in Java
  27. Hash : How does it work internally?
  28. Trie vs. suffix tree vs. suffix array
  29. How to implement a Median-heap
  30. The simplest algorithm for poker hand evaluation

Leave a Comment