devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Clang-format tests, examples, libraries, benchmarks, etc.

Browse Source
This commit is contained in:
Antonio Sánchez
2023-12-05 21:22:55 +00:00
committed by Rasmus Munk Larsen
parent 3252ecc7a4
commit 46e9cdb7fe
876 changed files with 33453 additions and 37795 deletions
Download Patch File Download Diff File Expand all files Collapse all files

83
test/stdlist_overload.cpp
View File

@@ -26,28 +26,25 @@ EIGEN_DEFINE_STL_LIST_SPECIALIZATION(Quaternionf)
EIGEN_DEFINE_STL_LIST_SPECIALIZATION(Quaterniond)
template <class Container, class Position>
typename Container::iterator get(Container & c, Position position)
{
typename Container::iterator get(Container& c, Position position) {
typename Container::iterator it = c.begin();
std::advance(it, position);
return it;
}
template <class Container, class Position, class Value>
void set(Container & c, Position position, const Value & value)
{
void set(Container& c, Position position, const Value& value) {
typename Container::iterator it = c.begin();
std::advance(it, position);
*it = value;
}
template<typename MatrixType>
void check_stdlist_matrix(const MatrixType& m)
{
template <typename MatrixType>
void check_stdlist_matrix(const MatrixType& m) {
Index rows = m.rows();
Index cols = m.cols();
MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
std::list<MatrixType> v(10, MatrixType::Zero(rows,cols)), w(20, y);
MatrixType x = MatrixType::Random(rows, cols), y = MatrixType::Random(rows, cols);
std::list<MatrixType> v(10, MatrixType::Zero(rows, cols)), w(20, y);
typename std::list<MatrixType>::iterator itv = get(v, 5);
typename std::list<MatrixType>::iterator itw = get(w, 6);
*itv = x;
@@ -56,8 +53,7 @@ void check_stdlist_matrix(const MatrixType& m)
v = w;
itv = v.begin();
itw = w.begin();
for(int i = 0; i < 20; i++)
{
for (int i = 0; i < 20; i++) {
VERIFY_IS_APPROX(*itw, *itv);
++itv;
++itw;
@@ -66,7 +62,7 @@ void check_stdlist_matrix(const MatrixType& m)
v.resize(21);
set(v, 20, x);
VERIFY_IS_APPROX(*get(v, 20), x);
v.resize(22,y);
v.resize(22, y);
VERIFY_IS_APPROX(*get(v, 21), y);
v.push_back(x);
VERIFY_IS_APPROX(*get(v, 22), x);
@@ -74,20 +70,17 @@ void check_stdlist_matrix(const MatrixType& m)
// do a lot of push_back such that the list gets internally resized
// (with memory reallocation)
MatrixType* ref = &(*get(w, 0));
for(int i=0; i<30 || ((ref==&(*get(w, 0))) && i<300); ++i)
v.push_back(*get(w, i%w.size()));
for(unsigned int i=23; i<v.size(); ++i)
{
VERIFY((*get(v, i))==(*get(w, (i-23)%w.size())));
for (int i = 0; i < 30 || ((ref == &(*get(w, 0))) && i < 300); ++i) v.push_back(*get(w, i % w.size()));
for (unsigned int i = 23; i < v.size(); ++i) {
VERIFY((*get(v, i)) == (*get(w, (i - 23) % w.size())));
}
}
template<typename TransformType>
void check_stdlist_transform(const TransformType&)
{
template <typename TransformType>
void check_stdlist_transform(const TransformType&) {
typedef typename TransformType::MatrixType MatrixType;
TransformType x(MatrixType::Random()), y(MatrixType::Random()), ti=TransformType::Identity();
std::list<TransformType> v(10,ti), w(20, y);
TransformType x(MatrixType::Random()), y(MatrixType::Random()), ti = TransformType::Identity();
std::list<TransformType> v(10, ti), w(20, y);
typename std::list<TransformType>::iterator itv = get(v, 5);
typename std::list<TransformType>::iterator itw = get(w, 6);
*itv = x;
@@ -96,8 +89,7 @@ void check_stdlist_transform(const TransformType&)
v = w;
itv = v.begin();
itw = w.begin();
for(int i = 0; i < 20; i++)
{
for (int i = 0; i < 20; i++) {
VERIFY_IS_APPROX(*itw, *itv);
++itv;
++itw;
@@ -106,7 +98,7 @@ void check_stdlist_transform(const TransformType&)
v.resize(21, ti);
set(v, 20, x);
VERIFY_IS_APPROX(*get(v, 20), x);
v.resize(22,y);
v.resize(22, y);
VERIFY_IS_APPROX(*get(v, 21), y);
v.push_back(x);
VERIFY_IS_APPROX(*get(v, 22), x);
@@ -114,20 +106,17 @@ void check_stdlist_transform(const TransformType&)
// do a lot of push_back such that the list gets internally resized
// (with memory reallocation)
TransformType* ref = &(*get(w, 0));
for(int i=0; i<30 || ((ref==&(*get(w, 0))) && i<300); ++i)
v.push_back(*get(w, i%w.size()));
for(unsigned int i=23; i<v.size(); ++i)
{
VERIFY(get(v, i)->matrix()==get(w, (i-23)%w.size())->matrix());
for (int i = 0; i < 30 || ((ref == &(*get(w, 0))) && i < 300); ++i) v.push_back(*get(w, i % w.size()));
for (unsigned int i = 23; i < v.size(); ++i) {
VERIFY(get(v, i)->matrix() == get(w, (i - 23) % w.size())->matrix());
}
}
template<typename QuaternionType>
void check_stdlist_quaternion(const QuaternionType&)
{
template <typename QuaternionType>
void check_stdlist_quaternion(const QuaternionType&) {
typedef typename QuaternionType::Coefficients Coefficients;
QuaternionType x(Coefficients::Random()), y(Coefficients::Random()), qi=QuaternionType::Identity();
std::list<QuaternionType> v(10,qi), w(20, y);
QuaternionType x(Coefficients::Random()), y(Coefficients::Random()), qi = QuaternionType::Identity();
std::list<QuaternionType> v(10, qi), w(20, y);
typename std::list<QuaternionType>::iterator itv = get(v, 5);
typename std::list<QuaternionType>::iterator itw = get(w, 6);
*itv = x;
@@ -136,17 +125,16 @@ void check_stdlist_quaternion(const QuaternionType&)
v = w;
itv = v.begin();
itw = w.begin();
for(int i = 0; i < 20; i++)
{
for (int i = 0; i < 20; i++) {
VERIFY_IS_APPROX(*itw, *itv);
++itv;
++itw;
}
v.resize(21,qi);
v.resize(21, qi);
set(v, 20, x);
VERIFY_IS_APPROX(*get(v, 20), x);
v.resize(22,y);
v.resize(22, y);
VERIFY_IS_APPROX(*get(v, 21), y);
v.push_back(x);
VERIFY_IS_APPROX(*get(v, 22), x);
@@ -154,16 +142,13 @@ void check_stdlist_quaternion(const QuaternionType&)
// do a lot of push_back such that the list gets internally resized
// (with memory reallocation)
QuaternionType* ref = &(*get(w, 0));
for(int i=0; i<30 || ((ref==&(*get(w, 0))) && i<300); ++i)
v.push_back(*get(w, i%w.size()));
for(unsigned int i=23; i<v.size(); ++i)
{
VERIFY(get(v, i)->coeffs()==get(w, (i-23)%w.size())->coeffs());
for (int i = 0; i < 30 || ((ref == &(*get(w, 0))) && i < 300); ++i) v.push_back(*get(w, i % w.size()));
for (unsigned int i = 23; i < v.size(); ++i) {
VERIFY(get(v, i)->coeffs() == get(w, (i - 23) % w.size())->coeffs());
}
}
EIGEN_DECLARE_TEST(stdlist_overload)
{
EIGEN_DECLARE_TEST(stdlist_overload) {
// some non vectorizable fixed sizes
CALL_SUBTEST_1(check_stdlist_matrix(Vector2f()));
CALL_SUBTEST_1(check_stdlist_matrix(Matrix3f()));
@@ -176,13 +161,13 @@ EIGEN_DECLARE_TEST(stdlist_overload)
CALL_SUBTEST_2(check_stdlist_matrix(Matrix4d()));
// some dynamic sizes
CALL_SUBTEST_3(check_stdlist_matrix(MatrixXd(1,1)));
CALL_SUBTEST_3(check_stdlist_matrix(MatrixXd(1, 1)));
CALL_SUBTEST_3(check_stdlist_matrix(VectorXd(20)));
CALL_SUBTEST_3(check_stdlist_matrix(RowVectorXf(20)));
CALL_SUBTEST_3(check_stdlist_matrix(MatrixXcf(10,10)));
CALL_SUBTEST_3(check_stdlist_matrix(MatrixXcf(10, 10)));
// some Transform
CALL_SUBTEST_4(check_stdlist_transform(Affine2f())); // does not need the specialization (2+1)^2 = 9
CALL_SUBTEST_4(check_stdlist_transform(Affine2f())); // does not need the specialization (2+1)^2 = 9
CALL_SUBTEST_4(check_stdlist_transform(Affine3f()));
CALL_SUBTEST_4(check_stdlist_transform(Affine3d()));