A special constructor is provided to create a linked hash map whose order of iteration is the order in which its entries were last accessed, from least-recently accessed to most-recently (access-order). This kind of map is well-suited to building LRU caches.
Does LinkedHashSet also has the same facility ? According to Kathy and Bert's book they say that you can access elements by two ways in LinkedHashSet : one by insertion order and other by last accessorder . How can you use that ?