ruby/network/MessageBuffer.cc

150 MessageBuffer::enqueue(MsgPtr message, Tick current_time, Tick delta)
212     push_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>());
231     // get MsgPtr of the message about to be dequeued
232     MsgPtr message = m_prio_heap.front();
248     pop_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>());
294     MsgPtr node = m_prio_heap.front();
295     pop_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>());
301     push_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>());
306 MessageBuffer::reanalyzeList(list<MsgPtr> &lt, Tick schdTick)
309         MsgPtr m = lt.front();
314                   greater<MsgPtr>());
369     MsgPtr message = m_prio_heap.front();
393     vector<MsgPtr> copy(m_prio_heap);
394     sort_heap(copy.begin(), copy.end(), greater<MsgPtr>());
460         for (std::list<MsgPtr>::iterator it = (map_iter->second).begin();