Diff of /include/stxxl/bits/containers/priority_queue.h [6d5df3] .. [03e621]  Maximize  Restore

Switch to side-by-side view

--- a/include/stxxl/bits/containers/priority_queue.h
+++ b/include/stxxl/bits/containers/priority_queue.h
@@ -176,6 +176,9 @@
     unsigned_type current_group_buffer_size(unsigned_type i) const { return &(group_buffers[i][N]) - group_buffer_current_mins[i]; }
 
 public:
+    //! \name Constructors/Destructors
+    //! \{
+
     //! Constructs external priority queue object.
     //! \param pool_ pool of blocks that will be used
     //! for data writing and prefetching for the disk<->memory transfers
@@ -207,7 +210,12 @@
     //! helps to speed up operations.
     priority_queue(unsigned_type p_pool_mem, unsigned_type w_pool_mem);
 
+    virtual ~priority_queue();
+
+    //! \}
+
 #if 0
+
     //! swap this priority queue with another one.
     //! Implementation correctness is questionable.
     void swap(priority_queue& obj)
@@ -237,7 +245,8 @@
     }
 #endif
 
-    virtual ~priority_queue();
+    //! \name Capacity
+    //! \{
 
     //! Returns number of elements contained.
     //! \return number of elements contained
@@ -246,6 +255,11 @@
     //! Returns true if queue has no elements.
     //! \return \b true if queue has no elements, \b false otherwise
     bool empty() const { return (size() == 0); }
+
+    //! \}
+
+    //! \name Operators
+    //! \{
 
     //! Returns "largest" element.
     //!
@@ -258,6 +272,11 @@
     //! false. Precondition: \c empty() is false.
     const value_type & top() const;
 
+    //! \}
+
+    //! \name Modifiers
+    //! \{
+
     //! Removes the element at the top.
     //!
     //! Removes the element at the top of the priority_queue, that is, the
@@ -271,6 +290,11 @@
     //! incremented by 1.
     void push(const value_type& obj);
 
+    //! \}
+
+    //! \name Miscellaneous
+    //! \{
+
     //! Number of bytes consumed by the \b priority_queue from the internal
     //! memory not including pools (see the constructor)
     unsigned_type mem_cons() const
@@ -292,6 +316,8 @@
 
     void dump_sizes() const;
     void dump_params() const;
+
+    //! \}
 };
 
 

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

JavaScript is required for this form.





No, thanks