py314-pygtrie (python/py-pygtrie) Updated: 2 days, 10 hours ago Add to my watchlist

Trie data structure implementation.

pygtrie is a pure Python implementation of a trie data structure. Trie data structure, also known as radix or prefix tree, is a tree associating keys to values where all the descendants of a node have a common prefix (associated with that node). The trie module contains Trie, CharTrie and StringTrie classes each implementing a mutable mapping interface, i.e. dict interface. As such, in most circumstances, Trie could be used as a drop-in replacement for a dict, but the prefix nature of the data structure is trie’s real strength. The module also contains PrefixSet class which uses a trie to store a set of prefixes such that a key is contained in the set if it or its prefix is stored in the set.

Version: 2.5.0 License: Apache-2 GitHub
Reset

15 build(s) found
Builder Build Number Start Time Elapsed Time Watcher Build Status
10.6.x86_64 263356 2026-02-27 20:48:19 0:00:55 78084 build successful
10.6 225552 2026-02-27 20:47:53 0:01:03 78016 build successful
10.8 229948 2026-02-27 20:47:22 0:01:12 75685 build successful
10.9 330641 2026-02-27 20:46:52 0:00:43 104884 build successful
10.7 245427 2026-02-27 20:46:09 0:00:41 77658 build successful
10.10 322565 2026-02-27 20:45:31 0:00:42 105206 build successful
10.12 323270 2026-02-27 20:45:12 0:00:52 104077 build successful
10.14 252580 2026-02-27 20:44:43 0:01:35 86668 build successful
11 202258 2026-02-27 20:44:17 0:00:45 65757 build successful
10.15 229498 2026-02-27 20:43:59 0:00:42 75793 build successful
10.13 279277 2026-02-27 20:43:39 0:00:45 96038 build successful
12 151634 2026-02-27 20:43:10 0:00:35 54678 build successful
12.arm64 161220 2026-02-27 20:42:44 0:00:22 54376 build successful
13.arm64 98784 2026-02-27 20:42:20 0:00:20 40159 build successful
15 50302 2026-02-27 20:41:38 0:00:32 16102 build successful