./devel/cmph, C Minimal Perfect Hashing Library

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]


Branch: CURRENT, Version: 2.0, Package name: cmph-2.0, Maintainer: pkgsrc-users

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.


Master sites:

SHA1: eabdd4cd9f9bb2fed6773caac8d91638ad2d02b7
RMD160: fdeb1807657d1cd1ad155a4c81ed222ce8c6c90a
Filesize: 469.652 KB

Version history: (Expand)


CVS history: (Expand)


   2017-09-16 21:53:51 by Alexander Nasonov | Files touched by this commit (13)
Log message:
Drop maintainership.
   2016-11-20 13:22:48 by Alexander Nasonov | Files touched by this commit (3) | Package updated
Log message:
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.
   2015-11-03 04:29:40 by Alistair G. Crooks | Files touched by this commit (1995)
Log message:
Add SHA512 digests for distfiles for devel category

Issues found with existing distfiles:
	distfiles/eclipse-sourceBuild-srcIncluded-3.0.1.zip
	distfiles/fortran-utils-1.1.tar.gz
	distfiles/ivykis-0.39.tar.gz
	distfiles/enum-1.11.tar.gz
	distfiles/pvs-3.2-libraries.tgz
	distfiles/pvs-3.2-linux.tgz
	distfiles/pvs-3.2-solaris.tgz
	distfiles/pvs-3.2-system.tgz
No changes made to these distinfo files.

Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden).  All existing
SHA1 digests retained for now as an audit trail.
   2012-10-31 12:19:55 by Aleksej Saushev | Files touched by this commit (1460)
Log message:
Drop superfluous PKG_DESTDIR_SUPPORT, "user-destdir" is default these days.
   2012-10-12 10:01:00 by John Marino | Files touched by this commit (1)
Log message:
devel/cmph: Fix build for gcc 4.6+

Remove -Werror (catches -Wunused-but-set-variable) to fix build.
   2012-04-17 19:41:40 by Joerg Sonnenberger | Files touched by this commit (3)
Log message:
Make loop finite. Bump revision.
   2011-05-22 13:33:32 by Alexander Nasonov | Files touched by this commit (3) | Package updated
Log message:
Update devel/cmph to 1.1 and add a support for the "test" target.

News for version 1.1

  Fixed a bug in the chd_pc algorithm and reorganized tests.
   2011-04-28 22:45:49 by Alexander Nasonov | Files touched by this commit (4)
Log message:
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.