Remove GCC 4.4 from Drone

Add Drone support
array<T, 0> access operations are never constexpr
2025-01-15 21:12:57 +02:00 · 2025-01-15 20:52:27 +02:00 · 2025-01-15 20:18:14 +02:00 · 2025-01-15 19:57:39 +02:00 · 2025-01-12 03:31:49 +02:00 · 2025-01-12 03:31:49 +02:00
41 changed files with 2308 additions and 879 deletions
--- a/.drone.jsonnet
+++ b/.drone.jsonnet
@ -0,0 +1,346 @@
+# Copyright 2022 Peter Dimov
+# Distributed under the Boost Software License, Version 1.0.
+# https://www.boost.org/LICENSE_1_0.txt
+
+local library = "array";
+
+local triggers =
+{
+    branch: [ "master", "develop", "feature/*" ]
+};
+
+local ubsan = { UBSAN: '1', UBSAN_OPTIONS: 'print_stacktrace=1' };
+local asan = { ASAN: '1' };
+
+local linux_pipeline(name, image, environment, packages = "", sources = [], arch = "amd64") =
+{
+    name: name,
+    kind: "pipeline",
+    type: "docker",
+    trigger: triggers,
+    platform:
+    {
+        os: "linux",
+        arch: arch
+    },
+    steps:
+    [
+        {
+            name: "everything",
+            image: image,
+            environment: environment,
+            commands:
+            [
+                'set -e',
+                'uname -a',
+                'echo $DRONE_STAGE_MACHINE',
+                'wget -O - https://apt.llvm.org/llvm-snapshot.gpg.key | apt-key add -',
+            ] +
+            (if sources != [] then [ ('apt-add-repository "' + source + '"') for source in sources ] else []) +
+            (if packages != "" then [ 'apt-get update', 'apt-get -y install ' + packages ] else []) +
+            [
+                'export LIBRARY=' + library,
+                './.drone/drone.sh',
+            ]
+        }
+    ]
+};
+
+local macos_pipeline(name, environment, xcode_version = "12.2", osx_version = "catalina", arch = "amd64") =
+{
+    name: name,
+    kind: "pipeline",
+    type: "exec",
+    trigger: triggers,
+    platform: {
+        "os": "darwin",
+        "arch": arch
+    },
+    node: {
+        "os": osx_version
+    },
+    steps: [
+        {
+            name: "everything",
+            environment: environment + { "DEVELOPER_DIR": "/Applications/Xcode-" + xcode_version + ".app/Contents/Developer" },
+            commands:
+            [
+                'export LIBRARY=' + library,
+                './.drone/drone.sh',
+            ]
+        }
+    ]
+};
+
+local windows_pipeline(name, image, environment, arch = "amd64") =
+{
+    name: name,
+    kind: "pipeline",
+    type: "docker",
+    trigger: triggers,
+    platform:
+    {
+        os: "windows",
+        arch: arch
+    },
+    "steps":
+    [
+        {
+            name: "everything",
+            image: image,
+            environment: environment,
+            commands:
+            [
+                'cmd /C .drone\\\\drone.bat ' + library,
+            ]
+        }
+    ]
+};
+
+[
+    linux_pipeline(
+        "Linux 16.04 GCC 4.6",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-4.6', CXXSTD: '98' },
+        "g++-4.6",
+        [ "ppa:ubuntu-toolchain-r/test" ],
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 GCC 4.7",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-4.7', CXXSTD: '98' },
+        "g++-4.7",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 GCC 4.8",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-4.8', CXXSTD: '03,11' },
+        "g++-4.8",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 GCC 4.9",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-4.9', CXXSTD: '03,11' },
+        "g++-4.9",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 GCC 5*",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '03,11,14' },
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 GCC 6",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-6', CXXSTD: '03,11,14' },
+        "g++-6",
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 GCC 7* 32/64",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '03,11,14,17', ADDRMD: '32,64' },
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 GCC 8",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-8', CXXSTD: '03,11,14,17' },
+        "g++-8",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 GCC 9* 32/64",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '03,11,14,17,2a', ADDRMD: '32,64' },
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 GCC 9* ARM64",
+        "cppalliance/droneubuntu2004:multiarch",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '03,11,14,17,2a' },
+        arch="arm64",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 GCC 9* S390x",
+        "cppalliance/droneubuntu2004:multiarch",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '03,11,14,17,2a' },
+        arch="s390x",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 GCC 10 32/64",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-10', CXXSTD: '03,11,14,17,20', ADDRMD: '32,64' },
+        "g++-10-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 GCC 11* 32/64",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '03,11,14,17,2a', ADDRMD: '32,64' },
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 GCC 12 32/64",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-12', CXXSTD: '03,11,14,17,20,2b', ADDRMD: '32,64' },
+        "g++-12-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 GCC 13 32/64 UBSAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-13', CXXSTD: '03,11,14,17,20,2b', ADDRMD: '32,64' } + ubsan,
+        "g++-13-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 GCC 14 32/64 ASAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-14', CXXSTD: '03,11,14,17,20,2b', ADDRMD: '32,64' } + asan,
+        "g++-14-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 Clang 3.5",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.5', CXXSTD: '03,11' },
+        "clang-3.5",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 Clang 3.6",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.6', CXXSTD: '03,11,14' },
+        "clang-3.6",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 Clang 3.7",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.7', CXXSTD: '03,11,14' },
+        "clang-3.7",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 Clang 3.8",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.8', CXXSTD: '03,11,14' },
+        "clang-3.8",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 Clang 13",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-13', CXXSTD: '03,11,14,17,20' },
+        "clang-13",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 Clang 14",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-14', CXXSTD: '03,11,14,17,20' },
+        "clang-14",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 Clang 15",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-15', CXXSTD: '03,11,14,17,20,2b' },
+        "clang-15",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 Clang 16",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-16', CXXSTD: '03,11,14,17,20,2b' },
+        "clang-16",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 Clang 17 UBSAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-17', CXXSTD: '03,11,14,17,20,2b' } + ubsan,
+        "clang-17",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 Clang 17 ASAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-17', CXXSTD: '03,11,14,17,20,2b' } + asan,
+        "clang-17",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 Clang 18 UBSAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-18', CXXSTD: '03,11,14,17,20,2b' } + ubsan,
+        "clang-18",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 Clang 18 ASAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-18', CXXSTD: '03,11,14,17,20,2b' } + asan,
+        "clang-18",
+    ),
+
+    linux_pipeline(
+        "Linux 24.10 Clang 19",
+        "cppalliance/droneubuntu2410:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-19', CXXSTD: '03,11,14,17,20,2b' },
+        "clang-19",
+    ),
+
+    macos_pipeline(
+        "MacOS 10.15 Xcode 12.2 UBSAN",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '03,11,14,1z' } + ubsan,
+    ),
+
+    macos_pipeline(
+        "MacOS 10.15 Xcode 12.2 ASAN",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '03,11,14,1z' } + asan,
+    ),
+
+    macos_pipeline(
+        "MacOS 12.4 Xcode 13.4.1 UBSAN",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '03,11,14,17,20,2b' } + ubsan,
+        xcode_version = "13.4.1", osx_version = "monterey", arch = "arm64",
+    ),
+
+    macos_pipeline(
+        "MacOS 12.4 Xcode 13.4.1 ASAN",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '03,11,14,17,20,2b' } + asan,
+        xcode_version = "13.4.1", osx_version = "monterey", arch = "arm64",
+    ),
+
+    windows_pipeline(
+        "Windows VS2015 msvc-14.0",
+        "cppalliance/dronevs2015",
+        { TOOLSET: 'msvc-14.0', CXXSTD: '14,latest', B2_DONT_EMBED_MANIFEST: '1' },
+    ),
+
+    windows_pipeline(
+        "Windows VS2017 msvc-14.1",
+        "cppalliance/dronevs2017",
+        { TOOLSET: 'msvc-14.1', CXXSTD: '14,17,latest' },
+    ),
+
+    windows_pipeline(
+        "Windows VS2019 msvc-14.2",
+        "cppalliance/dronevs2019",
+        { TOOLSET: 'msvc-14.2', CXXSTD: '14,17,20,latest' },
+    ),
+
+    windows_pipeline(
+        "Windows VS2022 msvc-14.3",
+        "cppalliance/dronevs2022:1",
+        { TOOLSET: 'msvc-14.3', CXXSTD: '14,17,20,latest' },
+    ),
+]
--- a/.drone.star
+++ b/.drone.star
@ -1,37 +0,0 @@
-# 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")
--- a/.drone/96ad197d74-2319b6d45f.sh
+++ b/.drone/96ad197d74-2319b6d45f.sh
@ -1,37 +0,0 @@
-#!/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
--- a/.drone/after-success.sh
+++ b/.drone/after-success.sh
@ -1,3 +0,0 @@
-#!/bin/bash
-
-
--- a/.drone/before-install.sh
+++ b/.drone/before-install.sh
@ -1,3 +0,0 @@
-#!/bin/bash
-
-
--- a/.drone/before-script.sh
+++ b/.drone/before-script.sh
@ -1,3 +0,0 @@
-#!/bin/bash
-
-
--- a/.drone/boost.sh
+++ b/.drone/boost.sh
@ -1,41 +0,0 @@
-#!/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
--- a/.drone/drone.bat
+++ b/.drone/drone.bat
@ -0,0 +1,23 @@
+@REM Copyright 2022 Peter Dimov
+@REM Distributed under the Boost Software License, Version 1.0.
+@REM https://www.boost.org/LICENSE_1_0.txt
+
+@ECHO ON
+
+set LIBRARY=%1
+set DRONE_BUILD_DIR=%CD%
+
+set BOOST_BRANCH=develop
+if "%DRONE_BRANCH%" == "master" set BOOST_BRANCH=master
+cd ..
+git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+cd boost-root
+git submodule update --init tools/boostdep
+xcopy /s /e /q %DRONE_BUILD_DIR% libs\%LIBRARY%\
+python tools/boostdep/depinst/depinst.py %LIBRARY%
+cmd /c bootstrap
+b2 -d0 headers
+
+if not "%CXXSTD%" == "" set CXXSTD=cxxstd=%CXXSTD%
+if not "%ADDRMD%" == "" set ADDRMD=address-model=%ADDRMD%
+b2 -j3 libs/%LIBRARY%/test toolset=%TOOLSET% %CXXSTD% %ADDRMD% variant=debug,release embed-manifest-via=linker
--- a/.drone/drone.sh
+++ b/.drone/drone.sh
@ -0,0 +1,25 @@
+#!/bin/bash
+
+# Copyright 2022 Peter Dimov
+# Distributed under the Boost Software License, Version 1.0.
+# https://www.boost.org/LICENSE_1_0.txt
+
+set -ex
+export PATH=~/.local/bin:/usr/local/bin:$PATH
+
+DRONE_BUILD_DIR=$(pwd)
+
+BOOST_BRANCH=develop
+if [ "$DRONE_BRANCH" = "master" ]; then BOOST_BRANCH=master; fi
+
+cd ..
+git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+cd boost-root
+git submodule update --init tools/boostdep
+cp -r $DRONE_BUILD_DIR/* libs/$LIBRARY
+python tools/boostdep/depinst/depinst.py $LIBRARY
+./bootstrap.sh
+./b2 -d0 headers
+
+echo "using $TOOLSET : : $COMPILER ;" > ~/user-config.jam
+./b2 -j3 libs/$LIBRARY/test toolset=$TOOLSET cxxstd=$CXXSTD variant=debug,release ${ADDRMD:+address-model=$ADDRMD} ${UBSAN:+undefined-sanitizer=norecover debug-symbols=on} ${ASAN:+address-sanitizer=norecover debug-symbols=on} ${LINKFLAGS:+linkflags=$LINKFLAGS}
--- a/.github/workflows/ci.yml
+++ b/.github/workflows/ci.yml
@ -23,6 +23,12 @@ jobs:
            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
@ -67,10 +73,14 @@ jobs:
            address-model: 32,64
          - toolset: gcc-13
            cxxstd: "03,11,14,17,20,2b"
-            os: ubuntu-latest
-            container: ubuntu:23.04
+            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"
@ -139,34 +149,55 @@ jobs:
          - toolset: clang
            compiler: clang++-16
            cxxstd: "03,11,14,17,20,2b"
-            os: ubuntu-latest
-            container: ubuntu:23.04
+            os: ubuntu-24.04
            install: clang-16
          - toolset: clang
-            cxxstd: "03,11,14,17,2a"
-            os: macos-11
-          - toolset: clang
+            compiler: clang++-17
            cxxstd: "03,11,14,17,20,2b"
-            os: macos-12
+            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: ${{matrix.container}}
+
+    container:
+      image: ${{matrix.container}}
+      volumes:
+        - /node20217:/node20217:rw,rshared
+        - ${{ startsWith(matrix.container, 'ubuntu:1') && '/node20217:/__e/node20:ro,rshared' || ' ' }}

    defaults:
      run:
        shell: bash

    steps:
-      - uses: actions/checkout@v3
-
      - name: Setup container environment
        if: matrix.container
        run: |
          apt-get update
-          apt-get -y install sudo python3 git g++
+          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
@ -192,7 +223,7 @@ jobs:
          cd boost-root
          cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
          git submodule update --init tools/boostdep
-          python3 tools/boostdep/depinst/depinst.py -I examples --git_args "--jobs 3" $LIBRARY
+          python3 tools/boostdep/depinst/depinst.py -I examples $LIBRARY
          ./bootstrap.sh
          ./b2 -d0 headers

@ -236,7 +267,7 @@ jobs:
    runs-on: ${{matrix.os}}

    steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4

      - name: Setup Boost
        shell: cmd
@ -273,14 +304,15 @@ jobs:
        include:
          - os: ubuntu-20.04
          - os: ubuntu-22.04
-          - os: macos-11
-          - os: macos-12
+          - os: ubuntu-24.04
          - os: macos-13
+          - os: macos-14
+          - os: macos-15

    runs-on: ${{matrix.os}}

    steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4

      - name: Install packages
        if: matrix.install
@ -321,14 +353,15 @@ jobs:
        include:
          - os: ubuntu-20.04
          - os: ubuntu-22.04
-          - os: macos-11
-          - os: macos-12
+          - os: ubuntu-24.04
          - os: macos-13
+          - os: macos-14
+          - os: macos-15

    runs-on: ${{matrix.os}}

    steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4

      - name: Install packages
        if: matrix.install
@ -379,14 +412,15 @@ jobs:
        include:
          - os: ubuntu-20.04
          - os: ubuntu-22.04
-          - os: macos-11
-          - os: macos-12
+          - os: ubuntu-24.04
          - os: macos-13
+          - os: macos-14
+          - os: macos-15

    runs-on: ${{matrix.os}}

    steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4

      - name: Install packages
        if: matrix.install
@ -439,7 +473,7 @@ jobs:
    runs-on: ${{matrix.os}}

    steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4

      - name: Setup Boost
        shell: cmd
@ -488,7 +522,7 @@ jobs:
    runs-on: ${{matrix.os}}

    steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4

      - name: Setup Boost
        shell: cmd
@ -555,7 +589,7 @@ jobs:
    runs-on: ${{matrix.os}}

    steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4

      - name: Setup Boost
        shell: cmd
--- a/doc/.gitignore
+++ b/doc/.gitignore
@ -0,0 +1 @@
+/html
--- a/doc/Jamfile.v2
+++ b/doc/Jamfile.v2
@ -1,19 +1,22 @@
 #~ 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)

-using boostbook ;
+import asciidoctor ;

-boostbook standalone
-	: array.xml 
-	: <xsl:param>boost.root=../../../.. ;
+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
-    : array.xml
-    :
-    :
-    : ;
+alias boostdoc ;
 explicit boostdoc ;
-alias boostrelease ;
+alias boostrelease : html_ ;
 explicit boostrelease ;
--- a/doc/array.adoc
+++ b/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
--- a/doc/array.xml
+++ b/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://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm">http://www.open-std.org/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>
--- a/doc/array/copyright.adoc
+++ b/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)
--- a/doc/array/design_rationale.adoc
+++ b/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.
--- a/doc/array/information.adoc
+++ b/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]
--- a/doc/array/introduction.adoc
+++ b/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.
--- a/doc/array/reference.adoc
+++ b/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`
+
+---
--- a/include/boost/array.hpp
+++ b/include/boost/array.hpp
@ -31,7 +31,8 @@
 #ifndef BOOST_ARRAY_HPP
 #define BOOST_ARRAY_HPP

-#include <boost/detail/workaround.hpp>
+#include <boost/config.hpp>
+#include <boost/config/workaround.hpp>

 #if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)
 # pragma warning(push)
@ -50,9 +51,6 @@
 #include <boost/throw_exception.hpp>
 #include <algorithm>

-// FIXES for broken compilers
-#include <boost/config.hpp>
-

 namespace boost {

@ -72,13 +70,13 @@ namespace boost {
        typedef std::ptrdiff_t difference_type;

        // iterator support
-        iterator        begin()       { return elems; }
-        const_iterator  begin() const { return elems; }
-        const_iterator cbegin() const { return elems; }
+        BOOST_CXX14_CONSTEXPR iterator  begin()       BOOST_NOEXCEPT { return elems; }
+        BOOST_CONSTEXPR const_iterator  begin() const BOOST_NOEXCEPT { return elems; }
+        BOOST_CONSTEXPR const_iterator cbegin() const BOOST_NOEXCEPT { return elems; }

-        iterator        end()       { return elems+N; }
-        const_iterator  end() const { return elems+N; }
-        const_iterator cend() const { return elems+N; }
+        BOOST_CXX14_CONSTEXPR iterator  end()       BOOST_NOEXCEPT { return elems+N; }
+        BOOST_CONSTEXPR const_iterator  end() const BOOST_NOEXCEPT { return elems+N; }
+        BOOST_CONSTEXPR const_iterator cend() const BOOST_NOEXCEPT { return elems+N; }

        // reverse iterator support
 #if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
@ -95,39 +93,42 @@ namespace boost {
        typedef std::reverse_iterator<const_iterator,T> const_reverse_iterator;
 #endif

-        reverse_iterator rbegin() { return reverse_iterator(end()); }
-        const_reverse_iterator rbegin() const {
+        reverse_iterator rbegin() BOOST_NOEXCEPT { return reverse_iterator(end()); }
+        const_reverse_iterator rbegin() const BOOST_NOEXCEPT {
            return const_reverse_iterator(end());
        }
-        const_reverse_iterator crbegin() const {
+        const_reverse_iterator crbegin() const BOOST_NOEXCEPT {
            return const_reverse_iterator(end());
        }

-        reverse_iterator rend() { return reverse_iterator(begin()); }
-        const_reverse_iterator rend() const {
+        reverse_iterator rend() BOOST_NOEXCEPT { return reverse_iterator(begin()); }
+        const_reverse_iterator rend() const BOOST_NOEXCEPT {
            return const_reverse_iterator(begin());
        }
-        const_reverse_iterator crend() const {
+        const_reverse_iterator crend() const BOOST_NOEXCEPT {
            return const_reverse_iterator(begin());
        }

        // operator[]
-        reference operator[](size_type i)
+        BOOST_CXX14_CONSTEXPR 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
+#if !BOOST_WORKAROUND(BOOST_GCC, < 50000)
+        BOOST_CONSTEXPR
+#endif
+        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]; }
+        BOOST_CXX14_CONSTEXPR 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()
+        BOOST_CXX14_CONSTEXPR reference front()
        {
            return elems[0];
        }
@ -137,7 +138,7 @@ namespace boost {
            return elems[0];
        }

-        reference back()
+        BOOST_CXX14_CONSTEXPR reference back()
        {
            return elems[N-1];
        }
@ -148,23 +149,23 @@ namespace boost {
        }

        // size is constant
-        static BOOST_CONSTEXPR size_type size() { return N; }
-        static BOOST_CONSTEXPR bool empty() { return false; }
-        static BOOST_CONSTEXPR size_type max_size() { return N; }
+        static BOOST_CONSTEXPR size_type size() BOOST_NOEXCEPT { return N; }
+        static BOOST_CONSTEXPR bool empty() BOOST_NOEXCEPT { return false; }
+        static BOOST_CONSTEXPR size_type max_size() BOOST_NOEXCEPT { return N; }
        enum { static_size = N };

        // swap (note: linear complexity)
-        void swap (array<T,N>& y) {
+        BOOST_CXX14_CONSTEXPR void swap (array<T,N>& y) {
            for (size_type i = 0; i < N; ++i)
                boost::core::invoke_swap(elems[i],y.elems[i]);
        }

        // direct access to data (read-only)
-        const T* data() const { return elems; }
-        T* data() { return elems; }
+        BOOST_CONSTEXPR const T* data() const BOOST_NOEXCEPT { return elems; }
+        BOOST_CXX14_CONSTEXPR T* data() BOOST_NOEXCEPT { return elems; }

        // use array as C array (direct read/write access to data)
-        T* c_array() { return elems; }
+        T* c_array() BOOST_NOEXCEPT { return elems; }

        // assignment with type conversion
        template <typename T2>
@ -175,7 +176,7 @@ namespace boost {

        // assign one value to all elements
        void assign (const T& value) { fill ( value ); }    // A synonym for fill
-        void fill   (const T& value)
+        BOOST_CXX14_CONSTEXPR void fill (const T& value)
        {
            std::fill_n(begin(),size(),value);
        }
@ -201,13 +202,13 @@ namespace boost {
        typedef std::ptrdiff_t difference_type;

        // iterator support
-        iterator        begin()       { return       iterator( reinterpret_cast<       T * >( this ) ); }
-        const_iterator  begin() const { return const_iterator( reinterpret_cast< const T * >( this ) ); }
-        const_iterator cbegin() const { return const_iterator( reinterpret_cast< const T * >( this ) ); }
+        iterator        begin()       BOOST_NOEXCEPT { return       iterator( reinterpret_cast<       T * >( this ) ); }
+        const_iterator  begin() const BOOST_NOEXCEPT { return const_iterator( reinterpret_cast< const T * >( this ) ); }
+        const_iterator cbegin() const BOOST_NOEXCEPT { return const_iterator( reinterpret_cast< const T * >( this ) ); }

-        iterator        end()       { return  begin(); }
-        const_iterator  end() const { return  begin(); }
-        const_iterator cend() const { return cbegin(); }
+        iterator        end()       BOOST_NOEXCEPT { return  begin(); }
+        const_iterator  end() const BOOST_NOEXCEPT { return  begin(); }
+        const_iterator cend() const BOOST_NOEXCEPT { return cbegin(); }

        // reverse iterator support
 #if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
@ -224,19 +225,19 @@ namespace boost {
        typedef std::reverse_iterator<const_iterator,T> const_reverse_iterator;
 #endif

-        reverse_iterator rbegin() { return reverse_iterator(end()); }
-        const_reverse_iterator rbegin() const {
+        reverse_iterator rbegin() BOOST_NOEXCEPT { return reverse_iterator(end()); }
+        const_reverse_iterator rbegin() const BOOST_NOEXCEPT {
            return const_reverse_iterator(end());
        }
-        const_reverse_iterator crbegin() const {
+        const_reverse_iterator crbegin() const BOOST_NOEXCEPT {
            return const_reverse_iterator(end());
        }

-        reverse_iterator rend() { return reverse_iterator(begin()); }
-        const_reverse_iterator rend() const {
+        reverse_iterator rend() BOOST_NOEXCEPT { return reverse_iterator(begin()); }
+        const_reverse_iterator rend() const BOOST_NOEXCEPT {
            return const_reverse_iterator(begin());
        }
-        const_reverse_iterator crend() const {
+        const_reverse_iterator crend() const BOOST_NOEXCEPT {
            return const_reverse_iterator(begin());
        }

@ -246,14 +247,14 @@ namespace boost {
            return failed_rangecheck();
        }

-        /*BOOST_CONSTEXPR*/ const_reference operator[](size_type /*i*/) const
+        const_reference operator[](size_type /*i*/) const
        {
            return failed_rangecheck();
        }

        // at() with range check
