1.1 --- a/lemon/linear_heap.h Wed Nov 02 16:43:18 2005 +0000
1.2 +++ b/lemon/linear_heap.h Fri Nov 04 10:51:35 2005 +0000
1.3 @@ -162,10 +162,9 @@
1.4 }
1.5 }
1.6
1.7 - /// \brief Returns the item with minimum priority relative to \c Compare.
1.8 + /// \brief Returns the item with minimum priority.
1.9 ///
1.10 - /// This method returns the item with minimum priority relative to \c
1.11 - /// Compare.
1.12 + /// This method returns the item with minimum priority.
1.13 /// \pre The heap must be nonempty.
1.14 Item top() const {
1.15 while (first[minimal] == -1) {
1.16 @@ -174,9 +173,9 @@
1.17 return data[first[minimal]].item;
1.18 }
1.19
1.20 - /// \brief Returns the minimum priority relative to \c Compare.
1.21 + /// \brief Returns the minimum priority.
1.22 ///
1.23 - /// It returns the minimum priority relative to \c Compare.
1.24 + /// It returns the minimum priority.
1.25 /// \pre The heap must be nonempty.
1.26 Prio prio() const {
1.27 while (first[minimal] == -1) {
1.28 @@ -185,10 +184,9 @@
1.29 return minimal;
1.30 }
1.31
1.32 - /// \brief Deletes the item with minimum priority relative to \c Compare.
1.33 + /// \brief Deletes the item with minimum priority.
1.34 ///
1.35 - /// This method deletes the item with minimum priority relative to \c
1.36 - /// Compare from the heap.
1.37 + /// This method deletes the item with minimum priority from the heap.
1.38 /// \pre The heap must be non-empty.
1.39 void pop() {
1.40 while (first[minimal] == -1) {