Added new gcc and clang jobs to GitHub Actions.

Use Azure mirrors of Ubuntu .deb repositories in containers.
This reduces the likelihood of spurious CI failures caused by DDoS filters being triggered by massive numbers of concurrent CI jobs.
2025-06-13 02:53:36 +03:00 · 2025-06-13 02:48:20 +03:00 · 2025-06-13 02:47:06 +03:00 · 2025-05-03 05:29:05 +03:00 · 2025-05-03 05:17:00 +03:00 · 2025-04-15 14:12:08 +03:00
39 changed files with 2230 additions and 929 deletions
--- a/.github/workflows/ci.yml
+++ b/.github/workflows/ci.yml
@ -1,4 +1,4 @@
-# Copyright 2021 Andrey Semashev
+# Copyright 2021-2025 Andrey Semashev
 #
 # 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)
@ -33,209 +33,290 @@ jobs:
      matrix:
        include:
          # Linux, gcc
-          - toolset: gcc-4.4
-            cxxstd: "98,0x"
-            os: ubuntu-20.04
-            container: ubuntu:16.04
-            install:
-              - g++-4.4
-            sources:
-              - "ppa:ubuntu-toolchain-r/test"
-          - toolset: gcc-4.6
-            cxxstd: "03,0x"
-            os: ubuntu-20.04
-            container: ubuntu:16.04
-            install:
-              - g++-4.6
-            sources:
-              - "ppa:ubuntu-toolchain-r/test"
          - toolset: gcc-4.7
-            cxxstd: "03,11"
-            os: ubuntu-20.04
+            cxxstd: "11"
+            os: ubuntu-latest
            container: ubuntu:16.04
            install:
              - g++-4.7
          - toolset: gcc-4.8
-            cxxstd: "03,11"
-            os: ubuntu-18.04
+            cxxstd: "11"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - g++-4.8
          - toolset: gcc-4.9
-            cxxstd: "03,11"
-            os: ubuntu-20.04
+            cxxstd: "11"
+            os: ubuntu-latest
            container: ubuntu:16.04
            install:
              - g++-4.9
          - toolset: gcc-5
-            cxxstd: "03,11,14,1z"
-            os: ubuntu-20.04
+            cxxstd: "11,14,1z"
+            os: ubuntu-latest
            container: ubuntu:16.04
            install:
              - g++-5
          - toolset: gcc-6
-            cxxstd: "03,11,14,1z"
-            os: ubuntu-18.04
+            cxxstd: "11,14,1z"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - g++-6
          - toolset: gcc-7
-            cxxstd: "03,11,14,17"
-            os: ubuntu-18.04
+            cxxstd: "11,14,17"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - g++-7
          - toolset: gcc-8
-            cxxstd: "03,11,14,17,2a"
-            os: ubuntu-18.04
+            cxxstd: "11,14,17,2a"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - g++-8
          - toolset: gcc-9
-            cxxstd: "03,11,14,17,2a"
-            os: ubuntu-18.04
+            cxxstd: "11,14,17,2a"
+            os: ubuntu-latest
+            container: ubuntu:20.04
            install:
              - g++-9
          - toolset: gcc-10
-            cxxstd: "03,11,14,17,20"
-            os: ubuntu-20.04
+            cxxstd: "11,14,17,20"
+            os: ubuntu-latest
+            container: ubuntu:20.04
            install:
              - g++-10
          - toolset: gcc-11
-            cxxstd: "03,11,14,17,20"
-            os: ubuntu-20.04
+            cxxstd: "11,14,17,20,23"
+            os: ubuntu-22.04
            install:
              - g++-11
-            sources:
-              - "ppa:ubuntu-toolchain-r/test"
+          - toolset: gcc-12
+            cxxstd: "11,14,17,20,23"
+            os: ubuntu-22.04
+            install:
+              - g++-12
+          - toolset: gcc-13
+            cxxstd: "11,14,17,20,23"
+            os: ubuntu-24.04
+            install:
+              - g++-13
+          - toolset: gcc-14
+            cxxstd: "11,14,17,20,23,26"
+            os: ubuntu-24.04
+            install:
+              - g++-14
+          - toolset: gcc-15
+            cxxstd: "11,14,17,20,23,26"
+            os: ubuntu-latest
+            container: ubuntu:25.04
+            install:
+              - g++-15
          - name: UBSAN
-            toolset: gcc-11
-            cxxstd: "03,11,14,17,20"
+            toolset: gcc-13
+            cxxstd: "11,14,17,20,23"
            ubsan: 1
            build_variant: debug
-            os: ubuntu-20.04
+            os: ubuntu-24.04
            install:
-              - g++-11
-            sources:
-              - "ppa:ubuntu-toolchain-r/test"
+              - g++-13

          # Linux, clang
          - toolset: clang
            compiler: clang++-3.5
-            cxxstd: "03,11"
-            os: ubuntu-20.04
+            cxxstd: "11"
+            os: ubuntu-latest
            container: ubuntu:16.04
            install:
              - clang-3.5
          - toolset: clang
            compiler: clang++-3.6
-            cxxstd: "03,11,14"
-            os: ubuntu-20.04
+            cxxstd: "11,14"
+            os: ubuntu-latest
            container: ubuntu:16.04
            install:
              - clang-3.6
          - toolset: clang
            compiler: clang++-3.7
-            cxxstd: "03,11,14"
-            os: ubuntu-20.04
+            cxxstd: "11,14"
+            os: ubuntu-latest
            container: ubuntu:16.04
            install:
              - clang-3.7
          - toolset: clang
            compiler: clang++-3.8
-            cxxstd: "03,11,14"
-            os: ubuntu-20.04
+            cxxstd: "11,14"
+            os: ubuntu-latest
            container: ubuntu:16.04
            install:
              - clang-3.8
          - toolset: clang
            compiler: clang++-3.9
-            cxxstd: "03,11,14"
-            os: ubuntu-18.04
+            cxxstd: "11,14"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - clang-3.9
          - toolset: clang
            compiler: clang++-4.0
-            cxxstd: "03,11,14"
-            os: ubuntu-18.04
+            cxxstd: "11,14"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - clang-4.0
          - toolset: clang
            compiler: clang++-5.0
-            cxxstd: "03,11,14,1z"
-            os: ubuntu-18.04
+            cxxstd: "11,14,1z"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - clang-5.0
          - toolset: clang
            compiler: clang++-6.0
-            cxxstd: "03,11,14,17"
-            os: ubuntu-18.04
+            cxxstd: "11,14,17"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - clang-6.0
          - toolset: clang
            compiler: clang++-7
-            cxxstd: "03,11,14,17"
-            os: ubuntu-18.04
+            cxxstd: "11,14,17"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - clang-7
          # Note: clang-8 does not fully support C++20, so it is not compatible with libstdc++-8 in this mode
          - toolset: clang
            compiler: clang++-8
-            cxxstd: "03,11,14,17,2a"
-            os: ubuntu-18.04
+            cxxstd: "11,14,17,2a"
+            os: ubuntu-latest
+            container: ubuntu:18.04
            install:
              - clang-8
              - g++-7
            gcc_toolchain: 7
          - toolset: clang
            compiler: clang++-9
-            cxxstd: "03,11,14,17,2a"
-            os: ubuntu-20.04
+            cxxstd: "11,14,17,2a"
+            os: ubuntu-latest
+            container: ubuntu:20.04
            install:
              - clang-9
          - toolset: clang
            compiler: clang++-10
-            cxxstd: "03,11,14,17,20"
-            os: ubuntu-20.04
+            cxxstd: "11,14,17,20"
+            os: ubuntu-latest
+            container: ubuntu:20.04
            install:
              - clang-10
          - toolset: clang
            compiler: clang++-11
-            cxxstd: "03,11,14,17,20"
-            os: ubuntu-20.04
+            cxxstd: "11,14,17,20"
+            os: ubuntu-22.04
            install:
              - clang-11
          - toolset: clang
            compiler: clang++-12
-            cxxstd: "03,11,14,17,20"
-            os: ubuntu-20.04
+            cxxstd: "11,14,17,20,2b"
+            os: ubuntu-22.04
            install:
              - clang-12
+              - g++-11
+            gcc_toolchain: 11
          - toolset: clang
-            compiler: clang++-12
-            cxxstd: "03,11,14,17,20"
-            os: ubuntu-20.04
+            compiler: clang++-13
+            cxxstd: "11,14,17,20,2b"
+            os: ubuntu-22.04
            install:
-              - clang-12
-              - libc++-12-dev
-              - libc++abi-12-dev
+              - clang-13
+              - g++-11
+            gcc_toolchain: 11
+          - toolset: clang
+            compiler: clang++-14
+            cxxstd: "11,14,17,20,2b"
+            os: ubuntu-22.04
+            install:
+              - clang-14
+              - g++-11
+            gcc_toolchain: 11
+          - toolset: clang
+            compiler: clang++-15
+            cxxstd: "11,14,17,20,2b"
+            os: ubuntu-22.04
+            install:
+              - clang-15
+              - g++-11
+            gcc_toolchain: 11
+          - toolset: clang
+            compiler: clang++-16
+            cxxstd: "11,14,17,20,2b"
+            os: ubuntu-24.04
+            install:
+              - clang-16
+              - g++-11
+            gcc_toolchain: 11
+          - toolset: clang
+            compiler: clang++-17
+            cxxstd: "11,14,17,20,23"
+            os: ubuntu-24.04
+            install:
+              - clang-17
+              - g++-11
+            gcc_toolchain: 11
+          - toolset: clang
+            compiler: clang++-18
+            cxxstd: "11,14,17,20,23,26"
+            os: ubuntu-24.04
+            install:
+              - clang-18
+              - g++-13
+          - toolset: clang
+            compiler: clang++-19
+            cxxstd: "11,14,17,20,23,26"
+            os: ubuntu-24.04
+            install:
+              - clang-19
+          - toolset: clang
+            compiler: clang++-20
+            cxxstd: "11,14,17,20,23,26"
+            os: ubuntu-latest
+            container: ubuntu:25.04
+            install:
+              - clang-20
+          - toolset: clang
+            compiler: clang++-20
+            cxxstd: "11,14,17,20,23,26"
+            os: ubuntu-latest
+            container: ubuntu:25.04
+            install:
+              - clang-20
+              - libc++-20-dev
+              - libc++abi-20-dev
            cxxflags: -stdlib=libc++
            linkflags: -stdlib=libc++
          - name: UBSAN
            toolset: clang
-            compiler: clang++-12
-            cxxstd: "03,11,14,17,20"
+            compiler: clang++-18
+            cxxstd: "11,14,17,20,23"
            cxxflags: -stdlib=libc++
-            linkflags: -stdlib=libc++
+            linkflags: "-stdlib=libc++ -lubsan"
            ubsan: 1
            build_variant: debug
-            os: ubuntu-20.04
+            os: ubuntu-24.04
            install:
-              - clang-12
-              - libc++-12-dev
-              - libc++abi-12-dev
+              - clang-18
+              - libc++-18-dev
+              - libc++abi-18-dev

          - toolset: clang
-            cxxstd: "03,11,14,17,2a"
-            os: macos-10.15
+            cxxstd: "11,14,17,20,2b"
+            os: macos-13
+          - toolset: clang
+            cxxstd: "11,14,17,20,2b"
+            os: macos-14

-    timeout-minutes: 60
+    timeout-minutes: 15
    runs-on: ${{matrix.os}}
    container: ${{matrix.container}}

@ -252,14 +333,34 @@ jobs:
                echo "GHA_CONTAINER=${{matrix.container}}" >> $GITHUB_ENV
                if [ -f "/etc/debian_version" ]
                then
+                    # Use Azure APT mirrors in containers to avoid HTTP errors due to DDoS filters triggered by lots of CI jobs launching concurrently.
+                    # Note that not all Ubuntu versions support "mirror+file:..." URIs in APT sources, so just use Azure mirrors exclusively.
+                    # Note also that on recent Ubuntu versions DEB822 format is used for source files.
+                    APT_SOURCES=()
+                    if [ -d "/etc/apt/sources.list.d" ]
+                    then
+                        readarray -t APT_SOURCES < <(find "/etc/apt/sources.list.d" -type f -name '*.sources' -print)
+                    fi
+                    if [ -f "/etc/apt/sources.list" ]
+                    then
+                        APT_SOURCES+=("/etc/apt/sources.list")
+                    fi
+                    if [ "${#APT_SOURCES[@]}" -gt 0 ]
+                    then
+                        sed -i -E -e 's!([^ ]+) (http|https)://(archive|security)\.ubuntu\.com/ubuntu[^ ]*(.*)!\1 http://azure.archive.ubuntu.com/ubuntu/\4!' "${APT_SOURCES[@]}"
+                    fi
                    apt-get -o Acquire::Retries=$NET_RETRY_COUNT update
-                    apt-get -o Acquire::Retries=$NET_RETRY_COUNT install -y sudo software-properties-common tzdata wget curl apt-transport-https ca-certificates make build-essential g++ python python3 perl git cmake
+                    if [ "$(apt-cache search "^python-is-python3$" | wc -l)" -ne 0 ]
+                    then
+                        PYTHON_PACKAGE="python-is-python3"
+                    else
+                        PYTHON_PACKAGE="python"
+                    fi
+                    apt-get -o Acquire::Retries=$NET_RETRY_COUNT install -y sudo software-properties-common tzdata wget curl apt-transport-https ca-certificates make build-essential g++ $PYTHON_PACKAGE python3 perl git cmake
                fi
            fi
            git config --global pack.threads 0

-      - uses: actions/checkout@v2
-
      - name: Install packages
        if: matrix.install
        run: |
@ -374,11 +475,25 @@ jobs:
            then
                DEPINST_ARGS+=("--git_args" "--jobs $GIT_FETCH_JOBS")
            fi
+            mkdir -p snapshot
+            cd snapshot
+            echo "Downloading library snapshot: https://github.com/${GITHUB_REPOSITORY}/archive/${GITHUB_SHA}.tar.gz"
+            curl -L --retry "$NET_RETRY_COUNT" -o "${LIBRARY}-${GITHUB_SHA}.tar.gz" "https://github.com/${GITHUB_REPOSITORY}/archive/${GITHUB_SHA}.tar.gz"
+            tar -xf "${LIBRARY}-${GITHUB_SHA}.tar.gz"
+            if [ ! -d "${LIBRARY}-${GITHUB_SHA}" ]
+            then
+                echo "Library snapshot does not contain the library directory ${LIBRARY}-${GITHUB_SHA}:"
+                ls -la
+                exit 1
+            fi
+            rm -f "${LIBRARY}-${GITHUB_SHA}.tar.gz"
            cd ..
            git clone -b "$BOOST_BRANCH" --depth 1 "https://github.com/boostorg/boost.git" "boost-root"
            cd boost-root
-            mkdir -p libs/$LIBRARY
-            cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
+            mkdir -p libs
+            rm -rf "libs/$LIBRARY"
+            mv -f "../snapshot/${LIBRARY}-${GITHUB_SHA}" "libs/$LIBRARY"
+            rm -rf "../snapshot"
            git submodule update --init tools/boostdep
            DEPINST_ARGS+=("$LIBRARY")
            python tools/boostdep/depinst/depinst.py "${DEPINST_ARGS[@]}"
@ -400,7 +515,7 @@ jobs:
      - name: Run tests
        if: matrix.cmake_tests == ''
        run: |
-            cd ../boost-root
+            cd boost-root
            B2_ARGS=("-j" "$BUILD_JOBS" "toolset=${{matrix.toolset}}" "cxxstd=${{matrix.cxxstd}}")
            if [ -n "${{matrix.build_variant}}" ]
            then
@ -427,3 +542,70 @@ jobs:
            fi
            B2_ARGS+=("libs/$LIBRARY/test")
            ./b2 "${B2_ARGS[@]}"
+
+  windows:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - toolset: msvc-14.3
+            cxxstd: "14,17,20,latest"
+            addrmd: 32,64
+            os: windows-2022
+          - toolset: clang-win
+            cxxstd: "14,17,latest"
+            addrmd: 32,64
+            os: windows-2022
+          - toolset: gcc
+            cxxstd: "11,14,17,20,23"
+            addrmd: 64
+            os: windows-2022
+
+    timeout-minutes: 15
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - name: Setup Boost
+        shell: cmd
+        run: |
+            echo GITHUB_REPOSITORY: %GITHUB_REPOSITORY%
+            for /f %%i in ("%GITHUB_REPOSITORY%") do set LIBRARY=%%~nxi
+            echo LIBRARY: %LIBRARY%
+            echo LIBRARY=%LIBRARY%>>%GITHUB_ENV%
+            echo GITHUB_BASE_REF: %GITHUB_BASE_REF%
+            echo GITHUB_REF: %GITHUB_REF%
+            if "%GITHUB_BASE_REF%" == "" set GITHUB_BASE_REF=%GITHUB_REF%
+            set BOOST_BRANCH=develop
+            for /f %%i in ("%GITHUB_BASE_REF%") do if "%%~nxi" == "master" set BOOST_BRANCH=master
+            echo BOOST_BRANCH: %BOOST_BRANCH%
+            mkdir snapshot
+            cd snapshot
+            echo Downloading library snapshot: https://github.com/%GITHUB_REPOSITORY%/archive/%GITHUB_SHA%.zip
+            curl -L --retry %NET_RETRY_COUNT% -o "%LIBRARY%-%GITHUB_SHA%.zip" "https://github.com/%GITHUB_REPOSITORY%/archive/%GITHUB_SHA%.zip"
+            tar -xf "%LIBRARY%-%GITHUB_SHA%.zip"
+            if not exist "%LIBRARY%-%GITHUB_SHA%\" (
+                echo Library snapshot does not contain the library directory %LIBRARY%-%GITHUB_SHA%:
+                dir
+                exit /b 1
+            )
+            del /f "%LIBRARY%-%GITHUB_SHA%.zip"
+            cd ..
+            git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+            cd boost-root
+            if not exist "libs\" mkdir libs
+            if exist "libs\%LIBRARY%\" rmdir /s /q "libs\%LIBRARY%"
+            move /Y "..\snapshot\%LIBRARY%-%GITHUB_SHA%" "libs\%LIBRARY%"
+            rmdir /s /q "..\snapshot"
+            git submodule update --init tools/boostdep
+            python tools/boostdep/depinst/depinst.py --git_args "--jobs %GIT_FETCH_JOBS%" %LIBRARY%
+            cmd /c bootstrap
+            b2 -d0 headers
+
+      - name: Run tests
+        shell: cmd
+        run: |
+            cd boost-root
+            if not "${{matrix.cxxstd}}" == "" set CXXSTD=cxxstd=${{matrix.cxxstd}}
+            if not "${{matrix.addrmd}}" == "" set ADDRMD=address-model=${{matrix.addrmd}}
+            if not "${{matrix.build_variant}}" == "" (set BUILD_VARIANT=variant=${{matrix.build_variant}}) else (set BUILD_VARIANT=variant=%DEFAULT_BUILD_VARIANT%)
+            b2 -j %NUMBER_OF_PROCESSORS% libs/%LIBRARY%/test toolset=${{matrix.toolset}} %CXXSTD% %ADDRMD% %BUILD_VARIANT% embed-manifest-via=linker
--- a/Assignable.html
+++ b/Assignable.html
@ -1,19 +1,109 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-  <title>Boost.Utility</title>
-  <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Assignable</title>
 </head>
