forked from bartvdbraak/blender
95 lines
2.7 KiB
C++
95 lines
2.7 KiB
C++
#ifndef __BLENDER_TESTING_H__
|
|
#define __BLENDER_TESTING_H__
|
|
|
|
#include "glog/logging.h"
|
|
#include "gflags/gflags.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
#define EXPECT_V3_NEAR(a, b, eps) \
|
|
{ \
|
|
EXPECT_NEAR(a[0], b[0], eps); \
|
|
EXPECT_NEAR(a[1], b[1], eps); \
|
|
EXPECT_NEAR(a[2], b[2], eps); \
|
|
} (void) 0
|
|
|
|
#define EXPECT_MATRIX_NEAR(a, b, tolerance) \
|
|
do { \
|
|
bool dims_match = (a.rows() == b.rows()) && (a.cols() == b.cols()); \
|
|
EXPECT_EQ(a.rows(), b.rows()) << "Matrix rows don't match."; \
|
|
EXPECT_EQ(a.cols(), b.cols()) << "Matrix cols don't match."; \
|
|
if (dims_match) { \
|
|
for (int r = 0; r < a.rows(); ++r) { \
|
|
for (int c = 0; c < a.cols(); ++c) { \
|
|
EXPECT_NEAR(a(r, c), b(r, c), tolerance) \
|
|
<< "r=" << r << ", c=" << c << "."; \
|
|
} \
|
|
} \
|
|
} \
|
|
} while(false);
|
|
|
|
#define EXPECT_MATRIX_NEAR_ZERO(a, tolerance) \
|
|
do { \
|
|
for (int r = 0; r < a.rows(); ++r) { \
|
|
for (int c = 0; c < a.cols(); ++c) { \
|
|
EXPECT_NEAR(0.0, a(r, c), tolerance) \
|
|
<< "r=" << r << ", c=" << c << "."; \
|
|
} \
|
|
} \
|
|
} while(false);
|
|
|
|
#define EXPECT_MATRIX_EQ(a, b) \
|
|
do { \
|
|
bool dims_match = (a.rows() == b.rows()) && (a.cols() == b.cols()); \
|
|
EXPECT_EQ(a.rows(), b.rows()) << "Matrix rows don't match."; \
|
|
EXPECT_EQ(a.cols(), b.cols()) << "Matrix cols don't match."; \
|
|
if (dims_match) { \
|
|
for (int r = 0; r < a.rows(); ++r) { \
|
|
for (int c = 0; c < a.cols(); ++c) { \
|
|
EXPECT_EQ(a(r, c), b(r, c)) \
|
|
<< "r=" << r << ", c=" << c << "."; \
|
|
} \
|
|
} \
|
|
} \
|
|
} while(false);
|
|
|
|
// Check that sin(angle(a, b)) < tolerance.
|
|
#define EXPECT_MATRIX_PROP(a, b, tolerance) \
|
|
do { \
|
|
bool dims_match = (a.rows() == b.rows()) && (a.cols() == b.cols()); \
|
|
EXPECT_EQ(a.rows(), b.rows()) << "Matrix rows don't match."; \
|
|
EXPECT_EQ(a.cols(), b.cols()) << "Matrix cols don't match."; \
|
|
if (dims_match) { \
|
|
double c = CosinusBetweenMatrices(a, b); \
|
|
if (c * c < 1) { \
|
|
double s = sqrt(1 - c * c); \
|
|
EXPECT_NEAR(0, s, tolerance); \
|
|
} \
|
|
} \
|
|
} while(false);
|
|
|
|
#ifdef LIBMV_NUMERIC_NUMERIC_H
|
|
template<class TMat>
|
|
double CosinusBetweenMatrices(const TMat &a, const TMat &b) {
|
|
return (a.array() * b.array()).sum() /
|
|
libmv::FrobeniusNorm(a) / libmv::FrobeniusNorm(b);
|
|
}
|
|
#endif
|
|
|
|
template <typename T>
|
|
inline void EXPECT_EQ_ARRAY(const T *expected, T *actual, const size_t N) {
|
|
for(size_t i = 0; i < N; ++i) {
|
|
EXPECT_EQ(expected[i], actual[i]);
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
inline void EXPECT_EQ_ARRAY_ND(const T *expected, T *actual, const size_t N, const size_t D) {
|
|
for(size_t i = 0; i < N; ++i) {
|
|
for(size_t j = 0; j < D; ++j) {
|
|
EXPECT_EQ(expected[i][j], actual[i][j]);
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif // __BLENDER_TESTING_H__
|