Rework as esp-idf component

CMakeLists.txt

@@ -3,6 +3,8 @@
 # Distributed under the Boost Software License, Version 1.0.
 # https://www.boost.org/LICENSE_1_0.txt
 
+if(NOT DEFINED IDF_TARGET)
+
 cmake_minimum_required(VERSION 3.5...3.16)
 
 project(boost_range VERSION "${BOOST_SUPERPROJECT_VERSION}" LANGUAGES CXX)
@@ -39,3 +41,33 @@ if(BUILD_TESTING AND EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/test/CMakeLists.txt")
 
 endif()
 
+else()
+
+FILE(GLOB_RECURSE headers include/*.h include/*.hpp)
+
+idf_component_register(
+    SRCS
+        ${headers}
+    INCLUDE_DIRS
+        include
+    REQUIRES
+        boost_array
+        boost_assert
+        boost_concept_check
+        boost_config
+        boost_container_hash
+        boost_conversion
+        boost_core
+        boost_detail
+        boost_iterator
+        boost_mpl
+        boost_optional
+        boost_preprocessor
+        boost_regex
+        boost_static_assert
+        boost_tuple
+        boost_type_traits
+        boost_utility
+)
+
+endif()

doc/reference/algorithm_ext/is_sorted.qbk

@@ -19,11 +19,9 @@ bool is_sorted(const SinglePassRange& rng, BinaryPredicate pred);
 
 `is_sorted` determines if a range is sorted.
 For the non-predicate version the return value is `true` if and only if for
-each adjacent elements `[x, y]` the expression `y < x` is `false` (i.e.,
-`x <= y`), or if the number of elements is zero or one.
+each adjacent elements `[x,y]` the expression `x < y` is `true`.
 For the predicate version the return value is `true` is and only if for each
-adjacent elements `[x, y]` the expression `pred(y, x)` is `false`, or if the
-number of elements is zero or one.
+adjacent elements `[x,y]` the expression `pred(x,y)` is `true`.
 
 [heading Definition]
 

include/boost/range/detail/any_iterator_buffer.hpp

@@ -13,7 +13,7 @@
 #include <boost/array.hpp>
 #include <boost/assert.hpp>
 #include <boost/static_assert.hpp>
-#include <boost/core/noncopyable.hpp>
+#include <boost/noncopyable.hpp>
 
 namespace boost
 {

include/boost/range/mfc.hpp

@@ -292,8 +292,11 @@ namespace boost { namespace range_detail_microsoft {
         struct meta
         {
             typedef list_iterator<X, ::CObject *> mutable_iterator;
-            // const CObList and const CPtrList both return a value (and probably always will)
+    #if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+            typedef list_iterator<X const, ::CObject const *> const_iterator;
+    #else
             typedef list_iterator<X const, ::CObject const * const, ::CObject const * const> const_iterator;
+    #endif
         };
     };
 
@@ -306,8 +309,11 @@ namespace boost { namespace range_detail_microsoft {
         struct meta
         {
             typedef list_iterator<X, void *> mutable_iterator;
-            // const CObList and const CPtrList both return a value (and probably always will)
+    #if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+            typedef list_iterator<X const, void const *> const_iterator;
+    #else
             typedef list_iterator<X const, void const * const, void const * const> const_iterator;
+    #endif
         };
     };