Merge include + doc fixes to master for 1.72 release

Algorithm: Merge example fixes master for 1.72.0
Merge bug fixes to master for 1.71
2019-12-03 16:53:16 -08:00 · 2019-12-03 07:48:39 -08:00 · 2019-07-10 15:14:08 -07:00 · 2018-12-04 09:35:03 -08:00 · 2018-07-31 22:57:40 -07:00 · 2018-07-04 11:27:27 -07:00
51 changed files with 347 additions and 1307 deletions
--- a/.travis.yml
+++ b/.travis.yml
@ -1,193 +1,171 @@
-# Copyright 2016 - 2018 Peter Dimov
+# Copyright 2016, 2017, 2018 Peter Dimov
 # Copyright 2018 T. Zachary Laine
-# Copyright 2017 - 2019 James E. King III
 # Distributed under the Boost Software License, Version 1.0.
 # (See accompanying file LICENSE_1_0.txt or copy at http://boost.org/LICENSE_1_0.txt)

-#
-# Generic Travis CI build script for boostorg repositories
-# See: https://github.com/boostorg/boost-ci
-#
-# Instructions for customizing this script for your library:
-#
-# 1. Customize the compilers and language levels you want in the 'jobs'.
-# 2. If you have more than include/, src/, test/, example/, examples/, or
-#    tools/ directories, modify your Travis CI project and add the environment
-#    variable DEPINST.  For example if your build uses code in "bench/" and
-#    "fog/" directories, then set DEPINST to the following:
-#        --include bench --include fog
-# 3. If you want to enable Coverity Scan, you need to provide the environment
-#    variables COVERITY_SCAN_TOKEN and COVERITY_SCAN_NOTIFICATION_EMAIL in
-#    your github settings.
-# 4. Enable pull request builds in your boostorg/<library> account.
-#
-# That's it - the scripts will do everything else for you.
-
-dist: xenial
 language: cpp

-env:
-  global:
-  # see: http://www.boost.org/build/doc/html/bbv2/overview/invocation.html#bbv2.overview.invocation.properties
-  # to use the default for a given environment, comment it out; recommend you build debug and release however..
-  # - B2_ADDRESS_MODEL=address-model=64,32
-  # - B2_LINK=link=shared,static
-  # - B2_THREADING=threading=multi,single
-    - B2_VARIANT=variant=release,debug
-
-install:
-  - git clone https://github.com/boostorg/boost-ci.git boost-ci
-  - cp -pr boost-ci/ci boost-ci/.codecov.yml .
-  - source ci/travis/install.sh
-
-addons:
-  apt:
-    packages:
-      - binutils-gold
-      - gdb
-      - libc6-dbg
+sudo: false

 branches:
  only:
    - master
    - develop
-    - bugfix/*
-    - feature/*
-    - fix/*
-    - pr/*
+    - /feature\/.*/

-script:
-  - cd $BOOST_ROOT/libs/$SELF
-  - ci/travis/build.sh
+env:
+  matrix:
+    - BOGUS_JOB=true

-#
-# Default toolsets in Ubuntu
-#
-#       trusty xenial bionic
-#        14.04  16.04  18.04
-#       ------ ------ ------
-# clang    3.4    3.8    6.0
-#   gcc  4.8.2  5.3.1  7.3.0
-#
+matrix:

-anchors:
-  clang-38: &clang-38 { apt: { packages: [ "clang-3.8",
-                                           "libstdc++-6-dev" ], sources: [ "llvm-toolchain-xenial-3.8",
-                                                                           "ubuntu-toolchain-r-test"   ] } }
-  clang-4:  &clang-4  { apt: { packages: [ "clang-4.0",
-                                           "libstdc++-6-dev" ], sources: [ "llvm-toolchain-xenial-4.0",
-                                                                           "ubuntu-toolchain-r-test"   ] } }
-  clang-5:  &clang-5  { apt: { packages: [ "clang-5.0",
-                                           "libstdc++-7-dev" ], sources: [ "llvm-toolchain-xenial-5.0",
-                                                                           "ubuntu-toolchain-r-test"   ] } }
-  clang-6:  &clang-6  { apt: { packages: [ "clang-6.0",
-                                           "libc6-dbg",
-                                           "libc++-dev",
-                                           "libstdc++-8-dev" ], sources: [ "llvm-toolchain-xenial-6.0",
-                                                                           "ubuntu-toolchain-r-test"   ] } }
-  clang-7:  &clang-7  { apt: { packages: [ "clang-7",
-                                           "libc6-dbg",
-                                           "libc++-dev",
-                                           "libstdc++-8-dev" ], sources: [ "llvm-toolchain-xenial-7",
-                                                                           "ubuntu-toolchain-r-test"   ] } }
-  clang-8:  &clang-8  { apt: { packages: [ "clang-8",
-                                           "libc6-dbg",
-                                           "libc++-dev",
-                                           "libstdc++-8-dev" ], sources: [ "llvm-toolchain-xenial-8",
-                                                                           "ubuntu-toolchain-r-test"   ] } }
-  gcc-48:   &gcc-48   { apt: { packages: [ "g++-4.8"         ]                                           } }
-  gcc-49:   &gcc-49   { apt: { packages: [ "g++-4.9"         ]                                           } }
-  gcc-5:    &gcc-5    { apt: { packages: [ "g++-5"           ]                                           } }
-  gcc-6:    &gcc-6    { apt: { packages: [ "g++-6"           ], sources: [ "ubuntu-toolchain-r-test"   ] } }
-  gcc-7:    &gcc-7    { apt: { packages: [ "g++-7"           ], sources: [ "ubuntu-toolchain-r-test"   ] } }
-  gcc-8:    &gcc-8    { apt: { packages: [ "g++-8"           ], sources: [ "ubuntu-toolchain-r-test"   ] } }
-
-jobs:
-  allow_failures:
-    - env:
-      - COPY="all the environment settings from your job"
+  exclude:
+    - env: BOGUS_JOB=true

  include:
-    # libstdc++
-    - { os: "linux", env: [ "B2_TOOLSET=gcc-4.8",     "B2_CXXSTD=03,11"    ], addons: *gcc-48    }
-    - { os: "linux", env: [ "B2_TOOLSET=gcc-4.9",     "B2_CXXSTD=03,11"    ], addons: *gcc-49    }
-    - { os: "linux", env: [ "B2_TOOLSET=gcc-5",       "B2_CXXSTD=11"       ], addons: *gcc-5     }
-    - { os: "linux", env: [ "B2_TOOLSET=gcc-6",       "B2_CXXSTD=11,14"    ], addons: *gcc-6     }
-    - { os: "linux", env: [ "B2_TOOLSET=gcc-7",       "B2_CXXSTD=11,14,17" ], addons: *gcc-7     }
-    - { os: "linux", env: [ "B2_TOOLSET=gcc-8",       "B2_CXXSTD=14,17,2a" ], addons: *gcc-8     }
-    - { os: "linux", env: [ "B2_TOOLSET=clang-3.8",   "B2_CXXSTD=03,11,14" ], addons: *clang-38  }
-    - { os: "linux", env: [ "B2_TOOLSET=clang-4.0",   "B2_CXXSTD=11,14"    ], addons: *clang-4   }
-    - { os: "linux", env: [ "B2_TOOLSET=clang-5.0",   "B2_CXXSTD=11,14,17" ], addons: *clang-5   }
-    - { os: "linux", env: [ "B2_TOOLSET=clang-6.0",   "B2_CXXSTD=14,17,2a" ], addons: *clang-6   }
-    - { os: "linux", env: [ "B2_TOOLSET=clang-7",     "B2_CXXSTD=14,17,2a" ], addons: *clang-7   }
-    - { os: "linux", env: [ "B2_TOOLSET=clang-8",     "B2_CXXSTD=14,17,2a" ], addons: *clang-8   }
-
-    # libc++
-    - { os: "linux", env: [ "B2_TOOLSET=clang-6.0",   "B2_CXXSTD=03,11,14,17,2a",
-                            "B2_CXXFLAGS=-stdlib=libc++"                   ], addons: *clang-6   }
-    - { os: "osx"  , env: [ "B2_TOOLSET=clang",       "B2_CXXSTD=03,11,17" ]                     }
-
-    # to enable Intel ICC define INTEL_ICC_SERIAL_NUMBER and the following:
-    # - { os: "linux", env: [ "B2_TOOLSET=intel-linux", "B2_CXXSTD=11,14,17" ], addons: *gcc-7,
-    #     script: cd $BOOST_ROOT/libs/$SELF && ci/travis/intelicc.sh                               }
+    - os: linux
+      env: TOOLSET=gcc COMPILER=g++ CXXSTD=11

    - os: linux
-      env:
-        - COMMENT=codecov.io
-        - B2_TOOLSET=03,11,14
-        - B2_TOOLSET=gcc-8
-        - B2_DEFINES="define=BOOST_NO_STRESS_TEST=1"
-      addons: *gcc-8
-      script:
-        - pushd /tmp && git clone https://github.com/linux-test-project/lcov.git && export PATH=/tmp/lcov/bin:$PATH && which lcov && lcov --version && popd
-        - cd $BOOST_ROOT/libs/$SELF
-        - ci/travis/codecov.sh
+      env: TOOLSET=gcc COMPILER=g++-4.7 CXXSTD=11
+      addons:
+        apt:
+          packages:
+            - g++-4.7
+          sources:
+            - ubuntu-toolchain-r-test

    - os: linux
-      env:
-        - COMMENT=cppcheck
-      script:
-        - cd $BOOST_ROOT/libs/$SELF
-        - ci/travis/cppcheck.sh
+      env: TOOLSET=gcc COMPILER=g++-4.8 CXXSTD=11
+      addons:
+        apt:
+          packages:
+            - g++-4.8
+          sources:
+            - ubuntu-toolchain-r-test

    - os: linux
-      env:
-        - COMMENT=ubsan
-        - B2_VARIANT=variant=debug
-        - B2_TOOLSET=gcc-8
-        - B2_CXXSTD=03,11,14,17,2a
-        - B2_DEFINES="define=BOOST_NO_STRESS_TEST=1"
-        - B2_CXXFLAGS="cxxflags=-fno-omit-frame-pointer cxxflags=-fsanitize=undefined cxxflags=-fno-sanitize-recover=all"
-        - B2_LINKFLAGS="linkflags=-fsanitize=undefined linkflags=-fno-sanitize-recover=all linkflags=-fuse-ld=gold"
-        - UBSAN_OPTIONS=print_stacktrace=1
-      addons: *gcc-8
+      env: TOOLSET=gcc COMPILER=g++-4.9 CXXSTD=11
+      addons:
+        apt:
+          packages:
+            - g++-4.9
+          sources:
+            - ubuntu-toolchain-r-test

    - os: linux
-      env:
-        - COMMENT=valgrind
-        - B2_TOOLSET=clang-6.0
-        - B2_CXXSTD=03,11,14,17,2a
-        - B2_DEFINES="define=BOOST_NO_STRESS_TEST=1"
-        - B2_VARIANT=variant=debug
-        - B2_TESTFLAGS=testing.launcher=valgrind
-        - VALGRIND_OPTS=--error-exitcode=1
-      addons: *clang-6
-      script:
-        - cd $BOOST_ROOT/libs/$SELF
-        - ci/travis/valgrind.sh
+      env: TOOLSET=gcc COMPILER=g++-5 CXXSTD=11,14,1z
+      addons:
+        apt:
+          packages:
+            - g++-5
+          sources:
+            - ubuntu-toolchain-r-test

-    #################### Jobs to run on pushes to master, develop ###################
-
-    # Coverity Scan
    - os: linux
-      if: (env(COVERITY_SCAN_NOTIFICATION_EMAIL) IS present) AND (branch IN (develop, master)) AND (type IN (cron, push))
-      env:
-        - COMMENT="Coverity Scan"
-        - B2_TOOLSET=clang
-      script:
-        - cd $BOOST_ROOT/libs/$SELF
-        - ci/travis/coverity.sh
+      env: TOOLSET=gcc COMPILER=g++-6 CXXSTD=11,14,1z
+      addons:
+        apt:
+          packages:
+            - g++-6
+          sources:
+            - ubuntu-toolchain-r-test

