py311-pytrie
0.4.0_1Pure 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.
Origin: devel/py-pytrie
Category: devel
Size: 58.5KiB
License: BSD3CLAUSE
Maintainer: bofh@FreeBSD.org
Dependencies: 2 packages
Required by: 1 packages
Website: github.com/gsakkis/pytrie
$
pkg install py311-pytrieDependencies (2)
Required By (1 packages)
More in devel
ruby33-gems3.7.2
Package management framework for the Ruby languagegettext-runtime0.26
GNU gettext runtime libraries and programsglib2.84.4,2
Some useful routines of C programming (current stable version)desktop-file-utils0.28
Couple of command line utilities for working with desktop entriesqt6-base6.10.1_1
Qt base (core, gui, widgets, network,...)qt5-core5.15.18p109
Qt core non-graphical module (KDE patched)rubygem-aws-sigv41.12.1
Amazon Web Services Signature Version 4 signing libraryphp84-pear1.10.17
PEAR framework for PHPrubygem-aws-sdk-core3.240.0
AWS SDK for Ruby - Corephp82-pear1.10.17
PEAR framework for PHP