Nice and simple for this part.
Nice and simple for this part.
The amount of code that was thrown away here, once the solution was clear. 😅 (I had assumed it was harder than it really was).
The amount of code that was thrown away here, once the solution was clear. 😅 (I had assumed it was harder than it really was).
Dictionary of Lists standing in for a Graph. 🙂
Dictionary of Lists standing in for a Graph. 🙂
I want to go back later and compare this (ugly) buffer idea to
String.StartsWith.
I want to go back later and compare this (ugly) buffer idea to
String.StartsWith.
I was hung up on a tiny logic error (cursor movement), but it's worked out now. 😅😪🙂
github.com/pmcgee69/Adv...
Most of what I added was this : parsers to capture 'Do' and 'Don't', and extend the main loop to call them.
I was hung up on a tiny logic error (cursor movement), but it's worked out now. 😅😪🙂
github.com/pmcgee69/Adv...
Most of what I added was this : parsers to capture 'Do' and 'Don't', and extend the main loop to call them.
Semi-inspired by the idea of Parser Combinators.
But I haven't fully absorbed the ideas ... and I want better syntax in Delphi around Optional and Result types.
It will be interesting to do this problem in Rust now.
Semi-inspired by the idea of Parser Combinators.
But I haven't fully absorbed the ideas ... and I want better syntax in Delphi around Optional and Result types.
It will be interesting to do this problem in Rust now.
Some ugliness there :/ ... might look better in the future sometime.
Some ugliness there :/ ... might look better in the future sometime.
Day 1.
Day 1.