testing.h 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118
  1. #ifndef __BLENDER_TESTING_H__
  2. #define __BLENDER_TESTING_H__
  3. #include "glog/logging.h"
  4. #include "gflags/gflags.h"
  5. #include "gtest/gtest.h"
  6. #define EXPECT_V3_NEAR(a, b, eps) \
  7. { \
  8. EXPECT_NEAR(a[0], b[0], eps); \
  9. EXPECT_NEAR(a[1], b[1], eps); \
  10. EXPECT_NEAR(a[2], b[2], eps); \
  11. } (void) 0
  12. #define EXPECT_V4_NEAR(a, b, eps) \
  13. { \
  14. EXPECT_NEAR(a[0], b[0], eps); \
  15. EXPECT_NEAR(a[1], b[1], eps); \
  16. EXPECT_NEAR(a[2], b[2], eps); \
  17. EXPECT_NEAR(a[3], b[3], eps); \
  18. } (void) 0
  19. #define EXPECT_M3_NEAR(a, b, eps) \
  20. do { \
  21. EXPECT_V3_NEAR(a[0], b[0], eps); \
  22. EXPECT_V3_NEAR(a[1], b[1], eps); \
  23. EXPECT_V3_NEAR(a[2], b[2], eps); \
  24. } while(false);
  25. #define EXPECT_M4_NEAR(a, b, eps) \
  26. do { \
  27. EXPECT_V3_NEAR(a[0], b[0], eps); \
  28. EXPECT_V3_NEAR(a[1], b[1], eps); \
  29. EXPECT_V3_NEAR(a[2], b[2], eps); \
  30. EXPECT_V4_NEAR(a[3], b[3], eps); \
  31. } while(false);
  32. #define EXPECT_MATRIX_NEAR(a, b, tolerance) \
  33. do { \
  34. bool dims_match = (a.rows() == b.rows()) && (a.cols() == b.cols()); \
  35. EXPECT_EQ(a.rows(), b.rows()) << "Matrix rows don't match."; \
  36. EXPECT_EQ(a.cols(), b.cols()) << "Matrix cols don't match."; \
  37. if (dims_match) { \
  38. for (int r = 0; r < a.rows(); ++r) { \
  39. for (int c = 0; c < a.cols(); ++c) { \
  40. EXPECT_NEAR(a(r, c), b(r, c), tolerance) \
  41. << "r=" << r << ", c=" << c << "."; \
  42. } \
  43. } \
  44. } \
  45. } while(false);
  46. #define EXPECT_MATRIX_NEAR_ZERO(a, tolerance) \
  47. do { \
  48. for (int r = 0; r < a.rows(); ++r) { \
  49. for (int c = 0; c < a.cols(); ++c) { \
  50. EXPECT_NEAR(0.0, a(r, c), tolerance) \
  51. << "r=" << r << ", c=" << c << "."; \
  52. } \
  53. } \
  54. } while(false);
  55. #define EXPECT_MATRIX_EQ(a, b) \
  56. do { \
  57. bool dims_match = (a.rows() == b.rows()) && (a.cols() == b.cols()); \
  58. EXPECT_EQ(a.rows(), b.rows()) << "Matrix rows don't match."; \
  59. EXPECT_EQ(a.cols(), b.cols()) << "Matrix cols don't match."; \
  60. if (dims_match) { \
  61. for (int r = 0; r < a.rows(); ++r) { \
  62. for (int c = 0; c < a.cols(); ++c) { \
  63. EXPECT_EQ(a(r, c), b(r, c)) \
  64. << "r=" << r << ", c=" << c << "."; \
  65. } \
  66. } \
  67. } \
  68. } while(false);
  69. // Check that sin(angle(a, b)) < tolerance.
  70. #define EXPECT_MATRIX_PROP(a, b, tolerance) \
  71. do { \
  72. bool dims_match = (a.rows() == b.rows()) && (a.cols() == b.cols()); \
  73. EXPECT_EQ(a.rows(), b.rows()) << "Matrix rows don't match."; \
  74. EXPECT_EQ(a.cols(), b.cols()) << "Matrix cols don't match."; \
  75. if (dims_match) { \
  76. double c = CosinusBetweenMatrices(a, b); \
  77. if (c * c < 1) { \
  78. double s = sqrt(1 - c * c); \
  79. EXPECT_NEAR(0, s, tolerance); \
  80. } \
  81. } \
  82. } while(false);
  83. #ifdef LIBMV_NUMERIC_NUMERIC_H
  84. template<class TMat>
  85. double CosinusBetweenMatrices(const TMat &a, const TMat &b) {
  86. return (a.array() * b.array()).sum() /
  87. libmv::FrobeniusNorm(a) / libmv::FrobeniusNorm(b);
  88. }
  89. #endif
  90. template <typename T>
  91. inline void EXPECT_EQ_ARRAY(const T *expected, T *actual, const size_t N) {
  92. for(size_t i = 0; i < N; ++i) {
  93. EXPECT_EQ(expected[i], actual[i]);
  94. }
  95. }
  96. template <typename T>
  97. inline void EXPECT_EQ_ARRAY_ND(const T *expected, T *actual, const size_t N, const size_t D) {
  98. for(size_t i = 0; i < N; ++i) {
  99. for(size_t j = 0; j < D; ++j) {
  100. EXPECT_EQ(expected[i][j], actual[i][j]);
  101. }
  102. }
  103. }
  104. #endif // __BLENDER_TESTING_H__