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

15 lines
356 B
Makefile
Raw Normal View History

s/netbsd.org/NetBSD.org/
2003-07-17 23:21:03 +02:00
# $NetBSD: Makefile,v 1.6 2003/07/17 21:29:38 grant Exp $
AVLtree is a small, malloc-based, in-memory index package generally like B-trees and hash tables. The interface resembles that of the BPLUS (B-tree) index package. Index creation options are: - fixed-length binary keys OR variable-length string keys - unique OR duplicate keys - with duplicate keys: standard (void *) pointers for each key OR instance-counting (saves time and memory) Key insert/search time is O(log N). Package submitted in PR 9252 by wrstuden@netbsd.org, assembled by Bill Ross.
2000-01-20 02:40:10 +01:00
DISTNAME= avltree-1.1
CATEGORIES= devel
MASTER_SITES= ftp://odin.compchem.ucsf.edu/pub/amber/
s/netbsd.org/NetBSD.org/
2003-07-17 23:21:03 +02:00
MAINTAINER= wrstuden@NetBSD.org
There are times when libtool is complete overkill. This is one of them. Use a BSD-style makefile for this package.
2000-01-20 12:15:59 +01:00
#HOMEPAGE=
Update to new COMMENT style: COMMENT var in Makefile instead of pkg/COMMENT.
2001-02-16 15:38:16 +01:00
COMMENT= In-memory index w/ binary and string keys and key counts
AVLtree is a small, malloc-based, in-memory index package generally like B-trees and hash tables. The interface resembles that of the BPLUS (B-tree) index package. Index creation options are: - fixed-length binary keys OR variable-length string keys - unique OR duplicate keys - with duplicate keys: standard (void *) pointers for each key OR instance-counting (saves time and memory) Key insert/search time is O(log N). Package submitted in PR 9252 by wrstuden@netbsd.org, assembled by Bill Ross.
2000-01-20 02:40:10 +01:00
There are times when libtool is complete overkill. This is one of them. Use a BSD-style Makefile for this package.
2000-01-20 12:13:04 +01:00
MANCOMPRESSED_IF_MANZ= yes
INSTALL_TARGET= includes install
AVLtree is a small, malloc-based, in-memory index package generally like B-trees and hash tables. The interface resembles that of the BPLUS (B-tree) index package. Index creation options are: - fixed-length binary keys OR variable-length string keys - unique OR duplicate keys - with duplicate keys: standard (void *) pointers for each key OR instance-counting (saves time and memory) Key insert/search time is O(log N). Package submitted in PR 9252 by wrstuden@netbsd.org, assembled by Bill Ross.
2000-01-20 02:40:10 +01:00
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink