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.
1 maintainer
Metadata
1 maintainer
Release files for PyTrie 0.1
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| PyTrie-0.1.tar.gz | 96.1 kB | Details |
Release files / PyTrie-0.1.tar.gz
| Download URL | PyTrie-0.1.tar.gz |
|---|---|
| Size | 96.1 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
4573ca1b23a5ba87261394b503c77962eef9b383c20439f0006c598e65e14137
|
|
BLAKE2b-256 checksum How to use checksums |
32dcc340f20a93b7a1baaa359a60007303a561441899ebcc27f657485735a403
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
