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 🙏

© 2024 – Pkg Stats / Ryan Hefner

count-map

v1.1.0

Published

Utility to create a map that keeps count of unique items.

Downloads

32

Readme

CountMap

Data structure for keeping a count of items.

npm install count-map
yarn add count-map

API

init

import CountMap from 'count-map';

const map = new CountMap({ array, hash, allowNegativeCounts });

| var | type | default | use | |-----|------|---------|-----| | array | Array | [] | Populate map right away with this array. | | hash | Function(key) => string | (key) => key.toString() | Hashing function. Used to group similar keys together, or to distinguish objects. | | allowNegativeCounts | boolean | false | Allow negative counts. Otherwise, the minimum is 0. |

Key management

  • map.set(key, amount) – Sets ket count to amount. Creates entry if doesn't exist.
  • map.delete(key) => boolean – Removes key from map if it exists. Returns false if key didn't exist.
  • map.add(key, amount = 1) => count – Adds to key count. By default, increments by 1. Can provide amount to increment by that. Returns the new count for key.
  • map.subtract(key, amount = 1) => count – Subtracts from key count. By default, decrements by 1. Can provide amount to decrement by that. Returns the new count for key.
  • map.has(key) => boolean – Check if map has key.
  • map.get(key) => count – Get count for key. If key doesn't exist, returns 0.
  • map.concat(array, inPlace = false) => CountMap – Add contents of array to map. Operates on and returns clone unless inPlace is true.

Other

  • map.keys() => Array – Returns array of unique keys. NOTE: If the hash sets two keys to be equal of each other, there will only be one instance of that saved as a representaive of the hash.
  • map.entries() => Array[key, count] – Returns unique entries within the map.
  • map.toArray() => Array – Creates an array, duplicating keys as many times as the count indicates. Leaves out keys with negative or empty counts.
  • map.equals(otherMap) => boolean – Test if two CountMaps are equal. Specifically:
    • Are the hash functions the same?
    • Are the two negative modes equal?
    • Does each have the same keys and counts? NOTE: Keys may differ, but still return true depending on the hash function.
  • map.clone() => CountMap – Duplicate CountMap.
  • map.rehash() => this – Rehashes map. Use this if the hash function changes.