-        reference at(size_type /*i*/)               {   return failed_rangecheck(); }
-        /*BOOST_CONSTEXPR*/ const_reference at(size_type /*i*/) const   { return failed_rangecheck(); }
+        reference at(size_type /*i*/)               { return failed_rangecheck(); }
+        const_reference at(size_type /*i*/) const   { return failed_rangecheck(); }

        // front() and back()
        reference front()
@ -261,7 +262,7 @@ namespace boost {
            return failed_rangecheck();
        }

-        BOOST_CONSTEXPR const_reference front() const
+        const_reference front() const
        {
            return failed_rangecheck();
        }
@ -271,26 +272,26 @@ namespace boost {
            return failed_rangecheck();
        }

-        BOOST_CONSTEXPR const_reference back() const
+        const_reference back() const
        {
            return failed_rangecheck();
        }

        // size is constant
-        static BOOST_CONSTEXPR size_type size() { return 0; }
-        static BOOST_CONSTEXPR bool empty() { return true; }
-        static BOOST_CONSTEXPR size_type max_size() { return 0; }
+        static BOOST_CONSTEXPR size_type size() BOOST_NOEXCEPT { return 0; }
+        static BOOST_CONSTEXPR bool empty() BOOST_NOEXCEPT { return true; }
+        static BOOST_CONSTEXPR size_type max_size() BOOST_NOEXCEPT { return 0; }
        enum { static_size = 0 };

        void swap (array<T,0>& /*y*/) {
        }

        // direct access to data (read-only)
