| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Document the origin of neighbors subroutine | Andinus | 2021-01-26 | 2 | -0/+6 |
| | | |||||
| * | When computing neighbors, set it to an empty array | Andinus | 2021-01-26 | 1 | -3/+6 |
| | | | | | | If we don't find any neighbors then we shouldn't have to recompute this result. | ||||
| * | Remove section numbers from README, document length option | Andinus | 2021-01-25 | 2 | -48/+55 |
| | | |||||
| * | Bump version to v0.1.3, document changes v0.1.3 | Andinus | 2021-01-24 | 3 | -7/+17 |
| | | |||||
| * | Add an option to specify minimum length | Andinus | 2021-01-24 | 1 | -2/+3 |
| | | |||||
| * | Bump version to v0.1.2 v0.1.2 | Andinus | 2021-01-20 | 1 | -1/+1 |
| | | |||||
| * | Document new feature in README | Andinus | 2021-01-20 | 2 | -4/+14 |
| | | |||||
| * | Allow the input puzzle to be of any size | Andinus | 2021-01-20 | 2 | -45/+34 |
| | | | | | | | | | | | | It should still be a 2d grid but can have any number of grids, not necessarily MxN. Even this is a valid input: a b c s d e r c This input should be valid even when parsing the url. It will certainly be valid when the input is a file. | ||||
| * | Fix dates in README | Andinus | 2021-01-20 | 2 | -8/+8 |
| | | | | | I had entered 2020 everywhere out of habit, changed them all to 2021! | ||||
| * | Bump version to v0.1.1 v0.1.1 | Andinus | 2021-01-20 | 1 | -1/+1 |
| | | |||||
| * | Add install instructions to README | Andinus | 2021-01-20 | 2 | -7/+121 |
| | | |||||
| * | Document new feature (reading puzzle from file), update README | Andinus | 2021-01-20 | 2 | -7/+13 |
| | | | | | | | README was re-generated from README.org New feature was documented. | ||||
| * | Allow future versions of WWW module to be used | Andinus | 2021-01-20 | 1 | -1/+1 |
| | | |||||
| * | Read from file if passed, modify USAGE | Andinus | 2021-01-20 | 3 | -53/+86 |
| | | | | | | | Previouly, the only way of passing the puzzle was to enter a url. Now octans is able to read from files too. If the file exist & it's readable then octans will read the puzzle from there. | ||||
| * | Add latest demo link | Andinus | 2021-01-20 | 1 | -2/+5 |
| | | | | | | Octans found 10 solutions to this puzzle: https://mastodon.art/@Algot/105413312119416356 | ||||
| * | Add v0.1.0 demo links | Andinus | 2021-01-20 | 1 | -2/+3 |
| | | |||||
| * | Re-structure for CPAN upload, include a dictionary file v0.1.0 | Andinus | 2021-01-19 | 10 | -82/+355273 |
| | | | | | bin/octans calls lib/Octans/CLI.rakumod which has the MAIN subroutine. | ||||
| * | Re-implement octans, move subroutines to respective modules | Andinus | 2021-01-19 | 8 | -218/+410 |
| | | | | | | | | | | | | | | | | 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 | ||||
| * | Document the implementation | Andinus | 2021-01-14 | 1 | -1/+71 |
| | | |||||
| * | Add links to website, source, github | Andinus | 2021-01-14 | 1 | -0/+4 |
| | | |||||
| * | Add demo links | Andinus | 2021-01-14 | 1 | -4/+14 |
| | | |||||
| * | Initial commit | Andinus | 2021-01-14 | 3 | -0/+197 |