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

bloomish

v0.0.1

Published

a generic bloom filter with parameterizable hash functions

Downloads

2

Readme

#Bloomish

A bloom filter in javascript. To know more about bloom filters have a look here.

Usage

A bloom filter is comprised of a set, a hashing function, a reduction function, and a membership test function.

The hash function needs to output some value to identify the items, the reduction function is used to combine the hashes of the set members, and a membership function is used to test an item's hash against the filter.

Bloomish is just the structure that ties it all together.

import Bloomish from 'bloomish';

let items = [...];

let hash = (item) => { ... };

let reduce = (acc, item) => { ... };

let has = (itemHash, filter) => { ... };

let awesomeFilter = new Bloomish({
  items,
  hash,
  reduce,
  has
});

Then it can be used as such :

var item = 'hello';

awesomeFilter.has(item);
// returns true or false

Contribution

Any contribution is welcome. Suggestions can be opened as issues, and feel free to fork the repo and open a pull request for any code contribution.

License

This software is provided as such, without any guarantees regarding it's functionality.

It is licensed under the MIT software license.

Original Author : Omar Kamali.