summaryrefslogtreecommitdiff
path: root/www/nginx-devel/files
diff options
context:
space:
mode:
authorKubilay Kocak <koobs@FreeBSD.org>2015-02-13 12:13:02 +0000
committerKubilay Kocak <koobs@FreeBSD.org>2015-02-13 12:13:02 +0000
commit4a6d5ed2f5d55f19fb6d5fd6c528c845adf5e662 (patch)
tree582932160834f9d65c1edf5652d31ad7c815a74a /www/nginx-devel/files
parentdevel/libdombey: 4.1.1 -> 4.1.2 (diff)
[NEW] devel/py-pytrie: Pure Python implementation of the trie data structure
A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key. WWW: https://bitbucket.org/gsakkis/pytrie
Notes
Notes: svn path=/head/; revision=378925
Diffstat (limited to 'www/nginx-devel/files')
0 files changed, 0 insertions, 0 deletions