template<typename PlainObjectType, int Options, typename StrideType>
class Eigen::Ref< PlainObjectType, Options, StrideType >
A matrix or vector expression mapping an existing expressions.
- Template Parameters
-
| PlainObjectType | the equivalent matrix type of the mapped data |
| Options | specifies whether the pointer is Aligned, or Unaligned. The default is Unaligned. |
| StrideType | optionally specifies strides. By default, Ref implies a contiguous storage along the inner dimension (inner stride==1), but accept a variable outer stride (leading dimension). This can be overridden by specifying strides. The type passed here must be a specialization of the Stride template, see examples below. |
This class permits to write non template functions taking Eigen's object as parameters while limiting the number of copies. A Ref<> object can represent either a const expression or a l-value:
void foo1(Ref<VectorXf> x);
void foo2(const Ref<const VectorXf>& x);
In the in-out case, the input argument must satisfies the constraints of the actual Ref<> type, otherwise a compilation issue will be triggered. By default, a Ref<VectorXf> can reference any dense vector expression of float having a contiguous memory layout. Likewise, a Ref<MatrixXf> can reference any column major dense matrix expression of float whose column's elements are contiguously stored with the possibility to have a constant space inbetween each column, i.e.: the inner stride mmust be equal to 1, but the outer-stride (or leading dimension), can be greater than the number of rows.
In the const case, if the input expression does not match the above requirement, then it is evaluated into a temporary before being passed to the function. Here are some examples:
MatrixXf A;
VectorXf a;
foo1(a.head());
foo1(A.col());
foo1(A.row());
foo2(A.row());
foo2(2*a);
foo2(A.col().segment(2,4));
The range of inputs that can be referenced without temporary can be enlarged using the last two template parameter. Here is an example accepting an innerstride!=1:
void foo3(
Ref<VectorXf,0,InnerStride<> > x);
foo3(A.row());
The downside here is that the function foo3 might be significantly slower than foo1 because it won't be able to exploit vectorization, and will involved more expensive address computations even if the input is contiguously stored in memory. To overcome this issue, one might propose to overloads internally calling a template function, e.g.:
void foo(const Ref<MatrixXf>& A);
void foo(
const Ref<MatrixXf,0,Stride<> >& A);
template<typename TypeOfA> void foo_impl(const TypeOfA& A) {
...
}
void foo(const Ref<MatrixXf>& A) { foo_impl(A); }
void foo(
const Ref<MatrixXf,0,Stride<> >& A) { foo_impl(A); }
- See also
- PlainObjectBase::Map(), TopicStorageOrders
Definition at line 17 of file Ref.h.
Public Types inherited from Eigen::RefBase< Ref< PlainObjectType, Options, StrideType > >