#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 "CondFormats/Serialization/interface/Serializable.h"
Go to the source code of this file.
◆ equal_mapping
#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) { \
first.cend(), \
second.cbegin(), \
[](decltype(*
first.cbegin())
a, decltype(*
first.cbegin())
b) ->
bool {
return equal(
a,
b); }); \
} \
};
bool equal(const T &first, const T &second)
U second(std::pair< T, U > const &p)
Definition at line 188 of file Equal.h.
◆ equal_pointer
#define equal_pointer |
( |
|
TYPE | ) |
|
Value:template <typename T> \
struct access<TYPE<T>> { \
};
bool equal(const T &first, const T &second)
U second(std::pair< T, U > const &p)
Definition at line 119 of file Equal.h.
◆ equal_sequence
#define equal_sequence |
( |
|
TYPE | ) |
|
Value:template <typename T> \
struct access<TYPE<T>> { \
static
bool equal_(
const TYPE<T>&
first,
const TYPE<T>&
second) { \
first.cend(), \
second.cbegin(), \
[](decltype(*
first.cbegin())
a, decltype(*
first.cbegin())
b) ->
bool {
return equal(
a,
b); }); \
} \
};
bool equal(const T &first, const T &second)
U second(std::pair< T, U > const &p)
Definition at line 149 of file Equal.h.
◆ equal_unorderedmapping
#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; \
\
auto first_it =
first.cbegin(); \
while (first_it !=
first.cend()) { \
auto second_it =
second.find(first_it->first); \
if (second_it ==
second.cend()) \
return false; \
if (not
equal(first_it->second, second_it->second)) \
return false; \
first_it++; \
} \
return true; \
} \
};
bool equal(const T &first, const T &second)
U second(std::pair< T, U > const &p)
Definition at line 203 of file Equal.h.