Go to the source code of this file.
◆ CHECK_BRANCHES [1/2]
#define CHECK_BRANCHES |
( |
|
branchname_vector | ) |
|
◆ CHECK_BRANCHES [2/2]
#define CHECK_BRANCHES |
( |
|
branchname_vector | ) |
|
Value:for (
unsigned int i = 0;
i < branchname_vector.size();
i++) { \
if (branch_f.find(branchname_vector[
i]) == branch_f.end()) {
\ std::cout << __FILE__ <<
":" << __LINE__ <<
":Error: The branch " << branchname_vector[
i] \
<< " is not recognised." << std::endl; \
return; \
} \
}
◆ CHECK_MAP_CONTENT
#define CHECK_MAP_CONTENT |
( |
|
m, |
|
|
|
type |
|
) |
| |
◆ COLOR_CODE
#define COLOR_CODE |
( |
|
icolor | ) |
int(icolor / 4) + icolor + 1 |
◆ INDEX_IN_GLOBAL_CANVAS
#define INDEX_IN_GLOBAL_CANVAS |
( |
|
i1, |
|
|
|
i2 |
|
) |
| 1 + i1 + i2 *x.size() |
◆ INSIDE_VECTOR
#define INSIDE_VECTOR |
( |
|
vector | ) |
|
◆ LIMITS [1/2]
#define LIMITS |
( |
|
axes_vector | ) |
|
Value:for (
unsigned int i = 0;
i < axes_vector.size();
i++) { \
if (_SF.find(axes_vector[
i]) == _SF.end()) \
_SF[axes_vector[
i]] = 1.; \
if (_min.find(axes_vector[
i]) == _min.end()) \
_min[axes_vector[
i]] = _SF[axes_vector[
i]] *
data->GetMinimum(axes_vector[
i]); \
if (_max.find(axes_vector[
i]) == _max.end()) \
_max[axes_vector[
i]] = _SF[axes_vector[
i]] *
data->GetMaximum(axes_vector[
i]); \
}
char data[epos_bytes_allocation]
Referenced by GeometryComparisonPlotter::MakePlots(), and GeometryComparisonPlotter::MakeTables().
◆ LIMITS [2/2]
#define LIMITS |
( |
|
axes_vector | ) |
|
Value:for (
unsigned int i = 0;
i < axes_vector.size();
i++) { \
if (_SF.find(axes_vector[
i]) == _SF.end()) \
_SF[axes_vector[
i]] = 1.; \
if (_min.find(axes_vector[
i]) == _min.end()) \
_min[axes_vector[
i]] = _SF[axes_vector[
i]] *
data->GetMinimum(axes_vector[
i]); \
if (_max.find(axes_vector[
i]) == _max.end()) \
_max[axes_vector[
i]] = _SF[axes_vector[
i]] *
data->GetMaximum(axes_vector[
i]); \
}
char data[epos_bytes_allocation]
◆ NB_MODULE_QUALITY
#define NB_MODULE_QUALITY 3 |
◆ NB_X_SLICES
◆ NB_Z_SLICES [1/2]
◆ NB_Z_SLICES [2/2]