Word Tree 
Efficient lookup of next possible character(s) given a starting word fragment.
This is intended for use in word game strategies (Boggle, Scrabble, Anagram).
Usage:
>>> import word_tree
>>> with open('words.lst') as wl:
... wt = word_tree.make_word_tree([w.strip() for w in wl])
...
>>> word_tree.next_char(wt, 'do')
['c', 'e', 'd', 'g', 'i', 'm', 'l', 'o', 'n', 'p', 's', 'r', 'u', 't', 'w', 'v', 'z', None]
1 maintainer
Metadata
1 maintainer
Release files for word-tree 2.0.0
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| word_tree-2.0.0.tar.gz | 14.7 kB | Details |
Built distribution (wheel)
| File | Interpreter | ABI | Platform | Reset |
|---|---|---|---|---|
| word_tree-2.0.0-py3-none-any.whl | Python 3 | none | any | Details |
Total release size: 29.6 kB
Release files / word_tree-2.0.0.tar.gz
| Download URL | word_tree-2.0.0.tar.gz |
|---|---|
| Size | 14.7 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
a28eab09ee43547c5c126ede89cd9dc6752993071054904e7e2dfe05dff073d6
|
|
BLAKE2b-256 checksum How to use checksums |
b44814d0b3e470c4f797722cfa80f58289bca9f018761aca9cbebf35d3526f34
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/4.0.2 CPython/3.11.2
|
Release files / word_tree-2.0.0-py3-none-any.whl
| Download URL | word_tree-2.0.0-py3-none-any.whl |
|---|---|
| Size | 14.9 kB |
| Tags | Python 3 |
|
SHA-256 checksum How to use checksums |
db4c28ccafc6fb9444b4fede73bdbaf9e8273fde9851a0480d55ec6d4a17de0c
|
|
BLAKE2b-256 checksum How to use checksums |
3d24ea43d9348a86b3821daaa4365ac00e19c24d38f458e288e138d3b6993ff3
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/4.0.2 CPython/3.11.2
|
