This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
The program compiles but without using "removeEldestEntry", I am not sure if it should be inheriting a size() from HashMap, or whether I need to implement one, and if so what it should contain.
Perhaps I also need a different constructor for the LinkedHashMap. I have searched the ranch and web I have not found a clear example.
I think it should get called automatically from the put method on line 21.
Joined: May 18, 2009
I've worked it out - though not 100% clear as to how it works. It appears the method needs to be within the constructor of LinkedHashMap.
Also the third argument in the constructor pertaining to the sort order has to be false.
Working version that keeps the last five entries only: