hi all, is the AOC supposed to be mostly for #lang racket? I have many out-there languages … :slightly_smiling_face:

The private leaderboard pinned in this channel, requires using racket for all the 25 days. :disappointed:

right, but what is “racket” ? :slightly_smiling_face:

pretty sure someone above had used Rosette!

Oh, no, I forgot we have so many #lang in Racket!

I have #lang ranging from FPGA programming to Commodore 64 6502 and .NET code !

I guess the language used should be “suitably rackety” and not running on a C64, that makes the most sense.

though I like the idea that for the puzzles involving virtual machines, you build the actual computer in an FPGA :slightly_smiling_face:

I’m pretty sure ANY Racket #lang(too many to list), languages that target other architectures (FPGA,6510) and derivatives like RacketScript, Pyret & Urlang.Even Hackett is ok. :grinning:

@pezi_pink :point_up:

Yes any #lang show us more #langs!!!

today I wrote AoC day 2 part 1 in my new language Squirrel, which is a CLI IL assembler / .net language building toolkit. https://twitter.com/pezi_pink/status/1202253927200243712

at this point it is still simply an assembler with no enforced language semantics whatsoever. that is a job for derived languages :wink:

@samdphillips :point_up:

@mbutterick has powerful match skillz

I didn’t find list* in the match docs. But even though, that was a neat trick.

(Maybe a dumb question) is it possible to use match to check if the list is a list of numbers in increase order?

Not strictly with match

But you can use #:when to guard each case

(match xs [(list _ ... x x _ ...) #:when (apply <= xs) "hello"] [_ "world"])

Ouch! I wrote for/and for that.

Personally I would separate non-decreasing? and has-double? from each other though. Then join them with conjoin

Today I tried solving things without writing tests, hoping to gain speed. Turns out I’m very bad at it, and it’s so painful to debug.