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.
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:
Any further tips appreciated! thanks!
You showed up just in time for the waffles! And this tiny ad:
Building a Better World in your Backyard by Paul Wheaton and Shawn Klassen-Koop