RhodeCode

      /// \c PRE_HEAP (<tt>-1</tt>) for each item.

      explicit Heap(ItemIntMap &map) {}

      /// \param comp The function object used for comparing the priorities.

      explicit Heap(ItemIntMap &map, const CMP &comp) {}

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

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

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

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

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

      void erase(const Item &i) {}

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

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

      /// \param p The priority.

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

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

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

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

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

      /// \param i The item.

      State state(const Item &i) const {}

      /// \param st The state. It should not be \c IN_HEAP.

      void state(const Item& i, State st) {}