print_seq.h

Go to the documentation of this file.

// Sequence output implementation -*- C++ -*-

// $Id: print_seq.h 718 2008-09-19 11:49:54Z mihaly $
// Copyright (C) 2001-2003 Hermann Schichl
//
// This file is part of the COCONUT API.  This library
// is free software; you can redistribute it and/or modify it under the
// terms of the Library GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// Library GNU General Public License for more details.

// As a special exception, you may use this file as part of a free software
// library without restriction.  Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the Library GNU General Public License.  This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the Library GNU General Public License.

#ifndef __PRINT_SEQ_H_
#define __PRINT_SEQ_H_

#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <iterator>
#include <linalg.h>

namespace std {

template <typename _Ve, typename _TA>
ostream& operator<<(ostream& o, const vector<_Ve,_TA>& a)
{
  if(a.size() == 1)
    o << a[0];
  else if(!a.empty())
  {
    typename vector<_Ve,_TA>::const_iterator e(a.end());
    copy(a.begin(), --e, ostream_iterator<_Ve>(o, ","));
    o << *e;
  }
  return o;
}

template <typename _Ve, typename _TA>
ostream& operator<<(ostream& o, const list<_Ve,_TA>& a)
{
  if(a.size() == 1)
    o << *(a.begin());
  else if(!a.empty())
  {
    typename list<_Ve,_TA>::const_iterator e(a.end());
    copy(a.begin(), --e, ostream_iterator<_Ve>(o, ", "));
    o << *e;
  }
  return o;
}

template <typename _Ve, typename _TA>
ostream& operator<<(ostream& o, const deque<_Ve,_TA>& a)
{
  if(a.size() == 1)
    o << *(a.begin());
  else if(!a.empty())
  {
    typename deque<_Ve,_TA>::const_iterator e(a.end());
    copy(a.begin(), --e, ostream_iterator<_Ve>(o, ", "));
    o << *e;
  }
  return o;
}

template <typename _Tp>
ostream& operator<<(ostream &s, const linalg::sparse_vector<_Tp> &a)
{
  if(a.size()==0)
    s << "[ Zero ]";
  else
  // note on modifications: don't use \b to delete "," because python or similar complain about invalid characters
  {
    if(a.output_format == linalg::linalg_output_sparse)
    {
      s << "[";
      typename linalg::sparse_vector<_Tp>::const_iterator _i;
      typename linalg::sparse_vector<_Tp>::const_iterator _i_max;
      bool zero=true;
      _i_max = a.end();
      for(_i = a.begin(); _i < _i_max; ++_i)
      {
        if(zero)
          zero = false;
        else
          s << ",";
        s << "(" << _i.index() << "):" << (*_i);
      }
      //the last _i
      s << ((zero) ? " Zero ]":"]");
    }
    else // output_format != linalg_output_sparse
    {
      s << "[";
      int i_max = a.size() - 1;
      for(int i=0; i<i_max; ++i)
          s << a[i] << ",";
      // the last i
      s << a[a.size()]<< "]";
    }
  }
  return s;
}
} // namespace std

#endif /* __PRINT_SEQ_H_ */

---