| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-12-07 | refactor(2025d4p1): document pp_matrix and add expect_test for it | DJ O'Leary | |
| test fails as of now as matrix is rotated | |||
| 2025-12-07 | fix(2025d4p1): make points accessible as (x,y) | DJ O'Leary | |
| breaks: pp_matrix | |||
| 2025-12-07 | feat(2025d4p1): add code to convert input into a matrix and pp the matrix | DJ O'Leary | |
| 2025-12-07 | feat(2025d3p1): started on alternative solution | DJ O'Leary | |
| Alternative solution is to scan each line once to find the index of the largest left-most and non-final digit. Then getting a substring of the line [idx, len) and finding the largest digit in that substring. These digits concatenated together should be the biggest 2 digit number that can be made from the line | |||
| 2025-12-06 | feat(2025d3p1): partial solution, getting the wrong answer | DJ O'Leary | |
| Manually did entire real input and codified into tests but even sum of manual answer is wrong. Code fails for some lines of real input and these failing lines have been reduced into regression tests. work-in-progress: true | |||
| 2025-12-05 | feat(2025d4p1): create skeleton | DJ O'Leary | |
| 2025-12-05 | feat(logger): implement logger functor | DJ O'Leary | |
| still needs to be injected somehow | |||
| 2025-12-04 | docs(2025d03p01): add implementation plan | DJ O'Leary | |
| 2025-12-04 | feat(2025d3p1): create skeleton | DJ O'Leary | |
| 2025-12-04 | feat(log): add log module | DJ O'Leary | |
| still need to figure out how I can inject this into the application layer however | |||
| 2025-12-04 | feat(2025d2p2): solve 2025 day 2 part 2 | DJ O'Leary | |
| 2025-12-03 | refactor(2025): update cli output to include colour | DJ O'Leary | |
| 2025-12-03 | refactor(2025d2p1): use Seq instead of List so that elements can be ↵ | DJ O'Leary | |
| transformed one at a time this reduces allocation overhead | |||
| 2025-12-03 | feat(2025d2p2): remove existing rules and make validation rules OR instead ↵ | DJ O'Leary | |
| of AND | |||
| 2025-12-03 | feat(2025d2p2): copy part 1 solution as part 2 for editing | DJ O'Leary | |
| 2025-12-03 | feat(2025d2p1): solve day 2 part 1 | DJ O'Leary | |
| 2025-12-02 | feat(2025d2p1): parse input into tuples | DJ O'Leary | |
| 2025-12-02 | fix(2025d2p1): use correct file | DJ O'Leary | |
| 2025-12-02 | feat(2025d2p1): setup day 2 part 1 | DJ O'Leary | |
| 2025-12-02 | refactor(cli): factor out shared code | DJ O'Leary | |
| 2025-12-02 | feat(2025d1p2): implement solution to problem | DJ O'Leary | |
| 2025-12-02 | docs: fix day 1 part 1 docs | DJ O'Leary | |
| 2025-12-02 | refactor(file): rename File_reader module to File | DJ O'Leary | |
| 2025-12-01 | feat(file): implement file reader | DJ O'Leary | |
| 2025-12-01 | refactor(2025d1p1): rename files to order correctly and include part number | DJ O'Leary | |
| 2025-12-01 | feat(2025d1p1): implement application logic and apply to example | DJ O'Leary | |
| 2025-12-01 | feat(2025d1p1): implement Dial module | DJ O'Leary | |
| 2025-12-01 | refactor: setup Log package in main | DJ O'Leary | |
| 2025-12-01 | refactor: add version | DJ O'Leary | |
| 2025-12-01 | refactor: change text | DJ O'Leary | |
| 2025-12-01 | refactor: remove own logger implementation and use logs | DJ O'Leary | |
| 2025-11-29 | feat(dune): add inline_tests to dune files | DJ O'Leary | |
| 2025-11-29 | chore: use updated template | DJ O'Leary | |
| 2025-11-19 | chore: add used libs | DJ O'Leary | |
| 2025-11-19 | chore: replace template files | DJ O'Leary | |
| 2025-11-19 | chore: clone ocaml_template for 2025 | DJ O'Leary | |
 |
index : codex_shredder.git | |
| Unnamed repository; edit this file 'description' to name the repository. | D.J. O'Leary |
| summaryrefslogtreecommitdiff |