4f2b97be90
go-radix provides the `radix` package that implements a radix tree. The package only provides a single `Tree` implementation, optimized for sparse nodes. As a radix tree, it provides the following: * O(k) operations. In many cases, this can be faster than a hash table since the hash function is an O(k) operation, and hash tables have very poor cache locality. * Minimum / Maximum value lookups * Ordered iteration For an immutable variant, see go-immutable-radix.
20 lines
536 B
Makefile
20 lines
536 B
Makefile
# $NetBSD: Makefile,v 1.1 2020/04/18 15:51:55 nikita Exp $
|
|
|
|
GITHUB_PROJECT= go-radix
|
|
GITHUB_TAG= v1.0.0
|
|
DISTNAME= v1.0.0
|
|
PKGNAME= ${GITHUB_PROJECT}-${DISTNAME:S,^v,,}
|
|
CATEGORIES= devel
|
|
MASTER_SITES= ${MASTER_SITE_GITHUB:=armon/}
|
|
DIST_SUBDIR= ${GITHUB_PROJECT}
|
|
|
|
MAINTAINER= pkgsrc-users@NetBSD.org
|
|
HOMEPAGE= https://github.com/armon/go-radix/
|
|
COMMENT= Golang implementation of Radix trees
|
|
LICENSE= mit
|
|
|
|
GO_DIST_BASE= ${PKGNAME}
|
|
GO_SRCPATH= github.com/armon/go-radix
|
|
|
|
.include "../../lang/go/go-package.mk"
|
|
.include "../../mk/bsd.pkg.mk"
|