, including all inherited members.
| findPath(const Vec &s, const Vec &e, std::list< Vec > &path) | GridAstar< DIM, NONCYCLIC > | [inline] |
| g_ | GridAstar< DIM, NONCYCLIC > | [protected] |
| getDim() const | GridAstar< DIM, NONCYCLIC > | [inline] |
| getNoncyclic() const | GridAstar< DIM, NONCYCLIC > | [inline] |
| GridAstar() | GridAstar< DIM, NONCYCLIC > | [inline] |
| GridAstar(const Vec size) | GridAstar< DIM, NONCYCLIC > | [inline, explicit] |
| open_ | GridAstar< DIM, NONCYCLIC > | [protected] |
| parents_ | GridAstar< DIM, NONCYCLIC > | [protected] |
| queue_size_limit_ | GridAstar< DIM, NONCYCLIC > | [protected] |
| reset(const Vec size) | GridAstar< DIM, NONCYCLIC > | [inline] |
| search(const Vec &s, const Vec &e, std::list< Vec > &path, std::function< float(const Vec &, Vec &, const Vec &, const Vec &)> cb_cost, std::function< float(const Vec &, const Vec &)> cb_cost_estim, std::function< std::vector< Vec > &(const Vec &, const Vec &, const Vec &)> cb_search, std::function< bool(const std::list< Vec > &)> cb_progress, const float cost_leave, const float progress_interval, const bool return_best=false) | GridAstar< DIM, NONCYCLIC > | [inline] |
| search_task_num_ | GridAstar< DIM, NONCYCLIC > | [protected] |
| searchImpl(Gridmap< float > &g, const Vec &st, const Vec &en, std::list< Vec > &path, std::function< float(const Vec &, Vec &, const Vec &, const Vec &)> cb_cost, std::function< float(const Vec &, const Vec &)> cb_cost_estim, std::function< std::vector< Vec > &(const Vec &, const Vec &, const Vec &)> cb_search, std::function< bool(const std::list< Vec > &)> cb_progress, const float cost_leave, const float progress_interval, const bool return_best=false) | GridAstar< DIM, NONCYCLIC > | [inline] |
| setQueueSizeLimit(const size_t size) | GridAstar< DIM, NONCYCLIC > | [inline] |
| setSearchTaskNum(const size_t &search_task_num) | GridAstar< DIM, NONCYCLIC > | [inline] |