mirror of
https://github.com/boostorg/intrusive.git
synced 2025-08-03 22:44:43 +02:00
Boost 1.40 merge from trunk
[SVN r55023]
This commit is contained in:
@@ -1,10 +1,17 @@
|
|||||||
|
#----------------------------------------------------------------------------
|
||||||
|
# This file was automatically generated from the original CMakeLists.txt file
|
||||||
|
# Add a variable to hold the headers for the library
|
||||||
|
set (lib_headers
|
||||||
|
intrusive_ptr.hpp
|
||||||
|
intrusive
|
||||||
|
)
|
||||||
|
|
||||||
# Add a library target to the build system
|
# Add a library target to the build system
|
||||||
boost_library_project(
|
boost_library_project(
|
||||||
intrusive
|
intrusive
|
||||||
# SRCDIRS
|
# SRCDIRS
|
||||||
TESTDIRS test
|
# TESTDIRS
|
||||||
HEADERS intrusive_ptr.hpp intrusive
|
HEADERS ${lib_headers}
|
||||||
# DOCDIRS
|
# DOCDIRS
|
||||||
# DESCRIPTION
|
# DESCRIPTION
|
||||||
MODULARIZED
|
MODULARIZED
|
||||||
|
@@ -55,5 +55,4 @@ boostbook standalone
|
|||||||
<xsl:param>generate.section.toc.level=3
|
<xsl:param>generate.section.toc.level=3
|
||||||
<xsl:param>chunk.first.sections=1
|
<xsl:param>chunk.first.sections=1
|
||||||
<dependency>autodoc
|
<dependency>autodoc
|
||||||
<format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
|
|
||||||
;
|
;
|
||||||
|
@@ -3703,6 +3703,15 @@ all the objects to be inserted in intrusive containers in containers like `std::
|
|||||||
|
|
||||||
[section:release_notes Release Notes]
|
[section:release_notes Release Notes]
|
||||||
|
|
||||||
|
[section:release_notes_boost_1_40_00 Boost 1.40 Release]
|
||||||
|
|
||||||
|
* Code cleanup in tree_algorithms.hpp and avl_tree_algorithms.hpp
|
||||||
|
* Fixed bug
|
||||||
|
[@https://svn.boost.org/trac/boost/ticket/3164 #3164].
|
||||||
|
|
||||||
|
[endsect]
|
||||||
|
|
||||||
|
|
||||||
[section:release_notes_boost_1_39_00 Boost 1.39 Release]
|
[section:release_notes_boost_1_39_00 Boost 1.39 Release]
|
||||||
|
|
||||||
* Optimized `list::merge` and `slist::merge`
|
* Optimized `list::merge` and `slist::merge`
|
||||||
|
@@ -34,7 +34,7 @@ class MyClass : public avl_set_base_hook<optimize_size<true> >
|
|||||||
friend bool operator> (const MyClass &a, const MyClass &b)
|
friend bool operator> (const MyClass &a, const MyClass &b)
|
||||||
{ return a.int_ > b.int_; }
|
{ return a.int_ > b.int_; }
|
||||||
friend bool operator== (const MyClass &a, const MyClass &b)
|
friend bool operator== (const MyClass &a, const MyClass &b)
|
||||||
{ return a.int_ < b.int_; }
|
{ return a.int_ == b.int_; }
|
||||||
};
|
};
|
||||||
|
|
||||||
//Define an avl_set using the base hook that will store values in reverse order
|
//Define an avl_set using the base hook that will store values in reverse order
|
||||||
|
@@ -34,7 +34,7 @@ class MyClass : public set_base_hook<optimize_size<true> >
|
|||||||
friend bool operator> (const MyClass &a, const MyClass &b)
|
friend bool operator> (const MyClass &a, const MyClass &b)
|
||||||
{ return a.int_ > b.int_; }
|
{ return a.int_ > b.int_; }
|
||||||
friend bool operator== (const MyClass &a, const MyClass &b)
|
friend bool operator== (const MyClass &a, const MyClass &b)
|
||||||
{ return a.int_ < b.int_; }
|
{ return a.int_ == b.int_; }
|
||||||
};
|
};
|
||||||
|
|
||||||
//Define a set using the base hook that will store values in reverse order
|
//Define a set using the base hook that will store values in reverse order
|
||||||
|
@@ -33,7 +33,7 @@ class MyClass : public bs_set_base_hook<>
|
|||||||
friend bool operator> (const MyClass &a, const MyClass &b)
|
friend bool operator> (const MyClass &a, const MyClass &b)
|
||||||
{ return a.int_ > b.int_; }
|
{ return a.int_ > b.int_; }
|
||||||
friend bool operator== (const MyClass &a, const MyClass &b)
|
friend bool operator== (const MyClass &a, const MyClass &b)
|
||||||
{ return a.int_ < b.int_; }
|
{ return a.int_ == b.int_; }
|
||||||
};
|
};
|
||||||
|
|
||||||
//Define an sg_set using the base hook that will store values in reverse order
|
//Define an sg_set using the base hook that will store values in reverse order
|
||||||
|
@@ -36,7 +36,7 @@ class MyClass
|
|||||||
friend bool operator> (const MyClass &a, const MyClass &b)
|
friend bool operator> (const MyClass &a, const MyClass &b)
|
||||||
{ return a.int_ > b.int_; }
|
{ return a.int_ > b.int_; }
|
||||||
friend bool operator== (const MyClass &a, const MyClass &b)
|
friend bool operator== (const MyClass &a, const MyClass &b)
|
||||||
{ return a.int_ < b.int_; }
|
{ return a.int_ == b.int_; }
|
||||||
};
|
};
|
||||||
|
|
||||||
//Define a set using the base hook that will store values in reverse order
|
//Define a set using the base hook that will store values in reverse order
|
||||||
|
@@ -1,23 +0,0 @@
|
|||||||
# Boost Intrusive Library Test Jamfile
|
|
||||||
# (C) Copyright Ion Gaztanaga 2006.
|
|
||||||
# Use, modification and distribution are subject to the
|
|
||||||
# Boost Software License, Version 1.0. (See accompanying file
|
|
||||||
# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
|
|
||||||
# Adapted from John Maddock's TR1 Jamfile.v2
|
|
||||||
# Copyright John Maddock 2005.
|
|
||||||
# Use, modification and distribution are subject to the
|
|
||||||
# Boost Software License, Version 1.0. (See accompanying file
|
|
||||||
# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
|
|
||||||
# this rule enumerates through all the sources and invokes
|
|
||||||
# the run rule for each source, the result is a list of all
|
|
||||||
# the run rules, which we can pass on to the test_suite rule:
|
|
||||||
|
|
||||||
file(GLOB SRCFILES RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} *.cpp)
|
|
||||||
|
|
||||||
foreach(testfile ${SRCFILES})
|
|
||||||
get_filename_component(testname ${testfile} NAME_WE)
|
|
||||||
boost_test_run(${testname})
|
|
||||||
endforeach()
|
|
||||||
|
|
@@ -132,6 +132,7 @@ int main( int, char* [] )
|
|||||||
test_main_template<boost::intrusive::smart_ptr<void>, false>()();
|
test_main_template<boost::intrusive::smart_ptr<void>, false>()();
|
||||||
test_main_template<void*, true>()();
|
test_main_template<void*, true>()();
|
||||||
test_main_template<boost::intrusive::smart_ptr<void>, true>()();
|
test_main_template<boost::intrusive::smart_ptr<void>, true>()();
|
||||||
|
|
||||||
return boost::report_errors();
|
return boost::report_errors();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user