begin() | mrpt::vision::CFeatureList | inline |
begin() const | mrpt::vision::CFeatureList | inline |
CFeatureList()=default | mrpt::vision::CFeatureList | |
clear() | mrpt::vision::CFeatureList | inline |
const_iterator typedef | mrpt::vision::CFeatureList | |
const_reverse_iterator typedef | mrpt::vision::CFeatureList | |
copyListFrom(const CFeatureList &otherList) | mrpt::vision::CFeatureList | |
derived() const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
derived() | mrpt::math::KDTreeCapable< CFeatureList > | inline |
emplace_back(CFeature &&f) | mrpt::vision::CFeatureList | inline |
empty() const | mrpt::vision::CFeatureList | inline |
end() | mrpt::vision::CFeatureList | inline |
end() const | mrpt::vision::CFeatureList | inline |
erase(const iterator &it) | mrpt::vision::CFeatureList | inline |
get_type() const | mrpt::vision::CFeatureList | inline |
getByID(const TFeatureID &ID) const | mrpt::vision::CFeatureList | |
getByID(const TFeatureID &ID, int &out_idx) const | mrpt::vision::CFeatureList | |
getFeatureID(size_t i) const | mrpt::vision::CFeatureList | inline |
getFeatureResponse(size_t i) const | mrpt::vision::CFeatureList | inline |
getFeatureX(size_t i) const | mrpt::vision::CFeatureList | inline |
getFeatureY(size_t i) const | mrpt::vision::CFeatureList | inline |
getMaxID() const | mrpt::vision::CFeatureList | |
getScale(size_t i) const | mrpt::vision::CFeatureList | inline |
getTrackStatus(size_t i) | mrpt::vision::CFeatureList | inline |
isPointFeature(size_t i) const | mrpt::vision::CFeatureList | inline |
iterator typedef | mrpt::vision::CFeatureList | |
kdtree_distance(const float *p1, const size_t idx_p2, [[maybe_unused]] size_t size) const | mrpt::vision::CFeatureList | inline |
kdtree_get_bbox([[maybe_unused]] BBOX &bb) const | mrpt::vision::CFeatureList | inline |
kdtree_get_point_count() const | mrpt::vision::CFeatureList | inline |
kdtree_get_pt(const size_t idx, int dim) const | mrpt::vision::CFeatureList | inline |
kdtree_mark_as_outdated() const | mrpt::math::KDTreeCapable< CFeatureList > | inlineprotected |
kdtree_search_params | mrpt::math::KDTreeCapable< CFeatureList > | |
KDTreeCapable()=default | mrpt::math::KDTreeCapable< CFeatureList > | inline |
KDTreeCapable(const KDTreeCapable &) | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeClosestPoint2D(float x0, float y0, float &out_x, float &out_y, float &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeClosestPoint2D(float x0, float y0, float &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeClosestPoint2D(const TPoint2D &p0, TPoint2D &pOut, float &outDistSqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeClosestPoint2DsqrError(float x0, float y0) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeClosestPoint2DsqrError(const TPoint2D &p0) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeClosestPoint3D(float x0, float y0, float z0, float &out_x, float &out_y, float &out_z, float &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeClosestPoint3D(float x0, float y0, float z0, float &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeClosestPoint3D(const TPoint3D &p0, TPoint3D &pOut, float &outDistSqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeEnsureIndexBuilt2D() | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeEnsureIndexBuilt3D() | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint2D(float x0, float y0, size_t knn, std::vector< float > &out_x, std::vector< float > &out_y, std::vector< float > &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint2D(const TPoint2D &p0, size_t N, std::vector< TPoint2D > &pOut, std::vector< float > &outDistSqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint2DIdx(float x0, float y0, size_t knn, std::vector< size_t > &out_idx, std::vector< float > &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint2DIdx(const TPoint2D &p0, size_t N, std::vector< size_t > &outIdx, std::vector< float > &outDistSqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint3D(float x0, float y0, float z0, size_t knn, std::vector< float > &out_x, std::vector< float > &out_y, std::vector< float > &out_z, std::vector< float > &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint3D(const TPoint3D &p0, size_t N, std::vector< TPoint3D > &pOut, std::vector< float > &outDistSqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint3DIdx(float x0, float y0, float z0, size_t knn, std::vector< size_t > &out_idx, std::vector< float > &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint3DIdx(const TPoint3D &p0, size_t N, std::vector< size_t > &outIdx, std::vector< float > &outDistSqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeNClosestPoint3DWithIdx(float x0, float y0, float z0, size_t knn, std::vector< float > &out_x, std::vector< float > &out_y, std::vector< float > &out_z, std::vector< size_t > &out_idx, std::vector< float > &out_dist_sqr) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeRadiusSearch2D(const float x0, const float y0, const float maxRadiusSqr, std::vector< std::pair< size_t, float >> &out_indices_dist) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeRadiusSearch3D(const float x0, const float y0, const float z0, const float maxRadiusSqr, std::vector< std::pair< size_t, float >> &out_indices_dist) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeTwoClosestPoint2D(float x0, float y0, float &out_x1, float &out_y1, float &out_x2, float &out_y2, float &out_dist_sqr1, float &out_dist_sqr2) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
kdTreeTwoClosestPoint2D(const TPoint2D &p0, TPoint2D &pOut1, TPoint2D &pOut2, float &outDistSqr1, float &outDistSqr2) const | mrpt::math::KDTreeCapable< CFeatureList > | inline |
loadFromTextFile(const std::string &fileName) | mrpt::vision::CFeatureList | |
m_feats | mrpt::vision::CFeatureList | protected |
mark_as_outdated() const | mrpt::vision::CFeatureList | inline |
mark_kdtree_as_outdated() const | mrpt::vision::CFeatureList | inline |
nearest(const float x, const float y, double &max_dist) const | mrpt::vision::CFeatureList | |
operator=(const KDTreeCapable &) | mrpt::math::KDTreeCapable< CFeatureList > | inline |
operator[](const unsigned int index) | mrpt::vision::CFeatureList | inline |
operator[](const unsigned int index) const | mrpt::vision::CFeatureList | inline |
push_back(const CFeature &f) | mrpt::vision::CFeatureList | inline |
rbegin() | mrpt::vision::CFeatureList | inline |
rbegin() const | mrpt::vision::CFeatureList | inline |
rend() | mrpt::vision::CFeatureList | inline |
rend() const | mrpt::vision::CFeatureList | inline |
resize(size_t N) | mrpt::vision::CFeatureList | inline |
reverse_iterator typedef | mrpt::vision::CFeatureList | |
saveToTextFile(const std::string &fileName, bool APPEND=false) | mrpt::vision::CFeatureList | |
self_t typedef | mrpt::math::KDTreeCapable< CFeatureList > | |
setFeatureID(size_t i, TFeatureID id) | mrpt::vision::CFeatureList | inline |
setFeatureResponse(size_t i, float r) | mrpt::vision::CFeatureList | inline |
setFeatureX(size_t i, float x) | mrpt::vision::CFeatureList | inline |
setFeatureXf(size_t i, float x) | mrpt::vision::CFeatureList | inline |
setFeatureY(size_t i, float y) | mrpt::vision::CFeatureList | inline |
setFeatureYf(size_t i, float y) | mrpt::vision::CFeatureList | inline |
setScale(size_t i, uint8_t s) | mrpt::vision::CFeatureList | inline |
setTrackStatus(size_t i, TFeatureTrackStatus s) | mrpt::vision::CFeatureList | inline |
size() const | mrpt::vision::CFeatureList | inline |
TInternalFeatList typedef | mrpt::vision::CFeatureList | protected |
~CFeatureList() | mrpt::vision::CFeatureList | virtual |