How bisman-singh/lru-cache works
This is a small C++17 LRU-cache implementation accompanied by a runnable demonstration and benchmark. The user workflow is to launch the program, which runs basic operations, demonstrates template flexibility, then compares bounded-cache lookups with an unbounded map. The cache itself combines recency ordering and key lookup; its operations and statistics are implemented together in main.cpp, so they are represented as one component. The graph reflects the single sampled source file.
Main entry points: main.cpp Program entry
Components 7
Runtime
- Program entry
main.cpp - Basic demo
main.cpp - Template demo
main.cpp - LRU cache
main.cpp - Benchmark
main.cpp - Unbounded map
main.cpp
Other components
- User
Connections 8
- User → Program entry: runs
README.md - Program entry → Basic demo: calls
main.cpp - Program entry → Template demo: calls
main.cpp - Program entry → Benchmark: calls
main.cpp - Basic demo → LRU cache: uses
main.cpp - Template demo → LRU cache: uses
main.cpp - Benchmark → LRU cache: benchmarks
main.cpp - Benchmark → Unbounded map: compares
main.cpp