-        const T* data() const { return 0; }
-        T* data() { return 0; }
+        BOOST_CONSTEXPR const T* data() const BOOST_NOEXCEPT { return 0; }
+        BOOST_CXX14_CONSTEXPR T* data() BOOST_NOEXCEPT { return 0; }

        // use array as C array (direct read/write access to data)
-        T* c_array() { return 0; }
+        T* c_array() BOOST_NOEXCEPT { return 0; }

        // assignment with type conversion
        template <typename T2>
@ -300,7 +301,7 @@ namespace boost {

        // assign one value to all elements
        void assign (const T& value) { fill ( value ); }
-        void fill   (const T& ) {}
+        BOOST_CXX14_CONSTEXPR void fill (const T& ) {}

        // check range (may be private because it is static)
        static reference failed_rangecheck () {
@ -320,27 +321,27 @@ namespace boost {

    // comparisons
    template<class T, std::size_t N>
-    bool operator== (const array<T,N>& x, const array<T,N>& y) {
+    BOOST_CXX14_CONSTEXPR bool operator== (const array<T,N>& x, const array<T,N>& y) {
        return std::equal(x.begin(), x.end(), y.begin());
    }
    template<class T, std::size_t N>
-    bool operator< (const array<T,N>& x, const array<T,N>& y) {
+    BOOST_CXX14_CONSTEXPR bool operator< (const array<T,N>& x, const array<T,N>& y) {
        return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end());
    }
    template<class T, std::size_t N>
-    bool operator!= (const array<T,N>& x, const array<T,N>& y) {
+    BOOST_CXX14_CONSTEXPR bool operator!= (const array<T,N>& x, const array<T,N>& y) {
        return !(x==y);
    }
    template<class T, std::size_t N>
-    bool operator> (const array<T,N>& x, const array<T,N>& y) {
+    BOOST_CXX14_CONSTEXPR bool operator> (const array<T,N>& x, const array<T,N>& y) {
        return y<x;
    }
    template<class T, std::size_t N>
-    bool operator<= (const array<T,N>& x, const array<T,N>& y) {
+    BOOST_CXX14_CONSTEXPR bool operator<= (const array<T,N>& x, const array<T,N>& y) {
        return !(y<x);
    }
    template<class T, std::size_t N>
-    bool operator>= (const array<T,N>& x, const array<T,N>& y) {
+    BOOST_CXX14_CONSTEXPR bool operator>= (const array<T,N>& x, const array<T,N>& y) {
        return !(x<y);
    }

--- a/index.html
+++ b/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>
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@ -2,7 +2,12 @@
 #~ 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 ;
+
+#

 run array0.cpp ;
 run array1.cpp ;
@ -12,9 +17,36 @@ run array4.cpp ;
 run array5.cpp ;
 run array6.cpp ;
 run array7.cpp ;
-# run array_constexpr.cpp ;
+
+compile array_constexpr.cpp ;
+
 compile-fail array_getfail1.cpp ;
 compile-fail array_getfail2.cpp ;
-run array_hash.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 ;
--- a/test/array_access_test.cpp
+++ b/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();
+}
--- a/test/array_assign_test.cpp
+++ b/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();
+}
--- a/test/array_c_array_test.cpp
+++ b/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();
+}
--- a/test/array_constexpr.cpp
+++ b/test/array_constexpr.cpp
@ -3,29 +3,17 @@
 * 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>
 #include <boost/array.hpp>
-#include <algorithm>
-#ifndef BOOST_NO_CXX11_HDR_ARRAY
-#include <array>
-#endif
+#include <boost/config.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 }};
-
-template <typename T>
-void sink ( T t ) {}
-
-template <typename T, size_t N>
-void sink ( boost::array<T,N> &arr ) {}

 int main()
 {
-//    constexpr int two = arr_std.at (2);
    constexpr int three = arr.at (3);
    int whatever [ arr.at(4) ];
    (void)three;
@ -33,7 +21,9 @@ int main()
 }

 #else   // no constexpr means no constexpr tests!
+
 int main()
 {
 }
+
 #endif
--- a/test/array_convert_test.cpp
+++ b/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();
+}
--- a/test/array_copy_test.cpp
+++ b/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();
+}
--- a/test/array_data_test.cpp
+++ b/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();
+}
--- a/test/array_elems_test.cpp
+++ b/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();
+}
--- a/test/array_eq_test.cpp
+++ b/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();
+}
--- a/test/array_fill_test.cpp
+++ b/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();
+}
--- a/test/array_get_test.cpp
+++ b/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();
+}
--- a/test/array_init_test.cpp
+++ b/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();
+}
--- a/test/array_iterator_test.cpp
+++ b/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();
+}
--- a/test/array_lt_test.cpp
+++ b/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();
+}
--- a/test/array_reverse_test.cpp
+++ b/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();
+}
--- a/test/array_size_test.cpp
+++ b/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();
+}
--- a/test/array_swap_test.cpp
+++ b/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();
+}
--- a/test/array_swap_test2.cpp
+++ b/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();
+}
--- a/test/array_typedef_test.cpp
+++ b/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();
+}
Author	SHA1	Message	Date
Peter Dimov	01983ff604	Remove GCC 4.4 from Drone	2025-01-15 21:12:57 +02:00
Peter Dimov	536412674f	Add Drone support	2025-01-15 20:52:27 +02:00
Peter Dimov	8c5f36ae52	array<T, 0> access operations are never constexpr	2025-01-15 20:18:14 +02:00
Peter Dimov	9d6b871972	Work around GCC 4.x constexpr failure in operator[]	2025-01-15 19:57:39 +02:00
Peter Dimov	79ca787bfe	Add more constexpr to match std::array	2025-01-12 03:31:49 +02:00
Peter Dimov	0da094a21d	Add BOOST_NOEXCEPT as needed to match std::array	2025-01-12 03:31:49 +02:00
Peter Dimov	2099995189	Uncomment BOOST_CONSTEXPR; update and enable test/array_constexpr.cpp	2025-01-12 03:31:49 +02:00
Peter Dimov	31b9fdd397	Add array_get_test.cpp	2025-01-12 03:20:46 +02:00
Peter Dimov	dca9ae1a60	Add array_lt_test.cpp	2025-01-12 03:01:00 +02:00
Peter Dimov	ff5eb67906	Add array_eq_test.cpp	2025-01-12 02:51:15 +02:00
Peter Dimov	7223d3dfcb	Add array_swap_test2.cpp	2025-01-11 22:05:37 +02:00
Peter Dimov	c549abb184	Add array_swap_test.cpp	2025-01-11 22:01:01 +02:00
Peter Dimov	cbd8e1a8dc	Add array_assign_test.cpp	2025-01-11 21:56:12 +02:00
Peter Dimov	4e3d4ef99f	Add array_fill_test.cpp	2025-01-11 21:51:06 +02:00
Peter Dimov	63f8f022e2	Add array_c_array_test.cpp	2025-01-11 21:29:33 +02:00
Peter Dimov	8d1871b4c2	Add array_access_test.cpp	2025-01-11 04:30:54 +02:00
Peter Dimov	c0488c00a3	Add array_size_test.cpp	2025-01-11 04:13:41 +02:00
Peter Dimov	48b07e63fb	Add array_reverse_test.cpp	2025-01-10 05:00:39 +02:00
Peter Dimov	8999204cae	Add array_iterator_test.cpp	2025-01-10 04:53:08 +02:00
Peter Dimov	c5741a92e7	Add array_data_test.cpp	2025-01-10 04:40:35 +02:00
Peter Dimov	1ae515a17d	Update array_copy_test	2025-01-10 04:09:16 +02:00
Peter Dimov	72997add96	Add array_convert_test.cpp	2025-01-10 04:07:38 +02:00
Peter Dimov	51fbc208d9	Add array_copy_test.cpp	2025-01-10 04:03:14 +02:00
Peter Dimov	7fac30e1ab	Fix msvc-14.0, gcc-4.x failures	2025-01-10 03:37:10 +02:00
Peter Dimov	049e98dd57	Add array_init_test.cpp	2025-01-10 03:30:57 +02:00
Peter Dimov	e0bd7e8560	Add array_elems_test.cpp	2025-01-10 03:00:00 +02:00
Peter Dimov	f9bb980a0b	Add array_typedef_test.cpp	2025-01-09 21:01:41 +02:00
Peter Dimov	fd24e0592c	Add boostdoc, boostrelease targets to doc/Jamfile.v2	2025-01-09 20:49:37 +02:00
Peter Dimov	ea54ab1610	Update index.html	2025-01-06 18:45:57 +02:00
Peter Dimov	cd6244f787	Merge pull request #26 from cmazakas/asciidoc-refactor refactor documentation to use asciidoc	2025-01-06 18:41:38 +02:00
Christian Mazakas	99c3a4b966	refactor documentation to use asciidoc	2024-12-19 10:57:58 -08:00
Peter Dimov	22b8eebc3c	Apply Node20 workaround	2024-12-16 02:53:18 +02:00
Peter Dimov	fed8935fdf	Add GCC 4.9 to ci.yml	2024-11-04 04:42:52 +02:00
Peter Dimov	9ea71dd967	Update ci.yml	2024-11-04 03:45:50 +02:00
Peter Dimov	9a11abcb9f	Disable array_hash.cpp under C++03	2024-11-04 03:43:06 +02:00
Peter Dimov	f9c01c811a	Update ci.yml	2024-11-04 03:31:57 +02:00
Marshall Clow	23f6b27c0d	Add meaningless change to force rebuild	2024-04-11 11:37:03 -07:00