Gentle people,
I am having trouble using the AP100 processor. Code that
worked reliably two to three years ago, no longer works.
The problem can be replicated (I hope) as follows:
1) Create a folder named 'Sound'.
2) Touch a file in 'Sound' named 'playsnd'
>
>
>
> Please try ]log 35 both in your script and by entering
> the lines in the script interactively (to see if the
>
> problem is caused by scripting or something else). I
> haven't
> changed the AP stuff in the last years, but there
>
&g
gt;
> in an apl workspace try
> )host /bin/ls /apl/ap100/Sound/pl*
> )host /bin/ls /apl/ap100/Sound/pla*
>
>
>
> On Tue, 14 Feb 2017 20:59:52 -0600
> Frederick Pitts wrote:
>
> > enztec,
> >
> > Juergen had me type the apl statements directly
t;
> you have a bad character in your foobar.apl - probably from a
> cutnpaste from an html?
>
>
>
> On Tue, 14 Feb 2017 19:26:53 -0600
> Frederick Pitts wrote:
>
> > Hello Juergen,
> > I haven't been configuring apl with DYNAMIC_LOG=yes, so I
>
Hello Juergen,
In the interest of making Gnu APL as compatible as practical with
IBM APL2, please consider the following:
The IBM APL2 quad quote prompt replacement facility supports the
prompt being a nested array. I make that claim based on the APL code
for the parts inventory demo pre
Hello Juergen,
As of svn revision 931, I observe the following for greatest
common divisor calculations
¯3J0 ∨ ¯3J0
2
¯1J0 ∨ ¯3J0
2
¯1J0 ∨ ¯1J0
0
2 does not evenly divide ¯3J0 or ¯1J0 and 0 does not divide.
Please find attached APL code that can be used
Jeurgen,
A greatest common divisor of 23J1 and 25J25 is 3J1.
Complex division by of 23J1 and 25J25 by 3J1 yields Gaussian integers
23J1 25J25 ÷ 3J1
7J¯2 10J5
but mod 3J1 of the same numbers does not consistently yield zeroes
3J1 | 23J1 25J25
3J1 0
I can provide numerous other ex
f the changes that I made
> lately were in
> header files (ComplexCell.hh and FloatCell.hh). If you did
> ./configure without options, then
> your build is probably is a 'fast' one, which may not have detected
> header file changes.
>
> Please try make clean a
me to
> redistribute it
> according to the GNU Public License (GPL) version 3 or
> later.
>
> SAVED 2017-03-30 22:33:13 (GMT-4)
> 23J1 25J25 ÷ 3J1
> 7J¯2 10J5
> 3J1 | 23J1 25J25
> 0 0
>
>
>
> On 2017-04-25 21:50, Frederick Pitts wr
Jürgen,
SVN 937 works for me.
Out of curiosity, is the Euclidean division algorithm described
starting at the bottom of page 6 of http://www.math.uconn.edu/~kconrad/
blurbs/ugradnumthy/Zinotes.pdf relevant to how you are performing the
modulo function on Gaussian integers? The de
Juergen,
I'm seeing errors with the mod (∣) operator applied to Gaussian
integers again. With svn 896, the mod operator yields a nonzero
residual result while the division operator yields an exact Gaussian
integer quotient result as follows
1J3 ∣ 8J4
1J3
8J4 ÷ 1J3
2J¯2
your TGI0.apl
> program seems not to output anything.
>
>
>
> Best Regqrds,
>
> Jürgen Sauermann
>
>
>
>
>
> On 06/14/2017 05:52 AM, Frederick Pitts
> wrote:
>
>
>
> > Juergen,
> >
Jürgen,
With gnu apl (svn 961 on Fedora 25, Intel(R) Core(TM) i7-6700
CPU), the residue function (∣) yields the following:
5J3 ∣ 14J5
1J4
5J3 | 1J4
¯4J1
5J3 | ¯4J1
¯4J1
The above result means that two elements in the complete residue system
(CSR) for mod 5J3 are equal, i
arently broken definition in the ISO standard.
>
>
>
> I hope this works better for you. At least I am getting this in
> SVN
> 964:
>
>
>
> 5J3 | 14J5
>
> 1J4
>
> 5J3 | 1J4
>
>
rd.
>
>
>
> I hope this works better for you. At least I am getting this in
> SVN
> 964:
>
>
>
> 5J3 | 14J5
>
> 1J4
>
> 5J3 | 1J4
>
> 1J4
>
>
agnitude and not smaller in value. Regarding your proposal
> (which
> is different from
>
> both IBM and ISO) my concern is that may lead to different
> results
> for modulo N and
>
> modulo N×1J0
>
>
>
> Best Regards,
>
> J
14J5 1J4 ¯4J1
> >
> > ¯4J1 ¯4J1 ¯4J1
> >
> >
> >
> > GNU APL:
> >
> >
> >
> > 5J3 ∣ 14J5 1J4 ¯4J1
> >
> > 1J4 1J4 1J4
> >
> >
Gaussian integers.
> Jay.
> On 23 June 2017 at 01:42, Frederick Pitts
> wrote:
> >
> >
> > Hello Jürgen,
> >
> > Some observations:
> >
> > 1) When performing a residue calculation on positive integers, a
> > straight-for
r less
> > verbatim
> > in APL. Also bear in mind that Floor and Residue in APL
> > have to
> > work well on all complex numbers, not just the Gaussian
> > integers.
> >
nsidered
>
> in the paper, and the descriptions in both ISO and the APL2
> language reference are
>
> entirely misleading in that respect.
>
>
>
> Have a nice weekend,
>
>
>
> Best Regards,
>
> /// Jürge
-A×⌊B÷A+A=0 is: (0,0)
>
> 0
>
>
>
> Attached is a debug variant using SVN 761.
>
>
>
> Best Regards,
>
> Jürgen
>
>
>
>
>
> On 06/24/2017 09:27 PM, Frederick Pitts
> wrote
Hello Jürgen,
The apl.html doc indicates that if environment variable
APL_LIB_ROOT is not defined, the subject search path will be from the
current directory '.' up to the root directory '/' stopping when a
directory containing two directories ’workspaces’ and ’wslib1’ is
found.
T
>
>
>
> If I remember correctly then the )lib command wants either a
> library reference number (0-9) or a
>
> path, but not both. If it fails, then )more tells which
> directory
> was tried (I fixed the spelling mistake)
>
> and the st
bPaths.cc function
> LibPaths::search_APL_lib_root()
>
>
>
> Hope it works,
>
> /// Jürgen
>
>
>
>
>
> On 06/26/2017 05:27 PM, Frederick Pitts
> wrote:
>
>
>
> >
> > Hello Jürg
Fred,
>
>
>
> thanks, fixed in SVN 973.
>
>
>
> I appears as if realpath() does not like it if the input
> buffer is the same as the
>
> output buffer.
>
>
>
> /// Jürge
Xtian,
Actually the function you present returns the type of the
argument, not the prototype, as per
Type <=> ↑0ρ⊂R
on page 46 of IBM's "APL2 Programming: Language Reference". The
prototype is the type of the first element of R, i.e.,
Prototype <=> ↑0⍴⊂
Hello Jürgen,
The IBM 'APL2 Programming: Language Reference' suggests that
axis specification is not allowed with the first function in that
'Figure 7. Functions and Operators That Allow Axis Specification', page
45, does not list 'First' by the '↑' symbol, whereas ravel, catenate
and la
personally would not
> do
> it, though.
>
>
>
> This language extension has been in GNU APL since almost day one.
> Therefore I
>
> cannot predict how often it is used (you can also do some dirty
> tricks with it). For
>
> that
ave an X (for axis) in their name. Since all functions
> are derived from this class it will change all primitives, but
>
> also all defined functions and operators. I personally would not
> do
> it, though.
>
>
>
> This language extension has been
Hello all,
With gnu-apl configured with RATIONAL_NUMBERS_WANTED=YES, I
observe the following:
⎕PS ← 1 22
x ← 3 ÷ 1
x + 1 ÷ 2
╔═══╗
║7÷2║
╚═══╝
x × 1 ÷ 2
╔═══╗
║1.5║
╚═══╝
The last result should be 3÷2. In general, multiplication of
integers and rationals s
Hello all,
Using SVN 996, configured with RATIONAL_NUMBERS_WANTED=YES, I
observe the following:
⎕PS ← 1 22
÷ ¯2
╔══╗
║1÷18446744073709551614║
╚══╝
1 ÷ ¯2
╔╗
║¯1÷2║
╚╝
÷ 2
╔═══╗
║1÷2║
╚═══╝
1 ÷ 2
╔═══╗
║1÷2║
╚═══
Hello all,
Has anyone tried using the subject utility (https://github.com/
TieDyedDevil/apl-nlf) recently? As of svn 996, I observe the
following with only the utility loaded:
]nlf e a 2
DOMAIN ERROR
nlf_ne[6] z←⊃λ1 λ2¨⊂[(1+⎕IO)]⎕NL ⍙⍙⍙class
^ ^
Hello all,
Gnu-APL (svn 996) yields the following:
)help ⊤
dyadic function: Z ← A ⊤ B (Encode)
Z is the representation of A in the number system whose radices are
B
and
)help ⊥
dyadic function: Z ← A ⊥ B (Decode)
Z is the values of array A evaluated in a
Hello again,
Please ignore the previous email. I now see corrections were
made somewhere between svn 996 and 1003. My bad.
Regards,
Fred
On Mon, 2017-08-28 at 10:42 -0500, Frederick Pitts wrote:
> Hello all,
>
> Gnu-APL (svn 996) yields the following:
>
&
Hello,
Is there an existing mechanism for accessing rational number
numerator and denominator parts analogous to that for accessing complex
number real and imaginary parts? If yes, please let me know how. If
no, can a mechanism be implemented?
Respectfully,
Fred
ing or exact). If you need
> the denominator, do the same with the inverse of n. If you need both,
> for example:
>
> 1 LCM n POW 1 _1
>
> Cheers,
> Louis
>
> > On 28 Aug 2017, at 23:24, Frederick Pitts
> > wrote:
> >
> > Hello,
> >
> &
gt; > > The true benefit of rational numbers is realised once there is
> > > support for bigints. Jürgen has suggested that that is planned,
> > > and personally I can't wait.
> > >
> > >
> > >
> > > Regards,
> > >
> > > E
t;
>
>
> Best Regards,
>
> /// Jürgen
>
>
>
>
>
> On 08/28/2017 11:24 PM, Frederick Pitts
> wrote:
>
>
>
> > Hello,
> >
> > Is there an existing mechanism for accessing
Hello all,
With svn 1010,
)help ⍣
dyadic operator: Z ← (F ⍣ G) B (Power Operator)
repeat G times: B ← F B (numeric scalar G)
dyadic operator: Z ← (F ⍣ G) B (Power Operator)
repeat: B ← F B until (F B) G B is true (function G)
dy
Hello Jürgen,
Should GNU APL report an APL error message, say "DOMAIN ERROR",
rather then an assertion diagnostic for `¯1 ? 5'? The reason I ask is
`3 ? ¯1' produces "DOMAIN ERROR".
Details follow:
f...@centari.modelling.org[fred] $ apl -v
BUILDTAG:
-
Project:
40 matches
Mail list logo
