Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSergey Sharybin <sergey.vfx@gmail.com>2014-06-18 16:49:17 +0400
committerCampbell Barton <ideasman42@gmail.com>2014-06-18 20:09:16 +0400
commit306cbb82ecf0d7c1ba4fb0a1240175b1976bd25b (patch)
treee9eac65bf57126ac233f22fe88cc00df137ec4e5 /tests/gtests/testing/testing.h
parent47ec0394ca3d03e07c07a67e8f8d1625aedd39dd (diff)
GTest unit testing framework
Currently covers only small set of functionality.
Diffstat (limited to 'tests/gtests/testing/testing.h')
-rw-r--r--tests/gtests/testing/testing.h78
1 files changed, 78 insertions, 0 deletions
diff --git a/tests/gtests/testing/testing.h b/tests/gtests/testing/testing.h
new file mode 100644
index 00000000000..9083654f1d5
--- /dev/null
+++ b/tests/gtests/testing/testing.h
@@ -0,0 +1,78 @@
+#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
+
+#endif // __BLENDER_TESTING_H__