ros/hrteam_planner/include/hrteam_planner/IPQ.h
//to insert an item into the queue it gets added to the end of the heap
//and then the heap is reordered from the bottom up.
to insert an item into the queue it gets added to the end of the heap
and then the heap is reordered from the bottom up.
to insert an item into the queue it gets added to the end of the heap and then the heap is reordered from the bottom up .
void insert(const int idx) {
	assert (m_iSize+1 <= m_iMaxSize);
	++m_iSize;
	m_Heap[m_iSize] = idx;
	m_invHeap[idx] = m_iSize;
	ReorderUpwards(m_iSize);
      }
void insert ( const int idx ) { assert ( m_iSize + 1 <= m_iMaxSize ) ; ++ m_iSize ; m_Heap [ m_iSize ] = idx ; m_invHeap [ idx ] = m_iSize ; ReorderUpwards ( m_iSize ) ; }
to insert an item into the queue it gets added to the end of the heap
and then the heap is reordered from the bottom up.
to insert an item into the queue it gets added to the end of the heap and then the heap is reordered from the bottom up .