RhodeCode

    assert_fail_log(file, line, function, exception, assertion);

    assert_fail_log(file, line, function, message, assertion);

    assert_fail_log(file, line, function, message.c_str(), assertion);

    std::abort();

    throw AssertionFailedError(file, line, function, message.c_str(), assertion);

    throw AssertionFailedError(file, line, function, message.c_str(), assertion);

#error "LEMON assertion system is not set properly"

     defined(LEMON_ENABLE_ASSERTS)) &&			\

#error "LEMON assertion system is not set properly"

/// \brief Macro for assertion with customizable message

/// Macro for assertion with customizable message.  

/// \param exp An expression that must be convertible to \c bool.

/// If it is \c false, then an assertion is raised. The concrete

/// behaviour depends on the settings of the assertion system.

/// \param msg A <tt>const char*</tt>, a <tt>const std::string&</tt> or

/// a <tt>const std::exception&</tt> parameter, which can be used to

/// provide information about the circumstances of the failed assertion.

/// The assertions are disabled in the default behaviour.

/// You can enable them with the following code:

/// The LEMON assertion system has a wide range of customization

/// properties. As a default behaviour the failed assertion prints a

/// short log message to the standard error and aborts the execution.

/// - \c LEMON_ASSERT_LOG The failed assertion prints a short log

///   message to the standard error and continues the execution.

/// - \c LEMON_ASSERT_ABORT This mode is similar to the

///   \c LEMON_ASSERT_LOG, but it aborts the program. It is the default

///   behaviour mode when the assertions are enabled with

///   \c LEMON_ENABLE_ASSERTS.

/// - \c LEMON_ASSERT_ERROR The assertion throws an

///   \ref lemon::AssertionFailedError "AssertionFailedError".

///   If the \c msg parameter is an exception, then the result of the

///   \ref lemon::Exception::what() "what()" member function is passed

///   as error message.

/// - \c LEMON_ASSERT_EXCEPTION If the specified \c msg is an

///   exception, then it raised directly (solving that the exception

///   the given parameters.

/// - \c LEMON_ASSERT_CUSTOM The user can define own assertion handler

///   functions. Three overloaded functions should be defined with the

///   following parameter lists:

///     void custom_assert_handler(const char* file, int line, const char* function,

///                                const char* message, const char* assertion);

///     void custom_assert_handler(const char* file, int line, const char* function,

///                                const std::string& message, const char* assertion);

///     void custom_assert_handler(const char* file, int line, const char* function,

///                                const std::exception& message, const char* assertion);

///   handlers is called with appropiate parameters.

/// The assertion mode can also be changed within one compilation unit.

/// If the macros are redefined with other settings and the

/// \ref lemon/assert.h "assert.h" file is reincluded, then the

/// behaviour is changed appropiately to the new settings.

#    define LEMON_ASSERT(exp, msg)  (static_cast<void>(0))

///\brief The concept of heaps.

    /// \brief The heap concept.

    /// Concept class describing the main interface of heaps.

    template <typename Priority, typename ItemIntMap>

      /// Type of the items stored in the heap.

      typedef typename ItemIntMap::Key Item;

      /// Type of the priorities.

      typedef Priority Prio;

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

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

      /// "pre heap" or "post heap". The later two are indifferent

      /// from the point of view of the heap, but may be useful for

      /// the user.

      /// The \c ItemIntMap must be initialized in such a way, that it 

      /// assigns \c PRE_HEAP (<tt>-1</tt>) to every item.

      /// \param map A map that assigns \c int values to keys of type

      /// \c Item. It is used internally by the heap implementations to

      /// handle the cross references. The assigned value must be

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

      explicit Heap(ItemIntMap &map) {}

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

      /// Returns \c true if the heap is empty.

      /// \brief Makes the heap empty.

      /// Makes the heap empty.

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

      /// Inserts the given item into the heap with the given priority. 

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

      /// Returns the item having minimum priority.

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

      /// \brief The minimum priority.

      /// Returns the minimum priority.

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

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

      /// Removes the item having minimum priority.

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

      /// \brief Removes an item from the heap.

      /// Removes the given item from the heap if it is already stored.

      /// \param i The item to delete. 

      /// \brief The priority of an item.

      /// Returns the priority of the given item.  

      /// \brief Sets the priority of an item or inserts it, if it is

      /// not stored in the heap.

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

      /// already stored in the heap.

      /// Otherwise it inserts the given item with the given priority.

      ///

      /// It may throw an \ref UnderflowPriorityException.

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

      /// Decreases the priority of an item to the given value.

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

      /// Increases the priority of an item to the given value.

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

      /// \brief Returns if an item is in, has already been in, or has

      /// 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,

      /// and \c POST_HEAP otherwise.

      /// In the latter case it is possible that the item will get back

      /// to the heap again.

      /// \brief Sets the state of an item in the heap.

      /// Sets the state of the given item in the heap. It can be used

      /// to manually clear the heap when it is important to achive the

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

	  typedef typename _Heap::Item OwnItem;

	  typedef typename _Heap::Prio OwnPrio;

	  typedef typename _Heap::State OwnState;

	  State state;

	  ignore_unused_variable_warning(state);

	  OwnItem own_item;

	  OwnPrio own_prio;

	  OwnState own_state;

	  own_item=Item();

	  own_prio=Prio();

	  ignore_unused_variable_warning(own_item);

	  ignore_unused_variable_warning(own_prio);

	  ignore_unused_variable_warning(own_state);

	  _Heap heap1(map);

	  _Heap heap2 = heap1;

	  ignore_unused_variable_warning(heap2);

	  int s = heap.size();

	  bool e = heap.empty();

	  prio = heap[item];

	  own_prio = heap.prio();

	  own_item = heap.top();

	  own_prio = heap[own_item];

	  heap.push(item, prio);

	  heap.push(own_item, own_prio);

	  heap.set(own_item, own_prio);

	  heap.decrease(own_item, own_prio);

	  heap.increase(own_item, own_prio);

	  heap.erase(own_item);

	  heap.clear();

	  heap.state(item, state);

	  state = heap.state(own_item);

	  heap.state(own_item, own_state);

	  own_state = _Heap::PRE_HEAP;

	  own_state = _Heap::IN_HEAP;

	  own_state = _Heap::POST_HEAP;

	}

///\brief The concept of maps.

	const typename _WriteMap::Value& own_val;