title: Why doesn't LinkedHashMap provide access by index?
body: <p>From Javadoc:<br>
  <code>Hash table and linked list implementation of the Map interface, with predictable iteration order. This implementation differs from HashMap in that it maintains a doubly-linked list running through all of its entries.</code>  </p>
  
  <p>If it is so, then why doesn't it provide object access like List in java, 
  list.get(index);</p>
  
  <p><strong>UPDATE</strong></p>
  
  <p>I had implemented LRU Cache using LinkedHashMap. My algorithm required me to access LRU Object from the cache. That's why I required random access, but I think that will cost me bad performance, so I have changed the logic and I am accessing the LRU object just when Cache is full...using removeEldestEntry()</p>
  
  <p>Thank you all...</p>