Overview

The LRU (Least Recently Used) Cache System is a high-performance cache implemented in C++17. It provides O(1) average-time complexity for insertion, retrieval, and deletion by combining a hash map with a doubly linked list. The system is designed to efficiently manage limited memory while ensuring fast data access.

Key Features

O(1) average-time get() and put() operations.
Automatic eviction of the least recently used cache entry.
Thread-safe implementation using mutex-based synchronization.
Modular and object-oriented C++ design.
Configurable cache capacity for flexible deployment.

Technologies Used

Language: C++17
Data Structures: unordered_map, std::list
Concepts: Object-Oriented Programming, Multithreading, Synchronization

Applications

Database query caching
Web server and API response caching
File system and browser caching
High-performance backend applications

Outcome

The project demonstrates the implementation of an efficient, scalable, and thread-safe caching mechanism using modern C++ programming practices, making it suitable for performance-critical software systems.