kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/devel/cmph/distinfo

9 lines
526 B
Text
Raw Normal View History

Update devel/cmph to version 2.0. Prompted by beta.repology.org. News for version 2.0 Cleaned up most warnings for the c code. Experimental C++ interface (--enable-cxxmph) implementing the BDZ algorithm in a convenient interface, which serves as the basis for drop-in replacements for std::unordered_map, sparsehash::sparse_hash_map and sparsehash::dense_hash_map. Potentially faster lookup time at the expense of insertion time. See cxxmpph/mph_map.h and cxxmph/mph_index.h for details.
2016-11-20 13:22:48 +01:00
$NetBSD: distinfo,v 1.5 2016/11/20 12:22:48 alnsn Exp $
Add devel/cmph-1.0. The CMPH Library encapsulates the newest and more efficient algorithms in an easy-to-use, production-quality, fast API. The library was designed to work with big entries that cannot fit in the main memory. It has been used successfully for constructing minimal perfect hash functions for sets with more than 100 million of keys, and we intend to expand this number to the order of billion of keys. Although there is a lack of similar libraries, we can point out some of the distinguishable features of the CMPH Library: - Fast. - Space-efficient with main memory usage carefully documented. - The best modern algorithms are available (or at least scheduled for implementation :-)). - Works with in-disk key sets through of using the adapter pattern. - Serialization of hash functions. - Portable C code (currently works on GNU/Linux and WIN32 and is reported to work in OpenBSD and Solaris). - Object oriented implementation. - Easily extensible. - Well encapsulated API aiming binary compatibility through releases. - Free Software.
2011-04-28 22:45:48 +02:00
Update devel/cmph to version 2.0. Prompted by beta.repology.org. News for version 2.0 Cleaned up most warnings for the c code. Experimental C++ interface (--enable-cxxmph) implementing the BDZ algorithm in a convenient interface, which serves as the basis for drop-in replacements for std::unordered_map, sparsehash::sparse_hash_map and sparsehash::dense_hash_map. Potentially faster lookup time at the expense of insertion time. See cxxmpph/mph_map.h and cxxmph/mph_index.h for details.
2016-11-20 13:22:48 +01:00
SHA1 (cmph-2.0.tar.gz) = eabdd4cd9f9bb2fed6773caac8d91638ad2d02b7
RMD160 (cmph-2.0.tar.gz) = fdeb1807657d1cd1ad155a4c81ed222ce8c6c90a
SHA512 (cmph-2.0.tar.gz) = 7f37a8dcfce047ada9968681e07f66f014f8090aa5ce99358944a60715c7ef2bc62abf4b5c146fe99a0c812f2286ff0c009683b702a4e20c66617d955cf80caa
Size (cmph-2.0.tar.gz) = 480924 bytes
SHA1 (patch-src_brz.c) = 56060fd25dcad2844383f310e26f2ae5cd6aaabf
Make loop finite. Bump revision.
2012-04-17 19:41:40 +02:00
SHA1 (patch-src_fch__buckets.c) = 847906f8278ea8068a0897259e7a1bdfb6634d9b
Reference in a new issue Copy permalink