Implementing C++'s std::partition in BQN

[@mlliarm]

BQN looks like a lovely APL.
Great explanation as always Conor. Keep it up!

[@Ven_de_Thiel]

Definitely nice that `/` parses this way in BQN. APL using the same glyph for replicate and reduce tends to be annoying in trains.

[@aradarbel4579]

beautiful! it's forks all the way down :D

[@drako3659]

When did you switch from APL to BQL? I like the change because BQL is open source (and could be trivially embedded in python/js code). Is this just a one-off for the podcast episode (started it, not nearly caught up)?

[@code_report]

I am learning APL, BQN and J all at the same time, but APL is my favorite still. BQN is better for this problem because using compress (/) in a fork in APL leads to ambiguity for the parser, so you need to use ⊢⍤/ which is very irritating. BQN doesn't have that problem.

[@beanpole4701]

how are you learning all three at once? im having enough trouble learning one at a time

[@difflocktwo]

@@beanpole4701 Big brain.

[@mlliarm]

@trayz they're of the same family. So if you know one well, you can jump to the other.

[@gtgunar]

The podcast is 404-d. The previous(53rd) is there tho. Maybe time will fix it.

[@code_report]

Sorry! Just updated the website! Works now.

[@yarrowification]

I'd love Brice bqn streams

[@cramble]

def sortByParity(arr):
tmp = arr[:]; tmp.sort(key=lambda x: x%2==0); return tmp[::-1]

[@H2CO3Szifon]

mask = a & 1 > 0
np.hstack([a[~mask], a[mask]])

[@keldwikchaldain9545]

I think I prefer ⍋∘(2|⊢)⊏⊢

[@nunzioturtulici9636]

Nice! You had my same idea (a year before :D)