RhodeCode

            TreeArray[i-2]=other;

          }

          fuse( TreeArray[i-2], TreeArray[i] );

          i-=2;

        }

        minimum = TreeArray[0];

      }

      if ( 0==num_child ) {

        minimum = container[minimum].child;

      }

      --num_items;

    }

    /// \brief Deletes \c item from the heap.

    ///

    /// This method deletes \c item from the heap, if \c item was already

    /// stored in the heap. It is quite inefficient in Pairing heaps.

    void erase (const Item& item) {

      int i=iimap[item];

      if ( i>=0 && container[i].in ) {

        decrease( item, container[minimum].prio-1 );

        pop();

  {

    typedef FibHeap<Prio, ItemIntMap> IntHeap;

    checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();

    heapSortTest<IntHeap>();

    heapIncreaseTest<IntHeap>();

    typedef FibHeap<Prio, IntNodeMap > NodeHeap;

    checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();

    dijkstraHeapTest<NodeHeap>(digraph, length, source);

  }

  // PairingHeap

  // RadixHeap

  {

    typedef RadixHeap<ItemIntMap> IntHeap;

    checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();

    heapSortTest<IntHeap>();

    heapIncreaseTest<IntHeap>();

    typedef RadixHeap<IntNodeMap > NodeHeap;

    checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();

    dijkstraHeapTest<NodeHeap>(digraph, length, source);

  }