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

17 lines
301 B
Makefile
Raw Normal View History

Add NO_STAGE all over the place in preparation for the staging support (cat: devel part 1)
2013-09-20 19:03:26 +02:00
# Created by: Jesse Kempf (jessekempf@gmail.com)
CMPH - C Minimal Perfect Hashing Library A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal. Minimal perfect hash functions are widely used for memory efficient storage and fast retrieval of items from static sets, such as words in natural languages, reserved words in programming languages or interactive systems, universal resource locations (URLs) in Web search engines, or item sets in data mining techniques. Therefore, there are applications for minimal perfect hash functions in information retrieval systems, database systems, language translation systems, electronic commerce systems, compilers, operating systems, among others. WWW: http://cmph.sourceforge.net/ PR: 149248 Submitted by: Jesse Kempf <jkempf@davisvision.com>
2010-08-17 22:32:16 +02:00
# $FreeBSD$
PORTNAME= cmph
Update to version 2.0. Maintainer timeout.
2013-02-28 11:53:04 +01:00
PORTVERSION= 2.0
CMPH - C Minimal Perfect Hashing Library A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal. Minimal perfect hash functions are widely used for memory efficient storage and fast retrieval of items from static sets, such as words in natural languages, reserved words in programming languages or interactive systems, universal resource locations (URLs) in Web search engines, or item sets in data mining techniques. Therefore, there are applications for minimal perfect hash functions in information retrieval systems, database systems, language translation systems, electronic commerce systems, compilers, operating systems, among others. WWW: http://cmph.sourceforge.net/ PR: 149248 Submitted by: Jesse Kempf <jkempf@davisvision.com>
2010-08-17 22:32:16 +02:00
CATEGORIES= devel
Fix MASTER_SITES. Version 2.0 is located one directory up. PR: ports/178460 Submitted by: John Marino <draco@marino.st> (maintainer)
2013-05-12 00:23:52 +02:00
MASTER_SITES= SF/${PORTNAME}/${PORTNAME}
CMPH - C Minimal Perfect Hashing Library A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal. Minimal perfect hash functions are widely used for memory efficient storage and fast retrieval of items from static sets, such as words in natural languages, reserved words in programming languages or interactive systems, universal resource locations (URLs) in Web search engines, or item sets in data mining techniques. Therefore, there are applications for minimal perfect hash functions in information retrieval systems, database systems, language translation systems, electronic commerce systems, compilers, operating systems, among others. WWW: http://cmph.sourceforge.net/ PR: 149248 Submitted by: Jesse Kempf <jkempf@davisvision.com>
2010-08-17 22:32:16 +02:00
MAINTAINER= jessekempf@gmail.com
COMMENT= Minimal perfect hashes for C
GNU_CONFIGURE= yes
This changes almost all the "gnomehack" only USE_GNOME cases to USES= pathfix. If a port used other USE_GNOME items it was untouched. The ports that used other USES were fixed by hand. PR: ports/177081 Reviewed by: bapt Approved by: portmgr (miwi)
2013-03-19 14:04:30 +01:00
USES= pathfix
CMPH - C Minimal Perfect Hashing Library A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal. Minimal perfect hash functions are widely used for memory efficient storage and fast retrieval of items from static sets, such as words in natural languages, reserved words in programming languages or interactive systems, universal resource locations (URLs) in Web search engines, or item sets in data mining techniques. Therefore, there are applications for minimal perfect hash functions in information retrieval systems, database systems, language translation systems, electronic commerce systems, compilers, operating systems, among others. WWW: http://cmph.sourceforge.net/ PR: 149248 Submitted by: Jesse Kempf <jkempf@davisvision.com>
2010-08-17 22:32:16 +02:00
USE_LDCONFIG= yes
.include <bsd.port.mk>
Reference in a new issue Copy permalink