I reverted to SVN 739 and did the test
[xtian@fc-23:/home/xtian] $ apl
__ _ __ __ _____ __
/ // | / // / / / / | / __ \ / /
/ / __ / |/ // / / / / /| | / /_/ // /
/ /_/ // /| // /_/ /
⎕pw←1000
df
Freq ╔═══╗
║z←Freq m;c ║
║z←⌈/,m ║
║c←z⍴0 ║
║⊣ {c[⍵]←c[⍵]+1}⍤0 ⊢ m ║
║z←⍉(2,z)⍴(⍳z),c║
╚═══╝
Loto ╔═══
Hi,
In my script I was using ⍎¨ on a vector of character vector from each line of a
file. After some testing, I guess it is not really the ⍎, that is slow. The
time scaling is strange.
In the following, the first row and the third row (using ¨ and ⍣ respectively)
scales like n*3, while the p
Somehow, 1⎕TF is slightly slower (see the 2nd and the 3rd rows in the following)
tio¨1E5×⍳5
⍕619 ⍕1306 ⍕2007 ⍕2605 ⍕3425
1⎕tf 230 1⎕tf 461 1⎕tf 819 1⎕tf 1094 1⎕tf 1383
⍎158 ⍎ 327 ⍎ 562 ⍎ 695 ⍎
That did it. Thanks!
Sent via the Samsung Galaxy Note® 4, an AT&T 4G LTE smartphone
Original message
From: Christian Robert
Date: 6/16/2016 2:21 PM (GMT-06:00)
To: bug-apl@gnu.org
Subject: Re: [Bug-apl] Memory leak
I thing a couple of right arrows or )sic or )res
I thing a couple of right arrows or )sic or )reset would do the trick
→
→
)sic
)reset
when something is interrupted, no memory is freed, and the operation can be
"resumed" with
→⍳0
my 2 cents,
Xtian.
On 2016-06-16 15:14, Blake McBride wrote:
blake@blake-vml
blake@blake-vmlinux ~ $ apl
x←⍳6000
x←4
x←⍳6000
x←4
x←⍳7000
x←4
x←⍳8000
x←4
x←⍳9000
WS FULL
x←⍳9000
^ ^
x←⍳8000
WS FULL
x←⍳8000
^
x←4
x←⍳8000
WS FULL
x←⍳80
Sometimes, when you have, essentially, a WS full situation, GNU APL just
dies instead of giving a WS FULL error.
x←⍳1
x[1]←445
y←x
/home/blake/bin/apl: line 3: 7341 Doneakt
7342 Killed | /usr/local/bin/apl "$@"
blake@blake-v
> On Jun 16, 2016, at 8:09 AM, Juergen Sauermann
> wrote:
>
> Hi,
>
> dyadic ? needs a set for filtering out already produced values (the result
> must
> not return duplicate random numbers).
>
> The DOMAIN error is thrown if the size of the set (= right argument of ?)
> becomes
> too large
Hi Xiao-Yong,
the problem with the *scanf() *(and also with the *printf()*) functions
is that text of numbers
is different from APL, for example *-* vs. *¯*, complex numbers, etc.
I therefore believe it would be more useful to have a *⎕CR* variant that
avoids full
parsing and execution of its
Hi,
dyadic ? needs a set for filtering out already produced values
(the result must
not return duplicate random numbers).
The DOMAIN error is thrown if the size of the set (= right
argument of ?) becomes
too large (and not, I believe, by
11 matches
Mail list logo
