Add array_get_test.cpp

refactor documentation to use asciidoc

.drone.star

@@ -0,0 +1,37 @@
+# Use, modification, and distribution are
+# subject to the Boost Software License, Version 1.0. (See accompanying
+# file LICENSE.txt)
+#
+# Copyright Rene Rivera 2020.
+
+# For Drone CI we use the Starlark scripting language to reduce duplication.
+# As the yaml syntax for Drone CI is rather limited.
+#
+#
+globalenv={}
+linuxglobalimage="cppalliance/droneubuntu1604:1"
+windowsglobalimage="cppalliance/dronevs2019"
+
+def main(ctx):
+  return [
+  linux_cxx("TEST_CMAKE=TRUE Job 0", "g++", packages="", buildtype="96ad197d74-2319b6d45f", image=linuxglobalimage, environment={'TEST_CMAKE': 'TRUE', 'DRONE_JOB_UUID': 'b6589fc6ab'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=gcc COMPILER=g++ CXXSTD=03,11 Job 1", "g++", packages="", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++', 'CXXSTD': '03,11', 'DRONE_JOB_UUID': '356a192b79'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=gcc COMPILER=g++-4.7 CXXSTD=03,11 Job 2", "g++-4.7", packages="g++-4.7", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-4.7', 'CXXSTD': '03,11', 'DRONE_JOB_UUID': 'da4b9237ba'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=gcc COMPILER=g++-4.8 CXXSTD=03,11 Job 3", "g++-4.8", packages="g++-4.8", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-4.8', 'CXXSTD': '03,11', 'DRONE_JOB_UUID': '77de68daec'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=gcc COMPILER=g++-4.9 CXXSTD=03,11 Job 4", "g++-4.9", packages="g++-4.9", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-4.9', 'CXXSTD': '03,11', 'DRONE_JOB_UUID': '1b64538924'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=gcc COMPILER=g++-5 CXXSTD=03,11,14,1z Job 5", "g++-5", packages="g++-5", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-5', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': 'ac3478d69a'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=gcc COMPILER=g++-6 CXXSTD=03,11,14,1z Job 6", "g++-6", packages="g++-6", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-6', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': 'c1dfd96eea'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=gcc COMPILER=g++-7 CXXSTD=03,11,14,17 Job 7", "g++-7", packages="g++-7", buildtype="boost", image="cppalliance/droneubuntu1404:1", environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-7', 'CXXSTD': '03,11,14,17', 'DRONE_JOB_UUID': '902ba3cda1'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=clang COMPILER=clang++ CXXSTD=03,11 Job 8", "clang++", packages="", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++', 'CXXSTD': '03,11', 'DRONE_JOB_UUID': 'fe5dbbcea5'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=clang COMPILER=clang++-3.5 CXXSTD=03, Job 9", "clang++", packages="clang-3.5 libstdc++-4.9-dev", llvm_os="precise", llvm_ver="3.5", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-3.5', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': '0ade7c2cf9'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=clang COMPILER=clang++-3.6 CXXSTD=03, Job 10", "clang++", packages="clang-3.6", llvm_os="precise", llvm_ver="3.6", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-3.6', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': 'b1d5781111'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=clang COMPILER=clang++-3.7 CXXSTD=03, Job 11", "clang++", packages="clang-3.7", llvm_os="precise", llvm_ver="3.7", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-3.7', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': '17ba079149'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=clang COMPILER=clang++-3.8 CXXSTD=03, Job 12", "clang++-3.8", packages="clang-3.8 libstdc++-4.9-dev", llvm_os="precise", llvm_ver="3.8", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-3.8', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': '7b52009b64'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=clang COMPILER=clang++-3.9 CXXSTD=03, Job 13", "clang++-3.9", packages="clang-3.9 libstdc++-4.9-dev", llvm_os="precise", llvm_ver="3.9", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-3.9', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': 'bd307a3ec3'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=clang COMPILER=clang++-4.0 CXXSTD=03, Job 14", "clang++-4.0", packages="clang-4.0", llvm_os="xenial", llvm_ver="4.0", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-4.0', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': 'fa35e19212'}, globalenv=globalenv),
+  linux_cxx("TOOLSET=clang COMPILER=clang++-5.0 CXXSTD=03, Job 15", "clang++-5.0", packages="clang-5.0", llvm_os="xenial", llvm_ver="5.0", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-5.0', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': 'f1abd67035'}, globalenv=globalenv),
+  osx_cxx("TOOLSET=clang COMPILER=clang++ CXXSTD=03,11,1 Job 16", "clang++", packages="", buildtype="boost", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++', 'CXXSTD': '03,11,14,1z', 'DRONE_JOB_UUID': '1574bddb75'}, globalenv=globalenv),
+  ]
+
+# from https://github.com/boostorg/boost-ci
+load("@boost_ci//ci/drone/:functions.star", "linux_cxx","windows_cxx","osx_cxx","freebsd_cxx")

.drone/96ad197d74-2319b6d45f.sh

@@ -0,0 +1,37 @@
+#!/bin/bash
+
+set -ex
+export TRAVIS_BUILD_DIR=$(pwd)
+export DRONE_BUILD_DIR=$(pwd)
+export TRAVIS_BRANCH=$DRONE_BRANCH
+export VCS_COMMIT_ID=$DRONE_COMMIT
+export GIT_COMMIT=$DRONE_COMMIT
+export REPO_NAME=$DRONE_REPO
+export PATH=~/.local/bin:/usr/local/bin:$PATH
+
+echo '==================================> BEFORE_INSTALL'
+
+. .drone/before-install.sh
+
+echo '==================================> INSTALL'
+
+BOOST_BRANCH=develop && [ "$TRAVIS_BRANCH" == "master" ] && BOOST_BRANCH=master || true
+git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/assert.git ../assert
+git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/config.git ../config
+git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/core.git ../core
+git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/static_assert.git ../static_assert
+git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/throw_exception.git ../throw_exception
+
+echo '==================================> BEFORE_SCRIPT'
+
+. $DRONE_BUILD_DIR/.drone/before-script.sh
+
+echo '==================================> SCRIPT'
+
+mkdir __build__ && cd __build__
+cmake ../test/test_cmake
+cmake --build .
+
+echo '==================================> AFTER_SUCCESS'
+
+. $DRONE_BUILD_DIR/.drone/after-success.sh

.drone/after-success.sh

@@ -0,0 +1,3 @@
+#!/bin/bash
+
+

.drone/before-install.sh

@@ -0,0 +1,3 @@
+#!/bin/bash
+
+

.drone/before-script.sh

@@ -0,0 +1,3 @@
+#!/bin/bash
+
+

.drone/boost.sh

