Projects tagged ‘cplusplus’ and ‘hash’

C++ Bloom Filter Library, with the following capabilities: Optimal parameter selection based on expected false positive rate. Union, intersection and difference operations between bloom filters. ... [More] Compression of in-use table (increase in false positive probability vs space) Portable and efficient source code implementation. Compatible Compilers: GCC 4.0+ Intel C++ Compiler 9.0+ Microsoft Visual C++ 8.0+ Comeau C/C++ 4.1+ For more information please visit: http://www.partow.net/programming/hashfunctions/index.html [Less]

The General Hash Function Algorithm library contains implementations for a series of commonly used additive and rotative string hashing algorithm in the Object Pascal, C and C++, Java, Python and Ruby ... [More] programming languages For more information please visit: http://www.partow.net/programming/hashfunctions/index.html [Less]

An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or ... [More] speed. These hashtable implementations are similar in API to SGI's hash_map class and the tr1 unordered_map class, but with different performance characteristics. It's easy to replace hash_map or unordered_map by sparse_hash_map or dense_hash_map in C++ code. Recent news: 9 May 2009I've just released sparsehash 1.5.1. Hot on the heels of sparsehash 1.5, this release fixes a longstanding bug in the sparsehash code, where equal_range would always return an empty range. It now works as documented. All sparsehash users are encouraged to upgrade. 7 May 2009I've just released sparsehash 1.5. This release introduces tr1 compatibility: I've added rehash, begin(i), and other methods that are expected to be part of the unordered_map API once tr1 in introduced. This allows sparse_hash_map, dense_hash_map, sparse_hash_set, and dense_hash_set to be (almost) drop-in replacements for unordered_map and unordered_set. There is no need to upgrade unless you need this functionality, or need one of the other, more minor, changes described in the ChangeLog. [Less]

1024bit sha digest. will fill this in later

HASHCCA platform independent C++ hash map template implementation using a multidimensional tree structure. Functions are like those of Sun's Java Hash map template StateFirst version is available ... [More] in tags directory! Package name Deeaan Lampel version 0.10 from 2009/10/14 Test were done for: Microsoft Windows Vista using MS Visual Studio 2005 8.0, GNU/linux red hat running kernel 2.6.23 using GNU/g++ 4.1.2, GNU/linux ubuntu running kernel 2.6.24 using GNU/g++ 4.2.4, How toCheck out the project using a SVN client (e.g. TortoiseSVN). For GNU/linux go to directory type make && ./HASHCC/hashcc Or you can download the lastest snapshot as tar gzip ball from downloads tab. TodoRestructure some headers and add more Hashmap templates using different hash functions, different character sets and another tree depth. RemarksLook at the test function testHashMap for usage ~8> Christian Scheiblich [Less]

A data base can be created from set of text files of key-value format called entities. A set of entities can be queried, grouped and managed in stream manner. One can execute SQL-like statements over ... [More] them. Current implementation Language implementation status availability current release php alpha svn to be announced C++ in progress svn to be announced java in progress svn to be announced Further reading: About and Introduction [Less]