Displaying 1 to 14 from 14 results

node-cache-manager - Cache module for Node.JS

  •    Javascript

A cache module for nodejs that allows easy wrapping of functions in cache, tiered caches, and a consistent interface. See the Express.js cache-manager example app to see how to use node-cache-manager in your applications.

memo-async-lru - Memoize Node.js style callback-last functions, using an in-memory LRU store

  •    Javascript

Memoize the given function fn, using async-lru, a simple async LRU cache supporting O(1) set, get and eviction of old keys.The function must be a Node.js style function, where the last argument is a callback.

async-lru - A simple async LRU cache supporting O(1) set, get and eviction of old keys

  •    Javascript

Since values are fetched asynchronously, the get method takes a callback, rather than returning the value synchronously.While there is a set(key, value) method to manually seed the cache, typically you'll just call get and let the load function fetch the key for you.

hyperlru - Tiny & Fast LRU Implementation as possible.

  •    Javascript

Tiny & Fast LRU Implementation as possible. There are a lot of LRU implementations, but most of them have a poor perfomance and they are hard to understand.

node-lru-cache-cluster - cluster aware lru-cache for node

  •    Javascript

cluster aware lru-cache - A cache object that deletes the least-recently-used items. If you put more stuff in it, then items will fall out.

bluecache - Read-through, in-memory, least recently used (lru) cache

  •    Javascript

First, instantiate the cache – passing options if necessary. Traditional cache "getting" and "setting" takes place within a single call, promoting functional use. The cache instance is a Promise-returning function which takes two parameters: a cache key and a priming value.

async_lru - Simple lru cache for asyncio

  •    Python

The library was donated by Ocean S.A. Thanks to the company for contribution.

Fuse - The simple generic LRU memory/disk cache for Android written in Kotlin

  •    Kotlin

Here is how you might wanna use Fuse to cache your network call. Yeah, that's about it.

tmp-cache - A least-recently-used cache manager in 35 lines of code~!

  •    Javascript

LRU caches operate on a first-in-first-out queue. This means that the first item is the oldest and will therefore be deleted once the max limit has been reached. Aside from the items & changes mentioned below, tmp-cache extends the Map class, so all properties and methods are inherited.

webcachesim - A C++11 simulator for a variety of CDN caching policies.

  •    C++

Simulate a variety of existing caching policies by replaying request traces, and use this framework as a basis to experiment with new ones. The webcachesim simulator was built for the AdaptSize project, see References for more information.

golib - Open version of common golang libraries useful to many projects.

  •    Go

A set of Apache 2.0 licensed packages comprising common library needs like an LRU cache, immutable disk maps, mmap helpers, state machines, etc...

caches - LRU, LFU, FIFO cache C++ implementations

  •    C++

Using this library is simple. It is necessary to include header with the cache implementation (cache.hpp file) and appropriate header with the cache policy if it is needed. If not then the non-special algorithm will be used (it removes the last element which key is the last in the internal container). The only requirement is a compatible C++11 compiler.

lru-cache - :dizzy: A feature complete LRU cache implementation in C++

  •    C++

A feature complete LRU cache implementation in C++. A least recently used (LRU) cache is a fixed size cache that behaves just like a regular lookup table, but remembers the order in which elements are accessed. Once its (user-defined) capacity is reached, it uses this information to replace the least recently used element with a newly inserted one. This is ideal for caching function return values, where fast lookup of complex computations is favorable, but a memory blowup from caching all (input, output) pairs is to be avoided.