npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2026 – Pkg Stats / Ryan Hefner

hcacher

v0.3.0

Published

In-memory cache manager with optional TTL, FIFO or strict-LRU eviction, and event bus

Readme

hcacher

Flexible in-memory cache manager with optional TTL, FIFO or strict-LRU eviction, and an event bus.

English | Русский

npm version npm downloads license typescript

Install

npm install hcacher
pnpm install hcacher
bun install hcacher

Usage

import { CacheManager } from "hcacher";

// Basic usage
const cache = new CacheManager<string>({ maxSize: 100, ttl: 60_000 });
cache.set("key", "value");
console.log(cache.get("key")); // "value"

// With factory (deduplicates concurrent requests)
const result = await cache.getOrSet("key", async () => {
  const res = await fetch("https://api.example.com/data");
  return res.json();
});

// Events
cache.on("hit", (key, data) => console.log(`Cache hit: ${key}`));
cache.on("miss", (key) => console.log(`Cache miss: ${key}`));
cache.on("evict", (key, data) => console.log(`Evicted: ${key}`));
cache.on("expire", (key, data) => console.log(`Expired: ${key}`));

API

new CacheManager<T>(options?)

| Option | Default | Description | | ------------ | ---------- | --------------------------------------------------------------------- | | maxSize | Infinity | Positive safe-integer maximum entries; Infinity disables eviction | | ttl | Infinity | Non-negative lifetime in milliseconds; Infinity disables expiration | | touchOnGet | false | Enables strict LRU; otherwise a bounded cache uses FIFO eviction | | enabled | true | Enables or disables caching |

// Defaults: unbounded cache, no expiration.
new CacheManager<string>();

// Bounded caches use FIFO by default: reads and overwrites preserve insertion order.
new CacheManager<string>({ maxSize: 100, ttl: 30_000 });

// Opt in to strict LRU: reads and overwrites move an entry to the newest position.
new CacheManager<string>({ maxSize: 100, ttl: 30_000, touchOnGet: true });

// Positional arguments are also supported.
new CacheManager<string>(100, 30_000, true, true);

Eviction behavior

  • With maxSize: Infinity (the default), no entries are evicted for capacity.
  • With finite maxSize and touchOnGet: false (the default), the oldest inserted entry is evicted first (FIFO). Reading or overwriting an existing entry does not change its position.
  • With finite maxSize and touchOnGet: true, the least recently used entry is evicted first (strict LRU). Reading or overwriting an existing entry moves it to the newest position.

Methods

  • get(key) — Get value by key. Returns undefined on miss or expiration.
  • getEntry(key) — Get full entry with etag/lastModified metadata.
  • set(key, data, meta?) — Store value with optional etag/lastModified.
  • getOrSet(key, factory, meta?) — Get or create via factory. Deduplicates concurrent calls for the same key.
  • has(key) — Check if key exists and is not expired.
  • delete(key) — Remove an entry and invalidate its pending factory.
  • clear() — Remove all entries and invalidate all pending factories.
  • prune() — Remove expired entries and return their count.
  • size — Current number of non-expired entries.

Events

| Event | Payload | Description | | -------- | ------------- | ----------------------------------------------- | | hit | (key, data) | Cache hit | | miss | (key) | Cache miss | | set | (key, data) | Entry stored | | evict | (key, data) | Entry evicted because the bounded cache is full | | expire | (key, data) | Entry expired (TTL) |

License

MIT