summaryrefslogtreecommitdiff
path: root/boost/intrusive/sgtree_algorithms.hpp
diff options
context:
space:
mode:
Diffstat (limited to 'boost/intrusive/sgtree_algorithms.hpp')
-rw-r--r--boost/intrusive/sgtree_algorithms.hpp12
1 files changed, 5 insertions, 7 deletions
diff --git a/boost/intrusive/sgtree_algorithms.hpp b/boost/intrusive/sgtree_algorithms.hpp
index cb5f71cffd..2d741841e1 100644
--- a/boost/intrusive/sgtree_algorithms.hpp
+++ b/boost/intrusive/sgtree_algorithms.hpp
@@ -17,10 +17,6 @@
#ifndef BOOST_INTRUSIVE_SGTREE_ALGORITHMS_HPP
#define BOOST_INTRUSIVE_SGTREE_ALGORITHMS_HPP
-#if defined(_MSC_VER)
-# pragma once
-#endif
-
#include <boost/intrusive/detail/config_begin.hpp>
#include <boost/intrusive/intrusive_fwd.hpp>
@@ -28,7 +24,9 @@
#include <boost/intrusive/detail/algo_type.hpp>
#include <boost/intrusive/bstree_algorithms.hpp>
-
+#if defined(BOOST_HAS_PRAGMA_ONCE)
+# pragma once
+#endif
namespace boost {
namespace intrusive {
@@ -320,12 +318,12 @@ class sgtree_algorithms
if(tree_size > max_tree_size)
max_tree_size = tree_size;
- if(tree_size > 2 && //Nothing to do with only the root
+ if(tree_size > 2 && //Nothing to do with only the root
//Check if the root node is unbalanced
//Scapegoat paper depth counts root depth as zero and "depth" counts root as 1,
//but since "depth" is the depth of the ancestor of x, i == depth
depth > h_alpha(tree_size)){
-
+
//Find the first non height-balanced node
//as described in the section 4.2 of the paper.
//This method is the alternative method described