documented incompatibility of safe mode with containers in shared memory (closes #95)

* added memory relocatability test
* added missing #includes
* avoided C++14 std::make_unique
* added hashed index local iterators to the test
* made all iterators store allocator-provided pointers to the nodes
* updated docs

.drone.jsonnet

@@ -0,0 +1,486 @@
+# Copyright 2022 Peter Dimov
+# Distributed under the Boost Software License, Version 1.0.
+# https://www.boost.org/LICENSE_1_0.txt
+
+local library = "multi_index";
+
+local triggers =
+{
+    branch: [ "master", "develop", "feature/*",  "fix/*" ]
+};
+
+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',
+                '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 14.04 GCC 4.8* 32/64",
+        "cppalliance/droneubuntu1404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '11', ADDRMD: '32,64' },
+    ),
+
+    linux_pipeline(
+        "Linux 14.04 GCC 4.9 32/64",
+        "cppalliance/droneubuntu1404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-4.9', CXXSTD: '11', ADDRMD: '32,64' },
+        "g++-4.9-multilib",
+        [ "ppa:ubuntu-toolchain-r/test" ],
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 GCC 5* 32/64",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '11,14', ADDRMD: '32,64' },
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 GCC 6 32/64",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-6', CXXSTD: '11,14', ADDRMD: '32,64' },
+        "g++-6-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 GCC 7* 32/64",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '11,14,17', ADDRMD: '32,64' },
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 GCC 8 32/64",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-8', CXXSTD: '11,14,17', ADDRMD: '32,64' },
+        "g++-8-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 GCC 9* 32/64",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '11,14,17,2a', ADDRMD: '32,64' },
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 GCC 9* ARM64",
+        "cppalliance/droneubuntu2004:multiarch",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '11,14,17,2a' },
+        arch="arm64",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 GCC 9* S390x",
+        "cppalliance/droneubuntu2004:multiarch",
+        { TOOLSET: 'gcc', COMPILER: 'g++', CXXSTD: '11,14,17,2a' },
+        arch="s390x",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 GCC 10 32/64",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-10', CXXSTD: '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: '11,14,17,2a', ADDRMD: '32,64' },
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 GCC 12 32/64 C++11-14",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-12', CXXSTD: '11,14', ADDRMD: '32,64' },
+        "g++-12-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 GCC 12 32/64 C++17-20",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-12', CXXSTD: '17,20', ADDRMD: '32,64' },
+        "g++-12-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 GCC 12 32/64",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-12', CXXSTD: '2b', ADDRMD: '32,64' },
+        "g++-12-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 23.04 GCC 13 32/64 UBSAN C++11-14",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-13', CXXSTD: '11,14', ADDRMD: '32,64' } + ubsan,
+        "g++-13-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 23.04 GCC 13 32/64 UBSAN C++17-20",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-13', CXXSTD: '17,20', ADDRMD: '32,64' } + ubsan,
+        "g++-13-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 23.04 GCC 13 32/64 UBSAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-13', CXXSTD: '2b', ADDRMD: '32,64' } + ubsan,
+        "g++-13-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 23.04 GCC 13 32 ASAN C++11-14",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-13', CXXSTD: '11,14', ADDRMD: '32' } + asan,
+        "g++-13-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 23.04 GCC 13 32 ASAN C++17-20",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-13', CXXSTD: '17,20', ADDRMD: '32' } + asan,
+        "g++-13-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 23.04 GCC 13 32 ASAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-13', CXXSTD: '2b', ADDRMD: '32' } + asan,
+        "g++-13-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 GCC 14 UBSAN C++11-14",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-14', CXXSTD: '11,14' } + ubsan,
+        "g++-14-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 GCC 14 UBSAN C++17-20",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-14', CXXSTD: '17,20' } + ubsan,
+        "g++-14-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 GCC 14 UBSAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-14', CXXSTD: '2b' } + ubsan,
+        "g++-14-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 GCC 14 ASAN C++11-14",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-14', CXXSTD: '11,14' } + asan,
+        "g++-14-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 GCC 14 ASAN C++17-20",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-14', CXXSTD: '17,20' } + asan,
+        "g++-14-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 24.04 GCC 14 ASAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'gcc', COMPILER: 'g++-14', CXXSTD: '2b' } + asan,
+        "g++-14-multilib",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 Clang 3.5",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.5', CXXSTD: '11' },
+        "clang-3.5",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 Clang 3.6",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.6', CXXSTD: '11,14' },
+        "clang-3.6",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 Clang 3.7",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.7', CXXSTD: '11,14' },
+        "clang-3.7",
+    ),
+
+    linux_pipeline(
+        "Linux 16.04 Clang 3.8",
+        "cppalliance/droneubuntu1604:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.8', CXXSTD: '11,14' },
+        "clang-3.8",
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 Clang 3.9",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-3.9', CXXSTD: '11,14' },
+        "clang-3.9",
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 Clang 4.0",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-4.0', CXXSTD: '11,14' },
+        "clang-4.0",
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 Clang 5.0",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-5.0', CXXSTD: '11,14' },
+        "clang-5.0",
+    ),
+
+    linux_pipeline(
+        "Linux 18.04 Clang 6.0",
+        "cppalliance/droneubuntu1804:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-6.0', CXXSTD: '11,14,17' },
+        "clang-6.0",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 Clang 7",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-7', CXXSTD: '11,14,17' },
+        "clang-7",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 Clang 8",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-8', CXXSTD: '11,14,17' },
+        "clang-8",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 Clang 9",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-9', CXXSTD: '11,14,17,2a' },
+        "clang-9",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 Clang 10",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-10', CXXSTD: '11,14,17,2a' },
+        "clang-10",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 Clang 11",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-11', CXXSTD: '11,14,17,2a' },
+        "clang-11",
+    ),
+
+    linux_pipeline(
+        "Linux 20.04 Clang 12",
+        "cppalliance/droneubuntu2004:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-12', CXXSTD: '11,14,17,2a' },
+        "clang-12",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 Clang 13",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-13', CXXSTD: '11,14,17,20' },
+        "clang-13",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 Clang 14",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-14', CXXSTD: '11,14,17,20,2b' },
+        "clang-14",
+    ),
+
+    linux_pipeline(
+        "Linux 22.04 Clang 15",
+        "cppalliance/droneubuntu2204:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-15', CXXSTD: '11,14,17,20,2b' },
+        "clang-15",
+    ),
+
+    linux_pipeline(
+        "Linux 23.04 Clang 16",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-16', CXXSTD: '11,14,17,20,2b' },
+        "clang-16",
+    ),
+
+    linux_pipeline(
+        "Linux 23.10 Clang 17 UBSAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-17', CXXSTD: '11,14,17,20,2b' } + ubsan,
+        "clang-17",
+    ),
+
+    linux_pipeline(
+        "Linux 23.10 Clang 17 ASAN",
+        "cppalliance/droneubuntu2404:1",
+        { TOOLSET: 'clang', COMPILER: 'clang++-17', CXXSTD: '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: '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: '11,14,17,20,2b' } + asan,
+        "clang-18",
+    ),
+
+    macos_pipeline(
+        "MacOS 10.15 Xcode 12.2 UBSAN (11,14)",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '11,14' } + ubsan,
+    ),
+
+    macos_pipeline(
+        "MacOS 10.15 Xcode 12.2 UBSAN (17,2a)",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '17,2a' } + ubsan,
+    ),
+
+    macos_pipeline(
+        "MacOS 10.15 Xcode 12.2 ASAN (11,14)",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '11,14' } + asan,
+    ),
+
+    macos_pipeline(
+        "MacOS 10.15 Xcode 12.2 ASAN (17,2a)",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '17,2a' } + asan,
+    ),
+
+    macos_pipeline(
+        "MacOS 12.4 Xcode 13.4.1 UBSAN",
+        { TOOLSET: 'clang', COMPILER: 'clang++', CXXSTD: '11,14,17,20,2b', LINK: 'static' } + 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: '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' },
+    ),
+]

.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 -I examples %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

.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 -I examples $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} ${LINK:+link=$LINK}

.github/workflows/ci.yml

@@ -0,0 +1,325 @@
+name: CI
+
+on:
+  pull_request:
+  push:
+    branches:
+      - master
+      - develop
+      - feature/**
+      - fix/**
+
+env:
+  UBSAN_OPTIONS: print_stacktrace=1
+  ACTIONS_ALLOW_USE_UNSECURE_NODE_VERSION: true
+
+jobs:
+  posix:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - toolset: gcc-4.8
+            cxxstd: "11"
+            container: ubuntu:18.04
+            os: ubuntu-latest
+            install: g++-4.8-multilib
+            address-model: 32,64
+          - toolset: gcc-5
+            cxxstd: "11,14,1z"
+            container: ubuntu:18.04
+            os: ubuntu-latest
+            install: g++-5-multilib
+            address-model: 32,64
+          - toolset: gcc-6
+            cxxstd: "11,14,1z"
+            container: ubuntu:18.04
+            os: ubuntu-latest
+            install: g++-6-multilib
+            address-model: 32,64
+          - toolset: gcc-7
+            cxxstd: "11,14,17"
+            container: ubuntu:20.04
+            os: ubuntu-latest
+            install: g++-7-multilib
+            address-model: 32,64
+          - toolset: gcc-8
+            cxxstd: "11,14,17,2a"
+            container: ubuntu:20.04
+            os: ubuntu-latest
+            install: g++-8-multilib
+            address-model: 32,64
+          - toolset: gcc-9
+            cxxstd: "11,14,17,2a"
+            container: ubuntu:20.04
+            os: ubuntu-latest
+            install: g++-9-multilib
+            address-model: 32,64
+          - toolset: gcc-10
+            cxxstd: "11,14,17,2a"
+            os: ubuntu-22.04
+            install: g++-10-multilib
+            address-model: 32,64
+          - toolset: gcc-11
+            cxxstd: "11,14,17,20"
+            os: ubuntu-22.04
+            install: g++-11-multilib
+            address-model: 32,64
+          - toolset: gcc-12
+            cxxstd: "11,14,17,20,2b"
+            os: ubuntu-22.04
+            install: g++-12-multilib
+            address-model: 32,64
+          - toolset: gcc-13
+            cxxstd: "11,14,17,20,2b"
+            os: ubuntu-24.04
+            install: g++-13-multilib
+            address-model: 32,64
+          - toolset: gcc-14
+            cxxstd: "11,14,17,20,2b"
+            os: ubuntu-24.04
+            install: g++-14-multilib
+            address-model: 32,64
+          - toolset: gcc-15
+            cxxstd: "11,14,17,20,23,2c"
+            container: ubuntu:26.04
+            os: ubuntu-latest
+            install: g++-15-multilib
+            address-model: 32,64
+          - toolset: gcc-16
+            cxxstd: "11,14,17,20,23,2c"
+            container: ubuntu:26.04
+            os: ubuntu-latest
+            install: g++-16-multilib
+            address-model: 32,64
+          - toolset: clang
+            compiler: clang++-3.9
+            cxxstd: "11,14"
+            os: ubuntu-latest
+            container: ubuntu:18.04
+            install: clang-3.9
+          - toolset: clang
+            compiler: clang++-4.0
+            cxxstd: "11,14"
+            os: ubuntu-latest
+            container: ubuntu:18.04
+            install: clang-4.0
+          - toolset: clang
+            compiler: clang++-5.0
+            cxxstd: "11,14"
+            os: ubuntu-latest
+            container: ubuntu:18.04
+            install: clang-5.0
+          - toolset: clang
+            compiler: clang++-6.0
+            cxxstd: "11,14,17"
+            os: ubuntu-latest
+            container: ubuntu:18.04
+            install: clang-6.0
+          - toolset: clang
+            compiler: clang++-7
+            cxxstd: "11,14,17"
+            os: ubuntu-latest
+            container: ubuntu:18.04
+            install: clang-7
+          - toolset: clang
+            compiler: clang++-8
+            cxxstd: "11,14,17"
+            container: ubuntu:20.04
+            os: ubuntu-latest
+            install: clang-8
+          - toolset: clang
+            compiler: clang++-9
+            cxxstd: "11,14,17,2a"
+            container: ubuntu:20.04
+            os: ubuntu-latest
+            install: clang-9
+          - toolset: clang
+            compiler: clang++-10
+            cxxstd: "11,14,17,2a"
+            container: ubuntu:20.04
+            os: ubuntu-latest
+            install: clang-10
+          - toolset: clang
+            compiler: clang++-11
+            cxxstd: "11,14,17,2a"
+            container: ubuntu:20.04
+            os: ubuntu-latest
+            install: clang-11
+          - toolset: clang
+            compiler: clang++-12
+            cxxstd: "11,14,17,20"
+            container: ubuntu:20.04
+            os: ubuntu-latest
+            install: clang-12
+          - toolset: clang
+            compiler: clang++-13
+            cxxstd: "11,14,17,20,2b"
+            container: ubuntu:22.04
+            os: ubuntu-latest
+            install: clang-13
+          - toolset: clang
+            compiler: clang++-14
+            cxxstd: "11,14,17,20,2b"
+            container: ubuntu:22.04
+            os: ubuntu-latest
+            install: clang-14
+          - toolset: clang
+            compiler: clang++-15
+            cxxstd: "11,14,17,20,2b"
+            container: ubuntu:22.04
+            os: ubuntu-latest
+            install: clang-15
+          - toolset: clang
+            compiler: clang++-16
+            cxxstd: "11,14,17,20,2b"
+            container: ubuntu:24.04
+            os: ubuntu-latest
+            install: clang-16
+          - toolset: clang
+            compiler: clang++-17
+            cxxstd: "11,14,17,20,2b"
+            container: ubuntu:24.04
+            os: ubuntu-latest
+            install: clang-17
+          - toolset: clang
+            compiler: clang++-18
+            cxxstd: "11,14,17,20,2b"
+            container: ubuntu:24.04
+            os: ubuntu-latest
+            install: clang-18
+          - toolset: clang
+            compiler: clang++-19
+            cxxstd: "11,14,17,20,2b"
+            container: ubuntu:24.04
+            os: ubuntu-latest
+            install: clang-19
+          - toolset: clang
+            compiler: clang++-20
+            cxxstd: "11,14,17,20,23,2c"
+            container: ubuntu:24.04
+            os: ubuntu-latest
+            install: clang-20
+          - toolset: clang
+            cxxstd: "11,14,17,20,2b"
+            os: macos-14
+          - toolset: clang
+            cxxstd: "11,14,17,20,23,2c"          
+            os: macos-15
+          - toolset: clang
+            cxxstd: "11,14,17,20,23,2c"          
+            os: macos-26
+
+    runs-on: ${{matrix.os}}
+    container:
+      image: ${{matrix.container}}
+      volumes:
+        - /node20217:/node20217:rw,rshared
+        - ${{ startsWith(matrix.container, 'ubuntu:1') && '/node20217:/__e/node20:ro,rshared' || ' ' }}
+
+    defaults:
+      run:
+        shell: bash
+
+    steps:
+      - name: Setup container environment
+        if: matrix.container
+        run: |
+          apt-get update
+          apt-get -y install sudo python3 git g++ curl xz-utils
+          if [[ "${{matrix.container}}" == "ubuntu:1"* ]]; then
+            # Node 20 doesn't work with Ubuntu 16/18  glibc: https://github.com/actions/checkout/issues/1590
+            curl -sL https://archives.boost.io/misc/node/node-v20.9.0-linux-x64-glibc-217.tar.xz | tar -xJ --strip-components 1 -C /node20217
+          fi
+
+      - uses: actions/checkout@v4
+
+      - name: Install packages
+        if: matrix.install
+        run: |
+          sudo apt-get update
+          sudo apt-get -y install ${{matrix.install}}
+
+      - name: Setup Boost
+        run: |
+          echo GITHUB_REPOSITORY: $GITHUB_REPOSITORY
+          LIBRARY=${GITHUB_REPOSITORY#*/}
+          echo LIBRARY: $LIBRARY
+          echo "LIBRARY=$LIBRARY" >> $GITHUB_ENV
+          echo GITHUB_BASE_REF: $GITHUB_BASE_REF
+          echo GITHUB_REF: $GITHUB_REF
+          REF=${GITHUB_BASE_REF:-$GITHUB_REF}
+          REF=${REF#refs/heads/}
+          echo REF: $REF
+          BOOST_BRANCH=develop && [ "$REF" == "master" ] && BOOST_BRANCH=master || true
+          echo BOOST_BRANCH: $BOOST_BRANCH
+          cd ..
+          git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
+          git submodule update --init tools/boostdep
+          python3 tools/boostdep/depinst/depinst.py -I example --git_args "--jobs 3" $LIBRARY
+          ./bootstrap.sh
+          ./b2 -d0 headers
+
+      - name: Create user-config.jam
+        if: matrix.compiler
+        run: |
+          echo "using ${{matrix.toolset}} : : ${{matrix.compiler}} ;" > ~/user-config.jam
+
+      - name: Run tests
+        run: |
+          cd ../boost-root
+          export ADDRMD=${{matrix.address-model}}
+          ./b2 -j3 libs/$LIBRARY/test toolset=${{matrix.toolset}} cxxstd=${{matrix.cxxstd}} ${ADDRMD:+address-model=$ADDRMD} variant=debug,release
+
+  windows:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - toolset: msvc-14.3
+            cxxstd: "14,17,20,latest"
+            addrmd: 32,64
+            os: windows-2022
+          - toolset: clang-win
+            cxxstd: "14,17,latest"
+            addrmd: 32,64
+            os: windows-2022
+          - toolset: gcc
+            cxxstd: "11,14,17,2a"
+            addrmd: 64
+            os: windows-2022
+
+    runs-on: ${{matrix.os}}
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - name: Setup Boost
+        shell: cmd
+        run: |
+          echo GITHUB_REPOSITORY: %GITHUB_REPOSITORY%
+          for /f %%i in ("%GITHUB_REPOSITORY%") do set LIBRARY=%%~nxi
+          echo LIBRARY: %LIBRARY%
+          echo LIBRARY=%LIBRARY%>>%GITHUB_ENV%
+          echo GITHUB_BASE_REF: %GITHUB_BASE_REF%
+          echo GITHUB_REF: %GITHUB_REF%
+          if "%GITHUB_BASE_REF%" == "" set GITHUB_BASE_REF=%GITHUB_REF%
+          set BOOST_BRANCH=develop
+          for /f %%i in ("%GITHUB_BASE_REF%") do if "%%~nxi" == "master" set BOOST_BRANCH=master
+          echo BOOST_BRANCH: %BOOST_BRANCH%
+          cd ..
+          git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+          cd boost-root
+          xcopy /s /e /q %GITHUB_WORKSPACE% libs\%LIBRARY%\
+          git submodule update --init tools/boostdep
+          python tools/boostdep/depinst/depinst.py -I example --git_args "--jobs 3" %LIBRARY%
+          cmd /c bootstrap
+          b2 -d0 headers
+
+      - name: Run tests
+        shell: cmd
+        run: |
+          cd ../boost-root
+          b2 -j3 libs/%LIBRARY%/test toolset=${{matrix.toolset}} cxxstd=${{matrix.cxxstd}} address-model=${{matrix.addrmd}} variant=debug,release embed-manifest-via=linker

.travis.yml

@@ -0,0 +1,275 @@
+# Copyright 2003-2019 Joaquín M López Muñoz.
+# 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)
+#
+# See http://www.boost.org/libs/multi_index for library home page.
+
+sudo: false
+
+language: cpp
+
+os: linux
+
+dist: trusty
+    
+branches:
+  only:
+    - develop
+    - master
+
+env:
+  matrix:
+    - BOGUS_JOB=true
+    
+matrix:
+  exclude: # workaround for https://github.com/travis-ci/travis-ci/issues/4681
+    - env: BOGUS_JOB=true
+  include:
+    - os: linux
+      compiler: g++
+      env: TOOLSET=gcc COMPILER=g++ CXXSTD=03,11
+    - os: linux
+      compiler: g++-4.4
+      env: TOOLSET=gcc COMPILER=g++-4.4 CXXSTD=98,0x
+      addons:
+        apt:
+          packages:
+            - g++-4.4
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-4.6
+      env: TOOLSET=gcc COMPILER=g++-4.6 CXXSTD=03,0x
+      addons:
+        apt:
+          packages:
+            - g++-4.6
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-4.7
+      env: TOOLSET=gcc COMPILER=g++-4.7 CXXSTD=03,11
+      addons:
+        apt:
+          packages:
+            - g++-4.7
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-4.8
+      env: TOOLSET=gcc COMPILER=g++-4.8 CXXSTD=03,11
+      addons:
+        apt:
+          packages:
+            - g++-4.8
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-4.9
+      env: TOOLSET=gcc COMPILER=g++-4.9 CXXSTD=03,11
+      addons:
+        apt:
+          packages:
+            - g++-4.9
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-5
+      env: TOOLSET=gcc COMPILER=g++-5 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - g++-5
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-6
+      env: TOOLSET=gcc COMPILER=g++-6 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - g++-6
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-7
+      env: TOOLSET=gcc COMPILER=g++-7 CXXSTD=03,11,14,17
+      addons:
+        apt:
+          packages:
+            - g++-7
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-8
+      env: TOOLSET=gcc COMPILER=g++-8 CXXSTD=03,11,14,17,2a
+      addons:
+        apt:
+          packages:
+            - g++-8
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: g++-7
+      env: UBSAN=1 TOOLSET=gcc COMPILER=g++-7 CXXSTD=03,11,14,17 UBSAN_OPTIONS=print_stacktrace=1 LINKFLAGS=-fuse-ld=gold
+      addons:
+        apt:
+          packages:
+            - g++-7
+          sources:
+            - ubuntu-toolchain-r-test
+    - os: linux
+      compiler: clang++
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=03,11
+    - os: linux
+      compiler: /usr/bin/clang++
+      env: TOOLSET=clang COMPILER=/usr/bin/clang++ CXXSTD=03,11
+      addons:
+        apt:
+          packages:
+            - clang-3.3
+    - os: linux
+      compiler: /usr/bin/clang++
+      env: TOOLSET=clang COMPILER=/usr/bin/clang++ CXXSTD=03,11
+      addons:
+        apt:
+          packages:
+            - clang-3.4
+    - os: linux
+      compiler: clang++-3.5
+      env: TOOLSET=clang COMPILER=clang++-3.5 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.5
+            - libstdc++-4.9-dev
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.5
+    - os: linux
+      compiler: clang++-3.6
+      env: TOOLSET=clang COMPILER=clang++-3.6 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.6
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.6
+    - os: linux
+      compiler: clang++-3.7
+      env: TOOLSET=clang COMPILER=clang++-3.7 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.7
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.7
+    - os: linux
+      compiler: clang++-3.8
+      env: TOOLSET=clang COMPILER=clang++-3.8 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.8
+            - libstdc++-4.9-dev
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.8
+    - os: linux
+      compiler: clang++-3.9
+      env: TOOLSET=clang COMPILER=clang++-3.9 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-3.9
+            - libstdc++-4.9-dev
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-precise-3.9
+    - os: linux
+      compiler: clang++-4.0
+      env: TOOLSET=clang COMPILER=clang++-4.0 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-4.0
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-trusty-4.0
+    - os: linux
+      compiler: clang++-5.0
+      env: TOOLSET=clang COMPILER=clang++-5.0 CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - clang-5.0
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-trusty-5.0
+    - os: linux
+      compiler: clang++-6.0
+      env: TOOLSET=clang COMPILER=clang++-6.0 CXXSTD=03,11,14,17,2a
+      addons:
+        apt:
+          packages:
+            - clang-6.0
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-trusty-6.0
+    - os: linux
+      compiler: clang++-7
+      env: TOOLSET=clang COMPILER=clang++-7 CXXSTD=03,11,14,17,2a
+      addons:
+        apt:
+          packages:
+            - clang-7
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-trusty-7
+    - os: linux
+      compiler: clang++-7
+      env: UBSAN=1 TOOLSET=clang COMPILER=clang++-7 CXXSTD=03,11,14,17,2a UBSAN_OPTIONS=print_stacktrace=1
+      addons:
+        apt:
+          packages:
+            - clang-7
+            - libstdc++-5-dev
+          sources:
+            - ubuntu-toolchain-r-test
+            - llvm-toolchain-trusty-7
+    - os: linux
+      compiler: clang++-libc++
+      env: TOOLSET=clang COMPILER=clang++-libc++ CXXSTD=03,11,14,1z
+      addons:
+        apt:
+          packages:
+            - libc++-dev
+    - os: linux
+      compiler: clang++-libc++
+      env: UBSAN=1 TOOLSET=clang COMPILER=clang++-libc++ CXXSTD=03,11,14,1z UBSAN_OPTIONS=print_stacktrace=1
+      addons:
+        apt:
+          packages:
+            - libc++-dev
+    - os: osx
+      compiler: clang++
+      env: TOOLSET=clang COMPILER=clang++ CXXSTD=03,11,14,1z
+
+install:
+  - cd ..
+  - git clone -b $TRAVIS_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+  - cd boost-root
+  - git submodule update --init
+  - git rm --ignore-unmatch libs/multi_index/
+  - ./bootstrap.sh
+  - ./b2 headers
+  - mkdir libs/multi_index
+  - cp -r $TRAVIS_BUILD_DIR/* libs/multi_index
+
+script:
+  - |-
+    echo "using $TOOLSET : : $COMPILER ;" > ~/user-config.jam
+  - ./b2 libs/multi_index/test toolset=$TOOLSET cxxstd=$CXXSTD

CMakeLists.txt

@@ -0,0 +1,38 @@
+# Generated by `boostdep --cmake multi_index`
+# Copyright 2020 Peter Dimov
+# Distributed under the Boost Software License, Version 1.0.
+# https://www.boost.org/LICENSE_1_0.txt
+
+cmake_minimum_required(VERSION 3.8...3.16)
+
+project(boost_multi_index VERSION "${BOOST_SUPERPROJECT_VERSION}" LANGUAGES CXX)
+
+add_library(boost_multi_index INTERFACE)
+add_library(Boost::multi_index ALIAS boost_multi_index)
+target_compile_features(boost_multi_index INTERFACE cxx_std_11)
+
+target_include_directories(boost_multi_index INTERFACE include)
+
+target_link_libraries(boost_multi_index
+  INTERFACE
+    Boost::assert
+    Boost::bind
+    Boost::config
+    Boost::container_hash
+    Boost::core
+    Boost::integer
+    Boost::mp11
+    Boost::preprocessor
+    Boost::smart_ptr
+    Boost::throw_exception
+    Boost::tuple
+    Boost::type_traits
+    Boost::utility
+)
+
+if(BUILD_TESTING AND EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/test/CMakeLists.txt")
+
+  add_subdirectory(test)
+
+endif()
+

README.md

@@ -0,0 +1,48 @@
+# Boost Multi-index Containers Library
+
+[![Branch](https://img.shields.io/badge/branch-master-brightgreen.svg)](https://github.com/boostorg/multi_index/tree/master) [![CI](https://github.com/boostorg/multi_index/actions/workflows/ci.yml/badge.svg?branch=master)](https://github.com/boostorg/multi_index/actions/workflows/ci.yml) [![Drone status](https://img.shields.io/drone/build/boostorg/multi_index/master?server=https%3A%2F%2Fdrone.cpp.al&logo=drone&logoColor=%23CCCCCC&label=CI)](https://drone.cpp.al/boostorg/multi_index)  [![Deps](https://img.shields.io/badge/deps-master-brightgreen.svg)](https://pdimov.github.io/boostdep-report/master/multi_index.html)  [![Documentation](https://img.shields.io/badge/docs-master-brightgreen.svg)](https://www.boost.org/doc/libs/master/libs/multi_index)  [![Enter the Matrix](https://img.shields.io/badge/matrix-master-brightgreen.svg)](https://regression.boost.org/master/developer/multi_index.html)<br/>
+[![Branch](https://img.shields.io/badge/branch-develop-brightgreen.svg)](https://github.com/boostorg/multi_index/tree/develop) [![CI](https://github.com/boostorg/multi_index/actions/workflows/ci.yml/badge.svg?branch=develop)](https://github.com/boostorg/multi_index/actions/workflows/ci.yml) [![Drone status](https://img.shields.io/drone/build/boostorg/multi_index/develop?server=https%3A%2F%2Fdrone.cpp.al&logo=drone&logoColor=%23CCCCCC&label=CI)](https://drone.cpp.al/boostorg/multi_index)  [![Deps](https://img.shields.io/badge/deps-develop-brightgreen.svg)](https://pdimov.github.io/boostdep-report/develop/multi_index.html) [![Documentation](https://img.shields.io/badge/docs-develop-brightgreen.svg)](https://www.boost.org/doc/libs/develop/libs/multi_index) [![Enter the Matrix](https://img.shields.io/badge/matrix-develop-brightgreen.svg)](https://regression.boost.org/develop/developer/multi_index.html)<br/>
+[![BSL 1.0](https://img.shields.io/badge/license-BSL_1.0-blue.svg)](https://www.boost.org/users/license.html) <img alt="C++11 required" src="https://img.shields.io/badge/standard-C%2b%2b11-blue.svg"> <img alt="Header-only library" src="https://img.shields.io/badge/build-header--only-blue.svg">
+
+[Boost.MultiIndex](http://boost.org/libs/multi_index) provides a class template
+named `multi_index_container` which enables the construction of containers
+maintaining one or more indices with different sorting and access semantics.
+
+## Learn about Boost.MultiIndex
+
+* [Online documentation](https://boost.org/libs/multi_index)
+
+## Install Boost.MultiIndex
+
+* [Download Boost](https://www.boost.org/users/download/) and you're ready to go (this is a header-only library requiring no building).
+* Using Conan 2: In case you don't have it yet, add an entry for Boost in your `conanfile.txt` (the example requires at least Boost 1.86):
+```
+[requires]
+boost/[>=1.86.0]
+```
+<ul>If you're not using any compiled Boost library, the following will skip building altogether:</ul>
+
+```
+[options]
+boost:header_only=True
+```
+* Using vcpkg: Execute the command
+```
+vcpkg install boost-multi-index
+```
+* Using CMake: [Boost CMake support infrastructure](https://github.com/boostorg/cmake)
+allows you to use CMake directly to download, build and consume all of Boost or
+some specific libraries.
+
+## Support
+
+* Join the **#boost** discussion group at [cpplang.slack.com](https://cpplang.slack.com/)
+([ask for an invite](https://cppalliance.org/slack/) if you’re not a member of this workspace yet)
+* Ask in the [Boost Users mailing list](https://lists.boost.org/mailman/listinfo.cgi/boost-users)
+(add the `[multi_index]` tag at the beginning of the subject line)
+* [File an issue](https://github.com/boostorg/multi_index/issues)
+
+## Contribute
+
+* [Pull requests](https://github.com/boostorg/multi_index/pulls) against **develop** branch are most welcome.
+Note that by submitting patches you agree to license your modifications under the [Boost Software License, Version 1.0](http://www.boost.org/LICENSE_1_0.txt).

appveyor.yml

@@ -0,0 +1,37 @@
+# Copyright 2003-2021 Joaquín M López Muñoz.
+# 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)
+#
+# See http://www.boost.org/libs/multi_index for library home page.
+
+version: 1.0.{build}-{branch}
+
+branches:
+  only:
+    - master
+    - develop
+
+environment:
+  matrix:
+    - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
+      TOOLSET: msvc-14.0
+    - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
+      TOOLSET: msvc-14.1
+      CXXSTD: 14,17
+
+install:
+  - cd ..
+  - git clone -b %APPVEYOR_REPO_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
+  - cd boost-root
+  - git submodule update --init
+  - git rm --ignore-unmatch libs/multi_index/
+  - bootstrap
+  - b2 headers
+  - xcopy /s /e /q %APPVEYOR_BUILD_FOLDER% libs\multi_index\
+
+build: off
+
+test_script:
+  - if not "%CXXSTD%" == "" set CXXSTD=cxxstd=%CXXSTD%
+  - b2 address-model=32 libs/multi_index/test toolset=%TOOLSET% %CXXSTD%

build.jam

@@ -0,0 +1,35 @@
+# Copyright René Ferdinand Rivera Morell 2023-2024
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+
+require-b2 5.2 ;
+
+constant boost_dependencies :
+    /boost/assert//boost_assert
+    /boost/bind//boost_bind
+    /boost/config//boost_config
+    /boost/container_hash//boost_container_hash
+    /boost/core//boost_core
+    /boost/integer//boost_integer
+    /boost/mp11//boost_mp11
+    /boost/preprocessor//boost_preprocessor
+    /boost/smart_ptr//boost_smart_ptr
+    /boost/throw_exception//boost_throw_exception
+    /boost/tuple//boost_tuple
+    /boost/type_traits//boost_type_traits
+    /boost/utility//boost_utility ;
+
+project /boost/multi_index
+    : common-requirements
+        <include>include
+    ;
+
+explicit
+    [ alias boost_multi_index : : : : <library>$(boost_dependencies) ]
+    [ alias all : boost_multi_index example perf test ]
+    ;
+
+call-if : boost-library multi_index
+    ;
+

doc/acknowledgements.html

@@ -172,6 +172,13 @@ hashed indices update functions</a> so that they meet some intuitive expectation
 Grzegorz Jakacki spotted some internal dead code.
 </p>
 
+<h2><a name="boost_1_56">Boost 1.56 release</a></h2>
+
+<p>
+Stephen Kelly has contributed the removal of workaround code for old compilers
+no longer supported.
+</p>
+
 <hr>
 
 <div class="prev_link"><a href="release_notes.html"><img src="prev.gif" alt="release notes" border="0"><br>
@@ -185,9 +192,9 @@ Index
 
 <br>
 
-<p>Revised June 25th 2008</p>
+<p>Revised October 9th 2013</p>
 
-<p>&copy; Copyright 2003-2008 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2013 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/examples.html

@@ -105,7 +105,7 @@ See <a href="../example/bimap.cpp">source code</a>.
 This example shows how to construct a bidirectional map with
 <code>multi_index_container</code>. By a <i>bidirectional map</i> we mean
 a container of <code>(const FromType,const ToType)</code> pairs
-such that no two elements exists with the same first
+such that no two elements exist with the same first
 <i>or</i> second component (<code>std::map</code> only
 guarantees uniqueness of the first component). Fast lookup is provided
 for both keys. The program features a tiny Spanish-English
@@ -174,9 +174,9 @@ involves having the manufactures stored in a separate
 
 <span class=keyword>struct</span> <span class=identifier>car_model</span>
 <span class=special>{</span>
-  <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span>       <span class=identifier>model</span><span class=special>;</span>
-  <span class=identifier>car_manufacturer</span><span class=special>*</span> <span class=identifier>manufacturer</span><span class=special>;</span>
-  <span class=keyword>int</span>               <span class=identifier>price</span><span class=special>;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span>             <span class=identifier>model</span><span class=special>;</span>
+  <span class=keyword>const</span> <span class=identifier>car_manufacturer</span><span class=special>*</span> <span class=identifier>manufacturer</span><span class=special>;</span>
+  <span class=keyword>int</span>                     <span class=identifier>price</span><span class=special>;</span>
 <span class=special>};</span>
 </pre></blockquote>
 
@@ -222,7 +222,7 @@ of its associated <code>car_manufacturer</code> can be accomplished with
 <blockquote><pre>
 <span class=identifier>key_from_key</span><span class=special>&lt;</span>
   <span class=identifier>member</span><span class=special>&lt;</span><span class=identifier>car_manufacturer</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>,&amp;</span><span class=identifier>car_manufacturer</span><span class=special>::</span><span class=identifier>name</span><span class=special>&gt;,</span>
-  <span class=identifier>member</span><span class=special>&lt;</span><span class=identifier>car_model</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>car_manufacturer</span> <span class=special>*,</span><span class=identifier>car_model</span><span class=special>::</span><span class=identifier>manufacturer</span><span class=special>&gt;</span>
+  <span class=identifier>member</span><span class=special>&lt;</span><span class=identifier>car_model</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>car_manufacturer</span> <span class=special>*,&amp;</span><span class=identifier>car_model</span><span class=special>::</span><span class=identifier>manufacturer</span><span class=special>&gt;</span>
 <span class=special>&gt;</span>
 </pre></blockquote>
 
@@ -450,9 +450,9 @@ Tests
 
 <br>
 
-<p>Revised May 26th 2009</p>
+<p>Revised November 18th 2019</p>
 
-<p>&copy; Copyright 2003-2009 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2019 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/future_work.html

@@ -37,27 +37,12 @@ principle driving the current internal design of <code>multi_index_container</co
 <h2>Contents</h2>
 
 <ul>
-  <li><a href="#ranked_indices">Ranked indices</a></li>
   <li><a href="#notifying">Notifying indices</a></li>
   <li><a href="#constraints">Constraints</a></li>
   <li><a href="#user_defined_indices">User-defined indices</a></li>
   <li><a href="#indexed_maps">Indexed maps</a></li>
-  <li><a href="#move_semantics">Move semantics</a></li>
 </ul>
 
-<h2><a name="ranked_indices">Ranked indices</a></h2>
-
-<p>
-Ordered indices are implemented using red-black trees; these trees
-can be augmented with additional information to obtain a type
-of data structure called
-<a href="http://pine.cs.yale.edu/pinewiki/OrderStatisticsTree"><i>order-statistics
-trees</i></a>, allowing for logarithmic search of the <i>n</i>-th element. It
-has been proposed that order-statistics trees be used to devise a new type of
-<i>ranked indices</i> that support <code>operator[]</code> while retaining
-the functionality of ordered indices.
-</p>
-
 <h2><a name="notifying">Notifying indices</a></h2>
 
 <p>
@@ -187,31 +172,6 @@ a careful study when designing the interface of a potential
 indexed map.
 </p>
 
-<h2><a name="move_semantics">Move semantics</a></h2>
-
-<p>
-Andrei Alexandrescu introduced a technique for simulating move
-constructors called Mojo (see his article in C/C++ User Journal
-<a href="http://www.cuj.com/documents/s=8246/cujcexp2102alexandr/">
-"Generic&lt;Programming>: Move Constructors"</a>.) Move semantics
-alleviates the computational load involved in the creation and copying
-of temporary objects, specially for heavy classes as
-<code>multi_index_container</code>s are. David Abrahams and Gary Powell provide
-an alternative implementation of move semantics in their paper
-<a href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2004/n1610.html">
-"Clarification of Initialization of Class Objects by rvalues"</a> for
-the C++ Evolution Working Group.
-</p>
-
-<p>
-Adding move semantics to <code>multi_index_container</code> is particularly
-beneficial when the container is used as an internal building block in other
-libraries (vg. relational database frameworks), enabling the efficient
-development of functions returning <code>multi_index_container</code>s. Without support
-for move semantics, this scheme is impractical and less elegant syntaxes
-should be resorted to.
-</p>
-
 <hr>
 
 <div class="prev_link"><a href="tests.html"><img src="prev.gif" alt="tests" border="0"><br>
@@ -226,9 +186,9 @@ Release notes
 
 <br>
 
-<p>Revised July 5th 2007</p>
+<p>Revised April 19th 2015</p>
 
-<p>&copy; Copyright 2003-2007 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2015 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/index.html

@@ -13,8 +13,8 @@
 <h1><img src="../../../boost.png" alt="boost.png (6897 bytes)" align=
 "middle" width="277" height="86">Boost Multi-index Containers Library</h1>
 
-<div class="prev_link"></div>
-<div class="up_link"></div>
+<div class="prev_link">&nbsp;</div>
+<div class="up_link">&nbsp;</div>
 <div class="next_link"><a href="tutorial/index.html"><img src="next.gif" alt="tutorial" border="0"><br>
 Tutorial
 </a></div><br clear="all" style="clear: all;">
@@ -31,12 +31,13 @@ borrowed from relational database terminology and allows for the specification o
 complex data structures in the spirit of multiply indexed relational tables where
 simple sets and maps are not enough. A wide selection of indices is provided,
 modeled after analogous STL containers like <code>std::set</code>,
-<code>std::list</code> and hashed sets.
+<code>std::list</code> and <code>std::unordered_set</code>.
 </p>
 
 <p>
 Boost.MultiIndex features additional functionalities, like subobject searching,
-range querying and in-place updating of elements, which make it a convenient replacement
+range querying, in-place updating of elements and calculation of ranks,
+which make it a convenient replacement
 for <code>std::set</code> and <code>set::multiset</code> even when no multi-indexing
 capabilities are needed.
 </p>
@@ -66,7 +67,6 @@ examples of use developed in the documentation:
 <ul>
   <li><a href="tutorial/index.html">Tutorial</a></li>
   <li><a href="reference/index.html">Reference</a></li>
-  <li><a href="compiler_specifics.html">Compiler specifics</a></li>
   <li><a href="performance.html">Performance</a></li>
   <li><a href="examples.html">Examples</a></li>
   <li><a href="tests.html">Tests</a></li>
@@ -77,17 +77,17 @@ examples of use developed in the documentation:
 
 <hr>
 
-<div class="prev_link"></div>
-<div class="up_link"></div>
+<div class="prev_link">&nbsp;</div>
+<div class="up_link">&nbsp;</div>
 <div class="next_link"><a href="tutorial/index.html"><img src="next.gif" alt="tutorial" border="0"><br>
 Tutorial
 </a></div><br clear="all" style="clear: all;">
 
 <br>
 
-<p>Revised February 6th 2006</p>
+<p>Revised November 7th 2025</p>
 
-<p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2025 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/performance.html

@@ -6,7 +6,7 @@
 <title>Boost.MultiIndex Documentation - Performance</title>
 <link rel="stylesheet" href="style.css" type="text/css">
 <link rel="start" href="index.html">
-<link rel="prev" href="compiler_specifics.html">
+<link rel="prev" href="reference/key_extraction.html">
 <link rel="up" href="index.html">
 <link rel="next" href="examples.html">
 </head>
@@ -15,8 +15,8 @@
 <h1><img src="../../../boost.png" alt="boost.png (6897 bytes)" align=
 "middle" width="277" height="86">Boost.MultiIndex Performance</h1>
 
-<div class="prev_link"><a href="compiler_specifics.html"><img src="prev.gif" alt="compiler specifics" border="0"><br>
-Compiler specifics
+<div class="prev_link"><a href="reference/key_extraction.html"><img src="prev.gif" alt="key extraction" border="0"><br>
+Key extraction
 </a></div>
 <div class="up_link"><a href="index.html"><img src="up.gif" alt="index" border="0"><br>
 Index
@@ -111,7 +111,7 @@ Consider the following instantiation of <code>multi_index_container</code>:
   <span class=keyword>int</span><span class=special>,</span>
   <span class=identifier>indexed_by</span><span class=special>&lt;</span>
     <span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;,</span>
-    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;,</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>greater</span> <span class=special>&gt;,</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;,</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>greater</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;,</span>
   <span class=special>&gt;</span>
 <span class=special>&gt;</span> <span class=identifier>indexed_t</span><span class=special>;</span>
 </pre></blockquote>
@@ -208,7 +208,7 @@ equivalent to those of <code>indexed_t</code>:
 </pre></blockquote>
 
 <p>
-The construction can be extended in a straightworward manner to
+The construction can be extended in a straightforward manner to
 handle more than two indices. In what follows, we will compare
 instantiations of <code>multi_index_container</code> against this sort of
 manual simulations.
@@ -220,7 +220,7 @@ manual simulations.
 The gain in space consumption of <code>multi_index_container</code> with
 respect to its manual simulations is amenable to a very simple
 theoretical analysis. For simplicity, we will ignore alignment
-issues (which in general play in favor of <code>multi_index_container</code>.)
+issues (which in general play in favor of <code>multi_index_container</code>).
 </p>
 
 <p>
@@ -230,7 +230,7 @@ each index. Thus the node size is
 </p>
 
 <blockquote>
-<i>S<sub>I</sub></i> = <i>e</i> + <i>h</i><sub>0</sub> + ··· + 
+<i>S<sub>I</sub></i> = <i>e</i> + <i>h</i><sub>0</sub> + &middot;&middot;&middot; + 
 <i>h</i><sub><i>N</i>-1</sub>, where<br>
 <i>e</i> = size of the element,<br>
 <i>h</i><sub><i>i</i></sub> = size of the <i>i</i>-th header.
@@ -247,7 +247,7 @@ the space allocated per element in a manual simulation is
 
 <blockquote>
 <i>S<sub>M</sub></i> = (<i>e</i> + <i>h</i><sub>0</sub>) +
-(<i>p</i> + <i>h</i><sub>1</sub>) + ··· +
+(<i>p</i> + <i>h</i><sub>1</sub>) + &middot;&middot;&middot; +
 (<i>p</i> + <i>h</i><sub><i>N</i>-1</sub>) = 
 <i>S<sub>I</sub></i> + (<i>N</i>-1)<i>p</i>, where<br>
 <i>p</i> = size of a pointer.<br>
@@ -285,7 +285,7 @@ Taking this fact into account, the former formula can be adjusted to:
 
 <p>
 where <i>O</i> is the number of ordered indices of the container, and <i>w</i>
-is the system word size (typically 4 bytes on 32-bit architectures.)
+is the system word size (typically 4 bytes on 32-bit architectures).
 </p>
 
 <p>
@@ -473,7 +473,7 @@ sequenced index.</b>
 
 <p>
 The figures confirm that in this case <code>multi_index_container</code> nodes are the
-same size than those of its <code>std::list</code> counterpart.
+same size as those of its <code>std::list</code> counterpart.
 </p>
 
 <h4><a name="time_1s">Execution time</a></h4>
@@ -527,7 +527,7 @@ ordered indices.</b>
 </p>
 
 <p>
-These results concinde with the theoretical formula for
+These results coincide with the theoretical formula for
 <i>S<sub>I</sub></i> = 28, <i>N</i> = <i>O</i> = 2 and <i>p</i> = <i>w</i> = 4.
 </p>
 
@@ -583,7 +583,7 @@ ordered index + 1 sequenced index.</b>
 </p>
 
 <p>
-These results concinde with the theoretical formula for
+These results coincide with the theoretical formula for
 <i>S<sub>I</sub></i> = 24, <i>N</i> = 2, <i>O</i> = 1 and <i>p</i> = <i>w</i> = 4.
 </p>
 
@@ -604,7 +604,7 @@ improvement of 50-65% with respect to the STL-based manual simulation.
 Curiously enough, this speedup gets even higher when
 <i>n</i>=10<sup>5</sup> for two of the compilers, namely GCC and ICC.
 In order to rule out spurious results, the tests
-have been run many times, yielding similar outcoumes. Both test environments
+have been run many times, yielding similar outcomes. Both test environments
 are deployed on the same machine, which points to some OS-related reason for
 this phenomenon.
 </p>
@@ -646,7 +646,7 @@ ordered indices.</b>
 </p>
 
 <p>
-These results concinde with the theoretical formula for
+These results coincide with the theoretical formula for
 <i>S<sub>I</sub></i> = 40, <i>N</i> = <i>O</i> = 3 and <i>p</i> = <i>w</i> = 4.
 </p>
 
@@ -700,7 +700,7 @@ ordered indices + 1 sequenced index.</b>
 </p>
 
 <p>
-These results concinde with the theoretical formula for
+These results coincide with the theoretical formula for
 <i>S<sub>I</sub></i> = 36, <i>N</i> = 3, <i>O</i> = 2 and <i>p</i> = <i>w</i> = 4.
 </p>
 
@@ -725,7 +725,7 @@ factor, which ranges from 45% to 55%.
 We have shown that <code>multi_index_container</code> outperforms, both in space and
 time efficiency, equivalent data structures obtained from the manual
 combination of STL containers. This improvement gets larger when the number
-of indices increase.
+of indices increases.
 </p>
 
 <p>
@@ -737,8 +737,8 @@ some improvements both in space consumption and execution time.
 
 <hr>
 
-<div class="prev_link"><a href="compiler_specifics.html"><img src="prev.gif" alt="compiler specifics" border="0"><br>
-Compiler specifics
+<div class="prev_link"><a href="reference/key_extraction.html"><img src="prev.gif" alt="key extraction" border="0"><br>
+Key extraction
 </a></div>
 <div class="up_link"><a href="index.html"><img src="up.gif" alt="index" border="0"><br>
 Index
@@ -749,9 +749,9 @@ Examples
 
 <br>
 
-<p>Revised May 9th 2006</p>
+<p>Revised November 7th 2025</p>
 
-<p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2025 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/reference/index.html

@@ -16,7 +16,7 @@
 "middle" width="277" height="86">Boost.MultiIndex Reference</h1>
 
 <div class="prev_link"><a href="../tutorial/techniques.html"><img src="../prev.gif" alt="techniques" border="0"><br>
-Tecnhiques
+Techniques
 </a></div>
 <div class="up_link"><a href="../index.html"><img src="../up.gif" alt="index" border="0"><br>
 Index
@@ -34,6 +34,7 @@ Index
   <li><a href="multi_index_container.html">Class template <code>multi_index_container</code></a></li>
   <li><a href="indices.html">Index reference</a></li>
   <li><a href="ord_indices.html">Ordered indices</a></li>
+  <li><a href="rnk_indices.html">Ranked indices</a></li>
   <li><a href="hash_indices.html">Hashed indices</a></li>
   <li><a href="seq_indices.html">Sequenced indices</a></li>
   <li><a href="rnd_indices.html">Random access indices</a></li>
@@ -59,6 +60,13 @@ The following dependencies among headers of Boost.MultiIndex hold:
         <code>"boost/multi_index/tag.hpp"</code></a>.</li>
     </ul>
   </li>
+  <li><a href="rnk_indices.html#synopsis">
+    <code>"boost/multi_index/ranked_index.hpp"</code></a> includes
+    <ul>
+      <li><a href="indices.html#tag_synopsis">
+        <code>"boost/multi_index/tag.hpp"</code></a>.</li>
+    </ul>
+  </li>
   <li><a href="hash_indices.html#synopsis">
     <code>"boost/multi_index/hashed_index.hpp"</code></a> includes
     <ul>
@@ -116,7 +124,7 @@ object modules.
 <hr>
 
 <div class="prev_link"><a href="../tutorial/techniques.html"><img src="../prev.gif" alt="techniques" border="0"><br>
-Tecnhiques
+Techniques
 </a></div>
 <div class="up_link"><a href="../index.html"><img src="../up.gif" alt="index" border="0"><br>
 Index
@@ -127,9 +135,9 @@ Index
 
 <br>
 
-<p>Revised June 19th 2007</p>
+<p>Revised November 24th 2015</p>
 
-<p>&copy; Copyright 2003-2007 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2015 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/reference/indices.html

@@ -81,7 +81,7 @@ appropriate interface of some index of the <code>multi_index_container</code>;
 these operations, however, do have an impact on all other indices as
 well: for instance, insertion through a given index may fail because
 there exists another index which bans the operation in order to preserve
-its invariant (like uniqueness of elements.) This circumstance, rather
+its invariant (like uniqueness of elements). This circumstance, rather
 than being an obstacle, yields much of the power of Boost.MultiIndex:
 equivalent constructions based on manual composition of standard
 containers would have to add a fair amount of code in order to
@@ -103,14 +103,15 @@ six primitives:
 </ul>
 The last two primitives deserve some further explanation: in order to
 guarantee the invariants associated to each index (e.g. some definite
-ordering,) elements of a <code>multi_index_container</code> are not mutable.
+ordering), elements of a <code>multi_index_container</code> are not mutable.
 To overcome this restriction, indices expose member functions
-for updating and modifying, which allow for the mutation of elements
+for replacement and modification which allow for the mutation of elements
 in a controlled fashion. Immutability of elements does not significantly
-impact the interface of ordered indices, as it is based upon  that of
-<code>std::set</code> and <code>std:multiset</code>, and these containers
+impact the interfaces of ordered and hashed indices, as they are based upon
+those of associative and unordered associative containers, respectively,
+and these containers
 also have non-mutable elements; but it may come as a surprise when dealing
-with sequenced indices, which are designed upon the functionality provided
+with sequenced and random access indices, which are designed upon the functionality provided
 by <code>std::list</code>. 
 </p>
 
@@ -119,12 +120,10 @@ These global operations are not directly exposed to the user, but rather
 they are wrapped as appropriate by each index (for instance, ordered indices
 provide a set-like suite of insertion member functions, whereas sequenced
 and random access indices have <code>push_back</code> and <code>push_front</code>
-operations.) Boost.MultiIndex poses no particular conditions on
-the interface of indices, save that they must model
-<a href="http://www.sgi.com/tech/stl/Container.html">
-<code>Container</code></a> (without the requirement of being
-<a href="http://www.sgi.com/tech/stl/Assignable.html">
-<code>Assignable</code></a>.)
+operations). Boost.MultiIndex poses no particular conditions on
+the interface of indices, although each index provided satisfies the C++ requirements for
+standard containers to the maximum extent possible within the conceptual framework
+of the library.
 </p>
 
 <h2><a name="complexity_signature">Complexity signature</a></h2>
@@ -157,16 +156,16 @@ with <code>N</code> indices labelled <code>0</code>,...,<code>N-1</code>
 whose complexity signatures are
 (<code>c<sub>i</sub></code>,<code>i<sub>i</sub></code>,<code>h<sub>i</sub></code>,<code>d<sub>i</sub></code>,<code>r<sub>i</sub></code>,<code>m<sub>i</sub></code>);
 the insertion of an element in such a container is then of complexity
-<code>O(i<sub>0</sub>(n)+···+i<sub>N-1</sub>(n))</code> where <code>n</code>
+<code>O(i<sub>0</sub>(n)+&middot;&middot;&middot;+i<sub>N-1</sub>(n))</code> where <code>n</code>
 is the number of elements. To abbreviate notation, we adopt the
 following definitions:
 <ul>
-  <li><code>C(n)=c<sub>0</sub>(n)+···+c<sub>N-1</sub>(n)</code>,</li>
-  <li><code>I(n)=i<sub>0</sub>(n)+···+i<sub>N-1</sub>(n)</code>,</li>
-  <li><code>H(n)=h<sub>0</sub>(n)+···+h<sub>N-1</sub>(n)</code>,</li>
-  <li><code>D(n)=d<sub>0</sub>(n)+···+d<sub>N-1</sub>(n)</code>,</li>
-  <li><code>R(n)=r<sub>0</sub>(n)+···+r<sub>N-1</sub>(n)</code>,</li>
-  <li><code>M(n)=m<sub>0</sub>(n)+···+m<sub>N-1</sub>(n)</code>.</li>
+  <li><code>C(n)=c<sub>0</sub>(n)+&middot;&middot;&middot;+c<sub>N-1</sub>(n)</code>,</li>
+  <li><code>I(n)=i<sub>0</sub>(n)+&middot;&middot;&middot;+i<sub>N-1</sub>(n)</code>,</li>
+  <li><code>H(n)=h<sub>0</sub>(n)+&middot;&middot;&middot;+h<sub>N-1</sub>(n)</code>,</li>
+  <li><code>D(n)=d<sub>0</sub>(n)+&middot;&middot;&middot;+d<sub>N-1</sub>(n)</code>,</li>
+  <li><code>R(n)=r<sub>0</sub>(n)+&middot;&middot;&middot;+r<sub>N-1</sub>(n)</code>,</li>
+  <li><code>M(n)=m<sub>0</sub>(n)+&middot;&middot;&middot;+m<sub>N-1</sub>(n)</code>.</li>
 </ul>
 For instance, consider a <code>multi_index_container</code> with two ordered indices,
 for which <code>i(n)=log(n)</code>, and a sequenced index with <code>i(n)=1</code>
@@ -190,11 +189,14 @@ index specifiers
   <li><a href="ord_indices.html#unique_non_unique"><code>ordered_unique</code> and
     <code>ordered_non_unique</code></a> for
     <a href="ord_indices.html">ordered indices</a>,</li>
+  <li><a href="rnk_indices.html#unique_non_unique"><code>ranked_unique</code> and
+    <code>ranked_non_unique</code></a> for
+    <a href="rnk_indices.html">ranked indices</a>,</li>
   <li><a href="hash_indices.html#unique_non_unique"><code>hashed_unique</code> and
     <code>hashed_non_unique</code></a> for
     <a href="hash_indices.html">hashed indices</a>,</li>
   <li><a href="seq_indices.html#sequenced"><code>sequenced</code></a> for
-    <a href="seq_indices.html">sequenced indices</a></li>
+    <a href="seq_indices.html">sequenced indices</a>,</li>
   <li>and <a href="rnd_indices.html#random_access"><code>random_access</code></a> for
     <a href="rnd_indices.html">random access indices</a>.</li>
 </ul>
@@ -210,7 +212,7 @@ index specifiers
 
 <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
 
-<span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>T0</span><span class=special>,...,</span><span class=keyword>typename</span> <span class=identifier>Tn</span><span class=special>&gt;</span>
+<span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>T</span><span class=special>,</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Ts</span><span class=special>&gt;</span>
 <span class=keyword>struct</span> <span class=identifier>indexed_by</span><span class=special>;</span>
 
 <span class=special>}</span> <span class=comment>// namespace boost::multi_index</span> 
@@ -221,24 +223,19 @@ index specifiers
 <h3><a name="indexed_by">Class template <code>indexed_by</code></a></h3>
 
 <p>
-<code>indexed_by</code> is a model of
-<a href="../../../../libs/mpl/doc/refmanual/random-access-sequence.html">
-<code>MPL Random Access Sequence</code></a> and
-<a href="../../../../libs/mpl/doc/refmanual/extensible-sequence.html">
-<code>MPL Extensible Sequence</code></a> meant to be used to specify a
+<code>indexed_by</code> is meant to be used to specify a
 compile-time list of indices as the <code>IndexSpecifierList</code> of
 <code>multi_index_container</code>.
 </p>
 
 <blockquote><pre>
-<span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>T0</span><span class=special>,...,</span><span class=keyword>typename</span> <span class=identifier>Tn</span><span class=special>&gt;</span>
+<span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>T</span><span class=special>,</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Ts</span><span class=special>&gt;</span>
 <span class=keyword>struct</span> <span class=identifier>indexed_by</span><span class=special>;</span>
 </pre></blockquote>
 
 <p>
 Each user-provided element of <code>indexed_list</code> must be an index
-specifier. At least an element must be provided. The maximum number of elements
-of an <code>indexed_by</code> sequence is implementation defined.
+specifier. At least an element must be provided.
 </p>
 
 <h2><a name="tags">Tags</a></h2>
@@ -262,7 +259,7 @@ class template <a href="#tag"><code>tag</code></a>.
 
 <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
 
-<span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>T0</span><span class=special>,...,</span><span class=keyword>typename</span> <span class=identifier>Tn</span><span class=special>&gt;</span>
+<span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Ts</span><span class=special>&gt;</span>
 <span class=keyword>struct</span> <span class=identifier>tag</span><span class=special>;</span>
 
 <span class=special>}</span> <span class=comment>// namespace boost::multi_index</span> 
@@ -278,25 +275,13 @@ sequence of tags to be assigned to an index in instantiation time.
 </p>
 
 <blockquote><pre>
-<span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>T0</span><span class=special>,...,</span><span class=keyword>typename</span> <span class=identifier>Tn</span><span class=special>&gt;</span>
-<span class=keyword>struct</span> <span class=identifier>tag</span>
-<span class=special>{</span>
-  <span class=keyword>typedef</span> <b>implementation defined</b> <span class=identifier>type</span><span class=special>;</span>
-<span class=special>};</span>
+<span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Ts</span><span class=special>&gt;</span>
+<span class=keyword>struct</span> <span class=identifier>tag</span><span class=special>;</span>
 </pre></blockquote>
 
 <p>
 Elements of <code>tag</code> can be any type, though the user is expected
 to provide classes with mnemonic names. Duplicate elements are not allowed.
-The maximum number of elements of a <code>tag</code> instantiation is
-implementation defined.
-The nested
-<code>type</code> is a model of
-<a href="../../../../libs/mpl/doc/refmanual/random-access-sequence.html">
-<code>MPL Random Access Sequence</code></a> and
-<a href="../../../../libs/mpl/doc/refmanual/extensible-sequence.html">
-<code>MPL Extensible Sequence</code></a> containing the types <code>T0</code>, ... ,
-<code>Tn</code> in the same order as specified.
 </p>
 
 <h2><a name="index_catalog">Indices provided by Boost.MultiIndex</a></h2>
@@ -310,7 +295,11 @@ elements, as described in the <a href="key_extraction.html">key extraction
 reference</a>.
 <ul>
   <li><a href="ord_indices.html">Ordered indices</a> sort the elements
-    on the key and provide fast lookup capabilites.</li>
+    on the key and provide fast lookup capabilities.</li>
+  <li><a href="rnk_indices.html">Ranked indices</a> are a variation of
+    ordered indices providing extra operations based on 
+    <i>rank</i>, the numerical position of an element
+    in the sequence.</li>
   <li><a href="hash_indices.html">Hashed indices</a> offer high
     efficiency access through hashing techniques.</li>
 </ul>
@@ -330,13 +319,10 @@ reference</a>.
 <h2><a name="views">Index views</a></h2>
 
 <p>
-The following concept is used by the rearrange facilities of non key-based
+The following concept is used by the rearrange facilities of non-key-based
 indices. Given an index <code>i</code> of type <code>Index</code>, a <i>view
 of <code>i</code></i> is any range [<code>first</code>,<code>last</code>)
-where <code>first</code> and <code>last</code> are objects of a type
-<code>Iterator</code> modelling
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">
-<code>Input Iterator</code></a> such that
+where <code>first</code> and <code>last</code> are input iterators such that
 <ol>
   <li>the associated value type of <code>Iterator</code> is convertible
     to <code>const Index::value_type&amp;</code>
@@ -383,9 +369,9 @@ Ordered indices
 
 <br>
 
-<p>Revised July 21st 2009</p>
+<p>Revised October 25th 2025</p>
 
-<p>&copy; Copyright 2003-2009 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2025 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/reference/multi_index_container.html

@@ -88,6 +88,8 @@ synopsis</a>
 </h2>
 
 <blockquote><pre>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>initializer_list</span><span class=special>&gt;</span>
+
 <span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
 
 <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
@@ -117,7 +119,7 @@ synopsis</a>
 <span class=keyword>typename</span> <span class=identifier>nth_index</span><span class=special>&lt;</span>
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;,</span><span class=identifier>N</span>
 <span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span>
-<span class=identifier>get</span><span class=special>(</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>);</span>
+<span class=identifier>get</span><span class=special>(</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span><span class=keyword>noexcept</span><span class=special>;</span>
 
 <span class=keyword>template</span><span class=special>&lt;</span>
   <span class=keyword>int</span> <span class=identifier>N</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Value</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Allocator</span>
@@ -125,7 +127,7 @@ synopsis</a>
 <span class=keyword>const</span> <span class=keyword>typename</span> <span class=identifier>nth_index</span><span class=special>&lt;</span>
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;,</span><span class=identifier>N</span>
 <span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span>
-<span class=identifier>get</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>);</span>
+<span class=identifier>get</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span><span class=keyword>noexcept</span><span class=special>;</span>
 
 <span class=keyword>template</span><span class=special>&lt;</span>
   <span class=keyword>typename</span> <span class=identifier>Tag</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Value</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Allocator</span>
@@ -133,7 +135,7 @@ synopsis</a>
 <span class=keyword>typename</span> <span class=identifier>index</span><span class=special>&lt;</span>
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;,</span><span class=identifier>Tag</span>
 <span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span>
-<span class=identifier>get</span><span class=special>(</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>);</span>
+<span class=identifier>get</span><span class=special>(</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span><span class=keyword>noexcept</span><span class=special>;</span>
 
 <span class=keyword>template</span><span class=special>&lt;</span>
   <span class=keyword>typename</span> <span class=identifier>Tag</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Value</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Allocator</span>
@@ -141,7 +143,7 @@ synopsis</a>
 <span class=keyword>const</span> <span class=keyword>typename</span> <span class=identifier>index</span><span class=special>&lt;</span>
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;,</span><span class=identifier>Tag</span>
 <span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span>
-<span class=identifier>get</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>);</span>
+<span class=identifier>get</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span><span class=keyword>noexcept</span><span class=special>;</span>
 
 <span class=comment>// multi_index_container global functions for projection of iterators:</span>
 
@@ -233,16 +235,15 @@ and for access to the indices held.
 <p>
 A <code>multi_index_container</code> type is instantiated with the type of the
 elements contained and a non-empty
-<a href="../../../../libs/mpl/doc/refmanual/forward-sequence.html">
-<code>MPL Forward Sequence</code></a> specifying which indices conform the
-class.
+<a href="../../../../libs/mp11/doc/html/mp11.html#definitions">Mp11 list</a>
+specifying which indices conform the class.
 </p>
 
 <p>
 For convenience of use, all public methods and types of the first index
 specified are inherited by <code>multi_index_container</code>. This also includes global
 operators and functions associated with the index (vg. comparison and
-<code>swap</code>.)
+<code>swap</code>).
 </p>
 
 <blockquote><pre>
@@ -262,6 +263,7 @@ operators and functions associated with the index (vg. comparison and
   <span class=keyword>typedef</span> <b>implementation defined</b>   <span class=identifier>iterator_type_list</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>implementation defined</b>   <span class=identifier>const_iterator_type_list</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=identifier>Allocator</span>                <span class=identifier>allocator_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>implementation defined</b>   <span class=identifier>node_type</span><span class=special>;</span>
 
   <span class=comment>// nested class templates:</span>
 
@@ -269,7 +271,6 @@ operators and functions associated with the index (vg. comparison and
   <span class=keyword>struct</span> <span class=identifier>nth_index</span>                <span class=special>{</span><span class=keyword>typedef</span> <b>implementation defined</b> <span class=identifier>type</span><span class=special>;};</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Tag</span><span class=special>&gt;</span>
   <span class=keyword>struct</span> <span class=identifier>index</span>                    <span class=special>{</span><span class=keyword>typedef</span> <b>implementation defined</b> <span class=identifier>type</span><span class=special>;};</span>
-  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>int</span> <span class=identifier>N</span><span class=special>&gt;</span>
 
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>int</span> <span class=identifier>N</span><span class=special>&gt;</span>
   <span class=keyword>struct</span> <span class=identifier>nth_index_iterator</span>        <span class=comment><b>// deprecated</b></span>
@@ -286,8 +287,9 @@ operators and functions associated with the index (vg. comparison and
   
   <span class=comment>// construct/copy/destroy:</span>
 
+  <span class=identifier>multi_index_container</span><span class=special>();</span>
   <span class=keyword>explicit</span> <span class=identifier>multi_index_container</span><span class=special>(
-    </span><span class=keyword>const</span> <span class=identifier>ctor_args_list</span><span class=special>&amp;</span> <span class=identifier>args_list</span><span class=special>=</span><span class=identifier>ctor_args_list</span><span class=special>(),
+    </span><span class=keyword>const</span> <span class=identifier>ctor_args_list</span><span class=special>&amp;</span> <span class=identifier>args_list</span><span class=special>,
     </span><span class=keyword>const</span> <span class=identifier>allocator_type</span><span class=special>&amp;</span> <span class=identifier>al</span><span class=special>=</span><span class=identifier>allocator_type</span><span class=special>());</span>
   <span class=keyword>explicit</span> <span class=identifier>multi_index_container</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>allocator_type</span><span class=special>&amp;</span> <span class=identifier>al</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>InputIterator</span><span class=special>&gt;</span>
@@ -295,22 +297,38 @@ operators and functions associated with the index (vg. comparison and
     <span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>,</span>
     <span class=keyword>const</span> <span class=identifier>ctor_args_list</span><span class=special>&amp;</span> <span class=identifier>args_list</span><span class=special>=</span><span class=identifier>ctor_args_list</span><span class=special>(),
     </span><span class=keyword>const</span> <span class=identifier>allocator_type</span><span class=special>&amp;</span> <span class=identifier>al</span><span class=special>=</span><span class=identifier>allocator_type</span><span class=special>());</span>
+  <span class=identifier>multi_index_container</span><span class=special>(</span>
+    <span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>,</span>
+    <span class=keyword>const</span> <span class=identifier>ctor_args_list</span><span class=special>&amp;</span> <span class=identifier>args_list</span><span class=special>=</span><span class=identifier>ctor_args_list</span><span class=special>(),</span>
+    <span class=keyword>const</span> <span class=identifier>allocator_type</span><span class=special>&amp;</span> <span class=identifier>al</span><span class=special>=</span><span class=identifier>allocator_type</span><span class=special>());</span>
   <span class=identifier>multi_index_container</span><span class=special>(</span>
     <span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>multi_index_container</span><span class=special>(</span>
+    <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>multi_index_container</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+    <span class=keyword>const</span> <span class=identifier>allocator_type</span><span class=special>&amp;</span> <span class=identifier>al</span><span class=special>);</span>
+  <span class=identifier>multi_index_container</span><span class=special>(</span>
+    <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+    <span class=keyword>const</span> <span class=identifier>allocator_type</span><span class=special>&amp;</span> <span class=identifier>al</span><span class=special>);</span>
 
   <span class=special>~</span><span class=identifier>multi_index_container</span><span class=special>();</span>
 
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=keyword>operator</span><span class=special>=(</span>
     <span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=keyword>operator</span><span class=special>=(</span>
+    <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=keyword>operator</span><span class=special>=(</span>
+    <span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>)</span>
 
-  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// retrieval of indices</span>
 
-  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>int</span> <span class=identifier>N</span><span class=special>&gt;</span> <span class=keyword>typename</span> <span class=identifier>nth_index</span><span class=special>&lt;</span><span class=identifier>N</span><span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span> <span class=identifier>get</span><span class=special>();</span>
-  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>int</span> <span class=identifier>N</span><span class=special>&gt;</span> <span class=keyword>const</span> <span class=keyword>typename</span> <span class=identifier>nth_index</span><span class=special>&lt;</span><span class=identifier>N</span><span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span> <span class=identifier>get</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Tag</span><span class=special>&gt;</span> <span class=keyword>typename</span> <span class=identifier>index</span><span class=special>&lt;</span><span class=identifier>Tag</span><span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span> <span class=identifier>get</span><span class=special>()</span>
-  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Tag</span><span class=special>&gt;</span> <span class=keyword>const</span> <span class=keyword>typename</span> <span class=identifier>index</span><span class=special>&lt;</span><span class=identifier>Tag</span><span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span> <span class=identifier>get</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>int</span> <span class=identifier>N</span><span class=special>&gt;</span> <span class=keyword>typename</span> <span class=identifier>nth_index</span><span class=special>&lt;</span><span class=identifier>N</span><span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span> <span class=identifier>get</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>int</span> <span class=identifier>N</span><span class=special>&gt;</span> <span class=keyword>const</span> <span class=keyword>typename</span> <span class=identifier>nth_index</span><span class=special>&lt;</span><span class=identifier>N</span><span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span> <span class=identifier>get</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Tag</span><span class=special>&gt;</span> <span class=keyword>typename</span> <span class=identifier>index</span><span class=special>&lt;</span><span class=identifier>Tag</span><span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span> <span class=identifier>get</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Tag</span><span class=special>&gt;</span> <span class=keyword>const</span> <span class=keyword>typename</span> <span class=identifier>index</span><span class=special>&lt;</span><span class=identifier>Tag</span><span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span> <span class=identifier>get</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// projection of iterators</span>
 
@@ -368,9 +386,9 @@ operators and functions associated with the index (vg. comparison and
 <span class=keyword>typename</span> <span class=identifier>nth_index</span><span class=special>&lt;</span>
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;,</span><span class=identifier>N</span>
 <span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span>
-<span class=identifier>get</span><span class=special>(</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span>
+<span class=identifier>get</span><span class=special>(</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span><span class=keyword>noexcept</span>
 <span class=special>{</span>
-  <span class=keyword>return</span> <span class=identifier>m</span><span class=special>.</span><span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>N</span><span class=special>&gt;();</span>
+  <span class=keyword>return</span> <span class=identifier>m</span><span class=special>.</span><span class=keyword>template</span> <span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>N</span><span class=special>&gt;();</span>
 <span class=special>}</span>
 
 <span class=keyword>template</span><span class=special>&lt;</span>
@@ -379,9 +397,9 @@ operators and functions associated with the index (vg. comparison and
 <span class=keyword>const</span> <span class=keyword>typename</span> <span class=identifier>nth_index</span><span class=special>&lt;</span>
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;,</span><span class=identifier>N</span>
 <span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span>
-<span class=identifier>get</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span>
+<span class=identifier>get</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span><span class=keyword>noexcept</span>
 <span class=special>{</span>
-  <span class=keyword>return</span> <span class=identifier>m</span><span class=special>.</span><span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>N</span><span class=special>&gt;();</span>
+  <span class=keyword>return</span> <span class=identifier>m</span><span class=special>.</span><span class=keyword>template</span> <span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>N</span><span class=special>&gt;();</span>
 <span class=special>}</span>
 
 <span class=keyword>template</span><span class=special>&lt;</span>
@@ -390,9 +408,9 @@ operators and functions associated with the index (vg. comparison and
 <span class=keyword>typename</span> <span class=identifier>index</span><span class=special>&lt;</span>
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;,</span><span class=identifier>Tag</span>
 <span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span>
-<span class=identifier>get</span><span class=special>(</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span>
+<span class=identifier>get</span><span class=special>(</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span><span class=keyword>noexcept</span>
 <span class=special>{</span>
-  <span class=keyword>return</span> <span class=identifier>m</span><span class=special>.</span><span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>Tag</span><span class=special>&gt;();</span>
+  <span class=keyword>return</span> <span class=identifier>m</span><span class=special>.</span><span class=keyword>template</span> <span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>Tag</span><span class=special>&gt;();</span>
 <span class=special>}</span>
 
 <span class=keyword>template</span><span class=special>&lt;</span>
@@ -401,9 +419,9 @@ operators and functions associated with the index (vg. comparison and
 <span class=keyword>const</span> <span class=keyword>typename</span> <span class=identifier>index</span><span class=special>&lt;</span>
   <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;,</span><span class=identifier>Tag</span>
 <span class=special>&gt;::</span><span class=identifier>type</span><span class=special>&amp;</span>
-<span class=identifier>get</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span>
+<span class=identifier>get</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span><span class=identifier>Value</span><span class=special>,</span><span class=identifier>IndexSpecifierList</span><span class=special>,</span><span class=identifier>Allocator</span><span class=special>&gt;&amp;</span> <span class=identifier>m</span><span class=special>)</span><span class=keyword>noexcept</span>
 <span class=special>{</span>
-  <span class=keyword>return</span> <span class=identifier>m</span><span class=special>.</span><span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>Tag</span><span class=special>&gt;();</span>
+  <span class=keyword>return</span> <span class=identifier>m</span><span class=special>.</span><span class=keyword>template</span> <span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>Tag</span><span class=special>&gt;();</span>
 <span class=special>}</span>
 
 <span class=comment>// multi_index_container global functions for projection of iterators:</span>
@@ -507,22 +525,18 @@ scheme outlined in the
 <p>
 <code>multi_index_container</code> is instantiated with the following types:
 <ol>
-  <li><code>Value</code> is the
-    <a href="http://www.sgi.com/tech/stl/Assignable.html"><code>Assignable</code></a>
-    type of the elements contained.
+  <li><code>Value</code> is the type of the elements contained. <code>Value</code> must be
+      <code>Erasable</code> from <code>multi_index_container</code>.
   </li>
   <li><code>IndexSpecifierList</code> specifies the indices that the
     <code>multi_index_container</code> is composed of. It must be a non-empty
-    <a href="../../../../libs/mpl/doc/refmanual/forward-sequence.html">
-    <code>MPL Forward Sequence</code></a> (and, preferrably,
-    an <a href="../../../../libs/mpl/doc/refmanual/random-access-sequence.html">
-    <code>MPL Random Access Sequence</code></a>) of index specifiers. For
-    syntactic convenience, the
+    <a href="../../../../libs/mp11/doc/html/mp11.html#definitions">Mp11 list</a>
+    of index specifiers. For syntactic convenience, the
     <a href="indices.html#indexed_by"><code>indexed_by</code></a>
-    MPL sequence can be used.
+    construct can be used.
   </li>
   <li><code>Allocator</code> must be an allocator of <code>Value</code> objects
-    satisfying the associated C++ requirements at <b>[lib.allocator.requirements]</b>.
+    satisfying the associated C++ requirements at <b>[allocator.requirements]</b>.
     The following relaxations to the standard requirements are allowed:
     <ul>
       <li>Non-equal allocator instances are supported: swapping two non-equal
@@ -530,9 +544,7 @@ scheme outlined in the
       </li>
       <li>For every type <code>T</code>,
         the type <code>Allocator::rebind&lt;T&gt;::other::pointer</code> can be any
-        kind of
-        <a href="http://www.sgi.com/tech/stl/RandomAccessIterator.html"><code>Random
-        Access Iterator</code></a>, provided that it is explicitly constructible from
+        kind of random access iterator, provided that it is explicitly constructible from
         the literal <code>0</code> (standing here as the null pointer) or from any
         <code>p</code> of type <code>T*</code> pointing into an area allocated by
         some instance of <code>Allocator</code> or some other allocator type rebound
@@ -540,13 +552,21 @@ scheme outlined in the
         <code>p</code> shall dereference to <code>*p</code>.
       </li>
     </ul>
+    <code>multi_index_container</code>s and all their iterators do not store references
+    to allocated elements other than through the allocator's pointer type.
   </li>
 </ol>
+
 Indices of a given <code>multi_index_container</code> instantiation cannot have
 duplicate <a href="indices.html#tags">tags</a>, either within a single
 index or in two different indices.
 </p>
 
+<p>
+In what follows, the number of indices of the <code>multi_index_container</code>
+is named <code>I</code>.
+</p>
+
 <h4><a name="types">Nested types</a></h4>
 
 <code>ctor_args_list</code>
@@ -564,9 +584,8 @@ implicit conversion from
 to <code>const ctor_args_list&amp;</code>. This type is used for
 providing the construction arguments of the indices of the
 <code>multi_index_container</code>. <code>ctor_args_list</code> is 
-<a href="http://www.sgi.com/tech/stl/DefaultConstructible.html"><code>Default 
-Constructible</code></a>, provided that all <code>ctor_args</code> types
-involved are default constructible.
+<code>DefaultConstructible</code>, provided that all <code>ctor_args</code> types
+involved are <code>DefaultConstructible</code>.
 </blockquote>
 
 <code>index_specifier_type_list</code>
@@ -578,22 +597,16 @@ Same type as <code>IndexSpecifierList</code>.
 <code>index_type_list</code>
 
 <blockquote>
-Model of
-<a href="../../../../libs/mpl/doc/refmanual/random-access-sequence.html">
-<code>MPL Random Access Sequence</code></a> and
-<a href="../../../../libs/mpl/doc/refmanual/extensible-sequence.html">
-<code>MPL Extensible Sequence</code></a> containing the types of the indices held by
+<a href="../../../../libs/mp11/doc/html/mp11.html#definitions">Mp11 list</a>
+containing the types of the indices held by
 the <code>multi_index_container</code>, in the same order as they were specified.
 </blockquote>
 
 <code>iterator_type_list</code>
 
 <blockquote>
-Model of
-<a href="../../../../libs/mpl/doc/refmanual/random-access-sequence.html">
-<code>MPL Random Access Sequence</code></a> and
-<a href="../../../../libs/mpl/doc/refmanual/extensible-sequence.html">
-<code>MPL Extensible Sequence</code></a> containing the types of the iterators of
+<a href="../../../../libs/mp11/doc/html/mp11.html#definitions">Mp11 list</a>
+containing the types of the iterators of
 the indices held by the <code>multi_index_container</code>, in the same order as they were
 specified.
 </blockquote>
@@ -601,15 +614,28 @@ specified.
 <code>const_iterator_type_list</code>
 
 <blockquote>
-Model of
-<a href="../../../../libs/mpl/doc/refmanual/random-access-sequence.html">
-<code>MPL Random Access Sequence</code></a> and
-<a href="../../../../libs/mpl/doc/refmanual/extensible-sequence.html">
-<code>MPL Extensible Sequence</code></a> containing the types of the constant
+<a href="../../../../libs/mp11/doc/html/mp11.html#definitions">Mp11 list</a>
+containing the types of the constant
 iterators of the indices held by the <code>multi_index_container</code>, in the same order
 as they were specified.
 </blockquote>
 
+<a name="node_type"><code>node_type</code></a>
+
+<blockquote>
+Node handle class following the standard specification at
+<b>[container.node]</b> (version for set containers).
+Two instantiations of <code>multi_index_container</code>
+have compatible nodes (i.e., the same <code>node_type</code>) if and only if
+they are of the form
+<code>multi_index_container&lt;Value,IndexSpecifierList1,Allocator&gt;</code> and
+<code>multi_index_container&lt;Value,IndexSpecifierList2,Allocator&gt;</code>,
+have the same number <code>I</code> of index specifiers, and, for <code>i</code> =
+<code>0</code>, ... , <code>I-1</code>, the respective <code>i</code>-th index specifiers
+refer to the same <a href="indices.html#index_catalog">type of index</a>, regardless
+of unique/non-unique variants and particular configuration type arguments.
+</blockquote>
+
 <h4><a name="nested_templates">Nested class templates</a></h4>
 
 <code>template&lt;int N> struct nth_index</code>
@@ -618,7 +644,7 @@ as they were specified.
 <code>nth_index&lt;N>::type</code> yields the type of the
 <code>N</code>-th (0-based) index held by the <code>multi_index_container</code>, in
 the same order as they were specified.<br>
-<b>Requires:</b> <code>0 &lt;= N &lt; I</code>.
+<b>Requires:</b> <code>0 &lt;= N &lt; I-1</code>.
 </blockquote>
 
 <code>template&lt;typename Tag> struct index</code>
@@ -664,8 +690,16 @@ as an associated tag type.
 
 <h4><a name="constructors">Constructors, copy and assignment</a></h4>
 
+<code>multi_index_container();</code>
+
+<blockquote>
+<b>Effects:</b> Constructs an empty <code>multi_index_container</code> using the
+default values of <code>ctor_args_list</code> and <code>allocator_type</code>.<br>
+<b>Complexity:</b> Constant.
+</blockquote>
+
 <code>explicit multi_index_container(<br>
-&nbsp;&nbsp;const ctor_args_list&amp; args_list=ctor_args_list(),<br>
+&nbsp;&nbsp;const ctor_args_list&amp; args_list,<br>
 &nbsp;&nbsp;const allocator_type&amp; al=allocator_type());</code>
 
 <blockquote>
@@ -685,16 +719,16 @@ specified allocator and the default value of <code>ctor_args_list</code>.<br>
 <code>template&lt;typename InputIterator><br>
 multi_index_container(<br>
 &nbsp;&nbsp;InputIterator first,InputIterator last,<br>
-&nbsp;&nbsp;const ctor_args_list&amp; comp=ctor_args_list(),<br>
+&nbsp;&nbsp;const ctor_args_list&amp; args_list=ctor_args_list(),<br>
 &nbsp;&nbsp;const allocator_type&amp; al=allocator_type());</code>
 
 <blockquote>
-<b>Requires:</b> <code>InputIterator</code> is a model of
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">
-<code>Input Iterator</code></a> over elements of type
-<code>Value</code> or a type convertible to <code>Value</code>.
+<b>Requires:</b> <code>InputIterator</code> is an input iterator.
+<code>Value</code> is
+<code>EmplaceConstructible</code> into <code>multi_index_container</code>
+from <code>*first</code>.
 <code>last</code> is reachable from <code>first</code>.<br> 
-<b>Effects:</b> Constructs and empty <code>multi_index_container</code> using the
+<b>Effects:</b> Constructs an empty <code>multi_index_container</code> using the
 specified argument list and allocator and fills it with
 the elements in the range [<code>first</code>,<code>last</code>).
 Insertion of each element may or may not succeed depending
@@ -703,19 +737,80 @@ on the acceptance by all the indices of the <code>multi_index_container</code>.<
 the number of elements in [<code>first</code>,<code>last</code>).<br>
 </blockquote>
 
+<code>multi_index_container(<br>
+&nbsp;&nbsp;std::initializer_list&lt;Value&gt; list,<br>
+&nbsp;&nbsp;const ctor_args_list&amp; args_list=ctor_args_list(),<br>
+&nbsp;&nbsp;const allocator_type&amp; al=allocator_type());</code>
+
+<blockquote>
+<b>Effects:</b> Equivalent to
+<code>multi_index_container(list.begin(),list.end(),args_list,al)</code>.
+</blockquote>
+
 <code>multi_index_container(<br>
 &nbsp;&nbsp;const multi_index_container&lt;Value,IndexSpecifierList,Allocator>&amp; x);</code>
 
 <blockquote>
+<b>Requires:</b> <code>Value</code> is <code>CopyInsertable</code> into
+<code>multi_index_container</code>.<br>
 <b>Effects:</b> Constructs a copy of <code>x</code>, copying its
-elements as well as its internal objects (key extractors, comparison objects,
-allocator.)<br>
+elements as well as its internal objects (those specified
+in <code>ctor_args_list</code> and the allocator).<br>
 <b>Postconditions:</b> <code>*this==x</code>. The order on every index
 of the <code>multi_index_container</code> is preserved as well.<br>
 <b>Complexity:</b> <code>O(x.size()*log(x.size()) + C(x.size()))</code>.
 </blockquote>
 
+<code>multi_index_container(<br>
+&nbsp;&nbsp;multi_index_container&lt;Value,IndexSpecifierList,Allocator>&amp;&amp; x);</code>
+
+<blockquote>
+<b>Effects:</b> Constructs a <code>multi_index_container</code> by transferring the
+elements of <code>x</code> and copying its internal objects (those specified
+in <code>ctor_args_list</code> and the allocator).<br>
+<b>Postconditions:</b> If <code>x==y</code> just
+before the movement, <code>*this==y</code>. The order on every index
+of the <code>multi_index_container</code> is preserved as well.<br>
+<b>Complexity:</b> Constant.
+</blockquote>
+
+<code>multi_index_container(<br>
+&nbsp;&nbsp;const multi_index_container&lt;Value,IndexSpecifierList,Allocator>&amp; x,<br>
+&nbsp;&nbsp;const allocator_type&amp; al);</code>
+
+<blockquote>
+<b>Requires:</b> <code>Value</code> is <code>CopyInsertable</code> into
+<code>multi_index_container</code>.<br>
+<b>Effects:</b> Constructs a copy of <code>x</code>, copying its
+elements and its internal objects (those specified
+in <code>ctor_args_list</code>) and using a copy of the allocator
+<code>al</code> provided.<br>
+<b>Postconditions:</b> <code>*this==x</code>. The order on every index
+of the <code>multi_index_container</code> is preserved as well.<br>
+<b>Complexity:</b> <code>O(x.size()*log(x.size()) + C(x.size()))</code>.
+</blockquote>
+
+<code>multi_index_container(<br>
+&nbsp;&nbsp;multi_index_container&lt;Value,IndexSpecifierList,Allocator>&amp;&amp; x,<br>
+&nbsp;&nbsp;const allocator_type&amp; al);</code>
+
+<blockquote>
+<b>Requires:</b> <code>Value</code> is <code>MoveInsertable</code> into
+<code>multi_index_container</code>.<br>
+<b>Effects:</b> Constructs a <code>multi_index_container</code> by transferring/moving
+the elements of <code>x</code>, copying its internal objects (those specified
+in <code>ctor_args_list</code>) and using a copy of the allocator
+<code>al</code> provided. If <code>x.get_allocator()==al</code>, elements are transferred
+(no constructions involved), otherwise they are move constructed from <code>x</code>.<br>
+<b>Postconditions:</b> If <code>x==y</code> just
+before the movement, <code>*this==y</code>. The order on every index
+of the <code>multi_index_container</code> is preserved as well.<br>
+<b>Complexity:</b> Constant if <code>x.get_allocator()==al</code>, otherwise
+<code>O(x.size()*log(x.size()) + C(x.size()))</code>.
+</blockquote>
+
 <code>~multi_index_container()</code>
+
 <blockquote>
 <b>Effects:</b> Destroys the <code>multi_index_container</code> and all the elements
 contained. The order in which the elements are destroyed is not specified.<br>
@@ -726,8 +821,14 @@ contained. The order in which the elements are destroyed is not specified.<br>
 &nbsp;&nbsp;const multi_index_container&lt;Value,IndexSpecifierList,Allocator>&amp; x);</code>
 
 <blockquote>
-Replaces the elements and internal objects of the <code>multi_index_container</code>
-with copies from <code>x</code>.<br>
+<b>Requires:</b> <code>Value</code> is <code>CopyInsertable</code> into
+<code>multi_index_container</code>.<br>
+<b>Effects:</b> Replaces the elements and internal objects (those specified
+in <code>ctor_args_list</code>) of the <code>multi_index_container</code>
+with copies from <code>x</code>. The internal allocator is replaced with a
+copy of <code>x.get_allocator()</code> if and only if
+<code>std::allocator_traits&lt;allocator_type>::propagate_on_container_copy_assignment::value</code>
+is <code>true</code>.<br>
 <b>Postconditions:</b> <code>*this==x</code>. The order on every index
 of the <code>multi_index_container</code> is preserved as well.<br>
 <b>Returns:</b> <code>*this</code>.<br>
@@ -737,7 +838,53 @@ C(x.size()))</code>.<br>
 of the types of <code>ctor_args_list</code> do not throw.
 </blockquote>
 
-<code>allocator_type get_allocator()const;</code>
+<code>multi_index_container&lt;Value,IndexSpecifierList,Allocator>&amp; operator=(<br>
+&nbsp;&nbsp;multi_index_container&lt;Value,IndexSpecifierList,Allocator>&amp;&amp; x);</code>
+
+<blockquote>
+<b>Requires:</b> If <code>std::allocator_traits&lt;allocator_type>::propagate_on_container_move_assignment::value</code>
+is <code>true</code>, <code>Value</code> is <code>MoveInsertable</code> into
+<code>multi_index_container</code>.<br>
+<b>Effects:</b> Replaces the elements of <code>multi_index_container</code>
+with those of <code>x</code> or with copies move-constructed from those of <code>x</code>.
+Replaces the internal objects (those specified
+in <code>ctor_args_list</code>) with copies from the
+corresponding objects in <code>x</code>. Replaces the internal allocator with a
+copy of <code>x.get_allocator()</code> if and only if
+<code>std::allocator_traits&lt;allocator_type>::propagate_on_container_move_assignment::value</code>
+is <code>true</code>.
+Elements of <code>x</code> are transferred (no constructions involved) if and only if
+<code>x.get_allocator()</code> is copied or is equal to the previous value of the internal
+allocator.
+<br>
+<b>Postconditions:</b> If <code>x==y</code> just
+before the movement, <code>*this==y</code>. The order on every index
+of the <code>multi_index_container</code> is preserved as well.<br>
+<b>Returns:</b> <code>*this</code>.<br>
+<b>Complexity:</b> <code>O(n)</code> if elements of <code>x</code> are transferred,
+otherwise <code>O(n + x.size()*log(x.size()) + C(x.size()))</code>.<br>
+<b>Exception safety:</b> Strong, provided the copy and assignment operations
+of the types of <code>ctor_args_list</code> do not throw.
+</blockquote>
+
+<code>multi_index_container&lt;Value,IndexSpecifierList,Allocator>&amp; operator=(<br>
+&nbsp;&nbsp;std::initializer_list&lt;Value&gt; list);</code>
+
+<blockquote>
+<b>Requires:</b> <code>Value</code> is <code>CopyInsertable</code> into
+<code>multi_index_container</code>.<br>
+<b>Effects:</b> Replaces the elements of the <code>multi_index_container</code>
+with copies of the elements of <code>list</code>, inserted in the specified order.
+Insertion of each element may or may not succeed depending
+on the acceptance by all the indices of the <code>multi_index_container</code>.<br>
+<b>Returns:</b> <code>*this</code>.<br>
+<b>Complexity:</b> <code>O(n + I(m))</code>, where <code>m</code> is the
+number of elements of <code>list</code>.<br>
+<b>Exception safety:</b> Strong, provided the copy and assignment operations
+of the types of <code>ctor_args_list</code> do not throw.
+</blockquote>
+
+<code>allocator_type get_allocator()const noexcept;</code>
 
 <blockquote>
 Returns a copy of the <code>allocator_type</code> object used to construct
@@ -747,27 +894,25 @@ the <code>multi_index_container</code>.<br>
 
 <h4><a name="index_retrieval">Index retrieval operations</a></h4>
 
-<code>template&lt;int N> typename nth_index&lt;N>::type&amp; get();</code>
+<code>template&lt;int N> typename nth_index&lt;N>::type&amp; get()noexcept;</code>
 
 <blockquote>
-<b>Requires:</b> <code>0 &lt;= N &lt; I</code>.<br>
+<b>Requires:</b> <code>0 &lt;= N &lt; I-1</code>.<br>
 <b>Effects:</b> Returns a reference to the
 <code>nth_index&lt;N>::type</code> index held by <code>*this</code>.<br>
 <b>Complexity:</b> Constant.<br>
-<b>Exception safety:</b> <code>nothrow</code>.
 </blockquote>
 
-<code>template&lt;int N> const typename nth_index&lt;N>::type&amp; get()const;</code>
+<code>template&lt;int N> const typename nth_index&lt;N>::type&amp; get()const noexcept;</code>
 
 <blockquote>
-<b>Requires:</b> <code>0 &lt;= N &lt; I</code>.<br>
+<b>Requires:</b> <code>0 &lt;= N &lt; I-1</code>.<br>
 <b>Effects:</b> Returns a <code>const</code> reference to the
 <code>nth_index&lt;N>::type</code> index held by <code>*this</code>.<br>
 <b>Complexity:</b> Constant.<br>
-<b>Exception safety:</b> <code>nothrow</code>.
 </blockquote>
 
-<code>template&lt;typename Tag> typename index&lt;Tag>::type&amp; get()</code>
+<code>template&lt;typename Tag> typename index&lt;Tag>::type&amp; get()noexcept;</code>
 
 <blockquote>
 <b>Requires:</b> <code>Tag</code> is such that <code>index&lt;Tag>::type</code>
@@ -776,10 +921,9 @@ is valid.<br>
 <code>index&lt;Tag>::type</code> index held by
 <code>*this</code>.<br>
 <b>Complexity:</b> Constant.<br>
-<b>Exception safety:</b> <code>nothrow</code>.
 </blockquote>
 
-<code>template&lt;typename Tag> const typename index&lt;Tag>::type&amp; get()const;</code>
+<code>template&lt;typename Tag> const typename index&lt;Tag>::type&amp; get()const noexcept;</code>
 
 <blockquote>
 <b>Requires:</b> <code>Tag</code> is such that <code>index&lt;Tag>::type</code>
@@ -788,7 +932,6 @@ is valid.<br>
 <code>index&lt;Tag>::type</code> index held by
 <code>*this</code>.<br>
 <b>Complexity:</b> Constant.<br>
-<b>Exception safety:</b> <code>nothrow</code>.
 </blockquote>
 
 <h4><a name="projection">Projection operations</a></h4>
@@ -809,10 +952,10 @@ are <i>equivalent</i> if:
 typename nth_index&lt;N>::type::iterator project(IteratorType it);</code>
 
 <blockquote>
-<b>Requires:</b> <code>0 &lt;= N &lt; I</code>. <code>IteratorType</code>
+<b>Requires:</b> <code>0 &lt;= N &lt; I-1</code>. <code>IteratorType</code>
 belongs to <code>iterator_type_list</code>. <code>it</code> is a valid
 iterator of some index of <code>*this</code> (i.e. does not refer to some
-other <code>multi_index_container</code>.)<br>
+other <code>multi_index_container</code>).<br>
 <b>Effects:</b> Returns an <code>nth_index&lt;N>::type::iterator</code> 
 equivalent to <code>it</code>.<br>
 <b>Complexity:</b> Constant.<br>
@@ -823,7 +966,7 @@ equivalent to <code>it</code>.<br>
 typename nth_index&lt;N>::type::const_iterator project(IteratorType it)const;</code>
 
 <blockquote>
-<b>Requires:</b> <code>0 &lt;= N &lt; I</code>. <code>IteratorType</code>
+<b>Requires:</b> <code>0 &lt;= N &lt; I-1</code>. <code>IteratorType</code>
 belongs to <code>const_iterator_type_list</code> or
 <code>iterator_type_list</code>. <code>it</code> is a
 valid (constant or non-constant) iterator of some index of <code>*this</code>
@@ -842,7 +985,7 @@ typename index&lt;Tag>::type::iterator project(IteratorType it);</code>
 <code>index&lt;Tag>::type</code> is valid. <code>IteratorType</code>
 belongs to <code>iterator_type_list</code>. <code>it</code> is a valid
 iterator of some index of <code>*this</code> (i.e. does not refer to some
-other <code>multi_index_container</code>.)<br>
+other <code>multi_index_container</code>).<br>
 <b>Effects:</b> Returns an <code>index&lt;Tag>::type::iterator</code>
 equivalent to <code>it</code>.<br>
 <b>Complexity:</b> Constant.<br>
@@ -858,7 +1001,7 @@ typename index&lt;Tag>::type::const_iterator project(IteratorType it)const;</cod
 belongs to <code>const_iterator_type_list</code> or
 <code>iterator_type_list</code>. <code>it</code> is a valid
 (constant or non-constant) iterator of some index of <code>*this</code>
-(i.e. does not refer to some other <code>multi_index_container</code>.)<br>
+(i.e. does not refer to some other <code>multi_index_container</code>).<br>
 <b>Effects:</b> Returns an <code>index&lt;Tag>::type::const_iterator</code>
 iterator equivalent to <code>it</code>.<br>
 <b>Complexity:</b> Constant.<br>
@@ -883,8 +1026,7 @@ these, the following concepts are used. A type <code>T</code> is <i>serializable
 archive (XML archive) and later retrieved from an input archive (XML archive) associated to
 the same storage. If <code>x'</code> of type <code>T</code> is loaded from the
 serialization information saved from another object <code>x</code>, we say that
-<code>x'</code> is a <i>restored copy</i> of <code>x</code>. Given a
-<a href="http://www.sgi.com/tech/stl/BinaryPredicate.html"><code>Binary Predicate</code></a>
+<code>x'</code> is a <i>restored copy</i> of <code>x</code>. Given a binary predicate
 <code>Pred</code> over (<code>T</code>, <code>T</code>), and objects <code>p</code>
 and <code>q</code> of type <code>Pred</code>, we say that <code>q</code>
 is <i>serialization-compatible</i> with <code>p</code> if
@@ -901,7 +1043,7 @@ output archive (XML archive) <code>ar</code>.
 
 <blockquote>
 <b>Requires:</b> <code>Value</code> is serializable (XML-serializable). Additionally,
-each of the indices of <code>m</code> can impose another requirements.<br>
+each of the indices of <code>m</code> can impose other requirements.<br>
 <b>Exception safety:</b> Strong with respect to <code>m</code>. If an exception
 is thrown, <code>ar</code> may be left in an inconsistent state.
 </blockquote>
@@ -911,7 +1053,7 @@ input archive (XML archive) <code>ar</code>.
 
 <blockquote>
 <b>Requires:</b> <code>Value</code> is serializable (XML-serializable). Additionally,
-each of the indices of <code>m'</code> can impose another requirements.<br>
+each of the indices of <code>m'</code> can impose other requirements.<br>
 <b>Exception safety:</b> Basic. If an exception is thrown, <code>ar</code> may be
 left in an inconsistent state.
 </blockquote>
@@ -930,9 +1072,9 @@ Index reference
 
 <br>
 
-<p>Revised November 6th 2008</p>
+<p>Revised June 27th 2026</p>
 
-<p>&copy; Copyright 2003-2008 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2026 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/reference/ord_indices.html

@@ -21,8 +21,8 @@ Index reference
 <div class="up_link"><a href="index.html"><img src="../up.gif" alt="Boost.MultiIndex reference" border="0"><br>
 Boost.MultiIndex reference
 </a></div>
-<div class="next_link"><a href="hash_indices.html"><img src="../next.gif" alt="hashed indices" border="0"><br>
-Hashed indices
+<div class="next_link"><a href="rnk_indices.html"><img src="../next.gif" alt="ranked indices" border="0"><br>
+Ranked indices
 </a></div><br clear="all" style="clear: all;">
 
 <hr>
@@ -42,6 +42,7 @@ Hashed indices
         <ul>
           <li><a href="#complexity_signature">Complexity signature</a></li>
           <li><a href="#instantiation_types">Instantiation types</a></li>
+          <li><a href="#types">Nested types</a></li>
           <li><a href="#constructors">Constructors, copy and assignment</a></li>
           <li><a href="#iterators">Iterators</a></li>
           <li><a href="#modifiers">Modifiers</a></li>
@@ -97,6 +98,8 @@ their associated <a href="#ord_indices">ordered index</a> classes.
 <code>"boost/multi_index/ordered_index.hpp"</code></a> synopsis</a></h2>
 
 <blockquote><pre>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>initializer_list</span><span class=special>&gt;</span>
+
 <span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
 
 <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
@@ -190,15 +193,17 @@ together, with minor differences explicitly stated when they exist.
 </p>
 
 <p>
-Except where noted, ordered indices (both unique and non-unique) are models of
-<a href="http://www.sgi.com/tech/stl/SortedAssociativeContainer.html">
-<code>Sorted Associative Container</code></a> and
-<a href="http://www.sgi.com/tech/stl/UniqueAssociativeContainer.html">
-<code>Unique Associative Container</code></a>, much as <code>std::set</code>s
-are. Accordingly, validity of iterators and references to elements is
-preserved. We only provide descriptions of those types and operations that are
-either not present in the concepts modeled or do not exactly conform to the
-requirements for these types of containers.
+Except where noted or if the corresponding interface does not exist,
+ordered indices (both unique and non-unique) satisfy the C++ requirements
+for associative containers at <b>[associative.reqmts]</b>
+(supporting unique and equivalent keys, respectively).
+Iterators (including to the end of the index) and pointers and references to an element
+remain valid during the lifetime of the associated container (which can change
+upon swapping), or until the referred-to element is erased or extracted;
+pointers and references to an extracted element, but not so for iterators,
+become valid again once the element is re-inserted.
+We only provide descriptions of those types and operations that 
+do not exactly conform to or are not mandated by the standard requirements.
 </p>
 
 <blockquote><pre>
@@ -222,7 +227,7 @@ requirements for these types of containers.
   <span class=keyword>typedef</span> <span class=identifier>KeyFromValue</span>                               <span class=identifier>key_from_value</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=identifier>Compare</span>                                    <span class=identifier>key_compare</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>implementation defined                     </b><span class=identifier>value_compare</span><span class=special>;</span>
-  <span class=keyword>typedef</span> <span class=identifier>tuple</span><span class=special>&lt;</span><span class=identifier>key_from_value</span><span class=special>,</span><span class=identifier>key_compare</span><span class=special>&gt;</span>          <span class=identifier>ctor_args</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>tuple</span><span class=special>&lt;</span><span class=identifier>key_from_value</span><span class=special>,</span><span class=identifier>key_compare</span><span class=special>&gt;</span>   <span class=identifier>ctor_args</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=identifier>TagList</span>                                    <span class=identifier>tag_list</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=identifier>Allocator</span>                                  <span class=identifier>allocator_type</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>Allocator</span><span class=special>::</span><span class=identifier>reference</span>              <span class=identifier>reference</span><span class=special>;</span>
@@ -237,49 +242,65 @@ requirements for these types of containers.
     std::reverse_iterator&lt;iterator&gt;</b>                  <span class=identifier>reverse_iterator</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>equivalent to
     std::reverse_iterator&lt;const_iterator&gt;</b>            <span class=identifier>const_reverse_iterator</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>same as owning container                   </b><span class=identifier>node_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>following [container.insert.return] spec   </b><span class=identifier>insert_return_type</span><span class=special>;</span>
 
   <span class=comment>// construct/copy/destroy:</span>
 
   <b>index class name</b><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>=(</span><span class=keyword>const</span> <b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <b>index class name</b><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>=(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
 
-  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// iterators:</span>
 
-  <span class=identifier>iterator</span>               <span class=identifier>begin</span><span class=special>();</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>begin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>iterator</span>               <span class=identifier>end</span><span class=special>();</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>end</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>reverse_iterator</span>       <span class=identifier>rbegin</span><span class=special>();</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>reverse_iterator</span>       <span class=identifier>rend</span><span class=special>();</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>cbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>cend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>iterator</span>               <span class=identifier>begin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>begin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>iterator</span>               <span class=identifier>end</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>end</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>reverse_iterator</span>       <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>reverse_iterator</span>       <span class=identifier>rend</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>cbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>cend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
  
   <span class=identifier>iterator</span>       <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=identifier>const_iterator</span> <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
 
   <span class=comment>// capacity:</span>
 
-  <span class=keyword>bool</span>      <span class=identifier>empty</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>size_type</span> <span class=identifier>size</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>size_type</span> <span class=identifier>max_size</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>bool</span>      <span class=identifier>empty</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>max_size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// modifiers:</span>
 
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>emplace</span><span class=special>(</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
+  <span class=keyword>template</span> <span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>iterator</span> <span class=identifier>emplace_hint</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
   <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>insert</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=identifier>iterator</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>iterator</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>InputIterator</span><span class=special>&gt;</span>
   <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
+  <span class=identifier>insert_return_type</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>node_type</span><span class=special>&amp;&amp;</span> <span class=identifier>nh</span><span class=special>);</span>
+  <span class=identifier>iterator</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>node_type</span><span class=special>&amp;&amp;</span> <span class=identifier>nh</span><span class=special>);</span>
+
+  <span class=identifier>node_type</span> <span class=identifier>extract</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>);</span>
+  <span class=identifier>node_type</span> <span class=identifier>extract</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>key_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
 
   <span class=identifier>iterator</span>  <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>);</span>
   <span class=identifier>size_type</span> <span class=identifier>erase</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>key_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=identifier>iterator</span>  <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
 
   <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>&gt;</span> <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Rollback</span><span class=special>&gt;</span>
   <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>,</span><span class=identifier>Rollback</span> <span class=identifier>back</span><span class=special>);</span>
@@ -288,8 +309,18 @@ requirements for these types of containers.
   <span class=keyword>bool</span> <span class=identifier>modify_key</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>,</span><span class=identifier>Rollback</span> <span class=identifier>back</span><span class=special>);</span>
   
   <span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
-  <span class=keyword>void</span> <span class=identifier>clear</span><span class=special>();</span>
+  <span class=keyword>void</span> <span class=identifier>clear</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
 
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span> <span class=keyword>void</span> <span class=identifier>merge</span><span class=special>(</span><span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>merge</span><span class=special>(</span>
+    <span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>i</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span>
+  <span class=keyword>void</span> <span class=identifier>merge</span><span class=special>(</span>
+    <span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>first</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>last</span><span class=special>);</span>
+      
   <span class=comment>// observers:</span>
 
   <span class=identifier>key_from_value</span> <span class=identifier>key_extractor</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
@@ -309,6 +340,11 @@ requirements for these types of containers.
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
   <span class=identifier>size_type</span> <span class=identifier>count</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
 
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=keyword>bool</span> <span class=identifier>contains</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=keyword>bool</span> <span class=identifier>contains</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
   <span class=identifier>iterator</span> <span class=identifier>lower_bound</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
@@ -407,7 +443,7 @@ section</a>. The complexity signature of ordered indices is:
 <ul>
   <li>copying: <code>c(n)=n*log(n)</code>,</li>
   <li>insertion: <code>i(n)=log(n)</code>,</li>
-  <li>hinted insertion: <code>h(n)=1</code> (constant) if the hint element
+  <li>hinted insertion: <code>h(n)=1</code> (amortized constant) if the hint element
     is immediately after the point of insertion, <code>h(n)=log(n)</code> otherwise,</li>
   <li>deletion: <code>d(n)=1</code> (amortized constant),</li>
   <li>replacement: <code>r(n)=1</code> (constant) if the element position does not
@@ -436,11 +472,20 @@ following types:
 which determines the mechanism for extracting a key from <code>Value</code>,
 must be a model of <a href="key_extraction.html#key_extractors">
 <code>Key Extractor</code></a> from <code>Value</code>. <code>Compare</code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> on elements of
-<code>KeyFromValue::result_type</code>.
+<code>CopyConstructible</code> binary predicate inducing a strict weak order
+on elements of <code>KeyFromValue::result_type</code>.
 </p>
 
+<h4><a name="types">Nested types</a></h4>
+
+<code>iterator<br>
+const_iterator</code>
+
+<blockquote>
+These types depend only on <code>node_type</code> and the position of
+the index in the <code>multi_index_container</code>.
+</blockquote>
+
 <h4><a name="constructors">Constructors, copy and assignment</a></h4>
 
 <p>
@@ -461,6 +506,18 @@ objects to which <code>*this</code> and <code>x</code> belong, respectively.<br>
 <b>Returns:</b> <code>*this</code>.<br>
 </blockquote>
 
+<code><b>index class name</b>&amp; operator=(std::initializer_list&lt;value_type&gt; list);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>a</span><span class=special>=</span><span class=identifier>list</span><span class=special>;</span>
+</pre></blockquote>
+where <code>a</code> is the <code>multi_index_container</code>
+object to which <code>*this</code> belongs.<br>
+<b>Returns:</b> <code>*this</code>.<br>
+</blockquote>
+
 <h4><a name="iterators">Iterators</a></h4>
 
 <code>iterator&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;iterator_to(const value_type&amp; x);<br>
@@ -475,9 +532,65 @@ const_iterator iterator_to(const value_type&amp; x)const;</code>
 
 <h4><a name="modifiers">Modifiers</a></h4>
 
-<code>std::pair&lt;iterator,bool> insert(const value_type&amp; x);</code>
+<code>template&lt;typename... Args&gt;<br>
+std::pair&lt;iterator,bool&gt; emplace(Args&amp;&amp;... args);</code>
 
 <blockquote>
+<b>Requires:</b> <code>value_type</code> is <code>EmplaceConstructible</code>
+into <code>multi_index_container</code> from <code>args</code>.<br>
+<b>Effects:</b> Inserts a <code>value_type</code> object constructed with
+<code>std::forward&lt;Args&gt;(args)...</code> into the <code>multi_index_container</code> to which
+the index belongs if
+<ul>
+  <li>the index is non-unique OR no other element exists with
+    equivalent key,</li>
+  <li>AND insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+</ul>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion took place. On successful insertion,
+<code>p.first</code> points to the element inserted; otherwise, <code>p.first</code>
+points to an element that caused the insertion to be banned. Note that more than
+one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> <code>O(I(n))</code>.<br>
+<b>Exception safety:</b> Strong.<br>
+</blockquote>
+
+<code>template&lt;typename... Args&gt;<br>
+iterator emplace_hint(iterator position, Args&amp;&amp;... args);</code>
+
+<blockquote>
+<b>Requires:</b> <code>value_type</code> is <code>EmplaceConstructible</code>
+into <code>multi_index_container</code> from <code>args</code>.
+<code>position</code> is a valid iterator of the index.<br>
+<b>Effects:</b> Inserts a <code>value_type</code> object constructed with
+<code>std::forward&lt;Args&gt;(args)...</code> into the <code>multi_index_container</code> to which
+the index belongs if
+<ul>
+  <li>the index is non-unique OR no other element exists with
+    equivalent key,</li>
+  <li>AND insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+</ul>
+<code>position</code> is used as a hint to improve the efficiency of the
+operation. If successful, insertion happens as close as possible to the
+location just prior to <code>position</code>.<br>
+<b>Returns:</b> On successful insertion, an iterator to the newly inserted
+element. Otherwise, an iterator to an element that caused the insertion to be
+banned. Note that more than one element can be causing insertion not to be
+allowed.<br>
+<b>Complexity:</b> <code>O(H(n))</code>.<br>
+<b>Exception safety:</b> Strong.<br>
+</blockquote>
+
+<code>std::pair&lt;iterator,bool> insert(const value_type&amp; x);</code><br>
+<code>std::pair&lt;iterator,bool> insert(value_type&amp;&amp; x);</code>
+
+<blockquote>
+<b>Requires (first version):</b> <code>value_type</code> is <code>CopyInsertable</code>
+into <code>multi_index_container</code>.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>MoveInsertable</code>
+into <code>multi_index_container</code>.<br>
 <b>Effects:</b> Inserts <code>x</code> into the <code>multi_index_container</code> to which
 the index belongs if
 <ul>
@@ -495,10 +608,16 @@ one element can be causing insertion not to be allowed.<br>
 <b>Exception safety:</b> Strong.<br>
 </blockquote>
 
-<code>iterator insert(iterator position,const value_type&amp; x);</code>
+<code>iterator insert(iterator position,const value_type&amp; x);</code><br>
+<code>iterator insert(iterator position,value_type&amp;&amp; x);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.<br>
+<b>Requires (first version):</b> <code>value_type</code> is <code>CopyInsertable</code>
+into <code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>MoveInsertable</code>
+into <code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index.<br>
 <b>Effects:</b> Inserts <code>x</code> into the <code>multi_index_container</code> to which
 the index belongs if
 <ul>
@@ -508,7 +627,7 @@ the index belongs if
     <code>multi_index_container</code>.</li>
 </ul>
 <code>position</code> is used as a hint to improve the efficiency of the
-operation. If succesful, insertion happens as close as possible to the
+operation. If successful, insertion happens as close as possible to the
 location just prior to <code>position</code>.<br>
 <b>Returns:</b> On successful insertion, an iterator to the newly inserted
 element. Otherwise, an iterator to an element that caused the insertion to be
@@ -522,28 +641,120 @@ allowed.<br>
 void insert(InputIterator first,InputIterator last);</code>
 
 <blockquote>
-<b>Requires:</b> <code>InputIterator</code> is a model of
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">
-<code>Input Iterator</code></a> over elements of type
-<code>value_type</code> or a type convertible to <code>value_type</code>.
+<b>Requires:</b> <code>InputIterator</code> is an input iterator.
+<code>value_type</code> is <code>EmplaceConstructible</code> into
+<code>multi_index_container</code> from <code>*first</code>.
 <code>first</code> and <code>last</code> are not iterators into any
 index of the <code>multi_index_container</code> to which this index belongs.
 <code>last</code> is reachable from <code>first</code>.<br>
 <b>Effects:</b>
-<blockquote><pre>
-<span class=identifier>iterator</span> <span class=identifier>hint</span><span class=special>=</span><span class=identifier>end</span><span class=special>();</span>
-<span class=keyword>while</span><span class=special>(</span><span class=identifier>first</span><span class=special>!=</span><span class=identifier>last</span><span class=special>)</span><span class=identifier>hint</span><span class=special>=</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>hint</span><span class=special>,*</span><span class=identifier>first</span><span class=special>++);</span>
-</pre></blockquote>
+For each element of [<code>first</code>, <code>last</code>), in this
+order, inserts it into the <code>multi_index_container</code>
+to which this index belongs if
+<ul>
+  <li>the index is non-unique OR no other element exists with
+    equivalent key,</li>
+  <li>AND insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+</ul>
 <b>Complexity:</b> <code>O(m*H(n+m))</code>, where
 <code>m</code> is the number of elements in [<code>first</code>,
 <code>last</code>).<br>
 <b>Exception safety:</b> Basic.<br>
 </blockquote>
 
+<code>void insert(std::initializer_list&lt;value_type&gt; list);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>end</span><span class=special>())</span><span class=special>;</span>
+</pre></blockquote>
+</blockquote>
+
+<code>insert_return_type insert(node_type&amp;&amp; nh);</code>
+
+<blockquote>
+<b>Requires:</b> <code>nh.empty() || get_allocator()==nh.get_allocator()</code>.<br>
+<b>Effects:</b> Does nothing if <code>nh</code> is empty; otherwise,
+inserts the node owned by <code>nh</code> into the
+<code>multi_index_container</code> to which the index belongs if
+<ul>
+  <li>the index is non-unique OR no other element exists with
+    equivalent key,</li>
+  <li>AND insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+</ul>
+<b>Postconditions:</b> <code>nh</code> is empty.<br>
+<b>Returns:</b> A value <code>p</code> of type <code>insert_return_type</code>.
+If <code>nh</code> is empty, <code>p.position</code> is <code>end()</code>,
+<code>p.inserted</code> is <code>false</code> and <code>p.node</code> is empty;
+on successful insertion, <code>p.position</code> points to the element inserted,
+<code>p.inserted</code> is <code>true</code> and <code>p.node</code>
+is empty;
+if the insertion failed, <code>p.position</code> points to an element that caused
+the insertion to be banned, <code>p.inserted</code> is <code>false</code> and
+<code>p.node</code> owns the original node.
+Note that more than one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> <code>O(I(n))</code>.<br>
+<b>Exception safety:</b> Strong. If an exception
+is thrown, <code>nh</code> is not changed.<br>
+</blockquote>
+
+<code>iterator insert(const_iterator position,node_type&amp;&amp; nh);</code>
+
+<blockquote>
+<b>Requires:</b> <code>nh.empty() || get_allocator()==nh.get_allocator()</code>.
+ <code>position</code> is a valid iterator of the index.<br>
+<b>Effects:</b> Does nothing if <code>nh</code> is empty; otherwise,
+inserts the node owned by <code>nh</code> into the
+<code>multi_index_container</code> to which the index belongs if
+<ul>
+  <li>the index is non-unique OR no other element exists with
+    equivalent key,</li>
+  <li>AND insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+</ul>
+<code>position</code> is used as a hint to improve the efficiency of the
+operation. If successful, insertion happens as close as possible to the
+location just prior to <code>position</code>.<br>
+<b>Postconditions:</b> <code>nh</code> is empty if insertion succeeds,
+and is not changed otherwise.<br>
+<b>Returns:</b> <code>end()</code> if <code>nh</code> is empty.
+On successful insertion, an iterator to the newly inserted
+element; otherwise, an iterator to an element that caused the insertion to be
+banned. Note that more than one element can be causing insertion not to be
+allowed.<br>
+<b>Complexity:</b> <code>O(H(n))</code>.<br>
+<b>Exception safety:</b> Strong. If an exception
+is thrown, <code>nh</code> is not changed.<br>
+</blockquote>
+
+<code>node_type extract(const_iterator position);</code>
+
+<blockquote>
+<b>Requires:</b> <code>position</code> is a valid dereferenceable iterator
+of the index.<br>
+<b>Effects:</b> Extracts the node of the element pointed to by <code>position</code>.<br>
+<b>Returns:</b> A node handle owning the extracted node.<br>
+<b>Complexity:</b> <code>O(D(n))</code>.<br>
+<b>Exception safety:</b> <code>nothrow</code>.<br>
+</blockquote>
+
+<code>node_type extract(const key_type&amp; x);</code>
+
+<blockquote>
+<b>Effects:</b> Extracts the node of the first element
+with key equivalent to <code>x</code>, if there is any.<br>
+<b>Returns:</b> A node handle owning the extracted node, or empty otherwise.<br>
+<b>Complexity:</b> <code>O(log(n) + D(n))</code>.<br>
+<b>Exception safety:</b> Strong.<br>
+</blockquote>
+    
 <code>iterator erase(iterator position);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid dereferenceable  iterator
+<b>Requires:</b> <code>position</code> is a valid dereferenceable iterator
 of the index.<br>
 <b>Effects:</b> Deletes the element pointed to by <code>position</code>.<br>
 <b>Returns:</b> An iterator pointing to the element immediately following
@@ -575,11 +786,14 @@ the number of elements in [<code>first</code>,<code>last</code>).<br>
 <b>Exception safety:</b> <code>nothrow</code>.<br>
 </blockquote>
 
-<a name="replace"><code>bool replace(iterator position,const value_type&amp; x);</code></a>
+<a name="replace"><code>bool replace(iterator position,const value_type&amp; x);</code></a><br>
+<code>bool replace(iterator position,value_type&amp;&amp; x);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid dereferenceable  iterator
-of the index.<br>
+<b>Requires (first version):</b> <code>value_type</code> is <code>CopyAssignable</code>.
+<code>position</code> is a valid dereferenceable iterator of the index.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>MoveAssignable</code>.
+<code>position</code> is a valid dereferenceable iterator of the index.<br>
 <b>Effects:</b> Assigns the value <code>x</code> to the element pointed
 to by <code>position</code> into the <code>multi_index_container</code> to which
 the index belongs if, for the value <code>x</code>
@@ -604,11 +818,14 @@ belongs remains in its original state.
 <code>template&lt;typename Modifier> bool modify(iterator position,Modifier mod);</code></a>
 
 <blockquote>
-<b>Requires:</b> <code>Modifier</code> is a model of
-<a href="http://www.sgi.com/tech/stl/UnaryFunction.html">
-<code>Unary Function</code></a> accepting arguments of type
+<b>Requires:</b> <code>mod</code> is a unary function object
+accepting arguments of type
 <code>value_type&amp;</code>. <code>position</code> is a valid dereferenceable
-iterator of the index.<br>
+iterator of the index.
+The execution of <code>mod(e)</code>, where <code>e</code> is the element
+pointed to by <code>position</code>, does not invoke any operation of the
+<code>multi_index_container</code> after <code>e</code> is directly modified
+or, before modification, if the operation would invalidate <code>position</code>.<br>
 <b>Effects:</b> Calls <code>mod(e)</code> where <code>e</code> is the element
 pointed to by <code>position</code> and rearranges <code>*position</code> into
 all the indices of the <code>multi_index_container</code>. Rearrangement is successful if
@@ -626,7 +843,7 @@ original value, the position of the element does not change.<br>
 otherwise.<br>
 <b>Complexity:</b> <code>O(M(n))</code>.<br>
 <b>Exception safety:</b> Basic. If an exception is thrown by some
-user-provided operation (except possibly <code>mod</code>), then
+user-provided operation (including <code>mod</code>), then
 the element pointed to by <code>position</code> is erased.
 </blockquote>
 
@@ -634,14 +851,16 @@ the element pointed to by <code>position</code> is erased.
 bool modify(iterator position,Modifier mod,Rollback back);</code>
 
 <blockquote>
-<b>Requires:</b> <code>Modifier</code> and <code>Rollback</code> are models of
-<a href="http://www.sgi.com/tech/stl/UnaryFunction.html">
-<code>Unary Function</code></a> accepting arguments of type
+<b>Requires:</b> <code>mod</code> and <code>back</code> are unary function
+objects accepting arguments of type
 <code>value_type&amp;</code>. <code>position</code> is a valid dereferenceable
-iterator of the index. The sequence of operations <code>mod(e)</code>,
-<code>back(e)</code>, where <code>e</code> is the element
-pointed to by <code>position</code>, restores all keys of the element
-to their original state.<br>
+iterator of the index.
+The execution of <code>mod(e)</code>, where <code>e</code> is the element
+pointed to by <code>position</code>, does not invoke any operation of the
+<code>multi_index_container</code> after <code>e</code> is directly modified
+or, before modification, if the operation would invalidate <code>position</code>.
+<code>back(e)</code> does not invoke any operation of the
+<code>multi_index_container</code>.<br>
 <b>Effects:</b> Calls <code>mod(e)</code> where <code>e</code> is the element
 pointed to by <code>position</code> and tries to rearrange <code>*position</code> into
 all the indices of the <code>multi_index_container</code>. Rearrangement is successful if
@@ -651,8 +870,9 @@ all the indices of the <code>multi_index_container</code>. Rearrangement is succ
   <li>AND rearrangement is allowed by all other indices of the
     <code>multi_index_container</code>.</li>
 </ul>
-If the rearrangement fails, <code>back(e)</code> is invoked and the
-element is kept at its original position in all indices.<br>
+If the rearrangement fails, <code>back(e)</code> is invoked: if the resulting value
+of <code>e</code> is consistent with its original position and constraints in all
+indices, the element is kept, otherwise it is erased.<br>
 <b>Postconditions:</b> Validity of <code>position</code> is preserved except if
 the element is erased under the conditions described below.
 If the key of the modified value is equivalent to that of the
@@ -660,8 +880,10 @@ original value, the position of the element does not change.<br>
 <b>Returns:</b> <code>true</code> if the operation succeeded, <code>false</code>
 otherwise.<br>
 <b>Complexity:</b> <code>O(M(n))</code>.<br>
-<b>Exception safety:</b> Strong, except if <code>back</code> throws an
-exception, in which case the modified element is erased. If <code>back</code>
+<b>Exception safety:</b> Strong, except if <code>mod</code> or <code>back</code> throw an
+exception or <code>back(e)</code> fails to properly restore the element or there is
+a throwing user-provided operation after invoking <code>back(e)</code>, in which cases
+the modified element is erased. If <code>back</code>
 throws inside the handling code executing after some other user-provided
 operation has thrown, it is the exception generated by <code>back</code> that
 is rethrown.
@@ -673,11 +895,14 @@ is rethrown.
 <blockquote>
 <b>Requires:</b> <code>key_from_value</code> is a read/write
 <a href="key_extraction.html#key_extractors"><code>Key Extractor</code></a>
-from <code>value_type</code>. <code>Modifier</code> is a model of
-<a href="http://www.sgi.com/tech/stl/UnaryFunction.html">
-<code>Unary Function</code></a> accepting arguments of type
+from <code>value_type</code>. <code>mod</code> is a
+unary function object accepting arguments of type
 <code>key_type&amp;</code>. <code>position</code> is a valid dereferenceable
-iterator of the index.<br>
+iterator of the index.
+The execution of <code>mod(k)</code>, where <code>k</code> is the key of the element
+pointed to by <code>position</code>, does not invoke any operation of the
+<code>multi_index_container</code> after <code>k</code> is directly modified
+or, before modification, if the operation would invalidate <code>position</code>.<br>
 <b>Effects:</b> Equivalent to <code>modify(position,mod')</code>,
 with <code>mod'</code> defined in such a way that
 <code>mod'(x)</code> is the same as <code>mod(key(x))</code>, where
@@ -690,14 +915,16 @@ bool modify_key(iterator position,Modifier mod,Rollback back);</code>
 <blockquote>
 <b>Requires:</b> <code>key_from_value</code> is a read/write
 <a href="key_extraction.html#key_extractors"><code>Key Extractor</code></a>
-from <code>value_type</code>. <code>Modifier</code> and <code>Rollback</code>
-are models of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html">
-<code>Unary Function</code></a> accepting arguments of type
+from <code>value_type</code>. <code>mod</code> and <code>back</code>
+are unary function objects accepting arguments of type
 <code>key_type&amp;</code>. <code>position</code> is a valid dereferenceable
 iterator of the index.
-The sequence of operations <code>mod(k)</code>,
-<code>back(k)</code>, where <code>k</code> is the key of the element
-pointed to by <code>position</code>, restores k to its original state.<br>
+The execution of <code>mod(k)</code>, where <code>k</code> is the key of the element
+pointed to by <code>position</code>, does not invoke any operation of the
+<code>multi_index_container</code> after <code>k</code> is directly modified
+or, before modification, if the operation would invalidate <code>position</code>.
+<code>back(k)</code> does not invoke any operation of the
+<code>multi_index_container</code>.<br>
 <b>Effects:</b> Equivalent to <code>modify(position,mod',back')</code>,
 with <code>mod'</code> and <code>back</code> defined in such a way that
 <code>mod'(x)</code> is the same as <code>mod(key(x))</code> and
@@ -705,6 +932,89 @@ with <code>mod'</code> and <code>back</code> defined in such a way that
 <code>key</code> is the internal <code>KeyFromValue</code> object of the index.
 </blockquote>
 
+<a name="merge"><code>template&lt;typename Index&gt; void merge(Index&amp;&amp; x);</code></a>
+
+<blockquote>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>. <code>get_allocator()==x.get_allocator()</code>.<br>
+<b>Effects:</b> 
+<blockquote><pre>
+<span class=identifier>merge</span><span class=special>(</span><span class=identifier>x</span><span class=special>,</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+</pre></blockquote>
+</blockquote>
+
+<code>
+template&lt;typename Index&gt; std::pair&lt;iterator,bool&gt; merge(<br>
+&nbsp;&nbsp;Index&amp;&amp; x,typename std::remove_reference_t&lt;Index&gt;::const_iterator i);
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>. <code>get_allocator()==x.get_allocator()</code>.
+<code>i</code> is a valid dereferenceable iterator of <code>x</code>.<br>
+<b>Effects:</b> Does nothing if the source and destination containers are the same;
+otherwise, transfers the node of the element referred to by <code>i</code> into the
+<code>multi_index_container</code> to which the destination index belongs if
+<ul>
+  <li>the index is non-unique OR no other element exists with
+    equivalent key,</li>
+  <li>AND insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+</ul>
+Note that no element is copied or destroyed in the process.<br>
+<b>Postconditions:</b> If transfer succeeds, for any index in the source container
+having the same <code>iterator</code>/<code>const_iterator</code> types as the corresponding
+index in the destination container, iterators referring to <code>*i</code>
+remain valid and behave as iterators of the destination index.<br>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if transfer took place or the source and destination
+containers are the same. If <code>p.second</code> is <code>true</code>,
+<code>p.first</code> points to <code>*i</code>; otherwise, <code>p.first</code>
+points to an element that caused the insertion to be banned. Note that more than
+one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> If the source and destination containers are the same,
+constant; otherwise, <code>O(I(n)+D(x.size()))</code>.<br>
+<b>Exception safety:</b> If the source and destination containers are the same,
+<code>nothrow</code>; otherwise strong.
+</blockquote>
+
+<code>
+template&lt;typename Index&gt; void merge(<br>
+&nbsp;&nbsp;Index&amp;&amp; x,<br>
+&nbsp;&nbsp;typename std::remove_reference_t&lt;Index&gt;::const_iterator first,<br>
+&nbsp;&nbsp;typename std::remove_reference_t&lt;Index&gt;::const_iterator last);
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>. <code>get_allocator()==x.get_allocator()</code>.
+[<code>first</code>,<code>last</code>) is a valid range of <code>x</code>.<br>
+<b>Effects:</b> Does nothing if the source and destination containers are the same;
+otherwise, for each node in [<code>first</code>,<code>last</code>), in this order,
+the node is transferred to the <code>multi_index_container</code> to which the
+destination index belongs if
+<ul>
+  <li>the index is non-unique OR no other element exists with
+    equivalent key,</li>
+  <li>AND insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+</ul>
+Note that no element is copied or destroyed in the process.<br>
+<b>Postconditions:</b> For any index in the source container having the same
+<code>iterator</code>/<code>const_iterator</code> types as the corresponding
+index in the destination container, iterators referring to the transferred elements
+remain valid and behave as iterators of the destination index.<br>
+<b>Complexity:</b> If the source and destination containers are the same,
+constant; otherwise, <code>O(m*(I(n+m)+D(x.size())))</code>, where
+<code>m</code> is the number of elements in [<code>first</code>,
+<code>last</code>).<br>
+<b>Exception safety:</b> If the source and destination containers are the same,
+<code>nothrow</code>; otherwise basic.
+</blockquote>
+
 <h4><a name="observers">Observers</a></h4>
 
 <p>Apart from standard <code>key_comp</code> and <code>value_comp</code>,
@@ -724,10 +1034,7 @@ the index.<br>
 
 <p>
 Ordered indices provide the full lookup functionality required by
-<a href="http://www.sgi.com/tech/stl/SortedAssociativeContainer.html">
-<code>Sorted Associative Containers</code></a> and
-<a href="http://www.sgi.com/tech/stl/UniqueAssociativeContainer.html">
-<code>Unique Associative Containers</code></a>, namely <code>find</code>,
+<b>[associative.reqmts]</b>, namely <code>find</code>,
 <code>count</code>, <code>lower_bound</code>, <code>upper_bound</code>
 and <code>equal_range</code>. Additionally, these member functions are
 templatized to allow for non-standard arguments, so extending
@@ -737,20 +1044,14 @@ concept.
 </p>
 
 <p>
-Consider a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> <code>Compare</code> over values
-of type <code>Key</code>. A pair of types (<code>CompatibleKey</code>, 
+Consider a binary predicate <code>Compare</code> inducing a strict
+weak order over values of type <code>Key</code>. A pair of types (<code>CompatibleKey</code>, 
 <code>CompatibleCompare</code>) is said to be a <i>compatible extension</i>
 of <code>Compare</code> if
 <ol>
-  <li><code>CompatibleCompare</code> is a
-    <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">
-    <code>Binary Predicate</code></a> over (<code>Key</code>,
+  <li><code>CompatibleCompare</code> is a binary predicate over (<code>Key</code>,
     <code>CompatibleKey</code>),</li>
-  <li><code>CompatibleCompare</code> is a
-    <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">
-    <code>Binary Predicate</code></a> over (<code>CompatibleKey</code>,
+  <li><code>CompatibleCompare</code> is a binary predicate over (<code>CompatibleKey</code>,
     <code>Key</code>),</li>
   <li>if <code>c_comp(ck,k1)</code> then <code>!c_comp(k1,ck)</code>,</li>
   <li>if <code>!c_comp(ck,k1)</code> and <code>!comp(k1,k2)</code> then
@@ -803,8 +1104,8 @@ is a compatible extension of <code>key_compare</code>.<br>
 <b>Complexity:</b> <code>O(log(n))</code>.<br>
 </blockquote>
 
-<code>template&lt;typename CompatibleKey> size_type<br>
-count(const CompatibleKey&amp; x)const;
+<code>template&lt;typename CompatibleKey><br>
+size_type count(const CompatibleKey&amp; x)const;
 </code>
 
 <blockquote>
@@ -825,6 +1126,28 @@ is a compatible extension of <code>key_compare</code>.<br>
 <b>Complexity:</b> <code>O(log(n) + count(x,comp))</code>.<br>
 </blockquote>
 
+<code>template&lt;typename CompatibleKey><br>
+bool contains(const CompatibleKey&amp; x)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>CompatibleKey</code> is a compatible key of
+<code>key_compare</code>.<br>
+<b>Effects:</b> Returns <code>true</code> iff there is some element with key equivalent to <code>x</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey,typename CompatibleCompare><br>
+bool contains(const CompatibleKey&amp; x,const CompatibleCompare&amp; comp)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> (<code>CompatibleKey</code>, <code>CompatibleCompare</code>)
+is a compatible extension of <code>key_compare</code>.<br>
+<b>Effects:</b> Returns <code>true</code> iff there is some element with key equivalent to <code>x</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
 <code>template&lt;typename CompatibleKey><br>
 iterator lower_bound(const CompatibleKey&amp; x)const;
 </code>
@@ -913,15 +1236,11 @@ are modeled after the following concepts.
 </p>
 
 <p>
-Consider a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> <code>Compare</code> over values
-of type <code>Key</code>. A type <code>LowerBounder</code> is said to be
+Consider a binary predicate <code>Compare</code> inducing a strict
+weak order over values of type <code>Key</code>. A type <code>LowerBounder</code> is said to be
 a <i>lower bounder</i> of <code>Compare</code> if
 <ol>
-  <li><code>LowerBounder</code> is a
-    <a href="http://www.sgi.com/tech/stl/Predicate.html">
-    <code>Predicate</code></a> over <code>Key</code>,</li>
+  <li><code>LowerBounder</code> is a predicate over <code>Key</code>,</li>
   <li>if <code>lower(k1)</code> and <code>!comp(k2,k1)</code> then
     <code>lower(k2)</code>,</li>
 </ol>
@@ -930,9 +1249,7 @@ for every <code>lower</code> of type <code>LowerBounder</code>,
 <code>k2</code> of type <code>Key</code>. Similarly, an <i>upper bounder</i>
 is a type <code>UpperBounder</code> such that
 <ol>
-  <li><code>UpperBounder</code> is a
-    <a href="http://www.sgi.com/tech/stl/Predicate.html">
-    <code>Predicate</code></a> over <code>Key</code>,</li>
+  <li><code>UpperBounder</code> is a predcate over <code>Key</code>,</li>
   <li>if <code>upper(k1)</code> and <code>!comp(k1,k2)</code> then
     <code>upper(k2)</code>,</li>
 </ol>
@@ -986,7 +1303,7 @@ input archive (XML archive) <code>ar</code>.
 <b>Requires:</b> Additionally to the general requirements, <code>value_comp()</code>
 must be serialization-compatible with <code>m.get&lt;i&gt;().value_comp()</code>,
 where <code>i</code> is the position of the ordered index in the container.<br>
-<b>Postconditions:</b> On succesful loading, each of the elements of
+<b>Postconditions:</b> On successful loading, each of the elements of
 [<code>begin()</code>, <code>end()</code>) is a restored copy of the corresponding
 element in [<code>m.get&lt;i&gt;().begin()</code>, <code>m.get&lt;i&gt;().end()</code>).
 </blockquote>
@@ -1003,11 +1320,11 @@ Operation: loading of an <code>iterator</code> or <code>const_iterator</code>
 <code>it'</code> from an input archive (XML archive) <code>ar</code>.
 
 <blockquote>
-<b>Postconditions:</b> On succesful loading, if <code>it</code> was dereferenceable
+<b>Postconditions:</b> On successful loading, if <code>it</code> was dereferenceable
 then <code>*it'</code> is the restored copy of <code>*it</code>, otherwise
 <code>it'==end()</code>.<br>
 <b>Note:</b> It is allowed that <code>it</code> be a <code>const_iterator</code>
-and the restored <code>it'</code> an <code>iterator</code>, or viceversa.
+and the restored <code>it'</code> an <code>iterator</code>, or vice versa.
 </blockquote>
 
 <hr>
@@ -1018,15 +1335,15 @@ Index reference
 <div class="up_link"><a href="index.html"><img src="../up.gif" alt="Boost.MultiIndex reference" border="0"><br>
 Boost.MultiIndex reference
 </a></div>
-<div class="next_link"><a href="hash_indices.html"><img src="../next.gif" alt="hashed indices" border="0"><br>
-Hashed indices
+<div class="next_link"><a href="rnk_indices.html"><img src="../next.gif" alt="ranked indices" border="0"><br>
+Ranked indices
 </a></div><br clear="all" style="clear: all;">
 
 <br>
 
-<p>Revised December 21st 2009</p>
+<p>Revised February 5th 2022</p>
 
-<p>&copy; Copyright 2003-2009 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2022 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/reference/rnd_indices.html

@@ -40,6 +40,7 @@ Key extraction
         <ul>
           <li><a href="#complexity_signature">Complexity signature</a></li>
           <li><a href="#instantiation_types">Instantiation types</a></li>
+          <li><a href="#types">Nested types</a></li>
           <li><a href="#constructors">Constructors, copy and assignment</a></li>
           <li><a href="#iterators">Iterators</a></li>
           <li><a href="#capacity">Capacity operations</a></li>
@@ -92,6 +93,8 @@ its associated <a href="#rnd_indices">random access index</a> class.
 <code>"boost/multi_index/random_access_index.hpp"</code></a> synopsis</a></h2>
 
 <blockquote><pre>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>initializer_list</span><span class=special>&gt;</span>
+
 <span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
 
 <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
@@ -156,38 +159,40 @@ random access indices includes that of
 <a href="seq_indices.html">sequenced indices</a>, with differences in
 the complexity of the operations, plus extra operations for
 positional access (<code>operator[]</code> and <code>at()</code>) and
-for capacity handling. Validity of iterators and references to elements
-is preserved in all operations, regardless of the capacity status.
+for capacity handling.
+Iterators (including to the end of the index) and pointers and references to an element
+remain valid during the lifetime of the associated container (which can change
+upon swapping) regardless of the capacity status, or until the referred-to element
+is erased or extracted; pointers and references to an extracted element,
+but not so for iterators, become valid again once the element is re-inserted.
 </p>
 
 <p>
-As is the case with sequenced indices, random access indices have the
-following limitations with respect to STL sequence containers:
+Except where noted or if the corresponding interface does not exist, random access
+indices verify the same container requirements as <code>std::vector</code>
+plus the requirements for <code>std::list</code> specific list operations at
+<b>[list.ops]</b>. Some of the most important differences with respect to
+<code>std::vector</code> are:
 <ul>
-  <li>Random access indices are not <a href="http://www.sgi.com/tech/stl/Assignable.html">
-    <code>Assignable</code></a> (like any other index.)</li>
-  <li>Insertions into a random access index  may fail due to clashings
-    with other indices. This alters the semantics of the operations
-    provided with respect to their analogues in STL sequence containers.
+  <li>Random access indices do not provide memory contiguity, and hence do not
+    have <code>data</code> member functions. 
+  </li>
+
+  <li>The complexities of some operations, notably insertion and deletion, differ
+    from those of <code>std::vector</code>.
+  </li>
+  <li>Unlike as in <code>std::vector</code>, insertions into a random access index
+    may fail due to clashings with other indices. This alters the semantics
+    of the operations provided with respect to their analogues in
+    <code>std::vector</code>.
   </li>
   <li>Elements in a random access index are not mutable, and can only be changed
-    by means of <a href="#replace"><code>replace</code></a> and
+    in place by means of <a href="#replace"><code>replace</code></a> and
 	<a href="#modify"><code>modify</code></a> member functions.
   </li>
-</ul>
-Having these restrictions into account, random access indices are models
-of <a href="http://www.sgi.com/tech/stl/RandomAccessContainer.html">
-<code>Random Access Container</code></a> and
-<a href="http://www.sgi.com/tech/stl/BackInsertionSequence.html">
-<code>Back Insertion Sequence</code></a>. Although these indices do
-not model
-<a href="http://www.sgi.com/tech/stl/FrontInsertionSequence.html">
-<code>Front Insertion Sequence</code></a>, because front insertion
-and deletion take linear time, front operations are nonetheless provided
-to match the interface of sequenced indices.
-We only describe those types and operations that are 
-either not present in the concepts modeled or do not exactly conform
-to the requirements for these types of containers.
+  <li><code>push_front</code> and <code>pop_front</code> are provided for
+    compatibility with sequenced indices, even though they take linear time to execute.
+  </li></ul>
 </p>
 
 <blockquote><pre>
@@ -203,60 +208,66 @@ to the requirements for these types of containers.
 <span class=keyword>public</span><span class=special>:</span>
   <span class=comment>// types:</span>
 
-  <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>node_type</span><span class=special>::</span><span class=identifier>value_type</span>             <span class=identifier>value_type</span><span class=special>;</span>
-  <span class=keyword>typedef</span> <span class=identifier>tuples</span><span class=special>::</span><span class=identifier>null_type</span>                          <span class=identifier>ctor_args</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>Value</span>                                      <span class=identifier>value_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>tuples</span><span class=special>::</span><span class=identifier>null_type</span>                   <span class=identifier>ctor_args</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=identifier>TagList</span>                                    <span class=identifier>tag_list</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=identifier>Allocator</span>                                  <span class=identifier>allocator_type</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>reference</span>         <span class=identifier>reference</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>const_reference</span>   <span class=identifier>const_reference</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>implementation defined</b>                     <span class=identifier>iterator</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>implementation defined</b>                     <span class=identifier>const_iterator</span><span class=special>;</span>
-  <span class=keyword>typedef</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>size_t</span>                                <span class=identifier>size_type</span><span class=special>;</span>      
-  <span class=keyword>typedef</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>ptrdiff_t</span>                             <span class=identifier>difference_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>implementation defined</b>                     <span class=identifier>size_type</span><span class=special>;</span>      
+  <span class=keyword>typedef</span> <b>implementation defined</b>                     <span class=identifier>difference_type</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>pointer</span>           <span class=identifier>pointer</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>const_pointer</span>     <span class=identifier>const_pointer</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>equivalent to
     std::reverse_iterator&lt;iterator&gt;</b>                  <span class=identifier>reverse_iterator</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>equivalent to
     std::reverse_iterator&lt;const_iterator&gt;</b>            <span class=identifier>const_reverse_iterator</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>same as owning container                   </b><span class=identifier>node_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>following [container.insert.return] spec   </b><span class=identifier>insert_return_type</span><span class=special>;</span>
 
   <span class=comment>// construct/copy/destroy:</span>
 
   <b>index class name</b><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>=(</span><span class=keyword>const</span> <b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <b>index class name</b><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>=(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
 
   <span class=keyword>template</span> <span class=special>&lt;</span><span class=keyword>class</span> <span class=identifier>InputIterator</span><span class=special>&gt;</span>
   <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>)</span>
   <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>value</span><span class=special>);</span>
     
-  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// iterators:</span>
 
-  <span class=identifier>iterator</span>               <span class=identifier>begin</span><span class=special>();</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>begin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>iterator</span>               <span class=identifier>end</span><span class=special>();</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>end</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>reverse_iterator</span>       <span class=identifier>rbegin</span><span class=special>();</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>reverse_iterator</span>       <span class=identifier>rend</span><span class=special>();</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>cbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>cend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>iterator</span>               <span class=identifier>begin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>begin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>iterator</span>               <span class=identifier>end</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>end</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>reverse_iterator</span>       <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>reverse_iterator</span>       <span class=identifier>rend</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>cbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>cend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=identifier>iterator</span>       <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=identifier>const_iterator</span> <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
 
   <span class=comment>// capacity:</span>
 
-  <span class=keyword>bool</span>      <span class=identifier>empty</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>size_type</span> <span class=identifier>size</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>size_type</span> <span class=identifier>max_size</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>size_type</span> <span class=identifier>capacity</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>bool</span>      <span class=identifier>empty</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>max_size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>capacity</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
   <span class=keyword>void</span>      <span class=identifier>reserve</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>m</span><span class=special>);</span>
+  <span class=keyword>void</span>      <span class=identifier>shrink_to_fit</span><span class=special>();</span>
 
-  <span class=keyword>void</span> <span class=identifier>resize</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>=</span><span class=identifier>value_type</span><span class=special>());</span>
+  <span class=keyword>void</span> <span class=identifier>resize</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>resize</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
 
   <span class=comment>// access:</span>
 
@@ -267,34 +278,55 @@ to the requirements for these types of containers.
 
   <span class=comment>// modifiers:</span>
 
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>emplace_front</span><span class=special>(</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
   <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>push_front</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>push_front</span><span class=special>(</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>void</span>                     <span class=identifier>pop_front</span><span class=special>();</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>emplace_back</span><span class=special>(</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
   <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>push_back</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>push_back</span><span class=special>(</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>void</span>                     <span class=identifier>pop_back</span><span class=special>();</span>
 
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>emplace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
   <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>size_type</span> <span class=identifier>m</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>InputIterator</span><span class=special>&gt;</span>
   <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
+  <span class=identifier>insert_return_type</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>node_type</span><span class=special>&amp;&amp;</span> <span class=identifier>nh</span><span class=special>);</span>
+
+  <span class=identifier>node_type</span> <span class=identifier>extract</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>);</span>
 
   <span class=identifier>iterator</span> <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>);</span>
   <span class=identifier>iterator</span> <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
 
   <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>&gt;</span> <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Rollback</span><span class=special>&gt;</span>
   <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>,</span><span class=identifier>Rollback</span> <span class=identifier>back</span><span class=special>);</span>
 
   <span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
 
-  <span class=keyword>void</span> <span class=identifier>clear</span><span class=special>();</span>
+  <span class=keyword>void</span> <span class=identifier>clear</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// list operations:</span>
 
-  <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
-  <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>i</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span> <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>splice</span><span class=special>(</span>
+    <span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>i</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span>
   <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span>
-    <span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
+    <span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>first</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>last</span><span class=special>);</span>
 
   <span class=keyword>void</span> <span class=identifier>remove</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>value</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Predicate</span><span class=special>&gt;</span> <span class=keyword>void</span> <span class=identifier>remove_if</span><span class=special>(</span><span class=identifier>Predicate</span> <span class=identifier>pred</span><span class=special>);</span>
@@ -309,7 +341,7 @@ to the requirements for these types of containers.
   <span class=keyword>void</span> <span class=identifier>sort</span><span class=special>();</span>
   <span class=keyword>template</span> <span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Compare</span><span class=special>&gt;</span> <span class=keyword>void</span> <span class=identifier>sort</span><span class=special>(</span><span class=identifier>Compare</span> <span class=identifier>comp</span><span class=special>);</span>
 
-  <span class=keyword>void</span> <span class=identifier>reverse</span><span class=special>();</span>
+  <span class=keyword>void</span> <span class=identifier>reverse</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// rearrange operations:</span>
 
@@ -407,7 +439,7 @@ of the complexity formulas:
 
 <p>
 (<code>shl</code> and <code>rel</code> stand for <i>shift left</i> and
-<i>relocate</i>, respectively.)
+<i>relocate</i>, respectively).
 </p>
 
 <h4><a name="instantiation_types">Instantiation types</a></h4>
@@ -425,6 +457,16 @@ index specifier. Instantiations are dependent on the following types:
 <a href="indices.html#tag"><code>tag</code></a>.
 </p>
 
+<h4><a name="types">Nested types</a></h4>
+
+<code>iterator<br>
+const_iterator</code>
+
+<blockquote>
+These types depend only on <code>node_type</code> and the position of
+the index in the <code>multi_index_container</code>.
+</blockquote>
+    
 <h4><a name="constructors">Constructors, copy and assignment</a></h4>
 
 <p>
@@ -445,17 +487,22 @@ objects to which <code>*this</code> and <code>x</code> belong, respectively.<br>
 <b>Returns:</b> <code>*this</code>.<br>
 </blockquote>
 
+<code><b>index class name</b>&amp; operator=(std::initializer_list&lt;value_type&gt; list);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>a</span><span class=special>=</span><span class=identifier>list</span><span class=special>;</span>
+</pre></blockquote>
+where <code>a</code> is the <code>multi_index_container</code>
+object to which <code>*this</code> belongs.<br>
+<b>Returns:</b> <code>*this</code>.<br>
+</blockquote>
+
 <code>template &lt;class InputIterator><br>
 void assign(InputIterator first,InputIterator last);</code>
 
 <blockquote>
-<b>Requires:</b> <code>InputIterator</code> is a model of
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">
-<code>Input Iterator</code></a> over elements of type
-<code>value_type</code> or a type convertible to <code>value_type</code>.
-<code>first</code> and <code>last</code> are not iterators into any
-index of the <code>multi_index_container</code> to which this index belongs.
-<code>last</code> is reachable from <code>first</code>.<br>
 <b>Effects:</b>
 <blockquote><pre>
 <span class=identifier>clear</span><span class=special>();</span>
@@ -463,6 +510,15 @@ index of the <code>multi_index_container</code> to which this index belongs.
 </pre></blockquote>
 </blockquote>
 
+<code>void assign(std::initializer_list&lt;value_type&gt; list);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>assign</span><span class=special>(</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+</pre></blockquote>
+</blockquote>
+    
 <code>void assign(size_type n,const value_type&amp; value);</code>
 
 <blockquote>
@@ -487,19 +543,20 @@ const_iterator iterator_to(const value_type&amp; x)const;</code>
 
 <h4><a name="capacity">Capacity operations</a></h4>
 
-<a name="capacity_memfun"><code>size_type capacity()const;</code></a>
+<a name="capacity_memfun"><code>size_type capacity()const noexcept;</code></a>
 
 <blockquote>
 <b>Returns:</b> The total number of elements <code>c</code> such that, when
 <code>size()&lt;c</code>, back insertions happen in constant time (the
 general case as described by
 <a href="#complexity_signature"><code>i(n)</code></a> is <i>amortized</i>
-constant time.)<br>
+constant time).<br>
 <b>Note:</b> Validity of iterators and references to elements
 is preserved in all insertions, regardless of the capacity status.
 </blockquote>
 
 <a name="reserve"><code>void reserve(size_type m);</code></a>
+
 <blockquote>
 <b>Effects:</b> If the previous value of <code>capacity()</code>
 was greater than or equal to <code>m</code>, nothing is done;
@@ -511,52 +568,123 @@ otherwise <code>O(n)</code>.<br>
 otherwise, strong.<br>
 </blockquote>
 
-<code>void resize(size_type n,const value_type&amp; x=value_type());</code>
+<code>void shrink_to_fit();</code>
 
 <blockquote>
-<b>Effects:</b>
-<blockquote><pre>
-<span class=keyword>if</span><span class=special>(</span><span class=identifier>n</span><span class=special>&gt;</span><span class=identifier>size</span><span class=special>())</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>n</span><span class=special>-</span><span class=identifier>size</span><span class=special>(),</span><span class=identifier>x</span><span class=special>);</span>
-<span class=keyword>else</span> <span class=keyword>if</span><span class=special>(</span><span class=identifier>n</span><span class=special>&lt;</span><span class=identifier>size</span><span class=special>())</span><span class=identifier>erase</span><span class=special>(</span><span class=identifier>begin</span><span class=special>()+</span><span class=identifier>n</span><span class=special>,</span><span class=identifier>end</span><span class=special>());</span>
-</pre></blockquote>
+<b>Effects:</b> Reduces <code>capacity()</code> to <code>size()</code>.<br> 
+<b>Complexity:</b> If the capacity is not changed, constant;
+otherwise <code>O(n)</code>.<br>
+<b>Exception safety:</b> If the capacity is not changed, <code>nothrow</code>;
+otherwise, strong.<br>
+</blockquote>
+
+<code>void resize(size_type n);<br>
+void resize(size_type n,const value_type&amp; x);</code>
+
+<blockquote>
+<b>Requires (first version):</b> <code>value_type</code> is <code>DefaultInsertable</code>
+into <code>multi_index_container</code>.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>CopyInsertable</code>
+into <code>multi_index_container</code>.<br>
+<b>Effects:</b> If <code>size()&lt;n</code>, tries to append <code>n-size()</code> default-inserted
+elements (first version) or copies of <code>x</code> (second version) at the end of
+the index. If <code>n&lt;size()</code>, erases the last <code>size()-n</code> elements.<br>
 <b>Note:</b> If an expansion is requested, the size of the index is not guaranteed
-to be <code>n</code> after this operation (other indices may ban insertions.)
+to be <code>n</code> after this operation (other indices may ban insertions).
 </blockquote>
 
 <h4><a name="modifiers">Modifiers</a></h4>
 
-<code>std::pair&lt;iterator,bool> push_front(const value_type&amp; x);</code>
+<code>template&lt;typename... Args&gt;<br>
+std::pair&lt;iterator,bool&gt; emplace_front(Args&amp;&amp;... args);</code>
 
 <blockquote>
-<b>Effects:</b> Inserts <code>x</code> at the beginning of the sequence if
-no other index of the <code>multi_index_container</code> bans the insertion.<br>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>emplace</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>forward</span><span class=special>&lt;</span><span class=identifier>Args</span><span class=special>&gt;(</span><span class=identifier>args</span><span class=special>)...);</span>
+</pre></blockquote>
 <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
 is <code>true</code> if and only if insertion took place. On successful
 insertion, <code>p.first</code> points to the element inserted; otherwise,
 <code>p.first</code> points to an element that caused the insertion to be banned.
 Note that more than one element can be causing insertion not to be allowed.<br>
-<b>Complexity:</b> <code>O(n+I(n))</code>.<br>
-<b>Exception safety:</b> Strong.
 </blockquote>
-  
-<code>std::pair&lt;iterator,bool> push_back(const value_type&amp; x);</code>
+
+<code>std::pair&lt;iterator,bool> push_front(const value_type&amp; x);</code><br>
+<code>std::pair&lt;iterator,bool> push_front(value_type&amp;&amp; x);</code>
 
 <blockquote>
-<b>Effects:</b> Inserts <code>x</code> at the end of the sequence if
-no other index of the <code>multi_index_container</code> bans the insertion.<br>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>);</span>            <span class=comment>// lvalue ref version</span>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>move</span><span class=special>(</span><span class=identifier>x</span><span class=special>));</span> <span class=comment>// rvalue ref version</span>
+</pre></blockquote>
 <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
 is <code>true</code> if and only if insertion took place. On successful
 insertion, <code>p.first</code> points to the element inserted; otherwise,
 <code>p.first</code> points to an element that caused the insertion to be banned.
 Note that more than one element can be causing insertion not to be allowed.<br>
-<b>Complexity:</b> <code>O(I(n))</code>.<br>
-<b>Exception safety:</b> Strong.
 </blockquote>
 
-<code>std::pair&lt;iterator,bool> insert(iterator position,const value_type&amp; x);</code>
+<code>template&lt;typename... Args&gt;<br>
+std::pair&lt;iterator,bool&gt; emplace_back(Args&amp;&amp;... args);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.<br>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>emplace</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>forward</span><span class=special>&lt;</span><span class=identifier>Args</span><span class=special>&gt;(</span><span class=identifier>args</span><span class=special>)...);</span>
+</pre></blockquote>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion took place. On successful
+insertion, <code>p.first</code> points to the element inserted; otherwise,
+<code>p.first</code> points to an element that caused the insertion to be banned.
+Note that more than one element can be causing insertion not to be allowed.<br>
+</blockquote>
+
+<code>std::pair&lt;iterator,bool> push_back(const value_type&amp; x);</code><br>
+<code>std::pair&lt;iterator,bool> push_back(value_type&amp;&amp; x);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>x</span><span class=special>);</span>            <span class=comment>// lvalue ref version</span>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>move</span><span class=special>(</span><span class=identifier>x</span><span class=special>));</span> <span class=comment>// rvalue ref version</span>
+</pre></blockquote>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion took place. On successful
+insertion, <code>p.first</code> points to the element inserted; otherwise,
+<code>p.first</code> points to an element that caused the insertion to be banned.
+Note that more than one element can be causing insertion not to be allowed.<br>
+</blockquote>
+
+<code>template&lt;typename... Args&gt;<br>
+ std::pair&lt;iterator,bool&gt; emplace(iterator position,Args&amp;&amp;... args);</code>
+
+<blockquote>
+<b>Requires:</b> <code>value_type</code> is <code>EmplaceConstructible</code>
+into <code>multi_index_container</code> from <code>args</code>.<br>
+<b>Effects:</b> Inserts a <code>value_type</code> object constructed with
+<code>std::forward&lt;Args&gt;(args)...</code> before <code>position</code> if insertion
+is allowed by all other indices of the <code>multi_index_container</code>.<br>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion took place. On successful insertion,
+<code>p.first</code> points to the element inserted; otherwise, <code>p.first</code>
+points to an element that caused the insertion to be banned. Note that more than
+one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> <code>O(shl(end()-position,1) + I(n))</code>.<br>
+<b>Exception safety:</b> Strong.<br>
+</blockquote>
+
+<code>std::pair&lt;iterator,bool> insert(iterator position,const value_type&amp; x);</code><br>
+<code>std::pair&lt;iterator,bool> insert(iterator position,value_type&amp;&amp; x);</code>
+
+<blockquote>
+<b>Requires (first version):</b> <code>value_type</code> is <code>CopyInsertable</code>
+into <code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>MoveInsertable</code>
+into <code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index.<br>
 <b>Effects:</b> Inserts <code>x</code> before <code>position</code> if insertion
 is allowed by all other indices of the <code>multi_index_container</code>.<br>
 <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
@@ -584,23 +712,66 @@ void insert(iterator position,InputIterator first,InputIterator last);</code>
 
 <blockquote>
 <b>Requires:</b> <code>position</code> is a valid iterator of the index.
-<code>InputIterator</code> is a model of
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">
-<code>Input Iterator</code></a> over elements of type
-<code>value_type</code> or a type convertible to <code>value_type</code>.
+<code>InputIterator</code> is an input iterator.
+<code>value_type</code> is
+<code>EmplaceConstructible</code> into
+<code>multi_index_container</code> from <code>*first</code>.
 <code>first</code> and <code>last</code> are not iterators into any
 index of the <code>multi_index_container</code> to which this index belongs.
 <code>last</code> is reachable from <code>first</code>.<br>
 <b>Effects:</b>
-<blockquote><pre>
-<span class=keyword>while</span><span class=special>(</span><span class=identifier>first</span><span class=special>!=</span><span class=identifier>last</span><span class=special>)</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>position</span><span class=special>,*</span><span class=identifier>first</span><span class=special>++);</span>
-</pre></blockquote>
+For each element of [<code>first</code>, <code>last</code>), in this
+order, inserts it before <code>position</code> if insertion is allowed by all
+other indices of the <code>multi_index_container</code>.<br>
 <b>Complexity:</b> <code>O(shl(end()-position,m) + m*I(n+m))</code>,
 where <code>m</code> is the number of elements in
 [<code>first</code>,<code>last</code>).<br>
 <b>Exception safety:</b> Basic.
 </blockquote>
 
+<code>void insert(iterator position,std::initializer_list&lt;value_type&gt; list);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>position</span><span class=special>,</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+</pre></blockquote>
+</blockquote>
+    
+<code>insert_return_type insert(const_iterator position,node_type&amp;&amp; nh);</code>
+
+<blockquote>
+<b>Requires:</b> <code>nh.empty() || get_allocator()==nh.get_allocator()</code>.<br>
+<b>Effects:</b> Does nothing if <code>nh</code> is empty; otherwise,
+inserts the node owned by <code>nh</code> before <code>position</code> if insertion
+is allowed by all other indices of the <code>multi_index_container</code>.<br>
+<b>Postconditions:</b> <code>nh</code> is empty.<br>
+<b>Returns:</b> A value <code>p</code> of type <code>insert_return_type</code>.
+If <code>nh</code> is empty, <code>p.position</code> is <code>end()</code>,
+<code>p.inserted</code> is <code>false</code> and <code>p.node</code> is empty;
+on successful insertion, <code>p.position</code> points to the element inserted,
+<code>p.inserted</code> is <code>true</code> and <code>p.node</code>
+is empty;
+if the insertion failed, <code>p.position</code> points to an element that caused
+the insertion to be banned, <code>p.inserted</code> is <code>false</code> and
+<code>p.node</code> owns the original node.
+Note that more than one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> <code>O(shl(end()-position,1) + I(n))</code>.<br>
+<b>Exception safety:</b> Strong. If an exception
+is thrown, <code>nh</code> is not changed.<br>
+</blockquote>
+
+<code>node_type extract(const_iterator position);</code>
+
+<blockquote>
+<b>Requires:</b> <code>position</code> is a valid dereferenceable iterator
+of the index.<br>
+<b>Effects:</b> Extracts the node of the element pointed to by <code>position</code>.<br>
+<b>Returns:</b> A node handle owning the extracted node.<br>
+<b>Complexity:</b> <code>O(D(n))</code>.<br>
+<b>Exception safety:</b> <code>nothrow</code>.<br>
+</blockquote>
+    
 <code>iterator erase(iterator position);</code>
 
 <blockquote>
@@ -626,11 +797,14 @@ the number of elements in [<code>first</code>,<code>last</code>).<br>
 <b>Exception safety:</b> <code>nothrow</code>.<br>
 </blockquote>
 
-<a name="replace"><code>bool replace(iterator position,const value_type&amp; x);</code></a>
+<a name="replace"><code>bool replace(iterator position,const value_type&amp; x);</code></a><br>
+<code>bool replace(iterator position,value_type&amp;&amp; x);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid dereferenceable  iterator
-of the index.<br>
+<b>Requires (first version):</b> <code>value_type</code> is <code>CopyAssignable</code>.
+<code>position</code> is a valid dereferenceable iterator of the index.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>MoveAssignable</code>.
+<code>position</code> is a valid dereferenceable iterator of the index.<br>
 <b>Effects:</b> Assigns the value <code>x</code> to the element pointed
 to by <code>position</code> into the <code>multi_index_container</code> to which
 the index belongs if replacing is allowed by all other indices of the
@@ -649,24 +823,27 @@ belongs remains in its original state.
 <code>template&lt;typename Modifier> bool modify(iterator position,Modifier mod);</code></a>
 
 <blockquote>
-<b>Requires:</b> <code>Modifier</code> is a model of
-<a href="http://www.sgi.com/tech/stl/UnaryFunction.html">
-<code>Unary Function</code></a> accepting arguments of type
+<b>Requires:</b> <code>mod</code> is a unary function object
+accepting arguments of type
 <code>value_type&amp;</code>. <code>position</code> is a valid dereferenceable
-iterator of the index.<br>
+iterator of the index.
+The execution of <code>mod(e)</code>, where <code>e</code> is the element
+pointed to by <code>position</code>, does not invoke any operation of the
+<code>multi_index_container</code> after <code>e</code> is directly modified
+or, before modification, if the operation would invalidate <code>position</code>.<br>
 <b>Effects:</b> Calls <code>mod(e)</code> where <code>e</code> is the element
 pointed to by <code>position</code> and rearranges <code>*position</code> into
-all the indices of the <code>multi_index_container</code>. Rearrangement on
-random access indices does not change the position of the element with respect
-to the index; rearrangement on other indices may or might not succeed. If the
-rearrangement fails, the element is erased.<br>
+all the indices of the <code>multi_index_container</code>. Rearrangement on sequenced
+indices does not change the position of the element with respect to the index;
+rearrangement on other indices may or might not succeed. If the rearrangement
+fails, the element is erased.<br>
 <b>Postconditions:</b> Validity of <code>position</code> is preserved if the
 operation succeeds.<br>
 <b>Returns:</b> <code>true</code> if the operation succeeded, <code>false</code>
 otherwise.<br>
 <b>Complexity:</b> <code>O(M(n))</code>.<br>
 <b>Exception safety:</b> Basic. If an exception is thrown by some
-user-provided operation (except possibly <code>mod</code>), then
+user-provided operation (including <code>mod</code>), then
 the element pointed to by <code>position</code> is erased.
 </blockquote>
 
@@ -674,28 +851,33 @@ the element pointed to by <code>position</code> is erased.
 bool modify(iterator position,Modifier mod,Rollback back);</code>
 
 <blockquote>
-<b>Requires:</b> <code>Modifier</code> and <code>Rollback</code> are models of
-<a href="http://www.sgi.com/tech/stl/UnaryFunction.html">
-<code>Unary Function</code></a> accepting arguments of type
+<b>Requires:</b> <code>mod</code> and <code>back</code> are unary function
+objects accepting arguments of type
 <code>value_type&amp;</code>. <code>position</code> is a valid dereferenceable
-iterator of the index. The sequence of operations <code>mod(e)</code>,
-<code>back(e)</code>, where <code>e</code> is the element
-pointed to by <code>position</code>, restores all keys of the element
-to their original state.<br>
+iterator of the index.
+The execution of <code>mod(e)</code>, where <code>e</code> is the element
+pointed to by <code>position</code>, does not invoke any operation of the
+<code>multi_index_container</code> after <code>e</code> is directly modified
+or, before modification, if the operation would invalidate <code>position</code>.
+<code>back(e)</code> does not invoke any operation of the
+<code>multi_index_container</code>.<br>
 <b>Effects:</b> Calls <code>mod(e)</code> where <code>e</code> is the element
 pointed to by <code>position</code> and tries to rearrange <code>*position</code> into
-all the indices of the <code>multi_index_container</code>. Rearrangement on
-random access  indices does not change the position of the element with respect
-to the index; rearrangement on other indices may or might not succeed. If the
-rearrangement fails, <code>back(e)</code> is invoked and the
-element is kept at its original position in all indices.<br>
+all the indices of the <code>multi_index_container</code>. Rearrangement on sequenced
+indices does not change the position of the element with respect to the index;
+rearrangement on other indices may or might not succeed.
+If the rearrangement fails, <code>back(e)</code> is invoked: if the resulting value
+of <code>e</code> is consistent with its original position and constraints in all
+indices, the element is kept, otherwise it is erased.<br>
 <b>Postconditions:</b> Validity of <code>position</code> is preserved except if
 the element is erased under the conditions described below.<br>
 <b>Returns:</b> <code>true</code> if the operation succeeded, <code>false</code>
 otherwise.<br>
 <b>Complexity:</b> <code>O(M(n))</code>.<br>
-<b>Exception safety:</b> Strong, except if <code>back</code> throws an
-exception, in which case the modified element is erased. If <code>back</code>
+<b>Exception safety:</b> Strong, except if <code>mod</code> or <code>back</code> throw an
+exception or <code>back(e)</code> fails to properly restore the element or there is
+a throwing user-provided operation after invoking <code>back(e)</code>, in which cases
+the modified element is erased. If <code>back</code>
 throws inside the handling code executing after some other user-provided
 operation has thrown, it is the exception generated by <code>back</code> that
 is rethrown.
@@ -710,56 +892,116 @@ The syntax and behavior of these operations exactly matches those
 of sequenced indices, but the associated complexity bounds differ in general.
 </p>
 
-<code>void splice(iterator position,<b>index class name</b>&amp; x);</code>
+    <code>template&lt;typename Index&gt; void splice(const_iterator position,Index&amp;&amp; x);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.
-<code>&amp;x!=this</code>.<br>
-<b>Effects:</b> Inserts the contents of <code>x</code> before <code>position</code>,
-in the same order as they were in <code>x</code>. Those elements succesfully
-inserted are erased from <code>x</code>.<br>
-<b>Complexity:</b> <code>O(shl(end()-position,x.size()) + x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
-<b>Exception safety:</b> Basic.<br>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index, and must be exactly <code>end()</code>
+if the source and destination containers are the same.<br>
+<b>Effects:</b> 
+<blockquote><pre>
+<span class=identifier>splice</span><span class=special>(</span><span class=identifier>position</span><span class=special>,</span><span class=identifier>x</span><span class=special>,</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+</pre></blockquote>
 </blockquote>
 
-<code>void splice(iterator position,<b>index class name</b>&amp; x,iterator i);</code>
+<code>
+template&lt;typename Index&gt; std::pair&lt;iterator,bool&gt; splice(<br>
+&nbsp;&nbsp;const_iterator position,Index&amp;&amp; x,<br>
+&nbsp;&nbsp;typename std::remove_reference_t&lt;Index&gt;::const_iterator i);
+</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.
-<code>i</code> is a valid dereferenceable iterator <code>x</code>.<br>
-<b>Effects:</b> Inserts the element pointed to by <code>i</code> before
-<code>position</code>: if insertion is succesful, the element is erased from
-<code>x</code>. In the special case <code>&amp;x==this</code>, no copy or
-deletion is performed, and the operation is always succesful. If
-<code>position==i</code>, no operation is performed.<br>
-<b>Postconditions:</b> If <code>&amp;x==this</code>, no iterator or reference
-is invalidated.<br>
-<b>Complexity:</b> If <code>&amp;x==this</code>, <code>O(rel(position,i,i+1))</code>;
-otherwise <code>O(shl(end()-position,1) + I(n) + D(n))</code>.<br>
-<b>Exception safety:</b> If <code>&amp;x==this</code>, <code>nothrow</code>;
-otherwise, strong.<br>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>.
+If <code>get_allocator()!=x.get_allocator()</code>,
+<code>value_type</code> must be <code>CopyInsertable</code> into the destination
+<code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index.
+<code>i</code> is a valid dereferenceable iterator of <code>x</code>.<br>
+<b>Effects:</b> 
+<ul>
+  <li><b>(Same container)</b> if the source and destination containers are the same, repositions
+    the element pointed to by <code>i</code> before <code>position</code> unless both
+    iterators refer to the same element.</li>
+  <li><b>(Transfer splice)</b> else, if <code>get_allocator()==x.get_allocator()</code>,
+    transfers the node of the element referred to by <code>i</code> into the
+    destination <code>multi_index_container</code> right before <code>position</code>
+    if insertion is allowed by all other indices of the <code>multi_index_container</code>.</li>
+  <li><b>(Destructive splice)</b> else, insertion of <code>*i</code> is tried before
+    <code>position</code>; if the operation is successful, the element is erased from <code>x</code>. 
+  </li>
+</ul>
+<b>Postconditions:</b> If transfer succeeds, for any index in the source container
+having the same <code>iterator</code>/<code>const_iterator</code> types as the corresponding
+index in the destination container, iterators referring to <code>*i</code>
+remain valid and behave as iterators of the destination index.<br>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion (either through transfer or copy insertion)
+took place or the source and destination containers are the same.
+If <code>p.second</code> is <code>true</code>,
+<code>p.first</code> points to the inserted element or to <code>*i</code> if the
+source and destination containers are the same; otherwise, <code>p.first</code>
+points to an element that caused the insertion to be banned. Note that more than
+one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> If the source and destination containers are the same,
+<code>O(rel(position,i',i'+1))</code>, where <code>i'</code> is the projection
+of <code>i</code> into the index of <code>position</code>;
+otherwise, <code>O(shl(end()-position,1) + I(n) + D(x.size()))</code>.<br>
+<b>Exception safety:</b> If the source and destination containers are the same,
+<code>nothrow</code>; otherwise strong.<br>
+<b>Implementation note:</b> The destructive variant of this operation is provided
+for reasons of backwards compatibility with previous versions of this library where
+allocator equality was not required. 
 </blockquote>
 
-<code>void splice(iterator position,<b>index class name&amp;</b> x,iterator first,iterator last);</code>
+<code>
+template&lt;typename Index&gt; void splice(<br>
+&nbsp;&nbsp;const_iterator position,Index&amp;&amp; x,<br>
+&nbsp;&nbsp;typename std::remove_reference_t&lt;Index&gt;::const_iterator first,<br>
+&nbsp;&nbsp;typename std::remove_reference_t&lt;Index&gt;::const_iterator last);
+</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.
-<code>first</code> and <code>last</code> are valid iterators of <code>x</code>.
-<code>last</code> is reachable from <code>first</code>. <code>position</code>
-is not in the range [<code>first</code>,<code>last</code>).<br>
-<b>Effects:</b> For each element in the range [<code>first</code>,<code>last</code>),
-insertion is tried before <code>position</code>; if the operation is succesful,
-the element is erased from <code>x</code>. In the special case
-<code>&amp;x==this</code>, no copy or deletion is performed, and insertions are
-always succesful.<br>
-<b>Postconditions:</b> If <code>&amp;x==this</code>, no iterator or reference
-is invalidated.<br>
-<b>Complexity:</b> If <code>&amp;x==this</code>,
-<code>O(rel(position,first,last))</code>; otherwise
-<code>O(shl(end()-position,m) + m*I(n+m) + m*D(x.size()))</code>
-where <code>m</code> is the number of elements in [<code>first</code>,<code>last</code>).<br>
-<b>Exception safety:</b> If <code>&amp;x==this</code>, <code>nothrow</code>;
-otherwise, basic.<br>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>.
+If <code>get_allocator()!=x.get_allocator()</code>,
+<code>value_type</code> must be <code>CopyInsertable</code> into the destination
+<code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index and does not point to any element in
+[<code>first</code>,<code>last</code>).
+[<code>first</code>,<code>last</code>) is a valid range of <code>x</code>.<br>
+<b>Effects:</b> 
+<ul>
+  <li><b>(Same container)</b> if the source and destination containers are the same, repositions all the elements
+    of [<code>first</code>,<code>last</code>), in this order, before <code>position</code>.
+  </li>
+  <li><b>(Transfer splice)</b> else, if <code>get_allocator()==x.get_allocator()</code>, then, for each node in
+    [<code>first</code>,<code>last</code>), in this order, the node is transferred to the
+    <code>multi_index_container</code> right before <code>position</code>
+    if insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+  <li><b>(Destructive splice)</b> else, for each element in [<code>first</code>,<code>last</code>), in this order,
+    insertion is tried before <code>position</code>; if the operation is successful, the
+    element is erased from <code>x</code>. 
+  </li>
+</ul>
+<b>Postconditions:</b> For any index in the source container having the same
+<code>iterator</code>/<code>const_iterator</code> types as the corresponding
+index in the destination container, iterators referring to the transferred elements
+remain valid and behave as iterators of the destination index.<br>
+<b>Complexity:</b> If <code>&amp;x==this</code>, <code>O(rel(position,first,last))</code>;
+else, if the source and destination containers are the same, <code>O(n)</code>;
+otherwise, <code>O(shl(end()-position,m) + m*(I(n+m) + D(x.size())))</code>, where
+<code>m</code> is the number of elements in [<code>first</code>,<code>last</code>).<br>
+<b>Exception safety:</b> If the source and destination containers are the same,
+<code>nothrow</code>; otherwise basic.<br>
+<b>Implementation note:</b> The destructive variant of this operation is provided
+for reasons of backwards compatibility with previous versions of this library where
+allocator equality was not required. 
 </blockquote>
 
 <code>void remove(const value_type&amp; value);</code>
@@ -808,21 +1050,22 @@ is the number of elements erased.<br>
 <code>void merge(index class name&amp; x);</code>
 
 <blockquote>
-<b>Requires:</b> <code>std::less&lt;value_type></code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> over <code>value_type</code>.
+<b>Requires:</b>
+Either <code>get_allocator()==x.get_allocator()</code> or <code>value_type</code>
+is <code>CopyInsertable</code> into the <code>multi_index_container</code>.
+<code>std::less&lt;value_type&gt;</code> induces a
+strict weak ordering over <code>value_type</code>.
 Both the index and <code>x</code> are sorted according to
-<code>std::less&lt;value_type></code>.<br>
-<b>Effects:</b> Attempts to insert every element of <code>x</code> into the
-corresponding position of the index (according to the order). Elements
-successfully inserted are erased from <code>x</code>. The resulting sequence
+<code>std::less&lt;value_type&gt;</code>.<br>
+<b>Effects:</b> Attempts to splice every element of <code>x</code> into the
+corresponding position of the index (according to the order). The resulting sequence
 is stable, i.e. equivalent elements of either container preserve their
 relative position. In the special case <code>&amp;x==this</code>, no operation
 is performed.<br>
 <b>Postconditions:</b> Elements in the index and remaining elements in
 <code>x</code> are sorted.
-Validity of iterators to the index and of non-erased elements of <code>x</code>
-references is preserved.<br>
+Validity of iterators and references is preserved, except to elements removed
+from <code>x</code> if <code>get_allocator()!=x.get_allocator()</code>.<br>
 <b>Complexity:</b> If <code>&amp;x==this</code>, constant; otherwise
 <code>O(n + x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
 <b>Exception safety:</b> If <code>&amp;x==this</code>, <code>nothrow</code>;
@@ -832,20 +1075,20 @@ otherwise, basic.<br>
 <code>template &lt;typename Compare> void merge(index class name&amp; x,Compare comp);</code>
 
 <blockquote>
-<b>Requires:</b> <code>Compare</code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> over <code>value_type</code>.
+<b>Requires:</b>
+Either <code>get_allocator()==x.get_allocator()</code> or <code>value_type</code>
+is <code>CopyInsertable</code> into the <code>multi_index_container</code>.
+<code>Compare</code> induces a strict weak ordering over <code>value_type</code>.
 Both the index and <code>x</code> are sorted according to <code>comp</code>.<br>
-<b>Effects:</b> Attempts to insert every element of <code>x</code> into the
-corresponding position of the index (according to <code>comp</code>).
-Elements successfully inserted are erased from <code>x</code>. The resulting
+<b>Effects:</b> Attempts to splice every element of <code>x</code> into the
+corresponding position of the index (according to <code>comp</code>). The resulting
 sequence is stable, i.e. equivalent elements of either container preserve
 their relative position. In the special case <code>&amp;x==this</code>, no
 operation is performed.<br>
 <b>Postconditions:</b> Elements in the index and remaining elements in
 <code>x</code> are sorted according to <code>comp</code>.
-Validity of iterators to the index and of non-erased elements of <code>x</code>
-references is preserved.<br>
+Validity of iterators and references is preserved, except to elements removed
+from <code>x</code> if <code>get_allocator()!=x.get_allocator()</code>.<br>
 <b>Complexity:</b> If <code>&amp;x==this</code>, constant; otherwise
 <code>O(n + x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
 <b>Exception safety:</b> If <code>&amp;x==this</code>, <code>nothrow</code>;
@@ -855,9 +1098,8 @@ otherwise, basic.<br>
 <code>void sort();</code>
 
 <blockquote>
-<b>Requires:</b> <code>std::less&lt;value_type></code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> over <code>value_type</code>.<br>
+<b>Requires:</b> <code>std::less&lt;value_type&gt;</code> induces a
+strict weark ordering over <code>value_type</code>.<br>
 <b>Effects:</b> Sorts the index according to
 <code>std::less&lt;value_type></code>. The sorting is stable, i.e.
 equivalent elements preserve their relative position.<br>
@@ -869,9 +1111,8 @@ equivalent elements preserve their relative position.<br>
 <code>template &lt;typename Compare> void sort(Compare comp);</code>
 
 <blockquote>
-<b>Requires:</b> <code>Compare</code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> over <code>value_type</code>.<br>
+<b>Requires:</b> <code>Compare</code> induces a
+strict weak ordering over <code>value_type</code>.<br>
 <b>Effects:</b> Sorts the index according to <code>comp</code>. The sorting
 is stable, i.e. equivalent elements preserve their relative position.<br>
 <b>Postconditions:</b> Validity of iterators and references is preserved.<br>
@@ -879,13 +1120,12 @@ is stable, i.e. equivalent elements preserve their relative position.<br>
 <b>Exception safety:</b> Basic.
 </blockquote>
 
-<code>void reverse();</code>
+<code>void reverse()noexcept;</code>
 
 <blockquote>
 <b>Effects:</b> Reverses the order of the elements in the index.<br>
 <b>Postconditions:</b> Validity of iterators and references is preserved.<br>
 <b>Complexity:</b> <code>O(n)</code>.<br>
-<b>Exception safety:</b> <code>nothrow</code>.
 </blockquote>
 
 <h4><a name="rearrange_operations">Rearrange operations</a></h4>
@@ -961,7 +1201,7 @@ input archive (XML archive) <code>ar</code>.
 
 <blockquote>
 <b>Requires:</b> No additional requirements to those imposed by the container.<br>
-<b>Postconditions:</b> On succesful loading, each of the elements of
+<b>Postconditions:</b> On successful loading, each of the elements of
 [<code>begin()</code>, <code>end()</code>) is a restored copy of the corresponding
 element in [<code>m.get&lt;i&gt;().begin()</code>, <code>m.get&lt;i&gt;().end()</code>),
 where <code>i</code> is the position of the random access index in the container.
@@ -979,11 +1219,11 @@ Operation: loading of an <code>iterator</code> or <code>const_iterator</code>
 <code>it'</code> from an input archive (XML archive) <code>ar</code>.
 
 <blockquote>
-<b>Postconditions:</b> On succesful loading, if <code>it</code> was dereferenceable
+<b>Postconditions:</b> On successful loading, if <code>it</code> was dereferenceable
 then <code>*it'</code> is the restored copy of <code>*it</code>, otherwise
 <code>it'==end()</code>.<br>
 <b>Note:</b> It is allowed that <code>it</code> be a <code>const_iterator</code>
-and the restored <code>it'</code> an <code>iterator</code>, or viceversa.
+and the restored <code>it'</code> an <code>iterator</code>, or vice versa.
 </blockquote>
 
 <hr>
@@ -1000,9 +1240,9 @@ Key extraction
 
 <br>
 
-<p>Revised July 21st 2009</p>
+<p>Revised August 30th 2021</p>
 
-<p>&copy; Copyright 2003-2009 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2021 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/reference/rnk_indices.html

@@ -0,0 +1,712 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0.1 Transitional//EN">
+
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Boost.MultiIndex Documentation - Ranked indices reference</title>
+<link rel="stylesheet" href="../style.css" type="text/css">
+<link rel="start" href="../index.html">
+<link rel="prev" href="indices.html">
+<link rel="up" href="index.html">
+<link rel="next" href="hash_indices.html">
+</head>
+
+<body>
+<h1><img src="../../../../boost.png" alt="boost.png (6897 bytes)" align=
+"middle" width="277" height="86">Boost.MultiIndex Ranked indices reference</h1>
+
+<div class="prev_link"><a href="ord_indices.html"><img src="../prev.gif" alt="ordered_indices" border="0"><br>
+Ordered indices
+</a></div>
+<div class="up_link"><a href="index.html"><img src="../up.gif" alt="Boost.MultiIndex reference" border="0"><br>
+Boost.MultiIndex reference
+</a></div>
+<div class="next_link"><a href="hash_indices.html"><img src="../next.gif" alt="hashed indices" border="0"><br>
+Hashed indices
+</a></div><br clear="all" style="clear: all;">
+
+<hr>
+
+<h2>Contents</h2>
+
+<ul>
+  <li><a href="#rnk_index_fwd_synopsis">Header
+    <code>"boost/multi_index/ranked_index_fwd.hpp"</code> synopsis</a></li>
+  <li><a href="#synopsis">Header
+    <code>"boost/multi_index/ranked_index.hpp"</code> synopsis</a>
+    <ul>
+      <li><a href="#unique_non_unique">
+        Index specifiers <code>ranked_unique</code> and <code>ranked_non_unique</code>
+        </a></li>
+      <li><a href="#rnk_indices">Ranked indices</a>
+        <ul>
+          <li><a href="#complexity_signature">Complexity signature</a></li>
+          <li><a href="#instantiation_types">Instantiation types</a></li>
+          <li><a href="#types">Nested types</a></li>
+          <li><a href="#set_operations">Set operations</a></li>
+          <li><a href="#rank_operations">Rank operations</a></li>
+          <li><a href="#serialization">Serialization</a></li>
+        </ul>
+      </li>
+    </ul>
+  </li>
+</ul>
+
+<h2>
+<a name="rnk_index_fwd_synopsis">Header
+<a href="../../../../boost/multi_index/ranked_index_fwd.hpp">
+<code>"boost/multi_index/ranked_index_fwd.hpp"</code></a> synopsis</a></h2>
+
+<blockquote><pre>
+<span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
+
+<span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
+
+<span class=comment>// index specifiers ranked_unique and ranked_non_unique</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>consult ranked_unique reference for arguments</b><span class=special>&gt;</span>
+<span class=keyword>struct</span> <span class=identifier>ranked_unique</span><span class=special>;</span>
+<span class=keyword>template</span><span class=special>&lt;</span><b>consult ranked_non_unique reference for arguments</b><span class=special>&gt;</span>
+<span class=keyword>struct</span> <span class=identifier>ranked_non_unique</span><span class=special>;</span>
+
+<span class=comment>// indices</span>
+
+<span class=keyword>namespace</span> <span class=identifier>detail</span><span class=special>{</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>implementation defined</b><span class=special>&gt;</span> <span class=keyword>class</span> <b>index name is implementation defined</b><span class=special>;</span>
+
+<span class=special>}</span> <span class=comment>// namespace boost::multi_index::detail</span>
+
+<span class=special>}</span> <span class=comment>// namespace boost::multi_index</span> 
+
+<span class=special>}</span> <span class=comment>// namespace boost</span>
+</pre></blockquote>
+
+<p>
+<code>ranked_index_fwd.hpp</code> provides forward declarations for index specifiers 
+<a href="#unique_non_unique"><code>ranked_unique</code> and <code>ranked_non_unique</code></a> and
+their associated <a href="#rnk_indices">ranked index</a> classes.
+</p>
+
+<h2>
+<a name="synopsis">Header
+<a href="../../../../boost/multi_index/ranked_index.hpp">
+<code>"boost/multi_index/ranked_index.hpp"</code></a> synopsis</a></h2>
+
+<blockquote><pre>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>initializer_list</span><span class=special>&gt;</span>
+
+<span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
+
+<span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
+
+<span class=comment>// index specifiers ranked_unique and ranked_non_unique</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>consult ranked_unique reference for arguments</b><span class=special>&gt;</span>
+<span class=keyword>struct</span> <span class=identifier>ranked_unique</span><span class=special>;</span>
+<span class=keyword>template</span><span class=special>&lt;</span><b>consult ranked_non_unique reference for arguments</b><span class=special>&gt;</span>
+<span class=keyword>struct</span> <span class=identifier>ranked_non_unique</span><span class=special>;</span>
+
+<span class=comment>// indices</span>
+
+<span class=keyword>namespace</span> <span class=identifier>detail</span><span class=special>{</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>implementation defined</b><span class=special>&gt;</span> <span class=keyword>class</span> <b>index class name implementation defined</b><span class=special>;</span>
+
+<span class=comment>// index comparison:</span>
+
+<span class=comment>// <b>OP</b> is any of ==,&lt;,!=,&gt;,&gt;=,&lt;=</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>&gt;</span>
+<span class=keyword>bool</span> <span class=keyword>operator</span> <b><i>OP</i></b><span class=special>(</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 1</b><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 2</b><span class=special>&gt;&amp;</span> <span class=identifier>y</span><span class=special>);</span>
+
+<span class=comment>// index specialized algorithms:</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>implementation defined</b><span class=special>&gt;</span>
+<span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>y</span><span class=special>);</span>
+
+<span class=special>}</span> <span class=comment>// namespace boost::multi_index::detail</span>
+
+<span class=special>}</span> <span class=comment>// namespace boost::multi_index</span> 
+
+<span class=special>}</span> <span class=comment>// namespace boost</span>
+</pre></blockquote>
+
+<h3><a name="unique_non_unique">
+Index specifiers <code>ranked_unique</code> and <code>ranked_non_unique</code>
+</a></h3>
+
+<p>
+These <a href="indices.html#index_specification">index specifiers</a> allow
+for insertion of <a href="#rnk_indices">ranked indices</a> without and with
+allowance of duplicate elements, respectively. The syntax of <code>ranked_unique</code>
+and <code>ranked_non_unique</code> coincide, thus we describe them in a grouped manner.
+<code>ranked_unique</code> and <code>ranked_non_unique</code> can be instantiated in
+two different forms, according to whether a tag list for the index is provided or not:
+</p>
+
+<blockquote><pre>
+<span class=keyword>template</span><span class=special>&lt;</span>
+  <span class=keyword>typename</span> <span class=identifier>KeyFromValue</span><span class=special>,</span>
+  <span class=keyword>typename</span> <span class=identifier>Compare</span><span class=special>=</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>less</span><span class=special>&lt;</span><span class=identifier>KeyFromValue</span><span class=special>::</span><span class=identifier>result_type</span><span class=special>&gt;</span>
+<span class=special>&gt;</span>
+<span class=keyword>struct</span> <span class=special>(</span><span class=identifier>ranked_unique</span> <span class=special>|</span> <span class=identifier>ranked_non_unique</span><span class=special>)</span><span class=special>;</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span>
+  <span class=keyword>typename</span> <span class=identifier>TagList</span><span class=special>,</span>
+  <span class=keyword>typename</span> <span class=identifier>KeyFromValue</span><span class=special>,</span>
+  <span class=keyword>typename</span> <span class=identifier>Compare</span><span class=special>=</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>less</span><span class=special>&lt;</span><span class=identifier>KeyFromValue</span><span class=special>::</span><span class=identifier>result_type</span><span class=special>&gt;</span>
+<span class=special>&gt;</span>
+<span class=keyword>struct</span> <span class=special>(</span><span class=identifier>ranked_unique</span> <span class=special>|</span> <span class=identifier>ranked_non_unique</span><span class=special>)</span><span class=special>;</span>
+</pre></blockquote>
+
+<p>
+If provided, <code>TagList</code> must be an instantiation of the class template
+<a href="indices.html#tag"><code>tag</code></a>.
+The template arguments are used by the corresponding index implementation,
+refer to the <a href="#rnk_indices">ranked indices</a> reference section for further
+explanations on their acceptable type values.
+</p>
+
+<h3><a name="rnk_indices">Ranked indices</a></h3>
+
+<p>
+Ranked indices are a variation of <a href="ord_indices.html">ordered indices</a>
+providing additional capabilities for calculation of and access by rank; the <i>rank</i> of an element is the
+distance to it from the beginning of the index. Besides this extension, ranked indices replicate the
+public interface of ordered indices with the difference, complexity-wise, that 
+<a href="#complexity_signature">hinted insertion</a> and <a href="#complexity_signature">deletion</a>
+are done in logarithmic rather than constant time. Also, execution times and memory consumption are
+expected to be poorer due to the internal bookkeeping needed to maintain rank-related information
+(an exception being <a href="#count"><code>count</code> operations</a>, which are actually faster).
+As with ordered indices, ranked indices can be unique (no duplicate elements are allowed)
+or non-unique: either version is associated to a different index specifier, but
+the interface of both index types is the same.
+</p>
+
+<p>
+In what follows, we only describe the extra operations provided by ranked indices or those
+operations with improved performance: for the
+rest refer to the <a href="ord_indices.html#ord_indices">documentation</a> for ordered
+indices, bearing in mind the occasional differences in complexity.
+</p>
+
+<blockquote><pre>
+<span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
+
+<span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
+
+<b>implementation defined </b><span class=identifier>unbounded</span><span class=special>;</span> <span class=comment>// see range_rank()</span>
+
+<span class=keyword>namespace</span> <span class=identifier>detail</span><span class=special>{</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>implementation defined: dependent on types Value, Allocator,
+  TagList, KeyFromValue, Compare</b><span class=special>&gt;</span>
+<span class=keyword>class</span> <b>name is implementation defined</b>
+<span class=special>{</span> 
+<span class=keyword>public</span><span class=special>:</span>
+  <span class=comment>// types:</span>
+
+  <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>KeyFromValue</span><span class=special>::</span><span class=identifier>result_type</span>         <span class=identifier>key_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>Value</span>                                      <span class=identifier>value_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>KeyFromValue</span>                               <span class=identifier>key_from_value</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>Compare</span>                                    <span class=identifier>key_compare</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>implementation defined                     </b><span class=identifier>value_compare</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>tuple</span><span class=special>&lt;</span><span class=identifier>key_from_value</span><span class=special>,</span><span class=identifier>key_compare</span><span class=special>&gt;</span>   <span class=identifier>ctor_args</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>TagList</span>                                    <span class=identifier>tag_list</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>Allocator</span>                                  <span class=identifier>allocator_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>Allocator</span><span class=special>::</span><span class=identifier>reference</span>              <span class=identifier>reference</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>Allocator</span><span class=special>::</span><span class=identifier>const_reference</span>        <span class=identifier>const_reference</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>implementation defined                     </b><span class=identifier>iterator</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>implementation defined                     </b><span class=identifier>const_iterator</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>implementation defined                     </b><span class=identifier>size_type</span><span class=special>;</span>      
+  <span class=keyword>typedef</span> <b>implementation defined                     </b><span class=identifier>difference_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>Allocator</span><span class=special>::</span><span class=identifier>pointer</span>                <span class=identifier>pointer</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>Allocator</span><span class=special>::</span><span class=identifier>const_pointer</span>          <span class=identifier>const_pointer</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>equivalent to
+    std::reverse_iterator&lt;iterator&gt;</b>                  <span class=identifier>reverse_iterator</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>equivalent to
+    std::reverse_iterator&lt;const_iterator&gt;</b>            <span class=identifier>const_reverse_iterator</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>same as owning container                   </b><span class=identifier>node_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>following [container.insert.return] spec   </b><span class=identifier>insert_return_type</span><span class=special>;</span>
+
+  <span class=comment>// construct/copy/destroy:</span>
+
+  <b>index class name</b><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>=(</span><span class=keyword>const</span> <b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <b>index class name</b><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>=(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
+
+  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+
+  <span class=comment>// iterators:</span>
+
+  <span class=identifier>iterator</span>               <span class=identifier>begin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>begin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>iterator</span>               <span class=identifier>end</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>end</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>reverse_iterator</span>       <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>reverse_iterator</span>       <span class=identifier>rend</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>cbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>cend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+ 
+  <span class=identifier>iterator</span>       <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>const_iterator</span> <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=comment>// capacity:</span>
+
+  <span class=keyword>bool</span>      <span class=identifier>empty</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>max_size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+
+  <span class=comment>// modifiers:</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>emplace</span><span class=special>(</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
+  <span class=keyword>template</span> <span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>iterator</span> <span class=identifier>emplace_hint</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>insert</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>iterator</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>iterator</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>InputIterator</span><span class=special>&gt;</span>
+  <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
+  <span class=identifier>insert_return_type</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>node_type</span><span class=special>&amp;&amp;</span> <span class=identifier>nh</span><span class=special>);</span>
+  <span class=identifier>iterator</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>node_type</span><span class=special>&amp;&amp;</span> <span class=identifier>nh</span><span class=special>);</span>
+
+  <span class=identifier>node_type</span> <span class=identifier>extract</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>);</span>
+  <span class=identifier>node_type</span> <span class=identifier>extract</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>key_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+
+  <span class=identifier>iterator</span>  <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>);</span>
+  <span class=identifier>size_type</span> <span class=identifier>erase</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>key_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>iterator</span>  <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
+
+  <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>&gt;</span> <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Rollback</span><span class=special>&gt;</span>
+  <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>,</span><span class=identifier>Rollback</span> <span class=identifier>back</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>&gt;</span> <span class=keyword>bool</span> <span class=identifier>modify_key</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Rollback</span><span class=special>&gt;</span>
+  <span class=keyword>bool</span> <span class=identifier>modify_key</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>,</span><span class=identifier>Rollback</span> <span class=identifier>back</span><span class=special>);</span>
+  
+  <span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>clear</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span> <span class=keyword>void</span> <span class=identifier>merge</span><span class=special>(</span><span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>merge</span><span class=special>(</span>
+    <span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>i</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span>
+  <span class=keyword>void</span> <span class=identifier>merge</span><span class=special>(</span>
+    <span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>first</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>last</span><span class=special>);</span>
+      
+  <span class=comment>// observers:</span>
+
+  <span class=identifier>key_from_value</span> <span class=identifier>key_extractor</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>key_compare</span>    <span class=identifier>key_comp</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>value_compare</span>  <span class=identifier>value_comp</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=comment>// set operations:</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>iterator</span> <span class=identifier>find</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>iterator</span> <span class=identifier>find</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>size_type</span> <span class=identifier>count</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>size_type</span> <span class=identifier>count</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=keyword>bool</span> <span class=identifier>contains</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=keyword>bool</span> <span class=identifier>contains</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>iterator</span> <span class=identifier>lower_bound</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>iterator</span> <span class=identifier>lower_bound</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>iterator</span> <span class=identifier>upper_bound</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>iterator</span> <span class=identifier>upper_bound</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>iterator</span><span class=special>&gt;</span> <span class=identifier>equal_range</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>iterator</span><span class=special>&gt;</span> <span class=identifier>equal_range</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=comment>// range:</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>LowerBounder</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>UpperBounder</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>iterator</span><span class=special>&gt;</span> <span class=identifier>range</span><span class=special>(</span>
+    <span class=identifier>LowerBounder</span> <span class=identifier>lower</span><span class=special>,</span><span class=identifier>UpperBounder</span> <span class=identifier>upper</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=comment>// rank operations:</span>
+
+  <span class=identifier>iterator</span>  <span class=identifier>nth</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>rank</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>size_type</span> <span class=identifier>find_rank</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>size_type</span> <span class=identifier>find_rank</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>size_type</span> <span class=identifier>lower_bound_rank</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>size_type</span> <span class=identifier>lower_bound_rank</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>size_type</span> <span class=identifier>upper_bound_rank</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>size_type</span> <span class=identifier>upper_bound_rank</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>size_type</span><span class=special>,</span><span class=identifier>size_type</span><span class=special>&gt;</span> <span class=identifier>equal_range_rank</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>CompatibleKey</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>CompatibleCompare</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>size_type</span><span class=special>,</span><span class=identifier>size_type</span><span class=special>&gt;</span> <span class=identifier>equal_range_rank</span><span class=special>(</span>
+    <span class=keyword>const</span> <span class=identifier>CompatibleKey</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>CompatibleCompare</span><span class=special>&amp;</span> <span class=identifier>comp</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>LowerBounder</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>UpperBounder</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>size_type</span><span class=special>,</span><span class=identifier>size_type</span><span class=special>&gt;</span>
+  <span class=identifier>range_rank</span><span class=special>(</span><span class=identifier>LowerBounder</span> <span class=identifier>lower</span><span class=special>,</span><span class=identifier>UpperBounder</span> <span class=identifier>upper</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
+<span class=special>};</span>
+
+<span class=comment>// index comparison:</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>&gt;</span>
+<span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>==(</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 1</b><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 2</b><span class=special>&gt;&amp;</span> <span class=identifier>y</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>size</span><span class=special>()==</span><span class=identifier>y</span><span class=special>.</span><span class=identifier>size</span><span class=special>()&amp;&amp;</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>equal</span><span class=special>(</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>y</span><span class=special>.</span><span class=identifier>begin</span><span class=special>());</span>
+<span class=special>}</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>&gt;</span>
+<span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>&lt;(</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 1</b><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 2</b><span class=special>&gt;&amp;</span> <span class=identifier>y</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=keyword>return</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>lexicographical_compare</span><span class=special>(</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>y</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>y</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+<span class=special>}</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>&gt;</span>
+<span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>!=(</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 1</b><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 2</b><span class=special>&gt;&amp;</span> <span class=identifier>y</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=keyword>return</span> <span class=special>!(</span><span class=identifier>x</span><span class=special>==</span><span class=identifier>y</span><span class=special>);</span>
+<span class=special>}</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>&gt;</span>
+<span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>&gt;(</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 1</b><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 2</b><span class=special>&gt;&amp;</span> <span class=identifier>y</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=keyword>return</span> <span class=identifier>y</span><span class=special>&lt;</span><span class=identifier>x</span><span class=special>;</span>
+<span class=special>}</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>&gt;</span>
+<span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>&gt;=(</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 1</b><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 2</b><span class=special>&gt;&amp;</span> <span class=identifier>y</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=keyword>return</span> <span class=special>!(</span><span class=identifier>x</span><span class=special>&lt;</span><span class=identifier>y</span><span class=special>);</span>
+<span class=special>}</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>arg set 1</b><span class=special>,</span><b>arg set 2</b><span class=special>&gt;</span>
+<span class=keyword>bool</span> <span class=keyword>operator</span><span class=special>&lt;=(</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 1</b><span class=special>&gt;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+  <span class=keyword>const</span> <b>index class name</b><span class=special>&lt;</span><b>arg set 2</b><span class=special>&gt;&amp;</span> <span class=identifier>y</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=keyword>return</span> <span class=special>!(</span><span class=identifier>x</span><span class=special>&gt;</span><span class=identifier>y</span><span class=special>);</span>
+<span class=special>}</span>
+
+<span class=comment>// index specialized algorithms:</span>
+
+<span class=keyword>template</span><span class=special>&lt;</span><b>implementation defined</b><span class=special>&gt;</span>
+<span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>y</span><span class=special>);</span>
+
+<span class=special>}</span> <span class=comment>// namespace boost::multi_index::detail</span>
+
+<span class=special>}</span> <span class=comment>// namespace boost::multi_index</span> 
+
+<span class=special>}</span> <span class=comment>// namespace boost</span>
+</pre></blockquote>
+
+<h4><a name="complexity_signature">Complexity signature</a></h4>
+
+<p>
+We follow the terminology described in the 
+<a href="indices.html#complexity_signature">complexity signature
+section</a>. The complexity signature of ranked indices is:
+<ul>
+  <li>copying: <code>c(n)=n*log(n)</code>,</li>
+  <li>insertion: <code>i(n)=log(n)</code>,</li>
+  <li>hinted insertion: <b><code>h(n)=log(n)</code></b>,</li>
+  <li>deletion: <b><code>d(n)=log(n)</code></b> ,</li>
+  <li>replacement: <code>r(n)=1</code> (constant) if the element position does not
+    change, <code>r(n)=log(n)</code> otherwise,</li>
+  <li>modifying: <code>m(n)=1</code> (constant) if the element position does not
+    change, <code>m(n)=log(n)</code> otherwise.</li>
+</ul>
+</p>
+<p>
+These complexity guarantees are the same as those of
+<a href="ord_indices.html#complexity_signature">ordered indices</a>
+except for hinted insertion and deletion, which are <code>log(n)</code> here and amortized constant there.
+</p>
+
+<h4><a name="instantiation_types">Instantiation types</a></h4>
+
+<p>Ranked indices are instantiated internally to <code>multi_index_container</code> and
+specified by means of <a href="indices.html#indexed_by"><code>indexed_by</code></a>
+with <a href="#unique_non_unique"> index specifiers <code>ranked_unique</code>
+and <code>ranked_non_unique</code></a>. Instantiations are dependent on the
+following types:
+<ul>
+  <li><code>Value</code> from <code>multi_index_container</code>,</li>
+  <li><code>Allocator</code> from <code>multi_index_container</code>,</li>
+  <li><code>TagList</code> from the index specifier (if provided, otherwise <code>tag&lt;&gt;</code> is assumed),</li>
+  <li><code>KeyFromValue</code> from the index specifier,</li>
+  <li><code>Compare</code> from the index specifier.</li>
+</ul>
+These types are subject to the same requirements as specified for
+<a href="ord_indices.html#instantiation_types">ordered indices</a>.
+</p>
+
+<h4><a name="types">Nested types</a></h4>
+
+<code>iterator<br>
+const_iterator</code>
+
+<blockquote>
+These types depend only on <code>node_type</code> and the position of
+the index in the <code>multi_index_container</code>.
+</blockquote>
+
+<h4><a name="set_operations">Set operations</a></h4>
+
+<p>
+See the documentation of ordered indices for an explanation of the notions of
+<a href="ord_indices.html#set_operations"><i>compatible extension</i> and 
+<i>compatible key</i></a>, which are referred to below.
+</p>
+
+<a name="count">
+<code>template&lt;typename CompatibleKey><br>
+size_type count(const CompatibleKey&amp; x)const;
+</code></a>
+
+<blockquote>
+<b>Requires:</b> <code>CompatibleKey</code> is a compatible key of
+<code>key_compare</code>.<br>
+<b>Effects:</b> Returns the number of elements with key equivalent to <code>x</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey,typename CompatibleCompare><br>
+size_type count(const CompatibleKey&amp; x,const CompatibleCompare&amp; comp)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> (<code>CompatibleKey</code>, <code>CompatibleCompare</code>)
+is a compatible extension of <code>key_compare</code>.<br>
+<b>Effects:</b> Returns the number of elements with key equivalent to <code>x</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<h4><a name="rank_operations">Rank operations</a></h4>
+
+<p>
+The <i>rank</i> of an iterator <code>it</code> of a given container <code>c</code> (and,
+by extension, of the element it points to if the iterator is dereferenceable)
+is <code>std::distance(c.begin(),it)</code>.
+</p>
+
+<p>
+See the documentation of ordered indices for an explanation of the notions of
+<a href="ord_indices.html#set_operations"><i>compatible extension</i>, 
+<i>compatible key</i></a>, 
+<a href="ord_indices.html#range_operations"><i>lower bounder</i> and <i>upper bounder</i></a>, which are
+referred to below.
+</p>
+
+<code>iterator nth(size_type n)const;</code>
+
+<blockquote>
+<b>Effects:</b> Returns an iterator with rank <code>n</code>,
+or <code>end()</code> if <code>n&gt;=size()</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>size_type rank(iterator position)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>position</code> is a valid iterator of the index.<br>
+<b>Effects:</b> Returns the rank of <code>position</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey> size_type find_rank(const CompatibleKey&amp; x)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>CompatibleKey</code> is a compatible key of
+<code>key_compare</code>.<br>
+<b>Effects:</b> Equivalent to <code>rank(find(k))</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey,typename CompatibleCompare><br>
+size_type find_rank(const CompatibleKey&amp; x,const CompatibleCompare&amp; comp)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> (<code>CompatibleKey</code>, <code>CompatibleCompare</code>)
+is a compatible extension of <code>key_compare</code>.<br>
+<b>Effects:</b> Equivalent to <code>rank(find(x,comp))</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey><br>
+size_type lower_bound_rank(const CompatibleKey&amp; x)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>CompatibleKey</code> is a compatible key of
+<code>key_compare</code>.<br>
+<b>Effects:</b> Equivalent to <code>rank(lower_bound(x))</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey,typename CompatibleCompare><br>
+size_type lower_bound_rank(const CompatibleKey&amp; x,const CompatibleCompare&amp; comp)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> (<code>CompatibleKey</code>, <code>CompatibleCompare</code>)
+is a compatible extension of <code>key_compare</code>.<br>
+<b>Effects:</b> Equivalent to <code>rank(lower_bound(x,comp))</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey><br>
+size_type upper_bound_rank(const CompatibleKey&amp; x)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>CompatibleKey</code> is a compatible key of
+<code>key_compare</code>.<br>
+<b>Effects:</b> Equivalent to <code>rank(upper_bound(x))</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey,typename CompatibleCompare><br>
+size_type upper_bound_rank(const CompatibleKey&amp; x,const CompatibleCompare&amp; comp)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> (<code>CompatibleKey</code>, <code>CompatibleCompare</code>)
+is a compatible extension of <code>key_compare</code>.<br>
+<b>Effects:</b> Equivalent to <code>rank(upper_bound(x,comp))</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey><br>
+std::pair&lt;size_type,size_type> equal_range_rank(<br>
+&nbsp;&nbsp;const CompatibleKey&amp; x)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>CompatibleKey</code> is a compatible key of
+<code>key_compare</code>.<br>
+<b>Effects:</b> Equivalent to <code>make_pair(lower_bound_rank(x),upper_bound_rank(x))</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename CompatibleKey,typename CompatibleCompare><br>
+std::pair&lt;size_type,size_type> equal_range_rank(<br>
+&nbsp;&nbsp;const CompatibleKey&amp; x,const CompatibleCompare&amp; comp)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> (<code>CompatibleKey</code>, <code>CompatibleCompare</code>)
+is a compatible extension of <code>key_compare</code>.<br>
+<b>Effects:</b> Equivalent to
+<code>make_pair(lower_bound_rank(x,comp),upper_bound_rank(x,comp))</code>.<br>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+</blockquote>
+
+<code>template&lt;typename LowerBounder,typename UpperBounder><br>
+std::pair&lt;size_type,size_type> range_rank(<br>
+&nbsp;&nbsp;LowerBounder lower,UpperBounder upper)const;
+</code>
+
+<blockquote>
+<b>Requires:</b> <code>LowerBounder</code> and <code>UpperBounder</code> are
+a lower and upper bounder of <code>key_compare</code>, respectively.<br>
+<b>Effects:</b> Equivalent to 
+<blockquote><pre>
+<span class=keyword>auto</span> <span class=identifier>p</span><span class=special>=</span><span class=identifier>range</span><span class=special>(</span><span class=identifier>lower</span><span class=special>,</span><span class=identifier>upper</span><span class=special>);</span>
+<span class=keyword>return</span> <span class=identifier>make_pair</span><span class=special>(</span><span class=identifier>rank</span><span class=special>(</span><span class=identifier>p</span><span class=special>.</span><span class=identifier>first</span><span class=special>),</span><span class=identifier>rank</span><span class=special>(</span><span class=identifier>p</span><span class=special>.</span><span class=identifier>second</span><span class=special>));</span>
+</pre></blockquote>
+<b>Complexity:</b> <code>O(log(n))</code>.<br>
+<b>Variants:</b> In place of <code>lower</code> or <code>upper</code> (or both),
+the singular value <code>boost::multi_index::unbounded</code> can be
+provided. This acts as a predicate which all values of type <code>key_type</code>
+satisfy.<br>
+</blockquote>
+
+<h4><a name="serialization">Serialization</a></h4>
+
+<p>
+The prerequisites and postconditions associated to serialization of
+<code>multi_index_container</code>s with ranked indices are exactly the same
+as those of <a href="ord_indices.html#serialization">ordered indices</a>.
+
+<hr>
+
+<div class="prev_link"><a href="ord_indices.html"><img src="../prev.gif" alt="ordered_indices" border="0"><br>
+Ordered indices
+</a></div>
+<div class="up_link"><a href="index.html"><img src="../up.gif" alt="Boost.MultiIndex reference" border="0"><br>
+Boost.MultiIndex reference
+</a></div>
+<div class="next_link"><a href="hash_indices.html"><img src="../next.gif" alt="hashed indices" border="0"><br>
+Hashed indices
+</a></div><br clear="all" style="clear: all;">
+
+<br>
+
+<p>Revised February 5th 2022</p>
+
+<p>&copy; Copyright 2003-2022 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+Distributed under the Boost Software 
+License, Version 1.0. (See accompanying file <a href="../../../../LICENSE_1_0.txt">
+LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
+http://www.boost.org/LICENSE_1_0.txt</a>)
+</p>
+
+</body>
+</html>

doc/reference/seq_indices.html

@@ -40,6 +40,7 @@ Random access indices
         <ul>
           <li><a href="#complexity_signature">Complexity signature</a></li>
           <li><a href="#instantiation_types">Instantiation types</a></li>
+          <li><a href="#types">Nested types</a></li>
           <li><a href="#constructors">Constructors, copy and assignment</a></li>
           <li><a href="#iterators">Iterators</a></li>
           <li><a href="#capacity">Capacity operations</a></li>
@@ -92,6 +93,8 @@ its associated <a href="#seq_indices">sequenced index</a> class.
 <code>"boost/multi_index/sequenced_index.hpp"</code></a> synopsis</a></h2>
 
 <blockquote><pre>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>initializer_list</span><span class=special>&gt;</span>
+
 <span class=keyword>namespace</span> <span class=identifier>boost</span><span class=special>{</span>
 
 <span class=keyword>namespace</span> <span class=identifier>multi_index</span><span class=special>{</span>
@@ -150,35 +153,34 @@ like <code>std::list</code>. Elements in a sequenced index are by default
 sorted according to their order of insertion: this means that new elements
 inserted through a different index of the <code>multi_index_container</code> are appended
 to the end of the sequenced index. Additionally, the index allows for free
-reordering of elements in the same vein as <code>std::list</code> does. Validity
-of iterators and references to elements is preserved in all operations.
+reordering of elements in the same vein as <code>std::list</code> does.
+Iterators (including to the end of the index) and pointers and references to an element
+remain valid during the lifetime of the associated container (which can change
+upon swapping), or until the referred-to element is erased or extracted;
+pointers and references to an extracted element, but not so for iterators,
+become valid again once the element is re-inserted.
 </p>
 
 <p>
-There are a number of differences with respect to <code>std::lists</code>:
+Except where noted or if the corresponding interface does not exist, sequenced
+indices verify the same container requirements as <code>std::list</code>:
+we only provide descriptions of those types and operations that are either not
+present in <code>std::list</code> or behave differently. Some of the
+most important differences are:
 <ul>
-  <li>Sequenced indices are not <a href="http://www.sgi.com/tech/stl/Assignable.html">
-    <code>Assignable</code></a> (like any other index.)</li>
+  <li>The complexity of some operations, notably insertion and deletion, differ
+      from those of <code>std::list</code>.
+  </li>
   <li>Unlike as in <code>std::list</code>, insertions into a sequenced index
     may fail due to clashings with other indices. This alters the semantics
     of the operations provided with respect to their analogues in
     <code>std::list</code>.
   </li>
   <li>Elements in a sequenced index are not mutable, and can only be changed
-    by means of <a href="#replace"><code>replace</code></a> and
+    in place by means of <a href="#replace"><code>replace</code></a> and
 	<a href="#modify"><code>modify</code></a> member functions.
   </li>
 </ul>
-Having these restrictions into account, sequenced indices are models
-of <a href="http://www.sgi.com/tech/stl/ReversibleContainer.html">
-<code>Reversible Container</code></a>,
-<a href="http://www.sgi.com/tech/stl/FrontInsertionSequence.html">
-<code>Front Insertion Sequence</code></a> and
-<a href="http://www.sgi.com/tech/stl/BackInsertionSequence.html">
-<code>Back Insertion Sequence</code></a>. We only provide descriptions
-of those types and operations that are either not present in the
-concepts modeled or do not exactly conform to the requirements for these
-types of containers.
 </p>
 
 <blockquote><pre>
@@ -194,58 +196,63 @@ types of containers.
 <span class=keyword>public</span><span class=special>:</span>
   <span class=comment>// types:</span>
 
-  <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>node_type</span><span class=special>::</span><span class=identifier>value_type</span>             <span class=identifier>value_type</span><span class=special>;</span>
-  <span class=keyword>typedef</span> <span class=identifier>tuples</span><span class=special>::</span><span class=identifier>null_type</span>                          <span class=identifier>ctor_args</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>Value</span>                                      <span class=identifier>value_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>tuples</span><span class=special>::</span><span class=identifier>null_type</span>                   <span class=identifier>ctor_args</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=identifier>TagList</span>                                    <span class=identifier>tag_list</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=identifier>Allocator</span>                                  <span class=identifier>allocator_type</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>reference</span>         <span class=identifier>reference</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>const_reference</span>   <span class=identifier>const_reference</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>implementation defined</b>                     <span class=identifier>iterator</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>implementation defined</b>                     <span class=identifier>const_iterator</span><span class=special>;</span>
-  <span class=keyword>typedef</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>size_t</span>                                <span class=identifier>size_type</span><span class=special>;</span>      
-  <span class=keyword>typedef</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>ptrdiff_t</span>                             <span class=identifier>difference_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>implementation defined</b>                     <span class=identifier>size_type</span><span class=special>;</span>      
+  <span class=keyword>typedef</span> <b>implementation defined</b>                     <span class=identifier>difference_type</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>pointer</span>           <span class=identifier>pointer</span><span class=special>;</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>allocator_type</span><span class=special>::</span><span class=identifier>const_pointer</span>     <span class=identifier>const_pointer</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>equivalent to
     std::reverse_iterator&lt;iterator&gt;</b>                  <span class=identifier>reverse_iterator</span><span class=special>;</span>
   <span class=keyword>typedef</span> <b>equivalent to
     std::reverse_iterator&lt;const_iterator&gt;</b>            <span class=identifier>const_reverse_iterator</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>same as owning container                   </b><span class=identifier>node_type</span><span class=special>;</span>
+  <span class=keyword>typedef</span> <b>following [container.insert.return] spec   </b><span class=identifier>insert_return_type</span><span class=special>;</span>
 
   <span class=comment>// construct/copy/destroy:</span>
 
   <b>index class name</b><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>=(</span><span class=keyword>const</span> <b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <b>index class name</b><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>=(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
 
   <span class=keyword>template</span> <span class=special>&lt;</span><span class=keyword>class</span> <span class=identifier>InputIterator</span><span class=special>&gt;</span>
   <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
   <span class=keyword>void</span> <span class=identifier>assign</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>value</span><span class=special>);</span>
     
-  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>allocator_type</span> <span class=identifier>get_allocator</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// iterators:</span>
 
-  <span class=identifier>iterator</span>               <span class=identifier>begin</span><span class=special>();</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>begin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>iterator</span>               <span class=identifier>end</span><span class=special>();</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>end</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>reverse_iterator</span>       <span class=identifier>rbegin</span><span class=special>();</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>reverse_iterator</span>       <span class=identifier>rend</span><span class=special>();</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>cbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_iterator</span>         <span class=identifier>cend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crbegin</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crend</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=identifier>iterator</span>               <span class=identifier>begin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>begin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>iterator</span>               <span class=identifier>end</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>end</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>reverse_iterator</span>       <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>reverse_iterator</span>       <span class=identifier>rend</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>rend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>cbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_iterator</span>         <span class=identifier>cend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crbegin</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>const_reverse_iterator</span> <span class=identifier>crend</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=identifier>iterator</span>       <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=identifier>const_iterator</span> <span class=identifier>iterator_to</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
 
   <span class=comment>// capacity:</span>
 
-  <span class=keyword>bool</span>      <span class=identifier>empty</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>size_type</span> <span class=identifier>size</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
-  <span class=identifier>size_type</span> <span class=identifier>max_size</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
+  <span class=keyword>bool</span>      <span class=identifier>empty</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
+  <span class=identifier>size_type</span> <span class=identifier>max_size</span><span class=special>()</span><span class=keyword>const</span> <span class=keyword>noexcept</span><span class=special>;</span>
 
-  <span class=keyword>void</span> <span class=identifier>resize</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>=</span><span class=identifier>value_type</span><span class=special>());</span>
+  <span class=keyword>void</span> <span class=identifier>resize</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>resize</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
 
   <span class=comment>// access:</span>
 
@@ -254,34 +261,55 @@ types of containers.
 
   <span class=comment>// modifiers:</span>
 
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>emplace_front</span><span class=special>(</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
   <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>push_front</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>push_front</span><span class=special>(</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>void</span>                     <span class=identifier>pop_front</span><span class=special>();</span>
+
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>emplace_back</span><span class=special>(</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
   <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>push_back</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>push_back</span><span class=special>(</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>void</span>                     <span class=identifier>pop_back</span><span class=special>();</span>
 
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span><span class=special>...</span> <span class=identifier>Args</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>emplace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Args</span><span class=special>&amp;&amp;...</span> <span class=identifier>args</span><span class=special>);</span>
   <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>size_type</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>InputIterator</span><span class=special>&gt;</span>
   <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>InputIterator</span> <span class=identifier>last</span><span class=special>);</span>
+  <span class=keyword>void</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>initializer_list</span><span class=special>&lt;</span><span class=identifier>value_type</span><span class=special>&gt;</span> <span class=identifier>list</span><span class=special>);</span>
+  <span class=identifier>insert_return_type</span> <span class=identifier>insert</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>node_type</span><span class=special>&amp;&amp;</span> <span class=identifier>nh</span><span class=special>);</span>
+
+  <span class=identifier>node_type</span> <span class=identifier>extract</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>);</span>
 
   <span class=identifier>iterator</span> <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>);</span>
   <span class=identifier>iterator</span> <span class=identifier>erase</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
 
   <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>bool</span> <span class=identifier>replace</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>value_type</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>&gt;</span> <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Modifier</span><span class=special>,</span><span class=keyword>typename</span> <span class=identifier>Rollback</span><span class=special>&gt;</span>
   <span class=keyword>bool</span> <span class=identifier>modify</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Modifier</span> <span class=identifier>mod</span><span class=special>,</span><span class=identifier>Rollback</span> <span class=identifier>back</span><span class=special>);</span>
 
   <span class=keyword>void</span> <span class=identifier>swap</span><span class=special>(</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
 
-  <span class=keyword>void</span> <span class=identifier>clear</span><span class=special>();</span>
+  <span class=keyword>void</span> <span class=identifier>clear</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// list operations:</span>
 
-  <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>);</span>
-  <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span><span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>i</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span> <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span><span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=keyword>bool</span><span class=special>&gt;</span> <span class=identifier>splice</span><span class=special>(</span>
+    <span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>i</span><span class=special>);</span>
+  <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Index</span><span class=special>&gt;</span>
   <span class=keyword>void</span> <span class=identifier>splice</span><span class=special>(</span>
-    <span class=identifier>iterator</span> <span class=identifier>position</span><span class=special>,</span><b>index class name</b><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>first</span><span class=special>,</span><span class=identifier>iterator</span> <span class=identifier>last</span><span class=special>);</span>
+    <span class=identifier>const_iterator</span> <span class=identifier>position</span><span class=special>,</span><span class=identifier>Index</span><span class=special>&amp;&amp;</span> <span class=identifier>x</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>first</span><span class=special>,</span>
+    <span class=keyword>typename</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>remove_reference_t</span><span class=special>&lt;</span><span class=identifier>Index</span><span class=special>&gt;::</span><span class=identifier>const_iterator</span> <span class=identifier>last</span><span class=special>);</span>
 
   <span class=keyword>void</span> <span class=identifier>remove</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>value_type</span><span class=special>&amp;</span> <span class=identifier>value</span><span class=special>);</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Predicate</span><span class=special>&gt;</span> <span class=keyword>void</span> <span class=identifier>remove_if</span><span class=special>(</span><span class=identifier>Predicate</span> <span class=identifier>pred</span><span class=special>);</span>
@@ -296,7 +324,7 @@ types of containers.
   <span class=keyword>void</span> <span class=identifier>sort</span><span class=special>();</span>
   <span class=keyword>template</span> <span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>Compare</span><span class=special>&gt;</span> <span class=keyword>void</span> <span class=identifier>sort</span><span class=special>(</span><span class=identifier>Compare</span> <span class=identifier>comp</span><span class=special>);</span>
 
-  <span class=keyword>void</span> <span class=identifier>reverse</span><span class=special>();</span>
+  <span class=keyword>void</span> <span class=identifier>reverse</span><span class=special>()</span><span class=keyword>noexcept</span><span class=special>;</span>
 
   <span class=comment>// rearrange operations:</span>
 
@@ -399,6 +427,16 @@ index specifier. Instantiations are dependent on the following types:
 <a href="indices.html#tag"><code>tag</code></a>.
 </p>
 
+<h4><a name="types">Nested types</a></h4>
+
+<code>iterator<br>
+const_iterator</code>
+
+<blockquote>
+These types depend only on <code>node_type</code> and the position of
+the index in the <code>multi_index_container</code>.
+</blockquote>
+
 <h4><a name="constructors">Constructors, copy and assignment</a></h4>
 
 <p>
@@ -419,17 +457,22 @@ objects to which <code>*this</code> and <code>x</code> belong, respectively.<br>
 <b>Returns:</b> <code>*this</code>.<br>
 </blockquote>
 
+<code><b>index class name</b>&amp; operator=(std::initializer_list&lt;value_type&gt; list);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>a</span><span class=special>=</span><span class=identifier>list</span><span class=special>;</span>
+</pre></blockquote>
+where <code>a</code> is the <code>multi_index_container</code>
+object to which <code>*this</code> belongs.<br>
+<b>Returns:</b> <code>*this</code>.<br>
+</blockquote>
+
 <code>template &lt;class InputIterator><br>
 void assign(InputIterator first,InputIterator last);</code>
 
 <blockquote>
-<b>Requires:</b> <code>InputIterator</code> is a model of
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">
-<code>Input Iterator</code></a> over elements of type
-<code>value_type</code> or a type convertible to <code>value_type</code>.
-<code>first</code> and <code>last</code> are not iterators into any
-index of the <code>multi_index_container</code> to which this index belongs.
-<code>last</code> is reachable from <code>first</code>.<br>
 <b>Effects:</b>
 <blockquote><pre>
 <span class=identifier>clear</span><span class=special>();</span>
@@ -437,6 +480,15 @@ index of the <code>multi_index_container</code> to which this index belongs.
 </pre></blockquote>
 </blockquote>
 
+<code>void assign(std::initializer_list&lt;value_type&gt; list);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>assign</span><span class=special>(</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+</pre></blockquote>
+</blockquote>
+
 <code>void assign(size_type n,const value_type&amp; value);</code>
 
 <blockquote>
@@ -461,56 +513,113 @@ const_iterator iterator_to(const value_type&amp; x)const;</code>
 
 <h4><a name="capacity">Capacity operations</a></h4>
 
-<code>void resize(size_type n,const value_type&amp; x=value_type());</code>
+<code>void resize(size_type n);<br>
+void resize(size_type n,const value_type&amp; x);</code>
 
 <blockquote>
-<b>Effects:</b>
-<blockquote><pre>
-<span class=keyword>if</span><span class=special>(</span><span class=identifier>n</span><span class=special>&gt;</span><span class=identifier>size</span><span class=special>())</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>n</span><span class=special>-</span><span class=identifier>size</span><span class=special>(),</span><span class=identifier>x</span><span class=special>);</span>
-<span class=keyword>else</span> <span class=keyword>if</span><span class=special>(</span><span class=identifier>n</span><span class=special>&lt;</span><span class=identifier>size</span><span class=special>()){</span>
-  <span class=identifier>iterator</span> <span class=identifier>it</span><span class=special>=</span><span class=identifier>begin</span><span class=special>();</span>
-  <span class=identifier>std</span><span class=special>::</span><span class=identifier>advance</span><span class=special>(</span><span class=identifier>it</span><span class=special>,</span><span class=identifier>n</span><span class=special>);</span>
-  <span class=identifier>erase</span><span class=special>(</span><span class=identifier>it</span><span class=special>,</span><span class=identifier>end</span><span class=special>());</span>
-<span class=special>}</span>
-</pre></blockquote>
+<b>Requires (first version):</b> <code>value_type</code> is <code>DefaultInsertable</code>
+into <code>multi_index_container</code>.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>CopyInsertable</code>
+into <code>multi_index_container</code>.<br>
+<b>Effects:</b> If <code>size()&lt;n</code>, tries to append <code>n-size()</code> default-inserted
+elements (first version) or copies of <code>x</code> (second version) at the end of
+the index. If <code>n&lt;size()</code>, erases the last <code>size()-n</code> elements.<br>
 <b>Note:</b> If an expansion is requested, the size of the index is not guaranteed
-to be <code>n</code> after this operation (other indices may ban insertions.)
+to be <code>n</code> after this operation (other indices may ban insertions).
 </blockquote>
 
 <h4><a name="modifiers">Modifiers</a></h4>
 
-<code>std::pair&lt;iterator,bool> push_front(const value_type&amp; x);</code>
+<code>template&lt;typename... Args&gt;<br>
+std::pair&lt;iterator,bool&gt; emplace_front(Args&amp;&amp;... args);</code>
 
 <blockquote>
-<b>Effects:</b> Inserts <code>x</code> at the beginning of the sequence if
-no other index of the <code>multi_index_container</code> bans the insertion.<br>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>emplace</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>forward</span><span class=special>&lt;</span><span class=identifier>Args</span><span class=special>&gt;(</span><span class=identifier>args</span><span class=special>)...);</span>
+</pre></blockquote>
 <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
 is <code>true</code> if and only if insertion took place. On successful
 insertion, <code>p.first</code> points to the element inserted; otherwise,
 <code>p.first</code> points to an element that caused the insertion to be banned.
 Note that more than one element can be causing insertion not to be allowed.<br>
-<b>Complexity:</b> <code>O(I(n))</code>.<br>
-<b>Exception safety:</b> Strong.
 </blockquote>
-  
-<code>std::pair&lt;iterator,bool> push_back(const value_type&amp; x);</code>
+
+<code>std::pair&lt;iterator,bool> push_front(const value_type&amp; x);</code><br>
+<code>std::pair&lt;iterator,bool> push_front(value_type&amp;&amp; x);</code>
 
 <blockquote>
-<b>Effects:</b> Inserts <code>x</code> at the end of the sequence if
-no other index of the <code>multi_index_container</code> bans the insertion.<br>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>);</span>            <span class=comment>// lvalue ref version</span>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>move</span><span class=special>(</span><span class=identifier>x</span><span class=special>));</span> <span class=comment>// rvalue ref version</span>
+</pre></blockquote>
 <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
 is <code>true</code> if and only if insertion took place. On successful
 insertion, <code>p.first</code> points to the element inserted; otherwise,
 <code>p.first</code> points to an element that caused the insertion to be banned.
 Note that more than one element can be causing insertion not to be allowed.<br>
-<b>Complexity:</b> <code>O(I(n))</code>.<br>
-<b>Exception safety:</b> Strong.
 </blockquote>
 
-<code>std::pair&lt;iterator,bool> insert(iterator position,const value_type&amp; x);</code>
+<code>template&lt;typename... Args&gt;<br>
+std::pair&lt;iterator,bool&gt; emplace_back(Args&amp;&amp;... args);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.<br>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>emplace</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>forward</span><span class=special>&lt;</span><span class=identifier>Args</span><span class=special>&gt;(</span><span class=identifier>args</span><span class=special>)...);</span>
+</pre></blockquote>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion took place. On successful
+insertion, <code>p.first</code> points to the element inserted; otherwise,
+<code>p.first</code> points to an element that caused the insertion to be banned.
+Note that more than one element can be causing insertion not to be allowed.<br>
+</blockquote>
+
+<code>std::pair&lt;iterator,bool> push_back(const value_type&amp; x);</code><br>
+<code>std::pair&lt;iterator,bool> push_back(value_type&amp;&amp; x);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>x</span><span class=special>);</span>            <span class=comment>// lvalue ref version</span>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>move</span><span class=special>(</span><span class=identifier>x</span><span class=special>));</span> <span class=comment>// rvalue ref version</span>
+</pre></blockquote>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion took place. On successful
+insertion, <code>p.first</code> points to the element inserted; otherwise,
+<code>p.first</code> points to an element that caused the insertion to be banned.
+Note that more than one element can be causing insertion not to be allowed.<br>
+</blockquote>
+
+<code>template&lt;typename... Args&gt;<br>
+ std::pair&lt;iterator,bool&gt; emplace(iterator position,Args&amp;&amp;... args);</code>
+
+<blockquote>
+<b>Requires:</b> <code>value_type</code> is <code>EmplaceConstructible</code>
+into <code>multi_index_container</code> from <code>args</code>.<br>
+<b>Effects:</b> Inserts a <code>value_type</code> object constructed with
+<code>std::forward&lt;Args&gt;(args)...</code> before <code>position</code> if insertion
+is allowed by all other indices of the <code>multi_index_container</code>.<br>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion took place. On successful insertion,
+<code>p.first</code> points to the element inserted; otherwise, <code>p.first</code>
+points to an element that caused the insertion to be banned. Note that more than
+one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> <code>O(I(n))</code>.<br>
+<b>Exception safety:</b> Strong.<br>
+</blockquote>
+
+<code>std::pair&lt;iterator,bool> insert(iterator position,const value_type&amp; x);</code><br>
+<code>std::pair&lt;iterator,bool> insert(iterator position,value_type&amp;&amp; x);</code>
+
+<blockquote>
+<b>Requires (first version):</b> <code>value_type</code> is <code>CopyInsertable</code>
+into <code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>MoveInsertable</code>
+into <code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index.<br>
 <b>Effects:</b> Inserts <code>x</code> before <code>position</code> if insertion
 is allowed by all other indices of the <code>multi_index_container</code>.<br>
 <b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
@@ -525,7 +634,6 @@ Note that more than one element can be causing insertion not to be allowed.<br>
 <code>void insert(iterator position,size_type n,const value_type&amp; x);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.<br>
 <b>Effects:</b>
 <blockquote><pre>
 <span class=keyword>for</span><span class=special>(</span><span class=identifier>size_type</span> <span class=identifier>i</span><span class=special>=</span><span class=number>0</span><span class=special>;</span><span class=identifier>i</span><span class=special>&lt;</span><span class=identifier>n</span><span class=special>;++</span><span class=identifier>i</span><span class=special>)</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>position</span><span class=special>,</span><span class=identifier>x</span><span class=special>);</span>
@@ -537,22 +645,65 @@ void insert(iterator position,InputIterator first,InputIterator last);</code>
 
 <blockquote>
 <b>Requires:</b> <code>position</code> is a valid iterator of the index.
-<code>InputIterator</code> is a model of
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">
-<code>Input Iterator</code></a> over elements of type
-<code>value_type</code> or a type convertible to <code>value_type</code>.
+<code>InputIterator</code> is an input iterator.
+<code>value_type</code> is
+<code>EmplaceConstructible</code> into
+<code>multi_index_container</code> from <code>*first</code>.
 <code>first</code> and <code>last</code> are not iterators into any
 index of the <code>multi_index_container</code> to which this index belongs.
 <code>last</code> is reachable from <code>first</code>.<br>
 <b>Effects:</b>
-<blockquote><pre>
-<span class=keyword>while</span><span class=special>(</span><span class=identifier>first</span><span class=special>!=</span><span class=identifier>last</span><span class=special>)</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>position</span><span class=special>,*</span><span class=identifier>first</span><span class=special>++);</span>
-</pre></blockquote>
+For each element of [<code>first</code>, <code>last</code>), in this
+order, inserts it before <code>position</code> if insertion is allowed by all
+other indices of the <code>multi_index_container</code>.<br>
 <b>Complexity:</b> <code>O(m*I(n+m))</code>, where <code>m</code> is the
 number of elements in [<code>first</code>,<code>last</code>).<br>
 <b>Exception safety:</b> Basic.
 </blockquote>
 
+<code>void insert(iterator position,std::initializer_list&lt;value_type&gt; list);</code>
+
+<blockquote>
+<b>Effects:</b>
+<blockquote><pre>
+<span class=identifier>insert</span><span class=special>(</span><span class=identifier>position</span><span class=special>,</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>list</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+</pre></blockquote>
+</blockquote>
+
+<code>insert_return_type insert(const_iterator position,node_type&amp;&amp; nh);</code>
+
+<blockquote>
+<b>Requires:</b> <code>nh.empty() || get_allocator()==nh.get_allocator()</code>.<br>
+<b>Effects:</b> Does nothing if <code>nh</code> is empty; otherwise,
+inserts the node owned by <code>nh</code> before <code>position</code> if insertion
+is allowed by all other indices of the <code>multi_index_container</code>.<br>
+<b>Postconditions:</b> <code>nh</code> is empty.<br>
+<b>Returns:</b> A value <code>p</code> of type <code>insert_return_type</code>.
+If <code>nh</code> is empty, <code>p.position</code> is <code>end()</code>,
+<code>p.inserted</code> is <code>false</code> and <code>p.node</code> is empty;
+on successful insertion, <code>p.position</code> points to the element inserted,
+<code>p.inserted</code> is <code>true</code> and <code>p.node</code>
+is empty;
+if the insertion failed, <code>p.position</code> points to an element that caused
+the insertion to be banned, <code>p.inserted</code> is <code>false</code> and
+<code>p.node</code> owns the original node.
+Note that more than one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> <code>O(I(n))</code>.<br>
+<b>Exception safety:</b> Strong. If an exception
+is thrown, <code>nh</code> is not changed.<br>
+</blockquote>
+
+<code>node_type extract(const_iterator position);</code>
+
+<blockquote>
+<b>Requires:</b> <code>position</code> is a valid dereferenceable iterator
+of the index.<br>
+<b>Effects:</b> Extracts the node of the element pointed to by <code>position</code>.<br>
+<b>Returns:</b> A node handle owning the extracted node.<br>
+<b>Complexity:</b> <code>O(D(n))</code>.<br>
+<b>Exception safety:</b> <code>nothrow</code>.<br>
+</blockquote>
+
 <code>iterator erase(iterator position);</code>
 
 <blockquote>
@@ -578,11 +729,14 @@ the number of elements in [<code>first</code>,<code>last</code>).<br>
 <b>Exception safety:</b> <code>nothrow</code>.<br>
 </blockquote>
 
-<a name="replace"><code>bool replace(iterator position,const value_type&amp; x);</code></a>
+<a name="replace"><code>bool replace(iterator position,const value_type&amp; x);</code></a><br>
+<code>bool replace(iterator position,value_type&amp;&amp; x);</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid dereferenceable  iterator
-of the index.<br>
+<b>Requires (first version):</b> <code>value_type</code> is <code>CopyAssignable</code>.
+<code>position</code> is a valid dereferenceable iterator of the index.<br>
+<b>Requires (second version):</b> <code>value_type</code> is <code>MoveAssignable</code>.
+<code>position</code> is a valid dereferenceable iterator of the index.<br>
 <b>Effects:</b> Assigns the value <code>x</code> to the element pointed
 to by <code>position</code> into the <code>multi_index_container</code> to which
 the index belongs if replacing is allowed by all other indices of the
@@ -601,11 +755,14 @@ belongs remains in its original state.
 <code>template&lt;typename Modifier> bool modify(iterator position,Modifier mod);</code></a>
 
 <blockquote>
-<b>Requires:</b> <code>Modifier</code> is a model of
-<a href="http://www.sgi.com/tech/stl/UnaryFunction.html">
-<code>Unary Function</code></a> accepting arguments of type
+<b>Requires:</b> <code>mod</code> is a unary function object
+accepting arguments of type
 <code>value_type&amp;</code>. <code>position</code> is a valid dereferenceable
-iterator of the index.<br>
+iterator of the index.
+The execution of <code>mod(e)</code>, where <code>e</code> is the element
+pointed to by <code>position</code>, does not invoke any operation of the
+<code>multi_index_container</code> after <code>e</code> is directly modified
+or, before modification, if the operation would invalidate <code>position</code>.<br>
 <b>Effects:</b> Calls <code>mod(e)</code> where <code>e</code> is the element
 pointed to by <code>position</code> and rearranges <code>*position</code> into
 all the indices of the <code>multi_index_container</code>. Rearrangement on sequenced
@@ -618,7 +775,7 @@ operation succeeds.<br>
 otherwise.<br>
 <b>Complexity:</b> <code>O(M(n))</code>.<br>
 <b>Exception safety:</b> Basic. If an exception is thrown by some
-user-provided operation (except possibly <code>mod</code>), then
+user-provided operation (including <code>mod</code>), then
 the element pointed to by <code>position</code> is erased.
 </blockquote>
 
@@ -626,28 +783,33 @@ the element pointed to by <code>position</code> is erased.
 bool modify(iterator position,Modifier mod,Rollback back);</code>
 
 <blockquote>
-<b>Requires:</b> <code>Modifier</code> and <code>Rollback</code> are models of
-<a href="http://www.sgi.com/tech/stl/UnaryFunction.html">
-<code>Unary Function</code></a> accepting arguments of type
+<b>Requires:</b> <code>mod</code> and <code>back</code> are unary function
+objects accepting arguments of type
 <code>value_type&amp;</code>. <code>position</code> is a valid dereferenceable
-iterator of the index. The sequence of operations <code>mod(e)</code>,
-<code>back(e)</code>, where <code>e</code> is the element
-pointed to by <code>position</code>, restores all keys of the element
-to their original state.<br>
+iterator of the index.
+The execution of <code>mod(e)</code>, where <code>e</code> is the element
+pointed to by <code>position</code>, does not invoke any operation of the
+<code>multi_index_container</code> after <code>e</code> is directly modified
+or, before modification, if the operation would invalidate <code>position</code>.
+<code>back(e)</code> does not invoke any operation of the
+<code>multi_index_container</code>.<br>
 <b>Effects:</b> Calls <code>mod(e)</code> where <code>e</code> is the element
 pointed to by <code>position</code> and tries to rearrange <code>*position</code> into
 all the indices of the <code>multi_index_container</code>. Rearrangement on sequenced
 indices does not change the position of the element with respect to the index;
-rearrangement on other indices may or might not succeed. If the rearrangement
-fails, <code>back(e)</code> is invoked and the
-element is kept at its original position in all indices.<br>
+rearrangement on other indices may or might not succeed.
+If the rearrangement fails, <code>back(e)</code> is invoked: if the resulting value
+of <code>e</code> is consistent with its original position and constraints in all
+indices, the element is kept, otherwise it is erased.<br>
 <b>Postconditions:</b> Validity of <code>position</code> is preserved except if
 the element is erased under the conditions described below.<br>
 <b>Returns:</b> <code>true</code> if the operation succeeded, <code>false</code>
 otherwise.<br>
 <b>Complexity:</b> <code>O(M(n))</code>.<br>
-<b>Exception safety:</b> Strong, except if <code>back</code> throws an
-exception, in which case the modified element is erased. If <code>back</code>
+<b>Exception safety:</b> Strong, except if <code>mod</code> or <code>back</code> throw an
+exception or <code>back(e)</code> fails to properly restore the element or there is
+a throwing user-provided operation after invoking <code>back(e)</code>, in which cases
+the modified element is erased. If <code>back</code>
 throws inside the handling code executing after some other user-provided
 operation has thrown, it is the exception generated by <code>back</code> that
 is rethrown.
@@ -657,62 +819,122 @@ is rethrown.
 
 <p>
 Sequenced indices provide the full set of list operations found in
-<code>std::list</code>; the semantics of these member functions, however,
-differ from that of <code>std::list</code> in some cases as insertions
-might not succeed due to banning by other indices. Similarly, the complexity
+<code>std::list</code>, extended in some cases such as <code>splice</code>;
+the semantics of these member functions, however,
+typically differs from that of <code>std::list</code> as insertions
+may not succeed due to banning by other indices. Similarly, the complexity
 of the operations may depend on the other indices belonging to the
 same <code>multi_index_container</code>.
 </p>
 
-<code>void splice(iterator position,<b>index class name</b>&amp; x);</code>
+<a name="splice"><code>template&lt;typename Index&gt; void splice(const_iterator position,Index&amp;&amp; x);</code></a>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.
-<code>&amp;x!=this</code>.<br>
-<b>Effects:</b> Inserts the contents of <code>x</code> before <code>position</code>,
-in the same order as they were in <code>x</code>. Those elements succesfully
-inserted are erased from <code>x</code>.<br>
-<b>Complexity:</b> <code>O(x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
-<b>Exception safety:</b> Basic.<br>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index, and must be exactly <code>end()</code>
+if the source and destination containers are the same.<br>
+<b>Effects:</b> 
+<blockquote><pre>
+<span class=identifier>splice</span><span class=special>(</span><span class=identifier>position</span><span class=special>,</span><span class=identifier>x</span><span class=special>,</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+</pre></blockquote>
 </blockquote>
 
-<code>void splice(iterator position,<b>index class name</b>&amp; x,iterator i);</code>
+<code>
+template&lt;typename Index&gt; std::pair&lt;iterator,bool&gt; splice(<br>
+&nbsp;&nbsp;const_iterator position,Index&amp;&amp; x,<br>
+&nbsp;&nbsp;typename std::remove_reference_t&lt;Index&gt;::const_iterator i);
+</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.
-<code>i</code> is a valid dereferenceable iterator <code>x</code>.<br>
-<b>Effects:</b> Inserts the element pointed to by <code>i</code> before
-<code>position</code>: if insertion is succesful, the element is erased from
-<code>x</code>. In the special case <code>&amp;x==this</code>, no copy or
-deletion is performed, and the operation is always succesful. If
-<code>position==i</code>, no operation is performed.<br>
-<b>Postconditions:</b> If <code>&amp;x==this</code>, no iterator or reference
-is invalidated.<br>
-<b>Complexity:</b> If <code>&amp;x==this</code>, constant; otherwise
-<code>O(I(n) + D(n))</code>.<br>
-<b>Exception safety:</b> If <code>&amp;x==this</code>, <code>nothrow</code>;
-otherwise, strong.<br>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>.
+If <code>get_allocator()!=x.get_allocator()</code>,
+<code>value_type</code> must be <code>CopyInsertable</code> into the destination
+<code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index.
+<code>i</code> is a valid dereferenceable iterator of <code>x</code>.<br>
+<b>Effects:</b> 
+<ul>
+  <li><b>(Same container)</b> if the source and destination containers are the same, repositions
+    the element pointed to by <code>i</code> before <code>position</code> unless both
+    iterators refer to the same element.</li>
+  <li><b>(Transfer splice)</b> else, if <code>get_allocator()==x.get_allocator()</code>,
+    transfers the node of the element referred to by <code>i</code> into the
+    destination <code>multi_index_container</code> right before <code>position</code>
+    if insertion is allowed by all other indices of the <code>multi_index_container</code>.</li>
+  <li><b>(Destructive splice)</b> else, insertion of <code>*i</code> is tried before
+    <code>position</code>; if the operation is successful, the element is erased from <code>x</code>. 
+  </li>
+</ul>
+<b>Postconditions:</b> If transfer succeeds, for any index in the source container
+having the same <code>iterator</code>/<code>const_iterator</code> types as the corresponding
+index in the destination container, iterators referring to <code>*i</code>
+remain valid and behave as iterators of the destination index.<br>
+<b>Returns:</b> The return value is a pair <code>p</code>. <code>p.second</code>
+is <code>true</code> if and only if insertion (either through transfer or copy insertion)
+took place or the source and destination containers are the same.
+If <code>p.second</code> is <code>true</code>,
+<code>p.first</code> points to the inserted element or to <code>*i</code> if the
+source and destination containers are the same; otherwise, <code>p.first</code>
+points to an element that caused the insertion to be banned. Note that more than
+one element can be causing insertion not to be allowed.<br>
+<b>Complexity:</b> If the source and destination containers are the same,
+constant; otherwise, <code>O(I(n)+D(x.size()))</code>.<br>
+<b>Exception safety:</b> If the source and destination containers are the same,
+<code>nothrow</code>; otherwise strong.<br>
+<b>Implementation note:</b> The destructive variant of this operation is provided
+for reasons of backwards compatibility with previous versions of this library where
+allocator equality was not required. 
 </blockquote>
 
-<code>void splice(iterator position,<b>index class name&amp;</b> x,iterator first,iterator last);</code>
+<code>
+template&lt;typename Index&gt; void splice(<br>
+&nbsp;&nbsp;const_iterator position,Index&amp;&amp; x,<br>
+&nbsp;&nbsp;typename std::remove_reference_t&lt;Index&gt;::const_iterator first,<br>
+&nbsp;&nbsp;typename std::remove_reference_t&lt;Index&gt;::const_iterator last);
+</code>
 
 <blockquote>
-<b>Requires:</b> <code>position</code> is a valid iterator of the index.
-<code>first</code> and <code>last</code> are valid iterators of <code>x</code>.
-<code>last</code> is reachable from <code>first</code>. <code>position</code>
-is not in the range [<code>first</code>,<code>last</code>).<br>
-<b>Effects:</b> For each element in the range [<code>first</code>,<code>last</code>),
-insertion is tried before <code>position</code>; if the operation is succesful,
-the element is erased from <code>x</code>. In the special case
-<code>&amp;x==this</code>, no copy or deletion is performed, and insertions are
-always succesful.<br>
-<b>Postconditions:</b> If <code>&amp;x==this</code>, no iterator or reference
-is invalidated.<br>
-<b>Complexity:</b> If <code>&amp;x==this</code>, constant; otherwise
-<code>O(m*I(n+m) + m*D(x.size()))</code> where <code>m</code> is the number
-of elements in [<code>first</code>,<code>last</code>).<br>
-<b>Exception safety:</b> If <code>&amp;x==this</code>, <code>nothrow</code>;
-otherwise, basic.<br>
+<b>Requires:</b> <code>x</code> is a non-const reference to an index of a
+<a href="multi_index_container.html#node_type">node-compatible</a>
+<code>multi_index_container</code>.
+If <code>get_allocator()!=x.get_allocator()</code>,
+<code>value_type</code> must be <code>CopyInsertable</code> into the destination
+<code>multi_index_container</code>.
+<code>position</code> is a valid iterator of the index and does not point to any element in
+[<code>first</code>,<code>last</code>).
+[<code>first</code>,<code>last</code>) is a valid range of <code>x</code>.<br>
+<b>Effects:</b> 
+<ul>
+  <li><b>(Same container)</b> if the source and destination containers are the same, repositions all the elements
+    of [<code>first</code>,<code>last</code>), in this order, before <code>position</code>.
+  </li>
+  <li><b>(Transfer splice)</b> else, if <code>get_allocator()==x.get_allocator()</code>, then, for each node in
+    [<code>first</code>,<code>last</code>), in this order, the node is transferred to the
+    <code>multi_index_container</code> right before <code>position</code>
+    if insertion is allowed by all other indices of the
+    <code>multi_index_container</code>.</li>
+  <li><b>(Destructive splice)</b> else, for each element in [<code>first</code>,<code>last</code>), in this order,
+    insertion is tried before <code>position</code>; if the operation is successful, the
+    element is erased from <code>x</code>. 
+  </li>
+</ul>
+<b>Postconditions:</b> For any index in the source container having the same
+<code>iterator</code>/<code>const_iterator</code> types as the corresponding
+index in the destination container, iterators referring to the transferred elements
+remain valid and behave as iterators of the destination index.<br>
+<b>Complexity:</b> If <code>&amp;x==this</code>, constant; else, if
+the source and destination containers are the same, <code>O(m)</code>;
+otherwise, <code>O(m*(I(n+m)+D(x.size())))</code>, where
+<code>m</code> is the number of elements in [<code>first</code>,<code>last</code>).<br>
+<b>Exception safety:</b> If the source and destination containers are the same,
+<code>nothrow</code>; otherwise basic.<br>
+<b>Implementation note:</b> The destructive variant of this operation is provided
+for reasons of backwards compatibility with previous versions of this library where
+allocator equality was not required. 
 </blockquote>
 
 <code>void remove(const value_type&amp; value);</code>
@@ -761,44 +983,45 @@ is the number of elements erased.<br>
 <code>void merge(index class name&amp; x);</code>
 
 <blockquote>
-<b>Requires:</b> <code>std::less&lt;value_type></code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> over <code>value_type</code>.
+<b>Requires:</b>
+Either <code>get_allocator()==x.get_allocator()</code> or <code>value_type</code>
+is <code>CopyInsertable</code> into the <code>multi_index_container</code>.
+<code>std::less&lt;value_type&gt;</code> induces a
+strict weak ordering over <code>value_type</code>.
 Both the index and <code>x</code> are sorted according to
-<code>std::less&lt;value_type></code>.<br>
-<b>Effects:</b> Attempts to insert every element of <code>x</code> into the
-corresponding position of the index (according to the order). Elements
-successfully inserted are erased from <code>x</code>. The resulting sequence
+<code>std::less&lt;value_type&gt;</code>.<br>
+<b>Effects:</b> Attempts to splice every element of <code>x</code> into the
+corresponding position of the index (according to the order). The resulting sequence
 is stable, i.e. equivalent elements of either container preserve their
 relative position. In the special case <code>&amp;x==this</code>, no operation
 is performed.<br>
 <b>Postconditions:</b> Elements in the index and remaining elements in
 <code>x</code> are sorted.
-Validity of iterators to the index and of non-erased elements of <code>x</code>
-references is preserved.<br>
+Validity of iterators and references is preserved, except to elements removed
+from <code>x</code> if <code>get_allocator()!=x.get_allocator()</code>.<br>
 <b>Complexity:</b> If <code>&amp;x==this</code>, constant; otherwise
 <code>O(n + x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
 <b>Exception safety:</b> If <code>&amp;x==this</code>, <code>nothrow</code>;
 otherwise, basic.<br>
 </blockquote>
   
-<code>template &lt;typename Compare> void merge(index class name&amp; x,Compare comp);</code>
+<code>template &lt;typename Compare&gt; void merge(index class name&amp; x,Compare comp);</code>
 
 <blockquote>
-<b>Requires:</b> <code>Compare</code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> over <code>value_type</code>.
+<b>Requires:</b>
+Either <code>get_allocator()==x.get_allocator()</code> or <code>value_type</code>
+is <code>CopyInsertable</code> into the <code>multi_index_container</code>.
+<code>Compare</code> induces a strict weak ordering over <code>value_type</code>.
 Both the index and <code>x</code> are sorted according to <code>comp</code>.<br>
-<b>Effects:</b> Attempts to insert every element of <code>x</code> into the
-corresponding position of the index (according to <code>comp</code>).
-Elements successfully inserted are erased from <code>x</code>. The resulting
+<b>Effects:</b> Attempts to splice every element of <code>x</code> into the
+corresponding position of the index (according to <code>comp</code>). The resulting
 sequence is stable, i.e. equivalent elements of either container preserve
 their relative position. In the special case <code>&amp;x==this</code>, no
 operation is performed.<br>
 <b>Postconditions:</b> Elements in the index and remaining elements in
 <code>x</code> are sorted according to <code>comp</code>.
-Validity of iterators to the index and of non-erased elements of <code>x</code>
-references is preserved.<br>
+Validity of iterators and references is preserved, except to elements removed
+from <code>x</code> if <code>get_allocator()!=x.get_allocator()</code>.<br>
 <b>Complexity:</b> If <code>&amp;x==this</code>, constant; otherwise
 <code>O(n + x.size()*I(n+x.size()) + x.size()*D(x.size()))</code>.<br>
 <b>Exception safety:</b> If <code>&amp;x==this</code>, <code>nothrow</code>;
@@ -808,24 +1031,22 @@ otherwise, basic.<br>
 <code>void sort();</code>
 
 <blockquote>
-<b>Requires:</b> <code>std::less&lt;value_type></code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> over <code>value_type</code>.<br>
+<b>Requires:</b> <code>std::less&lt;value_type&gt;</code> induces a
+strict weark ordering over <code>value_type</code>.<br>
 <b>Effects:</b> Sorts the index according to
-<code>std::less&lt;value_type></code>. The sorting is stable, i.e.
+<code>std::less&lt;value_type&gt;</code>. The sorting is stable, i.e.
 equivalent elements preserve their relative position.<br>
 <b>Postconditions:</b> Validity of iterators and references is preserved.<br>
 <b>Complexity:</b> <code>O(n*log(n))</code>.<br>
 <b>Exception safety:</b> <code>nothrow</code> if
-<code>std::less&lt;value_type></code> does not throw; otherwise, basic.
+<code>std::less&lt;value_type&gt;</code> does not throw; otherwise, basic.
 </blockquote>
 
-<code>template &lt;typename Compare> void sort(Compare comp);</code>
+<code>template &lt;typename Compare&gt; void sort(Compare comp);</code>
 
 <blockquote>
-<b>Requires:</b> <code>Compare</code> is a
-<a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
-<code>Strict Weak Ordering</code></a> over <code>value_type</code>.<br>
+<b>Requires:</b> <code>Compare</code> induces a
+strict weak ordering over <code>value_type</code>.<br>
 <b>Effects:</b> Sorts the index according to <code>comp</code>. The sorting
 is stable, i.e. equivalent elements preserve their relative position.<br>
 <b>Postconditions:</b> Validity of iterators and references is preserved.<br>
@@ -834,13 +1055,12 @@ is stable, i.e. equivalent elements preserve their relative position.<br>
 not throw; otherwise, basic.
 </blockquote>
 
-<code>void reverse();</code>
+<code>void reverse()noexcept;</code>
 
 <blockquote>
 <b>Effects:</b> Reverses the order of the elements in the index.<br>
 <b>Postconditions:</b> Validity of iterators and references is preserved.<br>
 <b>Complexity:</b> <code>O(n)</code>.<br>
-<b>Exception safety:</b> <code>nothrow</code>.
 </blockquote>
 
 <h4><a name="rearrange_operations">Rearrange operations</a></h4>
@@ -916,7 +1136,7 @@ input archive (XML archive) <code>ar</code>.
 
 <blockquote>
 <b>Requires:</b> No additional requirements to those imposed by the container.<br>
-<b>Postconditions:</b> On succesful loading, each of the elements of
+<b>Postconditions:</b> On successful loading, each of the elements of
 [<code>begin()</code>, <code>end()</code>) is a restored copy of the corresponding
 element in [<code>m.get&lt;i&gt;().begin()</code>, <code>m.get&lt;i&gt;().end()</code>),
 where <code>i</code> is the position of the sequenced index in the container.
@@ -934,11 +1154,11 @@ Operation: loading of an <code>iterator</code> or <code>const_iterator</code>
 <code>it'</code> from an input archive (XML archive) <code>ar</code>.
 
 <blockquote>
-<b>Postconditions:</b> On succesful loading, if <code>it</code> was dereferenceable
+<b>Postconditions:</b> On successful loading, if <code>it</code> was dereferenceable
 then <code>*it'</code> is the restored copy of <code>*it</code>, otherwise
 <code>it'==end()</code>.<br>
 <b>Note:</b> It is allowed that <code>it</code> be a <code>const_iterator</code>
-and the restored <code>it'</code> an <code>iterator</code>, or viceversa.
+and the restored <code>it'</code> an <code>iterator</code>, or vice versa.
 </blockquote>
 
 <hr>
@@ -955,9 +1175,9 @@ Random access indices
 
 <br>
 
-<p>Revised July 21st 2009</p>
+<p>Revised August 30th 2021</p>
 
-<p>&copy; Copyright 2003-2009 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2021 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/release_notes.html

@@ -27,10 +27,41 @@ Acknowledgements
 
 <hr>
 
-
 <h2>Contents</h2>
 
 <ul>
+  <li><a href="#boost_1_92">Boost 1.92 release</a></li>
+  <li><a href="#boost_1_91">Boost 1.91 release</a></li>
+  <li><a href="#boost_1_85">Boost 1.85 release</a></li>
+  <li><a href="#boost_1_84">Boost 1.84 release</a></li>
+  <li><a href="#boost_1_83">Boost 1.83 release</a></li>
+  <li><a href="#boost_1_82">Boost 1.82 release</a></li>
+  <li><a href="#boost_1_81">Boost 1.81 release</a></li>
+  <li><a href="#boost_1_80">Boost 1.80 release</a></li>
+  <li><a href="#boost_1_79">Boost 1.79 release</a></li>
+  <li><a href="#boost_1_78">Boost 1.78 release</a></li>
+  <li><a href="#boost_1_77">Boost 1.77 release</a></li>
+  <li><a href="#boost_1_74">Boost 1.74 release</a></li>
+  <li><a href="#boost_1_73">Boost 1.73 release</a></li>
+  <li><a href="#boost_1_71">Boost 1.71 release</a></li>
+  <li><a href="#boost_1_70">Boost 1.70 release</a></li>
+  <li><a href="#boost_1_69">Boost 1.69 release</a></li>
+  <li><a href="#boost_1_68">Boost 1.68 release</a></li>
+  <li><a href="#boost_1_67">Boost 1.67 release</a></li>
+  <li><a href="#boost_1_66">Boost 1.66 release</a></li>
+  <li><a href="#boost_1_64">Boost 1.64 release</a></li>
+  <li><a href="#boost_1_62">Boost 1.62 release</a></li>
+  <li><a href="#boost_1_60">Boost 1.60 release</a></li>
+  <li><a href="#boost_1_59">Boost 1.59 release</a></li>
+  <li><a href="#boost_1_58">Boost 1.58 release</a></li>
+  <li><a href="#boost_1_57">Boost 1.57 release</a></li>
+  <li><a href="#boost_1_56">Boost 1.56 release</a></li>
+  <li><a href="#boost_1_55">Boost 1.55 release</a></li>
+  <li><a href="#boost_1_54">Boost 1.54 release</a></li>
+  <li><a href="#boost_1_49">Boost 1.49 release</a></li>
+  <li><a href="#boost_1_48">Boost 1.48 release</a></li>
+  <li><a href="#boost_1_47">Boost 1.47 release</a></li>
+  <li><a href="#boost_1_44">Boost 1.44 release</a></li>
   <li><a href="#boost_1_43">Boost 1.43 release</a></li>
   <li><a href="#boost_1_42">Boost 1.42 release</a></li>
   <li><a href="#boost_1_41">Boost 1.41 release</a></li>
@@ -43,6 +74,531 @@ Acknowledgements
   <li><a href="#boost_1_33">Boost 1.33 release</a></li>
 </ul>
 
+<h2><a name="boost_1_92">Boost 1.92 release</a></h2>
+
+<p>
+<ul>
+  <li>Fancy pointer support has been extended so that <code>multi_index_container</code>
+    iterators now store references to the elements through the allocator's pointer type.
+    In particular, this means that iterators can now be placed in shared memory using
+    <a href="../../interprocess/index.html">Boost.Interprocess</a> allocators.
+  </li>
+  <li>Fixed a performance issue with hashed indices when rehashing at very large
+    container sizes (<a href="https://github.com/boostorg/multi_index/pull/94">PR#94</a>).
+    Contributed by Daniel Kr&aacute;l.
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_91">Boost 1.91 release</a></h2>
+
+<p>
+<ul>
+  <li><b>Breaking change:</b> All type lists accepted or provided by the library (<code>indexed_by</code>,
+    <code>tag</code>, nested typedefs <code>index_specifier_type_list</code>,
+    <code>index_type_list</code>, <code>iterator_type_list</code> and
+    <code>const_iterator_type_list</code>) are no longer based on
+    <a href="../../mpl">Boost.MPL</a> but instead they are now
+    <a href="../../mp11/doc/html/mp11.html#definitions">Boost.Mp11 lists</a>.
+    As a result, Boost.MultiIndex doesn't depend anymore on Boost.MPL.
+    It is expected that most user code won't be impacted by this
+    change, but the previous behavior may be restored, however, by
+    globally defining the macro
+    <code>BOOST_MULTI_INDEX_ENABLE_MPL_SUPPORT</code>.
+    Legacy support for Boost.MPL may be eventually deprecated and removed in the future.
+  </li>
+  <li><b>Breaking change:</b> <code>composite_key</code> and associated
+    class templates (<code>composite_key_equal_to</code>, <code>composite_key_compare</code>,
+    <code>composite_key_hash</code>) have been made variadic (previously the maximum
+    number of template arguments was limited by <code>BOOST_MULTI_INDEX_LIMIT_COMPOSITE_KEY_SIZE</code>).
+    This change should be transparent to users, with the exception that
+    <code>composite_key::key_extractors</code> returns a <code>std::tuple</code>
+    instead of a <code>boost::tuple</code> (and similarly for the rest of affected
+    class templates).
+  </li>
+  <li>Removed internal workarounds and fallbacks to support pre-C++11 compilers.
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_85">Boost 1.85 release</a></h2>
+
+<p>
+<ul>
+  <li>Fixed documentation errors.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_84">Boost 1.84 release</a></h2>
+
+<p>
+<ul>
+  <li>Fixed a serialization-related compile-time bug in old compilers
+    without ADL support
+    (<a href="https://github.com/boostorg/multi_index/issues/70">issue #70</a>).
+  </li>
+</ul>
+</p>
+
+
+<h2><a name="boost_1_83">Boost 1.83 release</a></h2>
+
+<p>
+<ul>
+  <li>Updated range <code>insert</code> in non-unique ordered indices to preserve insertion order
+   of equivalent elements
+   (<a href="https://github.com/boostorg/multi_index/issues/68">issue #68</a>).
+  </li>
+  <li>Serialization now uses <code>std::size_t</code> instead of <code>unsigned long</code>
+    to save and load the size of a <code>multi_index_container</code>
+    (<code>unsigned long</code> is smaller than <code>std::size_t</code> in LLP64 data models).
+    <code>multi_index_container</code> serialization
+    <a href="../../serialization/doc/tutorial.html#versioning">class version</a> has been
+    bumped from 3 to 4 to reflect this change.
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_82">Boost 1.82 release</a></h2>
+
+<p>
+<ul>
+  <li>Serialization now uses <code>unsigned long</code> instead of
+    <a href="../../serialization/doc/wrappers.html#collection_size_type"><code>collection_size_type</code></a>,
+    and <code>multi_index_container</code> serialization
+    <a href="../../serialization/doc/tutorial.html#versioning">class version</a> has been
+    bumped from 2 to 3 to reflect this change.
+    Reading old archives may fail for custom archive types giving special treatment to
+    <code>collection_size_type</code> values: if this is the case, globally define
+    the macro <code>BOOST_MULTI_INDEX_ENABLE_SERIALIZATION_COMPATIBILITY_V2</code>
+    to ensure backwards compatibility in reading operations.
+  </li>
+  <li>Maintenance work.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_81">Boost 1.81 release</a></h2>
+
+<p>
+<ul>
+  <li>Maintenance work.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_80">Boost 1.80 release</a></h2>
+
+<p>
+<ul>
+  <li>Maintenance work.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_79">Boost 1.79 release</a></h2>
+
+<p>
+<ul>
+  <li>Improved the efficiency of <code>count</code> operations in ranked indices from
+    <code>O(log(n) + count)</code> to <code>O(log(n))</code>.
+    Contributed by Damian Sawicki.
+  </li>
+  <li>Maintenance work.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_78">Boost 1.78 release</a></h2>
+
+<p>
+<ul>
+  <li>Added <code>contains</code> to key-based indices
+    (<a href="https://github.com/boostorg/multi_index/issues/35">issue #35</a>).
+  </li>
+  <li>Added <code>merge</code> operations to key-based indices. The functionality goes beyond
+    the standard specification for (unordered) associative containers in a number of ways,
+    most notably:
+      <ul>
+        <li>The source index can be of any type, including non key-based indices.</li>
+        <li>Partial merge is provided: for instance, <code>x.merge(y,first,last)</code>
+          merges only the elements of <code>y</code> within [<code>first</code>,<code>last</code>).
+        </li>
+      </ul>
+  </li>
+  <li>Previous versions of <code>splice</code> for sequenced and random access indices
+    were destructive, i.e. elements were copy-inserted into the destination and then erased
+    from the source. Now, <code>splice</code> is based on node transfer much as <code>merge</code>
+    in key-based indices, and has been similarly extended to accept source indices of any type:
+    in fact, <code>splice</code> can be regarded as a frontend to the same functionality
+    provided by <code>merge</code> in key-based indices. For reasons of backwards compatibility,
+    the destructive behavior of <code>splice</code> has been retained in the case that the
+    source and destination containers have unequal allocators.
+  </li>
+  <li>The fact has been documented that index iterator types do only depend on <code>node_type</code>
+    and the position of the index in its <code>multi_index_container</code>, 
+    (except for hashed indices, where uniqueness/non-uniqueness is also a dependency). This has
+    implications on the validity of iterators to elements transferred by <code>merge</code> or
+    <code>splice</code>. This property is a variant of what has been called
+    <a href="https://wg21.link/n2980">SCARY iterators</a> in the C++ standard mailing lists.
+    SCARYness is currently (August 2021) not mandated for standard containers.
+  </li>
+  <li>Iterator SCARYness is now also preserved in <a href="tutorial/debug.html#safe_mode">safe mode</a>.
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_77">Boost 1.77 release</a></h2>
+
+<p>
+<ul>
+  <li>Maintenance work.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_74">Boost 1.74 release</a></h2>
+
+<p>
+<ul>
+  <li>
+    Added <a href="tutorial/indices.html#node_handling">node extraction and insertion</a>
+    following the analogous interface of associative containers as introduced in C++17.
+    This feature has also been extended to non key-based indices, in contrast to C++
+    standard library sequence containers, which do not provide such functionality.
+  </li>
+  <li>Clarified documentation on read/write key extractors
+    (<a href="https://github.com/boostorg/multi_index/issues/32">issue #32</a>).
+  </li>
+  <li>Maintenance work.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_73">Boost 1.73 release</a></h2>
+
+<p>
+<ul>
+  <li><code>multi_index_container</code> is now
+    <a href="https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer"><code>AllocatorAware</code></a>.
+  </li>
+  <li>Swapping of internal <code>KeyFromValue</code>, <code>Compare</code>, <code>Hash</code>
+    and <code>Pred</code> objects now selects the appropriate <code>swap</code>
+    function between <code>std::swap</code> and ADL candidates,
+    in accordance with standard specifications in <b>[swappable.requirements]</b>
+    (<a href="https://github.com/boostorg/multi_index/issues/29">issue #29</a>).
+  </li>
+ <li>Provided some internal copy constructors and assignment operators whose default
+    implicit definition is deprecated in C++11 onwards (<b>[depr.impldec]</b>), which
+    was warned about on some compilers. 
+ </li>
+  <li>Maintenance work.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_71">Boost 1.71 release</a></h2>
+
+<p>
+<ul>
+  <li>Added <a href="tutorial/key_extraction.html#x_mem_fun">variants of
+    <code>const_mem_fun</code> and <code>mem_fun</code></a> for
+    differently qualified member functions
+    (<a href="https://github.com/boostorg/multi_index/issues/24">issue #24</a>).
+  </li>
+  <li>Terse <a href="reference/key_extraction.html#key">key</a> specification syntax
+    now correctly handles <code>noexcept</code>-specified member functions
+    (<a href="https://github.com/boostorg/multi_index/issues/24">issue #24</a>).
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_70">Boost 1.70 release</a></h2>
+
+<p>
+<ul>
+  <li><code>size_type</code> and <code>difference_type</code> are now
+    defined as the allocator's same-named types. This will not make any
+    difference in the vast majority of cases, but allows for some degree
+    of control of resulting internal structures via user-defined allocator
+    types (see
+    <a href="https://github.com/boostorg/multi_index/issues/17">issue #17</a>
+    for motivation). For the moment being, this change is <i>not</i> 
+    documented in the reference section (i.e., it has semi-official status).
+  </li>
+  <li>Maintenance work.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_69">Boost 1.69 release</a></h2>
+
+<p>
+<ul>
+  <li>Introduced an alternative
+    <a href="tutorial/key_extraction.html#key">terse key specification syntax</a>
+    for C++17 compliant environments.
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_68">Boost 1.68 release</a></h2>
+
+<p>
+<ul>
+  <li>Containers of moveable but non-copyable elements can now be serialized
+    (ticket <a href="https://svn.boost.org/trac10/ticket/13478">#13478</a>).
+    Thanks to S&eacute;bastien Paris for the report.
+  </li>
+  <li><code>multi_index_container</code>'s default constructor is no longer
+    <code>explicit</code>
+    (ticket <a href="https://svn.boost.org/trac10/ticket/13518">#13518</a>).
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_67">Boost 1.67 release</a></h2>
+
+<p>
+<ul>
+  <li>Elements with overloaded <code>operator&amp;</code> are now fully accepted
+    (ticket <a href="https://svn.boost.org/trac10/ticket/13307">#13307</a>).
+    Thanks to Daniel Frey for his updating
+    <a href="../../utility/operators.htm#deref">Boost.Operators</a> to help
+    fix this issue.
+  </li>
+  <li>Avoided usage of <code>std::allocator</code> members deprecated in C++17.
+    Contributed by Daniela Engert.
+  </li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_66">Boost 1.66 release</a></h2>
+
+<p>
+<ul>
+  <li>Made <code>modify</code> and <code>modify_key</code> more robust so that
+    the modified element is erased if the modifier throws or the rollback
+    functor does not properly restore the element (full discussion at
+    ticket <a href="https://svn.boost.org/trac/boost/ticket/12542">#12542</a>).
+    This is technically backwards incompatible; for instance, the following code:
+<blockquote><pre>
+<span class=identifier>c</span><span class=special>.</span><span class=identifier>modify</span><span class=special>(</span><span class=identifier>c</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),[](</span><span class=keyword>auto</span><span class=special>&amp;){</span><span class=keyword>throw</span> <span class=number>0</span><span class=special>;});</span>  
+</pre></blockquote>
+    keeps the container <code>c</code> untouched in former versions of Boost whereas
+    now <code>c.begin()</code> is erased. Thanks to Jon Kalb for raising the issue.
+  </li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_64">Boost 1.64 release</a></h2>
+
+<p>
+<ul>
+  <li>Fixed a bug related to ambiguous references in the presence of more than
+    one ranked index
+    (ticket <a href="https://svn.boost.org/trac/boost/ticket/12955">#12955</a>).
+  </li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_62">Boost 1.62 release</a></h2>
+
+<p>
+<ul>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_60">Boost 1.60 release</a></h2>
+
+<p>
+<ul>
+  <li>Fixed an interoperability problem with <a href="http://www.qt.io/">Qt</a> due to the
+    optional definition of a macro with name <code>foreach</code> in this framework.</li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_59">Boost 1.59 release</a></h2>
+
+<p>
+<ul>
+  <li>Added <a href="tutorial/indices.html#rnk_indices">ranked indices</a>.</li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_58">Boost 1.58 release</a></h2>
+
+<p>
+<ul>
+  <li>The efficiency of lookup operations has improved in situations where they involve
+    the generation of temporary values of <code>key_type</code>. Consider for instance
+    the following code:
+<blockquote><pre>
+<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>&gt;</span> <span class=special>&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>multi_t</span><span class=special>;</span>
+<span class=special>...</span>
+<span class=identifier>multi_t</span> <span class=identifier>m</span><span class=special>=...;</span>
+<span class=identifier>m</span><span class=special>.</span><span class=identifier>find</span><span class=special>(</span><span class=string>&quot;boost&quot;</span><span class=special>);</span> <span class=comment>// passed a const char*, not a std::string</span>
+</pre></blockquote>
+      In previous versions of the library, the <code>find</code> operation generates
+      several temporary <code>std::string</code>s (one every time an internal comparison is made).
+      In sufficiently advanced compilers, this is now avoided so that only one temporary is
+      created.
+  </li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_57">Boost 1.57 release</a></h2>
+
+<p>
+<ul>
+  <li>When <code>std::tuple</code>s are available, these can be used for lookup operations
+     in indices equipped with composite keys. <code>boost::tuple</code>s are also supported
+     for backwards compatibility.
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_56">Boost 1.56 release</a></h2>
+
+<p>
+<ul>
+  <li>The <code>erase(iterator)</code> member function of hashed indices
+    used to have poor performance under low load conditions due to the requirement
+    that an iterator to the next element must be returned (see ticket
+    <a href="https://svn.boost.org/trac/boost/ticket/4264">#4264</a>). In accordance with
+    the resolution of <a href="http://lwg.github.io/issues/lwg-closed.html#579">LWG
+    issue #579</a>, this problem has been fixed while maintaining the interface of
+    <code>erase</code>, at the expense of using one more
+    word of memory per element. In fact, C++ complexity requirements on unordered
+    associative containers have been improved for hashed indices so that
+    <ul>
+      <li>deletion of a given element is unconditionally constant-time,</li>
+      <li>worst-case performance is not <code>O(n)</code> but <code>O(n<sub>dist</sub>)</code>,
+         where <code>n<sub>dist</sub></code> is the number of non-equivalent elements in the index.
+      </li>
+    </ul>
+    Due to the fact that hashed indices rely on a new data structure, the internal representation of
+    their iterators and local iterators have changed, which affects serialization: their corresponding
+    serialization <a href="../../serialization/doc/tutorial.html#versioning">class version</a> has been
+    bumped from 0 to 1. Old archives involving hashed index (local) iterators can be loaded
+    by Boost 1.56 version of Boost.MultiIndex, but not the other way around.
+  </li>
+  <li>Hashed indices now provide <code>reserve</code>.</li>
+  <li>Hashed indices can now be checked for equality and inequality following the
+    (suitably adapted) C++ standard specification in <b>[unord.req]</b>.</li>
+  <li>The public interface of Boost.MultiIndex provide <code>noexcept</code> specifications
+    where appropriate (for compliant compilers).
+  </li>
+  <li>Improved performance of failed insertions into a <code>multi_index_container</code>.</li>
+  <li>Much internal code aimed at supporting MSVC++ 7.0 and prior has been removed.
+    Compilation times without this legacy code might be slightly faster.
+  </li>
+  <li>Fixed a bug with insertion via iterators dereferencing to rvalues
+    (ticket <a href="https://svn.boost.org/trac/boost/ticket/9665">#9665</a>).
+  </li>
+  <li>Made Boost.MultiIndex compatible with <code>BOOST_BIND_NO_PLACEHOLDERS</code>
+    (ticket <a href="https://svn.boost.org/trac/boost/ticket/9798">#9798</a>).
+  </li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_55">Boost 1.55 release</a></h2>
+
+<p>
+<ul>
+  <li>Boost.MultiIndex has been brought to a higher level of compliance
+  with C++11.
+  <ul>
+      <li><code>multi_index_container</code> is now efficiently movable.</li>
+      <li>Initializer lists supported.</li>
+      <li>Emplace functions provided.</li>
+      <li>Non-copyable elements (such as <code>std::unique_ptr&lt;T&gt;</code>) supported. This includes
+        insertion of a range [<code>first</code>,<code>last</code>) where the iterators point to a type that is
+        convertible to that of the element: no copy construction happens in the process.
+      </li>
+      <li>Random access indices provide <code>shrink_to_fit()</code>.</li>
+  </ul>
+  Refer to the compiler specifics section for limitations
+  on pre-C++11 compilers.
+  </li>
+  <li>The following classes are deprecated:
+  <ul>
+    <li><a href="reference/key_extraction.html#member_offset"><code>member_offset</code></a>,</li>
+    <li><a href="reference/key_extraction.html#const_mem_fun_explicit"><code>const_mem_fun_explicit</code></a>,</li>
+    <li><a href="reference/key_extraction.html#const_mem_fun_explicit"><code>mem_fun_explicit</code></a>,</li>
+    <li><a href="reference/key_extraction.html#composite_key_result_equal_to"><code>composite_key_result_equal_to</code></a>,</li>
+    <li><a href="reference/key_extraction.html#composite_key_result_less"><code>composite_key_result_less</code></a>,</li>
+    <li><a href="reference/key_extraction.html#composite_key_result_greater"><code>composite_key_result_greater</code></a>,</li>
+    <li><a href="reference/key_extraction.html#composite_key_result_hash"><code>composite_key_result_hash</code></a>.</li>
+  </ul>
+  </li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_54">Boost 1.54 release</a></h2>
+
+<p>
+<ul>
+  <li>Suppressed some potential warnings described in
+    tickets <a href="https://svn.boost.org/trac/boost/ticket/8034">#8034</a> and <a href="https://svn.boost.org/trac/boost/ticket/8129">#8129</a>.
+  </li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_49">Boost 1.49 release</a></h2>
+
+<p>
+<ul>
+  <li>Suppressed a potential narrow conversion warning described in
+    ticket <a href="https://svn.boost.org/trac/boost/ticket/3365">#3365</a>.
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_48">Boost 1.48 release</a></h2>
+
+<p>
+<ul>
+  <li>Fixed a compatibility problem with
+    <a href="../../../doc/html/foreach.html">Boost.Foreach</a>
+    (ticket <a href="https://svn.boost.org/trac/boost/ticket/5741">#5741</a>).
+  </li>
+</ul>
+</p>
+
+<h2><a name="boost_1_47">Boost 1.47 release</a></h2>
+
+<p>
+<ul>
+  <li>Fixed an ADL problem in
+    <a href="reference/key_extraction.html#composite_key_compare"><code>composite_key_compare</code></a>
+    related with <a href="../../../doc/html/ref.html">Boost.Ref</a>.
+  </li>
+  <li>Maintenance fixes.</li>
+</ul>
+</p>
+
+<h2><a name="boost_1_44">Boost 1.44 release</a></h2>
+
+<p>
+<ul>
+  <li>
+    Fixed a bug preventing the use of <code>modify_key</code> with
+    rollback in <a href="reference/ord_indices.html#modify_key">ordered</a> and
+    <a href="reference/hash_indices.html#modify_key">hashed</a> indices when
+    <code>Modifier</code> and <code>Rollback</code> are different types
+    (ticket <a href="https://svn.boost.org/trac/boost/ticket/4130">#4130</a>).
+  </li>
+</ul>
+</p>
+
 <h2><a name="boost_1_43">Boost 1.43 release</a></h2>
 
 <p>
@@ -286,8 +842,7 @@ Acknowledgements
     Boost 1.32 release. This results in much shorter and more readable error
     messages and has also a beneficial impact on compilers with strict limits on
     symbol name lengths. Additionally, a section on further
-    <a href="compiler_specifics.html#symbol_reduction">reduction of symbol name
-    lengths</a> has been added.
+    reduction of symbol name lengths has been added.
   </li>
   <li>Restructured some parts of the documentation, new examples.</li>
   <li>Maintenance fixes.</li>
@@ -308,9 +863,9 @@ Acknowledgements
 
 <br>
 
-<p>Revised February 3rd 2010</p>
+<p>Revised June 27th 2026</p>
 
-<p>&copy; Copyright 2003-2010 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2026 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/style.css

@@ -1,4 +1,4 @@
-/* Copyright 2003-2004 Joaqu匤 M L�ez Mu�z.
+/* Copyright 2003-2004 Joaquín M López Muñoz.
  * Distributed under the Boost Software License, Version 1.0.
  * (See accompanying file LICENSE_1_0.txt or copy at
  * http://www.boost.org/LICENSE_1_0.txt)

doc/tests.html

@@ -43,41 +43,50 @@ with some of the least common features offered by Boost.MultiIndex.
   <th>Description</th>
 </tr>
 <tr>
+  <td><a href="../test/test_alloc_awareness.cpp"><code>test_alloc_awareness.cpp</code></a></td>
+  <td>Checks <a href="https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer">allocator
+  awareness</a>.</td>
+</tr>
+<tr class="odd_tr">
   <td><a href="../test/test_basic.cpp"><code>test_basic.cpp</code></a></td>
   <td>Simple program along the lines of the employees example studied in the
   tutorial.</td>
 </tr>
-<tr class="odd_tr">
+<tr>
   <td><a href="../test/test_capacity.cpp"><code>test_capacity.cpp</code></a></td>
   <td><code>empty</code>, <code>size</code>, <code>resize</code>
-  (non key-based indices) and <code>reserve</code>/<code>capacity</code>
+  (non-key-based indices) and <code>reserve</code>/<code>capacity</code>
   (random access indices only).</td>
 </tr>
-<tr>
+<tr class="odd_tr">
   <td><a href="../test/test_comparison.cpp"><code>test_comparison.cpp</code></a></td>
   <td>Comparison between indices.</td>
 </tr>
-<tr class="odd_tr">
+<tr>
   <td><a href="../test/test_composite_key.cpp"><code>test_composite_key.cpp</code></a></td>
   <td><code>composite_key</code> and <code>composite_key_compare</code>.</td>
 </tr>
-<tr>
+<tr class="odd_tr">
   <td><a href="../test/test_conv_iterators.cpp"><code>test_conv_iterators.cpp</code></a></td>
   <td>Checks convertibility of non-constant to constant iterators.</td>
 </tr>
-<tr class="odd_tr">
+<tr>
   <td><a href="../test/test_copy_assignment.cpp"><code>test_copy_assignment.cpp</code></a></td>
   <td>Various forms of assignment: copy, <code>operator =</code>, insertion,
-  (non key-based indices only) <code>assign</code> .
+  (non key-based indices only) <code>assign</code>.
 </tr>
-<tr>
+<tr class="odd_tr">
   <td><a href="../test/test_hash_ops.cpp"><code>test_hash_ops.cpp</code></a></td>
   <td>Hashing operations.</td>
 </tr>
-<tr class="odd_tr">
+<tr>
   <td><a href="../test/test_iterators.cpp"><code>test_iterators.cpp</code></a></td>
   <td>Constant and non-constant iterators and their reverse variants.</td>
 </tr>
+<tr class="odd_tr">
+  <td><a href="../test/test_key.cpp"><code>test_key.cpp</code></a></td>
+  <td>Terse key specification syntax.</td>
+</tr>
 <tr>
   <td><a href="../test/test_key_extractors.cpp"><code>test_key_extractors.cpp</code></a></td>
   <td>Covers all use cases of key extractors shipped with the library.</td>
@@ -92,20 +101,28 @@ with some of the least common features offered by Boost.MultiIndex.
 </tr>
 <tr class="odd_tr">
   <td><a href="../test/test_mpl_ops.cpp"><code>test_mpl_ops.cpp</code></a></td>
-  <td>Metaprogramming manipulations of <code>multi_index_container</code> types.</td>
+  <td>Boost.MPL interoperability (when <code> BOOST_MULTI_INDEX_ENABLE_MPL_SUPPORT</code> is enabled).</td>
 </tr>
 <tr>
+  <td><a href="../test/test_node_handling.cpp"><code>test_node_handling.cpp</code></a></td>
+  <td>Operations involving node extraction and insertion.</td>
+</tr>
+<tr class="odd_tr">
   <td><a href="../test/test_observers.cpp"><code>test_observers.cpp</code></a></td>
   <td>Checks observer member functions of ordered and hashed indices.</td>
 </tr>
-<tr class="odd_tr">
+<tr>
   <td><a href="../test/test_projection.cpp"><code>test_projection.cpp</code></a></td>
   <td>Projection of iterators among indices.</td>
 </tr>
-<tr>
+<tr class="odd_tr">
   <td><a href="../test/test_range.cpp"><code>test_range.cpp</code></a></td>
   <td>Exercises the <code>range</code> facility (ordered indices only).</td>
 </tr>
+<tr>
+  <td><a href="../test/test_rank_ops.cpp"><code>test_rank_ops.cpp</code></a></td>
+  <td>Specific operations of ranked indices.</td>
+</tr>
 <tr class="odd_tr">
   <td><a href="../test/test_rearrange.cpp"><code>test_rearrange.cpp</code></a></td>
   <td>Rearrange functions of sequenced and random access indices.</td>
@@ -149,10 +166,9 @@ Future work
 
 <br>
 
+<p>Revised October 26th 2025</p>
 
-<p>Revised July 11th 2007</p>
-
-<p>&copy; Copyright 2003-2007 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2025 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/tutorial/basics.html

@@ -114,7 +114,7 @@ construct easily becomes unmaintainable.
 <p>
 Boost.MultiIndex features <a href="#ord_indices"><i>ordered indices</i></a>, which
 sort the elements according to a particular key, and are designed to help programmers
-in need of sequences of elements for which <i>more than one</i> sorting criteria are
+in need of sequences of elements for which <i>more than one</i> sorting criterion is
 relevant. We do so by defining a <code>multi_index_container</code>
 instantiation composed of several ordered indices: each index, viewed in isolation,
 behaves much as an ordered <code>std::set</code> (or <code>std::multiset</code>), whilst
@@ -268,7 +268,7 @@ does not show any advantage. The code for inserting the text into the container
 does not change as sequenced indices provide an interface similar to that of
 <code>std::list</code> (no explicit access to this index through
 <code>get&lt;0>()</code> is needed as <code>multi_index_container</code> inherits the
-functionality of index #0.) But the specification of an additional ordered index
+functionality of index #0). But the specification of an additional ordered index
 allows us to implement <code>occurrences</code> and <code>delete_word</code>
 in a much more efficient manner:
 </p>
@@ -417,7 +417,7 @@ for instance,
   <li><code>employee_set::nth_index&lt;1>::type</code> is the type of
     index #1,</li>
   <li><code>employee_set::index&lt;name>::type</code> is the type of the index
-    tagged with <code>name</code> (the same index #1 in this case.)</li>
+    tagged with <code>name</code> (the same index #1 in this case).</li>
 </ul>
 <code>get()</code>, on the other hand, is overloaded to serve both styles of access:
 </p>
@@ -453,7 +453,7 @@ in the previous example can be rewritten to hold two different tags
 
 <p>
 Each index of a <code>multi_index_container</code> uses its own
-iterator types, which are different from those of another indices. As is
+iterator types, which are different from those of other indices. As is
 the rule with STL containers, these iterators are defined as nested
 types of the index:
 </p>
@@ -474,6 +474,18 @@ means of user-defined <code>typedef</code>s:
   <span class=identifier>es</span><span class=special>.</span><span class=identifier>get</span><span class=special>&lt;</span><span class=number>1</span><span class=special>&gt;().</span><span class=identifier>find</span><span class=special>(</span><span class=string>&quot;Judy Smith&quot;</span><span class=special>);</span>
 </pre></blockquote>
 
+<p>
+The iterators provided by every index are <i>constant</i>, that is, the elements they point to
+cannot be mutated directly. This  follows the interface of <code>std::set</code> for ordered
+indices but might come as a surprise for other types such as sequenced indices, which are modeled after
+<code>std::list</code>, where this limitation does not happen. This seemingly odd behavior
+is imposed by the way <code>multi_index_container</code>s work; if elements were
+allowed to be mutated indiscriminately, we could introduce inconsistencies
+in the ordered indices of the <code>multi_index_container</code> without the container
+being notified about it. Element modification is properly done by means of
+<a href="#ord_updating">update operations</a> on any index.
+</p>
+
 <h2>
 <a name="index_types">Index types</a>
 </h2>
@@ -484,16 +496,18 @@ Currently, Boost.MultiIndex provides the following index types:
   <li>Ordered indices sort the elements like <code>std::set</code>s do and
     provide a similar interface. There are <i>unique</i> and <i>non-unique</i>
     variants: the former do not allow for duplicates, while the latter permit
-    them (like <code>std::multiset</code>.)</li>
+    them (like <code>std::multiset</code>).</li>
+  <li>Ranked indices are a variation of ordered indices providing extra capabilities
+    for querying and accessing elements based on their <i>rank</i> (the numerical position
+    they occupy in the index).
+  </li>
   <li>Sequenced indices are modeled after the semantics and interface of
     <code>std::list</code>: they arrange the elements as if in a bidirectional
     list.</li>
   <li>Hashed indices provide fast access to the elements through hashing
-    tecnhiques, in a similar way as non-standard <code>hash_set</code>s provided
-    by some vendors. Recently, <i>unordered associative containers</i> have been
-    proposed as part of an extension of the C++ standard library known
-    in the standardization commitee as TR1. Hashed indices closely model this
-    proposal.</li>
+    techniques, in a similar way as unordered associative containers
+    <code>std::unordered_set</code> (if duplicates are not allowed) and
+    <code>std::unordered_multiset</code> (if they are).</li>
   <li>Random access indices provide an interface similar to that of
     sequenced indices, and additionally feature random access iterators
     and positional access to the elements.</li>
@@ -752,7 +766,7 @@ Here we are not only passing IDs instead of <code>employee</code> objects:
 an alternative comparison predicate is passed as well. In general, lookup operations
 of ordered indices are overloaded to accept
 <a href="../reference/ord_indices.html#set_operations"><i>compatible sorting
-criteria</i></a>. The somewhat cumbersone definition of compatibility in this context
+criteria</i></a>. The somewhat cumbersome definition of compatibility in this context
 is given in the reference, but roughly speaking we say that a comparison predicate
 <code>C1</code> is compatible with <code>C2</code> if any sequence sorted by
 <code>C2</code> is also sorted with respect to <code>C1</code>.
@@ -787,7 +801,7 @@ The following shows a more interesting use of compatible predicates:
 Range searching, i.e. the lookup of all elements in a given interval, is a very
 frequent operation for which standard <code>lower_bound</code> and
 <code>upper_bound</code> can be resorted to, though in a cumbersome manner.
-For instance, the following code retrieves the elements of an
+For instance, the following code retrieves the elements of a
 <code>multi_index_container&lt;double></code> in the interval [100,200]:
 </p>
 
@@ -1060,9 +1074,9 @@ same way as <code>std::list</code> permits. The interface of sequenced indices
 is thus designed upon that of <code>std::list</code>; nearly every operation
 provided in the standard container is replicated here, occasionally with changes
 in the syntax and/or semantics to cope with the constraints imposed by
-Boost.MultiIndex. In particular, there is an important limitation of sequenced
-indices with respect to <code>std::list</code>s, namely that elements of an
-<code>multi_index_container</code> are not mutable through an iterator:
+Boost.MultiIndex. An important difference, commented <a href="#iterator_access">above</a>,
+is the fact that the values pointed to by sequenced index iterators are treated
+as <i>constant</i>:
 </p>
 
 <blockquote><pre>
@@ -1076,11 +1090,7 @@ indices with respect to <code>std::list</code>s, namely that elements of an
 </pre></blockquote>
 
 <p>
-That is, iterators of a sequenced index (of all types of indices, actually)
-point to constant elements. This limitation might come as a surprise, but
-it is imposed by the way <code>multi_index_container</code>s work; if elements were
-allowed to be changed in this manner, we could introduce inconsistencies
-in other ordered indices of the <code>multi_index_container</code>. Element modification
+As with any other type of index, element modification
 can nevertheless be done by means of
 <a href="#seq_updating">update operations</a>.
 </p>
@@ -1219,7 +1229,7 @@ Appropriate instantiations of <code>multi_index_container</code> can in fact sim
 <code>std::set</code>, <code>std::multiset</code> and (with more limitations)
 <code>std::list</code>, as shown in the
 <a href="techniques.html#emulate_std_containers">techniques</a>
-section. These simulations are as nearly as efficient as the original STL
+section. These simulations are nearly as efficient as the original STL
 containers; consult the <a href="../reference/index.html">reference</a> for further
 information on complexity guarantees and the
 <a href="../performance.html">performance section</a> for practical measurements of
@@ -1240,9 +1250,9 @@ Index types
 
 <br>
 
-<p>Revised November 7th 2008</p>
+<p>Revised August 16th 2021</p>
 
-<p>&copy; Copyright 2003-2008 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2021 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/tutorial/creation.html

@@ -201,7 +201,7 @@ than strictly required by the C++ standard, as explained in detail in the
 An important type of non-standard allocators supported are those provided by the
 <a href="../../../interprocess/index.html">Boost Interprocess Library</a>;
 this opens up the possibility of placing <code>multi_index_container</code>s
-in shared memory.
+and their iterators in shared memory.
 </p>
 
 <blockquote><pre>
@@ -340,9 +340,9 @@ Debugging support
 
 <br>
 
-<p>Revised July 17th 2007</p>
+<p>Revised June 27th 2026</p>
 
-<p>&copy; Copyright 2003-2007 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2026 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/tutorial/debug.html

@@ -34,6 +34,7 @@ Techniques
   <li><a href="#safe_mode">Safe mode</a>
     <ul>
        <li><a href="#serialization_and_safe_mode">Serialization and safe mode</a></li>
+       <li><a href="#shared_memory_and_safe_mode">Containers placed in shared memory</a></li>
     </ul>
   </li>
   <li><a href="#invariant_check">Invariant-checking mode</a></li>
@@ -89,7 +90,7 @@ and functions of the library.
 Boost.MultiIndex safe mode is set by globally defining the macro
 <code>BOOST_MULTI_INDEX_ENABLE_SAFE_MODE</code>. Error conditions
 are checked via the macro <code>BOOST_MULTI_INDEX_SAFE_MODE_ASSERT</code>, which
-by default resolves to a call to <a href="../../../../libs/utility/assert.html">
+by default resolves to a call to <a href="../../../../libs/assert">
 <code>BOOST_ASSERT</code></a>.
 </p>
 
@@ -125,7 +126,8 @@ is one value of the <code>safe_mode::error_code</code> enumeration:
   <span class=identifier>invalid_range</span><span class=special>,</span>                <span class=comment>// last not reachable from first</span>
   <span class=identifier>inside_range</span><span class=special>,</span>                 <span class=comment>// iterator lies within a range (and it mustn't)</span>
   <span class=identifier>out_of_bounds</span><span class=special>,</span>                <span class=comment>// move attempted beyond container limits</span>
-  <span class=identifier>same_container</span>                <span class=comment>// containers ought to be different</span>
+  <span class=identifier>same_container</span><span class=special>,</span>               <span class=comment>// containers ought to be different</span>
+  <span class=identifier>unequal_allocators</span>            <span class=comment>// allocators ought to be equal</span>
 <span class=special>};</span>
 
 <span class=special>}</span> <span class=comment>// namespace multi_index::safe_mode</span>
@@ -161,7 +163,7 @@ asserting:
 </pre></blockquote>
 
 <p>
-Other possibilites, like outputting to a log or firing some kind of alert, are
+Other possibilities, like outputting to a log or firing some kind of alert, are
 also implementable.
 </p>
 
@@ -198,6 +200,26 @@ checked value by using the following workaround:
 <span class=identifier>it</span><span class=special>=</span><span class=identifier>es</span><span class=special>.</span><span class=identifier>project</span><span class=special>&lt;</span><span class=number>1</span><span class=special>&gt;(</span><span class=identifier>it</span><span class=special>);</span>
 </pre></blockquote>
 
+<h3><a name="shared_memory_and_safe_mode">Containers placed in shared memory</a></h3>
+
+<p>
+In general, safe mode <b>can't be used</b> when placing <code>multi_index_container</code>s
+in shared memory for interprocess communication 
+(as in <a href="../examples.html#example12">this example</a>).
+There are some fundamental reasons for this limitation:
+<ul>
+  <li>
+    Operations from one process may invalidate or change ownership for iterators
+    living in non-shared memory within another process: safe-mode machinery can't 
+    access those for bookkeeping.
+  </li>
+  <li>
+    Safe mode uses internal mutexes not suitable for interprocess
+    synchronization or persistence to a memory-mapped file.
+  </li>
+</ul>
+</p>
+
 <h2><a name="invariant_check">Invariant-checking mode</a></h2>
 
 <p>
@@ -213,7 +235,7 @@ internal invariants of the data structures managed are preserved.
 If an invariant test fails, Boost.MultiIndex will indicate the failure
 by means of the unary macro <code>BOOST_MULTI_INDEX_INVARIANT_ASSERT</code>.
 Unless the user provides a definition for this macro, it defaults to
-<a href="../../../../libs/utility/assert.html">
+<a href="../../../../libs/assert">
 <code>BOOST_ASSERT</code></a>. Any assertion of this kind should
 be regarded in principle as a bug in the library. Please report such
 problems, along with as much contextual information as possible, to the
@@ -239,9 +261,9 @@ Techniques
 
 <br>
 
-<p>Revised February 6th 2006</p>
+<p>Revised June 27th 2026</p>
 
-<p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2026 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/tutorial/index.html

@@ -101,7 +101,7 @@ indices are met.
 
 <p>
 All the public types of Boost.MultiIndex reside in namespace <code>::boost::multi_index</code>.
-Additionaly, the main class template <code>multi_index_container</code> and global functions
+Additionally, the main class template <code>multi_index_container</code> and global functions
 <code>get</code> and <code>project</code> are lifted to namespace <code>::boost</code>
 by means of <code>using</code> declarations. For brevity of exposition, the fragments
 of code in the documentation are written as if the following declarations were in effect:

doc/tutorial/indices.html

@@ -31,6 +31,12 @@ Key extraction
 
 <ul>
   <li><a href="#classification">Classification</a>
+  <li><a href="#rnk_indices">Ranked indices</a>
+    <ul>
+      <li><a href="#rnk_spec">Specification</a></li>
+      <li><a href="#rnk_ops">Rank operations</a></li>
+    </ul>
+  </li>
   <li><a href="#hashed_indices">Hashed indices</a>
     <ul>
       <li><a href="#hash_unique_non_unique">Unique and non-unique variants</a></li>
@@ -49,13 +55,14 @@ Key extraction
   </li>
   <li><a href="#rearrange">Index rearranging</a></li>
   <li><a href="#iterator_to"><code>iterator_to</code></a></li>
+  <li><a href="#node_handling">Node handling operations</a></li>
   <li><a href="#ordered_node_compression">Ordered indices node compression</a></li>
 </ul>
 
 <h2><a name="classification">Classification</a></h2>
 
 <p>
-Boost.MultiIndex provides six different index types, which can be classified as
+Boost.MultiIndex provides eight different index types, which can be classified as
 shown in the table below. <a href="basics.html#ord_indices">Ordered</a> and
 <a href="basics.html#seq_indices">sequenced</a> indices,
 which are the most commonly used, have been explained in the basics section;
@@ -71,13 +78,19 @@ some added benefits, functionally or in the area of performance.
   <th align="center">specifier</th>
 </tr>
 <tr>
-  <td align="center" rowspan="4">&nbsp;&nbsp;key-based&nbsp;&nbsp;</td>
-  <td align="center" rowspan="2">&nbsp;&nbsp;ordered&nbsp;&nbsp;</td>
+  <td align="center" rowspan="6">&nbsp;&nbsp;key-based&nbsp;&nbsp;</td>
+  <td align="center" rowspan="4">&nbsp;&nbsp;ordered&nbsp;&nbsp;</td>
   <td align="center">&nbsp;&nbsp;<code>ordered_unique</code>&nbsp;&nbsp;</td>
 </tr>
 <tr class="odd_tr">
   <td align="center">&nbsp;&nbsp;<code>ordered_non_unique</code>&nbsp;&nbsp;</td>
 </tr>
+<tr>
+  <td align="center">&nbsp;&nbsp;<code>ranked_unique</code>&nbsp;&nbsp;</td>
+</tr>
+<tr class="odd_tr">
+  <td align="center">&nbsp;&nbsp;<code>ranked_non_unique</code>&nbsp;&nbsp;</td>
+</tr>
 <tr>
   <td align="center" rowspan="2">&nbsp;&nbsp;hashed&nbsp;&nbsp;</td>
   <td align="center">&nbsp;&nbsp;<code>hashed_unique</code>&nbsp;&nbsp;</td>
@@ -108,6 +121,114 @@ modeled after the interface of <code>std::list</code>, are the customary
 example of a non key-based index.
 </p>
 
+<h2><a name="rnk_indices">Ranked indices</a></h2>
+
+<p>
+Suppose we have a <code>std::multiset</code> of numbers and we want to output
+the values above the 75h <a href="http://en.wikipedia.org/wiki/Percentile">percentile</a>:
+</p>
+
+<blockquote><pre>
+<span class=keyword>typedef</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>multiset</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=identifier>int_multiset</span><span class=special>;</span>
+
+<span class=keyword>void</span> <span class=identifier>output_above_75th_percentile</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>int_multiset</span><span class=special>&amp;</span> <span class=identifier>s</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=identifier>int_multiset</span><span class=special>::</span><span class=identifier>const_iterator</span> <span class=identifier>it</span><span class=special>=</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>begin</span><span class=special>();</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>advance</span><span class=special>(</span><span class=identifier>it</span><span class=special>,</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>size</span><span class=special>()*</span><span class=number>3</span><span class=special>/</span><span class=number>4</span><span class=special>);</span> <span class=comment>// linear on s.size();</span>
+
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>copy</span><span class=special>(</span><span class=identifier>it</span><span class=special>,</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>ostream_iterator</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>cout</span><span class=special>,</span><span class=string>&quot;\n&quot;</span><span class=special>));</span>
+<span class=special>}</span>
+</pre></blockquote>
+
+<p>
+The problem with this code is that getting to the beginning of the desired subsequence
+involves a linear traversal of the container. Ranked indices provide the mechanisms to do this
+much faster: 
+</p>
+
+<blockquote><pre>
+<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=keyword>int</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=identifier>ranked_non_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>int_multiset</span><span class=special>;</span>
+
+<span class=keyword>void</span> <span class=identifier>output_above_75th_percentile</span><span class=special>(</span><span class=keyword>const</span> <span class=identifier>int_multiset</span><span class=special>&amp;</span> <span class=identifier>s</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=identifier>int_multiset</span><span class=special>::</span><span class=identifier>const_iterator</span> <span class=identifier>it</span><span class=special>=</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>nth</span><span class=special>(</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>size</span><span class=special>()*</span><span class=number>3</span><span class=special>/</span><span class=number>4</span><span class=special>);</span> <span class=comment>// logarithmic</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>copy</span><span class=special>(</span><span class=identifier>it</span><span class=special>,</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>ostream_iterator</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>cout</span><span class=special>,</span><span class=string>&quot;\n&quot;</span><span class=special>));</span>
+<span class=special>}</span>
+</pre></blockquote>
+
+<p>
+<code>nth(n)</code> returns an iterator to the element whose <i>rank</i>, i.e. its distance
+from the beginning of the index, is <code>n</code>, and does so efficiently in logarithmic time.
+Conversely, <code>rank(it)</code> computes in logarithmic time the rank of the element
+pointed to by <code>it</code>, or <code>size()</code> if <code>it==end()</code>.
+</p>
+
+<blockquote><pre>
+<span class=identifier>int_multiset</span><span class=special>::</span><span class=identifier>iterator</span>  <span class=identifier>it</span><span class=special>=</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>insert</span><span class=special>(</span><span class=number>10</span><span class=special>).</span><span class=identifier>first</span><span class=special>;</span>
+<span class=identifier>int_multiset</span><span class=special>::</span><span class=identifier>size_type</span> <span class=identifier>r</span><span class=special>=</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>rank</span><span class=special>(</span><span class=identifier>it</span><span class=special>);</span> <span class=comment>// rank of 10;</span>
+</pre></blockquote>
+
+<p>
+Ranked indices provide the same interface as ordered indices plus several rank-related operations.
+The cost of this extra functionality is higher memory consumption due to some internal additional
+data (one word per element) and somewhat longer execution times in insertion and erasure
+&#8212;in particular, erasing an element takes time proportional to <code>log(n)</code>, where
+<code>n</code> is the number of elements in the index, whereas for ordered indices this time is
+constant.
+The <a href="../reference/rnk_indices.html">reference</a> describes these indices in complete detail.
+</p>
+
+<h3><a name="rnk_spec">Specification</a></h3>
+
+<p>
+The specification of ranked indices is done exactly as with <a href="basics.html#ord_spec">ordered indices</a>,
+except that <code>ranked_unique</code> and <code>ranked_non_unique</code> are used instead.
+</p>
+
+<blockquote><pre>
+<span class=special>(</span><span class=identifier>ranked_unique</span> <span class=special>|</span> <span class=identifier>ranked_non_unique</span><span class=special>)
+  </span><span class=special>&lt;[</span><i>(tag)</i><span class=special>[,</span><i>(key extractor)</i><span class=special>[,</span><i>(comparison predicate)</i><span class=special>]]]&gt;</span>
+
+<span class=special>(</span><span class=identifier>ranked_unique</span> <span class=special>|</span> <span class=identifier>ranked_non_unique</span><span class=special>)</span>
+  <span class=special>&lt;[</span><i>(key extractor)</i><span class=special>[,</span><i>(comparison predicate)</i><span class=special>]]&gt;</span>
+</pre></blockquote>
+
+<h3><a name="rnk_ops">Rank operations</a></h3>
+
+<p>
+Besides <code>nth</code> and <code>rank</code>, ranked indices provide member functions
+<ul>
+  <li><code>find_rank</code>,</li>
+  <li><code>lower_bound_rank</code>,</li>
+  <li><code>upper_bound_rank</code>,</li>
+  <li><code>equal_range_rank</code> and </li>
+  <li><code>range_rank</code></li>
+</ul>
+that behave as their normal
+<a href="basics.html#special_lookup">lookup</a> and <a href="basics.html#range">range retrieval</a>
+counterparts (<code>find</code>, <code>lower_bound</code> etc.) but return ranks rather than iterators.
+</p>
+
+<blockquote><pre>
+<span class=keyword>void</span> <span class=identifier>percentile</span><span class=special>(</span><span class=keyword>int</span> <span class=identifier>n</span><span class=special>,</span><span class=keyword>const</span> <span class=identifier>int_multiset</span><span class=special>&amp;</span> <span class=identifier>s</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>cout</span><span class=special>&lt;&lt;</span><span class=identifier>n</span><span class=special>&lt;&lt;</span><span class=string>&quot; lies in the &quot;</span><span class=special>&lt;&lt;</span>
+    <span class=identifier>s</span><span class=special>.</span><span class=identifier>upper_bound_rank</span><span class=special>(</span><span class=identifier>n</span><span class=special>)*</span><span class=number>100.0</span><span class=special>/</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>size</span><span class=special>()&lt;&lt;</span><span class=string>&quot; percentile\n&quot;</span><span class=special>;</span>
+<span class=special>}</span>
+</pre></blockquote>
+
+<p>
+You might think that <code>upper_bound_rank(n)</code> is mere shorthand for
+<code>rank(upper_bound(n))</code>: in reality, though, you should prefer using
+<code>*_rank</code> operations directly as they run faster than the
+alternative formulations.
+</p>
+
 <h2><a name="hashed_indices">Hashed indices</a></h2>
 
 <p>
@@ -162,25 +283,10 @@ determining whether a hashed index is preferred over an ordered one.
 </p>
 
 <p>
-If you are familiar with non-standard <code>hash_set</code>s provided
-by some compiler vendors, then learning to use hashed indices should be straightforward.
-However, the interface of hashed indices is modeled after the specification
-for unordered associative containers by the
-<a href="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf">C++ Standard
-Library Technical Report</a> (TR1),
-which differs in some significant aspects from existing pre-standard
-implementations:
-<ul>
-  <li>As there is no notion of ordering between keys, the <a href="#hash_lookup">lookup
-    interface</a> does not offer <code>lower_bound</code> or <code>upper_bound</code>
-    member functions (unlike Dinkumware's solution.)</li>
-  <li>A set of member functions is provided for handling the internal
-    bucket structure on which hashed indices rely. This includes facilities
-    for <a href="../reference/hash_indices.html#hash_policy">rehashing</a>,
-    control of the load factor (number of elements divided by number of buckets),
-    and inspection of the buckets contents. Pre-standard implementations
-    do not have such an extensive functionality.</li> 
-</ul>
+Hashed indices replicate the interface of <code>std::unordered_set</code> and
+<code>std::unordered_multiset</code>, with only minor differences where required
+by the general constraints of <code>multi_index_container</code>s, and provide
+additional useful capabilities like in-place updating of elements.
 Check the <a href="../reference/hash_indices.html">reference</a> for a
 complete specification of the interface of hashed indices,
 and <a href="../examples.html#example8">example 8</a> and
@@ -222,9 +328,8 @@ element.
 
 <p>
 The hash function is the very core of the fast lookup capabilities of this type of
-indices: a hasher
-is just a <a href="http://www.sgi.com/tech/stl/UnaryFunction.html"><code>Unary
-Function</code></a> returning an <code>std::size_t</code> value for any given
+indices: a hasher is just a unary function object
+returning an <code>std::size_t</code> value for any given
 key. In general, it is impossible that every key map to a different hash value, for
 the space of keys can be greater than the number of permissible hash codes: what
 makes for a good hasher is that the probability of a collision (two different
@@ -250,7 +355,7 @@ in practice greatly reduces the freedom in choosing an equality predicate.
 
 <p>
 The lookup interface of hashed indices consists in member functions
-<code>find</code>, <code>count</code> and <code>equal_range</code>.
+<code>find</code>, <code>count</code>, <code>contains</code> and <code>equal_range</code>.
 Note that <code>lower_bound</code> and <code>upper_bound</code> are not
 provided, as there is no intrinsic ordering of keys in this type of indices.
 </p>
@@ -353,19 +458,18 @@ member functions, with the same functionality as in ordered indices.
 Due to the internal constraints imposed by the Boost.MultiIndex framework,
 hashed indices provide guarantees on iterator validity and
 exception safety that are actually stronger than required by the
-C++ Standard Library Technical Report (TR1) with respect
-to unordered associative containers:
+C++ standard with respect to unordered associative containers:
 <ul>
   <li>Iterator validity is preserved in any case during insertion or rehashing:
-    TR1 allows for iterator invalidation when a rehash (implicit or explicit)
+    C++ unordered associative containers can invalidate iterators when a rehash (implicit or explicit)
     is performed.</li>
   <li>Erasing an element or range of elements via iterators does not throw ever,
     as the internal hash function and equality predicate objects are not actually
     invoked.</li>
   <li><code>rehash</code> provides the strong exception safety guarantee
-    unconditionally. TR1 only warrants it if the internal hash function and
+    unconditionally. The standard only warrants it for unordered associative containers if the internal hash function and
     equality predicate objects do not throw. The somewhat surprising consequence
-    is that a TR1-compliant unordered associative container might erase
+    is that a standard-compliant <code>std::unordered_set</code> might erase
     elements if an exception is thrown during rehashing!</li>
 </ul>
 In general, these stronger guarantees play in favor of the user's convenience,
@@ -528,15 +632,16 @@ indices), but induces important limitations in non key-based indices:
   <span class=special>&gt;</span>
 <span class=special>&gt;</span> <span class=identifier>container</span><span class=special>;</span>	
 
-<span class=identifier>container</span> <span class=identifier>c</span><span class=special>;</span>
+<span class=identifier>container</span>    <span class=identifier>c</span><span class=special>;</span>
+<span class=identifier>std</span><span class=special>::</span><span class=identifier>mt19937</span> <span class=identifier>rng</span><span class=special>;</span>
 <span class=special>...</span>
 <span class=comment>// compiler error: assignment to read-only objects</span>
-<span class=identifier>std</span><span class=special>::</span><span class=identifier>random_shuffle</span><span class=special>(</span><span class=identifier>c</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>c</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+<span class=identifier>std</span><span class=special>::</span><span class=identifier>shuffle</span><span class=special>(</span><span class=identifier>c</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>c</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>rng</span><span class=special>);</span>
 </pre></blockquote>
 
 <p>
 What is unfortunate about the previous example is that the operation
-performed by <code>std::random_shuffle</code> is potentially compatible
+performed by <code>std::shuffle</code> is potentially compatible
 with <code>multi_index_container</code> invariants, as its result can be
 described by a permutation of the elements in the random access index
 with no actual modifications to the elements themselves. There are many
@@ -551,7 +656,7 @@ a preliminary concept: a <i>view</i> of an index is defined as
 some iterator range [<code>first</code>,<code>last</code>) over the
 elements of the index such that all its elements are contained in the
 range exactly once. Continuing with our example, we can apply
-<code>std::random_suffle</code> on an ad hoc view obtained from the
+<code>std::shuffle</code> on an ad hoc view obtained from the
 container:
 </p>
 
@@ -561,17 +666,16 @@ container:
 <span class=identifier>std</span><span class=special>::</span><span class=identifier>vector</span><span class=special>&lt;</span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>reference_wrapper</span><span class=special>&lt;</span><span class=keyword>const</span> <span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;</span> <span class=identifier>v</span><span class=special>;</span>
 <span class=identifier>BOOST_FOREACH</span><span class=special>(</span><span class=keyword>const</span> <span class=keyword>int</span><span class=special>&amp;</span> <span class=identifier>i</span><span class=special>,</span><span class=identifier>c</span><span class=special>)</span><span class=identifier>v</span><span class=special>.</span><span class=identifier>push_back</span><span class=special>(</span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>cref</span><span class=special>(</span><span class=identifier>i</span><span class=special>));</span>
 
-<span class=comment>// this compiles OK, as reference_wrappers are assignable</span>
-<span class=identifier>std</span><span class=special>::</span><span class=identifier>random_shuffle</span><span class=special>(</span><span class=identifier>v</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>v</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+<span class=comment>// this compiles OK, as reference_wrappers are swappable</span>
+<span class=identifier>std</span><span class=special>::</span><span class=identifier>shuffle</span><span class=special>(</span><span class=identifier>v</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>v</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>rng</span><span class=special>);</span>
 </pre></blockquote>
 
 <p>
 Elements of <code>v</code> are <code>reference_wrapper</code>s (from
 <a href="../../../../doc/html/ref.html">Boost.Ref</a>) to the actual elements
 in the multi-index container. These objects still do not allow modification
-of the referenced entities, but they are
-<a href="http://www.sgi.com/tech/stl/Assignable.html"><code>Assignable</code></a>,
-which is the only requirement <code>std::random_suffle</code> imposes. Once
+of the referenced entities, but they are swappable,
+which is the only requirement <code>std::shuffle</code> imposes. Once
 we have our desired rearrange stored in the view, we can transfer it to
 the container with
 </p>
@@ -653,7 +757,7 @@ specifically designed for handling the elements of a container,
 and not only benefit from the iterator orientation of container interfaces,
 but are also capable of exposing many more programming bugs than raw pointers, both
 at compile and run time. <code>iterator_to</code> is thus meant to be used
-in scenarios where access via iterators is not suitable or desireable:
+in scenarios where access via iterators is not suitable or desirable:
 <ul>
   <li>Interoperability with preexisting APIs based on pointers or references.</li>
   <li>Publication of pointer-based interfaces (for instance, when
@@ -671,10 +775,117 @@ in scenarios where access via iterators is not suitable or desireable:
 </ul>
 </p>
 
+<h2><a name="node_handling">Node handling operations</a></h2>
+
+<p>
+Using direct node manipulation, elements can be passed between
+<code>multi_index_container</code>s without actually copying them:
+</p>
+
+<blockquote><pre>
+<span class=comment>// move an employee to the retiree archive</span>
+<span class=keyword>void</span> <span class=identifier>move_to_retirement</span><span class=special>(</span><span class=keyword>int</span> <span class=identifier>ssnumber</span><span class=special>,</span><span class=identifier>employee_set</span><span class=special>&amp;</span> <span class=identifier>es</span><span class=special>,</span><span class=identifier>employee_set</span><span class=special>&amp;</span> <span class=identifier>archive</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=comment>// assume employee_set has an index on SS number(not shown before)</span>
+  <span class=comment>// extract the employee with given SS number to a node handle</span>
+  <span class=identifier>employee_set_by_ssn</span><span class=special>::</span><span class=identifier>node_type</span> <span class=identifier>node</span><span class=special>=</span><span class=identifier>es</span><span class=special>.</span><span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>ssn</span><span class=special>&gt;().</span><span class=identifier>extract</span><span class=special>(</span><span class=identifier>ssnumber</span><span class=special>);</span>
+
+  <span class=keyword>if</span><span class=special>(!</span><span class=identifier>node</span><span class=special>.</span><span class=identifier>empty</span><span class=special>()){</span> <span class=comment>// employee found
+    // re-insert into archive (note the use of std::move)</span>
+    <span class=identifier>archive</span><span class=special>.</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>move</span><span class=special>(</span><span class=identifier>node</span><span class=special>));</span>
+  <span class=special>}</span>
+<span class=special>}</span>
+</pre></blockquote>
+
+<p>
+In the example, the internal node is transferred as-is from <code>es</code> to <code>archive</code>,
+which is more efficient than erasing from the source and recreating in destination.
+<code>node_type</code> is a move-only class used to pass nodes around, and its interface follows
+that of the <a href="https://en.cppreference.com/w/cpp/container/node_handle">homonym type</a>
+for C++ associative containers (set containers version). Boost.MultiIndex provides node extraction
+and insertion operations for all index types, including sequenced ones (by contrast,
+<code>std::list</code> does not have such features):
+</p>
+
+<blockquote><pre>
+<span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=keyword>int</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=identifier>sequenced</span><span class=special>&lt;&gt;,</span>
+    <span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>src</span><span class=special>;</span>
+
+<span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=keyword>int</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=identifier>sequenced</span><span class=special>&lt;&gt;,</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;,</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>greater</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>dst</span><span class=special>;</span>
+
+<span class=special>...</span>
+
+<span class=comment>// transfer even numbers from src to dst</span>
+<span class=keyword>for</span><span class=special>(</span><span class=keyword>auto</span> <span class=identifier>first</span><span class=special>=</span><span class=identifier>src</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>last</span><span class=special>=</span><span class=identifier>src</span><span class=special>.</span><span class=identifier>end</span><span class=special>();</span><span class=identifier>first</span><span class=special>!=</span><span class=identifier>last</span><span class=special>;){</span>
+  <span class=keyword>if</span><span class=special>(*</span><span class=identifier>first</span><span class=special>%</span><span class=number>2</span><span class=special>==</span><span class=number>0</span><span class=special>)</span> <span class=identifier>dst</span><span class=special>.</span><span class=identifier>insert</span><span class=special>(</span><span class=identifier>dst</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>src</span><span class=special>.</span><span class=identifier>extract</span><span class=special>(</span><span class=identifier>first</span><span class=special>++));</span>
+  <span class=keyword>else</span>            <span class=special>++</span><span class=identifier>first</span><span class=special>;</span>
+<span class=special>}</span>
+</pre></blockquote>
+
+<p>
+Note that <code>src</code> and <code>dst</code> are of different types,
+yet transfer is possible. Two <code>multi_index_container</code>s are
+node-compatible (that is, they use the same <code>node_type</code>) if
+they have the same element and allocator types and their respective indices match
+one by one without regard to whether they are unique or non-unique or to
+their particular configuration parameters: they are both ordered, or
+both sequenced, etc.
+</p>
+
+<p>
+Alternatively, direct node transfer between two containers can be done without
+keeping intervening <code>node_type</code>s thanks to <code>merge</code> (key-based
+indices) and <code>splice</code> (non key-based indices).
+</p>
+
+<blockquote><pre>
+<span class=comment>// move older employees to retirement</span>
+<span class=keyword>void</span> <span class=identifier>move_to_retirement_by_age</span><span class=special>(
+  </span><span class=keyword>int</span> <span class=identifier>max_age</span><span class=special>,</span><span class=identifier>employee_set</span><span class=special>&amp;</span> <span class=identifier>es</span><span class=special>,</span><span class=identifier>employee_set</span><span class=special>&amp;</span> <span class=identifier>archive</span><span class=special>)</span>
+<span class=special>{</span>
+  <span class=comment>// assume employee_set has an index on age (not shown before)</span>
+  <span class=identifier>employee_set_by_age</span><span class=special>&amp;</span> <span class=identifier>ea</span><span class=special>=</span><span class=identifier>es</span><span class=special>.</span><span class=identifier>get</span><span class=special>&lt;</span><span class=identifier>age</span><span class=special>&gt;();</span>
+
+  <span class=comment>// archive employees with age&gt;max_age</span>
+  <span class=identifier>archive</span><span class=special>.</span><span class=identifier>merge</span><span class=special>(</span><span class=identifier>ea</span><span class=special>,</span><span class=identifier>ea</span><span class=special>.</span><span class=identifier>upper_bound</span><span class=special>(</span><span class=identifier>max_age</span><span class=special>),</span><span class=identifier>ea</span><span class=special>.</span><span class=identifier>end</span><span class=special>());</span>
+<span class=special>}</span>
+
+<span class=special>...</span>
+
+<span class=comment>// transfer even numbers from src to dst</span>
+<span class=keyword>for</span><span class=special>(</span><span class=keyword>auto</span> <span class=identifier>first</span><span class=special>=</span><span class=identifier>src</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span><span class=identifier>last</span><span class=special>=</span><span class=identifier>src</span><span class=special>.</span><span class=identifier>end</span><span class=special>();</span><span class=identifier>first</span><span class=special>!=</span><span class=identifier>last</span><span class=special>;){</span>
+  <span class=keyword>if</span><span class=special>(*</span><span class=identifier>first</span><span class=special>%</span><span class=number>2</span><span class=special>==</span><span class=number>0</span><span class=special>)</span> <span class=identifier>dst</span><span class=special>.</span><span class=identifier>splice</span><span class=special>(</span><span class=identifier>dst</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span><span class=identifier>src</span><span class=special>,</span><span class=identifier>first</span><span class=special>++);</span>
+  <span class=keyword>else</span>            <span class=special>++</span><span class=identifier>first</span><span class=special>;</span>
+<span class=special>}</span>
+</pre></blockquote>
+
+<p>
+There are overloads of <code>merge</code>/<code>splice</code> for transferring a single element,
+a range between two iterators and an entire container: for further details, consult
+for instance the reference for <a href="../reference/ord_indices.html#merge">ordered indices</a> and for
+<a href="../reference/seq_indices.html#splice">sequenced indices</a>
+(the rest of indices provide one interface or the other).
+Please note that sequenced and random access indices do also have an operation called <code>merge</code>,
+but this follows the specification of <code>std::list::merge</code>, which has a somewhat
+different behavior (source and destination are required to be ordered by the same criterion). This is
+a rather confusing naming issue that Boost.MultiIndex simply inherits from the C++ standard.
+</p>
+    
 <h2><a name="ordered_node_compression">Ordered indices node compression</a></h2>
 
 <p>
-Ordered indices are implemented by means of a data structure
+Ordered and ranked indices are implemented by means of a data structure
 known as a <i>red-black tree</i>. Nodes of a red-back tree contain pointers
 to the parent and the two children nodes, plus a 1-bit field referred to as
 the <i>node color</i> (hence the name of the structure). Due to alignment
@@ -688,7 +899,7 @@ significant bit of the address must always be zero.
 </p>
 
 <p>
-Boost.MultiIndex ordered indices implement this type of node compression
+Boost.MultiIndex ordered and ranked indices implement this type of node compression
 whenever applicable. As compared with common implementations of the STL
 container <code>std::set</code>, node compression can
 result in a reduction of header overload by 25% (from 16 to 12 bytes on
@@ -718,9 +929,9 @@ Key extraction
 
 <br>
 
-<p>Revised October 15th 2007</p>
+<p>Revised August 16th 2021</p>
 
-<p>&copy; Copyright 2003-2007 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2021 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/tutorial/key_extraction.html

@@ -39,8 +39,11 @@ Container creation
     <ul>
       <li><a href="#identity"><code>identity</code></a></li>
       <li><a href="#member"><code>member</code></a></li>
-      <li><a href="#const_mem_fun"><code>const_mem_fun</code>
-        and <code>mem_fun</code></a></li>
+      <li><a href="#const_mem_fun"><code>const_mem_fun</code> and <code>mem_fun</code></a>
+        <ul>
+          <li><a href="#x_mem_fun">Variants for other types of member functions</a></li>
+        </ul>
+      </li>
       <li><a href="#global_fun"><code>global_fun</code></a></li>
     </ul>
   </li>
@@ -50,6 +53,7 @@ Container creation
       <li><a href="#composite_keys_hash">Composite keys and hashed indices</a></li>
     </ul>
   </li>
+  <li><a href="#key">C++17 terse key specification syntax</a></li>
   <li><a href="#advanced_key_extractors">Advanced features of Boost.MultiIndex key
     extractors</a></li>
 </ul>
@@ -94,10 +98,10 @@ of the element and do not depend on external data.
 A key extractor is called <i>read/write</i> if it returns a non-constant reference
 to the key when passed a non-constant element, and it is called <i>read-only</i>
 otherwise. Boost.MultiIndex requires that the key extractor be read/write
-when using the <code>modify_key</code> member function of ordered and hashed
+when using the <code>modify_key</code> member function of key-based
 indices. In all other situations, read-only extractors suffice.
 The section on <a href="#advanced_key_extractors">advanced features
-of Boost.MultiIndex key extractors</a> details which of the predefined
+of Boost.MultiIndex key extractors</a> shows typical situations on which the predefined
 key extractors are read/write.
 </p>
 
@@ -245,10 +249,97 @@ of Boost.MultiIndex key extractors</a>.
 provides a complete program showing how to use <code>const_mem_fun</code>.
 <p>
 
+<h4><a name="x_mem_fun">Variants for other types of member functions</a></h4>
+
+<p>
+Consider the following, non-compiling code:
+</p>
+
+<blockquote><pre>
+<span class=keyword>struct</span> <span class=identifier>employee</span>
+<span class=special>{</span>
+  <span class=special>...</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>size_t</span> <span class=identifier>salary</span><span class=special>()</span><span class=keyword>const</span><span class=special><b>&amp;</b>;</span> <span class=comment>// note the &amp;</span>
+<span class=special>};</span>
+
+<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=identifier>employee</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=special>...</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span>
+      <span class=comment>// compiler error: can't convert &amp;employee::salary to
+      // std::size_t (employee::*)() const</span>
+      <span class=identifier><b>const_mem_fun</b></span><span class=special>&lt;</span><span class=identifier>employee</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>size_t</span><span class=special>,&amp;</span><span class=identifier>employee</span><span class=special>::</span><span class=identifier>salary</span><span class=special>&gt;</span>
+    <span class=special>&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>employee_set</span><span class=special>;</span>
+</pre></blockquote>
+
+<p>
+The problem here is that the type of <code>&amp;employee::salary</code>, which is
+<a href="https://en.cppreference.com/w/cpp/language/member_functions#const-.2C_volatile-.2C_and_ref-qualified_member_functions">ref-qualified</a>,
+does not match exactly what <code>const_mem_fun</code> expects. Fortunately, Boost.MultiIndex
+provides a variant to fit:
+</p>
+
+<blockquote><pre>
+<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=identifier>employee</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=special>...</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span>
+      <span class=identifier><b>cref_mem_fun</b></span><span class=special>&lt;</span><span class=identifier>employee</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>size_t</span><span class=special>,&amp;</span><span class=identifier>employee</span><span class=special>::</span><span class=identifier>salary</span><span class=special>&gt;</span>
+    <span class=special>&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>employee_set</span><span class=special>;</span>
+</pre></blockquote>
+
+<p>
+This is the list of all available variants of <code>const_mem_fun</code> and
+<code>mem_fun</code>:
+</p>
+
+<p align="center">
+<table cellspacing="0">
+  <caption><b>Variants of <code>const_mem_fun</code> and <code>mem_fun</code>.</b></caption>
+<tr>
+  <th>&nbsp;Member function example&nbsp;</th>
+  <th>Suitable extractor</th>
+  <th>Behaves as</th>
+</tr>
+<tr>
+  <td><code>int f()const volatile</code></td>
+  <td><a href="../reference/key_extraction.html#cv_mem_fun"><code>cv_mem_fun</code></a><code>&lt;int,X,&amp;X::f&gt;</code></td>
+  <td align="center" rowspan="3">&nbsp;<code>const_mem_fun</code>&nbsp;</td>
+</tr>
+<tr>
+  <td><code>int f()const&amp;</code></td>
+  <td><a href="../reference/key_extraction.html#cv_mem_fun"><code>cref_mem_fun</code></a><code>&lt;int,X,&amp;X::f&gt;</code></td>
+</tr>
+<tr>
+  <td><code>int f()const volatile&amp;</code></td>
+  <td><a href="../reference/key_extraction.html#cv_mem_fun"><code>cvref_mem_fun</code></a><code>&lt;int,X,&amp;X::f&gt;</code></td>
+</tr>
+<tr>
+  <td><code>int f()volatile</code></td>
+  <td><a href="../reference/key_extraction.html#volatile_mem_fun"><code>volatile_mem_fun</code></a><code>&lt;int,X,&amp;X::f&gt;</code></td>
+  <td align="center" rowspan="3"><code>mem_fun</code></td>
+</tr>
+<tr>
+  <td><code>int f()&amp;</code></td>
+  <td><a href="../reference/key_extraction.html#volatile_mem_fun"><code>ref_mem_fun</code></a><code>&lt;int,X,&amp;X::f&gt;</code></td>
+</tr>
+<tr>
+  <td><code>int f()volatile&amp;</code></td>
+  <td><a href="../reference/key_extraction.html#volatile_mem_fun"><code>vref_mem_fun</code></a><code>&lt;int,X,&amp;X::f&gt;</code></td>
+</tr>
+</table>
+</p>
+
 <h3><a name="global_fun"><code>global_fun</code></a></h3>
 
 <p>
-Whereas <code>const_mem_fun</code> and <code>mem_fun</code> are based on a
+Whereas <code>const_mem_fun</code> and its variants are based on a
 given member function of the base type from where the key is extracted,
 <a href="../reference/key_extraction.html#global_fun"><code>global_fun</code></a>
 takes a global function (or static member function) accepting the base
@@ -387,7 +478,7 @@ The analogous concept in Boost.MultiIndex is modeled by means of
 <span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
   <span class=identifier>phonebook_entry</span><span class=special>,</span>
   <span class=identifier>indexed_by</span><span class=special>&lt;</span>
-    <span class=comment>//non-unique as some subscribers might have more than one number</span>
+    <span class=comment>// non-unique as some subscribers might have more than one number</span>
     <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span> 
       <span class=identifier>composite_key</span><span class=special>&lt;</span>
         <span class=identifier>phonebook_entry</span><span class=special>,</span>
@@ -403,7 +494,7 @@ The analogous concept in Boost.MultiIndex is modeled by means of
 </pre></blockquote>
 
 <p>
-<code>composite_key</code> accepts two or more key extractors on the same
+<code>composite_key</code> accepts several key extractors on the same
 value (here, <code>phonebook_entry</code>). Lookup operations on a composite
 key are accomplished by passing tuples with the values searched:
 </p>
@@ -412,7 +503,7 @@ key are accomplished by passing tuples with the values searched:
 <span class=identifier>phonebook</span> <span class=identifier>pb</span><span class=special>;</span>
 <span class=special>...</span>
 <span class=comment>// search for Dorothea White's number</span>
-<span class=identifier>phonebook</span><span class=special>::</span><span class=identifier>iterator</span> <span class=identifier>it</span><span class=special>=</span><span class=identifier>pb</span><span class=special>.</span><span class=identifier>find</span><span class=special>(</span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>make_tuple</span><span class=special>(</span><span class=string>&quot;White&quot;</span><span class=special>,</span><span class=string>&quot;Dorothea&quot;</span><span class=special>));</span>
+<span class=identifier>phonebook</span><span class=special>::</span><span class=identifier>iterator</span> <span class=identifier>it</span><span class=special>=</span><span class=identifier>pb</span><span class=special>.</span><span class=identifier>find</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>make_tuple</span><span class=special>(</span><span class=string>&quot;White&quot;</span><span class=special>,</span><span class=string>&quot;Dorothea&quot;</span><span class=special>));</span>
 <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>number</span><span class=special>=</span><span class=identifier>it</span><span class=special>-&gt;</span><span class=identifier>phone_number</span><span class=special>;</span>
 </pre></blockquote>
 
@@ -427,7 +518,7 @@ order allows for partial searches where only the first keys are specified:
 <span class=special>...</span>
 <span class=comment>// look for all Whites</span>
 <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>phonebook</span><span class=special>::</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>phonebook</span><span class=special>::</span><span class=identifier>iterator</span><span class=special>&gt;</span> <span class=identifier>p</span><span class=special>=</span>
-  <span class=identifier>pb</span><span class=special>.</span><span class=identifier>equal_range</span><span class=special>(</span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>make_tuple</span><span class=special>(</span><span class=string>&quot;White&quot;</span><span class=special>));</span>
+  <span class=identifier>pb</span><span class=special>.</span><span class=identifier>equal_range</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>make_tuple</span><span class=special>(</span><span class=string>&quot;White&quot;</span><span class=special>));</span>
 </pre></blockquote>
 
 <p>
@@ -522,7 +613,7 @@ Composite keys can also be used with hashed indices in a straightforward manner:
 <span class=keyword>void</span> <span class=identifier>streets_in_quadrant</span><span class=special>(</span><span class=keyword>int</span> <span class=identifier>x</span><span class=special>,</span><span class=keyword>int</span> <span class=identifier>y</span><span class=special>)</span>
 <span class=special>{</span>
   <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>street_locator</span><span class=special>::</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>street_locator</span><span class=special>::</span><span class=identifier>iterator</span><span class=special>&gt;</span> <span class=identifier>p</span><span class=special>=</span>
-    <span class=identifier>sl</span><span class=special>.</span><span class=identifier>equal_range</span><span class=special>(</span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>make_tuple</span><span class=special>(</span><span class=identifier>x</span><span class=special>,</span><span class=identifier>y</span><span class=special>));</span>
+    <span class=identifier>sl</span><span class=special>.</span><span class=identifier>equal_range</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>make_tuple</span><span class=special>(</span><span class=identifier>x</span><span class=special>,</span><span class=identifier>y</span><span class=special>));</span>
 
   <span class=keyword>while</span><span class=special>(</span><span class=identifier>p</span><span class=special>.</span><span class=identifier>first</span><span class=special>!=</span><span class=identifier>p</span><span class=special>.</span><span class=identifier>second</span><span class=special>){</span>
     <span class=identifier>std</span><span class=special>::</span><span class=identifier>cout</span><span class=special>&lt;&lt;</span><span class=identifier>p</span><span class=special>.</span><span class=identifier>first</span><span class=special>-&gt;</span><span class=identifier>name</span><span class=special>&lt;&lt;</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>endl</span><span class=special>;</span>
@@ -587,7 +678,7 @@ only the first elements of a composite key:
 <span class=comment>// try to locate streets in quadrants with x==0
 // compile-time error: hashed indices do not allow such operations</span>
 <span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>street_locator</span><span class=special>::</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>street_locator</span><span class=special>::</span><span class=identifier>iterator</span><span class=special>&gt;</span> <span class=identifier>p</span><span class=special>=</span>
-  <span class=identifier>sl</span><span class=special>.</span><span class=identifier>equal_range</span><span class=special>(</span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>make_tuple</span><span class=special>(</span><span class=number>0</span><span class=special>));</span>
+  <span class=identifier>sl</span><span class=special>.</span><span class=identifier>equal_range</span><span class=special>(</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>make_tuple</span><span class=special>(</span><span class=number>0</span><span class=special>));</span>
 </pre></blockquote>
 
 <p>
@@ -596,6 +687,86 @@ key depends on all of its elements, it is impossible to calculate it from
 partial information.
 </p>
 
+<h2><a name="key">C++17 terse key specification syntax</a></h2>
+
+<p>
+C++17 introduces the declaration of <code>auto</code> template parameters, which can be
+taken advantage of to eliminate some redundancy in the specification of Boost.MultiIndex
+predefined key extractors. For instance, instead of the classical:
+</p>
+
+<blockquote><pre>
+<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=identifier>employee</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=identifier>employee</span><span class=special>&gt;</span> <span class=special>&gt;,</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span><span class=identifier>member</span><span class=special>&lt;</span><span class=identifier>employee</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>,&amp;</span><span class=identifier>employee</span><span class=special>::</span><span class=identifier>name</span><span class=special>&gt;</span> <span class=special>&gt;,</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span>
+      <span class=identifier>const_mem_fun</span><span class=special>&lt;</span><span class=identifier>employee</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>size_t</span><span class=special>,&amp;</span><span class=identifier>employee</span><span class=special>::</span><span class=identifier>name_length</span><span class=special>&gt;</span>
+    <span class=special>&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>employee_set</span><span class=special>;</span>
+</pre></blockquote>
+
+one can now write:
+
+<blockquote><pre>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>boost</span><span class=special>/</span><span class=identifier>multi_index</span><span class=special>/</span><span class=identifier>key</span><span class=special>.</span><span class=identifier>hpp</span><span class=special>&gt;</span>
+<span class=special>...</span>
+<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=identifier>employee</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=identifier>employee</span><span class=special>&gt;&gt;,</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span><span class=identifier><b>key</b></span><span class=special><b>&lt;&amp;</b></span><span class=identifier><b>employee</b></span><span class=special><b>::</b></span><span class=identifier><b>name</b></span><span class=special><b>&gt;</b>&gt;,</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;</span><span class=identifier><b>key</b></span><span class=special><b>&lt;&amp;</b></span><span class=identifier><b>employee</b></span><span class=special><b>::</b></span><span class=identifier><b>name_length</b></span><span class=special><b>&gt;</b>&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>employee_set</span><span class=special>;</span>
+</pre></blockquote>
+
+<p>
+which results in the exact same defined type, as
+<a href="../reference/key_extraction.html#key"><code>key</code></a> constructs are mere
+aliases for the old syntax. <code>key</code> can be used to shorten the specification of
+<a href="../reference/key_extraction.html#member"><code>member</code></a>,
+<a href="../reference/key_extraction.html#const_mem_fun"><code>const_mem_fun</code></a>
+(and <a href="../reference/key_extraction.html#cv_mem_fun">variants</a>),
+<a href="../reference/key_extraction.html#mem_fun"><code>mem_fun</code></a>
+(and <a href="../reference/key_extraction.html#volatile_mem_fun">variants</a>),
+<a href="../reference/key_extraction.html#global_fun"><code>global_fun</code></a>
+and, with additional terseness benefits,
+<a href="../reference/key_extraction.html#composite_key"><code>composite_key</code></a>:
+</p>
+
+<blockquote><pre>
+<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+  <span class=identifier>phonebook_entry</span><span class=special>,</span>
+  <span class=identifier>indexed_by</span><span class=special>&lt;</span>
+    <span class=comment>// composite key on family name and given name</span>
+    <span class=identifier>ordered_non_unique</span><span class=special>&lt;
+      </span><span class=identifier><b>key</b></span><span class=special><b>&lt;&amp;</b></span><span class=identifier><b>phonebook_entry</b></span><span class=special><b>::</b></span><span class=identifier><b>family_name</b></span><span class=special><b>,&amp;</b></span><span class=identifier><b>phonebook_entry</b></span><span class=special><b>::</b></span><span class=identifier><b>given_name</b></span><span class=special><b>&gt;</b></span>
+    <span class=special>&gt;,</span>
+    <span class=comment>// unique index on phone number</span>
+    <span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>key</span><span class=special>&lt;&amp;</span><span class=identifier>phonebook_entry</span><span class=special>::</span><span class=identifier>phone_number</span><span class=special>&gt;&gt;</span>
+  <span class=special>&gt;</span>
+<span class=special>&gt;</span> <span class=identifier>phonebook</span><span class=special>;</span>
+</pre></blockquote>
+
+In this example, the first usage of <code>key</code> substitutes for the
+decidedly more cumbersome:
+
+<blockquote><pre>
+<span class=identifier>composite_key</span><span class=special>&lt;</span>
+  <span class=identifier>phonebook_entry</span><span class=special>,</span>
+  <span class=identifier>member</span><span class=special>&lt;</span><span class=identifier>phonebook_entry</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>,&amp;</span><span class=identifier>phonebook_entry</span><span class=special>::</span><span class=identifier>family_name</span><span class=special>&gt;,</span>
+  <span class=identifier>member</span><span class=special>&lt;</span><span class=identifier>phonebook_entry</span><span class=special>,</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>,&amp;</span><span class=identifier>phonebook_entry</span><span class=special>::</span><span class=identifier>given_name</span><span class=special>&gt;</span>
+<span class=special>&gt;</span>
+</pre></blockquote>
+
+Note that we did not even have to specify the first <code>phonebook_entry</code>
+argument: the internal machinery of <code>key</code> automatically deduces it for
+us. Check the <a href="../reference/key_extraction.html#key_synopsis">reference</a>
+for technical details.
+
 <h2><a name="advanced_key_extractors">Advanced features of Boost.MultiIndex key
 extractors</a></h2>
 
@@ -675,7 +846,7 @@ pointers to <code>employee</code> are:
 <ul>
   <li><code>employee *</code>,</li>
   <li><code>const employee *</code>,</li>
-  <li><code>std::auto_ptr&lt;employee></code>,</li>
+  <li><code>std::unique_ptr&lt;employee></code>,</li>
   <li><code>std::list&lt;boost::reference_wrapper&lt;employee> >::iterator</code>,</li>
   <li><code>employee **</code>,</li>
   <li><code>boost::shared_ptr&lt;const employee *></code>.</li>
@@ -955,9 +1126,9 @@ Container creation
 
 <br>
 
-<p>Revised June 11th 2007</p>
+<p>Revised November 1st 2025</p>
 
-<p>&copy; Copyright 2003-2007 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2025 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

doc/tutorial/techniques.html

@@ -40,8 +40,8 @@ Boost.MultiIndex reference
   </li>
   <li><a href="#metaprogrammming">Metaprogramming and <code>multi_index_container</code></a>
     <ul>
-      <li><a href="#mpl_analysis">MPL analysis</a></li>
-      <li><a href="#mpl_synthesis">MPL synthesis</a></li>
+      <li><a href="#analysis">Analysis</a></li>
+      <li><a href="#synthesis">Synthesis</a></li>
     </ul>
   </li>
 </ul>
@@ -53,7 +53,7 @@ Boost.MultiIndex reference
 containers</a></h3>
 
 <p>
-Academic movitations aside, there is a practical interest in emulating standard
+Academic motivations aside, there is a practical interest in emulating standard
 associative containers by means of <code>multi_index_container</code>, namely to take
 advantage of extended functionalities provided by <code>multi_index_container</code> for
 lookup, range querying and updating.
@@ -266,11 +266,10 @@ or, if the default value <code>Allocator=std::allocator&lt;T></code> is used:
 
 <p>
 Boost.MultiIndex provides a number of facilities intended to allow the analysis and
-synthesis of <code>multi_index_container</code> instantiations by
-<a href="../../../../libs/mpl/doc/index.html">MPL</a> metaprograms.
+synthesis of <code>multi_index_container</code> instantiations with metaprogramming.
 </p>
 
-<h3><a name="mpl_analysis">MPL analysis</a></h3>
+<h3><a name="analysis">Analysis</a></h3>
 
 <p>
 Given a <code>multi_index_container</code> instantiation, the following nested types are
@@ -282,39 +281,47 @@ definition of the <code>multi_index_container</code>:
   <li><code>iterator_type_list</code>,</li>
   <li><code>const_iterator_type_list</code>.</li>
 </ul>
-Each of these types is an MPL sequence with as many elements as indices
+Each of these types is an
+<a href="../../../../libs/mp11/doc/html/mp11.html#definitions">Mp11 list</a>
+with as many elements as indices
 comprise the <code>multi_index_container</code>: for instance, the <code>n</code>-th
 element of <code>iterator_type_list</code> is the same as
-<code>nth_index&lt;n>::type::iterator</code>.
-</p>
-
-<p>
-A subtle but important distinction exists between
-<code>index_specifier_type_list</code> and <code>index_type_list</code>:
-the former typelist holds the index <i>specifiers</i>
-with which the <code>multi_index_container</code> instantiation was defined,
-while the latter gives access to the actual implementation classes
-corresponding to each specifier. An example will help to clarify
-this distinction. Given the instantiation:
+<code>nth_index&lt;n>::type::iterator</code>. Boost.Mp11 makes it very easy
+to inspect and manipulate these lists:
 </p>
 
 <blockquote><pre>
-<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+<span class=keyword>using</span> <span class=identifier>indexed_t</span><span class=special>=</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span>
   <span class=keyword>int</span><span class=special>,</span>
   <span class=identifier>indexed_by</span><span class=special>&lt;</span>
     <span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;,</span>
     <span class=identifier>sequenced</span><span class=special>&lt;&gt;</span>
   <span class=special>&gt;</span>
-<span class=special>&gt;</span> <span class=identifier>indexed_t</span><span class=special>;</span>
+<span class=special>&gt;;</span>
+
+<span class=identifier>boost</span><span class=special>::</span><span class=identifier>mp11</span><span class=special>::</span><span class=identifier>mp_for_each</span><span class=special>&lt;</span><span class=identifier>indexed_t</span><span class=special>::</span><span class=identifier>index_specifier_type_list</span><span class=special>&gt;([](</span><span class=keyword>auto</span> <span class=identifier>I</span><span class=special>){</span>
+  <span class=identifier>std</span><span class=special>::</span><span class=identifier>cout</span> <span class=special>&lt;&lt;</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>typeindex</span><span class=special>::</span><span class=identifier>type_id</span><span class=special>&lt;</span><span class=identifier>decltype</span><span class=special>(</span><span class=identifier>I</span><span class=special>)&gt;().</span><span class=identifier>pretty_name</span><span class=special>()</span> <span class=special>&lt;&lt;</span> <span class=string>&quot;\n&quot;</span><span class=special>;</span>
+<span class=special>});</span>
+
+<span class=comment>// Output:
+//
+// struct boost::multi_index::ordered_unique&lt;struct boost::multi_index::identity&lt;int&gt;,void,void&gt;
+// struct boost::multi_index::sequenced&lt;struct boost::multi_index::tag&lt;&gt; &gt;</span>
 </pre></blockquote>
 
 <p>
+A subtle but important distinction exists between
+<code>index_specifier_type_list</code> and <code>index_type_list</code>:
+the former list holds the index <i>specifiers</i>
+with which the <code>multi_index_container</code> instantiation was defined,
+while the latter gives access to the actual implementation classes
+corresponding to each specifier. In the example above,
 <code>indexed_t::index_specifier_type_list</code> is a type list with
 elements
 </p>
 
 <blockquote><pre>
-<span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;</span>
+<span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span><span class=special>&gt;</span>
 <span class=identifier>sequenced</span><span class=special>&lt;&gt;</span>
 </pre></blockquote>
 
@@ -328,21 +335,18 @@ while <code>indexed_t::index_type_list</code> holds the types
 </pre></blockquote>
 
 <p>
-so the typelists are radically different. Check the
-<a href="../reference/multi_index_container.html#types">reference</a>
-for the exact MPL sequence concepts modeled by these type lists.
+so the lists are radically different.
 </p>
 
-<h3><a name="mpl_synthesis">MPL synthesis</a></h3>
+<h3><a name="synthesis">Synthesis</a></h3>
 
 <p>
 Although typically indices are specified by means of the
-<code>indexed_by</code> construct, actually any MPL sequence of
-index specifiers can be provided instead:
+<code>indexed_by</code> construct, actually any Mp11 list can be provided instead:
 </p>
 
 <blockquote><pre>
-<span class=keyword>typedef</span> <span class=identifier>mpl</span><span class=special>::</span><span class=identifier>vector</span><span class=special>&lt;</span><span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;,</span><span class=identifier>sequenced</span><span class=special>&lt;&gt;</span> <span class=special>&gt;</span> <span class=identifier>index_list_t</span><span class=special>;</span>
+<span class=keyword>using</span> <span class=identifier>index_list_t</span><span class=special>=</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>tuple</span><span class=special>&lt;</span><span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;,</span><span class=identifier>sequenced</span><span class=special>&lt;&gt;&gt;</span> <span class=special>;</span>
 
 <span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
   <span class=keyword>int</span><span class=special>,</span>
@@ -352,30 +356,30 @@ index specifiers can be provided instead:
 
 <p>
 This possibility enables the synthesis of instantiations of
-<code>multi_index_container</code> through MPL metaprograms, as the following
+<code>multi_index_container</code> through metaprogramming, as the following
 example shows:
 </p>
 
 <blockquote><pre>
 <span class=comment>// original multi_index_container instantiation</span>
-<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+<span class=keyword>using</span> <span class=identifier>indexed_t1</span><span class=special>=</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span>
   <span class=keyword>int</span><span class=special>,</span>
   <span class=identifier>indexed_by</span><span class=special>&lt;</span>
     <span class=identifier>ordered_unique</span><span class=special>&lt;</span><span class=identifier>identity</span><span class=special>&lt;</span><span class=keyword>int</span><span class=special>&gt;</span> <span class=special>&gt;</span>
   <span class=special>&gt;</span>
-<span class=special>&gt;</span>                                <span class=identifier>indexed_t1</span><span class=special>;</span>
+<span class=special>&gt;;</span>
 
 <span class=comment>// we take its index list and add an index</span>
-<span class=keyword>typedef</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>mpl</span><span class=special>::</span><span class=identifier>push_front</span><span class=special>&lt;</span>
+<span class=keyword>using</span> <span class=identifier>index_list_t2</span><span class=special>=</span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>mp11</span><span class=special>::</span><span class=identifier>mp_push_front</span><span class=special>&lt;</span>
   <span class=identifier>indexed_t1</span><span class=special>::</span><span class=identifier>index_specifier_type_list</span><span class=special>,</span>
   <span class=identifier>sequenced</span><span class=special>&lt;&gt;</span>
-<span class=special>&gt;::</span><span class=identifier>type</span>                          <span class=identifier>index_list_t</span><span class=special>;</span>
+<span class=special>&gt;;</span>
 
 <span class=comment>// augmented multi_index_container</span>
-<span class=keyword>typedef</span> <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
+<span class=keyword>using</span> <span class=identifier>indexed_t2</span><span class=special>=</span><span class=identifier>multi_index_container</span><span class=special>&lt;</span>
   <span class=keyword>int</span><span class=special>,</span>
-  <span class=identifier>index_list_t</span>
-<span class=special>&gt;</span>                                <span class=identifier>indexed_t2</span><span class=special>;</span>
+  <span class=identifier>index_list_t2</span>
+<span class=special>&gt;;</span>
 </pre></blockquote>
 
 <hr>
@@ -392,9 +396,9 @@ Boost.MultiIndex reference
 
 <br>
 
-<p>Revised November 7th 2008</p>
+<p>Revised October 25th 2025</p>
 
-<p>&copy; Copyright 2003-2008 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
+<p>&copy; Copyright 2003-2025 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 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">

example/Jamfile.v2

@@ -1,69 +1,66 @@
 # Boost.MultiIndex examples Jamfile
 #
-# Copyright 2003-2007 Joaquín M López Muñoz.
+# Copyright 2003-2007 Joaqu�n M L�pez Mu�oz.
 # 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)
 #
 # See http://www.boost.org/libs/multi_index for library home page.
 
+project : requirements <library>/boost/multi_index//boost_multi_index ;
+
 exe basic
     : basic.cpp
-    : <include>$(BOOST_ROOT)
     ;
 
 exe bimap
     : bimap.cpp
-    : <include>$(BOOST_ROOT)
     ;
 
 exe complex_structs
     : complex_structs.cpp
-    : <include>$(BOOST_ROOT)
     ;
 
 exe composite_keys
     : composite_keys.cpp
-    : <include>$(BOOST_ROOT)
+      /boost/tokenizer//boost_tokenizer
     ;
 
 exe fun_key
     : fun_key.cpp
-    : <include>$(BOOST_ROOT)
     ;
 
 exe hashed
     : hashed.cpp
-    : <include>$(BOOST_ROOT)
+      /boost/tokenizer//boost_tokenizer
     ;
 
 exe ip_allocator
     : ip_allocator.cpp
-    : <include>$(BOOST_ROOT) <threading>multi
+      /boost/interprocess//boost_interprocess
+    : <threading>multi
     ;
 
 exe non_default_ctor
     : non_default_ctor.cpp
-    : <include>$(BOOST_ROOT)
     ;
 
 exe random_access
     : random_access.cpp
-    : <include>$(BOOST_ROOT)
+      /boost/tokenizer//boost_tokenizer
     ;
 
 exe rearrange
     : rearrange.cpp
-    : <include>$(BOOST_ROOT)
+      /boost/random//boost_random
     ;
 
 exe sequenced
     : sequenced.cpp
-    : <include>$(BOOST_ROOT)
+      /boost/tokenizer//boost_tokenizer
     ;
 
 exe serialization
     : serialization.cpp
       /boost/serialization//boost_serialization
-    : <include>$(BOOST_ROOT)
     ;

example/basic.cpp

@@ -1,6 +1,6 @@
 /* Boost.MultiIndex basic example.
  *
- * Copyright 2003-2008 Joaquin M Lopez Munoz.
+ * Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -47,12 +47,8 @@ struct id{};
 struct name{};
 struct age{};
 
-/* see Compiler specifics: Use of member_offset for info on
- * BOOST_MULTI_INDEX_MEMBER
- */
-
 /* Define a multi_index_container of employees with following indices:
- *   - a unique index sorted by employee::int,
+ *   - a unique index sorted by employee::id,
  *   - a non-unique index sorted by employee::name,
  *   - a non-unique index sorted by employee::age.
  */
@@ -61,18 +57,15 @@ typedef multi_index_container<
   employee,
   indexed_by<
     ordered_unique<
-      tag<id>,  BOOST_MULTI_INDEX_MEMBER(employee,int,id)>,
+      tag<id>,  member<employee,int,&employee::id> >,
     ordered_non_unique<
-      tag<name>,BOOST_MULTI_INDEX_MEMBER(employee,std::string,name)>,
+      tag<name>,member<employee,std::string,&employee::name> >,
     ordered_non_unique<
-      tag<age>, BOOST_MULTI_INDEX_MEMBER(employee,int,age)> >
+      tag<age>, member<employee,int,&employee::age> > >
 > employee_set;
 
 template<typename Tag,typename MultiIndexContainer>
-void print_out_by(
- const MultiIndexContainer& s,
- Tag* =0 /* fixes a MSVC++ 6.0 bug with implicit template function parms */
-)
+void print_out_by(const MultiIndexContainer& s)
 {
   /* obtain a reference to the index tagged by Tag */
 

example/bimap.cpp

@@ -1,6 +1,6 @@
 /* Boost.MultiIndex example of a bidirectional map.
  *
- * Copyright 2003-2009 Joaquin M Lopez Munoz.
+ * Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -44,30 +44,6 @@ struct bidirectional_map
     ToType   second;
   };
 
-#if defined(BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS) ||\
-    defined(BOOST_MSVC)&&(BOOST_MSVC<1300) ||\
-    defined(BOOST_INTEL_CXX_VERSION)&&defined(_MSC_VER)&&\
-           (BOOST_INTEL_CXX_VERSION<=700)
-
-/* see Compiler specifics: Use of member_offset for info on member<> and
- * member_offset<>
- */
-
-  BOOST_STATIC_CONSTANT(unsigned,from_offset=offsetof(value_type,first));
-  BOOST_STATIC_CONSTANT(unsigned,to_offset  =offsetof(value_type,second));
-
-  typedef multi_index_container<
-    value_type,
-    indexed_by<
-      ordered_unique<
-        tag<from>,member_offset<value_type,FromType,from_offset> >,
-      ordered_unique<
-        tag<to>,  member_offset<value_type,ToType,to_offset> >
-    >
-  > type;
-
-#else
-
   /* A bidirectional map can be simulated as a multi_index_container
    * of pairs of (FromType,ToType) with two unique indices, one
    * for each member of the pair.
@@ -82,8 +58,6 @@ struct bidirectional_map
         tag<to>,  member<value_type,ToType,&value_type::second> >
     >
   > type;
-
-#endif
 };
 
 /* a dictionary is a bidirectional map from strings to strings */
@@ -108,22 +82,6 @@ int main()
   std::string word;
   std::getline(std::cin,word);
 
-#if defined(BOOST_NO_MEMBER_TEMPLATES) /* use global get<> and family instead */
-
-  dictionary::iterator it=get<from>(d).find(word);
-  if(it!=d.end()){
-    std::cout<<word<<" is said "<<it->second<<" in English"<<std::endl;
-  }
-  else{
-    nth_index<dictionary,1>::type::iterator it2=get<1>(d).find(word);
-    if(it2!=get<1>(d).end()){
-      std::cout<<word<<" is said "<<it2->first<<" in Spanish"<<std::endl;
-    }
-    else std::cout<<"No such word in the dictionary"<<std::endl;
-  }
-
-#else
-
   /* search the queried word on the from index (Spanish) */
 
   dictionary::iterator it=d.get<from>().find(word);
@@ -143,7 +101,5 @@ int main()
     else std::cout<<"No such word in the dictionary"<<std::endl;
   }
 
-#endif
-
   return 0;
 }

example/complex_structs.cpp

@@ -1,6 +1,6 @@
 /* Boost.MultiIndex example: complex searches and foreign keys.
  *
- * Copyright 2003-2008 Joaquin M Lopez Munoz.
+ * Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -88,10 +88,6 @@ struct car_model
   }
 };
 
-/* see Compiler specifics: Use of member_offset for info on
- * BOOST_MULTI_INDEX_MEMBER
- */
-
 /* Car manufacturers are stored in a multi_index_container with one single
  * index on  the name member. This is functionally equivalent to an std::set,
  * though in this latter case we woud have to define a non-default comparison
@@ -102,7 +98,7 @@ typedef multi_index_container<
   car_manufacturer,
   indexed_by<
     ordered_unique<
-      BOOST_MULTI_INDEX_MEMBER(car_manufacturer,std::string,name)
+      member<car_manufacturer,std::string,&car_manufacturer::name>
     >
   >
 > car_manufacturer_table;
@@ -118,18 +114,18 @@ typedef multi_index_container<
   car_model,
   indexed_by<
     ordered_unique<
-      tag<model>,BOOST_MULTI_INDEX_MEMBER(car_model,std::string,model)
+      tag<model>,member<car_model,std::string,&car_model::model>
     >,
     ordered_non_unique<
       tag<manufacturer>,
       key_from_key<
-        BOOST_MULTI_INDEX_MEMBER(car_manufacturer,const std::string,name),
-        BOOST_MULTI_INDEX_MEMBER(
-          car_model,const car_manufacturer *,manufacturer)
+        member<car_manufacturer,const std::string,&car_manufacturer::name>,
+        member<
+          car_model,const car_manufacturer *,&car_model::manufacturer>
       >
     >,
     ordered_non_unique<
-      tag<price>,BOOST_MULTI_INDEX_MEMBER(car_model,int,price)
+      tag<price>,member<car_model,int,&car_model::price>
     >
   >
 > car_table;
@@ -138,7 +134,7 @@ typedef multi_index_container<
  * actual objects. These views are used in the complex search performed
  * in the program. Resorting to multi_index of pointers eliminates
  * unnecessary copying of objects, and provides us with an opportunity
- * to show how BOOST_MULTI_INDEX_MEMBER can be used with pointer
+ * to show how boost::multi_index::member can be used with pointer
  * type elements.
  * car_table_price_view indexes (pointers to) car_models by price.
  */
@@ -146,7 +142,7 @@ typedef multi_index_container<
 typedef multi_index_container<
   const car_model*,
   indexed_by<
-    ordered_non_unique<BOOST_MULTI_INDEX_MEMBER(car_model,const int,price)>
+    ordered_non_unique<member<car_model,const int,&car_model::price> >
   >
 > car_table_price_view;
 
@@ -159,9 +155,9 @@ typedef multi_index_container<
   indexed_by<
     ordered_non_unique<
       key_from_key<
-        BOOST_MULTI_INDEX_MEMBER(car_manufacturer,const std::string,name),
-        BOOST_MULTI_INDEX_MEMBER(
-          car_model,const car_manufacturer * const,manufacturer)
+        member<car_manufacturer,const std::string,&car_manufacturer::name>,
+        member<
+          car_model,const car_manufacturer * const,&car_model::manufacturer>
       >
     >
   >

example/composite_keys.cpp

@@ -1,6 +1,6 @@
 /* Boost.MultiIndex example of composite keys.
  *
- * Copyright 2003-2008 Joaquin M Lopez Munoz.
+ * Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -57,43 +57,29 @@ struct file_entry
  * file and size. These indices are firstly ordered by directory, as commands
  * work on a current directory basis. Composite keys are just fine to model
  * this.
- * NB: The use of derivation here instead of simple typedef is explained in
- * Compiler specifics: type hiding.
+ * NB: The use of derivation here instead of simple typedef helps produce
+ * shorter symbol names in compilation
  */
 
 struct name_key:composite_key<
   file_entry,
-  BOOST_MULTI_INDEX_MEMBER(file_entry,const file_entry*,dir),
-  BOOST_MULTI_INDEX_MEMBER(file_entry,std::string,name)
+  member<file_entry,const file_entry*,&file_entry::dir>,
+  member<file_entry,std::string,&file_entry::name>
 >{};
 
 struct size_key:composite_key<
   file_entry,
-  BOOST_MULTI_INDEX_MEMBER(file_entry,const file_entry* const,dir),
-  BOOST_MULTI_INDEX_MEMBER(file_entry,unsigned,size)
+  member<file_entry,const file_entry* const,&file_entry::dir>,
+  member<file_entry,unsigned,&file_entry::size>
 >{};
 
-/* see Compiler specifics: composite_key in compilers without partial
- * template specialization, for info on composite_key_result_less
- */
-
 typedef multi_index_container<
   file_entry,
   indexed_by<
     /* primary index sorted by name (inside the same directory) */
-    ordered_unique<
-      name_key
-#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
-      ,composite_key_result_less<name_key::result_type>
-#endif
-    >,
+    ordered_unique<name_key>,
     /* secondary index sorted by size (inside the same directory) */
-    ordered_non_unique<
-      size_key
-#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
-      ,composite_key_result_less<size_key::result_type>
-#endif
-    >
+    ordered_non_unique<size_key>
   >
 > file_system;
 

example/fun_key.cpp

@@ -1,6 +1,6 @@
 /* Boost.MultiIndex example of functions used as key extractors.
  *
- * Copyright 2003-2008 Joaquin M Lopez Munoz.
+ * Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -54,15 +54,13 @@ std::string::size_type name_record_length(const name_record& r)
 
 /* multi_index_container with indices based on name_record::name()
  * and name_record_length().
- * See Compiler specifics: Use of const_mem_fun_explicit and
- * mem_fun_explicit for info on BOOST_MULTI_INDEX_CONST_MEM_FUN.
  */
 
 typedef multi_index_container<
   name_record,
   indexed_by<
     ordered_unique<
-      BOOST_MULTI_INDEX_CONST_MEM_FUN(name_record,std::string,name)
+      const_mem_fun<name_record,std::string,&name_record::name>
     >,
     ordered_non_unique<
       global_fun<const name_record&,std::string::size_type,name_record_length>

example/hashed.cpp

@@ -1,6 +1,6 @@
 /* Boost.MultiIndex example of use of hashed indices.
  *
- * Copyright 2003-2008 Joaquin M Lopez Munoz.
+ * Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -37,19 +37,15 @@ struct word_counter_entry
   word_counter_entry(std::string word_):word(word_),occurrences(0){}
 };
 
-/* see Compiler specifics: Use of member_offset for info on
- * BOOST_MULTI_INDEX_MEMBER
- */
-
 typedef multi_index_container<
   word_counter_entry,
   indexed_by<
     ordered_non_unique<
-      BOOST_MULTI_INDEX_MEMBER(word_counter_entry,unsigned int,occurrences),
+      member<word_counter_entry,unsigned int,&word_counter_entry::occurrences>,
       std::greater<unsigned int> /* sorted beginning with most frequent */
     >,
     hashed_unique<
-      BOOST_MULTI_INDEX_MEMBER(word_counter_entry,std::string,word)
+      member<word_counter_entry,std::string,&word_counter_entry::word>
     >
   >
 > word_counter;
@@ -70,23 +66,23 @@ int main()
 
   std::string text=
     "En un lugar de la Mancha, de cuyo nombre no quiero acordarme, no ha "
-    "mucho tiempo que vivía un hidalgo de los de lanza en astillero, adarga "
-    "antigua, rocín flaco y galgo corredor. Una olla de algo más vaca que "
-    "carnero, salpicón las más noches, duelos y quebrantos los sábados, "
-    "lantejas los viernes, algún palomino de añadidura los domingos, "
-    "consumían las tres partes de su hacienda. El resto della concluían sayo "
+    "mucho tiempo que vivía un hidalgo de los de lanza en astillero, adarga "
+    "antigua, rocín flaco y galgo corredor. Una olla de algo más vaca que "
+    "carnero, salpicón las más noches, duelos y quebrantos los sábados, "
+    "lantejas los viernes, algún palomino de añadidura los domingos, "
+    "consumían las tres partes de su hacienda. El resto della concluían sayo "
     "de velarte, calzas de velludo para las fiestas, con sus pantuflos de lo "
-    "mesmo, y los días de entresemana se honraba con su vellorí de lo más "
-    "fino. Tenía en su casa una ama que pasaba de los cuarenta, y una "
+    "mesmo, y los días de entresemana se honraba con su vellorí de lo más "
+    "fino. Tenía en su casa una ama que pasaba de los cuarenta, y una "
     "sobrina que no llegaba a los veinte, y un mozo de campo y plaza, que "
-    "así ensillaba el rocín como tomaba la podadera. Frisaba la edad de "
-    "nuestro hidalgo con los cincuenta años; era de complexión recia, seco "
+    "así ensillaba el rocín como tomaba la podadera. Frisaba la edad de "
+    "nuestro hidalgo con los cincuenta años; era de complexión recia, seco "
     "de carnes, enjuto de rostro, gran madrugador y amigo de la caza. "
-    "Quieren decir que tenía el sobrenombre de Quijada, o Quesada, que en "
+    "Quieren decir que tenía el sobrenombre de Quijada, o Quesada, que en "
     "esto hay alguna diferencia en los autores que deste caso escriben; "
-    "aunque, por conjeturas verosímiles, se deja entender que se llamaba "
+    "aunque, por conjeturas verosímiles, se deja entender que se llamaba "
     "Quejana. Pero esto importa poco a nuestro cuento; basta que en la "
-    "narración dél no se salga un punto de la verdad.";
+    "narración dél no se salga un punto de la verdad.";
 
   /* feed the text into the container */
 

example/ip_allocator.cpp

@@ -1,6 +1,6 @@
 /* Boost.MultiIndex example of use of Boost.Interprocess allocators.
  *
- * Copyright 2003-2008 Joaquin M Lopez Munoz.
+ * Copyright 2003-2026 Joaquin M Lopez Munoz.
  * 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)
@@ -10,7 +10,6 @@
 
 #if !defined(NDEBUG)
 #define BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING
-#define BOOST_MULTI_INDEX_ENABLE_SAFE_MODE
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
@@ -104,22 +103,18 @@ struct partial_str_less
  *   * We are using a Boost.Interprocess specific allocator.
  */
 
-/* see Compiler specifics: Use of member_offset for info on
- * BOOST_MULTI_INDEX_MEMBER
- */
-
 typedef multi_index_container<
   book,
   indexed_by<
     ordered_non_unique<
-      BOOST_MULTI_INDEX_MEMBER(book,shared_string,author)
+      member<book,shared_string,&book::author>
     >,
     ordered_non_unique<
-      BOOST_MULTI_INDEX_MEMBER(book,shared_string,name),
+      member<book,shared_string,&book::name>,
       partial_str_less
     >,
     ordered_non_unique<
-      BOOST_MULTI_INDEX_MEMBER(book,unsigned,prize)
+      member<book,unsigned,&book::prize>
     >
   >,
   bip::allocator<book,bip::managed_mapped_file::segment_manager>

example/rearrange.cpp

@@ -1,6 +1,6 @@
 /* Boost.MultiIndex example of use of rearrange facilities.
  *
- * Copyright 2003-2008 Joaquin M Lopez Munoz.
+ * Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -14,7 +14,6 @@
 #endif
 
 #include <boost/config.hpp>
-#include <boost/detail/iterator.hpp>
 #include <boost/multi_index_container.hpp>
 #include <boost/multi_index/random_access_index.hpp>
 #include <boost/random/binomial_distribution.hpp>
@@ -23,6 +22,7 @@
 #include <algorithm>
 #include <iostream>
 #include <iterator>
+#include <random>
 #include <vector>
 
 using boost::multi_index_container;
@@ -136,11 +136,11 @@ void riffle_shuffle(
 {
   static boost::mt19937 rnd_gen;
 
-  typedef typename boost::detail::iterator_traits<
-    RandomAccessIterator>::difference_type         difference_type;
+  typedef typename std::iterator_traits<
+    RandomAccessIterator>::difference_type difference_type;
   typedef boost::binomial_distribution<
-    difference_type>                               rnd_cut_select_type;
-  typedef boost::uniform_real<>                    rnd_deck_select_type;
+    difference_type>                       rnd_cut_select_type;
+  typedef boost::uniform_real<>            rnd_deck_select_type;
 
   rnd_cut_select_type  cut_select(last-first);
   RandomAccessIterator middle=first+cut_select(rnd_gen);
@@ -178,22 +178,28 @@ private:
 };
 
 /* A truly random shuffle (up to stdlib implementation quality) using
- * std::random_shuffle.
+ * std::shuffle.
  */
 
 struct random_shuffler
 {
-  void operator()(deck& d)const
+  void operator()(deck& d)
   {
     dv.clear();
     dv.reserve(d.size());
     std::copy(d.begin(),d.end(),std::back_inserter(dv));
-    std::random_shuffle(dv.begin(),dv.end()); /* do the shuffling  */
+    shuffle_view();
     d.rearrange(dv.begin());                  /* apply to the deck */
   }
 
 private:
-  mutable deck_view dv;
+  deck_view    dv;
+  std::mt19937 e;
+
+  void shuffle_view()
+  {
+    std::shuffle(dv.begin(),dv.end(),e);
+  }
 };
 
 /* Repeat a given shuffling algorithm repeats_num times

include/boost/multi_index/detail/access_specifier.hpp

@@ -1,55 +0,0 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
- * 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)
- *
- * See http://www.boost.org/libs/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_DETAIL_ACCESS_SPECIFIER_HPP
-#define BOOST_MULTI_INDEX_DETAIL_ACCESS_SPECIFIER_HPP
-
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
-#pragma once
-#endif
-
-#include <boost/config.hpp>
-#include <boost/detail/workaround.hpp>
-
-/* In those compilers that do not accept the member template friend syntax,
- * some protected and private sections might need to be specified as
- * public.
- */
-
-#if defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS)
-#define BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS public
-#define BOOST_MULTI_INDEX_PRIVATE_IF_MEMBER_TEMPLATE_FRIENDS public
-#else
-#define BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS protected
-#define BOOST_MULTI_INDEX_PRIVATE_IF_MEMBER_TEMPLATE_FRIENDS private
-#endif
-
-/* GCC does not correctly support in-class using declarations for template
- * functions. See http://gcc.gnu.org/bugzilla/show_bug.cgi?id=9810
- * MSVC 7.1/8.0 seem to have a similar problem, though the conditions in
- * which the error happens are not that simple. I have yet to isolate this
- * into a snippet suitable for bug reporting.
- * Sun Studio also has this problem, which might be related, from the
- * information gathered at Sun forums, with a known issue notified at the
- * internal bug report 6421933. The bug is present up to Studio Express 2,
- * the latest preview version of the future Sun Studio 12. As of this writing
- * (October 2006) it is not known whether a fix will finally make it into the
- * official Sun Studio 12.
- */
-
-#if BOOST_WORKAROUND(__GNUC__, <3)||\
-    BOOST_WORKAROUND(__GNUC__,==3)&&(__GNUC_MINOR__<4)||\
-    BOOST_WORKAROUND(BOOST_MSVC,==1310)||\
-    BOOST_WORKAROUND(BOOST_MSVC,==1400)||\
-    BOOST_WORKAROUND(__SUNPRO_CC,BOOST_TESTED_AT(0x590))
-#define BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS public
-#else
-#define BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS private
-#endif
-
-#endif

include/boost/multi_index/detail/adl_swap.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,7 +9,7 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_ADL_SWAP_HPP
 #define BOOST_MULTI_INDEX_DETAIL_ADL_SWAP_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
@@ -25,14 +25,8 @@ namespace detail{
 template<typename T>
 void adl_swap(T& x,T& y)
 {
-
-#if !defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL)
   using std::swap;
   swap(x,y);
-#else
-  std::swap(x,y);
-#endif
-
 }
 
 } /* namespace multi_index::detail */

include/boost/multi_index/detail/any_container_view.hpp

@@ -0,0 +1,76 @@
+/* Copyright 2003-2021 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_ANY_CONTAINER_VIEW_HPP
+#define BOOST_MULTI_INDEX_DETAIL_ANY_CONTAINER_VIEW_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* type-erased, non-owning view over a ConstIterator-container's range */
+
+template<typename ConstIterator>
+class any_container_view
+{
+public:
+  template<typename Container>
+  any_container_view(const Container& x):px(&x),pt(vtable_for<Container>()){}
+
+  const void*   container()const{return px;}
+  ConstIterator begin()const{return pt->begin(px);}
+  ConstIterator end()const{return pt->end(px);}
+
+private:
+  struct vtable
+  {
+    ConstIterator (*begin)(const void*);
+    ConstIterator (*end)(const void*);
+  };
+
+  template<typename Container>
+  static ConstIterator begin_for(const void* px)
+  {
+    return static_cast<const Container*>(px)->begin();
+  }
+
+  template<typename Container>
+  static ConstIterator end_for(const void* px)
+  {
+    return static_cast<const Container*>(px)->end();
+  }
+
+  template<typename Container>
+  vtable* vtable_for()
+  {
+    static vtable v=
+    {
+      &begin_for<Container>,
+      &end_for<Container>
+    };
+
+    return &v;
+  }
+
+  const void* px;
+  vtable*     pt;
+};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/archive_constructed.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2023 Joaquin M Lopez Munoz.
  * 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)
@@ -9,14 +9,14 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_ARCHIVE_CONSTRUCTED_HPP
 #define BOOST_MULTI_INDEX_DETAIL_ARCHIVE_CONSTRUCTED_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/no_exceptions_support.hpp>
-#include <boost/noncopyable.hpp>
-#include <boost/serialization/serialization.hpp>
+#include <boost/core/no_exceptions_support.hpp>
+#include <boost/core/noncopyable.hpp>
+#include <boost/core/serialization.hpp>
 #include <boost/type_traits/aligned_storage.hpp>
 #include <boost/type_traits/alignment_of.hpp> 
 
@@ -34,7 +34,7 @@ struct archive_constructed:private noncopyable
   template<class Archive>
   archive_constructed(Archive& ar,const unsigned int version)
   {
-    serialization::load_construct_data_adl(ar,&get(),version);
+    core::load_construct_data_adl(ar,&get(),version);
     BOOST_TRY{
       ar>>get();
     }
@@ -48,9 +48,9 @@ struct archive_constructed:private noncopyable
   template<class Archive>
   archive_constructed(const char* name,Archive& ar,const unsigned int version)
   {
-    serialization::load_construct_data_adl(ar,&get(),version);
+    core::load_construct_data_adl(ar,&get(),version);
     BOOST_TRY{
-      ar>>serialization::make_nvp(name,get());
+      ar>>core::make_nvp(name,get());
     }
     BOOST_CATCH(...){
       (&get())->~T();
@@ -64,7 +64,11 @@ struct archive_constructed:private noncopyable
     (&get())->~T();
   }
 
-  T& get(){return *static_cast<T*>(static_cast<void*>(&space));}
+#include <boost/multi_index/detail/ignore_wstrict_aliasing.hpp>
+
+  T& get(){return *reinterpret_cast<T*>(&space);}
+
+#include <boost/multi_index/detail/restore_wstrict_aliasing.hpp>
 
 private:
   typename aligned_storage<sizeof(T),alignment_of<T>::value>::type space;

include/boost/multi_index/detail/augmented_stdtuple.hpp

@@ -0,0 +1,129 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_AUGMENTED_STDTUPLE_HPP
+#define BOOST_MULTI_INDEX_DETAIL_AUGMENTED_STDTUPLE_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/mp11/algorithm.hpp>
+#include <boost/mp11/function.hpp>
+#include <boost/mp11/list.hpp>
+#include <boost/mp11/integer_sequence.hpp>
+#include <boost/mp11/integral.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <tuple>
+#include <type_traits>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* augmented_stdtuple<Ts...> derives from std::tuple<Ts...> and provides the
+ * following non-standard constructors:
+ * 
+ * - augmented_stdtuple(const Ts& = Ts()...) (this signature is not legal C++,
+ *   shown for explanatory purposes).
+ * - augmented_stdtuple(boost::tuple<Ts...>) if sizeof...(Ts) does not exceed
+ *   the maximum length of a boost::tuple (10 as of this writing).
+ */
+
+template<typename T,typename U>
+using is_convertible_to_cref=std::is_convertible<T,const U&>;
+
+template<typename FromList,typename ToList,typename=void>
+struct are_convertible_to_crefs:mp11::mp_false{};
+
+template<typename FromList,typename ToList>
+struct are_convertible_to_crefs<
+  FromList,ToList,
+  typename std::enable_if<
+    (mp11::mp_size<FromList>::value<=mp11::mp_size<ToList>::value)
+  >::type
+>:
+mp11::mp_apply<
+  mp11::mp_and,
+  mp11::mp_transform<
+    is_convertible_to_cref,
+    FromList,
+    mp11::mp_take_c<ToList,mp11::mp_size<FromList>::value>
+  >
+>
+{};
+
+template<typename... Ts>
+struct augmented_stdtuple:std::tuple<Ts...>
+{
+private:
+  using super=std::tuple<Ts...>;
+  static constexpr std::size_t N=sizeof...(Ts);
+
+  template<typename... Args>
+  using are_convertible_to_crefs=
+    typename detail::are_convertible_to_crefs<mp11::mp_list<Args...>,super>;
+
+  struct boost_tuple_too_short{};
+  using boost_tuple_arg=mp11::mp_eval_if_c<
+    (mp11::mp_size<boost::tuple<>>::value < N),
+    boost_tuple_too_short,
+    boost::tuple,Ts...
+  >;
+
+  struct full_args_ctor{};
+  augmented_stdtuple(full_args_ctor,const Ts&... args):super(args...){}
+
+  struct partial_args_ctor{};
+  template<std::size_t... Is,typename... Args>
+  augmented_stdtuple(
+    partial_args_ctor,mp11::index_sequence<Is...>,Args&&... args):
+    augmented_stdtuple(
+      full_args_ctor{},
+      std::forward<Args>(args)...,
+      typename std::tuple_element<sizeof...(Args)+Is,super>::type()...)
+  {}
+
+  struct boost_tuple_ctor{};
+  template<std::size_t... Is>
+  augmented_stdtuple(
+    boost_tuple_ctor,mp11::index_sequence<Is...>,const boost_tuple_arg& x):
+    super(tuples::get<Is>(x)...)
+  {}
+
+public:
+  template<
+    typename... Args,
+    typename std::enable_if<
+      are_convertible_to_crefs<Args&&...>::value
+    >::type* =nullptr
+  >
+  augmented_stdtuple(Args&&... args):
+    augmented_stdtuple(
+      partial_args_ctor(),mp11::make_index_sequence<N-sizeof...(Args)>(),
+      std::forward<Args>(args)...)
+  {}
+
+  augmented_stdtuple(const super& x):super(x){}
+
+  augmented_stdtuple(const boost_tuple_arg& x):
+    augmented_stdtuple(
+      boost_tuple_ctor(),mp11::make_index_sequence<N>(),x)
+  {}
+};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/auto_space.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,16 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_AUTO_SPACE_HPP
 #define BOOST_MULTI_INDEX_DETAIL_AUTO_SPACE_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
 #include <algorithm>
-#include <boost/detail/allocator_utilities.hpp>
+#include <boost/core/noncopyable.hpp>
+#include <boost/core/allocator_access.hpp>
 #include <boost/multi_index/detail/adl_swap.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
-#include <boost/noncopyable.hpp>
+#include <boost/type_traits/integral_constant.hpp>
 #include <memory>
 
 namespace boost{
@@ -40,27 +40,21 @@ namespace detail{
  *    "of zero length", http://gcc.gnu.org/bugzilla/show_bug.cgi?id=14176
  *   C++ Standard Library Defect Report List (Revision 28), issue 199
  *     "What does allocate(0) return?",
- *     http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#199
+ *     http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199
  */
 
 template<typename T,typename Allocator=std::allocator<T> >
 struct auto_space:private noncopyable
 {
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,T
-    >::type
-  >::type::pointer pointer;
+  typedef allocator_rebind_t<Allocator,T>  allocator;
+  typedef allocator_pointer_t<allocator>   pointer;
+  typedef allocator_size_type_t<allocator> size_type;
 
-  explicit auto_space(const Allocator& al=Allocator(),std::size_t n=1):
-  al_(al),n_(n),data_(n_?al_.allocate(n_):pointer(0))
+  explicit auto_space(const Allocator& al=Allocator(),size_type n=1):
+  al_(al),n_(n),data_(n_?allocator_allocate(al_,n_):pointer(0))
   {}
 
-  ~auto_space()
-  {
-    if(n_)al_.deallocate(data_,n_);
-  }
+  ~auto_space(){if(n_)allocator_deallocate(al_,data_,n_);}
 
   Allocator get_allocator()const{return al_;}
 
@@ -68,16 +62,30 @@ struct auto_space:private noncopyable
 
   void swap(auto_space& x)
   {
-    if(al_!=x.al_)adl_swap(al_,x.al_);
+    swap(
+      x,
+      boost::integral_constant<
+        bool,
+        allocator_propagate_on_container_swap_t<allocator>::value>());
+  }
+
+  void swap(auto_space& x,boost::true_type /* swap_allocators */)
+  {
+    adl_swap(al_,x.al_);
     std::swap(n_,x.n_);
     std::swap(data_,x.data_);
   }
     
+  void swap(auto_space& x,boost::false_type /* swap_allocators */)
+  {
+    std::swap(n_,x.n_);
+    std::swap(data_,x.data_);
+  }
+
 private:
-  typename boost::detail::allocator::rebind_to<
-    Allocator,T>::type                          al_;
-  std::size_t                                   n_;
-  pointer                                       data_;
+  allocator al_;
+  size_type n_;
+  pointer   data_;
 };
 
 template<typename T,typename Allocator>

include/boost/multi_index/detail/bad_archive_exception.hpp

@@ -0,0 +1,36 @@
+/* Copyright 2003-2023 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_BAD_ARCHIVE_EXCEPTION_HPP
+#define BOOST_MULTI_INDEX_DETAIL_BAD_ARCHIVE_EXCEPTION_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <stdexcept>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+struct bad_archive_exception:std::runtime_error
+{
+  bad_archive_exception():std::runtime_error("Invalid or corrupted archive"){}
+};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/base_type.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,18 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_BASE_TYPE_HPP
 #define BOOST_MULTI_INDEX_DETAIL_BASE_TYPE_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/workaround.hpp>
-#include <boost/mpl/at.hpp>
-#include <boost/mpl/apply.hpp>
-#include <boost/mpl/size.hpp>
+#include <boost/mp11/integral.hpp>
+#include <boost/mp11/list.hpp>
+#include <boost/mp11/utility.hpp>
 #include <boost/multi_index/detail/index_base.hpp>
 #include <boost/multi_index/detail/is_index_list.hpp>
-#include <boost/multi_index/detail/msvc_index_specifier.hpp>
 #include <boost/static_assert.hpp>
 
 namespace boost{
@@ -29,51 +27,31 @@ namespace multi_index{
 
 namespace detail{
 
-/* MPL machinery to construct a linear hierarchy of indices out of
- * a index list.
+/* Mp11 machinery to construct a linear hierarchy of indices out of
+ * an index list.
  */
 
-#if BOOST_WORKAROUND(BOOST_MSVC,<1310)
-struct index_applier
-{
-  template<typename IndexSpecifierMeta,typename SuperMeta>
-  struct apply:
-    msvc_index_specifier<IndexSpecifierMeta::type>::
-      template result_index_class<SuperMeta>
-  {
-  }; 
-};
-#else
-struct index_applier
-{
-  template<typename IndexSpecifierMeta,typename SuperMeta>
-  struct apply
-  {
-    typedef typename IndexSpecifierMeta::type            index_specifier;
-    typedef typename index_specifier::
-      BOOST_NESTED_TEMPLATE index_class<SuperMeta>::type type;
-  }; 
-};
-#endif
+template<typename N,typename Mp11IndexSpecifierList,typename SuperMeta>
+using nth_layer_index=typename mp11::mp_at<Mp11IndexSpecifierList,N>::
+  template index_class<SuperMeta>::type;
 
 template<int N,typename Value,typename IndexSpecifierList,typename Allocator>
 struct nth_layer
 {
-  BOOST_STATIC_CONSTANT(int,length=mpl::size<IndexSpecifierList>::value);
-
-  typedef typename  mpl::eval_if_c<
-    N==length,
-    mpl::identity<index_base<Value,IndexSpecifierList,Allocator> >,
-    mpl::apply2<
-      index_applier,
-      mpl::at_c<IndexSpecifierList,N>,
-      nth_layer<N+1,Value,IndexSpecifierList,Allocator>
-    >
-  >::type type;
+  using Mp11IndexSpecifierList=detail::mp11_index_list<IndexSpecifierList>;
+  using type=mp11::mp_eval_if_c<
+    N==mp11::mp_size<Mp11IndexSpecifierList>::value,
+    index_base<Value,IndexSpecifierList,Allocator>,
+    nth_layer_index,
+    mp11::mp_int<N>,
+    Mp11IndexSpecifierList,
+    nth_layer<N+1,Value,IndexSpecifierList,Allocator>
+  >;
 };
 
 template<typename Value,typename IndexSpecifierList,typename Allocator>
-struct multi_index_base_type:nth_layer<0,Value,IndexSpecifierList,Allocator>
+struct multi_index_base_type:
+  nth_layer<0,Value,IndexSpecifierList,Allocator>
 {
   BOOST_STATIC_ASSERT(detail::is_index_list<IndexSpecifierList>::value);
 };

include/boost/multi_index/detail/bidir_node_iterator.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2026 Joaquin M Lopez Munoz.
  * 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)
@@ -9,16 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_BIDIR_NODE_ITERATOR_HPP
 #define BOOST_MULTI_INDEX_DETAIL_BIDIR_NODE_ITERATOR_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/multi_index/detail/raw_ptr.hpp>
 #include <boost/operators.hpp>
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-#include <boost/serialization/nvp.hpp>
-#include <boost/serialization/split_member.hpp>
+#include <boost/core/serialization.hpp>
 #endif
 
 namespace boost{
@@ -36,11 +36,12 @@ class bidir_node_iterator:
   public bidirectional_iterator_helper<
     bidir_node_iterator<Node>,
     typename Node::value_type,
-    std::ptrdiff_t,
+    typename Node::difference_type,
     const typename Node::value_type*,
     const typename Node::value_type&>
 {
 public:
+  /* coverity[uninit_ctor]: suppress warning */
   bidir_node_iterator(){}
   explicit bidir_node_iterator(Node* node_):node(node_){}
 
@@ -66,23 +67,27 @@ public:
    * see explanation in safe_mode_iterator notes in safe_mode.hpp.
    */
 
-  BOOST_SERIALIZATION_SPLIT_MEMBER()
+  template<class Archive>
+  void serialize(Archive& ar,const unsigned int version)
+  {
+    core::split_member(ar,*this,version);
+  }
 
   typedef typename Node::base_type node_base_type;
 
   template<class Archive>
   void save(Archive& ar,const unsigned int)const
   {
-    node_base_type* bnode=node;
-    ar<<serialization::make_nvp("pointer",bnode);
+    node_base_type* bnode=get_node();
+    ar<<core::make_nvp("pointer",bnode);
   }
 
   template<class Archive>
   void load(Archive& ar,const unsigned int)
   {
     node_base_type* bnode;
-    ar>>serialization::make_nvp("pointer",bnode);
-    node=static_cast<Node*>(bnode);
+    ar>>core::make_nvp("pointer",bnode);
+    node=typename Node::pointer(static_cast<Node*>(bnode));
   }
 #endif
 
@@ -90,10 +95,10 @@ public:
 
   typedef Node node_type;
 
-  Node* get_node()const{return node;}
+  Node* get_node()const{return raw_ptr<Node*>(node);}
 
 private:
-  Node* node;
+  typename Node::pointer node;
 };
 
 template<typename Node>

include/boost/multi_index/detail/bucket_array.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,22 +9,26 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_BUCKET_ARRAY_HPP
 #define BOOST_MULTI_INDEX_DETAIL_BUCKET_ARRAY_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
 #include <algorithm>
+#include <boost/core/allocator_access.hpp>
+#include <boost/core/noncopyable.hpp>
 #include <boost/multi_index/detail/auto_space.hpp>
 #include <boost/multi_index/detail/hash_index_node.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
-#include <boost/noncopyable.hpp>
+#include <boost/preprocessor/repetition/repeat.hpp>
+#include <boost/preprocessor/seq/elem.hpp>
+#include <boost/preprocessor/seq/enum.hpp>
+#include <boost/preprocessor/seq/size.hpp>
 #include <cstddef>
 #include <limits.h>
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-#include <boost/archive/archive_exception.hpp>
-#include <boost/serialization/access.hpp>
+#include <boost/core/serialization.hpp>
+#include <boost/multi_index/detail/bad_archive_exception.hpp>
 #include <boost/throw_exception.hpp> 
 #endif
 
@@ -36,115 +40,154 @@ namespace detail{
 
 /* bucket structure for use by hashed indices */
 
+#define BOOST_MULTI_INDEX_BA_SIZES_32BIT                                  \
+(53ul)(97ul)(193ul)(389ul)(769ul)                                         \
+(1543ul)(3079ul)(6151ul)(12289ul)(24593ul)                                \
+(49157ul)(98317ul)(196613ul)(393241ul)(786433ul)                          \
+(1572869ul)(3145739ul)(6291469ul)(12582917ul)(25165843ul)                 \
+(50331653ul)(100663319ul)(201326611ul)(402653189ul)(805306457ul)          \
+(1610612741ul)(3221225473ul)
+
+#if ((((ULONG_MAX>>16)>>16)>>16)>>15)==0 /* unsigned long less than 64 bits */
+#define BOOST_MULTI_INDEX_BA_SIZES                                         \
+BOOST_MULTI_INDEX_BA_SIZES_32BIT                                           \
+(4294967291ul)
+#else
+  /* obtained with aid from
+   *   http://javaboutique.internet.com/prime_numb/
+   *   http://www.rsok.com/~jrm/next_ten_primes.html
+   * and verified with
+   *   http://www.alpertron.com.ar/ECM.HTM
+   */
+
+#define BOOST_MULTI_INDEX_BA_SIZES                                         \
+BOOST_MULTI_INDEX_BA_SIZES_32BIT                                           \
+(6442450939ul)(12884901893ul)(25769803751ul)(51539607551ul)                \
+(103079215111ul)(206158430209ul)(412316860441ul)(824633720831ul)           \
+(1649267441651ul)(3298534883309ul)(6597069766657ul)(13194139533299ul)      \
+(26388279066623ul)(52776558133303ul)(105553116266489ul)(211106232532969ul) \
+(422212465066001ul)(844424930131963ul)(1688849860263953ul)                 \
+(3377699720527861ul)(6755399441055731ul)(13510798882111483ul)              \
+(27021597764222939ul)(54043195528445957ul)(108086391056891903ul)           \
+(216172782113783843ul)(432345564227567621ul)(864691128455135207ul)         \
+(1729382256910270481ul)(3458764513820540933ul)(6917529027641081903ul)      \
+(13835058055282163729ul)(18446744073709551557ul)
+#endif
+
+template<bool _=true> /* templatized to have in-header static var defs */
 class bucket_array_base:private noncopyable
 {
 protected:
-  inline static std::size_t next_prime(std::size_t n)
+  static const std::size_t sizes[
+    BOOST_PP_SEQ_SIZE(BOOST_MULTI_INDEX_BA_SIZES)];
+
+  static std::size_t size_index(std::size_t n)
   {
-    static const std::size_t prime_list[]={
-      53ul, 97ul, 193ul, 389ul, 769ul,
-      1543ul, 3079ul, 6151ul, 12289ul, 24593ul,
-      49157ul, 98317ul, 196613ul, 393241ul, 786433ul,
-      1572869ul, 3145739ul, 6291469ul, 12582917ul, 25165843ul,
-      50331653ul, 100663319ul, 201326611ul, 402653189ul, 805306457ul,
-      1610612741ul, 3221225473ul,
-
-#if ((((ULONG_MAX>>16)>>16)>>16)>>15)==0 /* unsigned long less than 64 bits */
-      4294967291ul
-#else
-      /* obtained with aid from
-       *   http://javaboutique.internet.com/prime_numb/
-       *   http://www.rsok.com/~jrm/next_ten_primes.html
-       * and verified with
-       *   http://www.alpertron.com.ar/ECM.HTM
-       */
-
-      6442450939ul, 12884901893ul, 25769803751ul, 51539607551ul,
-      103079215111ul, 206158430209ul, 412316860441ul, 824633720831ul,
-      1649267441651ul, 3298534883309ul, 6597069766657ul, 13194139533299ul,
-      26388279066623ul, 52776558133303ul, 105553116266489ul, 211106232532969ul,
-      422212465066001ul, 844424930131963ul, 1688849860263953ul,
-      3377699720527861ul, 6755399441055731ul, 13510798882111483ul,
-      27021597764222939ul, 54043195528445957ul, 108086391056891903ul,
-      216172782113783843ul, 432345564227567621ul, 864691128455135207ul,
-      1729382256910270481ul, 3458764513820540933ul, 6917529027641081903ul,
-      13835058055282163729ul, 18446744073709551557ul
-#endif
-
-    };
-    static const std::size_t prime_list_size=
-      sizeof(prime_list)/sizeof(prime_list[0]);
-
-    std::size_t const *bound=
-      std::lower_bound(prime_list,prime_list+prime_list_size,n);
-    if(bound==prime_list+prime_list_size)bound--;
-    return *bound;
+    const std::size_t *bound=std::lower_bound(sizes,sizes+sizes_length,n);
+    if(bound==sizes+sizes_length)--bound;
+    return bound-sizes;
   }
+
+#define BOOST_MULTI_INDEX_BA_POSITION_CASE(z,n,_)                    \
+  case n:return hash%BOOST_PP_SEQ_ELEM(n,BOOST_MULTI_INDEX_BA_SIZES);
+
+  static std::size_t position(std::size_t hash,std::size_t size_index_)
+  {
+    /* Accelerate hash%sizes[size_index_] by replacing with a switch on
+     * hash%Ci expressions, each Ci a compile-time constant, which the
+     * compiler can implement without using integer division.
+     */
+
+    switch(size_index_){
+      default: /* never used */
+      BOOST_PP_REPEAT(
+        BOOST_PP_SEQ_SIZE(BOOST_MULTI_INDEX_BA_SIZES),
+        BOOST_MULTI_INDEX_BA_POSITION_CASE,~)
+    }
+  }
+
+private:
+  static const std::size_t sizes_length;
 };
 
+template<bool _>
+const std::size_t bucket_array_base<_>::sizes[]={
+  BOOST_PP_SEQ_ENUM(BOOST_MULTI_INDEX_BA_SIZES)
+};
+
+template<bool _>
+const std::size_t bucket_array_base<_>::sizes_length=
+  sizeof(bucket_array_base<_>::sizes)/
+  sizeof(bucket_array_base<_>::sizes[0]);
+
+#undef BOOST_MULTI_INDEX_BA_POSITION_CASE
+#undef BOOST_MULTI_INDEX_BA_SIZES
+#undef BOOST_MULTI_INDEX_BA_SIZES_32BIT
+
 template<typename Allocator>
-class bucket_array:public bucket_array_base
+class bucket_array:bucket_array_base<>
 {
-  typedef typename prevent_eti<
-    Allocator,
-    hashed_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        Allocator,
-        char
-      >::type
+  typedef bucket_array_base<>                        super;
+  typedef hashed_index_base_node_impl<
+    allocator_rebind_t<
+      Allocator,
+      char
     >
-  >::type                                           node_impl_type;
+  >                                                  base_node_impl_type;
 
 public:
-  typedef typename node_impl_type::pointer          pointer;
+  typedef typename base_node_impl_type::base_pointer base_pointer;
+  typedef typename base_node_impl_type::pointer      pointer;
 
-  bucket_array(const Allocator& al,pointer end_,std::size_t size):
-    size_(bucket_array_base::next_prime(size)),
-    spc(al,size_+1)
+  bucket_array(const Allocator& al,pointer end_,std::size_t size_):
+    size_index_(super::size_index(size_)),
+    spc(al,static_cast<auto_space_size_type>(super::sizes[size_index_]+1))
   {
-    clear();
-    end()->next()=end_;
-    end_->next()=end();
+    clear(end_);
   }
 
   std::size_t size()const
   {
-    return size_;
+    return super::sizes[size_index_];
   }
 
   std::size_t position(std::size_t hash)const
   {
-    return hash%size_;
+    return super::position(hash,size_index_);
   }
 
-  pointer begin()const{return buckets();}
-  pointer end()const{return buckets()+size_;}
-  pointer at(std::size_t n)const{return buckets()+n;}
+  base_pointer begin()const{return buckets();}
+  base_pointer end()const{return buckets()+size();}
+  base_pointer at(std::size_t n)const{return buckets()+n;}
 
-  std::size_t first_nonempty(std::size_t n)const
+  void clear(pointer end_)
   {
-    for(;;++n){
-      pointer x=at(n);
-      if(x->next()!=x)return n;
-    }
-  }
-
-  void clear()
-  {
-    for(pointer x=begin(),y=end();x!=y;++x)x->next()=x;
-  }
+    for(base_pointer x=begin(),y=end();x!=y;++x)x->prior()=pointer(0);
+    end()->prior()=end_->prior()=end_;
+    end_->next()=end();
+ }
 
   void swap(bucket_array& x)
   {
-    std::swap(size_,x.size_);
+    std::swap(size_index_,x.size_index_);
     spc.swap(x.spc);
   }
 
-private:
-  std::size_t                          size_;
-  auto_space<node_impl_type,Allocator> spc;
+  template<typename BoolConstant>
+  void swap(bucket_array& x,BoolConstant swap_allocators)
+  {
+    std::swap(size_index_,x.size_index_);
+    spc.swap(x.spc,swap_allocators);
+  }
 
-  pointer buckets()const
+private:
+  typedef auto_space<base_node_impl_type,Allocator> auto_space_type;
+  typedef typename auto_space_type::size_type       auto_space_size_type;
+
+  std::size_t      size_index_;
+  auto_space_type  spc;
+
+  base_pointer buckets()const
   {
     return spc.data();
   }
@@ -181,28 +224,19 @@ void swap(bucket_array<Allocator>& x,bucket_array<Allocator>& y)
  * somehow invalid archive.
  */
 
-#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
-namespace serialization{
-#else
 namespace multi_index{
 namespace detail{
-#endif
 
 template<class Archive,typename Allocator>
 inline void load_construct_data(
   Archive&,boost::multi_index::detail::bucket_array<Allocator>*,
   const unsigned int)
 {
-  throw_exception(
-    archive::archive_exception(archive::archive_exception::other_exception));
+  throw_exception(boost::multi_index::detail::bad_archive_exception());
 }
 
-#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
-} /* namespace serialization */
-#else
 } /* namespace multi_index::detail */
 } /* namespace multi_index */
-#endif
 
 #endif
 

include/boost/multi_index/detail/cons_stdtuple.hpp

@@ -0,0 +1,93 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_CONS_STDTUPLE_HPP
+#define BOOST_MULTI_INDEX_DETAIL_CONS_STDTUPLE_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/mp11/utility.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <tuple>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* std::tuple wrapper providing the cons-based interface of boost::tuple for
+ * composite_key interoperability.
+ */
+
+template<typename StdTuple,std::size_t N>
+struct cons_stdtuple;
+
+struct cons_stdtuple_ctor_terminal
+{
+  typedef boost::tuples::null_type result_type;
+
+  template<typename StdTuple>
+  static result_type create(const StdTuple&)
+  {
+    return boost::tuples::null_type();
+  }
+};
+
+template<typename StdTuple,std::size_t N>
+struct cons_stdtuple_ctor_normal
+{
+  typedef cons_stdtuple<StdTuple,N> result_type;
+
+  static result_type create(const StdTuple& t)
+  {
+    return result_type(t);
+  }
+};
+
+template<typename StdTuple,std::size_t N=0>
+struct cons_stdtuple_ctor:
+  mp11::mp_if_c<
+    N<std::tuple_size<StdTuple>::value,
+    cons_stdtuple_ctor_normal<StdTuple,N>,
+    cons_stdtuple_ctor_terminal
+  >
+{};
+
+template<typename StdTuple,std::size_t N>
+struct cons_stdtuple
+{
+  typedef typename std::tuple_element<N,StdTuple>::type head_type;
+  typedef cons_stdtuple_ctor<StdTuple,N+1>              tail_ctor;
+  typedef typename tail_ctor::result_type               tail_type;
+  
+  cons_stdtuple(const StdTuple& t_):t(t_){}
+
+  const head_type& get_head()const{return std::get<N>(t);}
+  tail_type get_tail()const{return tail_ctor::create(t);}
+    
+  const StdTuple& t;
+};
+
+template<typename StdTuple>
+typename cons_stdtuple_ctor<StdTuple>::result_type
+make_cons_stdtuple(const StdTuple& t)
+{
+  return cons_stdtuple_ctor<StdTuple>::create(t);
+}
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/converter.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2020 Joaquin M Lopez Munoz.
  * 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)
@@ -9,7 +9,7 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_CONVERTER_HPP
 #define BOOST_MULTI_INDEX_DETAIL_CONVERTER_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
@@ -31,13 +31,15 @@ struct converter
   static Index&       index(MultiIndexContainer& x){return x;}
 
   static typename Index::const_iterator const_iterator(
-    const MultiIndexContainer& x,typename MultiIndexContainer::node_type* node)
+    const MultiIndexContainer& x,
+    typename MultiIndexContainer::final_node_type* node)
   {
     return x.Index::make_iterator(node);
   }
 
   static typename Index::iterator iterator(
-    MultiIndexContainer& x,typename MultiIndexContainer::node_type* node)
+    MultiIndexContainer& x,
+    typename MultiIndexContainer::final_node_type* node)
   {
     return x.Index::make_iterator(node);
   }

include/boost/multi_index/detail/copy_map.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,18 +9,20 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_COPY_MAP_HPP
 #define BOOST_MULTI_INDEX_DETAIL_COPY_MAP_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
 #include <algorithm>
-#include <boost/detail/no_exceptions_support.hpp>
+#include <boost/core/addressof.hpp>
+#include <boost/core/allocator_access.hpp>
+#include <boost/core/no_exceptions_support.hpp>
+#include <boost/core/noncopyable.hpp>
 #include <boost/multi_index/detail/auto_space.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
-#include <boost/noncopyable.hpp>
-#include <cstddef>
+#include <boost/multi_index/detail/raw_ptr.hpp>
 #include <functional>
+#include <utility>
 
 namespace boost{
 
@@ -54,14 +56,30 @@ struct copy_map_entry
   }
 };
 
+struct copy_map_value_copier
+{
+  template<typename Value>
+  const Value& operator()(Value& x)const{return x;}
+};
+
+struct copy_map_value_mover
+{
+  template<typename Value>
+  Value&& operator()(Value& x)const{return std::move(x);}
+};
+
 template <typename Node,typename Allocator>
 class copy_map:private noncopyable
 {
+  typedef allocator_rebind_t<Allocator,Node>  allocator_type;
+  typedef allocator_pointer_t<allocator_type> pointer;
+
 public:
-  typedef const copy_map_entry<Node>* const_iterator;
+  typedef const copy_map_entry<Node>*           const_iterator;
+  typedef allocator_size_type_t<allocator_type> size_type;
 
   copy_map(
-    const Allocator& al,std::size_t size,Node* header_org,Node* header_cpy):
+    const Allocator& al,size_type size,Node* header_org,Node* header_cpy):
     al_(al),size_(size),spc(al_,size_),n(0),
     header_org_(header_org),header_cpy_(header_cpy),released(false)
   {}
@@ -69,33 +87,19 @@ public:
   ~copy_map()
   {
     if(!released){
-      for(std::size_t i=0;i<n;++i){
-        boost::detail::allocator::destroy(&(spc.data()+i)->second->value());
+      for(size_type i=0;i<n;++i){
+        allocator_destroy(
+          al_,boost::addressof((spc.data()+i)->second->value()));
         deallocate((spc.data()+i)->second);
       }
     }
   }
 
-  const_iterator begin()const{return &*spc.data();}
-  const_iterator end()const{return &*(spc.data()+n);}
+  const_iterator begin()const{return raw_ptr<const_iterator>(spc.data());}
+  const_iterator end()const{return raw_ptr<const_iterator>(spc.data()+n);}
 
-  void clone(Node* node)
-  {
-    (spc.data()+n)->first=node;
-    (spc.data()+n)->second=&*al_.allocate(1);
-    BOOST_TRY{
-      boost::detail::allocator::construct(
-        &(spc.data()+n)->second->value(),node->value());
-    }
-    BOOST_CATCH(...){
-      deallocate((spc.data()+n)->second);
-      BOOST_RETHROW;
-    }
-    BOOST_CATCH_END
-    ++n;
-
-    if(n==size_)std::sort(&*spc.data(),&*spc.data()+size_);
-  }
+  void copy_clone(Node* node){clone(node,copy_map_value_copier());}
+  void move_clone(Node* node){clone(node,copy_map_value_mover());}
 
   Node* find(Node* node)const
   {
@@ -110,24 +114,46 @@ public:
   }
 
 private:
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,Node>::type
-  >::type                                         allocator_type;
-  typedef typename allocator_type::pointer        allocator_pointer;
+  allocator_type                             al_;
+  size_type                                  size_;
+  auto_space<copy_map_entry<Node>,Allocator> spc;
+  size_type                                  n;
+  Node*                                      header_org_;
+  Node*                                      header_cpy_;
+  bool                                       released;
 
-  allocator_type                                  al_;
-  std::size_t                                     size_;
-  auto_space<copy_map_entry<Node>,Allocator>      spc;
-  std::size_t                                     n;
-  Node*                                           header_org_;
-  Node*                                           header_cpy_;
-  bool                                            released;
+  pointer allocate()
+  {
+    return allocator_allocate(al_,1);
+  }
 
   void deallocate(Node* node)
   {
-    al_.deallocate(static_cast<allocator_pointer>(node),1);
+    allocator_deallocate(al_,static_cast<pointer>(node),1);
+  }
+
+  template<typename ValueAccess>
+  void clone(Node* node,ValueAccess access)
+  {
+    (spc.data()+n)->first=node;
+    (spc.data()+n)->second=raw_ptr<Node*>(allocate());
+    BOOST_TRY{
+      allocator_construct(
+        al_,boost::addressof((spc.data()+n)->second->value()),
+        access(node->value()));
+    }
+    BOOST_CATCH(...){
+      deallocate((spc.data()+n)->second);
+      BOOST_RETHROW;
+    }
+    BOOST_CATCH_END
+    ++n;
+
+    if(n==size_){
+      std::sort(
+        raw_ptr<copy_map_entry<Node>*>(spc.data()),
+        raw_ptr<copy_map_entry<Node>*>(spc.data())+size_);
+    }
   }
 };
 

include/boost/multi_index/detail/define_if_constexpr_macro.hpp

@@ -0,0 +1,34 @@
+/* Copyright 2003-2022 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#if !defined(BOOST_CONFIG_HPP)
+#error <boost/config.hpp> must be included before this header
+#endif
+
+#if !defined(BOOST_MULTI_INDEX_DETAIL_UNDEF_IF_CONSTEXPR_MACRO)
+
+#if !defined(BOOST_NO_CXX17_IF_CONSTEXPR)
+#define BOOST_MULTI_INDEX_IF_CONSTEXPR if constexpr
+#else
+#define BOOST_MULTI_INDEX_IF_CONSTEXPR if
+#if defined(BOOST_MSVC)
+#define BOOST_MULTI_INDEX_DETAIL_C4127_DISABLED
+#pragma warning(push)
+#pragma warning(disable:4127) /* conditional expression is constant */
+#endif
+#endif
+
+#else
+
+#undef BOOST_MULTI_INDEX_IF_CONSTEXPR 
+#if defined(BOOST_MULTI_INDEX_DETAIL_C4127_DISABLED)
+#pragma warning(pop)
+#undef BOOST_MULTI_INDEX_DETAIL_C4127_DISABLED
+#endif
+
+#endif

include/boost/multi_index/detail/do_not_copy_elements_tag.hpp

@@ -0,0 +1,34 @@
+/* Copyright 2003-2013 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_DO_NOT_COPY_ELEMENTS_TAG_HPP
+#define BOOST_MULTI_INDEX_DETAIL_DO_NOT_COPY_ELEMENTS_TAG_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* Used to mark a special ctor variant that copies the internal objects of
+ * a container but not its elements.
+ */
+
+struct do_not_copy_elements_tag{};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/duplicates_iterator.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2018 Joaquin M Lopez Munoz.
  * 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)
@@ -9,12 +9,11 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_DUPLICATES_ITERATOR_HPP
 #define BOOST_MULTI_INDEX_DETAIL_DUPLICATES_ITERATOR_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <cstddef>
 #include <iterator>
 
 namespace boost{
@@ -32,7 +31,7 @@ class duplicates_iterator
 {
 public:
   typedef typename Node::value_type        value_type;
-  typedef std::ptrdiff_t                   difference_type;
+  typedef typename Node::difference_type   difference_type;
   typedef const typename Node::value_type* pointer;
   typedef const typename Node::value_type& reference;
   typedef std::forward_iterator_tag        iterator_category;

include/boost/multi_index/detail/has_tag.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,12 +9,12 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_HAS_TAG_HPP
 #define BOOST_MULTI_INDEX_DETAIL_HAS_TAG_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/mpl/contains.hpp>
+#include <boost/mp11/algorithm.hpp>
 
 namespace boost{
 
@@ -28,9 +28,7 @@ template<typename Tag>
 struct has_tag
 {
   template<typename Index>
-  struct apply:mpl::contains<BOOST_DEDUCED_TYPENAME Index::tag_list,Tag>
-  {
-  }; 
+  using fn=mp11::mp_contains<typename Index::tag_list,Tag>;
 };
 
 } /* namespace multi_index::detail */
@@ -39,4 +37,4 @@ struct has_tag
 
 } /* namespace boost */
 
-#endif
+#endif

include/boost/multi_index/detail/hash_index_args.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,20 +9,18 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_ARGS_HPP
 #define BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_ARGS_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/functional/hash.hpp>
-#include <boost/mpl/aux_/na.hpp>
-#include <boost/mpl/eval_if.hpp>
-#include <boost/mpl/identity.hpp>
-#include <boost/mpl/if.hpp>
+#include <boost/container_hash/hash.hpp>
+#include <boost/mp11/utility.hpp>
 #include <boost/multi_index/tag.hpp>
 #include <boost/static_assert.hpp>
 #include <boost/type_traits/is_same.hpp>
 #include <functional>
+#include <type_traits>
 
 namespace boost{
 
@@ -46,54 +44,44 @@ namespace detail{
  * argument-dependent polymorphism.
  */
 
-template<typename KeyFromValue>
-struct index_args_default_hash
-{
-  typedef ::boost::hash<typename KeyFromValue::result_type> type;
-};
-
-template<typename KeyFromValue>
-struct index_args_default_pred
-{
-  typedef std::equal_to<typename KeyFromValue::result_type> type;
-};
-
 template<typename Arg1,typename Arg2,typename Arg3,typename Arg4>
 struct hashed_index_args
 {
   typedef is_tag<Arg1> full_form;
 
-  typedef typename mpl::if_<
+  typedef mp11::mp_if<
     full_form,
     Arg1,
-    tag< > >::type                                   tag_list_type;
-  typedef typename mpl::if_<
+    tag< > >                                  tag_list_type;
+  typedef mp11::mp_if<
     full_form,
     Arg2,
-    Arg1>::type                                      key_from_value_type;
-  typedef typename mpl::if_<
+    Arg1>                                     key_from_value_type;
+  typedef mp11::mp_if<
     full_form,
     Arg3,
-    Arg2>::type                                      supplied_hash_type;
-  typedef typename mpl::eval_if<
-    mpl::is_na<supplied_hash_type>,
-    index_args_default_hash<key_from_value_type>,
-    mpl::identity<supplied_hash_type>
-  >::type                                            hash_type;
-  typedef typename mpl::if_<
+    Arg2>                                     supplied_hash_type;
+  typedef mp11::mp_eval_if_c<
+    !std::is_void<supplied_hash_type>::value,
+    supplied_hash_type,
+    boost::hash,
+    typename key_from_value_type::result_type
+  >                                           hash_type;
+  typedef mp11::mp_if<
     full_form,
     Arg4,
-    Arg3>::type                                      supplied_pred_type;
-  typedef typename mpl::eval_if<
-    mpl::is_na<supplied_pred_type>,
-    index_args_default_pred<key_from_value_type>,
-    mpl::identity<supplied_pred_type>
-  >::type                                            pred_type;
+    Arg3>                                     supplied_pred_type;
+  typedef mp11::mp_eval_if_c<
+    !std::is_void<supplied_pred_type>::value,
+    supplied_pred_type,
+    std::equal_to,
+    typename key_from_value_type::result_type
+  >                                           pred_type;
 
   BOOST_STATIC_ASSERT(is_tag<tag_list_type>::value);
-  BOOST_STATIC_ASSERT(!mpl::is_na<key_from_value_type>::value);
-  BOOST_STATIC_ASSERT(!mpl::is_na<hash_type>::value);
-  BOOST_STATIC_ASSERT(!mpl::is_na<pred_type>::value);
+  BOOST_STATIC_ASSERT(!std::is_void<key_from_value_type>::value);
+  BOOST_STATIC_ASSERT(!std::is_void<hash_type>::value);
+  BOOST_STATIC_ASSERT(!std::is_void<pred_type>::value);
 };
 
 } /* namespace multi_index::detail */

include/boost/multi_index/detail/hash_index_iterator.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2026 Joaquin M Lopez Munoz.
  * 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)
@@ -9,16 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_ITERATOR_HPP
 #define BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_ITERATOR_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/multi_index/detail/raw_ptr.hpp>
 #include <boost/operators.hpp>
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-#include <boost/serialization/nvp.hpp>
-#include <boost/serialization/split_member.hpp>
+#include <boost/core/serialization.hpp>
 #endif
 
 namespace boost{
@@ -30,20 +30,25 @@ namespace detail{
 /* Iterator class for hashed indices.
  */
 
-template<typename Node,typename BucketArray>
+struct hashed_index_global_iterator_tag{};
+struct hashed_index_local_iterator_tag{};
+
+template<
+  typename Node,typename BucketArray,
+  typename IndexCategory,typename IteratorCategory
+>
 class hashed_index_iterator:
   public forward_iterator_helper<
-    hashed_index_iterator<Node,BucketArray>,
+    hashed_index_iterator<Node,BucketArray,IndexCategory,IteratorCategory>,
     typename Node::value_type,
-    std::ptrdiff_t,
+    typename Node::difference_type,
     const typename Node::value_type*,
     const typename Node::value_type&>
 {
 public:
+  /* coverity[uninit_ctor]: suppress warning */
   hashed_index_iterator(){}
-  hashed_index_iterator(Node* node_,BucketArray* buckets_):
-    node(node_),buckets(buckets_)
-  {}
+  hashed_index_iterator(Node* node_):node(node_){}
 
   const typename Node::value_type& operator*()const
   {
@@ -52,7 +57,7 @@ public:
 
   hashed_index_iterator& operator++()
   {
-    Node::increment(node,buckets->begin(),buckets->end());
+    this->increment(IteratorCategory());
     return *this;
   }
 
@@ -61,25 +66,55 @@ public:
    * see explanation in safe_mode_iterator notes in safe_mode.hpp.
    */
   
-  BOOST_SERIALIZATION_SPLIT_MEMBER()
+  template<class Archive>
+  void serialize(Archive& ar,const unsigned int version)
+  {
+    core::split_member(ar,*this,version);
+  }
 
   typedef typename Node::base_type node_base_type;
 
   template<class Archive>
   void save(Archive& ar,const unsigned int)const
   {
-    node_base_type* bnode=node;
-    ar<<serialization::make_nvp("pointer",bnode);
-    ar<<serialization::make_nvp("pointer",buckets);
+    node_base_type* bnode=get_node();
+    ar<<core::make_nvp("pointer",bnode);
   }
 
   template<class Archive>
-  void load(Archive& ar,const unsigned int)
+  void load(Archive& ar,const unsigned int version)
+  {
+    load(ar,version,IteratorCategory());
+  }
+
+  template<class Archive>
+  void load(
+    Archive& ar,const unsigned int version,hashed_index_global_iterator_tag)
   {
     node_base_type* bnode;
-    ar>>serialization::make_nvp("pointer",bnode);
-    node=static_cast<Node*>(bnode);
-    ar>>serialization::make_nvp("pointer",buckets);
+    ar>>core::make_nvp("pointer",bnode);
+    node=typename Node::pointer(static_cast<Node*>(bnode));
+    if(version<1){
+      BucketArray* throw_away; /* consume unused ptr */
+      ar>>core::make_nvp("pointer",throw_away);
+    }
+  }
+
+  template<class Archive>
+  void load(
+    Archive& ar,const unsigned int version,hashed_index_local_iterator_tag)
+  {
+    node_base_type* bnode;
+    ar>>core::make_nvp("pointer",bnode);
+    node=typename Node::pointer(static_cast<Node*>(bnode));
+    if(version<1){
+      BucketArray* buckets;
+      ar>>core::make_nvp("pointer",buckets);
+      if(buckets&&bnode&&node->impl()==buckets->end()->prior()){
+        /* end local_iterators used to point to end node, now they are null */
+        node=typename Node::pointer(0);
+      }
+    }
   }
 #endif
 
@@ -87,17 +122,32 @@ public:
 
   typedef Node node_type;
 
-  Node* get_node()const{return node;}
+  Node* get_node()const{return raw_ptr<Node*>(node);}
 
 private:
-  Node*        node;
-  BucketArray* buckets;
+
+  void increment(hashed_index_global_iterator_tag)
+  {
+    Node::template increment<IndexCategory>(node);
+  }
+
+  void increment(hashed_index_local_iterator_tag)
+  {
+    Node::template increment_local<IndexCategory>(node);
+  }
+
+  typename Node::pointer node;
 };
 
-template<typename Node,typename BucketArray>
+template<
+  typename Node,typename BucketArray,
+  typename IndexCategory,typename IteratorCategory
+>
 bool operator==(
-  const hashed_index_iterator<Node,BucketArray>& x,
-  const hashed_index_iterator<Node,BucketArray>& y)
+  const hashed_index_iterator<
+    Node,BucketArray,IndexCategory,IteratorCategory>& x,
+  const hashed_index_iterator<
+    Node,BucketArray,IndexCategory,IteratorCategory>& y)
 {
   return x.get_node()==y.get_node();
 }
@@ -106,6 +156,27 @@ bool operator==(
 
 } /* namespace multi_index */
 
+#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
+/* class version = 1 : hashed_index_iterator does no longer serialize a bucket
+ * array pointer.
+ */
+
+namespace serialization {
+template<
+  typename Node,typename BucketArray,
+  typename IndexCategory,typename IteratorCategory
+>
+struct version<
+  boost::multi_index::detail::hashed_index_iterator<
+    Node,BucketArray,IndexCategory,IteratorCategory
+  >
+>
+{
+  BOOST_STATIC_CONSTANT(int,value=1);
+};
+} /* namespace serialization */
+#endif
+
 } /* namespace boost */
 
 #endif

include/boost/multi_index/detail/hash_index_node.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2026 Joaquin M Lopez Munoz.
  * 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)
@@ -9,14 +9,14 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_NODE_HPP
 #define BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_NODE_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/allocator_utilities.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
-#include <functional>
+#include <boost/core/allocator_access.hpp>
+#include <boost/multi_index/detail/raw_ptr.hpp>
+#include <utility>
 
 namespace boost{
 
@@ -24,104 +24,711 @@ namespace multi_index{
 
 namespace detail{
 
-/* singly-linked node for use by hashed_index */
+/* Certain C++ requirements on unordered associative containers (see LWG issue
+ * #579) imply a data structure where nodes are linked in a single list, which
+ * in its turn forces implementors to add additional overhed per node to
+ * associate each with its corresponding bucket. Others resort to storing hash
+ * values, we use an alternative structure providing unconditional O(1)
+ * manipulation, even in situations of unfair hash distribution, plus some
+ * lookup speedups. For unique indices we maintain a doubly linked list of
+ * nodes except that if N is the first node of a bucket its associated
+ * bucket node is embedded between N and the preceding node in the following
+ * manner:
+ *
+ *        +---+   +---+       +---+   +---+
+ *     <--+   |<--+   |    <--+   |<--+   |
+ *   ...  | B0|   | B1|  ...  | B1|   | B2|  ...
+ *        |   |-+ |   +-->    |   |-+ |   +-->
+ *        +-+-+ | +---+       +-+-+ | +---+
+ *              |   ^               |   ^
+ *              |   |               |   |
+ *              | +-+               | +-+
+ *              | |                 | |
+ *              v |                 v |  
+ *       --+---+---+---+--   --+---+---+---+--
+ *     ... |   | B1|   |  ...  |   | B2|   | ...
+ *       --+---+---+---+--   --+---+---+---+--
+ *
+ *
+ * The fist and last nodes of buckets can be checked with
+ *
+ *   first node of a bucket: Npn != N
+ *   last node of a bucket:  Nnp != N
+ *
+ * (n and p short for ->next(), ->prior(), bucket nodes have prior pointers
+ * only). Pure insert and erase (without lookup) can be unconditionally done
+ * in O(1).
+ * For non-unique indices we add the following additional complexity: when
+ * there is a group of 3 or more equivalent elements, they are linked as
+ * follows:
+ *
+ *         +-----------------------+
+ *         |                       v
+ *   +---+ | +---+       +---+   +---+
+ *   |   | +-+   |       |   |<--+   |
+ *   | F |   | S |  ...  | P |   | L |
+ *   |   +-->|   |       |   +-+ |   |
+ *   +---+   +---+       +---+ | +---+
+ *     ^                       |
+ *     +-----------------------+
+ * 
+ * F, S, P and L are the first, second, penultimate and last node in the
+ * group, respectively (S and P can coincide if the group has size 3.) This
+ * arrangement is used to skip equivalent elements in O(1) when doing lookup,
+ * while preserving O(1) insert/erase. The following invariants identify
+ * special positions (some of the operations have to be carefully implemented
+ * as Xnn is not valid if Xn points to a bucket):
+ *
+ *   first node of a bucket: Npnp  == N
+ *   last node of a bucket:  Nnpp  == N
+ *   first node of a group:  Nnp != N && Nnppn == N
+ *   second node of a group: Npn != N && Nppnn == N
+ *   n-1 node of a group:    Nnp != N && Nnnpp == N
+ *   last node of a group:   Npn != N && Npnnp == N
+ * 
+ * The memory overhead is one pointer per bucket plus two pointers per node,
+ * probably unbeatable. The resulting structure is bidirectonally traversable,
+ * though currently we are just providing forward iteration.
+ */
 
 template<typename Allocator>
-struct hashed_index_node_impl
+struct hashed_index_node_impl;
+
+/* half-header (only prior() pointer) to use for the bucket array */
+
+template<typename Allocator>
+struct hashed_index_base_node_impl
 {
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,hashed_index_node_impl
-    >::type
-  >::type::pointer                                pointer;
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,hashed_index_node_impl
-    >::type
-  >::type::const_pointer                          const_pointer;
+  typedef allocator_rebind_t<
+    Allocator,hashed_index_base_node_impl
+  >                                                   base_allocator;
+  typedef allocator_rebind_t<
+    Allocator,hashed_index_node_impl<Allocator>
+  >                                                   node_allocator;
+  typedef allocator_pointer_t<base_allocator>         base_pointer;
+  typedef allocator_const_pointer_t<base_allocator>   const_base_pointer;
+  typedef allocator_pointer_t<node_allocator>         pointer;
+  typedef allocator_const_pointer_t<node_allocator>   const_pointer;
+  typedef allocator_difference_type_t<node_allocator> difference_type;
 
-  pointer& next(){return next_;}
-  pointer  next()const{return next_;}
+  pointer& prior(){return prior_;}
+  pointer  prior()const{return prior_;}
 
-  /* algorithmic stuff */
+private:
+  pointer prior_;
+};
 
-  static void increment(pointer& x,pointer bbegin,pointer bend)
+/* full header (prior() and next()) for the nodes */
+
+template<typename Allocator>
+struct hashed_index_node_impl:hashed_index_base_node_impl<Allocator>
+{
+private:
+  typedef hashed_index_base_node_impl<Allocator> super;
+
+public:  
+  typedef typename super::base_pointer           base_pointer;
+  typedef typename super::const_base_pointer     const_base_pointer;
+  typedef typename super::pointer                pointer;
+  typedef typename super::const_pointer          const_pointer;
+
+  base_pointer& next(){return next_;}
+  base_pointer  next()const{return next_;}
+
+  static pointer pointer_from(base_pointer x)
   {
-    std::less_equal<pointer> leq;
-
-    x=x->next();
-    if(leq(bbegin,x)&&leq(x,bend)){ /* bucket node */
-      do{
-        ++x;
-      }while(x->next()==x);
-      x=x->next();
-    }
+    return static_cast<pointer>(
+      static_cast<hashed_index_node_impl*>(
+        raw_ptr<super*>(x)));
   }
 
-  static void link(pointer x,pointer pos)
+  static base_pointer base_pointer_from(pointer x)
   {
-    x->next()=pos->next();
-    pos->next()=x;
-  };
-
-  static void unlink(pointer x)
-  {
-    pointer y=x->next();
-    while(y->next()!=x){y=y->next();}
-    y->next()=x->next();
-  }
-
-  static pointer prev(pointer x)
-  {
-    pointer y=x->next();
-    while(y->next()!=x){y=y->next();}
-    return y;
-  }
-
-  static void unlink_next(pointer x)
-  {
-    x->next()=x->next()->next();
+    return static_cast<base_pointer>(
+      raw_ptr<hashed_index_node_impl*>(x));
   }
 
 private:
-  pointer next_;
+  base_pointer next_;
+};
+
+/* Boost.MultiIndex requires machinery to reverse unlink operations. A simple
+ * way to make a pointer-manipulation function undoable is to templatize
+ * its internal pointer assignments with a functor that, besides doing the
+ * assignment, keeps track of the original pointer values and can later undo
+ * the operations in reverse order.
+ */
+
+struct default_assigner
+{
+  template<typename T> void operator()(T& x,const T& val){x=val;}
+};
+
+template<typename Node>
+struct unlink_undo_assigner
+{
+  typedef typename Node::base_pointer base_pointer;
+  typedef typename Node::pointer      pointer;
+
+  unlink_undo_assigner():pointer_track_count(0),base_pointer_track_count(0){}
+
+  void operator()(pointer& x,pointer val)
+  {
+    pointer_tracks[pointer_track_count].x=&x;
+    pointer_tracks[pointer_track_count++].val=x;
+    x=val;
+  }
+
+  void operator()(base_pointer& x,base_pointer val)
+  {
+    base_pointer_tracks[base_pointer_track_count].x=&x;
+    base_pointer_tracks[base_pointer_track_count++].val=x;
+    x=val;
+  }
+
+  void operator()() /* undo op */
+  {
+    /* in the absence of aliasing, restitution order is immaterial */
+
+    while(pointer_track_count--){
+      *(pointer_tracks[pointer_track_count].x)=
+        pointer_tracks[pointer_track_count].val;
+    }
+    while(base_pointer_track_count--){
+      *(base_pointer_tracks[base_pointer_track_count].x)=
+        base_pointer_tracks[base_pointer_track_count].val;
+    }
+  }
+
+  struct pointer_track     {pointer*      x; pointer      val;};
+  struct base_pointer_track{base_pointer* x; base_pointer val;};
+
+  /* We know the maximum number of pointer and base pointer assignments that
+   * the two unlink versions do, so we can statically reserve the needed
+   * storage.
+   */
+
+  pointer_track      pointer_tracks[3];
+  int                pointer_track_count;
+  base_pointer_track base_pointer_tracks[2];
+  int                base_pointer_track_count;
+};
+
+/* algorithmic stuff for unique and non-unique variants */
+
+struct hashed_unique_tag{};
+struct hashed_non_unique_tag{};
+
+template<typename Node,typename Category>
+struct hashed_index_node_alg;
+
+template<typename Node>
+struct hashed_index_node_alg<Node,hashed_unique_tag>
+{
+  typedef typename Node::base_pointer       base_pointer;
+  typedef typename Node::const_base_pointer const_base_pointer;
+  typedef typename Node::pointer            pointer;
+  typedef typename Node::const_pointer      const_pointer;
+
+  static bool is_first_of_bucket(pointer x)
+  {
+    return x->prior()->next()!=base_pointer_from(x);
+  }
+
+  static pointer after(pointer x)
+  {
+    return is_last_of_bucket(x)?x->next()->prior():pointer_from(x->next());
+  }
+
+  static pointer after_local(pointer x)
+  {
+    return is_last_of_bucket(x)?pointer(0):pointer_from(x->next());
+  }
+
+  static pointer next_to_inspect(pointer x)
+  {
+    return is_last_of_bucket(x)?pointer(0):pointer_from(x->next());
+  }
+
+  static void link(pointer x,base_pointer buc,pointer end)
+  {
+    if(buc->prior()==pointer(0)){ /* empty bucket */
+      x->prior()=end->prior();
+      x->next()=end->prior()->next();
+      x->prior()->next()=buc;
+      buc->prior()=x;
+      end->prior()=x;
+    }
+    else{
+      x->prior()=buc->prior()->prior();
+      x->next()=base_pointer_from(buc->prior());
+      buc->prior()=x;
+      x->next()->prior()=x;
+    }
+  }
+
+  static void unlink(pointer x)
+  {
+    default_assigner assign;
+    unlink(x,assign);
+  }
+
+  typedef unlink_undo_assigner<Node> unlink_undo;
+
+  template<typename Assigner>
+  static void unlink(pointer x,Assigner& assign)
+  {
+    if(is_first_of_bucket(x)){
+      if(is_last_of_bucket(x)){
+        assign(x->prior()->next()->prior(),pointer(0));
+        assign(x->prior()->next(),x->next());
+        assign(x->next()->prior()->prior(),x->prior());
+      }
+      else{
+        assign(x->prior()->next()->prior(),pointer_from(x->next()));
+        assign(x->next()->prior(),x->prior());
+      }
+    }
+    else if(is_last_of_bucket(x)){
+      assign(x->prior()->next(),x->next());
+      assign(x->next()->prior()->prior(),x->prior());
+    }
+    else{
+      assign(x->prior()->next(),x->next());
+      assign(x->next()->prior(),x->prior());
+    }
+  }
+
+  /* used only at rehashing */
+
+  static void append(pointer x,pointer end)
+  {
+    x->prior()=end->prior();
+    x->next()=end->prior()->next();
+    x->prior()->next()=base_pointer_from(x);
+    end->prior()=x;
+  }
+
+  static bool unlink_last(pointer end)
+  {
+    /* returns true iff bucket is emptied */
+
+    pointer x=end->prior();
+    if(x->prior()->next()==base_pointer_from(x)){
+      x->prior()->next()=x->next();
+      end->prior()=x->prior();
+      return false;
+    }
+    else{
+      x->prior()->next()->prior()=pointer(0);
+      x->prior()->next()=x->next();
+      end->prior()=x->prior();
+      return true;
+    }
+  }
+
+private:
+  static pointer pointer_from(base_pointer x)
+  {
+    return Node::pointer_from(x);
+  }
+
+  static base_pointer base_pointer_from(pointer x)
+  {
+    return Node::base_pointer_from(x);
+  }
+
+  static bool is_last_of_bucket(pointer x)
+  {
+    return x->next()->prior()!=x;
+  }
+};
+
+template<typename Node>
+struct hashed_index_node_alg<Node,hashed_non_unique_tag>
+{
+  typedef typename Node::base_pointer       base_pointer;
+  typedef typename Node::const_base_pointer const_base_pointer;
+  typedef typename Node::pointer            pointer;
+  typedef typename Node::const_pointer      const_pointer;
+
+  static bool is_first_of_bucket(pointer x)
+  {
+    return x->prior()->next()->prior()==x;
+  }
+
+  static bool is_first_of_group(pointer x)
+  {
+    return
+      x->next()->prior()!=x&&
+      x->next()->prior()->prior()->next()==base_pointer_from(x);
+  }
+
+  static pointer after(pointer x)
+  {
+    if(x->next()->prior()==x)return pointer_from(x->next());
+    if(x->next()->prior()->prior()==x)return x->next()->prior();
+    if(x->next()->prior()->prior()->next()==base_pointer_from(x))
+      return pointer_from(x->next());
+    return pointer_from(x->next())->next()->prior();
+  }
+
+  static pointer after_local(pointer x)
+  {
+    if(x->next()->prior()==x)return pointer_from(x->next());
+    if(x->next()->prior()->prior()==x)return pointer(0);
+    if(x->next()->prior()->prior()->next()==base_pointer_from(x))
+      return pointer_from(x->next());
+    return pointer_from(x->next())->next()->prior();
+  }
+
+  static pointer next_to_inspect(pointer x)
+  {
+    if(x->next()->prior()==x)return pointer_from(x->next());
+    if(x->next()->prior()->prior()==x)return pointer(0);
+    if(x->next()->prior()->next()->prior()!=x->next()->prior())
+      return pointer(0);
+    return pointer_from(x->next()->prior()->next());
+  }
+
+  static void link(pointer x,base_pointer buc,pointer end)
+  {
+    if(buc->prior()==pointer(0)){ /* empty bucket */
+      x->prior()=end->prior();
+      x->next()=end->prior()->next();
+      x->prior()->next()=buc;
+      buc->prior()=x;
+      end->prior()=x;
+    }
+    else{
+      x->prior()=buc->prior()->prior();
+      x->next()=base_pointer_from(buc->prior());
+      buc->prior()=x;
+      x->next()->prior()=x;
+    }
+  }
+
+  static void link(pointer x,pointer first,pointer last)
+  {
+    x->prior()=first->prior();
+    x->next()=base_pointer_from(first);
+    if(is_first_of_bucket(first)){
+      x->prior()->next()->prior()=x;
+    }
+    else{
+      x->prior()->next()=base_pointer_from(x);
+    }
+
+    if(first==last){
+      last->prior()=x;
+    }
+    else if(first->next()==base_pointer_from(last)){
+      first->prior()=last;
+      first->next()=base_pointer_from(x);
+    }
+    else{
+      pointer second=pointer_from(first->next()),
+              lastbutone=last->prior();
+      second->prior()=first;
+      first->prior()=last;
+      lastbutone->next()=base_pointer_from(x);
+    }
+  }
+
+  static void unlink(pointer x)
+  {
+    default_assigner assign;
+    unlink(x,assign);
+  }
+
+  typedef unlink_undo_assigner<Node> unlink_undo;
+
+  template<typename Assigner>
+  static void unlink(pointer x,Assigner& assign)
+  {
+    if(x->prior()->next()==base_pointer_from(x)){
+      if(x->next()->prior()==x){
+        left_unlink(x,assign);
+        right_unlink(x,assign);
+      }
+      else if(x->next()->prior()->prior()==x){           /* last of bucket */
+        left_unlink(x,assign);
+        right_unlink_last_of_bucket(x,assign);
+      }
+      else if(x->next()->prior()->prior()->next()==
+              base_pointer_from(x)){                /* first of group size */
+        left_unlink(x,assign);
+        right_unlink_first_of_group(x,assign);
+      }
+      else{                                                /* n-1 of group */
+        unlink_last_but_one_of_group(x,assign);
+      }
+    }
+    else if(x->prior()->next()->prior()==x){            /* first of bucket */
+      if(x->next()->prior()==x){
+        left_unlink_first_of_bucket(x,assign);
+        right_unlink(x,assign);
+      }
+      else if(x->next()->prior()->prior()==x){           /* last of bucket */
+        assign(x->prior()->next()->prior(),pointer(0));
+        assign(x->prior()->next(),x->next());
+        assign(x->next()->prior()->prior(),x->prior());
+      }
+      else{                                              /* first of group */
+        left_unlink_first_of_bucket(x,assign);
+        right_unlink_first_of_group(x,assign);
+      }
+    }
+    else if(x->next()->prior()->prior()==x){   /* last of group and bucket */
+      left_unlink_last_of_group(x,assign);
+      right_unlink_last_of_bucket(x,assign);
+    }
+    else if(pointer_from(x->prior()->prior()->next())
+            ->next()==base_pointer_from(x)){            /* second of group */
+      unlink_second_of_group(x,assign);
+    }
+    else{                              /* last of group, ~(last of bucket) */
+      left_unlink_last_of_group(x,assign);
+      right_unlink(x,assign);
+    }
+  }
+
+  /* used only at rehashing */
+
+  static void link_range(
+    pointer first,pointer last,base_pointer buc,pointer cend)
+  {
+    if(buc->prior()==pointer(0)){ /* empty bucket */
+      first->prior()=cend->prior();
+      last->next()=cend->prior()->next();
+      first->prior()->next()=buc;
+      buc->prior()=first;
+      cend->prior()=last;
+    }
+    else{
+      first->prior()=buc->prior()->prior();
+      last->next()=base_pointer_from(buc->prior());
+      buc->prior()=first;
+      last->next()->prior()=last;
+    }
+  }
+
+  static void append_range(pointer first,pointer last,pointer cend)
+  {
+    first->prior()=cend->prior();
+    last->next()=cend->prior()->next();
+    first->prior()->next()=base_pointer_from(first);
+    cend->prior()=last;
+  }
+
+  static std::pair<pointer,bool> unlink_last_group(pointer end)
+  {
+    /* returns first of group true iff bucket is emptied */
+
+    pointer x=end->prior();
+    if(x->prior()->next()==base_pointer_from(x)){
+      x->prior()->next()=x->next();
+      end->prior()=x->prior();
+      return std::make_pair(x,false);
+    }
+    else if(x->prior()->next()->prior()==x){
+      x->prior()->next()->prior()=pointer(0);
+      x->prior()->next()=x->next();
+      end->prior()=x->prior();
+      return std::make_pair(x,true);
+    }
+    else{
+      pointer y=pointer_from(x->prior()->next());
+
+      if(y->prior()->next()==base_pointer_from(y)){
+        y->prior()->next()=x->next();
+        end->prior()=y->prior();
+        return std::make_pair(y,false);
+      }
+      else{
+        y->prior()->next()->prior()=pointer(0);
+        y->prior()->next()=x->next();
+        end->prior()=y->prior();
+        return std::make_pair(y,true);
+      }
+    }
+  }
+
+  static void unlink_range(pointer first,pointer last)
+  {
+    if(is_first_of_bucket(first)){
+      if(is_last_of_bucket(last)){
+        first->prior()->next()->prior()=pointer(0);
+        first->prior()->next()=last->next();
+        last->next()->prior()->prior()=first->prior();
+      }
+      else{
+        first->prior()->next()->prior()=pointer_from(last->next());
+        last->next()->prior()=first->prior();
+      }
+    }
+    else if(is_last_of_bucket(last)){
+      first->prior()->next()=last->next();
+      last->next()->prior()->prior()=first->prior();
+    }
+    else{
+      first->prior()->next()=last->next();
+      last->next()->prior()=first->prior();
+    }
+  }
+
+private:
+  static pointer pointer_from(base_pointer x)
+  {
+    return Node::pointer_from(x);
+  }
+
+  static base_pointer base_pointer_from(pointer x)
+  {
+    return Node::base_pointer_from(x);
+  }
+
+  static bool is_last_of_bucket(pointer x)
+  {
+    return x->next()->prior()->prior()==x;
+  }
+
+  template<typename Assigner>
+  static void left_unlink(pointer x,Assigner& assign)
+  {
+    assign(x->prior()->next(),x->next());
+  }
+  
+  template<typename Assigner>
+  static void right_unlink(pointer x,Assigner& assign)
+  {
+    assign(x->next()->prior(),x->prior());
+  }
+
+  template<typename Assigner>
+  static void left_unlink_first_of_bucket(pointer x,Assigner& assign)
+  {
+    assign(x->prior()->next()->prior(),pointer_from(x->next()));
+  }
+
+  template<typename Assigner>
+  static void right_unlink_last_of_bucket(pointer x,Assigner& assign)
+  {
+    assign(x->next()->prior()->prior(),x->prior());
+  }
+
+  template<typename Assigner>
+  static void right_unlink_first_of_group(pointer x,Assigner& assign)
+  {
+    pointer second=pointer_from(x->next()),
+            last=second->prior(),
+            lastbutone=last->prior();
+    if(second==lastbutone){
+      assign(second->next(),base_pointer_from(last));
+      assign(second->prior(),x->prior());
+    }
+    else{
+      assign(lastbutone->next(),base_pointer_from(second));
+      assign(second->next()->prior(),last);
+      assign(second->prior(),x->prior());
+    }
+  }
+
+  template<typename Assigner>
+  static void left_unlink_last_of_group(pointer x,Assigner& assign)
+  {
+    pointer lastbutone=x->prior(),
+            first=pointer_from(lastbutone->next()),
+            second=pointer_from(first->next());
+    if(lastbutone==second){
+      assign(lastbutone->prior(),first);
+      assign(lastbutone->next(),x->next());
+    }
+    else{
+      assign(second->prior(),lastbutone);
+      assign(lastbutone->prior()->next(),base_pointer_from(first));
+      assign(lastbutone->next(),x->next());
+    }
+  }
+
+  template<typename Assigner>
+  static void unlink_last_but_one_of_group(pointer x,Assigner& assign)
+  {
+    pointer first=pointer_from(x->next()),
+            second=pointer_from(first->next()),
+            last=second->prior();
+    if(second==x){
+      assign(last->prior(),first);
+      assign(first->next(),base_pointer_from(last));
+    }
+    else{
+      assign(last->prior(),x->prior());
+      assign(x->prior()->next(),base_pointer_from(first));
+    }
+  }
+
+  template<typename Assigner>
+  static void unlink_second_of_group(pointer x,Assigner& assign)
+  {
+    pointer last=x->prior(),
+            lastbutone=last->prior(),
+            first=pointer_from(lastbutone->next());
+    if(lastbutone==x){
+      assign(first->next(),base_pointer_from(last));
+      assign(last->prior(),first);
+    }
+    else{
+      assign(first->next(),x->next());
+      assign(x->next()->prior(),last);
+    }
+  }
 };
 
 template<typename Super>
 struct hashed_index_node_trampoline:
-  prevent_eti<
-    Super,
-    hashed_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        typename Super::allocator_type,
-        char
-      >::type
+  hashed_index_node_impl<
+    allocator_rebind_t<
+      typename Super::allocator_type,char
     >
-  >::type
+  >
 {
-  typedef typename prevent_eti<
-    Super,
-    hashed_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        typename Super::allocator_type,
-        char
-      >::type
-    >
-  >::type impl_type;
+  typedef allocator_rebind_t<
+    typename Super::allocator_type,char
+  >                                                   impl_allocator_type;
+  typedef hashed_index_node_impl<impl_allocator_type> impl_type;
 };
 
 template<typename Super>
-struct hashed_index_node:Super,hashed_index_node_trampoline<Super>
+struct hashed_index_node:
+  Super,hashed_index_node_trampoline<Super>
 {
 private:
   typedef hashed_index_node_trampoline<Super> trampoline;
 
 public:
-  typedef typename trampoline::impl_type     impl_type;
-  typedef typename trampoline::pointer       impl_pointer;
-  typedef typename trampoline::const_pointer const_impl_pointer;
+  typedef typename trampoline::impl_type          impl_type;
+  typedef typename trampoline::base_pointer       impl_base_pointer;
+  typedef typename trampoline::const_base_pointer const_impl_base_pointer;
+  typedef typename trampoline::pointer            impl_pointer;
+  typedef typename trampoline::const_pointer      const_impl_pointer;
+  typedef typename trampoline::difference_type    difference_type;
+  typedef allocator_rebind_t<
+    typename trampoline::impl_allocator_type,
+    hashed_index_node>                            final_allocator_type;
+  typedef allocator_pointer_t<
+    final_allocator_type>                         pointer;
+  typedef allocator_const_pointer_t<
+    final_allocator_type>                         const_pointer;
+
+  template<typename Category>
+  struct node_alg{
+    typedef hashed_index_node_alg<impl_type,Category> type;
+  };
+
+  impl_pointer&      prior(){return trampoline::prior();}
+  impl_pointer       prior()const{return trampoline::prior();}
+  impl_base_pointer& next(){return trampoline::next();}
+  impl_base_pointer  next()const{return trampoline::next();}
 
   impl_pointer impl()
   {
@@ -137,22 +744,32 @@ public:
 
   static hashed_index_node* from_impl(impl_pointer x)
   {
-    return static_cast<hashed_index_node*>(
-      static_cast<trampoline*>(&*x));
+    return
+      static_cast<hashed_index_node*>(
+        static_cast<trampoline*>(
+          raw_ptr<impl_type*>(x)));
   }
 
   static const hashed_index_node* from_impl(const_impl_pointer x)
   {
-    return static_cast<const hashed_index_node*>(
-      static_cast<const trampoline*>(&*x));
+    return 
+      static_cast<const hashed_index_node*>(
+        static_cast<const trampoline*>(
+          raw_ptr<const impl_type*>(x)));
   }
 
-  static void increment(
-    hashed_index_node*& x,impl_pointer bbegin,impl_pointer bend)
+  /* interoperability with hashed_index_iterator */
+
+  template<typename Category>
+  static void increment(pointer& x)
   {
-    impl_pointer xi=x->impl();
-    trampoline::increment(xi,bbegin,bend);
-    x=from_impl(xi);
+    x=pointer(from_impl(node_alg<Category>::type::after(x->impl())));
+  }
+
+  template<typename Category>
+  static void increment_local(pointer& x)
+  {
+    x=pointer(from_impl(node_alg<Category>::type::after_local(x->impl())));
   }
 };
 

include/boost/multi_index/detail/header_holder.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2022 Joaquin M Lopez Munoz.
  * 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)
@@ -9,11 +9,11 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_HEADER_HOLDER_HPP
 #define BOOST_MULTI_INDEX_DETAIL_HEADER_HOLDER_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
-#include <boost/noncopyable.hpp>
+#include <boost/core/noncopyable.hpp>
 
 namespace boost{
 

include/boost/multi_index/detail/ignore_wstrict_aliasing.hpp

@@ -0,0 +1,18 @@
+/* Copyright 2003-2016 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#include <boost/config.hpp>
+
+#if defined(BOOST_GCC)&&(BOOST_GCC>=4*10000+6*100)
+#if !defined(BOOST_MULTI_INDEX_DETAIL_RESTORE_WSTRICT_ALIASING)
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wstrict-aliasing"
+#else
+#pragma GCC diagnostic pop
+#endif
+#endif

include/boost/multi_index/detail/index_access_sequence.hpp

@@ -0,0 +1,77 @@
+/* Copyright 2003-2021 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_ACCESS_SEQUENCE_HPP
+#define BOOST_MULTI_INDEX_DETAIL_INDEX_ACCESS_SEQUENCE_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/mp11/list.hpp>
+#include <boost/mp11/utility.hpp>
+#include <boost/multi_index_container_fwd.hpp>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* Successive access to the indices of a multi_index_container. Used as dst in
+ * backbone function extract_(x,dst) to retrieve the destination indices
+ * where iterators referring to x must be transferred to (in merging
+ * operations).
+ */
+
+template<typename MultiIndexContainer,int N=0>
+struct index_access_sequence;
+
+struct index_access_sequence_terminal
+{
+  index_access_sequence_terminal(void*){}
+};
+
+template<typename MultiIndexContainer,int N>
+struct index_access_sequence_normal
+{
+  MultiIndexContainer* p;
+
+  index_access_sequence_normal(MultiIndexContainer* p_):p(p_){}
+
+  typename nth_index<MultiIndexContainer,N>::type&
+  get(){return p->template get<N>();}
+
+  index_access_sequence<MultiIndexContainer,N+1>
+  next(){return index_access_sequence<MultiIndexContainer,N+1>(p);}
+};
+
+template<typename MultiIndexContainer,int N>
+using index_access_sequence_base=mp11::mp_if_c<
+  N<mp11::mp_size<typename MultiIndexContainer::index_type_list>::value,
+  index_access_sequence_normal<MultiIndexContainer,N>,
+  index_access_sequence_terminal
+>;
+
+template<typename MultiIndexContainer,int N>
+struct index_access_sequence:index_access_sequence_base<MultiIndexContainer,N>
+{
+  typedef index_access_sequence_base<
+    MultiIndexContainer,N>                     super;
+ 
+  index_access_sequence(MultiIndexContainer* p):super(p){}
+};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/index_base.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2026 Joaquin M Lopez Munoz.
  * 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)
@@ -9,16 +9,20 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_BASE_HPP
 #define BOOST_MULTI_INDEX_DETAIL_INDEX_BASE_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/call_traits.hpp>
-#include <boost/detail/workaround.hpp>
-#include <boost/mpl/vector.hpp>
+#include <boost/core/addressof.hpp>
+#include <boost/core/allocator_access.hpp>
+#include <boost/core/no_exceptions_support.hpp>
 #include <boost/multi_index/detail/copy_map.hpp>
+#include <boost/multi_index/detail/do_not_copy_elements_tag.hpp>
+#include <boost/multi_index/detail/index_access_sequence.hpp>
+#include <boost/multi_index/detail/node_handle.hpp>
 #include <boost/multi_index/detail/node_type.hpp>
+#include <boost/multi_index/detail/type_list.hpp>
 #include <boost/multi_index_container_fwd.hpp>
 #include <boost/tuple/tuple.hpp>
 #include <utility>
@@ -42,82 +46,152 @@ namespace detail{
  *     cannot be called directly from the index classes.)
  */
 
+struct lvalue_tag{};
+struct rvalue_tag{};
+struct emplaced_tag{};
+
 template<typename Value,typename IndexSpecifierList,typename Allocator>
 class index_base
 {
 protected:
-  typedef index_node_base<Value,Allocator>    node_type;
+  typedef index_node_base<Value,Allocator>    index_node_type;
   typedef typename multi_index_node_type<
     Value,IndexSpecifierList,Allocator>::type final_node_type;
   typedef multi_index_container<
     Value,IndexSpecifierList,Allocator>       final_type;
   typedef tuples::null_type                   ctor_args_list;
-  typedef typename 
-    boost::detail::allocator::rebind_to<
-      Allocator,
-      typename Allocator::value_type>::type   final_allocator_type;
-  typedef mpl::vector0<>                      index_type_list;
-  typedef mpl::vector0<>                      iterator_type_list;
-  typedef mpl::vector0<>                      const_iterator_type_list;
+  typedef Allocator                           final_allocator_type;
+  typedef node_handle<
+    final_node_type,final_allocator_type>     final_node_handle_type;
+  typedef empty_type_list                     index_type_list;
+  typedef empty_type_list                     iterator_type_list;
+  typedef empty_type_list                     const_iterator_type_list;
   typedef copy_map<
     final_node_type,
     final_allocator_type>                     copy_map_type;
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
   typedef index_saver<
-    node_type,
+    index_node_type,
     final_allocator_type>                     index_saver_type;
   typedef index_loader<
-    node_type,
+    index_node_type,
     final_node_type,
     final_allocator_type>                     index_loader_type;
 #endif
 
 private:
-  typedef typename call_traits<Value>::param_type value_param_type;
+  typedef Value                               value_type;
+  typedef allocator_size_type_t<Allocator>    size_type;
 
 protected:
-  explicit index_base(const ctor_args_list&,const Allocator&){}
+  explicit index_base(
+    const ctor_args_list&,const Allocator&,index_node_type*){}
+
+  index_base(
+    const index_base<Value,IndexSpecifierList,Allocator>&,
+    const Allocator&,index_node_type*){}
+
+  index_base(
+    const index_base<Value,IndexSpecifierList,Allocator>&,
+    const Allocator&,index_node_type*,
+    do_not_copy_elements_tag)
+  {}
 
   void copy_(
     const index_base<Value,IndexSpecifierList,Allocator>&,const copy_map_type&)
   {}
 
-  node_type* insert_(value_param_type v,node_type* x)
+  final_node_type* insert_(const value_type& v,final_node_type*& x,lvalue_tag)
   {
-    boost::detail::allocator::construct(&x->value(),v);
+    x=final().allocate_node();
+    BOOST_TRY{
+      final().construct_value(x,v);
+    }
+    BOOST_CATCH(...){
+      final().deallocate_node(x);
+      BOOST_RETHROW;
+    }
+    BOOST_CATCH_END
     return x;
   }
 
-  node_type* insert_(value_param_type v,node_type*,node_type* x)
+  final_node_type* insert_(const value_type& v,final_node_type*& x,rvalue_tag)
   {
-    boost::detail::allocator::construct(&x->value(),v);
+    x=final().allocate_node();
+    BOOST_TRY{
+      final().construct_value(x,std::move(const_cast<value_type&>(v)));
+    }
+    BOOST_CATCH(...){
+      final().deallocate_node(x);
+      BOOST_RETHROW;
+    }
+    BOOST_CATCH_END
     return x;
   }
 
-  void erase_(node_type* x)
+  final_node_type* insert_(const value_type&,final_node_type*& x,emplaced_tag)
   {
-    boost::detail::allocator::destroy(&x->value());
+    return x;
   }
 
-  void delete_node_(node_type* x)
+  template<typename MultiIndexContainer>
+  final_node_type* insert_(
+    const value_type&,final_node_type*& x,MultiIndexContainer* p)
   {
-    boost::detail::allocator::destroy(&x->value());
+    p->final_extract_for_transfer_(
+      x,index_access_sequence<final_type>(&final()));
+    return x;
   }
 
+  final_node_type* insert_(
+    const value_type& v,index_node_type*,final_node_type*& x,lvalue_tag)
+  {
+    return insert_(v,x,lvalue_tag());
+  }
+
+  final_node_type* insert_(
+    const value_type& v,index_node_type*,final_node_type*& x,rvalue_tag)
+  {
+    return insert_(v,x,rvalue_tag());
+  }
+
+  final_node_type* insert_(
+    const value_type&,index_node_type*,final_node_type*& x,emplaced_tag)
+  {
+    return x;
+  }
+
+  template<typename Dst>
+  void extract_(index_node_type*,Dst){}
+
   void clear_(){}
 
-  void swap_(index_base<Value,IndexSpecifierList,Allocator>&){}
+  template<typename BoolConstant>
+  void swap_(
+    index_base<Value,IndexSpecifierList,Allocator>&,
+    BoolConstant /* swap_allocators */)
+  {}
 
-  bool replace_(value_param_type v,node_type* x)
+  void swap_elements_(index_base<Value,IndexSpecifierList,Allocator>&){}
+
+  bool replace_(const value_type& v,index_node_type* x,lvalue_tag)
   {
     x->value()=v;
     return true;
   }
 
-  bool modify_(node_type*){return true;}
+  bool replace_(const value_type& v,index_node_type* x,rvalue_tag)
+  {
+    x->value()=std::move(const_cast<value_type&>(v));
+    return true;
+  }
 
-  bool modify_rollback_(node_type*){return true;}
+  bool modify_(index_node_type*){return true;}
+
+  bool modify_rollback_(index_node_type*){return true;}
+
+  bool check_rollback_(index_node_type*)const{return true;}
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
   /* serialization */
@@ -140,17 +214,74 @@ protected:
   final_type&       final(){return *static_cast<final_type*>(this);}
   const final_type& final()const{return *static_cast<const final_type*>(this);}
 
+  template<typename Index>
+  static typename Index::final_type& final(Index& x) /* cross-index access */
+    {return static_cast<typename Index::final_type&>(x);}
+
   final_node_type* final_header()const{return final().header();}
 
-  bool        final_empty_()const{return final().empty_();}
-  std::size_t final_size_()const{return final().size_();}
-  std::size_t final_max_size_()const{return final().max_size_();}
+  bool      final_empty_()const{return final().empty_();}
+  size_type final_size_()const{return final().size_();}
+  size_type final_max_size_()const{return final().max_size_();}
 
-  std::pair<final_node_type*,bool> final_insert_(value_param_type x)
+  std::pair<final_node_type*,bool> final_insert_(const value_type& x)
     {return final().insert_(x);}
+  std::pair<final_node_type*,bool> final_insert_rv_(const value_type& x)
+    {return final().insert_rv_(x);}
+  template<typename T>
+  std::pair<final_node_type*,bool> final_insert_ref_(const T& t)
+    {return final().insert_ref_(t);}
+  template<typename T>
+  std::pair<final_node_type*,bool> final_insert_ref_(T& t)
+    {return final().insert_ref_(t);}
+  std::pair<final_node_type*,bool> final_insert_nh_(final_node_handle_type& nh)
+    {return final().insert_nh_(nh);}
+
+  template<typename Index>
+  std::pair<final_node_type*,bool> final_transfer_(Index& x,final_node_type* n)
+    {return final().transfer_(x,n);}
+
+  template<typename... Args>
+  std::pair<final_node_type*,bool> final_emplace_(Args&&... args)
+  {
+    return final().emplace_(std::forward<Args>(args)...);
+  }
+
   std::pair<final_node_type*,bool> final_insert_(
-    value_param_type x,final_node_type* position)
+    const value_type& x,final_node_type* position)
     {return final().insert_(x,position);}
+  std::pair<final_node_type*,bool> final_insert_rv_(
+    const value_type& x,final_node_type* position)
+    {return final().insert_rv_(x,position);}
+  template<typename T>
+  std::pair<final_node_type*,bool> final_insert_ref_(
+    const T& t,final_node_type* position)
+    {return final().insert_ref_(t,position);}
+  template<typename T>
+  std::pair<final_node_type*,bool> final_insert_ref_(
+    T& t,final_node_type* position)
+    {return final().insert_ref_(t,position);}
+  std::pair<final_node_type*,bool> final_insert_nh_(
+    final_node_handle_type& nh,final_node_type* position)
+    {return final().insert_nh_(nh,position);}
+
+  template<typename... Args>
+  std::pair<final_node_type*,bool> final_emplace_hint_(
+    final_node_type* position,Args&&... args)
+  {
+    return final().emplace_hint_(position,std::forward<Args>(args)...);
+  }
+
+  final_node_handle_type final_extract_(final_node_type* x)
+  {
+    return final().extract_(x);
+  } 
+
+  template<typename Dst>
+  void final_extract_for_transfer_(final_node_type* x,Dst dst)
+  {
+    final().extract_for_transfer_(x,dst);
+  } 
 
   void final_erase_(final_node_type* x){final().erase_(x);}
 
@@ -158,10 +289,21 @@ protected:
   void final_delete_all_nodes_(){final().delete_all_nodes_();}
   void final_clear_(){final().clear_();}
 
+  template<typename Index>
+  void final_transfer_range_(
+    Index& x,
+    typename Index::iterator first,
+    typename Index::iterator last)
+    {final().transfer_range_(x,first,last);}
+
   void final_swap_(final_type& x){final().swap_(x);}
+
   bool final_replace_(
-    value_param_type k,final_node_type* x)
+    const value_type& k,final_node_type* x)
     {return final().replace_(k,x);}
+  bool final_replace_rv_(
+    const value_type& k,final_node_type* x)
+    {return final().replace_rv_(k,x);}
 
   template<typename Modifier>
   bool final_modify_(Modifier& mod,final_node_type* x)

include/boost/multi_index/detail/index_loader.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2023 Joaquin M Lopez Munoz.
  * 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)
@@ -9,16 +9,17 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_LOADER_HPP
 #define BOOST_MULTI_INDEX_DETAIL_INDEX_LOADER_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
 #include <algorithm>
-#include <boost/archive/archive_exception.hpp>
-#include <boost/noncopyable.hpp>
+#include <boost/core/noncopyable.hpp>
+#include <boost/core/serialization.hpp>
 #include <boost/multi_index/detail/auto_space.hpp>
-#include <boost/serialization/nvp.hpp>
+#include <boost/multi_index/detail/bad_archive_exception.hpp>
+#include <boost/multi_index/detail/raw_ptr.hpp>
 #include <boost/throw_exception.hpp> 
 #include <cstddef>
 
@@ -29,7 +30,8 @@ namespace multi_index{
 namespace detail{
 
 /* Counterpart of index_saver (check index_saver.hpp for serialization
- * details.)* multi_index_container is in charge of supplying the info about
+ * details.)
+ * multi_index_container is in charge of supplying the info about
  * the base sequence, and each index can subsequently load itself using the
  * const interface of index_loader.
  */
@@ -46,14 +48,14 @@ public:
   template<class Archive>
   void add(Node* node,Archive& ar,const unsigned int)
   {
-    ar>>serialization::make_nvp("position",*node);
+    ar>>core::make_nvp("position",*node);
     entries()[n++]=node;
   }
 
   template<class Archive>
   void add_track(Node* node,Archive& ar,const unsigned int)
   {
-    ar>>serialization::make_nvp("position",*node);
+    ar>>core::make_nvp("position",*node);
   }
 
   /* A rearranger is passed two nodes, and is expected to
@@ -91,7 +93,7 @@ public:
   }
 
 private:
-  Node** entries()const{return &*spc.data();}
+  Node** entries()const{return raw_ptr<Node**>(spc.data());}
 
   /* We try to delay sorting as much as possible just in case it
    * is not necessary, hence this version of load_node.
@@ -101,7 +103,7 @@ private:
   FinalNode* unchecked_load_node(Archive& ar)const
   {
     Node* node=0;
-    ar>>serialization::make_nvp("pointer",node);
+    ar>>core::make_nvp("pointer",node);
     return static_cast<FinalNode*>(node);
   }
 
@@ -109,7 +111,7 @@ private:
   FinalNode* load_node(Archive& ar)const
   {
     Node* node=0;
-    ar>>serialization::make_nvp("pointer",node);
+    ar>>core::make_nvp("pointer",node);
     check_node(node);
     return static_cast<FinalNode*>(node);
   }
@@ -117,9 +119,7 @@ private:
   void check_node(Node* node)const
   {
     if(node!=0&&!std::binary_search(entries(),entries()+size_,node)){
-      throw_exception(
-        archive::archive_exception(
-          archive::archive_exception::other_exception));
+      throw_exception(bad_archive_exception());
     }
   }
 

include/boost/multi_index/detail/index_matcher.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2022 Joaquin M Lopez Munoz.
  * 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)
@@ -9,14 +9,15 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_MATCHER_HPP
 #define BOOST_MULTI_INDEX_DETAIL_INDEX_MATCHER_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
 #include <algorithm>
-#include <boost/noncopyable.hpp>
+#include <boost/core/noncopyable.hpp>
 #include <boost/multi_index/detail/auto_space.hpp>
+#include <boost/multi_index/detail/raw_ptr.hpp>
 #include <cstddef>
 #include <functional>
 
@@ -106,14 +107,14 @@ class algorithm_base:private noncopyable
 {
 protected:
   algorithm_base(const Allocator& al,std::size_t size):
-    spc(al,size),size_(size),n(0),sorted(false)
+    spc(al,size),size_(size),n_(0),sorted(false)
   {
   }
 
   void add(void* node)
   {
-    entries()[n]=entry(node,n);
-    ++n;
+    entries()[n_]=entry(node,n_);
+    ++n_;
   }
 
   void begin_algorithm()const
@@ -179,11 +180,11 @@ protected:
   }
 
 private:
-  entry* entries()const{return &*spc.data();}
+  entry* entries()const{return raw_ptr<entry*>(spc.data());}
 
   auto_space<entry,Allocator> spc;
   std::size_t                 size_;
-  std::size_t                 n;
+  std::size_t                 n_;
   mutable bool                sorted;
   mutable std::size_t         num_piles;
 };

include/boost/multi_index/detail/index_node_base.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,7 +9,7 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_NODE_BASE_HPP
 #define BOOST_MULTI_INDEX_DETAIL_INDEX_NODE_BASE_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
@@ -18,8 +18,8 @@
 #include <boost/type_traits/alignment_of.hpp> 
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-#include <boost/archive/archive_exception.hpp>
-#include <boost/serialization/access.hpp>
+#include <boost/core/serialization.hpp>
+#include <boost/multi_index/detail/bad_archive_exception.hpp>
 #include <boost/throw_exception.hpp> 
 #endif
 
@@ -49,18 +49,20 @@ struct index_node_base:private pod_value_holder<Value>
   typedef Value           value_type;
   typedef Allocator       allocator_type;
 
+#include <boost/multi_index/detail/ignore_wstrict_aliasing.hpp>
+
   value_type& value()
   {
-    return *static_cast<value_type*>(
-      static_cast<void*>(&this->space));
+    return *reinterpret_cast<value_type*>(&this->space);
   }
 
   const value_type& value()const
   {
-    return *static_cast<const value_type*>(
-      static_cast<const void*>(&this->space));
+    return *reinterpret_cast<const value_type*>(&this->space);
   }
 
+#include <boost/multi_index/detail/restore_wstrict_aliasing.hpp>
+
   static index_node_base* from_value(const value_type* p)
   {
     return static_cast<index_node_base *>(
@@ -85,9 +87,7 @@ private:
 };
 
 template<typename Node,typename Value>
-Node* node_from_value(
-  const Value* p
-  BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node))
+Node* node_from_value(const Value* p)
 {
   typedef typename Node::allocator_type allocator_type;
   return static_cast<Node*>(
@@ -105,28 +105,19 @@ Node* node_from_value(
  * somehow invalid archive.
  */
 
-#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
-namespace serialization{
-#else
 namespace multi_index{
 namespace detail{
-#endif
 
 template<class Archive,typename Value,typename Allocator>
 inline void load_construct_data(
   Archive&,boost::multi_index::detail::index_node_base<Value,Allocator>*,
   const unsigned int)
 {
-  throw_exception(
-    archive::archive_exception(archive::archive_exception::other_exception));
+  throw_exception(boost::multi_index::detail::bad_archive_exception());
 }
 
-#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
-} /* namespace serialization */
-#else
 } /* namespace multi_index::detail */
 } /* namespace multi_index */
-#endif
 
 #endif
 

include/boost/multi_index/detail/index_saver.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2023 Joaquin M Lopez Munoz.
  * 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)
@@ -9,14 +9,14 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_SAVER_HPP
 #define BOOST_MULTI_INDEX_DETAIL_INDEX_SAVER_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
 #include <boost/multi_index/detail/index_matcher.hpp>
-#include <boost/noncopyable.hpp>
-#include <boost/serialization/nvp.hpp>
+#include <boost/core/noncopyable.hpp>
+#include <boost/core/serialization.hpp>
 #include <cstddef>
 
 namespace boost{
@@ -43,14 +43,14 @@ public:
   template<class Archive>
   void add(Node* node,Archive& ar,const unsigned int)
   {
-    ar<<serialization::make_nvp("position",*node);
+    ar<<core::make_nvp("position",*node);
     alg.add(node);
   }
 
   template<class Archive>
   void add_track(Node* node,Archive& ar,const unsigned int)
   {
-    ar<<serialization::make_nvp("position",*node);
+    ar<<core::make_nvp("position",*node);
   }
 
   template<typename IndexIterator,class Archive>
@@ -120,7 +120,7 @@ private:
   template<typename Archive>
   static void save_node(Node* node,Archive& ar)
   {
-    ar<<serialization::make_nvp("pointer",node);
+    ar<<core::make_nvp("pointer",node);
   }
 
   index_matcher::algorithm<Node,Allocator> alg;

include/boost/multi_index/detail/invalidate_iterators.hpp

@@ -0,0 +1,44 @@
+/* Copyright 2003-2021 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_INVALIDATE_ITERATORS_HPP
+#define BOOST_MULTI_INDEX_DETAIL_INVALIDATE_ITERATORS_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* invalidate_iterators mimics the interface of index_access_sequence (see
+ * index_access_sequence.hpp) but returns dummy indices whose iterator type
+ * won't ever match those of the source: the net effect is that safe iterator
+ * transfer resolves to iterator invalidation, so backbone function invocation
+ * extract_(x,invalidate_iterators()) is used in extraction scenarios other
+ * than merging.
+ */
+
+struct invalidate_iterators
+{
+  typedef void iterator;
+
+  invalidate_iterators& get(){return *this;}
+  invalidate_iterators& next(){return *this;}
+};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/invariant_assert.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2013 Joaquin M Lopez Munoz.
  * 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)
@@ -9,7 +9,7 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_INVARIANT_ASSERT_HPP
 #define BOOST_MULTI_INDEX_DETAIL_INVARIANT_ASSERT_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 

include/boost/multi_index/detail/is_function.hpp

@@ -0,0 +1,51 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_IS_FUNCTION_HPP
+#define BOOST_MULTI_INDEX_DETAIL_IS_FUNCTION_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/detail/workaround.hpp>
+
+#if BOOST_WORKAROUND(_LIBCPP_VERSION,<30700)||\
+    BOOST_WORKAROUND(BOOST_LIBSTDCXX_VERSION,<40802)
+/* libc++: std::is_function<void() const> fails,
+ * https://bugs.llvm.org/show_bug.cgi?id=20084
+ *
+ * libstdc++-v3: std::is_function does not support ref-qualified function types,
+ * https://github.com/gcc-mirror/gcc/commit/
+ *   2fa630fb50ba29d8e891c52a75aaec261b07874e#
+ *   diff-6547f965a8d66bf35a6388fcf404aaa3
+ */
+
+#include <boost/type_traits/is_function.hpp>
+
+namespace boost{namespace multi_index{namespace detail{
+
+template<typename T>
+struct is_function:boost::is_function<T>{};
+
+}}} /* namespace boost::multi_index::detail */
+
+#else
+
+#include <type_traits>
+
+namespace boost{namespace multi_index{namespace detail{
+
+template<typename T>
+struct is_function:std::is_function<T>{};
+
+}}} /* namespace boost::multi_index::detail */
+
+#endif
+#endif

include/boost/multi_index/detail/is_index_list.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,13 +9,51 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_IS_INDEX_LIST_HPP
 #define BOOST_MULTI_INDEX_DETAIL_IS_INDEX_LIST_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/mpl/empty.hpp>
-#include <boost/mpl/is_sequence.hpp>
+
+#if defined(BOOST_MULTI_INDEX_ENABLE_MPL_SUPPORT)
+#include <boost/multi_index/detail/mpl_to_mp11_list.hpp>
+#define BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER \
+  <boost/mpl/empty.hpp>
+#include BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#undef BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#define BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER \
+  <boost/mpl/is_sequence.hpp>
+#include BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#undef BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#include <type_traits>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* an index list is a non-empty MPL sequence */
+
+template<typename T>
+struct is_index_list
+{
+  BOOST_STATIC_CONSTANT(bool,mpl_sequence=mpl::is_sequence<T>::value);
+  BOOST_STATIC_CONSTANT(bool,non_empty=!(std::conditional<
+    mpl_sequence,mpl::empty<T>,std::false_type>::type::value));
+  BOOST_STATIC_CONSTANT(bool,value=mpl_sequence&&non_empty);
+};
+
+template<typename IndexList>
+using mp11_index_list=mpl_to_mp11_list<IndexList>;
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+#else
+#include <type_traits>
 
 namespace boost{
 
@@ -24,17 +62,19 @@ namespace multi_index{
 namespace detail{
 
 template<typename T>
-struct is_index_list
-{
-  BOOST_STATIC_CONSTANT(bool,mpl_sequence=mpl::is_sequence<T>::value);
-  BOOST_STATIC_CONSTANT(bool,non_empty=!mpl::empty<T>::value);
-  BOOST_STATIC_CONSTANT(bool,value=mpl_sequence&&non_empty);
-};
+struct is_index_list:std::false_type{};
+
+/* an index list is a non-empty Mp11 list */
+template<template<typename...> class L,typename T,typename... Ts>
+struct is_index_list<L<T,Ts...>>:std::true_type{};
+
+template<typename IndexList>
+using mp11_index_list=IndexList;
 
 } /* namespace multi_index::detail */
 
 } /* namespace multi_index */
 
 } /* namespace boost */
-
+#endif
 #endif

include/boost/multi_index/detail/is_transparent.hpp

@@ -0,0 +1,124 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_IS_TRANSPARENT_HPP
+#define BOOST_MULTI_INDEX_DETAIL_IS_TRANSPARENT_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/type_traits/intrinsics.hpp>
+#include <type_traits>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* Metafunction that checks if f(arg,arg2) executes without argument type
+ * conversion. By default (i.e. when it cannot be determined) it evaluates to
+ * true.
+ */
+
+template<typename F,typename Arg1,typename Arg2,typename=void>
+struct is_transparent:std::true_type{};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#if !defined(BOOST_NO_SFINAE_EXPR)&& \
+    (defined(BOOST_NO_CXX11_FINAL)||defined(BOOST_IS_FINAL))
+
+#include <boost/core/enable_if.hpp>
+#include <boost/type_traits/declval.hpp>
+#include <boost/type_traits/function_traits.hpp>
+#include <boost/type_traits/is_class.hpp>
+#include <boost/type_traits/is_final.hpp>
+#include <boost/type_traits/is_function.hpp>
+#include <boost/type_traits/is_same.hpp>
+#include <boost/type_traits/remove_pointer.hpp>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+struct not_is_transparent_result_type{};
+
+template<typename F,typename Arg1,typename Arg2>
+struct is_transparent_class_helper:F
+{
+  using F::operator();
+  template<typename T,typename Q>
+  not_is_transparent_result_type operator()(const T&,const Q&)const;
+};
+
+template<typename F,typename Arg1,typename Arg2,typename=void>
+struct is_transparent_class:std::true_type{};
+
+template<typename F,typename Arg1,typename Arg2>
+struct is_transparent_class<
+  F,Arg1,Arg2,
+  typename enable_if<
+    is_same<
+      decltype(
+        declval<const is_transparent_class_helper<F,Arg1,Arg2> >()(
+          declval<const Arg1&>(),declval<const Arg2&>())
+      ),
+      not_is_transparent_result_type
+    >
+  >::type
+>:std::false_type{};
+
+template<typename F,typename Arg1,typename Arg2>
+struct is_transparent<
+  F,Arg1,Arg2,
+  typename enable_if_c<
+    is_class<F>::value&&
+    !is_final<F>::value /* is_transparent_class_helper derives from F */
+  >::type
+>:is_transparent_class<F,Arg1,Arg2>{};
+
+template<typename F,typename Arg1,typename Arg2,typename=void>
+struct is_transparent_function:std::true_type{};
+
+template<typename F,typename Arg1,typename Arg2>
+struct is_transparent_function<
+  F,Arg1,Arg2,
+  typename enable_if_c<
+    !(is_same<typename function_traits<F>::arg1_type,const Arg1&>::value||
+      is_same<typename function_traits<F>::arg1_type,Arg1>::value)
+    ||
+    !(is_same<typename function_traits<F>::arg2_type,const Arg2&>::value||
+      is_same<typename function_traits<F>::arg2_type,Arg2>::value)
+  >::type
+>:std::false_type{};
+
+template<typename F,typename Arg1,typename Arg2>
+struct is_transparent<
+  F,Arg1,Arg2,
+  typename enable_if<
+    is_function<typename remove_pointer<F>::type>
+  >::type
+>:is_transparent_function<typename remove_pointer<F>::type,Arg1,Arg2>{};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif
+#endif

include/boost/multi_index/detail/iter_adaptor.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,13 +9,12 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_ITER_ADAPTOR_HPP
 #define BOOST_MULTI_INDEX_DETAIL_ITER_ADAPTOR_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/mpl/apply.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
+#include <boost/mp11/utility.hpp>
 #include <boost/operators.hpp>
 
 namespace boost{
@@ -126,10 +125,7 @@ template<>
 struct iter_adaptor_selector<std::forward_iterator_tag>
 {
   template<class Derived,class Base>
-  struct apply
-  {
-    typedef forward_iter_adaptor_base<Derived,Base> type;
-  };
+  using fn=forward_iter_adaptor_base<Derived,Base>;
 };
 
 template<class Derived,class Base>
@@ -184,10 +180,7 @@ template<>
 struct iter_adaptor_selector<std::bidirectional_iterator_tag>
 {
   template<class Derived,class Base>
-  struct apply
-  {
-    typedef bidirectional_iter_adaptor_base<Derived,Base> type;
-  };
+  using fn=bidirectional_iter_adaptor_base<Derived,Base>;
 };
 
 template<class Derived,class Base>
@@ -284,26 +277,17 @@ template<>
 struct iter_adaptor_selector<std::random_access_iterator_tag>
 {
   template<class Derived,class Base>
-  struct apply
-  {
-    typedef random_access_iter_adaptor_base<Derived,Base> type;
-  };
+  using fn=random_access_iter_adaptor_base<Derived,Base>;
 };
 
 template<class Derived,class Base>
-struct iter_adaptor_base
-{
-  typedef iter_adaptor_selector<
-    typename Base::iterator_category>        selector;
-  typedef typename prevent_eti<
-    selector,
-    typename mpl::apply2<
-      selector,Derived,Base>::type
-  >::type                                    type;
-};
+using iter_adaptor_base=mp11::mp_invoke_q<
+  iter_adaptor_selector<typename Base::iterator_category>,
+  Derived,Base
+>;
 
 template<class Derived,class Base>
-class iter_adaptor:public iter_adaptor_base<Derived,Base>::type
+class iter_adaptor:public iter_adaptor_base<Derived,Base>
 {
 protected:
   iter_adaptor(){}

include/boost/multi_index/detail/modify_key_adaptor.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2013 Joaquin M Lopez Munoz.
  * 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)
@@ -9,7 +9,7 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_MODIFY_KEY_ADAPTOR_HPP
 #define BOOST_MULTI_INDEX_DETAIL_MODIFY_KEY_ADAPTOR_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 

include/boost/multi_index/detail/mpl_to_mp11_list.hpp

@@ -0,0 +1,62 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_MPL_TO_MP11_LIST_HPP
+#define BOOST_MULTI_INDEX_DETAIL_MPL_TO_MP11_LIST_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#if defined(BOOST_MULTI_INDEX_ENABLE_MPL_SUPPORT)
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/mp11/list.hpp>
+#define BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER \
+  <boost/mpl/begin_end.hpp>
+#include BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#undef BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#define BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER \
+  <boost/mpl/deref.hpp>
+#include BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#undef BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#define BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER \
+  <boost/mpl/next.hpp>
+#include BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+#undef BOOST_MULTI_INDEX_BLOCK_BOOSTDEP_HEADER
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+template<typename First,typename Last,typename... Ts>
+struct mpl_to_mp11_list_impl:mpl_to_mp11_list_impl<
+  typename mpl::next<First>::type,Last,
+  Ts...,typename mpl::deref<First>::type
+>{};
+
+template<typename Last,typename... Ts>
+struct mpl_to_mp11_list_impl<Last,Last,Ts...>
+{
+  using type=mp11::mp_list<Ts...>;
+};
+
+template<typename TypeList>
+using mpl_to_mp11_list=typename mpl_to_mp11_list_impl<
+  typename mpl::begin<TypeList>::type,
+  typename boost::mpl::end<TypeList>::type
+>::type;
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+#endif
+#endif

include/boost/multi_index/detail/msvc_index_specifier.hpp

@@ -1,69 +0,0 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
- * 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)
- *
- * See http://www.boost.org/libs/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_DETAIL_MSVC_INDEX_SPECIFIER_HPP
-#define BOOST_MULTI_INDEX_DETAIL_MSVC_INDEX_SPECIFIER_HPP
-
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/workaround.hpp>
-
-#if BOOST_WORKAROUND(BOOST_MSVC,<1310)
-/* Workaround for a problem in MSVC with dependent template typedefs
- * when accesing index specifiers.
- * Modeled after <boost/mpl/aux_/msvc_dtw.hpp> (thanks, Aleksey!)
- */
-
-#include <boost/mpl/aux_/msvc_never_true.hpp>
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-template<typename IndexSpecifier>
-struct msvc_index_specifier
-{
-  template<bool> struct fake_index_type:IndexSpecifier{};
-  template<> struct fake_index_type<true>
-  {
-    template<typename Super>
-    struct node_class{};
-
-    template<typename Super>
-    struct index_class{};
-  };
-
-  template<typename Super>
-  struct result_node_class:
-    fake_index_type<mpl::aux::msvc_never_true<IndexSpecifier>::value>::
-      template node_class<Super>
-  {
-  };
-
-  template<typename Super>
-  struct result_index_class:
-    fake_index_type<mpl::aux::msvc_never_true<IndexSpecifier>::value>::
-      template index_class<Super>
-  {
-  };
-};
-
-} /* namespace multi_index::detail */
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-#endif /* workaround */
-
-#endif

include/boost/multi_index/detail/no_duplicate_tags.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,13 +9,13 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_NO_DUPLICATE_TAGS_HPP
 #define BOOST_MULTI_INDEX_DETAIL_NO_DUPLICATE_TAGS_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/mpl/fold.hpp>
-#include <boost/mpl/set/set0.hpp>
+#include <boost/mp11/algorithm.hpp>
+#include <type_traits>
 
 namespace boost{
 
@@ -25,68 +25,11 @@ namespace detail{
 
 /* no_duplicate_tags check at compile-time that a tag list
  * has no duplicate tags.
- * The algorithm deserves some explanation: tags
- * are sequentially inserted into a mpl::set if they were
- * not already present. Due to the magic of mpl::set
- * (mpl::has_key is contant time), this operation takes linear
- * time, and even MSVC++ 6.5 handles it gracefully (other obvious
- * solutions are quadratic.)
  */
 
-struct duplicate_tag_mark{};
-
-struct duplicate_tag_marker
-{
-  template <typename MplSet,typename Tag>
-  struct apply
-  {
-    typedef mpl::s_item<
-      typename mpl::if_<mpl::has_key<MplSet,Tag>,duplicate_tag_mark,Tag>::type,
-      MplSet
-    > type;
-  };
-};
-
 template<typename TagList>
-struct no_duplicate_tags
-{
-  typedef typename mpl::fold<
-    TagList,
-    mpl::set0<>,
-    duplicate_tag_marker
-  >::type aux;
- 
-  BOOST_STATIC_CONSTANT(
-    bool,value=!(mpl::has_key<aux,duplicate_tag_mark>::value));
-};
-
-/* Variant for an index list: duplication is checked
- * across all the indices.
- */
-
-struct duplicate_tag_list_marker
-{
-  template <typename MplSet,typename Index>
-  struct apply:mpl::fold<
-    BOOST_DEDUCED_TYPENAME Index::tag_list,
-    MplSet,
-    duplicate_tag_marker>
-  {
-  };
-};
-
-template<typename IndexList>
-struct no_duplicate_tags_in_index_list
-{
-  typedef typename mpl::fold<
-    IndexList,
-    mpl::set0<>,
-    duplicate_tag_list_marker
-  >::type aux;
- 
-  BOOST_STATIC_CONSTANT(
-    bool,value=!(mpl::has_key<aux,duplicate_tag_mark>::value));
-};
+using no_duplicate_tags=
+  std::is_same<TagList,mp11::mp_unique<TagList>>;
 
 } /* namespace multi_index::detail */
 

include/boost/multi_index/detail/no_duplicate_tags_in_index_list.hpp

@@ -0,0 +1,44 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_NO_DUPLICATE_TAGS_IN_INDEX_LIST_HPP
+#define BOOST_MULTI_INDEX_DETAIL_NO_DUPLICATE_TAGS_IN_INDEX_LIST_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/multi_index/tag.hpp>
+#include <boost/mp11/algorithm.hpp>
+#include <boost/mp11/list.hpp>
+#include <type_traits>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* checks duplication of tags across all indices of a container */
+
+template<typename Index>
+using index_tag_list=mp11::mp_rename<
+  mp11_tag_list<typename Index::tag_list>,mp11::mp_list>;
+
+template<typename IndexList>
+using no_duplicate_tags_in_index_list=no_duplicate_tags<
+  mp11::mp_flatten<mp11::mp_transform<index_tag_list,IndexList>>>;
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/node_handle.hpp

@@ -0,0 +1,244 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_NODE_HANDLE_HPP
+#define BOOST_MULTI_INDEX_DETAIL_NODE_HANDLE_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <algorithm>
+#include <boost/core/addressof.hpp>
+#include <boost/core/allocator_access.hpp>
+#include <boost/core/enable_if.hpp>
+#include <boost/detail/workaround.hpp>
+#include <boost/multi_index_container_fwd.hpp>
+#include <boost/type_traits/aligned_storage.hpp>
+#include <boost/type_traits/alignment_of.hpp> 
+#include <boost/type_traits/is_const.hpp>
+#include <boost/type_traits/is_same.hpp>
+#include <new>
+#include <utility>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* Node handle template class following [container.node] specs.
+ */
+
+#include <boost/multi_index/detail/define_if_constexpr_macro.hpp>
+
+template<typename Node,typename Allocator>
+class node_handle
+{
+public:
+  typedef typename Node::value_type        value_type;
+  typedef Allocator                        allocator_type;
+
+  node_handle()BOOST_NOEXCEPT:node(0){}
+
+  node_handle(node_handle&& x)BOOST_NOEXCEPT:node(x.node)
+  {
+    if(!x.empty()){
+      move_construct_allocator(std::move(x));
+      x.destroy_allocator();
+      x.node=0;
+    }
+  }
+
+  ~node_handle()
+  {
+    if(!empty()){
+      delete_node();
+      destroy_allocator();
+    }
+  }
+
+  node_handle& operator=(node_handle&& x)
+  {
+    if(this!=&x){
+      if(!empty()){
+        delete_node();
+        if(!x.empty()){
+          BOOST_MULTI_INDEX_IF_CONSTEXPR(
+            allocator_propagate_on_container_move_assignment_t<
+              allocator_type>::value){
+            move_assign_allocator(std::move(x));
+          }
+          x.destroy_allocator();
+        }
+        else{
+          destroy_allocator();
+        }
+      }
+      else if(!x.empty()){
+        move_construct_allocator(std::move(x));
+        x.destroy_allocator();
+      }
+      node=x.node;
+      x.node=0;
+    }
+    return *this;
+  }
+
+  value_type& value()const{return node->value();}
+  allocator_type get_allocator()const{return *allocator_ptr();}
+
+#if !defined(BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS)
+  explicit
+#endif
+  operator bool()const BOOST_NOEXCEPT{return (node!=0);}
+
+#if BOOST_WORKAROUND(BOOST_GCC_VERSION,>=70000)&&__cplusplus<201103L
+  /* https://github.com/boostorg/config/issues/336 */
+#else
+  BOOST_ATTRIBUTE_NODISCARD 
+#endif
+  bool empty()const BOOST_NOEXCEPT{return (node==0);}
+
+  void swap(node_handle& x)
+    BOOST_NOEXCEPT_IF(
+      allocator_propagate_on_container_swap_t<allocator_type>::value||
+      allocator_is_always_equal_t<allocator_type>::value)
+  {
+    if(!empty()){
+      if(!x.empty()){
+        BOOST_MULTI_INDEX_IF_CONSTEXPR(
+          allocator_propagate_on_container_swap_t<allocator_type>::value){
+          using std::swap;
+          swap(*allocator_ptr(),*x.allocator_ptr());
+        }
+      }
+      else{
+        x.move_construct_allocator(std::move(*this));
+        destroy_allocator();
+      }
+    }
+    else if(!x.empty()){
+      move_construct_allocator(std::move(x));
+      x.destroy_allocator();
+    }
+    std::swap(node,x.node);
+  }
+
+  friend void swap(node_handle& x,node_handle& y)
+    BOOST_NOEXCEPT_IF(noexcept(x.swap(y)))
+  {
+    x.swap(y);
+  }
+
+private:
+  template <typename,typename,typename>
+  friend class boost::multi_index::multi_index_container;
+
+  node_handle(Node* node_,const allocator_type& al):node(node_)
+  {
+    ::new (static_cast<void*>(allocator_ptr())) allocator_type(al);
+  }
+
+  void release_node()
+  {
+    if(!empty()){
+      node=0;
+      destroy_allocator();
+    }
+  }
+
+#include <boost/multi_index/detail/ignore_wstrict_aliasing.hpp>
+
+  const allocator_type* allocator_ptr()const
+  {
+    return reinterpret_cast<const allocator_type*>(&space);
+  }
+
+  allocator_type* allocator_ptr()
+  {
+    return reinterpret_cast<allocator_type*>(&space);
+  }
+
+#include <boost/multi_index/detail/restore_wstrict_aliasing.hpp>
+
+  void move_construct_allocator(node_handle&& x)
+  {
+    ::new (static_cast<void*>(allocator_ptr()))
+      allocator_type(std::move(*x.allocator_ptr()));
+  }
+
+  void move_assign_allocator(node_handle&& x)
+  {
+    *allocator_ptr()=std::move(*x.allocator_ptr());
+  }
+
+  void destroy_allocator(){allocator_ptr()->~allocator_type();}
+
+  void delete_node()
+  {
+    typedef allocator_rebind_t<allocator_type,Node>  node_allocator;
+    typedef allocator_pointer_t<node_allocator>      node_pointer;
+
+    allocator_destroy(*allocator_ptr(),boost::addressof(node->value()));
+    node_allocator nal(*allocator_ptr());
+    allocator_deallocate(nal,static_cast<node_pointer>(node),1);
+  }
+
+  Node*                                 node;
+  typename aligned_storage<
+    sizeof(allocator_type),
+    alignment_of<allocator_type>::value
+  >::type                               space;
+};
+
+#include <boost/multi_index/detail/undef_if_constexpr_macro.hpp>
+
+/* node handle insert return type template class following
+ * [container.insert.return] specs.
+ */
+
+template<typename Iterator,typename NodeHandle>
+struct insert_return_type
+{
+  insert_return_type(
+    Iterator position_,bool inserted_,NodeHandle&& node_):
+    position(position_),inserted(inserted_),node(std::move(node_)){}
+  insert_return_type(insert_return_type&& x):
+    position(x.position),inserted(x.inserted),node(std::move(x.node)){}
+
+  insert_return_type& operator=(insert_return_type&& x)
+  {
+    position=x.position;
+    inserted=x.inserted;
+    node=std::move(x.node);
+    return *this;
+  }
+
+  Iterator   position;
+  bool       inserted;
+  NodeHandle node;
+};
+
+/* utility for SFINAEing merge and related operations */
+
+#define BOOST_MULTI_INDEX_ENABLE_IF_MERGEABLE(Dst,Src,T)           \
+typename enable_if_c<                                              \
+  !is_const< Dst >::value&&!is_const< Src >::value&&               \
+  is_same<typename Dst::node_type,typename Src::node_type>::value, \
+  T                                                                \
+>::type
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/node_type.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,20 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_NODE_TYPE_HPP
 #define BOOST_MULTI_INDEX_DETAIL_NODE_TYPE_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/workaround.hpp>
-#include <boost/mpl/bind.hpp>
-#include <boost/mpl/reverse_iter_fold.hpp>
-#include <boost/mpl/deref.hpp>
+#include <boost/mp11/algorithm.hpp>
 #include <boost/multi_index_container_fwd.hpp>
 #include <boost/multi_index/detail/header_holder.hpp>
 #include <boost/multi_index/detail/index_node_base.hpp>
 #include <boost/multi_index/detail/is_index_list.hpp>
-#include <boost/multi_index/detail/msvc_index_specifier.hpp>
 #include <boost/static_assert.hpp>
 
 namespace boost{
@@ -31,43 +27,23 @@ namespace multi_index{
 
 namespace detail{
 
-/* MPL machinery to construct the internal node type associated to an
+/* Mp11 machinery to construct the internal node type associated to an
  * index list.
  */
 
-#if BOOST_WORKAROUND(BOOST_MSVC,<1310)
-struct index_node_applier
-{
-  template<typename IndexSpecifierIterator,typename Super>
-  struct apply:
-    msvc_index_specifier< mpl::deref<IndexSpecifierIterator>::type >::
-      template result_node_class<Super>
-  {
-  }; 
-};
-#else
-struct index_node_applier
-{
-  template<typename IndexSpecifierIterator,typename Super>
-  struct apply
-  {
-    typedef typename mpl::deref<IndexSpecifierIterator>::type index_specifier;
-    typedef typename index_specifier::
-      BOOST_NESTED_TEMPLATE node_class<Super>::type type;
-  }; 
-};
-#endif
+template<typename IndexSpecifier,typename Super>
+using node_type=typename IndexSpecifier::template node_class<Super>::type; 
 
 template<typename Value,typename IndexSpecifierList,typename Allocator>
 struct multi_index_node_type
 {
   BOOST_STATIC_ASSERT(detail::is_index_list<IndexSpecifierList>::value);
 
-  typedef typename mpl::reverse_iter_fold<
-    IndexSpecifierList,
+  typedef mp11::mp_reverse_fold<
+    detail::mp11_index_list<IndexSpecifierList>,
     index_node_base<Value,Allocator>,
-    mpl::bind2<index_node_applier,mpl::_2,mpl::_1>
-  >::type type;
+    node_type
+  > type;
 };
 
 } /* namespace multi_index::detail */

include/boost/multi_index/detail/ord_index_args.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,19 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_ARGS_HPP
 #define BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_ARGS_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/mpl/aux_/na.hpp>
-#include <boost/mpl/eval_if.hpp>
-#include <boost/mpl/identity.hpp>
-#include <boost/mpl/if.hpp>
+#include <boost/mp11/utility.hpp>
 #include <boost/multi_index/tag.hpp>
 #include <boost/static_assert.hpp>
-#include <boost/type_traits/is_same.hpp>
 #include <functional>
+#include <type_traits>
 
 namespace boost{
 
@@ -40,38 +37,33 @@ namespace detail{
  * polymorphism.
  */
 
-template<typename KeyFromValue>
-struct index_args_default_compare
-{
-  typedef std::less<typename KeyFromValue::result_type> type;
-};
-
 template<typename Arg1,typename Arg2,typename Arg3>
 struct ordered_index_args
 {
   typedef is_tag<Arg1> full_form;
 
-  typedef typename mpl::if_<
+  typedef mp11::mp_if<
     full_form,
     Arg1,
-    tag< > >::type                                   tag_list_type;
-  typedef typename mpl::if_<
+    tag< > >                                     tag_list_type;
+  typedef mp11::mp_if<
     full_form,
     Arg2,
-    Arg1>::type                                      key_from_value_type;
-  typedef typename mpl::if_<
+    Arg1>                                        key_from_value_type;
+  typedef mp11::mp_if<
     full_form,
     Arg3,
-    Arg2>::type                                      supplied_compare_type;
-  typedef typename mpl::eval_if<
-    mpl::is_na<supplied_compare_type>,
-    index_args_default_compare<key_from_value_type>,
-    mpl::identity<supplied_compare_type>
-  >::type                                            compare_type;
+    Arg2>                                        supplied_compare_type;
+  typedef mp11::mp_eval_if_c<
+    !std::is_void<supplied_compare_type>::value,
+    supplied_compare_type,
+    std::less,
+    typename key_from_value_type::result_type
+  >                                              compare_type;
 
   BOOST_STATIC_ASSERT(is_tag<tag_list_type>::value);
-  BOOST_STATIC_ASSERT(!mpl::is_na<key_from_value_type>::value);
-  BOOST_STATIC_ASSERT(!mpl::is_na<compare_type>::value);
+  BOOST_STATIC_ASSERT(!std::is_void<key_from_value_type>::value);
+  BOOST_STATIC_ASSERT(!std::is_void<compare_type>::value);
 };
 
 } /* namespace multi_index::detail */
@@ -80,4 +72,4 @@ struct ordered_index_args
 
 } /* namespace boost */
 
-#endif
+#endif

include/boost/multi_index/detail/ord_index_impl_fwd.hpp

@@ -0,0 +1,128 @@
+/* Copyright 2003-2015 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_IMPL_FWD_HPP
+#define BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_IMPL_FWD_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+template<
+  typename KeyFromValue,typename Compare,
+  typename SuperMeta,typename TagList,typename Category,typename AugmentPolicy
+>
+class ordered_index;
+
+template<
+  typename KeyFromValue1,typename Compare1,
+  typename SuperMeta1,typename TagList1,typename Category1,
+  typename AugmentPolicy1,
+  typename KeyFromValue2,typename Compare2,
+  typename SuperMeta2,typename TagList2,typename Category2,
+  typename AugmentPolicy2
+>
+bool operator==(
+  const ordered_index<
+    KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1,AugmentPolicy1>& x,
+  const ordered_index<
+    KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2,AugmentPolicy2>& y);
+
+template<
+  typename KeyFromValue1,typename Compare1,
+  typename SuperMeta1,typename TagList1,typename Category1,
+  typename AugmentPolicy1,
+  typename KeyFromValue2,typename Compare2,
+  typename SuperMeta2,typename TagList2,typename Category2,
+  typename AugmentPolicy2
+>
+bool operator<(
+  const ordered_index<
+    KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1,AugmentPolicy1>& x,
+  const ordered_index<
+    KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2,AugmentPolicy2>& y);
+
+template<
+  typename KeyFromValue1,typename Compare1,
+  typename SuperMeta1,typename TagList1,typename Category1,
+  typename AugmentPolicy1,
+  typename KeyFromValue2,typename Compare2,
+  typename SuperMeta2,typename TagList2,typename Category2,
+  typename AugmentPolicy2
+>
+bool operator!=(
+  const ordered_index<
+    KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1,AugmentPolicy1>& x,
+  const ordered_index<
+    KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2,AugmentPolicy2>& y);
+
+template<
+  typename KeyFromValue1,typename Compare1,
+  typename SuperMeta1,typename TagList1,typename Category1,
+  typename AugmentPolicy1,
+  typename KeyFromValue2,typename Compare2,
+  typename SuperMeta2,typename TagList2,typename Category2,
+  typename AugmentPolicy2
+>
+bool operator>(
+  const ordered_index<
+    KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1,AugmentPolicy1>& x,
+  const ordered_index<
+    KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2,AugmentPolicy2>& y);
+
+template<
+  typename KeyFromValue1,typename Compare1,
+  typename SuperMeta1,typename TagList1,typename Category1,
+  typename AugmentPolicy1,
+  typename KeyFromValue2,typename Compare2,
+  typename SuperMeta2,typename TagList2,typename Category2,
+  typename AugmentPolicy2
+>
+bool operator>=(
+  const ordered_index<
+    KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1,AugmentPolicy1>& x,
+  const ordered_index<
+    KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2,AugmentPolicy2>& y);
+
+template<
+  typename KeyFromValue1,typename Compare1,
+  typename SuperMeta1,typename TagList1,typename Category1,
+  typename AugmentPolicy1,
+  typename KeyFromValue2,typename Compare2,
+  typename SuperMeta2,typename TagList2,typename Category2,
+  typename AugmentPolicy2
+>
+bool operator<=(
+  const ordered_index<
+    KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1,AugmentPolicy1>& x,
+  const ordered_index<
+    KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2,AugmentPolicy2>& y);
+
+template<
+  typename KeyFromValue,typename Compare,
+  typename SuperMeta,typename TagList,typename Category,typename AugmentPolicy
+>
+void swap(
+  ordered_index<
+    KeyFromValue,Compare,SuperMeta,TagList,Category,AugmentPolicy>& x,
+  ordered_index<
+    KeyFromValue,Compare,SuperMeta,TagList,Category,AugmentPolicy>& y);
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/ord_index_node.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2026 Joaquin M Lopez Munoz.
  * 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)
@@ -36,18 +36,17 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_NODE_HPP
 #define BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_NODE_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/core/allocator_access.hpp>
 #include <cstddef>
-#include <boost/detail/allocator_utilities.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
+#include <boost/multi_index/detail/raw_ptr.hpp>
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_COMPRESSED_ORDERED_INDEX_NODES)
-#include <boost/mpl/and.hpp>
-#include <boost/mpl/if.hpp>
+#include <boost/mp11/utility.hpp>
 #include <boost/multi_index/detail/uintptr_type.hpp>
 #include <boost/type_traits/alignment_of.hpp>
 #include <boost/type_traits/is_same.hpp>
@@ -64,28 +63,34 @@ namespace detail{
 enum ordered_index_color{red=false,black=true};
 enum ordered_index_side{to_left=false,to_right=true};
 
-template<typename Allocator>
+template<typename AugmentPolicy,typename Allocator>
 struct ordered_index_node_impl; /* fwd decl. */
 
-template<typename Allocator>
+template<typename AugmentPolicy,typename Allocator>
+struct ordered_index_node_traits
+{
+  typedef allocator_rebind_t<
+    Allocator,
+    ordered_index_node_impl<AugmentPolicy,Allocator>
+  >                                                  allocator;
+  typedef allocator_pointer_t<allocator>             pointer;
+  typedef allocator_const_pointer_t<allocator>       const_pointer;
+  typedef allocator_difference_type_t<allocator>     difference_type;
+  typedef allocator_size_type_t<allocator>           size_type;
+};
+
+template<typename AugmentPolicy,typename Allocator>
 struct ordered_index_node_std_base
 {
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,
-      ordered_index_node_impl<Allocator>
-    >::type
-  >::type::pointer                                pointer;
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,
-      ordered_index_node_impl<Allocator>
-    >::type
-  >::type::const_pointer                          const_pointer;
-  typedef ordered_index_color&                    color_ref;
-  typedef pointer&                                parent_ref;
+  typedef ordered_index_node_traits<
+    AugmentPolicy,Allocator>                    node_traits;
+  typedef typename node_traits::allocator       node_allocator;
+  typedef typename node_traits::pointer         pointer;
+  typedef typename node_traits::const_pointer   const_pointer;
+  typedef typename node_traits::difference_type difference_type;
+  typedef typename node_traits::size_type       size_type;
+  typedef ordered_index_color&                  color_ref;
+  typedef pointer&                              parent_ref;
 
   ordered_index_color& color(){return color_;}
   ordered_index_color  color()const{return color_;}
@@ -121,15 +126,23 @@ private:
 #pragma warning(disable:4312 4311)
 #endif
 
-template<typename Allocator>
+template<typename AugmentPolicy,typename Allocator>
 struct ordered_index_node_compressed_base
 {
-  typedef ordered_index_node_impl<Allocator>*       pointer;
-  typedef const ordered_index_node_impl<Allocator>* const_pointer;
+  typedef ordered_index_node_traits<
+    AugmentPolicy,Allocator>                    node_traits;
+  typedef typename node_traits::allocator       node_allocator;
+  typedef ordered_index_node_impl<
+    AugmentPolicy,Allocator>*                   pointer;
+  typedef const ordered_index_node_impl<
+    AugmentPolicy,Allocator>*                   const_pointer;
+  typedef typename node_traits::difference_type difference_type;
+  typedef typename node_traits::size_type       size_type;
 
   struct color_ref
   {
     color_ref(uintptr_type* r_):r(r_){}
+    color_ref(const color_ref& x):r(x.r){}
     
     operator ordered_index_color()const
     {
@@ -155,6 +168,7 @@ struct ordered_index_node_compressed_base
   struct parent_ref
   {
     parent_ref(uintptr_type* r_):r(r_){}
+    parent_ref(const parent_ref& x):r(x.r){}
     
     operator pointer()const
     {
@@ -184,7 +198,7 @@ struct ordered_index_node_compressed_base
   color_ref           color(){return color_ref(&parentcolor_);}
   ordered_index_color color()const
   {
-    return ordered_index_color(parentcolor_&std::size_t(1ul));
+    return ordered_index_color(parentcolor_&uintptr_type(1));
   }
 
   parent_ref parent(){return parent_ref(&parentcolor_);}
@@ -208,42 +222,43 @@ private:
 #endif
 #endif
 
-template<typename Allocator>
+template<typename AugmentPolicy,typename Allocator>
 struct ordered_index_node_impl_base:
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_COMPRESSED_ORDERED_INDEX_NODES)
-  mpl::if_c<
-    !(has_uintptr_type::value)||
-    (alignment_of<ordered_index_node_compressed_base<Allocator> >::value%2)||
-    !(is_same<
-      typename prevent_eti<
-        Allocator,
-        typename boost::detail::allocator::rebind_to<
-          Allocator,
-          ordered_index_node_impl<Allocator>
-        >::type
-      >::type::pointer,
-      ordered_index_node_impl<Allocator>*>::value),
-    ordered_index_node_std_base<Allocator>,
-    ordered_index_node_compressed_base<Allocator>
+  AugmentPolicy::template augmented_node<
+    mp11::mp_if_c<
+      !(has_uintptr_type::value)||
+      (alignment_of<
+        ordered_index_node_compressed_base<AugmentPolicy,Allocator>
+       >::value%2)||
+      !(is_same<
+        typename ordered_index_node_traits<AugmentPolicy,Allocator>::pointer,
+        ordered_index_node_impl<AugmentPolicy,Allocator>*>::value),
+      ordered_index_node_std_base<AugmentPolicy,Allocator>,
+      ordered_index_node_compressed_base<AugmentPolicy,Allocator>
+    >
   >::type
 #else
-  ordered_index_node_std_base<Allocator>
+  AugmentPolicy::template augmented_node<
+    ordered_index_node_std_base<AugmentPolicy,Allocator>
+  >::type
 #endif
 
 {};
 
-template<typename Allocator>
-struct ordered_index_node_impl:ordered_index_node_impl_base<Allocator>
+template<typename AugmentPolicy,typename Allocator>
+struct ordered_index_node_impl:
+  ordered_index_node_impl_base<AugmentPolicy,Allocator>
 {
 private:
-  typedef ordered_index_node_impl_base<Allocator> super;
+  typedef ordered_index_node_impl_base<AugmentPolicy,Allocator> super;
 
 public:
-  typedef typename super::color_ref               color_ref;
-  typedef typename super::parent_ref              parent_ref;
-  typedef typename super::pointer                 pointer;
-  typedef typename super::const_pointer           const_pointer;
+  typedef typename super::color_ref                             color_ref;
+  typedef typename super::parent_ref                            parent_ref;
+  typedef typename super::pointer                               pointer;
+  typedef typename super::const_pointer                         const_pointer;
 
   /* interoperability with bidir_node_iterator */
 
@@ -296,6 +311,7 @@ public:
     else                           x->parent()->right()=y;
     y->left()=x;
     x->parent()=y;
+    AugmentPolicy::rotate_left(x,y);
   }
 
   static pointer minimum(pointer x)
@@ -322,6 +338,7 @@ public:
     else                            x->parent()->left()=y;
     y->right()=x;
     x->parent()=y;
+    AugmentPolicy::rotate_right(x,y);
   }
 
   static void rebalance(pointer x,parent_ref root)
@@ -390,10 +407,11 @@ public:
     x->parent()=position;
     x->left()=pointer(0);
     x->right()=pointer(0);
+    AugmentPolicy::add(x,pointer(header->parent()));
     ordered_index_node_impl::rebalance(x,header->parent());
   }
 
-  static pointer rebalance_for_erase(
+  static pointer rebalance_for_extract(
     pointer z,parent_ref root,pointer& leftmost,pointer& rightmost)
   {
     pointer y=z;
@@ -412,7 +430,9 @@ public:
         x=y->right();
       }
     }
+    AugmentPolicy::remove(y,pointer(root));
     if(y!=z){
+      AugmentPolicy::copy(z,y);
       z->left()->parent()=y;   /* relink y in place of z. y is z's successor */
       y->left()=z->left();
       if(y!=z->right()){
@@ -555,41 +575,48 @@ public:
 #endif
 };
 
-template<typename Super>
+template<typename AugmentPolicy,typename Super>
 struct ordered_index_node_trampoline:
-  prevent_eti<
-    Super,
-    ordered_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        typename Super::allocator_type,
-        char
-      >::type
+  ordered_index_node_impl<
+    AugmentPolicy,
+    allocator_rebind_t<
+      typename Super::allocator_type,
+      char
     >
-  >::type
+  >
 {
-  typedef typename prevent_eti<
-    Super,
-    ordered_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        typename Super::allocator_type,
-        char
-      >::type
+  typedef ordered_index_node_impl<
+    AugmentPolicy,
+    allocator_rebind_t<
+      typename Super::allocator_type,
+      char
     >
-  >::type impl_type;
+  > impl_type;
 };
 
-template<typename Super>
-struct ordered_index_node:Super,ordered_index_node_trampoline<Super>
+template<typename AugmentPolicy,typename Super>
+struct ordered_index_node:
+  Super,ordered_index_node_trampoline<AugmentPolicy,Super>
 {
 private:
-  typedef ordered_index_node_trampoline<Super> trampoline;
+  typedef ordered_index_node_trampoline<AugmentPolicy,Super> trampoline;
 
 public:
-  typedef typename trampoline::impl_type     impl_type;
-  typedef typename trampoline::color_ref     impl_color_ref;
-  typedef typename trampoline::parent_ref    impl_parent_ref;
-  typedef typename trampoline::pointer       impl_pointer;
-  typedef typename trampoline::const_pointer const_impl_pointer;
+  typedef typename trampoline::impl_type       impl_type;
+  typedef typename trampoline::color_ref       impl_color_ref;
+  typedef typename trampoline::parent_ref      impl_parent_ref;
+  typedef typename trampoline::pointer         impl_pointer;
+  typedef typename trampoline::const_pointer   const_impl_pointer;
+  typedef typename trampoline::difference_type difference_type;
+  typedef typename trampoline::size_type       size_type;
+  typedef allocator_rebind_t<
+    typename trampoline::node_allocator,
+    ordered_index_node>                        final_allocator_type;
+  typedef allocator_pointer_t<
+    final_allocator_type>                      pointer;
+  typedef allocator_const_pointer_t<
+    final_allocator_type>                      const_pointer;
+
 
   impl_color_ref      color(){return trampoline::color();}
   ordered_index_color color()const{return trampoline::color();}
@@ -614,30 +641,38 @@ public:
 
   static ordered_index_node* from_impl(impl_pointer x)
   {
-    return static_cast<ordered_index_node*>(
-      static_cast<trampoline*>(&*x));
+    return
+      static_cast<ordered_index_node*>(
+        static_cast<trampoline*>(
+          raw_ptr<impl_type*>(x)));
   }
 
   static const ordered_index_node* from_impl(const_impl_pointer x)
   {
-    return static_cast<const ordered_index_node*>(
-      static_cast<const trampoline*>(&*x));
+    return
+      static_cast<const ordered_index_node*>(
+        static_cast<const trampoline*>(
+          raw_ptr<const impl_type*>(x)));
   }
 
-  /* interoperability with bidir_node_iterator */
+  /* Interoperability with bidir_node_iterator and index impl.
+   * Templated for raw-pointer/non-raw-pointer versions.
+   */
 
-  static void increment(ordered_index_node*& x)
+  template<typename NodePtr>
+  static void increment(NodePtr& x)
   {
     impl_pointer xi=x->impl();
     trampoline::increment(xi);
-    x=from_impl(xi);
+    x=NodePtr(from_impl(xi));
   }
 
-  static void decrement(ordered_index_node*& x)
+  template<typename NodePtr>
+  static void decrement(NodePtr& x)
   {
     impl_pointer xi=x->impl();
     trampoline::decrement(xi);
-    x=from_impl(xi);
+    x=NodePtr(from_impl(xi));
   }
 };
 

include/boost/multi_index/detail/ord_index_ops.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -36,11 +36,14 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_OPS_HPP
 #define BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_OPS_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/mp11/function.hpp>
+#include <boost/multi_index/detail/promotes_arg.hpp>
+#include <type_traits>
 #include <utility>
 
 namespace boost{
@@ -51,6 +54,9 @@ namespace detail{
 
 /* Common code for index memfuns having templatized and
  * non-templatized versions.
+ * Implementation note: When CompatibleKey is consistently promoted to
+ * KeyFromValue::result_type for comparison, the promotion is made once in
+ * advance to increase efficiency.
  */
 
 template<
@@ -60,6 +66,35 @@ template<
 inline Node* ordered_index_find(
   Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
   const CompatibleCompare& comp)
+{
+  typedef typename KeyFromValue::result_type key_type;
+
+  return ordered_index_find(
+    top,y,key,x,comp,
+    mp11::mp_and<
+      promotes_1st_arg<CompatibleCompare,CompatibleKey,key_type>,
+      promotes_2nd_arg<CompatibleCompare,key_type,CompatibleKey> >());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleCompare
+>
+inline Node* ordered_index_find(
+  Node* top,Node* y,const KeyFromValue& key,
+  const typename KeyFromValue::result_type& x,
+  const CompatibleCompare& comp,std::true_type)
+{
+  return ordered_index_find(top,y,key,x,comp,std::false_type());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline Node* ordered_index_find(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp,std::false_type)
 {
   Node* y0=y;
 
@@ -81,6 +116,33 @@ template<
 inline Node* ordered_index_lower_bound(
   Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
   const CompatibleCompare& comp)
+{
+  typedef typename KeyFromValue::result_type key_type;
+
+  return ordered_index_lower_bound(
+    top,y,key,x,comp,
+    promotes_2nd_arg<CompatibleCompare,key_type,CompatibleKey>());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleCompare
+>
+inline Node* ordered_index_lower_bound(
+  Node* top,Node* y,const KeyFromValue& key,
+  const typename KeyFromValue::result_type& x,
+  const CompatibleCompare& comp,std::true_type)
+{
+  return ordered_index_lower_bound(top,y,key,x,comp,std::false_type());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline Node* ordered_index_lower_bound(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp,std::false_type)
 {
   while(top){
     if(!comp(key(top->value()),x)){
@@ -100,6 +162,33 @@ template<
 inline Node* ordered_index_upper_bound(
   Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
   const CompatibleCompare& comp)
+{
+  typedef typename KeyFromValue::result_type key_type;
+
+  return ordered_index_upper_bound(
+    top,y,key,x,comp,
+    promotes_1st_arg<CompatibleCompare,CompatibleKey,key_type>());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleCompare
+>
+inline Node* ordered_index_upper_bound(
+  Node* top,Node* y,const KeyFromValue& key,
+  const typename KeyFromValue::result_type& x,
+  const CompatibleCompare& comp,std::true_type)
+{
+  return ordered_index_upper_bound(top,y,key,x,comp,std::false_type());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline Node* ordered_index_upper_bound(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp,std::false_type)
 {
   while(top){
     if(comp(x,key(top->value()))){
@@ -119,6 +208,35 @@ template<
 inline std::pair<Node*,Node*> ordered_index_equal_range(
   Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
   const CompatibleCompare& comp)
+{
+  typedef typename KeyFromValue::result_type key_type;
+
+  return ordered_index_equal_range(
+    top,y,key,x,comp,
+    mp11::mp_and<
+      promotes_1st_arg<CompatibleCompare,CompatibleKey,key_type>,
+      promotes_2nd_arg<CompatibleCompare,key_type,CompatibleKey> >());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleCompare
+>
+inline std::pair<Node*,Node*> ordered_index_equal_range(
+  Node* top,Node* y,const KeyFromValue& key,
+  const typename KeyFromValue::result_type& x,
+  const CompatibleCompare& comp,std::true_type)
+{
+  return ordered_index_equal_range(top,y,key,x,comp,std::false_type());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline std::pair<Node*,Node*> ordered_index_equal_range(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp,std::false_type)
 {
   while(top){
     if(comp(key(top->value()),x)){
@@ -130,8 +248,10 @@ inline std::pair<Node*,Node*> ordered_index_equal_range(
     }
     else{
       return std::pair<Node*,Node*>(
-        ordered_index_lower_bound(Node::from_impl(top->left()),top,key,x,comp),
-        ordered_index_upper_bound(Node::from_impl(top->right()),y,key,x,comp));
+        ordered_index_lower_bound(
+          Node::from_impl(top->left()),top,key,x,comp,std::false_type()),
+        ordered_index_upper_bound(
+          Node::from_impl(top->right()),y,key,x,comp,std::false_type()));
     }
   }
 

include/boost/multi_index/detail/prevent_eti.hpp

@@ -1,60 +0,0 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
- * 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)
- *
- * See http://www.boost.org/libs/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_DETAIL_PREVENT_ETI_HPP
-#define BOOST_MULTI_INDEX_DETAIL_PREVENT_ETI_HPP
-
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/workaround.hpp>
-
-#if BOOST_WORKAROUND(BOOST_MSVC,<1300)
-#include <boost/mpl/if.hpp>
-#include <boost/mpl/integral_c.hpp>
-#include <boost/mpl/aux_/msvc_never_true.hpp>
-#endif
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-#if BOOST_WORKAROUND(BOOST_MSVC,<1300)
-/* See
- * http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Effective_MPL
- * Item 5.6, Beware of the 'early template instantiation' trap.
- */
-
-template<typename Type,typename Construct>
-struct prevent_eti
-{
-  typedef typename mpl::if_<
-    mpl::aux::msvc_never_true<Type>,
-    mpl::integral_c<int,0>,
-    Construct
-  >::type type;
-};
-#else
-template<typename Type,typename Construct>
-struct prevent_eti
-{
-  typedef Construct type;
-};
-#endif
-
-} /* namespace multi_index::detail */
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-#endif

include/boost/multi_index/detail/promotes_arg.hpp

@@ -0,0 +1,82 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_PROMOTES_ARG_HPP
+#define BOOST_MULTI_INDEX_DETAIL_PROMOTES_ARG_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/detail/workaround.hpp>
+#include <type_traits>
+
+/* Metafunctions to check if f(arg1,arg2) promotes either arg1 to the type of
+ * arg2 or viceversa. By default, (i.e. if it cannot be determined), no
+ * promotion is assumed.
+ */
+
+#if BOOST_WORKAROUND(BOOST_MSVC,<1400)
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+template<typename F,typename Arg1,typename Arg2>
+struct promotes_1st_arg:std::false_type{};
+
+template<typename F,typename Arg1,typename Arg2>
+struct promotes_2nd_arg:std::false_type{};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#else
+
+#include <boost/mp11/function.hpp>
+#include <boost/multi_index/detail/is_transparent.hpp>
+#include <boost/type_traits/is_convertible.hpp>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+  
+template<typename F,typename Arg1,typename Arg2>
+struct promotes_1st_arg:
+  mp11::mp_and<
+    mp11::mp_not<is_transparent<F,Arg1,Arg2> >,
+    is_convertible<const Arg1,Arg2>,
+    is_transparent<F,Arg2,Arg2>
+  >
+{};
+
+template<typename F,typename Arg1,typename Arg2>
+struct promotes_2nd_arg:
+  mp11::mp_and<
+    mp11::mp_not<is_transparent<F,Arg1,Arg2> >,
+    is_convertible<const Arg2,Arg1>,
+    is_transparent<F,Arg1,Arg1>
+  >
+{};
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif
+#endif

include/boost/multi_index/detail/raw_ptr.hpp

@@ -0,0 +1,51 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_RAW_PTR_HPP
+#define BOOST_MULTI_INDEX_DETAIL_RAW_PTR_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <type_traits>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* gets the underlying pointer of a pointer-like value */
+
+template<typename RawPointer>
+inline RawPointer raw_ptr(RawPointer const& p,std::true_type)
+{
+  return p;
+}
+
+template<typename RawPointer,typename Pointer>
+inline RawPointer raw_ptr(Pointer const& p,std::false_type)
+{
+  return p==Pointer(0)?0:&*p;
+}
+
+template<typename RawPointer,typename Pointer>
+inline RawPointer raw_ptr(Pointer const& p)
+{
+  return raw_ptr<RawPointer>(p,std::is_same<RawPointer,Pointer>());
+}
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif

include/boost/multi_index/detail/restore_wstrict_aliasing.hpp

@@ -0,0 +1,11 @@
+/* Copyright 2003-2016 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#define BOOST_MULTI_INDEX_DETAIL_RESTORE_WSTRICT_ALIASING
+#include <boost/multi_index/detail/ignore_wstrict_aliasing.hpp>
+#undef BOOST_MULTI_INDEX_DETAIL_RESTORE_WSTRICT_ALIASING

include/boost/multi_index/detail/rnd_index_loader.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,18 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_LOADER_HPP
 #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_LOADER_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/core/allocator_access.hpp>
 #include <algorithm>
-#include <boost/detail/allocator_utilities.hpp>
+#include <boost/core/noncopyable.hpp>
 #include <boost/multi_index/detail/auto_space.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
 #include <boost/multi_index/detail/rnd_index_ptr_array.hpp>
-#include <boost/noncopyable.hpp>
-#include <cstddef>
 
 namespace boost{
 
@@ -45,15 +43,12 @@ template<typename Allocator>
 class random_access_index_loader_base:private noncopyable
 {
 protected:
-  typedef typename prevent_eti<
-    Allocator,
-    random_access_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        Allocator,
-        char
-      >::type
+  typedef random_access_index_node_impl<
+    allocator_rebind_t<
+      Allocator,
+      char
     >
-  >::type                                           node_impl_type;
+  >                                                 node_impl_type;
   typedef typename node_impl_type::pointer          node_impl_pointer;
   typedef random_access_index_ptr_array<Allocator>  ptr_array;
 
@@ -72,9 +67,9 @@ protected:
       node_impl_pointer n=header;
       next(n)=n;
 
-      for(std::size_t i=ptrs.size();i--;){
+      for(size_type i=ptrs.size();i--;){
         n=prev(n);
-        std::size_t d=position(n);
+        size_type d=position(n);
         if(d!=i){
           node_impl_pointer m=prev(next_at(i));
           std::swap(m->up(),n->up());
@@ -86,18 +81,20 @@ protected:
     }
   }
 
-  void rearrange(node_impl_pointer position,node_impl_pointer x)
+  void rearrange(node_impl_pointer position_,node_impl_pointer x)
   {
     preprocess(); /* only incur this penalty if rearrange() is ever called */
-    if(position==node_impl_pointer(0))position=header;
+    if(position_==node_impl_pointer(0))position_=header;
     next(prev(x))=next(x);
     prev(next(x))=prev(x);
-    prev(x)=position;
-    next(x)=next(position);
+    prev(x)=position_;
+    next(x)=next(position_);
     next(prev(x))=prev(next(x))=x;
   }
 
 private:
+  typedef allocator_size_type_t<Allocator> size_type;
+
   void preprocess()
   {
     if(!preprocessed){
@@ -116,17 +113,17 @@ private:
     }
   }
 
-  std::size_t position(node_impl_pointer x)const
+  size_type position(node_impl_pointer x)const
   {
-    return (std::size_t)(x->up()-ptrs.begin());
+    return (size_type)(x->up()-ptrs.begin());
   }
 
-  node_impl_pointer& next_at(std::size_t n)const
+  node_impl_pointer& next_at(size_type n)const
   {
     return *ptrs.at(n);
   }
 
-  node_impl_pointer& prev_at(std::size_t n)const
+  node_impl_pointer& prev_at(size_type n)const
   {
     return *(prev_spc.data()+n);
   }
@@ -161,9 +158,10 @@ public:
     super(al_,ptrs_)
   {}
 
-  void rearrange(Node* position,Node *x)
+  void rearrange(Node* position_,Node *x)
   {
-    super::rearrange(position?position->impl():node_impl_pointer(0),x->impl());
+    super::rearrange(
+      position_?position_->impl():node_impl_pointer(0),x->impl());
   }
 };
 

include/boost/multi_index/detail/rnd_index_node.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2026 Joaquin M Lopez Munoz.
  * 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)
@@ -9,15 +9,15 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_NODE_HPP
 #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_NODE_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/core/allocator_access.hpp>
 #include <algorithm>
-#include <boost/detail/allocator_utilities.hpp>
-#include <boost/math/common_factor_rt.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
+#include <boost/integer/common_factor_rt.hpp>
+#include <boost/multi_index/detail/raw_ptr.hpp>
 #include <cstddef>
 #include <functional>
 
@@ -30,24 +30,16 @@ namespace detail{
 template<typename Allocator>
 struct random_access_index_node_impl
 {
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,random_access_index_node_impl
-    >::type
-  >::type::pointer                                pointer;
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,random_access_index_node_impl
-    >::type
-  >::type::const_pointer                          const_pointer;
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,pointer
-    >::type
-  >::type::pointer                                ptr_pointer;
+  typedef allocator_rebind_t<
+    Allocator,random_access_index_node_impl
+  >                                                   node_allocator;
+  typedef allocator_pointer_t<node_allocator>         pointer;
+  typedef allocator_const_pointer_t<node_allocator>   const_pointer;
+  typedef allocator_difference_type_t<node_allocator> difference_type;
+  typedef allocator_rebind_t<
+    Allocator,pointer
+  >                                                   ptr_allocator;
+  typedef allocator_pointer_t<ptr_allocator>          ptr_pointer;
 
   ptr_pointer& up(){return up_;}
   ptr_pointer  up()const{return up_;}
@@ -64,14 +56,14 @@ struct random_access_index_node_impl
     x=*(x->up()-1);
   }
 
-  static void advance(pointer& x,std::ptrdiff_t n)
+  static void advance(pointer& x,difference_type n)
   {
     x=*(x->up()+n);
   }
 
-  static std::ptrdiff_t distance(pointer x,pointer y)
+  static difference_type distance(pointer x,pointer y)
   {
-    return y->up()-x->up();
+    return static_cast<difference_type>(y->up()-x->up());
   }
 
   /* algorithmic stuff */
@@ -112,7 +104,7 @@ struct random_access_index_node_impl
     std::ptrdiff_t n=end-begin;
     std::ptrdiff_t m=middle-begin;
     std::ptrdiff_t n_m=n-m;
-    std::ptrdiff_t p=math::gcd(n,m);
+    std::ptrdiff_t p=integer::gcd(n,m);
 
     for(std::ptrdiff_t i=0;i<p;++i){
       pointer tmp=begin[i];
@@ -175,31 +167,44 @@ struct random_access_index_node_impl
     }
   }
 
+  static ptr_pointer gather_nulls(
+    ptr_pointer pbegin,ptr_pointer pend,ptr_pointer x)
+  {
+    for(ptr_pointer p=pbegin;p!=x;++p){
+      if(*p){
+        *pbegin=*p;
+        (*pbegin)->up()=pbegin;
+        ++pbegin;
+      }
+    }
+    for(ptr_pointer p=pend;p!=x;){
+      if(*--p){
+        *--pend=*p;
+        (*pend)->up()=pend;
+      }
+    }
+    return pbegin;
+  }
+
 private:
   ptr_pointer up_;
 };
 
 template<typename Super>
 struct random_access_index_node_trampoline:
-  prevent_eti<
-    Super,
-    random_access_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        typename Super::allocator_type,
-        char
-      >::type
+  random_access_index_node_impl<
+    allocator_rebind_t<
+      typename Super::allocator_type,
+      char
     >
-  >::type
+  >
 {
-  typedef typename prevent_eti<
-    Super,
-    random_access_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        typename Super::allocator_type,
-        char
-      >::type
+  typedef random_access_index_node_impl<
+    allocator_rebind_t<
+      typename Super::allocator_type,
+      char
     >
-  >::type impl_type;
+  > impl_type;
 };
 
 template<typename Super>
@@ -210,10 +215,18 @@ private:
   typedef random_access_index_node_trampoline<Super> trampoline;
 
 public:
-  typedef typename trampoline::impl_type     impl_type;
-  typedef typename trampoline::pointer       impl_pointer;
-  typedef typename trampoline::const_pointer const_impl_pointer;
-  typedef typename trampoline::ptr_pointer   impl_ptr_pointer;
+  typedef typename trampoline::impl_type       impl_type;
+  typedef typename trampoline::pointer         impl_pointer;
+  typedef typename trampoline::const_pointer   const_impl_pointer;
+  typedef typename trampoline::difference_type difference_type;
+  typedef typename trampoline::ptr_pointer     impl_ptr_pointer;
+  typedef allocator_rebind_t<
+    typename trampoline::node_allocator,
+    random_access_index_node>                  final_allocator_type;
+  typedef allocator_pointer_t<
+    final_allocator_type>                      pointer;
+  typedef allocator_const_pointer_t<
+    final_allocator_type>                      const_pointer;
 
   impl_ptr_pointer& up(){return trampoline::up();}
   impl_ptr_pointer  up()const{return trampoline::up();}
@@ -232,40 +245,44 @@ public:
 
   static random_access_index_node* from_impl(impl_pointer x)
   {
-    return static_cast<random_access_index_node*>(
-      static_cast<trampoline*>(&*x));
+    return
+      static_cast<random_access_index_node*>(
+        static_cast<trampoline*>(
+          raw_ptr<impl_type*>(x)));
   }
 
   static const random_access_index_node* from_impl(const_impl_pointer x)
   {
-    return static_cast<const random_access_index_node*>(
-      static_cast<const trampoline*>(&*x));
+    return
+      static_cast<const random_access_index_node*>(
+        static_cast<const trampoline*>(
+          raw_ptr<const impl_type*>(x)));
   }
 
   /* interoperability with rnd_node_iterator */
 
-  static void increment(random_access_index_node*& x)
+  static void increment(pointer& x)
   {
     impl_pointer xi=x->impl();
     trampoline::increment(xi);
-    x=from_impl(xi);
+    x=pointer(from_impl(xi));
   }
 
-  static void decrement(random_access_index_node*& x)
+  static void decrement(pointer& x)
   {
     impl_pointer xi=x->impl();
     trampoline::decrement(xi);
-    x=from_impl(xi);
+    x=pointer(from_impl(xi));
   }
 
-  static void advance(random_access_index_node*& x,std::ptrdiff_t n)
+  static void advance(pointer& x,difference_type n)
   {
     impl_pointer xi=x->impl();
     trampoline::advance(xi,n);
-    x=from_impl(xi);
+    x=pointer(from_impl(xi));
   }
 
-  static std::ptrdiff_t distance(
+  static difference_type distance(
     random_access_index_node* x,random_access_index_node* y)
   {
     return trampoline::distance(x->impl(),y->impl());

include/boost/multi_index/detail/rnd_index_ops.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2009 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,14 +9,13 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_OPS_HPP
 #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_OPS_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
 #include <algorithm>
 #include <boost/multi_index/detail/rnd_index_ptr_array.hpp>
-#include <functional>
 
 namespace boost{
 
@@ -30,8 +29,7 @@ namespace detail{
 
 template<typename Node,typename Allocator,typename Predicate>
 Node* random_access_index_remove(
-  random_access_index_ptr_array<Allocator>& ptrs,Predicate pred
-  BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node))
+  random_access_index_ptr_array<Allocator>& ptrs,Predicate pred)
 {
   typedef typename Node::value_type value_type;
   typedef typename Node::impl_ptr_pointer impl_ptr_pointer;
@@ -55,8 +53,7 @@ Node* random_access_index_remove(
 
 template<typename Node,typename Allocator,class BinaryPredicate>
 Node* random_access_index_unique(
-  random_access_index_ptr_array<Allocator>& ptrs,BinaryPredicate binary_pred
-  BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node))
+  random_access_index_ptr_array<Allocator>& ptrs,BinaryPredicate binary_pred)
 {
   typedef typename Node::value_type       value_type;
   typedef typename Node::impl_ptr_pointer impl_ptr_pointer;
@@ -86,8 +83,7 @@ template<typename Node,typename Allocator,typename Compare>
 void random_access_index_inplace_merge(
   const Allocator& al,
   random_access_index_ptr_array<Allocator>& ptrs,
-  BOOST_DEDUCED_TYPENAME Node::impl_ptr_pointer first1,Compare comp
-  BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node))
+  typename Node::impl_ptr_pointer first1,Compare comp)
 {
   typedef typename Node::value_type       value_type;
   typedef typename Node::impl_pointer     impl_pointer;
@@ -126,11 +122,12 @@ void random_access_index_inplace_merge(
 /* auxiliary stuff */
 
 template<typename Node,typename Compare>
-struct random_access_index_sort_compare:
-  std::binary_function<
-    typename Node::impl_pointer,
-    typename Node::impl_pointer,bool>
+struct random_access_index_sort_compare
 {
+  typedef typename Node::impl_pointer first_argument_type;
+  typedef typename Node::impl_pointer second_argument_type;
+  typedef bool                        result_type;
+
   random_access_index_sort_compare(Compare comp_=Compare()):comp(comp_){}
 
   bool operator()(
@@ -151,8 +148,7 @@ template<typename Node,typename Allocator,class Compare>
 void random_access_index_sort(
   const Allocator& al,
   random_access_index_ptr_array<Allocator>& ptrs,
-  Compare comp
-  BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node))
+  Compare comp)
 {
   /* The implementation is extremely simple: an auxiliary
    * array of pointers is sorted using stdlib facilities and
@@ -176,7 +172,6 @@ void random_access_index_sort(
 
   if(ptrs.size()<=1)return;
 
-  typedef typename Node::value_type         value_type;
   typedef typename Node::impl_pointer       impl_pointer;
   typedef typename Node::impl_ptr_pointer   impl_ptr_pointer;
   typedef random_access_index_sort_compare<

include/boost/multi_index/detail/rnd_index_ptr_array.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
  * 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)
@@ -9,18 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_PTR_ARRAY_HPP
 #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_PTR_ARRAY_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/core/allocator_access.hpp>
 #include <algorithm>
-#include <boost/detail/allocator_utilities.hpp>
+#include <boost/core/noncopyable.hpp>
 #include <boost/multi_index/detail/auto_space.hpp>
-#include <boost/multi_index/detail/prevent_eti.hpp>
 #include <boost/multi_index/detail/rnd_index_node.hpp>
-#include <boost/noncopyable.hpp>
-#include <cstddef>
 
 namespace boost{
 
@@ -33,37 +31,35 @@ namespace detail{
 template<typename Allocator>
 class random_access_index_ptr_array:private noncopyable
 {
-  typedef typename prevent_eti<
-    Allocator,
-    random_access_index_node_impl<
-      typename boost::detail::allocator::rebind_to<
-        Allocator,
-        char
-      >::type
+  typedef random_access_index_node_impl<
+    allocator_rebind_t<
+      Allocator,
+      char
     >
-  >::type                                           node_impl_type;
+  >                                         node_impl_type;
 
 public:
-  typedef typename node_impl_type::pointer          value_type;
-  typedef typename prevent_eti<
-    Allocator,
-    typename boost::detail::allocator::rebind_to<
-      Allocator,value_type
-    >::type
-  >::type::pointer                                  pointer;
+  typedef typename node_impl_type::pointer  value_type;
+  typedef allocator_rebind_t<
+    Allocator,value_type
+  >                                         value_allocator;
+  typedef allocator_pointer_t<
+    value_allocator>                        pointer;
+  typedef allocator_size_type_t<
+    value_allocator>                        size_type;
 
   random_access_index_ptr_array(
-    const Allocator& al,value_type end_,std::size_t size):
-    size_(size),
-    capacity_(size),
+    const Allocator& al,value_type end_,size_type sz):
+    size_(sz),
+    capacity_(sz),
     spc(al,capacity_+1)
   {
     *end()=end_;
     end_->up()=end();
   }
 
-  std::size_t size()const{return size_;}
-  std::size_t capacity()const{return capacity_;}
+  size_type size()const{return size_;}
+  size_type capacity()const{return capacity_;}
 
   void room_for_one()
   {
@@ -72,19 +68,19 @@ public:
     }
   }
 
-  void reserve(std::size_t c)
+  void reserve(size_type c)
   {
-    if(c>capacity_){
-      auto_space<value_type,Allocator> spc1(spc.get_allocator(),c+1);
-      node_impl_type::transfer(begin(),end()+1,spc1.data());
-      spc.swap(spc1);
-      capacity_=c;
-    }
+    if(c>capacity_)set_capacity(c);
+  }
+
+  void shrink_to_fit()
+  {
+    if(capacity_>size_)set_capacity(size_);
   }
 
   pointer begin()const{return ptrs();}
   pointer end()const{return ptrs()+size_;}
-  pointer at(std::size_t n)const{return ptrs()+n;}
+  pointer at(size_type n)const{return ptrs()+n;}
 
   void push_back(value_type x)
   {
@@ -115,15 +111,31 @@ public:
     spc.swap(x.spc);
   }
 
+  template<typename BoolConstant>
+  void swap(random_access_index_ptr_array& x,BoolConstant swap_allocators)
+  {
+    std::swap(size_,x.size_);
+    std::swap(capacity_,x.capacity_);
+    spc.swap(x.spc,swap_allocators);
+  }
+
 private:
-  std::size_t                      size_;
-  std::size_t                      capacity_;
+  size_type                        size_;
+  size_type                        capacity_;
   auto_space<value_type,Allocator> spc;
 
   pointer ptrs()const
   {
     return spc.data();
   }
+
+  void set_capacity(size_type c)
+  {
+    auto_space<value_type,Allocator> spc1(spc.get_allocator(),c+1);
+    node_impl_type::transfer(begin(),end()+1,spc1.data());
+    spc.swap(spc1);
+    capacity_=c;
+  }
 };
 
 template<typename Allocator>

include/boost/multi_index/detail/rnd_node_iterator.hpp

@@ -1,4 +1,4 @@
-/* Copyright 2003-2008 Joaquin M Lopez Munoz.
+/* Copyright 2003-2026 Joaquin M Lopez Munoz.
  * 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)
@@ -9,16 +9,16 @@
 #ifndef BOOST_MULTI_INDEX_DETAIL_RND_NODE_ITERATOR_HPP
 #define BOOST_MULTI_INDEX_DETAIL_RND_NODE_ITERATOR_HPP
 
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/multi_index/detail/raw_ptr.hpp>
 #include <boost/operators.hpp>
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-#include <boost/serialization/nvp.hpp>
-#include <boost/serialization/split_member.hpp>
+#include <boost/core/serialization.hpp>
 #endif
 
 namespace boost{
@@ -34,11 +34,12 @@ class rnd_node_iterator:
   public random_access_iterator_helper<
     rnd_node_iterator<Node>,
     typename Node::value_type,
-    std::ptrdiff_t,
+    typename Node::difference_type,
     const typename Node::value_type*,
     const typename Node::value_type&>
 {
 public:
+  /* coverity[uninit_ctor]: suppress warning */
   rnd_node_iterator(){}
   explicit rnd_node_iterator(Node* node_):node(node_){}
 
@@ -59,13 +60,13 @@ public:
     return *this;
   }
 
-  rnd_node_iterator& operator+=(std::ptrdiff_t n)
+  rnd_node_iterator& operator+=(typename Node::difference_type n)
   {
     Node::advance(node,n);
     return *this;
   }
 
-  rnd_node_iterator& operator-=(std::ptrdiff_t n)
+  rnd_node_iterator& operator-=(typename Node::difference_type n)
   {
     Node::advance(node,-n);
     return *this;
@@ -76,23 +77,27 @@ public:
    * see explanation in safe_mode_iterator notes in safe_mode.hpp.
    */
 
-  BOOST_SERIALIZATION_SPLIT_MEMBER()
+  template<class Archive>
+  void serialize(Archive& ar,const unsigned int version)
+  {
+    core::split_member(ar,*this,version);
+  }
 
   typedef typename Node::base_type node_base_type;
 
   template<class Archive>
   void save(Archive& ar,const unsigned int)const
   {
-    node_base_type* bnode=node;
-    ar<<serialization::make_nvp("pointer",bnode);
+    node_base_type* bnode=get_node();
+    ar<<core::make_nvp("pointer",bnode);
   }
 
   template<class Archive>
   void load(Archive& ar,const unsigned int)
   {
     node_base_type* bnode;
-    ar>>serialization::make_nvp("pointer",bnode);
-    node=static_cast<Node*>(bnode);
+    ar>>core::make_nvp("pointer",bnode);
+    node=typename Node::pointer(static_cast<Node*>(bnode));
   }
 #endif
 
@@ -100,10 +105,10 @@ public:
 
   typedef Node node_type;
 
-  Node* get_node()const{return node;}
+  Node* get_node()const{return raw_ptr<Node*>(node);}
 
 private:
-  Node* node;
+  typename Node::pointer node;
 };
 
 template<typename Node>
@@ -123,7 +128,7 @@ bool operator<(
 }
 
 template<typename Node>
-std::ptrdiff_t operator-(
+typename Node::difference_type operator-(
   const rnd_node_iterator<Node>& x,
   const rnd_node_iterator<Node>& y)
 {

include/boost/multi_index/detail/rnk_index_ops.hpp

@@ -0,0 +1,326 @@
+/* Copyright 2003-2025 Joaquin M Lopez Munoz.
+ * 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)
+ *
+ * See http://www.boost.org/libs/multi_index for library home page.
+ */
+
+#ifndef BOOST_MULTI_INDEX_DETAIL_RNK_INDEX_OPS_HPP
+#define BOOST_MULTI_INDEX_DETAIL_RNK_INDEX_OPS_HPP
+
+#if defined(_MSC_VER)
+#pragma once
+#endif
+
+#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
+#include <boost/core/pointer_traits.hpp>
+#include <boost/mp11/function.hpp>
+#include <boost/multi_index/detail/promotes_arg.hpp>
+#include <type_traits>
+#include <utility>
+
+namespace boost{
+
+namespace multi_index{
+
+namespace detail{
+
+/* Common code for ranked_index memfuns having templatized and
+ * non-templatized versions.
+ */
+
+template<typename Pointer>
+struct ranked_node_size_type
+{
+  typedef typename boost::pointer_traits<Pointer>::
+    element_type::size_type type;
+};
+
+template<typename Pointer>
+inline typename ranked_node_size_type<Pointer>::type
+ranked_node_size(Pointer x)
+{
+  return x!=Pointer(0)?x->size:0;
+}
+
+template<typename Pointer>
+inline Pointer ranked_index_nth(
+  typename ranked_node_size_type<Pointer>::type n,Pointer end_)
+{
+  typedef typename ranked_node_size_type<Pointer>::type size_type;
+
+  Pointer top=end_->parent();
+  if(top==Pointer(0)||n>=top->size)return end_;
+
+  for(;;){
+    size_type s=ranked_node_size(top->left());
+    if(n==s)return top;
+    if(n<s)top=top->left();
+    else{
+      top=top->right();
+      n-=s+1;
+    }
+  }
+}
+
+template<typename Pointer>
+inline typename ranked_node_size_type<Pointer>::type
+ranked_index_rank(Pointer x,Pointer end_)
+{
+  typedef typename ranked_node_size_type<Pointer>::type size_type;
+
+  Pointer top=end_->parent();
+  if(top==Pointer(0))return 0;
+  if(x==end_)return top->size;
+
+  size_type s=ranked_node_size(x->left());
+  while(x!=top){
+    Pointer z=x->parent();
+    if(x==z->right()){
+      s+=ranked_node_size(z->left())+1;
+    }
+    x=z;
+  }
+  return s;
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_find_rank(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp)
+{
+  typedef typename KeyFromValue::result_type key_type;
+
+  return ranked_index_find_rank(
+    top,y,key,x,comp,
+    mp11::mp_and<
+      promotes_1st_arg<CompatibleCompare,CompatibleKey,key_type>,
+      promotes_2nd_arg<CompatibleCompare,key_type,CompatibleKey> >());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_find_rank(
+  Node* top,Node* y,const KeyFromValue& key,
+  const typename KeyFromValue::result_type& x,
+  const CompatibleCompare& comp,std::true_type)
+{
+  return ranked_index_find_rank(top,y,key,x,comp,std::false_type());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_find_rank(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp,std::false_type)
+{
+  typedef typename Node::size_type size_type;
+
+  if(!top)return 0;
+
+  size_type s=top->impl()->size,
+            s0=s;
+  Node*     y0=y;
+
+  do{
+    if(!comp(key(top->value()),x)){
+      y=top;
+      s-=ranked_node_size(y->right())+1;
+      top=Node::from_impl(top->left());
+    }
+    else top=Node::from_impl(top->right());
+  }while(top);
+    
+  return (y==y0||comp(x,key(y->value())))?s0:s;
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_lower_bound_rank(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp)
+{
+  typedef typename KeyFromValue::result_type key_type;
+
+  return ranked_index_lower_bound_rank(
+    top,y,key,x,comp,
+    promotes_2nd_arg<CompatibleCompare,key_type,CompatibleKey>());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_lower_bound_rank(
+  Node* top,Node* y,const KeyFromValue& key,
+  const typename KeyFromValue::result_type& x,
+  const CompatibleCompare& comp,std::true_type)
+{
+  return ranked_index_lower_bound_rank(top,y,key,x,comp,std::false_type());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_lower_bound_rank(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp,std::false_type)
+{
+  typedef typename Node::size_type size_type;
+
+  if(!top)return 0;
+
+  size_type s=top->impl()->size;
+
+  do{
+    if(!comp(key(top->value()),x)){
+      y=top;
+      s-=ranked_node_size(y->right())+1;
+      top=Node::from_impl(top->left());
+    }
+    else top=Node::from_impl(top->right());
+  }while(top);
+
+  return s;
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_upper_bound_rank(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp)
+{
+  typedef typename KeyFromValue::result_type key_type;
+
+  return ranked_index_upper_bound_rank(
+    top,y,key,x,comp,
+    promotes_1st_arg<CompatibleCompare,CompatibleKey,key_type>());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_upper_bound_rank(
+  Node* top,Node* y,const KeyFromValue& key,
+  const typename KeyFromValue::result_type& x,
+  const CompatibleCompare& comp,std::true_type)
+{
+  return ranked_index_upper_bound_rank(top,y,key,x,comp,std::false_type());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline typename Node::size_type ranked_index_upper_bound_rank(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp,std::false_type)
+{
+  typedef typename Node::size_type size_type;
+
+  if(!top)return 0;
+
+  size_type s=top->impl()->size;
+
+  do{
+    if(comp(x,key(top->value()))){
+      y=top;
+      s-=ranked_node_size(y->right())+1;
+      top=Node::from_impl(top->left());
+    }
+    else top=Node::from_impl(top->right());
+  }while(top);
+
+  return s;
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline std::pair<typename Node::size_type,typename Node::size_type>
+ranked_index_equal_range_rank(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp)
+{
+  typedef typename KeyFromValue::result_type key_type;
+
+  return ranked_index_equal_range_rank(
+    top,y,key,x,comp,
+    mp11::mp_and<
+      promotes_1st_arg<CompatibleCompare,CompatibleKey,key_type>,
+      promotes_2nd_arg<CompatibleCompare,key_type,CompatibleKey> >());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleCompare
+>
+inline std::pair<typename Node::size_type,typename Node::size_type>
+ranked_index_equal_range_rank(
+  Node* top,Node* y,const KeyFromValue& key,
+  const typename KeyFromValue::result_type& x,
+  const CompatibleCompare& comp,std::true_type)
+{
+  return ranked_index_equal_range_rank(top,y,key,x,comp,std::false_type());
+}
+
+template<
+  typename Node,typename KeyFromValue,
+  typename CompatibleKey,typename CompatibleCompare
+>
+inline std::pair<typename Node::size_type,typename Node::size_type>
+ranked_index_equal_range_rank(
+  Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x,
+  const CompatibleCompare& comp,std::false_type)
+{
+  typedef typename Node::size_type size_type;
+
+  if(!top)return std::pair<size_type,size_type>((size_type)0,(size_type)0);
+
+  size_type s=top->impl()->size;
+
+  do{
+    if(comp(key(top->value()),x)){
+      top=Node::from_impl(top->right());
+    }
+    else if(comp(x,key(top->value()))){
+      y=top;
+      s-=ranked_node_size(y->right())+1;
+      top=Node::from_impl(top->left());
+    }
+    else{
+      return std::pair<size_type,size_type>(
+        (size_type)(s-top->impl()->size+
+          ranked_index_lower_bound_rank(
+           Node::from_impl(top->left()),top,key,x,comp,std::false_type())),
+        (size_type)(s-ranked_node_size(top->right())+
+          ranked_index_upper_bound_rank(
+            Node::from_impl(top->right()),y,key,x,comp,std::false_type())));
+    }
+  }while(top);
+
+  return std::pair<size_type,size_type>(s,s);
+}
+
+} /* namespace multi_index::detail */
+
+} /* namespace multi_index */
+
+} /* namespace boost */
+
+#endif