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.
Least Frequently Used Cache implementation in O(1) implementation. First paper under the Papers We Love initiative undertaken by Web Enthusiasts Club NITK. Paper chosen and undertaken by @chinmaydd
Create a configurable two-level cache (for caching Objects). Level 1 is memory, level 2 is filesystem. Config params should let one specify the cache strategies and max sizes of level 1 and 2.
We have implemented a proxy server for web caching. We have implemented and compared 2 caching algorithms which include LRU and LFU. This was my project during course of Computer Networks at SEAS, Ahmedabad University during Monsoon 2017 (Semester 5).
Update the documentation (including godoc) to be more proper and understandable