@hyper-neutrino Can you give chat.stackexchange.com/users/244103/mrprajesh access?

@snakes_on_a_keyboard 13:00 UTC going forward.

@ootaulaith Yes, although Select can do more than just that. See the full model and sample uses.

@Adám done

@Adám Beautiful. Thank you. I see this actually could turn into a bit of a rabbit hole.

@ootaulaith I'll be speaking about them at Dyalog '22, and the recording will be made available later.

I just had a look at this year's presentation schedule, and now I'm bummed 10X that I let the conference slip my radar. So many good-looking talks! Really wanted to meet you and Morten!

@ootaulaith Presentations will be online later in the year, and I won't make it live either ;-(

@Adám Oh, nice. I see there's a Dyalog Usermeeting channel linked from the main page. Thanks for prompting me to look.

Wait. Remote attendance is possible?

@ootaulaith No, not this year. Sorry.

Neat. Found a decent way to express getting the first n primes:

⎕←{⍵⍴{q←¯1↑⍵ ⋄ ⍵,(q+1+⍳q)~⊃{⍵,⍺×1+⍳⌊(2×q)÷⍺}/⍵,0}⍣(⍵≤≢⍤⊣)2 3}10

@B.Wilson 2 3 5 7 11 13 17 19 23 29

Leans on Bertrand's postulate that there's always a prime n<p<2×n for all natural numbers n.

Disliking the nested dfns, though.

Why?

Honestly, just a personal aesthetic sense right now, since I'm just an APL noob. However, for languages that I do know well, I find that striving for flat, linear code tends to bias towards simpler, more holistically grokkable architectures.

Would appreciate any better spellings, general critiques, etc. of the above code if you have any!

Question: APL doesn't have bignums, right? What's the standard way of handling exact calculations for integers above 2*34 and such? I'm just trying to play with Project Euler problems at the moment.

@B.Wilson abrudz.github.io/style might interest you.

@B.Wilson The dfns workspace has some functions for bignums, and Roger Hui wrote something on the Dyalog Forums too.