ما هي الميزات الرئيسية لـ isaacs/node-lru-cache؟

الميزات الرئيسية لـ isaacs/node-lru-cache هي: Memory-Limited Caches, LRU Cache Eviction, Cache Eviction Policies, Least Recently Used Caches, Application Caching, Hash Maps, Linked-List LRU Evictions, Time-To-Live Expirations.

ما هي البدائل مفتوحة المصدر لـ isaacs/node-lru-cache؟

تشمل البدائل مفتوحة المصدر لـ isaacs/node-lru-cache: tporadowski/redis — Redis is a high-performance in-memory key-value store that functions as a distributed cache, message broker, and NoSQL… hashicorp/golang-lru — This is a thread-safe in-memory cache library for Go that automatically evicts the least recently used items when… coocood/freecache — freecache is a high-performance, concurrent in-memory key-value store library for Go applications. It functions as a… memcached/memcached — Memcached is a high-performance, distributed, in-memory key-value storage and request routing engine. It functions as… lmcache/lmcache — LMCache is a distributed key-value cache manager and tiering system designed to accelerate large language model… olric-data/olric — Olric is a distributed data grid and in-memory key-value store that partitions and replicates data across a cluster of…

Node Lru Cache

node-lru-cache هو مخزن مفتاح-قيمة لـ Node.js ينفذ ذاكرة تخزين مؤقت محدودة الذاكرة. يمنع استنفاد الذاكرة عن طريق تحديد الحد الأقصى لإجمالي عدد العناصر أو إجمالي حجم البايت، ويقوم تلقائياً بطرد العناصر الأقل استخداماً مؤخراً للحفاظ على هذه الحدود.

يوفر المشروع أنماط تخزين مؤقت متخصصة، بما في ذلك فترات البقاء لضمان نضارة البيانات وآلية "قديم أثناء إعادة التحقق" التي تقدم محتوى منتهي الصلاحية أثناء جلب التحديثات بشكل غير متزامن في الخلفية. كما يتضمن أدوات تشخيص لمراقبة نجاحات التخزين المؤقت، والإخفاقات، ومقاييس الطرد من خلال كائنات حالة التشغيل وقنوات التشخيص.

يغطي التنفيذ قدرات أوسع لإدارة الذاكرة واستعادة البيانات، مثل جلب البيانات التلقائي للمدخلات المفقودة، والتقليم اليدوي للعناصر القديمة، وتنفيذ دوال التنظيف عند انتهاء صلاحية العناصر لتحرير الموارد الخارجية.

Features

Memory-Limited Caches - Implements a memory-limited key-value store that prevents exhaustion by capping item counts or total byte size.
LRU Cache Eviction - Implements a memory-limited cache that automatically evicts the least-recently-used items to prevent memory exhaustion.
Cache Eviction Policies - Implements size-based eviction algorithms to maintain memory limits by removing the oldest items.
Least Recently Used Caches - Prevents application crashes by capping memory usage through an automatic least-recently-used eviction policy.
Application Caching - Stores frequently accessed application data in memory to reduce latency and database load.
Hash Maps - Utilizes a hash map to provide constant-time retrieval of cached entries and their associated tracking nodes.
Linked-List LRU Evictions - Uses a doubly linked list to maintain access order for efficient least-recently-used item eviction.
Time-To-Live Expirations - Implements automatic data expiration based on configurable time-to-live durations.
Cache Memory Limits - Enforces memory constraints by blocking items that exceed a calculated size from entering the cache.
Resource Disposal - Provides mechanisms for disposing of resources and executing cleanup functions when items are removed.
Eviction Callbacks - Implements hooks that execute custom cleanup logic when cache entries are evicted or expire.
Resource Lifecycle Management - Ensures the release of external system resources through cleanup logic executed upon item expiration.
Cache Performance Monitoring - Tracks hit ratios, misses, and eviction metrics to analyze and optimize caching efficiency.
Diagnostic Channels - Provides internal event publishing via diagnostic channels for real-time observability of cache performance metrics.
Data Fetching - Automates data recovery by retrieving values through a specified method when a key is missing.
Stale-While-Revalidate - Supports the stale-while-revalidate pattern to serve expired content while asynchronously updating entries.
Caching - LRU cache implementation.

سجل النجوم

isaacsnode-lru-cache

Name: isaacs/node-lru-cache
Author: isaacs

View on GitHub

5,895 نجوم371 تفرعاتJavaScriptBlueOak-1.0.010 مشاهداتisaacs.github.io/node-lru-cache

