Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More
Socket
Sign inDemoInstall
Socket

hashlru

Package Overview
Dependencies
Maintainers
3
Versions
11
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

hashlru - npm Package Compare versions

Comparing version 2.2.0 to 2.2.1

2

index.js

@@ -30,3 +30,3 @@ module.exports = function (max) {

if(v !== undefined) return v
if(v = _cache[key]) {
if((v = _cache[key]) !== undefined) {
update(key, v)

@@ -33,0 +33,0 @@ return v

{
"name": "hashlru",
"description": "simpler faster substitute for LRU",
"version": "2.2.0",
"version": "2.2.1",
"homepage": "https://github.com/dominictarr/hashlru",

@@ -6,0 +6,0 @@ "repository": {

@@ -32,3 +32,3 @@ # hashlru

This algorithm does not give you an ordered list of the N most recently used items,
but you do not really need that! The property of dropping the lest recent items is still preserved.
but you do not really need that! The property of dropping the least recent items is still preserved.

@@ -76,5 +76,5 @@ see a [benchmark](https://github.com/dominictarr/bench-lru) of this against

### lru.get (key) => value | null
### lru.get (key) => value | undefined
Returns the value in the cache.
Returns the value in the cache, or `undefined` if the value is not in the cache.

@@ -81,0 +81,0 @@ ### lru.set(key, value)

Sorry, the diff of this file is not supported yet

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc