FreshPorts -- The Place For Ports If you buy from Amazon USA, please support us by using this link.
Follow us
Blog
Twitter

Port details
py-pytrie Pure Python implementation of the trie data structure
0.2 devel on this many watch lists=1 search for ports that depend on this port Find issues related to this port Report an issue related to this port
Maintainer: koobs@FreeBSD.org search for ports maintained by this maintainer
Port Added: 13 Feb 2015 12:13:15
Also Listed In: python
License: BSD3CLAUSE
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
SVNWeb : Homepage : PortsMon

To install the port: cd /usr/ports/devel/py-pytrie/ && make install clean
To add the package: pkg install py27-pytrie

PKGNAME: py27-pytrie

distinfo:

SHA256 (PyTrie-0.2.tar.gz) = b272021351efadc6757591aac03ed4794bdfd091122204a4673e94bfb66cc500
SIZE (PyTrie-0.2.tar.gz) = 96378


NOTE: FreshPorts displays only information on required and default dependencies. Optional dependencies are not covered.

Build dependencies:
  1. py27-setuptools27>0 : devel/py-setuptools27
  2. python2.7 : lang/python27
Runtime dependencies:
  1. py27-setuptools27>0 : devel/py-setuptools27
  2. python2.7 : lang/python27
There are no ports dependent upon this port

Configuration Options
     No options to configure

USES:
python

Master Sites:
  1. https://files.pythonhosted.org/packages/source/P/PyTrie/
  2. https://pypi.python.org/packages/source/P/PyTrie/

Number of commits found: 1

Commit History - (may be incomplete: see SVNWeb link above for full details)
DateByDescription
13 Feb 2015 12:13:02
Original commit files touched by this commit  0.2
Revision:378925
koobs search for other commits by this committer
[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

Number of commits found: 1

Login
User Login
Create account

Servers and bandwidth provided by
New York Internet, SuperNews, and RootBSD

This site
What is FreshPorts?
About the authors
Issues
FAQ
How big is it?
The latest upgrade!
Privacy
Forums
Blog
Contact

Search
Enter Keywords:
 
more...

Latest Vulnerabilities
arjOct 19
mariadb100-serverOct 19
mariadb101-serverOct 19
mariadb102-serverOct 19
mariadb55-serverOct 19
mysql55-serverOct 19
mysql56-serverOct 19
mysql57-serverOct 19
percona55-serverOct 19
percona56-serverOct 19
percona57-serverOct 19
krb5Oct 18
krb5-113Oct 18
krb5-114Oct 18
krb5-115Oct 18

21 vulnerabilities affecting 90 ports have been reported in the past 14 days

* - modified, not new

All vulnerabilities


Ports
Home
Categories
Deleted ports
Sanity Test Failures
Newsfeeds

Statistics
Graphs
NEW Graphs (Javascript)
Traffic

Calculated hourly:
Port count 31595
Broken 153
Deprecated 64
Ignore 422
Forbidden 0
Restricted 175
No CDROM 78
Vulnerable 58
Expired 20
Set to expire 57
Interactive 0
new 24 hours 11
new 48 hours12
new 7 days27
new fortnight47
new month107

Servers and bandwidth provided by
New York Internet, SuperNews, and RootBSD
Valid HTML, CSS, and RSS.
Copyright © 2000-2017 Dan Langille. All rights reserved.