#arrayprogramming — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #arrayprogramming, aggregated by home.social.
-
🔍 How NumPy Shapes Scientific Discovery!
🔗 Interoperability - Serves as a bridge for various computation libraries
🔧 Flexibility - Supports a decade of future analyses#NumPy #ArrayProgramming #Science https://tnyp.me/ih07Sizm/m
-
🔍 How NumPy Shapes Scientific Discovery!
🔗 Interoperability - Serves as a bridge for various computation libraries
🔧 Flexibility - Supports a decade of future analyses#NumPy #ArrayProgramming #Science https://tnyp.me/ih07Sizm/m
-
@jhlagado try “following” these hash tags:
It will probably improve the content of your stream slightly.
-
@jhlagado try “following” these hash tags:
It will probably improve the content of your stream slightly.
-
I implemented org-babel support for 3 array languages I like a lot: Goal¹, BQN² and growler/k³. These languages are great for data munging so I find it very handy to use them in #OrgMode to process data stored in org tables. You can grab my implementations from my Emacs configuration at:
https://github.com/oantolin/emacs-config/blob/master/my-lisp/ob-goal.el
https://github.com/oantolin/emacs-config/blob/master/my-lisp/ob-bqn.el
https://github.com/oantolin/emacs-config/blob/master/my-lisp/ob-k.el¹ https://codeberg.org/anaseto/goal
² https://mlochbaum.github.io/BQN/
³ https://codeberg.org/growler/k, forked from https://codeberg.org/ngn/k -
I implemented org-babel support for 3 array languages I like a lot: Goal¹, BQN² and growler/k³. These languages are great for data munging so I find it very handy to use them in #OrgMode to process data stored in org tables. You can grab my implementations from my Emacs configuration at:
https://github.com/oantolin/emacs-config/blob/master/my-lisp/ob-goal.el
https://github.com/oantolin/emacs-config/blob/master/my-lisp/ob-bqn.el
https://github.com/oantolin/emacs-config/blob/master/my-lisp/ob-k.el¹ https://codeberg.org/anaseto/goal
² https://mlochbaum.github.io/BQN/
³ https://codeberg.org/growler/k, forked from https://codeberg.org/ngn/k -
CW: Advent of Code 2025, day 8 in K
init:1+!n:#:d:`I$","\'0:"08.in"
ds:1_'ds@<ds:{(+/t*t:d[x]-d[y]),x,y}.'p@&</'p:+!n,n
conn:{(x*~f)+x[y[0]]*f:x=x[y[1]]}
steps:1000#
:one:*/t 3#>t:.#'=init conn/steps ds
:two:*/*+d {:[&/g=*g:conn[x;*y];*y;o[g;1_y]]}[init;ds]Part 2 takes a metric eternity to converge. There must be a better solution, but this will have to do for now.
-
CW: Advent of Code 2025, day 8 in K
init:1+!n:#:d:`I$","\'0:"08.in"
ds:1_'ds@<ds:{(+/t*t:d[x]-d[y]),x,y}.'p@&</'p:+!n,n
conn:{(x*~f)+x[y[0]]*f:x=x[y[1]]}
steps:1000#
:one:*/t 3#>t:.#'=init conn/steps ds
:two:*/*+d {:[&/g=*g:conn[x;*y];*y;o[g;1_y]]}[init;ds]Part 2 takes a metric eternity to converge. There must be a better solution, but this will have to do for now.
-
CW: Advent of Code 2025, day 7 in K
rng:!#*data:0:"07.in"
spls:l@&0<#'l:&'"^"=1_data
msks:(+/rng=/:(-1;1)+)@/:/:spls
f:{spl:+/(n@&0<n)*msks[y]@&0<n:|/+t:(1_x)*/:rng=/:spls[y]
str:(1_x)*~|/t
((+/0<n)+*x),str+spl}
:(one;two):(*:;+/1_)@\:(0,"S"=*data) f/!# splsIt was a pleasant surprise that a single fold could solve both parts.
-
CW: Advent of Code 2025, day 7 in K
rng:!#*data:0:"07.in"
spls:l@&0<#'l:&'"^"=1_data
msks:(+/rng=/:(-1;1)+)@/:/:spls
f:{spl:+/(n@&0<n)*msks[y]@&0<n:|/+t:(1_x)*/:rng=/:spls[y]
str:(1_x)*~|/t
((+/0<n)+*x),str+spl}
:(one;two):(*:;+/1_)@\:(0,"S"=*data) f/!# splsIt was a pleasant surprise that a single fold could solve both parts.
-
CW: Advent of Code 2025, day 6 in K
d:0:"06.in"
op:(+/;*/)@"*"=op@&~" "=op:*|d
:one:+/op@'+.'1_|d
:two:+/op@'n 1_'.=+\~n:0,.'+|1_|dThe fact that the input file was nearly valid K was helpful.
-
CW: Advent of Code 2025, day 6 in K
d:0:"06.in"
op:(+/;*/)@"*"=op@&~" "=op:*|d
:one:+/op@'+.'1_|d
:two:+/op@'n 1_'.=+\~n:0,.'+|1_|dThe fact that the input file was nearly valid K was helpful.
-
CW: AoC Day 10 Part 1 in Uiua
Map ← ⍥(⍉≡(⊂⊂⊙:.@.))2 ⊜∘≠@\n.&fras"10.in"
Inf ← 9999 # applied infinity
F ← +×Inf=0./+⊞=:Map
D ← F"|LJ"
U ← F"|7F"
R ← F"-J7"
L ← F"-FL"
M ← ↧+1×
TD ← M D ↻¯1.
TU ← M U ↻ 1.
TR ← M R≡↻¯1.
TL ← M L≡↻ 1.
T ← TU TL TD TR
-1/↥/↥×≠Inf⍢(T.⊙;)(¬≍)⊃∘(×0) F"S" -
Favorite #APL descendant/inspired language:
-
CW: Advent of Code · Day 15
f:"15.txt"
n:2000000
c:"-",,/$!10
i:{2 2#.`c$(" "*~i)+x*i:+/c=\:x}'0:f
a:{x|-x}
d:{+/a x-y}
m:{$[~~#:i:&x[0;1]>-2+1_x[;0]
(,x[0;0],|/x[0,1+*i;1]),x[(!#:x)^0,(1+*i)]
x]}
r:{cl:i@&{d[1_x;x[1],y]<1+*x}[;x]'(d.'i),'*+i;
r@<*+r:{x[1]+(-s)+0,2*s:x[0]-a y-x[2]}[;x]'(d.'cl),'*+cl}--/*m/r[n]
x+4000000*1+*|*m/r[x:*&1<#'(m/r@)'!n*2]
/ Takes five minutes using
/ https://codeberg.org/ngn/k/ There must be a better way
-
I discovered the ArrayCast #podcast this week and have enjoyed it tremendously.
Fun content for #programming #language nerds; positive and constructive perspectives; and soothingly orderly conversations where folks don’t interrupt each other 😌
-
Today's Advent of Code problem doesn't look like it will take us a lot of time. Let's take this opportunity, and explain every step of solving it in K. Nice and beginner friendly.
See you at noon UTC+1 at https://www.twitch.tv/janstepien
#adventofcode #apljk #arrayprogramming #streaming #livecoding #programming
-
Streaming AoC day 4 at 19:00 UTC+1. This time on a Raspberry PI. Tune in and partake in some merry array programming!
