gəorgə pollɐrd
@porg.es
incorrigible neophile • he/him/其？ • board & card & dragon games · 牌🀄🎴👺🃏🎲 · code & languages · 👨💻 · the trivial & obtuse · ⯰ · 🔣🍲🌱🐟☕🍺🍵📚🎶🚲
@ Aotearoa (New Zealand) · https://porg.es
Ways to Play • https://games.porg.es/
@ Aotearoa (New Zealand) · https://porg.es
Ways to Play • https://games.porg.es/
December 8, 2025 at 3:06 AM
#AdventOfCode day 6: (Chicken) #Scheme
it feels like there should be something similar to 'clump' built-in, but I couldn’t find it
it feels like there should be something similar to 'clump' built-in, but I couldn’t find it
![(import srfi-1 srfi-13 (chicken io) (chicken string))
(define (op c) (cond [(equal? c "+") +] [(equal? c "*") *]))
(define (clump xs) ; group elements separated by #f
(let-values (((g tail) (span identity xs)))
(cons g (if (null? tail) '() (clump (cdr tail))))))
(define (skew xs) (apply map (compose list->string list) (map string->list xs)))
(let*
((lines (read-lines))
(calc (lambda (o . ls) (apply (op o) (map string->number ls))))
(part1 (apply + (apply map calc (reverse (map string-split lines)))))
(parsed-nums (clump (map (o string->number string-trim-both) (skew (butlast lines)))))
(ops (map op (string-split (last lines))))
(part2 (apply + (map apply ops parsed-nums))))
(display part1) (newline)
(display part2) (newline))](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:27gje7tp4hoeljjxqffjtb4r/bafkreifqmcn36pjz46hgwdnpz2qagrpoqfmdcdg2n3bpqmst7oahuvmhom@jpeg)
December 8, 2025 at 12:32 AM
#AdventOfCode day 6: (Chicken) #Scheme
it feels like there should be something similar to 'clump' built-in, but I couldn’t find it
it feels like there should be something similar to 'clump' built-in, but I couldn’t find it
#AdventOfCode day 5: #Factor
I tried simply using interval-set but that only handles u32 values. I think this counts as an 'abuse of cond'. Style tips requested 🙂
I tried simply using interval-set but that only handles u32 values. I think this counts as an 'abuse of cond'. Style tips requested 🙂
![IN: aoc2025.day5
: overlap? ( i1 i2 -- ? )
{ [ [ first ] [ last ] bi* <= ]
[ [ last ] [ first ] bi* >= ] } 2&& ;
: merge ( i1 i2 -- i )
[ [ first ] bi@ min ] [ [ last ] bi@ max ] 2bi 2array ;
: merge-into ( ranges i -- ranges' ) {
{ [ over empty? ] [ suffix ] }
{ [ over last [ overlap? ] 2check ]
[ merge [ but-last ] dip suffix ] }
[ drop suffix ]
} cond ;
: load-data ( -- inputs ranges )
read-lines { "" } split1
[ dec> ] map swap
[ "-" split1 [ dec> ] bi@ 2array ] map sort
{ } [ merge-into ] reduce ;
: day5-part1 ( inputs ranges -- count )
'[ _ [ over 1array overlap? ] any? nip ] filter length ;
: day5-part2 ( ranges -- count )
[ [ last ] [ first ] bi - 1 + ] map sum ;
load-data [ day5-part1 . ] [ nip day5-part2 . ] 2bi](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:27gje7tp4hoeljjxqffjtb4r/bafkreiexmwvwb3rean4fgw25jurjqvntausfeobgmjk2cfdyvo3yjv2ddy@jpeg)
December 7, 2025 at 8:30 AM
#AdventOfCode day 5: #Factor
I tried simply using interval-set but that only handles u32 values. I think this counts as an 'abuse of cond'. Style tips requested 🙂
I tried simply using interval-set but that only handles u32 values. I think this counts as an 'abuse of cond'. Style tips requested 🙂
if this is in an async context AsyncFnMut makes life a lot better
December 6, 2025 at 12:55 AM
if this is in an async context AsyncFnMut makes life a lot better
I got “correctly made the code threadsafe” when the threadsafety was “lock (new object()) { … }”
December 6, 2025 at 12:52 AM
I got “correctly made the code threadsafe” when the threadsafety was “lock (new object()) { … }”
#AdventOfCode day 4: (Dyalog) #APL
always nice for grid manipulation: load the file as a matrix with 1 where '@' was; movable is where 1s have less than 5 neighbours (including themselves)
for part 2, we can set these locations to 0 and use the power operator to iterate to a fixpoint, mwah
always nice for grid manipulation: load the file as a matrix with 1 where '@' was; movable is where 1s have less than 5 neighbours (including themselves)
for part 2, we can set these locations to 0 and use the power operator to iterate to a fixpoint, mwah
December 4, 2025 at 7:17 AM
#AdventOfCode day 4: (Dyalog) #APL
always nice for grid manipulation: load the file as a matrix with 1 where '@' was; movable is where 1s have less than 5 neighbours (including themselves)
for part 2, we can set these locations to 0 and use the power operator to iterate to a fixpoint, mwah
always nice for grid manipulation: load the file as a matrix with 1 where '@' was; movable is where 1s have less than 5 neighbours (including themselves)
for part 2, we can set these locations to 0 and use the power operator to iterate to a fixpoint, mwah
#AdventOfCode day 3: #Haskell
a nice fit for search problems. there’s probably a nicer way to write the explicitly-recursive key function with combinators
a nice fit for search problems. there’s probably a nicer way to write the explicitly-recursive key function with combinators
![import Data.Char (digitToInt)
import Data.List (sortBy, tails, uncons)
import Data.Maybe (mapMaybe)
import Data.Ord (comparing)
-- Pairs of batteries & remaining batteries in descending jolts
batts :: [Int] -> [(Int, [Int])]
batts = sortBy (flip (comparing fst)) . mapMaybe uncons . tails
joltage :: [Int] -> Int
joltage xs = head $ do
(n1, xs) <- batts xs
(n2, __) <- batts xs
pure (n1*10 + n2)
main = do
ls <- lines <$> getContents
let cases = map (map digitToInt) ls
print (sum (map joltage cases))](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:27gje7tp4hoeljjxqffjtb4r/bafkreif5vithinhfpha3n6lqtieoweyydxw2akrsyb6hsy6gdyk6y7diqe@jpeg)
![import Data.Char (digitToInt)
import Data.List (sortBy, tails, uncons)
import Data.Maybe (mapMaybe)
import Data.Ord (comparing)
-- Pairs of batteries & remaining batteries in descending jolts
batts :: [Int] -> [(Int, [Int])]
batts = sortBy (flip (comparing fst)) . mapMaybe uncons . tails
joltage :: Int -> [Int] -> Int
joltage n xs = head (go n xs 0)
where
go 0 _ acc = pure acc
go n xs acc = do
(x, xs) <- batts xs
go (n-1) xs (acc*10 + x)
main = do
ls <- lines <$> getContents
let cases = map (map digitToInt) ls
print (sum (map (joltage 12) cases))](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:27gje7tp4hoeljjxqffjtb4r/bafkreidfk4p3v44mjrfqrb3pgtkruf2zae7ewtf5ghrjucyj6lb44iyprq@jpeg)
December 3, 2025 at 7:43 AM
#AdventOfCode day 3: #Haskell
a nice fit for search problems. there’s probably a nicer way to write the explicitly-recursive key function with combinators
a nice fit for search problems. there’s probably a nicer way to write the explicitly-recursive key function with combinators
#AdventOfCode day 2: #Python
this approach would be more straightforward in a stringly language like PHP
this approach would be more straightforward in a stringly language like PHP
![def top_half(x):
x = str(x)
return int(x[0:len(x)//2] or '0')
def invalid_ids(start, end):
n = int(2 * str(top_half(start)))
while n <= end:
if n >= start: yield n
n = int(2 * str(top_half(n) + 1))
total = 0
for ids in input().split(','):
start, end = map(int, ids.split('-'))
total += sum(invalid_ids(start, end))
print(total)](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:27gje7tp4hoeljjxqffjtb4r/bafkreiepifhzoi34exbwtacdzhfhms4676rdqdl7lbu22e2zduyb7yiv6e@jpeg)
![def top_nth(x, n):
x = str(x)
return int(x[0:len(x)//n] or '0')
def invalid_ids(start, end):
invalid = set()
for d in range(2, len(str(end)) + 1):
n = int(d * str(top_nth(start, d)))
while n <= end:
if n >= start: invalid.add(n)
n = int(d * str(top_nth(n, d) + 1))
return invalid
total = 0
for ids in input().split(','):
start, end = map(int, ids.split('-'))
total += sum(invalid_ids(start, end))
print(total)](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:27gje7tp4hoeljjxqffjtb4r/bafkreiczeb423qqks3oghewxc7rbro26enrwba3lxhvo2laee6d5gebe54@jpeg)
December 3, 2025 at 5:49 AM
#AdventOfCode day 2: #Python
this approach would be more straightforward in a stringly language like PHP
this approach would be more straightforward in a stringly language like PHP
try bolero for a further zabillion edge cases
December 2, 2025 at 8:53 PM
try bolero for a further zabillion edge cases
and no “marketized” incentive to improve it either
November 30, 2025 at 12:45 AM
and no “marketized” incentive to improve it either
nearly all of them are junk as well, the internal connections get worse and worse and the $60 ones are just as bad as the $10 ones
November 29, 2025 at 12:35 AM
nearly all of them are junk as well, the internal connections get worse and worse and the $60 ones are just as bad as the $10 ones
an imitation, not the real thing... the Q looks different
November 27, 2025 at 8:46 AM
an imitation, not the real thing... the Q looks different
...or rather tracking
and putting your docs in OCR-A, which is specifically designed to be computer-readable and trades off human readability in order to achieve that? certainly a choice
and putting your docs in OCR-A, which is specifically designed to be computer-readable and trades off human readability in order to achieve that? certainly a choice
November 27, 2025 at 8:40 AM
...or rather tracking
and putting your docs in OCR-A, which is specifically designed to be computer-readable and trades off human readability in order to achieve that? certainly a choice
and putting your docs in OCR-A, which is specifically designed to be computer-readable and trades off human readability in order to achieve that? certainly a choice
the kerning on the proportional font is all fucked up
November 27, 2025 at 8:34 AM
the kerning on the proportional font is all fucked up
community recycling centre, in addition to disposal of cardboard/plastic/etc, it operates as a second-hand store to divert useful stuff from ending up in the dump
November 25, 2025 at 1:54 AM
community recycling centre, in addition to disposal of cardboard/plastic/etc, it operates as a second-hand store to divert useful stuff from ending up in the dump
November 24, 2025 at 11:57 PM
there’s some kind of analogy with dropshipping here where everyone wants to be the middleman
November 24, 2025 at 9:10 PM
there’s some kind of analogy with dropshipping here where everyone wants to be the middleman
this was according to one of the old Official New Zealand Year Books, which could well have been lying to me
November 23, 2025 at 7:36 AM
this was according to one of the old Official New Zealand Year Books, which could well have been lying to me
Whitcombe’s Everyday Cookery, first published 1900
(the others being Edmonds Cookery Book 1907 and Yates Garden Guide 1895)
(the others being Edmonds Cookery Book 1907 and Yates Garden Guide 1895)
November 23, 2025 at 6:52 AM
Whitcombe’s Everyday Cookery, first published 1900
(the others being Edmonds Cookery Book 1907 and Yates Garden Guide 1895)
(the others being Edmonds Cookery Book 1907 and Yates Garden Guide 1895)
less than 3 USD, for international readers
November 23, 2025 at 6:18 AM
less than 3 USD, for international readers