-notifications:
-  email:
-    false
+    - os: linux
+      env: TOOLSET=gcc COMPILER=g++-6 CXXSTD=11,14,1z CXXSTD_DIALECT=cxxstd-dialect=gnu
+      addons:
+        apt:
+          packages:
+            - g++-6
+          sources:
+            - ubuntu-toolchain-r-test
+
+    - os: linux
+      env: TOOLSET=gcc COMPILER=g++-7 CXXSTD=11,14,17
+      addons:
+        apt:
+          packages:
+            - g++-7
+          sources:
+            - ubuntu-toolchain-r-test
+
+    - os: linux
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=11
+
+    - os: linux
+      compiler: clang++-libc++
+      env: TOOLSET=clang COMPILER=clang++-libc++ CXXSTD=11,14,1z
+      addons:
+        apt:
+          packages:
+            - libc++-dev
+
+    - os: osx
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=11,14,1z
+      osx_image: xcode9.1
+
+    - os: osx
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=11,14,1z
+      osx_image: xcode9
+
+    - os: osx
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=11,14,1z
+      osx_image: xcode8.3
+
+    - os: osx
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=11,14,1z
+      osx_image: xcode8
+
+    - os: osx
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=11,14,1z
+      osx_image: xcode7.3
+
+    - os: osx
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=11,14,1z
+      osx_image: xcode6.4
+
+install:
+  - BOOST_BRANCH=develop && [ "$TRAVIS_BRANCH" == "master" ] && BOOST_BRANCH=master || true
+  - cd ..
+  - git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+  - cd boost-root
+  - git submodule update --init tools/build
+  - git submodule update --init libs/config
+  - git submodule update --init libs/predef
+  - git submodule update --init libs/core
+  - git submodule update --init libs/detail
+  - git submodule update --init libs/range
+  - git submodule update --init libs/assert
+  - git submodule update --init libs/array
+  - git submodule update --init libs/type_traits
+  - git submodule update --init libs/static_assert
+  - git submodule update --init libs/iterator
+  - git submodule update --init libs/preprocessor
+  - git submodule update --init libs/mpl
+  - git submodule update --init libs/smart_ptr
+  - git submodule update --init libs/callable_traits
+  - git submodule update --init libs/type_index
+  - git submodule update --init libs/exception
+  - git submodule update --init libs/throw_exception
+  - git submodule update --init libs/utility
+  - git submodule update --init libs/bind
+  - git submodule update --init libs/ratio
+  - git submodule update --init libs/function
+  - git submodule update --init libs/integer
+  - git submodule update --init libs/numeric
+  - git submodule update --init libs/move
+  - git submodule update --init libs/container_hash
+  - git submodule update --init libs/io
+  - git submodule update --init libs/concept_check
+  - git submodule update --init libs/test
+  - git submodule update --init libs/timer
+  - git submodule update --init libs/chrono
+  - git submodule update --init libs/system
+  - cp -r $TRAVIS_BUILD_DIR/* libs/algorithm
+  - ./bootstrap.sh
+  - ./b2 headers
+ 
+script:
+  - |-
+    echo "using $TOOLSET : : $COMPILER ;" > ~/user-config.jam
+  - ./b2 -j3 libs/algorithm/test toolset=$TOOLSET cxxstd=$CXXSTD $CXXSTD_DIALECT
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@ -1,73 +0,0 @@
-# Generated by `boostdep --cmake algorithm`
-# Copyright 2020 Peter Dimov
-# 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_algorithm VERSION "${BOOST_SUPERPROJECT_VERSION}" LANGUAGES CXX)
-
-add_library(boost_algorithm INTERFACE)
-add_library(Boost::algorithm ALIAS boost_algorithm)
-
-target_include_directories(boost_algorithm INTERFACE include)
-
-target_link_libraries(boost_algorithm
-  INTERFACE
-    Boost::array
-    Boost::assert
-    Boost::bind
-    Boost::concept_check
-    Boost::config
-    Boost::core
-    Boost::exception
-    Boost::function
-    Boost::iterator
-    Boost::mpl
-    Boost::range
-    Boost::regex
-    Boost::static_assert
-    Boost::throw_exception
-    Boost::tuple
-    Boost::type_traits
-    Boost::unordered
-)
-
-if(BUILD_TESTING AND EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/test/CMakeLists.txt")
-
-  add_subdirectory(test)
-
-endif()
-
-else()
-
-FILE(GLOB_RECURSE headers include/*.h include/*.hpp)
-
-idf_component_register(
-    SRCS
-        ${headers}
-    INCLUDE_DIRS
-        include
-    REQUIRES
-        boost_array
-        boost_assert
-        boost_bind
-        boost_concept_check
-        boost_config
-        boost_core
-        boost_exception
-        boost_function
-        boost_iterator
-        boost_mpl
-        boost_range
-        boost_regex
-        boost_static_assert
-        boost_throw_exception
-        boost_tuple
-        boost_type_traits
-        boost_unordered
-)
-
-endif()
--- a/11
+++ b/11
@ -1,11 +0,0 @@
-#  Boost.Algorithm Library Jamfile
-#
-#  Copyright (c) 2018 James E. King III
-#
-#  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)
-
-# please order by name to ease maintenance
-build-project example ;
-build-project test ;
--- a/23
+++ b/23
@ -1,23 +0,0 @@
-Boost Software License - Version 1.0 - August 17th, 2003
-
-Permission is hereby granted, free of charge, to any person or organization
-obtaining a copy of the software and accompanying documentation covered by
-this license (the "Software") to use, reproduce, display, distribute,
-execute, and transmit the Software, and to prepare derivative works of the
-Software, and to permit third-parties to whom the Software is furnished to
-do so, all subject to the following:
-
-The copyright notices in the Software and this entire statement, including
-the above license grant, this restriction and the following disclaimer,
-must be included in all copies of the Software, in whole or in part, and
-all derivative works of the Software, unless such copies or derivative
-works are solely in the form of machine-executable object code generated by
-a source language processor.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
-SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
-FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
-ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-DEALINGS IN THE SOFTWARE.
--- a/README.md
+++ b/README.md
@ -1,35 +0,0 @@
-Algorithm, part of collection of the [Boost C++ Libraries](http://github.com/boostorg), is a collection of general purpose algorithms.
-
-### License
-
-Distributed under the [Boost Software License, Version 1.0](http://www.boost.org/LICENSE_1_0.txt).
-
-### Properties
-
-* C++03
-* Header-only
-
-### Build Status
-
-Branch          | Travis | Appveyor | Coverity Scan | codecov.io | Deps | Docs | Tests |
-:-------------: | ------ | -------- | ------------- | ---------- | ---- | ---- | ----- |
-[`master`](https://github.com/boostorg/algorithm/tree/master) | [![Build Status](https://travis-ci.org/boostorg/algorithm.svg?branch=master)](https://travis-ci.org/boostorg/algorithm) | [![Build status](https://ci.appveyor.com/api/projects/status/FIXME/branch/master?svg=true)](https://ci.appveyor.com/project/USER/PROJECT/branch/master) | [![Coverity Scan Build Status](https://scan.coverity.com/projects/99999/badge.svg)](https://scan.coverity.com/projects/boostorg-algorithm) | [![codecov](https://codecov.io/gh/boostorg/algorithm/branch/master/graph/badge.svg)](https://codecov.io/gh/boostorg/algorithm/branch/master)| [![Deps](https://img.shields.io/badge/deps-master-brightgreen.svg)](https://pdimov.github.io/boostdep-report/master/algorithm.html) | [![Documentation](https://img.shields.io/badge/docs-master-brightgreen.svg)](http://www.boost.org/doc/libs/master/doc/html/algorithm.html) | [![Enter the Matrix](https://img.shields.io/badge/matrix-master-brightgreen.svg)](http://www.boost.org/development/tests/master/developer/algorithm.html)
-[`develop`](https://github.com/boostorg/algorithm/tree/develop) | [![Build Status](https://travis-ci.org/boostorg/algorithm.svg?branch=develop)](https://travis-ci.org/boostorg/algorithm) | [![Build status](https://ci.appveyor.com/api/projects/status/FIXME/branch/develop?svg=true)](https://ci.appveyor.com/project/USER/PROJECT/branch/develop) | [![Coverity Scan Build Status](https://scan.coverity.com/projects/99999/badge.svg)](https://scan.coverity.com/projects/boostorg-algorithm) | [![codecov](https://codecov.io/gh/boostorg/algorithm/branch/develop/graph/badge.svg)](https://codecov.io/gh/boostorg/algorithm/branch/develop) | [![Deps](https://img.shields.io/badge/deps-develop-brightgreen.svg)](https://pdimov.github.io/boostdep-report/develop/algorithm.html) | [![Documentation](https://img.shields.io/badge/docs-develop-brightgreen.svg)](http://www.boost.org/doc/libs/develop/doc/html/algorithm.html) | [![Enter the Matrix](https://img.shields.io/badge/matrix-develop-brightgreen.svg)](http://www.boost.org/development/tests/develop/developer/algorithm.html)
-
-### Directories
-
-| Name        | Purpose                        |
-| ----------- | ------------------------------ |
-| `doc`       | documentation                  |
-| `example`   | examples                       |
-| `include`   | headers                        |
-| `test`      | unit tests                     |
-
-### More information
-
-* [Ask questions](http://stackoverflow.com/questions/ask?tags=c%2B%2B,boost,boost-algorithm)
-* [Report bugs](https://github.com/boostorg/algorithm/issues): Be sure to mention Boost version, platform and compiler you're using. A small compilable code sample to reproduce the problem is always good as well.
-* Submit your patches as pull requests against **develop** branch. Note that by submitting patches you agree to license your modifications under the [Boost Software License, Version 1.0](http://www.boost.org/LICENSE_1_0.txt).
-* Discussions about the library are held on the [Boost developers mailing list](http://www.boost.org/community/groups.html#main). Be sure to read the [discussion policy](http://www.boost.org/community/policy.html) before posting and add the `[algorithm]` tag at the beginning of the subject line.
-
-
--- a/appveyor.yml
+++ b/appveyor.yml
@ -1,24 +1,7 @@
-# Copyright 2016, 2017 Peter Dimov
-# Copyright (C) 2017 - 2019 James E. King III
+# Copyright 2016 Peter Dimov
 # Distributed under the Boost Software License, Version 1.0.
 # (See accompanying file LICENSE_1_0.txt or copy at http://boost.org/LICENSE_1_0.txt)

-#
-# Generic Appveyor build script for boostorg repositories
-# See: https://github.com/boostorg/boost-ci/
-#
-# Instructions for customizing this script for your library:
-#
-# 1. Customize the compilers and language levels you want.
-# 2. If you have more than include/, src/, test/, example/, examples/,
-#    benchmark/ or tools/ directories, set the environment variable DEPINST.
-#    For example if your build uses code in "bench/" and "fog/" directories:
-#      - DEPINST: --include bench --include fog
-# 3. Enable pull request builds in your boostorg/<library> account.
-#
-# That's it - the script will do everything else for you.
-#
-
 version: 1.0.{build}-{branch}

 shallow_clone: true
@ -27,104 +10,84 @@ branches:
  only:
    - master
    - develop
-    - bugfix/*
-    - feature/*
-    - fix/*
-    - pr/*

-matrix:
-  # Adding MAYFAIL to any matrix job allows it to fail but the build stays green:
-  allow_failures:
-    - MAYFAIL: true
+platform:
+  - x64

 environment:
-  global:
-    # see: http://www.boost.org/build/doc/html/bbv2/overview/invocation.html#bbv2.overview.invocation.properties
-    # to use the default for a given environment, comment it out; recommend you build debug and release however:
-    # on Windows it is important to exercise all the possibilities, especially shared vs static, however most
-    # libraries that care about this exercise it in their Jamfiles...
-    # B2_ADDRESS_MODEL: address-model=64,32
-    # B2_LINK: link=shared,static
-    # B2_THREADING: threading=multi,single
-    B2_VARIANT: variant=release,debug
-
  matrix:
-    - FLAVOR: Visual Studio 2017 C++2a Strict
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
-      B2_ADDRESS_MODEL: address-model=64
-      B2_CXXFLAGS: cxxflags=-permissive-
-      B2_CXXSTD: latest # 2a
-      B2_TOOLSET: msvc-14.1
-
-    - FLAVOR: Visual Studio 2017 C++17
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
-      B2_ADDRESS_MODEL: address-model=64
-      B2_CXXSTD: 17
-      B2_TOOLSET: msvc-14.1
-
-    - FLAVOR: Visual Studio 2017 C++14 (Default)
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
-      B2_ADDRESS_MODEL: address-model=64,32
-      B2_TOOLSET: msvc-14.1
-
-    - FLAVOR: Visual Studio 2015 C++14 (Default)
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
-      B2_ADDRESS_MODEL: address-model=64,32
-      B2_TOOLSET: msvc-14.0
-
-    - FLAVOR: Visual Studio 2010, 2012, 2013
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
-      B2_TOOLSET: msvc-10.0,msvc-11.0,msvc-12.0
-
-    - FLAVOR: cygwin (32-bit)
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
-      ADDPATH: C:\cygwin\bin;
-      B2_ADDRESS_MODEL: address-model=32
-      B2_CXXSTD: 03,11
-      # https://github.com/boostorg/test/issues/144
-      B2_DEFINES: define=_POSIX_C_SOURCE=200112L
-      B2_THREADING: threadapi=pthread
-      B2_TOOLSET: gcc
-
-    - FLAVOR: cygwin (64-bit)
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
-      ADDPATH: C:\cygwin64\bin;
-      B2_ADDRESS_MODEL: address-model=64
-      B2_CXXSTD: 11,17
-      # https://github.com/boostorg/test/issues/144
-      B2_DEFINES: define=_POSIX_C_SOURCE=200112L define=__USE_ISOC99
-      B2_THREADING: threadapi=pthread
-      B2_TOOLSET: gcc
-
-    - FLAVOR: mingw32
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
-      ARCH: i686
-      B2_ADDRESS_MODEL: address-model=32
-      B2_CXXSTD: 03,11
-      SCRIPT: ci\appveyor\mingw.bat
-
-    - FLAVOR: mingw64
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
-      ARCH: x86_64
-      B2_ADDRESS_MODEL: address-model=64
-      B2_CXXSTD: 11,17
-      B2_DEFINES: define=__USE_ISOC99
-      SCRIPT: ci\appveyor\mingw.bat
+    - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
+      ARGS: --toolset=msvc-14.1 address-model=64
+    - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
+      ARGS: --toolset=msvc-14.1 address-model=32
+    - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
+      ARGS: --toolset=msvc-14.1 address-model=64 cxxflags=-std:c++latest cxxflags=-permissive-
+    - ARGS: --toolset=msvc-9.0  address-model=32
+    - ARGS: --toolset=msvc-10.0 address-model=32
+    - ARGS: --toolset=msvc-11.0 address-model=32
+    - ARGS: --toolset=msvc-12.0 address-model=32
+    - ARGS: --toolset=msvc-14.0 address-model=32
+    - ARGS: --toolset=msvc-12.0 address-model=64
+    - ARGS: --toolset=msvc-14.0 address-model=64
+    - ARGS: --toolset=msvc-14.0 address-model=64 cxxflags=-std:c++latest
+    - ARGS: --toolset=gcc address-model=64 
+      CXXSTD: 03,11,14,1z
+      PATH: C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin;%PATH%
+    - ARGS: --toolset=gcc address-model=64
+      CXXSTD: 03,11,14,1z
+      PATH: C:\mingw-w64\x86_64-7.2.0-posix-seh-rt_v5-rev1\mingw64\bin;%PATH%
+    - ARGS: --toolset=gcc address-model=32 linkflags=-Wl,-allow-multiple-definition
+      CXXSTD: 03,11,14,1z
+      PATH: C:\MinGW\bin;%PATH%
+    - ARGS: --toolset=gcc address-model=64
+      CXXSTD: 03,11,14,1z
+      PATH: C:\cygwin64\bin;%PATH%
+    - ARGS: --toolset=gcc address-model=32
+      CXXSTD: 03,11,14,1z
+      PATH: C:\cygwin\bin;%PATH%

 install:
-  - set SELF=%APPVEYOR_PROJECT_NAME:-=_%
-  - git clone https://github.com/boostorg/boost-ci.git C:\boost-ci
-  - xcopy /s /e /q /i C:\boost-ci\ci .\ci
-  - ci\appveyor\install.bat
-
+  - cd ..
+  - git clone -b %APPVEYOR_REPO_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+  - cd boost-root
+  - xcopy /s /e /q %APPVEYOR_BUILD_FOLDER% libs\algorithm
+  - git submodule update --init tools/build
+  - git submodule update --init libs/config
+  - git submodule update --init libs/predef
+  - git submodule update --init libs/core
+  - git submodule update --init libs/detail
+  - git submodule update --init libs/range
+  - git submodule update --init libs/assert
+  - git submodule update --init libs/array
+  - git submodule update --init libs/type_traits
+  - git submodule update --init libs/static_assert
+  - git submodule update --init libs/iterator
+  - git submodule update --init libs/preprocessor
+  - git submodule update --init libs/mpl
+  - git submodule update --init libs/smart_ptr
+  - git submodule update --init libs/callable_traits
+  - git submodule update --init libs/type_index
+  - git submodule update --init libs/exception
+  - git submodule update --init libs/throw_exception
+  - git submodule update --init libs/utility
+  - git submodule update --init libs/bind
+  - git submodule update --init libs/ratio
+  - git submodule update --init libs/function
+  - git submodule update --init libs/integer
+  - git submodule update --init libs/numeric
+  - git submodule update --init libs/move
+  - git submodule update --init libs/container_hash
+  - git submodule update --init libs/io
+  - git submodule update --init libs/concept_check
+  - git submodule update --init libs/test
+  - git submodule update --init libs/timer
+  - git submodule update --init libs/chrono
+  - git submodule update --init libs/system
+  - bootstrap
+  - b2 headers
+  
 build: off

 test_script:
-  - set SELF=%APPVEYOR_PROJECT_NAME:-=_%
-  - PATH=%ADDPATH%%PATH%
-  # The definition of B2_TOOLCXX omits B2_CXXSTD= if it was not defined above
-  - IF NOT DEFINED B2_CXXSTD (SET B2_TOOLCXX=toolset=%B2_TOOLSET%) ELSE (SET B2_TOOLCXX=toolset=%B2_TOOLSET% cxxstd=%B2_CXXSTD%)
-  # Echo the complete build command to the build log
-  - IF NOT DEFINED SCRIPT                         (ECHO b2 libs/%SELF:\=/% %B2_TOOLCXX% %B2_CXXFLAGS% %B2_DEFINES% %B2_THREADING% %B2_ADDRESS_MODEL% %B2_LINK% %B2_THREADING% %B2_VARIANT% -j3)
-  # Now go build...
-  - IF DEFINED SCRIPT (call libs\%SELF%\%SCRIPT%) ELSE (b2 libs/%SELF:\=/% %B2_TOOLCXX% %B2_CXXFLAGS% %B2_DEFINES% %B2_THREADING% %B2_ADDRESS_MODEL% %B2_LINK% %B2_THREADING% %B2_VARIANT% -j3)
+  - cd libs\config\test
+  - ..\..\..\b2 -j3 %ARGS% cxxstd=%CXXSTD%
--- a/doc/Jamfile.v2
+++ b/doc/Jamfile.v2
@ -16,18 +16,18 @@ using quickbook ;
 using doxygen ;
 using boostbook ;

-doxygen autodoc 
-    : 
-        [ glob ../../../boost/algorithm/*.hpp 
+doxygen autodoc
+    :
+        [ glob ../../../boost/algorithm/*.hpp
               ../../../boost/algorithm/searching/*.hpp
               ../../../boost/algorithm/cxx11/*.hpp
               ../../../boost/algorithm/cxx14/*.hpp
               ../../../boost/algorithm/cxx17/*.hpp
        ]
-    : 
+    :
       <doxygen:param>"PREDEFINED=\"BOOST_ALGORITHM_DOXYGEN=1\""
       <doxygen:param>WARNINGS=YES # Default NO, but useful to see warnings, especially in a logfile.
-    ; 
+    ;


 xml algorithm : algorithm.qbk ;
@ -36,7 +36,7 @@ boostbook standalone
  :
    algorithm
  :
-    <dependency>autodoc 
+    <dependency>autodoc
    <xsl:param>boost.root=../../../..
    <xsl:param>"boost.doxygen.reftitle=Boost.Algorithms C++ Reference"
    <xsl:param>chapter.autolabel=0
--- a/doc/algorithm.qbk
+++ b/doc/algorithm.qbk
@ -106,50 +106,11 @@ Generate an increasing series
 Apply a functor to the elements of a sequence
 [endsect:for_each_n]

-[section:transform_inclusive_scan transform_inclusive_scan]
-[*[^[link boost.algorithm.transform_inclusive_scan                   transform_inclusive_scan]    ] ]
-Transform each element in a range then combine adjacent elements to create an output range. Inclusive scaning means that the nth input is present in the nth output.
-[endsect:transform_inclusive_scan]
-
-[section:transform_exclusive_scan transform_exclusive_scan]
-[*[^[link boost.algorithm.transform_exclusive_scan                   transform_exclusive_scan]    ] ]
-Transform each element in a range then combine adjacent elements to create an output range. Exclusive scanning means that the nth input is not present in the nth output.
-[endsect:transform_exclusive_scan]
-
 [endsect:CXX17_inner_algorithms]

 [endsect:CXX17]


-[section:Copy Variations on Copy]
-[section:variations_on_copy]
-
-[section:copy_until                copy_until                ]
-[*[^[link header.boost.algorithm.cxx11.copy_if_hpp                   copy_until]                  ] ]
-Copy all the elements from the start of the input range to the output range until the predicate is satisfied
-[endsect:copy_until]
-
-[section:copy_while                copy_while                ]
-[*[^[link header.boost.algorithm.cxx11.copy_if_hpp                   copy_while]                  ] ]
-Copy all the elements from the start of the input range to the output range while the predicate is satisfied
-[endsect:copy_while]
-
-[section:copy_if_until             copy_if_until             ]
-[*[^[link header.boost.algorithm.cxx11.copy_if_hpp                   copy_if_until                ] ]
-Copy all elements that satisfy the element predicate from the start of the input range to the output range until the termination predicate is satisfied
-
-[endsect:copy_if_until]
-
-[section:copy_if_while             copy_if_while             ]
-[*[^[link header.boost.algorithm.cxx11.copy_if_hpp                   copy_if_while                ] ]
-Copy all elements that satisfy the element predicate from the start of the input range to the output range while the termination predicate is satisfied
-
-[endsect:copy_if_while]
-
-[endsect:variations_on_copy]
-[endsect:Copy]
-
-
 [section:Misc Other Algorithms]

 [section:misc_inner_algorithms]
@ -243,6 +204,16 @@ See below

 [include apply_permutation.qbk]

+[section:copy_until                copy_until                ]
+[*[^[link header.boost.algorithm.cxx11.copy_if_hpp                   copy_until]                  ] ]
+Copy all the elements at the start of the input range that do not satisfy the predicate to the output range
+[endsect:copy_until]
+
+[section:copy_while                copy_while                ]
+[*[^[link header.boost.algorithm.cxx11.copy_if_hpp                   copy_while]                  ] ]
+Copy all the elements at the start of the input range that satisfy the predicate to the output range
+[endsect:copy_while]
+
 [section:iota_n                    iota_n                    ]
 [*[^[link boost.algorithm.iota_n                                     iota_n]                      ] ]
 Write a sequence of n increasing values to an output iterator
@ -263,6 +234,8 @@ Raise a value to an integral power ([^constexpr] since C++14)
 * [*[^[link header.boost.algorithm.cxx17.exclusive_scan_hpp            exclusive_scan]              ] ]
 * [*[^[link header.boost.algorithm.cxx17.inclusive_scan_hpp            inclusive_scan]              ] ]
 * [*[^[link header.boost.algorithm.cxx17.reduce_hpp                    reduce]                      ] ]
+* [*[^[link header.boost.algorithm.cxx17.transform_exclusive_scan_hpp  transform_exclusive_scan]    ] ]
+* [*[^[link header.boost.algorithm.cxx17.transform_inclusive_scan_hpp  transform_inclusive_scan]    ] ]
 * [*[^[link header.boost.algorithm.cxx17.transform_reduce_hpp          transform_reduce]            ] ]

 [endsect:not_yet_documented_cxx17_algos]
--- a/doc/apply_permutation.qbk
+++ b/doc/apply_permutation.qbk
@ -16,12 +16,12 @@ The routine `apply_permutation` takes a item sequence and a order sequence. It r
 The routine `apply_reverse_permutation` takes a item sequence and a order sequence. It will reshuffle item sequence according to order sequence. Every value in order sequence means where the item goes to. Order sequence needs to be exactly a permutation of the sequence [0, 1, ... , N], where N is the biggest index in the item sequence (zero-indexed).

 Implementations are based on these articles:
-https://devblogs.microsoft.com/oldnewthing/20170102-00/?p=95095
-https://devblogs.microsoft.com/oldnewthing/20170103-00/?p=95105
-https://devblogs.microsoft.com/oldnewthing/20170104-00/?p=95115
-https://devblogs.microsoft.com/oldnewthing/20170109-00/?p=95145
-https://devblogs.microsoft.com/oldnewthing/20170110-00/?p=95155
-https://devblogs.microsoft.com/oldnewthing/20170111-00/?p=95165
+https://blogs.msdn.microsoft.com/oldnewthing/20170102-00/?p=95095
+https://blogs.msdn.microsoft.com/oldnewthing/20170103-00/?p=95105
+https://blogs.msdn.microsoft.com/oldnewthing/20170104-00/?p=95115
+https://blogs.msdn.microsoft.com/oldnewthing/20170109-00/?p=95145
+https://blogs.msdn.microsoft.com/oldnewthing/20170110-00/?p=95155
+https://blogs.msdn.microsoft.com/oldnewthing/20170111-00/?p=95165

 The routines come in 2 forms; the first one takes two iterators to define the item range and one iterator to define the beginning of index range. The second form takes range to define the item sequence and range to define index sequence.

--- a/include/boost/algorithm/algorithm.hpp
+++ b/include/boost/algorithm/algorithm.hpp
@ -20,7 +20,7 @@
 #include <functional> // for plus and multiplies

 #include <boost/config.hpp>
-#include <boost/core/enable_if.hpp> // for boost::disable_if
+#include <boost/utility/enable_if.hpp> // for boost::disable_if
 #include <boost/type_traits/is_integral.hpp>

 namespace boost { namespace algorithm {
--- a/include/boost/algorithm/apply_permutation.hpp
+++ b/include/boost/algorithm/apply_permutation.hpp
@ -19,6 +19,7 @@
 #define BOOST_ALGORITHM_APPLY_PERMUTATION_HPP

 #include <algorithm>
+#include <type_traits>

 #include <boost/config.hpp>
 #include <boost/range/begin.hpp>
--- a/include/boost/algorithm/clamp.hpp
+++ b/include/boost/algorithm/clamp.hpp
@ -26,14 +26,14 @@
 #include <boost/config.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
-#include <boost/type_traits/type_identity.hpp> // for boost::type_identity
-#include <boost/core/enable_if.hpp>            // for boost::disable_if
+#include <boost/mpl/identity.hpp>      // for identity
+#include <boost/utility/enable_if.hpp> // for boost::disable_if

 namespace boost { namespace algorithm {

 /// \fn clamp ( T const& val, 
-///               typename boost::type_identity<T>::type const & lo, 
-///               typename boost::type_identity<T>::type const & hi, Pred p )
+///               typename boost::mpl::identity<T>::type const & lo, 
+///               typename boost::mpl::identity<T>::type const & hi, Pred p )
 /// \return the value "val" brought into the range [ lo, hi ]
 ///     using the comparison predicate p.
 ///     If p ( val, lo ) return lo.
@ -48,8 +48,8 @@ namespace boost { namespace algorithm {
 ///
  template<typename T, typename Pred> 
  BOOST_CXX14_CONSTEXPR T const & clamp ( T const& val, 
-    typename boost::type_identity<T>::type const & lo, 
-    typename boost::type_identity<T>::type const & hi, Pred p )
+    typename boost::mpl::identity<T>::type const & lo, 
+    typename boost::mpl::identity<T>::type const & hi, Pred p )
  {
 //    assert ( !p ( hi, lo ));    // Can't assert p ( lo, hi ) b/c they might be equal
    return p ( val, lo ) ? lo : p ( hi, val ) ? hi : val;
@ -57,8 +57,8 @@ namespace boost { namespace algorithm {


 /// \fn clamp ( T const& val, 
-///               typename boost::identity<T>::type const & lo, 
-///               typename boost::identity<T>::type const & hi )
+///               typename boost::mpl::identity<T>::type const & lo, 
+///               typename boost::mpl::identity<T>::type const & hi )
 /// \return the value "val" brought into the range [ lo, hi ].
 ///     If the value is less than lo, return lo.
 ///     If the value is greater than "hi", return hi.
@ -70,8 +70,8 @@ namespace boost { namespace algorithm {
 ///
  template<typename T> 
  BOOST_CXX14_CONSTEXPR T const& clamp ( const T& val, 
-    typename boost::type_identity<T>::type const & lo, 
-    typename boost::type_identity<T>::type const & hi )
+    typename boost::mpl::identity<T>::type const & lo, 
+    typename boost::mpl::identity<T>::type const & hi )
  {
    return boost::algorithm::clamp ( val, lo, hi, std::less<T>());
  } 
--- a/include/boost/algorithm/cxx11/copy_if.hpp
+++ b/include/boost/algorithm/cxx11/copy_if.hpp
@ -126,86 +126,6 @@ copy_until ( const Range &r, OutputIterator result, Predicate p )
    return boost::algorithm::copy_until (boost::begin (r), boost::end(r), result, p);
 }

-/// \fn copy_if_while ( InputIterator first, InputIterator last, OutputIterator result, CopyPredicate copy_pred, TerminatePred term_pred )
-/// \brief Copies all the elements from the input range that satisfy the
-/// copy predicate to the output range while the termination predicate is
-/// satisfied.
-/// \return The updated output iterator
-///
-/// \param first     The start of the input sequence
-/// \param last      One past the end of the input sequence
-/// \param result    An output iterator to write the results into
-/// \param copy_pred A predicate for testing whether to the current element
-/// \param term_pred A predicate for testing whether to end the copy operation
-template<typename InputIterator, typename OutputIterator, typename CopyPredicate, typename TerminatePred>
-BOOST_CXX14_CONSTEXPR std::pair<InputIterator, OutputIterator>
-copy_if_while ( InputIterator first, InputIterator last, OutputIterator result, CopyPredicate copy_pred, TerminatePred term_pred)
-{
-    for ( ; first != last && term_pred(*first); ++first ) {
-        if (copy_pred(*first)) {
-            *result++ = *first;
-        }
-    }
-    return std::make_pair(first, result);
-}
-
-/// \fn copy_if_while ( const Range& r, OutputIterator result, CopyPredicate copy_pred, TerminatePred term_pred )
-/// \brief Copies all the elements from the input range that satisfy the
-/// copy predicate to the output range while the termination predicate is
-/// satisfied.
-/// \return The updated output iterator
-///
-/// \param r         The input range
-/// \param result    An output iterator to write the results into
-/// \param copy_pred A predicate for testing whether to the current element
-/// \param term_pred A predicate for testing whether to end the copy operation
-template<typename Range, typename OutputIterator, typename CopyPredicate, typename TerminatePred>
-BOOST_CXX14_CONSTEXPR std::pair<typename boost::range_iterator<const Range>::type, OutputIterator>
-copy_if_while ( const Range& r, OutputIterator result, CopyPredicate copy_pred, TerminatePred term_pred)
-{
-    return boost::algorithm::copy_if_while(boost::begin(r), boost::end(r), result, copy_pred, term_pred);
-}
-
-/// \fn copy_if_until ( InputIterator first, InputIterator last, OutputIterator result, CopyPredicate copy_pred, TerminatePred term_pred )
-/// \brief Copies all the elements from the input range that satisfy the
-/// copy predicate to the output range until the termination predicate is
-/// satisfied.
-/// \return The updated output iterator
-///
-/// \param first     The start of the input sequence
-/// \param last      One past the end of the input sequence
-/// \param result    An output iterator to write the results into
-/// \param copy_pred A predicate for testing whether to the current element
-/// \param term_pred A predicate for testing whether to end the copy operation
-template<typename InputIterator, typename OutputIterator, typename CopyPredicate, typename TerminatePred>
-BOOST_CXX14_CONSTEXPR std::pair<InputIterator, OutputIterator>
-copy_if_until ( InputIterator first, InputIterator last, OutputIterator result, CopyPredicate copy_pred, TerminatePred term_pred)
-{
-    for ( ; first != last && !term_pred(*first); ++first ) {
-        if (copy_pred(*first)) {
-            *result++ = *first;
-        }
-    }
-    return std::make_pair(first, result);
-}
-
-/// \fn copy_if_until ( const Range& r, OutputIterator result, CopyPredicate copy_pred, TerminatePred term_pred )
-/// \brief Copies all the elements from the input range that satisfy the
-/// copy predicate to the output range until the termination predicate is
-/// satisfied.
-/// \return The updated output iterator
-///
-/// \param r         The input range
-/// \param result    An output iterator to write the results into
-/// \param copy_pred A predicate for testing whether to the current element
-/// \param term_pred A predicate for testing whether to end the copy operation
-template<typename Range, typename OutputIterator, typename CopyPredicate, typename TerminatePred>
-BOOST_CXX14_CONSTEXPR std::pair<typename boost::range_iterator<const Range>::type, OutputIterator>
-copy_if_until ( const Range& r, OutputIterator result, CopyPredicate copy_pred, TerminatePred term_pred)
-{
-    return boost::algorithm::copy_if_until(boost::begin(r), boost::end(r), result, copy_pred, term_pred);
-}
-
 }} // namespace boost and algorithm

 #endif  // BOOST_ALGORITHM_COPY_IF_HPP
--- a/include/boost/algorithm/cxx11/is_permutation.hpp
+++ b/include/boost/algorithm/cxx11/is_permutation.hpp
@ -20,7 +20,7 @@
 #include <boost/config.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
-#include <boost/core/enable_if.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <boost/type_traits/is_same.hpp>

 namespace boost { namespace algorithm {
--- a/include/boost/algorithm/cxx11/is_sorted.hpp
+++ b/include/boost/algorithm/cxx11/is_sorted.hpp
@ -20,9 +20,9 @@
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>

-#include <boost/core/enable_if.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <boost/type_traits/is_same.hpp>
-#include <boost/type_traits/type_identity.hpp> // for boost::type_identity
+#include <boost/mpl/identity.hpp>

 namespace boost { namespace algorithm {

@ -127,7 +127,7 @@ namespace boost { namespace algorithm {
 /// \param p     A binary predicate that returns true if two elements are ordered.
 ///
    template <typename R, typename Pred>
-    BOOST_CXX14_CONSTEXPR typename boost::lazy_disable_if_c< boost::is_same<R, Pred>::value, boost::type_identity<bool> >::type
+    BOOST_CXX14_CONSTEXPR typename boost::lazy_disable_if_c< boost::is_same<R, Pred>::value, boost::mpl::identity<bool> >::type
    is_sorted ( const R &range, Pred p )
    {
        return boost::algorithm::is_sorted ( boost::begin ( range ), boost::end ( range ), p );
--- a/include/boost/algorithm/cxx17/inclusive_scan.hpp
+++ b/include/boost/algorithm/cxx17/inclusive_scan.hpp
@ -9,8 +9,8 @@
 /// \brief Combine the (transformed) elements of a sequence (or two) into a single value.
 /// \author Marshall Clow

-#ifndef BOOST_ALGORITHM_INCLUSIVE_SCAN_HPP
-#define BOOST_ALGORITHM_INCLUSIVE_SCAN_HPP
+#ifndef BOOST_ALGORITHM_TRANSFORM_REDUCE_HPP
+#define BOOST_ALGORITHM_TRANSFORM_REDUCE_HPP

 #include <functional>     // for std::plus
 #include <iterator>       // for std::iterator_traits
@ -58,4 +58,4 @@ OutputIterator inclusive_scan(InputIterator first, InputIterator last,

 }} // namespace boost and algorithm

-#endif // BOOST_ALGORITHM_INCLUSIVE_SCAN_HPP
+#endif // BOOST_ALGORITHM_TRANSFORM_REDUCE_HPP
--- a/include/boost/algorithm/cxx17/transform_exclusive_scan.hpp
+++ b/include/boost/algorithm/cxx17/transform_exclusive_scan.hpp
@ -22,21 +22,6 @@

 namespace boost { namespace algorithm {

-/// \fn transform_exclusive_scan ( InputIterator first, InputIterator last, OutputIterator result, BinaryOperation bOp, UnaryOperation uOp, T init )
-/// \brief Transforms elements from the input range with uOp and then combines
-/// those transformed elements with bOp such that the n-1th element and the nth
-/// element are combined. Exclusivity means that the nth element is not
-/// included in the nth combination.
-/// \return The updated output iterator
-///
-/// \param first  The start of the input sequence
-/// \param last   The end of the input sequence
-/// \param result The output iterator to write the results into
-/// \param bOp    The operation for combining transformed input elements
-/// \param uOp    The operation for transforming input elements
-/// \param init   The initial value
-///
-/// \note This function is part of the C++17 standard library
 template<class InputIterator, class OutputIterator, class T,
         class BinaryOperation, class UnaryOperation>
 OutputIterator transform_exclusive_scan(InputIterator first, InputIterator last,
--- a/include/boost/algorithm/cxx17/transform_inclusive_scan.hpp
+++ b/include/boost/algorithm/cxx17/transform_inclusive_scan.hpp
@ -22,21 +22,6 @@

 namespace boost { namespace algorithm {

-/// \fn transform_inclusive_scan ( InputIterator first, InputIterator last, OutputIterator result, BinaryOperation bOp, UnaryOperation uOp, T init )
-/// \brief Transforms elements from the input range with uOp and then combines
-/// those transformed elements with bOp such that the n-1th element and the nth
-/// element are combined. Inclusivity means that the nth element is included in
-/// the nth combination.
-/// \return The updated output iterator
-///
-/// \param first  The start of the input sequence
-/// \param last   The end of the input sequence
-/// \param result The output iterator to write the results into
-/// \param bOp    The operation for combining transformed input elements
-/// \param uOp    The operation for transforming input elements
-/// \param init   The initial value
-///
-/// \note This function is part of the C++17 standard library
 template<class InputIterator, class OutputIterator,
         class BinaryOperation, class UnaryOperation, class T>
 OutputIterator transform_inclusive_scan(InputIterator first, InputIterator last,
@ -52,20 +37,6 @@ OutputIterator transform_inclusive_scan(InputIterator first, InputIterator last,
    return result;
 }

-/// \fn transform_inclusive_scan ( InputIterator first, InputIterator last, OutputIterator result, BinaryOperation bOp, UnaryOperation uOp, T init )
-/// \brief Transforms elements from the input range with uOp and then combines
-/// those transformed elements with bOp such that the n-1th element and the nth
-/// element are combined. Inclusivity means that the nth element is included in
-/// the nth combination. The first value will be used as the init.
-/// \return The updated output iterator
-///
-/// \param first  The start of the input sequence
-/// \param last   The end of the input sequence
-/// \param result The output iterator to write the results into
-/// \param bOp    The operation for combining transformed input elements
-/// \param uOp    The operation for transforming input elements
-///
-/// \note This function is part of the C++17 standard library
 template<class InputIterator, class OutputIterator,
         class BinaryOperation, class UnaryOperation>
 OutputIterator transform_inclusive_scan(InputIterator first, InputIterator last,
--- a/include/boost/algorithm/gather.hpp
+++ b/include/boost/algorithm/gather.hpp
@ -22,10 +22,9 @@

 #include <algorithm>                // for std::stable_partition
 #include <functional>
-#include <utility>                  // for std::make_pair

 #include <boost/config.hpp>
-#include <boost/bind/bind.hpp>      // for boost::bind
+#include <boost/bind.hpp>           // for boost::bind
 #include <boost/range/begin.hpp>    // for boost::begin(range)
 #include <boost/range/end.hpp>      // for boost::end(range)

@ -82,14 +81,13 @@ namespace boost { namespace algorithm {
 */

 template <
