Displaying 1 to 20 from 37 results

node-lru-cache

  •    Javascript

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

cachex - A powerful caching library for Elixir with support for transactions, fallbacks and expirations

  •    Elixir

All of these features are optional and are off by default so you can pick and choose those you wish to enable. For anything else, please see the documentation.

js-lru - A fast, simple & universal Least Recently Used (LRU) map for JavaScript

  •    Javascript

A finite key-value map using the Least Recently Used (LRU) algorithm, where the most recently-used items are "kept alive" while older, less-recently used items are evicted to make room for newer items. Useful when you want to limit use of memory to only hold commonly-used things.




moize - The consistently-fast, complete memoization solution for JS

  •    Javascript

moize is a consistently blazing fast memoization library for JavaScript. It handles multiple parameters (including default values) without any additional configuration, and offers a large number of options to satisfy any number of potential use-cases. All parameter types are supported, including circular objects, functions, etc. There are also a number of shortcut methods to memoize for unique use-cases.

storage-lru - An LRU cache to be used with pluggable storage mechanism

  •    Javascript

StorageLRU is a LRU implementation that can be used with local storage, or other storage mechanisms that support a similar interface.Note: This library is written in CommonJS style. To use it in browser, please use tools like Browserify and Webpack.

quick-lru - Simple "Least Recently Used" (LRU) cache

  •    Javascript

Useful when you need to cache something and limit memory usage.Inspired by the hashlru algorithm, but instead uses Map to support keys of any type, not just strings, and values can be undefined.

async-cache - Cache your async lookups and don't fetch the same thing more than necessary.

  •    Javascript

Cache your async lookups and don't fetch the same thing more than necessary.Let's say you have to look up stat info from paths. But you are ok with only looking up the stat info once every 10 minutes (since it doesn't change that often), and you want to limit your cache size to 1000 objects, and never have two stat calls for the same file happening at the same time (since that's silly and unnecessary).


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.

cache-chunk-store - In-memory LRU (least-recently-used) cache for abstract-chunk-store compliant stores

  •    Javascript

This caches the results of store.get() calls using lru-cache. See the lru-cache docs for the full list of configuration options.MIT. Copyright (c) Feross Aboukhadijeh.

node-simple-lru-cache - Simple and Fast LRU cache for node

  •    Javascript

It's a very simple and extremely fast lru cache for node.js.

tiny-lru - Tiny LRU cache for Client or Server

  •    Javascript

Least Recently Used cache for Client or Server. Lodash provides a memoize function with a cache that can be swapped out as long as it implements the right interface. See the lodash docs for more on memoize.

lookup_by - A thread-safe lookup table cache for ActiveRecord

  •    Ruby

LookupBy is a thread-safe lookup table cache for ActiveRecord that reduces normalization pains. Please create Issues to submit bug reports and feature requests. However, I ask that you'd kindly review these bug reporting guidelines first.

stash - Distributed cache using Redis and process memory with TTL expiry and LRU pruning

  •    Javascript

Distributed cache using Redis as cache store and memory lru for fast access to loaded data. createRedisClient must be a function that creates and returns an instance of node-redis compatible with v0.8. This way your app can still have control over instantiating and handling errors on the redis client.

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.

stale-lru-cache - Resilient and performant in-memory cache for node.js.

  •    Javascript

Resilient and performant in-memory cache for node.js. Unless you're able to cache resources forever, use maxAge together with staleWhileRevalidate to get fault-tolerant, zero-latency cache refreshes.

simple-lru - Minimal Least Recently Used Cache

  •    Javascript

The implementation is inspired by node-lru-cache by Isaac Schlueter. The motivation of this project is to provide Object.create fallback in order to work on IE8. Or download tarball.





We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.