本文整理汇总了C++中reservable_priority_queue::empty方法的典型用法代码示例。如果您正苦于以下问题：C++ reservable_priority_queue::empty方法的具体用法？C++ reservable_priority_queue::empty怎么用？C++ reservable_priority_queue::empty使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类reservable_priority_queue的用法示例。
在下文中一共展示了reservable_priority_queue::empty方法的8个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: clear
/**
* Clears the queues
*/
void clear() {
// Clear the search queue
while (!q.empty())
q.pop();
// Clear edge_map
edges.clear();
}示例2: RestartQueue
/**
* Clear the queue and re-insert all known links.
*/
void RestartQueue() {
// Clear the search queue
while (!q.empty())
q.pop();
for (const auto &i : edges)
q.push(Value(i.second.value, i));
}示例3: while
/**
* Return top element of queue for processing
*
* @return Node for processing
*/
const Node &pop() {
cur = q.top().iterator;
do
q.pop();
while (!q.empty() && q.top().iterator->second.value < q.top().edge_value);
return cur->first;
}示例4: Pop
/**
* Return top element of queue for processing
*
* @return Node for processing
*/
Node Pop() {
edge_const_iterator cur(q.top().iterator);
current_value = cur->second.value;
do {
q.pop();
} while (!q.empty() && q.top().iterator->second.value < q.top().edge_value);
return cur->first;
}示例5: while
/**
* Return top element of queue for processing
*
* @return Node for processing
*/
const Node &Pop() {
cur = q.top().iterator;
do { // remove this item
q.pop();
} while (!q.empty() && (q.top().priority > q.top().iterator->second));
// and all lower rank than this
return cur->first;
}示例6: Clear
/** Clears the queues */
void Clear() {
// Clear the search queue
while (!q.empty())
q.pop();
// Clear the node_parent_map
node_parents.clear();
// Clear the node_value_map
node_values.clear();
}示例7: Clear
/**
* Clears the queues
*/
void Clear() {
// Clear the search queue
while (!q.empty())
q.pop();
// Clear EdgeMap
edges.clear();
current_value = 0;
}示例8: empty
/**
* Test whether queue is empty
*
* @return True if no more nodes to search
*/
gcc_pure
bool empty() const {
return q.empty();
}