Jason W. Bacon 03b4820d4c devel/intervaltree: Minimal C++ interval tree implementation
An interval tree can be used to efficiently find a set of numeric
intervals overlapping or containing another interval.  This library
provides a basic implementation of an interval tree using C++
templates, allowing the insertion of arbitrary types into the tree.

Unbundled from biology/freebayes
2025-02-18 08:56:30 -06:00

27 lines
563 B
Makefile

PORTNAME= intervaltree
DISTVERSION= 0.1-2
DISTVERSIONSUFFIX= -gaa59377
CATEGORIES= devel
MAINTAINER= jwb@FreeBSD.org
COMMENT= Minimal C++ interval tree implementation
WWW= https://github.com/ekg/intervaltree
LICENSE= MIT
USE_GITHUB= yes
GH_ACCOUNT= ekg
INSTALL_TARGET= install-strip
PLIST_FILES= bin/interval_tree_test include/${PORTNAME}/IntervalTree.h
.include <bsd.port.pre.mk>
.if ${ARCH} == i386
post-patch:
${REINPLACE_CMD} -e 's|<bool, unsigned long>|<bool, unsigned int>|g' \
${WRKSRC}/interval_tree_test.cpp
.endif
.include <bsd.port.post.mk>