Apocrypha

pytrie

A 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.

Available in

OverlayNewestEbuildsLast activity
gentoo gitweb ↗ 0.4.0-r1 1 15 h details ›
tgbugs-overlay GitHub ↗ 0.4.0-r1 1 5 d details ›

Versions & arches

VersionOverlay amd64arm64x86riscvarmsparc Committed
0.4.0-r1 gentoo amd64 stable arm64 stable x86 stable riscv testing arm stable sparc testing view · download · history ↗
0.4.0-r1 tgbugs-overlay amd64 stable arm64 stable x86 stable riscv testing arm stable sparc testing 2 mo view · download · history ↗

Use flags of 0.4.0-r1

  • test Enable dependencies and/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)
2 expansion flags (python targets, ABIs, cpu flags…)
  • python_targets_python3_12
  • python_targets_python3_13

Runtime dependencies of 0.4.0-r1

show 7 lines