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

@emilbayes/multiset

v1.1.1

Published

Multiset implementation

Downloads

7

Readme

@emilbayes/multiset

Build Status

Multiset implementation

Usage

const Multiset = require('@emilbayes/multiset')

const m = new Multiset([1, 1, 2, 3, 4, 4, 3, 8, 1])

console.log(m.count(1)) // => 3
console.log(m.count(4)) // => 2
console.log(m.size) // => 9
console.log(m.uniqueSize) // => 5

m.add(10)
console.log(m.size) // => 10
console.log(m.uniqueSize) // => 6

API

var m = new Multiset([elements = []], [key = x => x])

Create a new Multiset with optional initial array of elements, and optional identity key, which defaults to strict equality.

const size = m.size

Number of total elements in the Multiset.

const size = m.uniqueSize

Number of unique elements in the Multiset.

const m = m.add(elm, [n = 1])

Add elm to the Multiset, with optional multiplicity n. Equality is checked with key.

const m = m.delete(elm, [n = 1])

Delete elm from the Multiset, optionally decrementing by n. If final count is 0 or less, the element is removed from the Multiset. Equality is checked with key.

const bool = m.has(elm)

Check for existence.

const n = m.count(elm)

Count occurrences of elm in the Multiset.

const bool = m.equal(rhs)

Check if m and rhs contain the same elements with same multiplicity.

const bool = m.subset(superset)

Check if m is a subset of superset, meaning superset contain the same elements with at least the least the same multiplicity as m.

const m2 = m.filter(fn)

Filter unique elements from the Multiset, preserving count in the new Multiset. A new Multiset is created but if the elements are not primitives, they will share references between the two Multisets.

const m2 = m.difference(rhs)

Find the difference m \ rhs, copying the Multiset with the difference contained in the new Multiset. rhs can either be a Multiset or an Array.

m.forEach(fn, this)

Iterate elements of the Multiset as an array, meaning elements with multiplicity will be enumerated n times.

const arr = m.map(fn, this)

Map elements of the Multiset as an array, meaning elements with multiplicity will be enumerated n times. Returns the resulting array.

const arr = m.reduce(fn, [initialValue])

Reduce elements of the Multiset as an array, meaning elements with multiplicity will be enumerated n times. Returns the resulting accumulated value.

const m2 = m.clone()

Clone the Multiset. A new Multiset is created but if the elements are not primitives, they will share references between the two Multisets.

for (const elm of m) ...

Iterate elements of the Multiset with multiplicity.

const iterator = m.entries()

Iterate [elm, multiplicity] of the Multiset.

const iterator = m.counts()

Iterate multiplicity of the Multiset.

const iterator = m.values()

Iterate unqiue elm of the Multiset.

Install

npm install @emilbayes/multiset

License

ISC