| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-12-13 | feat(2025d3): copy part 1 over to part 2 | DJ O'Leary | |
| 2025-12-13 | refactor(2025d3): clean up part 1 | DJ O'Leary | |
| 2025-12-13 | fix(2025d3): fix bug in logic | DJ O'Leary | |
| Changelog: - pattern match on list with one element instead of checking is_end variable - pattern match on c_gt_? variables instead of using if statements to ensure all possiblities are covered - reuse swap_if_higher when we have (Some _, None) instead of inserting to second slot, as this was screwing with the promotion logic | |||
| 2025-12-13 | chore(dune): also build byte code when compiling for use with ocamlearlybird | DJ O'Leary | |
| 2025-12-13 | docs(dune): replace template tag | DJ O'Leary | |
| 2025-12-13 | test(2025d3): fix property test | DJ O'Leary | |
| 2025-12-13 | test(2025d3): add property tests | DJ O'Leary | |
| 2025-12-13 | chore(2025d3): reword failwith message | DJ O'Leary | |
| 2025-12-13 | chore(task): add test:suite task | DJ O'Leary | |
| 2025-12-12 | test(2025d3): correct expected test result | DJ O'Leary | |
| co-author: @JohnDJOGrady | |||
| 2025-12-12 | test(matrix): update expect test after updating pp function | DJ O'Leary | |
| 2025-12-11 | feat(2025d6): add skeleton for part 2 | DJ O'Leary | |
| 2025-12-11 | feat(2025d6): add solution for part 1 | DJ O'Leary | |
| 2025-12-11 | feat(2025d5): add skeleton for problem | DJ O'Leary | |
| 2025-12-11 | feat(parser): add parser module | DJ O'Leary | |
| 2025-12-11 | refactor(matrix): add to_list and make pp prettier | DJ O'Leary | |
| 2025-12-11 | refactor(logger): remove own logger impl | DJ O'Leary | |
| just use Logs directly for now | |||
| 2025-12-08 | feat(range): implement range module for parsing ranges in the format "%d-%d" | DJ O'Leary | |
| 2025-12-08 | feat(2025d4): solve part 2 | DJ O'Leary | |
| solution: 8254 | |||
| 2025-12-08 | refactor(2025d4): refactor part 2 to prep for recursion | DJ O'Leary | |
| 2025-12-08 | refactor(2025,ocaml): use result type for answers to allow for returning errors | DJ O'Leary | |
| 2025-12-08 | feat(2025d4): copy part 1 into part 2 file | DJ O'Leary | |
| 2025-12-08 | feat(2025d4): solve part 1 | DJ O'Leary | |
| solution: 1320 | |||
| 2025-12-07 | refactor(matrix): convert matrix into domain module | DJ O'Leary | |
| 2025-12-07 | fix(2025d4p1): flip x and y of matrix when pretty printing | DJ O'Leary | |
| fixes: pp_matrix | |||
| 2025-12-07 | test(2025d4p1): add test case for solution of example | DJ O'Leary | |
| 2025-12-07 | refactor(2025d4p1): add newline when printing matrix to format it better | DJ O'Leary | |
| 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 | |
 |
index : codex_shredder.git | |
| Unnamed repository; edit this file 'description' to name the repository. | D.J. O'Leary |
| summaryrefslogtreecommitdiff |