@@ -0,0 +1,41 @@
+#!/bin/bash
+
+set -ex
+export TRAVIS_BUILD_DIR=$(pwd)
+export DRONE_BUILD_DIR=$(pwd)
+export TRAVIS_BRANCH=$DRONE_BRANCH
+export VCS_COMMIT_ID=$DRONE_COMMIT
+export GIT_COMMIT=$DRONE_COMMIT
+export REPO_NAME=$DRONE_REPO
+export PATH=~/.local/bin:/usr/local/bin:$PATH
+
+echo '==================================> BEFORE_INSTALL'
+
+. .drone/before-install.sh
+
+echo '==================================> INSTALL'
+
+BOOST_BRANCH=develop && [ "$TRAVIS_BRANCH" == "master" ] && BOOST_BRANCH=master || true
+cd ..
+git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+cd boost-root
+git submodule update --init tools/build
+git submodule update --init libs/config
+git submodule update --init tools/boostdep
+cp -r $TRAVIS_BUILD_DIR/* libs/array
+python tools/boostdep/depinst/depinst.py array
+./bootstrap.sh
+./b2 headers
+
+echo '==================================> BEFORE_SCRIPT'
+
+. $DRONE_BUILD_DIR/.drone/before-script.sh
+
+echo '==================================> SCRIPT'
+
+echo "using $TOOLSET : : $COMPILER ;" > ~/user-config.jam
+./b2 -j 3 libs/array/test toolset=$TOOLSET cxxstd=$CXXSTD
+
+echo '==================================> AFTER_SUCCESS'
+
+. $DRONE_BUILD_DIR/.drone/after-success.sh

.github/workflows/ci.yml

@@ -0,0 +1,643 @@
+name: CI
+
+on:
+  pull_request:
+  push:
+    branches:
+      - master
+      - develop
+      - feature/**
+
+env:
+  UBSAN_OPTIONS: print_stacktrace=1
+
+jobs:
+  posix:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - toolset: gcc-4.8
+            cxxstd: "03,11"
+            os: ubuntu-latest
+            container: ubuntu:18.04
+            install: g++-4.8-multilib
+            address-model: 32,64
+          - toolset: gcc-4.9
+            cxxstd: "03,11"
+            os: ubuntu-latest
+            container: ubuntu:16.04
+            install: g++-4.9-multilib
+            address-model: 32,64
+          - toolset: gcc-5
+            cxxstd: "03,11,14,1z"
+            os: ubuntu-latest
+            container: ubuntu:18.04
+            install: g++-5-multilib
+            address-model: 32,64
+          - toolset: gcc-6
+            cxxstd: "03,11,14,1z"
+            os: ubuntu-latest
+            container: ubuntu:18.04
+            install: g++-6-multilib
+            address-model: 32,64
+          - toolset: gcc-7
+            cxxstd: "03,11,14,17"
+            os: ubuntu-20.04
+            install: g++-7-multilib
+            address-model: 32,64
+          - toolset: gcc-8
+            cxxstd: "03,11,14,17,2a"
+            os: ubuntu-20.04
+            install: g++-8-multilib
+            address-model: 32,64
+          - toolset: gcc-9
+            cxxstd: "03,11,14,17,2a"
+            os: ubuntu-20.04
+            install: g++-9-multilib
+            address-model: 32,64
+          - toolset: gcc-10
+            cxxstd: "03,11,14,17,2a"
+            os: ubuntu-22.04
+            install: g++-10-multilib
+            address-model: 32,64
+          - toolset: gcc-11
+            cxxstd: "03,11,14,17,20"
+            os: ubuntu-22.04
+            install: g++-11-multilib
+            address-model: 32,64
+          - toolset: gcc-12
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-22.04
+            install: g++-12-multilib
+            address-model: 32,64
+          - toolset: gcc-13
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-24.04
+            install: g++-13-multilib
+            address-model: 32,64
+          - toolset: gcc-14
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-24.04
+            install: g++-14-multilib
+            address-model: 32,64
+          - toolset: clang
+            compiler: clang++-3.9
+            cxxstd: "03,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-latest
+            container: ubuntu:18.04
+            install: clang-4.0
+          - toolset: clang
+            compiler: clang++-5.0
+            cxxstd: "03,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-20.04
+            install: clang-6.0
+          - toolset: clang
+            compiler: clang++-7
+            cxxstd: "03,11,14,17"
+            os: ubuntu-20.04
+            install: clang-7
+          - toolset: clang
+            compiler: clang++-8
+            cxxstd: "03,11,14,17"
+            os: ubuntu-20.04
+            install: clang-8
+          - toolset: clang
+            compiler: clang++-9
+            cxxstd: "03,11,14,17,2a"
+            os: ubuntu-20.04
+            install: clang-9
+          - toolset: clang
+            compiler: clang++-10
+            cxxstd: "03,11,14,17,2a"
+            os: ubuntu-20.04
+          - toolset: clang
+            compiler: clang++-11
+            cxxstd: "03,11,14,17,2a"
+            os: ubuntu-20.04
+          - toolset: clang
+            compiler: clang++-12
+            cxxstd: "03,11,14,17,20"
+            os: ubuntu-20.04
+          - toolset: clang
+            compiler: clang++-13
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-22.04
+            install: clang-13
+          - toolset: clang
+            compiler: clang++-14
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-22.04
+            install: clang-14
+          - toolset: clang
+            compiler: clang++-15
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-22.04
+            install: clang-15
+          - toolset: clang
+            compiler: clang++-16
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-24.04
+            install: clang-16
+          - toolset: clang
+            compiler: clang++-17
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-24.04
+            install: clang-17
+          - toolset: clang
+            compiler: clang++-18
+            cxxstd: "03,11,14,17,20,2b"
+            os: ubuntu-24.04
+            install: clang-18
+          - toolset: clang
+            cxxstd: "03,11,14,17,20,2b"
+            os: macos-13
+          - toolset: clang
+            cxxstd: "03,11,14,17,20,2b"
+            os: macos-14
+          - toolset: clang
+            cxxstd: "03,11,14,17,20,2b"
+            os: macos-15
+
+    runs-on: ${{matrix.os}}
+
+    container:
+      image: ${{matrix.container}}
+      volumes:
+        - /node20217:/node20217:rw,rshared
+        - ${{ startsWith(matrix.container, 'ubuntu:1') && '/node20217:/__e/node20:ro,rshared' || ' ' }}
+
+    defaults:
+      run:
+        shell: bash
+
+    steps:
+      - name: Setup container environment
+        if: matrix.container
+        run: |
+          apt-get update
+          apt-get -y install sudo python3 git g++ curl xz-utils
+
+      - name: Install nodejs20glibc2.17
+        if: ${{ startsWith( matrix.container, 'ubuntu:1' ) }}
+        run: |
+          curl -LO https://archives.boost.io/misc/node/node-v20.9.0-linux-x64-glibc-217.tar.xz
+          tar -xf node-v20.9.0-linux-x64-glibc-217.tar.xz --strip-components 1 -C /node20217
+          ldd /__e/node20/bin/node
+
+      - uses: actions/checkout@v4
+
+      - name: Install packages
+        if: matrix.install
+        run: |
+          sudo apt-get update
+          sudo apt-get -y install ${{matrix.install}}
+
+      - name: Setup Boost
+        run: |
+          echo GITHUB_REPOSITORY: $GITHUB_REPOSITORY
+          LIBRARY=${GITHUB_REPOSITORY#*/}
+          echo LIBRARY: $LIBRARY
+          echo "LIBRARY=$LIBRARY" >> $GITHUB_ENV
+          echo GITHUB_BASE_REF: $GITHUB_BASE_REF
+          echo GITHUB_REF: $GITHUB_REF
+          REF=${GITHUB_BASE_REF:-$GITHUB_REF}
+          REF=${REF#refs/heads/}
+          echo REF: $REF
+          BOOST_BRANCH=develop && [ "$REF" == "master" ] && BOOST_BRANCH=master || true
+          echo BOOST_BRANCH: $BOOST_BRANCH
+          cd ..
+          git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
+          git submodule update --init tools/boostdep
+          python3 tools/boostdep/depinst/depinst.py -I examples $LIBRARY
+          ./bootstrap.sh
+          ./b2 -d0 headers
+
+      - name: Create user-config.jam
+        if: matrix.compiler
+        run: |
+          echo "using ${{matrix.toolset}} : : ${{matrix.compiler}} ;" > ~/user-config.jam
+
+      - name: Run tests
+        run: |
+          cd ../boost-root
+          export ADDRMD=${{matrix.address-model}}
+          ./b2 -j3 libs/$LIBRARY/test toolset=${{matrix.toolset}} cxxstd=${{matrix.cxxstd}} ${ADDRMD:+address-model=$ADDRMD} variant=debug,release
+
+  windows:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - toolset: msvc-14.0
+            cxxstd: 14,latest
+            addrmd: 32,64
+            os: windows-2019
+          - toolset: msvc-14.2
+            cxxstd: "14,17,20,latest"
+            addrmd: 32,64
+            os: windows-2019
+          - 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: "03,11,14,17,2a"
+            addrmd: 64
+            os: windows-2019
+
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - 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%
+          cd ..
+          git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          xcopy /s /e /q %GITHUB_WORKSPACE% libs\%LIBRARY%\
+          git submodule update --init tools/boostdep
+          python tools/boostdep/depinst/depinst.py -I examples --git_args "--jobs 3" %LIBRARY%
+          cmd /c bootstrap
+          b2 -d0 headers
+
+      - name: Run tests
+        shell: cmd
+        run: |
+          cd ../boost-root
+          b2 -j3 libs/%LIBRARY%/test toolset=${{matrix.toolset}} cxxstd=${{matrix.cxxstd}} address-model=${{matrix.addrmd}} variant=debug,release embed-manifest-via=linker
+
+  posix-cmake-subdir:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - os: ubuntu-20.04
+          - os: ubuntu-22.04
+          - os: ubuntu-24.04
+          - os: macos-13
+          - os: macos-14
+          - os: macos-15
+
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - name: Install packages
+        if: matrix.install
+        run: sudo apt-get -y install ${{matrix.install}}
+
+      - name: Setup Boost
+        run: |
+          echo GITHUB_REPOSITORY: $GITHUB_REPOSITORY
+          LIBRARY=${GITHUB_REPOSITORY#*/}
+          echo LIBRARY: $LIBRARY
+          echo "LIBRARY=$LIBRARY" >> $GITHUB_ENV
+          echo GITHUB_BASE_REF: $GITHUB_BASE_REF
+          echo GITHUB_REF: $GITHUB_REF
+          REF=${GITHUB_BASE_REF:-$GITHUB_REF}
+          REF=${REF#refs/heads/}
+          echo REF: $REF
+          BOOST_BRANCH=develop && [ "$REF" == "master" ] && BOOST_BRANCH=master || true
+          echo BOOST_BRANCH: $BOOST_BRANCH
+          cd ..
+          git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
+          git submodule update --init tools/boostdep
+          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" $LIBRARY
+
+      - name: Use library with add_subdirectory
+        run: |
+          cd ../boost-root/libs/$LIBRARY/test/cmake_subdir_test
+          mkdir __build__ && cd __build__
+          cmake ..
+          cmake --build .
+          ctest --output-on-failure --no-tests=error
+
+  posix-cmake-install:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - os: ubuntu-20.04
+          - os: ubuntu-22.04
+          - os: ubuntu-24.04
+          - os: macos-13
+          - os: macos-14
+          - os: macos-15
+
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - name: Install packages
+        if: matrix.install
+        run: sudo apt-get -y install ${{matrix.install}}
+
+      - name: Setup Boost
+        run: |
+          echo GITHUB_REPOSITORY: $GITHUB_REPOSITORY
+          LIBRARY=${GITHUB_REPOSITORY#*/}
+          echo LIBRARY: $LIBRARY
+          echo "LIBRARY=$LIBRARY" >> $GITHUB_ENV
+          echo GITHUB_BASE_REF: $GITHUB_BASE_REF
+          echo GITHUB_REF: $GITHUB_REF
+          REF=${GITHUB_BASE_REF:-$GITHUB_REF}
+          REF=${REF#refs/heads/}
+          echo REF: $REF
+          BOOST_BRANCH=develop && [ "$REF" == "master" ] && BOOST_BRANCH=master || true
+          echo BOOST_BRANCH: $BOOST_BRANCH
+          cd ..
+          git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
+          git submodule update --init tools/boostdep
+          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" $LIBRARY
+
+      - name: Configure
+        run: |
+          cd ../boost-root
+          mkdir __build__ && cd __build__
+          cmake -DBOOST_INCLUDE_LIBRARIES=$LIBRARY -DCMAKE_INSTALL_PREFIX=~/.local ..
+
+      - name: Install
+        run: |
+          cd ../boost-root/__build__
+          cmake --build . --target install
+
+      - name: Use the installed library
+        run: |
+          cd ../boost-root/libs/$LIBRARY/test/cmake_install_test && mkdir __build__ && cd __build__
+          cmake -DCMAKE_INSTALL_PREFIX=~/.local ..
+          cmake --build .
+          ctest --output-on-failure --no-tests=error
+
+  posix-cmake-test:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - os: ubuntu-20.04
+          - os: ubuntu-22.04
+          - os: ubuntu-24.04
+          - os: macos-13
+          - os: macos-14
+          - os: macos-15
+
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - name: Install packages
+        if: matrix.install
+        run: sudo apt-get -y install ${{matrix.install}}
+
+      - name: Setup Boost
+        run: |
+          echo GITHUB_REPOSITORY: $GITHUB_REPOSITORY
+          LIBRARY=${GITHUB_REPOSITORY#*/}
+          echo LIBRARY: $LIBRARY
+          echo "LIBRARY=$LIBRARY" >> $GITHUB_ENV
+          echo GITHUB_BASE_REF: $GITHUB_BASE_REF
+          echo GITHUB_REF: $GITHUB_REF
+          REF=${GITHUB_BASE_REF:-$GITHUB_REF}
+          REF=${REF#refs/heads/}
+          echo REF: $REF
+          BOOST_BRANCH=develop && [ "$REF" == "master" ] && BOOST_BRANCH=master || true
+          echo BOOST_BRANCH: $BOOST_BRANCH
+          cd ..
+          git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
+          git submodule update --init tools/boostdep
+          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" $LIBRARY
+
+      - name: Configure
+        run: |
+          cd ../boost-root
+          mkdir __build__ && cd __build__
+          cmake -DBOOST_INCLUDE_LIBRARIES=$LIBRARY -DBUILD_TESTING=ON ..
+
+      - name: Build tests
+        run: |
+          cd ../boost-root/__build__
+          cmake --build . --target tests
+
+      - name: Run tests
+        run: |
+          cd ../boost-root/__build__
+          ctest --output-on-failure --no-tests=error
+
+  windows-cmake-subdir:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - os: windows-2019
+          - os: windows-2022
+
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - 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%
+          cd ..
+          git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          xcopy /s /e /q %GITHUB_WORKSPACE% libs\%LIBRARY%\
+          git submodule update --init tools/boostdep
+          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" %LIBRARY%
+
+      - name: Use library with add_subdirectory (Debug)
+        shell: cmd
+        run: |
+          cd ../boost-root/libs/%LIBRARY%/test/cmake_subdir_test
+          mkdir __build__ && cd __build__
+          cmake ..
+          cmake --build . --config Debug
+          ctest --output-on-failure --no-tests=error -C Debug
+
+      - name: Use library with add_subdirectory (Release)
+        shell: cmd
+        run: |
+          cd ../boost-root/libs/%LIBRARY%/test/cmake_subdir_test/__build__
+          cmake --build . --config Release
+          ctest --output-on-failure --no-tests=error -C Release
+
+  windows-cmake-install:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - os: windows-2019
+          - os: windows-2022
+
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - 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%
+          cd ..
+          git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          xcopy /s /e /q %GITHUB_WORKSPACE% libs\%LIBRARY%\
+          git submodule update --init tools/boostdep
+          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" %LIBRARY%
+
+      - name: Configure
+        shell: cmd
+        run: |
+          cd ../boost-root
+          mkdir __build__ && cd __build__
+          cmake -DBOOST_INCLUDE_LIBRARIES=%LIBRARY% -DCMAKE_INSTALL_PREFIX=C:/cmake-prefix ..
+
+      - name: Install (Debug)
+        shell: cmd
+        run: |
+          cd ../boost-root/__build__
+          cmake --build . --target install --config Debug
+
+      - name: Install (Release)
+        shell: cmd
+        run: |
+          cd ../boost-root/__build__
+          cmake --build . --target install --config Release
+
+      - name: Use the installed library (Debug)
+        shell: cmd
+        run: |
+          cd ../boost-root/libs/%LIBRARY%/test/cmake_install_test && mkdir __build__ && cd __build__
+          cmake -DCMAKE_INSTALL_PREFIX=C:/cmake-prefix ..
+          cmake --build . --config Debug
+          ctest --output-on-failure --no-tests=error -C Debug
+
+      - name: Use the installed library (Release)
+        shell: cmd
+        run: |
+          cd ../boost-root/libs/%LIBRARY%/test/cmake_install_test/__build__
+          cmake --build . --config Release
+          ctest --output-on-failure --no-tests=error -C Release
+
+  windows-cmake-test:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - os: windows-2019
+          - os: windows-2022
+
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - 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%
+          cd ..
+          git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          xcopy /s /e /q %GITHUB_WORKSPACE% libs\%LIBRARY%\
+          git submodule update --init tools/boostdep
+          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" %LIBRARY%
+
+      - name: Configure
+        shell: cmd
+        run: |
+          cd ../boost-root
+          mkdir __build__ && cd __build__
+          cmake -DBOOST_INCLUDE_LIBRARIES=%LIBRARY% -DBUILD_TESTING=ON ..
+
+      - name: Build tests (Debug)
+        shell: cmd
+        run: |
+          cd ../boost-root/__build__
+          cmake --build . --target tests --config Debug
+
+      - name: Run tests (Debug)
+        shell: cmd
+        run: |
+          cd ../boost-root/__build__
+          ctest --output-on-failure --no-tests=error -C Debug
+
+      - name: Build tests (Release)
+        shell: cmd
+        run: |
+          cd ../boost-root/__build__
+          cmake --build . --target tests --config Release
+
+      - name: Run tests (Release)
+        shell: cmd
+        run: |
+          cd ../boost-root/__build__
+          ctest --output-on-failure --no-tests=error -C Release

.travis.yml

@@ -0,0 +1,217 @@
+# Copyright 2016, 2017 Peter Dimov
+# Copyright 2018, Mike-Dev
+# 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)
+
+language: cpp
+
+sudo: false
+
+python: "2.7"
+
+branches:
+  only:
+    - master
+    - develop
+    - /feature\/.*/
+
+env:
+  matrix:
+    - BOGUS_JOB=true
+
+matrix:
+
+  exclude:
+    - env: BOGUS_JOB=true
+
+  include:
+
+      # cmake self-test
+    - os: linux
+      env: TEST_CMAKE=TRUE #Only for easier identification in travis web gui
+      install:
+        - BOOST_BRANCH=develop && [ "$TRAVIS_BRANCH" == "master" ] && BOOST_BRANCH=master || true
+        - git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/assert.git ../assert
+        - git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/config.git ../config
+        - git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/core.git ../core
+        - git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/static_assert.git ../static_assert
+        - git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/throw_exception.git ../throw_exception
+
+      script:
+        - mkdir __build__ && cd __build__
+        - cmake ../test/test_cmake
+        - cmake --build .
+
+    - os: linux
+      compiler: g++
+      env: TOOLSET=gcc COMPILER=g++ CXXSTD=03,11
+
+    - os: linux
+      compiler: g++-4.7
+      env: TOOLSET=gcc COMPILER=g++-4.7 CXXSTD=03,11
+      addons:
+        apt:
+          packages:
+            - g++-4.7
+          sources:
+            - ubuntu-toolchain-r-test
+
+    - os: linux
+      compiler: g++-4.8
+      env: TOOLSET=gcc COMPILER=g++-4.8 CXXSTD=03,11
+      addons:
+        apt:
+          packages:
+            - g++-4.8
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-4.9
+      env: TOOLSET=gcc COMPILER=g++-4.9 CXXSTD=03,11
+      addons:
+        apt:
+          packages:
+            - g++-4.9
+          sources:
+            - ubuntu-toolchain-r-test
+
+    - os: linux
+      compiler: g++-5
+      env: TOOLSET=gcc COMPILER=g++-5 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - g++-5
+          sources:
+            - ubuntu-toolchain-r-test
+
+    - os: linux
+      compiler: g++-6
+      env: TOOLSET=gcc COMPILER=g++-6 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - g++-6
+          sources:
+            - ubuntu-toolchain-r-test
+
+    - os: linux
+      dist: trusty
+      compiler: g++-7
+      env: TOOLSET=gcc COMPILER=g++-7 CXXSTD=03,11,14,17
+      addons:
+        apt:
+          packages:
+            - g++-7
+          sources:
+            - ubuntu-toolchain-r-test
+
+    - os: linux
+      compiler: clang++
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=03,11
+
+    - os: linux
+      compiler: clang++-3.5
+      env: TOOLSET=clang COMPILER=clang++-3.5 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.5
+            - libstdc++-4.9-dev
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.5
+
+    - os: linux
+      compiler: clang++-3.6
+      env: TOOLSET=clang COMPILER=clang++-3.6 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.6
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.6
+
+    - os: linux
+      compiler: clang++-3.7
+      env: TOOLSET=clang COMPILER=clang++-3.7 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.7
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.7
+
+    - os: linux
+      compiler: clang++-3.8
+      env: TOOLSET=clang COMPILER=clang++-3.8 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.8
+            - libstdc++-4.9-dev
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.8
+
+    - os: linux
+      compiler: clang++-3.9
+      env: TOOLSET=clang COMPILER=clang++-3.9 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.9
+            - libstdc++-4.9-dev
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.9
+
+    - os: linux
+      compiler: clang++-4.0
+      env: TOOLSET=clang COMPILER=clang++-4.0 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-4.0
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-trusty-4.0
+
+    - os: linux
+      compiler: clang++-5.0
+      env: TOOLSET=clang COMPILER=clang++-5.0 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-5.0
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-trusty-5.0
+
+    - os: osx
+      compiler: clang++
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=03,11,14,1z
+
+install:
+  - BOOST_BRANCH=develop && [ "$TRAVIS_BRANCH" == "master" ] && BOOST_BRANCH=master || true
+  - cd ..
+  - git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+  - cd boost-root
+  - git submodule update --init tools/build
+  - git submodule update --init libs/config
+  - git submodule update --init tools/boostdep
+  - cp -r $TRAVIS_BUILD_DIR/* libs/array
+  - python tools/boostdep/depinst/depinst.py array
+  - ./bootstrap.sh
+  - ./b2 headers
+
+script:
+  - |-
+    echo "using $TOOLSET : : $COMPILER ;" > ~/user-config.jam
+  - ./b2 -j 3 libs/array/test toolset=$TOOLSET cxxstd=$CXXSTD
+
+notifications:
+  email:
+    on_success: always

CMakeLists.txt

@@ -0,0 +1,28 @@
+# Generated by `boostdep --cmake array`
+# Copyright 2020, 2021 Peter Dimov
+# Distributed under the Boost Software License, Version 1.0.
+# https://www.boost.org/LICENSE_1_0.txt
+
+cmake_minimum_required(VERSION 3.5...3.20)
+
+project(boost_array VERSION "${BOOST_SUPERPROJECT_VERSION}" LANGUAGES CXX)
+
+add_library(boost_array INTERFACE)
+add_library(Boost::array ALIAS boost_array)
+
+target_include_directories(boost_array INTERFACE include)
+
+target_link_libraries(boost_array
+  INTERFACE
+    Boost::assert
+    Boost::config
+    Boost::core
+    Boost::static_assert
+    Boost::throw_exception
+)
+
+if(BUILD_TESTING AND EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/test/CMakeLists.txt")
+
+  add_subdirectory(test)
+
+endif()

doc/.gitignore

@@ -0,0 +1 @@
+/html

doc/Jamfile.v2

@@ -1,5 +1,22 @@
-using boostbook ;
+#~ Copyright Marshall Clow 2013
+#~ Copyright Christian Mazakas 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)
 
-boostbook standalone
-	: array.xml 
-	: <xsl:param>boost.root=../../../.. ;
+import asciidoctor ;
+
+html array.html : array.adoc ;
+
+install html_ : array.html : <location>html ;
+
+pdf array.pdf : array.adoc ;
+explicit array.pdf ;
+
+install pdf_ : array.pdf : <location>pdf ;
+explicit pdf_ ;
+
+###############################################################################
+alias boostdoc ;
+explicit boostdoc ;
+alias boostrelease : html_ ;
+explicit boostrelease ;

doc/array.adoc

@@ -0,0 +1,28 @@
+////
+Copyright 2001-2004 Nicolai M. Josuttis
+Copyright 2012 Marshall Clow
+Copyright 2024 Christian Mazakas
+Distributed under the Boost Software License, Version 1.0.
+https://www.boost.org/LICENSE_1_0.txt
+////
+
+# Array
+Nicolai M. Josuttis
+:toc: left
+:toclevels: 4
+:idprefix:
+:docinfo: private-footer
+:source-highlighter: rouge
+:source-language: c++
+:sectanchors:
+
+:leveloffset: +1
+
+
+include::array/introduction.adoc[]
+include::array/reference.adoc[]
+include::array/design_rationale.adoc[]
+include::array/information.adoc[]
+include::array/copyright.adoc[]
+
+:leveloffset: -1

doc/array.xml

@@ -1,639 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
-  "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<library name="Array" dirname="array" id="array" last-revision="$Date$">
-  <libraryinfo>
-    <author>
-      <firstname>Nicolai</firstname>
-      <surname>Josuttis</surname>
-    </author>
-    <maintainer>
-      <firstname>Marshall</firstname>
-      <surname>Clow</surname>
-    </maintainer>
-
-    <copyright>
-      <year>2001</year>
-      <year>2002</year>
-      <year>2003</year>
-      <year>2004</year>
-      <holder>Nicolai M. Josuttis</holder>
-    </copyright>
-   
-    <copyright>
-      <year>2012</year>
-      <holder>Marshall Clow</holder>
-    </copyright>
-
-    <legalnotice>
-      <para>Distributed under the Boost Software License, Version 1.0.
-      (See accompanying file <filename>LICENSE_1_0.txt</filename> or copy at 
-      <ulink
-      url="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</ulink>)
-      </para>
-    </legalnotice>
-
-    <librarypurpose>STL compliant container wrapper for arrays of constant size</librarypurpose>
-    <librarycategory name="category:containers"/>
-  </libraryinfo>
-
-  <title>Boost.Array</title>
- 
-  <section id="array.intro">
-    <title>Introduction</title> 
-
-    <using-namespace name="boost"/>
-    <using-class name="array"/>
-
-    <para>The C++ Standard Template Library STL as part of the C++
-    Standard Library provides a framework for processing algorithms on
-    different kind of containers. However, ordinary arrays don't
-    provide the interface of STL containers (although, they provide
-    the iterator interface of STL containers).</para>
-
-    <para>As replacement for ordinary arrays, the STL provides class
-    <code><classname>std::vector</classname></code>.  However,
-    <code><classname>std::vector&lt;&gt;</classname></code> provides
-    the semantics of dynamic arrays. Thus, it manages data to be able
-    to change the number of elements. This results in some overhead in
-    case only arrays with static size are needed.</para>
-
-    <para>In his book, <emphasis>Generic Programming and the
-    STL</emphasis>, Matthew H. Austern introduces a useful wrapper
-    class for ordinary arrays with static size, called
-    <code>block</code>.  It is safer and has no worse performance than
-    ordinary arrays. In <emphasis>The C++ Programming
-    Language</emphasis>, 3rd edition, Bjarne Stroustrup introduces a
-    similar class, called <code>c_array</code>, which I (<ulink
-    url="http://www.josuttis.com">Nicolai Josuttis</ulink>) present
-    slightly modified in my book <emphasis>The C++ Standard Library -
-    A Tutorial and Reference</emphasis>, called
-    <code>carray</code>. This is the essence of these approaches
-    spiced with many feedback from <ulink
-    url="http://www.boost.org">boost</ulink>.</para>
-
-    <para>After considering different names, we decided to name this
-    class simply <code><classname>array</classname></code>.</para>
-
-    <para>Note that this class is suggested to be part of the next
-    Technical Report, which will extend the C++ Standard (see
-    <ulink url="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm">http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm</ulink>).</para>
-
-    <para>Update: <code>std::array</code> is (as of C++11) part of the C++ standard.
-    The differences between <code>boost::array</code> and <code>std::array</code> are minimal.
-    If you are using C++11, you should consider using <code>std::array</code> instead of <code>boost::array</code>.
-    </para>
-
-    <para>Class <code><classname>array</classname></code> fulfills most
-    but not all of the requirements of "reversible containers" (see
-    Section 23.1, [lib.container.requirements] of the C++
-    Standard). The reasons array is not an reversible STL container is
-    because:
-      <itemizedlist spacing="compact">
-        <listitem><simpara>No constructors are provided.</simpara></listitem>
-        <listitem><simpara>Elements may have an undetermined initial value (see <xref linkend="array.rationale"/>).</simpara></listitem>
-        <listitem><simpara><functionname>swap</functionname>() has no constant complexity.</simpara></listitem>
-        <listitem><simpara><methodname>size</methodname>() is always constant, based on the second template argument of the type.</simpara></listitem>
-        <listitem><simpara>The container provides no allocator support.</simpara></listitem>
-      </itemizedlist>
-    </para>
-
-    <para>It doesn't fulfill the requirements of a "sequence" (see Section 23.1.1, [lib.sequence.reqmts] of the C++ Standard), except that:
-      <itemizedlist spacing="compact">
-        <listitem><simpara><methodname>front</methodname>() and <methodname>back</methodname>() are provided.</simpara></listitem>
-        <listitem><simpara><methodname>operator[]</methodname> and <methodname>at</methodname>() are provided.</simpara></listitem>
-      </itemizedlist>
-    </para>
-  </section>
-  
-  <library-reference>
-    <header name="boost/array.hpp">
-      <namespace name="boost">
-        <class name="array">
-          <template>
-            <template-type-parameter name="T"/>
-            <template-nontype-parameter name="N">
-              <type>std::size_t</type>
-            </template-nontype-parameter>
-          </template>
-
-          <purpose><para>STL compliant container wrapper for arrays of constant size</para></purpose>
-          <typedef name="value_type">
-            <type>T</type>
-          </typedef>
-          <typedef name="iterator">
-             <type>T*</type>
-          </typedef>
-          <typedef name="const_iterator">
-             <type>const T*</type>
-          </typedef>
-          <typedef name="reverse_iterator">
-             <type><classname>std::reverse_iterator</classname>&lt;iterator&gt;</type>
-          </typedef>
-          <typedef name="const_reverse_iterator">
-             <type><classname>std::reverse_iterator</classname>&lt;const_iterator&gt;</type>
-          </typedef>
-          <typedef name="reference">
-             <type>T&amp;</type>
-          </typedef>
-          <typedef name="const_reference">
-             <type>const T&amp;</type>
-          </typedef>
-          <typedef name="size_type">
-             <type>std::size_t</type>
-          </typedef>
-          <typedef name="difference_type">
-             <type>std::ptrdiff_t</type>
-          </typedef>
-
-          <static-constant name="static_size">
-            <type>size_type</type>
-            <default>N</default>
-          </static-constant>
-
-          <copy-assignment>
-            <template>
-              <template-type-parameter name="U"/>
-            </template>
-            <parameter name="other">
-              <paramtype>const <classname>array</classname>&lt;U, N&gt;&amp;</paramtype>
-            </parameter>
-            <effects><simpara><code>std::copy(rhs.<methodname>begin</methodname>(),rhs.<methodname>end</methodname>(), <methodname>begin</methodname>())</code></simpara></effects>
-          </copy-assignment>
-
-          <method-group name="iterator support">
-            <overloaded-method name="begin">
-              <signature>
-                <type>iterator</type>
-              </signature>
-              <signature cv="const">
-                <type>const_iterator</type>
-              </signature>
-
-              <returns><simpara>iterator for the first element</simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </overloaded-method>
-
-            <overloaded-method name="end">
-              <signature>
-                <type>iterator</type>
-              </signature>
-              <signature cv="const">
-                <type>const_iterator</type>
-              </signature>
-
-              <returns><simpara>iterator for position after the last element</simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </overloaded-method>
-
-            <overloaded-method name="cbegin" cv="const">
-              <signature>
-                <type>const_iterator</type>
-              </signature>
-
-              <returns><simpara>constant iterator for the first element</simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </overloaded-method>
-
-            <overloaded-method name="cend" cv="const">
-              <signature>
-                <type>const_iterator</type>
-              </signature>
-
-              <returns><simpara>constant iterator for position after the last element</simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </overloaded-method>
-          </method-group>
-
-          <method-group name="reverse iterator support">
-            <overloaded-method name="rbegin">
-              <signature>
-                <type>reverse_iterator</type>
-              </signature>
-              <signature cv="const">
-                <type>const_reverse_iterator</type>
-              </signature>
-
-              <returns><simpara>reverse iterator for the first element of reverse iteration</simpara></returns>
-            </overloaded-method>
-
-            <overloaded-method name="rend">
-              <signature>
-                <type>reverse_iterator</type>
-              </signature>
-              <signature cv="const">
-                <type>const_reverse_iterator</type>
-              </signature>
-
-              <returns><simpara>reverse iterator for position after the last element in reverse iteration</simpara></returns>
-            </overloaded-method>
-  
-            <overloaded-method name="crbegin" cv="const">
-              <signature>
-                <type>const_reverse_iterator</type>
-              </signature>
-
-              <returns><simpara>constant reverse iterator for the first element of reverse iteration</simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </overloaded-method>
-
-            <overloaded-method name="crend" cv="const">
-              <signature>
-                <type>const_reverse_iterator</type>
-              </signature>
-
-              <returns><simpara>constant reverse iterator for position after the last element in reverse iteration</simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </overloaded-method>
-          </method-group>
-
-          <method-group name="capacity">
-            <method name="size">
-              <type>size_type</type>
-              <returns><simpara><code>N</code></simpara></returns>
-            </method>
-            <method name="empty">
-              <type>bool</type>
-              <returns><simpara><code>N==0</code></simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </method>
-            <method name="max_size">
-              <type>size_type</type>
-              <returns><simpara><code>N</code></simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </method>
-          </method-group>
-
-          <method-group name="element access">
-            <overloaded-method name="operator[]">
-              <signature>
-                <type>reference</type>
-                <parameter name="i">
-                  <paramtype>size_type</paramtype>
-                </parameter>
-              </signature>
-
-              <signature cv="const">
-                <type>const_reference</type>
-                <parameter name="i">
-                  <paramtype>size_type</paramtype>
-                </parameter>
-              </signature>
-
-              <requires><simpara><code>i &lt; N</code></simpara></requires>
-              <returns><simpara>element with index <code>i</code></simpara></returns>
-              <throws><simpara>will not throw.</simpara></throws>
-            </overloaded-method>
-
-            <overloaded-method name="at">
-              <signature>
-                <type>reference</type>
-                <parameter name="i">
-                  <paramtype>size_type</paramtype>
-                </parameter>
-              </signature>
-
-              <signature cv="const">
-                <type>const_reference</type>
-                <parameter name="i">
-                  <paramtype>size_type</paramtype>
-                </parameter>
-              </signature>
-
-              <returns><simpara>element with index <code>i</code></simpara></returns>
-              <throws><simpara><code><classname>std::range_error</classname></code> if <code>i &gt;= N</code></simpara></throws>
-            </overloaded-method>
-
-            <overloaded-method name="front">
-              <signature>
-                <type>reference</type>
-              </signature>
-              <signature cv="const">
-                <type>const_reference</type>
-              </signature>
-              <requires><simpara><code>N &gt; 0</code></simpara></requires>
-              <returns><simpara>the first element</simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </overloaded-method>
-
-            <overloaded-method name="back">
-              <signature>
-                <type>reference</type>
-              </signature>
-              <signature cv="const">
-                <type>const_reference</type>
-              </signature>
-              <requires><simpara><code>N &gt; 0</code></simpara></requires>
-              <returns><simpara>the last element</simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </overloaded-method>
-
-            <method name="data" cv="const">
-              <type>const T*</type>
-              <returns><simpara><code>elems</code></simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </method>
-
-           <method name="c_array">
-              <type>T*</type>
-              <returns><simpara><code>elems</code></simpara></returns>
-              <throws><simpara>will not throw</simpara></throws>
-            </method>
-          </method-group>
-
-          <method-group name="modifiers">
-            <method name="swap">
-              <type>void</type>
-              <parameter name="other">
-                <paramtype><classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <effects><simpara><code>std::swap_ranges(<methodname>begin</methodname>(), <methodname>end</methodname>(), other.<methodname>begin</methodname>())</code></simpara></effects>
-              <complexity><simpara>linear in <code>N</code></simpara></complexity>
-            </method>
-            <method name="assign">
-              <type>void</type>
-              <parameter name="value">
-                <paramtype>const T&amp;</paramtype>
-              </parameter>
-              <effects><simpara><code>std::fill_n(<methodname>begin</methodname>(), N, value)</code></simpara></effects>
-            </method>
-          </method-group>
-
-          <data-member name="elems[N]"> <!-- HACK -->
-            <type>T</type>
-          </data-member>
-
-          <free-function-group name="specialized algorithms">
-            <function name="swap"> 
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>void</type>
-              
-              <parameter name="x">
-                <paramtype><classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <parameter name="y">
-                <paramtype><classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-
-              <effects><simpara><code>x.<methodname>swap</methodname>(y)</code></simpara></effects>
-              <throws><simpara>will not throw.</simpara></throws>
-            </function>
-          </free-function-group>
-
-          <free-function-group name="comparisons">
-            <function name="operator==">
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>bool</type>
-              
-              <parameter name="x">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <parameter name="y">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-
-              <returns><simpara><code>std::equal(x.<methodname>begin</methodname>(), x.<methodname>end</methodname>(), y.<methodname>begin</methodname>())</code></simpara>
-              </returns>
-            </function>
- 
-            <function name="operator!=">
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>bool</type>
-              
-              <parameter name="x">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <parameter name="y">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-
-              <returns><simpara><code>!(x == y)</code></simpara>
-              </returns>
-            </function>
-
-            <function name="operator&lt;">
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>bool</type>
-              
-              <parameter name="x">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <parameter name="y">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-
-              <returns><simpara><code>std::lexicographical_compare(x.<methodname>begin</methodname>(), x.<methodname>end</methodname>(), y.<methodname>begin</methodname>(), y.<methodname>end</methodname>())</code></simpara>
-              </returns>
-            </function>
-
-            <function name="operator&gt;">
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>bool</type>
-              
-              <parameter name="x">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <parameter name="y">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-
-              <returns><simpara><code>y &lt; x</code></simpara></returns>
-            </function>
-
-            <function name="operator&lt;=">
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>bool</type>
-              
-              <parameter name="x">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <parameter name="y">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-
-              <returns><simpara><code>!(y &lt; x)</code></simpara></returns>
-            </function>
-
-            <function name="operator&gt;=">
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>bool</type>
-              
-              <parameter name="x">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <parameter name="y">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-
-              <returns><simpara><code>!(x &lt; y)</code></simpara></returns>
-            </function>
-          </free-function-group>
-            
-          <free-function-group name="specializations">
-            <function name="boost::get">
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-                <template-nontype-parameter name="Idx">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>T</type>
-              
-              <parameter name="arr">
-                <paramtype><classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <returns><simpara>element of array with index <code>Idx</code></simpara></returns>
-              <effects><simpara>Will <code>static_assert</code> if <code>Idx >= N</code></simpara></effects>
-            </function>
-
-            <function name="boost::get">
-              <template>
-                <template-type-parameter name="T"/>
-                <template-nontype-parameter name="N">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-                <template-nontype-parameter name="Idx">
-                  <type>std::size_t</type>
-                </template-nontype-parameter>
-              </template>
-
-              <type>T</type>
-              
-              <parameter name="arr">
-                <paramtype>const <classname>array</classname>&lt;T, N&gt;&amp;</paramtype>
-              </parameter>
-              <returns><simpara>const element of array with index <code>Idx</code></simpara></returns>
-              <effects><simpara>Will <code>static_assert</code> if <code>Idx >= N</code></simpara></effects>
-            </function>
-          </free-function-group>
-
-        </class>
-      </namespace>
-    </header>
-  </library-reference>
-
-<section id="array.rationale">
-  <title>Design Rationale</title>
-
-  <para>There was an important design tradeoff regarding the
-  constructors: We could implement array as an "aggregate" (see
-  Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would
-  mean:
-    <itemizedlist>
-      <listitem><simpara>An array can be initialized with a
-      brace-enclosing, comma-separated list of initializers for the
-      elements of the container, written in increasing subscript
-      order:</simpara>
-
-      <programlisting><classname>boost::array</classname>&lt;int,4&gt; a = { { 1, 2, 3 } };</programlisting>
-
-      <simpara>Note that if there are fewer elements in the
-      initializer list, then each remaining element gets
-      default-initialized (thus, it has a defined value).</simpara>
-  </listitem></itemizedlist></para>
-
-  <para>However, this approach has its drawbacks: <emphasis
-  role="bold"> passing no initializer list means that the elements
-  have an indetermined initial value</emphasis>, because the rule says
-  that aggregates may have:
-    <itemizedlist>
-      <listitem><simpara>No user-declared constructors.</simpara></listitem>
-      <listitem><simpara>No private or protected non-static data members.</simpara></listitem>
-      <listitem><simpara>No base classes.</simpara></listitem>
-      <listitem><simpara>No virtual functions.</simpara></listitem>
-    </itemizedlist>
-  </para>
-
-  <para>Nevertheless, The current implementation uses this approach.</para>
-
-  <para>Note that for standard conforming compilers it is possible to
-  use fewer braces (according to 8.5.1 (11) of the Standard). That is,
-  you can initialize an array as follows:</para>
-
-<programlisting>
-<classname>boost::array</classname>&lt;int,4&gt; a = { 1, 2, 3 };
-</programlisting>
-
-  <para>I'd appreciate any constructive feedback. <emphasis
-  role="bold">Please note: I don't have time to read all boost
-  mails. Thus, to make sure that feedback arrives to me, please send
-  me a copy of each mail regarding this class.</emphasis></para>
-
-  <para>The code is provided "as is" without expressed or implied
-  warranty.</para>
-
-</section>
-
-<section id="array.more.info">
-  <title>For more information...</title>
-  <para>To find more details about using ordinary arrays in C++ and
-  the framework of the STL, see e.g.
-
-    <literallayout>The C++ Standard Library - A Tutorial and Reference
-by Nicolai M. Josuttis
-Addison Wesley Longman, 1999
-ISBN 0-201-37926-0</literallayout>
-   </para>
-
-  <para><ulink url="http://www.josuttis.com/">Home Page of Nicolai
-  Josuttis</ulink></para>
-</section>
-
-<section id="array.ack">
-  <title>Acknowledgements</title>
-  
-  <para>Doug Gregor ported the documentation to the BoostBook format.</para>
-</section>
-
-<!-- Notes:
-   empty() should return N != 0
-   size(), empty(), max_size() should be const
-   -->
-
-</library>

doc/array/copyright.adoc

@@ -0,0 +1,15 @@
+////
+Copyright 2024 Christian Mazakas
+Distributed under the Boost Software License, Version 1.0.
+https://www.boost.org/LICENSE_1_0.txt
+////
+
+[#copyright]
+# Copyright and License
+:idprefix: copyright
+
+Copyright (C) 2001-2004 Nicolai M. Josuttis
+
+Copyright (C) 2012 Marshall Clow
+
+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)

doc/array/design_rationale.adoc

@@ -0,0 +1,43 @@
+////
+Copyright 2001-2004 Nicolai M. Josuttis
+Copyright 2012 Marshall Clow
+Copyright 2024 Christian Mazakas
+Distributed under the Boost Software License, Version 1.0.
+https://www.boost.org/LICENSE_1_0.txt
+////
+
+[#design]
+# Design Rationale
+:idprefix: design_
+:cpp: C++
+
+There was an important design tradeoff regarding the constructors: We could implement array as an "aggregate" (see Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would mean:
+
+* An array can be initialized with a brace-enclosing, comma-separated list of initializers for the elements of the container, written in increasing subscript order:
++
+--
+```cpp
+boost::array<int,4> a = { { 1, 2, 3 } };
+```
+
+Note that if there are fewer elements in the initializer list, then each remaining element gets default-initialized (thus, it has a defined value).
+--
+
+However, this approach has its drawbacks: **passing no initializer list means that the elements have an indetermined initial value**, because the rule says that aggregates may have:
+
+* No user-declared constructors.
+* No private or protected non-static data members.
+* No base classes.
+* No virtual functions.
+
+Nevertheless, the current implementation uses this approach.
+
+Note that for standard conforming compilers it is possible to use fewer braces (according to 8.5.1 (11) of the Standard). That is, you can initialize an array as follows:
+
+```cpp
+boost::array<int,4> a = { 1, 2, 3 };
+```
+
+I'd appreciate any constructive feedback. **Please note: I don't have time to read all boost mails. Thus, to make sure that feedback arrives to me, please send me a copy of each mail regarding this class.**
+
+The code is provided "as is" without expressed or implied warranty.

doc/array/information.adoc

@@ -0,0 +1,22 @@
+////
+Copyright 2001-2004 Nicolai M. Josuttis
+Copyright 2012 Marshall Clow
+Copyright 2024 Christian Mazakas
+Distributed under the Boost Software License, Version 1.0.
+https://www.boost.org/LICENSE_1_0.txt
+////
+
+[#information]
+# For more information...
+:idprefix: information_
+:cpp: C++
+
+To find more details about using ordinary arrays in C++ and the framework of the STL, see e.g.
+
+The C++ Standard Library - A Tutorial and Reference +
+by Nicolai M. Josuttis +
+Addison Wesley Longman, 1999 +
+ISBN 0-201-37926-0
+
+
+http://www.josuttis.com/[Home Page of Nicolai Josuttis]

doc/array/introduction.adoc

@@ -0,0 +1,37 @@
+////
+Copyright 2001-2004 Nicolai M. Josuttis
+Copyright 2012 Marshall Clow
+Copyright 2024 Christian Mazakas
+Distributed under the Boost Software License, Version 1.0.
+https://www.boost.org/LICENSE_1_0.txt
+////
+
+[#introduction]
+# Introduction
+:idprefix: introduction_
+:cpp: C++
+
+The {cpp} Standard Template Library STL as part of the {cpp} Standard Library provides a framework for processing algorithms on different kind of containers. However, ordinary arrays don't provide the interface of STL containers (although, they provide the iterator interface of STL containers).
+
+As replacement for ordinary arrays, the STL provides class `std::vector`. However, `std::vector<>` provides the semantics of dynamic arrays. Thus, it manages data to be able to change the number of elements. This results in some overhead in case only arrays with static size are needed.
+
+In his book, _Generic Programming and the STL_, Matthew H. Austern introduces a useful wrapper class for ordinary arrays with static size, called `block`. It is safer and has no worse performance than ordinary arrays. In _The {cpp} Programming Language_, 3rd edition, Bjarne Stroustrup introduces a similar class, called c_array, which I (http://www.josuttis.com/[Nicolai Josuttis]) present slightly modified in my book _The {cpp} Standard Library - A Tutorial and Reference_, called `carray`. This is the essence of these approaches spiced with many feedback from https://www.boost.org/[boost].
+
+After considering different names, we decided to name this class simply `array`.
+
+Note that this class is suggested to be part of the next Technical Report, which will extend the {cpp} Standard (see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).
+
+Update: `std::array` is (as of {cpp}11) part of the {cpp} standard. The differences between `boost::array` and `std::array` are minimal. If you are using {cpp}11, you should consider using `std::array` instead of `boost::array`.
+
+Class `array` fulfills most but not all of the requirements of "reversible containers" (see Section 23.1, [lib.container.requirements] of the {cpp} Standard). The reasons array is not an reversible STL container is because:
+
+* No constructors are provided.
+* Elements may have an undetermined initial value (see the <<design, section called "Design Rationale">>).
+* `swap()` has no constant complexity.
+* `size()` is always constant, based on the second template argument of the type.
+* The container provides no allocator support.
+
+It doesn't fulfill the requirements of a "sequence" (see Section 23.1.1, [lib.sequence.reqmts] of the {cpp} Standard), except that:
+
+* `front()` and `back()` are provided.
+* `operator[]` and `at()` are provided.

doc/array/reference.adoc

@@ -0,0 +1,418 @@
+////
+Copyright 2001-2004 Nicolai M. Josuttis
+Copyright 2012 Marshall Clow
+Copyright 2024 Christian Mazakas
+Distributed under the Boost Software License, Version 1.0.
+https://www.boost.org/LICENSE_1_0.txt
+////
+
+[#reference]
+# Reference
+:idprefix: reference_
+:cpp: C++
+
+## Header <boost/array.hpp>
+
+```cpp
+namespace boost {
+  template<typename T, std::size_t N> class array;
+  template<typename T, std::size_t N> void swap(array<T, N>&, array<T, N>&);
+  template<typename T, std::size_t N>
+    bool operator==(const array<T, N>&, const array<T, N>&);
+  template<typename T, std::size_t N>
+    bool operator!=(const array<T, N>&, const array<T, N>&);
+  template<typename T, std::size_t N>
+    bool operator<(const array<T, N>&, const array<T, N>&);
+  template<typename T, std::size_t N>
+    bool operator>(const array<T, N>&, const array<T, N>&);
+  template<typename T, std::size_t N>
+    bool operator<=(const array<T, N>&, const array<T, N>&);
+  template<typename T, std::size_t N>
+    bool operator>=(const array<T, N>&, const array<T, N>&);
+  template<typename T, std::size_t N, std::size_t Idx>
+    T boost::get(array<T, N>&);
+  template<typename T, std::size_t N, std::size_t Idx>
+    T boost::get(const array<T, N>&);
+}
+```
+
+## Class template array
+
+### Synopsis
+
+```cpp
+// In header: <boost/array.hpp>
+
+template<typename T, std::size_t N>
+class array {
+public:
+  // types
+  typedef T                                     value_type;
+  typedef T*                                    iterator;
+  typedef const T*                              const_iterator;
+  typedef std::reverse_iterator<iterator>       reverse_iterator;
+  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+  typedef T&                                    reference;
+  typedef const T&                              const_reference;
+  typedef std::size_t                           size_type;
+  typedef std::ptrdiff_t                        difference_type;
+
+  // static constants
+  static const size_type static_size = N;
+
+  // construct/copy/destruct
+  template<typename U> array& operator=(const array<U, N>&);
+
+  // iterator support
+  iterator begin();
+  const_iterator begin() const;
+  iterator end();
+  const_iterator end() const;
+  const_iterator cbegin();
+  const_iterator cend();
+
+  // reverse iterator support
+  reverse_iterator rbegin();
+  const_reverse_iterator rbegin() const;
+  reverse_iterator rend();
+  const_reverse_iterator rend() const;
+  const_reverse_iterator crbegin();
+  const_reverse_iterator crend();
+
+  // capacity
+  size_type size();
+  bool empty();
+  size_type max_size();
+
+  // element access
+  reference operator[](size_type);
+  const_reference operator[](size_type) const;
+  reference at(size_type);
+  const_reference at(size_type) const;
+  reference front();
+  const_reference front() const;
+  reference back();
+  const_reference back() const;
+  const T* data() const;
+  T* c_array();
+
+  // modifiers
+  void swap(array<T, N>&);
+  void assign(const T&);
+
+  // public data members
+  T elems[N];
+};
+
+// specialized algorithms
+template<typename T, std::size_t N> void swap(array<T, N>&, array<T, N>&);
+
+// comparisons
+template<typename T, std::size_t N>
+  bool operator==(const array<T, N>&, const array<T, N>&);
+template<typename T, std::size_t N>
+  bool operator!=(const array<T, N>&, const array<T, N>&);
+template<typename T, std::size_t N>
+  bool operator<(const array<T, N>&, const array<T, N>&);
+template<typename T, std::size_t N>
+  bool operator>(const array<T, N>&, const array<T, N>&);
+template<typename T, std::size_t N>
+  bool operator<=(const array<T, N>&, const array<T, N>&);
+template<typename T, std::size_t N>
+  bool operator>=(const array<T, N>&, const array<T, N>&);
+
+// specializations
+template<typename T, std::size_t N, std::size_t Idx>
+  T boost::get(array<T, N>&);
+template<typename T, std::size_t N, std::size_t Idx>
+  T boost::get(const array<T, N>&);
+```
+
+### Description
+
+#### array public construct/copy/destruct
+
+```
+template<typename U> array& operator=(const array<U, N>& other);
+```
+[horizontal]
+Effects: :: `std::copy(rhs.begin(), rhs.end(), begin())`
+
+---
+
+#### array iterator support
+
+```
+iterator begin();
+const_iterator begin() const;
+```
+[horizontal]
+Returns: :: iterator for the first element
+Throws: :: will not throw
+
+---
+
+```
+iterator end();
+const_iterator end() const;
+```
+[horizontal]
+Returns: :: iterator for position after the last element
+Throws: :: will not throw
+
+---
+
+```
+const_iterator cbegin();
+```
+[horizontal]
+Returns: :: constant iterator for the first element
+Throws: :: will not throw
+
+---
+
+```
+const_iterator cend();
+```
+[horizontal]
+Returns: :: constant iterator for position after the last element
+Throws: :: will not throw
+
+---
+
+#### array reverse iterator support
+
+```
+reverse_iterator rbegin();
+const_reverse_iterator rbegin() const;
+```
+[horizontal]
+Returns: :: reverse iterator for the first element of reverse iteration
+
+---
+
+```
+reverse_iterator rend();
+const_reverse_iterator rend() const;
+```
+[horizontal]
+Returns: :: reverse iterator for position after the last element in reverse iteration
+
+---
+
+```
+const_reverse_iterator crbegin();
+```
+[horizontal]
+Returns: :: constant reverse iterator for the first element of reverse iteration
+Throws: :: will not throw
+
+---
+
+```
+const_reverse_iterator crend();
+```
+[horizontal]
+Returns: ::  constant reverse iterator for position after the last element in reverse iteration
+Throws: ::  will not throw
+
+---
+
+#### array capacity
+
+```
+size_type size();
+```
+[horizontal]
+Returns: :: `N`
+
+---
+
+```
+bool empty();
+```
+[horizontal]
+Returns: :: `N==0`
+Throws: :: will not throw
+
+---
+
+```
+size_type max_size();
+```
+[horizontal]
+Returns: :: `N`
+Throws: ::  will not throw
+
+---
+
+#### array element access
+
+```
+reference operator[](size_type i);
+const_reference operator[](size_type i) const;
+```
+[horizontal]
+Requires: :: `i < N`
+Returns: ::  element with index `i`
+Throws: :: will not throw.
+
+---
+
+```
+reference at(size_type i);
+const_reference at(size_type i) const;
+```
+[horizontal]
+Returns: :: element with index `i`
+Throws: :: `std::range_error` if `i >= N`
+
+---
+
+```
+reference front();
+const_reference front() const;
+```
+[horizontal]
+Requires: ::  `N > 0`
+Returns: :: the first element
+Throws: :: will not throw
+
+---
+
+```
+reference back();
+const_reference back() const;
+```
+[horizontal]
+Requires: :: `N > 0`
+Returns: :: the last element
+Throws: :: will not throw
+
+---
+
+```
+const T* data() const;
+```
+[horizontal]
+Returns: :: `elems`
+Throws: :: will not throw
+
+---
+
+```
+T* c_array();
+```
+[horizontal]
+Returns: :: `elems`
+Throws: :: will not throw
+
+---
+
+#### array modifiers
+
+```
+void swap(array<T, N>& other);
+```
+[horizontal]
+Effects: :: `std::swap_ranges(begin(), end(), other.begin())`
+Complexity: :: linear in `N`
+
+---
+
+```
+void assign(const T& value);
+```
+[horizontal]
+Effects: :: `std::fill_n(begin(), N, value)`
+
+---
+
+#### array specialized algorithms
+
+```
+template<typename T, std::size_t N> void swap(array<T, N>& x, array<T, N>& y);
+```
+[horizontal]
+Effects: :: `x.swap(y)`
+Throws: :: will not throw.
+
+---
+
+#### array comparisons
+
+```
+template<typename T, std::size_t N>
+  bool operator==(const array<T, N>& x, const array<T, N>& y);
+```
+[horizontal]
+Returns: :: `std::equal(x.begin(), x.end(), y.begin())`
+
+---
+
+```
+template<typename T, std::size_t N>
+  bool operator!=(const array<T, N>& x, const array<T, N>& y);
+```
+[horizontal]
+Returns: :: `!(x == y)`
+
+---
+
+```
+template<typename T, std::size_t N>
+  bool operator<(const array<T, N>& x, const array<T, N>& y);
+```
+[horizontal]
+Returns: :: `std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end())`
+
+---
+
+```
+template<typename T, std::size_t N>
+  bool operator>(const array<T, N>& x, const array<T, N>& y);
+```
+[horizontal]
+Returns: :: `y < x`
+
+---
+
+```
+template<typename T, std::size_t N>
+  bool operator<=(const array<T, N>& x, const array<T, N>& y);
+```
+[horizontal]
+Returns: :: `!(y < x)`
+
+---
+
+```
+template<typename T, std::size_t N>
+  bool operator>=(const array<T, N>& x, const array<T, N>& y);
+```
+[horizontal]
+Returns: :: `!(x < y)`
+
+---
+
+#### array specializations
+
+```
+template<typename T, std::size_t N, std::size_t Idx>
+  T boost::get(array<T, N>& arr);
+```
+[horizontal]
+Returns: :: element of array with index `Idx`
+Effects: :: Will `static_assert` if `Idx >= N`
+
+---
+
+```
+template<typename T, std::size_t N, std::size_t Idx>
+  T boost::get(const array<T, N>& arr);
+```
+[horizontal]
+Returns: :: const element of array with index `Idx`
+Effects: :: Will `static_assert` if `Idx >= N`
+
+---

include/boost/array.hpp

@@ -33,23 +33,21 @@
 
 #include <boost/detail/workaround.hpp>
 
-#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)  
-# pragma warning(push)  
+#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)
+# pragma warning(push)
 # pragma warning(disable:4996) // 'std::equal': Function call with parameters that may be unsafe
-# pragma warning(disable:4510) // boost::array<T,N>' : default constructor could not be generated 
-# pragma warning(disable:4610) // warning C4610: class 'boost::array<T,N>' can never be instantiated - user defined constructor required 
+# pragma warning(disable:4510) // boost::array<T,N>' : default constructor could not be generated
+# pragma warning(disable:4610) // warning C4610: class 'boost::array<T,N>' can never be instantiated - user defined constructor required
 #endif
 
 #include <cstddef>
+#include <iterator>
 #include <stdexcept>
 #include <boost/assert.hpp>
+#include <boost/core/invoke_swap.hpp>
 #include <boost/static_assert.hpp>
-#include <boost/swap.hpp>
 
-// Handles broken standard libraries better than <iterator>
-#include <boost/detail/iterator.hpp>
 #include <boost/throw_exception.hpp>
-#include <boost/functional/hash_fwd.hpp>
 #include <algorithm>
 
 // FIXES for broken compilers
@@ -77,24 +75,18 @@ namespace boost {
         iterator        begin()       { return elems; }
         const_iterator  begin() const { return elems; }
         const_iterator cbegin() const { return elems; }
-        
+
         iterator        end()       { return elems+N; }
         const_iterator  end() const { return elems+N; }
         const_iterator cend() const { return elems+N; }
 
         // reverse iterator support
-#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
+#if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
         typedef std::reverse_iterator<iterator> reverse_iterator;
         typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-#elif defined(_MSC_VER) && (_MSC_VER == 1300) && defined(BOOST_DINKUMWARE_STDLIB) && (BOOST_DINKUMWARE_STDLIB == 310)
-        // workaround for broken reverse_iterator in VC7
-        typedef std::reverse_iterator<std::_Ptrit<value_type, difference_type, iterator,
-                                      reference, iterator, reference> > reverse_iterator;
-        typedef std::reverse_iterator<std::_Ptrit<value_type, difference_type, const_iterator,
-                                      const_reference, iterator, reference> > const_reverse_iterator;
-#elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) 
-        typedef std::reverse_iterator<iterator, std::random_access_iterator_tag, 
-              value_type, reference, iterator, difference_type> reverse_iterator; 
+#elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC)
+        typedef std::reverse_iterator<iterator, std::random_access_iterator_tag,
+              value_type, reference, iterator, difference_type> reverse_iterator;
         typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag,
               value_type, const_reference, const_iterator, difference_type> const_reverse_iterator;
 #else
@@ -120,39 +112,39 @@ namespace boost {
         }
 
         // operator[]
-        reference operator[](size_type i) 
-        { 
-            return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i]; 
+        reference operator[](size_type i)
+        {
+            return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i];
         }
-        
-        /*BOOST_CONSTEXPR*/ const_reference operator[](size_type i) const 
-        {     
-            return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i]; 
+
+        /*BOOST_CONSTEXPR*/ const_reference operator[](size_type i) const
+        {
+            return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i];
         }
 
         // at() with range check
         reference                           at(size_type i)       { return rangecheck(i), elems[i]; }
         /*BOOST_CONSTEXPR*/ const_reference at(size_type i) const { return rangecheck(i), elems[i]; }
-    
+
         // front() and back()
-        reference front() 
-        { 
-            return elems[0]; 
-        }
-        
-        BOOST_CONSTEXPR const_reference front() const 
+        reference front()
         {
             return elems[0];
         }
-        
-        reference back() 
-        { 
-            return elems[N-1]; 
+
+        BOOST_CONSTEXPR const_reference front() const
+        {
+            return elems[0];
         }
-        
-        BOOST_CONSTEXPR const_reference back() const 
-        { 
-            return elems[N-1]; 
+
+        reference back()
+        {
+            return elems[N-1];
+        }
+
+        BOOST_CONSTEXPR const_reference back() const
+        {
+            return elems[N-1];
         }
 
         // size is constant
@@ -164,7 +156,7 @@ namespace boost {
         // swap (note: linear complexity)
         void swap (array<T,N>& y) {
             for (size_type i = 0; i < N; ++i)
-                boost::swap(elems[i],y.elems[i]);
+                boost::core::invoke_swap(elems[i],y.elems[i]);
         }
 
         // direct access to data (read-only)
@@ -190,12 +182,11 @@ namespace boost {
 
         // check range (may be private because it is static)
         static BOOST_CONSTEXPR bool rangecheck (size_type i) {
-            return i > size() ? boost::throw_exception(std::out_of_range ("array<>: index out of range")), true : true;
+            return i >= size() ? boost::throw_exception(std::out_of_range ("array<>: index out of range")), true : true;
         }
 
     };
 
-#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
     template< class T >
     class array< T, 0 > {
 
@@ -219,18 +210,12 @@ namespace boost {
         const_iterator cend() const { return cbegin(); }
 
         // reverse iterator support
-#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
+#if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
         typedef std::reverse_iterator<iterator> reverse_iterator;
         typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-#elif defined(_MSC_VER) && (_MSC_VER == 1300) && defined(BOOST_DINKUMWARE_STDLIB) && (BOOST_DINKUMWARE_STDLIB == 310)
-        // workaround for broken reverse_iterator in VC7
-        typedef std::reverse_iterator<std::_Ptrit<value_type, difference_type, iterator,
-                                      reference, iterator, reference> > reverse_iterator;
-        typedef std::reverse_iterator<std::_Ptrit<value_type, difference_type, const_iterator,
-                                      const_reference, iterator, reference> > const_reverse_iterator;
-#elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) 
-        typedef std::reverse_iterator<iterator, std::random_access_iterator_tag, 
-              value_type, reference, iterator, difference_type> reverse_iterator; 
+#elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC)
+        typedef std::reverse_iterator<iterator, std::random_access_iterator_tag,
+              value_type, reference, iterator, difference_type> reverse_iterator;
         typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag,
               value_type, const_reference, const_iterator, difference_type> const_reverse_iterator;
 #else
@@ -316,7 +301,7 @@ namespace boost {
         // assign one value to all elements
         void assign (const T& value) { fill ( value ); }
         void fill   (const T& ) {}
-        
+
         // check range (may be private because it is static)
         static reference failed_rangecheck () {
                 std::out_of_range e("attempt to access element of an empty array");
@@ -332,7 +317,6 @@ namespace boost {
 #endif
             }
     };
-#endif
 
     // comparisons
     template<class T, std::size_t N>
@@ -369,16 +353,16 @@ namespace boost {
 #if defined(__SUNPRO_CC)
 //  Trac ticket #4757; the Sun Solaris compiler can't handle
 //  syntax like 'T(&get_c_array(boost::array<T,N>& arg))[N]'
-//  
-//  We can't just use this for all compilers, because the 
-//      borland compilers can't handle this form. 
+//
+//  We can't just use this for all compilers, because the
+//      borland compilers can't handle this form.
     namespace detail {
        template <typename T, std::size_t N> struct c_array
        {
            typedef T type[N];
        };
     }
-    
+
    // Specific for boost::array: simply returns its elems data member.
    template <typename T, std::size_t N>
    typename detail::c_array<T,N>::type& get_c_array(boost::array<T,N>& arg)
@@ -388,7 +372,7 @@ namespace boost {
 
    // Specific for boost::array: simply returns its elems data member.
    template <typename T, std::size_t N>
-   typename const detail::c_array<T,N>::type& get_c_array(const boost::array<T,N>& arg)
+   typename detail::c_array<T,N>::type const& get_c_array(const boost::array<T,N>& arg)
    {
        return arg.elems;
    }
@@ -399,7 +383,7 @@ namespace boost {
     {
         return arg.elems;
     }
-    
+
     // Const version.
     template <typename T, std::size_t N>
     const T(&get_c_array(const boost::array<T,N>& arg))[N]
@@ -407,7 +391,7 @@ namespace boost {
         return arg.elems;
     }
 #endif
-    
+
 #if 0
     // Overload for std::array, assuming that std::array will have
     // explicit conversion functions as discussed at the WG21 meeting
@@ -417,7 +401,7 @@ namespace boost {
     {
         return static_cast<T(&)[N]>(arg);
     }
-    
+
     // Const version.
     template <typename T, std::size_t N>
     const T(&get_c_array(const std::array<T,N>& arg))[N]
@@ -426,6 +410,7 @@ namespace boost {
     }
 #endif
 
+    template <class It> std::size_t hash_range(It, It);
 
     template<class T, std::size_t N>
     std::size_t hash_value(const array<T,N>& arr)
@@ -438,7 +423,7 @@ namespace boost {
        BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(boost::array &) index out of range" );
        return arr[Idx];
        }
-    
+
    template <size_t Idx, typename T, size_t N>
    const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT {
        BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(const boost::array &) index out of range" );
@@ -455,7 +440,7 @@ namespace std {
        BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(boost::array &) index out of range" );
        return arr[Idx];
        }
-    
+
    template <size_t Idx, typename T, size_t N>
    const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT {
        BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(const boost::array &) index out of range" );
@@ -464,8 +449,8 @@ namespace std {
 }
 #endif
 
-#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)  
-# pragma warning(pop)  
-#endif 
+#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)
+# pragma warning(pop)
+#endif
 
 #endif /*BOOST_ARRAY_HPP*/

index.html

@@ -1,13 +1,13 @@
 <html>
 <head>
-<meta http-equiv="refresh" content="0; URL=../../doc/html/array.html">
+<meta http-equiv="refresh" content="0; URL=doc/html/array.html">
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../../doc/html/array.html">../../doc/html/array.html</a> &nbsp;<hr>
+<a href="../../doc/html/array.html">doc/html/array.html</a> &nbsp;<hr>
 <p><EFBFBD> Copyright Beman Dawes, 2001</p>
 <p>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">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>

meta/libraries.json

@@ -0,0 +1,18 @@
+{
+    "key": "array",
+    "name": "Array",
+    "authors": [
+        "Nicolai Josuttis"
+    ],
+    "description": "STL compliant container wrapper for arrays of constant size.",
+    "std": [
+        "tr1"
+    ],
+    "category": [
+        "Containers"
+    ],
+    "maintainers": [
+        "Marshall Clow <marshall -at- idio.com>"
+    ],
+    "cxxstd": "03"
+}

test/CMakeLists.txt

@@ -0,0 +1,12 @@
+# Copyright 2018, 2019, 2021, 2022 Peter Dimov
+# 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
+
+include(BoostTestJamfile OPTIONAL RESULT_VARIABLE HAVE_BOOST_TEST)
+
+if(HAVE_BOOST_TEST)
+
+boost_test_jamfile(FILE Jamfile.v2
+  LINK_LIBRARIES Boost::array Boost::container_hash Boost::core)
+
+endif()

test/Jamfile.v2

@@ -2,24 +2,51 @@
 #~ 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.0.1 ;
 import testing ;
+import-search /boost/config/checks ;
+import config : requires ;
 
-alias unit_test_framework
-    : # sources
-        /boost//unit_test_framework
-    ;        
+#
 
-test-suite array :
-    [ run array0.cpp unit_test_framework  : : : : array0 ]
-    [ run array1.cpp ]
-    [ run array2.cpp ]
-    [ run array3.cpp ]
-    [ run array4.cpp ]
-    [ run array5.cpp ]
-    [ run array6.cpp unit_test_framework  : : : : array6 ]
-    [ run array7.cpp unit_test_framework  : : : : array7 ]
-#    [ run array_constexpr.cpp unit_test_framework  : : : : array_constexpr ]
-    [ compile-fail array_getfail1.cpp ]
-    [ compile-fail array_getfail2.cpp ]
-    [ run array_hash.cpp unit_test_framework  : : : : array_hash ]
-    ;
+run array0.cpp ;
+run array1.cpp ;
+run array2.cpp ;
+run array3.cpp ;
+run array4.cpp ;
+run array5.cpp ;
+run array6.cpp ;
+run array7.cpp ;
+
+# run array_constexpr.cpp ;
+
+compile-fail array_getfail1.cpp ;
+compile-fail array_getfail2.cpp ;
+
+run array_hash.cpp
+  : : : [ requires cxx11_noexcept ] ;
+
+#
+
+run array_typedef_test.cpp ;
+run array_elems_test.cpp ;
+run array_init_test.cpp ;
+run array_copy_test.cpp ;
+run array_convert_test.cpp ;
+run array_data_test.cpp ;
+run array_iterator_test.cpp ;
+run array_reverse_test.cpp ;
+run array_size_test.cpp ;
+run array_access_test.cpp ;
+run array_c_array_test.cpp ;
+run array_fill_test.cpp ;
+run array_assign_test.cpp ;
+run array_swap_test.cpp ;
+run array_swap_test2.cpp ;
+run array_eq_test.cpp ;
+run array_lt_test.cpp ;
+run array_get_test.cpp ;
+
+#
+
+run quick.cpp ;

test/array0.cpp

@@ -9,15 +9,14 @@
 #include <iostream>
 #include <boost/array.hpp>
 
-#define BOOST_TEST_MAIN
-#include <boost/test/unit_test.hpp>
+#include <boost/core/lightweight_test_trait.hpp>
 
 namespace {
 
 template< class T >
 void    BadValue( const T &  )
 {
-    BOOST_CHECK ( false );
+    BOOST_TEST ( false );
 }
 
 template< class T >
@@ -33,19 +32,19 @@ void    RunTests()
 
     //  front/back and operator[] must compile, but calling them is undefined
     //  Likewise, all tests below should evaluate to false, avoiding undefined behaviour
-    BOOST_CHECK (       test_case.empty());
-    BOOST_CHECK ( const_test_case.empty());
+    BOOST_TEST (       test_case.empty());
+    BOOST_TEST ( const_test_case.empty());
 
-    BOOST_CHECK (       test_case.size() == 0 );
-    BOOST_CHECK ( const_test_case.size() == 0 );
+    BOOST_TEST (       test_case.size() == 0 );
+    BOOST_TEST ( const_test_case.size() == 0 );
 
     //  Assert requirements of TR1 6.2.2.4
-    BOOST_CHECK ( test_case.begin()  == test_case.end());
-    BOOST_CHECK ( test_case.cbegin() == test_case.cend());
-    BOOST_CHECK ( const_test_case.begin() == const_test_case.end());
-    BOOST_CHECK ( const_test_case.cbegin() == const_test_case.cend());
+    BOOST_TEST ( test_case.begin()  == test_case.end());
+    BOOST_TEST ( test_case.cbegin() == test_case.cend());
+    BOOST_TEST ( const_test_case.begin() == const_test_case.end());
+    BOOST_TEST ( const_test_case.cbegin() == const_test_case.cend());
 
-    BOOST_CHECK ( test_case.begin() != const_test_case.begin() );
+    BOOST_TEST ( test_case.begin() != const_test_case.begin() );
     if( test_case.data() == const_test_case.data() ) {
     //  Value of data is unspecified in TR1, so no requirement this test pass or fail
     //  However, it must compile!
@@ -79,11 +78,12 @@ void    RunTests()
 
 }
 
-BOOST_AUTO_TEST_CASE( test_main )
+int main()
 {
     RunTests< bool >();
     RunTests< void * >();
     RunTests< long double >();
     RunTests< std::string >();
-}
 
+    return boost::report_errors();
+}

test/array6.cpp

@@ -10,8 +10,7 @@
 #include <boost/array.hpp>
 #include <algorithm>
 
-#define BOOST_TEST_MAIN
-#include <boost/test/unit_test.hpp>
+#include <boost/core/lightweight_test_trait.hpp>
 
 namespace {
     template< class T >
@@ -22,19 +21,40 @@ namespace {
         test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
     
         arr &aRef = get_c_array ( test_case );
-        BOOST_CHECK ( &*test_case.begin () == &aRef[0] );
+        BOOST_TEST ( &*test_case.begin () == &aRef[0] );
         
         const arr &caRef = get_c_array ( test_case );
         typename test_type::const_iterator iter = test_case.begin ();
-        BOOST_CHECK ( &*iter == &caRef[0] );
+        BOOST_TEST ( &*iter == &caRef[0] );
+
+    //  Confirm at() throws the std lib defined exception
+        try {
+            test_case.at( test_case.size());
+            BOOST_TEST(false);
+            }
+        catch ( const std::out_of_range & ) {}
+
+        try {
+            test_case.at( test_case.size() + 1);
+            BOOST_TEST(false);
+            }
+        catch ( const std::out_of_range & ) {}
+
+        try {
+            test_case.at( test_case.size() + 100);
+            BOOST_TEST(false);
+            }
+        catch ( const std::out_of_range & ) {}
     }
 }
 
-BOOST_AUTO_TEST_CASE( test_main )
+int main ()
 {
     RunTests< bool >();
     RunTests< void * >();
     RunTests< long double >();
     RunTests< std::string >();
+
+    return boost::report_errors();
 }
 

test/array7.cpp

@@ -13,8 +13,7 @@
 #include <array>
 #endif
 
-#define BOOST_TEST_MAIN
-#include <boost/test/unit_test.hpp>
+#include <boost/core/lightweight_test_trait.hpp>
 
 namespace {
 
@@ -23,14 +22,13 @@ namespace {
     void    RunStdTests()
     {
         typedef boost::array< T, 5 >    test_type;
-        typedef T arr[5];
         test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
     
         T &aRef = std::get<0> ( test_case );
-        BOOST_CHECK ( &*test_case.begin () == &aRef );
+        BOOST_TEST ( &*test_case.begin () == &aRef );
         
         const T &caRef = std::get<0> ( test_case );
-        BOOST_CHECK ( &*test_case.cbegin () == &caRef );
+        BOOST_TEST ( &*test_case.cbegin () == &caRef );
     }
     #endif
 
@@ -38,19 +36,18 @@ namespace {
     void    RunBoostTests()
     {
         typedef boost::array< T, 5 >    test_type;
-        typedef T arr[5];
         test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
     
         T &aRef = boost::get<0> ( test_case );
-        BOOST_CHECK ( &*test_case.begin () == &aRef );
+        BOOST_TEST ( &*test_case.begin () == &aRef );
         
         const T &caRef = boost::get<0> ( test_case );
-        BOOST_CHECK ( &*test_case.cbegin () == &caRef );
+        BOOST_TEST ( &*test_case.cbegin () == &caRef );
     }
 
 }
 
-BOOST_AUTO_TEST_CASE( test_main )
+int main()
 {
     RunBoostTests< bool >();
     RunBoostTests< void * >();
@@ -63,5 +60,7 @@ BOOST_AUTO_TEST_CASE( test_main )
     RunStdTests< long double >();
     RunStdTests< std::string >();
 #endif
+
+    return boost::report_errors();
 }
 

test/array_access_test.cpp

@@ -0,0 +1,117 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#define BOOST_ENABLE_ASSERT_HANDLER
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+struct assertion_failure
+{
+};
+
+namespace boost
+{
+
+void assertion_failed( char const* /*expr*/, char const* /*function*/, char const* /*file*/, long /*line*/ )
+{
+    throw assertion_failure();
+}
+
+void assertion_failed_msg( char const* /*expr*/, char const* /*msg*/, char const* /*function*/, char const* /*file*/, long /*line*/ )
+{
+    throw assertion_failure();
+}
+
+} // namespace boost
+
+template<class T, std::size_t N> void test()
+{
+    {
+        boost::array<T, N> a = {{}};
+
+        T* p1 = a.data();
+
+        for( std::size_t i = 0; i < N; ++i )
+        {
+            T* p2 = &a[ i ];
+            T* p3 = &a.at( i );
+
+            BOOST_TEST_EQ( p2, p1 + i );
+            BOOST_TEST_EQ( p3, p1 + i );
+        }
+
+        {
+            T* p2 = &a.front();
+            T* p3 = &a.back();
+
+            BOOST_TEST_EQ( p2, p1 + 0 );
+            BOOST_TEST_EQ( p3, p1 + N - 1 );
+        }
+
+        BOOST_TEST_THROWS( a.at( N ), std::out_of_range );
+        BOOST_TEST_THROWS( a[ N ], assertion_failure );
+    }
+
+    {
+        boost::array<T, N> const a = {{}};
+
+        T const* p1 = a.data();
+
+        for( std::size_t i = 0; i < N; ++i )
+        {
+            T const* p2 = &a[ i ];
+            T const* p3 = &a.at( i );
+
+            BOOST_TEST_EQ( p2, p1 + i );
+            BOOST_TEST_EQ( p3, p1 + i );
+        }
+
+        {
+            T const* p2 = &a.front();
+            T const* p3 = &a.back();
+
+            BOOST_TEST_EQ( p2, p1 + 0 );
+            BOOST_TEST_EQ( p3, p1 + N - 1 );
+        }
+
+        BOOST_TEST_THROWS( a.at( N ), std::out_of_range );
+        BOOST_TEST_THROWS( a[ N ], assertion_failure );
+    }
+}
+
+template<class T> void test2()
+{
+    {
+        boost::array<T, 0> a = {};
+
+        BOOST_TEST_THROWS( a.at( 0 ), std::out_of_range );
+        BOOST_TEST_THROWS( a[ 0 ], std::out_of_range );
+        BOOST_TEST_THROWS( a.front(), std::out_of_range );
+        BOOST_TEST_THROWS( a.back(), std::out_of_range );
+    }
+
+    {
+        boost::array<T, 0> const a = {};
+
+        BOOST_TEST_THROWS( a.at( 0 ), std::out_of_range );
+        BOOST_TEST_THROWS( a[ 0 ], std::out_of_range );
+        BOOST_TEST_THROWS( a.front(), std::out_of_range );
+        BOOST_TEST_THROWS( a.back(), std::out_of_range );
+    }
+}
+
+int main()
+{
+    test<int, 1>();
+    test<int, 7>();
+
+    test<int const, 1>();
+    test<int const, 7>();
+
+    test2<int>();
+
+    return boost::report_errors();
+}

test/array_assign_test.cpp

@@ -0,0 +1,60 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+// assign is a nonstandard equivalent of fill
+// it probably needs to be deprecated and removed
+
+template<class T, std::size_t N> void test()
+{
+    boost::array<T, N> a = {};
+
+    a.assign( 1 );
+
+    for( std::size_t i = 0; i < N; ++i )
+    {
+        BOOST_TEST_EQ( a[i], 1 );
+    }
+}
+
+template<class T> void test2()
+{
+    boost::array<T, 4> a = {{ 1, 2, 3, 4 }};
+
+    a.assign( 5 );
+
+    for( std::size_t i = 0; i < 4; ++i )
+    {
+        BOOST_TEST_EQ( a[i], 5 );
+    }
+}
+
+template<class T> void test3()
+{
+    boost::array<T, 4> a = {{ 1, 2, 3, 4 }};
+
+    // aliasing
+    a.assign( a[ 1 ] );
+
+    for( std::size_t i = 0; i < 4; ++i )
+    {
+        BOOST_TEST_EQ( a[i], 2 );
+    }
+}
+
+int main()
+{
+    test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    test2<int>();
+
+    test3<int>();
+
+    return boost::report_errors();
+}

test/array_c_array_test.cpp

@@ -0,0 +1,70 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <boost/config.hpp>
+#include <boost/config/workaround.hpp>
+#include <cstddef>
+
+// c_array and get_c_array are nonstandard extensions
+// probably need to be deprecated and removed
+
+template<class T, std::size_t N> void test()
+{
+    boost::array<T, N> a = {};
+
+    T* p1 = a.c_array();
+    T* p2 = a.data();
+
+    BOOST_TEST_EQ( p1, p2 );
+}
+
+template<class T, std::size_t N> void test2()
+{
+    {
+        boost::array<T, N> a = {{}};
+
+        T (&e1)[ N ] = boost::get_c_array( a );
+        T (&e2)[ N ] = a.elems;
+
+        BOOST_TEST_EQ( static_cast<T*>( e1 ), static_cast<T*>( e2 ) );
+    }
+    {
+        boost::array<T, N> const a = {{}};
+
+        T const (&e1)[ N ] = boost::get_c_array( a );
+        T const (&e2)[ N ] = a.elems;
+
+        BOOST_TEST_EQ( static_cast<T const*>( e1 ), static_cast<T const*>( e2 ) );
+    }
+}
+
+int main()
+{
+    test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    test<int const, 0>();
+
+#if BOOST_WORKAROUND(BOOST_MSVC, < 1910) || BOOST_WORKAROUND(BOOST_GCC, < 50000)
+
+    // = {} doesn't work for const T
+
+#else
+
+    test<int const, 1>();
+    test<int const, 7>();
+
+#endif
+
+    test2<int, 1>();
+    test2<int, 7>();
+
+    test2<int const, 1>();
+    test2<int const, 7>();
+
+    return boost::report_errors();
+}

test/array_constexpr.cpp

@@ -3,7 +3,7 @@
  * 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)
- */
+ */ 
 
 #include <string>
 #include <iostream>
@@ -13,9 +13,6 @@
 #include <array>
 #endif
 
-#define BOOST_TEST_MAIN
-#include <boost/test/unit_test.hpp>
-
 #ifndef BOOST_NO_CXX11_CONSTEXPR
 constexpr boost::array<int, 10> arr  {{ 0,1,2,3,4,5,6,7,8,9 }};
 constexpr std::array<int, 10> arr_std {{ 0,1,2,3,4,5,6,7,8,9 }};
@@ -26,18 +23,17 @@ void sink ( T t ) {}
 template <typename T, size_t N>
 void sink ( boost::array<T,N> &arr ) {}
 
-BOOST_AUTO_TEST_CASE( test_main )
+int main()
 {
 //    constexpr int two = arr_std.at (2);
     constexpr int three = arr.at (3);
     int whatever [ arr.at(4) ];
     (void)three;
-	(void) whatever;
+    (void) whatever;
 }
 
-#else	// no constexpr means no constexpr tests!
-BOOST_AUTO_TEST_CASE( test_main )
+#else   // no constexpr means no constexpr tests!
+int main()
 {
 }
 #endif
-

test/array_convert_test.cpp

@@ -0,0 +1,38 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, class U, std::size_t N> void test2()
+{
+    boost::array<T, N> a1 = {};
+
+    boost::array<U, N> a2;
+    a2 = a1;
+
+    BOOST_TEST_ALL_EQ( a1.begin(), a1.end(), a2.begin(), a2.end() );
+}
+
+template<class T, class U> void test4()
+{
+    boost::array<T, 4> a1 = { 1, 2, 3, 4 };
+
+    boost::array<U, 4> a2;
+    a2 = a1;
+
+    BOOST_TEST_ALL_EQ( a1.begin(), a1.end(), a2.begin(), a2.end() );
+}
+
+int main()
+{
+    test2<int, long, 0>();
+    test2<int, long, 1>();
+    test2<int, long, 7>();
+
+    test4<int, long>();
+
+    return boost::report_errors();
+}

test/array_copy_test.cpp

@@ -0,0 +1,65 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test1()
+{
+    boost::array<T, N> a1 = {{}};
+    boost::array<T, N> a2 = a1;
+
+    BOOST_TEST_ALL_EQ( a1.begin(), a1.end(), a2.begin(), a2.end() );
+}
+
+template<class T, std::size_t N> void test2()
+{
+    boost::array<T, N> a1 = {};
+
+    boost::array<T, N> a2;
+    a2 = a1;
+
+    BOOST_TEST_ALL_EQ( a1.begin(), a1.end(), a2.begin(), a2.end() );
+}
+
+template<class T> void test3()
+{
+    boost::array<T, 4> a1 = {{ 1, 2, 3, 4 }};
+    boost::array<T, 4> a2 = a1;
+
+    BOOST_TEST_ALL_EQ( a1.begin(), a1.end(), a2.begin(), a2.end() );
+}
+
+template<class T> void test4()
+{
+    boost::array<T, 4> a1 = { 1, 2, 3, 4 };
+
+    boost::array<T, 4> a2;
+    a2 = a1;
+
+    BOOST_TEST_ALL_EQ( a1.begin(), a1.end(), a2.begin(), a2.end() );
+}
+
+int main()
+{
+    // test1<int, 0>();
+    test1<int, 1>();
+    test1<int, 7>();
+
+    // test1<int const, 0>();
+    test1<int const, 1>();
+    test1<int const, 7>();
+
+    test2<int, 0>();
+    test2<int, 1>();
+    test2<int, 7>();
+
+    test3<int>();
+    test3<int const>();
+
+    test4<int>();
+
+    return boost::report_errors();
+}

test/array_data_test.cpp

@@ -0,0 +1,41 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    {
+        boost::array<T, N> a = {{}};
+
+        T* p1 = a.data();
+        T* p2 = a.elems;
+
+        BOOST_TEST_EQ( p1, p2 );
+    }
+
+    {
+        boost::array<T, N> const a = {{}};
+
+        T const* p1 = a.data();
+        T const* p2 = a.elems;
+
+        BOOST_TEST_EQ( p1, p2 );
+    }
+}
+
+int main()
+{
+    // test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    // test<int const, 0>();
+    test<int const, 1>();
+    test<int const, 7>();
+
+    return boost::report_errors();
+}

test/array_elems_test.cpp

@@ -0,0 +1,27 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    boost::array<T, N> a = {{}};
+
+    T (&e)[ N ] = a.elems;
+
+    BOOST_TEST_EQ( static_cast<void const*>( e ), static_cast<void const*>( &a ) );
+}
+
+int main()
+{
+    test<int, 1>();
+    test<int, 7>();
+
+    test<int const, 1>();
+    test<int const, 7>();
+
+    return boost::report_errors();
+}

test/array_eq_test.cpp

@@ -0,0 +1,83 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    {
+        boost::array<T, N> const a1 = {};
+        boost::array<T, N> const a2 = {};
+
+        BOOST_TEST( a1 == a2 );
+        BOOST_TEST_NOT( a1 != a2 );
+    }
+
+    for( std::size_t i = 0; i < N; ++i )
+    {
+        boost::array<T, N> const a1 = {};
+
+        boost::array<T, N> a2 = a1;
+        a2[ i ] = 1;
+
+        BOOST_TEST( a1 != a2 );
+        BOOST_TEST_NOT( a1 == a2 );
+
+        boost::array<T, N> const a3 = a2;
+
+        BOOST_TEST( a1 != a3 );
+        BOOST_TEST_NOT( a1 == a3 );
+    }
+
+    {
+        boost::array<T, N> a1 = {};
+        boost::array<T, N> a2 = {};
+
+        a1.fill( 1 );
+        a2.fill( 1 );
+
+        BOOST_TEST( a1 == a2 );
+        BOOST_TEST_NOT( a1 != a2 );
+    }
+}
+
+template<class T> void test2()
+{
+    {
+        boost::array<T, 4> const a1 = {{ 1, 2, 3, 4 }};
+        boost::array<T, 4> const a2 = {{ 1, 2, 3, 4 }};
+
+        BOOST_TEST( a1 == a2 );
+        BOOST_TEST_NOT( a1 != a2 );
+    }
+
+    for( std::size_t i = 0; i < 4; ++i )
+    {
+        boost::array<T, 4> const a1 = {{ 1, 2, 3, 4 }};
+
+        boost::array<T, 4> a2 = a1;
+        a2[ i ] = 0;
+
+        BOOST_TEST( a1 != a2 );
+        BOOST_TEST_NOT( a1 == a2 );
+
+        boost::array<T, 4> const a3 = a2;
+
+        BOOST_TEST( a1 != a3 );
+        BOOST_TEST_NOT( a1 == a3 );
+    }
+}
+
+int main()
+{
+    test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    test2<int>();
+
+    return boost::report_errors();
+}

test/array_fill_test.cpp

@@ -0,0 +1,57 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    boost::array<T, N> a = {};
+
+    a.fill( 1 );
+
+    for( std::size_t i = 0; i < N; ++i )
+    {
+        BOOST_TEST_EQ( a[i], 1 );
+    }
+}
+
+template<class T> void test2()
+{
+    boost::array<T, 4> a = {{ 1, 2, 3, 4 }};
+
+    a.fill( 5 );
+
+    for( std::size_t i = 0; i < 4; ++i )
+    {
+        BOOST_TEST_EQ( a[i], 5 );
+    }
+}
+
+template<class T> void test3()
+{
+    boost::array<T, 4> a = {{ 1, 2, 3, 4 }};
+
+    // aliasing
+    a.fill( a[ 1 ] );
+
+    for( std::size_t i = 0; i < 4; ++i )
+    {
+        BOOST_TEST_EQ( a[i], 2 );
+    }
+}
+
+int main()
+{
+    test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    test2<int>();
+
+    test3<int>();
+
+    return boost::report_errors();
+}

test/array_get_test.cpp

@@ -0,0 +1,40 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T> void test()
+{
+    {
+        boost::array<T, 4> const a = {{ 1, 2, 3, 4 }};
+
+        BOOST_TEST_EQ( boost::get<0>( a ), 1 );
+        BOOST_TEST_EQ( boost::get<1>( a ), 2 );
+        BOOST_TEST_EQ( boost::get<2>( a ), 3 );
+        BOOST_TEST_EQ( boost::get<3>( a ), 4 );
+    }
+
+    {
+        boost::array<T, 4> a = {{ 1, 2, 3, 4 }};
+
+        boost::get<0>( a ) += 1;
+        boost::get<1>( a ) += 2;
+        boost::get<2>( a ) += 3;
+        boost::get<3>( a ) += 4;
+
+        BOOST_TEST_EQ( boost::get<0>( a ), 2 );
+        BOOST_TEST_EQ( boost::get<1>( a ), 4 );
+        BOOST_TEST_EQ( boost::get<2>( a ), 6 );
+        BOOST_TEST_EQ( boost::get<3>( a ), 8 );
+    }
+}
+
+int main()
+{
+    test<int>();
+
+    return boost::report_errors();
+}

test/array_getfail1.cpp

@@ -16,8 +16,7 @@
 #include <array>
 #endif
 
-#define BOOST_TEST_MAIN
-#include <boost/test/unit_test.hpp>
+#include <boost/core/lightweight_test_trait.hpp>
 
 namespace {
 
@@ -29,14 +28,14 @@ namespace {
         typedef T arr[5];
         test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
     
-        T &aRef = std::get<5> ( test_case );	// should fail to compile
-        BOOST_CHECK ( &*test_case.begin () == &aRef );
+        T &aRef = std::get<5> ( test_case );    // should fail to compile
+        BOOST_TEST ( &*test_case.begin () == &aRef );
     }
     #endif
 
 }
 
-BOOST_AUTO_TEST_CASE( test_main )
+int main()
 {
 #ifndef BOOST_NO_CXX11_HDR_ARRAY
     RunStdTests< bool >();
@@ -44,7 +43,8 @@ BOOST_AUTO_TEST_CASE( test_main )
     RunStdTests< long double >();
     RunStdTests< std::string >();
 #else
-	BOOST_STATIC_ASSERT ( false );	// fail on C++03 systems.
+    BOOST_STATIC_ASSERT ( false );  // fail on C++03 systems.
 #endif
-}
 
+    return boost::report_errors();
+}

test/array_getfail2.cpp

@@ -13,8 +13,7 @@
 #include <array>
 #endif
 
-#define BOOST_TEST_MAIN
-#include <boost/test/unit_test.hpp>
+#include <boost/core/lightweight_test_trait.hpp>
 
 namespace {
 
@@ -27,10 +26,10 @@ namespace {
         test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
     
         T &aRef = std::get<0> ( test_case );
-        BOOST_CHECK ( &*test_case.begin () == &aRef );
+        BOOST_TEST ( &*test_case.begin () == &aRef );
         
         const T &caRef = std::get<0> ( test_case );
-        BOOST_CHECK ( &*test_case.cbegin () == &caRef );
+        BOOST_TEST ( &*test_case.cbegin () == &caRef );
     }
     #endif
 
@@ -42,12 +41,12 @@ namespace {
         test_type           test_case; //   =   { 1, 1, 2, 3, 5 };
     
         T &aRef = boost::get<5> ( test_case );
-        BOOST_CHECK ( &*test_case.begin () == &aRef );
+        BOOST_TEST ( &*test_case.begin () == &aRef );
     }
 
 }
 
-BOOST_AUTO_TEST_CASE( test_main )
+int main()
 {
     RunBoostTests< bool >();
     RunBoostTests< void * >();
@@ -60,5 +59,7 @@ BOOST_AUTO_TEST_CASE( test_main )
     RunStdTests< long double >();
     RunStdTests< std::string >();
 #endif
+
+    return boost::report_errors();
 }
 

test/array_hash.cpp

@@ -11,8 +11,7 @@
 #include <algorithm>
 #include <boost/functional/hash.hpp>
 
-#define BOOST_TEST_MAIN
-#include <boost/test/unit_test.hpp>
+#include <boost/core/lightweight_test_trait.hpp>
 
 namespace {
 
@@ -29,15 +28,17 @@ namespace {
     
         std::size_t bhash = boost::hash<barr> () ( test_barr );
         std::size_t ahash = boost::hash<arr>  () ( test_arr );
-        BOOST_CHECK ( ahash == bhash );
+        BOOST_TEST ( ahash == bhash );
     }
 
 }
 
-BOOST_AUTO_TEST_CASE( test_main )
+int main()
 {
     RunTests< int >();
     RunTests< long >();
     RunTests< long double >();
+
+    return boost::report_errors();
 }
 

test/array_init_test.cpp

@@ -0,0 +1,81 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <boost/config.hpp>
+#include <boost/config/workaround.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test1()
+{
+    boost::array<T, N> a = {{}};
+
+    for( std::size_t i = 0; i < N; ++i )
+    {
+        BOOST_TEST_EQ( a[i], T() );
+    }
+}
+
+template<class T, std::size_t N> void test2()
+{
+    boost::array<T, N> a = {};
+
+    for( std::size_t i = 0; i < N; ++i )
+    {
+        BOOST_TEST_EQ( a[i], T() );
+    }
+}
+
+template<class T> void test3()
+{
+    boost::array<T, 4> a = {{ 1, 2, 3, 4 }};
+    T b[ 4 ] = { 1, 2, 3, 4 };
+
+    BOOST_TEST_ALL_EQ( a.begin(), a.end(), b + 0, b + 4 );
+}
+
+template<class T> void test4()
+{
+    boost::array<T, 4> a = { 1, 2, 3, 4 };
+    T b[ 4 ] = { 1, 2, 3, 4 };
+
+    BOOST_TEST_ALL_EQ( a.begin(), a.end(), b + 0, b + 4 );
+}
+
+int main()
+{
+    // test1<int, 0>();
+    test1<int, 1>();
+    test1<int, 7>();
+
+    // test1<int const, 0>();
+    test1<int const, 1>();
+    test1<int const, 7>();
+
+    test2<int, 0>();
+    test2<int, 1>();
+    test2<int, 7>();
+
+    // test2<int const, 0>();
+
+#if BOOST_WORKAROUND(BOOST_MSVC, < 1910) || BOOST_WORKAROUND(BOOST_GCC, < 50000)
+
+    // = {} doesn't work for const T
+
+#else
+
+    test2<int const, 1>();
+    test2<int const, 7>();
+
+#endif
+
+    test3<int>();
+    test3<int const>();
+
+    test4<int>();
+    test4<int const>();
+
+    return boost::report_errors();
+}

test/array_iterator_test.cpp

@@ -0,0 +1,108 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    {
+        boost::array<T, N> a = {{}};
+
+        T* p1 = a.data();
+
+        {
+            T* p2 = a.begin();
+            T* p3 = a.end();
+
+            BOOST_TEST_EQ( p2, p1 );
+            BOOST_TEST_EQ( p3, p1 + N );
+        }
+
+        {
+            T const* p2 = a.cbegin();
+            T const* p3 = a.cend();
+
+            BOOST_TEST_EQ( p2, p1 );
+            BOOST_TEST_EQ( p3, p1 + N );
+        }
+    }
+
+    {
+        boost::array<T, N> const a = {{}};
+
+        T const* p1 = a.data();
+
+        {
+            T const* p2 = a.begin();
+            T const* p3 = a.end();
+
+            BOOST_TEST_EQ( p2, p1 );
+            BOOST_TEST_EQ( p3, p1 + N );
+        }
+
+        {
+            T const* p2 = a.cbegin();
+            T const* p3 = a.cend();
+
+            BOOST_TEST_EQ( p2, p1 );
+            BOOST_TEST_EQ( p3, p1 + N );
+        }
+    }
+}
+
+template<class T> void test2()
+{
+    {
+        boost::array<T, 0> a = {};
+
+        {
+            T* p2 = a.begin();
+            T* p3 = a.end();
+
+            BOOST_TEST_EQ( p2, p3 );
+        }
+
+        {
+            T const* p2 = a.cbegin();
+            T const* p3 = a.cend();
+
+            BOOST_TEST_EQ( p2, p3 );
+        }
+    }
+
+    {
+        boost::array<T, 0> const a = {};
+
+        {
+            T const* p2 = a.begin();
+            T const* p3 = a.end();
+
+            BOOST_TEST_EQ( p2, p3 );
+        }
+
+        {
+            T const* p2 = a.cbegin();
+            T const* p3 = a.cend();
+
+            BOOST_TEST_EQ( p2, p3 );
+        }
+    }
+}
+
+int main()
+{
+    // test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    // test<int const, 0>();
+    test<int const, 1>();
+    test<int const, 7>();
+
+    test2<int>();
+
+    return boost::report_errors();
+}

test/array_lt_test.cpp

@@ -0,0 +1,85 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    {
+        boost::array<T, N> const a1 = {};
+        boost::array<T, N> const a2 = {};
+
+        BOOST_TEST_NOT( a1 < a2 );
+        BOOST_TEST_NOT( a1 > a2 );
+        BOOST_TEST( a1 <= a2 );
+        BOOST_TEST( a1 >= a2 );
+    }
+
+    {
+        boost::array<T, N> a1;
+        boost::array<T, N> a2;
+
+        a1.fill( 1 );
+        a2.fill( 1 );
+
+        BOOST_TEST_NOT( a1 < a2 );
+        BOOST_TEST_NOT( a1 > a2 );
+        BOOST_TEST( a1 <= a2 );
+        BOOST_TEST( a1 >= a2 );
+    }
+
+    for( std::size_t i = 0; i < N; ++i )
+    {
+        boost::array<T, N> a1;
+        boost::array<T, N> a2;
+
+        a1.fill( 1 );
+        a2.fill( 1 );
+
+        a1[ i ] = 0;
+
+        BOOST_TEST( a1 < a2 );
+        BOOST_TEST( a1 <= a2 );
+        BOOST_TEST_NOT( a1 > a2 );
+        BOOST_TEST_NOT( a1 >= a2 );
+
+        {
+            boost::array<T, N> const a3 = a1;
+            boost::array<T, N> const a4 = a2;
+
+            BOOST_TEST( a3 < a4 );
+            BOOST_TEST( a3 <= a4 );
+            BOOST_TEST_NOT( a3 > a4 );
+            BOOST_TEST_NOT( a3 >= a4 );
+        }
+
+        a1[ i ] = 2;
+
+        BOOST_TEST( a1 > a2 );
+        BOOST_TEST( a1 >= a2 );
+        BOOST_TEST_NOT( a1 < a2 );
+        BOOST_TEST_NOT( a1 <= a2 );
+
+        {
+            boost::array<T, N> const a3 = a1;
+            boost::array<T, N> const a4 = a2;
+
+            BOOST_TEST( a3 > a4 );
+            BOOST_TEST( a3 >= a4 );
+            BOOST_TEST_NOT( a3 < a4 );
+            BOOST_TEST_NOT( a3 <= a4 );
+        }
+    }
+}
+
+int main()
+{
+    test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    return boost::report_errors();
+}

test/array_reverse_test.cpp

@@ -0,0 +1,88 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <iterator>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    {
+        boost::array<T, N> a = {{}};
+
+        {
+            std::reverse_iterator<T*> r1( a.rbegin() );
+            std::reverse_iterator<T*> r2( a.end() );
+
+            BOOST_TEST( r1 == r2 );
+        }
+
+        {
+            std::reverse_iterator<T*> r1( a.rend() );
+            std::reverse_iterator<T*> r2( a.begin() );
+
+            BOOST_TEST( r1 == r2 );
+        }
+
+        {
+            std::reverse_iterator<T const*> r1( a.crbegin() );
+            std::reverse_iterator<T const*> r2( a.cend() );
+
+            BOOST_TEST( r1 == r2 );
+        }
+
+        {
+            std::reverse_iterator<T const*> r1( a.crend() );
+            std::reverse_iterator<T const*> r2( a.cbegin() );
+
+            BOOST_TEST( r1 == r2 );
+        }
+    }
+
+    {
+        boost::array<T, N> const a = {{}};
+
+        {
+            std::reverse_iterator<T const*> r1( a.rbegin() );
+            std::reverse_iterator<T const*> r2( a.end() );
+
+            BOOST_TEST( r1 == r2 );
+        }
+
+        {
+            std::reverse_iterator<T const*> r1( a.rend() );
+            std::reverse_iterator<T const*> r2( a.begin() );
+
+            BOOST_TEST( r1 == r2 );
+        }
+
+        {
+            std::reverse_iterator<T const*> r1( a.crbegin() );
+            std::reverse_iterator<T const*> r2( a.cend() );
+
+            BOOST_TEST( r1 == r2 );
+        }
+
+        {
+            std::reverse_iterator<T const*> r1( a.crend() );
+            std::reverse_iterator<T const*> r2( a.cbegin() );
+
+            BOOST_TEST( r1 == r2 );
+        }
+    }
+}
+
+int main()
+{
+    // test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    // test<int const, 0>();
+    test<int const, 1>();
+    test<int const, 7>();
+
+    return boost::report_errors();
+}

test/array_size_test.cpp

@@ -0,0 +1,73 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <iterator>
+#include <cstddef>
+
+template<class T, std::size_t N> void test1()
+{
+    {
+        boost::array<T, N> a = {{}};
+
+        BOOST_TEST_EQ( a.size(), N );
+        BOOST_TEST_EQ( a.empty(), N == 0 );
+        BOOST_TEST_EQ( a.max_size(), N );
+    }
+
+    {
+        boost::array<T, N> const a = {{}};
+
+        BOOST_TEST_EQ( a.size(), N );
+        BOOST_TEST_EQ( a.empty(), N == 0 );
+        BOOST_TEST_EQ( a.max_size(), N );
+    }
+}
+
+template<class T, std::size_t N> void test2()
+{
+    typedef boost::array<T, N> A;
+
+    BOOST_TEST_EQ( A().size(), N );
+    BOOST_TEST_EQ( A().empty(), N == 0 );
+    BOOST_TEST_EQ( A().max_size(), N );
+}
+
+// the functions are static, which deviates from the standard
+template<class T, std::size_t N> void test3()
+{
+    typedef boost::array<T, N> A;
+
+    BOOST_TEST_EQ( A::size(), N );
+    BOOST_TEST_EQ( A::empty(), N == 0 );
+    BOOST_TEST_EQ( A::max_size(), N );
+
+    BOOST_TEST_EQ( A::static_size, N );
+}
+
+int main()
+{
+    // test1<int, 0>();
+    test1<int, 1>();
+    test1<int, 7>();
+
+    // test1<int const, 0>();
+    test1<int const, 1>();
+    test1<int const, 7>();
+
+    test2<int, 0>();
+    test2<int, 1>();
+    test2<int, 7>();
+
+    test3<int, 0>();
+    test3<int, 1>();
+    test3<int, 7>();
+
+    test3<int const, 0>();
+    test3<int const, 1>();
+    test3<int const, 7>();
+
+    return boost::report_errors();
+}

test/array_swap_test.cpp

@@ -0,0 +1,49 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    boost::array<T, N> a1 = {};
+    boost::array<T, N> a2 = {};
+
+    a1.fill( 1 );
+    a2.fill( 2 );
+
+    a1.swap( a2 );
+
+    for( std::size_t i = 0; i < N; ++i )
+    {
+        BOOST_TEST_EQ( a1[i], 2 );
+        BOOST_TEST_EQ( a2[i], 1 );
+    }
+}
+
+template<class T> void test2()
+{
+    boost::array<T, 4> a1 = {{ 1, 2, 3, 4 }};
+    boost::array<T, 4> a2 = {{ 5, 6, 7, 8 }};
+
+    a1.swap( a2 );
+
+    for( int i = 0; i < 4; ++i )
+    {
+        BOOST_TEST_EQ( a1[i], i+5 );
+        BOOST_TEST_EQ( a2[i], i+1 );
+    }
+}
+
+int main()
+{
+    test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    test2<int>();
+
+    return boost::report_errors();
+}

test/array_swap_test2.cpp

@@ -0,0 +1,49 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    boost::array<T, N> a1 = {};
+    boost::array<T, N> a2 = {};
+
+    a1.fill( 1 );
+    a2.fill( 2 );
+
+    swap( a1, a2 );
+
+    for( std::size_t i = 0; i < N; ++i )
+    {
+        BOOST_TEST_EQ( a1[i], 2 );
+        BOOST_TEST_EQ( a2[i], 1 );
+    }
+}
+
+template<class T> void test2()
+{
+    boost::array<T, 4> a1 = {{ 1, 2, 3, 4 }};
+    boost::array<T, 4> a2 = {{ 5, 6, 7, 8 }};
+
+    swap( a1, a2 );
+
+    for( int i = 0; i < 4; ++i )
+    {
+        BOOST_TEST_EQ( a1[i], i+5 );
+        BOOST_TEST_EQ( a2[i], i+1 );
+    }
+}
+
+int main()
+{
+    test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    test2<int>();
+
+    return boost::report_errors();
+}

test/array_typedef_test.cpp

@@ -0,0 +1,43 @@
+// Copyright 2025 Peter Dimov
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+#include <boost/core/lightweight_test_trait.hpp>
+#include <boost/core/lightweight_test.hpp>
+#include <iterator>
+#include <cstddef>
+
+template<class T, std::size_t N> void test()
+{
+    typedef boost::array<T, N> A;
+
+    BOOST_TEST_TRAIT_SAME(typename A::value_type, T);
+
+    BOOST_TEST_TRAIT_SAME(typename A::iterator, T*);
+    BOOST_TEST_TRAIT_SAME(typename A::const_iterator, T const*);
+
+    BOOST_TEST_TRAIT_SAME(typename A::reverse_iterator, std::reverse_iterator<T*>);
+    BOOST_TEST_TRAIT_SAME(typename A::const_reverse_iterator, std::reverse_iterator<T const*>);
+
+    BOOST_TEST_TRAIT_SAME(typename A::reference, T&);
+    BOOST_TEST_TRAIT_SAME(typename A::const_reference, T const&);
+
+    BOOST_TEST_TRAIT_SAME(typename A::size_type, std::size_t);
+    BOOST_TEST_TRAIT_SAME(typename A::difference_type, std::ptrdiff_t);
+
+    BOOST_TEST_EQ(A::static_size, N);
+}
+
+int main()
+{
+    test<int, 0>();
+    test<int, 1>();
+    test<int, 7>();
+
+    test<int const, 0>();
+    test<int const, 1>();
+    test<int const, 7>();
+
+    return boost::report_errors();
+}

test/cmake_install_test/CMakeLists.txt

@@ -0,0 +1,17 @@
+# Copyright 2018, 2019, 2021 Peter Dimov
+# 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
+
+cmake_minimum_required(VERSION 3.5...3.20)
+
+project(cmake_install_test LANGUAGES CXX)
+
+find_package(boost_array REQUIRED)
+
+add_executable(quick ../quick.cpp)
+target_link_libraries(quick Boost::array)
+
+enable_testing()
+add_test(quick quick)
+
+add_custom_target(check COMMAND ${CMAKE_CTEST_COMMAND} --output-on-failure -C $<CONFIG>)

test/cmake_subdir_test/CMakeLists.txt

@@ -0,0 +1,23 @@
+# Copyright 2018, 2019, 2021 Peter Dimov
+# 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
+
+cmake_minimum_required(VERSION 3.5...3.20)
+
+project(cmake_subdir_test LANGUAGES CXX)
+
+add_subdirectory(../.. boostorg/array)
+
+add_subdirectory(../../../assert boostorg/assert)
+add_subdirectory(../../../config boostorg/config)
+add_subdirectory(../../../core boostorg/core)
+add_subdirectory(../../../static_assert boostorg/static_assert)
+add_subdirectory(../../../throw_exception boostorg/throw_exception)
+
+add_executable(quick ../quick.cpp)
+target_link_libraries(quick Boost::array)
+
+enable_testing()
+add_test(quick quick)
+
+add_custom_target(check COMMAND ${CMAKE_CTEST_COMMAND} --output-on-failure -C $<CONFIG>)

test/quick.cpp

@@ -0,0 +1,11 @@
+// Copyright 2023 Peter Dimov.
+// Distributed under the Boost Software License, Version 1.0.
+// https://www.boost.org/LICENSE_1_0.txt)
+
+#include <boost/array.hpp>
+
+int main()
+{
+    boost::array<int, 2> a = {{ 0, 1 }};
+    return a[0];
+}