title: Implementing a concurrent LinkedHashMap
body: <p>I'm trying to create a concurrent LinkedHashMap for a multithreaded architecture.</p>
  
  <p>If I use <code>Collections#synchronizedMap()</code>, I would have to use synchronized blocks for iteration. This implementation would lead to sequential addition of elements.</p>
  
  <p>If I use <code>ConcurrentSkipListMap</code> is there any way to implement a <code>Comparator</code> to store sequentially, as stored in Linked List or queue.</p>
  
  <p>I would like to use java's built in instead of third party packages.</p>
  
  <p>EDIT:</p>
  
  <p>In this concurrent <code>LinkedHashMap</code>, if the keys are the name, I wish to put the keys in sequence of their arrival. i.e. new value would be appended to either at start or end, but sequentially.</p>
  
  <p>While iterating, the <code>LinkedHashMap</code> could be added with new entries, or removed. but the iteration should be the sequence in which the entries were added.</p>
  
  <p>I understand that by using <code>Collections#synchronizedMap()</code>, an synchronized block for iteration would have to be implemented, but would the map be modifiable (entries could be added/removed) while it is being iterated.</p>