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

kolekto

v1.0.2

Published

Collection of datastructures and algorithims for typescript and javascript.

Downloads

76

Readme

Kolekto

Collections and datastructures library for Typescript ( and javascript).

Index

Installation

npm install kolekto 

Import the parts you want.

import {BloomFilter} from "kolekto"

let filter = new BloomFilter<string>(10000, 0.03);

Collections

BitArray

BloomFilter

A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.

False positives are possible but false negatives not. In laymen's terms this means that an element maybe be in the set or definitely not in the set. The underlying hash function is the Google's FarmHash family of hash functions. By using the the C implementation of farmhash a high insertion can be achieved.

The interface is modeled after the BloomFilter in the Google Guava library.

Example:

import {BloomFilter} from "kolekto"

// Create a bloomfilter with 10000 expected insertions and false positive probability of 3%
let filter = new BloomFilter<string>(10000, 0.03);

// Put item in bloomfilter
filter.put("test");

// Check if item is in bloom filter, return true if it might contain element
let result = filter.mightContain("test");