Method Insert

Common/Core/vtkPriorityQueue.cxx:39–78

Insert id with priority specified.

// Insert id with priority specified.
void vtkPriorityQueue::Insert(double priority, vtkIdType id)
{
  vtkIdType i, idx;
  vtkPriorityQueue::Item temp;

  // check and make sure item hasn't been inserted before
  if (id <= this->ItemLocation->GetMaxId() && this->ItemLocation->GetValue(id) != -1)
  {
    return;
  }

  // start by placing new entry at bottom of tree
  if (++this->MaxId >= this->Size)
  {
    this->Resize(this->MaxId + 1);
  }
  this->Array[this->MaxId].priority = priority;
  this->Array[this->MaxId].id = id;

  vtkIdType oldMaxId = this->ItemLocation->GetMaxId();
  this->ItemLocation->InsertValue(id, this->MaxId); // this does allocation
  for (i = oldMaxId + 1; i < id; i++)
  {
    // initialize previously unused elements
    this->ItemLocation->SetValue(i, -1);
  }

  // now begin percolating towards top of tree
  for (i = this->MaxId;
       i > 0 && this->Array[i].priority < this->Array[(idx = (i - 1) / 2)].priority; i = idx)
  {
    temp = this->Array[i];

    this->ItemLocation->SetValue(temp.id, idx);
    this->Array[i] = this->Array[idx];

    this->ItemLocation->SetValue(this->Array[idx].id, i);
    this->Array[idx] = temp;
  }
}

// Simplified call for easier wrapping for Tcl.
vtkIdType vtkPriorityQueue::Pop(vtkIdType location)