I came across this Stackoverflow question where the fellow user was trying to implement a LRU cache with must join. As I am a beginner in C++ I am struggling to implement and check how a may-join might work for a LRU cache. The resources for learning about this topic is very limited and I would be grateful if someone could help me out with this as it's hard to learn and code whilst having a full time job. Any help would be appreciated.
I understood the must join part but currently struggling with may join for over 2 months.
The code is present in the link above and I haven't copied the code here as it might be a plagiarism from my part. Kindly help with the code or refer to some good materials. Thank you
This link might help for a deep understanding. https://www.rw.cdl.uni-saarland.de/people/reineke/private/talks/cachesInWCETAnalysis.pdf