/usr/include/ThePEG/Config/std.h is in libthepeg-dev 1.8.0-3build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 | // -*- C++ -*-
//
// std.h is a part of ThePEG - Toolkit for HEP Event Generation
// Copyright (C) 1999-2011 Leif Lonnblad
//
// ThePEG is licenced under version 2 of the GPL, see COPYING for details.
// Please respect the MCnet academic guidelines, see GUIDELINES for details.
//
#ifndef ThePEG_std_H
#define ThePEG_std_H
/** \file
* This file introduces a number of <code>std::</code> classes into
* the ThePEG namespace. Also introduces some useful functions for
* standard library classes.
*
* Do not make changes in this file. If you want to use alternatives
* to the <code>std::</code> classes in ThePEG, edit a copy of this
* file and include it in an alternative config file which can be
* included in the main ThePEG.h config file using the macro
* <code>ThePEG_ALTERNATE_CONFIG</code>.
*/
#include <map>
#include <set>
#include <string>
#include <vector>
#include <list>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <stack>
#include <utility>
#include <typeinfo>
#include <stdexcept>
#include <cmath>
namespace std {
/** @cond TRAITSPECIALIZATIONS */
/**
* This specialization of the std::less class is needed in order to be
* able use put pointers to type_info objects as keys in maps and
* sets.
*/
template <>
struct less<const type_info *> :
public binary_function<const type_info *, const type_info *, bool>
{
/**
* This is the function called when comparing two pointers to
* type_info.
*/
bool operator()(const type_info * x, const type_info * y) const {
return x->before(*y); }
};
/** @endcond */
}
/** @cond SHOWOSXWORKAROUNDS */
// Workarounds for OS X
#if defined __APPLE__ && defined __MACH__
extern "C" int isnan(double) throw();
extern "C" int isinf(double) throw();
#endif
/** @endcond */
namespace ThePEG {
using std::deque;
using std::stack;
using std::vector;
using std::multiset;
using std::set;
using std::map;
using std::list;
using std::multimap;
using std::pair;
using std::make_pair;
using std::less;
using std::string;
using std::type_info;
using std::exception;
using std::range_error;
using std::ios;
using std::ostream;
using std::istream;
using std::ofstream;
using std::ifstream;
using std::ostringstream;
using std::istringstream;
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
using std::flush;
using std::setprecision;
using std::setw;
using std::swap;
using std::min;
using std::max;
using std::mem_fun;
using std::sqrt;
using std::pow;
using std::atan2;
/** Square root of an integer. */
inline double sqrt(int x) {
return std::sqrt(double(x));
}
/** Check if a given object is a part of a container. */
template <typename Container, typename Key>
inline bool member(const Container & c, const Key & k) {
return c.find(k) != c.end();
}
/** Check if a given object is a part of a vector. */
template <typename T, typename Key>
inline bool member(const vector<T> & v, const Key & k) {
for ( typename vector<T>::const_iterator i = v.begin(); i != v.end(); ++i )
if ( *i == k ) return true;
return false;
// return find(v.begin(), v.end(), k) != v.end();
}
/** Return an insert iterator for a given container. */
template <typename Cont>
inline std::insert_iterator<Cont> inserter(Cont & c) {
return std::insert_iterator<Cont>(c, c.end());
}
/** Return an insert iterator for a given vector. Overrides the
* general version. */
template <typename T, typename A>
inline std::back_insert_iterator< vector<T,A> > inserter(vector<T,A> & v) {
return back_inserter(v);
}
/** Return an insert iterator for a given vector. Overrides the
* general version. */
template <typename T, typename A>
inline std::back_insert_iterator< deque<T,A> > inserter(deque<T,A> & v) {
return back_inserter(v);
}
/** Stream manipulator setting an ostream to left-adjust its ouput. */
inline ostream& left(ostream& os) {
os.setf(ios::left, ios::adjustfield);
return os;
}
/** Stream manipulator setting an ostream to right-adjust its ouput. */
inline ostream& right(ostream& os) {
os.setf(ios::right, ios::adjustfield);
return os;
}
}
#ifndef ThePEG_WRAP_STL_CONTAINERS
/** Macro for declaring a set. */
#define ThePEG_DECLARE_SET(VALTYPE,NAME) \
/** A set of VALTYPE. */ \
typedef set<VALTYPE, less<VALTYPE> > NAME
/** Macro for declaring a multiset. */
#define ThePEG_DECLARE_MULTISET(VALTYPE,NAME) \
/** A multiset of VALTYPE. */ \
typedef multiset<VALTYPE, less<VALTYPE> > NAME
/** Macro for declaring a map. */
#define ThePEG_DECLARE_MAP(KEYTYPE,VALTYPE,NAME) \
/** A map of VALTYPE indexed by KEYTYPE. */ \
typedef map<KEYTYPE, VALTYPE, less<KEYTYPE> > NAME
/** Macro for implementing a set. */
#define ThePEG_IMPLEMENT_SET(VALTYPE,NAME)
/** Macro for implementing a multiset. */
#define ThePEG_IMPLEMENT_MULTISET(VALTYPE,NAME)
/** Macro for implementing a map. */
#define ThePEG_IMPLEMENT_MAP(KEYTYPE,VALTYPE,NAME)
#else
/** Macro for declaring a set. */
#define ThePEG_DECLARE_SET(VALTYPE,NAME) \
class NAME : public set<VALTYPE, less<VALTYPE> > { \
public: \
typedef set<VALTYPE, less<VALTYPE> > SETTYPE; \
NAME(); \
explicit NAME(const key_compare & c, \
const allocator_type & a = allocator_type()); \
template <typename InputIterator> \
NAME(InputIterator first, InputIterator last) \
: SETTYPE(first, last) {} \
template <typename InputIterator> \
NAME(InputIterator first, InputIterator last, const key_compare & c, \
const allocator_type & a = allocator_type()) \
: SETTYPE(first, last, c, a) {} \
NAME(const SETTYPE & s); \
NAME(const NAME & s); \
~NAME(); \
NAME & operator=(const NAME &); \
NAME & operator=(const SETTYPE &); \
pair<iterator,bool> insert(const value_type & x); \
iterator insert(iterator position, const value_type & x); \
template <typename InputIterator> \
void insert(InputIterator first, InputIterator last) { \
SETTYPE::insert(first, last); \
} \
void erase(iterator position); \
size_type erase(const key_type & x); \
void erase(iterator first, iterator last); \
void clear(); \
iterator find(const key_type & x) const; \
size_type count(const key_type & x) const; \
iterator lower_bound(const key_type & x) const; \
iterator upper_bound(const key_type & x) const; \
pair<iterator,iterator> equal_range(const key_type & x) const; \
}
/** Macro for declaring a multiset. */
#define ThePEG_DECLARE_MULTISET(VALTYPE,NAME) \
class NAME : \
public multiset<VALTYPE, less<VALTYPE> > { \
public: \
typedef multiset<VALTYPE, less<VALTYPE> > SETTYPE;\
NAME(); \
explicit NAME(const key_compare & c, \
const allocator_type & a = allocator_type()); \
template <typename InputIterator> \
NAME(InputIterator first, InputIterator last) \
: SETTYPE(first, last) {} \
template <typename InputIterator> \
NAME(InputIterator first, InputIterator last, const key_compare & c, \
const allocator_type & a = allocator_type()) \
: SETTYPE(first, last, c, a) {} \
NAME(const SETTYPE & s); \
NAME(const NAME & s); \
~NAME(); \
NAME & operator=(const NAME &); \
NAME & operator=(const SETTYPE &); \
iterator insert(const value_type & x); \
iterator insert(iterator position, const value_type & x); \
template <typename InputIterator> \
void insert(InputIterator first, InputIterator last) { \
SETTYPE::insert(first, last); \
} \
void erase(iterator position); \
size_type erase(const key_type & x); \
void erase(iterator first, iterator last); \
void clear(); \
iterator find(const key_type & x) const; \
size_type count(const key_type & x) const; \
iterator lower_bound(const key_type & x) const; \
iterator upper_bound(const key_type & x) const; \
pair<iterator,iterator> equal_range(const key_type & x) const; \
}
/** Macro for declaring a map. */
#define ThePEG_DECLARE_MAP(KEYTYPE,VALTYPE,NAME) \
class NAME : \
public map<KEYTYPE, VALTYPE, less<KEYTYPE> > { \
public: \
typedef map<KEYTYPE, VALTYPE, less<KEYTYPE> > MAPTYPE; \
NAME(); \
explicit NAME(const key_compare & c, \
const allocator_type & a = allocator_type()); \
template <typename InputIterator> \
NAME(InputIterator first, InputIterator last) \
: MAPTYPE(first, last) {} \
template <typename InputIterator> \
NAME(InputIterator first, InputIterator last, const key_compare & c, \
const allocator_type & a = allocator_type()) \
: MAPTYPE(first, last, c, a) {} \
NAME(const NAME & s); \
NAME(const MAPTYPE & s); \
~NAME(); \
NAME & operator=(const NAME &); \
NAME & operator=(const MAPTYPE &); \
data_type & operator[](const key_type & k); \
pair<iterator,bool> insert(const value_type & x); \
iterator insert(iterator position, const value_type & x); \
template <typename InputIterator> \
void insert(InputIterator first, InputIterator last) { \
MAPTYPE::insert(first, last); \
} \
void erase(iterator position); \
size_type erase(const key_type & x); \
void erase(iterator first, iterator last); \
void clear(); \
iterator find(const key_type & x); \
const_iterator find(const key_type & x) const; \
size_type count(const key_type & x) const; \
iterator lower_bound(const key_type & x); \
const_iterator lower_bound(const key_type & x) const; \
iterator upper_bound(const key_type & x); \
const_iterator upper_bound(const key_type & x) const; \
pair<iterator,iterator> equal_range(const key_type & x); \
pair<const_iterator,const_iterator> \
equal_range(const key_type & x) const; \
}
/** Macro for implementing a set. */
#define ThePEG_IMPLEMENT_SET(VALTYPE,NAME) \
NAME::NAME() {} \
NAME::NAME(const key_compare & c, const allocator_type & a) \
:SETTYPE(c, a) {} \
NAME::NAME(const NAME & x) : SETTYPE(x) {} \
NAME::NAME(const SETTYPE & x) : SETTYPE(x) {} \
NAME::~NAME() {} \
NAME & NAME::operator=(const NAME & x) { \
SETTYPE::operator=(x); \
return *this; \
} \
NAME & NAME::operator=(const SETTYPE & x) { \
SETTYPE::operator=(x); \
return *this; \
} \
pair<NAME::iterator,bool> NAME::insert(const value_type & x) { \
return SETTYPE::insert(x); \
} \
NAME::iterator NAME::insert(iterator position, const value_type & x) { \
return SETTYPE::insert(position, x); \
} \
void NAME::erase(iterator position) { \
SETTYPE::erase(position); \
} \
NAME::size_type NAME::erase(const key_type & x) { \
return SETTYPE::erase(x); \
} \
void NAME::erase(iterator first, iterator last) { \
SETTYPE::erase(first, last); \
} \
void NAME::clear() { \
SETTYPE::clear(); \
} \
NAME::iterator NAME::find(const key_type & x) const { \
return SETTYPE::find(x); \
} \
NAME::size_type NAME::count(const key_type & x) const { \
return SETTYPE::count(x); \
} \
NAME::iterator NAME::lower_bound(const key_type & x) const { \
return SETTYPE::lower_bound(x); \
} \
NAME::iterator NAME::upper_bound(const key_type & x) const { \
return SETTYPE::upper_bound(x); \
} \
pair<NAME::iterator,NAME::iterator> \
NAME::equal_range(const key_type & x) const { \
return SETTYPE::equal_range(x); \
} \
/** Macro for implementing a multiset. */
#define ThePEG_IMPLEMENT_MULTISET(VALTYPE,NAME) \
NAME::NAME() {} \
NAME::NAME(const key_compare & c, const allocator_type & a) \
:SETTYPE(c, a) {} \
NAME::NAME(const NAME & x) : SETTYPE(x) {} \
NAME::NAME(const SETTYPE & x) : SETTYPE(x) {} \
NAME::~NAME() {} \
NAME & NAME::operator=(const NAME & x) { \
SETTYPE::operator=(x); \
return *this; \
} \
NAME & NAME::operator=(const SETTYPE & x) { \
SETTYPE::operator=(x); \
return *this; \
} \
NAME::iterator NAME::insert(const value_type & x) { \
return SETTYPE::insert(x); \
} \
NAME::iterator NAME::insert(iterator position, const value_type & x) { \
return SETTYPE::insert(position, x); \
} \
void NAME::erase(iterator position) { \
SETTYPE::erase(position); \
} \
NAME::size_type NAME::erase(const key_type & x) { \
return SETTYPE::erase(x); \
} \
void NAME::erase(iterator first, iterator last) { \
SETTYPE::erase(first, last); \
} \
void NAME::clear() { \
SETTYPE::clear(); \
} \
NAME::iterator NAME::find(const key_type & x) const { \
return SETTYPE::find(x); \
} \
NAME::size_type NAME::count(const key_type & x) const { \
return SETTYPE::count(x); \
} \
NAME::iterator NAME::lower_bound(const key_type & x) const { \
return SETTYPE::lower_bound(x); \
} \
NAME::iterator NAME::upper_bound(const key_type & x) const { \
return SETTYPE::upper_bound(x); \
} \
pair<NAME::iterator,NAME::iterator> \
NAME::equal_range(const key_type & x) const { \
return SETTYPE::equal_range(x); \
} \
/** Macro for implementing a map. */
#define ThePEG_IMPLEMENT_MAP(KEYTYPE,VALTYPE,NAME) \
NAME::NAME() {} \
NAME::NAME(const key_compare & c, const allocator_type & a) \
:MAPTYPE(c, a) {} \
NAME::NAME(const NAME & x) : MAPTYPE(x) {} \
NAME::NAME(const MAPTYPE & x) : MAPTYPE(x) {} \
NAME::~NAME() {} \
NAME & NAME::operator=(const NAME & x) { \
MAPTYPE::operator=(x); \
return *this; \
} \
NAME & NAME::operator=(const MAPTYPE & x) { \
MAPTYPE::operator=(x); \
return *this; \
} \
pair<NAME::iterator,bool> NAME::insert(const value_type & x) { \
return MAPTYPE::insert(x); \
} \
NAME::iterator NAME::insert(iterator position, const value_type & x) { \
return MAPTYPE::insert(position, x); \
} \
void NAME::erase(iterator position) { \
MAPTYPE::erase(position); \
} \
NAME::size_type NAME::erase(const key_type & x) { \
return MAPTYPE::erase(x); \
} \
void NAME::erase(iterator first, iterator last) { \
MAPTYPE::erase(first, last); \
} \
void NAME::clear() { \
MAPTYPE::clear(); \
} \
NAME::iterator NAME::find(const key_type & x) { \
return MAPTYPE::find(x); \
} \
NAME::const_iterator NAME::find(const key_type & x) const { \
return MAPTYPE::find(x); \
} \
NAME::size_type NAME::count(const key_type & x) const { \
return MAPTYPE::count(x); \
} \
NAME::iterator NAME::lower_bound(const key_type & x) { \
return MAPTYPE::lower_bound(x); \
} \
NAME::const_iterator NAME::lower_bound(const key_type & x) const { \
return MAPTYPE::lower_bound(x); \
} \
NAME::iterator NAME::upper_bound(const key_type & x) { \
return MAPTYPE::upper_bound(x); \
} \
NAME::const_iterator NAME::upper_bound(const key_type & x) const { \
return MAPTYPE::upper_bound(x); \
} \
pair<NAME::iterator,NAME::iterator> \
NAME::equal_range(const key_type & x) { \
return MAPTYPE::equal_range(x); \
} \
pair<NAME::const_iterator,NAME::const_iterator> \
NAME::equal_range(const key_type & x) const { \
return MAPTYPE::equal_range(x); \
} \
NAME::data_type & NAME::operator[](const key_type & k) { \
return MAPTYPE::operator[](k); \
} \
#endif
// #include "std.icc"
#ifndef ThePEG_TEMPLATES_IN_CC_FILE
// #include "std.tcc"
#endif
#endif /* ThePEG_std_H */
|