eigen_internal_assert(n_cache >= static_cast<Index>(nr)); n = n_cache - (n_cache % nr); eigen_internal_assert(n > 0); } else { n = (numext::mini<Index>)(n, (n_per_thread + nr - 1) - ((n_per_thread + nr - 1) % nr
eigen_assert(m_currentBlockRows==other.rows());m_xpr.templateblock<OtherDerived::RowsAtCompileTime...
;2223//number of samples24intn =data.rows;25//assert there are as much samples as labels26if(static_cast<int>(labels.total()) !=n) {27stringerror_message = format("The number of samples (src) must equal the number of labels (labels)! len(src)=%d, len(labels)=%d.", n, labels...
官网：Eigen 一：安装Eigen （1）安装 方式一、直接命令安装 sudo apt-get install libeigen3-dev ...
(InputDerived) EIGEN_STATIC_ASSERT_VECTOR_ONLY(ComplexDerived) EIGEN_STATIC_ASSERT_SAME_VECTOR_SIZE(ComplexDerived,InputDerived) // size at compile-time EIGEN_STATIC_ASSERT((internal::is_same<dst_type, Complex>::value), YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_...
assert(LIWAR >= N && "Please call QLD::problem with the correct dimensions."); A_.topRows(nreq) = -Aeq; A_.bottomRows(nrineq) = -Aineq; fortran_ql(&M, &nreq, &MMAX, &N, &NMAX, &NMN, Q.derived().data(), c.derived().data(), A.derived().data(), b.derived().data...
static void scaleAndAddTo(Dest& dst, const MatrixReplacement& lhs, const Rhs& rhs, const Scalar& alpha) { // This method should implement "dst += alpha * lhs * rhs" inplace, // however, for iterative solvers, alpha is always equal to 1, so let's not bother about it. assert(...
eigen_assert(m_currentBlockRows==other.rows());m_xpr.templateblock<OtherDerived::RowsAtCompileTime...
#include <cassert>// Eigen #include <Eigen/Core>// eigen-qld #include "eigen_qld_api.h" #include "QLDDirect.h"namespace Eigen {extern "C" int ql_(const int * m, const int * me, const int * mmax, const int * n, const int * nmax, ...
I did not expected that but you're right, actually .row()/.col() have to means to imply a storage order: it is inferred from the dimension being equals to 1. So same issue. I'm tempted to add a static assert if calling tail/segment/head on a 1x1 expression with a segment size ...