9273818eb1
Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash. To support ruby-sorted_set Feed back and ok jeremy@
19 lines
288 B
Makefile
19 lines
288 B
Makefile
COMMENT = sorted associative collection
|
|
|
|
DISTNAME = rbtree-0.4.5
|
|
|
|
CATEGORIES = devel
|
|
|
|
HOMEPAGE = https://github.com/mame/rbtree
|
|
|
|
MAINTAINER = Kurt Mosiejczuk <kmos@openbsd.org>
|
|
|
|
# MIT
|
|
PERMIT_PACKAGE = Yes
|
|
|
|
MODULES = lang/ruby
|
|
|
|
CONFIGURE_STYLE = ruby gem ext
|
|
|
|
.include <bsd.port.mk>
|