Node Lru Cache

Features

Memory-Limited Caches - Implements a memory-limited key-value store that prevents exhaustion by capping item counts or total byte size.
LRU Cache Eviction - Implements a memory-limited cache that automatically evicts the least-recently-used items to prevent memory exhaustion.
Cache Eviction Policies - Implements size-based eviction algorithms to maintain memory limits by removing the oldest items.
Least Recently Used Caches - Prevents application crashes by capping memory usage through an automatic least-recently-used eviction policy.
Application Caching - Stores frequently accessed application data in memory to reduce latency and database load.
Hash Maps - Utilizes a hash map to provide constant-time retrieval of cached entries and their associated tracking nodes.
Linked-List LRU Evictions - Uses a doubly linked list to maintain access order for efficient least-recently-used item eviction.
Time-To-Live Expirations - Implements automatic data expiration based on configurable time-to-live durations.
Cache Memory Limits - Enforces memory constraints by blocking items that exceed a calculated size from entering the cache.
Resource Disposal - Provides mechanisms for disposing of resources and executing cleanup functions when items are removed.
Eviction Callbacks - Implements hooks that execute custom cleanup logic when cache entries are evicted or expire.
Resource Lifecycle Management - Ensures the release of external system resources through cleanup logic executed upon item expiration.
Cache Performance Monitoring - Tracks hit ratios, misses, and eviction metrics to analyze and optimize caching efficiency.
Diagnostic Channels - Provides internal event publishing via diagnostic channels for real-time observability of cache performance metrics.
Data Fetching - Automates data recovery by retrieving values through a specified method when a key is missing.
Stale-While-Revalidate - Supports the stale-while-revalidate pattern to serve expired content while asynchronously updating entries.
Caching - LRU cache implementation.

بدائل مفتوحة المصدر لـ Node Lru Cache

مشاريع مفتوحة المصدر مشابهة، مرتبة حسب عدد الميزات المشتركة مع Node Lru Cache.

tporadowski/redis
tporadowski/redis
9,987عرض على GitHub
Redis is a high-performance in-memory key-value store that functions as a distributed cache, message broker, and NoSQL database. It provides sub-millisecond read and write access to data stored in RAM and can operate as a vector database for indexing high-dimensional embeddings. The system supports a wide range of data storage and synchronization primitives, including the management of strings, hashes, lists, sets, and JSON documents. It enables real-time data operations through atomic transactions, hybrid persistence using snapshots and append-only logs, and high-availability configurations
Credisredis-for-windowsredis-msi-installer
عرض على GitHub9,987
hashicorp/golang-lru
hashicorp/golang-lru
5,091عرض على GitHub
This is a thread-safe in-memory cache library for Go that automatically evicts the least recently used items when capacity is reached. It provides a fixed-size memory cache designed to maintain a constant memory footprint by removing the oldest entries as new data arrives. The system includes an eviction manager that executes custom callbacks when entries are purged to facilitate resource cleanup. It also supports time-based expiration, allowing for the automatic removal of items after a specified time-to-live duration. The library covers general caching capabilities including cache inspecti
Go
عرض على GitHub5,091
coocood/freecache
coocood/freecache
5,399عرض على GitHub
freecache is a high-performance, concurrent in-memory key-value store library for Go applications. It functions as a fixed-size cache that manages large volumes of data while eliminating garbage collection overhead through the use of preallocated memory and off-heap storage. The system maintains a predictable memory footprint by utilizing fixed memory allocation and circular buffer management, where new entries automatically overwrite the oldest data upon reaching capacity. It further reduces contention between simultaneous readers and writers through lock-striped concurrent access. The libr
Go
عرض على GitHub5,399
memcached/memcached
memcached/memcached
14,132عرض على GitHub
Memcached is a high-performance, distributed, in-memory key-value storage and request routing engine. It functions as a volatile data store designed to accelerate dynamic applications by caching objects in RAM, thereby reducing backend database load and providing sub-millisecond response times. The system utilizes a specialized architecture that organizes memory into fixed-size slabs to minimize fragmentation and maximize throughput for high-concurrency workloads. The project distinguishes itself through a multi-threaded, lock-friendly design that scales across CPU cores and supports complex
C
عرض على GitHub14,132

عرض جميع البدائل الـ 30 لـ Node Lru Cache

الأسئلة الشائعة

ما هي وظيفة isaacs/node-lru-cache؟