update source to Ceph Pacific 16.2.2

[ceph.git] / ceph / src / boost / boost / pending / mutable_queue.hpp

diff --git a/ceph/src/boost/boost/pending/mutable_queue.hpp b/ceph/src/boost/boost/pending/mutable_queue.hpp
index 82cfdd818217aacf971eaa58e0ba735857da3243..96c37d5e22e60a33f8b27c058ac87fc1007fd91b 100644 (file)
--- a/ceph/src/boost/boost/pending/mutable_queue.hpp
+++ b/ceph/src/boost/boost/pending/mutable_queue.hpp
@@ -20,88 +20,97 @@
 #include <boost/graph/detail/array_binary_tree.hpp>
 #include <iterator>
 
-namespace boost {
-
-  // The mutable queue whose elements are indexed
-  //
-  // This adaptor provides a special kind of priority queue that has
-  // and update operation. This allows the ordering of the items to
-  // change. After the ordering criteria for item x changes, one must
-  // call the Q.update(x)
-  //
-  // In order to efficiently find x in the queue, a functor must be
-  // provided to map value_type to a unique ID, which the
-  // mutable_queue will then use to map to the location of the
-  // item. The ID's generated must be between 0 and N, where N is the
-  // value passed to the constructor of mutable_queue
-
-  template <class IndexedType,
-            class RandomAccessContainer = std::vector<IndexedType>,
-            class Comp = std::less<typename RandomAccessContainer::value_type>,
-            class ID = identity_property_map >
-  class mutable_queue {
-  public:
+namespace boost
+{
+
+// The mutable queue whose elements are indexed
+//
+// This adaptor provides a special kind of priority queue that has
+// and update operation. This allows the ordering of the items to
+// change. After the ordering criteria for item x changes, one must
+// call the Q.update(x)
+//
+// In order to efficiently find x in the queue, a functor must be
+// provided to map value_type to a unique ID, which the
+// mutable_queue will then use to map to the location of the
+// item. The ID's generated must be between 0 and N, where N is the
+// value passed to the constructor of mutable_queue
+
+template < class IndexedType,
+    class RandomAccessContainer = std::vector< IndexedType >,
+    class Comp = std::less< typename RandomAccessContainer::value_type >,
+    class ID = identity_property_map >
+class mutable_queue
+{
+public:
     typedef IndexedType value_type;
     typedef typename RandomAccessContainer::size_type size_type;
-  protected:
+
+protected:
     typedef typename RandomAccessContainer::iterator iterator;
 #if !defined BOOST_NO_STD_ITERATOR_TRAITS
-    typedef array_binary_tree_node<iterator, ID> Node;
+    typedef array_binary_tree_node< iterator, ID > Node;
 #else
-    typedef array_binary_tree_node<iterator, value_type, ID> Node;
+    typedef array_binary_tree_node< iterator, value_type, ID > Node;
 #endif
-    typedef compare_array_node<RandomAccessContainer,Comp> Compare;
-    typedef std::vector<size_type> IndexArray;
-  public:
+    typedef compare_array_node< RandomAccessContainer, Comp > Compare;
+    typedef std::vector< size_type > IndexArray;
+
+public:
     typedef Compare value_compare;
     typedef ID id_generator;
 
     mutable_queue(size_type n, const Comp& x, const ID& _id)
-      : index_array(n), comp(x), id(_id) {
-      c.reserve(n);
+    : index_array(n), comp(x), id(_id)
+    {
+        c.reserve(n);
     }
-    template <class ForwardIterator>
-    mutable_queue(ForwardIterator first, ForwardIterator last,
-                  const Comp& x, const ID& _id)
-      : index_array(std::distance(first, last)), comp(x), id(_id)
+    template < class ForwardIterator >
+    mutable_queue(ForwardIterator first, ForwardIterator last, const Comp& x,
+        const ID& _id)
+    : index_array(std::distance(first, last)), comp(x), id(_id)
     {
-      while( first != last ) {
-        push(*first);
-        ++first;
-      }
+        while (first != last)
+        {
+            push(*first);
+            ++first;
+        }
     }
 
     bool empty() const { return c.empty(); }
 
-    void pop() {
-      value_type tmp = c.back();
-      c.back() = c.front();
-      c.front() = tmp;
-
-      size_type id_f = get(id, c.back());
-      size_type id_b = get(id, tmp);
-      size_type i = index_array[ id_b ];
-      index_array[ id_b ] = index_array[ id_f ];
-      index_array[ id_f ] = i;
-
-      c.pop_back();
-      Node node(c.begin(), c.end(), c.begin(), id);
-      down_heap(node, comp, index_array);
+    void pop()
+    {
+        value_type tmp = c.back();
+        c.back() = c.front();
+        c.front() = tmp;
+
+        size_type id_f = get(id, c.back());
+        size_type id_b = get(id, tmp);
+        size_type i = index_array[id_b];
+        index_array[id_b] = index_array[id_f];
+        index_array[id_f] = i;
+
+        c.pop_back();
+        Node node(c.begin(), c.end(), c.begin(), id);
+        down_heap(node, comp, index_array);
     }
-    void push(const IndexedType& x) {
-      c.push_back(x);
-      /*set index-array*/
-      index_array[ get(id, x) ] = c.size()-1;
-      Node node(c.begin(), c.end(), c.end() - 1, id);
-      up_heap(node, comp, index_array);
+    void push(const IndexedType& x)
+    {
+        c.push_back(x);
+        /*set index-array*/
+        index_array[get(id, x)] = c.size() - 1;
+        Node node(c.begin(), c.end(), c.end() - 1, id);
+        up_heap(node, comp, index_array);
     }
 
-    void update(const IndexedType& x) {
-      size_type current_pos = index_array[ get(id, x) ];
-      c[current_pos] = x;
+    void update(const IndexedType& x)
+    {
+        size_type current_pos = index_array[get(id, x)];
+        c[current_pos] = x;
 
-      Node node(c.begin(), c.end(), c.begin()+current_pos, id);
-      update_heap(node, comp, index_array);
+        Node node(c.begin(), c.end(), c.begin() + current_pos, id);
+        update_heap(node, comp, index_array);
     }
 
     value_type& front() { return c.front(); }
@@ -122,13 +131,12 @@ namespace boost {
     }
 #endif
 
-   protected:
+protected:
     IndexArray index_array;
     Compare comp;
     RandomAccessContainer c;
     ID id;
-  };
-
+};
 
 }