poorperl.h

/**************************************************************************
 * Copyright (c) 2004-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 _POORPERL_H
#define _POORPERL_H

#include <map>
#include <string>
#include <vector>

using namespace std;

// like Perl's exists() function to check if a key exists in a map. 
// will work for a set too.
template < class Container, class Item >
bool exists(const Container &container, const Item &item)
{
  return(container.end() != container.find(item));
}


// like Perl's exists() function to check if a key exists in a map. 
// but also returns the value.
template< class Key, class Value >
bool exists(const map< Key, Value > &mymap, const Key &key, Value &value)
{
  typename map< Key, Value >::const_iterator itr;
  itr = mymap.find(key);
  bool found = (mymap.end() != itr);
  if (found)
    value = (*itr).second;
  return(found);
}



char read_till_char(istream &istr, string &name, string limits,
                                string ignore = "");
// read a line from istr and store in line.
inline void read_line(istream &istr, string &line)
{
  read_till_char(istr, line, "\n");
}


// emulating perl_match(text, "m/\\S/"). used in gene.C and read.C,
// for example.
bool string_matches_non_space(const string &text);
// emulating perl_match(text, "m/pattern/")
bool string_matches(const string &text, const string &pattern);
string::size_type string_split(const string &text, const string &splitters,
                               vector< string > &items);
void string_substitute(string &text, const string &original,
                       const string &substitute);



#endif // _POORPERL_H