▲ 18 ▼ The official awful.systems Advent of Code 2023 thread (awful.systems) submitted 2 years ago* (last edited 2 years ago) by gerikson@awful.systems to c/notawfultech@awful.systems 121 comments fedilink hide all child comments Rules: no spoilers. The other rules are made up as we go along. Share code by link to a forge, home page, pastebin (Eric Wastl has one here) or code section in a comment.
[–] self@awful.systems 4 points 2 years ago (2 children) // Where we're going we won't need regexes. fuck yes permalink fedilink source parent hideshow 2 child comments replies: [–] froztbyte@awful.systems 4 points 2 years ago (1 child) honestly I considered writing a parser-based approach then I was too tired and thought "hmm, doing this with grok would be funny", but I didn't have logstash handy and fuck dealing with containers at midnight I will, however, do that today permalink fedilink source parent hideshow 1 child comment replies: [–] froztbyte@awful.systems 4 points 2 years ago Status report: grok allows for non-greedy matching but still captures greedily for term assignment. I think I have a workaround that might work (recursively pipe data back to itself, gated on length for action), need to test later This particular flavour of parsecrime is near guaranteed to be of interest to very few, but I want to see if I can make it work nonetheless. That’s just how my brainworms work. permalink fedilink source parent
[–] froztbyte@awful.systems 4 points 2 years ago (1 child) honestly I considered writing a parser-based approach then I was too tired and thought "hmm, doing this with grok would be funny", but I didn't have logstash handy and fuck dealing with containers at midnight I will, however, do that today permalink fedilink source parent hideshow 1 child comment replies: [–] froztbyte@awful.systems 4 points 2 years ago Status report: grok allows for non-greedy matching but still captures greedily for term assignment. I think I have a workaround that might work (recursively pipe data back to itself, gated on length for action), need to test later This particular flavour of parsecrime is near guaranteed to be of interest to very few, but I want to see if I can make it work nonetheless. That’s just how my brainworms work. permalink fedilink source parent
[–] froztbyte@awful.systems 4 points 2 years ago Status report: grok allows for non-greedy matching but still captures greedily for term assignment. I think I have a workaround that might work (recursively pipe data back to itself, gated on length for action), need to test later This particular flavour of parsecrime is near guaranteed to be of interest to very few, but I want to see if I can make it work nonetheless. That’s just how my brainworms work. permalink fedilink source parent