FixedArray::size() Returns the length of the fixed array.

FixedArray::end() Returns an iterator to the end of the fixed array.

FixedArray::begin() Returns an iterator to the beginning of the fixed array.

Number of elements on the stack.

set the estimate for the vertex also calls updateCache()

Bottom of the stack.

* converts a number constant to a double constant at compile time * to avoid having to cast everything to avoid warnings. **/

Iterator on top of the stack (going downwards).

The user-facing name of this symbol.

FixedArray::data() Returns a const T* pointer to elements of the `FixedArray`. This pointer can be used to access (but not modify) the contained elem

rows of the matrix

columns of the matrix

* normalize the angle */

* sample a number from a uniform distribution */

FixedArray::rbegin() Returns a reverse iterator from the end of the fixed array.

returns the optimizer

FixedArray::empty() Returns whether or not the fixed array is empty.

FixedArray::fill() Assigns the given `value` to all elements in the fixed array.

FixedArray::rend() Returns a reverse iterator from the beginning of the fixed array.

return a sample of the Gaussian distribution

returns the pointer to the ith vertex connected to the hyper-edge. */

FixedArray::back() Returns a reference to the last element of the fixed array.

jacobian defined as: f(T0,T1) = dR0.inv() * T0.inv() * (T1 * dR1 * p1 + dt1) - dt0 df/dx0 = [-I, d[dR0.inv()]/dq0 * T01 * p1] df/dx1 = [R0, T01 * d[d

* extract the rotation matrix from an Isometry3 matrix. Eigen itself * performs an SVD decomposition to recover the nearest orthogonal matrix, * sin

* If we would have a constexpr for sqrt (cst_sqrt) it would be sth like. * For now we implement as a recursive function at compile time. * constexpr