ladies and gentlemen, the day has come. I'm going to be honest. The holiday season has me busier than I expected. I've got people coming in town from family. I've got work travel coming up. But I don't want to let down my community. I have self-chosen. I have elected. I have sacrificed myself today. AOC day9 to attempt to write it in Haskell. Now I'm going to be completely honest. I have written this many zero lines of HLL in my entire life. I am going to need to be aided by chat. If you see me looking like this, I am getting help from chat. AOC Day N in HLL. Let's get after it. HLL SL time to write a white paper. You ride the camel through the sandstorm and stop where the ghost Maps told you to stop. The sandstorm subsequently subsides somehow, seeing you're standing in an oasis. That is an intentional tongue twister. The sandstorm subsequently subsides somehow. You're seeing someone standing in the Oasis. The camel goes to

get you some water, and you stretch, uh, and you stretch your neck. Okay, weird. As you look up, you discover, discover what must be yet another giant floating island. Thank God, this one made of metal. That must be where the parts to fix the sand machines come from. There's even a hang glider partially buried in the sand. There, once the sun rises and heats up the sand, you may be able to use the glider and the hot air to get all the way up to Metal Island. While you wait for the sun to rise, you admire the Oasis hidden here in the middle of Desert Island. It must have a delicate ecosystem. You might as well take some ecological readings while you wait. Maybe you can report any environmental instabilities you find to somebody so the Oasis can be around for the next sandstorm-worn traveler. You pull out your handy Oasis in Sand Instability Sensor, and that literally spells Oasis. Wow, that's a recursive acronym, and analyze your surroundings. The Oasis produces a report of many values and how they are changing.

over time, your puzzle input. Each line in the report contains the history of a single value. For example, to best protect the Oasis, your environmental report should include a prediction of the next value in each history. To do this, start by making a new sequence from the difference at each step of your history. If that sequence is not all zeros, repeat the process. In the above data set, for example, the first history is zero, yep, so because that value increases by three each step, the first sequence of differences that you generate will be 3 3 3 3 3. Note that this sequence has one fewer value than the input sequence because each sequence considers two numbers. Yeah, so I'm doing the difference between all of three, so the length of that is n minus one. Great. Since these values aren't all zero, repeat this process. The values differ by zero at each step, so the next sequence is 0 0 0 0. This means you have enough information to extrapolate the history. Okay, okay, okay, get the

difference between these the difference between these and kind of like recursively just to do them all until I get to the end right to extrapolate start by adding a new zero to the end of your list of zeros because zeros repr place. Okay hold on so uh you can then start filling in placeholders from the bottom up. A needs to be the result of increasing by three value to its left by zero. If you find the value for the next for each history in this example and add them together you get 114 each line. Okay so you have to I see I see I see like you could do this by hand but you couldn't do this by hand for all of the values. Okay okay so hll hll hll hasle so in hasal I know everything is done functionally so I'm trying to mentally figure out how like to run this as like a map. Can this be done as like a fold operation well no folds reduced into a single number. Hold on hold on hold on let's get let's get the basics going.

here main definition is an IO type Jesus. main equals do contents equals read file and I'm doing it that because it unpacks a monad. I know that much. I've read that much but that was it work print is it lines contents right. we have to like it. it takes all the lines out go do run run guys. how do we run hasle main great. thank you so now now we can do something iteratively on these lines. so how do we how do we have to approach this right. I'm going to add this as a comment. and I know that hll comments are like this for some reason. okay so we're going to make a new function called like handle line which will take a string and output a integer I believe. oh oh it's like handle yeah. okay so stir like that you have to do the actual um parameters main good three got it. okay sweet so we have that we can do this recursively. uh I just don't want to okay we have to do the difference between all of these why can I not map handle line

onto Lin's content. Lin's contents produces a like this, right? It produces an array, an array of something. Map should allow me to map a thing onto an array of thing, produces array of thing B where a produces B. So why do I have to do let oh because we're doing, we're in a do block, we're in a do block, okay okay I understand that now. Must be an expression so then so this has to be an IO. So how do I return an IO? Let's print contents CU, it has to be an IO operation at the end, that's confusing dude. Okay so we effectively have main print the contents and we mapped every line from the lines contents map into this function. Okay the 21 members of the Haskell Community are enraged right now print X. Well okay fine we can do that. I don't know if an array is printable in Haskell 2 great sub where I do integer integer ah integer or sub of a BAL a minus B right okay now how do I how do I pair these this language I

