JSPM

Found 60 results for least

quick-lru

Simple “Least Recently Used” (LRU) cache

  • v7.1.0
  • 117.13
  • Published

@alloc/quick-lru

Simple “Least Recently Used” (LRU) cache

  • v5.2.0
  • 110.86
  • Published

toad-cache

LRU and FIFO caches for Client or Server

  • v3.7.0
  • 104.88
  • Published

js-lru

A finite key-value cache using the Least Recently Used (LRU) cache algorithm where the most recently used objects are keept in cache while less recently used items are purged.

  • v1.0.0
  • 57.09
  • Published

smallest

Get the smallest number in a list

  • v1.0.1
  • 56.23
  • Published

map-lru

"Least Recently Used" (LRU) cache compatible to ES6 Map

  • v2.1.0
  • 51.72
  • Published

least-squares

Linear least squares regression analysis.

  • v0.0.2
  • 47.67
  • Published

datafit

Simple curve-fitting algorithm

  • v1.4.10
  • 46.77
  • Published

nima-wabeta-info

This is unofficial scraper of whatsapp beta news site, created by Mr nima. all posts credits goes to wabetainfo.com site

  • v1.0.9
  • 43.07
  • Published

quick-lru-ts

Simple “Least Recently Used” (LRU) cache

  • v1.0.0
  • 40.99
  • Published

ml-pls

Partial least squares library

  • v4.3.2
  • 40.01
  • Published

idb-lru-cache

IndexedDB-based persisting LRU cache for the browser

  • v1.0.0
  • 35.24
  • Published

ta.js

Financial Technical Analysis in JavaScript

  • v1.16.3
  • 32.09
  • Published

stegjs

Encrypt message to PNG image.

  • v3.0.1
  • 28.99
  • Published

lru_cache

A finite key-value cache using the Least Recently Used (LRU) cache algorithm where the most recently used objects are keept in cache while less recently used items are purged.

  • v1.0.2
  • 28.96
  • Published

quick-lru-cjs

Simple “Least Recently Used” (LRU) cache. A fork of quick-lru for commonjs

  • v5.2.1
  • 28.22
  • Published

omnisassumenda

A finite key-value cache using the Least Recently Used (LRU) cache algorithm where the most recently used objects are keept in cache while less recently used items are purged.

  • v1.19.0
  • 20.86
  • Published

hyperlru

Tiny & Fast LRU Implementation as possible

  • v2.1.2
  • 20.52
  • Published

@qxip/hyper-lru

Hyper “Least Recently Used” (LRU) cache

  • v1.0.13
  • 18.40
  • Published

@stdlib/utils-real-min

Return the smallest positive normal value capable of being represented by a numeric real type.

  • v0.2.2
  • 14.82
  • Published

@stdlib/utils-safe-int-min

Return the minimum safe integer capable of being represented by a numeric real type.

  • v0.2.2
  • 14.68
  • Published

lsb

Hide string data in the least-significant bits of an array/image

  • v0.1.0
  • 14.10
  • Published

jlru

An in-memory key/value cache based on the Least Recently Used algorithm

  • v0.0.9
  • 13.70
  • Published

get-parabola

Quadratic function coeffs by different ways.

  • v1.1.9
  • 13.31
  • Published

@fav/math.lcm

Calculates the least common multiple of two integers.

  • v0.1.1
  • 12.90
  • Published

pot-spent

pot-spent

  • v4.63.889
  • 10.16
  • Published

least-common-multiple

Computes the least common multiple of the given integers.

  • v1.0.0
  • 8.68
  • Published

@mobilabs/lru

An in-memory key/value cache based on the Least Recently Used algorithm

  • v1.0.6
  • 8.09
  • Published

lri

A collection (backed by an array) that evicts the least recently inserted (lri) element from of the collection once it has reached a defined capacity. It is similar to an lru cache except that it uses insertion position to determine eviction rather than w

    • v1.0.0
    • 7.84
    • Published

    hyperlru-map

    hyperlru implementation backed in an Map

    • v1.0.0
    • 7.45
    • Published

    lru-generator

    Least recently used cached generator

    • v0.1.2
    • 6.88
    • Published

    hyperlru-object

    hyperlru implementation backed in an Object

    • v1.0.0
    • 6.03
    • Published

    await-at-least

    A small set of functions to await at least a certain amount of time before resolving a promise.

    • v1.0.0
    • 4.68
    • Published

    @devchris/lru

    Least Recently Used (LRU) cache algorithm

    • v0.1.1
    • 4.44
    • Published

    @stdlib/utils-real-min-cli

    Return the smallest positive normal value capable of being represented by a numeric real type.

    • v0.2.2
    • 4.42
    • Published

    fugased

    A finite key-value cache using the Least Recently Used (LRU) cache algorithm where the most recently used objects are keept in cache while less recently used items are purged.

    • v1.2.2
    • 2.75
    • Published

    set-lru

    A set API for the LRU package

    • v0.1.0
    • 2.60
    • Published

    picolru

    A tiny LRU implementation that strives for simplicity and performance.

    • v2.0.0
    • 0.00
    • Published

    radix-lsd

    An NPM module for running a least significant digit radix sorting algorithm.

    • v1.0.0
    • 0.00
    • Published

    cache-result

    > You cache the results you know when to flush'em

    • v0.1.1
    • 0.00
    • Published