bridge/class-master/depend/pari/src/basemath/ifactor1.c
/* assume n > 0, which we can assign to */
/* return initial data structure, see ifac_crack() for the hint argument */
assume n > 0, which we can assign to
return initial data structure, see ifac_crack() for the hint argument
assume n > 0 which we can assign to return initial data structure see ifac_crack () for the hint argument
static GEN
ifac_start_hint(GEN n, int moebius, long hint)
{
  const long ifac_initial_length = 3 + 7*3;
  GEN here, part = cgetg(ifac_initial_length, t_VEC);
  MOEBIUS(part) = moebius? gen_1 : NULL;
  HINT(part) = stoi(hint);
  if (isonstack(n)) n = absi(n);
  here = part + ifac_initial_length - 3; 
  INIT(here, n,gen_1,gen_0); 
  while ((here -= 3) > part) ifac_delete(here);
  return part;
}
static GEN ifac_start_hint ( GEN n , int moebius , long hint ) { const long ifac_initial_length = 3 + 7 * 3 ; GEN here , part = cgetg ( ifac_initial_length , t_VEC ) ; MOEBIUS ( part ) = moebius ? gen_1 : NULL ; HINT ( part ) = stoi ( hint ) ; if ( isonstack ( n ) ) n = absi ( n ) ; here = part + ifac_initial_length - 3 ; INIT ( here , n , gen_1 , gen_0 ) ; while ( ( here -= 3 ) > part ) ifac_delete ( here ) ; return part ; }
assume n > 0, which we can assign to
return initial data structure, see ifac_crack() for the hint argument
assume n > 0 which we can assign to return initial data structure see ifac_crack () for the hint argument
/* codeword, moebius, hint, 7 slots -- a 512-bit product of distinct 8-bit
   * primes needs at most 7 slots at a time) */ /* make copy, because we'll later want to replace it in place.
   * If it's not on stack, then we assume it is a clone made for us by
   * ifactor, and we assume the sign has already been set positive */ /* fill first slot at the top end */ /* LAST(part) */ /* n^1: composite */