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 🙏

© 2025 – Pkg Stats / Ryan Hefner

nork-hash

v0.0.4

Published

Simple hash map implementation with map, filter, each, every and some.

Readme

NorkHash

What?

NorkHash is a simple HashMap implementation for node.js.

Why?

It was built for Norker but broken out - because, well it's self contained. And why not? You probably won't need it since there are a lot of other HashMap implementations (a lot of them better than this) but - it's still usable.

Notes

  • NorkHash does not support multiple values per key, if you write to the same key twice you will just replace the previous value.
  • NorkHash is not built to be extremly robust. You can break it if you try.
  • NorkHash sort of expects that your keys are strings. This is not enforced so be aware.
  • NorkHash has not been profiled, performance is most likely not optimal.

Status

NorkHash is unit tested, not application tested and should be considered experimental. Use at your own risk.

Features

  • Enumerator support: forEach(cb), map(cb), filter(cb), some(cb), every(cb);
  • Sort of unit tested with high test coverage. Warning: writing unit tests is not my strong suit.
  • Methods without a specific return value allow chaining.

Installation

npm install nork-hash

Usage

Example

var Hash = require(NorkHash);

var hash = new Hash();

hash.put('one', {val:"one"});
console.log(hash.get('one'));

console.log('forEach')
hash.puts(['two', 'three'],[{val:'two'},{val:'three'}])
hash.forEach(function(key, val){
	console.log(key);
	console.log(val);
});

Methods:

size()

Returns int. Size of hash.

put(key, val)

Returns self. Inserts new key/value pair.

get(key)

Returns Whatever you put in it key Get value from key.

pop(key)

Returns Whatever you put in it at key. Get and delete value at key.

delete(key)

Returns self Delete value at key

clear()

Returns self. Removes all key/value pairs of hash.

has(key)

Returns Boolean Return true if hash contains key

values()

Returns Array. Of all values stored in hash.

keys()

Returns Array Of all keys stored in hash

forEach(fun)

Returns self. For each key/value pair in the hash, calls fun(key, value). This call can have side effects. this will be bound to fun().

map(fun)

Returns a new Hash. The return value of fun(key, value) is the new value of key in the new Hash.

filter(fun)

Returns a new Hash. The return value of fun(key, value) determines if the key/value pair should be contained in the new Hash.

some(fun)

Returns Boolean True if fun(key, value) evaluates to truthy for one or more key/value pairs.

every(fun)

Returns Boolean True if fun(key, value) evalutes to truthy for all key/value pairs

Version history

0.0.3

All array methods are removed. Map doesn't loop two times any longer. put doesn't react to put(undefined).

0.0.2

Added pop(key), pops([keys]), clear() and unit test for theese.

0.0.1

First commit, working code.