We have collection of more than 1 Million open source products ranging from Enterprise product to small libraries in all platforms. We aggregate information from all open source repositories. Search and find the best for your needs. Check out projects section.
dsjslib - A library implementing several standard data structures and utilities, in JavaScript
This is a collection of different data structures and utilities, implemented in JavaScript. Its written and tested using Node.js which is also the target platform.CircularBuffer - A data structure that uses a single, fixed-size buffer as if it were connected end-to-end. When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.
algorithms datastructures ds sort-map data-structures avl avltree trie ternarysearchtrie multiwaytrie skiplist btree binarysearch binarysearchtree sortedmap lru cache eviction maximize least-recently-used loading guava async delay-queue delayqueue priorityqueue heap binaryheap bitset bitarray bitvector circularbuffer ringbuffer graph directed undirected shortest cycle path topological bloomfilter bloom filterbloom - Go package implementing Bloom filters
A Bloom filter is a representation of a set of n items, where the main requirement is to make membership queries; i.e., whether an item is a member of a set.A Bloom filter has two parameters: m, a maximum size (typically a reasonably large multiple of the cardinality of the set to represent) and k, the number of hashing functions on elements of the set. (The actual hashing functions are important, too, but this is not a parameter for this implementation). A Bloom filter is backed by a BitSet; a key is represented in the filter by setting the bits at each value of the hashing functions (modulo m). Set membership is done by testing whether the bits at each value of the hashing functions (again, modulo m) are set. If so, the item is in the set. If the item is actually in the set, a Bloom filter will never fail (the true positive rate is 1.0); but it is susceptible to false positives. The art is to choose k and m correctly.
bloom bloom-filters bloom-filter data-structure collections go-collectionGameShop -Nano Edition-
An Amazing unification project, designed to blend all the known modern needs for high speed, very pretty AAA game projects into a single core language. It is more advanced than any other language on the Earth. It can within a single code file, blend native C#, Joint(Custom ...
2d-engine bloom game-engine gamepad ide jointC++ Bloom Filter Library
C++ Bloom Filter Library
algorithm associative bloom bloom-filter bloomier boostsignal - Simple and beautiful open source Analytics :bar_chart:
Simple and beautiful open source Analytics :bar_chart:
astrocorp analytics vuejs js website privacy marketing growth google-analytics analyticsjs bloomproof-of-work - Proof of Work with SHA256 and Bloom filter
Proof of work based on SHA256 and Bloom filter.Timestamp MUST be equal to number of milliseconds since 1970-01-01T00:00:00.000Z in UTC time.
bloom-filter proof of work sha256 bloomnode-bloomd - A NodeJS client for BloomD
node-bloomd uses stream transforms, and therefore requires Node 0.10 or later.Pop quiz: Bulk and Multi - which is used for batch checking, and which is used for batch setting? I can never remember either. node-bloomd helps out by providing two methods to make it explicit: multiCheck() and bulkSet(). Use them. The maintainers of your code will thank you.
bloomd bloom filterbloomfilters - A set of bloom filter implementations in pure coffee/javascipt.
A set of bloom filter implementations in pure coffee/javascipt. You can use the 'cake' command to build this project.
hash bloom bitmapbloom-redis - A node module for bloom filters in redis
A bloom filter for node backed by redis. To install, use npm and run npm install bloom-redis.
bloom filter redis bloom-filtercount-min-sketch - Count-Min Sketch Data Structure
An implementation of Coromode and Muthukrishnan's Count-Min sketch data structure for JavaScript. The count-min sketch is basically a high powered generalization of the bloom filter. While a bloom filter gives an efficient way to approximate membership of a set, a count-min sketch can give approximate data about the relative frequency of items in the set. Creates a count-min sketch data structure.
count-min count min increment frequency probabilistic random bloom filter heavy hitter sparse stream algorithmbloom.js - A Bloom filter implemented as a Node.js module.
A bloom filter implemented as a Node.js module. A bloom filter is a probabilistic data structure used to test for membership in a set. It is highly memory efficient and very fast, so it is a good tool when faced with a very large number of values in a set and testing set membership is performance sensitive.
hash indexing bloom filterxx-bloom - yet another bloom filter implementation for node.js; backed by xxhash
Yet another Bloom filter implementation for node.js. Everybody has to write one, as you know. Backed by Xxhash via node-xxhash. Xxhash is a fast general-purpose hash, which is all a bloom filter needs. Three variations are provided: a straight Bloom filter, a counting filter (from which items can be removed), and a straight Bloom filter backed by redis. The first two have synchronous APIs. The redis one perforce requires callbacks. You can pass in seeds for the hash functions if you like, or they'll be randomly generated. Seeds must be integers.
bitmap bloom bloom-filter counting-filter hash xxhashflint - Fast and configurable filesystem (file and directory names) linter
You think there is no place in code reviews to discuss about files naming conventions ? Impose consistent files and directories naming rules with flint: the filesystem linter. Configuration is stored in a .flint.sane file at the root of your project (repo).
linter filesystem fs-linter fs ci continuous-integration cd continuous-delivery astrocorp devops devops-tools cicd bloomnewsbot - Automated Hacker News curation - https://t.me/DailyHNBot
newsbot helps you to manage the information overflow and addiction problem: automated Hacker News curation every 12 hours.
bot chatbot telegram telegram-bot astrocorp hn hacker-news automation content-curation bloomrocket - Automated software delivery as fast and easy as possible :rocket:
rocket is the D in CI/CD: It allows to easily deliver software to a large range of providers from any CI/CD pipeline. rocket use SANE as configuration format.
ci cd continuous-integration continuous-delivery continuous-deployment deployment deploy astrocorp heroku s3 github firebase devops devops-tools docker automation bloomrz-go - ripzap - The fastest structured, leveled JSON logger for Go 📖. Dependency free.
ripzap - The fastest structured, leveled JSON logger for Go 📖. Dependency free. The rz package provides a fast and simple logger dedicated to JSON output avoiding allocations and reflection..
logging logs structured-logging json performance fast elegant elegance bloom astro astrolog zero-allocation json-logging json-loggersane - the Simple And NEeded configuration format
the Simple And NEeded configuration format
configuration configuration-language bloom sane json toml yamlfnv-plus - Javascript FNV-1a Hash Algorithm (up to 1024 bit) implementation. Based on:
Javascript FNV-1a Hashing Algorithm up to 1024 bits, with highly optimized 32bit and 52bit implementations. The FNV-1a hash algorithm, often simply called "fnv", disperses hashes throughout the n-bit hash space with very good dispersion and is very fast.
id unique hash checksum fnv fnv1a signature uniqueness bloom filter
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.
