insert() [2/2]

void s_pair_heap::insert	(	s_pair *	p,
		int	len )

Definition at line 205 of file spair.cpp.

{
  int i = 0;
  while (len >= spair_heap_size[i]) i++;
  heap[i] = merge(p, heap[i]);
  n_in_heap[i] += len;
  //  std::cerr << "n_in_heap[" << i << "]=" << n_in_heap[i] << std::endl;
  p = nullptr;
  while (n_in_heap[i] >= spair_heap_size[i])
    {
      i++;
      heap[i] = merge(heap[i - 1], heap[i]);
      n_in_heap[i] += n_in_heap[i - 1];
      heap[i - 1] = nullptr;
      n_in_heap[i - 1] = 0;
    }
  if (i > top_of_heap) top_of_heap = i;
  nelems += len;
}

References heap, merge(), n_in_heap, nelems, p, spair_heap_size, and top_of_heap.