| Commit message (Collapse) | Author | Age |
... | |
|
|
|
| |
remove_{const|pointer|reference}.
|
|
|
|
|
|
|
| |
Renamed meta_{true|false} to {true|false}_type, meta_if to conditional, is_same_type to is_same, un{ref|pointer|const} to remove_{reference|pointer|const} and makeconst to add_const.
Changed boolean type 'ret' member to 'value'.
Changed 'ret' members refering to types to 'type'.
Adapted all code occurences.
|
| |
|
| |
|
|
|
|
| |
As discussed on the list (too long to explain here).
|
|
|
|
|
|
|
|
| |
* Now completely generic so all standard integer types (like char...) are supported.
** add unit test for that (integer_types).
* NumTraits does no longer inherit numeric_limits
* All math functions are now templated
* Better guard (static asserts) against using certain math functions on integer types.
|
| |
|
| |
|
| |
|
|\
| |
| |
| | |
* remove a ctor in QuaternionBase as it gives a strange error with GCC 4.4.2.
|
|/ |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
construction of generic expressions working
for both dense and sparse matrix. A nicer solution
would be to use CwiseBinaryOp for any kind of matrix.
To this end we either need to change the overall design
so that the base class(es) depends on the kind of matrix,
or we could add a template parameter to each expression
type (e.g., int Kind = ei_traits<MatrixType>::Kind)
allowing to specialize each expression for each kind of matrix.
* Extend AutoDiffScalar to work with sparse vector expression
for the derivatives.
|
| |
|
|
|
|
|
|
| |
* fix namespace issue
* simplify Jacobian code
* fix issue with "Dynamic derivatives"
|
|
|
|
| |
AutoDiffJacobian::operator()(x,value) exactly as the original functor
|
|
|
|
| |
it never made very precise sense. but now does it still make any?
|
| |
|
|
mode but the advantage of using Eigen's expression template to compute
the derivatives (unless you nest an AutoDiffScalar into an Eigen's
matrix).
|