Method pop

src/Battlescape/PathfindingOpenSet.cpp:57–69

* Gets the node with the least cost. * After this call, the node is no longer in the set. It is an error to call this when the set is empty. * @return A pointer to the node which had the least cost. */

 * @return A pointer to the node which had the least cost.
 */
PathfindingNode *PathfindingOpenSet::pop()
{
	assert(!empty());
	OpenSetEntry *entry = _queue.top();
	PathfindingNode *nd = entry->_node;
	_queue.pop();
	delete entry;
	nd->_openentry = 0;

	// Discarded entries might be visible now.
	removeDiscarded();
	return nd;
}

/**
 * Places the node in the set.