RhodeCode

      _data.clear();

    }

  private:

    static int parent(int i) { return (i-1)/2; }

    bool less(const Pair &p1, const Pair &p2) const {

      return _comp(p1.second, p2.second);

    }

      int par = parent(hole);

      while( hole>0 && less(p,_data[par]) ) {

        move(_data[par],hole);

        hole = par;

        par = parent(hole);

      }

      move(p, hole);

      return hole;

    }

      while(child < length) {

        if( less(_data[child-1], _data[child]) ) {

          --child;

        }

        if( !less(_data[child], p) )

          goto ok;

        move(_data[child], hole);

        hole = child;

      }

      child--;

      if( child<length && less(_data[child], p) ) {

        move(_data[child], hole);

        hole=child;

      }

    /// \c p.second.

    /// \param p The pair to insert.

    /// \pre \c p.first must not be stored in the heap.

    void push(const Pair &p) {

      int n = _data.size();

      _data.resize(n+1);

    }

    /// \brief Insert an item into the heap with the given priority.

    ///

    /// This function inserts the given item into the heap with the

    /// given priority.

    /// This function removes the item having minimum priority.

    /// \pre The heap must be non-empty.

    void pop() {

      int n = _data.size()-1;

      _iim.set(_data[0].first, POST_HEAP);

      if (n > 0) {

      }

      _data.pop_back();

    }

    /// \brief Remove the given item from the heap.

    ///

    /// \pre \e i must be in the heap.

    void erase(const Item &i) {

      int h = _iim[i];

      int n = _data.size()-1;

      _iim.set(_data[h].first, POST_HEAP);

      if( h < n ) {

        }

      }

      _data.pop_back();

    }

    /// \brief The priority of the given item.

    void set(const Item &i, const Prio &p) {

      int idx = _iim[i];

      if( idx < 0 ) {

        push(i,p);

      }

      else if( _comp(p, _data[idx].second) ) {

      }

      else {

      }

    }

    /// \brief Decrease the priority of an item to the given value.

    ///

    /// This function decreases the priority of an item to the given value.

    /// \param i The item.

    /// \param p The priority.

    /// \pre \e i must be stored in the heap with priority at least \e p.

    void decrease(const Item &i, const Prio &p) {

      int idx = _iim[i];

    }

    /// \brief Increase the priority of an item to the given value.

    ///

    /// This function increases the priority of an item to the given value.

    /// \param i The item.

    /// \param p The priority.

    /// \pre \e i must be stored in the heap with priority at most \e p.

    void increase(const Item &i, const Prio &p) {

      int idx = _iim[i];

    }

    /// \brief Return the state of an item.

    ///

    /// This method returns \c PRE_HEAP if the given item has never

    /// been in the heap, \c IN_HEAP if it is in the heap at the moment,

    void clear() {

      _data.clear(); _first.clear(); _minimum = 0;

    }

  private:

      if (idx + 1 < int(_data.size())) {

        _data[idx] = _data.back();

        if (_data[idx].prev != -1) {

          _data[_data[idx].prev].next = idx;

        } else {

          _first[_data[idx].value] = idx;

      while (_first[_minimum] == -1) {

        Direction::increase(_minimum);

      }

      int idx = _first[_minimum];

      _iim[_data[idx].item] = -2;

      unlace(idx);

    }

    /// \brief Remove the given item from the heap.

    ///

    /// This function removes the given item from the heap if it is

    /// already stored.

    /// \param i The item to delete.

    /// \pre \e i must be in the heap.

    void erase(const Item &i) {

      int idx = _iim[i];

      _iim[_data[idx].item] = -2;

      unlace(idx);

    }

    /// \brief The priority of the given item.

    ///

    /// This function returns the priority of the given item.

    /// \param i The item.

    /// \pre The heap must be non-empty.

    void pop() {

      /*The first case is that there are only one root.*/

      if ( _data[_minimum].left_neighbor==_minimum ) {

        _data[_minimum].in=false;

        if ( _data[_minimum].degree!=0 ) {

          _minimum=_data[_minimum].child;

          balance();

        }

      } else {

        int right=_data[_minimum].right_neighbor;

        unlace(_minimum);

        _data[_minimum].in=false;

        if ( _data[_minimum].degree > 0 ) {

          int left=_data[_minimum].left_neighbor;

          int child=_data[_minimum].child;

          int last_child=_data[child].left_neighbor;

          _data[left].right_neighbor=child;

          _data[child].left_neighbor=left;

          _data[right].left_neighbor=last_child;

          _data[last_child].right_neighbor=right;

        }

      do {

        if ( _comp(_data[s].prio, _data[_minimum].prio) ) _minimum=s;

        s=_data[s].right_neighbor;

      } while ( s != m );

    }

      int s=c;

      do {

        _data[s].parent=-1;

        s=_data[s].right_neighbor;

      } while ( s != c );

    }

    /// \brief Exception thrown by RadixHeap.

    ///

    /// This exception is thrown when an item is inserted into a

    /// RadixHeap with a priority smaller than the last erased one.

    /// \see RadixHeap

    public:

      virtual const char* what() const throw() {

      }

    };

    /// \brief Type to represent the states of the items.

    ///

    /// Each item has a state associated to it. It can be "in heap",

    struct RadixBox {

      int first;

      int min, size;

      RadixBox(int _min, int _size) : first(-1), min(_min), size(_size) {}

    };

    ItemIntMap &_iim;

  public:

    /// \brief Constructor.

    /// The assigned value must be \c PRE_HEAP (<tt>-1</tt>) for each item.

    /// \param minimum The initial minimum value of the heap.

    /// \param capacity The initial capacity of the heap.

    RadixHeap(ItemIntMap &map, int minimum = 0, int capacity = 0)

      : _iim(map)

    {

        extend();

      }

    }

    /// \brief The number of items stored in the heap.

    ///

    /// This function returns the number of items stored in the heap.

    /// \brief Check if the heap is empty.

    ///

    /// This function returns \c true if the heap is empty.

    /// \brief Make the heap empty.

    ///

    /// This functon makes the heap empty.

    /// It does not change the cross reference map. If you want to reuse

    /// a heap that is not surely empty, you should first clear it and

    /// then you should set the cross reference map to \c PRE_HEAP

    /// for each item.

    /// \param minimum The minimum value of the heap.

    /// \param capacity The capacity of the heap.

    void clear(int minimum = 0, int capacity = 0) {

        extend();

      }

    }

  private:

    bool upper(int box, Prio pr) {

    }

    bool lower(int box, Prio pr) {

    }

    // Remove item from the box list

    void remove(int index) {

      } else {

      }

      }

    }

    // Insert item into the box list

    void insert(int box, int index) {

      } else {

      }

    }

    // Add a new box to the box list

    void extend() {

    }

    // Move an item up into the proper box.

      remove(index);

      insert(box, index);

    }

    // Find up the proper box for the item with the given priority

    int findUp(int start, int pr) {

      while (lower(start, pr)) {

          extend();

        }

      }

      return start;

    }

    // Move an item down into the proper box

      remove(index);

      insert(box, index);

    }

    // Find down the proper box for the item with the given priority

    int findDown(int start, int pr) {

      while (upper(start, pr)) {

      }

      return start;

    }

    // Find the first non-empty box

    int findFirst() {

      int first = 0;

      return first;

    }

    // Gives back the minimum priority of the given box

    int minValue(int box) {

      }

      return min;

    }

    // Rearrange the items of the heap and make the first box non-empty

    void moveDown() {

      int box = findFirst();

      if (box == 0) return;

      int min = minValue(box);

      for (int i = 0; i <= box; ++i) {

      }

      while (curr != -1) {

        curr = next;

      }

    }

        } else {

        }

        }

      }

    }

  public:

    /// \brief Insert an item into the heap with the given priority.

    ///

    /// given priority.

    /// \param i The item to insert.

    /// \param p The priority of the item.

    /// \pre \e i must not be stored in the heap.

    /// \warning This method may throw an \c UnderFlowPriorityException.

    void push(const Item &i, const Prio &p) {

      _iim.set(i, n);

        extend();

      }

      insert(box, n);

    }

    /// \brief Return the item having minimum priority.

    ///

    /// This function returns the item having minimum priority.

    /// \pre The heap must be non-empty.

    Item top() const {

      const_cast<RadixHeap<ItemIntMap>&>(*this).moveDown();

    }

    /// \brief The minimum priority.

    ///

    /// This function returns the minimum priority.

    /// \pre The heap must be non-empty.

    Prio prio() const {

      const_cast<RadixHeap<ItemIntMap>&>(*this).moveDown();

     }

    /// \brief Remove the item having minimum priority.

    ///

    /// This function removes the item having minimum priority.

    /// \pre The heap must be non-empty.

    void pop() {

      moveDown();

      remove(index);

    }

    /// \brief Remove the given item from the heap.

    ///

    /// This function removes the given item from the heap if it is

    /// already stored.

    /// \param i The item to delete.

    /// \pre \e i must be in the heap.

    void erase(const Item &i) {

      int index = _iim[i];

      _iim[i] = POST_HEAP;

      remove(index);

   }

    /// \brief The priority of the given item.

    ///

    /// This function returns the priority of the given item.

    /// \param i The item.

    /// \pre \e i must be in the heap.

    Prio operator[](const Item &i) const {

      int idx = _iim[i];

    }

    /// \brief Set the priority of an item or insert it, if it is

    /// not stored in the heap.

    ///

    /// This method sets the priority of the given item if it is

    /// \warning This method may throw an \c UnderFlowPriorityException.

    void set(const Item &i, const Prio &p) {

      int idx = _iim[i];

      if( idx < 0 ) {

        push(i, p);

      }

      } else {

      }

    }

    /// \brief Decrease the priority of an item to the given value.

    ///

    /// This function decreases the priority of an item to the given value.

    /// \param i The item.

    /// \param p The priority.

    /// \pre \e i must be stored in the heap with priority at least \e p.

    /// \warning This method may throw an \c UnderFlowPriorityException.

    void decrease(const Item &i, const Prio &p) {

      int idx = _iim[i];

    }

    /// \brief Increase the priority of an item to the given value.

    ///

    /// This function increases the priority of an item to the given value.

    /// \param i The item.

    /// \param p The priority.

    /// \pre \e i must be stored in the heap with priority at most \e p.

    void increase(const Item &i, const Prio &p) {

      int idx = _iim[i];

    }

    /// \brief Return the state of an item.

    ///

    /// This method returns \c PRE_HEAP if the given item has never

    /// been in the heap, \c IN_HEAP if it is in the heap at the moment,