RivetSTL.hh File Reference

#include <typeinfo>
#include <set>
#include <list>
#include <map>
#include <utility>
#include <string>
#include <sstream>
#include <vector>
#include <stdexcept>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <limits>
#include <cassert>
#include <fstream>
#include <algorithm>

Include dependency graph for RivetSTL.hh:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	Rivet
Defines
#define	CEDARSTD
Functions
Boolean-return container searching
bool	contains (const string &s, const string &sub)
	Does s contain sub as a substring?
template<typename T >
bool	contains (const vector< T > &v, const T &x)
	Does the vector v contain x?
template<typename T >
bool	contains (const list< T > &l, const T &x)
	Does the list l contain x?
template<typename T >
bool	contains (const set< T > &s, const T &x)
	Does the set s contain x?
template<typename K , typename T >
bool	has_key (const map< K, T > &m, const K &key)
	Does the map m contain the key key?
template<typename K , typename T >
bool	has_value (const map< K, T > &m, const T &val)
	Does the map m contain the value val?
Container filling and merging
template<typename T >
void	operator+= (vector< T > &v1, const vector< T > &v2)
	Append all the items from vector v2 to vector v1.
template<typename T >
vector< T >	operator+ (const vector< T > &v1, const vector< T > &v2)
	Create a new vector from the concatenated items in vectors v1 and v2.
template<typename T >
void	operator+= (set< T > &s1, const set< T > &s2)
	Merge the contents of set s2 into s1.
template<typename T >
set< T >	operator+ (const set< T > &s1, const set< T > &s2)
	Merge the contents of sets s1 and s2.

---

Define Documentation

#define CEDARSTD

Definition at line 59 of file RivetSTL.hh.