bridge/class-master/depend/pari/src/basemath/ifactor1.c
/* Sort all current unknowns downward to where they belong. Sweeps in the
 * upward direction. Not needed after ifac_crack(), only when ifac_divide()
 * returned true. Update *where. */
Sort all current unknowns downward to where they belong. Sweeps in the
upward direction. Not needed after ifac_crack(), only when ifac_divide()
returned true. Update *where.
Sort all current unknowns downward to where they belong . Sweeps in the upward direction . Not needed after ifac_crack () only when ifac_divide () returned true . Update * where .
static void
ifac_resort(GEN *partial, GEN *where)
{
  GEN scan, end;
  ifac_defrag(partial, where); end = LAST(*partial);
  for (scan = *where; scan <= end; scan += 3)
    if (VALUE(scan) && !CLASS(scan)) ifac_sort_one(where, scan); 
  ifac_defrag(partial, where); 
}
static void ifac_resort ( GEN * partial , GEN * where ) { GEN scan , end ; ifac_defrag ( partial , where ) ; end = LAST ( * partial ) ; for ( scan = * where ; scan <= end ; scan += 3 ) if ( VALUE ( scan ) && ! CLASS ( scan ) ) ifac_sort_one ( where , scan ) ; ifac_defrag ( partial , where ) ; }
Sort all current unknowns downward to where they belong.
Sort all current unknowns downward to where they belong .
/*unknown*/ /* remove newly created gaps */