简体   繁体   中英

Elegant way for element operation with for-loops on Eigen3 matrix, using modern C++

I want to do some operation with elements in a matrix, depending on the position of each element.

I know that by-default, Eigen matrix is column-major, so to loop over the matrix, the outer for-loop is for each column, and the inner for-loop is for each row. I have 4 kinds of expressions to be assigned to m(r,c) , depending on the values of r and c . Some pseudo-code is shown below:

if c == some_c
    if r == some_r
        m(r,c) = some expression A
    else
        m(r,c) = some expression B
else
    if r == some_r
        m(r,c) = some expression C
    else
        m(r,c) = some expression D 

I have also made detailed c++ codes below. I am not C++ expert, so I am not sure whether my code is elegant or not. Could you please let me know how to improve it? I would prefer using possible modern C++14 or C++17 features.

#include <Eigen/Dense>

using Matrix = Eigen::MatrixXd

void some_operation_on_matrix(Matrix& m, size_t some_r, size_t some_c)
{
    for (size_t c = 0; c < m.cols(); c++) {
        for (size_t r = 0; r < m.rows(); r++) {
            if (c == some_c) {
                if (r == some_r) {
                    // m(r,c) = some expression A
                }
                else {
                    // m(r,c) = some expression B
                }
            }
            else {
                if (r == some_r) {
                    // m(r,c) = some expression C
                }
                else {
                    // m(r,c) = some expression D
                }
            }
        }
    }
}

Here is a solution using a lambda functor:

void some_operation_on_matrix(Eigen::MatrixXd& out, int some_r, int some_c)
{
  out = Eigen::MatrixXd::NullaryExpr(out.rows(), out.cols(),
    [&](Eigen::Index r, Eigen::Index c)
    {
        if(c == some_c)
            if(r == some_r)
                return 1.0; // some expr A
            else
                return 2.0; // some expr B
        else
            if(r == some_r)
                return 3.0; // some expr C
            else
                return 4.0; // some expr D 
     });
}

Probably more efficient (if all expressions are constant) would be

out.setConstant(D);
out.row(some_r).setConstant(C);
out.col(some_c).setConstant(B);
out(some_r, some_c) = A;

I would change the logic of your loop a bit

void some_operation_on_matrix(Matrix& m, size_t some_r, size_t some_c)
{
    for (size_t c = 0; c < m.cols(); c++) {
        if (c == some_c) {
            for (size_t r = 0; r < m.rows(); r++) {
                if (r == some_r) {
                    // m(r,c) = some expression A
                }
                else {
                    // m(r,c) = some expression B
                }
            }
        else {
            for (size_t r = 0; r < m.rows(); r++) {
                if (r == some_r) {
                    // m(r,c) = some expression C
                }
                else {
                    // m(r,c) = some expression D
                }
            }
        }
    }
}

Thus, the if statement if (c == some_c) has only to be evaluated for all m.cols and not for all m.cols * m.rows .

You can extract the second for loop in a function

void innerLoop(Matrix &m, const size_t some_r, std::function expression1, std::function expression2)
{
    for (size_t r = 0; r < m.rows(); r++) {
        if (r == some_r) {
            m(r,c) = expression1(...);
        }
        else {
            m(r,c) = expression2(...);
        }
    }
}

and

void some_operation_on_matrix(Matrix& m, size_t some_r, size_t some_c)
{
    for (size_t c = 0; c < m.cols(); c++) {
        if (c == some_c) {
            innerLoop(m, some_r, expressionA, expressionB);
        else {
            innerLoop(m, some_r, expressionC, expressionC);           
        }
    }
}

The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM