mirror/freebsd-ports
1
0
Fork 0
mirror of https://git.FreeBSD.org/ports.git synced 2025-01-28 10:08:24 +00:00
Code Issues Releases Activity
b4be9b354e
freebsd-ports/devel/py-rbtree/Makefile

60 lines
1.7 KiB
Makefile
Raw Normal View History

- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
# New ports collection makefile for: py-rbtree
# Date created: 08 Mai 2006
# Whom: Marcus Alves Grando <mnag@FreeBSD.org>
#
# $FreeBSD$
#
PORTNAME= rbtree
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
PORTVERSION= 0.8.0
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
CATEGORIES= devel python
- Add backup MASTER_SITE - Remove contiguous blank lines Approved by: clsung (mentor)
2007-04-07 23:35:16 +00:00
MASTER_SITES= http://cheeseshop.python.org/packages/source/r/rbtree/ \
http://www.cs.nctu.edu.tw/~lwhsu/ports/distfiles/
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
PKGNAMEPREFIX= ${PYTHON_PKGNAMEPREFIX}
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
DIST_SUBDIR= python
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
MAINTAINER= python@FreeBSD.org
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
COMMENT= A fast tree with ordered data and expanded iterator support
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
BUILD_DEPENDS= easy_install:${PORTSDIR}/devel/py-setuptools \
pyrexc:${PORTSDIR}/devel/pyrex
RUN_DEPENDS= easy_install:${PORTSDIR}/devel/py-setuptools
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
USE_PYTHON= yes
USE_PYDISTUTILS= yes
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
PYDISTUTILS_BUILD_TARGET= bdist_egg
PYDISTUTILS_INSTALL_TARGET= easy_install
PYDISTUTILS_INSTALLARGS= -O 1 -N -S ${PYTHON_SITELIBDIR} ${WRKSRC}/dist/${PYRBTREE_EGG}
PYRBTREE_EGG= ${PORTNAME}-${PORTVERSION}-py${PYTHON_VER}-${OSINFOS}.egg
OSINFOS= ${OPSYS:L}-${OSRELEASE}-${ARCH}
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
PLIST_SUB+= PYRBTREE_EGG=${PYRBTREE_EGG}
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
.if !defined(NOPORTDOCS)
DOCSDIR= ${PREFIX}/share/doc/py-${PORTNAME}
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
PORTDOCS= *
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
.endif
pre-build:
@cd ${WRKSRC} && ${PYTHON_CMD} setup.py setopt -c build -o build-platlib -s lib.${OSINFOS}
@cd ${WRKSRC} && ${PYTHON_CMD} setup.py setopt -c build -o build-temp -s temp.${OSINFOS}-${PYTHON_VER}
@cd ${WRKSRC} && ${PYTHON_CMD} setup.py setopt -c bdist_egg -o plat-name -s ${OSINFOS}
@cd ${WRKSRC} && ${PYTHON_CMD} setup.py setopt -c bdist -o plat-name -s ${OSINFOS}
- New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/
2006-05-08 14:25:19 +00:00
post-install:
.if !defined(NOPORTDOCS)
@${MKDIR} ${DOCSDIR}
${INSTALL_DATA} ${WRKSRC}/README.txt ${DOCSDIR}
.endif
test: build
(cd ${WRKSRC} && ${PYTHON_CMD} test_rbtree.py)
- Update to 0.8.0 - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor)
2007-04-05 02:17:16 +00:00
.include <bsd.port.pre.mk>
OSRELEASE!= uname -r
.include <bsd.port.post.mk>
Reference in New Issue Copy Permalink