array-lru

WebJar for array-lru

License

License

MIT
GroupId

GroupId

org.webjars.npm
ArtifactId

ArtifactId

array-lru
Last Version

Last Version

1.1.1
Release Date

Release Date

Type

Type

jar
Description

Description

array-lru
WebJar for array-lru
Project URL

Project URL

http://webjars.org
Source Code Management

Source Code Management

https://github.com/mafintosh/array-lru

Download array-lru

How to add to project

<!-- https://jarcasting.com/artifacts/org.webjars.npm/array-lru/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>array-lru</artifactId>
    <version>1.1.1</version>
</dependency>
// https://jarcasting.com/artifacts/org.webjars.npm/array-lru/
implementation 'org.webjars.npm:array-lru:1.1.1'
// https://jarcasting.com/artifacts/org.webjars.npm/array-lru/
implementation ("org.webjars.npm:array-lru:1.1.1")
'org.webjars.npm:array-lru:jar:1.1.1'
<dependency org="org.webjars.npm" name="array-lru" rev="1.1.1">
  <artifact name="array-lru" type="jar" />
</dependency>
@Grapes(
@Grab(group='org.webjars.npm', module='array-lru', version='1.1.1')
)
libraryDependencies += "org.webjars.npm" % "array-lru" % "1.1.1"
[org.webjars.npm/array-lru "1.1.1"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

array-lru

A really fast LRU cache for array items (numeric keys)

npm install array-lru

build status

Credit to @dominictarr for telling me about this neat algorithm for LRUs.

Usage

var alru = require('array-lru')
var lru = alru(512) // create a lru that can contain 512 values

lru.set(42, {hello: 'world'})
console.log(lru.get(42)) // {hello: 'world'}

It works similar to a normal hash table except when a bucket is full it will evict the oldest one from the bucket to make room for the new value.

API

var lru = alru(size, [options])

Create a new LRU instance. Options include:

{
  collisions: 4, // how many hash collisions before evicting (default 4)
  evict: fn, // call this function with (index, value) when someone is evicted
  indexedValues: false // set to true if your values has a .index property
}

Size should be a multiple of collisions. If not, it will be coerced into one.

var value = lru.get(index)

Get a value from the cache. If the index is not found, null is returned.

lru.set(index, value)

Insert a new value in the cache. If there is no room in the hash bucket that index maps to, the oldest value in the bucket will be evicted.

Performance

On my MacBook 12" I can set/get around 7.500.000 values per second, YMMV. Run the benchmark using npm run bench to test it for yourself.

License

MIT

Versions

Version
1.1.1