about summary refs log tree commit diff stats
path: root/lib
Commit message (Collapse)AuthorAgeFilesLines
* Read from file if passed, modify USAGEAndinus2021-01-202-53/+82
| | | | | | 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.
* Re-structure for CPAN upload, include a dictionary file v0.1.0Andinus2021-01-195-6/+105
| | | | bin/octans calls lib/Octans/CLI.rakumod which has the MAIN subroutine.
* Re-implement octans, move subroutines to respective modulesAndinus2021-01-194-0/+246
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
d5c5ad1a79151340680f174b51218e7247562b35'>^
065e4e5 ^


5c18591





1dcd417 ^

5b6b5a6 ^
5c18591
5c18591
065e4e5 ^


5c18591

c18f3c0 ^
8a28f6e ^


c18f3c0 ^

5c18591



bdde9c7 ^





5c18591




065e4e5 ^

bdde9c7 ^

1dcd417 ^

065e4e5 ^

5b6b5a6 ^

1dcd417 ^



8a28f6e ^
1dcd417 ^
8a28f6e ^








065e4e5 ^
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89