spairs_sort()

void gbA::spairs_sort ( int len, spair *& list )

private

Definition at line 1226 of file gb-default.cpp.

{
  if (ps == nullptr || ps->next == nullptr) return;
  if (len <= 1) return;
  spairs a;  // array of spair's
  spairs b;  // these are the ones which are uncomputed, but whose lead_of_spoly
             // is 0.
  a.reserve(len);
  for (spair *p = ps; p != nullptr; p = p->next)
    {
      if ((p->type > SPAIR::SPAIR_SKEW) || p->lead_of_spoly)
        a.push_back(p);
      else
        b.push_back(p);
    }
 
  SPolySorter SP(R, _F);
  //  QuickSorter<SPolySorter>::sort(&SP,&a[0],a.size());
  std::stable_sort(a.begin(), a.end(), SP);
  int asize = INTSIZE(a);
  int bsize = INTSIZE(b);
 
  if (asize > 0)
    {
      ps = a[0];
      for (int i = 1; i < asize; i++) a[i - 1]->next = a[i];
    }
  else if (bsize > 0)
    {
      ps = b[0];
      // debugging// fprintf(stderr, "bsize is %d\n",bsize);
    }
  else
    {
      ps = nullptr;
      return;
    }
 
  if (asize > 0) a[asize - 1]->next = (bsize > 0 ? b[0] : nullptr);
  if (bsize > 0)
    {
      for (int i = 1; i < bsize; i++) b[i - 1]->next = b[i];
      b[bsize - 1]->next = nullptr;
    }
}

References _F, INTSIZE, gbA::spair::next, p, R, and SPAIR_SKEW.

Referenced by spair_set_prepare_next_degree().