Implementation of LFU Cache with O(1) operations
-
Updated
Jul 25, 2019 - C++
Implementation of LFU Cache with O(1) operations
C++ header-only library for software based caches
A toy implementation of cache using FILO, FIFO, LRU and LFU policies in C++.
This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.
Step20 is a C++20, header-only library of STL-like algorithms and data structures
This C++ program utilizes SFML library to visualize the LRU LFU cache. It demonstrates adding and retrieving key-value pairs, and dynamically updates the cache visualization. The operations are done by Queue. Here queue is implemented using a doubly linked list.
DSAP Course Assignments 2022-2023
C++ cache with LRU/LFU/FIFO policies implementation
Add a description, image, and links to the lfu-cache topic page so that developers can more easily learn about it.
To associate your repository with the lfu-cache topic, visit your repo's landing page and select "manage topics."