Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Bump version to v0.1.4, document changes v0.1.4 | Andinus | 2021-02-19 | 1 | -6/+27 |
| | |||||
* | Document the origin of neighbors subroutine | Andinus | 2021-01-26 | 1 | -0/+3 |
| | |||||
* | Remove section numbers from README, document length option | Andinus | 2021-01-25 | 1 | -46/+52 |
| | |||||
* | Bump version to v0.1.3, document changes v0.1.3 | Andinus | 2021-01-24 | 1 | -6/+13 |
| | |||||
* | Document new feature in README | Andinus | 2021-01-20 | 1 | -4/+11 |
| | |||||
* | Fix dates in README | Andinus | 2021-01-20 | 1 | -5/+5 |
| | | | | I had entered 2020 everywhere out of habit, changed them all to 2021! | ||||
* | Add install instructions to README | Andinus | 2021-01-20 | 1 | -7/+81 |
| | |||||
* | Document new feature (reading puzzle from file), update README | Andinus | 2021-01-20 | 1 | -5/+10 |
| | | | | | | README was re-generated from README.org New feature was documented. | ||||
* | Re-implement octans, move subroutines to respective modules | Andinus | 2021-01-19 | 1 | -0/+85 |
Initially it went over the list of words & checked if they exist in the grid. This was very slow. Currently it walks the grid & checks if the current string exist in the dictionary. This is faster for these reasons: • The dictionary is sorted, we perform binary range search on the dictionary to return the list of all words that start with specific string. • Starting positions are limited. If the dictionary wasn't sorted then this probably would've been |