graph-global.h

/**************************************************************************
 * Copyright (c) 2002-2011 T. M. Murali                                   *
 *                                                                        *
 * This file is part of Biorithm.                                         *
 *                                                                        *
 * Biorithm is free software: you can redistribute it and/or modify       *
 * it under the terms of the GNU General Public License as published by   *
 * the Free Software Foundation, either version 3 of the License, or      *
 * (at your option) any later version.                                    *
 *                                                                        *
 * Biorithm 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          *
 * GNU General Public License for more details.                           *
 *                                                                        *
 * You should have received a copy of the GNU General Public License      *
 * along with Biorithm.  If not, see <http://www.gnu.org/licenses/>.      *
 *                                                                        *
 **************************************************************************/

#ifndef _GRAPH_GLOBAL_H
#define _GRAPH_GLOBAL_H

#include <iostream>
#include <map>
#include <vector>
#include <set>

using namespace std;

// print a vector to an output stream
template < class T >
ostream &operator<<(ostream &ostr, const vector< T > &items)
{
//  copy(items.begin(), items.end(), ostream_iterator< T >(ostr, " "));
  typename vector< T >::const_iterator itr;
  for (itr = items.begin(); itr != items.end(); itr++)
    ostr << *itr << " ";
  return(ostr);
}


template <class T>
ostream& operator<<(ostream& ostr, set< T > s)
{
  typename set< T >::const_iterator itr;
  
  for (itr = s.begin(); itr != s.end(); itr++)
    ostr << *itr << " ";
  return(ostr);
}

template <class T, class U>
ostream& operator<<(ostream& ostr, map< T, U > m)
{
  typename map< T, U >::iterator itr;
  
  for (itr = m.begin(); itr != m.end(); itr++)
    ostr << (*itr).first << " (" << (*itr).second << ") ";
  return(ostr);
}

// to keep this typedef consistent with xMotif.
typedef double MyNT;

// return true if text matches a non-space character. trying this
// function to see if is faster than perl_match(text, "m/\\S/").
inline bool matches_non_space(string text)
{
  for (unsigned int i = 0; i < text.length(); i++)
    if (!isspace(text[i]))
      return(true);
  // all characters match whitespace.
  return(false);
}



#endif // _GRAPH_GLOBAL_H