Method ordered_format_print

IntegerProgramming/list.cc:808–869

void list::ordered_format_print(ofstream& output, const term_ordering& w) const
{

#ifdef DL_LIST

  element* iter=start->next;

#endif  // DL_LIST

#ifdef SL_LIST

  element *iter=start;

#endif  // SL_LIST

  if(iter==NULL)
  {
    cerr<<"\nWARNING: void list::ordered_format_print(const term_ordering&) "
      "const:\n"
      "cannot print corrupt list"<<endl;
    output<<"\nWARNING: void list::ordered_format_print(const term_ordering&) "
      "const:\n"
      "cannot print corrupt list\n"<<endl;
    return;
  }

  list aux;

  while(iter->next!=NULL)
  {
    aux._ordered_insert(*(iter->entry),w);
    iter=iter->next;
  }

  aux.format_print(output);

  // delete aux, but only the element structs, not the binomials
  // (these are still stored in the actual list!)

#ifdef DL_LIST

  iter=(aux.start)->next;

#endif  // DL_LIST

#ifdef SL_LIST


  iter=aux.start;

#endif


  while((iter->next)!=NULL)
  {
    element* aux1=iter->next;
    iter->next=iter->next->next;
    delete aux1;