|
| using | VertexXiType = VertexXi |
| |
| using | NthType = typename std::tuple_element< N, std::tuple< Types... > >::type |
| |
| using | VertexXnType = NthType< VertexN, VertexTypes... > |
| | The type of the N-th vertex.
|
| |
| typedef BaseEdge< D, E >::Measurement | Measurement |
| |
| typedef BaseEdge< D, E >::ErrorVector | ErrorVector |
| |
| typedef BaseEdge< D, E >::InformationType | InformationType |
| |
| using | JacobianType = typename Eigen::Matrix< double, EdgeDimension, VertexDimension, EdgeDimension==1 ? Eigen::RowMajor :Eigen::ColMajor >::AlignedMapType |
| |
| using | HessianBlockType = Eigen::Map< Eigen::Matrix< double, DN, DM, DN==1 ? Eigen::RowMajor :Eigen::ColMajor >, Eigen::Matrix< double, DN, DM, DN==1 ? Eigen::RowMajor :Eigen::ColMajor >::Flags &Eigen::PacketAccessBit ? Eigen::Aligned :Eigen::Unaligned > |
| | it requires quite some ugly code to get the type of hessians...
|
| |
| using | HessianBlockTypeK = HessianBlockType< VertexXnType< internal::index_to_pair(K).first >::Dimension, VertexXnType< internal::index_to_pair(K).second >::Dimension > |
| |
| using | HessianBlockTypeKTransposed = HessianBlockType< VertexXnType< internal::index_to_pair(K).second >::Dimension, VertexXnType< internal::index_to_pair(K).first >::Dimension > |
| |
| using | HessianTuple = typename HessianTupleType< std::make_index_sequence< _nr_of_vertex_pairs > >::type |
| |
| using | HessianTupleTransposed = typename HessianTupleType< std::make_index_sequence< _nr_of_vertex_pairs > >::typeTransposed |
| |
| using | HessianRowMajorStorage = std::array< bool, _nr_of_vertex_pairs > |
| |
| typedef E | Measurement |
| |
| typedef internal::BaseEdgeTraits< D >::ErrorVector | ErrorVector |
| |
| typedef internal::BaseEdgeTraits< D >::InformationType | InformationType |
| |
|
| | BaseUnaryEdge () |
| |
| constexpr std::enable_if< VertexXnType< VertexN >::Dimension!=-1, int >::type | vertexDimension () const |
| |
| std::enable_if< VertexXnType< VertexN >::Dimension==-1, int >::type | vertexDimension () const |
| |
| const VertexXnType< VertexN > * | vertexXn () const |
| |
| VertexXnType< VertexN > * | vertexXn () |
| |
| | BaseFixedSizedEdge () |
| |
| OptimizableGraph::Vertex * | createVertex (int i, CtorArgs... args) |
| | create an instance of the Nth VertexType
|
| |
| virtual void | resize (size_t size) |
| |
| bool | allVerticesFixedNs (std::index_sequence< Ints... >) const |
| |
| bool | allVerticesFixedNs (std::index_sequence< Ints... >) const |
| |
| virtual bool | allVerticesFixed () const |
| |
| virtual void | linearizeOplus (JacobianWorkspace &jacobianWorkspace) |
| |
| virtual void | linearizeOplus () |
| |
| void | linearizeOplus_allocate (JacobianWorkspace &jacobianWorkspace, std::index_sequence< Ints... >) |
| |
| void | linearizeOplus_allocate (JacobianWorkspace &jacobianWorkspace, std::index_sequence< Ints... >) |
| |
| void | linearizeOplusNs (std::index_sequence< Ints... >) |
| |
| void | linearizeOplusNs (std::index_sequence< Ints... >) |
| |
| void | linearizeOplusN () |
| |
| void | linearizeOplusN () |
| |
| const std::tuple_element< N, std::tuple< JacobianType< D, VertexTypes::Dimension >... > >::type & | jacobianOplusXn () const |
| |
| std::tuple_element< N, std::tuple< JacobianType< D, VertexTypes::Dimension >... > >::type & | jacobianOplusXn () |
| |
| virtual void | constructQuadraticForm () |
| |
| void | constructQuadraticFormNs (const InformationType &omega, const ErrorVector &weightedError, std::index_sequence< Ints... >) |
| |
| void | constructQuadraticFormNs (const InformationType &omega, const ErrorVector &weightedError, std::index_sequence< Ints... >) |
| |
| void | constructQuadraticFormN (const InformationType &omega, const ErrorVector &weightedError) |
| |
| void | constructQuadraticFormN (const InformationType &omega, const ErrorVector &weightedError) |
| |
| void | constructOffDiagonalQuadraticFormMs (const AtOType &, std::index_sequence<>) |
| |
| void | constructOffDiagonalQuadraticFormMs (const AtOType &AtO, std::index_sequence< Ints... >) |
| |
| void | constructOffDiagonalQuadraticFormMs (const AtOType &, std::index_sequence<>) |
| |
| void | constructOffDiagonalQuadraticFormMs (const AtOType &AtO, std::index_sequence< Ints... >) |
| |
| void | constructOffDiagonalQuadraticFormM (const AtOType &AtO) |
| |
| void | constructOffDiagonalQuadraticFormM (const AtOType &AtO) |
| |
| virtual void | mapHessianMemory (double *d, int i, int j, bool rowMajor) |
| |
| | BaseEdge () |
| |
| BaseEdge & | operator= (const BaseEdge &)=delete |
| |
| | BaseEdge (const BaseEdge &)=delete |
| |
| virtual | ~BaseEdge () |
| |
| virtual double | chi2 () const |
| |
| virtual const double * | errorData () const |
| | returns the error vector cached after calling the computeError;
|
| |
| virtual double * | errorData () |
| |
| const ErrorVector & | error () const |
| |
| ErrorVector & | error () |
| |
| EIGEN_STRONG_INLINE const InformationType & | information () const |
| | information matrix of the constraint
|
| |
| EIGEN_STRONG_INLINE InformationType & | information () |
| |
| void | setInformation (const InformationType &information) |
| |
| virtual const double * | informationData () const |
| |
| virtual double * | informationData () |
| |
| EIGEN_STRONG_INLINE const Measurement & | measurement () const |
| | accessor functions for the measurement represented by the edge
|
| |
| virtual void | setMeasurement (const Measurement &m) |
| |
| virtual int | rank () const |
| |
| virtual void | initialEstimate (const OptimizableGraph::VertexSet &, OptimizableGraph::Vertex *) |
| |
| template<int Dim = D> |
| std::enable_if< Dim==-1, void >::type | setDimension (int dim) |
| |
| | Edge () |
| |
| virtual | ~Edge () |
| |
| virtual void | computeError ()=0 |
| |
| virtual bool | setMeasurementData (const double *m) |
| |
| virtual bool | getMeasurementData (double *m) const |
| |
| virtual int | measurementDimension () const |
| |
| virtual bool | setMeasurementFromState () |
| |
| RobustKernel * | robustKernel () const |
| | if NOT NULL, error of this edge will be robustifed with the kernel
|
| |
| void | setRobustKernel (RobustKernel *ptr) |
| |
| virtual double | initialEstimatePossible (const OptimizableGraph::VertexSet &from, OptimizableGraph::Vertex *to) |
| |
| int | level () const |
| | returns the level of the edge
|
| |
| void | setLevel (int l) |
| | sets the level of the edge
|
| |
| int | dimension () const |
| | returns the dimensions of the error function
|
| |
| | G2O_ATTRIBUTE_DEPRECATED (virtual Vertex *createFrom()) |
| |
| | G2O_ATTRIBUTE_DEPRECATED (virtual Vertex *createTo()) |
| |
| virtual Vertex * | createVertex (int) |
| |
| virtual bool | read (std::istream &is)=0 |
| | read the vertex from a stream, i.e., the internal state of the vertex
|
| |
| virtual bool | write (std::ostream &os) const =0 |
| | write the vertex to a stream
|
| |
| long long | internalId () const |
| | the internal ID of the edge
|
| |
| OptimizableGraph * | graph () |
| |
| const OptimizableGraph * | graph () const |
| |
| bool | setParameterId (int argNum, int paramId) |
| |
| const Parameter * | parameter (int argNo) const |
| |
| size_t | numParameters () const |
| |
| void | resizeParameters (size_t newSize) |
| |
| | Edge (int id=InvalidId) |
| | creates and empty edge with no vertices
|
| |
| const VertexContainer & | vertices () const |
| |
| VertexContainer & | vertices () |
| |
| const Vertex * | vertex (size_t i) const |
| |
| Vertex * | vertex (size_t i) |
| |
| void | setVertex (size_t i, Vertex *v) |
| |
| int | id () const |
| |
| void | setId (int id) |
| |
| virtual HyperGraphElementType | elementType () const |
| |
| int | numUndefinedVertices () const |
| |
| virtual | ~HyperGraphElement () |
| |
| | DataContainer () |
| |
| virtual | ~DataContainer () |
| |
| const Data * | userData () const |
| | the user data associated with this vertex
|
| |
| Data * | userData () |
| |
| void | setUserData (Data *obs) |
| |
| void | addUserData (Data *obs) |
| |
template<int D, typename E, typename VertexXi>
class g2o::BaseUnaryEdge< D, E, VertexXi >
Definition at line 37 of file base_unary_edge.h.