5#include "Rivet/Tools/RivetSTL.hh"
6#include "Rivet/Tools/PrettyPrint.hh"
7#include "Rivet/Tools/Exceptions.hh"
25#if __GNUC__ && __cplusplus && RIVET_NO_DEPRECATION_WARNINGS == 0
26 #define DEPRECATED(x) __attribute__((deprecated(x)))
37 static constexpr double DBL_NAN = std::numeric_limits<double>::quiet_NaN();
49 template<
typename T,
typename U>
57 }
catch (
const std::exception& e) {
67 return lexical_cast<string>(x);
75 return lexical_cast<string>(x);
79 inline string&
replace_first(
string& str,
const string& patt,
const string& repl) {
80 if (!
contains(str, patt))
return str;
81 str.replace(str.find(patt), patt.size(), repl);
90 inline string&
replace_all(
string& str,
const string& patt,
const string& repl) {
91 if (!
contains(str, patt))
return str;
93 string::size_type it = str.find(patt);
94 if (it == string::npos)
break;
95 str.replace(it, patt.size(), repl);
103 string::const_iterator it1 = s1.begin();
104 string::const_iterator it2 = s2.begin();
105 while ( (it1 != s1.end()) && (it2 != s2.end()) ) {
106 if(::toupper(*it1) != ::toupper(*it2)) {
108 return (::toupper(*it1) < ::toupper(*it2)) ? -1 : 1;
114 size_t size1 = s1.size(), size2 = s2.size();
116 if (size1 == size2)
return 0;
117 return (size1 < size2) ? -1 : 1;
130 std::transform(out.begin(), out.end(), out.begin(), (
int(*)(
int)) std::tolower);
138 std::transform(out.begin(), out.end(), out.begin(), (
int(*)(
int)) std::toupper);
144 inline bool startsWith(
const string& s,
const string& start) {
145 if (s.length() < start.length())
return false;
146 return s.substr(0, start.length()) == start;
151 inline bool endsWith(
const string& s,
const string& end) {
152 if (s.length() < end.length())
return false;
153 return s.substr(s.length() - end.length()) == end;
158 inline string strcat() {
return ""; }
160 template<
typename T,
typename... Ts>
161 inline string strcat(T value, Ts... fargs) {
162 const string strthis = lexical_cast<string>(value);
163 const string strnext = strcat(fargs...);
164 return strnext.empty() ? strthis : strthis + strnext;
169 template <
typename T>
170 inline string join(
const vector<T>& v,
const string& sep=
" ") {
172 for (
size_t i = 0; i < v.size(); ++i) {
173 if (i != 0) rtn += sep;
181 inline string join(
const vector<string>& v,
const string& sep) {
183 for (
size_t i = 0; i < v.size(); ++i) {
184 if (i != 0) rtn += sep;
191 template <
typename T>
192 inline string join(
const set<T>& s,
const string& sep=
" ") {
194 for (
const T& x : s) {
195 if (rtn.size() > 0) rtn += sep;
203 inline string join(
const set<string>& s,
const string& sep) {
205 for (
const string & x : s) {
206 if (rtn.size() > 0) rtn += sep;
213 inline vector<string>
split(
const string& s,
const string& sep) {
217 const size_t delim_pos = tmp.find(sep);
218 if (delim_pos == string::npos)
break;
219 const string dir = tmp.substr(0, delim_pos);
220 if (dir.length()) dirs.push_back(dir);
221 tmp.replace(0, delim_pos+1,
"");
223 if (tmp.length()) dirs.push_back(tmp);
228 inline string lpad(
const string& s,
size_t width,
const string& padchar=
" ") {
229 if (s.size() >= width)
return s;
230 return string(width - s.size(), padchar[0]) + s;
234 inline string rpad(
const string& s,
size_t width,
const string& padchar=
" ") {
235 if (s.size() >= width)
return s;
236 return s + string(width - s.size(), padchar[0]);
250 return split(path,
":");
257 inline string pathjoin(
const vector<string>& paths) {
258 return join(paths,
":");
262 inline string operator / (
const string& a,
const string& b) {
264 const string anorm = (a.find(
"/") != string::npos) ? a.substr(0, a.find_last_not_of(
"/")+1) : a;
265 const string bnorm = (b.find(
"/") != string::npos) ? b.substr(b.find_first_not_of(
"/")) : b;
266 return anorm +
"/" + bnorm;
272 return p.substr(
p.rfind(
"/")+1);
278 return p.substr(0,
p.rfind(
"/"));
284 return f.substr(0, f.rfind(
"."));
290 return f.substr(f.rfind(
".")+1);
301 template <
typename CONTAINER>
302 inline unsigned int count(
const CONTAINER& c) {
304 unsigned int rtn = 0;
305 for (
const auto& x : c)
if (
bool(x)) rtn += 1;
316 template <
typename CONTAINER,
typename FN>
317 inline unsigned int count(
const CONTAINER& c,
const FN& f) {
318 return std::count_if(std::begin(c), std::end(c), f);
324 template <
typename CONTAINER>
325 inline bool any(
const CONTAINER& c) {
327 for (
const auto& x : c)
if (
bool(x))
return true;
338 template <
typename CONTAINER,
typename FN>
339 inline bool any(
const CONTAINER& c,
const FN& f) {
340 return std::any_of(std::begin(c), std::end(c), f);
346 template <
typename CONTAINER>
347 inline bool all(
const CONTAINER& c) {
349 for (
const auto& x : c)
if (!
bool(x))
return false;
360 template <
typename CONTAINER,
typename FN>
361 inline bool all(
const CONTAINER& c,
const FN& f) {
362 return std::all_of(std::begin(c), std::end(c), f);
368 template <
typename CONTAINER>
369 inline bool none(
const CONTAINER& c) {
371 for (
const auto& x : c)
if (
bool(x))
return false;
382 template <
typename CONTAINER,
typename FN>
383 inline bool none(
const CONTAINER& c,
const FN& f) {
384 return std::none_of(std::begin(c), std::end(c), f);
398 template <
typename CONTAINER1,
typename CONTAINER2,
typename FN>
399 inline const CONTAINER2& transform(
const CONTAINER1& in, CONTAINER2& out,
const FN& f) {
400 out.clear(); out.resize(in.size());
401 std::transform(in.begin(), in.end(), out.begin(), f);
407 template <
typename CONTAINER1,
typename T2>
408 inline std::vector<T2> transform(
const CONTAINER1& in,
const std::function<T2(
typename CONTAINER1::value_type)>& f) {
409 std::vector<T2> out(in.size());
410 transform(in, out, f);
424 template <
typename CONTAINER1,
typename T,
typename FN>
425 inline T
accumulate(
const CONTAINER1& in,
const T& init,
const FN& f) {
426 const T rtn = std::accumulate(in.begin(), in.end(), init, f);
435 template <
typename CONTAINER>
436 inline typename CONTAINER::value_type
sum(
const CONTAINER& c) {
437 typename CONTAINER::value_type rtn;
438 for (
const auto& x : c) rtn += x;
445 template <
typename CONTAINER,
typename T>
446 inline T
sum(
const CONTAINER& c,
const T& start) {
448 for (
const auto& x : c) rtn += x;
453 template <
typename CONTAINER,
typename FN,
typename T>
454 inline T
sum(
const CONTAINER& c,
const FN& f,
const T& start=T()) {
456 for (
const auto& x : c) rtn += f(x);
465 template <
typename CONTAINER,
typename T>
466 inline T&
isum(
const CONTAINER& c, T& out) {
467 for (
const auto& x : c) out += x;
474 template <
typename CONTAINER,
typename FN,
typename T>
475 inline T&
isum(
const CONTAINER& c,
const FN& f, T& out) {
476 for (
const auto& x : c) out += f(x);
487 template <
typename CONTAINER,
typename FN>
489 const auto newend = std::remove_if(std::begin(c), std::end(c), f);
490 c.erase(newend, c.end());
494 template <
typename CONTAINER,
typename FN>
495 inline CONTAINER&
idiscard(CONTAINER& c,
const FN& f) {
502 template <
typename CONTAINER>
503 inline CONTAINER&
ifilter_discard(CONTAINER& c,
const typename CONTAINER::value_type& y) {
504 return ifilter_discard(c, [&](
typename CONTAINER::value_type& x){
return x == y; });
507 template <
typename CONTAINER>
508 inline CONTAINER&
idiscard(CONTAINER& c,
const typename CONTAINER::value_type& y) {
509 return idiscard(c, [&](
typename CONTAINER::value_type& x){
return x == y; });
515 template <
typename CONTAINER>
520 template <
typename CONTAINER>
522 return idiscard(c, [&](
typename CONTAINER::value_type& x){
return contains(ys, x); });
531 template <
typename CONTAINER,
typename FN>
537 template <
typename CONTAINER,
typename FN>
538 inline CONTAINER
discard(
const CONTAINER& c,
const FN& f) {
545 template <
typename CONTAINER>
546 inline CONTAINER
filter_discard(
const CONTAINER& c,
const typename CONTAINER::value_type& y) {
547 return filter_discard(c, [&](
typename CONTAINER::value_type& x){
return x == y; });
550 template <
typename CONTAINER>
551 inline CONTAINER
discard(
const CONTAINER& c,
const typename CONTAINER::value_type& y) {
552 return discard(c, [&](
typename CONTAINER::value_type& x){
return x == y; });
558 template <
typename CONTAINER>
563 template <
typename CONTAINER>
565 return discard(c, [&](
typename CONTAINER::value_type& x){
return contains(ys, x); });
576 template <
typename CONTAINER,
typename FN>
577 inline CONTAINER&
filter_discard(
const CONTAINER& c,
const FN& f, CONTAINER& out) {
582 template <
typename CONTAINER,
typename FN>
583 inline CONTAINER&
discard(
const CONTAINER& c,
const FN& f, CONTAINER& out) {
590 template <
typename CONTAINER>
591 inline CONTAINER&
filter_discard(
const CONTAINER& c,
const typename CONTAINER::value_type& y, CONTAINER& out) {
592 return filter_discard(c, [&](
typename CONTAINER::value_type& x){
return x == y; }, out);
595 template <
typename CONTAINER>
596 inline CONTAINER&
discard(
const CONTAINER& c,
const typename CONTAINER::value_type& y, CONTAINER& out) {
597 return discard(c, [&](
typename CONTAINER::value_type& x){
return x == y; }, out);
603 template <
typename CONTAINER>
608 template <
typename CONTAINER>
609 inline CONTAINER&
discard_if_any(
const CONTAINER& c,
const CONTAINER& ys, CONTAINER& out) {
610 return discard(c, [&](
typename CONTAINER::value_type& x){
return contains(ys, x); }, out);
620 template <
typename CONTAINER,
typename FN>
623 auto invf = [&](
const typename CONTAINER::value_type& x){
return !f(x); };
627 template <
typename CONTAINER,
typename FN>
628 inline CONTAINER&
iselect(CONTAINER& c,
const FN& f) {
637 template <
typename CONTAINER>
642 template <
typename CONTAINER>
644 return iselect(c, [&](
typename CONTAINER::value_type& x){
return contains(ys, x); });
653 template <
typename CONTAINER,
typename FN>
659 template <
typename CONTAINER,
typename FN>
660 inline CONTAINER
select(
const CONTAINER& c,
const FN& f) {
669 template <
typename CONTAINER>
674 template <
typename CONTAINER>
676 return select(c, [&](
typename CONTAINER::value_type& x){
return contains(ys, x); });
687 template <
typename CONTAINER,
typename FN>
688 inline CONTAINER&
filter_select(
const CONTAINER& c,
const FN& f, CONTAINER& out) {
693 template <
typename CONTAINER,
typename FN>
694 inline CONTAINER&
select(
const CONTAINER& c,
const FN& f, CONTAINER& out) {
703 template <
typename CONTAINER>
708 template <
typename CONTAINER>
709 inline CONTAINER&
select_if_any(
const CONTAINER& c,
const CONTAINER& ys, CONTAINER& out) {
710 return select(c, [&](
typename CONTAINER::value_type& x){
return contains(ys, x); }, out);
719 template <
typename CONTAINER>
720 inline CONTAINER
slice(
const CONTAINER& c,
int i,
int j) {
722 const size_t off1 = (i >= 0) ? i : c.size() + i;
723 const size_t off2 = (j >= 0) ? j : c.size() + j;
724 if (off1 > c.size() || off2 > c.size())
throw RangeError(
"Attempting to slice beyond requested offsets");
725 if (off2 < off1)
throw RangeError(
"Requested offsets in invalid order");
726 rtn.resize(off2 - off1);
727 std::copy(c.begin()+off1, c.begin()+off2, rtn.begin());
734 template <
typename CONTAINER>
735 inline CONTAINER
slice(
const CONTAINER& c,
int i) {
736 return slice(c, i, c.size());
742 template <
typename CONTAINER>
743 inline CONTAINER
head(
const CONTAINER& c,
int n) {
745 if (n < 0) n = std::max(0, (
int)c.size()+n);
746 n = std::min(n, (
int)c.size());
747 return slice(c, 0, n);
753 template <
typename CONTAINER>
754 inline CONTAINER
tail(
const CONTAINER& c,
int n) {
756 if (n < 0) n = std::max(0, (
int)c.size()+n);
757 n = std::min(n, (
int)c.size());
758 return slice(c, c.size()-n);
766 inline double min(
const vector<double>& in,
double errval=
DBL_NAN) {
767 const auto e = std::min_element(in.begin(), in.end());
768 return e != in.end() ? *e : errval;
772 inline double max(
const vector<double>& in,
double errval=
DBL_NAN) {
773 const auto e = std::max_element(in.begin(), in.end());
774 return e != in.end() ? *e : errval;
778 inline pair<double,double>
minmax(
const vector<double>& in,
double errval=
DBL_NAN) {
779 const auto e = std::minmax_element(in.begin(), in.end());
780 const double rtnmin = e.first != in.end() ? *e.first : errval;
781 const double rtnmax = e.second != in.end() ? *e.first : errval;
782 return std::make_pair(rtnmin, rtnmax);
787 inline int min(
const vector<int>& in,
int errval=-1) {
788 const auto e = std::min_element(in.begin(), in.end());
789 return e != in.end() ? *e : errval;
793 inline int max(
const vector<int>& in,
int errval=-1) {
794 const auto e = std::max_element(in.begin(), in.end());
795 return e != in.end() ? *e : errval;
799 inline pair<int,int>
minmax(
const vector<int>& in,
int errval=-1) {
800 const auto e = std::minmax_element(in.begin(), in.end());
801 const double rtnmin = e.first != in.end() ? *e.first : errval;
802 const double rtnmax = e.second != in.end() ? *e.first : errval;
803 return std::make_pair(rtnmin, rtnmax);
814 template <
typename T>
816 char* env = getenv(name.c_str());
817 return env ? lexical_cast<T>(env) : fallback;
826 vector<T>
slice(
const vector<T>& v,
int startidx,
int endidx) {
828 if (startidx < 0 || endidx <= startidx || endidx >= v.size())
829 throw RangeError(
"Requested start or end indices incompatible with given vector");
831 auto start = v.begin() + startidx;
832 auto end = v.begin() + endidx;
834 vector<T> output(endidx - startidx);
836 copy(start, end, output.begin());
bool all(const CONTAINER &c)
Return true if x is true for all x in container c, otherwise false.
Definition Utils.hh:347
CONTAINER & idiscard_if_any(CONTAINER &c, const CONTAINER &ys)
Version with element-equality comparisons in place of a function.
Definition Utils.hh:521
CONTAINER filter_discard_if_any(const CONTAINER &c, const CONTAINER &ys)
Definition Utils.hh:559
T & isum(const CONTAINER &c, T &out)
Definition Utils.hh:466
pair< double, double > minmax(const vector< double > &in, double errval=DBL_NAN)
Find the minimum and maximum values in the vector.
Definition Utils.hh:778
CONTAINER select_if_any(const CONTAINER &c, const CONTAINER &ys)
Version with element-equality comparisons in place of a function.
Definition Utils.hh:675
CONTAINER filter_select_if_any(const CONTAINER &c, const CONTAINER &ys)
Definition Utils.hh:670
CONTAINER head(const CONTAINER &c, int n)
Head slice of the n first container elements.
Definition Utils.hh:743
CONTAINER discard_if_any(const CONTAINER &c, const CONTAINER &ys)
Version with element-equality comparisons in place of a function.
Definition Utils.hh:564
CONTAINER slice(const CONTAINER &c, int i, int j)
Slice of the container elements cf. Python's [i:j] syntax.
Definition Utils.hh:720
CONTAINER::value_type sum(const CONTAINER &c)
Generic sum function, adding x for all x in container c.
Definition Utils.hh:436
bool none(const CONTAINER &c)
Return true if x is false for all x in container c, otherwise false.
Definition Utils.hh:369
CONTAINER tail(const CONTAINER &c, int n)
Tail slice of the n last container elements.
Definition Utils.hh:754
CONTAINER & ifilter_discard_if_any(CONTAINER &c, const CONTAINER &ys)
Definition Utils.hh:516
unsigned int count(const CONTAINER &c)
Return number of true elements in the container c .
Definition Utils.hh:302
CONTAINER & ifilter_select_if_any(CONTAINER &c, const CONTAINER &ys)
Definition Utils.hh:638
T accumulate(const CONTAINER1 &in, const T &init, const FN &f)
A single-container-arg version of std::accumulate, aka reduce.
Definition Utils.hh:425
CONTAINER & iselect_if_any(CONTAINER &c, const CONTAINER &ys)
Version with element-equality comparisons in place of a function.
Definition Utils.hh:643
bool any(const CONTAINER &c)
Return true if x is true for any x in container c, otherwise false.
Definition Utils.hh:325
Jets & idiscard(Jets &jets, const Cut &c)
New alias for ifilter_discard.
Definition JetUtils.hh:184
Jets select(const Jets &jets, const Cut &c)
New alias for filter_select.
Definition JetUtils.hh:165
Jets & iselect(Jets &jets, const Cut &c)
New alias for ifilter_select.
Definition JetUtils.hh:153
Jets filter_discard(const Jets &jets, const Cut &c)
Filter a jet collection in-place to the subset that fails the supplied Cut.
Definition JetUtils.hh:188
Jets discard(const Jets &jets, const Cut &c)
New alias for filter_discard.
Definition JetUtils.hh:193
Jets filter_select(const Jets &jets, const Cut &c)
Filter a jet collection in-place to the subset that passes the supplied Cut.
Definition JetUtils.hh:157
Jets & ifilter_select(Jets &jets, const Cut &c)
Filter a jet collection in-place to the subset that passes the supplied Cut.
Jets & ifilter_discard(Jets &jets, const Cut &c)
Filter a jet collection in-place to the subset that fails the supplied Cut.
double p(const ParticleBase &p)
Unbound function access to p.
Definition ParticleBaseUtils.hh:684
string dirname(const string &p)
Get the dirname (i.e. path to the penultimate directory) from a path p.
Definition Utils.hh:276
string file_extn(const string &f)
Get the file extension from a filename f.
Definition Utils.hh:288
string pathjoin(const vector< string > &paths)
Join several filesystem paths together with the standard ':' delimiter.
Definition Utils.hh:257
vector< string > pathsplit(const string &path)
Split a path string with colon delimiters.
Definition Utils.hh:249
string basename(const string &p)
Get the basename (i.e. terminal file name) from a path p.
Definition Utils.hh:270
string file_stem(const string &f)
Get the stem (i.e. part without a file extension) from a filename f.
Definition Utils.hh:282
bool endsWith(const string &s, const string &end)
Check whether a string end is found at the end of s.
Definition Utils.hh:151
bool nocase_equals(const string &s1, const string &s2)
Case-insensitive string equality function.
Definition Utils.hh:122
bool startsWith(const string &s, const string &start)
Check whether a string start is found at the start of s.
Definition Utils.hh:144
string toUpper(const string &s)
Convert a string to upper-case.
Definition Utils.hh:136
string rpad(const string &s, size_t width, const string &padchar=" ")
Right-pad the given string s to width width.
Definition Utils.hh:234
string to_str(const T &x)
Convert any object to a string.
Definition Utils.hh:66
string lpad(const string &s, size_t width, const string &padchar=" ")
Left-pad the given string s to width width.
Definition Utils.hh:228
string toLower(const string &s)
Convert a string to lower-case.
Definition Utils.hh:128
T lexical_cast(const U &in)
Convert between any types via stringstream.
Definition Utils.hh:50
vector< string > split(const string &s, const string &sep)
Split a string on a specified separator string.
Definition Utils.hh:213
string & replace_all(string &str, const string &patt, const string &repl)
Replace all instances of patt with repl.
Definition Utils.hh:90
string join(const vector< T > &v, const string &sep=" ")
Make a string containing the string representations of each item in v, separated by sep.
Definition Utils.hh:170
string & replace_first(string &str, const string &patt, const string &repl)
Replace the first instance of patt with repl.
Definition Utils.hh:79
int nocase_cmp(const string &s1, const string &s2)
Case-insensitive string comparison function.
Definition Utils.hh:102
T getEnvParam(const std::string name, const T &fallback)
Get a parameter from a named environment variable, with automatic type conversion.
Definition Utils.hh:815
Definition MC_Cent_pPb.hh:10
std::enable_if< std::is_arithmetic< N1 >::value &&std::is_arithmetic< N2 >::value, typenamestd::common_type< N1, N2 >::type >::type max(N1 a, N2 b)
Get the maximum of two numbers.
Definition MathUtils.hh:111
std::enable_if< std::is_arithmetic< N1 >::value &&std::is_arithmetic< N2 >::value, typenamestd::common_type< N1, N2 >::type >::type min(N1 a, N2 b)
Get the minimum of two numbers.
Definition MathUtils.hh:102
static constexpr double DBL_NAN
Convenient const for getting the double NaN value.
Definition Utils.hh:37
bool contains(const std::string &s, const std::string &sub)
Does s contain sub as a substring?
Definition RivetSTL.hh:98
std::string toString(const AnalysisInfo &ai)
String representation.
Error for e.g. use of invalid bin ranges.
Definition Exceptions.hh:22
Exception class for throwing from lexical_cast when a parse goes wrong.
Definition Utils.hh:44