aboutsummaryrefslogtreecommitdiff
path: root/devel/py-rbtree
Commit message (Collapse)AuthorAgeFilesLines
* - UnbreakMartin Wilke2008-09-112-5/+68
| | | | | | | | | - Fix build error Approved by: portmgr (pav) Notes: svn path=/head/; revision=220342
* - Mark BROKEN: does not compilePav Lucistnik2008-05-291-0/+2
| | | | | | | Reported by: pointyhat Notes: svn path=/head/; revision=213898
* - Fix buildMartin Wilke2008-03-071-15/+0
| | | | | | | Submitted by: Marcus von Appen <mva@sysfault.org> (via python@ ml) Notes: svn path=/head/; revision=208568
* Add a workaround to remove setuptool's erroneous workaround forHye-Shik Chang2007-10-291-0/+15
| | | | | | | pyrex support. Notes: svn path=/head/; revision=202253
* - Force our idea of OPSYS to get predictable egg namePav Lucistnik2007-08-011-0/+6
| | | | Notes: svn path=/head/; revision=196922
* - Needs pyrex with new pythonPav Lucistnik2007-07-301-0/+2
| | | | Notes: svn path=/head/; revision=196748
* - Make Python 2.5.1 the default Python versionAlexander Botero-Lowry2007-07-302-39/+15
| | | | | | | | | | | | | - Add significantly better support in bsd.python.mk for working with Python Eggs and the easy_install system Tested by: pointyhat runs Approved by: pav (portmgr) Most work by: perky Thanks to: pav Notes: svn path=/head/; revision=196700
* - Add missing pkg-plist in last commitLi-Wen Hsu2007-04-091-0/+14
| | | | | | | | | Approved by: clsung (mentor) Reported by: kris via pointyhat Pointy Hat to: lwhsu Notes: svn path=/head/; revision=189526
* - Add backup MASTER_SITELi-Wen Hsu2007-04-071-2/+2
| | | | | | | | | - Remove contiguous blank lines Approved by: clsung (mentor) Notes: svn path=/head/; revision=189454
* - Update to 0.8.0Li-Wen Hsu2007-04-054-33/+51
| | | | | | | | | | - Fix DOCSDIR - Assign to python@FreeBSD.org Approved by: clsung (mentor) Notes: svn path=/head/; revision=189245
* - Update to 0.7Marcus Alves Grando2006-07-104-8/+29
| | | | | | | - Update WWW Notes: svn path=/head/; revision=167354
* - New port devel/py-rbtreeMarcus Alves Grando2006-05-084-0/+99
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/ Notes: svn path=/head/; revision=161722
generated by cgit v1.2.3 (git 2.25.1) at 2025-02-27 06:46:29 +0000