@KamilaSzewczyk 0.5 means "between 0 and 1", in fact any value between 0 and 1 such as 0.1 0.123 0.0001 works the same.

@LdBeth Unless you get sufficiently close to 1 that ⎕FR makes it equal to 1.

⋄ ⌽⍤⍴⍴∘⊃,⌿⍣≡

@PyGamer0
 ┌───┼─────┐
 ⍤   ∘    ┌┼┐
┌┴┐ ┌┴┐   ⌿ ≡
⌽ ⍴ ⍴ ⊃ ┌─┘
        ,

⋄ (⌽⍤⍴⍴∘⊃,⌿⍣≡) 2 2 2⍴1 2 3 4 ⋄ '---' ⋄ ⍉2 2 2⍴1 2 3 4

@PyGamer0
1 1
3 3

2 2
4 4
---
1 1
3 3

2 2
4 4

@PyGamer0 Are you trying to model monadic ⍉?

@Adám yes

Is dyadic ⍉ allowed?

no, other wise it is just "reverse the axis"

Yes, axes.

@Adám no

⋄ ⎕IO⍉2 2 2⍴1 2 3 4

@PyGamer0
LENGTH ERROR
      ⎕IO⍉2 2 2⍴1 2 3 4
         ∧

@PyGamer0 Isn't it simply {⍵[⌽¨⍳⍴⍵]}?

Oh.

I should go to sleep then.

APL Compiler Based on Tail right now on Hacker News.

news.ycombinator.com/item?id=28937268 was posted earlier too

imgur.com/a/hsumpvQ Why is 1⊥ faster?

@awagga Because the order of summation is guaranteed in +/ so vector instructions cannot be used.

Thanks ^^

Btw, you could have pasted the text here instead of an image.

That's a great point! I woke up too early :)

Can you give me an example where the order of summation differs in 1⊥

⋄ +/1e100 ¯1e100 ¯1 ⋄ 1⊥1e100 ¯1e100 ¯1

@Adám
¯1
0

Ah, I see. :)

Announcement: APL Campfire in two hours, featuring Jim Brown.

If you have questions for him, but can't come and ask them yourself, then write them here and I'll try to ask for you.