|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r81906 - in trunk: boost/heap boost/heap/detail libs/heap/test
From: tim_at_[hidden]
Date: 2012-12-13 13:09:12
Author: timblechmann
Date: 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
New Revision: 81906
URL: http://svn.boost.org/trac/boost/changeset/81906
Log:
heap: use new c++11 feature tests
Text files modified:
trunk/boost/heap/binomial_heap.hpp | 4 ++--
trunk/boost/heap/d_ary_heap.hpp | 4 ++--
trunk/boost/heap/detail/mutable_heap.hpp | 2 +-
trunk/boost/heap/detail/stable_heap.hpp | 10 +++++-----
trunk/boost/heap/fibonacci_heap.hpp | 4 ++--
trunk/boost/heap/pairing_heap.hpp | 4 ++--
trunk/boost/heap/priority_queue.hpp | 2 +-
trunk/boost/heap/skew_heap.hpp | 6 +++---
trunk/libs/heap/test/common_heap_tests.hpp | 8 ++++----
9 files changed, 22 insertions(+), 22 deletions(-)
Modified: trunk/boost/heap/binomial_heap.hpp
==============================================================================
--- trunk/boost/heap/binomial_heap.hpp (original)
+++ trunk/boost/heap/binomial_heap.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -62,7 +62,7 @@
base_type(arg)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
type(type const & rhs):
base_type(rhs), allocator_type(rhs)
{}
@@ -246,7 +246,7 @@
return *this;
}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
/// \copydoc boost::heap::priority_queue::priority_queue(priority_queue &&)
binomial_heap(binomial_heap && rhs):
super_t(std::move(rhs)), top_element(rhs.top_element)
Modified: trunk/boost/heap/d_ary_heap.hpp
==============================================================================
--- trunk/boost/heap/d_ary_heap.hpp (original)
+++ trunk/boost/heap/d_ary_heap.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -155,7 +155,7 @@
super_t(rhs), q_(rhs.q_)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
d_ary_heap(d_ary_heap && rhs):
super_t(std::move(rhs)), q_(std::move(rhs.q_))
{}
@@ -524,7 +524,7 @@
super_t(rhs)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
/// \copydoc boost::heap::priority_queue::priority_queue(priority_queue &&)
d_ary_heap(d_ary_heap && rhs):
super_t(std::move(rhs))
Modified: trunk/boost/heap/detail/mutable_heap.hpp
==============================================================================
--- trunk/boost/heap/detail/mutable_heap.hpp (original)
+++ trunk/boost/heap/detail/mutable_heap.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -146,7 +146,7 @@
return *this;
}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
priority_queue_mutable_wrapper (priority_queue_mutable_wrapper && rhs):
q_(std::move(rhs.q_))
{
Modified: trunk/boost/heap/detail/stable_heap.hpp
==============================================================================
--- trunk/boost/heap/detail/stable_heap.hpp (original)
+++ trunk/boost/heap/detail/stable_heap.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -34,7 +34,7 @@
size_(0)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
size_holder(size_holder && rhs):
size_(rhs.size_)
{
@@ -92,7 +92,7 @@
size_holder(void)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
size_holder(size_holder && rhs)
{}
@@ -166,7 +166,7 @@
#endif
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
heap_base(heap_base && rhs):
#ifndef BOOST_MSVC
Cmp(std::move(static_cast<Cmp&>(rhs))),
@@ -210,7 +210,7 @@
return val;
}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
T && make_node(T && val)
{
return std::forward<T>(val);
@@ -300,7 +300,7 @@
counter_(0)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
heap_base(heap_base && rhs):
#ifndef BOOST_MSVC
Cmp(std::move(static_cast<Cmp&>(rhs))),
Modified: trunk/boost/heap/fibonacci_heap.hpp
==============================================================================
--- trunk/boost/heap/fibonacci_heap.hpp (original)
+++ trunk/boost/heap/fibonacci_heap.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -63,7 +63,7 @@
base_type(arg)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
type(type && rhs):
base_type(std::move(static_cast<base_type&>(rhs))),
allocator_type(std::move(static_cast<allocator_type&>(rhs)))
@@ -229,7 +229,7 @@
size_holder::set_size(rhs.size());
}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
/// \copydoc boost::heap::priority_queue::priority_queue(priority_queue &&)
fibonacci_heap(fibonacci_heap && rhs):
super_t(std::move(rhs)), top_element(rhs.top_element)
Modified: trunk/boost/heap/pairing_heap.hpp
==============================================================================
--- trunk/boost/heap/pairing_heap.hpp (original)
+++ trunk/boost/heap/pairing_heap.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -63,7 +63,7 @@
base_type(arg)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
type(type const & rhs):
base_type(rhs), allocator_type(rhs)
{}
@@ -241,7 +241,7 @@
size_holder::set_size(rhs.get_size());
}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
/// \copydoc boost::heap::priority_queue::priority_queue(priority_queue &&)
pairing_heap(pairing_heap && rhs):
super_t(std::move(rhs)), root(rhs.root)
Modified: trunk/boost/heap/priority_queue.hpp
==============================================================================
--- trunk/boost/heap/priority_queue.hpp (original)
+++ trunk/boost/heap/priority_queue.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -123,7 +123,7 @@
super_t(rhs), q_(rhs.q_)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
/**
* \b Effects: C++11-style move constructor.
*
Modified: trunk/boost/heap/skew_heap.hpp
==============================================================================
--- trunk/boost/heap/skew_heap.hpp (original)
+++ trunk/boost/heap/skew_heap.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -84,7 +84,7 @@
children.assign(0);
}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
skew_heap_node(value_type && v):
value(v)
{
@@ -199,7 +199,7 @@
base_type(arg)
{}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
type(type && rhs):
base_type(std::move(static_cast<base_type&>(rhs))),
allocator_type(std::move(static_cast<allocator_type&>(rhs)))
@@ -388,7 +388,7 @@
return *this;
}
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
/// \copydoc boost::heap::priority_queue::priority_queue(priority_queue &&)
skew_heap(skew_heap && rhs):
super_t(std::move(rhs)), root(rhs.root)
Modified: trunk/libs/heap/test/common_heap_tests.hpp
==============================================================================
--- trunk/libs/heap/test/common_heap_tests.hpp (original)
+++ trunk/libs/heap/test/common_heap_tests.hpp 2012-12-13 13:09:10 EST (Thu, 13 Dec 2012)
@@ -68,7 +68,7 @@
q.push(data[i]);
}
-#if defined(BOOST_HAS_RVALUE_REFS) && !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
template <typename pri_queue, typename data_container>
void fill_emplace_q(pri_queue & q, data_container const & data)
{
@@ -108,7 +108,7 @@
template <typename pri_queue>
void pri_queue_test_emplace(void)
{
-#if defined(BOOST_HAS_RVALUE_REFS) && !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
for (int i = 0; i != test_size; ++i)
{
pri_queue q;
@@ -173,7 +173,7 @@
template <typename pri_queue>
void pri_queue_test_moveconstructor(void)
{
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
pri_queue q;
test_data data = make_test_data(test_size);
fill_q(q, data);
@@ -188,7 +188,7 @@
template <typename pri_queue>
void pri_queue_test_move_assignment(void)
{
-#ifdef BOOST_HAS_RVALUE_REFS
+#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
pri_queue q;
test_data data = make_test_data(test_size);
fill_q(q, data);
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk