#include <typeinfo>
#include <type_traits>
#include <algorithm>
#include <string>
#include <bitset>
#include <utility>
#include <tuple>
#include <memory>
#include <array>
#include <vector>
#include <deque>
#include <forward_list>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cstddef>
#include <cmath>
#include <boost/shared_ptr.hpp>
#include "CondFormats/Serialization/interface/Serializable.h"
Go to the source code of this file.
#define equal_mapping |
( |
|
TYPE | ) |
|
Value:template <typename T, typename U> \
struct access<TYPE<T, U>> \
{ \
static
bool equal_(
const TYPE<T, U> &
first,
const TYPE<T, U> &
second) \
[](decltype(*
first.cbegin())
a, decltype(
a)
b) ->
bool {
\
} \
); \
} \
};
bool equal(const T &first, const T &second)
U second(std::pair< T, U > const &p)
Definition at line 230 of file Equal.h.
#define equal_pointer |
( |
|
TYPE | ) |
|
Value:template <typename T> \
struct access<TYPE<T>> \
{ \
static
bool equal_(
const TYPE<T> &
first,
const TYPE<T> &
second) \
} \
};
bool equal(const T &first, const T &second)
U second(std::pair< T, U > const &p)
Definition at line 148 of file Equal.h.
#define equal_sequence |
( |
|
TYPE | ) |
|
Value:template <typename T> \
struct access<TYPE<T>> \
{ \
static
bool equal_(
const TYPE<T> &
first,
const TYPE<T> &
second) \
[](decltype(*
first.cbegin())
a, decltype(
a)
b) ->
bool {
\
} \
); \
} \
};
bool equal(const T &first, const T &second)
U second(std::pair< T, U > const &p)
Definition at line 187 of file Equal.h.
#define equal_unorderedmapping |
( |
|
TYPE | ) |
|
Value:template <typename T, typename U> \
struct access<TYPE<T, U>> \
{ \
static
bool equal_(
const TYPE<T, U> &
first,
const TYPE<T, U> &
second) \
return false; \
while (first_it !=
first.cend()) {
\
if (not
equal(first_it->second, second_it->second))
\
first_it++; \
} \
};
bool equal(const T &first, const T &second)
U second(std::pair< T, U > const &p)
if(conf.exists("allCellsPositionCalc"))
Definition at line 247 of file Equal.h.