A modern programming language that makes developers happier.

kotlinlang

I was thinking of Comparables, but that may not be so efficient, or binary searching, but I've also never used either in Kotlin and wouldn't know how's the best way to do this...

Wow, I'm trying to figure out how to do even an not-so-efficient implementation.. I still don't have it... is the case I stated too complicated to understand? Should I explain better? I know the cache should somehow be sorted first.. and that could be done using comparable, but to resolve the second criteria is bit difficult...