| 264 | |
| 265 | |
| 266 | void PathNodePool::GetCache( int start, int nNodes, NodeCost* nodes ) { |
| 267 | MPASSERT( start >= 0 && start < cacheCap ); |
| 268 | MPASSERT( nNodes > 0 ); |
| 269 | MPASSERT( start + nNodes <= cacheCap ); |
| 270 | memcpy( nodes, &cache[start], sizeof(NodeCost)*nNodes ); |
| 271 | } |
| 272 | |
| 273 | |
| 274 | void PathNodePool::Clear() |