Hi,
I think SVN 1336 looks better.
Best Regards,
Jürgen
On 8/7/20 10:51 PM, Kacper Gutowski
wrote:
Indeed, as
Christian wrote, the fix is not sufficient. But I still believe
it's in the branch I previously mentioned as comm
Indeed, as Christian wrote, the fix is not sufficient. But I still
believe it's in the branch I previously mentioned as commenting out the
whole optimization by flipping #if 1 to 0 at PrimitiveFunction.cc:319
fixes it as far as I can see (at cost of performance of course).
Other examples in t
This is some intermittent bug..
with less than 255 elements the all elements are always equal
t←? 255 ⍴ i
+/t = 2÷⍨ {⍵×2} fasteach t
255
t←? 512 ⍴ i
+/t = 2÷⍨ {⍵×2} fasteach t
50
t←? 300 ⍴ i
+/t = 2÷⍨ {⍵×2} fasteach t
9
256 elements random number of ele
It fix the "Smaller reproducer:" but does not fix the whole problem:
$ apl -v
BUILDTAG:
-
Project:GNU APL
Version / SVN: 1.8 / 1334M
Build Date: 2020-08-07 19:19:29 UTC
Build OS: Linux 5.7.11-200.fc32.x86_64 x86_64
config.status: 'DYNAMIC_LOG_WANTED
Gentlemen,
thanks, fixed in SVN 1334.
Best Regards,
Jürgen
On 8/7/20 4:33 PM, Kacper Gutowski
wrote:
On Thu, Aug
06, 2020 at 08:50:27PM -0400, Christian Robert wrote:
∇z←(F fasteach) A;shp;vec;nub;res;idx
On Thu, Aug 06, 2020 at 08:50:27PM -0400, Christian Robert wrote:
∇z←(F fasteach) A;shp;vec;nub;res;idx
shp←⍴A ⍝ Shape and ...
vec←,A ⍝ ... ravel of arg.
nub←∪ vec⍝ Vector of unique elements.
nub←∪ vec⍝ Vector of unique elements.
res←F¨nub
Hi, this boils down to:
i←63
t←? 1000 ⍴ i
t = 2÷⍨ {⍵×2} fasteach t
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
An other proof (I think) without invoking the "fasteach" operator...
∇test2;z;t;d;shpz;⎕RL;r
⎕RL←0
d←3
Loop:
z←(d,d) ⍴ (d×d)?(d×d)
shpz←⍴z
t←shpz ⍴ ((∪,z) ⍳ ,z) ⊃ ¨ {⍵×2} ¨⊂ ,z
t←shpz ⍴ t
''
d,("False" "True")[(⎕io+r←z≡t÷2)]
z (t÷2)
→(r≠1)/Fail
d←d+1
→(d<10)/Loop
Fail:
∇
test2
3 Tr
