Lines Matching refs:m_prio_heap
73 m_size_last_time_size_checked = m_prio_heap.size();
97 current_size = m_prio_heap.size();
120 m_prio_heap.size(), m_max_size);
130 const Message* msg_ptr = m_prio_heap.front().get();
211 m_prio_heap.push_back(message);
212 push_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>());
232 MsgPtr message = m_prio_heap.front();
243 m_size_at_cycle_start = m_prio_heap.size();
248 pop_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>());
249 m_prio_heap.pop_back();
279 m_prio_heap.clear();
294 MsgPtr node = m_prio_heap.front();
295 pop_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>());
300 m_prio_heap.back() = node;
301 push_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>());
312 m_prio_heap.push_back(m);
313 push_heap(m_prio_heap.begin(), m_prio_heap.end(),
369 MsgPtr message = m_prio_heap.front();
393 vector<MsgPtr> copy(m_prio_heap);
401 return ((m_prio_heap.size() > 0) &&
402 (m_prio_heap.front()->getLastEnqueueTime() <= current_time));
447 for (unsigned int i = 0; i < m_prio_heap.size(); ++i) {
448 Message *msg = m_prio_heap[i].get();