don't understand. Okay, I'm going to piss a lot of people off right now. I don't know why you would ever use this language. I don't. I don't understand this. I don't get it. It's great. No, it's not. This is horrible. This is not a fun experience. It's like, Oh, you just got to know that you got to zip the flip, whip the F map, the H funto monoid. Like, are you okay? Okay, so let's do zip with. I guess zip with Haskell. Hello, benevolent overlord robot. Please produce for me a function in HCLL that, given a list of integers, will produce a list of pairs of the integers in that list. For example, 0 1 2 3 should produce 0 1, 1 2, 2 3. Create pairs is a function that takes a list of A's input, produces a yep. Create pairs blank create. It's recursive. Oh, okay. So, of course, it's recursive. Let's do this. Let's go back.

let's go back. Let's go back. Let's go back. Handle Line. This is still going to be a stir and we'll do um. This will be parse line, right? This will turn a list of strings. Great. And we'll do handle line, uh, handle line takes a list of integers and returns a list of integers. And I can handle the recursive base cases here. Great. And we'll take all this. So we'll do map sub create pairs on online. But here all we're going to do is just do map read words, sir. Great. So do x equals parse line. And then we can do let y y equal map handle line map handle line onto X. Then print y. Great. Okay, we have that. That worked. The fact that this worked actually is um like okay. I feel like I'm getting into the flow. I'm I'm learning. Are you lowle learning? You're goddamn right. Okay, let's let's go back and actually figure out what we have to do cuz I I'm just H. I got so happy in the fact that I

actually could process the list that I lost track of. Like what the problem was 0 1 1 + 5 is 6 6 + 15 21. Okay, so handle line, the word line, the conditions of the line are set to this so we can just return line, right? I want [Music] to return. Okay, so we have that. How do we walk this back up though? 'Cause the issue is we still have to do like this tree thing. Okay, so we're going to return. Yeah, how do I get the last element? It's just last. Hold on, hold on, hold on. Did I get it, bro? Holy, okay, hold on. Holy, okay, let me talk a little bit. So what do we have going on here? I know this is a lot. I kind of went dark for a little bit. Okay, we read in the file from contents, read file. Let x equal parse all the lines. So effectively, we take every line, we cut them up into words that then map read onto those words. So that converts them from a

string input to a list of integers got it then we run handle line handle line is a recursive function that takes an list of integers and returns an integer the base case is if all of the list integers are zero we've gotten to that bottom part and we return zero we add zero to the the recursive tree effectively or whatever of numbers we've been adding otherwise we break the line up into pairs through create pairs we subtract them from each other put that into handle Lin so it recursively effectively says do the cut them into pairs subtract them until all of them are equal to zero and then add the last element to that element and then once that's done we get the next number in the pattern okay so let's let's put in the actual sample input and see if I got it okay guys guys guys guys guys guys guys guys guys guys guys guys guys I have a number didn't crash oh my [Applause] God I need you to understand something I am like I am like oh he's a YouTuber

like he he's dramatic for Content. No, I need you to understand that ever since Haskell has gone on the board, I have actually had nightmares about getting Haskell on this wheel. So, to rid myself of that daily stress, I literally had to come on here on a Saturday when I didn't have to worry about not going to work and taking PTO to do Advent of code and just bang it out. And here we are, guys, day nine in Haskell. It's complete first try. If you enjoyed that, go watch this video. You'll enjoy it just as well. I appreciate it.

C Programmer Learns Haskell and DOESN'T Cry? (Coding in a Random Language Every Day)

Teaching you 🧠 about the lowest level


C Programmer Learns Haskell and DOESN'T Cry? (Coding in a Random Language Every Day)

C Programmer Learns Haskell and DOESN'T Cry? (Coding in a Random Language Every Day)

스크립트