Today’s exercism exercises. I need to sneak in an extra seven to get back down to one per day. I am impressed I got through two marked hard.

  • Custom Set – Implement a custom set. We won’t tell you what functions we want, and we don’t say that the tests require add to return the set so we can chain operations. Just guess. I was just using for loops but the community solutions used higher order functions. So I went along with the crowd and added them too. I don’t know why contains/has wasn’t working for me, I eventually rolled my own.
  • Binary Search – I think I just used that in Custom Set, whoops! That was a quick one.
  • Circular Buffer – For being marked hard it wasn’t so bad. Just keep track of how many cells are used in addition to the read and write pointers.
  • Simple Linked List – Again, not that hard for being marked hard. The tricky part again was returning the this pointer on reverse since that was not mentioned. The reverse code was a bit to keep track of in your head.

On the Gameboy front I read through and got running the first two examples in the Super Gameboy chapter. The picture is the super gameboy initialized with type detection. In the image, the black border says we didn’t send a border. Also 1 = Super Gameboy, 0 = Original Gameboy