hcf is my own function that returns the greatest common factor. It is working fine.
My program says Internal JIT Failure at line 28 (program only has 17 lines) when I run it. If I display the y after the hcf function, then it works fine. Here is my code:
function x=relprime(a,b,c,d)
%This function returns the number of relative primes to c in a:b if type=1
%If type=2, the function returns the list of relative primes
x=0;
count=1;
for i=a:b y=hcf(i,c);y %The program will not work without the y after the semicolon if y==1 & d==1 x=x+1; else if y==1 & d==2 x(count)=i; count=count+1; end end end
Thanks in advance!
Michael
hcf is my own function that returns the greatest common factor. It is working fine.
Can you post HCF anyway? I can't debug otherwise.
I ended up figuring it out, thanks!
To: 587@bugs.freemat.p.re.sf.net
From: samitbasu@users.sf.net
Subject: [freemat:bugs] #587 Internal JIT Failure
Date: Thu, 11 Jul 2013 23:01:12 +0000
Can you post HCF anyway? I can't debug otherwise.
[bugs:#587] Internal JIT Failure
Status: open
Created: Thu Jun 27, 2013 06:07 PM UTC by Michael Bergwell
Last Updated: Thu Jun 27, 2013 06:08 PM UTC
Owner: nobody
My program says Internal JIT Failure at line 28 (program only has 17 lines) when I run it. If I display the y after the hcf function, then it works fine. Here is my code:
function x=relprime(a,b,c,d)
%This function returns the number of relative primes to c in a:b if type=1 %If type=2, the function returns the list of relative primes x=0; count=1;
for i=a:b
y=hcf(i,c);y %The program will not work without the y after the semicolon
if y==1 & d==1 x=x+1; else if y==1 & d==2 x(count)=i; count=count+1; end end
end
Thanks in advance!
Michael
Sent from sourceforge.net because you indicated interest in https://sourceforge.net/p/freemat/bugs/587/
To unsubscribe from further messages, please visit https://sourceforge.net/auth/subscriptions/
Log in to post a comment.