mirror of
https://github.com/PaddlePaddle/FastDeploy.git
synced 2025-10-06 17:17:14 +08:00
Move eigen to third party (#282)
* remove useless statement * Add eigen to third_party dir * remove reducdant lines
This commit is contained in:
159
third_party/eigen/test/stdvector.cpp
vendored
Normal file
159
third_party/eigen/test/stdvector.cpp
vendored
Normal file
@@ -0,0 +1,159 @@
|
||||
// This file is part of Eigen, a lightweight C++ template library
|
||||
// for linear algebra.
|
||||
//
|
||||
// Copyright (C) 2008 Benoit Jacob <jacob.benoit.1@gmail.com>
|
||||
//
|
||||
// This Source Code Form is subject to the terms of the Mozilla
|
||||
// Public License v. 2.0. If a copy of the MPL was not distributed
|
||||
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
||||
|
||||
#include <Eigen/Geometry>
|
||||
#include <Eigen/StdVector>
|
||||
#include "main.h"
|
||||
|
||||
template <typename MatrixType>
|
||||
void check_stdvector_matrix(const MatrixType& m) {
|
||||
Index rows = m.rows();
|
||||
Index cols = m.cols();
|
||||
MatrixType x = MatrixType::Random(rows, cols),
|
||||
y = MatrixType::Random(rows, cols);
|
||||
std::vector<MatrixType, Eigen::aligned_allocator<MatrixType> > v(
|
||||
10, MatrixType::Zero(rows, cols)),
|
||||
w(20, y);
|
||||
v[5] = x;
|
||||
w[6] = v[5];
|
||||
VERIFY_IS_APPROX(w[6], v[5]);
|
||||
v = w;
|
||||
for (int i = 0; i < 20; i++) {
|
||||
VERIFY_IS_APPROX(w[i], v[i]);
|
||||
}
|
||||
|
||||
v.resize(21);
|
||||
v[20] = x;
|
||||
VERIFY_IS_APPROX(v[20], x);
|
||||
v.resize(22, y);
|
||||
VERIFY_IS_APPROX(v[21], y);
|
||||
v.push_back(x);
|
||||
VERIFY_IS_APPROX(v[22], x);
|
||||
VERIFY((internal::UIntPtr) & (v[22]) == (internal::UIntPtr) &
|
||||
(v[21]) + sizeof(MatrixType));
|
||||
|
||||
// do a lot of push_back such that the vector gets internally resized
|
||||
// (with memory reallocation)
|
||||
MatrixType* ref = &w[0];
|
||||
for (int i = 0; i < 30 || ((ref == &w[0]) && i < 300); ++i)
|
||||
v.push_back(w[i % w.size()]);
|
||||
for (unsigned int i = 23; i < v.size(); ++i) {
|
||||
VERIFY(v[i] == w[(i - 23) % w.size()]);
|
||||
}
|
||||
}
|
||||
|
||||
template <typename TransformType>
|
||||
void check_stdvector_transform(const TransformType&) {
|
||||
typedef typename TransformType::MatrixType MatrixType;
|
||||
TransformType x(MatrixType::Random()), y(MatrixType::Random());
|
||||
std::vector<TransformType, Eigen::aligned_allocator<TransformType> > v(10),
|
||||
w(20, y);
|
||||
v[5] = x;
|
||||
w[6] = v[5];
|
||||
VERIFY_IS_APPROX(w[6], v[5]);
|
||||
v = w;
|
||||
for (int i = 0; i < 20; i++) {
|
||||
VERIFY_IS_APPROX(w[i], v[i]);
|
||||
}
|
||||
|
||||
v.resize(21);
|
||||
v[20] = x;
|
||||
VERIFY_IS_APPROX(v[20], x);
|
||||
v.resize(22, y);
|
||||
VERIFY_IS_APPROX(v[21], y);
|
||||
v.push_back(x);
|
||||
VERIFY_IS_APPROX(v[22], x);
|
||||
VERIFY((internal::UIntPtr) & (v[22]) == (internal::UIntPtr) &
|
||||
(v[21]) + sizeof(TransformType));
|
||||
|
||||
// do a lot of push_back such that the vector gets internally resized
|
||||
// (with memory reallocation)
|
||||
TransformType* ref = &w[0];
|
||||
for (int i = 0; i < 30 || ((ref == &w[0]) && i < 300); ++i)
|
||||
v.push_back(w[i % w.size()]);
|
||||
for (unsigned int i = 23; i < v.size(); ++i) {
|
||||
VERIFY(v[i].matrix() == w[(i - 23) % w.size()].matrix());
|
||||
}
|
||||
}
|
||||
|
||||
template <typename QuaternionType>
|
||||
void check_stdvector_quaternion(const QuaternionType&) {
|
||||
typedef typename QuaternionType::Coefficients Coefficients;
|
||||
QuaternionType x(Coefficients::Random()), y(Coefficients::Random()),
|
||||
qi = QuaternionType::Identity();
|
||||
std::vector<QuaternionType, Eigen::aligned_allocator<QuaternionType> > v(10,
|
||||
qi),
|
||||
w(20, y);
|
||||
v[5] = x;
|
||||
w[6] = v[5];
|
||||
VERIFY_IS_APPROX(w[6], v[5]);
|
||||
v = w;
|
||||
for (int i = 0; i < 20; i++) {
|
||||
VERIFY_IS_APPROX(w[i], v[i]);
|
||||
}
|
||||
|
||||
v.resize(21);
|
||||
v[20] = x;
|
||||
VERIFY_IS_APPROX(v[20], x);
|
||||
v.resize(22, y);
|
||||
VERIFY_IS_APPROX(v[21], y);
|
||||
v.push_back(x);
|
||||
VERIFY_IS_APPROX(v[22], x);
|
||||
VERIFY((internal::UIntPtr) & (v[22]) == (internal::UIntPtr) &
|
||||
(v[21]) + sizeof(QuaternionType));
|
||||
|
||||
// do a lot of push_back such that the vector gets internally resized
|
||||
// (with memory reallocation)
|
||||
QuaternionType* ref = &w[0];
|
||||
for (int i = 0; i < 30 || ((ref == &w[0]) && i < 300); ++i)
|
||||
v.push_back(w[i % w.size()]);
|
||||
for (unsigned int i = 23; i < v.size(); ++i) {
|
||||
VERIFY(v[i].coeffs() == w[(i - 23) % w.size()].coeffs());
|
||||
}
|
||||
}
|
||||
|
||||
// the code below triggered an invalid warning with gcc >= 7
|
||||
// eigen/Eigen/src/Core/util/Memory.h:189:12: warning: argument 1 value
|
||||
// '18446744073709551612' exceeds maximum object size 9223372036854775807
|
||||
// This has been reported to gcc there:
|
||||
// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=87544
|
||||
void std_vector_gcc_warning() {
|
||||
typedef Eigen::Vector3f T;
|
||||
std::vector<T, Eigen::aligned_allocator<T> > v;
|
||||
v.push_back(T());
|
||||
}
|
||||
|
||||
EIGEN_DECLARE_TEST(stdvector) {
|
||||
// some non vectorizable fixed sizes
|
||||
CALL_SUBTEST_1(check_stdvector_matrix(Vector2f()));
|
||||
CALL_SUBTEST_1(check_stdvector_matrix(Matrix3f()));
|
||||
CALL_SUBTEST_2(check_stdvector_matrix(Matrix3d()));
|
||||
|
||||
// some vectorizable fixed sizes
|
||||
CALL_SUBTEST_1(check_stdvector_matrix(Matrix2f()));
|
||||
CALL_SUBTEST_1(check_stdvector_matrix(Vector4f()));
|
||||
CALL_SUBTEST_1(check_stdvector_matrix(Matrix4f()));
|
||||
CALL_SUBTEST_2(check_stdvector_matrix(Matrix4d()));
|
||||
|
||||
// some dynamic sizes
|
||||
CALL_SUBTEST_3(check_stdvector_matrix(MatrixXd(1, 1)));
|
||||
CALL_SUBTEST_3(check_stdvector_matrix(VectorXd(20)));
|
||||
CALL_SUBTEST_3(check_stdvector_matrix(RowVectorXf(20)));
|
||||
CALL_SUBTEST_3(check_stdvector_matrix(MatrixXcf(10, 10)));
|
||||
|
||||
// some Transform
|
||||
CALL_SUBTEST_4(check_stdvector_transform(Projective2f()));
|
||||
CALL_SUBTEST_4(check_stdvector_transform(Projective3f()));
|
||||
CALL_SUBTEST_4(check_stdvector_transform(Projective3d()));
|
||||
// CALL_SUBTEST(heck_stdvector_transform(Projective4d()));
|
||||
|
||||
// some Quaternion
|
||||
CALL_SUBTEST_5(check_stdvector_quaternion(Quaternionf()));
|
||||
CALL_SUBTEST_5(check_stdvector_quaternion(Quaterniond()));
|
||||
}
|
Reference in New Issue
Block a user