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

21 lines
436 B
Makefile
Raw Normal View History

all: migrate some SourceForge homepage URLs back from https to http https://mail-index.netbsd.org/pkgsrc-changes/2020/01/18/msg205146.html In the above commit, the homepage URLs were migrated from http to https, assuming that SourceForge would use the same host names for both http and https connections. This assumption was wrong. Their documentation at https://sourceforge.net/p/forge/documentation/Custom%20VHOSTs/ states that the https URLs use the domain sourceforge.io instead. To make the homepages from the above commit reachable again, pkglint has been extended to check for reachable homepages. This check is only enabled when the --network command line option is given. Each of the homepages that referred to https://$project.sourceforge.net before was migrated to https://$project.sourceforge.io (27), and if that was not reachable, to the fallback URL http://$project.sourceforge.net (163).
2020-01-26 06:26:08 +01:00
# $NetBSD: Makefile,v 1.9 2020/01/26 05:26:22 rillig 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
DISTNAME= cmph-2.0
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
CATEGORIES= devel
MASTER_SITES= ${MASTER_SITE_SOURCEFORGE:=cmph/}
Drop maintainership.
2017-09-16 21:53:50 +02:00
MAINTAINER= pkgsrc-users@NetBSD.org
all: migrate some SourceForge homepage URLs back from https to http https://mail-index.netbsd.org/pkgsrc-changes/2020/01/18/msg205146.html In the above commit, the homepage URLs were migrated from http to https, assuming that SourceForge would use the same host names for both http and https connections. This assumption was wrong. Their documentation at https://sourceforge.net/p/forge/documentation/Custom%20VHOSTs/ states that the https URLs use the domain sourceforge.io instead. To make the homepages from the above commit reachable again, pkglint has been extended to check for reachable homepages. This check is only enabled when the --network command line option is given. Each of the homepages that referred to https://$project.sourceforge.net before was migrated to https://$project.sourceforge.io (27), and if that was not reachable, to the fallback URL http://$project.sourceforge.net (163).
2020-01-26 06:26:08 +01:00
HOMEPAGE= http://cmph.sourceforge.net/
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
COMMENT= C Minimal Perfect Hashing Library
LICENSE= gnu-lgpl-v2 OR mpl-1.1
USE_LIBTOOL= yes
GNU_CONFIGURE= yes
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
TEST_DIRS= tests
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-05-22 13:33:31 +02:00
TEST_TARGET= check
devel/cmph: Fix build for gcc 4.6+ Remove -Werror (catches -Wunused-but-set-variable) to fix build.
2012-10-12 10:01:00 +02:00
BUILDLINK_TRANSFORM+= rm:-Werror
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
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink