The APL Orchard

apl.chat ― Learn, teach, ask, code, golf, & discuss usage. See ...
Mon 15:18
                ⎕← +/⍬ ⋄ ×/⍬ ⋄ |/⍬
Mon 15:01
⎕← +/⍬ ⋄ ×/⍬ ⋄ |/⍬
Mon 07:35
⎕ ←+/⍬ ⋄⎕ ←×/⍬
Mon 07:30
⋄ +/⍬ ⋄×/⍬
Mon 06:59
Yes +/zilde x/zilde
Mon 03:08
I do not find a way to cancel some my chat message, it is possible/right cancel own messages?
Mon 03:05
Why in a language that execute instruction from the right to the left, in the right of ⊂ there is the array that is 90% of times costant, and the array that is calculated is in the left? The same for the /, when used (binary array)/array
?
Because
It will be used ⍨ instead of nothing in front of the operator
Mon 03:04
Above is wrong
Mon 02:39
It will be used ⍨ instead of nothing in front of the operator
Mon 02:37
Because
Mon 02:36
?
Mon 02:34
Why in a language that execute instruction from the right to the left, in the right of ⊂ there is the array that is 90% of times calculated, and the array that is constant is in the left? The same for the /, when used (binary array)/array
Mon 02:29
Ok thank you. Why ⍬+⍬ it seems here return zero 0, while ⍬x ⍬ return 1?
Sun 17:58
Excuse for the long post
Sun 17:57
p←{⍺⊂⍨1++\2{⍺≠⍵}/0,⍵}
12 13 14 p 0 0 0
┌1──────────┐
│┌3────────┐│
││ 12 13 14││
│└~────────┘2
└∊──────────┘
12 13 14 p 1 1 1
┌1──────────┐
│┌3────────┐│
││ 12 13 14││
│└~────────┘2
└∊──────────┘
12 13 15 p 0 1 1
┌2─────────────┐
│┌1──┐ ┌2─────┐│
││ 12│ │ 13 15││
│└~──┘ └~─────┘2
└∊─────────────┘
12 13 15 p 1 0 1
┌3────────────────┐
│┌1──┐ ┌1──┐ ┌1──┐│
││ 12│ │ 13│ │ 15││
│└~──┘ └~──┘ └~──┘2
└∊────────────────┘
12 13 15 p 1 1 0
┌2─────────────┐
│┌2─────┐ ┌1──┐│
││ 12 13│ │ 15││
│└~─────┘ └~──┘2
Sun 17:44
Do you like the function that build partition from a binary array {⍺⊂⍨1++\2{⍺≠⍵}/0,⍵}? In alpha there would be the array for build the partitions, and in omega one array of binary. The partition it seems born where there is a change 0 1 or 1 0, in the array binary. All array binary of 0 or all 1 it seems means the partition with all elements both.
Sun 17:39
I forgot ?
Sun 17:39
Do you like the function that build partition from binary {⍺⊂⍨1++\2{⍺≠⍵}/0,⍵}. In alpha there would be the array for build the partitions, and in omega one array of binary. The partition it seems born where there is a change 0 1 or 1 0, the array of 0 or all 1 it seems means the partition with all elements both
 

 The Nineteenth Byte

The Nineteenth Byte: General discussion for codegolf.stackexc...
Mon 15:16
Due memory check is the computer say me, in ASM c c++ if there is something wrong
Sun 17:52
The K&R C Language book has one implementation of malloc
Jul 22 08:21
I forgot compare symbols as <> <= >= different =, lenghtof
Jul 22 08:11
Whit macro as "#define letter to a along string" is possible reduce length if one know what are the more meaningful string to save
Jul 22 08:05
Ecc means 1 11 111 1111 1111111 ecc 1 Is 1 , 2 Is 11, 3 Is 111 ecc 4 Is 1111
Jul 22 08:02
Unary means 1 11 111 ecc numbers?in pratice array length?
Jul 22 07:57
One start from binary and end with one letter, but that letter means the binary associated
Jul 22 07:55
The trick is an incremental summarize each step
Jul 22 07:52
When not used as keyword as ThisFunctionMakeThis
Jul 22 07:51
Too much chars or word too much long have the same problem
Jul 22 07:50
I believe in symbols and 01 binary ecc are not easy recognizables
Jul 22 07:46
A alphabet for programming has to have one char for goto, one char for infinite loop as "repeat" of axiom, +-*/ and or not exp sqrt and alphabetic letters and 0..9 numbers , can be ok "for all" and "exist"
Jul 22 07:03
Or better easy apl
Jul 22 07:02
I do not believe here are so few understand apl
Jul 22 06:59
{1=≢∪⍵} would mean "build an array without repetitions from array of input" "count length array result" "is 1", of input omegas , it would mean all array has the same element repeated as 1 1111 or 888888
Jul 21 10:28
What do you want a search Algo machine that find the algos other wrote?
Jul 21 07:15
Upvotes
Jul 21 07:14
. So I can make wrong in upvoter
Jul 21 07:14
I think a piece of code program depend of the people wrote it, and for lazy people as me is difficult prove that a program is really ok, especially the ones other write
Jul 21 07:00
What about this question codegolf.meta.stackexchange.com/a/26786/120560 ? I think there is not too much documentation for the easy solve, or math is too theoretic for exit the algorithm... Than I not speak well your language
Jul 17 19:18
Thank you
Jul 17 19:16
@Themoonisacheese yes the first link is ok
Jul 17 19:01
And other chat group that I saw before, where are?
Jul 17 18:54
I currently use a smartphone
Jul 17 18:53
@mousetail above
Jul 17 18:53
When I use the chat link in codegolf page , the link point to this group and this page of this group is open
Jul 17 18:39
Why the only chat point from code golf questions page, is this? Other chats are closed?
Jul 8 08:10
I think goto label is the way more easy and complete for doing a loop or a if or a complex structural loop, and in the mean time you think what letter use, I have end 100 times before
Jul 2 15:35
@att thank you
Jul 2 14:58
A hate crime
Jul 2 14:37
No the x in the middle is a mult
Jul 2 14:31
@att yes x>=y ( a^(x-y))mod n = (((a^x )mod n)*((invmod(a,n)^y) mod n))mod n