载入中...
搜索中...
未找到
eve::hexmap::HexPath结构体 参考
One found path: the cells from origin to goal, with the turn each one is reached on. 更多...
#include <HexSearch.h>
Public 成员函数 | |
| bool | empty () const noexcept |
| Whether the path holds no cell. | |
| std::size_t | size () const noexcept |
| Number of cells on the path, inclusive of both ends. | |
Public 属性 | |
| std::vector< std::int32_t > | cells |
Linear cell indices, cells.front() is the origin and cells.back() the goal. | |
| std::vector< std::int32_t > | turns |
Turn index for each entry of cells; parallel to cells. | |
详细描述
One found path: the cells from origin to goal, with the turn each one is reached on.
在文件 HexSearch.h 第 178 行定义.
成员函数说明
◆ empty()
|
inlinenoexcept |
◆ size()
|
inlinenoexcept |
类成员变量说明
◆ cells
| std::vector<std::int32_t> eve::hexmap::HexPath::cells |
Linear cell indices, cells.front() is the origin and cells.back() the goal.
在文件 HexSearch.h 第 180 行定义.
◆ turns
| std::vector<std::int32_t> eve::hexmap::HexPath::turns |
Turn index for each entry of cells; parallel to cells.
在文件 HexSearch.h 第 182 行定义.
该结构体的文档由以下文件生成:
- src/modules/hexmap/HexSearch.h