-    typename BidirectionalIterator,  // models BidirectionalIterator
-    typename Pred>                   // models UnaryPredicate
+    typename BidirectionalIterator,  // Iter models BidirectionalIterator
+    typename Pred>                   // Pred models UnaryPredicate
 std::pair<BidirectionalIterator, BidirectionalIterator> gather 
        ( BidirectionalIterator first, BidirectionalIterator last, BidirectionalIterator pivot, Pred pred )
 {
 //  The first call partitions everything up to (but not including) the pivot element,
 //  while the second call partitions the rest of the sequence.
-    using namespace boost::placeholders;
    return std::make_pair (
        std::stable_partition ( first, pivot, !boost::bind<bool> ( pred, _1 )),
        std::stable_partition ( pivot, last,   boost::bind<bool> ( pred, _1 )));
--- a/include/boost/algorithm/hex.hpp
+++ b/include/boost/algorithm/hex.hpp
@ -30,7 +30,7 @@
 #include <boost/exception/info.hpp>
 #include <boost/throw_exception.hpp>

-#include <boost/core/enable_if.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <boost/type_traits/is_integral.hpp>


@ -48,9 +48,9 @@ namespace boost { namespace algorithm {
    \brief  Thrown when the input sequence unexpectedly ends

 */
-struct BOOST_SYMBOL_VISIBLE hex_decode_error : virtual boost::exception, virtual std::exception {};
-struct BOOST_SYMBOL_VISIBLE not_enough_input : virtual hex_decode_error {};
-struct BOOST_SYMBOL_VISIBLE non_hex_input    : virtual hex_decode_error {};
+struct hex_decode_error : virtual boost::exception, virtual std::exception {};
+struct not_enough_input : virtual hex_decode_error {};
+struct non_hex_input    : virtual hex_decode_error {};
 typedef boost::error_info<struct bad_char_,char> bad_char;

 namespace detail {
--- a/include/boost/algorithm/is_clamped.hpp
+++ b/include/boost/algorithm/is_clamped.hpp
@ -1,72 +0,0 @@
-/* 
-   Copyright (c) Ivan Matek, Marshall Clow 2021.
-
-   Distributed under 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)
-  
-*/
-
-/// \file is_clamped.hpp
-/// \brief IsClamped algorithm
-/// \authors Ivan Matek, Marshall Clow
-///
-
-#ifndef BOOST_ALGORITHM_IS_CLAMPED_HPP
-#define BOOST_ALGORITHM_IS_CLAMPED_HPP
-
-#include <functional>       //  for std::less
-#include <cassert>
-
-#include <boost/type_traits/type_identity.hpp> // for boost::type_identity
-
-namespace boost { namespace algorithm {
-
-/// \fn is_clamped ( T const& val,
-///               typename boost::type_identity<T>::type const & lo,
-///               typename boost::type_identity<T>::type const & hi, Pred p )
-/// \returns true if value "val" is in the range [ lo, hi ]
-///     using the comparison predicate p.
-///     If p ( val, lo ) return false.
-///     If p ( hi, val ) return false.
-///     Otherwise, returns true.
-///
-/// \param val   The value to be checked
-/// \param lo    The lower bound of the range
-/// \param hi    The upper bound of the range
-/// \param p     A predicate to use to compare the values.
-///                 p ( a, b ) returns a boolean.
-///
-  template <typename T, typename Pred>
-  BOOST_CXX14_CONSTEXPR bool is_clamped(
-      T const& val, typename boost::type_identity<T>::type const& lo,
-      typename boost::type_identity<T>::type const& hi, Pred p) {
-    //    assert ( !p ( hi, lo ));    // Can't assert p ( lo, hi ) b/c they
-    //    might be equal
-    return p(val, lo) ? false : p(hi, val) ? false : true;
-  }
-  
-/// \fn is_clamped ( T const& val,
-///               typename boost::type_identity<T>::type const & lo,
-///               typename boost::type_identity<T>::type const & hi)
-/// \returns true if value "val" is in the range [ lo, hi ]
-///     using operator < for comparison.
-///     If the value is less than lo, return false.
-///     If the value is greater than hi, return false.
-///     Otherwise, returns true.
-///
-/// \param val   The value to be checked
-/// \param lo    The lower bound of the range
-/// \param hi    The upper bound of the range
-///
-  
-  template<typename T> 
-  BOOST_CXX14_CONSTEXPR bool is_clamped ( const T& val,
-    typename boost::type_identity<T>::type const & lo,
-    typename boost::type_identity<T>::type const & hi )
-  {
-    return boost::algorithm::is_clamped ( val, lo, hi, std::less<T>());
-  } 
-
-}}
-
-#endif // BOOST_ALGORITHM_CLAMP_HPP
--- a/include/boost/algorithm/is_palindrome.hpp
+++ b/include/boost/algorithm/is_palindrome.hpp
@ -113,7 +113,7 @@ bool is_palindrome(const R& range, Predicate p)
 /// \note This function will return true for empty sequences and for palindromes.
 ///     For other sequences function will return false.
 ///     Complexity: O(N).
-inline bool is_palindrome(const char* str)
+bool is_palindrome(const char* str)
 {
    if(!str)
 	    return true;
--- a/include/boost/algorithm/searching/boyer_moore.hpp
+++ b/include/boost/algorithm/searching/boyer_moore.hpp
@ -19,7 +19,7 @@
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>

-#include <boost/core/enable_if.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <boost/type_traits/is_same.hpp>

 #include <boost/algorithm/searching/detail/bm_traits.hpp>
--- a/include/boost/algorithm/searching/boyer_moore_horspool.hpp
+++ b/include/boost/algorithm/searching/boyer_moore_horspool.hpp
@ -19,7 +19,7 @@
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>

-#include <boost/core/enable_if.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <boost/type_traits/is_same.hpp>

 #include <boost/algorithm/searching/detail/bm_traits.hpp>
--- a/include/boost/algorithm/searching/knuth_morris_pratt.hpp
+++ b/include/boost/algorithm/searching/knuth_morris_pratt.hpp
@ -20,7 +20,7 @@
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>

-#include <boost/core/enable_if.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <boost/type_traits/is_same.hpp>

 #include <boost/algorithm/searching/detail/debugging.hpp>
--- a/include/boost/algorithm/string/compare.hpp
+++ b/include/boost/algorithm/string/compare.hpp
@ -65,7 +65,7 @@ namespace boost {
            template< typename T1, typename T2 >
                bool operator()( const T1& Arg1, const T2& Arg2 ) const
            {
-                #if defined(BOOST_BORLANDC) && (BOOST_BORLANDC >= 0x560) && (BOOST_BORLANDC <= 0x564) && !defined(_USE_OLD_RW_STL)
+                #if defined(__BORLANDC__) && (__BORLANDC__ >= 0x560) && (__BORLANDC__ <= 0x564) && !defined(_USE_OLD_RW_STL)
                    return std::toupper(Arg1)==std::toupper(Arg2);
                #else
                    return std::toupper<T1>(Arg1,m_Loc)==std::toupper<T2>(Arg2,m_Loc);
@ -118,7 +118,7 @@ namespace boost {
            template< typename T1, typename T2 >
                bool operator()( const T1& Arg1, const T2& Arg2 ) const
            {
-                #if defined(BOOST_BORLANDC) && (BOOST_BORLANDC >= 0x560) && (BOOST_BORLANDC <= 0x564) && !defined(_USE_OLD_RW_STL)
+                #if defined(__BORLANDC__) && (__BORLANDC__ >= 0x560) && (__BORLANDC__ <= 0x564) && !defined(_USE_OLD_RW_STL)
                    return std::toupper(Arg1)<std::toupper(Arg2);
                #else
                    return std::toupper<T1>(Arg1,m_Loc)<std::toupper<T2>(Arg2,m_Loc);
@ -171,7 +171,7 @@ namespace boost {
            template< typename T1, typename T2 >
                bool operator()( const T1& Arg1, const T2& Arg2 ) const
            {
-                #if defined(BOOST_BORLANDC) && (BOOST_BORLANDC >= 0x560) && (BOOST_BORLANDC <= 0x564) && !defined(_USE_OLD_RW_STL)
+                #if defined(__BORLANDC__) && (__BORLANDC__ >= 0x560) && (__BORLANDC__ <= 0x564) && !defined(_USE_OLD_RW_STL)
                    return std::toupper(Arg1)<=std::toupper(Arg2);
                #else
                    return std::toupper<T1>(Arg1,m_Loc)<=std::toupper<T2>(Arg2,m_Loc);
--- a/include/boost/algorithm/string/detail/case_conv.hpp
+++ b/include/boost/algorithm/string/detail/case_conv.hpp
@ -15,9 +15,6 @@
 #include <locale>
 #include <functional>

-#include <boost/iterator/transform_iterator.hpp>
-#include <boost/range/begin.hpp>
-#include <boost/range/end.hpp>
 #include <boost/type_traits/make_unsigned.hpp>

 namespace boost {
@ -43,7 +40,7 @@ namespace boost {
                // Operation
                CharT operator ()( CharT Ch ) const
                {
-                    #if defined(BOOST_BORLANDC) && (BOOST_BORLANDC >= 0x560) && (BOOST_BORLANDC <= 0x564) && !defined(_USE_OLD_RW_STL)
+                    #if defined(__BORLANDC__) && (__BORLANDC__ >= 0x560) && (__BORLANDC__ <= 0x564) && !defined(_USE_OLD_RW_STL)
                        return std::tolower( static_cast<typename boost::make_unsigned <CharT>::type> ( Ch ));
                    #else
                        return std::tolower<CharT>( Ch, *m_Loc );
@ -65,7 +62,7 @@ namespace boost {
                // Operation
                CharT operator ()( CharT Ch ) const
                {
-                    #if defined(BOOST_BORLANDC) && (BOOST_BORLANDC >= 0x560) && (BOOST_BORLANDC <= 0x564) && !defined(_USE_OLD_RW_STL)
+                    #if defined(__BORLANDC__) && (__BORLANDC__ >= 0x560) && (__BORLANDC__ <= 0x564) && !defined(_USE_OLD_RW_STL)
                        return std::toupper( static_cast<typename boost::make_unsigned <CharT>::type> ( Ch ));
                    #else
                        return std::toupper<CharT>( Ch, *m_Loc );
--- a/include/boost/algorithm/string/detail/classification.hpp
+++ b/include/boost/algorithm/string/detail/classification.hpp
@ -13,12 +13,10 @@

 #include <boost/algorithm/string/config.hpp>
 #include <algorithm>
-#include <cstring>
 #include <functional>
 #include <locale>

 #include <boost/range/begin.hpp>
-#include <boost/range/distance.hpp>
 #include <boost/range/end.hpp>

 #include <boost/algorithm/string/predicate_facade.hpp>
@ -47,7 +45,7 @@ namespace boost {
                    return std::use_facet< std::ctype<CharT> >(m_Locale).is( m_Type, Ch );
                }

-                #if defined(BOOST_BORLANDC) && (BOOST_BORLANDC >= 0x560) && (BOOST_BORLANDC <= 0x582) && !defined(_USE_OLD_RW_STL)
+                #if defined(__BORLANDC__) && (__BORLANDC__ >= 0x560) && (__BORLANDC__ <= 0x582) && !defined(_USE_OLD_RW_STL)
                    template<>
                    bool operator()( char const Ch ) const
                    {
--- a/include/boost/algorithm/string/detail/find_format_all.hpp
+++ b/include/boost/algorithm/string/detail/find_format_all.hpp
@ -18,8 +18,6 @@
 #include <boost/algorithm/string/detail/find_format_store.hpp>
 #include <boost/algorithm/string/detail/replace_storage.hpp>

-#include <deque>
-
 namespace boost {
    namespace algorithm {
        namespace detail {
--- a/include/boost/algorithm/string/detail/find_iterator.hpp
+++ b/include/boost/algorithm/string/detail/find_iterator.hpp
@ -40,18 +40,10 @@ namespace boost {
            // Protected construction/destruction

                // Default constructor
-                BOOST_DEFAULTED_FUNCTION(find_iterator_base(), {})
-
+                find_iterator_base() {}
                // Copy construction
-                BOOST_DEFAULTED_FUNCTION(find_iterator_base( const find_iterator_base& Other ), :
+                find_iterator_base( const find_iterator_base& Other ) :
                    m_Finder(Other.m_Finder) {}
-                )
-
-                // Assignment
-                BOOST_DEFAULTED_FUNCTION(find_iterator_base& operator=( const find_iterator_base& Other ), {
-                    m_Finder = Other.m_Finder;
-                    return *this;
-                })
                
                // Constructor
                template<typename FinderT>
@ -59,7 +51,7 @@ namespace boost {
                    m_Finder(Finder) {}

                // Destructor
-                BOOST_DEFAULTED_FUNCTION(~find_iterator_base(), {})
+                ~find_iterator_base() {}

                // Find operation
                match_type do_find( 
--- a/include/boost/algorithm/string/detail/finder.hpp
+++ b/include/boost/algorithm/string/detail/finder.hpp
@ -13,7 +13,7 @@

 #include <boost/algorithm/string/config.hpp>
 #include <boost/algorithm/string/constants.hpp>
-#include <iterator>
+#include <boost/detail/iterator.hpp>

 #include <boost/range/iterator_range_core.hpp>
 #include <boost/range/begin.hpp>
@ -127,8 +127,8 @@ namespace boost {
                    if( boost::empty(m_Search) )
                        return result_type( End, End );

-                    typedef BOOST_STRING_TYPENAME
-                        std::iterator_traits<ForwardIteratorT>::iterator_category category;
+                    typedef BOOST_STRING_TYPENAME boost::detail::
+                        iterator_traits<ForwardIteratorT>::iterator_category category;

                    return findit( Begin, End, category() );
                }
@ -344,8 +344,9 @@ namespace boost {
                typedef iterator_range<ForwardIteratorT> result_type;

                input_iterator_type It=Begin;
-                for( unsigned int Index=0; Index<N && It!=End; ++Index,++It )
-                    ;
+                for(
+                    unsigned int Index=0;
+                    Index<N && It!=End; ++Index,++It ) {};

                return result_type( Begin, It );
            }
@ -374,8 +375,8 @@ namespace boost {
                ForwardIteratorT End,
                unsigned int N )
            {
-                typedef BOOST_STRING_TYPENAME
-                    std::iterator_traits<ForwardIteratorT>::iterator_category category;
+                typedef BOOST_STRING_TYPENAME boost::detail::
+                    iterator_traits<ForwardIteratorT>::iterator_category category;

                return ::boost::algorithm::detail::find_head_impl( Begin, End, N, category() );
            }
@ -396,12 +397,10 @@ namespace boost {
                input_iterator_type It2=Begin;

                // Advance It2 by N increments
-                for( Index=0; Index<N && It2!=End; ++Index,++It2 )
-                    ;
+                for( Index=0; Index<N && It2!=End; ++Index,++It2 ) {};

                // Advance It, It2 to the end
-                for(; It2!=End; ++It,++It2 )
-                	;
+                for(; It2!=End; ++It,++It2 ) {};

                return result_type( It, It2 );
            }
@ -418,8 +417,9 @@ namespace boost {
                typedef iterator_range<ForwardIteratorT> result_type;

                input_iterator_type It=End;
-                for( unsigned int Index=0; Index<N && It!=Begin; ++Index,--It )
-                    ;
+                for(
+                    unsigned int Index=0;
+                    Index<N && It!=Begin; ++Index,--It ) {};

                return result_type( It, End );
            }
@ -448,8 +448,8 @@ namespace boost {
                ForwardIteratorT End,
                unsigned int N )
            {
-                typedef BOOST_STRING_TYPENAME
-                    std::iterator_traits<ForwardIteratorT>::iterator_category category;
+                typedef BOOST_STRING_TYPENAME boost::detail::
+                    iterator_traits<ForwardIteratorT>::iterator_category category;

                return ::boost::algorithm::detail::find_tail_impl( Begin, End, N, category() );
            }
--- a/include/boost/algorithm/string/detail/formatter.hpp
+++ b/include/boost/algorithm/string/detail/formatter.hpp
@ -42,7 +42,7 @@ namespace boost {
                    m_Format(::boost::begin(Format), ::boost::end(Format)) {}

                // Operation
-#if BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x564))
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
                template<typename Range2T>
                result_type& operator()(const Range2T&)
                {
--- a/include/boost/algorithm/string/detail/trim.hpp
+++ b/include/boost/algorithm/string/detail/trim.hpp
@ -12,7 +12,7 @@
 #define BOOST_STRING_TRIM_DETAIL_HPP

 #include <boost/algorithm/string/config.hpp>
-#include <iterator>
+#include <boost/detail/iterator.hpp>

 namespace boost {
    namespace algorithm {
@ -80,8 +80,8 @@ namespace boost {
                ForwardIteratorT InEnd, 
                PredicateT IsSpace )
            {
-                typedef BOOST_STRING_TYPENAME
-                    std::iterator_traits<ForwardIteratorT>::iterator_category category;
+                typedef BOOST_STRING_TYPENAME boost::detail::
+                    iterator_traits<ForwardIteratorT>::iterator_category category;

                return ::boost::algorithm::detail::trim_end_iter_select( InBegin, InEnd, IsSpace, category() );
            }
--- a/include/boost/algorithm/string/find_format.hpp
+++ b/include/boost/algorithm/string/find_format.hpp
@ -12,6 +12,7 @@
 #define BOOST_STRING_FIND_FORMAT_HPP

 #include <deque>
+#include <boost/detail/iterator.hpp>
 #include <boost/range/iterator_range_core.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
@ -39,7 +40,7 @@ namespace boost {
            this substring and replace it in the input.
            The result is a modified copy of the input. It is returned as a sequence 
            or copied to the output iterator.
-
+    
            \param Output An output iterator to which the result will be copied
            \param Input An input sequence
            \param Finder A Finder object used to search for a match to be replaced
--- a/include/boost/algorithm/string/find_iterator.hpp
+++ b/include/boost/algorithm/string/find_iterator.hpp
@ -74,7 +74,7 @@ namespace boost {

                \post eof()==true
            */
-            BOOST_DEFAULTED_FUNCTION(find_iterator(), {})
+            find_iterator() {}

            //! Copy constructor
            /*!
@ -85,18 +85,6 @@ namespace boost {
                m_Match(Other.m_Match),
                m_End(Other.m_End) {}

-            //! Copy assignment
-            /*!
-                Assigns a copy of the find_iterator
-            */
-            BOOST_DEFAULTED_FUNCTION(find_iterator& operator=( const find_iterator& Other ), {
-                if (this == &Other) return *this;
-                this->base_type::operator=(Other);
-                m_Match = Other.m_Match;
-                m_End = Other.m_End;
-                return *this;
-            })
-
            //! Constructor
            /*!
                Construct new find_iterator for a given finder
@ -260,20 +248,6 @@ namespace boost {
                m_bEof(Other.m_bEof)
            {}

-            //! Assignment operator
-            /*!
-                Assigns a copy of the split_iterator
-            */
-            BOOST_DEFAULTED_FUNCTION(split_iterator& operator=( const split_iterator& Other ), {
-                if (this == &Other) return *this;
-                this->base_type::operator=(Other);
-                m_Match = Other.m_Match;
-                m_Next = Other.m_Next;
-                m_End = Other.m_End;
-                m_bEof = Other.m_bEof;
-                return *this;
-            })
-
            //! Constructor
            /*!
                Construct new split_iterator for a given finder
--- a/include/boost/algorithm/string/formatter.hpp
+++ b/include/boost/algorithm/string/formatter.hpp
@ -11,6 +11,7 @@
 #ifndef BOOST_STRING_FORMATTER_HPP
 #define BOOST_STRING_FORMATTER_HPP

+#include <boost/detail/iterator.hpp>
 #include <boost/range/value_type.hpp>
 #include <boost/range/iterator_range_core.hpp>
 #include <boost/range/as_literal.hpp>
--- a/include/boost/algorithm/string/predicate.hpp
+++ b/include/boost/algorithm/string/predicate.hpp
@ -11,7 +11,6 @@
 #ifndef BOOST_STRING_PREDICATE_HPP
 #define BOOST_STRING_PREDICATE_HPP

-#include <iterator>
 #include <boost/algorithm/string/config.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
@ -145,10 +144,10 @@ namespace boost {
            iterator_range<BOOST_STRING_TYPENAME range_const_iterator<Range1T>::type> lit_input(::boost::as_literal(Input));
            iterator_range<BOOST_STRING_TYPENAME range_const_iterator<Range2T>::type> lit_test(::boost::as_literal(Test));

-            typedef BOOST_STRING_TYPENAME
+            typedef BOOST_STRING_TYPENAME 
                range_const_iterator<Range1T>::type Iterator1T;
-            typedef BOOST_STRING_TYPENAME
-                std::iterator_traits<Iterator1T>::iterator_category category;
+            typedef BOOST_STRING_TYPENAME boost::detail::
+                iterator_traits<Iterator1T>::iterator_category category;

            return detail::
                ends_with_iter_select( 
--- a/meta/libraries.json
+++ b/meta/libraries.json
@ -11,8 +11,7 @@
        ],
        "maintainers": [
            "Marshall Clow <marshall -at- idio.com>"
-        ],
-        "cxxstd": "03"
+        ]
    },
    {
        "key": "algorithm/minmax",
@ -27,8 +26,7 @@
        ],
        "maintainers": [
            "Marshall Clow <marshall -at- idio.com>"
-        ],
-        "cxxstd": "03"
+        ]
    },
    {
        "key": "algorithm/string",
@ -44,7 +42,6 @@
        ],
        "maintainers": [
            "Marshall Clow <marshall -at- idio.com>"
-        ],
-        "cxxstd": "03"
+        ]
    }
 ]
--- a/string/doc/usage.xml
+++ b/string/doc/usage.xml
@ -265,7 +265,7 @@
        <title>Find Iterator</title>

        <para>
-            An extension to find algorithms is the Find Iterator. Instead of searching for just a one part of a string, 
+            An extension to find algorithms it the Find Iterator. Instead of searching for just a one part of a string, 
            the find iterator allows us to iterate over the substrings matching the specified criteria.
            This facility is using the <link linkend="string_algo.finder_concept">Finder</link> to incrementally
            search the string. 
--- a/string/example/predicate_example.cpp
+++ b/string/example/predicate_example.cpp
@ -12,6 +12,8 @@
 #include <functional>
 #include <boost/algorithm/string/predicate.hpp>
 #include <boost/algorithm/string/classification.hpp>
+#include <boost/bind.hpp>
+

 using namespace std;
 using namespace boost;
--- a/string/example/rle_example.cpp
+++ b/string/example/rle_example.cpp
@ -16,7 +16,7 @@
 #include <string>
 #include <iostream>
 #include <limits>
-#include <iterator>
+#include <boost/detail/iterator.hpp>
 #include <boost/algorithm/string/find_format.hpp>
 #include <boost/algorithm/string/finder.hpp>

@ -46,7 +46,7 @@ struct find_compressF
        ForwardIteratorT End ) const
    {
        typedef ForwardIteratorT input_iterator_type;
-        typedef typename std::iterator_traits<input_iterator_type>::value_type value_type;
+        typedef typename boost::detail::iterator_traits<input_iterator_type>::value_type value_type;
        typedef iterator_range<input_iterator_type> result_type;

        // begin of the matching segment
@ -144,7 +144,7 @@ struct find_decompressF
        ForwardIteratorT End ) const
    {
        typedef ForwardIteratorT input_iterator_type;
-        typedef typename std::iterator_traits<input_iterator_type>::value_type value_type;
+        typedef typename boost::detail::iterator_traits<input_iterator_type>::value_type value_type;
        typedef iterator_range<input_iterator_type> result_type;

        for(input_iterator_type It=Begin; It!=End; It++)
@ -153,12 +153,12 @@ struct find_decompressF
            {
                // Repeat mark found, extract body
                input_iterator_type It2=It++; 
-
+                
                if ( It==End ) break;
                    It++; 
                if ( It==End ) break;
                    It++;
-
+                
                return result_type( It2, It );
            }
        }
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@ -29,7 +29,6 @@ alias unit_test_framework

 # Misc tests
     [ run clamp_test.cpp unit_test_framework         : : : : clamp_test ]
-     [ run is_clamped_test.cpp unit_test_framework    : : : : is_clamped_test ]
     [ run power_test.cpp unit_test_framework         : : : : power_test ]
     [ compile-fail power_fail1.cpp  : : : : ]

@ -69,7 +68,6 @@ alias unit_test_framework
     [ run hex_test2.cpp unit_test_framework         : : : : hex_test2 ]
     [ run hex_test3.cpp unit_test_framework         : : : : hex_test3 ]
     [ run hex_test4.cpp unit_test_framework         : : : : hex_test4 ]
-     [ run mclow.cpp unit_test_framework             : : : : mclow     ]
     [ compile-fail hex_fail1.cpp ]

 # Gather tests
--- a/test/copy_if_test1.cpp
+++ b/test/copy_if_test1.cpp
@ -28,21 +28,19 @@
 namespace ba = boost::algorithm;
 // namespace ba = boost;

-BOOST_CXX14_CONSTEXPR bool is_true  ( int ) { return true; }
-BOOST_CXX14_CONSTEXPR bool is_false ( int ) { return false; }
+BOOST_CXX14_CONSTEXPR bool is_true  ( int v ) { return true; }
+BOOST_CXX14_CONSTEXPR bool is_false ( int v ) { return false; }
 BOOST_CXX14_CONSTEXPR bool is_even  ( int v ) { return v % 2 == 0; }
 BOOST_CXX14_CONSTEXPR bool is_odd   ( int v ) { return v % 2 == 1; }
 BOOST_CXX14_CONSTEXPR bool is_zero  ( int v ) { return v == 0; }

-BOOST_CXX14_CONSTEXPR bool less_than_ten ( int v ) { return v < 10; }
-BOOST_CXX14_CONSTEXPR bool greater_than_ten ( int v ) { return v > 10; }

 template <typename Container>
 void test_copy_if ( Container const &c ) {

    typedef typename Container::value_type value_type;
    std::vector<value_type> v;
-
+    
 //  None of the elements
    v.clear ();
    ba::copy_if ( c.begin (), c.end (), back_inserter ( v ), is_false);
@ -120,160 +118,6 @@ void test_copy_while ( Container const &c ) {
    BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
    }

-template <typename Container>
-void test_copy_if_while ( Container const &c ) {
-
-    typedef typename Container::value_type value_type;
-    typename Container::const_iterator it;
-
-//  Terminate immediately
-    {
-        std::vector<value_type> v;
-        ba::copy_if_while ( c.begin (), c.end (), back_inserter ( v ), is_true, is_false);
-        BOOST_CHECK ( v.size () == 0 );
-    }
-    {
-        std::vector<value_type> v;
-        ba::copy_if_while ( c, back_inserter ( v ), is_true, is_false);
-        BOOST_CHECK ( v.size () == 0 );
-    }
-
-// Copy nothing - never terminate
-    {
-        std::vector<value_type> v;
-        ba::copy_if_while ( c.begin (), c.end (), back_inserter ( v ), is_false, is_true);
-        BOOST_CHECK ( v.size () == 0 );
-    }
-    {
-        std::vector<value_type> v;
-        ba::copy_if_while ( c, back_inserter ( v ), is_false, is_true);
-        BOOST_CHECK ( v.size () == 0 );
-    }
-
-// Copy everything
-    {
-        std::vector<value_type> v;
-        ba::copy_if_while ( c.begin (), c.end (), back_inserter ( v ), is_true, is_true);
-        BOOST_CHECK ( v.size () == c.size() );
-        BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
-    }
-    {
-        std::vector<value_type> v;
-        ba::copy_if_while ( c, back_inserter ( v ), is_true, is_true);
-        BOOST_CHECK ( v.size () == c.size() );
-        BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
-    }
-
-// Copy all evens
-    {
-        std::vector<value_type> v;
-        ba::copy_if_while ( c.begin (), c.end (), back_inserter ( v ), is_even, is_true);
-        BOOST_CHECK ( v.size () == (size_t) std::count_if ( c.begin (), c.end (), is_even ));
-        BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even ));
-    }
-    {
-        std::vector<value_type> v;
-        ba::copy_if_while ( c, back_inserter ( v ), is_even, is_true);
-        BOOST_CHECK ( v.size () == (size_t) std::count_if ( c.begin (), c.end (), is_even ));
-        BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even ));
-    }
-
-// Copy some until termination
-    {
-        std::vector<value_type> v;
-        typename Container::const_iterator it = ba::copy_if_while (
-            c.begin (), c.end (), back_inserter ( v ), is_even, less_than_ten).first;
-        BOOST_CHECK ( it == std::find_if ( c.begin(), c.end(), greater_than_ten ));
-        BOOST_CHECK ( v.size () == std::count_if ( c.begin(), it, is_even ));
-        BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even ));
-    }
-    {
-        std::vector<value_type> v;
-        typename Container::const_iterator it = ba::copy_if_while (
-            c, back_inserter ( v ), is_even, less_than_ten).first;
-        BOOST_CHECK ( it == std::find_if ( c.begin(), c.end(), greater_than_ten ));
-        BOOST_CHECK ( v.size () == std::count_if ( c.begin(), it, is_even ));
-        BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even ));
-    }
-    }
-
-template <typename Container>
-void test_copy_if_until ( Container const &c ) {
-
-    typedef typename Container::value_type value_type;
-    typename Container::const_iterator it;
-
-//  Terminate immediately
-    {
-        std::vector<value_type> v;
-        ba::copy_if_until ( c.begin (), c.end (), back_inserter ( v ), is_true, is_true);
-        BOOST_CHECK ( v.size () == 0 );
-    }
-    {
-        std::vector<value_type> v;
-        ba::copy_if_until ( c, back_inserter ( v ), is_true, is_true);
-        BOOST_CHECK ( v.size () == 0 );
-    }
-
-// Copy nothing - never terminate
-    {
-        std::vector<value_type> v;
-        ba::copy_if_until ( c.begin (), c.end (), back_inserter ( v ), is_false, is_false);
-        BOOST_CHECK ( v.size () == 0 );
-    }
-    {
-        std::vector<value_type> v;
-        ba::copy_if_until ( c, back_inserter ( v ), is_false, is_false);
-        BOOST_CHECK ( v.size () == 0 );
-    }
-
-// Copy everything
-    {
-        std::vector<value_type> v;
-        ba::copy_if_until ( c.begin (), c.end (), back_inserter ( v ), is_true, is_false);
-        BOOST_CHECK ( v.size () == c.size() );
-        BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
-    }
-    {
-        std::vector<value_type> v;
-        ba::copy_if_until ( c, back_inserter ( v ), is_true, is_false);
-        BOOST_CHECK ( v.size () == c.size() );
-        BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
-    }
-
-// Copy all evens
-    {
-        std::vector<value_type> v;
-        ba::copy_if_until ( c.begin (), c.end (), back_inserter ( v ), is_even, is_false);
-        BOOST_CHECK ( v.size () == (size_t) std::count_if ( c.begin (), c.end (), is_even ));
-        BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even ));
-    }
-    {
-        std::vector<value_type> v;
-        ba::copy_if_until ( c, back_inserter ( v ), is_even, is_false);
-        BOOST_CHECK ( v.size () == (size_t) std::count_if ( c.begin (), c.end (), is_even ));
-        BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even ));
-    }
-
-// Copy some until termination
-    {
-        std::vector<value_type> v;
-        typename Container::const_iterator it = ba::copy_if_until (
-            c.begin (), c.end (), back_inserter ( v ), is_even, greater_than_ten).first;
-        BOOST_CHECK ( it == std::find_if ( c.begin(), c.end(), greater_than_ten ));
-        BOOST_CHECK ( v.size () == std::count_if ( c.begin(), it, is_even ));
-        BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even ));
-    }
-    {
-        std::vector<value_type> v;
-        typename Container::const_iterator it = ba::copy_if_until (
-            c, back_inserter ( v ), is_even, greater_than_ten).first;
-        BOOST_CHECK ( it == std::find_if ( c.begin(), c.end(), greater_than_ten ));
-        BOOST_CHECK ( v.size () == std::count_if ( c.begin(), it, is_even ));
-        BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even ));
-    }
-    }
-
 template <typename Container>
 void test_copy_until ( Container const &c ) {

@ -380,77 +224,8 @@ BOOST_CXX14_CONSTEXPR inline bool constexpr_test_copy_until() {
    
    return res;
    }
-
-BOOST_CXX14_CONSTEXPR inline bool constexpr_test_copy_if_while() {
-    const int sz = 64;
-    int in_data[sz] = {0};
-    bool res = true;
-
-    const int* from = in_data;
-    const int* to = in_data + sz;
-
-// Terminate immediately
-    {
-        int out_data[sz] = {0};
-        int* out = out_data;
-        out = ba::copy_if_while ( from, to, out, is_true, is_false ).second;
-        res = (res && out == out_data && ba::all_of(out, out + sz, is_zero));
-    }
-// Copy nothing
-    {
-        int out_data[sz] = {0};
-        int* out = out_data;
-        out = ba::copy_if_while ( from, to, out, is_false, is_true ).second;
-        res = (res && out == out_data && ba::all_of(out, out + sz, is_zero));
-    }
-// Copy everything
-    {
-        int out_data[sz] = {0};
-        int* out = out_data;
-        out = ba::copy_if_while ( from, to, out, is_true, is_true ).second;
-        res = (res && out == out_data + sz
-               && ba::equal( input_iterator<const int *>(out_data),  input_iterator<const int *>(out_data + sz),
-                             input_iterator<const int *>(from), input_iterator<const int *>(to)));
-    }
-
-    return res;
-    }
-
-BOOST_CXX14_CONSTEXPR inline bool constexpr_test_copy_if_until() {
-    const int sz = 64;
-    int in_data[sz] = {0};
-    bool res = true;
-
-    const int* from = in_data;
-    const int* to = in_data + sz;
-
-// Terminate immediately
-    {
-        int out_data[sz] = {0};
-        int* out = out_data;
-        out = ba::copy_if_until ( from, to, out, is_true, is_true ).second;
-        res = (res && out == out_data && ba::all_of(out, out + sz, is_zero));
-    }
-// Copy nothing
-    {
-        int out_data[sz] = {0};
-        int* out = out_data;
-        out = ba::copy_if_until ( from, to, out, is_false, is_false ).second;
-        res = (res && out == out_data && ba::all_of(out, out + sz, is_zero));
-    }
-// Copy everything
-    {
-        int out_data[sz] = {0};
-        int* out = out_data;
-        out = ba::copy_if_until ( from, to, out, is_true, is_false ).second;
-        res = (res && out == out_data + sz
-               && ba::equal( input_iterator<const int *>(out_data),  input_iterator<const int *>(out_data + sz),
-                             input_iterator<const int *>(from), input_iterator<const int *>(to)));
-    }
-
-    return res;
-    }
-
+    
+    
 void test_sequence1 () {
    std::vector<int> v;
    for ( int i = 5; i < 15; ++i )
@ -458,26 +233,20 @@ void test_sequence1 () {
    test_copy_if ( v );
    test_copy_while ( v );
    test_copy_until ( v );
-
+    
    BOOST_CXX14_CONSTEXPR bool constexpr_res_if = constexpr_test_copy_if();
    BOOST_CHECK ( constexpr_res_if );
    BOOST_CXX14_CONSTEXPR bool constexpr_res_while = constexpr_test_copy_while();
    BOOST_CHECK ( constexpr_res_while );
    BOOST_CXX14_CONSTEXPR bool constexpr_res_until = constexpr_test_copy_until();
    BOOST_CHECK ( constexpr_res_until );
-    BOOST_CXX14_CONSTEXPR bool constexpr_res_if_while = constexpr_test_copy_if_while();
-    BOOST_CHECK ( constexpr_res_if_while );
-    BOOST_CXX14_CONSTEXPR bool constexpr_res_if_until = constexpr_test_copy_if_until();
-    BOOST_CHECK ( constexpr_res_if_until );
-
+    
    std::list<int> l;
    for ( int i = 25; i > 15; --i )
        l.push_back ( i );
    test_copy_if ( l );
    test_copy_while ( l );
    test_copy_until ( l );
-    test_copy_if_while ( l );
-    test_copy_if_until ( l );
    }


--- a/test/hex_test4.cpp
+++ b/test/hex_test4.cpp
@ -25,7 +25,7 @@ void test_short_input1 () {
    std::string s;
    
    try { ba::unhex ( std::string ( "A" ), std::back_inserter(s)); }
-    catch ( const std::exception & ) { return; }
+    catch ( const std::exception &ex ) { return; }
    BOOST_TEST_MESSAGE ( "Failed to catch std::exception in test_short_input1" );
    BOOST_CHECK ( false );
    }
@ -34,7 +34,7 @@ void test_short_input2 () {
    std::string s;
    
    try { ba::unhex ( std::string ( "A" ), std::back_inserter(s)); }
-    catch ( const ba::hex_decode_error & ) { return; }
+    catch ( const ba::hex_decode_error &ex ) { return; }
    BOOST_TEST_MESSAGE ( "Failed to catch ba::hex_decode_error in test_short_input2" );
    BOOST_CHECK ( false );
    }
@ -43,7 +43,7 @@ void test_short_input3 () {
    std::string s;
    
    try { ba::unhex ( std::string ( "A" ), std::back_inserter(s)); }
-    catch ( const ba::not_enough_input & ) { return; }
+    catch ( const ba::not_enough_input &ex ) { return; }
    BOOST_TEST_MESSAGE ( "Failed to catch ba::not_enough_input in test_short_input3" );
    BOOST_CHECK ( false );
    }
@ -53,8 +53,8 @@ void test_short_input4 () {
    std::string s;
    
    try { ba::unhex ( std::string ( "A" ), std::back_inserter(s)); }
-    catch ( const ba::non_hex_input & ) { BOOST_CHECK ( false ); }
-    catch ( const ba::not_enough_input & ) { return; }
+    catch ( const ba::non_hex_input &ex ) { BOOST_CHECK ( false ); }
+    catch ( const ba::not_enough_input &ex ) { return; }
    catch ( ... ) { BOOST_CHECK ( false ); }
    BOOST_CHECK ( false );
    }
@ -64,8 +64,8 @@ void test_short_input5 () {
    std::string s;
    
    try { ba::unhex ( "A", std::back_inserter(s)); }
-    catch ( const ba::non_hex_input & ) { BOOST_CHECK ( false ); }
-    catch ( const ba::not_enough_input & ) { return; }
+    catch ( const ba::non_hex_input &ex ) { BOOST_CHECK ( false ); }
+    catch ( const ba::not_enough_input &ex ) { return; }
    catch ( ... ) { BOOST_CHECK ( false ); }
    BOOST_CHECK ( false );
    }
@ -125,8 +125,8 @@ void test_nonhex_input4 () {
    std::string s;
    
    try { ba::unhex ( "P1234FA1234", std::back_inserter(s)); }
-    catch ( const ba::not_enough_input & ) { BOOST_CHECK ( false ); }
-    catch ( const ba::non_hex_input & ) { return; }
+    catch ( const ba::not_enough_input &ex ) { BOOST_CHECK ( false ); }
+    catch ( const ba::non_hex_input &ex ) { return; }
    catch ( ... ) { BOOST_CHECK ( false ); }
    BOOST_CHECK ( false );
    }
--- a/test/is_clamped_test.cpp
+++ b/test/is_clamped_test.cpp
@ -1,246 +0,0 @@
-//  (C) Copyright Ivan Matek, Marshall Clow 2021.
-//  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)
-
-#include <boost/algorithm/is_clamped.hpp>
-#include <boost/algorithm/clamp.hpp>
-#include <cmath>
-#include <cstdint>
-#ifdef __cpp_impl_three_way_comparison
-#if __has_include(<compare>)
-#define BOOST_IS_CLAMPED_TEST_SPACESHIP
-#endif
-#ifdef BOOST_IS_CLAMPED_TEST_SPACESHIP
-#include <compare>
-#endif
-#endif
-#include <limits>
-#include <string>
-#include <tuple>
-
-#define BOOST_TEST_MAIN
-#include <boost/test/unit_test.hpp>
-
-namespace ba = boost::algorithm;
-
-BOOST_CONSTEXPR bool intGreater(int lhs, int rhs) { return lhs > rhs; }
-
-class custom {
- public:
-  custom(int x) : v(x) {}
-  custom(const custom &rhs) : v(rhs.v) {}
-
-  bool operator<(const custom &rhs) const { return v < rhs.v; }
-  bool operator==(const custom &rhs) const {
-    return v == rhs.v;
-  }  // need this for the test
-  int v;
-};
-
-static bool customLess(const custom &lhs, const custom &rhs) { return lhs.v < rhs.v; }
-
-void test_ints() {
-  //  Inside the range, equal to the endpoints, and outside the endpoints.
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 3, 1, 6 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 1, 1, 6 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 6, 1, 6 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 0, 1, 6 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 7, 1, 6 ));
-
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 3, 6, 1, intGreater ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 1, 6, 1, intGreater ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 6, 6, 1, intGreater ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 0, 6, 1, intGreater ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 7, 6, 1, intGreater ));
-
-  //  Negative numbers
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( -3, -6, -1 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( -1, -6, -1 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( -6, -6, -1 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped (  0, -6, -1 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( -7, -6, -1 ));
-
-  //  Mixed positive and negative numbers
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped (  1, -5, 5 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( -5, -5, 5 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped (  5, -5, 5 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( -6, -5, 5 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped (  6, -5, 5 ));
-
-  //  Unsigned
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 5U, 1U, 6U ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 1U, 1U, 6U ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 6U, 1U, 6U ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 0U, 1U, 6U ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 8U, 1U, 6U ));
-
-  //  Mixed (1)
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 5U, 1, 6 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 1U, 1, 6 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 6U, 1, 6 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 0U, 1, 6 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 8U, 1, 6 ));
-
-  //  Mixed (2)
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 5U, 1, 6. ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 1U, 1, 6. ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 6U, 1, 6. ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 0U, 1, 6. ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 8U, 1, 6. ));
-
-  // float->short conversion does not round
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( 50, 50.999, 100 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( 50, 51.001, 100 ));
-}
-
-void test_floats() {
-  //  If floats are IEEE754 certain floats have exact representations.
-  if (std::numeric_limits<float>::is_iec559) {
-    const float lo = 0.125;
-    const float hi = 0.625;
-    BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( lo, lo, hi ));
-    BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( hi, lo, hi ));
-    BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( lo + 0.01, lo, hi ));
-    BOOST_CHECK_EQUAL ( false, ba::is_clamped ( lo - 0.01, lo, hi ));
-    BOOST_CHECK_EQUAL ( false, ba::is_clamped ( hi + 0.01, lo, hi ));
-    // If we have nextafterf we can be more precise.
-    #if __cplusplus >= 201103L
-    assert(lo < hi);
-    BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( hi, lo, hi ));
-    BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( std::nextafterf( lo, hi ), lo, hi ));
-    BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( std::nextafterf( hi, lo ), lo, hi ));
-    BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( (lo + hi) / 2, lo, hi ));
-    // 1.0 is just for direction of nextafterf, value of 1.0 is not significant.
-    BOOST_CHECK_EQUAL ( false, ba::is_clamped ( std::nextafterf( lo, lo - 1.0f ), lo, hi ));
-    BOOST_CHECK_EQUAL ( false, ba::is_clamped ( std::nextafterf( hi, hi + 1.0f ), lo, hi ));
-    #endif
-  }
-}
-
-void test_std_string() {
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( std::string("a3"), std::string("a1"), std::string("a6") ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( std::string("a1"), std::string("a1"), std::string("a6") ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( std::string("a6"), std::string("a1"), std::string("a6") ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( std::string("a7"), std::string("a1"), std::string("a6") ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( std::string("a0"), std::string("a1"), std::string("a6") ));
-}
-
-void test_custom() {
-  //  Inside the range, equal to the endpoints, and outside the endpoints.
-  const custom c0(0);
-  const custom c1(1);
-  const custom c3(3);
-  const custom c6(6);
-  const custom c7(7);
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( c3, c1, c6 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( c1, c1, c6 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( c6, c1, c6 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( c0, c1, c6 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( c7, c1, c6 ));
-
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( c3, c1, c6, customLess ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( c1, c1, c6, customLess ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped ( c6, c1, c6, customLess ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( c0, c1, c6, customLess ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped ( c7, c1, c6, customLess ));
-}
-
-void test_point_interval() {
-    BOOST_CHECK_EQUAL(true, ba::is_clamped(1, 1, 1));
-    BOOST_CHECK_EQUAL(false, ba::is_clamped(0, 1, 1));
-    BOOST_CHECK_EQUAL(false, ba::is_clamped(2, 1, 1));
-}
-
-void test_first_argument_determines_types() {
-    // all arguments are int
-    BOOST_CHECK_EQUAL(true, ba::is_clamped(5, 5.9, 6.1));
-    BOOST_CHECK_EQUAL(true, ba::is_clamped(6, 5.9, 6.1));
-    // all arguments are double
-    BOOST_CHECK_EQUAL(false, ba::is_clamped(5.0, 5.9, 6.1));
-    BOOST_CHECK_EQUAL(false, ba::is_clamped(6.2, 5.9, 6.1));
-}
-
-void test_constexpr() {
-  #if __cplusplus >= 201402L
-  {
-    constexpr bool is_clamped = (ba::is_clamped ( 3, 1, 6 ));
-    BOOST_CHECK_EQUAL (true, is_clamped );
-  }
-  {
-    constexpr bool is_clamped = (ba::is_clamped ( 1, 1, 6 ));
-    BOOST_CHECK_EQUAL (true, is_clamped );
-  }
-  {
-    constexpr bool is_clamped = (ba::is_clamped ( 6, 1, 6 ));
-    BOOST_CHECK_EQUAL (true, is_clamped );
-  }
-  {
-    constexpr bool is_clamped = (ba::is_clamped ( 0, 1, 6 ));
-    BOOST_CHECK_EQUAL(false, is_clamped );
-  }
-  {
-    constexpr bool is_clamped = (ba::is_clamped ( 7, 1, 6 ));
-    BOOST_CHECK_EQUAL(false, is_clamped );
-  }
-  #endif
-}
-
-
-#ifdef BOOST_IS_CLAMPED_TEST_SPACESHIP
-struct custom_with_spaceship {
-  int v;
-  auto operator<=>(const custom_with_spaceship&) const = default;
-};
-#endif
-
-void test_spaceship() {
-  #ifdef BOOST_IS_CLAMPED_TEST_SPACESHIP
-  //  Inside the range, equal to the endpoints, and outside the endpoints.
-  const custom_with_spaceship c0(0);
-  const custom_with_spaceship c1(1);
-  const custom_with_spaceship c3(3);
-  const custom_with_spaceship c6(6);
-  const custom_with_spaceship c7(7);
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped (c3, c1, c6 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped (c1, c1, c6 ));
-  BOOST_CHECK_EQUAL ( true,  ba::is_clamped (c6, c1, c6 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped (c0, c1, c6 ));
-  BOOST_CHECK_EQUAL ( false, ba::is_clamped (c7, c1, c6 ));
-  {
-    constexpr custom_with_spaceship c1(1);
-    constexpr custom_with_spaceship c3(3);
-    constexpr custom_with_spaceship c6(6);
-    constexpr bool clamped = ba::is_clamped (c3, c1, c6 );
-    BOOST_CHECK_EQUAL ( true, clamped );
-  }
-  #endif
-}
-
-BOOST_AUTO_TEST_CASE(test_main) {
-  test_ints();
-  test_floats();
-  test_std_string();
-  test_custom();
-  test_point_interval();
-  test_first_argument_determines_types();
-  test_constexpr();
-  test_spaceship();
-}
-
-#if __cplusplus >= 201103L
-typedef std::tuple<std::uint8_t, std::int8_t, std::uint16_t, std::int16_t,
-                   std::int32_t, std::uint32_t, std::int64_t, std::uint64_t> test_types_tuple;
-
-BOOST_AUTO_TEST_CASE_TEMPLATE(test_extremes, T, test_types_tuple) {
-  const T max = std::numeric_limits<T>::max();
-  BOOST_CHECK_EQUAL(true,  ba::is_clamped( max, max, max ));
-  BOOST_CHECK_EQUAL(true,  ba::is_clamped( max, max - 1, max ));
-  BOOST_CHECK_EQUAL(false, ba::is_clamped( max - 1, max, max ));
-
-  const T min = std::numeric_limits<T>::min();
-  BOOST_CHECK_EQUAL(true,  ba::is_clamped( min, min, min ));
-  BOOST_CHECK_EQUAL(true,  ba::is_clamped( min, min, min + 1 ));
-  BOOST_CHECK_EQUAL(false, ba::is_clamped( min, min + 1, min + 1 ));
-}
-#endif
--- a/test/is_permutation_test1.cpp
+++ b/test/is_permutation_test1.cpp
@ -112,7 +112,7 @@ void test_sequence1 () {
    std::vector<int> v, v1;
    
    v.clear ();
-    for ( int i = 5; i < 15; ++i )
+    for ( std::size_t i = 5; i < 15; ++i )
        v.push_back ( i );
    v1 = v;
    BOOST_CHECK ( ba::is_permutation ( v.begin (), v.end (), v.begin ()));  // better be a permutation of itself!
--- a/test/mclow.cpp
+++ b/test/mclow.cpp
@ -1,15 +0,0 @@
-#include <stdexcept>
-
-#include <boost/exception/exception.hpp>
-#include <boost/throw_exception.hpp>
-
-struct hex_decode_error : virtual boost::exception, virtual std::exception {};
-struct not_enough_input : virtual hex_decode_error {};
-struct non_hex_input    : virtual hex_decode_error {};
-
-void toss() { BOOST_THROW_EXCEPTION(not_enough_input()); }
-
-int main () {
-	try { toss(); }
-	catch ( const hex_decode_error & /*ex*/ ) {}
-	}
--- a/test/search_test1.cpp
+++ b/test/search_test1.cpp
@ -32,7 +32,7 @@ namespace {

 //  Check using iterators
    template<typename Container>
-    void check_one_iter ( const Container &haystack, const std::string &needle, std::ptrdiff_t expected ) {
+    void check_one_iter ( const Container &haystack, const std::string &needle, int expected ) {
        typedef typename Container::const_iterator iter_type;
        typedef typename std::pair<iter_type, iter_type> ret_type;
        typedef std::string::const_iterator pattern_type;
@ -53,7 +53,7 @@ namespace {
 //         iter_type it1r = ret1r.first;
 //         iter_type it2  = ret2.first;
 //         iter_type it3  = ret3.first;
-        const std::ptrdiff_t dist = ret1.first == hEnd ? -1 : std::distance ( hBeg, ret1.first );
+        const int dist = ret1.first == hEnd ? -1 : std::distance ( hBeg, ret1.first );

        std::cout << "(Iterators) Pattern is " << needle.length () << ", haysstack is " << haystack.length () << " chars long; " << std::endl;
        try {
@ -97,7 +97,7 @@ namespace {
 //  Check using pointers
 //    We're assuming that the container implements contiguous storage here.
    template<typename Container>
-    void check_one_pointer ( const Container &haystack, const std::string &needle, std::ptrdiff_t expected ) {
+    void check_one_pointer ( const Container &haystack, const std::string &needle, int expected ) {
        typedef const typename Container::value_type *ptr_type;
        typedef typename std::pair<ptr_type, ptr_type> ret_type;

@ -110,7 +110,7 @@ namespace {
        ret_type ret1 = ba::boyer_moore_search          (hBeg, hEnd, nBeg, nEnd);
        ret_type ret2 = ba::boyer_moore_horspool_search (hBeg, hEnd, nBeg, nEnd);
        ret_type ret3 = ba::knuth_morris_pratt_search   (hBeg, hEnd, nBeg, nEnd);
-        const std::ptrdiff_t dist = ret1.first == hEnd ? -1 : std::distance ( hBeg, ret1.first );
+        const int dist = ret1.first == hEnd ? -1 : std::distance ( hBeg, ret1.first );

        std::cout << "(Pointers) Pattern is " << needle.length () << ", haysstack is " << haystack.length () << " chars long; " << std::endl;
        try {
@ -147,7 +147,7 @@ namespace {

 //  Check using objects
    template<typename Container>
-    void check_one_object ( const Container &haystack, const std::string &needle, std::ptrdiff_t expected ) {
+    void check_one_object ( const Container &haystack, const std::string &needle, int expected ) {
        typedef typename Container::const_iterator iter_type;
        typedef typename std::pair<iter_type, iter_type> ret_type;
        typedef std::string::const_iterator pattern_type;
@ -169,7 +169,7 @@ namespace {
       ret_type retr1r = bm_r         (haystack);
        ret_type ret2   = bmh          (hBeg, hEnd);
        ret_type ret3   = kmp          (hBeg, hEnd);
-        const std::ptrdiff_t dist  = ret1.first == hEnd ? -1 : std::distance ( hBeg, ret1.first );
+        const int dist  = ret1.first == hEnd ? -1 : std::distance ( hBeg, ret1.first );

        std::cout << "(Objects) Pattern is " << needle.length () << ", haysstack is " << haystack.length () << " chars long; " << std::endl;
        try {
@ -224,7 +224,7 @@ namespace {


    template<typename Container>
-    void check_one ( const Container &haystack, const std::string &needle, std::ptrdiff_t expected ) {
+    void check_one ( const Container &haystack, const std::string &needle, int expected ) {
        check_one_iter ( haystack, needle, expected );
        check_one_pointer ( haystack, needle, expected );
        check_one_object ( haystack, needle, expected );
--- a/test/search_test2.cpp
+++ b/test/search_test2.cpp
@ -85,7 +85,7 @@ namespace {
        std::cout << std::endl;
        }
    
-    void check_one ( const vec &haystack, const vec &needle, std::ptrdiff_t expected ) {
+    void check_one ( const vec &haystack, const vec &needle, int expected ) {
        std::size_t i;
        std::clock_t sTime;
        unsigned long stdDiff;
@ -147,7 +147,7 @@ BOOST_AUTO_TEST_CASE( test_main )
    std::cout << "---- Middle -----" << std::endl;
    check_one ( c1, p1f, -2 );      //  Don't know answer
    std::cout << "------ End ------" << std::endl;
-    check_one ( c1, p1e, static_cast<std::ptrdiff_t>(c1.size() - p1e.size ()));  
+    check_one ( c1, p1e, c1.size() - p1e.size ());  
    std::cout << "--- Not found ---" << std::endl;
    check_one ( c1, p1n, -1 );      //  Not found
    }
--- a/test/search_test3.cpp
+++ b/test/search_test3.cpp
@ -85,7 +85,7 @@ namespace {
        std::cout << std::endl;
        }
    
-    void check_one ( const vec &haystack, const vec &needle, std::ptrdiff_t expected ) {
+    void check_one ( const vec &haystack, const vec &needle, int expected ) {
        std::size_t i;
        std::clock_t sTime;
        unsigned long stdDiff;
@ -147,7 +147,7 @@ BOOST_AUTO_TEST_CASE( test_main )
    std::cout << "---- Middle -----" << std::endl;
    check_one ( c1, p1f, -2 );      //  Don't know answer
    std::cout << "------ End ------" << std::endl;
-    check_one ( c1, p1e, static_cast<std::ptrdiff_t>(c1.size() - p1e.size ()));  
+    check_one ( c1, p1e, c1.size() - p1e.size ());  
    std::cout << "--- Not found ---" << std::endl;
    check_one ( c1, p1n, -1 );      //  Not found
    }
--- a/test/search_test4.cpp
+++ b/test/search_test4.cpp
@ -62,7 +62,7 @@ namespace {
        return retVal;
        }
    
-    void check_one ( const vec &haystack, const vec &needle, std::ptrdiff_t expected ) {
+    void check_one ( const vec &haystack, const vec &needle, int expected ) {
        
        std::pair<vec::const_iterator, vec::const_iterator> res;
        std::pair<vec::const_iterator, vec::const_iterator> exp;        // the expected result
@ -117,7 +117,7 @@ BOOST_AUTO_TEST_CASE( test_main )
    std::cout << "---- Middle -----" << std::endl;
    check_one ( c1, p1f, -2 );      //  Don't know answer
    std::cout << "------ End ------" << std::endl;
-    check_one ( c1, p1e, static_cast<std::ptrdiff_t>(c1.size() - p1e.size ()));  
+    check_one ( c1, p1e, c1.size() - p1e.size ());  
    std::cout << "--- Not found ---" << std::endl;
    check_one ( c1, p1n, -1 );      //  Not found
    }
Author	SHA1	Message	Date
Marshall Clow	e59958cc4d	Merge include + doc fixes to master for 1.72 release	2019-12-03 16:53:16 -08:00
Marshall Clow	44527f4c81	Algorithm: Merge example fixes master for 1.72.0	2019-12-03 07:48:39 -08:00
Marshall Clow	1b65b8de02	Merge bug fixes to master for 1.71	2019-07-10 15:14:08 -07:00
Marshall Clow	5af3e3b174	Merge bug fixes to master	2018-12-04 09:35:03 -08:00
Marshall Clow	badf1b3f0c	Merge broken links to master. NFC	2018-07-31 22:57:40 -07:00
Marshall Clow	4f9afb0682	Merge for the 1.68.0 beta	2018-07-04 11:27:27 -07:00
Marshall Clow	6d0126df8a	Catch up with the changes; apply_permutation; constexpr, etc	2018-05-01 08:17:06 -07:00
Marshall Clow	daef6d41c5	C++17 algorithms	2017-06-28 20:13:38 -07:00
Marshall Clow	055075aa61	Bug fixes and is_partititioned_XXX for the 1.65.0 release	2017-06-14 18:49:39 -07:00
Rene Rivera	d029402f05	Add, and update, documentation build targets.	2016-10-10 11:24:26 -05:00
Marshall Clow	24d2cceb27	Fix a couple of test failures for the 1.62.0 release	2016-08-17 18:11:47 -07:00
Marshall Clow	c5b41eba46	Merge to master for 1.62.0 release	2016-08-17 13:32:45 -07:00
Marshall Clow	e5ea93bab1	Revert "Merge pull request #14 from nigels-com/merge-hex_lower" This reverts commit `5412438df5`, reversing changes made to `a09963bf93`.	2016-03-07 15:43:55 -08:00
Marshall Clow	5412438df5	Merge pull request #14 from nigels-com/merge-hex_lower Implement algorithm::hex_lower (Trac ticket #7064)	2016-03-07 14:57:34 -08:00
Nigel Stewart	baa6eca18c	Test coverage for algorithm::hex_lower, adapting existing coverage for algorithm::hex	2016-01-31 20:18:22 +10:00
Nigel Stewart	073eb62f64	Another overload of algorithm::hex_lower as lower-case alternative to algorithm::hex	2016-01-31 20:17:23 +10:00
Nigel Stewart	cc1392cae6	Implement algorithm::hex_lower as lower-case alternative to algorithm::hex	2016-01-31 19:11:11 +10:00
Marshall Clow	a09963bf93	Merge from develop; new feature 'power'; doc fixes; remove usage of C++11 versions of the algorithms	2015-03-18 21:31:53 -07:00
Marshall Clow	cf249c090c	Merge from develop: clean up is_permutation; fix clamp interface, and merge fix for bug #9335 as well	2014-03-31 12:03:45 -07:00
Marshall Clow	645be22fa7	Setting merge point for git merges	2014-03-23 14:33:14 -07:00
Stephen Kelly	28b12d7264	Algorithm: Remove obsolete MSVC version checks. [SVN r86024]	2014-03-23 14:30:10 -07:00
Stephen Kelly	4d28d579e3	Remove BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION Process #ifdef...#endif blocks. [SVN r86243]	2014-03-23 14:27:55 -07:00
Stephen Kelly	5adab54486	Remove BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION Process #ifdef...#else...#endif blocks. [SVN r86246]	2014-03-23 14:27:55 -07:00
Marshall Clow	685a76f094	Merge a bunch of minor Boost.Algorithm changes to release [SVN r86757]	2013-11-18 16:52:09 +00:00
Marshall Clow	5988a55b96	Minor merging; removing tabs from source files [SVN r86323]	2013-10-15 15:44:55 +00:00
Marshall Clow	850fc02667	Merge bug fix for #9063 to release [SVN r86218]	2013-10-09 18:09:40 +00:00
Marshall Clow	5279c8f061	Merge minor Boost.Algorithm doc fixes to the release branch [SVN r86200]	2013-10-08 15:31:14 +00:00
Andrey Semashev	8b89b5ba27	Merged changes from trunk. [SVN r85804]	2013-09-20 17:40:42 +00:00
Marshall Clow	ca23b6f4f8	Merge bug fix to Release; Fixes #8546 [SVN r85134]	2013-07-23 16:48:27 +00:00
Marshall Clow	55cb3afefa	Merge test fixup to release [SVN r84825]	2013-06-18 14:48:37 +00:00
Marshall Clow	beeedadba9	Merge doc changes from trunk [SVN r84743]	2013-06-11 16:21:22 +00:00
Marshall Clow	1a70166889	Merge c++14 changes to release [SVN r84415]	2013-05-22 15:10:49 +00:00
Marshall Clow	63da6f5713	Merge Algorithm changes to release; hex code cleanups; gather iterator requirements; copy_while and copy_until interface changes [SVN r83347]	2013-03-07 15:37:08 +00:00
Marshall Clow	2381d0bdac	Merge bug fix to release; Fixes #7989 [SVN r83193]	2013-02-27 23:37:21 +00:00
Marshall Clow	40b5941652	One more failed merge [SVN r83192]	2013-02-27 23:36:16 +00:00
Marshall Clow	00dfda98b2	more merge failures [SVN r83171]	2013-02-26 22:05:42 +00:00
Marshall Clow	52eef989da	Clean up merge failure [SVN r83170]	2013-02-26 22:03:44 +00:00
Marshall Clow	8132864884	Merged boost::algorithm::gather and updated tests for Utility, Algorithm and Utility libraries [SVN r83154]	2013-02-25 18:43:26 +00:00
Marshall Clow	6e098b27aa	Merge Michael Morin's typo fixes for Boost.Algorithm to release; no functionality change. [SVN r82240]	2012-12-28 18:19:25 +00:00
Marshall Clow	60010b4165	Merge bug fix and test to release; Fixes #7784 [SVN r82238]	2012-12-28 17:39:08 +00:00
Marshall Clow	1660dc9d48	merge bug fix for minmax_element to release; Fixes #7752 [SVN r82049]	2012-12-17 16:02:38 +00:00
Marshall Clow	5ae4f848b3	Remove tabs from Boost.Algorithm tests. [SVN r81857]	2012-12-11 16:56:30 +00:00
Marshall Clow	fe3e0bb9c4	merge K-M-P doc updates to release; Fixes #7656 [SVN r81840]	2012-12-10 21:13:08 +00:00
Marshall Clow	311e169376	Merge extra tests for Boost.StringAlgo.Split to release [SVN r81835]	2012-12-10 20:10:12 +00:00
Marshall Clow	3dddfa1930	Merge from trunk; Fixes #7346 [SVN r81832]	2012-12-10 19:23:54 +00:00
Marshall Clow	be6d8f9665	Merge URL fix for boyer-moore; Fixes #7781 [SVN r81825]	2012-12-10 15:40:23 +00:00
Marshall Clow	bced4ed8dd	Merge doc fix for minmax; Fixes #7751 [SVN r81823]	2012-12-10 15:28:36 +00:00
Marshall Clow	1b57e905ab	Merge bug fixes to release; Fixes #7339 [SVN r80808]	2012-10-01 15:31:51 +00:00
Marshall Clow	29bd9f53d9	Merge bug fixes to release; Fixes #7399 Fixes #7400 Fixes #7401 [SVN r80670]	2012-09-23 14:56:41 +00:00
Marshall Clow	6341cfb1a6	Merge doc typo corrections to release; fixes #6595 ; fixes #7182 [SVN r80057]	2012-08-16 05:16:42 +00:00
Marshall Clow	7f4acd6170	Merged typos in comments to release; no functionality; Fixes #7210 [SVN r79929]	2012-08-08 16:30:33 +00:00
Marshall Clow	314f6dcfe0	Merge changes from [79588] to Release; fixes a unhex bug [SVN r79604]	2012-07-19 15:12:33 +00:00
Marshall Clow	167aa6e31c	Get rid of tabs in Boost.Algorithm tests [SVN r79603]	2012-07-19 15:00:27 +00:00
Marshall Clow	d228e91494	Merge Boost.Algorithm changes to release; Fixes #7104 [SVN r79538]	2012-07-15 16:28:35 +00:00
Marshall Clow	9cc573fbd0	Fixed errors in the doxygen comments. Fixes #7083 . [SVN r79285]	2012-07-05 15:30:17 +00:00
Marshall Clow	28a7d3eb4b	Merge doc changes to release; fixes #7073 [SVN r79264]	2012-07-04 16:15:35 +00:00
Daniel James	883cce61a8	Merge algorithm's html redirect. [SVN r78855]	2012-06-07 20:05:17 +00:00
Marshall Clow	96d4708367	Merge Boost.Algorithm inspection report changes to release. No functionality change [SVN r78689]	2012-05-27 15:45:18 +00:00
Marshall Clow	563fe27a59	Merged changes for Boost.Algorithm to release; Fixes #6596 ; Fixes #6689 ; Fixes #3215 ; Fixes #6840 [SVN r78557]	2012-05-23 16:25:48 +00:00
Marshall Clow	76cd99ed53	Merge Boost.Algorithm to release branch [SVN r78025]	2012-04-16 18:54:41 +00:00
Marshall Clow	0f2399fef0	Merge changes to release; fixes #5589 [SVN r76527]	2012-01-15 16:49:25 +00:00
Marshall Clow	044d667e79	Merge changes to release; fixes #3634 [SVN r76522]	2012-01-15 16:05:55 +00:00
Marshall Clow	be9da63894	Merge fix for #4937 to release [SVN r76267]	2012-01-01 21:18:47 +00:00
Marshall Clow	787c94bc53	Merge Change 68161 to release [SVN r76266]	2012-01-01 21:17:02 +00:00
Marshall Clow	e87ce37b34	Merge Change 76213 to release; Fixes #4811 [SVN r76265]	2012-01-01 21:12:58 +00:00
Pavol Droba	199a89a1e9	merged from trunk [SVN r72380]	2011-06-03 21:13:37 +00:00
Pavol Droba	01492a93c6	trunk changes merged [SVN r67922]	2011-01-10 19:36:38 +00:00
Daniel James	50703b8c97	Merge documentation fixes to release. [SVN r66285]	2010-10-30 17:34:45 +00:00
Jürgen Hunold	0f8d556130	Merge r65004 from trunk Fix #4551,#4553,#4575 by removing unused parameter. [SVN r65168]	2010-09-01 16:18:07 +00:00
Pavol Droba	bbd3220a1e	Merging changes from trunk [SVN r63824]	2010-07-10 20:29:03 +00:00
Hartmut Kaiser	9068069106	Spirit: merging from trunk upto rev. 61489 [SVN r63640]	2010-07-04 22:38:38 +00:00
Daniel James	a37af3c81e	Merge documentation fixes. * Use `doc/src/.css` instead of `doc/html/.css`. * Remove wiki and people directories. * Some documentation fixes. * Left out `minimal.css` changes and boostbook changes because of clashes. [SVN r63347]	2010-06-26 12:30:09 +00:00
Steven Watanabe	f5885c6fb0	Merge minmax from the trunk [SVN r62088]	2010-05-18 17:53:36 +00:00
Daniel James	d45bb3545e	Merge some link fixes and release notes. [SVN r61474]	2010-04-21 23:00:35 +00:00
Troy D. Straszheim	d735b9fa1e	rm cmake from the release branch before it goes out broken. Policy dictates that you never commit to release, you commit to trunk and merge to release. [SVN r56941]	2009-10-17 01:10:45 +00:00
Pavol Droba	62ec675581	Merged changes from trunk [SVN r56176]	2009-09-13 19:10:55 +00:00
Troy D. Straszheim	e7cd4da67b	Add basic copyright/license to keep cmake out of the inspection report [SVN r55095]	2009-07-22 21:51:01 +00:00
Steven Watanabe	6076f5a18e	Merge [53520] from the trunk [SVN r53909]	2009-06-14 22:56:08 +00:00
Steven Watanabe	60cd5a0500	Merge [53062] from the trunk [SVN r53270]	2009-05-26 01:17:07 +00:00
Jeremiah Willcock	c33dad924d	Fixed almost all tab and min/max issues found by inspect tool [SVN r53142]	2009-05-20 19:41:20 +00:00
Daniel James	2f2935f07e	Merged revisions 45283,48266 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r45283 \| danieljames \| 2008-05-11 14:49:20 +0100 (Sun, 11 May 2008) \| 1 line Quote href values - our tools don't support unquoted values. ........ r48266 \| danieljames \| 2008-08-20 20:32:23 +0100 (Wed, 20 Aug 2008) \| 1 line Fix the link to the limits documentation. ........ [SVN r51902]	2009-03-22 17:30:02 +00:00
John Maddock	3cbaafc27f	Merge PDF build changes from Trunk. [SVN r51417]	2009-02-23 18:39:32 +00:00
Steven Watanabe	c067b348bf	Merge [51045] from the trunk [SVN r51226]	2009-02-12 18:47:06 +00:00
Troy D. Straszheim	c33935fa1f	merge of cmake build files from trunk per beman [SVN r50756]	2009-01-24 18:57:20 +00:00
Pavol Droba	98a8b08afb	Memory management fixes for is_any_of predicate merged from the trunk [SVN r49172]	2008-10-07 21:59:57 +00:00
Pavol Droba	fc0f3dcffc	Cummulative merge of updates from the main trunk [SVN r46505]	2008-06-19 12:07:24 +00:00
Daniel James	822636418b	Merged revisions 43211,43214-43219,43222-43225,43227-43238,43242,43244-43245,43249-43250,43257-43259,43261,43263,43265,43267-43268,43270-43271,43273,43275-43279,43284-43289,43291,43295,43297-43298,43304-43305,43307,43313,43315,43324,43326-43327,43331,43333,43339-43343,43345,43348,43350,43352-43353,43355-43356,43358,43360,43366-43367,43369-43370,43372-43376,43378-43389,43394,43396-43398,43400-43401,43403-43404,43406-43408,43413-43415,43417-43418,43420,43422-43423 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r43417 \| danieljames \| 2008-02-26 22:04:55 +0000 (Tue, 26 Feb 2008) \| 2 lines Fix a link to Boost.Bimap. ........ r43418 \| danieljames \| 2008-02-26 22:07:25 +0000 (Tue, 26 Feb 2008) \| 2 lines Change another link that's no longer in the repository to link to the website. ........ r43422 \| danieljames \| 2008-02-27 18:51:14 +0000 (Wed, 27 Feb 2008) \| 1 line Fix broken copyright urls. Fixes #1573. ........ r43423 \| danieljames \| 2008-02-27 19:22:01 +0000 (Wed, 27 Feb 2008) \| 1 line Fix incorrect links to copyright of the form 'http:#www.boost.org ........ [SVN r43425]	2008-02-27 20:00:24 +00:00
Daniel James	352e16aade	Merged revisions 43206,43208-43213 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r43206 \| danieljames \| 2008-02-10 09:55:03 +0000 (Sun, 10 Feb 2008) \| 1 line Fix some broken links. ........ r43209 \| danieljames \| 2008-02-10 14:56:22 +0000 (Sun, 10 Feb 2008) \| 1 line Link to people pages on the website, as they've been removed from the download. ........ r43210 \| danieljames \| 2008-02-10 15:02:17 +0000 (Sun, 10 Feb 2008) \| 1 line Point links to the pages that used to be in 'more' to the site. ........ r43212 \| danieljames \| 2008-02-10 16:10:16 +0000 (Sun, 10 Feb 2008) \| 1 line Fix links on the home page as well. ........ r43213 \| danieljames \| 2008-02-10 16:21:22 +0000 (Sun, 10 Feb 2008) \| 1 line Generated documentation which is no longer generated. ........ [SVN r43214]	2008-02-10 16:39:38 +00:00
Beman Dawes	89c76ea1bb	Full merge from trunk at revision 41356 of entire boost-root tree. [SVN r41370]	2007-11-25 18:38:02 +00:00
Beman Dawes	50b5726a6f	Full merge from trunk at revision 41356 of entire boost-root tree. [SVN r41369]	2007-11-25 18:07:19 +00:00
Beman Dawes	d4b95734dd	Starting point for releases [SVN r39706]	2007-10-05 14:25:06 +00:00
nobody	05af96f84c	This commit was manufactured by cvs2svn to create tag 'Version_1_34_1'. [SVN r38286]	2007-07-24 19:28:14 +00:00
Pavol Droba	5bdbb2b308	Documentation for iter_find/iter_split added [SVN r37842]	2007-06-01 13:50:51 +00:00
Pavol Droba	1a02969303	release notes - fix the incorrect functionname spelling [SVN r37533]	2007-04-29 07:04:58 +00:00
Pavol Droba	6309379618	release notes for 1.34 added [SVN r37532]	2007-04-29 07:02:21 +00:00
Pavol Droba	37581bac55	documentation typo fixed [SVN r36843]	2007-01-30 07:59:28 +00:00
Beman Dawes	a71a4ed5b1	Merged copyright and license addition [SVN r35907]	2006-11-07 19:27:00 +00:00
Rene Rivera	c509c3fbad	Remove obsolete Boost.Build v1 files. [SVN r35880]	2006-11-06 17:10:46 +00:00
Pavol Droba	d8683f2498	unused parameters removed [SVN r35753]	2006-10-27 17:37:37 +00:00
Pavol Droba	7c0101aa51	Copyright added to index.html unneeded file removed [SVN r34908]	2006-08-20 20:14:48 +00:00
Pavol Droba	6f3e85528f	License added to the xml documentation files [SVN r34894]	2006-08-16 07:10:48 +00:00
Pavol Droba	8af639b7cf	missing 'using' directives for join_if and join_if_regex added missing #include <boost/algorithm/string/join.hpp> added to string_algo.hpp [SVN r34122]	2006-05-30 19:13:08 +00:00
Pavol Droba	d9bc7e800b	Merged patch from main trunk for borland by Nicola Musatti [SVN r33723]	2006-04-17 17:16:11 +00:00
nobody	b4ed9beb90	This commit was manufactured by cvs2svn to create branch 'RC_1_34_0'. [SVN r33417]	2006-03-21 02:26:31 +00:00