Awesome Open Source

Programming Languages

Search results for bloom filter hash functions

hash-functions x

18 search results found

Bloomfilter.js ⭐ 733

JavaScript bloom filter using FNV for fast hashing

🎯 Bloom filters for C++11

Python Hashes ⭐ 221

Interesting (non-cryptographic) hashes implemented in pure Python.

Komihash ⭐ 148

Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 26GB/s + PRNG

Portable Lib ⭐ 36

Portable C, C++ code for hash tables, bloom filters, string-search, string utilities, hash functions, arc4random

Abstract Data Types ⭐ 30

A set of efficient data structures in C, created in a generic way

Fast Bloom filter with concurrent accessibility, powered by :atomics module.

Bloom_filter ⭐ 19

A fast Bloom filter for Ruby. Written in C.

Bloom.js ⭐ 16

A Bloom filter implemented as a Node.js module.

Bitvector ⭐ 15

BitVector Implementation in Nim

Blomstre ⭐ 13

Concurrent Bloom Filter

Ios Bloom Filter ⭐ 13

Simple bloom filter for iOS. Add strings to a set and quickly test if they're a part of the set

Bloomfilter ⭐ 12

Bloom filter in Golang with hashing efficiency trick

Bloom filter in Python

Bloomfilter ⭐ 8

A novel, space-efficient, probabilistic data structure for hashing a large number of values. It is similar to a hash table, but smaller because it does not need to store the entire value like HashTable and has better asymptotic performance, at the cost of possible false-positives, a likelihood that is configurable. False negatives are not possible. Best use case: Lightweight check if a value/query exists to reject needless/bogus call in place before performing a more latent or expensive request,

Bloom Cpp ⭐ 7

🔍 A header-only bloom filter implementation in C++14.

Bloomfilter Rs ⭐ 7

A Bloom Filter made in Rust.

Bloom_filter ⭐ 7

🌻 Bloom Filter implementation in pure Elixir

1-18 of 18 search results

Privacy | About | Terms | Follow Us On Twitter

Copyright 2018-2024 Awesome Open Source. All rights reserved.