Thank you Jürgen. You make a compelling argument.
In particular, I'd argue that the ⎕FIO[n] functions should be seen as an
internal implementation detail, and the “official” API as it were, should
be the wrapper functions.
Speaking of which, ⎕FIO[49] needs a name in wslib5. Any suggestions?
Rega
thank you Juergen - sorry my fault - i didn't realize that my start script
(which loads my apl keyboard, font and then apl was still running an old apl
1.3 on this computer)
apl -v showed the problem and of course i ran it last
On Thu, 26 Jan 2017 22:20:00 +0100
Juergen Sauermann wrote:
Hi,
I believe the command as such works:
)clear
CLEAR WS
)fns
0 0⍴⍎')COPY 5 HTML.apl'
)fns
HTML∆A HTML∆Assert HTML∆Body
HTML∆Document
HTML∆H1
at the top of
https://www.gnu.org/software/apl/APL_demo.html
there is
0 0⍴⍎')COPY 5 HTML.apl'
when i do )copy 0 HTML.apl
loading )DUMP file /apl/workspaces/HTML.apl...
)fns
top4
but using the code from the APL_demo.html
0 0⍴⍎')copy 0 HTML.apl'
VALUE ERROR
)copy 0 H
Hi,
just have a look at the APL2 part of the explanation:
http://aplwiki.com/LearnApl/ErrorHandling#APL2
GNU APL is intended to be APL2 compatible to the extent
reasonable.
What you are looking for is either ⎕EA or ⎕ES.
I believe you can use the techniques described under APL2, as this should
be compatible with GNU APL.
Regards,
Elias
On 27 Jan 2017 01:08, wrote:
>
> is there a ⎕trap or similar method to trap the domain error of the
> following
>
> 4÷(4-4)
>
> all i found was http://aplwiki.com/LearnApl/ErrorH
is there a ⎕trap or similar method to trap the domain error of the following
4÷(4-4)
all i found was http://aplwiki.com/LearnApl/ErrorHandling which doesn't talk
about gnuapl
is 4÷(4-4) one of the instances? giving domain error ?
On Thu, 26 Jan 2017 09:30:09 +
Jay Foad wrote:
> Simpler f and g:
>
> e←{⍵,⊂f ⍵}
> f←{↑,/⍵ g¨⌽⍵}
> g←{↑,/,⍺∘.h ⍵}
> h←{(⊂'(',⍺),¨'+-×÷',¨⊂(⍵,')')}
>
> Jay.
>
> On 25 January 2017 at 10:59, Jay Foad wrote:
> > How about this,
Simpler f and g:
e←{⍵,⊂f ⍵}
f←{↑,/⍵ g¨⌽⍵}
g←{↑,/,⍺∘.h ⍵}
h←{(⊂'(',⍺),¨'+-×÷',¨⊂(⍵,')')}
Jay.
On 25 January 2017 at 10:59, Jay Foad wrote:
> How about this, based on enumerating binary trees:
>
> e←{⍵,⊂f ⍵}
> f←{↑,/(⊂⍵)g¨⍳≢⍵}
> g←{↑,/,(⍵⊃⍺)∘.h ⍵⊃⌽⍺}
> h←{(⊂'(',⍺),¨'+-×÷',