-<body>
-Automatic redirection failed, please go to
-<a href="./doc/html/index.html">./doc/html/index.html</a>
-<hr>
-<tt>
-  Boost.Utility<br>
-  <br>
-  Distributed under the Boost Software License, Version 1.0.
-  (See accompanying file LICENSE_1_0.txt or copy at
-  <a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
-  <br>
-</tt>
+
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
+
+  <h1>Assignable</h1>
+
+  <h3>Description</h3>
+
+  <p>A type is Assignable if it is possible to assign one object of the type
+  to another object of that type.</p>
+
+  <h3>Notation</h3>
+
+  <table summary="">
+    <tr>
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top">is type that is a model of Assignable</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>t</tt></td>
+
+      <td valign="top">is an object of type <tt>T</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>u</tt></td>
+
+      <td valign="top">is an object of type <tt>T</tt> or possibly <tt>const
+      T</tt></td>
+    </tr>
+  </table>
+
+  <h3>Definitions</h3>
+
+  <h3>Valid expressions</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Assignment</td>
+
+      <td valign="top"><tt>t = u</tt></td>
+
+      <td valign="top"><tt>T&amp;</tt></td>
+
+      <td valign="top"><tt>t</tt> is equivalent to <tt>u</tt></td>
+    </tr>
+  </table>
+
+  <h3>Models</h3>
+
+  <ul>
+    <li><tt>int</tt></li>
+
+    <li><tt>std::pair</tt></li>
+  </ul>
+
+  <h3>See also</h3>
+
+  <p><a href=
+  "http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>
+  and <a href="./CopyConstructible.html">CopyConstructible</a><br></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "../../doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>
--- a/Collection.html
+++ b/Collection.html
@ -1,19 +1,534 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-  <title>Boost.Utility</title>
-  <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Collection</title>
 </head>
-<body>
-Automatic redirection failed, please go to
-<a href="./doc/html/index.html">./doc/html/index.html</a>
-<hr>
-<tt>
-  Boost.Utility<br>
-  <br>
-  Distributed under the Boost Software License, Version 1.0.
-  (See accompanying file LICENSE_1_0.txt or copy at
-  <a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
-  <br>
-</tt>
+
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <h1><img src="../../boost.png" alt="boost logo" width="277" align="middle"
+  height="86"><br>
+  Collection</h1>
+
+  <h3>Description</h3>
+
+  <p>A Collection is a <i>concept</i> similar to the STL <a href=
+  "http://www.sgi.com/tech/stl/Container.html">Container</a> concept. A
+  Collection provides iterators for accessing a range of elements and
+  provides information about the number of elements in the Collection.
+  However, a Collection has fewer requirements than a Container. The
+  motivation for the Collection concept is that there are many useful
+  Container-like types that do not meet the full requirements of Container,
+  and many algorithms that can be written with this reduced set of
+  requirements. To summarize the reduction in requirements:</p>
+
+  <ul>
+    <li>It is not required to "own" its elements: the lifetime of an element
+    in a Collection does not have to match the lifetime of the Collection
+    object, though the lifetime of the element should cover the lifetime of
+    the Collection object.</li>
+
+    <li>The semantics of copying a Collection object is not defined (it could
+    be a deep or shallow copy or not even support copying).</li>
+
+    <li>The associated reference type of a Collection does not have to be a
+    real C++ reference.</li>
+  </ul>Because of the reduced requirements, some care must be taken when
+  writing code that is meant to be generic for all Collection types. In
+  particular, a Collection object should be passed by-reference since
+  assumptions can not be made about the behaviour of the copy constructor.
+
+  <h3>Associated types</h3>
+
+  <table border summary="">
+    <tr>
+      <td valign="top">Value type</td>
+
+      <td valign="top"><tt>X::value_type</tt></td>
+
+      <td valign="top">The type of the object stored in a Collection. If the
+      Collection is <i>mutable</i> then the value type must be <a href=
+      "http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>. Otherwise
+      the value type must be <a href=
+      "./CopyConstructible.html">CopyConstructible</a>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Iterator type</td>
+
+      <td valign="top"><tt>X::iterator</tt></td>
+
+      <td valign="top">The type of iterator used to iterate through a
+      Collection's elements. The iterator's value type is expected to be the
+      Collection's value type. A conversion from the iterator type to the
+      const iterator type must exist. The iterator type must be an <a href=
+      "http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Const iterator type</td>
+
+      <td valign="top"><tt>X::const_iterator</tt></td>
+
+      <td valign="top">A type of iterator that may be used to examine, but
+      not to modify, a Collection's elements.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Reference type</td>
+
+      <td valign="top"><tt>X::reference</tt></td>
+
+      <td valign="top">A type that behaves like a reference to the
+      Collection's value type. <a href="#n1">[1]</a></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Const reference type</td>
+
+      <td valign="top"><tt>X::const_reference</tt></td>
+
+      <td valign="top">A type that behaves like a const reference to the
+      Collection's value type.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Pointer type</td>
+
+      <td valign="top"><tt>X::pointer</tt></td>
+
+      <td valign="top">A type that behaves as a pointer to the Collection's
+      value type.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Distance type</td>
+
+      <td valign="top"><tt>X::difference_type</tt></td>
+
+      <td valign="top">A signed integral type used to represent the distance
+      between two of the Collection's iterators. This type must be the same
+      as the iterator's distance type.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Size type</td>
+
+      <td valign="top"><tt>X::size_type</tt></td>
+
+      <td valign="top">An unsigned integral type that can represent any
+      nonnegative value of the Collection's distance type.</td>
+    </tr>
+  </table>
+
+  <h3>Notation</h3>
+
+  <table summary="">
+    <tr>
+      <td valign="top"><tt>X</tt></td>
+
+      <td valign="top">A type that is a model of Collection.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>a</tt>, <tt>b</tt></td>
+
+      <td valign="top">Object of type <tt>X</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top">The value type of <tt>X</tt>.</td>
+    </tr>
+  </table>
+
+  <h3>Valid expressions</h3>
+
+  <p>The following expressions must be valid.</p>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Beginning of range</td>
+
+      <td valign="top"><tt>a.begin()</tt></td>
+
+      <td valign="top"><tt>iterator</tt> if <tt>a</tt> is mutable,
+      <tt>const_iterator</tt> otherwise</td>
+    </tr>
+
+    <tr>
+      <td valign="top">End of range</td>
+
+      <td valign="top"><tt>a.end()</tt></td>
+
+      <td valign="top"><tt>iterator</tt> if <tt>a</tt> is mutable,
+      <tt>const_iterator</tt> otherwise</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Size</td>
+
+      <td valign="top"><tt>a.size()</tt></td>
+
+      <td valign="top"><tt>size_type</tt></td>
+    </tr><!--
+<TR>
+<TD VAlign=top>
+Maximum size
+</TD>
+<TD VAlign=top>
+<tt>a.max_size()</tt>
+</TD>
+<TD VAlign=top>
+<tt>size_type</tt>
+</TD>
+</TR>
+-->
+
+    <tr>
+      <td valign="top">Empty Collection</td>
+
+      <td valign="top"><tt>a.empty()</tt></td>
+
+      <td valign="top">Convertible to <tt>bool</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Swap</td>
+
+      <td valign="top"><tt>a.swap(b)</tt></td>
+
+      <td valign="top"><tt>void</tt></td>
+    </tr>
+  </table>
+
+  <h3>Expression semantics</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Semantics</th>
+
+      <th>Postcondition</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Beginning of range</td>
+
+      <td valign="top"><tt>a.begin()</tt></td>
+
+      <td valign="top">Returns an iterator pointing to the first element in
+      the Collection.</td>
+
+      <td valign="top"><tt>a.begin()</tt> is either dereferenceable or
+      past-the-end. It is past-the-end if and only if <tt>a.size() ==
+      0</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">End of range</td>
+
+      <td valign="top"><tt>a.end()</tt></td>
+
+      <td valign="top">Returns an iterator pointing one past the last element
+      in the Collection.</td>
+
+      <td valign="top"><tt>a.end()</tt> is past-the-end.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Size</td>
+
+      <td valign="top"><tt>a.size()</tt></td>
+
+      <td valign="top">Returns the size of the Collection, that is, its
+      number of elements.</td>
+
+      <td valign="top"><tt>a.size() &gt;= 0</tt></td>
+    </tr><!--
+<TR>
+<TD VAlign=top>
+Maximum size
+</TD>
+<TD VAlign=top>
+<tt>a.max_size()</tt>
+</TD>
+<TD VAlign=top>
+&nbsp;
+</TD>
+<TD VAlign=top>
+Returns the largest size that this Collection can ever have. <A href="#8">[8]</A>
+</TD>
+<TD VAlign=top>
+<tt>a.max_size() &gt;= 0 &amp;&amp; a.max_size() &gt;= a.size()</tt>
+</TD>
+</TR>
+ -->
+
+    <tr>
+      <td valign="top">Empty Collection</td>
+
+      <td valign="top"><tt>a.empty()</tt></td>
+
+      <td valign="top">Equivalent to <tt>a.size() == 0</tt>. (But possibly
+      faster.)</td>
+
+      <td valign="top">&nbsp;</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Swap</td>
+
+      <td valign="top"><tt>a.swap(b)</tt></td>
+
+      <td valign="top">Equivalent to <tt>swap(a,b)</tt></td>
+
+      <td valign="top">&nbsp;</td>
+    </tr>
+  </table>
+
+  <h3>Complexity guarantees</h3>
+
+  <p><tt>begin()</tt> and <tt>end()</tt> are amortized constant time.</p>
+
+  <p><tt>size()</tt> is at most linear in the Collection's size.
+  <tt>empty()</tt> is amortized constant time.</p>
+
+  <p><tt>swap()</tt> is at most linear in the size of the two
+  collections.</p>
+
+  <h3>Invariants</h3>
+
+  <table border summary="">
+    <tr>
+      <td valign="top">Valid range</td>
+
+      <td valign="top">For any Collection <tt>a</tt>, <tt>[a.begin(),
+      a.end())</tt> is a valid range.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Range size</td>
+
+      <td valign="top"><tt>a.size()</tt> is equal to the distance from
+      <tt>a.begin()</tt> to <tt>a.end()</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Completeness</td>
+
+      <td valign="top">An algorithm that iterates through the range
+      <tt>[a.begin(), a.end())</tt> will pass through every element of
+      <tt>a</tt>.</td>
+    </tr>
+  </table>
+
+  <h3>Models</h3>
+
+  <ul>
+    <li><tt>array</tt></li>
+
+    <li><tt>array_ptr</tt></li>
+
+    <li><tt>vector&lt;bool&gt;</tt></li>
+  </ul>
+
+  <h3>Collection Refinements</h3>
+
+  <p>There are quite a few concepts that refine the Collection concept,
+  similar to the concepts that refine the Container concept. Here is a brief
+  overview of the refining concepts.</p>
+
+  <h4>ForwardCollection</h4>
+
+  <p>The elements are arranged in some order that does not change
+  spontaneously from one iteration to the next. As a result, a
+  ForwardCollection is <a href=
+  "http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</a>
+  and <a href=
+  "http://www.sgi.com/tech/stl/LessThanComparable.html">LessThanComparable</a>.
+  In addition, the iterator type of a ForwardCollection is a
+  MultiPassInputIterator which is just an InputIterator with the added
+  requirements that the iterator can be used to make multiple passes through
+  a range, and that if <tt>it1 == it2</tt> and <tt>it1</tt> is
+  dereferenceable then <tt>++it1 == ++it2</tt>. The ForwardCollection also
+  has a <tt>front()</tt> method.</p>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Front</td>
+
+      <td valign="top"><tt>a.front()</tt></td>
+
+      <td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,<br>
+      <tt>const_reference</tt> otherwise.</td>
+
+      <td valign="top">Equivalent to <tt>*(a.begin())</tt>.</td>
+    </tr>
+  </table>
+
+  <h4>ReversibleCollection</h4>
+
+  <p>The container provides access to iterators that traverse in both
+  directions (forward and reverse). The iterator type must meet all of the
+  requirements of <a href=
+  "http://www.sgi.com/tech/stl/BidirectionalIterator.html">BidirectionalIterator</a>
+  except that the reference type does not have to be a real C++ reference.
+  The ReversibleCollection adds the following requirements to those of
+  ForwardCollection.</p>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Beginning of range</td>
+
+      <td valign="top"><tt>a.rbegin()</tt></td>
+
+      <td valign="top"><tt>reverse_iterator</tt> if <tt>a</tt> is mutable,
+      <tt>const_reverse_iterator</tt> otherwise.</td>
+
+      <td valign="top">Equivalent to
+      <tt>X::reverse_iterator(a.end())</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">End of range</td>
+
+      <td valign="top"><tt>a.rend()</tt></td>
+
+      <td valign="top"><tt>reverse_iterator</tt> if <tt>a</tt> is mutable,
+      <tt>const_reverse_iterator</tt> otherwise.</td>
+
+      <td valign="top">Equivalent to
+      <tt>X::reverse_iterator(a.begin())</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Back</td>
+
+      <td valign="top"><tt>a.back()</tt></td>
+
+      <td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,<br>
+      <tt>const_reference</tt> otherwise.</td>
+
+      <td valign="top">Equivalent to <tt>*(--a.end())</tt>.</td>
+    </tr>
+  </table>
+
+  <h4>SequentialCollection</h4>
+
+  <p>The elements are arranged in a strict linear order. No extra methods are
+  required.</p>
+
+  <h4>RandomAccessCollection</h4>
+
+  <p>The iterators of a RandomAccessCollection satisfy all of the
+  requirements of <a href=
+  "http://www.sgi.com/tech/stl/RandomAccessIterator.html">RandomAccessIterator</a>
+  except that the reference type does not have to be a real C++ reference. In
+  addition, a RandomAccessCollection provides an element access operator.</p>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Element Access</td>
+
+      <td valign="top"><tt>a[n]</tt></td>
+
+      <td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,
+      <tt>const_reference</tt> otherwise.</td>
+
+      <td valign="top">Returns the nth element of the Collection. <tt>n</tt>
+      must be convertible to <tt>size_type</tt>. Precondition: <tt>0 &lt;= n
+      &lt; a.size()</tt>.</td>
+    </tr>
+  </table>
+
+  <h3>Notes</h3>
+
+  <p><a name="n1" id="n1">[1]</a> The reference type does not have to be a
+  real C++ reference. The requirements of the reference type depend on the
+  context within which the Collection is being used. Specifically it depends
+  on the requirements the context places on the value type of the Collection.
+  The reference type of the Collection must meet the same requirements as the
+  value type. In addition, the reference objects must be equivalent to the
+  value type objects in the collection (which is trivially true if they are
+  the same object). Also, in a mutable Collection, an assignment to the
+  reference object must result in an assignment to the object in the
+  Collection (again, which is trivially true if they are the same object, but
+  non-trivial if the reference type is a proxy class).</p>
+
+  <h3>See also</h3>
+
+  <p><a href=
+  "http://www.sgi.com/tech/stl/Container.html">Container</a><br></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "../../doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.boost.org/people/jeremy_siek.htm">Jeremy
+      Siek</a>, Univ.of Notre Dame and C++ Library &amp; Compiler Group/SGI
+      (<a href="mailto:jsiek@engr.sgi.com">jsiek@engr.sgi.com</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>
--- a/CopyConstructible.html
+++ b/CopyConstructible.html
@ -1,19 +1,185 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-  <title>Boost.Utility</title>
-  <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Copy Constructible</title>
 </head>
-<body>
-Automatic redirection failed, please go to
-<a href="./doc/html/index.html">./doc/html/index.html</a>
-<hr>
-<tt>
-  Boost.Utility<br>
-  <br>
-  Distributed under the Boost Software License, Version 1.0.
-  (See accompanying file LICENSE_1_0.txt or copy at
-  <a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
-  <br>
-</tt>
+
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
+
+  <h1>Copy Constructible</h1>
+
+  <h3>Description</h3>
+
+  <p>A type is Copy Constructible if it is possible to copy objects of that
+  type.</p>
+
+  <h3>Notation</h3>
+
+  <table summary="">
+    <tr>
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top">is type that is a model of Copy Constructible</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>t</tt></td>
+
+      <td valign="top">is an object of type <tt>T</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>u</tt></td>
+
+      <td valign="top">is an object of type <tt>const T</tt></td>
+    </tr>
+  </table>
+
+  <h3>Definitions</h3>
+
+  <h3>Valid expressions</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Copy constructor</td>
+
+      <td valign="top"><tt>T(t)</tt></td>
+
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top"><tt>t</tt> is equivalent to <tt>T(t)</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Copy constructor</td>
+
+      <td valign="top">
+        <pre>
+T(u)
+</pre>
+      </td>
+
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top"><tt>u</tt> is equivalent to <tt>T(u)</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Destructor</td>
+
+      <td valign="top">
+        <pre>
+t.~T()
+</pre>
+      </td>
+
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top">&nbsp;</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Address Operator</td>
+
+      <td valign="top">
+        <pre>
+&amp;t
+</pre>
+      </td>
+
+      <td valign="top"><tt>T*</tt></td>
+
+      <td valign="top">denotes the address of <tt>t</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Address Operator</td>
+
+      <td valign="top">
+        <pre>
+&amp;u
+</pre>
+      </td>
+
+      <td valign="top"><tt>T*</tt></td>
+
+      <td valign="top">denotes the address of <tt>u</tt></td>
+    </tr>
+  </table>
+
+  <h3>Models</h3>
+
+  <ul>
+    <li><tt>int</tt></li>
+
+    <li><tt>std::pair</tt></li>
+  </ul>
+
+  <h3>Concept Checking Class</h3>
+  <pre>
+  template &lt;class T&gt;
+  struct CopyConstructibleConcept
+  {
+    void constraints() {
+      T a(b);            // require copy constructor
+      T* ptr = &amp;a;       // require address of operator
+      const_constraints(a);
+      ignore_unused_variable_warning(ptr);
+    }
+    void const_constraints(const T&amp; a) {
+      T c(a);            // require const copy constructor
+      const T* ptr = &amp;a; // require const address of operator
+      ignore_unused_variable_warning(c);
+      ignore_unused_variable_warning(ptr);
+    }
+    T b;
+  };
+</pre>
+
+  <h3>See also</h3>
+
+  <p><a href="http://www.sgi.com/tech/stl/DefaultConstructible.html">Default
+  Constructible</a> and <a href="./Assignable.html">Assignable</a><br></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "../../doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>
--- a/LessThanComparable.html
+++ b/LessThanComparable.html
@ -1,19 +1,210 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<!--
+  == Copyright (c) 1996-1999
+  == Silicon Graphics Computer Systems, Inc.
+  ==
+  == Permission to use, copy, modify, distribute and sell this software
+  == and its documentation for any purpose is hereby granted without fee,
+  == provided that the above copyright notice appears in all copies and
+  == that both that copyright notice and this permission notice appear
+  == in supporting documentation.  Silicon Graphics makes no
+  == representations about the suitability of this software for any
+  == purpose.  It is provided "as is" without express or implied warranty.
+  ==
+  == Copyright (c) 1994
+  == Hewlett-Packard Company
+  ==
+  == Permission to use, copy, modify, distribute and sell this software
+  == and its documentation for any purpose is hereby granted without fee,
+  == provided that the above copyright notice appears in all copies and
+  == that both that copyright notice and this permission notice appear
+  == in supporting documentation.  Hewlett-Packard Company makes no
+  == representations about the suitability of this software for any
+  == purpose.  It is provided "as is" without express or implied warranty.
+  ==
+  -->
+
 <head>
-  <title>Boost.Utility</title>
-  <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>LessThanComparable</title>
 </head>
-<body>
-Automatic redirection failed, please go to
-<a href="./doc/html/index.html">./doc/html/index.html</a>
-<hr>
-<tt>
-  Boost.Utility<br>
-  <br>
-  Distributed under the Boost Software License, Version 1.0.
-  (See accompanying file LICENSE_1_0.txt or copy at
-  <a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
-  <br>
-</tt>
+
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
+
+  <h1>LessThanComparable</h1>
+
+  <h3>Description</h3>
+
+  <p>A type is LessThanComparable if it is ordered: it must be possible to
+  compare two objects of that type using <tt>operator&lt;</tt>, and
+  <tt>operator&lt;</tt> must be a strict weak ordering relation.</p>
+
+  <h3>Refinement of</h3>
+
+  <h3>Associated types</h3>
+
+  <h3>Notation</h3>
+
+  <table summary="">
+    <tr>
+      <td valign="top"><tt>X</tt></td>
+
+      <td valign="top">A type that is a model of LessThanComparable</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>x</tt>, <tt>y</tt>, <tt>z</tt></td>
+
+      <td valign="top">Object of type <tt>X</tt></td>
+    </tr>
+  </table>
+
+  <h3>Definitions</h3>
+
+  <p>Consider the relation <tt>!(x &lt; y) &amp;&amp; !(y &lt; x)</tt>. If
+  this relation is transitive (that is, if <tt>!(x &lt; y) &amp;&amp; !(y
+  &lt; x) &amp;&amp; !(y &lt; z) &amp;&amp; !(z &lt; y)</tt> implies <tt>!(x
+  &lt; z) &amp;&amp; !(z &lt; x)</tt>), then it satisfies the mathematical
+  definition of an equivalence relation. In this case, <tt>operator&lt;</tt>
+  is a <i>strict weak ordering</i>.</p>
+
+  <p>If <tt>operator&lt;</tt> is a strict weak ordering, and if each
+  equivalence class has only a single element, then <tt>operator&lt;</tt> is
+  a <i>total ordering</i>.</p>
+
+  <h3>Valid expressions</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Type requirements</th>
+
+      <th>Return type</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Less</td>
+
+      <td valign="top"><tt>x &lt; y</tt></td>
+
+      <td valign="top">&nbsp;</td>
+
+      <td valign="top">Convertible to <tt>bool</tt></td>
+    </tr>
+  </table>
+
+  <h3>Expression semantics</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Precondition</th>
+
+      <th>Semantics</th>
+
+      <th>Postcondition</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Less</td>
+
+      <td valign="top"><tt>x &lt; y</tt></td>
+
+      <td valign="top"><tt>x</tt> and <tt>y</tt> are in the domain of
+      <tt>&lt;</tt></td>
+
+      <td valign="top">&nbsp;</td>
+    </tr>
+  </table>
+
+  <h3>Complexity guarantees</h3>
+
+  <h3>Invariants</h3>
+
+  <table border summary="">
+    <tr>
+      <td valign="top">Irreflexivity</td>
+
+      <td valign="top"><tt>x &lt; x</tt> must be false.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Antisymmetry</td>
+
+      <td valign="top"><tt>x &lt; y</tt> implies !(y &lt; x) <a href=
+      "#n2">[2]</a></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Transitivity</td>
+
+      <td valign="top"><tt>x &lt; y</tt> and <tt>y &lt; z</tt> implies <tt>x
+      &lt; z</tt> <a href="#n3">[3]</a></td>
+    </tr>
+  </table>
+
+  <h3>Models</h3>
+
+  <ul>
+    <li>int</li>
+  </ul>
+
+  <h3>Notes</h3>
+
+  <p><a name="n1" id="n1">[1]</a> Only <tt>operator&lt;</tt> is fundamental;
+  the other inequality operators are essentially syntactic sugar.</p>
+
+  <p><a name="n2" id="n2">[2]</a> Antisymmetry is a theorem, not an axiom: it
+  follows from irreflexivity and transitivity.</p>
+
+  <p><a name="n3" id="n3">[3]</a> Because of irreflexivity and transitivity,
+  <tt>operator&lt;</tt> always satisfies the definition of a <i>partial
+  ordering</i>. The definition of a <i>strict weak ordering</i> is stricter,
+  and the definition of a <i>total ordering</i> is stricter still.</p>
+
+  <h3>See also</h3>
+
+  <p><a href=
+  "http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</a>,
+  <a href=
+  "http://www.sgi.com/tech/stl/StrictWeakOrdering.html">StrictWeakOrdering</a><br>
+  </p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "../../doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>
--- a/MultiPassInputIterator.html
+++ b/MultiPassInputIterator.html
@ -1,19 +1,95 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-  <title>Boost.Utility</title>
-  <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>MultiPassInputIterator</title>
 </head>
-<body>
-Automatic redirection failed, please go to
-<a href="./doc/html/index.html">./doc/html/index.html</a>
-<hr>
-<tt>
-  Boost.Utility<br>
-  <br>
-  Distributed under the Boost Software License, Version 1.0.
-  (See accompanying file LICENSE_1_0.txt or copy at
-  <a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
-  <br>
-</tt>
+
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
+
+  <h2><a name="concept:MultiPassInputIterator" id=
+  "concept:MultiPassInputIterator"></a> Multi-Pass Input Iterator</h2>
+
+  <p>This concept is a refinement of <a href=
+  "http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>, adding
+  the requirements that the iterator can be used to make multiple passes
+  through a range, and that if <tt>it1 == it2</tt> and <tt>it1</tt> is
+  dereferenceable then <tt>++it1 == ++it2</tt>. The Multi-Pass Input Iterator
+  is very similar to the <a href=
+  "http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>.
+  The only difference is that a <a href=
+  "http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>
+  requires the <tt>reference</tt> type to be <tt>value_type&amp;</tt>,
+  whereas MultiPassInputIterator is like <a href=
+  "http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> in that
+  the <tt>reference</tt> type merely has to be convertible to
+  <tt>value_type</tt>.</p>
+
+  <h3>Design Notes</h3>
+
+  <p>comments by Valentin Bonnard:</p>
+
+  <p>I think that introducing Multi-Pass Input Iterator isn't the right
+  solution. Do you also want to define Multi-Pass Bidirectionnal Iterator and
+  Multi-Pass Random Access Iterator ? I don't, definitly. It only confuses
+  the issue. The problem lies into the existing hierarchy of iterators, which
+  mixes movabillity, modifiabillity and lvalue-ness, and these are clearly
+  independant.</p>
+
+  <p>The terms Forward, Bidirectionnal and Random Access are about
+  movabillity and shouldn't be used to mean anything else. In a completly
+  orthogonal way, iterators can be immutable, mutable, or neither. Lvalueness
+  of iterators is also orthogonal with immutabillity. With these clean
+  concepts, your Multi-Pass Input Iterator is just called a Forward
+  Iterator.</p>
+
+  <p>Other translations are:<br>
+  std::Forward Iterator -&gt; ForwardIterator &amp; Lvalue Iterator<br>
+  std::Bidirectionnal Iterator -&gt; Bidirectionnal Iterator &amp; Lvalue
+  Iterator<br>
+  std::Random Access Iterator -&gt; Random Access Iterator &amp; Lvalue
+  Iterator<br></p>
+
+  <p>Note that in practice the only operation not allowed on my Forward
+  Iterator which is allowed on std::Forward Iterator is <tt>&amp;*it</tt>. I
+  think that <tt>&amp;*</tt> is rarely needed in generic code.</p>
+
+  <p>reply by Jeremy Siek:</p>
+
+  <p>The above analysis by Valentin is right on. Of course, there is the
+  problem with backward compatibility. The current STL implementations are
+  based on the old definition of Forward Iterator. The right course of action
+  is to get Forward Iterator, etc. changed in the C++ standard. Once that is
+  done we can drop Multi-Pass Input Iterator.<br></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "../../doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>
--- a/OptionalPointee.html
+++ b/OptionalPointee.html
@ -1,19 +1,159 @@
-<html>
-<head>
-  <title>Boost.Utility</title>
-  <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
-</head>
-<body>
-Automatic redirection failed, please go to
-<a href="./doc/html/index.html">./doc/html/index.html</a>
-<hr>
-<tt>
-  Boost.Utility<br>
-  <br>
-  Distributed under the Boost Software License, Version 1.0.
-  (See accompanying file LICENSE_1_0.txt or copy at
-  <a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
-  <br>
-</tt>
-</body>
-</html>
+<HTML>
+<Head>
+<Title>OptionalPointee Concept</Title>
+</HEAD>
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 
+<!--end header-->
+<BR Clear>
+<H1>Concept: OptionalPointee</H1>
+
+<h3>Description</h3>
+A type is a model of <i>OptionalPointee</i> if it points to (or refers to) a value 
+that may not exist. That is, if it has a <b>pointee</b> which might be <b>valid</b>
+(existent) or <b>invalid</b> (inexistent); and it is possible to test whether the 
+pointee is valid or not.
+This model does <u>not</u> imply pointer semantics: i.e., it does not imply shallow copy nor
+aliasing.
+<h3>Notation</h3>
+<Table>
+  <TR>
+    <TD VAlign=top> <tt>T</tt> </TD>
+    <TD VAlign=top> is a type that is a model of OptionalPointee</TD>
+  </TR>
+  <TR>
+    <TD VAlign=top> <tt>t</tt> </TD>
+    <TD VAlign=top> is an object of type <tt>T</tt> or possibly <tt>const T</tt></TD>
+  </tr>
+</table>
+<h3>Definitions</h3>
+<h3>Valid expressions</h3>
+<Table border>
+  <TR>
+    <TH> Name </TH>
+    <TH> Expression </TH>
+    <TH> Return type </TH>
+    <TH> Semantics </TH>
+  </TR>
+  <TR>
+    <TD VAlign=top>Value Access</TD>
+    <TD VAlign=top>&nbsp;<tt>*t</tt></TD>
+    <TD VAlign=top>&nbsp;<tt>T&amp;</tt></TD>
+    <TD VAlign=top>If the pointee is valid returns a reference to
+      the pointee.<br>
+      If the pointee is invalid the result is <i>undefined</i>.</TD>
+    <TD VAlign=top> </TD>
+  </TR>
+  <TR>
+    <TD VAlign=top>Value Access</TD>
+    <TD VAlign=top>&nbsp;<tt>t-><i>xyz</i></tt></TD>
+    <TD VAlign=top>&nbsp;<tt>T*</tt></TD>
+    <TD VAlign=top>If the pointee is valid returns a builtin pointer to the pointee.<br>
+      If the pointee is invalid the result is <i>undefined</i> (It might not even return NULL).<br>
+    </TD>
+    <TD VAlign=top> </TD>
+  </TR>
+  <TR>
+    <TD VAlign=top>Validity Test</TD>
+    <TD VAlign=top>&nbsp;<tt>bool(t)</tt></TD>
+    <TD VAlign=top>&nbsp;bool </TD>
+    <TD VAlign=top>If the pointee is valid returns true.<br>
+      If the pointee is invalid returns false.</TD>
+    <TD VAlign=top></TD>
+  </TR>
+  <TR>
+    <TD VAlign=top>Invalidity Test</TD>
+    <TD VAlign=top>&nbsp;<tt>!t</tt></TD>
+    <TD VAlign=top>&nbsp;bool </TD>
+    <TD VAlign=top>If the pointee is valid returns false.<br>
+      If the pointee is invalid returns true.</TD>
+    <TD VAlign=top></TD>
+  </TR>
+</table>
+
+
+<h3>Models</h3>
+
+<UL>
+  <LI><tt>pointers, both builtin and smart.</tt>
+  <LI><tt>boost::optional&lt;&gt;</tt>
+</UL>
+
+<HR>
+<h3>OptionalPointee and relational operations</h3>
+<p>This concept does not define any particular semantic for relational operations, therefore,
+a type which models this concept might have either shallow or deep relational semantics.<br>
+For instance, pointers, which are models of OptionalPointee, have shallow relational operators:
+comparisons of pointers do not involve comparisons of pointees.
+This makes sense for pointers because they have shallow copy semantics.<br>
+But boost::optional&lt;T&gt;, on the other hand, which is also a model of OptionalPointee, has
+deep-copy and deep-relational semantics.<br>
+If generic code is written for this concept, it is important not to use relational
+operators directly because the semantics might be different depending on the actual type.<br>
+Still, the concept itsef can be used to define <i>deep</i> relational tests that can
+be used in generic code with any type which models OptionalPointee:</p>
+<a name="equal"></a>
+<p><u>Equivalence relation:</u></p>
+<pre>template&lt;class OptionalPointee&gt;
+inline
+bool equal_pointees ( OptionalPointee const&amp; x, OptionalPointee const&amp; y )
+{
+  return (!x) != (!y) ? false : ( !x ? true : (*x) == (*y) ) ;
+}
+template&lt;class OptionalPointee&gt;
+struct equal_pointees_t : std::binary_function&lt;OptionalPointee,OptionalPointee,bool&gt;
+{
+  bool operator() ( OptionalPointee const& x, OptionalPointee const& y ) const
+    { return equal_pointees(x,y) ; }
+} ;
+</pre>
+<p>The preceding generic function and function object have the following semantics:<br>
+If both <b>x</b> and <b>y</b> have valid pointees, it compares values via <code>(*x == *y)</code>.<br>
+If only one has a valid pointee, returns <code>false</code>.<br>
+If both have invalid pointees, returns <code>true</code>.</p>
+<a name="less"></a>
+<p><u>Less-than relation:</u></p>
+<pre>template&lt;class OptionalPointee&gt;
+inline
+bool less_pointees ( OptionalPointee const&amp; x, OptionalPointee const&amp; y )
+{
+  return !y ? false : ( !x ? true : (*x) < (*y) ) ;
+}
+template&lt;class OptionalPointee&gt;
+struct less_pointees_t : std::binary_function&lt;OptionalPointee,OptionalPointee,bool&gt;
+{
+  bool operator() ( OptionalPointee const& x, OptionalPointee const& y ) const
+    { return less_pointees(x,y) ; }
+} ;
+</pre>
+<p>The preceding generic function and function object have the following semantics:<br>
+If <b>y</b> has an invalid pointee, returns <code>false</code>.<br>
+Else, if <b>x</b> has an invalid pointee, returns <code>true</code>.<br>
+Else, ( <b>x</b> and <b>y</b> have valid pointees), compares values via <code>(*x &lt; 
+*y).</code></p>
+<p><br>
+All these functions and function 
+objects are is implemented in <a href="../../boost/utility/compare_pointees.hpp">compare_pointees.hpp</a></p>
+<p>Notice that OptionalPointee does not imply aliasing (and optional&lt;&gt; for instance does not alias);
+so direct usage of relational operators with the implied aliasing of shallow semantics
+-as with pointers- should not be used with generic code written for this concept.</p>
+
+<h3>Acknowledgements</h3>
+<p>Based on the original concept developed by Augustus Saunders.
+
+<br>
+</p>
+<HR>
+<TABLE>
+<TR valign=top>
+<TD nowrap>Copyright &copy 2003</TD><TD>
+<A HREF="mailto:fernando_cacciola@hotmail.com">Fernando Cacciola</A>
+</TD></TR></TABLE>
+
+<p>Distributed under the Boost Software License, Version 1.0. See
+<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a></p>
+
+</BODY>
+</HTML>
--- a/appveyor.yml
+++ b/appveyor.yml
@ -15,10 +15,7 @@ branches:

 environment:
  matrix:
-    - TOOLSET: msvc-9.0,msvc-10.0,msvc-11.0
-      ADDRMD: 32
-      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
-    - TOOLSET: msvc-12.0,msvc-14.0
+    - TOOLSET: msvc-14.0
      ADDRMD: 32,64
      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
    - TOOLSET: msvc-14.1
@ -44,27 +41,27 @@ environment:
      ENV_SCRIPT: C:\Program Files (x86)\Microsoft Visual Studio\2019\Community\VC\Auxiliary\Build\vcvars64.bat
      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2019
    - TOOLSET: gcc
-      CXXSTD: 03,11,14,1z
+      CXXSTD: 11,14,1z
      ADDPATH: C:\cygwin\bin;
      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
    - TOOLSET: gcc
-      CXXSTD: 03,11,14,1z
+      CXXSTD: 11,14,1z
      ADDPATH: C:\cygwin64\bin;
      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
    - TOOLSET: gcc
-      CXXSTD: 03,11,14,1z
+      CXXSTD: 11,14,1z
      ADDPATH: C:\mingw\bin;
      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
    - TOOLSET: gcc
-      CXXSTD: 03,11,14,1z
+      CXXSTD: 11,14,1z
      ADDPATH: C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin;
      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
    - TOOLSET: gcc
-      CXXSTD: 03,11,14,17
+      CXXSTD: 11,14,17
      ADDPATH: C:\mingw-w64\x86_64-7.3.0-posix-seh-rt_v5-rev0\mingw64\bin;
      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
    - TOOLSET: gcc
-      CXXSTD: 03,11,14,17,2a
+      CXXSTD: 11,14,17,2a
      ADDPATH: C:\mingw-w64\x86_64-8.1.0-posix-seh-rt_v6-rev0\mingw64\bin;
      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015

@ -75,24 +72,11 @@ install:
  - cd ..
  - git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
  - cd boost-root
-  - git submodule init tools/build
-  - git submodule init tools/boost_install
-  - git submodule init libs/headers
-  - git submodule init libs/assert
-  - git submodule init libs/config
-  - git submodule init libs/core
-  - git submodule init libs/io
-  - git submodule init libs/preprocessor
-  - git submodule init libs/static_assert
-  - git submodule init libs/throw_exception
-  - git submodule init libs/type_traits
-  - git submodule init libs/container_hash
-  - git submodule init libs/integer
-  - git submodule init libs/detail
-  - git submodule update --jobs %GIT_FETCH_JOBS%
-  - xcopy /s /e /q %APPVEYOR_BUILD_FOLDER% libs\utility\
+  - git submodule update --init tools/boostdep
+  - xcopy /s /e /q %APPVEYOR_BUILD_FOLDER% libs\utility
+  - python tools/boostdep/depinst/depinst.py %DEPINST_ARG_INCLUDE_EXAMPLES% --git_args "--jobs %GIT_FETCH_JOBS%" utility
  - cmd /c bootstrap
-  - b2 -d0 headers
+  - b2 headers

 build: off

--- a/build.jam
+++ b/build.jam
@ -0,0 +1,29 @@
+# Copyright René Ferdinand Rivera Morell 2023-2024
+# 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)
+
+require-b2 5.2 ;
+
+constant boost_dependencies :
+    /boost/assert//boost_assert
+    /boost/config//boost_config
+    /boost/core//boost_core
+    /boost/io//boost_io
+    /boost/preprocessor//boost_preprocessor
+    /boost/throw_exception//boost_throw_exception
+    /boost/type_traits//boost_type_traits ;
+
+project /boost/utility
+    : common-requirements
+        <include>include
+    ;
+
+explicit
+    [ alias boost_utility : : : : <library>$(boost_dependencies) ]
+    [ alias all : boost_utility test ]
+    ;
+
+call-if : boost-library utility
+    ;
+
--- a/call_traits.htm
+++ b/call_traits.htm
@ -1,14 +1,14 @@
 <html>
 <head>
-   <title>Boost.Utility</title>
-   <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+   <title>Boost.CallTraits</title>
+   <meta http-equiv="refresh" content="0; URL=./doc/html/utility/utilities/call_traits.html">
 </head>
 <body>
 Automatic redirection failed, please go to
 <a href="./doc/html/utility/utilities/call_traits.html">./doc/html/utility/utilities/call_traits.html</a>
 <hr>
 <tt>
-   Boost.Utility<br>
+   Boost.CallTraits<br>
   <br>
   Distributed under the Boost Software License, Version 1.0.
   (See accompanying file LICENSE_1_0.txt or copy at
--- a/checked_delete.html
+++ b/checked_delete.html
@ -1,7 +1,7 @@
 <html>
 <head>
    <title>Boost.Utility</title>
-    <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+    <meta http-equiv="refresh" content="0; URL=../core/doc/html/core/checked_delete.html">
 </head>
 <body>
 Automatic redirection failed, please go to
--- a/compressed_pair.htm
+++ b/compressed_pair.htm
@ -1,7 +1,7 @@
 <html>
 <head>
    <title>Boost.Utility</title>
-    <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+    <meta http-equiv="refresh" content="0; URL=./doc/html/utility/utilities/compressed_pair.html">
 </head>
 <body>
 Automatic redirection failed, please go to
--- a/doc/BOOST_BINARY.qbk
+++ b/doc/BOOST_BINARY.qbk
@ -6,8 +6,7 @@
 /]

 [/===============]
-[#sec:BOOST_BINARY]
-[section Binary Integer Literals]
+[section:BOOST_BINARY Binary Integer Literals]
 [/===============]

 [section Introduction]
--- a/doc/Jamfile.v2
+++ b/doc/Jamfile.v2
@ -8,7 +8,7 @@ import quickbook ;

 project boost/libs/utility/doc ;

-path-constant INCLUDES : ../../.. ;
+path-constant INCLUDES : ../include ;
 path-constant boost-images : ../../../doc/src/images ;

 # Generate XML doxygen reference for base_from_member component in base_from_member_reference.xml
@ -39,6 +39,7 @@ doxygen base_from_member_reference
                    BOOST_CONSTEXPR_OR_CONST=constexpr \\
                    BOOST_NOEXCEPT=noexcept \\
                    BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
+                    BOOST_NOEXCEPT_EXPR(x)=noexcept(x) \\
                    BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
                    BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
                    BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
@ -83,6 +84,7 @@ doxygen boost_binary_reference
                    BOOST_CONSTEXPR_OR_CONST=constexpr \\
                    BOOST_NOEXCEPT=noexcept \\
                    BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
+                    BOOST_NOEXCEPT_EXPR(x)=noexcept(x) \\
                    BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
                    BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
                    BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
@ -128,6 +130,7 @@ doxygen call_traits_reference
                    BOOST_CONSTEXPR_OR_CONST=constexpr \\
                    BOOST_NOEXCEPT=noexcept \\
                    BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
+                    BOOST_NOEXCEPT_EXPR(x)=noexcept(x) \\
                    BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
                    BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
                    BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
@ -173,6 +176,7 @@ doxygen compressed_pair_reference
                    BOOST_CONSTEXPR_OR_CONST=constexpr \\
                    BOOST_NOEXCEPT=noexcept \\
                    BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
+                    BOOST_NOEXCEPT_EXPR(x)=noexcept(x) \\
                    BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
                    BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
                    BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
@ -218,6 +222,7 @@ doxygen in_place_factory_reference
                    BOOST_CONSTEXPR_OR_CONST=constexpr \\
                    BOOST_NOEXCEPT=noexcept \\
                    BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
+                    BOOST_NOEXCEPT_EXPR(x)=noexcept(x) \\
                    BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
                    BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
                    BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
@ -265,6 +270,7 @@ doxygen result_of_reference
                    BOOST_CONSTEXPR_OR_CONST=constexpr \\
                    BOOST_NOEXCEPT=noexcept \\
                    BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
+                    BOOST_NOEXCEPT_EXPR(x)=noexcept(x) \\
                    BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
                    BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
                    BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
@ -285,6 +291,7 @@ doxygen result_of_reference
 doxygen string_view_reference
  :
    $(INCLUDES)/boost/utility/string_view.hpp
+    $(INCLUDES)/boost/utility/string_ref.hpp
  :
    <location>tmp
    <doxygen:param>ENABLE_PREPROCESSING=YES
@ -309,6 +316,7 @@ doxygen string_view_reference
                    BOOST_CONSTEXPR_OR_CONST=constexpr \\
                    BOOST_NOEXCEPT=noexcept \\
                    BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
+                    BOOST_NOEXCEPT_EXPR(x)=noexcept(x) \\
                    BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
                    BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
                    BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
@ -353,6 +361,7 @@ doxygen value_init_reference
                    BOOST_CONSTEXPR_OR_CONST=constexpr \\
                    BOOST_NOEXCEPT=noexcept \\
                    BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
+                    BOOST_NOEXCEPT_EXPR(x)=noexcept(x) \\
                    BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
                    BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
                    BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
--- a/doc/call_traits.qbk
+++ b/doc/call_traits.qbk
@ -7,7 +7,7 @@
 /]

 [/===============]
-[section Call Traits]
+[section:call_traits Call Traits]
 [/===============]

 [section Introduction]
@ -19,9 +19,9 @@ The template class __call_traits_T__ encapsulates the
 "best" method to pass a parameter of some type `T` to or
 from a function, and consists of a collection of `typedef`s defined
 as in the table below. The purpose of __call_traits__ is to ensure
-that problems like [link sec:refs "references to references"]
+that problems like [link utility.utilities.call_traits.examples.refs "references to references"]
 never occur, and that parameters are passed in the most efficient
-manner possible, as in the [link sec:examples examples]. In each
+manner possible, as in the [link utility.utilities.call_traits.examples examples]. In each
 case, if your existing practice is to use the type defined on the
 left, then replace it with the __call_traits__ defined type on the
 right.
@ -100,7 +100,7 @@ used to solve the reference to reference problem.
 Notes:

 # If `T` is already reference type, then __call_traits__ is
-        defined such that [link sec:refs "references to references"]
+        defined such that [link utility.utilities.call_traits.examples.refs "references to references"]
        do not occur (requires partial specialization).
 # If `T` is an array type, then __call_traits__ defines `value_type`
        as a "constant pointer to type" rather than an
@ -145,8 +145,7 @@ If `T` is an assignable type the following assignments are possible:
 ]
 [endsect]

-[#sec:examples]
-[section Examples]
+[section:examples Examples]

 The following table shows the effect that __call_traits__ has on
 various types.
@ -204,8 +203,7 @@ struct contained
 ```
 [endsect]

-[#sec:refs]
-[section Example 2 (the reference to reference problem):]
+[section:refs Example 2 (the reference to reference problem):]

 Consider the definition of __std_binder1st__:

@ -241,8 +239,7 @@ the no "reference to reference" occurs.

 [endsect]

-[#sec:example3]
-[section Example 3 (the `make_pair` problem):]
+[section:example3 Example 3 (the `make_pair` problem):]

 If we pass the name of an array as one (or both) arguments to `__std_make_pair__`,
 then template argument deduction deduces the passed parameter as
@ -277,8 +274,7 @@ __std_make_pair__ are not expressed in terms of __call_traits__: doing so
 would prevent template argument deduction from functioning.
 [endsect]

-[#sec:example4]
-[section Example 4 (optimising fill):]
+[section:example4 Example 4 (optimising fill):]

 The __call_traits__ template will "optimize" the passing
 of a small built-in type as a function parameter. This mainly has
@ -359,12 +355,12 @@ Small built-in types, what the standard calls [@https://en.cppreference.com/w/cp
 types], differ from existing practice only in the `param_type`
 `typedef`. In this case passing `T const` is compatible
 with existing practice, but may improve performance in some cases
-(see [link sec:example4 Example 4]). In any case this should never
+(see [link utility.utilities.call_traits.examples.example4 Example 4]). In any case this should never
 be any worse than existing practice.

 Pointers follow the same rationale as small built-in types.

-For reference types the rationale follows [link sec:refs Example 2]
+For reference types the rationale follows [link utility.utilities.call_traits.examples.refs Example 2]
 - references to references are not allowed, so the __call_traits__
 members must be defined such that these problems do
 not occur. There is a proposal to modify the language such that
@ -425,7 +421,7 @@ For `value_type` (return by value), again only a pointer may be
 returned, not a copy of the whole array, and again __call_traits__
 makes the degradation explicit. The `value_type` member is useful
 whenever an array must be explicitly degraded to a pointer -
-[link sec:example3 Example 3] provides the test case.
+[link utility.utilities.call_traits.examples.example3 Example 3] provides the test case.

 Footnote: the array specialisation for __call_traits__ is the least
 well understood of all the __call_traits__ specialisations. If the given
--- a/doc/compressed_pair.qbk
+++ b/doc/compressed_pair.qbk
@ -8,7 +8,7 @@
  or copy at http://boost.org/LICENSE_1_0.txt
 ]

-[section Compressed Pair]
+[section:compressed_pair Compressed Pair]

 [section Introduction]

--- a/doc/in_place_factory.qbk
+++ b/doc/in_place_factory.qbk
@ -7,8 +7,7 @@
 /]

 [/===============]
-[#sec:in_place_factory]
-[section In-place Factory]
+[section:in_place_factory In-place Factory]
 [/===============]

 [section Introduction]
@ -256,13 +255,13 @@ struct C
  ~C() { delete contained_ ; }

  template<class InPlaceFactory>
-  void construct ( InPlaceFactory const& aFactory, boost::__in_place_factory_base__* )
+  void construct ( InPlaceFactory const& aFactory, const boost::__in_place_factory_base__* )
  {
    aFactory.template apply<X>(contained_);
  }

  template<class TypedInPlaceFactory>
-  void construct ( TypedInPlaceFactory const& aFactory, boost::__typed_in_place_factory_base__* )
+  void construct ( TypedInPlaceFactory const& aFactory, const boost::__typed_in_place_factory_base__* )
  {
    aFactory.apply(contained_);
  }
@ -296,7 +295,6 @@ void foo()
 [endsect]

 [/===============]
-[#boost.typed_in_place_factory_base]
 [xinclude tmp/in_place_factory_reference.xml]
 [/===============]

--- a/doc/main.qbk
+++ b/doc/main.qbk
@ -57,113 +57,113 @@
 [/ (Macros are defined here because these macros are often referenced in other components) ]
 [/ (operators macros link to the a table of operators because there's no doxygen reference for the operators) ]

-[def __BOOST_BINARY__ [link sec:BOOST_BINARY `BOOST_BINARY`]]
-[def __in_place_factory__ [link sec:in_place_factory `in_place_factory`]]
+[def __BOOST_BINARY__ [link utility.utilities.BOOST_BINARY `BOOST_BINARY`]]
+[def __in_place_factory__ [link utility.utilities.in_place_factory `in_place_factory`]]

-[def __boost_base_from_member__ [link boost.base_from_member `boost::base_from_member`]]
-[def __boost_call_traits__ [link boost.call_traits `boost::call_traits`]]
-[def __boost_result_of__ [link boost.result_of `boost::result_of`]]
-[def __boost_tr1_result_of__ [link boost.tr1_result_of `boost::tr1_result_of`]]
-[def __boost_string_view__ [link boost.basic_string_view `boost::string_view`]]
-[def __boost_basic_string_view__ [link boost.basic_string_view `boost::basic_string_view`]]
+[def __boost_base_from_member__ [classref boost::base_from_member `boost::base_from_member`]]
+[def __boost_call_traits__ [classref boost::call_traits `boost::call_traits`]]
+[def __boost_result_of__ [classref boost::result_of `boost::result_of`]]
+[def __boost_tr1_result_of__ [classref boost::tr1_result_of `boost::tr1_result_of`]]
+[def __boost_string_view__ [classref boost::basic_string_view `boost::string_view`]]
+[def __boost_basic_string_view__ [classref boost::basic_string_view `boost::basic_string_view`]]

-[def __additive1__ [link sec:arithmetic `additive1`]]
-[def __additive2__ [link sec:arithmetic `additive2`]]
-[def __arithmetic1__ [link sec:arithmetic `arithmetic1`]]
-[def __arithmetic2__ [link sec:arithmetic `arithmetic2`]]
-[def __base_from_member__ [link boost.base_from_member `base_from_member`]]
-[def __basic_string_ref__ [link boost.basic_string_view `basic_string_ref`]]
-[def __basic_string_view__ [link boost.basic_string_view `basic_string_view`]]
-[def __bidirectional_iteratable__ [link sec:arithmetic `bidirectional_iteratable`]]
-[def __bidirectional_iterator_helper__ [link sec:arithmetic `bidirectional_iterator_helper`]]
-[def __bitwise1__ [link sec:arithmetic `bitwise1`]]
-[def __bitwise2__ [link sec:arithmetic `bitwise2`]]
-[def __call_traits__ [link boost.call_traits `call_traits`]]
-[def __call_traits_T__ [link boost.call_traits `call_traits<T>`]]
-[def __call_traits_lt__T___ [link boost.call_traits `call_traits<T&>`]]
-[def __call_traits_lt__T_lb_N_rb__gt___ [link boost.call_traits `call_traits< T[N]>`]]
-[def __call_traits_lt__const_T_lb_N_rb__gt___ [link boost.call_traits `call_traits< const T[N]>`]]
-[def __compressed_pair__ [link boost.compressed_pair `compressed_pair`]]
-[def __decrementable__ [link sec:arithmetic `decrementable`]]
-[def __dereferenceable__ [link sec:arithmetic `dereferenceable`]]
-[def __equal_pointees__ [link sec:arithmetic `equal_pointees`]]
-[def __equal_pointees_t__ [link sec:arithmetic `equal_pointees_t`]]
-[def __equality_comparable1__ [link sec:arithmetic `equality_comparable1`]]
-[def __equality_comparable2__ [link sec:arithmetic `equality_comparable2`]]
-[def __equivalent1__ [link sec:arithmetic `equivalent1`]]
-[def __equivalent2__ [link sec:arithmetic `equivalent2`]]
-[def __euclidean_ring_operators1__ [link sec:arithmetic `euclidean_ring_operators1`]]
-[def __euclidean_ring_operators2__ [link sec:arithmetic `euclidean_ring_operators2`]]
-[def __field_operators1__ [link sec:arithmetic `field_operators1`]]
-[def __field_operators2__ [link sec:arithmetic `field_operators2`]]
-[def __forward_iteratable__ [link sec:arithmetic `forward_iteratable`]]
-[def __forward_iterator_helper__ [link sec:arithmetic `forward_iterator_helper`]]
-[def __get__ [link boost.get `get`]]
-[def __hash_range__ [link boost.hash_range `hash_range`]]
-[def __hash_value__ [link boost.hash_value `hash_value`]]
-[def __in_place_factory_base__ [link boost.in_place_factory_base `in_place_factory_base`]]
-[def __incrementable__ [link sec:arithmetic `incrementable`]]
-[def __indexable__ [link sec:arithmetic `indexable`]]
-[def __initialized__ [link boost.initialized `initialized`]]
-[def __initialized_value__ [link boost.initialized_value `initialized_value`]]
-[def __initialized_value_t__ [link boost.initialized_value_t `initialized_value_t`]]
-[def __input_iteratable__ [link sec:arithmetic `input_iteratable`]]
-[def __input_iterator_helper__ [link sec:arithmetic `input_iterator_helper`]]
-[def __integer_arithmetic1__ [link sec:arithmetic `integer_arithmetic1`]]
-[def __integer_arithmetic2__ [link sec:arithmetic `integer_arithmetic2`]]
-[def __integer_multiplicative1__ [link sec:arithmetic `integer_multiplicative1`]]
-[def __integer_multiplicative2__ [link sec:arithmetic `integer_multiplicative2`]]
-[def __is_chained_base__ [link sec:arithmetic `is_chained_base`]]
-[def __less_pointees__ [link boost.less_pointees `less_pointees`]]
-[def __less_pointees_t__ [link boost.less_pointees_t `less_pointees_t`]]
-[def __less_than_comparable1__ [link sec:arithmetic `less_than_comparable1`]]
-[def __less_than_comparable2__ [link sec:arithmetic `less_than_comparable2`]]
-[def __multiplicative1__ [link sec:arithmetic `multiplicative1`]]
-[def __multiplicative2__ [link sec:arithmetic `multiplicative2`]]
-[def __operator_eq__eq__ [link sec:arithmetic `operator==`]]
-[def __operator_gt__ [link sec:arithmetic `operator_gt_`]]
-[def __operator_gt__eq__ [link sec:arithmetic `operator&gt;`]]
-[def __operator_lt__ [link sec:arithmetic `operator&lt;`]]
-[def __operator_lt__eq__ [link sec:arithmetic `operator&lt;=`]]
-[def __operator_lt__lt__ [link sec:arithmetic `operator&lt;&lt;`]]
-[def __operator_not__eq__ [link sec:arithmetic `operator!=`]]
-[def __operators2__ [link sec:arithmetic `operators2`]]
-[def __operators__ [link sec:arithmetic `operators`]]
-[def __operators_lt_T__ [link sec:arithmetic `operators<T,T>`]]
-[def __ordered_euclidean_ring_operators1__ [link sec:arithmetic `ordered_euclidean_ring_operators1`]]
-[def __ordered_euclidean_ring_operators2__ [link sec:arithmetic `ordered_euclidean_ring_operators2`]]
-[def __ordered_euclidian_ring_operators1__ [link sec:arithmetic `ordered_euclidian_ring_operators1`]]
-[def __ordered_euclidian_ring_operators2__ [link sec:arithmetic `ordered_euclidian_ring_operators2`]]
-[def __ordered_field_operators1__ [link sec:arithmetic `ordered_field_operators1`]]
-[def __ordered_field_operators2__ [link sec:arithmetic `ordered_field_operators2`]]
-[def __ordered_ring_operators1__ [link sec:arithmetic `ordered_ring_operators1`]]
-[def __ordered_ring_operators2__ [link sec:arithmetic `ordered_ring_operators2`]]
-[def __output_iteratable__ [link sec:arithmetic `output_iteratable`]]
-[def __output_iterator_helper__ [link sec:arithmetic `output_iterator_helper`]]
-[def __partially_ordered1__ [link sec:arithmetic `partially_ordered1`]]
-[def __partially_ordered2__ [link sec:arithmetic `partially_ordered2`]]
-[def __random_access_iteratable__ [link sec:arithmetic `random_access_iteratable`]]
-[def __random_access_iterator_helper__ [link sec:arithmetic `random_access_iterator_helper`]]
-[def __result_of__ [link boost.result_of `result_of`]]
-[def __ring_operators1__ [link sec:arithmetic `ring_operators1`]]
-[def __ring_operators2__ [link sec:arithmetic `ring_operators2`]]
-[def __shiftable1__ [link sec:arithmetic `shiftable1`]]
-[def __shiftable2__ [link sec:arithmetic `shiftable2`]]
-[def __string_ref__ [link boost.basic_string_view `string_ref`]]
-[def __string_view__ [link boost.basic_string_view `string_view`]]
-[def __swap__ [link sec:arithmetic `swap`]]
-[def __totally_ordered1__ [link sec:arithmetic `totally_ordered1`]]
-[def __totally_ordered2__ [link sec:arithmetic `totally_ordered2`]]
-[def __tr1_result_of__ [link boost.tr1_result_of `tr1_result_of`]]
-[def __typed_in_place_factory_base__ [link boost.typed_in_place_factory_base `typed_in_place_factory_base`]]
-[def __u16string_ref__ [link boost.basic_string_view `u16string_ref`]]
-[def __u16string_view__ [link boost.basic_string_view `u16string_view`]]
-[def __u32string_ref__ [link boost.basic_string_view `u32string_ref`]]
-[def __u32string_view__ [link boost.basic_string_view `u32string_view`]]
-[def __unit_steppable__ [link sec:arithmetic `unit_steppable`]]
-[def __value_initialized__ [link boost.value_initialized `value_initialized`]]
-[def __wstring_ref__ [link boost.basic_string_view `wstring_ref`]]
-[def __wstring_view__ [link boost.basic_string_view `wstring_view`]]
+[def __additive1__ [link utility.utilities.operators.arithmetic `additive1`]]
+[def __additive2__ [link utility.utilities.operators.arithmetic `additive2`]]
+[def __arithmetic1__ [link utility.utilities.operators.arithmetic `arithmetic1`]]
+[def __arithmetic2__ [link utility.utilities.operators.arithmetic `arithmetic2`]]
+[def __base_from_member__ [classref boost::base_from_member `base_from_member`]]
+[def __basic_string_ref__ [classref boost::basic_string_ref `basic_string_ref`]]
+[def __basic_string_view__ [classref boost::basic_string_view `basic_string_view`]]
+[def __bidirectional_iteratable__ [link utility.utilities.operators.arithmetic `bidirectional_iteratable`]]
+[def __bidirectional_iterator_helper__ [link utility.utilities.operators.arithmetic `bidirectional_iterator_helper`]]
+[def __bitwise1__ [link utility.utilities.operators.arithmetic `bitwise1`]]
+[def __bitwise2__ [link utility.utilities.operators.arithmetic `bitwise2`]]
+[def __call_traits__ [classref boost::call_traits `call_traits`]]
+[def __call_traits_T__ [classref boost::call_traits `call_traits<T>`]]
+[def __call_traits_lt__T___ [classref boost::call_traits `call_traits<T&>`]]
+[def __call_traits_lt__T_lb_N_rb__gt___ [classref boost::call_traits `call_traits< T[N]>`]]
+[def __call_traits_lt__const_T_lb_N_rb__gt___ [classref boost::call_traits `call_traits< const T[N]>`]]
+[def __compressed_pair__ [classref boost::compressed_pair `compressed_pair`]]
+[def __decrementable__ [link utility.utilities.operators.arithmetic `decrementable`]]
+[def __dereferenceable__ [link utility.utilities.operators.arithmetic `dereferenceable`]]
+[def __equal_pointees__ [link utility.utilities.operators.arithmetic `equal_pointees`]]
+[def __equal_pointees_t__ [link utility.utilities.operators.arithmetic `equal_pointees_t`]]
+[def __equality_comparable1__ [link utility.utilities.operators.arithmetic `equality_comparable1`]]
+[def __equality_comparable2__ [link utility.utilities.operators.arithmetic `equality_comparable2`]]
+[def __equivalent1__ [link utility.utilities.operators.arithmetic `equivalent1`]]
+[def __equivalent2__ [link utility.utilities.operators.arithmetic `equivalent2`]]
+[def __euclidean_ring_operators1__ [link utility.utilities.operators.arithmetic `euclidean_ring_operators1`]]
+[def __euclidean_ring_operators2__ [link utility.utilities.operators.arithmetic `euclidean_ring_operators2`]]
+[def __field_operators1__ [link utility.utilities.operators.arithmetic `field_operators1`]]
+[def __field_operators2__ [link utility.utilities.operators.arithmetic `field_operators2`]]
+[def __forward_iteratable__ [link utility.utilities.operators.arithmetic `forward_iteratable`]]
+[def __forward_iterator_helper__ [link utility.utilities.operators.arithmetic `forward_iterator_helper`]]
+[def __get__ [funcref boost::get `get`]]
+[def __hash_range__ [funcref boost::hash_range `hash_range`]]
+[def __hash_value__ [funcref boost::hash_value `hash_value`]]
+[def __in_place_factory_base__ [classref boost::in_place_factory_base `in_place_factory_base`]]
+[def __incrementable__ [link utility.utilities.operators.arithmetic `incrementable`]]
+[def __indexable__ [link utility.utilities.operators.arithmetic `indexable`]]
+[def __initialized__ [classref boost::initialized `initialized`]]
+[def __initialized_value__ [globalref boost::initialized_value `initialized_value`]]
+[def __initialized_value_t__ [classref boost::initialized_value_t `initialized_value_t`]]
+[def __input_iteratable__ [link utility.utilities.operators.arithmetic `input_iteratable`]]
+[def __input_iterator_helper__ [link utility.utilities.operators.arithmetic `input_iterator_helper`]]
+[def __integer_arithmetic1__ [link utility.utilities.operators.arithmetic `integer_arithmetic1`]]
+[def __integer_arithmetic2__ [link utility.utilities.operators.arithmetic `integer_arithmetic2`]]
+[def __integer_multiplicative1__ [link utility.utilities.operators.arithmetic `integer_multiplicative1`]]
+[def __integer_multiplicative2__ [link utility.utilities.operators.arithmetic `integer_multiplicative2`]]
+[def __is_chained_base__ [link utility.utilities.operators.arithmetic `is_chained_base`]]
+[def __less_pointees__ [funcref boost::less_pointees `less_pointees`]]
+[def __less_pointees_t__ [class boost::less_pointees_t `less_pointees_t`]]
+[def __less_than_comparable1__ [link utility.utilities.operators.arithmetic `less_than_comparable1`]]
+[def __less_than_comparable2__ [link utility.utilities.operators.arithmetic `less_than_comparable2`]]
+[def __multiplicative1__ [link utility.utilities.operators.arithmetic `multiplicative1`]]
+[def __multiplicative2__ [link utility.utilities.operators.arithmetic `multiplicative2`]]
+[def __operator_eq__eq__ [link utility.utilities.operators.arithmetic `operator==`]]
+[def __operator_gt__ [link utility.utilities.operators.arithmetic `operator_gt_`]]
+[def __operator_gt__eq__ [link utility.utilities.operators.arithmetic `operator&gt;`]]
+[def __operator_lt__ [link utility.utilities.operators.arithmetic `operator&lt;`]]
+[def __operator_lt__eq__ [link utility.utilities.operators.arithmetic `operator&lt;=`]]
+[def __operator_lt__lt__ [link utility.utilities.operators.arithmetic `operator&lt;&lt;`]]
+[def __operator_not__eq__ [link utility.utilities.operators.arithmetic `operator!=`]]
+[def __operators2__ [link utility.utilities.operators.arithmetic `operators2`]]
+[def __operators__ [link utility.utilities.operators.arithmetic `operators`]]
+[def __operators_lt_T__ [link utility.utilities.operators.arithmetic `operators<T,T>`]]
+[def __ordered_euclidean_ring_operators1__ [link utility.utilities.operators.arithmetic `ordered_euclidean_ring_operators1`]]
+[def __ordered_euclidean_ring_operators2__ [link utility.utilities.operators.arithmetic `ordered_euclidean_ring_operators2`]]
+[def __ordered_euclidian_ring_operators1__ [link utility.utilities.operators.arithmetic `ordered_euclidian_ring_operators1`]]
+[def __ordered_euclidian_ring_operators2__ [link utility.utilities.operators.arithmetic `ordered_euclidian_ring_operators2`]]
+[def __ordered_field_operators1__ [link utility.utilities.operators.arithmetic `ordered_field_operators1`]]
+[def __ordered_field_operators2__ [link utility.utilities.operators.arithmetic `ordered_field_operators2`]]
+[def __ordered_ring_operators1__ [link utility.utilities.operators.arithmetic `ordered_ring_operators1`]]
+[def __ordered_ring_operators2__ [link utility.utilities.operators.arithmetic `ordered_ring_operators2`]]
+[def __output_iteratable__ [link utility.utilities.operators.arithmetic `output_iteratable`]]
+[def __output_iterator_helper__ [link utility.utilities.operators.arithmetic `output_iterator_helper`]]
+[def __partially_ordered1__ [link utility.utilities.operators.arithmetic `partially_ordered1`]]
+[def __partially_ordered2__ [link utility.utilities.operators.arithmetic `partially_ordered2`]]
+[def __random_access_iteratable__ [link utility.utilities.operators.arithmetic `random_access_iteratable`]]
+[def __random_access_iterator_helper__ [link utility.utilities.operators.arithmetic `random_access_iterator_helper`]]
+[def __result_of__ [classref boost::result_of `result_of`]]
+[def __ring_operators1__ [link utility.utilities.operators.arithmetic `ring_operators1`]]
+[def __ring_operators2__ [link utility.utilities.operators.arithmetic `ring_operators2`]]
+[def __shiftable1__ [link utility.utilities.operators.arithmetic `shiftable1`]]
+[def __shiftable2__ [link utility.utilities.operators.arithmetic `shiftable2`]]
+[def __string_ref__ [classref boost::basic_string_ref `string_ref`]]
+[def __string_view__ [classref boost::basic_string_view `string_view`]]
+[def __swap__ [link utility.utilities.operators.arithmetic `swap`]]
+[def __totally_ordered1__ [link utility.utilities.operators.arithmetic `totally_ordered1`]]
+[def __totally_ordered2__ [link utility.utilities.operators.arithmetic `totally_ordered2`]]
+[def __tr1_result_of__ [classref boost::tr1_result_of `tr1_result_of`]]
+[def __typed_in_place_factory_base__ [classref boost::typed_in_place_factory_base `typed_in_place_factory_base`]]
+[def __u16string_ref__ [classref boost::basic_string_ref `u16string_ref`]]
+[def __u16string_view__ [classref boost::basic_string_view `u16string_view`]]
+[def __u32string_ref__ [classref boost::basic_string_ref `u32string_ref`]]
+[def __u32string_view__ [classref boost::basic_string_view `u32string_view`]]
+[def __unit_steppable__ [link utility.utilities.operators.arithmetic `unit_steppable`]]
+[def __value_initialized__ [classref boost::value_initialized `value_initialized`]]
+[def __wstring_ref__ [classref boost::basic_string_ref `wstring_ref`]]
+[def __wstring_view__ [classref boost::basic_string_view `wstring_view`]]

 [/ std:: types ]

@ -219,8 +219,7 @@

 [include other.qbk]

-[#sec:reference]
-[section:ref Quick Reference]
+[section:reference Quick Reference]

 [/ Reference table ]
 [xinclude quickref.xml]
--- a/doc/operators.qbk
+++ b/doc/operators.qbk
--- a/doc/other.qbk
+++ b/doc/other.qbk
@ -7,7 +7,7 @@
    Official repository: https://github.com/boostorg/utility
 ]

-[section:utilities More Utilities]
+[section:more_utilities More Utilities]

 Some utilities have been moved from Boost.Utilities to more appropriate Boost libraries:

--- a/doc/overview.qbk
+++ b/doc/overview.qbk
@ -20,14 +20,14 @@ Over time,
 When the component has moved to another Boost library, Boost.Utility headers still lead to the appropriate headers
 in other libraries.

-[table:id Components
+[table Components
    [[Boost.Utility] [Moved to Boost] [C++ Standard variant]]
    [[[@boost:/libs/core/doc/html/core/addressof.html `addressof`]] [[@boost:/libs/core/index.html Boost.Core]] [C++11 __std_addressof__]]
-    [[__base_from_member__]      [] []]
+    [[[link utility.utilities.base_from_member `base_from_member`]]      [] []]
    [[__BOOST_BINARY__] [] [C++14 [@https://en.cppreference.com/w/cpp/language/integer_literal Binary integer literal]]]
-    [[__call_traits__]      [] []]
+    [[[link utility.utilities.call_traits `call_traits`]]      [] []]
    [[[@boost:/libs/core/doc/html/core/checked_delete.html `checked_delete`]] [[@boost:/libs/core/index.html Boost.Core]] []]
-    [[__compressed_pair__]      [] []]
+    [[[link utility.utilities.compressed_pair `compressed_pair`]]      [] []]
    [[[@boost:/libs/type_traits/doc/html/boost_typetraits/reference/declval.html `declval`]] [[@boost:/libs/type_traits/index.html Boost.TypeTraits]] [C++11 __std_declval__]]
    [[[@boost:/libs/core/doc/html/core/enable_if.html `enable_if`]] [[@boost:/libs/core/index.html Boost.Core]] [C++11 __std_enable_if__]]
    [[[@boost:/libs/iterator/doc/generator_iterator.htm generator iterator adaptors]] [[@boost:/libs/iterator/index.html Boost.Iterator]] []]
@ -35,12 +35,12 @@ in other libraries.
    [[[@boost:/libs/iterator/index.html `iterator_adaptors`]]      [[@boost:/libs/iterator/index.html Boost.Iterator]] []]
    [[[@boost:/libs/iterator/doc/html/iterator/algorithms/next_prior.html `next` / `prior`]] [[@boost:/libs/iterator/index.html Boost.Iterator]] [C++11 __std_next__ / __std_prev__]]
    [[[@boost:/libs/core/doc/html/core/noncopyable.html `noncopyable`]] [[@boost:/libs/core/index.html Boost.Core]] []]
-    [[[link sec:operators `operators`]]      [] []]
+    [[[link utility.utilities.operators `operators`]]      [] []]
    [[[@boost:/libs/io/doc/html/io.html `ostream_string`]] [[@boost:/libs/io/index.html Boost.IO]] []]
-    [[__result_of__]      [] [C++11 __std_result_of__]]
-    [[__string_view__]      [] [C++17 __std_string_view__]]
+    [[[link utility.utilities.result_of `result_of`]]      [] [C++11 __std_result_of__]]
+    [[[link utility.utilities.string_view `string_view`]]      [] [C++17 __std_string_view__]]
    [[[@boost:/libs/throw_exception/doc/html/throw_exception.html#using_boost_throw_exception `throw_exception`]] [[@boost:/libs/throw_exception/index.html Boost.ThrowException]] []]
-    [[[link sec:value_init `value_init`]]      [] [C++11 [@https://en.cppreference.com/w/cpp/language/list_initialization List initialization]]]
+    [[[link utility.utilities.value_init `value_init`]]      [] [C++11 [@https://en.cppreference.com/w/cpp/language/list_initialization List initialization]]]
 ]

 [endsect]
--- a/doc/quickref.xml
+++ b/doc/quickref.xml
@ -43,7 +43,7 @@
                    <bridgehead renderas="sect3">Classes</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="boost.base_from_member">base_from_member</link>
+                            <classname alt="boost::base_from_member">base_from_member</classname>
                        </member>
                    </simplelist>
                </entry>
@ -53,19 +53,16 @@
                    <bridgehead renderas="sect3">Type Traits</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="boost.call_traits">call_traits</link>
+                            <classname alt="boost::call_traits">call_traits</classname>
                        </member>
                        <member>
-                            <link linkend="boost.call_traits">call_traits&lt;T&amp;&gt;</link>
+                            <classname alt="boost::call_traits">call_traits&lt;T&amp;&gt;</classname>
                        </member>
                        <member>
-                            <link linkend="boost.call_traits">call_traits&lt;T[N]&gt;
-                            </link>
+                            <classname alt="boost::call_traits">call_traits&lt;T[N]&gt;</classname>
                        </member>
                        <member>
-                            <link linkend="boost.call_traits">call_traits&lt;const
-                                T[N]&gt;
-                            </link>
+                            <classname alt="boost::call_traits">call_traits&lt;const T[N]&gt;</classname>
                        </member>
                    </simplelist>
                </entry>
@ -75,14 +72,14 @@
                    <bridgehead renderas="sect3">Classes</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="boost.compressed_pair">compressed_pair</link>
+                            <classname alt="boost::compressed_pair">compressed_pair</classname>
                        </member>
                    </simplelist>

                    <bridgehead renderas="sect3">Functions</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="header.boost.detail.compressed_pair_hpp">swap</link>
+                            <headername alt="boost/detail/compressed_pair.hpp">swap</headername>
                        </member>
                    </simplelist>
                </entry>
@ -92,11 +89,10 @@
                    <bridgehead renderas="sect3">Classes</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="boost.in_place_factory_base">in_place_factory_base</link>
+                            <classname alt="boost::in_place_factory_base">in_place_factory_base</classname>
                        </member>
                        <member>
-                            <link linkend="boost.typed_in_place_factory_base">typed_in_place_factory_base
-                            </link>
+                            <classname alt="boost::typed_in_place_factory_base">typed_in_place_factory_base</classname>
                        </member>
                    </simplelist>
                </entry>
@ -126,45 +122,45 @@
                    <bridgehead renderas="sect3">Classes (1 of 5)</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="sec:arithmetic">additive1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.additive1">additive1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">additive2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.additive2">additive2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">arithmetic1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.arithmetic1">arithmetic1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">arithmetic2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.arithmetic2">arithmetic2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">bidirectional_iteratable</link>
+                            <link linkend="utility.utilities.operators.deref.grpd_iter_oprs.bidirectional_iteratable">bidirectional_iteratable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">
+                            <link linkend="utility.utilities.operators.deref.iterator.bidirectional_iterator_helper">
                                bidirectional_iterator_helper
                            </link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">bitwise1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.bitwise1">bitwise1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">bitwise2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.bitwise2">bitwise2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">decrementable</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.decrementable">decrementable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">dereferenceable</link>
+                            <link linkend="utility.utilities.operators.deref.dereference.dereferenceable">dereferenceable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">equality_comparable1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.equality_comparable1">equality_comparable1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">equality_comparable2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.equality_comparable2">equality_comparable2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">equivalent1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.equivalent1">equivalent1</link>
                        </member>
                    </simplelist>
                </entry>
@ -173,45 +169,45 @@
                    <bridgehead renderas="sect3">Classes (2 of 5)</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="sec:arithmetic">equivalent2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.equivalent2">equivalent2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">euclidean_ring_operators1
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.euclidean_ring_operators1">euclidean_ring_operators1
                            </link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">euclidean_ring_operators2
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.euclidean_ring_operators2">euclidean_ring_operators2
                            </link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">field_operators1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.field_operators1">field_operators1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">field_operators2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.field_operators2">field_operators2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">forward_iteratable</link>
+                            <link linkend="utility.utilities.operators.deref.grpd_iter_oprs.forward_iteratable">forward_iteratable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">forward_iterator_helper</link>
+                            <link linkend="utility.utilities.operators.deref.iterator.forward_iterator_helper">forward_iterator_helper</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">incrementable</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.incrementable">incrementable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">indexable</link>
+                            <link linkend="utility.utilities.operators.deref.dereference.indexable">indexable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">input_iteratable</link>
+                            <link linkend="utility.utilities.operators.deref.grpd_iter_oprs.input_iteratable">input_iteratable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">input_iterator_helper</link>
+                            <link linkend="utility.utilities.operators.deref.iterator.input_iterator_helper">input_iterator_helper</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">integer_arithmetic1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.integer_arithmetic1">integer_arithmetic1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">integer_arithmetic2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.integer_arithmetic2">integer_arithmetic2</link>
                        </member>
                    </simplelist>
                </entry>
@ -220,49 +216,47 @@
                    <bridgehead renderas="sect3">Classes (3 of 5)</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="sec:arithmetic">integer_multiplicative1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.integer_multiplicative1">integer_multiplicative1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">integer_multiplicative2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.integer_multiplicative2">integer_multiplicative2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">is_chained_base</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.less_than_comparable1">less_than_comparable1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">less_than_comparable1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.less_than_comparable2">less_than_comparable2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">less_than_comparable2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.multiplicative1">multiplicative1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">multiplicative1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.multiplicative2">multiplicative2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">multiplicative2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.ex_oprs.operators1">operators1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">operators</link>
+                            <link linkend="utility.utilities.operators.arithmetic.ex_oprs.operators2">operators2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">operators2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.ex_oprs.operators2">operators&lt;T,T&gt;</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">operators&lt;T,T&gt;</link>
-                        </member>
-                        <member>
-                            <link linkend="sec:arithmetic">
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.ordered_euclidean_ring_operators1">
                                ordered_euclidean_ring_operators1
                            </link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.ordered_euclidean_ring_operators2">
                                ordered_euclidean_ring_operators2
                            </link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">
-                                ordered_euclidian_ring_operators1
-                            </link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.ordered_field_operators1">ordered_field_operators1</link>
+                        </member>
+                        <member>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.ordered_field_operators2">ordered_field_operators2</link>
                        </member>
                    </simplelist>
                </entry>
@ -271,47 +265,45 @@
                    <bridgehead renderas="sect3">Classes (4 of 5)</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="sec:arithmetic">
-                                ordered_euclidian_ring_operators2
-                            </link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.ordered_ring_operators1">ordered_ring_operators1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">ordered_field_operators1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.ordered_ring_operators2">ordered_ring_operators2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">ordered_field_operators2</link>
+                            <link linkend="utility.utilities.operators.deref.grpd_iter_oprs.output_iteratable">output_iteratable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">ordered_ring_operators1</link>
+                            <link linkend="utility.utilities.operators.deref.iterator.output_iterator_helper">output_iterator_helper</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">ordered_ring_operators2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.partially_ordered1">partially_ordered1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">output_iteratable</link>
+                            <link linkend="utility.utilities.operators.arithmetic.smpl_oprs.partially_ordered2">partially_ordered2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">output_iterator_helper</link>
+                            <link linkend="utility.utilities.operators.deref.grpd_iter_oprs.random_access_iteratable">random_access_iteratable</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">partially_ordered1</link>
-                        </member>
-                        <member>
-                            <link linkend="sec:arithmetic">partially_ordered2</link>
-                        </member>
-                        <member>
-                            <link linkend="sec:arithmetic">random_access_iteratable</link>
-                        </member>
-                        <member>
-                            <link linkend="sec:arithmetic">
+                            <link linkend="utility.utilities.operators.deref.iterator.random_access_iterator_helper">
                                random_access_iterator_helper
                            </link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">ring_operators1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.ring_operators1">ring_operators1</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">ring_operators2</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.ring_operators2">ring_operators2</link>
+                        </member>
+                        <member>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.shiftable1">shiftable1</link>
+                        </member>
+                        <member>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.shiftable2">shiftable2</link>
+                        </member>
+                        <member>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.totally_ordered1">totally_ordered1</link>
                        </member>
                    </simplelist>
                </entry>
@ -320,25 +312,10 @@
                    <bridgehead renderas="sect3">Classes (5 of 5)</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="sec:arithmetic">shiftable1</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.totally_ordered2">totally_ordered2</link>
                        </member>
                        <member>
-                            <link linkend="sec:arithmetic">shiftable2</link>
-                        </member>
-                        <member>
-                            <link linkend="sec:arithmetic">totally_ordered1</link>
-                        </member>
-                        <member>
-                            <link linkend="sec:arithmetic">totally_ordered2</link>
-                        </member>
-                        <member>
-                            <link linkend="sec:arithmetic">unit_steppable</link>
-                        </member>
-                    </simplelist>
-                    <bridgehead renderas="sect3">Type Traits</bridgehead>
-                    <simplelist type="vert" columns="1">
-                        <member>
-                            <link linkend="sec:arithmetic">is_chained_base</link>
+                            <link linkend="utility.utilities.operators.arithmetic.grpd_oprs.unit_steppable">unit_steppable</link>
                        </member>
                    </simplelist>
                </entry>
@ -374,10 +351,10 @@
                    <bridgehead renderas="sect3">Type Traits</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="boost.result_of">result_of</link>
+                            <classname alt="boost::result_of">result_of</classname>
                        </member>
                        <member>
-                            <link linkend="boost.tr1_result_of">tr1_result_of</link>
+                            <classname alt="boost::tr1_result_of">tr1_result_of</classname>
                        </member>
                    </simplelist>
                </entry>
@ -387,28 +364,28 @@
                    <bridgehead renderas="sect3">Aliases</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="boost.basic_string_view">string_view</link>
+                            <classname alt="boost::basic_string_view">string_view</classname>
                        </member>
                        <member>
-                            <link linkend="boost.basic_string_view">u16string_ref</link>
+                            <classname alt="boost::basic_string_ref">u16string_ref</classname>
                        </member>
                        <member>
-                            <link linkend="boost.basic_string_view">u16string_view</link>
+                            <classname alt="boost::basic_string_view">u16string_view</classname>
                        </member>
                        <member>
-                            <link linkend="boost.basic_string_view">u32string_ref</link>
+                            <classname alt="boost::basic_string_ref">u32string_ref</classname>
                        </member>
                        <member>
-                            <link linkend="boost.basic_string_view">u32string_view</link>
+                            <classname alt="boost::basic_string_view">u32string_view</classname>
                        </member>
                        <member>
-                            <link linkend="boost.basic_string_view">wstring_ref</link>
+                            <classname alt="boost::basic_string_ref">wstring_ref</classname>
                        </member>
                        <member>
-                            <link linkend="boost.basic_string_view">wstring_view</link>
+                            <classname alt="boost::basic_string_view">wstring_view</classname>
                        </member>
                        <member>
-                            <link linkend="boost.basic_string_view">string_ref</link>
+                            <classname alt="boost::basic_string_ref">string_ref</classname>
                        </member>
                    </simplelist>
                </entry>
@ -417,19 +394,19 @@
                    <bridgehead renderas="sect3">Classes</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="boost.basic_string_view">basic_string_ref</link>
+                            <classname alt="boost::basic_string_ref">basic_string_ref</classname>
                        </member>
                        <member>
-                            <link linkend="boost.basic_string_view">basic_string_view</link>
+                            <classname alt="boost::basic_string_view">basic_string_view</classname>
                        </member>
                    </simplelist>
                    <bridgehead renderas="sect3">Functions</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="boost.hash_range">hash_range</link>
+                            <functionname alt="boost::hash_range">hash_range</functionname>
                        </member>
                        <member>
-                            <link linkend="boost.hash_value">hash_value</link>
+                            <functionname alt="boost::hash_value">hash_value</functionname>
                        </member>
                    </simplelist>
                </entry>
@ -438,58 +415,58 @@
                    <bridgehead renderas="sect3">Operators</bridgehead>
                    <simplelist type="vert" columns="1">
                        <member>
-                            <link linkend="header.boost.utility.string_view_hpp">operator==</link>
+                            <headername alt="boost/utility/string_view.hpp">operator==</headername>
                        </member>
                        <member>
-                            <link linkend="header.boost.utility.string_view_hpp">operator!=</link>
+                            <headername alt="boost/utility/string_view.hpp">operator!=</headername>
                        </member>
                        <member>
-                            <link linkend="header.boost.utility.string_view_hpp">operator&lt;</link>
+                            <headername alt="boost/utility/string_view.hpp">operator&lt;</headername>
                        </member>
                        <member>
-                            <link linkend="header.boost.utility.string_view_hpp">operator&lt;=</link>
+                            <headername alt="boost/utility/string_view.hpp">operator&lt;=</headername>
                        </member>
                        <member>
-                            <link linkend="header.boost.utility.string_view_hpp">operator&gt;</link>
+                            <headername alt="boost/utility/string_view.hpp">operator&gt;</headername>
                        </member>
                        <member>
-                            <link linkend="header.boost.utility.string_view_hpp">operator&gt;=</link>
+                            <headername alt="boost/utility/string_view.hpp">operator&gt;=</headername>
                        </member>
                        <member>
-                            <link linkend="header.boost.utility.string_view_hpp">operator&lt;&lt;</link>
+                            <headername alt="boost/utility/string_view.hpp">operator&lt;&lt;</headername>
                        </member>
                    </simplelist>
                </entry>

                <!-- value_init -->
                <entry valign="top">
-                        <bridgehead renderas="sect3">Classes</bridgehead>
-                        <simplelist type="vert" columns="1">
-                            <member>
-                                <link linkend="boost.initialized">initialized</link>
-                            </member>
-                            <member>
-                                <link linkend="boost.initialized_value_t">initialized_value_t</link>
-                            </member>
-                            <member>
-                                <link linkend="boost.value_initialized">value_initialized</link>
-                            </member>
-                        </simplelist>
-                        <bridgehead renderas="sect3">Functions</bridgehead>
-                        <simplelist type="vert" columns="1">
-                            <member>
-                                <link linkend="header.boost.utility.value_init_hpp">get</link>
-                            </member>
-                            <member>
-                                <link linkend="header.boost.utility.value_init_hpp">swap</link>
-                            </member>
-                        </simplelist>
-                        <bridgehead renderas="sect3">Constants</bridgehead>
-                        <simplelist type="vert" columns="1">
-                            <member>
-                                <link linkend="boost.initialized_value">initialized_value</link>
-                            </member>
-                        </simplelist>
+                    <bridgehead renderas="sect3">Classes</bridgehead>
+                    <simplelist type="vert" columns="1">
+                        <member>
+                            <classname alt="boost::initialized">initialized</classname>
+                        </member>
+                        <member>
+                            <classname alt="boost::initialized_value_t">initialized_value_t</classname>
+                        </member>
+                        <member>
+                            <classname alt="boost::value_initialized">value_initialized</classname>
+                        </member>
+                    </simplelist>
+                    <bridgehead renderas="sect3">Functions</bridgehead>
+                    <simplelist type="vert" columns="1">
+                        <member>
+                            <headername alt="boost/utility/value_init.hpp">get</headername>
+                        </member>
+                        <member>
+                            <headername alt="boost/utility/value_init.hpp">swap</headername>
+                        </member>
+                    </simplelist>
+                    <bridgehead renderas="sect3">Constants</bridgehead>
+                    <simplelist type="vert" columns="1">
+                        <member>
+                            <globalname alt="boost::initialized_value">initialized_value</globalname>
+                        </member>
+                    </simplelist>
                </entry>
            </row>
        </tbody>
--- a/doc/result_of.qbk
+++ b/doc/result_of.qbk
@ -7,7 +7,7 @@
 /]

 [/===============]
-[section Result of]
+[section:result_of Result of]
 [/===============]

 [section Introduction]
@ -122,7 +122,7 @@ and is not implemented by some compilers.
 the actual result type deduced by __decltype__, then using TR1 with a __decltype__ fallback
 will allow you to work with both your existing TR1 function objects and new C++11
 function object. This situation could occur if your legacy function objects
-misused the TR1 protocol. See the documentation on known [link sec:result_of_tr1_diff differences]
+misused the TR1 protocol. See the documentation on known [link utility.utilities.result_of.result_of_tr1_diff differences]
 between __boost_result_of__ and TR1.

 * [#BOOST_NO_RESULT_OF] This implementation of __result_of__ requires class template
@ -138,8 +138,7 @@ or, for motivation and design rationale, the __result_of__

 [endsect]

-[#sec:result_of_guidelines]
-[section Usage guidelines for __boost_result_of__]
+[section:result_of_guidelines Usage guidelines for __boost_result_of__]

 The following are general suggestions about when and how to use __boost_result_of__.

@ -151,7 +150,7 @@ there's no reason to stop using it.
 # If you are targeting C++11 but may port your code to legacy compilers
 at some time in the future, then use __boost_result_of__ with __decltype__.
 When __decltype__ is used __boost_result_of__ and `__std_result_of__` are usually
-interchangeable. See the documentation on known [link sec:result_of_cxx11_diff differences]
+interchangeable. See the documentation on known [link utility.utilities.result_of.result_of_cxx11_diff differences]
 between __boost_result_of__ and C++11 __std_result_of__.

 # If compiler portability is required, use __boost_result_of__ with the TR1 protocol
@ -195,8 +194,7 @@ typedef __boost_result_of__<

 [endsect]

-[#sec:result_of_tr1_protocol_guidelines]
-[section Usage guidelines for the TR1 result_of protocol]
+[section:result_of_tr1_protocol_guidelines Usage guidelines for the TR1 result_of protocol]

 On compliant C++11 compilers, __boost_result_of__ can
 use __decltype__ to deduce the type of any
@ -212,7 +210,7 @@ argument types or the cv-qualification of the
 function object, simply
 define `result_type`. There is no need
 to use the `result` template unless the
-return type varies.</li>
+return type varies.

 * Use the protocol specified type when defining
 function prototypes. This can help ensure the
@ -274,8 +272,7 @@ struct functor {

 [endsect]

-[#sec:result_of_tr1_diff]
-[section Known differences between __boost_result_of__ and __boost_tr1_result_of__]
+[section:result_of_tr1_diff Known differences between __boost_result_of__ and __boost_tr1_result_of__]

 When using __decltype__, __boost_result_of__ ignores the TR1 protocol and instead deduces the
 return type of function objects directly via __decltype__. In most situations, users
@ -399,8 +396,7 @@ BOOST_STATIC_ASSERT((

 [endsect]

-[#sec:result_of_cxx11_diff]
-[section Known differences between __boost_result_of__ and C++11 result_of]
+[section:result_of_cxx11_diff Known differences between __boost_result_of__ and C++11 result_of]

 When using __decltype__, __boost_result_of__ implements most of the C++11 __std_result_of__
 specification. One known exception is that __boost_result_of__ does not implement the
--- a/doc/string_view.qbk
+++ b/doc/string_view.qbk
@ -7,7 +7,7 @@
 /]

 [/===============]
-[section String View]
+[section:string_view String View]
 [/===============]

 [section Introduction]
--- a/doc/value_init.qbk
+++ b/doc/value_init.qbk
@ -7,9 +7,7 @@
 /]

 [/===============]
-[#sec:value_init]
-[section Value Init]
-
+[section:value_init Value Init]
 [/===============]

 [section Introduction]
@ -61,7 +59,7 @@ the syntax did not allow for a class that has an explicitly declared constructor
 The fourth form is the most generic form of them, as it can be used to initialize
 arithmetic types, class types, aggregates, pointers, and other types.
 The declaration,  `T4 var4 = T4()`, should be read as follows: First a temporary
-object is created, by `T4()`. This object is [link sec:valueinit value-initialized].
+object is created, by `T4()`. This object is [link utility.utilities.value_init.details.value_initialization value-initialized].
 Next the temporary object is copied to the named variable, `var4`. Afterwards,
 the temporary is destroyed. While the copying and the destruction are likely to
 be optimized away, C++ still requires the type `T4` to be __CopyConstructible__.
@ -69,11 +67,11 @@ So `T4` needs to be ['both] __DefaultConstructible__ ['and] __CopyConstructible_

 A class may not be CopyConstructible, for example because it may have a
 private and undefined copy constructor, or because it may be derived from
-`boost::noncopyable`. Scott Meyers \[[link sec:references 2]\] explains why a
+`boost::noncopyable`. Scott Meyers \[[link utility.utilities.value_init.references 2]\] explains why a
 class would be defined like that.

 There is another, less obvious disadvantage to the fourth form, `T4 var4 = T4()`:
-It suffers from various [link sec:compiler_issues compiler issues], causing
+It suffers from various [link utility.utilities.value_init.details.compiler_issues compiler issues], causing
 a variable to be left uninitialized in some compiler specific cases.

 The template __value_initialized__ offers a generic way to initialize
@ -103,13 +101,12 @@ but robust against the aforementioned compiler issues.

 [endsect]

-[#sec:details]
-[section Details]
+[section:details Details]

-The C++ standard \[[link sec:references 3]\] contains the definitions
+The C++ standard \[[link utility.utilities.value_init.references 3]\] contains the definitions
 of `zero-initialization` and `default-initialization`. Informally, zero-initialization
 means that the object is given the initial value `0` converted to the type and
-default-initialization means that [@https://en.cppreference.com/w/cpp/named_req/PODType POD] \[[link sec:references 4]\] types are zero-initialized,
+default-initialization means that [@https://en.cppreference.com/w/cpp/named_req/PODType POD] \[[link utility.utilities.value_init.references 4]\] types are zero-initialized,
 while non-POD class types are initialized with their corresponding default constructors.

 A ['declaration] can contain an ['initializer], which specifies the
@ -136,8 +133,7 @@ foo ( __std_string__() ) ;
 // as indicated by the initializer ()
 ```

-[#sec:valueinit]
-[h5 value-initialization]
+[section:value_initialization value-initialization]

 The first [@http://www.open-std.org/JTC1/SC22/WG21/docs/cwg_defects.html Technical
 Corrigendum for the C++ Standard] (TC1), whose draft was released to the public in
@ -173,8 +169,9 @@ eat ( int() ) ; // value-initialized
 eat ( __std_string__() ) ; // value-initialized
 ```

-[#sec:valueinitsyn]
-[h5 value-initialization syntax]
+[endsect]
+
+[section:syntax value-initialization syntax]

 Value initialization is specified using `()`. However, the empty set of
 parentheses is not permitted by the syntax of initializers because it is
@ -224,8 +221,9 @@ This is the solution as it was supplied by earlier versions of the
 `__value_initialized__<T>` template class. Unfortunately this approach
 suffered from various compiler issues.

-[#sec:compiler_issues]
-[h5 Compiler issues]
+[endsect]
+
+[section:compiler_issues Compiler issues]

 Various compilers have not yet fully implemented value-initialization.
 So when an object should be ['value-initialized] according to the C++ Standard,
@ -242,8 +240,6 @@ go wrong on various compilers.
 At the moment of writing, May 2010, the following reported issues regarding
 value-initialization are still there in current compiler releases:

-
-
 * [@https://connect.microsoft.com/VisualStudio/feedback/details/100744 Microsoft Visual Studio Feedback ID 100744, Value-initialization in new-expression]: Reported by Pavel Kuznetsov (MetaCommunications Engineering), 2005.
 * [@http://connect.microsoft.com/VisualStudio/feedback/details/484295 Microsoft Visual Studio Feedback ID 484295, VC++ does not value-initialize members of derived classes without user-declared constructor] Reported by Sylvester Hesp, 2009.
 * [@https://connect.microsoft.com/VisualStudio/feedback/details/499606 Microsoft Visual Studio Feedback ID 499606, Presence of copy constructor breaks member class initialization] Reported by Alex Vakulenko, 2009
@ -267,11 +263,11 @@ compiler defect macro] `BOOST_NO_COMPLETE_VALUE_INITIALIZATION`.

 [endsect]

-[#sec:types]
-[section Types and objects]
+[endsect]

-[#sec:val_init]
-[section `template class value_initialized<T>`]
+[section:types Types and objects]
+
+[section:val_init `template class value_initialized<T>`]

 ```
 namespace boost {
@ -323,7 +319,7 @@ void swap ( __value_initialized__<T>& lhs, __value_initialized__<T>& rhs )
 ```

 An object of this template class is a `T`-wrapper convertible to `'T&'` whose
-wrapped object (data member of type `T`) is [link sec:valueinit value-initialized] upon default-initialization
+wrapped object (data member of type `T`) is [link utility.utilities.value_init.details.value_initialization value-initialized] upon default-initialization
 of this wrapper class:

 ```
@ -338,7 +334,7 @@ assert( y == def ) ;

 The purpose of this wrapper is to provide a consistent syntax for value initialization
 of scalar, union and class types (POD and non-POD) since the correct syntax for value
-initialization varies (see [link sec:valueinitsyn value-initialization syntax]).
+initialization varies (see [link utility.utilities.value_init.details.syntax value-initialization syntax]).

 The wrapped object can be accessed either through the conversion operator
 `T&`, the member function `data()`, or the non-member function `get()`:
@ -404,7 +400,7 @@ supports the idea of logical constness.

 ]

-[h5 Recommended practice: The non-member get() idiom]
+[section Recommended practice: The non-member get() idiom]

 The obscure behavior of being able to modify a non-`const`
 wrapped object from within a constant wrapper (as was supported by previous
@ -426,8 +422,9 @@ get(cx_c) = 1; // ERROR: Cannot modify a const object

 [endsect]

-[#sec:initialized]
-[section `template class initialized<T>`]
+[endsect]
+
+[section:initialized `template class initialized<T>`]


 ```
@ -491,8 +488,7 @@ direct-initialized, none of the two wrappers really needs to be used.

 [endsect]

-[#sec:initialized_value]
-[section `initialized_value`]
+[section:initialized_value `initialized_value`]

 ```
 namespace boost {
@ -538,8 +534,7 @@ T var = __initialized_value__;
 [endsect]
 [endsect]

-[#sec:references]
-[section References]
+[section:references References]

 # Bjarne Stroustrup, Gabriel Dos Reis, and J. Stephen Adamczyk wrote various papers,
 proposing to extend the support for brace-enclosed ['initializer lists]
@ -561,8 +556,7 @@ compiler-generated functions you do not want], [@http://www.aristeia.com/books.h
 [xinclude tmp/value_init_reference.xml]
 [/===============]

-[#sec:acknowledgements]
-[section Acknowledgements]
+[section:acknowledgements Acknowledgements]

 __value_initialized__ was developed by Fernando Cacciola, with help and suggestions
 from David Abrahams and Darin Adler.
--- a/enable_if.html
+++ b/enable_if.html
@ -1,14 +1,14 @@
 <html>
 <head>
-    <title>Boost.Utility</title>
-    <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+    <title>Boost.EnableIf</title>
+    <meta http-equiv="refresh" content="0; URL=../core/doc/html/core/enable_if.html">
 </head>
 <body>
 Automatic redirection failed, please go to
 <a href="../core/doc/html/core/enable_if.html">../core/doc/html/core/enable_if.html</a>
 <hr>
 <tt>
-    Boost.Utility<br>
+    Boost.EnableIf<br>
    <br>
    Distributed under the Boost Software License, Version 1.0.
    (See accompanying file LICENSE_1_0.txt or copy at
--- a/identity_type/doc/Jamfile.v2
+++ b/identity_type/doc/Jamfile.v2
@ -8,7 +8,7 @@
 import quickbook ;
 using boostbook ;

-doxygen reference : ../../../../boost/utility/identity_type.hpp
+doxygen reference : ../../include/boost/utility/identity_type.hpp
    :   <reftitle>"Reference"
        <doxygen:param>PREDEFINED="DOXYGEN"
        <doxygen:param>QUIET=YES
--- a/in_place_factories.html
+++ b/in_place_factories.html
@ -1,14 +1,14 @@
 <html>
 <head>
-    <title>Boost.Utility</title>
-    <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+    <title>Boost.InPlaceFactory</title>
+    <meta http-equiv="refresh" content="0; URL=./doc/html/utility/utilities/in_place_factory.html">
 </head>
 <body>
 Automatic redirection failed, please go to
 <a href="./doc/html/utility/utilities/in_place_factory.html">./doc/html/utility/utilities/in_place_factory.html</a>
 <hr>
 <tt>
-    Boost.Utility<br>
+    Boost.InPlaceFactory<br>
    <br>
    Distributed under the Boost Software License, Version 1.0.
    (See accompanying file LICENSE_1_0.txt or copy at
--- a/include/boost/utility/detail/minstd_rand.hpp
+++ b/include/boost/utility/detail/minstd_rand.hpp
@ -11,48 +11,6 @@
 // An implementation of minstd_rand that does not require
 // the Random library

-#include <boost/cstdint.hpp>
-
-namespace boost
-{
-namespace detail
-{
-
-class minstd_rand
-{
-private:
-
-    boost::uint_least32_t x_;
-
-    enum { a = 48271, m = 2147483647 };
-
-public:
-
-    minstd_rand(): x_( 1 )
-    {
-    }
-
-    explicit minstd_rand( boost::uint_least32_t x ): x_( x % m )
-    {
-        if( x_ == 0 )
-        {
-            x_ = 1;
-        }
-    }
-
-    boost::uint_least32_t operator()()
-    {
-        boost::uint_least64_t y = x_;
-
-        y = ( a * y ) % m;
-
-        x_ = static_cast<boost::uint_least32_t>( y );
-
-        return x_;
-    }
-};
-
-} // namespace detail
-} // namespace boost
+#include <boost/core/detail/minstd_rand.hpp>

 #endif // #ifndef BOOST_UTILITY_DETAIL_MINSTD_RAND_HPP_INCLUDED
--- a/include/boost/utility/string_view.hpp
+++ b/include/boost/utility/string_view.hpp
@ -23,6 +23,7 @@
 #include <boost/io/ostream_put.hpp>
 #include <boost/utility/string_view_fwd.hpp>
 #include <boost/throw_exception.hpp>
+#include <boost/assert.hpp>

 #include <cstddef>
 #include <stdexcept>
@ -140,6 +141,8 @@ namespace boost {
        void clear() BOOST_NOEXCEPT { len_ = 0; }          // Boost extension

        BOOST_CXX14_CONSTEXPR void remove_prefix(size_type n) {
+            BOOST_ASSERT(n <= size());
+            // This check is deprecated and is left for backward compatibility. It will be removed in the future.
            if ( n > len_ )
                n = len_;
            ptr_ += n;
@ -147,6 +150,8 @@ namespace boost {
            }

        BOOST_CXX14_CONSTEXPR void remove_suffix(size_type n) {
+            BOOST_ASSERT(n <= size());
+            // This check is deprecated and is left for backward compatibility. It will be removed in the future.
            if ( n > len_ )
                n = len_;
            len_ -= n;
--- a/include/boost/utility/value_init.hpp
+++ b/include/boost/utility/value_init.hpp
@ -23,7 +23,7 @@
 // contains. More details on these issues are at libs/utility/value_init.htm

 #include <boost/config.hpp> // For BOOST_NO_COMPLETE_VALUE_INITIALIZATION.
-#include <boost/core/swap.hpp>
+#include <boost/core/invoke_swap.hpp>
 #include <cstring>
 #include <cstddef>

@ -32,7 +32,7 @@
 // It is safe to ignore the following warning from MSVC 7.1 or higher:
 // "warning C4351: new behavior: elements of array will be default initialized"
 #pragma warning(disable: 4351)
-// It is safe to ignore the following MSVC warning, which may pop up when T is 
+// It is safe to ignore the following MSVC warning, which may pop up when T is
 // a const type: "warning C4512: assignment operator could not be generated".
 #pragma warning(disable: 4512)
 #endif
@ -40,8 +40,8 @@
 #ifndef BOOST_UTILITY_DOCS

 #ifdef BOOST_NO_COMPLETE_VALUE_INITIALIZATION
-  // Implementation detail: The macro BOOST_DETAIL_VALUE_INIT_WORKAROUND_SUGGESTED 
-  // suggests that a workaround should be applied, because of compiler issues 
+  // Implementation detail: The macro BOOST_DETAIL_VALUE_INIT_WORKAROUND_SUGGESTED
+  // suggests that a workaround should be applied, because of compiler issues
  // regarding value-initialization.
  #define BOOST_DETAIL_VALUE_INIT_WORKAROUND_SUGGESTED
 #endif
@ -117,7 +117,7 @@ class initialized
    BOOST_GPU_ENABLED
    void swap(initialized & arg)
    {
-      ::boost::swap( this->data(), arg.data() );
+      ::boost::core::invoke_swap( this->data(), arg.data() );
    }

    BOOST_GPU_ENABLED
@ -164,13 +164,13 @@ class value_initialized
    initialized<T> m_data;

  public :
-    
+
    BOOST_GPU_ENABLED
    value_initialized()
    :
    m_data()
    { }
-    
+
    BOOST_GPU_ENABLED
    T const & data() const
    {
@ -228,7 +228,7 @@ void swap ( value_initialized<T> & lhs, value_initialized<T> & rhs )
 class initialized_value_t
 {
  public :
-    
+
    template <class T> BOOST_GPU_ENABLED operator T() const
    {
      return initialized<T>().data();
--- a/iterator_adaptors.htm
+++ b/iterator_adaptors.htm
@ -1,14 +1,14 @@
 <html>
 <head>
-    <title>Boost.Utility</title>
-    <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+    <title>Boost.Iterator</title>
+    <meta http-equiv="refresh" content="0; URL=../iterator/doc/index.html">
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../iterator/doc/generator_iterator.htm">../iterator/doc/generator_iterator.htm</a>
+<a href="../iterator/doc/index.html">../iterator/doc/index.html</a>
 <hr>
 <tt>
-    Boost.Utility<br>
+    Boost.Iterator<br>
    <br>
    Distributed under the Boost Software License, Version 1.0.
    (See accompanying file LICENSE_1_0.txt or copy at
--- a/meta/libraries.json
+++ b/meta/libraries.json
@ -5,12 +5,9 @@
        "authors": [
            "Dave Abrahams and others"
        ],
-        "description": "Class noncopyable plus checked_delete(), checked_array_delete(), next(), prior() function templates, plus base-from-member idiom.",
+        "description": "Various utilities, such as base-from-member idiom and binary literals in C++03.",
        "documentation": "utility.htm",
        "category": [
-            "Algorithms",
-            "Function-objects",
-            "Memory",
            "Miscellaneous",
            "Patterns"
        ],
@ -35,7 +32,7 @@
        "authors": [
            "John Maddock, Howard Hinnant, et al"
        ],
-        "description": "Empty member optimization.",
+        "description": "A pair class with empty member optimization.",
        "documentation": "compressed_pair.htm",
        "category": [
            "Data",
@ -79,7 +76,7 @@
            "Dave Abrahams",
            "Jeremy Siek"
        ],
-        "description": "Templates ease arithmetic classes and iterators.",
+        "description": "Templates to simplify operator definition in arithmetic classes and iterators.",
        "documentation": "operators.htm",
        "category": [
            "Generic",
@ -95,7 +92,7 @@
        "key": "utility/result_of",
        "name": "Result Of",
        "description": "Determines the type of a function call expression.",
-        "documentation": "utility.htm#result_of",
+        "documentation": "doc/html/utility/utilities/result_of.html",
        "category": [
            "Function-objects"
        ],
@ -106,12 +103,13 @@
        "cxxstd": "03"
    },
    {
-        "key": "utility/string_ref",
-        "name": "String Ref",
+        "key": "utility/string_view",
+        "name": "String View",
        "description": "String view templates.",
-        "documentation": "doc/html/string_ref.html",
+        "documentation": "doc/html/utility/utilities/string_view.html",
        "category": [
-            "Containers"
+            "Containers",
+            "String"
        ],
        "authors": "Marshall Clow",
        "maintainers": [
--- a/operators.htm
+++ b/operators.htm
@ -1,14 +1,14 @@
 <html>
 <head>
-  <title>Boost.Utility</title>
-  <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+  <title>Boost.Operators</title>
+  <meta http-equiv="refresh" content="0; URL=./doc/html/utility/utilities/operators.html">
 </head>
 <body>
 Automatic redirection failed, please go to
 <a href="./doc/html/utility/utilities/operators.html">./doc/html/utility/utilities/operators.html</a>
 <hr>
 <tt>
-  Boost.Utility<br>
+  Boost.Operators<br>
  <br>
  Distributed under the Boost Software License, Version 1.0.
  (See accompanying file LICENSE_1_0.txt or copy at
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@ -8,12 +8,14 @@
 # bring in rules for testing
 import testing ;

+project : requirements <library>/boost/utility//boost_utility ;
+
 run base_from_member_test.cpp ;
 run base_from_member_ref_test.cpp ;

 run binary_test.cpp ;

-run call_traits_test.cpp : -u ;
+run call_traits_test.cpp : -u : : <library>/boost/type_traits//testing ;

 run compressed_pair_test.cpp ;
 run compressed_pair_final_test.cpp ;
@ -31,7 +33,7 @@ run string_ref_test2.cpp ;
 run string_ref_test_io.cpp ;
 # compile-fail string_view_from_rvalue.cpp ;
 compile string_view_constexpr_test1.cpp ;
-run string_view_test1.cpp ;
+run string_view_test1.cpp : : : <library>/boost/container_hash//boost_container_hash ;
 run string_view_test2.cpp ;
 run string_view_test_io.cpp ;

--- a/test/call_traits_test.cpp
+++ b/test/call_traits_test.cpp
@ -1,6 +1,6 @@
-//  boost::compressed_pair test program   
-    
-//  (C) Copyright John Maddock 2000. 
+//  boost::compressed_pair test program
+
+//  (C) Copyright John Maddock 2000.
 //  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).
@ -18,8 +18,8 @@
 #include <typeinfo>
 #include <boost/call_traits.hpp>

-#include <libs/type_traits/test/test.hpp>
-#include <libs/type_traits/test/check_type.hpp>
+// type_traits/test utilities
+#include "check_type.hpp"

 #ifdef BOOST_MSVC
 #pragma warning(disable:4181) // : warning C4181: qualifier applied to reference type; ignored
@ -45,7 +45,7 @@ struct contained

   // stored value:
   value_type v_;
-   
+
   // constructors:
   contained() {}
   contained(param_type p) : v_(p){}
@ -197,11 +197,11 @@ struct comparible_UDT
   comparible_UDT() : i_(2){}
   comparible_UDT(const comparible_UDT& other) : i_(other.i_){}
   comparible_UDT& operator=(const comparible_UDT& other)
-   { 
+   {
      i_ = other.i_;
      return *this;
   }
-   bool operator == (const comparible_UDT& v){ return v.i_ == i_; }
+   bool operator == (const comparible_UDT& v) const { return v.i_ == i_; }
 };

 int main()
@ -339,7 +339,7 @@ void call_traits_test<T, isarray>::assert_construct(typename call_traits_test<T,
   param_type p2(v);
   param_type p3(r);
   param_type p4(p);
-   
+
   unused_variable(v2);
   unused_variable(v3);
   unused_variable(v4);
@ -388,7 +388,7 @@ void call_traits_test<T, true>::assert_construct(typename boost::call_traits<T>:
   param_type p2(v);
   param_type p3(r);
   param_type p4(p);
-   
+
   unused_variable(v2);
   unused_variable(v3);
   unused_variable(v4);
--- a/test/value_init_test.cpp
+++ b/test/value_init_test.cpp
@ -21,6 +21,7 @@
 #pragma hdrstop
 #endif

+#include <boost/core/invoke_swap.hpp>
 #include <boost/core/lightweight_test.hpp>
 #include <boost/config/workaround.hpp>

@ -360,7 +361,7 @@ int main()
  boost::value_initialized<SwapFunctionCallTester> swapFunctionCallTester2;
  get(swapFunctionCallTester1).data = 1;
  get(swapFunctionCallTester2).data = 2;
-  boost::swap(swapFunctionCallTester1, swapFunctionCallTester2);
+  boost::core::invoke_swap(swapFunctionCallTester1, swapFunctionCallTester2);
  BOOST_TEST( get(swapFunctionCallTester1).data == 2 );
  BOOST_TEST( get(swapFunctionCallTester2).data == 1 );
  BOOST_TEST( get(swapFunctionCallTester1).is_custom_swap_called );
--- a/throw_exception.html
+++ b/throw_exception.html
@ -1,7 +1,7 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
 <html>
 <head>
-    <meta http-equiv=refresh content="0; URL=../exception/doc/throw_exception.html">
+    <meta http-equiv=refresh content="0; URL=../throw_exception/doc/html/throw_exception.html#using_boost_throw_exception">
    <title>Automatic redirection</title>
 </head>
 <body>
--- a/value_init.htm
+++ b/value_init.htm
@ -1,7 +1,7 @@
 <html>
 <head>
    <title>Boost.Utility</title>
-    <meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
+    <meta http-equiv="refresh" content="0; URL=./doc/html/utility/utilities/value_init.html">
 </head>
 <body>
 Automatic redirection failed, please go to
Author	SHA1	Message	Date
Andrey Semashev	211570f2b9	Added new gcc and clang jobs to GitHub Actions.	2025-06-13 02:53:36 +03:00
Andrey Semashev	7f1b54c3cc	Use Azure mirrors of Ubuntu .deb repositories in containers. This reduces the likelihood of spurious CI failures caused by DDoS filters being triggered by massive numbers of concurrent CI jobs.	2025-06-13 02:48:20 +03:00
Andrey Semashev	4c85489e91	Removed windows-2019 jobs from GitHub Actions. The windows-2019 image is deprecated and is about to be removed.	2025-06-13 02:47:06 +03:00
Andrey Semashev	fdd6586aa6	Expand BOOST_NOEXCEPT_EXPR in Doxygen.	2025-05-03 05:29:05 +03:00
Andrey Semashev	49cd132374	Fixed references to Doxygen-generated reference and between sections. Since BoostBook stylesheets were updated to pass through Doxygen anchor names to BoostBook output, references from QuickBook and manually written BoostBook docs were broken. Fix this by using classref/classname and similar tools to reference Doxygen-generated content. Also, to avoid anchor clashes between different parts of Boost.Utility docs, use proper anchor namespacing: avoid using manual anchors where possible and use fully qualified namespace where not. Fixes https://github.com/boostorg/utility/issues/110.	2025-05-03 05:17:00 +03:00
Andrey Semashev	67d8cbd243	Updated GHA to remove obsolete images and add new compilers.	2025-04-15 14:12:08 +03:00
Andrey Semashev	ec297bfdfb	Merge pull request #109 from grafikrobot/modular Add support for modular build structure.	2025-04-13 17:39:40 +03:00
Rene Rivera	3a5e8f4aba	Minimize the possible header ambiguiity of including the type_traits test headers by only including the more specific header and using non-system search paths bracket.	2024-08-17 01:26:12 -05:00
Rene Rivera	9939ea24d1	Update build deps.	2024-08-10 20:47:03 -05:00
Rene Rivera	171647fb3e	Adjust doc build to avoid boost-root references.	2024-07-28 11:51:28 -05:00
Rene Rivera	8f6116ada4	Move inter-lib dependencies to a project variable and into the build targets.	2024-07-23 22:34:22 -05:00
Rene Rivera	2a37aaaeb4	Update copyright dates.	2024-07-20 22:52:04 -05:00
Rene Rivera	79c293351f	Change all <source> references to <library>.	2024-07-20 21:27:39 -05:00
Rene Rivera	a481266238	Bump B2 require to 5.2	2024-06-14 11:33:56 -05:00
Rene Rivera	2aa26c9e84	Sync from upstream.	2024-05-20 18:30:51 -05:00
Andrey Semashev	31de9279d8	Replaced macos-11 GHA image with 12, 13 and 14 since 11 is being removed.	2024-05-21 01:25:38 +03:00
Rene Rivera	6d870ad5e3	Add requires-b2 check to top-level build file.	2024-05-05 09:00:01 -05:00
Rene Rivera	80ede74e8c	Sync from upstream.	2024-04-20 15:32:25 -05:00
Peter Dimov	12c95c48cf	minstd_rand has been moved to Core	2024-04-14 06:10:37 +03:00
Rene Rivera	336c00b659	Remove relative references to boost-root in Jamfiles.	2024-04-13 16:21:04 -05:00
Rene Rivera	bf21064bfd	Switch to library requirements instead of source. As source puts extra source in install targets.	2024-03-29 21:16:00 -05:00
Rene Rivera	2a8ce8e081	Make the library modular usable.	2024-03-11 08:38:17 -05:00
Andrey Semashev	e0ecf92764	Merge pull request #107 from LegalizeAdulthood/patch-1 Correct in place factory example code	2024-02-15 19:44:18 +03:00
Richard Thomson	bff26e4fa1	Correct in place factory example code The example code as given won't work without const qualifiers on the pointer arguments.	2024-02-15 09:32:22 -07:00
Andrey Semashev	9abd1fc78d	Added Windows jobs to GHA CI.	2024-02-06 01:17:37 +03:00
Andrey Semashev	3829fcbef4	Replaced actions/checkout usage with manual download commands. This fixes the deprecation warnings for actions/checkout@v3. actions/checkout@v4 is not functional because of the upstream bug: https://github.com/actions/checkout/issues/1590	2024-02-06 01:15:54 +03:00
Andrey Semashev	21d6434320	Reduced CI job timeouts.	2024-02-06 01:14:29 +03:00
Andrey Semashev	2ac19511c2	Added gcc-13 and clang-17 GHA CI jobs.	2024-02-06 01:12:48 +03:00
Andrey Semashev	217f7346f6	Removed gcc-4.6 from CI as it lacks C++11 template aliases used in Boost.TypeOf.	2023-11-17 17:52:05 +03:00
Andrey Semashev	85b5594f32	Remove C++03 CI jobs, use gcc-11 libstdc++ for clang-12 through 15. Clang 12 through 15 does not support libstdc++-13 in C++23 mode.	2023-11-17 13:50:26 +03:00
Andrey Semashev	a95a4f6580	Fixed a link to ResultOf docs.	2023-09-24 23:15:54 +03:00
Andrey Semashev	076f050e9a	Updated library descriptions and Utility categories. Reflect that some pieces of Utility were moved to other libraries, meaning that Utility no longer provides the components that were previously mentioned in its description and categories. Make some other descriptions more clear.	2023-09-24 23:07:14 +03:00
Andrey Semashev	e06b6dd788	Added String category to StringView.	2023-09-24 22:58:56 +03:00
Andrey Semashev	219ee9855d	Renamed String Ref to String View and updated link to docs. The pewvious link to docs was broken, and string_view basically superceded string_ref, so renaming the library entry is appropriate. Fixes https://github.com/boostorg/utility/issues/105.	2023-09-24 22:54:36 +03:00
Andrey Semashev	cea4262e62	Trim trailing spaces.	2023-09-03 02:10:47 +03:00
Andrey Semashev	52e3e64a34	Switch to boost::core::invoke_swap. boost::swap is deprecated and will be removed. Use boost::core::invoke_swap as a replacement.	2023-09-03 02:10:18 +03:00
Andrey Semashev	eb721609af	Fix compilation with MSVC 14.3 in C++20 mode.	2023-07-14 02:22:09 +03:00
Andrey Semashev	b32d95a887	Add clang-16 CI jobs, switch to clang-15 from stock Ubuntu repos.	2023-06-05 03:26:52 +03:00
Andrey Semashev	656b5397c5	Restored docs removed by `703a4bf752`. Some of the HTML docs in the root directory were not converted to QuickBook by `703a4bf752` and were incorrectly removed. These docs are referenced by other libraries' docs, so restoring these pages.	2023-03-15 12:20:52 +03:00
Andrey Semashev	65b40cbf99	Fixed incorrect docs redirects.	2023-03-15 12:14:41 +03:00
Andrey Semashev	3aa25c9dd7	Use depinst.py to install dependencies in AppVeyor CI.	2022-11-17 23:47:46 +03:00
Andrey Semashev	46a785e32d	Updated to GHA checkout@v3 to avoid deprecation warnings.	2022-10-18 17:59:59 +03:00
Andrey Semashev	a1231d1ff4	GitHub Actions config update. - Added gcc-12 and clang-13 through 15 jobs. - Added C++23 testing for gcc and clang on Linux. - Updated clang version for UBSAN job. - Updated Ubuntu version for clang jobs to avoid having to use external APT repository. - Updated python package installation for compatibility with Ubuntu 22.04.	2022-09-10 02:09:54 +03:00
Andrey Semashev	3fe40554df	Switched gcc-9 to ubuntu-20.04 GHA CI image.	2022-08-14 17:56:22 +03:00
Andrey Semashev	c869f8a9fa	Replaced ubuntu-18.04 GHA CI images with containers. Also use ubuntu-latest image for jobs that are running in a container.	2022-08-14 14:20:34 +03:00
Andrey Semashev	5d39709ef0	Switch to macos-11 GHA image as macos-10.15 is deprecated.	2022-08-12 16:05:19 +03:00
Andrey Semashev	028a90b29d	Merge pull request #98 from boostorg/feature/string_view_remove_prefix_suffix_precondition string_view: Change string_view::remove_prefix/suffix preconditions to use asserts	2022-07-06 03:14:43 +03:00
Andrey Semashev	581654e408	Use assert in string_view::remove_prefix/suffix to enforce preconditions. This is in line with std::string_view::remove_prefix/suffix definition, where calling the method with n > size() is UB. We're keeping the check to clamp n to size() for now for backward compatibility so that it can be eventually removed. Closes https://github.com/boostorg/utility/issues/92.	2022-07-05 23:53:47 +03:00