Merge branch 'master' into master
This commit is contained in:
commit
2ce0685f76
4
.clang-format
Normal file
4
.clang-format
Normal file
|
@ -0,0 +1,4 @@
|
||||||
|
# Run manually to reformat a file:
|
||||||
|
# clang-format -i --style=file <file>
|
||||||
|
Language: Cpp
|
||||||
|
BasedOnStyle: Google
|
|
@ -25,6 +25,7 @@ matrix:
|
||||||
compiler: gcc
|
compiler: gcc
|
||||||
install: ./ci/install-linux.sh && ./ci/log-config.sh
|
install: ./ci/install-linux.sh && ./ci/log-config.sh
|
||||||
script: ./ci/build-linux-autotools.sh
|
script: ./ci/build-linux-autotools.sh
|
||||||
|
env: VERBOSE=1 CXXFLAGS=-std=c++11
|
||||||
- os: linux
|
- os: linux
|
||||||
group: deprecated-2017Q4
|
group: deprecated-2017Q4
|
||||||
compiler: gcc
|
compiler: gcc
|
||||||
|
|
|
@ -78,7 +78,8 @@ itself is a valuable contribution.
|
||||||
|
|
||||||
To keep the source consistent, readable, diffable and easy to merge,
|
To keep the source consistent, readable, diffable and easy to merge,
|
||||||
we use a fairly rigid coding style, as defined by the [google-styleguide](https://github.com/google/styleguide) project. All patches will be expected
|
we use a fairly rigid coding style, as defined by the [google-styleguide](https://github.com/google/styleguide) project. All patches will be expected
|
||||||
to conform to the style outlined [here](https://google.github.io/styleguide/cppguide.html).
|
to conform to the style outlined [here](https://google.github.io/styleguide/cppguide.html).
|
||||||
|
Use [.clang-format](https://github.com/google/googletest/blob/master/.clang-format) to check your formatting
|
||||||
|
|
||||||
## Requirements for Contributors ###
|
## Requirements for Contributors ###
|
||||||
|
|
||||||
|
|
|
@ -107,7 +107,7 @@ package (as described below):
|
||||||
* GNU-compatible Make or gmake
|
* GNU-compatible Make or gmake
|
||||||
* POSIX-standard shell
|
* POSIX-standard shell
|
||||||
* POSIX(-2) Regular Expressions (regex.h)
|
* POSIX(-2) Regular Expressions (regex.h)
|
||||||
* A C++98-standard-compliant compiler
|
* A C++11-standard-compliant compiler
|
||||||
|
|
||||||
### Windows Requirements ###
|
### Windows Requirements ###
|
||||||
|
|
||||||
|
|
|
@ -20,10 +20,6 @@ environment:
|
||||||
- compiler: msvc-14-seh
|
- compiler: msvc-14-seh
|
||||||
generator: "Visual Studio 14 2015 Win64"
|
generator: "Visual Studio 14 2015 Win64"
|
||||||
|
|
||||||
- compiler: gcc-5.3.0-posix
|
|
||||||
generator: "MinGW Makefiles"
|
|
||||||
cxx_path: 'C:\mingw-w64\i686-5.3.0-posix-dwarf-rt_v4-rev0\mingw32\bin'
|
|
||||||
|
|
||||||
- compiler: gcc-6.3.0-posix
|
- compiler: gcc-6.3.0-posix
|
||||||
generator: "MinGW Makefiles"
|
generator: "MinGW Makefiles"
|
||||||
cxx_path: 'C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin'
|
cxx_path: 'C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin'
|
||||||
|
@ -39,6 +35,7 @@ install:
|
||||||
Write-Output "Compiler: $env:compiler"
|
Write-Output "Compiler: $env:compiler"
|
||||||
Write-Output "Generator: $env:generator"
|
Write-Output "Generator: $env:generator"
|
||||||
Write-Output "Env:Configuation: $env:configuration"
|
Write-Output "Env:Configuation: $env:configuration"
|
||||||
|
Write-Output "Env: $env"
|
||||||
if (-not (Test-Path env:APPVEYOR_PULL_REQUEST_NUMBER)) {
|
if (-not (Test-Path env:APPVEYOR_PULL_REQUEST_NUMBER)) {
|
||||||
Write-Output "This is *NOT* a pull request build"
|
Write-Output "This is *NOT* a pull request build"
|
||||||
} else {
|
} else {
|
||||||
|
|
|
@ -553,452 +553,6 @@ Args(const InnerMatcher& matcher) {
|
||||||
k9, k10>(matcher);
|
k9, k10>(matcher);
|
||||||
}
|
}
|
||||||
|
|
||||||
// ElementsAre(e_1, e_2, ... e_n) matches an STL-style container with
|
|
||||||
// n elements, where the i-th element in the container must
|
|
||||||
// match the i-th argument in the list. Each argument of
|
|
||||||
// ElementsAre() can be either a value or a matcher. We support up to
|
|
||||||
// 10 arguments.
|
|
||||||
//
|
|
||||||
// The use of DecayArray in the implementation allows ElementsAre()
|
|
||||||
// to accept string literals, whose type is const char[N], but we
|
|
||||||
// want to treat them as const char*.
|
|
||||||
//
|
|
||||||
// NOTE: Since ElementsAre() cares about the order of the elements, it
|
|
||||||
// must not be used with containers whose elements's order is
|
|
||||||
// undefined (e.g. hash_map).
|
|
||||||
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<> >
|
|
||||||
ElementsAre() {
|
|
||||||
typedef ::testing::tuple<> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args());
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type> >
|
|
||||||
ElementsAre(const T1& e1) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2, const T3& e3) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2, e3));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2, e3, e4));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5, e6));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6, typename T7>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6, const T7& e7) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5, e6, e7));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6, typename T7, typename T8>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6, const T7& e7, const T8& e8) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5, e6, e7,
|
|
||||||
e8));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6, typename T7, typename T8, typename T9>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type,
|
|
||||||
typename internal::DecayArray<T9>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type,
|
|
||||||
typename internal::DecayArray<T9>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5, e6, e7,
|
|
||||||
e8, e9));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6, typename T7, typename T8, typename T9, typename T10>
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type,
|
|
||||||
typename internal::DecayArray<T9>::type,
|
|
||||||
typename internal::DecayArray<T10>::type> >
|
|
||||||
ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9,
|
|
||||||
const T10& e10) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type,
|
|
||||||
typename internal::DecayArray<T9>::type,
|
|
||||||
typename internal::DecayArray<T10>::type> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5, e6, e7,
|
|
||||||
e8, e9, e10));
|
|
||||||
}
|
|
||||||
|
|
||||||
// UnorderedElementsAre(e_1, e_2, ..., e_n) is an ElementsAre extension
|
|
||||||
// that matches n elements in any order. We support up to n=10 arguments.
|
|
||||||
//
|
|
||||||
// If you have >10 elements, consider UnorderedElementsAreArray() or
|
|
||||||
// UnorderedPointwise() instead.
|
|
||||||
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<> >
|
|
||||||
UnorderedElementsAre() {
|
|
||||||
typedef ::testing::tuple<> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args());
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2, const T3& e3) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2, e3));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2, e3, e4));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5,
|
|
||||||
e6));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6, typename T7>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6, const T7& e7) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5,
|
|
||||||
e6, e7));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6, typename T7, typename T8>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6, const T7& e7, const T8& e8) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5,
|
|
||||||
e6, e7, e8));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6, typename T7, typename T8, typename T9>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type,
|
|
||||||
typename internal::DecayArray<T9>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type,
|
|
||||||
typename internal::DecayArray<T9>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5,
|
|
||||||
e6, e7, e8, e9));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
||||||
typename T6, typename T7, typename T8, typename T9, typename T10>
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type,
|
|
||||||
typename internal::DecayArray<T9>::type,
|
|
||||||
typename internal::DecayArray<T10>::type> >
|
|
||||||
UnorderedElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
||||||
const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9,
|
|
||||||
const T10& e10) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
typename internal::DecayArray<T1>::type,
|
|
||||||
typename internal::DecayArray<T2>::type,
|
|
||||||
typename internal::DecayArray<T3>::type,
|
|
||||||
typename internal::DecayArray<T4>::type,
|
|
||||||
typename internal::DecayArray<T5>::type,
|
|
||||||
typename internal::DecayArray<T6>::type,
|
|
||||||
typename internal::DecayArray<T7>::type,
|
|
||||||
typename internal::DecayArray<T8>::type,
|
|
||||||
typename internal::DecayArray<T9>::type,
|
|
||||||
typename internal::DecayArray<T10>::type> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args(e1, e2, e3, e4, e5,
|
|
||||||
e6, e7, e8, e9, e10));
|
|
||||||
}
|
|
||||||
|
|
||||||
// AllOf(m1, m2, ..., mk) matches any value that matches all of the given
|
// AllOf(m1, m2, ..., mk) matches any value that matches all of the given
|
||||||
// sub-matchers. AllOf is called fully qualified to prevent ADL from firing.
|
// sub-matchers. AllOf is called fully qualified to prevent ADL from firing.
|
||||||
|
|
||||||
|
|
|
@ -263,75 +263,6 @@ Args(const InnerMatcher& matcher) {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
// ElementsAre(e_1, e_2, ... e_n) matches an STL-style container with
|
|
||||||
// n elements, where the i-th element in the container must
|
|
||||||
// match the i-th argument in the list. Each argument of
|
|
||||||
// ElementsAre() can be either a value or a matcher. We support up to
|
|
||||||
// $n arguments.
|
|
||||||
//
|
|
||||||
// The use of DecayArray in the implementation allows ElementsAre()
|
|
||||||
// to accept string literals, whose type is const char[N], but we
|
|
||||||
// want to treat them as const char*.
|
|
||||||
//
|
|
||||||
// NOTE: Since ElementsAre() cares about the order of the elements, it
|
|
||||||
// must not be used with containers whose elements's order is
|
|
||||||
// undefined (e.g. hash_map).
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
$if i>0 [[
|
|
||||||
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
]]
|
|
||||||
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
typename internal::DecayArray<T$j[[]]>::type]]> >
|
|
||||||
ElementsAre($for j, [[const T$j& e$j]]) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
typename internal::DecayArray<T$j[[]]>::type]]> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args($for j, [[e$j]]));
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// UnorderedElementsAre(e_1, e_2, ..., e_n) is an ElementsAre extension
|
|
||||||
// that matches n elements in any order. We support up to n=$n arguments.
|
|
||||||
//
|
|
||||||
// If you have >$n elements, consider UnorderedElementsAreArray() or
|
|
||||||
// UnorderedPointwise() instead.
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
$if i>0 [[
|
|
||||||
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
]]
|
|
||||||
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
typename internal::DecayArray<T$j[[]]>::type]]> >
|
|
||||||
UnorderedElementsAre($for j, [[const T$j& e$j]]) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
typename internal::DecayArray<T$j[[]]>::type]]> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args($for j, [[e$j]]));
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
]]
|
||||||
|
|
||||||
// AllOf(m1, m2, ..., mk) matches any value that matches all of the given
|
// AllOf(m1, m2, ..., mk) matches any value that matches all of the given
|
||||||
|
|
|
@ -5170,23 +5170,6 @@ std::string DescribeMatcher(const M& matcher, bool negation = false) {
|
||||||
return ss.str();
|
return ss.str();
|
||||||
}
|
}
|
||||||
|
|
||||||
#if GTEST_LANG_CXX11
|
|
||||||
// Define variadic matcher versions. They are overloaded in
|
|
||||||
// gmock-generated-matchers.h for the cases supported by pre C++11 compilers.
|
|
||||||
template <typename... Args>
|
|
||||||
internal::AllOfMatcher<typename std::decay<const Args&>::type...> AllOf(
|
|
||||||
const Args&... matchers) {
|
|
||||||
return internal::AllOfMatcher<typename std::decay<const Args&>::type...>(
|
|
||||||
matchers...);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename... Args>
|
|
||||||
internal::AnyOfMatcher<typename std::decay<const Args&>::type...> AnyOf(
|
|
||||||
const Args&... matchers) {
|
|
||||||
return internal::AnyOfMatcher<typename std::decay<const Args&>::type...>(
|
|
||||||
matchers...);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename... Args>
|
template <typename... Args>
|
||||||
internal::ElementsAreMatcher<tuple<typename std::decay<const Args&>::type...>>
|
internal::ElementsAreMatcher<tuple<typename std::decay<const Args&>::type...>>
|
||||||
ElementsAre(const Args&... matchers) {
|
ElementsAre(const Args&... matchers) {
|
||||||
|
@ -5204,6 +5187,23 @@ UnorderedElementsAre(const Args&... matchers) {
|
||||||
make_tuple(matchers...));
|
make_tuple(matchers...));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#if GTEST_LANG_CXX11
|
||||||
|
// Define variadic matcher versions. They are overloaded in
|
||||||
|
// gmock-generated-matchers.h for the cases supported by pre C++11 compilers.
|
||||||
|
template <typename... Args>
|
||||||
|
internal::AllOfMatcher<typename std::decay<const Args&>::type...> AllOf(
|
||||||
|
const Args&... matchers) {
|
||||||
|
return internal::AllOfMatcher<typename std::decay<const Args&>::type...>(
|
||||||
|
matchers...);
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename... Args>
|
||||||
|
internal::AnyOfMatcher<typename std::decay<const Args&>::type...> AnyOf(
|
||||||
|
const Args&... matchers) {
|
||||||
|
return internal::AnyOfMatcher<typename std::decay<const Args&>::type...>(
|
||||||
|
matchers...);
|
||||||
|
}
|
||||||
|
|
||||||
#endif // GTEST_LANG_CXX11
|
#endif // GTEST_LANG_CXX11
|
||||||
|
|
||||||
// AllArgs(m) is a synonym of m. This is useful in
|
// AllArgs(m) is a synonym of m. This is useful in
|
||||||
|
|
|
@ -7,8 +7,8 @@
|
||||||
// https://github.com/google/google-toolbox-for-mac
|
// https://github.com/google/google-toolbox-for-mac
|
||||||
//
|
//
|
||||||
|
|
||||||
// Build for PPC and Intel, 32- and 64-bit
|
// Build for PPC and Intel 64-bit
|
||||||
ARCHS = i386 x86_64 ppc ppc64
|
ARCHS = x86_64 ppc ppc64
|
||||||
|
|
||||||
// Zerolink prevents link warnings so turn it off
|
// Zerolink prevents link warnings so turn it off
|
||||||
ZERO_LINK = NO
|
ZERO_LINK = NO
|
||||||
|
|
Loading…
Reference in New Issue
Block a user