Re: [Bug-apl] Hang in Residue

Thanks. At r1034 I get: A←(-⌽A),0,A←1e¯200 1e¯100 1 1e100 1e200 A∘.|A DOMAIN ERROR And here's one of the cases that fails: 1e¯200|1e200 DOMAIN ERROR This still seems wrong to me, since the ISO standard for Residue says "Implementations should avoid signalling limit-error in re

Re: [Bug-apl] Hang in Residue

Hi Jay, thanks, fixed in SVN 1035. BTW tryapl.com gives this: A←1E¯200 1E200 ¯1E¯200 ¯1E200 A ∘.∣ A 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 /// Jürgen   TOn 01/08/2018 10:29 AM, Jay Foad wrote: Thanks. At r1034 I ge

Re: [Bug-apl] Hang in Residue

Thanks. With r1035 I get: A←(-⌽A),0,A←1e¯200 1e¯100 1 1e100 1e200 A∘.|A 0E00E00 0E0 0E00 0E00E00 0E0 0E0 0E00E00 0E0 0E00 0E00E00 0E0 0E0 0E00E00 0E0 0E00 0E00E00 0E0 0E0 0E00E00 0E0 0E0

Re: [Bug-apl] Hang in Residue

Hi Jay, maybe SVN 1036 works better. /// Jürgen On 01/08/2018 01:02 PM, Jay Foad wrote: Thanks. With r1035 I get:       A←(-⌽A),0,A←1e¯200 1e¯100 1 1e100 1e200       A∘.|A  

Re: [Bug-apl] Hang in Residue

Yes, thanks! Now, when ⎕CT=0 there are some odd results: ⎕CT←0 A←(-⌽A),0,A←1e¯200 1e¯100 1 1e100 1e200 A∘.|A 0E0 ¯1E100 ¯1E0 ¯1E¯100 ¯1E¯200 0 0E00E0¯1E200 0E0 0E0 0E00E0 ¯1E0 ¯1E¯100 ¯1E¯200 0 0E00E0¯1E100 0E0 0E0 0E00E00E0 ¯1E¯100 ¯1

Re: [Bug-apl] Hang in Residue

Hi Jay, I am still puzzled by the ISO description (and can't find the "IEEE standard for Binary Floating-Point Arithmetic (754)" referenced in the standard. Would you be able to provide the expected expected output of your example below?

Re: [Bug-apl] Hang in Residue

I can't easily find the document online without having to pay for it, but doesn't the Wikipedia page contain all the information you need? https://en.m.wikipedia.org/wiki/IEEE_754 On 9 Jan 2018 12:14 am, "Juergen Sauermann" wrote: > Hi Jay, > > I am still puzzled by the ISO description (and can'

Re: [Bug-apl] Hang in Residue

Hi Elias, the ISO APL standard says: "Note: The implementation-algorithm P modulo Q provides an exact modulo operation for realnumbers P and Q. It evaluates R←B-(×B)×|A×⌊|B÷A and return R if (×A)=×B or R+A otherwise. The definition of

Re: [Bug-apl] Hang in Residue

Hi, Probably this could be of help: http://www.softelectro.ru/ieee754_en.html Elias Mårtenson writes: > I can't easily find the document online without having to pay for it, but > doesn't the Wikipedia > page contain all the information you need? > https://en.m.wikipedia.org/wiki/IEEE_754 >

Re: [Bug-apl] Hang in Residue

It's a waste of time to make modulo exact for inexact floating point numbers. People should expect round off errors in those cases. Until GNU APL have multi-precision numbers, it is pointless to make modulo exact for inexact numbers. Asking for exact result with something like (1E200+⍳