version 1.10, 2001/10/09 01:36:06 |
version 1.12, 2015/08/06 10:01:52 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/int.c,v 1.9 2001/06/07 04:54:38 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/int.c,v 1.11 2013/09/26 08:55:11 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 508 void igcdv(VECT a,Q *rp) |
|
Line 508 void igcdv(VECT a,Q *rp) |
|
NTOQ(*c,1,*rp); return; |
NTOQ(*c,1,*rp); return; |
} |
} |
gcdn(c[0],c[1],&g); |
gcdn(c[0],c[1],&g); |
|
#if 0 |
for ( i = 2; i < n; i++ ) { |
for ( i = 2; i < n; i++ ) { |
divn(c[i],g,&q,&r); |
divn(c[i],g,&q,&r); |
gcdn(g,r,>); |
gcdn(g,r,>); |
Line 520 void igcdv(VECT a,Q *rp) |
|
Line 521 void igcdv(VECT a,Q *rp) |
|
} else |
} else |
g = gt; |
g = gt; |
} |
} |
|
#else |
|
for ( i = 2; i < n; i++ ) { |
|
gcdn(g,c[i],>); g = gt; |
|
} |
|
#endif |
NTOQ(g,1,*rp); |
NTOQ(g,1,*rp); |
} |
} |
|
|
Line 822 void Prandom(NODE arg,Q *rp) |
|
Line 828 void Prandom(NODE arg,Q *rp) |
|
UTOQ(r,*rp); |
UTOQ(r,*rp); |
} |
} |
|
|
#if defined(VISUAL) |
#if defined(VISUAL) || defined(__MINGW32__) || defined(__MINGW64__) |
void srandom(unsigned int); |
void srandom(unsigned int); |
|
|
static unsigned int R_Next; |
static unsigned int R_Next; |