forked from boostorg/utility
Compare commits
14 Commits
develop
...
svn-branch
| Author | SHA1 | Date | |
|---|---|---|---|
|
e562407477 | ||
|
|
9a7dd70d01 | ||
|
|
b8509c8984 | ||
|
|
e8e82802ba | ||
|
|
dc46ee91ec | ||
|
|
bbda7fbb66 | ||
|
|
1d444c54c2 | ||
|
|
a8f69eaa2f | ||
|
|
913ed354d7 | ||
|
|
8bd61e0732 | ||
|
|
f3a63fab3b | ||
|
|
4ca0c3b7c2 | ||
|
|
506e697b6a | ||
|
|
e1b806d418 |
429
.github/workflows/ci.yml
vendored
429
.github/workflows/ci.yml
vendored
@@ -1,429 +0,0 @@
|
|||||||
# Copyright 2021 Andrey Semashev
|
|
||||||
#
|
|
||||||
# Distributed under the Boost Software License, Version 1.0.
|
|
||||||
# (See accompanying file LICENSE_1_0.txt or copy at http://boost.org/LICENSE_1_0.txt)
|
|
||||||
|
|
||||||
name: CI
|
|
||||||
|
|
||||||
on:
|
|
||||||
pull_request:
|
|
||||||
push:
|
|
||||||
branches:
|
|
||||||
- master
|
|
||||||
- develop
|
|
||||||
- feature/**
|
|
||||||
|
|
||||||
concurrency:
|
|
||||||
group: ${{format('{0}:{1}', github.repository, github.ref)}}
|
|
||||||
cancel-in-progress: true
|
|
||||||
|
|
||||||
env:
|
|
||||||
GIT_FETCH_JOBS: 8
|
|
||||||
NET_RETRY_COUNT: 5
|
|
||||||
DEFAULT_BUILD_VARIANT: debug,release
|
|
||||||
|
|
||||||
jobs:
|
|
||||||
posix:
|
|
||||||
defaults:
|
|
||||||
run:
|
|
||||||
shell: bash
|
|
||||||
|
|
||||||
strategy:
|
|
||||||
fail-fast: false
|
|
||||||
matrix:
|
|
||||||
include:
|
|
||||||
# Linux, gcc
|
|
||||||
- toolset: gcc-4.4
|
|
||||||
cxxstd: "98,0x"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- g++-4.4
|
|
||||||
sources:
|
|
||||||
- "ppa:ubuntu-toolchain-r/test"
|
|
||||||
- toolset: gcc-4.6
|
|
||||||
cxxstd: "03,0x"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- g++-4.6
|
|
||||||
sources:
|
|
||||||
- "ppa:ubuntu-toolchain-r/test"
|
|
||||||
- toolset: gcc-4.7
|
|
||||||
cxxstd: "03,11"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- g++-4.7
|
|
||||||
- toolset: gcc-4.8
|
|
||||||
cxxstd: "03,11"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- g++-4.8
|
|
||||||
- toolset: gcc-4.9
|
|
||||||
cxxstd: "03,11"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- g++-4.9
|
|
||||||
- toolset: gcc-5
|
|
||||||
cxxstd: "03,11,14,1z"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- g++-5
|
|
||||||
- toolset: gcc-6
|
|
||||||
cxxstd: "03,11,14,1z"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- g++-6
|
|
||||||
- toolset: gcc-7
|
|
||||||
cxxstd: "03,11,14,17"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- g++-7
|
|
||||||
- toolset: gcc-8
|
|
||||||
cxxstd: "03,11,14,17,2a"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- g++-8
|
|
||||||
- toolset: gcc-9
|
|
||||||
cxxstd: "03,11,14,17,2a"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- g++-9
|
|
||||||
- toolset: gcc-10
|
|
||||||
cxxstd: "03,11,14,17,20"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- g++-10
|
|
||||||
- toolset: gcc-11
|
|
||||||
cxxstd: "03,11,14,17,20"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- g++-11
|
|
||||||
sources:
|
|
||||||
- "ppa:ubuntu-toolchain-r/test"
|
|
||||||
- name: UBSAN
|
|
||||||
toolset: gcc-11
|
|
||||||
cxxstd: "03,11,14,17,20"
|
|
||||||
ubsan: 1
|
|
||||||
build_variant: debug
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- g++-11
|
|
||||||
sources:
|
|
||||||
- "ppa:ubuntu-toolchain-r/test"
|
|
||||||
|
|
||||||
# Linux, clang
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-3.5
|
|
||||||
cxxstd: "03,11"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- clang-3.5
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-3.6
|
|
||||||
cxxstd: "03,11,14"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- clang-3.6
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-3.7
|
|
||||||
cxxstd: "03,11,14"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- clang-3.7
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-3.8
|
|
||||||
cxxstd: "03,11,14"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
container: ubuntu:16.04
|
|
||||||
install:
|
|
||||||
- clang-3.8
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-3.9
|
|
||||||
cxxstd: "03,11,14"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- clang-3.9
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-4.0
|
|
||||||
cxxstd: "03,11,14"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- clang-4.0
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-5.0
|
|
||||||
cxxstd: "03,11,14,1z"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- clang-5.0
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-6.0
|
|
||||||
cxxstd: "03,11,14,17"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- clang-6.0
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-7
|
|
||||||
cxxstd: "03,11,14,17"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- clang-7
|
|
||||||
# Note: clang-8 does not fully support C++20, so it is not compatible with libstdc++-8 in this mode
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-8
|
|
||||||
cxxstd: "03,11,14,17,2a"
|
|
||||||
os: ubuntu-18.04
|
|
||||||
install:
|
|
||||||
- clang-8
|
|
||||||
- g++-7
|
|
||||||
gcc_toolchain: 7
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-9
|
|
||||||
cxxstd: "03,11,14,17,2a"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- clang-9
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-10
|
|
||||||
cxxstd: "03,11,14,17,20"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- clang-10
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-11
|
|
||||||
cxxstd: "03,11,14,17,20"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- clang-11
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-12
|
|
||||||
cxxstd: "03,11,14,17,20"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- clang-12
|
|
||||||
- toolset: clang
|
|
||||||
compiler: clang++-12
|
|
||||||
cxxstd: "03,11,14,17,20"
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- clang-12
|
|
||||||
- libc++-12-dev
|
|
||||||
- libc++abi-12-dev
|
|
||||||
cxxflags: -stdlib=libc++
|
|
||||||
linkflags: -stdlib=libc++
|
|
||||||
- name: UBSAN
|
|
||||||
toolset: clang
|
|
||||||
compiler: clang++-12
|
|
||||||
cxxstd: "03,11,14,17,20"
|
|
||||||
cxxflags: -stdlib=libc++
|
|
||||||
linkflags: -stdlib=libc++
|
|
||||||
ubsan: 1
|
|
||||||
build_variant: debug
|
|
||||||
os: ubuntu-20.04
|
|
||||||
install:
|
|
||||||
- clang-12
|
|
||||||
- libc++-12-dev
|
|
||||||
- libc++abi-12-dev
|
|
||||||
|
|
||||||
- toolset: clang
|
|
||||||
cxxstd: "03,11,14,17,2a"
|
|
||||||
os: macos-10.15
|
|
||||||
|
|
||||||
timeout-minutes: 60
|
|
||||||
runs-on: ${{matrix.os}}
|
|
||||||
container: ${{matrix.container}}
|
|
||||||
|
|
||||||
steps:
|
|
||||||
- name: Setup environment
|
|
||||||
run: |
|
|
||||||
if [ -f "/etc/debian_version" ]
|
|
||||||
then
|
|
||||||
echo "DEBIAN_FRONTEND=noninteractive" >> $GITHUB_ENV
|
|
||||||
export DEBIAN_FRONTEND=noninteractive
|
|
||||||
fi
|
|
||||||
if [ -n "${{matrix.container}}" ]
|
|
||||||
then
|
|
||||||
echo "GHA_CONTAINER=${{matrix.container}}" >> $GITHUB_ENV
|
|
||||||
if [ -f "/etc/debian_version" ]
|
|
||||||
then
|
|
||||||
apt-get -o Acquire::Retries=$NET_RETRY_COUNT update
|
|
||||||
apt-get -o Acquire::Retries=$NET_RETRY_COUNT install -y sudo software-properties-common tzdata wget curl apt-transport-https ca-certificates make build-essential g++ python python3 perl git cmake
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
git config --global pack.threads 0
|
|
||||||
|
|
||||||
- uses: actions/checkout@v2
|
|
||||||
|
|
||||||
- name: Install packages
|
|
||||||
if: matrix.install
|
|
||||||
run: |
|
|
||||||
declare -a SOURCE_KEYS SOURCES
|
|
||||||
if [ -n "${{join(matrix.source_keys, ' ')}}" ]
|
|
||||||
then
|
|
||||||
SOURCE_KEYS=("${{join(matrix.source_keys, '" "')}}")
|
|
||||||
fi
|
|
||||||
if [ -n "${{join(matrix.sources, ' ')}}" ]
|
|
||||||
then
|
|
||||||
SOURCES=("${{join(matrix.sources, '" "')}}")
|
|
||||||
fi
|
|
||||||
for key in "${SOURCE_KEYS[@]}"
|
|
||||||
do
|
|
||||||
for i in {1..$NET_RETRY_COUNT}
|
|
||||||
do
|
|
||||||
echo "Adding key: $key"
|
|
||||||
wget -O - "$key" | sudo apt-key add - && break || sleep 2
|
|
||||||
done
|
|
||||||
done
|
|
||||||
if [ ${#SOURCES[@]} -gt 0 ]
|
|
||||||
then
|
|
||||||
APT_ADD_REPO_COMMON_ARGS=("-y")
|
|
||||||
APT_ADD_REPO_SUPPORTED_ARGS="$(apt-add-repository --help | perl -ne 'if (/^\s*-n/) { print "n"; } elsif (/^\s*-P/) { print "P"; } elsif (/^\s*-S/) { print "S"; } elsif (/^\s*-U/) { print "U"; }')"
|
|
||||||
if [ -n "$APT_ADD_REPO_SUPPORTED_ARGS" -a -z "${APT_ADD_REPO_SUPPORTED_ARGS##*n*}" ]
|
|
||||||
then
|
|
||||||
APT_ADD_REPO_COMMON_ARGS+=("-n")
|
|
||||||
fi
|
|
||||||
APT_ADD_REPO_HAS_SOURCE_ARGS="$([ -n "$APT_ADD_REPO_SUPPORTED_ARGS" -a -z "${APT_ADD_REPO_SUPPORTED_ARGS##*P*}" -a -z "${APT_ADD_REPO_SUPPORTED_ARGS##*S*}" -a -z "${APT_ADD_REPO_SUPPORTED_ARGS##*U*}" ] && echo 1 || echo 0)"
|
|
||||||
for source in "${SOURCES[@]}"
|
|
||||||
do
|
|
||||||
for i in {1..$NET_RETRY_COUNT}
|
|
||||||
do
|
|
||||||
APT_ADD_REPO_ARGS=("${APT_ADD_REPO_COMMON_ARGS[@]}")
|
|
||||||
if [ $APT_ADD_REPO_HAS_SOURCE_ARGS -ne 0 ]
|
|
||||||
then
|
|
||||||
case "$source" in
|
|
||||||
"ppa:"*)
|
|
||||||
APT_ADD_REPO_ARGS+=("-P")
|
|
||||||
;;
|
|
||||||
"deb "*)
|
|
||||||
APT_ADD_REPO_ARGS+=("-S")
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
APT_ADD_REPO_ARGS+=("-U")
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
APT_ADD_REPO_ARGS+=("$source")
|
|
||||||
echo "apt-add-repository ${APT_ADD_REPO_ARGS[@]}"
|
|
||||||
sudo -E apt-add-repository "${APT_ADD_REPO_ARGS[@]}" && break || sleep 2
|
|
||||||
done
|
|
||||||
done
|
|
||||||
fi
|
|
||||||
sudo apt-get -o Acquire::Retries=$NET_RETRY_COUNT update
|
|
||||||
sudo apt-get -o Acquire::Retries=$NET_RETRY_COUNT install -y ${{join(matrix.install, ' ')}}
|
|
||||||
|
|
||||||
- name: Setup GCC Toolchain
|
|
||||||
if: matrix.gcc_toolchain
|
|
||||||
run: |
|
|
||||||
GCC_TOOLCHAIN_ROOT="$HOME/gcc-toolchain"
|
|
||||||
echo "GCC_TOOLCHAIN_ROOT=\"$GCC_TOOLCHAIN_ROOT\"" >> $GITHUB_ENV
|
|
||||||
MULTIARCH_TRIPLET="$(dpkg-architecture -qDEB_HOST_MULTIARCH)"
|
|
||||||
mkdir -p "$GCC_TOOLCHAIN_ROOT"
|
|
||||||
ln -s /usr/include "$GCC_TOOLCHAIN_ROOT/include"
|
|
||||||
ln -s /usr/bin "$GCC_TOOLCHAIN_ROOT/bin"
|
|
||||||
mkdir -p "$GCC_TOOLCHAIN_ROOT/lib/gcc/$MULTIARCH_TRIPLET"
|
|
||||||
ln -s "/usr/lib/gcc/$MULTIARCH_TRIPLET/${{matrix.gcc_toolchain}}" "$GCC_TOOLCHAIN_ROOT/lib/gcc/$MULTIARCH_TRIPLET/${{matrix.gcc_toolchain}}"
|
|
||||||
|
|
||||||
- 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
|
|
||||||
BUILD_JOBS=$((nproc || sysctl -n hw.ncpu) 2> /dev/null)
|
|
||||||
echo "BUILD_JOBS=$BUILD_JOBS" >> $GITHUB_ENV
|
|
||||||
echo "CMAKE_BUILD_PARALLEL_LEVEL=$BUILD_JOBS" >> $GITHUB_ENV
|
|
||||||
DEPINST_ARGS=()
|
|
||||||
GIT_VERSION="$(git --version | sed -e 's/git version //')"
|
|
||||||
GIT_HAS_JOBS=1
|
|
||||||
if [ -f "/etc/debian_version" ]
|
|
||||||
then
|
|
||||||
if $(dpkg --compare-versions "$GIT_VERSION" lt 2.8.0)
|
|
||||||
then
|
|
||||||
GIT_HAS_JOBS=0
|
|
||||||
fi
|
|
||||||
else
|
|
||||||
declare -a GIT_VER=(${GIT_VERSION//./ })
|
|
||||||
declare -a GIT_MIN_VER=(2 8 0)
|
|
||||||
for ((i=0; i<${#GIT_VER[@]}; i++))
|
|
||||||
do
|
|
||||||
if [ -z "${GIT_MIN_VER[i]}" ]
|
|
||||||
then
|
|
||||||
GIT_MIN_VER[i]=0
|
|
||||||
fi
|
|
||||||
if [ "${GIT_VER[i]}" -lt "${GIT_MIN_VER[i]}" ]
|
|
||||||
then
|
|
||||||
GIT_HAS_JOBS=0
|
|
||||||
break
|
|
||||||
fi
|
|
||||||
done
|
|
||||||
fi
|
|
||||||
if [ "$GIT_HAS_JOBS" -ne 0 ]
|
|
||||||
then
|
|
||||||
DEPINST_ARGS+=("--git_args" "--jobs $GIT_FETCH_JOBS")
|
|
||||||
fi
|
|
||||||
cd ..
|
|
||||||
git clone -b "$BOOST_BRANCH" --depth 1 "https://github.com/boostorg/boost.git" "boost-root"
|
|
||||||
cd boost-root
|
|
||||||
mkdir -p libs/$LIBRARY
|
|
||||||
cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
|
|
||||||
git submodule update --init tools/boostdep
|
|
||||||
DEPINST_ARGS+=("$LIBRARY")
|
|
||||||
python tools/boostdep/depinst/depinst.py "${DEPINST_ARGS[@]}"
|
|
||||||
if [ -z "${{matrix.cmake_tests}}" ]
|
|
||||||
then
|
|
||||||
./bootstrap.sh
|
|
||||||
./b2 headers
|
|
||||||
if [ -n "${{matrix.compiler}}" -o -n "$GCC_TOOLCHAIN_ROOT" ]
|
|
||||||
then
|
|
||||||
echo -n "using ${{matrix.toolset}} : : ${{matrix.compiler}}" > ~/user-config.jam
|
|
||||||
if [ -n "$GCC_TOOLCHAIN_ROOT" ]
|
|
||||||
then
|
|
||||||
echo -n " : <compileflags>\"--gcc-toolchain=$GCC_TOOLCHAIN_ROOT\" <linkflags>\"--gcc-toolchain=$GCC_TOOLCHAIN_ROOT\"" >> ~/user-config.jam
|
|
||||||
fi
|
|
||||||
echo " ;" >> ~/user-config.jam
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
|
|
||||||
- name: Run tests
|
|
||||||
if: matrix.cmake_tests == ''
|
|
||||||
run: |
|
|
||||||
cd ../boost-root
|
|
||||||
B2_ARGS=("-j" "$BUILD_JOBS" "toolset=${{matrix.toolset}}" "cxxstd=${{matrix.cxxstd}}")
|
|
||||||
if [ -n "${{matrix.build_variant}}" ]
|
|
||||||
then
|
|
||||||
B2_ARGS+=("variant=${{matrix.build_variant}}")
|
|
||||||
else
|
|
||||||
B2_ARGS+=("variant=$DEFAULT_BUILD_VARIANT")
|
|
||||||
fi
|
|
||||||
if [ -n "${{matrix.threading}}" ]
|
|
||||||
then
|
|
||||||
B2_ARGS+=("threading=${{matrix.threading}}")
|
|
||||||
fi
|
|
||||||
if [ -n "${{matrix.ubsan}}" ]
|
|
||||||
then
|
|
||||||
export UBSAN_OPTIONS="print_stacktrace=1"
|
|
||||||
B2_ARGS+=("cxxflags=-fsanitize=undefined -fno-sanitize-recover=undefined" "linkflags=-fsanitize=undefined -fuse-ld=gold" "define=UBSAN=1" "debug-symbols=on" "visibility=global")
|
|
||||||
fi
|
|
||||||
if [ -n "${{matrix.cxxflags}}" ]
|
|
||||||
then
|
|
||||||
B2_ARGS+=("cxxflags=${{matrix.cxxflags}}")
|
|
||||||
fi
|
|
||||||
if [ -n "${{matrix.linkflags}}" ]
|
|
||||||
then
|
|
||||||
B2_ARGS+=("linkflags=${{matrix.linkflags}}")
|
|
||||||
fi
|
|
||||||
B2_ARGS+=("libs/$LIBRARY/test")
|
|
||||||
./b2 "${B2_ARGS[@]}"
|
|
||||||
116
Assignable.html
116
Assignable.html
@@ -1,19 +1,109 @@
|
|||||||
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||||||
|
|
||||||
<html>
|
<html>
|
||||||
<head>
|
<head>
|
||||||
<title>Boost.Utility</title>
|
<meta http-equiv="Content-Language" content="en-us">
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
|
||||||
|
|
||||||
|
<title>Assignable</title>
|
||||||
</head>
|
</head>
|
||||||
<body>
|
|
||||||
Automatic redirection failed, please go to
|
<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
|
||||||
<a href="./doc/html/index.html">./doc/html/index.html</a>
|
"#FF0000">
|
||||||
|
<img src="../../boost.png" alt="C++ Boost" width="277" height=
|
||||||
|
"86"><br clear="none">
|
||||||
|
|
||||||
|
<h1>Assignable</h1>
|
||||||
|
|
||||||
|
<h3>Description</h3>
|
||||||
|
|
||||||
|
<p>A type is Assignable if it is possible to assign one object of the type
|
||||||
|
to another object of that type.</p>
|
||||||
|
|
||||||
|
<h3>Notation</h3>
|
||||||
|
|
||||||
|
<table summary="">
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>T</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">is type that is a model of Assignable</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>t</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">is an object of type <tt>T</tt></td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>u</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">is an object of type <tt>T</tt> or possibly <tt>const
|
||||||
|
T</tt></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Definitions</h3>
|
||||||
|
|
||||||
|
<h3>Valid expressions</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Return type</th>
|
||||||
|
|
||||||
|
<th>Semantics</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Assignment</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>t = u</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>T&</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>t</tt> is equivalent to <tt>u</tt></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Models</h3>
|
||||||
|
|
||||||
|
<ul>
|
||||||
|
<li><tt>int</tt></li>
|
||||||
|
|
||||||
|
<li><tt>std::pair</tt></li>
|
||||||
|
</ul>
|
||||||
|
|
||||||
|
<h3>See also</h3>
|
||||||
|
|
||||||
|
<p><a href=
|
||||||
|
"http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>
|
||||||
|
and <a href="./CopyConstructible.html">CopyConstructible</a><br></p>
|
||||||
<hr>
|
<hr>
|
||||||
<tt>
|
|
||||||
Boost.Utility<br>
|
<p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
|
||||||
<br>
|
"http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
height="31" width="88"></a></p>
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
<p>Revised
|
||||||
<br>
|
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
|
||||||
</tt>
|
|
||||||
|
<table summary="">
|
||||||
|
<tr valign="top">
|
||||||
|
<td nowrap><i>Copyright © 2000</i></td>
|
||||||
|
|
||||||
|
<td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
|
||||||
|
Notre Dame (<a href=
|
||||||
|
"mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p><i>Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
|
||||||
|
copy at <a href=
|
||||||
|
"http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
|
|||||||
@@ -1,24 +0,0 @@
|
|||||||
# Copyright 2018 Peter Dimov
|
|
||||||
# Copyright 2018 Andrey Semashev
|
|
||||||
# Distributed under the Boost Software License, Version 1.0.
|
|
||||||
# See accompanying file LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt
|
|
||||||
|
|
||||||
cmake_minimum_required(VERSION 3.5...3.20)
|
|
||||||
|
|
||||||
project(boost_utility VERSION "${BOOST_SUPERPROJECT_VERSION}" LANGUAGES CXX)
|
|
||||||
|
|
||||||
add_library(boost_utility INTERFACE)
|
|
||||||
add_library(Boost::utility ALIAS boost_utility)
|
|
||||||
|
|
||||||
target_include_directories(boost_utility INTERFACE include)
|
|
||||||
|
|
||||||
target_link_libraries(boost_utility
|
|
||||||
INTERFACE
|
|
||||||
Boost::config
|
|
||||||
Boost::core
|
|
||||||
Boost::io
|
|
||||||
Boost::preprocessor
|
|
||||||
Boost::static_assert
|
|
||||||
Boost::throw_exception
|
|
||||||
Boost::type_traits
|
|
||||||
)
|
|
||||||
541
Collection.html
541
Collection.html
@@ -1,19 +1,534 @@
|
|||||||
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||||||
|
|
||||||
<html>
|
<html>
|
||||||
<head>
|
<head>
|
||||||
<title>Boost.Utility</title>
|
<meta http-equiv="Content-Language" content="en-us">
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
|
||||||
|
|
||||||
|
<title>Collection</title>
|
||||||
</head>
|
</head>
|
||||||
<body>
|
|
||||||
Automatic redirection failed, please go to
|
<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
|
||||||
<a href="./doc/html/index.html">./doc/html/index.html</a>
|
"#FF0000">
|
||||||
|
<h1><img src="../../boost.png" alt="boost logo" width="277" align="middle"
|
||||||
|
height="86"><br>
|
||||||
|
Collection</h1>
|
||||||
|
|
||||||
|
<h3>Description</h3>
|
||||||
|
|
||||||
|
<p>A Collection is a <i>concept</i> similar to the STL <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/Container.html">Container</a> concept. A
|
||||||
|
Collection provides iterators for accessing a range of elements and
|
||||||
|
provides information about the number of elements in the Collection.
|
||||||
|
However, a Collection has fewer requirements than a Container. The
|
||||||
|
motivation for the Collection concept is that there are many useful
|
||||||
|
Container-like types that do not meet the full requirements of Container,
|
||||||
|
and many algorithms that can be written with this reduced set of
|
||||||
|
requirements. To summarize the reduction in requirements:</p>
|
||||||
|
|
||||||
|
<ul>
|
||||||
|
<li>It is not required to "own" its elements: the lifetime of an element
|
||||||
|
in a Collection does not have to match the lifetime of the Collection
|
||||||
|
object, though the lifetime of the element should cover the lifetime of
|
||||||
|
the Collection object.</li>
|
||||||
|
|
||||||
|
<li>The semantics of copying a Collection object is not defined (it could
|
||||||
|
be a deep or shallow copy or not even support copying).</li>
|
||||||
|
|
||||||
|
<li>The associated reference type of a Collection does not have to be a
|
||||||
|
real C++ reference.</li>
|
||||||
|
</ul>Because of the reduced requirements, some care must be taken when
|
||||||
|
writing code that is meant to be generic for all Collection types. In
|
||||||
|
particular, a Collection object should be passed by-reference since
|
||||||
|
assumptions can not be made about the behaviour of the copy constructor.
|
||||||
|
|
||||||
|
<h3>Associated types</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Value type</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>X::value_type</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">The type of the object stored in a Collection. If the
|
||||||
|
Collection is <i>mutable</i> then the value type must be <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>. Otherwise
|
||||||
|
the value type must be <a href=
|
||||||
|
"./CopyConstructible.html">CopyConstructible</a>.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Iterator type</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>X::iterator</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">The type of iterator used to iterate through a
|
||||||
|
Collection's elements. The iterator's value type is expected to be the
|
||||||
|
Collection's value type. A conversion from the iterator type to the
|
||||||
|
const iterator type must exist. The iterator type must be an <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Const iterator type</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>X::const_iterator</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">A type of iterator that may be used to examine, but
|
||||||
|
not to modify, a Collection's elements.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Reference type</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>X::reference</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">A type that behaves like a reference to the
|
||||||
|
Collection's value type. <a href="#n1">[1]</a></td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Const reference type</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>X::const_reference</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">A type that behaves like a const reference to the
|
||||||
|
Collection's value type.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Pointer type</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>X::pointer</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">A type that behaves as a pointer to the Collection's
|
||||||
|
value type.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Distance type</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>X::difference_type</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">A signed integral type used to represent the distance
|
||||||
|
between two of the Collection's iterators. This type must be the same
|
||||||
|
as the iterator's distance type.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Size type</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>X::size_type</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">An unsigned integral type that can represent any
|
||||||
|
nonnegative value of the Collection's distance type.</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Notation</h3>
|
||||||
|
|
||||||
|
<table summary="">
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>X</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">A type that is a model of Collection.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>a</tt>, <tt>b</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">Object of type <tt>X</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>T</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">The value type of <tt>X</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Valid expressions</h3>
|
||||||
|
|
||||||
|
<p>The following expressions must be valid.</p>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Return type</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Beginning of range</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.begin()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>iterator</tt> if <tt>a</tt> is mutable,
|
||||||
|
<tt>const_iterator</tt> otherwise</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">End of range</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.end()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>iterator</tt> if <tt>a</tt> is mutable,
|
||||||
|
<tt>const_iterator</tt> otherwise</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Size</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.size()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>size_type</tt></td>
|
||||||
|
</tr><!--
|
||||||
|
<TR>
|
||||||
|
<TD VAlign=top>
|
||||||
|
Maximum size
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top>
|
||||||
|
<tt>a.max_size()</tt>
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top>
|
||||||
|
<tt>size_type</tt>
|
||||||
|
</TD>
|
||||||
|
</TR>
|
||||||
|
-->
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Empty Collection</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.empty()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">Convertible to <tt>bool</tt></td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Swap</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.swap(b)</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>void</tt></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Expression semantics</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Semantics</th>
|
||||||
|
|
||||||
|
<th>Postcondition</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Beginning of range</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.begin()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">Returns an iterator pointing to the first element in
|
||||||
|
the Collection.</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.begin()</tt> is either dereferenceable or
|
||||||
|
past-the-end. It is past-the-end if and only if <tt>a.size() ==
|
||||||
|
0</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">End of range</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.end()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">Returns an iterator pointing one past the last element
|
||||||
|
in the Collection.</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.end()</tt> is past-the-end.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Size</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.size()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">Returns the size of the Collection, that is, its
|
||||||
|
number of elements.</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.size() >= 0</tt></td>
|
||||||
|
</tr><!--
|
||||||
|
<TR>
|
||||||
|
<TD VAlign=top>
|
||||||
|
Maximum size
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top>
|
||||||
|
<tt>a.max_size()</tt>
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top>
|
||||||
|
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top>
|
||||||
|
Returns the largest size that this Collection can ever have. <A href="#8">[8]</A>
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top>
|
||||||
|
<tt>a.max_size() >= 0 && a.max_size() >= a.size()</tt>
|
||||||
|
</TD>
|
||||||
|
</TR>
|
||||||
|
-->
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Empty Collection</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.empty()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">Equivalent to <tt>a.size() == 0</tt>. (But possibly
|
||||||
|
faster.)</td>
|
||||||
|
|
||||||
|
<td valign="top"> </td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Swap</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.swap(b)</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">Equivalent to <tt>swap(a,b)</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"> </td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Complexity guarantees</h3>
|
||||||
|
|
||||||
|
<p><tt>begin()</tt> and <tt>end()</tt> are amortized constant time.</p>
|
||||||
|
|
||||||
|
<p><tt>size()</tt> is at most linear in the Collection's size.
|
||||||
|
<tt>empty()</tt> is amortized constant time.</p>
|
||||||
|
|
||||||
|
<p><tt>swap()</tt> is at most linear in the size of the two
|
||||||
|
collections.</p>
|
||||||
|
|
||||||
|
<h3>Invariants</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Valid range</td>
|
||||||
|
|
||||||
|
<td valign="top">For any Collection <tt>a</tt>, <tt>[a.begin(),
|
||||||
|
a.end())</tt> is a valid range.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Range size</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.size()</tt> is equal to the distance from
|
||||||
|
<tt>a.begin()</tt> to <tt>a.end()</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Completeness</td>
|
||||||
|
|
||||||
|
<td valign="top">An algorithm that iterates through the range
|
||||||
|
<tt>[a.begin(), a.end())</tt> will pass through every element of
|
||||||
|
<tt>a</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Models</h3>
|
||||||
|
|
||||||
|
<ul>
|
||||||
|
<li><tt>array</tt></li>
|
||||||
|
|
||||||
|
<li><tt>array_ptr</tt></li>
|
||||||
|
|
||||||
|
<li><tt>vector<bool></tt></li>
|
||||||
|
</ul>
|
||||||
|
|
||||||
|
<h3>Collection Refinements</h3>
|
||||||
|
|
||||||
|
<p>There are quite a few concepts that refine the Collection concept,
|
||||||
|
similar to the concepts that refine the Container concept. Here is a brief
|
||||||
|
overview of the refining concepts.</p>
|
||||||
|
|
||||||
|
<h4>ForwardCollection</h4>
|
||||||
|
|
||||||
|
<p>The elements are arranged in some order that does not change
|
||||||
|
spontaneously from one iteration to the next. As a result, a
|
||||||
|
ForwardCollection is <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</a>
|
||||||
|
and <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/LessThanComparable.html">LessThanComparable</a>.
|
||||||
|
In addition, the iterator type of a ForwardCollection is a
|
||||||
|
MultiPassInputIterator which is just an InputIterator with the added
|
||||||
|
requirements that the iterator can be used to make multiple passes through
|
||||||
|
a range, and that if <tt>it1 == it2</tt> and <tt>it1</tt> is
|
||||||
|
dereferenceable then <tt>++it1 == ++it2</tt>. The ForwardCollection also
|
||||||
|
has a <tt>front()</tt> method.</p>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Return type</th>
|
||||||
|
|
||||||
|
<th>Semantics</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Front</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.front()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,<br>
|
||||||
|
<tt>const_reference</tt> otherwise.</td>
|
||||||
|
|
||||||
|
<td valign="top">Equivalent to <tt>*(a.begin())</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h4>ReversibleCollection</h4>
|
||||||
|
|
||||||
|
<p>The container provides access to iterators that traverse in both
|
||||||
|
directions (forward and reverse). The iterator type must meet all of the
|
||||||
|
requirements of <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/BidirectionalIterator.html">BidirectionalIterator</a>
|
||||||
|
except that the reference type does not have to be a real C++ reference.
|
||||||
|
The ReversibleCollection adds the following requirements to those of
|
||||||
|
ForwardCollection.</p>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Return type</th>
|
||||||
|
|
||||||
|
<th>Semantics</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Beginning of range</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.rbegin()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>reverse_iterator</tt> if <tt>a</tt> is mutable,
|
||||||
|
<tt>const_reverse_iterator</tt> otherwise.</td>
|
||||||
|
|
||||||
|
<td valign="top">Equivalent to
|
||||||
|
<tt>X::reverse_iterator(a.end())</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">End of range</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.rend()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>reverse_iterator</tt> if <tt>a</tt> is mutable,
|
||||||
|
<tt>const_reverse_iterator</tt> otherwise.</td>
|
||||||
|
|
||||||
|
<td valign="top">Equivalent to
|
||||||
|
<tt>X::reverse_iterator(a.begin())</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Back</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a.back()</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,<br>
|
||||||
|
<tt>const_reference</tt> otherwise.</td>
|
||||||
|
|
||||||
|
<td valign="top">Equivalent to <tt>*(--a.end())</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h4>SequentialCollection</h4>
|
||||||
|
|
||||||
|
<p>The elements are arranged in a strict linear order. No extra methods are
|
||||||
|
required.</p>
|
||||||
|
|
||||||
|
<h4>RandomAccessCollection</h4>
|
||||||
|
|
||||||
|
<p>The iterators of a RandomAccessCollection satisfy all of the
|
||||||
|
requirements of <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/RandomAccessIterator.html">RandomAccessIterator</a>
|
||||||
|
except that the reference type does not have to be a real C++ reference. In
|
||||||
|
addition, a RandomAccessCollection provides an element access operator.</p>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Return type</th>
|
||||||
|
|
||||||
|
<th>Semantics</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Element Access</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>a[n]</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,
|
||||||
|
<tt>const_reference</tt> otherwise.</td>
|
||||||
|
|
||||||
|
<td valign="top">Returns the nth element of the Collection. <tt>n</tt>
|
||||||
|
must be convertible to <tt>size_type</tt>. Precondition: <tt>0 <= n
|
||||||
|
< a.size()</tt>.</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Notes</h3>
|
||||||
|
|
||||||
|
<p><a name="n1" id="n1">[1]</a> The reference type does not have to be a
|
||||||
|
real C++ reference. The requirements of the reference type depend on the
|
||||||
|
context within which the Collection is being used. Specifically it depends
|
||||||
|
on the requirements the context places on the value type of the Collection.
|
||||||
|
The reference type of the Collection must meet the same requirements as the
|
||||||
|
value type. In addition, the reference objects must be equivalent to the
|
||||||
|
value type objects in the collection (which is trivially true if they are
|
||||||
|
the same object). Also, in a mutable Collection, an assignment to the
|
||||||
|
reference object must result in an assignment to the object in the
|
||||||
|
Collection (again, which is trivially true if they are the same object, but
|
||||||
|
non-trivial if the reference type is a proxy class).</p>
|
||||||
|
|
||||||
|
<h3>See also</h3>
|
||||||
|
|
||||||
|
<p><a href=
|
||||||
|
"http://www.sgi.com/tech/stl/Container.html">Container</a><br></p>
|
||||||
<hr>
|
<hr>
|
||||||
<tt>
|
|
||||||
Boost.Utility<br>
|
<p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
|
||||||
<br>
|
"http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
height="31" width="88"></a></p>
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
<p>Revised
|
||||||
<br>
|
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
|
||||||
</tt>
|
December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
|
||||||
|
|
||||||
|
<table summary="">
|
||||||
|
<tr valign="top">
|
||||||
|
<td nowrap><i>Copyright © 2000</i></td>
|
||||||
|
|
||||||
|
<td><i><a href="http://www.boost.org/people/jeremy_siek.htm">Jeremy
|
||||||
|
Siek</a>, Univ.of Notre Dame and C++ Library & Compiler Group/SGI
|
||||||
|
(<a href="mailto:jsiek@engr.sgi.com">jsiek@engr.sgi.com</a>)</i></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p><i>Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
|
||||||
|
copy at <a href=
|
||||||
|
"http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
|
|||||||
@@ -1,19 +1,185 @@
|
|||||||
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||||||
|
|
||||||
<html>
|
<html>
|
||||||
<head>
|
<head>
|
||||||
<title>Boost.Utility</title>
|
<meta http-equiv="Content-Language" content="en-us">
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
|
||||||
|
|
||||||
|
<title>Copy Constructible</title>
|
||||||
</head>
|
</head>
|
||||||
<body>
|
|
||||||
Automatic redirection failed, please go to
|
<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
|
||||||
<a href="./doc/html/index.html">./doc/html/index.html</a>
|
"#FF0000">
|
||||||
|
<img src="../../boost.png" alt="C++ Boost" width="277" height=
|
||||||
|
"86"><br clear="none">
|
||||||
|
|
||||||
|
<h1>Copy Constructible</h1>
|
||||||
|
|
||||||
|
<h3>Description</h3>
|
||||||
|
|
||||||
|
<p>A type is Copy Constructible if it is possible to copy objects of that
|
||||||
|
type.</p>
|
||||||
|
|
||||||
|
<h3>Notation</h3>
|
||||||
|
|
||||||
|
<table summary="">
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>T</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">is type that is a model of Copy Constructible</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>t</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">is an object of type <tt>T</tt></td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>u</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">is an object of type <tt>const T</tt></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Definitions</h3>
|
||||||
|
|
||||||
|
<h3>Valid expressions</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Return type</th>
|
||||||
|
|
||||||
|
<th>Semantics</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Copy constructor</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>T(t)</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>T</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>t</tt> is equivalent to <tt>T(t)</tt></td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Copy constructor</td>
|
||||||
|
|
||||||
|
<td valign="top">
|
||||||
|
<pre>
|
||||||
|
T(u)
|
||||||
|
</pre>
|
||||||
|
</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>T</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>u</tt> is equivalent to <tt>T(u)</tt></td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Destructor</td>
|
||||||
|
|
||||||
|
<td valign="top">
|
||||||
|
<pre>
|
||||||
|
t.~T()
|
||||||
|
</pre>
|
||||||
|
</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>T</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"> </td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Address Operator</td>
|
||||||
|
|
||||||
|
<td valign="top">
|
||||||
|
<pre>
|
||||||
|
&t
|
||||||
|
</pre>
|
||||||
|
</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>T*</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">denotes the address of <tt>t</tt></td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Address Operator</td>
|
||||||
|
|
||||||
|
<td valign="top">
|
||||||
|
<pre>
|
||||||
|
&u
|
||||||
|
</pre>
|
||||||
|
</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>T*</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">denotes the address of <tt>u</tt></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Models</h3>
|
||||||
|
|
||||||
|
<ul>
|
||||||
|
<li><tt>int</tt></li>
|
||||||
|
|
||||||
|
<li><tt>std::pair</tt></li>
|
||||||
|
</ul>
|
||||||
|
|
||||||
|
<h3>Concept Checking Class</h3>
|
||||||
|
<pre>
|
||||||
|
template <class T>
|
||||||
|
struct CopyConstructibleConcept
|
||||||
|
{
|
||||||
|
void constraints() {
|
||||||
|
T a(b); // require copy constructor
|
||||||
|
T* ptr = &a; // require address of operator
|
||||||
|
const_constraints(a);
|
||||||
|
ignore_unused_variable_warning(ptr);
|
||||||
|
}
|
||||||
|
void const_constraints(const T& a) {
|
||||||
|
T c(a); // require const copy constructor
|
||||||
|
const T* ptr = &a; // require const address of operator
|
||||||
|
ignore_unused_variable_warning(c);
|
||||||
|
ignore_unused_variable_warning(ptr);
|
||||||
|
}
|
||||||
|
T b;
|
||||||
|
};
|
||||||
|
</pre>
|
||||||
|
|
||||||
|
<h3>See also</h3>
|
||||||
|
|
||||||
|
<p><a href="http://www.sgi.com/tech/stl/DefaultConstructible.html">Default
|
||||||
|
Constructible</a> and <a href="./Assignable.html">Assignable</a><br></p>
|
||||||
<hr>
|
<hr>
|
||||||
<tt>
|
|
||||||
Boost.Utility<br>
|
<p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
|
||||||
<br>
|
"http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
height="31" width="88"></a></p>
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
<p>Revised
|
||||||
<br>
|
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
|
||||||
</tt>
|
December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
|
||||||
|
|
||||||
|
<table summary="">
|
||||||
|
<tr valign="top">
|
||||||
|
<td nowrap><i>Copyright © 2000</i></td>
|
||||||
|
|
||||||
|
<td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
|
||||||
|
Notre Dame (<a href=
|
||||||
|
"mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p><i>Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
|
||||||
|
copy at <a href=
|
||||||
|
"http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
|
|||||||
@@ -1,19 +1,210 @@
|
|||||||
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||||||
|
|
||||||
<html>
|
<html>
|
||||||
|
<!--
|
||||||
|
== Copyright (c) 1996-1999
|
||||||
|
== Silicon Graphics Computer Systems, Inc.
|
||||||
|
==
|
||||||
|
== Permission to use, copy, modify, distribute and sell this software
|
||||||
|
== and its documentation for any purpose is hereby granted without fee,
|
||||||
|
== provided that the above copyright notice appears in all copies and
|
||||||
|
== that both that copyright notice and this permission notice appear
|
||||||
|
== in supporting documentation. Silicon Graphics makes no
|
||||||
|
== representations about the suitability of this software for any
|
||||||
|
== purpose. It is provided "as is" without express or implied warranty.
|
||||||
|
==
|
||||||
|
== Copyright (c) 1994
|
||||||
|
== Hewlett-Packard Company
|
||||||
|
==
|
||||||
|
== Permission to use, copy, modify, distribute and sell this software
|
||||||
|
== and its documentation for any purpose is hereby granted without fee,
|
||||||
|
== provided that the above copyright notice appears in all copies and
|
||||||
|
== that both that copyright notice and this permission notice appear
|
||||||
|
== in supporting documentation. Hewlett-Packard Company makes no
|
||||||
|
== representations about the suitability of this software for any
|
||||||
|
== purpose. It is provided "as is" without express or implied warranty.
|
||||||
|
==
|
||||||
|
-->
|
||||||
|
|
||||||
<head>
|
<head>
|
||||||
<title>Boost.Utility</title>
|
<meta http-equiv="Content-Language" content="en-us">
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
|
||||||
|
|
||||||
|
<title>LessThanComparable</title>
|
||||||
</head>
|
</head>
|
||||||
<body>
|
|
||||||
Automatic redirection failed, please go to
|
<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
|
||||||
<a href="./doc/html/index.html">./doc/html/index.html</a>
|
"#FF0000">
|
||||||
|
<img src="../../boost.png" alt="C++ Boost" width="277" height=
|
||||||
|
"86"><br clear="none">
|
||||||
|
|
||||||
|
<h1>LessThanComparable</h1>
|
||||||
|
|
||||||
|
<h3>Description</h3>
|
||||||
|
|
||||||
|
<p>A type is LessThanComparable if it is ordered: it must be possible to
|
||||||
|
compare two objects of that type using <tt>operator<</tt>, and
|
||||||
|
<tt>operator<</tt> must be a strict weak ordering relation.</p>
|
||||||
|
|
||||||
|
<h3>Refinement of</h3>
|
||||||
|
|
||||||
|
<h3>Associated types</h3>
|
||||||
|
|
||||||
|
<h3>Notation</h3>
|
||||||
|
|
||||||
|
<table summary="">
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>X</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">A type that is a model of LessThanComparable</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top"><tt>x</tt>, <tt>y</tt>, <tt>z</tt></td>
|
||||||
|
|
||||||
|
<td valign="top">Object of type <tt>X</tt></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Definitions</h3>
|
||||||
|
|
||||||
|
<p>Consider the relation <tt>!(x < y) && !(y < x)</tt>. If
|
||||||
|
this relation is transitive (that is, if <tt>!(x < y) && !(y
|
||||||
|
< x) && !(y < z) && !(z < y)</tt> implies <tt>!(x
|
||||||
|
< z) && !(z < x)</tt>), then it satisfies the mathematical
|
||||||
|
definition of an equivalence relation. In this case, <tt>operator<</tt>
|
||||||
|
is a <i>strict weak ordering</i>.</p>
|
||||||
|
|
||||||
|
<p>If <tt>operator<</tt> is a strict weak ordering, and if each
|
||||||
|
equivalence class has only a single element, then <tt>operator<</tt> is
|
||||||
|
a <i>total ordering</i>.</p>
|
||||||
|
|
||||||
|
<h3>Valid expressions</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Type requirements</th>
|
||||||
|
|
||||||
|
<th>Return type</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Less</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>x < y</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"> </td>
|
||||||
|
|
||||||
|
<td valign="top">Convertible to <tt>bool</tt></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Expression semantics</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Name</th>
|
||||||
|
|
||||||
|
<th>Expression</th>
|
||||||
|
|
||||||
|
<th>Precondition</th>
|
||||||
|
|
||||||
|
<th>Semantics</th>
|
||||||
|
|
||||||
|
<th>Postcondition</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Less</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>x < y</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>x</tt> and <tt>y</tt> are in the domain of
|
||||||
|
<tt><</tt></td>
|
||||||
|
|
||||||
|
<td valign="top"> </td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Complexity guarantees</h3>
|
||||||
|
|
||||||
|
<h3>Invariants</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Irreflexivity</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>x < x</tt> must be false.</td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Antisymmetry</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>x < y</tt> implies !(y < x) <a href=
|
||||||
|
"#n2">[2]</a></td>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td valign="top">Transitivity</td>
|
||||||
|
|
||||||
|
<td valign="top"><tt>x < y</tt> and <tt>y < z</tt> implies <tt>x
|
||||||
|
< z</tt> <a href="#n3">[3]</a></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Models</h3>
|
||||||
|
|
||||||
|
<ul>
|
||||||
|
<li>int</li>
|
||||||
|
</ul>
|
||||||
|
|
||||||
|
<h3>Notes</h3>
|
||||||
|
|
||||||
|
<p><a name="n1" id="n1">[1]</a> Only <tt>operator<</tt> is fundamental;
|
||||||
|
the other inequality operators are essentially syntactic sugar.</p>
|
||||||
|
|
||||||
|
<p><a name="n2" id="n2">[2]</a> Antisymmetry is a theorem, not an axiom: it
|
||||||
|
follows from irreflexivity and transitivity.</p>
|
||||||
|
|
||||||
|
<p><a name="n3" id="n3">[3]</a> Because of irreflexivity and transitivity,
|
||||||
|
<tt>operator<</tt> always satisfies the definition of a <i>partial
|
||||||
|
ordering</i>. The definition of a <i>strict weak ordering</i> is stricter,
|
||||||
|
and the definition of a <i>total ordering</i> is stricter still.</p>
|
||||||
|
|
||||||
|
<h3>See also</h3>
|
||||||
|
|
||||||
|
<p><a href=
|
||||||
|
"http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</a>,
|
||||||
|
<a href=
|
||||||
|
"http://www.sgi.com/tech/stl/StrictWeakOrdering.html">StrictWeakOrdering</a><br>
|
||||||
|
</p>
|
||||||
<hr>
|
<hr>
|
||||||
<tt>
|
|
||||||
Boost.Utility<br>
|
<p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
|
||||||
<br>
|
"http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
height="31" width="88"></a></p>
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
<p>Revised
|
||||||
<br>
|
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
|
||||||
</tt>
|
December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
|
||||||
|
|
||||||
|
<table summary="">
|
||||||
|
<tr valign="top">
|
||||||
|
<td nowrap><i>Copyright © 2000</i></td>
|
||||||
|
|
||||||
|
<td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
|
||||||
|
Notre Dame (<a href=
|
||||||
|
"mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p><i>Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
|
||||||
|
copy at <a href=
|
||||||
|
"http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
|
|||||||
@@ -1,19 +1,95 @@
|
|||||||
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||||||
|
|
||||||
<html>
|
<html>
|
||||||
<head>
|
<head>
|
||||||
<title>Boost.Utility</title>
|
<meta http-equiv="Content-Language" content="en-us">
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
|
||||||
|
|
||||||
|
<title>MultiPassInputIterator</title>
|
||||||
</head>
|
</head>
|
||||||
<body>
|
|
||||||
Automatic redirection failed, please go to
|
<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
|
||||||
<a href="./doc/html/index.html">./doc/html/index.html</a>
|
"#FF0000">
|
||||||
|
<img src="../../boost.png" alt="C++ Boost" width="277" height=
|
||||||
|
"86"><br clear="none">
|
||||||
|
|
||||||
|
<h2><a name="concept:MultiPassInputIterator" id=
|
||||||
|
"concept:MultiPassInputIterator"></a> Multi-Pass Input Iterator</h2>
|
||||||
|
|
||||||
|
<p>This concept is a refinement of <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>, adding
|
||||||
|
the requirements that the iterator can be used to make multiple passes
|
||||||
|
through a range, and that if <tt>it1 == it2</tt> and <tt>it1</tt> is
|
||||||
|
dereferenceable then <tt>++it1 == ++it2</tt>. The Multi-Pass Input Iterator
|
||||||
|
is very similar to the <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>.
|
||||||
|
The only difference is that a <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>
|
||||||
|
requires the <tt>reference</tt> type to be <tt>value_type&</tt>,
|
||||||
|
whereas MultiPassInputIterator is like <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> in that
|
||||||
|
the <tt>reference</tt> type merely has to be convertible to
|
||||||
|
<tt>value_type</tt>.</p>
|
||||||
|
|
||||||
|
<h3>Design Notes</h3>
|
||||||
|
|
||||||
|
<p>comments by Valentin Bonnard:</p>
|
||||||
|
|
||||||
|
<p>I think that introducing Multi-Pass Input Iterator isn't the right
|
||||||
|
solution. Do you also want to define Multi-Pass Bidirectionnal Iterator and
|
||||||
|
Multi-Pass Random Access Iterator ? I don't, definitly. It only confuses
|
||||||
|
the issue. The problem lies into the existing hierarchy of iterators, which
|
||||||
|
mixes movabillity, modifiabillity and lvalue-ness, and these are clearly
|
||||||
|
independant.</p>
|
||||||
|
|
||||||
|
<p>The terms Forward, Bidirectionnal and Random Access are about
|
||||||
|
movabillity and shouldn't be used to mean anything else. In a completly
|
||||||
|
orthogonal way, iterators can be immutable, mutable, or neither. Lvalueness
|
||||||
|
of iterators is also orthogonal with immutabillity. With these clean
|
||||||
|
concepts, your Multi-Pass Input Iterator is just called a Forward
|
||||||
|
Iterator.</p>
|
||||||
|
|
||||||
|
<p>Other translations are:<br>
|
||||||
|
std::Forward Iterator -> ForwardIterator & Lvalue Iterator<br>
|
||||||
|
std::Bidirectionnal Iterator -> Bidirectionnal Iterator & Lvalue
|
||||||
|
Iterator<br>
|
||||||
|
std::Random Access Iterator -> Random Access Iterator & Lvalue
|
||||||
|
Iterator<br></p>
|
||||||
|
|
||||||
|
<p>Note that in practice the only operation not allowed on my Forward
|
||||||
|
Iterator which is allowed on std::Forward Iterator is <tt>&*it</tt>. I
|
||||||
|
think that <tt>&*</tt> is rarely needed in generic code.</p>
|
||||||
|
|
||||||
|
<p>reply by Jeremy Siek:</p>
|
||||||
|
|
||||||
|
<p>The above analysis by Valentin is right on. Of course, there is the
|
||||||
|
problem with backward compatibility. The current STL implementations are
|
||||||
|
based on the old definition of Forward Iterator. The right course of action
|
||||||
|
is to get Forward Iterator, etc. changed in the C++ standard. Once that is
|
||||||
|
done we can drop Multi-Pass Input Iterator.<br></p>
|
||||||
<hr>
|
<hr>
|
||||||
<tt>
|
|
||||||
Boost.Utility<br>
|
<p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
|
||||||
<br>
|
"http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
height="31" width="88"></a></p>
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
<p>Revised
|
||||||
<br>
|
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
|
||||||
</tt>
|
December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
|
||||||
|
|
||||||
|
<table summary="">
|
||||||
|
<tr valign="top">
|
||||||
|
<td nowrap><i>Copyright © 2000</i></td>
|
||||||
|
|
||||||
|
<td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
|
||||||
|
Notre Dame (<a href=
|
||||||
|
"mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p><i>Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
|
||||||
|
copy at <a href=
|
||||||
|
"http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
|
|||||||
@@ -1,19 +1,164 @@
|
|||||||
<html>
|
<HTML>
|
||||||
<head>
|
<Head>
|
||||||
<title>Boost.Utility</title>
|
<Title>OptionalPointee Concept</Title>
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
</HEAD>
|
||||||
</head>
|
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
|
||||||
<body>
|
ALINK="#ff0000">
|
||||||
Automatic redirection failed, please go to
|
<IMG SRC="../../boost.png"
|
||||||
<a href="./doc/html/index.html">./doc/html/index.html</a>
|
ALT="C++ Boost" width="277" height="86">
|
||||||
<hr>
|
<!--end header-->
|
||||||
<tt>
|
<BR Clear>
|
||||||
Boost.Utility<br>
|
<H1>Concept: OptionalPointee</H1>
|
||||||
|
|
||||||
|
<h3>Description</h3>
|
||||||
|
A type is a model of <i>OptionalPointee</i> if it points to (or refers to) a value
|
||||||
|
that may not exist. That is, if it has a <b>pointee</b> which might be <b>valid</b>
|
||||||
|
(existent) or <b>invalid</b> (inexistent); and it is possible to test whether the
|
||||||
|
pointee is valid or not.
|
||||||
|
This model does <u>not</u> imply pointer semantics: i.e., it does not imply shallow copy nor
|
||||||
|
aliasing.
|
||||||
|
<h3>Notation</h3>
|
||||||
|
<Table>
|
||||||
|
<TR>
|
||||||
|
<TD VAlign=top> <tt>T</tt> </TD>
|
||||||
|
<TD VAlign=top> is a type that is a model of OptionalPointee</TD>
|
||||||
|
</TR>
|
||||||
|
<TR>
|
||||||
|
<TD VAlign=top> <tt>t</tt> </TD>
|
||||||
|
<TD VAlign=top> is an object of type <tt>T</tt> or possibly <tt>const T</tt></TD>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
<h3>Definitions</h3>
|
||||||
|
<h3>Valid expressions</h3>
|
||||||
|
<Table border>
|
||||||
|
<TR>
|
||||||
|
<TH> Name </TH>
|
||||||
|
<TH> Expression </TH>
|
||||||
|
<TH> Return type </TH>
|
||||||
|
<TH> Semantics </TH>
|
||||||
|
</TR>
|
||||||
|
<TR>
|
||||||
|
<TD VAlign=top>Value Access</TD>
|
||||||
|
<TD VAlign=top> <tt>*t</tt></TD>
|
||||||
|
<TD VAlign=top> <tt>T&</tt></TD>
|
||||||
|
<TD VAlign=top>If the pointee is valid returns a reference to
|
||||||
|
the pointee.<br>
|
||||||
|
If the pointee is invalid the result is <i>undefined</i>.</TD>
|
||||||
|
<TD VAlign=top> </TD>
|
||||||
|
</TR>
|
||||||
|
<TR>
|
||||||
|
<TD VAlign=top>Value Access</TD>
|
||||||
|
<TD VAlign=top> <tt>t-><i>xyz</i></tt></TD>
|
||||||
|
<TD VAlign=top> <tt>T*</tt></TD>
|
||||||
|
<TD VAlign=top>If the pointee is valid returns a builtin pointer to the pointee.<br>
|
||||||
|
If the pointee is invalid the result is <i>undefined</i> (It might not even return NULL).<br>
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top> </TD>
|
||||||
|
</TR>
|
||||||
|
<TR>
|
||||||
|
<TD VAlign=top>Validity Test</TD>
|
||||||
|
<TD VAlign=top> <tt>t</tt><br>
|
||||||
|
<tt>t != 0</tt><br>
|
||||||
|
<tt>!!t</tt>
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top> bool </TD>
|
||||||
|
<TD VAlign=top>If the pointee is valid returns true.<br>
|
||||||
|
If the pointee is invalid returns false.</TD>
|
||||||
|
<TD VAlign=top></TD>
|
||||||
|
</TR>
|
||||||
|
<TR>
|
||||||
|
<TD VAlign=top>Invalidity Test</TD>
|
||||||
|
<TD VAlign=top> <tt>t == 0</tt><br>
|
||||||
|
<tt>!t</tt>
|
||||||
|
</TD>
|
||||||
|
<TD VAlign=top> bool </TD>
|
||||||
|
<TD VAlign=top>If the pointee is valid returns false.<br>
|
||||||
|
If the pointee is invalid returns true.</TD>
|
||||||
|
<TD VAlign=top></TD>
|
||||||
|
</TR>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
|
||||||
|
<h3>Models</h3>
|
||||||
|
|
||||||
|
<UL>
|
||||||
|
<LI><tt>pointers, both builtin and smart.</tt>
|
||||||
|
<LI><tt>boost::optional<></tt>
|
||||||
|
</UL>
|
||||||
|
|
||||||
|
<HR>
|
||||||
|
<h3>OptionalPointee and relational operations</h3>
|
||||||
|
<p>This concept does not define any particular semantic for relational operations, therefore,
|
||||||
|
a type which models this concept might have either shallow or deep relational semantics.<br>
|
||||||
|
For instance, pointers, which are models of OptionalPointee, have shallow relational operators:
|
||||||
|
comparisons of pointers do not involve comparisons of pointees.
|
||||||
|
This makes sense for pointers because they have shallow copy semantics.<br>
|
||||||
|
But boost::optional<T>, on the other hand, which is also a model of OptionalPointee, has
|
||||||
|
deep-copy and deep-relational semantics.<br>
|
||||||
|
If generic code is written for this concept, it is important not to use relational
|
||||||
|
operators directly because the semantics might be different depending on the actual type.<br>
|
||||||
|
Still, the concept itsef can be used to define <i>deep</i> relational tests that can
|
||||||
|
be used in generic code with any type which models OptionalPointee:</p>
|
||||||
|
<a name="equal"></a>
|
||||||
|
<p><u>Equivalence relation:</u></p>
|
||||||
|
<pre>template<class OptionalPointee>
|
||||||
|
inline
|
||||||
|
bool equal_pointees ( OptionalPointee const& x, OptionalPointee const& y )
|
||||||
|
{
|
||||||
|
return (!x) != (!y) ? false : ( !x ? true : (*x) == (*y) ) ;
|
||||||
|
}
|
||||||
|
template<class OptionalPointee>
|
||||||
|
struct equal_pointees_t : std::binary_function<OptionalPointee,OptionalPointee,bool>
|
||||||
|
{
|
||||||
|
bool operator() ( OptionalPointee const& x, OptionalPointee const& y ) const
|
||||||
|
{ return equal_pointees(x,y) ; }
|
||||||
|
} ;
|
||||||
|
</pre>
|
||||||
|
<p>The preceding generic function and function object have the following semantics:<br>
|
||||||
|
If both <b>x</b> and <b>y</b> have valid pointees, it compares values via <code>(*x == *y)</code>.<br>
|
||||||
|
If only one has a valid pointee, returns <code>false</code>.<br>
|
||||||
|
If both have invalid pointees, returns <code>true</code>.</p>
|
||||||
|
<a name="less"></a>
|
||||||
|
<p><u>Less-than relation:</u></p>
|
||||||
|
<pre>template<class OptionalPointee>
|
||||||
|
inline
|
||||||
|
bool less_pointees ( OptionalPointee const& x, OptionalPointee const& y )
|
||||||
|
{
|
||||||
|
return !y ? false : ( !x ? true : (*x) < (*y) ) ;
|
||||||
|
}
|
||||||
|
template<class OptionalPointee>
|
||||||
|
struct less_pointees_t : std::binary_function<OptionalPointee,OptionalPointee,bool>
|
||||||
|
{
|
||||||
|
bool operator() ( OptionalPointee const& x, OptionalPointee const& y ) const
|
||||||
|
{ return less_pointees(x,y) ; }
|
||||||
|
} ;
|
||||||
|
</pre>
|
||||||
|
<p>The preceding generic function and function object have the following semantics:<br>
|
||||||
|
If <b>y</b> has an invalid pointee, returns <code>false</code>.<br>
|
||||||
|
Else, if <b>x</b> has an invalid pointee, returns <code>true</code>.<br>
|
||||||
|
Else, ( <b>x</b> and <b>y</b> have valid pointees), compares values via <code>(*x <
|
||||||
|
*y).</code></p>
|
||||||
|
<p><br>
|
||||||
|
All these functions and function
|
||||||
|
objects are is implemented in <a href="../../boost/utility/compare_pointees.hpp">compare_pointees.hpp</a></p>
|
||||||
|
<p>Notice that OptionalPointee does not imply aliasing (and optional<> for instance does not alias);
|
||||||
|
so direct usage of relational operators with the implied aliasing of shallow semantics
|
||||||
|
-as with pointers- should not be used with generic code written for this concept.</p>
|
||||||
|
|
||||||
|
<h3>Acknowledgements</h3>
|
||||||
|
<p>Based on the original concept developed by Augustus Saunders.
|
||||||
|
|
||||||
<br>
|
<br>
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
</p>
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
<HR>
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
<TABLE>
|
||||||
<br>
|
<TR valign=top>
|
||||||
</tt>
|
<TD nowrap>Copyright © 2003</TD><TD>
|
||||||
</body>
|
<A HREF="mailto:fernando_cacciola@hotmail.com">Fernando Cacciola</A>
|
||||||
</html>
|
</TD></TR></TABLE>
|
||||||
|
|
||||||
|
<p>Distributed under the Boost Software License, Version 1.0. See
|
||||||
|
<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a></p>
|
||||||
|
|
||||||
|
</BODY>
|
||||||
|
</HTML>
|
||||||
26
README.md
26
README.md
@@ -1,26 +0,0 @@
|
|||||||
# 
|
|
||||||
|
|
||||||
Boost.Utility, part of collection of the [Boost C++ Libraries](https://github.com/boostorg), provides a number of smaller components, too small to be called libraries in their own right. See the documentation for the list of components.
|
|
||||||
|
|
||||||
### Directories
|
|
||||||
|
|
||||||
* **doc** - Documentation sources
|
|
||||||
* **include** - Interface headers of Boost.Utility
|
|
||||||
* **test** - Boost.Utility unit tests
|
|
||||||
|
|
||||||
### More information
|
|
||||||
|
|
||||||
* [Documentation](https://boost.org/libs/utility)
|
|
||||||
* [Report bugs](https://github.com/boostorg/utility/issues/new). Be sure to mention Boost version, Boost.Utility component, platform and compiler you're using. A small compilable code sample to reproduce the problem is always good as well.
|
|
||||||
* Submit your patches as pull requests against **develop** branch. Note that by submitting patches you agree to license your modifications under the [Boost Software License, Version 1.0](https://www.boost.org/LICENSE_1_0.txt).
|
|
||||||
|
|
||||||
### Build status
|
|
||||||
|
|
||||||
Branch | GitHub Actions | AppVeyor | Test Matrix | Dependencies |
|
|
||||||
:-------------: | -------------- | -------- | ----------- | ------------ |
|
|
||||||
[`master`](https://github.com/boostorg/utility/tree/master) | [](https://github.com/boostorg/utility/actions?query=branch%3Amaster) | [](https://ci.appveyor.com/project/Lastique/utility/branch/master) | [](http://www.boost.org/development/tests/master/developer/utility.html) | [](https://pdimov.github.io/boostdep-report/master/utility.html)
|
|
||||||
[`develop`](https://github.com/boostorg/utility/tree/develop) | [](https://github.com/boostorg/utility/actions?query=branch%3Adevelop) | [](https://ci.appveyor.com/project/Lastique/utility/branch/develop) | [](http://www.boost.org/development/tests/develop/developer/utility.html) | [](https://pdimov.github.io/boostdep-report/develop/utility.html)
|
|
||||||
|
|
||||||
### License
|
|
||||||
|
|
||||||
Distributed under the [Boost Software License, Version 1.0](https://www.boost.org/LICENSE_1_0.txt).
|
|
||||||
94
addressof_test.cpp
Normal file
94
addressof_test.cpp
Normal file
@@ -0,0 +1,94 @@
|
|||||||
|
// Copyright (C) 2002 Brad King (brad.king@kitware.com)
|
||||||
|
// Douglas Gregor (gregod@cs.rpi.edu)
|
||||||
|
//
|
||||||
|
// 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)
|
||||||
|
|
||||||
|
// For more information, see http://www.boost.org
|
||||||
|
|
||||||
|
|
||||||
|
#include <boost/utility/addressof.hpp>
|
||||||
|
|
||||||
|
#if defined(BOOST_MSVC) && (BOOST_MSVC < 1300)
|
||||||
|
#pragma warning(push, 3)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#include <iostream>
|
||||||
|
|
||||||
|
#if defined(BOOST_MSVC) && (BOOST_MSVC < 1300)
|
||||||
|
#pragma warning(pop)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#include <boost/detail/lightweight_test.hpp>
|
||||||
|
|
||||||
|
template<class T> void scalar_test( T * = 0 )
|
||||||
|
{
|
||||||
|
T* px = new T();
|
||||||
|
|
||||||
|
T& x = *px;
|
||||||
|
BOOST_TEST( boost::addressof(x) == px );
|
||||||
|
|
||||||
|
const T& cx = *px;
|
||||||
|
const T* pcx = boost::addressof(cx);
|
||||||
|
BOOST_TEST( pcx == px );
|
||||||
|
|
||||||
|
volatile T& vx = *px;
|
||||||
|
volatile T* pvx = boost::addressof(vx);
|
||||||
|
BOOST_TEST( pvx == px );
|
||||||
|
|
||||||
|
const volatile T& cvx = *px;
|
||||||
|
const volatile T* pcvx = boost::addressof(cvx);
|
||||||
|
BOOST_TEST( pcvx == px );
|
||||||
|
|
||||||
|
delete px;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<class T> void array_test( T * = 0 )
|
||||||
|
{
|
||||||
|
T nrg[3] = {1,2,3};
|
||||||
|
T (*pnrg)[3] = &nrg;
|
||||||
|
BOOST_TEST( boost::addressof(nrg) == pnrg );
|
||||||
|
|
||||||
|
T const cnrg[3] = {1,2,3};
|
||||||
|
T const (*pcnrg)[3] = &cnrg;
|
||||||
|
BOOST_TEST( boost::addressof(cnrg) == pcnrg );
|
||||||
|
}
|
||||||
|
|
||||||
|
struct addressable
|
||||||
|
{
|
||||||
|
addressable( int = 0 )
|
||||||
|
{
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
struct useless_type {};
|
||||||
|
|
||||||
|
class nonaddressable {
|
||||||
|
public:
|
||||||
|
|
||||||
|
nonaddressable( int = 0 )
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
void dummy(); // Silence GCC warning: all member of class are private
|
||||||
|
|
||||||
|
private:
|
||||||
|
|
||||||
|
useless_type operator&() const;
|
||||||
|
};
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
scalar_test<char>();
|
||||||
|
scalar_test<int>();
|
||||||
|
scalar_test<addressable>();
|
||||||
|
scalar_test<nonaddressable>();
|
||||||
|
|
||||||
|
array_test<char>();
|
||||||
|
array_test<int>();
|
||||||
|
array_test<addressable>();
|
||||||
|
array_test<nonaddressable>();
|
||||||
|
|
||||||
|
return boost::report_errors();
|
||||||
|
}
|
||||||
104
appveyor.yml
104
appveyor.yml
@@ -1,104 +0,0 @@
|
|||||||
# Copyright 2016-2019 Peter Dimov
|
|
||||||
# Copyright 2019, 2022 Andrey Semashev
|
|
||||||
# Distributed under the Boost Software License, Version 1.0.
|
|
||||||
# (See accompanying file LICENSE_1_0.txt or copy at http://boost.org/LICENSE_1_0.txt)
|
|
||||||
|
|
||||||
version: 1.0.{build}-{branch}
|
|
||||||
|
|
||||||
shallow_clone: true
|
|
||||||
|
|
||||||
branches:
|
|
||||||
only:
|
|
||||||
- master
|
|
||||||
- develop
|
|
||||||
- /feature\/.*/
|
|
||||||
|
|
||||||
environment:
|
|
||||||
matrix:
|
|
||||||
- TOOLSET: msvc-9.0,msvc-10.0,msvc-11.0
|
|
||||||
ADDRMD: 32
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
|
|
||||||
- TOOLSET: msvc-12.0,msvc-14.0
|
|
||||||
ADDRMD: 32,64
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
|
|
||||||
- TOOLSET: msvc-14.1
|
|
||||||
CXXSTD: 14,17,latest
|
|
||||||
ADDRMD: 32,64
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
|
|
||||||
- TOOLSET: msvc-14.2
|
|
||||||
ADDRMD: 32,64
|
|
||||||
CXXSTD: 14,17,20,latest
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2019
|
|
||||||
- TOOLSET: msvc-14.3
|
|
||||||
ADDRMD: 32,64
|
|
||||||
CXXSTD: 14,17,20,latest
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2022
|
|
||||||
- TOOLSET: clang-win
|
|
||||||
ADDRMD: 32
|
|
||||||
CXXSTD: 14,17,latest
|
|
||||||
ENV_SCRIPT: C:\Program Files (x86)\Microsoft Visual Studio\2019\Community\VC\Auxiliary\Build\vcvars32.bat
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2019
|
|
||||||
- TOOLSET: clang-win
|
|
||||||
ADDRMD: 64
|
|
||||||
CXXSTD: 14,17,latest
|
|
||||||
ENV_SCRIPT: C:\Program Files (x86)\Microsoft Visual Studio\2019\Community\VC\Auxiliary\Build\vcvars64.bat
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2019
|
|
||||||
- TOOLSET: gcc
|
|
||||||
CXXSTD: 03,11,14,1z
|
|
||||||
ADDPATH: C:\cygwin\bin;
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
|
|
||||||
- TOOLSET: gcc
|
|
||||||
CXXSTD: 03,11,14,1z
|
|
||||||
ADDPATH: C:\cygwin64\bin;
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
|
|
||||||
- TOOLSET: gcc
|
|
||||||
CXXSTD: 03,11,14,1z
|
|
||||||
ADDPATH: C:\mingw\bin;
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
|
|
||||||
- TOOLSET: gcc
|
|
||||||
CXXSTD: 03,11,14,1z
|
|
||||||
ADDPATH: C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin;
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
|
|
||||||
- TOOLSET: gcc
|
|
||||||
CXXSTD: 03,11,14,17
|
|
||||||
ADDPATH: C:\mingw-w64\x86_64-7.3.0-posix-seh-rt_v5-rev0\mingw64\bin;
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
|
|
||||||
- TOOLSET: gcc
|
|
||||||
CXXSTD: 03,11,14,17,2a
|
|
||||||
ADDPATH: C:\mingw-w64\x86_64-8.1.0-posix-seh-rt_v6-rev0\mingw64\bin;
|
|
||||||
APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
|
|
||||||
|
|
||||||
install:
|
|
||||||
- set GIT_FETCH_JOBS=8
|
|
||||||
- set BOOST_BRANCH=develop
|
|
||||||
- if "%APPVEYOR_REPO_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 init tools/build
|
|
||||||
- git submodule init tools/boost_install
|
|
||||||
- git submodule init libs/headers
|
|
||||||
- git submodule init libs/assert
|
|
||||||
- git submodule init libs/config
|
|
||||||
- git submodule init libs/core
|
|
||||||
- git submodule init libs/io
|
|
||||||
- git submodule init libs/preprocessor
|
|
||||||
- git submodule init libs/static_assert
|
|
||||||
- git submodule init libs/throw_exception
|
|
||||||
- git submodule init libs/type_traits
|
|
||||||
- git submodule init libs/container_hash
|
|
||||||
- git submodule init libs/integer
|
|
||||||
- git submodule init libs/detail
|
|
||||||
- git submodule update --jobs %GIT_FETCH_JOBS%
|
|
||||||
- xcopy /s /e /q %APPVEYOR_BUILD_FOLDER% libs\utility\
|
|
||||||
- cmd /c bootstrap
|
|
||||||
- b2 -d0 headers
|
|
||||||
|
|
||||||
build: off
|
|
||||||
|
|
||||||
test_script:
|
|
||||||
- PATH=%ADDPATH%%PATH%
|
|
||||||
- if not "%ENV_SCRIPT%" == "" call "%ENV_SCRIPT%"
|
|
||||||
- if not "%CXXSTD%" == "" set CXXSTD=cxxstd=%CXXSTD%
|
|
||||||
- if not "%ADDRMD%" == "" set ADDRMD=address-model=%ADDRMD%
|
|
||||||
- b2 -j %NUMBER_OF_PROCESSORS% libs/utility/test toolset=%TOOLSET% %CXXSTD% %ADDRMD% variant=debug,release
|
|
||||||
61
assert.html
Normal file
61
assert.html
Normal file
@@ -0,0 +1,61 @@
|
|||||||
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
|
||||||
|
<html>
|
||||||
|
<head>
|
||||||
|
<title>Boost: assert.hpp documentation</title>
|
||||||
|
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
|
||||||
|
</head>
|
||||||
|
<body bgcolor="white" style="MARGIN-LEFT: 5%; MARGIN-RIGHT: 5%">
|
||||||
|
<table border="0" width="100%">
|
||||||
|
<tr>
|
||||||
|
<td width="277"><A href="../../index.htm"> <img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86" border="0"></A>
|
||||||
|
</td>
|
||||||
|
<td align="center">
|
||||||
|
<h1>assert.hpp</h1>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td colspan="2" height="64"> </td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
<p>
|
||||||
|
The header <STRONG><boost/assert.hpp></STRONG> defines the macro <b>BOOST_ASSERT</b>,
|
||||||
|
which is similar to the standard <STRONG>assert</STRONG> macro defined in <STRONG><cassert></STRONG>.
|
||||||
|
The macro is intended to be used in Boost libraries.
|
||||||
|
</p>
|
||||||
|
<P>By default, <tt>BOOST_ASSERT(expr)</tt> is equivalent to <tt>assert(expr)</tt>.</P>
|
||||||
|
<P>When the macro <STRONG>BOOST_DISABLE_ASSERTS</STRONG> is defined when <STRONG><boost/assert.hpp></STRONG>
|
||||||
|
is included, <tt>BOOST_ASSERT(expr)</tt> is defined as <tt>((void)0)</tt>. This
|
||||||
|
allows users to selectively disable <STRONG>BOOST_ASSERT</STRONG> without
|
||||||
|
affecting the definition of the standard <STRONG>assert</STRONG>.</P>
|
||||||
|
<P>When the macro <STRONG>BOOST_ENABLE_ASSERT_HANDLER</STRONG> is defined when <STRONG><boost/assert.hpp></STRONG>
|
||||||
|
is included, <tt>BOOST_ASSERT(expr)</tt> evaluates <b>expr</b> and, if the
|
||||||
|
result is false, evaluates the expression</P>
|
||||||
|
<P><tt>::boost::assertion_failed(#expr, <a href="current_function.html">BOOST_CURRENT_FUNCTION</a>,
|
||||||
|
__FILE__, __LINE__)</tt></P>
|
||||||
|
<P><STRONG>assertion_failed</STRONG> is declared in <STRONG><boost/assert.hpp></STRONG>
|
||||||
|
as</P>
|
||||||
|
<pre>
|
||||||
|
namespace boost
|
||||||
|
{
|
||||||
|
|
||||||
|
void assertion_failed(char const * expr, char const * function, char const * file, long line);
|
||||||
|
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
<p>but it is never defined. The user is expected to supply an appropriate
|
||||||
|
definition.</p>
|
||||||
|
<P>As is the case with <STRONG><cassert></STRONG>, <STRONG><boost/assert.hpp></STRONG>
|
||||||
|
can be included multiple times in a single translation unit. <STRONG>BOOST_ASSERT</STRONG>
|
||||||
|
will be redefined each time as specified above.</P>
|
||||||
|
<p><STRONG><boost/assert.hpp></STRONG> also defines the macro <STRONG>BOOST_VERIFY</STRONG>.
|
||||||
|
It has exactly the same behavior as <STRONG>BOOST_ASSERT</STRONG>, except that
|
||||||
|
the expression that is passed to <STRONG>BOOST_VERIFY</STRONG> is always
|
||||||
|
evaluated. This is useful when the asserted expression has desirable side
|
||||||
|
effects; it can also help suppress warnings about unused variables when the
|
||||||
|
only use of the variable is inside an assertion.</p>
|
||||||
|
<p><br>
|
||||||
|
<small>Copyright <20> 2002, 2007 by Peter Dimov. 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>.</small></p>
|
||||||
|
</body>
|
||||||
|
</html>
|
||||||
109
assert_test.cpp
Normal file
109
assert_test.cpp
Normal file
@@ -0,0 +1,109 @@
|
|||||||
|
//
|
||||||
|
// assert_test.cpp - a test for boost/assert.hpp
|
||||||
|
//
|
||||||
|
// Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
|
||||||
|
//
|
||||||
|
// Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
// accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
#include <boost/detail/lightweight_test.hpp>
|
||||||
|
|
||||||
|
#include <boost/assert.hpp>
|
||||||
|
|
||||||
|
void test_default()
|
||||||
|
{
|
||||||
|
int x = 1;
|
||||||
|
|
||||||
|
BOOST_ASSERT(1);
|
||||||
|
BOOST_ASSERT(x);
|
||||||
|
BOOST_ASSERT(x == 1);
|
||||||
|
BOOST_ASSERT(&x);
|
||||||
|
}
|
||||||
|
|
||||||
|
#define BOOST_DISABLE_ASSERTS
|
||||||
|
#include <boost/assert.hpp>
|
||||||
|
|
||||||
|
void test_disabled()
|
||||||
|
{
|
||||||
|
int x = 1;
|
||||||
|
|
||||||
|
BOOST_ASSERT(1);
|
||||||
|
BOOST_ASSERT(x);
|
||||||
|
BOOST_ASSERT(x == 1);
|
||||||
|
BOOST_ASSERT(&x);
|
||||||
|
|
||||||
|
BOOST_ASSERT(0);
|
||||||
|
BOOST_ASSERT(!x);
|
||||||
|
BOOST_ASSERT(x == 0);
|
||||||
|
|
||||||
|
void * p = 0;
|
||||||
|
|
||||||
|
BOOST_ASSERT(p);
|
||||||
|
|
||||||
|
// supress warnings
|
||||||
|
p = &x;
|
||||||
|
p = &p;
|
||||||
|
}
|
||||||
|
|
||||||
|
#undef BOOST_DISABLE_ASSERTS
|
||||||
|
|
||||||
|
#define BOOST_ENABLE_ASSERT_HANDLER
|
||||||
|
#include <boost/assert.hpp>
|
||||||
|
#include <boost/config.hpp>
|
||||||
|
#include <cstdio>
|
||||||
|
|
||||||
|
int handler_invoked = 0;
|
||||||
|
|
||||||
|
void boost::assertion_failed(char const * expr, char const * function, char const * file, long line)
|
||||||
|
{
|
||||||
|
#if !defined(BOOST_NO_STDC_NAMESPACE)
|
||||||
|
using std::printf;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
printf("Expression: %s\nFunction: %s\nFile: %s\nLine: %ld\n\n", expr, function, file, line);
|
||||||
|
++handler_invoked;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct X
|
||||||
|
{
|
||||||
|
static void f()
|
||||||
|
{
|
||||||
|
BOOST_ASSERT(0);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
void test_handler()
|
||||||
|
{
|
||||||
|
int x = 1;
|
||||||
|
|
||||||
|
BOOST_ASSERT(1);
|
||||||
|
BOOST_ASSERT(x);
|
||||||
|
BOOST_ASSERT(x == 1);
|
||||||
|
BOOST_ASSERT(&x);
|
||||||
|
|
||||||
|
BOOST_ASSERT(0);
|
||||||
|
BOOST_ASSERT(!x);
|
||||||
|
BOOST_ASSERT(x == 0);
|
||||||
|
|
||||||
|
void * p = 0;
|
||||||
|
|
||||||
|
BOOST_ASSERT(p);
|
||||||
|
|
||||||
|
X::f();
|
||||||
|
|
||||||
|
BOOST_ASSERT(handler_invoked == 5);
|
||||||
|
BOOST_TEST(handler_invoked == 5);
|
||||||
|
}
|
||||||
|
|
||||||
|
#undef BOOST_ENABLE_ASSERT_HANDLER
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
test_default();
|
||||||
|
test_disabled();
|
||||||
|
test_handler();
|
||||||
|
|
||||||
|
return boost::report_errors();
|
||||||
|
}
|
||||||
371
base_from_member.html
Normal file
371
base_from_member.html
Normal file
@@ -0,0 +1,371 @@
|
|||||||
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
|
||||||
|
<html>
|
||||||
|
<head>
|
||||||
|
<title>Boost: Base-from-Member Idiom Documentation</title>
|
||||||
|
</head>
|
||||||
|
|
||||||
|
<body bgcolor="white" link="blue" text="black" vlink="purple" alink="red">
|
||||||
|
<h1><img src="../../boost.png" alt="C++ Boost" align="middle"
|
||||||
|
width="277" height="86">Base-from-Member Idiom</h1>
|
||||||
|
|
||||||
|
<p>The class template <code>boost::base_from_member</code> provides
|
||||||
|
a workaround for a class that needs to initialize a base class with a
|
||||||
|
member. The class template is in <cite><a
|
||||||
|
href="../../boost/utility/base_from_member.hpp">boost/utility/base_from_member.hpp</a></cite>
|
||||||
|
which is included in <i><a href="../../boost/utility.hpp">boost/utility.hpp</a></i>.</p>
|
||||||
|
|
||||||
|
<p>There is test/example code in <cite><a
|
||||||
|
href="base_from_member_test.cpp">base_from_member_test.cpp</a></cite>.</p>
|
||||||
|
|
||||||
|
<h2><a name="contents">Contents</a></h2>
|
||||||
|
|
||||||
|
<ul>
|
||||||
|
<li><a href="#contents">Contents</a></li>
|
||||||
|
<li><a href="#rationale">Rationale</a></li>
|
||||||
|
<li><a href="#synopsis">Synopsis</a></li>
|
||||||
|
<li><a href="#usage">Usage</a></li>
|
||||||
|
<li><a href="#example">Example</a></li>
|
||||||
|
<li><a href="#credits">Credits</a>
|
||||||
|
<ul>
|
||||||
|
<li><a href="#contributors">Contributors</a></li>
|
||||||
|
</ul></li>
|
||||||
|
</ul>
|
||||||
|
|
||||||
|
<h2><a name="rationale">Rationale</a></h2>
|
||||||
|
|
||||||
|
<p>When developing a class, sometimes a base class needs to be
|
||||||
|
initialized with a member of the current class. As a naïve
|
||||||
|
example:</p>
|
||||||
|
|
||||||
|
<blockquote><pre>
|
||||||
|
#include <streambuf> <i>// for std::streambuf</i>
|
||||||
|
#include <ostream> <i>// for std::ostream</i>
|
||||||
|
|
||||||
|
class fdoutbuf
|
||||||
|
: public std::streambuf
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
explicit fdoutbuf( int fd );
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
|
||||||
|
class fdostream
|
||||||
|
: public std::ostream
|
||||||
|
{
|
||||||
|
protected:
|
||||||
|
fdoutbuf buf;
|
||||||
|
public:
|
||||||
|
explicit fdostream( int fd )
|
||||||
|
: buf( fd ), std::ostream( &buf )
|
||||||
|
{}
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
</pre></blockquote>
|
||||||
|
|
||||||
|
<p>This is undefined because C++'s initialization order mandates that
|
||||||
|
the base class is initialized before the member it uses. <a
|
||||||
|
href="http://www.moocat.org">R. Samuel Klatchko</a> developed a way
|
||||||
|
around this by using the initialization order in his favor. Base
|
||||||
|
classes are intialized in order of declaration, so moving the desired
|
||||||
|
member to another base class, that is initialized before the desired
|
||||||
|
base class, can ensure proper initialization.</p>
|
||||||
|
|
||||||
|
<p>A custom base class can be made for this idiom:</p>
|
||||||
|
|
||||||
|
<blockquote><pre>
|
||||||
|
#include <streambuf> <i>// for std::streambuf</i>
|
||||||
|
#include <ostream> <i>// for std::ostream</i>
|
||||||
|
|
||||||
|
class fdoutbuf
|
||||||
|
: public std::streambuf
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
explicit fdoutbuf( int fd );
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
|
||||||
|
struct fdostream_pbase
|
||||||
|
{
|
||||||
|
fdoutbuf sbuffer;
|
||||||
|
|
||||||
|
explicit fdostream_pbase( int fd )
|
||||||
|
: sbuffer( fd )
|
||||||
|
{}
|
||||||
|
};
|
||||||
|
|
||||||
|
class fdostream
|
||||||
|
: private fdostream_pbase
|
||||||
|
, public std::ostream
|
||||||
|
{
|
||||||
|
typedef fdostream_pbase pbase_type;
|
||||||
|
typedef std::ostream base_type;
|
||||||
|
|
||||||
|
public:
|
||||||
|
explicit fdostream( int fd )
|
||||||
|
: pbase_type( fd ), base_type( &sbuffer )
|
||||||
|
{}
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
</pre></blockquote>
|
||||||
|
|
||||||
|
<p>Other projects can use similar custom base classes. The technique
|
||||||
|
is basic enough to make a template, with a sample template class in
|
||||||
|
this library. The main template parameter is the type of the enclosed
|
||||||
|
member. The template class has several (explicit) constructor member
|
||||||
|
templates, which implicitly type the constructor arguments and pass them
|
||||||
|
to the member. The template class uses implicit copy construction and
|
||||||
|
assignment, cancelling them if the enclosed member is non-copyable.</p>
|
||||||
|
|
||||||
|
<p>Manually coding a base class may be better if the construction
|
||||||
|
and/or copying needs are too complex for the supplied template class,
|
||||||
|
or if the compiler is not advanced enough to use it.</p>
|
||||||
|
|
||||||
|
<p>Since base classes are unnamed, a class cannot have multiple (direct)
|
||||||
|
base classes of the same type. The supplied template class has an
|
||||||
|
extra template parameter, an integer, that exists solely to provide type
|
||||||
|
differentiation. This parameter has a default value so a single use of a
|
||||||
|
particular member type does not need to concern itself with the integer.</p>
|
||||||
|
|
||||||
|
<h2><a name="synopsis">Synopsis</a></h2>
|
||||||
|
|
||||||
|
<blockquote><pre>
|
||||||
|
#ifndef BOOST_BASE_FROM_MEMBER_MAX_ARITY
|
||||||
|
#define BOOST_BASE_FROM_MEMBER_MAX_ARITY 10
|
||||||
|
#endif
|
||||||
|
|
||||||
|
template < typename MemberType, int UniqueID = 0 >
|
||||||
|
class boost::base_from_member
|
||||||
|
{
|
||||||
|
protected:
|
||||||
|
MemberType member;
|
||||||
|
|
||||||
|
base_from_member();
|
||||||
|
|
||||||
|
template< typename T1 >
|
||||||
|
explicit base_from_member( T1 x1 );
|
||||||
|
|
||||||
|
template< typename T1, typename T2 >
|
||||||
|
base_from_member( T1 x1, T2 x2 );
|
||||||
|
|
||||||
|
//...
|
||||||
|
|
||||||
|
template< typename T1, typename T2, typename T3, typename T4,
|
||||||
|
typename T5, typename T6, typename T7, typename T8, typename T9,
|
||||||
|
typename T10 >
|
||||||
|
base_from_member( T1 x1, T2 x2, T3 x3, T4 x4, T5 x5, T6 x6, T7 x7,
|
||||||
|
T8 x8, T9 x9, T10 x10 );
|
||||||
|
};
|
||||||
|
</pre></blockquote>
|
||||||
|
|
||||||
|
<p>The class template has a first template parameter
|
||||||
|
<var>MemberType</var> representing the type of the based-member.
|
||||||
|
It has a last template parameter <var>UniqueID</var>, that is an
|
||||||
|
<code>int</code>, to differentiate between multiple base classes that use
|
||||||
|
the same based-member type. The last template parameter has a default
|
||||||
|
value of zero if it is omitted. The class template has a protected
|
||||||
|
data member called <var>member</var> that the derived class can use
|
||||||
|
for later base classes (or itself).</p>
|
||||||
|
|
||||||
|
<p>There is a default constructor and several constructor member
|
||||||
|
templates. These constructor templates can take as many arguments
|
||||||
|
(currently up to ten) as possible and pass them to a constructor of
|
||||||
|
the data member. Since C++ does not allow any way to explicitly state
|
||||||
|
the template parameters of a templated constructor, make sure that
|
||||||
|
the arguments are already close as possible to the actual type used in
|
||||||
|
the data member's desired constructor.</p>
|
||||||
|
|
||||||
|
<p>The <var>BOOST_BASE_FROM_MEMBER_MAX_ARITY</var> macro constant specifies
|
||||||
|
the maximum argument length for the constructor templates. The constant
|
||||||
|
may be overridden if more (or less) argument configurations are needed. The
|
||||||
|
constant may be read for code that is expandable like the class template and
|
||||||
|
needs to maintain the same maximum size. (Example code would be a class that
|
||||||
|
uses this class template as a base class for a member with a flexible set of
|
||||||
|
constructors.)</p>
|
||||||
|
|
||||||
|
<h2><a name="usage">Usage</a></h2>
|
||||||
|
|
||||||
|
<p>With the starting example, the <code>fdoutbuf</code> sub-object needs
|
||||||
|
to be encapsulated in a base class that is inheirited before
|
||||||
|
<code>std::ostream</code>.</p>
|
||||||
|
|
||||||
|
<blockquote><pre>
|
||||||
|
#include <boost/utility/base_from_member.hpp>
|
||||||
|
|
||||||
|
#include <streambuf> <i>// for std::streambuf</i>
|
||||||
|
#include <ostream> <i>// for std::ostream</i>
|
||||||
|
|
||||||
|
class fdoutbuf
|
||||||
|
: public std::streambuf
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
explicit fdoutbuf( int fd );
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
|
||||||
|
class fdostream
|
||||||
|
: private boost::base_from_member<fdoutbuf>
|
||||||
|
, public std::ostream
|
||||||
|
{
|
||||||
|
// Helper typedef's
|
||||||
|
typedef boost::base_from_member<fdoutbuf> pbase_type;
|
||||||
|
typedef std::ostream base_type;
|
||||||
|
|
||||||
|
public:
|
||||||
|
explicit fdostream( int fd )
|
||||||
|
: pbase_type( fd ), base_type( &member )
|
||||||
|
{}
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
</pre></blockquote>
|
||||||
|
|
||||||
|
<p>The base-from-member idiom is an implementation detail, so it
|
||||||
|
should not be visible to the clients (or any derived classes) of
|
||||||
|
<code>fdostream</code>. Due to the initialization order, the
|
||||||
|
<code>fdoutbuf</code> sub-object will get initialized before the
|
||||||
|
<code>std::ostream</code> sub-object does, making the former
|
||||||
|
sub-object safe to use in the latter sub-object's construction. Since the
|
||||||
|
<code>fdoutbuf</code> sub-object of the final type is the only sub-object
|
||||||
|
with the name "member," that name can be used
|
||||||
|
unqualified within the final class.</p>
|
||||||
|
|
||||||
|
<h2><a name="example">Example</a></h2>
|
||||||
|
|
||||||
|
<p>The base-from-member class templates should commonly involve
|
||||||
|
only one base-from-member sub-object, usually for attaching a
|
||||||
|
stream-buffer to an I/O stream. The next example demonstrates how
|
||||||
|
to use multiple base-from-member sub-objects and the resulting
|
||||||
|
qualification issues.</p>
|
||||||
|
|
||||||
|
<blockquote><pre>
|
||||||
|
#include <boost/utility/base_from_member.hpp>
|
||||||
|
|
||||||
|
#include <cstddef> <i>// for NULL</i>
|
||||||
|
|
||||||
|
struct an_int
|
||||||
|
{
|
||||||
|
int y;
|
||||||
|
|
||||||
|
an_int( float yf );
|
||||||
|
};
|
||||||
|
|
||||||
|
class switcher
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
switcher();
|
||||||
|
switcher( double, int * );
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
|
||||||
|
class flow_regulator
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
flow_regulator( switcher &, switcher & );
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
|
||||||
|
template < unsigned Size >
|
||||||
|
class fan
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
explicit fan( switcher );
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
|
||||||
|
class system
|
||||||
|
: private boost::base_from_member<an_int>
|
||||||
|
, private boost::base_from_member<switcher>
|
||||||
|
, private boost::base_from_member<switcher, 1>
|
||||||
|
, private boost::base_from_member<switcher, 2>
|
||||||
|
, protected flow_regulator
|
||||||
|
, public fan<6>
|
||||||
|
{
|
||||||
|
// Helper typedef's
|
||||||
|
typedef boost::base_from_member<an_int> pbase0_type;
|
||||||
|
typedef boost::base_from_member<switcher> pbase1_type;
|
||||||
|
typedef boost::base_from_member<switcher, 1> pbase2_type;
|
||||||
|
typedef boost::base_from_member<switcher, 2> pbase3_type;
|
||||||
|
|
||||||
|
typedef flow_regulator base1_type;
|
||||||
|
typedef fan<6> base2_type;
|
||||||
|
|
||||||
|
public:
|
||||||
|
system( double x );
|
||||||
|
//...
|
||||||
|
};
|
||||||
|
|
||||||
|
system::system( double x )
|
||||||
|
: pbase0_type( 0.2 )
|
||||||
|
, pbase1_type()
|
||||||
|
, pbase2_type( -16, &this->pbase0_type::member )
|
||||||
|
, pbase3_type( x, static_cast<int *>(NULL) )
|
||||||
|
, base1_type( pbase3_type::member, pbase1_type::member )
|
||||||
|
, base2_type( pbase2_type::member )
|
||||||
|
{
|
||||||
|
//...
|
||||||
|
}
|
||||||
|
</pre></blockquote>
|
||||||
|
|
||||||
|
<p>The final class has multiple sub-objects with the name
|
||||||
|
"member," so any use of that name needs qualification by
|
||||||
|
a name of the appropriate base type. (Using <code>typedef</code>s
|
||||||
|
ease mentioning the base types.) However, the fix introduces a new
|
||||||
|
problem when a pointer is needed. Using the address operator with
|
||||||
|
a sub-object qualified with its class's name results in a pointer-to-member
|
||||||
|
(here, having a type of <code>an_int boost::base_from_member<an_int,
|
||||||
|
0> :: *</code>) instead of a pointer to the member (having a type of
|
||||||
|
<code>an_int *</code>). The new problem is fixed by qualifying the
|
||||||
|
sub-object with "<code>this-></code>," and is needed just
|
||||||
|
for pointers, and not for references or values.</p>
|
||||||
|
|
||||||
|
<p>There are some argument conversions in the initialization. The
|
||||||
|
constructor argument for <code>pbase0_type</code> is converted from
|
||||||
|
<code>double</code> to <code>float</code>. The first constructor
|
||||||
|
argument for <code>pbase2_type</code> is converted from <code>int</code>
|
||||||
|
to <code>double</code>. The second constructor argument for
|
||||||
|
<code>pbase3_type</code> is a special case of necessary conversion; all
|
||||||
|
forms of the null-pointer literal in C++ also look like compile-time
|
||||||
|
integral expressions, so C++ always interprets such code as an integer
|
||||||
|
when it has overloads that can take either an integer or a pointer. The
|
||||||
|
last conversion is necessary for the compiler to call a constructor form
|
||||||
|
with the exact pointer type used in <code>switcher</code>'s constructor.</p>
|
||||||
|
|
||||||
|
<h2><a name="credits">Credits</a></h2>
|
||||||
|
|
||||||
|
<h3><a name="contributors">Contributors</a></h3>
|
||||||
|
|
||||||
|
<dl>
|
||||||
|
<dt><a href="http://www.boost.org/people/ed_brey.htm">Ed Brey</a>
|
||||||
|
<dd>Suggested some interface changes.
|
||||||
|
|
||||||
|
<dt><a href="http://www.moocat.org">R. Samuel Klatchko</a> (<a
|
||||||
|
href="mailto:rsk@moocat.org">rsk@moocat.org</a>, <a
|
||||||
|
href="mailto:rsk@brightmail.com">rsk@brightmail.com</a>)
|
||||||
|
<dd>Invented the idiom of how to use a class member for initializing
|
||||||
|
a base class.
|
||||||
|
|
||||||
|
<dt><a href="http://www.boost.org/people/dietmar_kuehl.htm">Dietmar Kuehl</a>
|
||||||
|
<dd>Popularized the base-from-member idiom in his
|
||||||
|
<a href="http://www.informatik.uni-konstanz.de/~kuehl/c++/iostream/">IOStream
|
||||||
|
example classes</a>.
|
||||||
|
|
||||||
|
<dt>Jonathan Turkanis
|
||||||
|
<dd>Supplied an implementation of generating the constructor templates that
|
||||||
|
can be controlled and automated with macros. The implementation uses
|
||||||
|
the <a href="../preprocessor/index.html">Preprocessor library</a>.
|
||||||
|
|
||||||
|
<dt><a href="http://www.boost.org/people/daryle_walker.html">Daryle Walker</a>
|
||||||
|
<dd>Started the library. Contributed the test file <cite><a
|
||||||
|
href="base_from_member_test.cpp">base_from_member_test.cpp</a></cite>.
|
||||||
|
</dl>
|
||||||
|
|
||||||
|
<hr>
|
||||||
|
|
||||||
|
<p>Revised: 28 August 2004</p>
|
||||||
|
|
||||||
|
<p>Copyright 2001, 2003, 2004 Daryle Walker. Use, modification, and distribution
|
||||||
|
are subject to the Boost Software License, Version 1.0. (See accompanying
|
||||||
|
file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or a copy at <<a
|
||||||
|
href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>>.)</p>
|
||||||
|
|
||||||
|
</body>
|
||||||
|
</html>
|
||||||
@@ -10,14 +10,15 @@
|
|||||||
// 14 Jun 2003 Adjusted code for Boost.Test changes (Daryle Walker)
|
// 14 Jun 2003 Adjusted code for Boost.Test changes (Daryle Walker)
|
||||||
// 29 Aug 2001 Initial Version (Daryle Walker)
|
// 29 Aug 2001 Initial Version (Daryle Walker)
|
||||||
|
|
||||||
#include <boost/core/lightweight_test.hpp>
|
#include <boost/test/minimal.hpp> // for BOOST_CHECK, main
|
||||||
|
|
||||||
#include <boost/config.hpp> // for BOOST_NO_MEMBER_TEMPLATES
|
#include <boost/config.hpp> // for BOOST_NO_MEMBER_TEMPLATES
|
||||||
|
#include <boost/cstdlib.hpp> // for boost::exit_success
|
||||||
#include <boost/noncopyable.hpp> // for boost::noncopyable
|
#include <boost/noncopyable.hpp> // for boost::noncopyable
|
||||||
|
|
||||||
#include <boost/utility/base_from_member.hpp> // for boost::base_from_member
|
#include <boost/utility/base_from_member.hpp> // for boost::base_from_member
|
||||||
|
|
||||||
#include <functional> // for std::less
|
#include <functional> // for std::binary_function, std::less
|
||||||
#include <iostream> // for std::cout (std::ostream, std::endl indirectly)
|
#include <iostream> // for std::cout (std::ostream, std::endl indirectly)
|
||||||
#include <set> // for std::set
|
#include <set> // for std::set
|
||||||
#include <typeinfo> // for std::type_info
|
#include <typeinfo> // for std::type_info
|
||||||
@@ -45,6 +46,7 @@ template < typename T >
|
|||||||
|
|
||||||
// A custom comparison type is needed
|
// A custom comparison type is needed
|
||||||
struct object_id_compare
|
struct object_id_compare
|
||||||
|
: std::binary_function<object_id, object_id, bool>
|
||||||
{
|
{
|
||||||
bool operator ()( object_id const &a, object_id const &b ) const;
|
bool operator ()( object_id const &a, object_id const &b ) const;
|
||||||
|
|
||||||
@@ -171,13 +173,13 @@ object_registrar obj_reg;
|
|||||||
|
|
||||||
// Main functionality
|
// Main functionality
|
||||||
int
|
int
|
||||||
main()
|
test_main( int , char * [] )
|
||||||
{
|
{
|
||||||
BOOST_TEST( obj_reg.db_.empty() );
|
BOOST_CHECK( obj_reg.db_.empty() );
|
||||||
BOOST_TEST( obj_reg.defrauders_in_.empty() );
|
BOOST_CHECK( obj_reg.defrauders_in_.empty() );
|
||||||
BOOST_TEST( obj_reg.defrauders_out_.empty() );
|
BOOST_CHECK( obj_reg.defrauders_out_.empty() );
|
||||||
BOOST_TEST( obj_reg.overeager_.empty() );
|
BOOST_CHECK( obj_reg.overeager_.empty() );
|
||||||
BOOST_TEST( obj_reg.overkilled_.empty() );
|
BOOST_CHECK( obj_reg.overkilled_.empty() );
|
||||||
|
|
||||||
// Make a separate block to examine pre- and post-effects
|
// Make a separate block to examine pre- and post-effects
|
||||||
{
|
{
|
||||||
@@ -185,20 +187,20 @@ main()
|
|||||||
using std::endl;
|
using std::endl;
|
||||||
|
|
||||||
bad_class bc;
|
bad_class bc;
|
||||||
BOOST_TEST( obj_reg.db_.size() == 3 );
|
BOOST_CHECK( obj_reg.db_.size() == 3 );
|
||||||
BOOST_TEST( obj_reg.defrauders_in_.size() == 1 );
|
BOOST_CHECK( obj_reg.defrauders_in_.size() == 1 );
|
||||||
|
|
||||||
good_class_1 gc1;
|
good_class_1 gc1;
|
||||||
BOOST_TEST( obj_reg.db_.size() == 6 );
|
BOOST_CHECK( obj_reg.db_.size() == 6 );
|
||||||
BOOST_TEST( obj_reg.defrauders_in_.size() == 1 );
|
BOOST_CHECK( obj_reg.defrauders_in_.size() == 1 );
|
||||||
|
|
||||||
good_class_2 gc2;
|
good_class_2 gc2;
|
||||||
BOOST_TEST( obj_reg.db_.size() == 11 );
|
BOOST_CHECK( obj_reg.db_.size() == 11 );
|
||||||
BOOST_TEST( obj_reg.defrauders_in_.size() == 1 );
|
BOOST_CHECK( obj_reg.defrauders_in_.size() == 1 );
|
||||||
|
|
||||||
BOOST_TEST( obj_reg.defrauders_out_.empty() );
|
BOOST_CHECK( obj_reg.defrauders_out_.empty() );
|
||||||
BOOST_TEST( obj_reg.overeager_.empty() );
|
BOOST_CHECK( obj_reg.overeager_.empty() );
|
||||||
BOOST_TEST( obj_reg.overkilled_.empty() );
|
BOOST_CHECK( obj_reg.overkilled_.empty() );
|
||||||
|
|
||||||
// Getting the addresses of the objects ensure
|
// Getting the addresses of the objects ensure
|
||||||
// that they're used, and not optimized away.
|
// that they're used, and not optimized away.
|
||||||
@@ -207,13 +209,13 @@ main()
|
|||||||
cout << "Object 'gc2' is at " << &gc2 << '.' << endl;
|
cout << "Object 'gc2' is at " << &gc2 << '.' << endl;
|
||||||
}
|
}
|
||||||
|
|
||||||
BOOST_TEST( obj_reg.db_.empty() );
|
BOOST_CHECK( obj_reg.db_.empty() );
|
||||||
BOOST_TEST( obj_reg.defrauders_in_.size() == 1 );
|
BOOST_CHECK( obj_reg.defrauders_in_.size() == 1 );
|
||||||
BOOST_TEST( obj_reg.defrauders_out_.size() == 1 );
|
BOOST_CHECK( obj_reg.defrauders_out_.size() == 1 );
|
||||||
BOOST_TEST( obj_reg.overeager_.empty() );
|
BOOST_CHECK( obj_reg.overeager_.empty() );
|
||||||
BOOST_TEST( obj_reg.overkilled_.empty() );
|
BOOST_CHECK( obj_reg.overkilled_.empty() );
|
||||||
|
|
||||||
return boost::report_errors();
|
return boost::exit_success;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
@@ -279,7 +281,7 @@ object_id_compare::operator ()
|
|||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
return a.second->before( *b.second ) != 0;
|
return a.second->before( *b.second );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
258
binary_search_test.cpp
Normal file
258
binary_search_test.cpp
Normal file
@@ -0,0 +1,258 @@
|
|||||||
|
// (C) Copyright David Abrahams 2000.
|
||||||
|
// Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
// accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
#include <vector>
|
||||||
|
#include <string>
|
||||||
|
#include <memory>
|
||||||
|
#include <climits>
|
||||||
|
#include <iostream>
|
||||||
|
#include <cassert>
|
||||||
|
#include <stdlib.h> // for rand(). Would use cstdlib but VC6.4 doesn't put it in std::
|
||||||
|
#include <list>
|
||||||
|
#include <algorithm>
|
||||||
|
#include <boost/detail/binary_search.hpp>
|
||||||
|
#include <boost/detail/workaround.hpp>
|
||||||
|
#include <cstddef>
|
||||||
|
|
||||||
|
#if defined(__SGI_STL_PORT) ? defined(__SGI_STL_OWN_IOSTREAMS) : (!defined(__GNUC__) || __GNUC__ > 2)
|
||||||
|
# define USE_SSTREAM
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef USE_SSTREAM
|
||||||
|
# include <sstream>
|
||||||
|
#else
|
||||||
|
# include <strstream>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
namespace {
|
||||||
|
|
||||||
|
// In order to get ADL to find the comparison operators defined below, they have
|
||||||
|
struct mystring : std::string
|
||||||
|
{
|
||||||
|
typedef std::string base;
|
||||||
|
|
||||||
|
mystring(std::string const& x)
|
||||||
|
: base(x) {}
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef std::vector<mystring> string_vector;
|
||||||
|
|
||||||
|
const std::size_t sequence_length = 1000;
|
||||||
|
|
||||||
|
unsigned random_number()
|
||||||
|
{
|
||||||
|
return static_cast<unsigned>(::rand()) % sequence_length;
|
||||||
|
}
|
||||||
|
|
||||||
|
# ifndef USE_SSTREAM
|
||||||
|
class unfreezer {
|
||||||
|
public:
|
||||||
|
unfreezer(std::ostrstream& s) : m_stream(s) {}
|
||||||
|
~unfreezer() { m_stream.freeze(false); }
|
||||||
|
private:
|
||||||
|
std::ostrstream& m_stream;
|
||||||
|
};
|
||||||
|
# endif
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
void push_back_random_number_string(T& seq)
|
||||||
|
{
|
||||||
|
unsigned value = random_number();
|
||||||
|
# if defined(__SGI_STL_PORT) ? defined(__SGI_STL_OWN_IOSTREAMS) : (!defined(__GNUC__) || __GNUC__ > 2)
|
||||||
|
std::ostringstream s;
|
||||||
|
s << value;
|
||||||
|
seq.push_back(s.str());
|
||||||
|
# else
|
||||||
|
std::ostrstream s;
|
||||||
|
auto unfreezer unfreeze(s);
|
||||||
|
s << value << char(0);
|
||||||
|
seq.push_back(std::string(s.str()));
|
||||||
|
# endif
|
||||||
|
}
|
||||||
|
|
||||||
|
inline unsigned to_int(unsigned x) { return x; }
|
||||||
|
inline unsigned to_int(const std::string& x) { return atoi(x.c_str()); }
|
||||||
|
|
||||||
|
struct cmp
|
||||||
|
{
|
||||||
|
template <class A1, class A2>
|
||||||
|
inline bool operator()(const A1& a1, const A2& a2) const
|
||||||
|
{
|
||||||
|
return to_int(a1) < to_int(a2);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
inline bool operator<(const mystring& x, const unsigned y)
|
||||||
|
{
|
||||||
|
return to_int(x) < y;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline bool operator<(const unsigned y, const mystring& x)
|
||||||
|
{
|
||||||
|
return y < to_int(x);
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
void sort_by_value(T& x);
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
void sort_by_value_(T& v, long)
|
||||||
|
{
|
||||||
|
std::sort(v.begin(), v.end(), cmp());
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
void random_sorted_sequence(T& seq)
|
||||||
|
{
|
||||||
|
seq.clear();
|
||||||
|
for (std::size_t i = 0; i < sequence_length; ++i)
|
||||||
|
{
|
||||||
|
push_back_random_number_string(seq);
|
||||||
|
}
|
||||||
|
sort_by_value(seq);
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class T, class A>
|
||||||
|
void sort_by_value_(std::list<T,A>& l, int)
|
||||||
|
{
|
||||||
|
# if BOOST_WORKAROUND(BOOST_DINKUMWARE_STDLIB, == 1) && !defined(__SGI_STL_PORT)
|
||||||
|
// VC6's standard lib doesn't have a template member function for list::sort()
|
||||||
|
std::vector<T> seq;
|
||||||
|
seq.reserve(sequence_length);
|
||||||
|
std::copy(l.begin(), l.end(), std::back_inserter(seq));
|
||||||
|
sort_by_value(seq);
|
||||||
|
std::copy(seq.begin(), seq.end(), l.begin());
|
||||||
|
# else
|
||||||
|
l.sort(cmp());
|
||||||
|
# endif
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
void sort_by_value(T& x)
|
||||||
|
{
|
||||||
|
(sort_by_value_)(x, 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
// A way to select the comparisons with/without a Compare parameter for testing.
|
||||||
|
template <class Compare> struct searches
|
||||||
|
{
|
||||||
|
template <class Iterator, class Key>
|
||||||
|
static Iterator lower_bound(Iterator start, Iterator finish, Key key, Compare cmp)
|
||||||
|
{ return boost::detail::lower_bound(start, finish, key, cmp); }
|
||||||
|
|
||||||
|
template <class Iterator, class Key>
|
||||||
|
static Iterator upper_bound(Iterator start, Iterator finish, Key key, Compare cmp)
|
||||||
|
{ return boost::detail::upper_bound(start, finish, key, cmp); }
|
||||||
|
|
||||||
|
template <class Iterator, class Key>
|
||||||
|
static std::pair<Iterator, Iterator> equal_range(Iterator start, Iterator finish, Key key, Compare cmp)
|
||||||
|
{ return boost::detail::equal_range(start, finish, key, cmp); }
|
||||||
|
|
||||||
|
template <class Iterator, class Key>
|
||||||
|
static bool binary_search(Iterator start, Iterator finish, Key key, Compare cmp)
|
||||||
|
{ return boost::detail::binary_search(start, finish, key, cmp); }
|
||||||
|
};
|
||||||
|
|
||||||
|
struct no_compare {};
|
||||||
|
|
||||||
|
template <> struct searches<no_compare>
|
||||||
|
{
|
||||||
|
template <class Iterator, class Key>
|
||||||
|
static Iterator lower_bound(Iterator start, Iterator finish, Key key, no_compare)
|
||||||
|
{ return boost::detail::lower_bound(start, finish, key); }
|
||||||
|
|
||||||
|
template <class Iterator, class Key>
|
||||||
|
static Iterator upper_bound(Iterator start, Iterator finish, Key key, no_compare)
|
||||||
|
{ return boost::detail::upper_bound(start, finish, key); }
|
||||||
|
|
||||||
|
template <class Iterator, class Key>
|
||||||
|
static std::pair<Iterator, Iterator> equal_range(Iterator start, Iterator finish, Key key, no_compare)
|
||||||
|
{ return boost::detail::equal_range(start, finish, key); }
|
||||||
|
|
||||||
|
template <class Iterator, class Key>
|
||||||
|
static bool binary_search(Iterator start, Iterator finish, Key key, no_compare)
|
||||||
|
{ return boost::detail::binary_search(start, finish, key); }
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class Sequence, class Compare>
|
||||||
|
void test_loop(Sequence& x, Compare cmp, unsigned long test_count)
|
||||||
|
{
|
||||||
|
typedef typename Sequence::const_iterator const_iterator;
|
||||||
|
|
||||||
|
for (unsigned long i = 0; i < test_count; ++i)
|
||||||
|
{
|
||||||
|
random_sorted_sequence(x);
|
||||||
|
const const_iterator start = x.begin();
|
||||||
|
const const_iterator finish = x.end();
|
||||||
|
|
||||||
|
unsigned key = random_number();
|
||||||
|
const const_iterator l = searches<Compare>::lower_bound(start, finish, key, cmp);
|
||||||
|
const const_iterator u = searches<Compare>::upper_bound(start, finish, key, cmp);
|
||||||
|
|
||||||
|
bool found_l = false;
|
||||||
|
bool found_u = false;
|
||||||
|
std::size_t index = 0;
|
||||||
|
std::size_t count = 0;
|
||||||
|
unsigned last_value = 0;
|
||||||
|
for (const_iterator p = start; p != finish; ++p)
|
||||||
|
{
|
||||||
|
if (p == l)
|
||||||
|
found_l = true;
|
||||||
|
|
||||||
|
if (p == u)
|
||||||
|
{
|
||||||
|
assert(found_l);
|
||||||
|
found_u = true;
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned value = to_int(*p);
|
||||||
|
assert(value >= last_value);
|
||||||
|
last_value = value;
|
||||||
|
|
||||||
|
if (!found_l)
|
||||||
|
{
|
||||||
|
++index;
|
||||||
|
assert(to_int(*p) < key);
|
||||||
|
}
|
||||||
|
else if (!found_u)
|
||||||
|
{
|
||||||
|
++count;
|
||||||
|
assert(to_int(*p) == key);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
assert(to_int(*p) > key);
|
||||||
|
}
|
||||||
|
assert(found_l || l == finish);
|
||||||
|
assert(found_u || u == finish);
|
||||||
|
|
||||||
|
std::pair<const_iterator, const_iterator>
|
||||||
|
range = searches<Compare>::equal_range(start, finish, key, cmp);
|
||||||
|
assert(range.first == l);
|
||||||
|
assert(range.second == u);
|
||||||
|
|
||||||
|
bool found = searches<Compare>::binary_search(start, finish, key, cmp);
|
||||||
|
assert(found == (u != l));
|
||||||
|
std::cout << "found " << count << " copies of " << key << " at index " << index << "\n";
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
string_vector x;
|
||||||
|
std::cout << "=== testing random-access iterators with <: ===\n";
|
||||||
|
test_loop(x, no_compare(), 25);
|
||||||
|
std::cout << "=== testing random-access iterators with compare: ===\n";
|
||||||
|
test_loop(x, cmp(), 25);
|
||||||
|
|
||||||
|
std::list<mystring> y;
|
||||||
|
std::cout << "=== testing bidirectional iterators with <: ===\n";
|
||||||
|
test_loop(y, no_compare(), 25);
|
||||||
|
std::cout << "=== testing bidirectional iterators with compare: ===\n";
|
||||||
|
test_loop(y, cmp(), 25);
|
||||||
|
std::cerr << "******TEST PASSED******\n";
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
762
call_traits.htm
762
call_traits.htm
@@ -1,19 +1,755 @@
|
|||||||
<html>
|
<html>
|
||||||
|
|
||||||
<head>
|
<head>
|
||||||
<title>Boost.Utility</title>
|
<meta http-equiv="Content-Type"
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
content="text/html; charset=iso-8859-1">
|
||||||
|
<meta name="Template"
|
||||||
|
content="C:\PROGRAM FILES\MICROSOFT OFFICE\OFFICE\html.dot">
|
||||||
|
<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
|
||||||
|
<title>Call Traits</title>
|
||||||
</head>
|
</head>
|
||||||
<body>
|
|
||||||
Automatic redirection failed, please go to
|
<body bgcolor="#FFFFFF" text="#000000" link="#0000FF"
|
||||||
<a href="./doc/html/utility/utilities/call_traits.html">./doc/html/utility/utilities/call_traits.html</a>
|
vlink="#800080">
|
||||||
|
|
||||||
|
<h1><img src="../../boost.png" width="276" height="86">Header
|
||||||
|
<<a href="../../boost/detail/call_traits.hpp">boost/call_traits.hpp</a>></h1>
|
||||||
|
|
||||||
|
<p>All of the contents of <boost/call_traits.hpp> are
|
||||||
|
defined inside namespace boost.</p>
|
||||||
|
|
||||||
|
<p>The template class call_traits<T> encapsulates the
|
||||||
|
"best" method to pass a parameter of some type T to or
|
||||||
|
from a function, and consists of a collection of typedefs defined
|
||||||
|
as in the table below. The purpose of call_traits is to ensure
|
||||||
|
that problems like "<a href="#refs">references to references</a>"
|
||||||
|
never occur, and that parameters are passed in the most efficient
|
||||||
|
manner possible (see <a href="#examples">examples</a>). In each
|
||||||
|
case if your existing practice is to use the type defined on the
|
||||||
|
left, then replace it with the call_traits defined type on the
|
||||||
|
right. </p>
|
||||||
|
|
||||||
|
<p>Note that for compilers that do not support either partial
|
||||||
|
specialization or member templates, no benefit will occur from
|
||||||
|
using call_traits: the call_traits defined types will always be
|
||||||
|
the same as the existing practice in this case. In addition if
|
||||||
|
only member templates and not partial template specialisation is
|
||||||
|
support by the compiler (for example Visual C++ 6) then
|
||||||
|
call_traits can not be used with array types (although it can be
|
||||||
|
used to solve the reference to reference problem).</p>
|
||||||
|
|
||||||
|
<table border="0" cellpadding="7" cellspacing="1" width="797">
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#008080"><p
|
||||||
|
align="center">Existing practice</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="35%" bgcolor="#008080"><p
|
||||||
|
align="center">call_traits equivalent</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="32%" bgcolor="#008080"><p
|
||||||
|
align="center">Description</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="16%" bgcolor="#008080"><p
|
||||||
|
align="center">Notes</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%"><p align="center">T<br>
|
||||||
|
(return by value)</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="35%"><p align="center"><code>call_traits<T>::value_type</code></p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="32%">Defines a type that
|
||||||
|
represents the "value" of type T. Use this for
|
||||||
|
functions that return by value, or possibly for stored
|
||||||
|
values of type T.</td>
|
||||||
|
<td valign="top" width="16%"><p align="center">2</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%"><p align="center">T&<br>
|
||||||
|
(return value)</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="35%"><p align="center"><code>call_traits<T>::reference</code></p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="32%">Defines a type that
|
||||||
|
represents a reference to type T. Use for functions that
|
||||||
|
would normally return a T&.</td>
|
||||||
|
<td valign="top" width="16%"><p align="center">1</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
T&<br>
|
||||||
|
(return value)</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="35%"><p align="center"><code>call_traits<T>::const_reference</code></p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="32%">Defines a type that
|
||||||
|
represents a constant reference to type T. Use for
|
||||||
|
functions that would normally return a const T&.</td>
|
||||||
|
<td valign="top" width="16%"><p align="center">1</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
T&<br>
|
||||||
|
(function parameter)</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="35%"><p align="center"><code>call_traits<T>::param_type</code></p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="32%">Defines a type that
|
||||||
|
represents the "best" way to pass a parameter
|
||||||
|
of type T to a function.</td>
|
||||||
|
<td valign="top" width="16%"><p align="center">1,3</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p>Notes:</p>
|
||||||
|
|
||||||
|
<ol>
|
||||||
|
<li>If T is already reference type, then call_traits is
|
||||||
|
defined such that <a href="#refs">references to
|
||||||
|
references</a> do not occur (requires partial
|
||||||
|
specialization).</li>
|
||||||
|
<li>If T is an array type, then call_traits defines <code>value_type</code>
|
||||||
|
as a "constant pointer to type" rather than an
|
||||||
|
"array of type" (requires partial
|
||||||
|
specialization). Note that if you are using value_type as
|
||||||
|
a stored value then this will result in storing a "constant
|
||||||
|
pointer to an array" rather than the array itself.
|
||||||
|
This may or may not be a good thing depending upon what
|
||||||
|
you actually need (in other words take care!).</li>
|
||||||
|
<li>If T is a small built in type or a pointer, then <code>param_type</code>
|
||||||
|
is defined as <code>T const</code>, instead of <code>T
|
||||||
|
const&</code>. This can improve the ability of the
|
||||||
|
compiler to optimize loops in the body of the function if
|
||||||
|
they depend upon the passed parameter, the semantics of
|
||||||
|
the passed parameter is otherwise unchanged (requires
|
||||||
|
partial specialization).</li>
|
||||||
|
</ol>
|
||||||
|
|
||||||
|
<p> </p>
|
||||||
|
|
||||||
|
<h3>Copy constructibility</h3>
|
||||||
|
|
||||||
|
<p>The following table defines which call_traits types can always
|
||||||
|
be copy-constructed from which other types, those entries marked
|
||||||
|
with a '?' are true only if and only if T is copy constructible:</p>
|
||||||
|
|
||||||
|
<table border="0" cellpadding="7" cellspacing="1" width="766">
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%"> </td>
|
||||||
|
<td valign="top" colspan="5" width="85%"
|
||||||
|
bgcolor="#008080"><p align="center">To:</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#008080">From:</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">T</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">value_type</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">reference</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">const_reference</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">param_type</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">T</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">value_type</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">N</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">N</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">reference</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">const_reference</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">N</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">N</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">param_type</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">?</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">N</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">N</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p> </p>
|
||||||
|
|
||||||
|
<p>If T is an assignable type the following assignments are
|
||||||
|
possible:</p>
|
||||||
|
|
||||||
|
<table border="0" cellpadding="7" cellspacing="1" width="766">
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%"> </td>
|
||||||
|
<td valign="top" colspan="5" width="85%"
|
||||||
|
bgcolor="#008080"><p align="center">To:</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#008080">From:</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">T</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">value_type</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">reference</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">const_reference</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">param_type</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">T</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">value_type</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">reference</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">const_reference</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0">param_type</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">Y</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">-</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p> </p>
|
||||||
|
|
||||||
|
<h3><a name="examples"></a>Examples</h3>
|
||||||
|
|
||||||
|
<p>The following table shows the effect that call_traits has on
|
||||||
|
various types, the table assumes that the compiler supports
|
||||||
|
partial specialization: if it doesn't then all types behave in
|
||||||
|
the same way as the entry for "myclass", and
|
||||||
|
call_traits can not be used with reference or array types.</p>
|
||||||
|
|
||||||
|
<table border="0" cellpadding="7" cellspacing="1" width="766">
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%"> </td>
|
||||||
|
<td valign="top" colspan="5" width="85%"
|
||||||
|
bgcolor="#008080"><p align="center">Call_traits type:</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#008080"><p
|
||||||
|
align="center">Original type T</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">value_type</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">reference</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">const_reference</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">param_type</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">Applies to:</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">myclass</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">myclass</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">myclass&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
myclass&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">myclass
|
||||||
|
const&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">All user
|
||||||
|
defined types.</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">int</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int const</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">All small
|
||||||
|
built-in types.</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">int*</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int*</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int*&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int*const&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int* const</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">All
|
||||||
|
pointer types.</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">All
|
||||||
|
reference types.</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">const int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const
|
||||||
|
int&</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">All
|
||||||
|
constant-references.</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">int[3]</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const int*</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">int(&)[3]</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const int(&)[3]</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const int*
|
||||||
|
const</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">All array
|
||||||
|
types.</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td valign="top" width="17%" bgcolor="#C0C0C0"><p
|
||||||
|
align="center">const int[3]</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const int*</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const int(&)[3]</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const int(&)[3]</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">const int*
|
||||||
|
const</p>
|
||||||
|
</td>
|
||||||
|
<td valign="top" width="17%"><p align="center">All
|
||||||
|
constant-array types.</p>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<p> </p>
|
||||||
|
|
||||||
|
<h4>Example 1:</h4>
|
||||||
|
|
||||||
|
<p>The following class is a trivial class that stores some type T
|
||||||
|
by value (see the <a href="call_traits_test.cpp">call_traits_test.cpp</a>
|
||||||
|
file), the aim is to illustrate how each of the available
|
||||||
|
call_traits typedefs may be used:</p>
|
||||||
|
|
||||||
|
<pre>template <class T>
|
||||||
|
struct contained
|
||||||
|
{
|
||||||
|
// define our typedefs first, arrays are stored by value
|
||||||
|
// so value_type is not the same as result_type:
|
||||||
|
typedef typename boost::call_traits<T>::param_type param_type;
|
||||||
|
typedef typename boost::call_traits<T>::reference reference;
|
||||||
|
typedef typename boost::call_traits<T>::const_reference const_reference;
|
||||||
|
typedef T value_type;
|
||||||
|
typedef typename boost::call_traits<T>::value_type result_type;
|
||||||
|
|
||||||
|
// stored value:
|
||||||
|
value_type v_;
|
||||||
|
|
||||||
|
// constructors:
|
||||||
|
contained() {}
|
||||||
|
contained(param_type p) : v_(p){}
|
||||||
|
// return byval:
|
||||||
|
result_type value() { return v_; }
|
||||||
|
// return by_ref:
|
||||||
|
reference get() { return v_; }
|
||||||
|
const_reference const_get()const { return v_; }
|
||||||
|
// pass value:
|
||||||
|
void call(param_type p){}
|
||||||
|
|
||||||
|
};</pre>
|
||||||
|
|
||||||
|
<h4><a name="refs"></a>Example 2 (the reference to reference
|
||||||
|
problem):</h4>
|
||||||
|
|
||||||
|
<p>Consider the definition of std::binder1st:</p>
|
||||||
|
|
||||||
|
<pre>template <class Operation>
|
||||||
|
class binder1st :
|
||||||
|
public unary_function<typename Operation::second_argument_type, typename Operation::result_type>
|
||||||
|
{
|
||||||
|
protected:
|
||||||
|
Operation op;
|
||||||
|
typename Operation::first_argument_type value;
|
||||||
|
public:
|
||||||
|
binder1st(const Operation& x, const typename Operation::first_argument_type& y);
|
||||||
|
typename Operation::result_type operator()(const typename Operation::second_argument_type& x) const;
|
||||||
|
}; </pre>
|
||||||
|
|
||||||
|
<p>Now consider what happens in the relatively common case that
|
||||||
|
the functor takes its second argument as a reference, that
|
||||||
|
implies that <code>Operation::second_argument_type</code> is a
|
||||||
|
reference type, <code>operator()</code> will now end up taking a
|
||||||
|
reference to a reference as an argument, and that is not
|
||||||
|
currently legal. The solution here is to modify <code>operator()</code>
|
||||||
|
to use call_traits:</p>
|
||||||
|
|
||||||
|
<pre>typename Operation::result_type operator()(typename call_traits<typename Operation::second_argument_type>::param_type x) const;</pre>
|
||||||
|
|
||||||
|
<p>Now in the case that <code>Operation::second_argument_type</code>
|
||||||
|
is a reference type, the argument is passed as a reference, and
|
||||||
|
the no "reference to reference" occurs.</p>
|
||||||
|
|
||||||
|
<h4><a name="ex3"></a>Example 3 (the make_pair problem):</h4>
|
||||||
|
|
||||||
|
<p>If we pass the name of an array as one (or both) arguments to <code>std::make_pair</code>,
|
||||||
|
then template argument deduction deduces the passed parameter as
|
||||||
|
"const reference to array of T", this also applies to
|
||||||
|
string literals (which are really array literals). Consequently
|
||||||
|
instead of returning a pair of pointers, it tries to return a
|
||||||
|
pair of arrays, and since an array type is not copy-constructible
|
||||||
|
the code fails to compile. One solution is to explicitly cast the
|
||||||
|
arguments to make_pair to pointers, but call_traits provides a
|
||||||
|
better (i.e. automatic) solution (and one that works safely even
|
||||||
|
in generic code where the cast might do the wrong thing):</p>
|
||||||
|
|
||||||
|
<pre>template <class T1, class T2>
|
||||||
|
std::pair<
|
||||||
|
typename boost::call_traits<T1>::value_type,
|
||||||
|
typename boost::call_traits<T2>::value_type>
|
||||||
|
make_pair(const T1& t1, const T2& t2)
|
||||||
|
{
|
||||||
|
return std::pair<
|
||||||
|
typename boost::call_traits<T1>::value_type,
|
||||||
|
typename boost::call_traits<T2>::value_type>(t1, t2);
|
||||||
|
}</pre>
|
||||||
|
|
||||||
|
<p>Here, the deduced argument types will be automatically
|
||||||
|
degraded to pointers if the deduced types are arrays, similar
|
||||||
|
situations occur in the standard binders and adapters: in
|
||||||
|
principle in any function that "wraps" a temporary
|
||||||
|
whose type is deduced. Note that the function arguments to
|
||||||
|
make_pair are not expressed in terms of call_traits: doing so
|
||||||
|
would prevent template argument deduction from functioning.</p>
|
||||||
|
|
||||||
|
<h4><a name="ex4"></a>Example 4 (optimising fill):</h4>
|
||||||
|
|
||||||
|
<p>The call_traits template will "optimize" the passing
|
||||||
|
of a small built-in type as a function parameter, this mainly has
|
||||||
|
an effect when the parameter is used within a loop body. In the
|
||||||
|
following example (see <a
|
||||||
|
href="../type_traits/examples/fill_example.cpp">fill_example.cpp</a>),
|
||||||
|
a version of std::fill is optimized in two ways: if the type
|
||||||
|
passed is a single byte built-in type then std::memset is used to
|
||||||
|
effect the fill, otherwise a conventional C++ implemention is
|
||||||
|
used, but with the passed parameter "optimized" using
|
||||||
|
call_traits:</p>
|
||||||
|
|
||||||
|
<pre>namespace detail{
|
||||||
|
|
||||||
|
template <bool opt>
|
||||||
|
struct filler
|
||||||
|
{
|
||||||
|
template <typename I, typename T>
|
||||||
|
static void do_fill(I first, I last, typename boost::call_traits<T>::param_type val)
|
||||||
|
{
|
||||||
|
while(first != last)
|
||||||
|
{
|
||||||
|
*first = val;
|
||||||
|
++first;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct filler<true>
|
||||||
|
{
|
||||||
|
template <typename I, typename T>
|
||||||
|
static void do_fill(I first, I last, T val)
|
||||||
|
{
|
||||||
|
memset(first, val, last-first);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class I, class T>
|
||||||
|
inline void fill(I first, I last, const T& val)
|
||||||
|
{
|
||||||
|
enum{ can_opt = boost::is_pointer<I>::value
|
||||||
|
&& boost::is_arithmetic<T>::value
|
||||||
|
&& (sizeof(T) == 1) };
|
||||||
|
typedef detail::filler<can_opt> filler_t;
|
||||||
|
filler_t::template do_fill<I,T>(first, last, val);
|
||||||
|
}</pre>
|
||||||
|
|
||||||
|
<p>Footnote: the reason that this is "optimal" for
|
||||||
|
small built-in types is that with the value passed as "T
|
||||||
|
const" instead of "const T&" the compiler is
|
||||||
|
able to tell both that the value is constant and that it is free
|
||||||
|
of aliases. With this information the compiler is able to cache
|
||||||
|
the passed value in a register, unroll the loop, or use
|
||||||
|
explicitly parallel instructions: if any of these are supported.
|
||||||
|
Exactly how much mileage you will get from this depends upon your
|
||||||
|
compiler - we could really use some accurate benchmarking
|
||||||
|
software as part of boost for cases like this.</p>
|
||||||
|
|
||||||
|
<p>Note that the function arguments to fill are not expressed in
|
||||||
|
terms of call_traits: doing so would prevent template argument
|
||||||
|
deduction from functioning. Instead fill acts as a "thin
|
||||||
|
wrapper" that is there to perform template argument
|
||||||
|
deduction, the compiler will optimise away the call to fill all
|
||||||
|
together, replacing it with the call to filler<>::do_fill,
|
||||||
|
which does use call_traits.</p>
|
||||||
|
|
||||||
|
<h3>Rationale</h3>
|
||||||
|
|
||||||
|
<p>The following notes are intended to briefly describe the
|
||||||
|
rational behind choices made in call_traits.</p>
|
||||||
|
|
||||||
|
<p>All user-defined types follow "existing practice"
|
||||||
|
and need no comment.</p>
|
||||||
|
|
||||||
|
<p>Small built-in types (what the standard calls fundamental
|
||||||
|
types [3.9.1]) differ from existing practice only in the <i>param_type</i>
|
||||||
|
typedef. In this case passing "T const" is compatible
|
||||||
|
with existing practice, but may improve performance in some cases
|
||||||
|
(see <a href="#ex4">Example 4</a>), in any case this should never
|
||||||
|
be any worse than existing practice.</p>
|
||||||
|
|
||||||
|
<p>Pointers follow the same rational as small built-in types.</p>
|
||||||
|
|
||||||
|
<p>For reference types the rational follows <a href="#refs">Example
|
||||||
|
2</a> - references to references are not allowed, so the
|
||||||
|
call_traits members must be defined such that these problems do
|
||||||
|
not occur. There is a proposal to modify the language such that
|
||||||
|
"a reference to a reference is a reference" (issue #106,
|
||||||
|
submitted by Bjarne Stroustrup), call_traits<T>::value_type
|
||||||
|
and call_traits<T>::param_type both provide the same effect
|
||||||
|
as that proposal, without the need for a language change (in
|
||||||
|
other words it's a workaround).</p>
|
||||||
|
|
||||||
|
<p>For array types, a function that takes an array as an argument
|
||||||
|
will degrade the array type to a pointer type: this means that
|
||||||
|
the type of the actual parameter is different from its declared
|
||||||
|
type, something that can cause endless problems in template code
|
||||||
|
that relies on the declared type of a parameter. For example:</p>
|
||||||
|
|
||||||
|
<pre>template <class T>
|
||||||
|
struct A
|
||||||
|
{
|
||||||
|
void foo(T t);
|
||||||
|
};</pre>
|
||||||
|
|
||||||
|
<p><font face="Times New Roman">In this case if we instantiate
|
||||||
|
A<int[2]> then the declared type of the parameter passed to
|
||||||
|
member function foo is int[2], but it's actual type is const int*,
|
||||||
|
if we try to use the type T within the function body, then there
|
||||||
|
is a strong likelyhood that our code will not compile:</font></p>
|
||||||
|
|
||||||
|
<pre>template <class T>
|
||||||
|
void A<T>::foo(T t)
|
||||||
|
{
|
||||||
|
T dup(t); // doesn't compile for case that T is an array.
|
||||||
|
}</pre>
|
||||||
|
|
||||||
|
<p>By using call_traits the degradation from array to pointer is
|
||||||
|
explicit, and the type of the parameter is the same as it's
|
||||||
|
declared type:</p>
|
||||||
|
|
||||||
|
<pre>template <class T>
|
||||||
|
struct A
|
||||||
|
{
|
||||||
|
void foo(typename call_traits<T>::value_type t);
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
void A<T>::foo(typename call_traits<T>::value_type t)
|
||||||
|
{
|
||||||
|
typename call_traits<T>::value_type dup(t); // OK even if T is an array type.
|
||||||
|
}</pre>
|
||||||
|
|
||||||
|
<p>For value_type (return by value), again only a pointer may be
|
||||||
|
returned, not a copy of the whole array, and again call_traits
|
||||||
|
makes the degradation explicit. The value_type member is useful
|
||||||
|
whenever an array must be explicitly degraded to a pointer - <a
|
||||||
|
href="#ex3">Example 3</a> provides the test case (Footnote: the
|
||||||
|
array specialisation for call_traits is the least well understood
|
||||||
|
of all the call_traits specialisations, if the given semantics
|
||||||
|
cause specific problems for you, or don't solve a particular
|
||||||
|
array-related problem, then I would be interested to hear about
|
||||||
|
it. Most people though will probably never need to use this
|
||||||
|
specialisation).</p>
|
||||||
|
|
||||||
<hr>
|
<hr>
|
||||||
<tt>
|
|
||||||
Boost.Utility<br>
|
<p>Revised 01 September 2000</p>
|
||||||
<br>
|
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
<p>
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
Copyright 2000 Steve Cleary, Beman Dawes, Howard
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
Hinnant and John Maddock. <br/>
|
||||||
<br>
|
Use, modification and distribution are subject to the
|
||||||
</tt>
|
Boost Software License, Version 1.0.
|
||||||
|
(See accompanying file LICENSE_1_0.txt
|
||||||
|
or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
|
||||||
|
http://www.boost.org/LICENSE_1_0.txt
|
||||||
|
</a>).
|
||||||
|
</p>
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
|
|
||||||
|
|||||||
@@ -21,10 +21,6 @@
|
|||||||
#include <libs/type_traits/test/test.hpp>
|
#include <libs/type_traits/test/test.hpp>
|
||||||
#include <libs/type_traits/test/check_type.hpp>
|
#include <libs/type_traits/test/check_type.hpp>
|
||||||
|
|
||||||
#ifdef BOOST_MSVC
|
|
||||||
#pragma warning(disable:4181) // : warning C4181: qualifier applied to reference type; ignored
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// a way prevent warnings for unused variables
|
// a way prevent warnings for unused variables
|
||||||
template<class T> inline void unused_variable(const T&) {}
|
template<class T> inline void unused_variable(const T&) {}
|
||||||
|
|
||||||
@@ -56,8 +52,7 @@ struct contained
|
|||||||
const_reference const_get()const { return v_; }
|
const_reference const_get()const { return v_; }
|
||||||
// pass value:
|
// pass value:
|
||||||
void call(param_type){}
|
void call(param_type){}
|
||||||
private:
|
|
||||||
contained& operator=(const contained&);
|
|
||||||
};
|
};
|
||||||
|
|
||||||
#ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
#ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
@@ -82,8 +77,6 @@ struct contained<T[N]>
|
|||||||
reference get() { return v_; }
|
reference get() { return v_; }
|
||||||
const_reference const_get()const { return v_; }
|
const_reference const_get()const { return v_; }
|
||||||
void call(param_type){}
|
void call(param_type){}
|
||||||
private:
|
|
||||||
contained& operator=(const contained&);
|
|
||||||
};
|
};
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
@@ -204,16 +197,14 @@ struct comparible_UDT
|
|||||||
bool operator == (const comparible_UDT& v){ return v.i_ == i_; }
|
bool operator == (const comparible_UDT& v){ return v.i_ == i_; }
|
||||||
};
|
};
|
||||||
|
|
||||||
int main()
|
int main(int argc, char *argv[ ])
|
||||||
{
|
{
|
||||||
call_traits_checker<comparible_UDT> c1;
|
call_traits_checker<comparible_UDT> c1;
|
||||||
comparible_UDT u;
|
comparible_UDT u;
|
||||||
c1(u);
|
c1(u);
|
||||||
call_traits_checker<int> c2;
|
call_traits_checker<int> c2;
|
||||||
call_traits_checker<enum_UDT> c2b;
|
|
||||||
int i = 2;
|
int i = 2;
|
||||||
c2(i);
|
c2(i);
|
||||||
c2b(one);
|
|
||||||
int* pi = &i;
|
int* pi = &i;
|
||||||
int a[2] = {1,2};
|
int a[2] = {1,2};
|
||||||
#if defined(BOOST_MSVC6_MEMBER_TEMPLATES) && !defined(__ICL)
|
#if defined(BOOST_MSVC6_MEMBER_TEMPLATES) && !defined(__ICL)
|
||||||
@@ -294,11 +285,7 @@ int main()
|
|||||||
BOOST_CHECK_TYPE(incomplete_type&, boost::call_traits<incomplete_type>::reference);
|
BOOST_CHECK_TYPE(incomplete_type&, boost::call_traits<incomplete_type>::reference);
|
||||||
BOOST_CHECK_TYPE(const incomplete_type&, boost::call_traits<incomplete_type>::const_reference);
|
BOOST_CHECK_TYPE(const incomplete_type&, boost::call_traits<incomplete_type>::const_reference);
|
||||||
BOOST_CHECK_TYPE(const incomplete_type&, boost::call_traits<incomplete_type>::param_type);
|
BOOST_CHECK_TYPE(const incomplete_type&, boost::call_traits<incomplete_type>::param_type);
|
||||||
// test enum:
|
|
||||||
BOOST_CHECK_TYPE(enum_UDT, boost::call_traits<enum_UDT>::value_type);
|
|
||||||
BOOST_CHECK_TYPE(enum_UDT&, boost::call_traits<enum_UDT>::reference);
|
|
||||||
BOOST_CHECK_TYPE(const enum_UDT&, boost::call_traits<enum_UDT>::const_reference);
|
|
||||||
BOOST_CHECK_TYPE(const enum_UDT, boost::call_traits<enum_UDT>::param_type);
|
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -376,7 +363,7 @@ void call_traits_test<T, true>::assert_construct(typename boost::call_traits<T>:
|
|||||||
reference r = t;
|
reference r = t;
|
||||||
const_reference cr = t;
|
const_reference cr = t;
|
||||||
reference r2 = r;
|
reference r2 = r;
|
||||||
#ifndef BOOST_BORLANDC
|
#ifndef __BORLANDC__
|
||||||
// C++ Builder buglet:
|
// C++ Builder buglet:
|
||||||
const_reference cr2 = r;
|
const_reference cr2 = r;
|
||||||
#endif
|
#endif
|
||||||
@@ -393,7 +380,7 @@ void call_traits_test<T, true>::assert_construct(typename boost::call_traits<T>:
|
|||||||
unused_variable(v3);
|
unused_variable(v3);
|
||||||
unused_variable(v4);
|
unused_variable(v4);
|
||||||
unused_variable(v5);
|
unused_variable(v5);
|
||||||
#ifndef BOOST_BORLANDC
|
#ifndef __BORLANDC__
|
||||||
unused_variable(r2);
|
unused_variable(r2);
|
||||||
unused_variable(cr2);
|
unused_variable(cr2);
|
||||||
#endif
|
#endif
|
||||||
@@ -1,19 +1,122 @@
|
|||||||
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
|
||||||
<html>
|
<html>
|
||||||
<head>
|
<head>
|
||||||
<title>Boost.Utility</title>
|
<title>Boost: checked_delete.hpp documentation</title>
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
|
||||||
</head>
|
</head>
|
||||||
<body>
|
<body bgcolor="white" style="MARGIN-LEFT: 5%; MARGIN-RIGHT: 5%">
|
||||||
Automatic redirection failed, please go to
|
<table border="0" width="100%">
|
||||||
<a href="../core/doc/html/core/checked_delete.html">../core/doc/html/core/checked_delete.html</a>
|
<tr>
|
||||||
<hr>
|
<td width="277"><A href="../../index.htm"> <img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86" border="0"></A>
|
||||||
<tt>
|
</td>
|
||||||
Boost.Utility<br>
|
<td align="center">
|
||||||
|
<h1>checked_delete.hpp</h1>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td colspan="2" height="64"> </td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
<p>
|
||||||
|
The header <STRONG><boost/checked_delete.hpp></STRONG> defines two
|
||||||
|
function templates, <STRONG>checked_delete</STRONG> and <STRONG>checked_array_delete</STRONG>,
|
||||||
|
and two class templates, <STRONG>checked_deleter</STRONG> and <STRONG>checked_array_deleter</STRONG>.
|
||||||
|
</p>
|
||||||
|
<P>The C++ Standard allows, in 5.3.5/5, pointers to incomplete class types to be
|
||||||
|
deleted with a <EM>delete-expression</EM>. When the class has a non-trivial
|
||||||
|
destructor, or a class-specific operator delete, the behavior is undefined.
|
||||||
|
Some compilers issue a warning when an incomplete type is deleted, but
|
||||||
|
unfortunately, not all do, and programmers sometimes ignore or disable
|
||||||
|
warnings.</P>
|
||||||
|
<P>A particularly troublesome case is when a smart pointer's destructor, such as <STRONG>
|
||||||
|
boost::scoped_ptr<T>::~scoped_ptr</STRONG>, is instantiated with an
|
||||||
|
incomplete type. This can often lead to silent, hard to track failures.</P>
|
||||||
|
<P>The supplied function and class templates can be used to prevent these problems,
|
||||||
|
as they require a complete type, and cause a compilation error otherwise.</P>
|
||||||
|
<h3><a name="Synopsis">Synopsis</a></h3>
|
||||||
|
<pre>
|
||||||
|
namespace boost
|
||||||
|
{
|
||||||
|
|
||||||
|
template<class T> void checked_delete(T * p);
|
||||||
|
template<class T> void checked_array_delete(T * p);
|
||||||
|
template<class T> struct checked_deleter;
|
||||||
|
template<class T> struct checked_array_deleter;
|
||||||
|
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
<h3>checked_delete</h3>
|
||||||
|
<h4><a name="checked_delete">template<class T> void checked_delete(T * p);</a></h4>
|
||||||
|
<blockquote>
|
||||||
|
<p>
|
||||||
|
<b>Requires:</b> <b>T</b> must be a complete type. The expression <tt>delete p</tt>
|
||||||
|
must be well-formed.
|
||||||
|
</p>
|
||||||
|
<p>
|
||||||
|
<b>Effects:</b> <tt>delete p;</tt>
|
||||||
|
</p>
|
||||||
|
</blockquote>
|
||||||
|
<h3>checked_array_delete</h3>
|
||||||
|
<h4><a name="checked_array_delete">template<class T> void checked_array_delete(T
|
||||||
|
* p);</a></h4>
|
||||||
|
<blockquote>
|
||||||
|
<p>
|
||||||
|
<b>Requires:</b> <b>T</b> must be a complete type. The expression <tt>delete [] p</tt>
|
||||||
|
must be well-formed.
|
||||||
|
</p>
|
||||||
|
<p>
|
||||||
|
<b>Effects:</b> <tt>delete [] p;</tt>
|
||||||
|
</p>
|
||||||
|
</blockquote>
|
||||||
|
<h3>checked_deleter</h3>
|
||||||
|
<pre>
|
||||||
|
template<class T> struct checked_deleter
|
||||||
|
{
|
||||||
|
typedef void result_type;
|
||||||
|
typedef T * argument_type;
|
||||||
|
void operator()(T * p) const;
|
||||||
|
};
|
||||||
|
</pre>
|
||||||
|
<h4>void checked_deleter<T>::operator()(T * p) const;</h4>
|
||||||
|
<blockquote>
|
||||||
|
<p>
|
||||||
|
<b>Requires:</b> <b>T</b> must be a complete type. The expression <tt>delete p</tt>
|
||||||
|
must be well-formed.
|
||||||
|
</p>
|
||||||
|
<p>
|
||||||
|
<b>Effects:</b> <tt>delete p;</tt>
|
||||||
|
</p>
|
||||||
|
</blockquote>
|
||||||
|
<h3>checked_array_deleter</h3>
|
||||||
|
<pre>
|
||||||
|
template<class T> struct checked_array_deleter
|
||||||
|
{
|
||||||
|
typedef void result_type;
|
||||||
|
typedef T * argument_type;
|
||||||
|
void operator()(T * p) const;
|
||||||
|
};
|
||||||
|
</pre>
|
||||||
|
<h4>void checked_array_deleter<T>::operator()(T * p) const;</h4>
|
||||||
|
<blockquote>
|
||||||
|
<p>
|
||||||
|
<b>Requires:</b> <b>T</b> must be a complete type. The expression <tt>delete [] p</tt>
|
||||||
|
must be well-formed.
|
||||||
|
</p>
|
||||||
|
<p>
|
||||||
|
<b>Effects:</b> <tt>delete [] p;</tt>
|
||||||
|
</p>
|
||||||
|
</blockquote>
|
||||||
|
<h3><a name="Acknowledgements">Acknowledgements</a></h3>
|
||||||
|
<p>
|
||||||
|
The function templates <STRONG>checked_delete</STRONG> and <STRONG>checked_array_delete</STRONG>
|
||||||
|
were originally part of <STRONG><boost/utility.hpp></STRONG>, and the
|
||||||
|
documentation acknowledged Beman Dawes, Dave Abrahams, Vladimir Prus, Rainer
|
||||||
|
Deyke, John Maddock, and others as contributors.
|
||||||
|
</p>
|
||||||
|
<p>
|
||||||
<br>
|
<br>
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
<small>Copyright <20> 2002 by Peter Dimov. Distributed under the Boost Software License, Version
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
|
||||||
<br>
|
|
||||||
</tt>
|
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
|
|||||||
28
checked_delete_test.cpp
Normal file
28
checked_delete_test.cpp
Normal file
@@ -0,0 +1,28 @@
|
|||||||
|
// Boost checked_delete test program ---------------------------------------//
|
||||||
|
|
||||||
|
// Copyright Beman Dawes 2001. 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/utility for documentation.
|
||||||
|
|
||||||
|
// Revision History
|
||||||
|
// 21 May 01 Initial version (Beman Dawes)
|
||||||
|
|
||||||
|
#include <boost/checked_delete.hpp> // for checked_delete
|
||||||
|
|
||||||
|
// This program demonstrates compiler errors when trying to delete an
|
||||||
|
// incomplete type.
|
||||||
|
|
||||||
|
namespace
|
||||||
|
{
|
||||||
|
class Incomplete;
|
||||||
|
}
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
Incomplete * p = 0;
|
||||||
|
boost::checked_delete(p); // should cause compile time error
|
||||||
|
boost::checked_array_delete(p); // should cause compile time error
|
||||||
|
return 0;
|
||||||
|
} // main
|
||||||
@@ -1,19 +1,76 @@
|
|||||||
<html>
|
<html>
|
||||||
<head>
|
<head>
|
||||||
<title>Boost.Utility</title>
|
<title>Header </title>
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
|
||||||
|
<meta name="Template" content="C:\PROGRAM FILES\MICROSOFT OFFICE\OFFICE\html.dot">
|
||||||
|
<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
|
||||||
|
<boostcompressed_pair.hpp>
|
||||||
</head>
|
</head>
|
||||||
<body>
|
<body bgcolor="#ffffff" text="#000000" link="#0000ff" vlink="#800080">
|
||||||
Automatic redirection failed, please go to
|
<h2><img src="../../boost.png" width="276" height="86">Header <<a href="../../boost/detail/compressed_pair.hpp">boost/compressed_pair.hpp</a>></h2>
|
||||||
<a href="./doc/html/utility/utilities/compressed_pair.html">./doc/html/utility/utilities/compressed_pair.html</a>
|
<p>All of the contents of <boost/compressed_pair.hpp> are defined inside
|
||||||
|
namespace boost.</p>
|
||||||
|
<p>The class compressed pair is very similar to std::pair, but if either of the
|
||||||
|
template arguments are empty classes, then the "empty base-class optimisation"
|
||||||
|
is applied to compress the size of the pair.</p>
|
||||||
|
<pre>template <class T1, class T2>
|
||||||
|
class compressed_pair
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
typedef T1 first_type;
|
||||||
|
typedef T2 second_type;
|
||||||
|
typedef typename call_traits<first_type>::param_type first_param_type;
|
||||||
|
typedef typename call_traits<second_type>::param_type second_param_type;
|
||||||
|
typedef typename call_traits<first_type>::reference first_reference;
|
||||||
|
typedef typename call_traits<second_type>::reference second_reference;
|
||||||
|
typedef typename call_traits<first_type>::const_reference first_const_reference;
|
||||||
|
typedef typename call_traits<second_type>::const_reference second_const_reference;
|
||||||
|
|
||||||
|
compressed_pair() : base() {}
|
||||||
|
compressed_pair(first_param_type x, second_param_type y);
|
||||||
|
explicit compressed_pair(first_param_type x);
|
||||||
|
explicit compressed_pair(second_param_type y);
|
||||||
|
|
||||||
|
compressed_pair& operator=(const compressed_pair&);
|
||||||
|
|
||||||
|
first_reference first();
|
||||||
|
first_const_reference first() const;
|
||||||
|
|
||||||
|
second_reference second();
|
||||||
|
second_const_reference second() const;
|
||||||
|
|
||||||
|
void swap(compressed_pair& y);
|
||||||
|
};</pre>
|
||||||
|
<p>The two members of the pair can be accessed using the member functions first()
|
||||||
|
and second(). Note that not all member functions can be instantiated for all
|
||||||
|
template parameter types. In particular compressed_pair can be instantiated for
|
||||||
|
reference and array types, however in these cases the range of constructors
|
||||||
|
that can be used are limited. If types T1 and T2 are the same type, then there
|
||||||
|
is only one version of the single-argument constructor, and this constructor
|
||||||
|
initialises both values in the pair to the passed value.</p>
|
||||||
|
<P>Note that if either member is a POD type, then that member is not
|
||||||
|
zero-initialized by the compressed_pair default constructor: it's up to you to
|
||||||
|
supply an initial value for these types if you want them to have a default
|
||||||
|
value.</P>
|
||||||
|
<p>Note that compressed_pair can not be instantiated if either of the template
|
||||||
|
arguments is a union type, unless there is compiler support for
|
||||||
|
boost::is_union, or if boost::is_union is specialised for the union type.</p>
|
||||||
|
<p>Finally, a word of caution for Visual C++ 6 users: if either argument is an
|
||||||
|
empty type, then assigning to that member will produce memory corruption,
|
||||||
|
unless the empty type has a "do nothing" assignment operator defined. This is
|
||||||
|
due to a bug in the way VC6 generates implicit assignment operators.</p>
|
||||||
|
<h3>Acknowledgements</h3>
|
||||||
|
<p>Based on contributions by Steve Cleary, Beman Dawes, Howard Hinnant and John
|
||||||
|
Maddock.</p>
|
||||||
|
<p>Maintained by <a href="mailto:john@johnmaddock.co.uk">John Maddock</a>, the
|
||||||
|
latest version of this file can be found at <a href="http://www.boost.org">www.boost.org</a>,
|
||||||
|
and the boost discussion list at <a href="http://www.yahoogroups.com/list/boost">www.yahoogroups.com/list/boost</a>.</p>
|
||||||
<hr>
|
<hr>
|
||||||
<tt>
|
<p>Revised
|
||||||
Boost.Utility<br>
|
<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B %Y" startspan -->07 November 2007<!--webbot bot="Timestamp" endspan i-checksum="40338" --></p>
|
||||||
<br>
|
<p><EFBFBD> Copyright Beman Dawes, 2000.</p>
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
<p>Distributed under the Boost Software License, Version 1.0. See
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a></p>
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
|
||||||
<br>
|
|
||||||
</tt>
|
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
@@ -14,7 +14,7 @@
|
|||||||
#include <cassert>
|
#include <cassert>
|
||||||
|
|
||||||
#include <boost/compressed_pair.hpp>
|
#include <boost/compressed_pair.hpp>
|
||||||
#include <boost/core/lightweight_test.hpp>
|
#include <boost/test/test_tools.hpp>
|
||||||
|
|
||||||
using namespace boost;
|
using namespace boost;
|
||||||
|
|
||||||
@@ -79,47 +79,47 @@ void compressed_pair_tester<T1, T2>::test(first_param_type p1, second_param_type
|
|||||||
// first param construct:
|
// first param construct:
|
||||||
boost::compressed_pair<T1,T2> cp2(p1);
|
boost::compressed_pair<T1,T2> cp2(p1);
|
||||||
cp2.second() = p2;
|
cp2.second() = p2;
|
||||||
BOOST_TEST(cp2.first() == p1);
|
BOOST_CHECK(cp2.first() == p1);
|
||||||
BOOST_TEST(cp2.second() == p2);
|
BOOST_CHECK(cp2.second() == p2);
|
||||||
// second param construct:
|
// second param construct:
|
||||||
boost::compressed_pair<T1,T2> cp3(p2);
|
boost::compressed_pair<T1,T2> cp3(p2);
|
||||||
cp3.first() = p1;
|
cp3.first() = p1;
|
||||||
BOOST_TEST(cp3.second() == p2);
|
BOOST_CHECK(cp3.second() == p2);
|
||||||
BOOST_TEST(cp3.first() == p1);
|
BOOST_CHECK(cp3.first() == p1);
|
||||||
// both param construct:
|
// both param construct:
|
||||||
boost::compressed_pair<T1,T2> cp4(p1, p2);
|
boost::compressed_pair<T1,T2> cp4(p1, p2);
|
||||||
BOOST_TEST(cp4.first() == p1);
|
BOOST_CHECK(cp4.first() == p1);
|
||||||
BOOST_TEST(cp4.second() == p2);
|
BOOST_CHECK(cp4.second() == p2);
|
||||||
boost::compressed_pair<T1,T2> cp5(p3, p4);
|
boost::compressed_pair<T1,T2> cp5(p3, p4);
|
||||||
BOOST_TEST(cp5.first() == p3);
|
BOOST_CHECK(cp5.first() == p3);
|
||||||
BOOST_TEST(cp5.second() == p4);
|
BOOST_CHECK(cp5.second() == p4);
|
||||||
// check const members:
|
// check const members:
|
||||||
const boost::compressed_pair<T1,T2>& cpr1 = cp4;
|
const boost::compressed_pair<T1,T2>& cpr1 = cp4;
|
||||||
BOOST_TEST(cpr1.first() == p1);
|
BOOST_CHECK(cpr1.first() == p1);
|
||||||
BOOST_TEST(cpr1.second() == p2);
|
BOOST_CHECK(cpr1.second() == p2);
|
||||||
|
|
||||||
// copy construct:
|
// copy construct:
|
||||||
boost::compressed_pair<T1,T2> cp6(cp4);
|
boost::compressed_pair<T1,T2> cp6(cp4);
|
||||||
BOOST_TEST(cp6.first() == p1);
|
BOOST_CHECK(cp6.first() == p1);
|
||||||
BOOST_TEST(cp6.second() == p2);
|
BOOST_CHECK(cp6.second() == p2);
|
||||||
// assignment:
|
// assignment:
|
||||||
cp1 = cp4;
|
cp1 = cp4;
|
||||||
BOOST_TEST(cp1.first() == p1);
|
BOOST_CHECK(cp1.first() == p1);
|
||||||
BOOST_TEST(cp1.second() == p2);
|
BOOST_CHECK(cp1.second() == p2);
|
||||||
cp1 = cp5;
|
cp1 = cp5;
|
||||||
BOOST_TEST(cp1.first() == p3);
|
BOOST_CHECK(cp1.first() == p3);
|
||||||
BOOST_TEST(cp1.second() == p4);
|
BOOST_CHECK(cp1.second() == p4);
|
||||||
// swap:
|
// swap:
|
||||||
cp4.swap(cp5);
|
cp4.swap(cp5);
|
||||||
BOOST_TEST(cp4.first() == p3);
|
BOOST_CHECK(cp4.first() == p3);
|
||||||
BOOST_TEST(cp4.second() == p4);
|
BOOST_CHECK(cp4.second() == p4);
|
||||||
BOOST_TEST(cp5.first() == p1);
|
BOOST_CHECK(cp5.first() == p1);
|
||||||
BOOST_TEST(cp5.second() == p2);
|
BOOST_CHECK(cp5.second() == p2);
|
||||||
swap(cp4,cp5);
|
swap(cp4,cp5);
|
||||||
BOOST_TEST(cp4.first() == p1);
|
BOOST_CHECK(cp4.first() == p1);
|
||||||
BOOST_TEST(cp4.second() == p2);
|
BOOST_CHECK(cp4.second() == p2);
|
||||||
BOOST_TEST(cp5.first() == p3);
|
BOOST_CHECK(cp5.first() == p3);
|
||||||
BOOST_TEST(cp5.second() == p4);
|
BOOST_CHECK(cp5.second() == p4);
|
||||||
}
|
}
|
||||||
|
|
||||||
//
|
//
|
||||||
@@ -148,20 +148,20 @@ void compressed_pair_reference_tester<T1, T2>::test(first_param_type p1, second_
|
|||||||
#endif
|
#endif
|
||||||
// both param construct:
|
// both param construct:
|
||||||
boost::compressed_pair<T1,T2> cp4(p1, p2);
|
boost::compressed_pair<T1,T2> cp4(p1, p2);
|
||||||
BOOST_TEST(cp4.first() == p1);
|
BOOST_CHECK(cp4.first() == p1);
|
||||||
BOOST_TEST(cp4.second() == p2);
|
BOOST_CHECK(cp4.second() == p2);
|
||||||
boost::compressed_pair<T1,T2> cp5(p3, p4);
|
boost::compressed_pair<T1,T2> cp5(p3, p4);
|
||||||
BOOST_TEST(cp5.first() == p3);
|
BOOST_CHECK(cp5.first() == p3);
|
||||||
BOOST_TEST(cp5.second() == p4);
|
BOOST_CHECK(cp5.second() == p4);
|
||||||
// check const members:
|
// check const members:
|
||||||
const boost::compressed_pair<T1,T2>& cpr1 = cp4;
|
const boost::compressed_pair<T1,T2>& cpr1 = cp4;
|
||||||
BOOST_TEST(cpr1.first() == p1);
|
BOOST_CHECK(cpr1.first() == p1);
|
||||||
BOOST_TEST(cpr1.second() == p2);
|
BOOST_CHECK(cpr1.second() == p2);
|
||||||
|
|
||||||
// copy construct:
|
// copy construct:
|
||||||
boost::compressed_pair<T1,T2> cp6(cp4);
|
boost::compressed_pair<T1,T2> cp6(cp4);
|
||||||
BOOST_TEST(cp6.first() == p1);
|
BOOST_CHECK(cp6.first() == p1);
|
||||||
BOOST_TEST(cp6.second() == p2);
|
BOOST_CHECK(cp6.second() == p2);
|
||||||
// assignment:
|
// assignment:
|
||||||
// VC6 bug:
|
// VC6 bug:
|
||||||
// When second() is an empty class, VC6 performs the
|
// When second() is an empty class, VC6 performs the
|
||||||
@@ -174,8 +174,8 @@ void compressed_pair_reference_tester<T1, T2>::test(first_param_type p1, second_
|
|||||||
// settings - some generate the problem others do not.
|
// settings - some generate the problem others do not.
|
||||||
cp4.first() = p3;
|
cp4.first() = p3;
|
||||||
cp4.second() = p4;
|
cp4.second() = p4;
|
||||||
BOOST_TEST(cp4.first() == p3);
|
BOOST_CHECK(cp4.first() == p3);
|
||||||
BOOST_TEST(cp4.second() == p4);
|
BOOST_CHECK(cp4.second() == p4);
|
||||||
}
|
}
|
||||||
//
|
//
|
||||||
// supplimentary tests for case where first arg only is a reference type:
|
// supplimentary tests for case where first arg only is a reference type:
|
||||||
@@ -199,8 +199,8 @@ void compressed_pair_reference1_tester<T1, T2>::test(first_param_type p1, second
|
|||||||
// first param construct:
|
// first param construct:
|
||||||
boost::compressed_pair<T1,T2> cp2(p1);
|
boost::compressed_pair<T1,T2> cp2(p1);
|
||||||
cp2.second() = p2;
|
cp2.second() = p2;
|
||||||
BOOST_TEST(cp2.first() == p1);
|
BOOST_CHECK(cp2.first() == p1);
|
||||||
BOOST_TEST(cp2.second() == p2);
|
BOOST_CHECK(cp2.second() == p2);
|
||||||
#endif
|
#endif
|
||||||
}
|
}
|
||||||
//
|
//
|
||||||
@@ -225,8 +225,8 @@ void compressed_pair_reference2_tester<T1, T2>::test(first_param_type p1, second
|
|||||||
// second param construct:
|
// second param construct:
|
||||||
boost::compressed_pair<T1,T2> cp3(p2);
|
boost::compressed_pair<T1,T2> cp3(p2);
|
||||||
cp3.first() = p1;
|
cp3.first() = p1;
|
||||||
BOOST_TEST(cp3.second() == p2);
|
BOOST_CHECK(cp3.second() == p2);
|
||||||
BOOST_TEST(cp3.first() == p1);
|
BOOST_CHECK(cp3.first() == p1);
|
||||||
#endif
|
#endif
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -253,14 +253,14 @@ void compressed_pair_array1_tester<T1, T2>::test(first_param_type p1, second_par
|
|||||||
// second param construct:
|
// second param construct:
|
||||||
boost::compressed_pair<T1,T2> cp3(p2);
|
boost::compressed_pair<T1,T2> cp3(p2);
|
||||||
cp3.first()[0] = p1[0];
|
cp3.first()[0] = p1[0];
|
||||||
BOOST_TEST(cp3.second() == p2);
|
BOOST_CHECK(cp3.second() == p2);
|
||||||
BOOST_TEST(cp3.first()[0] == p1[0]);
|
BOOST_CHECK(cp3.first()[0] == p1[0]);
|
||||||
// check const members:
|
// check const members:
|
||||||
const boost::compressed_pair<T1,T2>& cpr1 = cp3;
|
const boost::compressed_pair<T1,T2>& cpr1 = cp3;
|
||||||
BOOST_TEST(cpr1.first()[0] == p1[0]);
|
BOOST_CHECK(cpr1.first()[0] == p1[0]);
|
||||||
BOOST_TEST(cpr1.second() == p2);
|
BOOST_CHECK(cpr1.second() == p2);
|
||||||
|
|
||||||
BOOST_TEST(sizeof(T1) == sizeof(cp1.first()));
|
BOOST_CHECK(sizeof(T1) == sizeof(cp1.first()));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class T1, class T2>
|
template <class T1, class T2>
|
||||||
@@ -283,14 +283,14 @@ void compressed_pair_array2_tester<T1, T2>::test(first_param_type p1, second_par
|
|||||||
// first param construct:
|
// first param construct:
|
||||||
boost::compressed_pair<T1,T2> cp2(p1);
|
boost::compressed_pair<T1,T2> cp2(p1);
|
||||||
cp2.second()[0] = p2[0];
|
cp2.second()[0] = p2[0];
|
||||||
BOOST_TEST(cp2.first() == p1);
|
BOOST_CHECK(cp2.first() == p1);
|
||||||
BOOST_TEST(cp2.second()[0] == p2[0]);
|
BOOST_CHECK(cp2.second()[0] == p2[0]);
|
||||||
// check const members:
|
// check const members:
|
||||||
const boost::compressed_pair<T1,T2>& cpr1 = cp2;
|
const boost::compressed_pair<T1,T2>& cpr1 = cp2;
|
||||||
BOOST_TEST(cpr1.first() == p1);
|
BOOST_CHECK(cpr1.first() == p1);
|
||||||
BOOST_TEST(cpr1.second()[0] == p2[0]);
|
BOOST_CHECK(cpr1.second()[0] == p2[0]);
|
||||||
|
|
||||||
BOOST_TEST(sizeof(T2) == sizeof(cp1.second()));
|
BOOST_CHECK(sizeof(T2) == sizeof(cp1.second()));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class T1, class T2>
|
template <class T1, class T2>
|
||||||
@@ -312,18 +312,18 @@ void compressed_pair_array_tester<T1, T2>::test(first_param_type p1, second_para
|
|||||||
boost::compressed_pair<T1,T2> cp1;
|
boost::compressed_pair<T1,T2> cp1;
|
||||||
cp1.first()[0] = p1[0];
|
cp1.first()[0] = p1[0];
|
||||||
cp1.second()[0] = p2[0];
|
cp1.second()[0] = p2[0];
|
||||||
BOOST_TEST(cp1.first()[0] == p1[0]);
|
BOOST_CHECK(cp1.first()[0] == p1[0]);
|
||||||
BOOST_TEST(cp1.second()[0] == p2[0]);
|
BOOST_CHECK(cp1.second()[0] == p2[0]);
|
||||||
// check const members:
|
// check const members:
|
||||||
const boost::compressed_pair<T1,T2>& cpr1 = cp1;
|
const boost::compressed_pair<T1,T2>& cpr1 = cp1;
|
||||||
BOOST_TEST(cpr1.first()[0] == p1[0]);
|
BOOST_CHECK(cpr1.first()[0] == p1[0]);
|
||||||
BOOST_TEST(cpr1.second()[0] == p2[0]);
|
BOOST_CHECK(cpr1.second()[0] == p2[0]);
|
||||||
|
|
||||||
BOOST_TEST(sizeof(T1) == sizeof(cp1.first()));
|
BOOST_CHECK(sizeof(T1) == sizeof(cp1.first()));
|
||||||
BOOST_TEST(sizeof(T2) == sizeof(cp1.second()));
|
BOOST_CHECK(sizeof(T2) == sizeof(cp1.second()));
|
||||||
}
|
}
|
||||||
|
|
||||||
int main()
|
int test_main(int, char *[])
|
||||||
{
|
{
|
||||||
// declare some variables to pass to the tester:
|
// declare some variables to pass to the tester:
|
||||||
non_empty1 ne1(2);
|
non_empty1 ne1(2);
|
||||||
@@ -383,5 +383,13 @@ int main()
|
|||||||
compressed_pair_array2_tester<empty_POD_UDT,non_empty2[2]>::test(e1, nea3, e1, nea4);
|
compressed_pair_array2_tester<empty_POD_UDT,non_empty2[2]>::test(e1, nea3, e1, nea4);
|
||||||
// T1 == T2, both non-empty
|
// T1 == T2, both non-empty
|
||||||
compressed_pair_array_tester<non_empty1[2],non_empty1[2]>::test(nea1, nea1, nea2, nea2);
|
compressed_pair_array_tester<non_empty1[2],non_empty1[2]>::test(nea1, nea1, nea2, nea2);
|
||||||
return boost::report_errors();
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
unsigned int expected_failures = 0;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
36
current_function.html
Normal file
36
current_function.html
Normal file
@@ -0,0 +1,36 @@
|
|||||||
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
|
||||||
|
<html>
|
||||||
|
<head>
|
||||||
|
<title>Boost: current_function.hpp documentation</title>
|
||||||
|
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
|
||||||
|
</head>
|
||||||
|
<body bgcolor="white" style="MARGIN-LEFT: 5%; MARGIN-RIGHT: 5%">
|
||||||
|
<table border="0" width="100%">
|
||||||
|
<tr>
|
||||||
|
<td width="277"><A href="../../index.htm"> <img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86" border="0"></A>
|
||||||
|
</td>
|
||||||
|
<td align="center">
|
||||||
|
<h1>current_function.hpp</h1>
|
||||||
|
</td>
|
||||||
|
</tr>
|
||||||
|
<tr>
|
||||||
|
<td colspan="2" height="64"> </td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
<p>
|
||||||
|
The header <STRONG><boost/current_function.hpp></STRONG> defines a single
|
||||||
|
macro, <STRONG>BOOST_CURRENT_FUNCTION</STRONG>,<STRONG> </STRONG>similar to the
|
||||||
|
C99 predefined identifier <STRONG>__func__</STRONG>.
|
||||||
|
</p>
|
||||||
|
<P><STRONG>BOOST_CURRENT_FUNCTION</STRONG> expands to a string literal containing
|
||||||
|
the (fully qualified, if possible) name of the enclosing function. If there is
|
||||||
|
no enclosing function, the behavior is undefined.</P>
|
||||||
|
<p>Some compilers do not provide a way to obtain the name of the current enclosing
|
||||||
|
function. On such compilers, the string literal has an unspecified value.</p>
|
||||||
|
<p>
|
||||||
|
<br>
|
||||||
|
<small>Copyright <20> 2002 by Peter Dimov. 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>.</small></p>
|
||||||
|
</body>
|
||||||
|
</html>
|
||||||
40
current_function_test.cpp
Normal file
40
current_function_test.cpp
Normal file
@@ -0,0 +1,40 @@
|
|||||||
|
#include <boost/config.hpp>
|
||||||
|
|
||||||
|
#if defined(BOOST_MSVC)
|
||||||
|
#pragma warning(disable: 4786) // identifier truncated in debug info
|
||||||
|
#pragma warning(disable: 4710) // function not inlined
|
||||||
|
#pragma warning(disable: 4711) // function selected for automatic inline expansion
|
||||||
|
#pragma warning(disable: 4514) // unreferenced inline removed
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//
|
||||||
|
// current_function_test.cpp - a test for boost/current_function.hpp
|
||||||
|
//
|
||||||
|
// Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
|
||||||
|
//
|
||||||
|
// Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
// accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
#include <boost/current_function.hpp>
|
||||||
|
#include <boost/config.hpp>
|
||||||
|
#include <cstdio>
|
||||||
|
|
||||||
|
void message(char const * file, long line, char const * func, char const * msg)
|
||||||
|
{
|
||||||
|
#if !defined(BOOST_NO_STDC_NAMESPACE)
|
||||||
|
using std::printf;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
printf("%s(%ld): %s in function '%s'\n", file, line, msg, func);
|
||||||
|
}
|
||||||
|
|
||||||
|
#define MESSAGE(msg) message(__FILE__, __LINE__, BOOST_CURRENT_FUNCTION, msg)
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
MESSAGE("assertion failed");
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
4
doc/.gitignore
vendored
4
doc/.gitignore
vendored
@@ -1,4 +0,0 @@
|
|||||||
html
|
|
||||||
xml
|
|
||||||
temp
|
|
||||||
out.txt
|
|
||||||
@@ -1,81 +0,0 @@
|
|||||||
[/
|
|
||||||
/ Copyright (c) 2012 Marshall Clow
|
|
||||||
/ Copyright (c) 2021, Alan Freitas
|
|
||||||
/ 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)
|
|
||||||
/]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[#sec:BOOST_BINARY]
|
|
||||||
[section Binary Integer Literals]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Introduction]
|
|
||||||
|
|
||||||
The macro `BOOST_BINARY` is used for the representation of binary
|
|
||||||
literals. It takes as an argument a binary number arranged as an
|
|
||||||
arbitrary amount of 1s and 0s in groupings of length 1 to 8, with
|
|
||||||
groups separated by spaces. The macro serves as a replacement for
|
|
||||||
[@https://en.cppreference.com/w/cpp/language/integer_literal binary integer literals],
|
|
||||||
adopted in C++14.
|
|
||||||
|
|
||||||
The type of the literal yielded is determined by the same rules as
|
|
||||||
those of [@https://en.cppreference.com/w/cpp/language/integer_literal hex and octal literals].
|
|
||||||
By implementation, this macro expands directly to an octal literal during preprocessing, so
|
|
||||||
there is no overhead at runtime and the result is usable in any place that an octal literal
|
|
||||||
would be.
|
|
||||||
|
|
||||||
In order to directly support binary literals with suffixes,
|
|
||||||
additional macros of the form `BOOST_BINARY_XXX` are also
|
|
||||||
provided, where `XXX` is a standard integer suffix in all capital
|
|
||||||
letters.
|
|
||||||
|
|
||||||
In addition, LL and ULL suffixes may be used for representing
|
|
||||||
`long long` and `unsigned long long` types in compilers which provide
|
|
||||||
them as an extension.
|
|
||||||
|
|
||||||
The `BOOST_BINARY` family of macros resides in the header
|
|
||||||
[@../../../../boost/utility/binary.hpp <boost/utility/binary.hpp>].
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Example]
|
|
||||||
|
|
||||||
```
|
|
||||||
void foo( int );
|
|
||||||
|
|
||||||
void foo( unsigned long );
|
|
||||||
|
|
||||||
void bar()
|
|
||||||
{
|
|
||||||
int value1 = BOOST_BINARY( 100 111000 01 1 110 );
|
|
||||||
|
|
||||||
unsigned long value2 = BOOST_BINARY_UL( 100 001 ); // unsigned long
|
|
||||||
|
|
||||||
long long value3 = BOOST_BINARY_LL( 11 000 ); // long long if supported
|
|
||||||
|
|
||||||
__assert__( BOOST_BINARY( 10010 )
|
|
||||||
& BOOST_BINARY( 11000 )
|
|
||||||
== BOOST_BINARY( 10000 )
|
|
||||||
);
|
|
||||||
|
|
||||||
foo( BOOST_BINARY( 1010 ) ); // calls the first foo
|
|
||||||
|
|
||||||
foo( BOOST_BINARY_LU( 1010 ) ); // calls the second foo
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[xinclude tmp/boost_binary_reference.xml]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
|
|
||||||
[section Acknowledgments]
|
|
||||||
|
|
||||||
Contributed by Matt Calabrese.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
413
doc/Jamfile.v2
413
doc/Jamfile.v2
@@ -1,413 +0,0 @@
|
|||||||
# Copyright John Maddock 2005. Use, modification, and distribution are
|
|
||||||
# subject to the Boost Software License, Version 1.0. (See accompanying
|
|
||||||
# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
|
|
||||||
import project ;
|
|
||||||
import doxygen ;
|
|
||||||
import quickbook ;
|
|
||||||
|
|
||||||
project boost/libs/utility/doc ;
|
|
||||||
|
|
||||||
path-constant INCLUDES : ../../.. ;
|
|
||||||
path-constant boost-images : ../../../doc/src/images ;
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for base_from_member component in base_from_member_reference.xml
|
|
||||||
doxygen base_from_member_reference
|
|
||||||
:
|
|
||||||
$(INCLUDES)/boost/utility/base_from_member.hpp
|
|
||||||
:
|
|
||||||
<location>tmp
|
|
||||||
<doxygen:param>ENABLE_PREPROCESSING=YES
|
|
||||||
<doxygen:param>EXPAND_ONLY_PREDEF=YES
|
|
||||||
<doxygen:param>EXTRACT_ALL=NO
|
|
||||||
<doxygen:param>EXTRACT_PRIVATE=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>MACRO_EXPANSION=YES
|
|
||||||
<doxygen:param>"PREDEFINED= \\
|
|
||||||
BOOST_UTILITY_DOCS \\
|
|
||||||
BOOST_SYMBOL_VISIBLE= \\
|
|
||||||
BOOST_FORCEINLINE=inline \\
|
|
||||||
BOOST_GPU_ENABLED= \\
|
|
||||||
BOOST_STATIC_ASSERT(x)= \\
|
|
||||||
BOOST_STATIC_ASSERT_MSG(x,y)= \\
|
|
||||||
BOOST_STATIC_CONSTANT(x,y)=\"static constexpr x y\" \\
|
|
||||||
BOOST_RV_REF(x)=\"x&&\" \\
|
|
||||||
BOOST_NESTED_TEMPLATE=template \\
|
|
||||||
BOOST_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CXX14_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_OPERATORS_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CONSTEXPR_OR_CONST=constexpr \\
|
|
||||||
BOOST_NOEXCEPT=noexcept \\
|
|
||||||
BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
|
|
||||||
BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
|
|
||||||
BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
|
|
||||||
BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
|
|
||||||
BOOST_DELETED_FUNCTION(x)=\"x = delete;\" \\
|
|
||||||
BOOST_EXPLICIT_OPERATOR_BOOL()=\"explicit operator bool() const;\" \\
|
|
||||||
BOOST_REF_CONST=const"
|
|
||||||
<doxygen:param>"EXCLUDE_SYMBOLS= \\
|
|
||||||
detail \\
|
|
||||||
F \\
|
|
||||||
result_of_has_result_type_impl \\
|
|
||||||
conditional \\
|
|
||||||
boost::operators_impl"
|
|
||||||
<xsl:param>"boost.doxygen.reftitle=Reference"
|
|
||||||
<xsl:param>"boost.doxygen.refid=base_from_member.reference"
|
|
||||||
;
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for boost_binary component in boost_binary_reference.xml
|
|
||||||
doxygen boost_binary_reference
|
|
||||||
:
|
|
||||||
$(INCLUDES)/boost/utility/binary.hpp
|
|
||||||
:
|
|
||||||
<location>tmp
|
|
||||||
<doxygen:param>ENABLE_PREPROCESSING=YES
|
|
||||||
<doxygen:param>EXPAND_ONLY_PREDEF=YES
|
|
||||||
<doxygen:param>EXTRACT_ALL=NO
|
|
||||||
<doxygen:param>EXTRACT_PRIVATE=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>MACRO_EXPANSION=YES
|
|
||||||
<doxygen:param>"PREDEFINED= \\
|
|
||||||
BOOST_UTILITY_DOCS \\
|
|
||||||
BOOST_SYMBOL_VISIBLE= \\
|
|
||||||
BOOST_FORCEINLINE=inline \\
|
|
||||||
BOOST_GPU_ENABLED= \\
|
|
||||||
BOOST_STATIC_ASSERT(x)= \\
|
|
||||||
BOOST_STATIC_ASSERT_MSG(x,y)= \\
|
|
||||||
BOOST_STATIC_CONSTANT(x,y)=\"static constexpr x y\" \\
|
|
||||||
BOOST_RV_REF(x)=\"x&&\" \\
|
|
||||||
BOOST_NESTED_TEMPLATE=template \\
|
|
||||||
BOOST_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CXX14_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_OPERATORS_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CONSTEXPR_OR_CONST=constexpr \\
|
|
||||||
BOOST_NOEXCEPT=noexcept \\
|
|
||||||
BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
|
|
||||||
BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
|
|
||||||
BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
|
|
||||||
BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
|
|
||||||
BOOST_DELETED_FUNCTION(x)=\"x = delete;\" \\
|
|
||||||
BOOST_EXPLICIT_OPERATOR_BOOL()=\"explicit operator bool() const;\" \\
|
|
||||||
BOOST_REF_CONST=const"
|
|
||||||
<doxygen:param>"EXCLUDE_SYMBOLS= \\
|
|
||||||
detail \\
|
|
||||||
F \\
|
|
||||||
result_of_has_result_type_impl \\
|
|
||||||
conditional \\
|
|
||||||
boost::operators_impl"
|
|
||||||
<xsl:param>"boost.doxygen.reftitle=Reference"
|
|
||||||
<xsl:param>"boost.doxygen.refid=boost_binary.reference"
|
|
||||||
;
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for call_traits component in call_traits_reference.xml
|
|
||||||
doxygen call_traits_reference
|
|
||||||
:
|
|
||||||
$(INCLUDES)/boost/call_traits.hpp
|
|
||||||
$(INCLUDES)/boost/detail/call_traits.hpp
|
|
||||||
:
|
|
||||||
<location>tmp
|
|
||||||
<doxygen:param>ENABLE_PREPROCESSING=YES
|
|
||||||
<doxygen:param>EXPAND_ONLY_PREDEF=YES
|
|
||||||
<doxygen:param>EXTRACT_ALL=NO
|
|
||||||
<doxygen:param>EXTRACT_PRIVATE=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>MACRO_EXPANSION=YES
|
|
||||||
<doxygen:param>"PREDEFINED= \\
|
|
||||||
BOOST_UTILITY_DOCS \\
|
|
||||||
BOOST_SYMBOL_VISIBLE= \\
|
|
||||||
BOOST_FORCEINLINE=inline \\
|
|
||||||
BOOST_GPU_ENABLED= \\
|
|
||||||
BOOST_STATIC_ASSERT(x)= \\
|
|
||||||
BOOST_STATIC_ASSERT_MSG(x,y)= \\
|
|
||||||
BOOST_STATIC_CONSTANT(x,y)=\"static constexpr x y\" \\
|
|
||||||
BOOST_RV_REF(x)=\"x&&\" \\
|
|
||||||
BOOST_NESTED_TEMPLATE=template \\
|
|
||||||
BOOST_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CXX14_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_OPERATORS_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CONSTEXPR_OR_CONST=constexpr \\
|
|
||||||
BOOST_NOEXCEPT=noexcept \\
|
|
||||||
BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
|
|
||||||
BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
|
|
||||||
BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
|
|
||||||
BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
|
|
||||||
BOOST_DELETED_FUNCTION(x)=\"x = delete;\" \\
|
|
||||||
BOOST_EXPLICIT_OPERATOR_BOOL()=\"explicit operator bool() const;\" \\
|
|
||||||
BOOST_REF_CONST=const"
|
|
||||||
<doxygen:param>"EXCLUDE_SYMBOLS= \\
|
|
||||||
detail \\
|
|
||||||
F \\
|
|
||||||
result_of_has_result_type_impl \\
|
|
||||||
conditional \\
|
|
||||||
boost::operators_impl"
|
|
||||||
<xsl:param>"boost.doxygen.reftitle=Reference"
|
|
||||||
<xsl:param>"boost.doxygen.refid=call_traits.reference"
|
|
||||||
;
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for compressed_pair component in compressed_pair_reference.xml
|
|
||||||
doxygen compressed_pair_reference
|
|
||||||
:
|
|
||||||
$(INCLUDES)/boost/compressed_pair.hpp
|
|
||||||
$(INCLUDES)/boost/detail/compressed_pair.hpp
|
|
||||||
:
|
|
||||||
<location>tmp
|
|
||||||
<doxygen:param>ENABLE_PREPROCESSING=YES
|
|
||||||
<doxygen:param>EXPAND_ONLY_PREDEF=YES
|
|
||||||
<doxygen:param>EXTRACT_ALL=NO
|
|
||||||
<doxygen:param>EXTRACT_PRIVATE=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>MACRO_EXPANSION=YES
|
|
||||||
<doxygen:param>"PREDEFINED= \\
|
|
||||||
BOOST_UTILITY_DOCS \\
|
|
||||||
BOOST_SYMBOL_VISIBLE= \\
|
|
||||||
BOOST_FORCEINLINE=inline \\
|
|
||||||
BOOST_GPU_ENABLED= \\
|
|
||||||
BOOST_STATIC_ASSERT(x)= \\
|
|
||||||
BOOST_STATIC_ASSERT_MSG(x,y)= \\
|
|
||||||
BOOST_STATIC_CONSTANT(x,y)=\"static constexpr x y\" \\
|
|
||||||
BOOST_RV_REF(x)=\"x&&\" \\
|
|
||||||
BOOST_NESTED_TEMPLATE=template \\
|
|
||||||
BOOST_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CXX14_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_OPERATORS_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CONSTEXPR_OR_CONST=constexpr \\
|
|
||||||
BOOST_NOEXCEPT=noexcept \\
|
|
||||||
BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
|
|
||||||
BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
|
|
||||||
BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
|
|
||||||
BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
|
|
||||||
BOOST_DELETED_FUNCTION(x)=\"x = delete;\" \\
|
|
||||||
BOOST_EXPLICIT_OPERATOR_BOOL()=\"explicit operator bool() const;\" \\
|
|
||||||
BOOST_REF_CONST=const"
|
|
||||||
<doxygen:param>"EXCLUDE_SYMBOLS= \\
|
|
||||||
detail \\
|
|
||||||
F \\
|
|
||||||
result_of_has_result_type_impl \\
|
|
||||||
conditional \\
|
|
||||||
boost::operators_impl"
|
|
||||||
<xsl:param>"boost.doxygen.reftitle=Reference"
|
|
||||||
<xsl:param>"boost.doxygen.refid=compressed_pair.reference"
|
|
||||||
;
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for in_place_factory component in in_place_factory_reference.xml
|
|
||||||
doxygen in_place_factory_reference
|
|
||||||
:
|
|
||||||
$(INCLUDES)/boost/utility/in_place_factory.hpp
|
|
||||||
$(INCLUDES)/boost/utility/typed_in_place_factory.hpp
|
|
||||||
:
|
|
||||||
<location>tmp
|
|
||||||
<doxygen:param>ENABLE_PREPROCESSING=YES
|
|
||||||
<doxygen:param>EXPAND_ONLY_PREDEF=YES
|
|
||||||
<doxygen:param>EXTRACT_ALL=NO
|
|
||||||
<doxygen:param>EXTRACT_PRIVATE=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>MACRO_EXPANSION=YES
|
|
||||||
<doxygen:param>"PREDEFINED= \\
|
|
||||||
BOOST_UTILITY_DOCS \\
|
|
||||||
BOOST_SYMBOL_VISIBLE= \\
|
|
||||||
BOOST_FORCEINLINE=inline \\
|
|
||||||
BOOST_GPU_ENABLED= \\
|
|
||||||
BOOST_STATIC_ASSERT(x)= \\
|
|
||||||
BOOST_STATIC_ASSERT_MSG(x,y)= \\
|
|
||||||
BOOST_STATIC_CONSTANT(x,y)=\"static constexpr x y\" \\
|
|
||||||
BOOST_RV_REF(x)=\"x&&\" \\
|
|
||||||
BOOST_NESTED_TEMPLATE=template \\
|
|
||||||
BOOST_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CXX14_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_OPERATORS_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CONSTEXPR_OR_CONST=constexpr \\
|
|
||||||
BOOST_NOEXCEPT=noexcept \\
|
|
||||||
BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
|
|
||||||
BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
|
|
||||||
BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
|
|
||||||
BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
|
|
||||||
BOOST_DELETED_FUNCTION(x)=\"x = delete;\" \\
|
|
||||||
BOOST_EXPLICIT_OPERATOR_BOOL()=\"explicit operator bool() const;\" \\
|
|
||||||
BOOST_REF_CONST=const"
|
|
||||||
<doxygen:param>"EXCLUDE_SYMBOLS= \\
|
|
||||||
detail \\
|
|
||||||
F \\
|
|
||||||
result_of_has_result_type_impl \\
|
|
||||||
conditional \\
|
|
||||||
boost::operators_impl"
|
|
||||||
<xsl:param>"boost.doxygen.reftitle=Reference"
|
|
||||||
<xsl:param>"boost.doxygen.refid=in_place_factory.reference"
|
|
||||||
;
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for operators component in operators_reference.xml
|
|
||||||
# we skip operators_reference because operators.hpp is not adapted for doxygen
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for result_of component in result_of_reference.xml
|
|
||||||
doxygen result_of_reference
|
|
||||||
:
|
|
||||||
$(INCLUDES)/boost/utility/result_of.hpp
|
|
||||||
:
|
|
||||||
<location>tmp
|
|
||||||
<doxygen:param>ENABLE_PREPROCESSING=YES
|
|
||||||
<doxygen:param>EXPAND_ONLY_PREDEF=YES
|
|
||||||
<doxygen:param>EXTRACT_ALL=NO
|
|
||||||
<doxygen:param>EXTRACT_PRIVATE=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>MACRO_EXPANSION=YES
|
|
||||||
<doxygen:param>"PREDEFINED= \\
|
|
||||||
BOOST_UTILITY_DOCS \\
|
|
||||||
BOOST_SYMBOL_VISIBLE= \\
|
|
||||||
BOOST_FORCEINLINE=inline \\
|
|
||||||
BOOST_GPU_ENABLED= \\
|
|
||||||
BOOST_STATIC_ASSERT(x)= \\
|
|
||||||
BOOST_STATIC_ASSERT_MSG(x,y)= \\
|
|
||||||
BOOST_STATIC_CONSTANT(x,y)=\"static constexpr x y\" \\
|
|
||||||
BOOST_RV_REF(x)=\"x&&\" \\
|
|
||||||
BOOST_NESTED_TEMPLATE=template \\
|
|
||||||
BOOST_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CXX14_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_OPERATORS_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CONSTEXPR_OR_CONST=constexpr \\
|
|
||||||
BOOST_NOEXCEPT=noexcept \\
|
|
||||||
BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
|
|
||||||
BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
|
|
||||||
BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
|
|
||||||
BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
|
|
||||||
BOOST_DELETED_FUNCTION(x)=\"x = delete;\" \\
|
|
||||||
BOOST_EXPLICIT_OPERATOR_BOOL()=\"explicit operator bool() const;\" \\
|
|
||||||
BOOST_REF_CONST=const"
|
|
||||||
<doxygen:param>"EXCLUDE_SYMBOLS= \\
|
|
||||||
detail \\
|
|
||||||
F \\
|
|
||||||
result_of_has_result_type_impl \\
|
|
||||||
conditional \\
|
|
||||||
boost::operators_impl"
|
|
||||||
<xsl:param>"boost.doxygen.reftitle=Reference"
|
|
||||||
<xsl:param>"boost.doxygen.refid=result_of.reference"
|
|
||||||
;
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for string_view component in string_view_reference.xml
|
|
||||||
doxygen string_view_reference
|
|
||||||
:
|
|
||||||
$(INCLUDES)/boost/utility/string_view.hpp
|
|
||||||
:
|
|
||||||
<location>tmp
|
|
||||||
<doxygen:param>ENABLE_PREPROCESSING=YES
|
|
||||||
<doxygen:param>EXPAND_ONLY_PREDEF=YES
|
|
||||||
<doxygen:param>EXTRACT_ALL=NO
|
|
||||||
<doxygen:param>EXTRACT_PRIVATE=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>MACRO_EXPANSION=YES
|
|
||||||
<doxygen:param>"PREDEFINED= \\
|
|
||||||
BOOST_UTILITY_DOCS \\
|
|
||||||
BOOST_SYMBOL_VISIBLE= \\
|
|
||||||
BOOST_FORCEINLINE=inline \\
|
|
||||||
BOOST_GPU_ENABLED= \\
|
|
||||||
BOOST_STATIC_ASSERT(x)= \\
|
|
||||||
BOOST_STATIC_ASSERT_MSG(x,y)= \\
|
|
||||||
BOOST_STATIC_CONSTANT(x,y)=\"static constexpr x y\" \\
|
|
||||||
BOOST_RV_REF(x)=\"x&&\" \\
|
|
||||||
BOOST_NESTED_TEMPLATE=template \\
|
|
||||||
BOOST_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CXX14_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_OPERATORS_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CONSTEXPR_OR_CONST=constexpr \\
|
|
||||||
BOOST_NOEXCEPT=noexcept \\
|
|
||||||
BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
|
|
||||||
BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
|
|
||||||
BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
|
|
||||||
BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
|
|
||||||
BOOST_DELETED_FUNCTION(x)=\"x = delete;\" \\
|
|
||||||
BOOST_EXPLICIT_OPERATOR_BOOL()=\"explicit operator bool() const;\" \\
|
|
||||||
BOOST_REF_CONST=const"
|
|
||||||
<doxygen:param>"EXCLUDE_SYMBOLS= \\
|
|
||||||
detail \\
|
|
||||||
F \\
|
|
||||||
result_of_has_result_type_impl \\
|
|
||||||
conditional \\
|
|
||||||
boost::operators_impl"
|
|
||||||
<xsl:param>"boost.doxygen.reftitle=Reference"
|
|
||||||
<xsl:param>"boost.doxygen.refid=string_view.reference"
|
|
||||||
;
|
|
||||||
|
|
||||||
# Generate XML doxygen reference for value_init component in value_init_reference.xml
|
|
||||||
doxygen value_init_reference
|
|
||||||
:
|
|
||||||
$(INCLUDES)/boost/utility/value_init.hpp
|
|
||||||
:
|
|
||||||
<location>tmp
|
|
||||||
<doxygen:param>ENABLE_PREPROCESSING=YES
|
|
||||||
<doxygen:param>EXPAND_ONLY_PREDEF=YES
|
|
||||||
<doxygen:param>EXTRACT_ALL=NO
|
|
||||||
<doxygen:param>EXTRACT_PRIVATE=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>MACRO_EXPANSION=YES
|
|
||||||
<doxygen:param>"PREDEFINED= \\
|
|
||||||
BOOST_UTILITY_DOCS \\
|
|
||||||
BOOST_SYMBOL_VISIBLE= \\
|
|
||||||
BOOST_FORCEINLINE=inline \\
|
|
||||||
BOOST_GPU_ENABLED= \\
|
|
||||||
BOOST_STATIC_ASSERT(x)= \\
|
|
||||||
BOOST_STATIC_ASSERT_MSG(x,y)= \\
|
|
||||||
BOOST_STATIC_CONSTANT(x,y)=\"static constexpr x y\" \\
|
|
||||||
BOOST_RV_REF(x)=\"x&&\" \\
|
|
||||||
BOOST_NESTED_TEMPLATE=template \\
|
|
||||||
BOOST_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CXX14_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_OPERATORS_CONSTEXPR=constexpr \\
|
|
||||||
BOOST_CONSTEXPR_OR_CONST=constexpr \\
|
|
||||||
BOOST_NOEXCEPT=noexcept \\
|
|
||||||
BOOST_NOEXCEPT_IF(x)=noexcept(x) \\
|
|
||||||
BOOST_NOEXCEPT_OR_NOTHROW=noexcept \\
|
|
||||||
BOOST_COPY_ASSIGN_REF(x)=\"x const&\" \\
|
|
||||||
BOOST_DEFAULTED_FUNCTION(x,y)=\"x = default;\" \\
|
|
||||||
BOOST_DELETED_FUNCTION(x)=\"x = delete;\" \\
|
|
||||||
BOOST_EXPLICIT_OPERATOR_BOOL()=\"explicit operator bool() const;\" \\
|
|
||||||
BOOST_REF_CONST=const"
|
|
||||||
<doxygen:param>"EXCLUDE_SYMBOLS= \\
|
|
||||||
detail \\
|
|
||||||
F \\
|
|
||||||
result_of_has_result_type_impl \\
|
|
||||||
conditional \\
|
|
||||||
boost::operators_impl"
|
|
||||||
<xsl:param>"boost.doxygen.reftitle=Reference"
|
|
||||||
<xsl:param>"boost.doxygen.refid=value_init.reference"
|
|
||||||
;
|
|
||||||
|
|
||||||
# Generate main.xml boostbook documentation from main.qbk quickbook documentation
|
|
||||||
xml main : main.qbk ;
|
|
||||||
|
|
||||||
# Generate ./html documentation from main.xml boostbook documentation
|
|
||||||
# Each doxygen reference in quickbook files with [xinclude tmp/<component>_reference.xml] becomes:
|
|
||||||
# <xi:include href="../../../../libs/utility/doc/tmp/<component>_reference.xml"/>
|
|
||||||
# in boostbook.
|
|
||||||
# All of these <xi:include> commands give the reference the id "utility.reference"
|
|
||||||
boostbook standalone_main
|
|
||||||
:
|
|
||||||
main
|
|
||||||
:
|
|
||||||
<dependency>base_from_member_reference
|
|
||||||
<dependency>boost_binary_reference
|
|
||||||
<dependency>call_traits_reference
|
|
||||||
<dependency>compressed_pair_reference
|
|
||||||
<dependency>in_place_factory_reference
|
|
||||||
<dependency>result_of_reference
|
|
||||||
<dependency>string_view_reference
|
|
||||||
<dependency>value_init_reference
|
|
||||||
# File name of HTML output:
|
|
||||||
# <xsl:param>root.filename=main
|
|
||||||
<xsl:param>boost.root=../../../..
|
|
||||||
<format>pdf:<xsl:param>"boost.url.prefix=http://www.boost.org/doc/libs/release/libs/utility/doc/html"
|
|
||||||
# How far down we chunk nested sections: no more than two so utility component pages include their reference
|
|
||||||
<xsl:param>chunk.section.depth=2 # 8
|
|
||||||
# Don't put the first section on the same page as the TOC:
|
|
||||||
<xsl:param>chunk.first.sections=1 # 1
|
|
||||||
# How far down sections get TOC: 2 so we show each Utility component in main page but no more than that
|
|
||||||
<xsl:param>toc.section.depth=2 # 2
|
|
||||||
# Max depth in each TOC: 2 so we show each Utility component in main page but no more than that
|
|
||||||
<xsl:param>toc.max.depth=2 # 2
|
|
||||||
# How far down we go with TOC's in main page: 2 so each Utility component page has 1 level TOC
|
|
||||||
<xsl:param>generate.section.toc.level=2 # 2
|
|
||||||
;
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
alias boostdoc ;
|
|
||||||
explicit boostdoc ;
|
|
||||||
|
|
||||||
alias boostrelease : standalone_main ;
|
|
||||||
explicit boostrelease ;
|
|
||||||
@@ -1,376 +0,0 @@
|
|||||||
[/
|
|
||||||
Copyright 2001, 2003, 2004, 2012 Daryle Walker.
|
|
||||||
Copyright (c) 2021, Alan Freitas
|
|
||||||
|
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
|
||||||
|
|
||||||
See accompanying file LICENSE_1_0.txt
|
|
||||||
or copy at http://boost.org/LICENSE_1_0.txt
|
|
||||||
]
|
|
||||||
|
|
||||||
[section:base_from_member Base from Member]
|
|
||||||
[block'''<?dbhtml stop-chunking?>''']
|
|
||||||
|
|
||||||
[section Introduction]
|
|
||||||
|
|
||||||
The class templates __base_from_member__ support the base-from-member idiom.
|
|
||||||
When developing a class, sometimes a base class needs to be initialized
|
|
||||||
with a member of the current class. As a na\u00EFve example:
|
|
||||||
|
|
||||||
```
|
|
||||||
#include <streambuf> /* for std::streambuf */
|
|
||||||
#include <ostream> /* for std::ostream */
|
|
||||||
|
|
||||||
class fdoutbuf
|
|
||||||
: public __std_streambuf__
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
explicit fdoutbuf( int fd );
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
|
|
||||||
class fdostream
|
|
||||||
: public __std_ostream__
|
|
||||||
{
|
|
||||||
protected:
|
|
||||||
fdoutbuf buf;
|
|
||||||
public:
|
|
||||||
explicit fdostream( int fd )
|
|
||||||
: buf( fd ), __std_ostream__( &buf ) {}
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
This is undefined because C++'s initialization order mandates that the base
|
|
||||||
class is initialized before the member it uses. [@http://www.moocat.org R.
|
|
||||||
Samuel Klatchko] developed a way around this by using the initialization
|
|
||||||
order in his favor. Base classes are initialized in order of declaration, so
|
|
||||||
moving the desired member to another base class, that is initialized before
|
|
||||||
the desired base class, can ensure proper initialization.
|
|
||||||
|
|
||||||
A custom base class can be made for this idiom:
|
|
||||||
|
|
||||||
#include <streambuf> /* for std::streambuf */
|
|
||||||
#include <ostream> /* for std::ostream */
|
|
||||||
|
|
||||||
class fdoutbuf
|
|
||||||
: public __std_streambuf__
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
explicit fdoutbuf( int fd );
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
|
|
||||||
struct fdostream_pbase
|
|
||||||
{
|
|
||||||
fdoutbuf sbuffer;
|
|
||||||
|
|
||||||
explicit fdostream_pbase( int fd )
|
|
||||||
: sbuffer( fd ) {}
|
|
||||||
};
|
|
||||||
|
|
||||||
class fdostream
|
|
||||||
: private fdostream_pbase
|
|
||||||
, public __std_ostream__
|
|
||||||
{
|
|
||||||
typedef fdostream_pbase pbase_type;
|
|
||||||
typedef __std_ostream__ base_type;
|
|
||||||
|
|
||||||
public:
|
|
||||||
explicit fdostream( int fd )
|
|
||||||
: pbase_type( fd ), base_type( &sbuffer ) {}
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
|
|
||||||
Other projects can use similar custom base classes. The technique is basic
|
|
||||||
enough to make a template, with a sample template class in this library.
|
|
||||||
The main template parameter is the type of the enclosed member. The
|
|
||||||
template class has several (explicit) constructor member templates, which
|
|
||||||
implicitly type the constructor arguments and pass them to the member. The
|
|
||||||
template class uses implicit copy construction and assignment, cancelling
|
|
||||||
them if the enclosed member is non-copyable.
|
|
||||||
|
|
||||||
Manually coding a base class may be better if the construction and/or
|
|
||||||
copying needs are too complex for the supplied template class, or if the
|
|
||||||
compiler is not advanced enough to use it.
|
|
||||||
|
|
||||||
Since base classes are unnamed, a class cannot have multiple (direct) base
|
|
||||||
classes of the same type. The supplied template class has an extra template
|
|
||||||
parameter, an integer, that exists solely to provide type differentiation.
|
|
||||||
This parameter has a default value so a single use of a particular member
|
|
||||||
type does not need to concern itself with the integer.
|
|
||||||
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Synopsis]
|
|
||||||
|
|
||||||
#include <type_traits> /* exposition only */
|
|
||||||
|
|
||||||
#ifndef BOOST_BASE_FROM_MEMBER_MAX_ARITY
|
|
||||||
#define BOOST_BASE_FROM_MEMBER_MAX_ARITY 10
|
|
||||||
#endif
|
|
||||||
|
|
||||||
template < typename MemberType, int UniqueID = 0 >
|
|
||||||
class __base_from_member__
|
|
||||||
{
|
|
||||||
protected:
|
|
||||||
MemberType member;
|
|
||||||
|
|
||||||
#if ``['C++11 is in use]``
|
|
||||||
template< typename ...T >
|
|
||||||
explicit constexpr __base_from_member__( T&& ...x )
|
|
||||||
noexcept( __std_is_nothrow_constructible__<MemberType, T...>::value );
|
|
||||||
#else
|
|
||||||
__base_from_member__();
|
|
||||||
|
|
||||||
template< typename T1 >
|
|
||||||
explicit __base_from_member__( T1 x1 );
|
|
||||||
|
|
||||||
template< typename T1, typename T2 >
|
|
||||||
__base_from_member__( T1 x1, T2 x2 );
|
|
||||||
|
|
||||||
//...
|
|
||||||
|
|
||||||
template< typename T1, typename T2, typename T3, typename T4,
|
|
||||||
typename T5, typename T6, typename T7, typename T8, typename T9,
|
|
||||||
typename T10 >
|
|
||||||
__base_from_member__( T1 x1, T2 x2, T3 x3, T4 x4, T5 x5, T6 x6, T7 x7,
|
|
||||||
T8 x8, T9 x9, T10 x10 );
|
|
||||||
#endif
|
|
||||||
};
|
|
||||||
|
|
||||||
template < typename MemberType, int UniqueID >
|
|
||||||
class __base_from_member__<MemberType&, UniqueID>
|
|
||||||
{
|
|
||||||
protected:
|
|
||||||
MemberType& member;
|
|
||||||
|
|
||||||
explicit constexpr __base_from_member__( MemberType& x )
|
|
||||||
noexcept;
|
|
||||||
};
|
|
||||||
|
|
||||||
The class template has a first template parameter `MemberType` representing
|
|
||||||
the type of the based-member. It has a last template parameter `UniqueID`,
|
|
||||||
that is an `int`, to differentiate between multiple base classes that use
|
|
||||||
the same based-member type. The last template parameter has a default value
|
|
||||||
of zero if it is omitted. The class template has a protected data member
|
|
||||||
called `member` that the derived class can use for later base classes or
|
|
||||||
itself.
|
|
||||||
|
|
||||||
If the appropriate features of C++11 are present, there will be a single
|
|
||||||
constructor template. It implements ['perfect forwarding] to the best
|
|
||||||
constructor call of `member` if any. The constructor template is marked
|
|
||||||
both `constexpr` and `explicit`. The former will be ignored if the
|
|
||||||
corresponding inner constructor call of `member` does not have the marker.
|
|
||||||
The latter binds the other way; always taking effect, even when the inner
|
|
||||||
constructor call does not have the marker. The constructor template
|
|
||||||
propagates the `noexcept` status of the inner constructor call. The
|
|
||||||
constructor template has a trailing parameter with a default value that
|
|
||||||
disables the template when its signature is too close to the signatures of
|
|
||||||
the automatically-defined non-template copy- and/or move-constructors of
|
|
||||||
__base_from_member__.
|
|
||||||
|
|
||||||
On earlier-standard compilers, there is a default constructor and several
|
|
||||||
constructor member templates. These constructor templates can take as many
|
|
||||||
arguments (currently up to ten) as possible and pass them to a constructor
|
|
||||||
of the data member.
|
|
||||||
|
|
||||||
A specialization for member references offers a single constructor taking
|
|
||||||
a `MemberType&`, which is the only way to initialize a reference.
|
|
||||||
|
|
||||||
Since C++ does not allow any way to explicitly state the template parameters
|
|
||||||
of a templated constructor, make sure that the arguments are already close
|
|
||||||
as possible to the actual type used in the data member's desired constructor.
|
|
||||||
Explicit conversions may be necessary.
|
|
||||||
|
|
||||||
The `BOOST_BASE_FROM_MEMBER_MAX_ARITY` macro constant specifies the maximum
|
|
||||||
argument length for the constructor templates. The constant may be overridden
|
|
||||||
if more (or less) argument configurations are needed. The constant may be
|
|
||||||
read for code that is expandable like the class template and needs to
|
|
||||||
maintain the same maximum size. (Example code would be a class that uses
|
|
||||||
this class template as a base class for a member with a flexible set of
|
|
||||||
constructors.) This constant is ignored when C++11 features are present.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Basic Usage]
|
|
||||||
|
|
||||||
With the starting example, the `fdoutbuf` sub-object needs to be
|
|
||||||
encapsulated in a base class that is inherited before `__std_ostream__`.
|
|
||||||
|
|
||||||
```
|
|
||||||
#include <boost/utility/base_from_member.hpp>
|
|
||||||
|
|
||||||
#include <streambuf> // for std::streambuf
|
|
||||||
#include <ostream> // for __std_ostream__
|
|
||||||
|
|
||||||
class fdoutbuf
|
|
||||||
: public __std_streambuf__
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
explicit fdoutbuf( int fd );
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
|
|
||||||
class fdostream
|
|
||||||
: private __boost_base_from_member__<fdoutbuf>
|
|
||||||
, public __std_ostream__
|
|
||||||
{
|
|
||||||
// Helper typedef's
|
|
||||||
typedef __boost_base_from_member__<fdoutbuf> pbase_type;
|
|
||||||
typedef __std_ostream__ base_type;
|
|
||||||
|
|
||||||
public:
|
|
||||||
explicit fdostream( int fd )
|
|
||||||
: pbase_type( fd ), base_type( &member ){}
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
The base-from-member idiom is an implementation detail, so it should not
|
|
||||||
be visible to the clients (or any derived classes) of `fdostream`. Due to
|
|
||||||
the initialization order, the `fdoutbuf` sub-object will get initialized
|
|
||||||
before the `__std_ostream__` sub-object does, making the former sub-object
|
|
||||||
safe to use in the latter sub-object's construction. Since the `fdoutbuf`
|
|
||||||
sub-object of the final type is the only sub-object with the name `member`
|
|
||||||
that name can be used unqualified within the final class.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Multiple Sub-Objects]
|
|
||||||
|
|
||||||
The base-from-member class templates should commonly involve only one
|
|
||||||
base-from-member sub-object, usually for attaching a stream-buffer to an
|
|
||||||
I/O stream. The next example demonstrates how to use multiple
|
|
||||||
base-from-member sub-objects and the resulting qualification issues.
|
|
||||||
|
|
||||||
```
|
|
||||||
#include <boost/utility/base_from_member.hpp>
|
|
||||||
|
|
||||||
#include <cstddef> /* for NULL */
|
|
||||||
|
|
||||||
struct an_int
|
|
||||||
{
|
|
||||||
int y;
|
|
||||||
|
|
||||||
an_int( float yf );
|
|
||||||
};
|
|
||||||
|
|
||||||
class switcher
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
switcher();
|
|
||||||
switcher( double, int * );
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
|
|
||||||
class flow_regulator
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
flow_regulator( switcher &, switcher & );
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
|
|
||||||
template < unsigned Size >
|
|
||||||
class fan
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
explicit fan( switcher );
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
|
|
||||||
class system
|
|
||||||
: private __boost_base_from_member__<an_int>
|
|
||||||
, private __boost_base_from_member__<switcher>
|
|
||||||
, private __boost_base_from_member__<switcher, 1>
|
|
||||||
, private __boost_base_from_member__<switcher, 2>
|
|
||||||
, protected flow_regulator
|
|
||||||
, public fan<6>
|
|
||||||
{
|
|
||||||
// Helper typedef's
|
|
||||||
typedef __boost_base_from_member__<an_int> pbase0_type;
|
|
||||||
typedef __boost_base_from_member__<switcher> pbase1_type;
|
|
||||||
typedef __boost_base_from_member__<switcher, 1> pbase2_type;
|
|
||||||
typedef __boost_base_from_member__<switcher, 2> pbase3_type;
|
|
||||||
|
|
||||||
typedef flow_regulator base1_type;
|
|
||||||
typedef fan<6> base2_type;
|
|
||||||
|
|
||||||
public:
|
|
||||||
system( double x );
|
|
||||||
//...
|
|
||||||
};
|
|
||||||
|
|
||||||
system::system( double x )
|
|
||||||
: pbase0_type( 0.2 )
|
|
||||||
, pbase1_type()
|
|
||||||
, pbase2_type( -16, &this->pbase0_type::member.y )
|
|
||||||
, pbase3_type( x, static_cast<int *>(NULL) )
|
|
||||||
, base1_type( pbase3_type::member, pbase1_type::member )
|
|
||||||
, base2_type( pbase2_type::member )
|
|
||||||
{
|
|
||||||
//...
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
The final class has multiple sub-objects with the name `member`, so any
|
|
||||||
use of that name needs qualification by a name of the appropriate base
|
|
||||||
type. Using `typedef`s ease mentioning the base types.
|
|
||||||
|
|
||||||
However, the fix introduces a new problem when a pointer is needed. Using the
|
|
||||||
address operator with a sub-object qualified with its class's name results in a
|
|
||||||
pointer-to-member (here, having a type of `an_int __boost_base_from_member__<an_int, 0>::*`)
|
|
||||||
instead of a pointer to the member (having a type of `an_int*`).
|
|
||||||
The new problem is fixed by qualifying the sub-object with `this->` and is needed
|
|
||||||
just for pointers, and not for references or values.
|
|
||||||
|
|
||||||
There are some argument conversions in the initialization. The constructor
|
|
||||||
argument for `pbase0_type` is converted from `double` to `float`. The first
|
|
||||||
constructor argument for `pbase2_type` is converted from `int` to `double`.
|
|
||||||
|
|
||||||
The second constructor argument for `pbase3_type` is a special case of
|
|
||||||
necessary conversion; all forms of the null-pointer literal in C++ (except
|
|
||||||
`nullptr` from C++11) also look like compile-time integral expressions, so
|
|
||||||
C++ always interprets such code as an integer when it has overloads that can
|
|
||||||
take either an integer or a pointer.
|
|
||||||
|
|
||||||
The last conversion is necessary for the compiler to call a constructor form
|
|
||||||
with the exact pointer type used in `switcher`'s constructor. (If C++11's
|
|
||||||
__nullptr__ is used, it still needs a conversion if multiple pointer types can
|
|
||||||
be accepted in a constructor call but `__std_nullptr_t__` cannot.)
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[xinclude tmp/base_from_member_reference.xml]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Acknowledgments]
|
|
||||||
|
|
||||||
Author: Walker, Daryle
|
|
||||||
|
|
||||||
Copyright 2001, 2003, 2004, 2012 Daryle Walker
|
|
||||||
|
|
||||||
* [@http://www.boost.org/people/ed_brey.htm Ed Brey] suggested some interface
|
|
||||||
changes.
|
|
||||||
|
|
||||||
* [@http://www.moocat.org R. Samuel Klatchko] ([@mailto:rsk@moocat.org
|
|
||||||
rsk@moocat.org], [@mailto:rsk@brightmail.com rsk@brightmail.com]) invented
|
|
||||||
the idiom of how to use a class member for initializing a base class.
|
|
||||||
|
|
||||||
* [@http://www.boost.org/people/dietmar_kuehl.htm Dietmar Kuehl] popularized the
|
|
||||||
base-from-member idiom in his [@http://www.informatik.uni-konstanz.de/~kuehl/c++/iostream/
|
|
||||||
IOStream example classes].
|
|
||||||
|
|
||||||
* Jonathan Turkanis supplied an implementation of generating the constructor
|
|
||||||
templates that can be controlled and automated with macros. The
|
|
||||||
implementation uses the [@boost:/libs/preprocessor/index.html Preprocessor library].
|
|
||||||
|
|
||||||
* [@http://www.boost.org/people/daryle_walker.html">Daryle Walker] started the
|
|
||||||
library. Contributed the test file [@../../../test/base_from_member_test.cpp
|
|
||||||
base_from_member_test.cpp].
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
@@ -1,443 +0,0 @@
|
|||||||
[/
|
|
||||||
/ Copyright (c) 2012 Marshall Clow
|
|
||||||
/ Copyright (c) 2021, Alan Freitas
|
|
||||||
/
|
|
||||||
/ 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)
|
|
||||||
/]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[section Call Traits]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Introduction]
|
|
||||||
|
|
||||||
All of the contents of [@../../../../boost/call_traits.hpp `<boost/call_traits.hpp>`] are
|
|
||||||
defined inside `namespace boost`.
|
|
||||||
|
|
||||||
The template class __call_traits_T__ encapsulates the
|
|
||||||
"best" method to pass a parameter of some type `T` to or
|
|
||||||
from a function, and consists of a collection of `typedef`s defined
|
|
||||||
as in the table below. The purpose of __call_traits__ is to ensure
|
|
||||||
that problems like [link sec:refs "references to references"]
|
|
||||||
never occur, and that parameters are passed in the most efficient
|
|
||||||
manner possible, as in the [link sec:examples examples]. In each
|
|
||||||
case, if your existing practice is to use the type defined on the
|
|
||||||
left, then replace it with the __call_traits__ defined type on the
|
|
||||||
right.
|
|
||||||
|
|
||||||
Note that for compilers that do not support either partial
|
|
||||||
specialization or member templates, no benefit will occur from
|
|
||||||
using __call_traits__: the __call_traits__ defined types will always be
|
|
||||||
the same as the existing practice in this case. In addition if
|
|
||||||
only member templates and not partial template specialisation is
|
|
||||||
support by the compiler (for example Visual C++ 6) then
|
|
||||||
__call_traits__ cannot be used with array types, although it can still be
|
|
||||||
used to solve the reference to reference problem.
|
|
||||||
|
|
||||||
[table __call_traits__ types
|
|
||||||
[[Existing practice] [__call_traits__ equivalent] [Description] [Notes]]
|
|
||||||
[
|
|
||||||
[`T`
|
|
||||||
|
|
||||||
(return by value)
|
|
||||||
]
|
|
||||||
[
|
|
||||||
__call_traits_T__`::value_type`
|
|
||||||
]
|
|
||||||
[
|
|
||||||
Defines a type that represents the "value" of type `T`.
|
|
||||||
|
|
||||||
Use this for functions that return by value, or possibly for stored values of type `T`.
|
|
||||||
]
|
|
||||||
[2]
|
|
||||||
]
|
|
||||||
[
|
|
||||||
[`T&`
|
|
||||||
|
|
||||||
(return value)
|
|
||||||
]
|
|
||||||
[
|
|
||||||
__call_traits_T__`::reference`
|
|
||||||
]
|
|
||||||
[
|
|
||||||
Defines a type that represents a reference to type `T`.
|
|
||||||
|
|
||||||
Use for functions that would normally return a `T&`.
|
|
||||||
]
|
|
||||||
[1]
|
|
||||||
]
|
|
||||||
[
|
|
||||||
[`const T&`
|
|
||||||
|
|
||||||
(return value)
|
|
||||||
]
|
|
||||||
[
|
|
||||||
__call_traits_T__`::const_reference`
|
|
||||||
]
|
|
||||||
[
|
|
||||||
Defines a type that represents a constant reference to type `T`.
|
|
||||||
|
|
||||||
Use for functions that would normally return a `const T&`.
|
|
||||||
]
|
|
||||||
[1]
|
|
||||||
]
|
|
||||||
[
|
|
||||||
[`const T&`
|
|
||||||
|
|
||||||
(function parameter)
|
|
||||||
]
|
|
||||||
[
|
|
||||||
__call_traits_T__`::param_type`
|
|
||||||
]
|
|
||||||
[
|
|
||||||
Defines a type that represents the "best" way to pass a parameter of type `T` to a function.
|
|
||||||
]
|
|
||||||
[1,3]
|
|
||||||
]
|
|
||||||
]
|
|
||||||
|
|
||||||
Notes:
|
|
||||||
|
|
||||||
# If `T` is already reference type, then __call_traits__ is
|
|
||||||
defined such that [link sec:refs "references to references"]
|
|
||||||
do not occur (requires partial specialization).
|
|
||||||
# If `T` is an array type, then __call_traits__ defines `value_type`
|
|
||||||
as a "constant pointer to type" rather than an
|
|
||||||
"array of type" (requires partial specialization).
|
|
||||||
Note that if you are using `value_type` as a stored value
|
|
||||||
then this will result in storing a "constant pointer to
|
|
||||||
an array" rather than the array itself. This may or may
|
|
||||||
not be a good thing depending upon what you actually
|
|
||||||
need (in other words take care!).
|
|
||||||
# If `T` is a small built in type or a pointer, then `param_type`
|
|
||||||
is defined as `T const`, instead of `T const&`. This can
|
|
||||||
improve the ability of the compiler to optimize loops in
|
|
||||||
the body of the function if they depend upon the passed
|
|
||||||
parameter, the semantics of the passed parameter is
|
|
||||||
otherwise unchanged (requires partial specialization).
|
|
||||||
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
[section Copy constructibility]
|
|
||||||
|
|
||||||
The following table defines which __call_traits__ types can always
|
|
||||||
be copy-constructed from which other types:
|
|
||||||
|
|
||||||
[table Which __call_traits__ types can always be copy-constructed from which other types
|
|
||||||
[[] [To `T`] [To `value_type`] [To `reference`] [To `const_reference`] [To `param_type`]]
|
|
||||||
[[From `T`] [iff `T` is copy constructible] [iff `T` is copy constructible] [Yes] [Yes] [Yes]]
|
|
||||||
[[From `value_type`] [iff `T` is copy constructible] [iff `T` is copy constructible] [No] [No] [Yes]]
|
|
||||||
[[From `reference`] [iff `T` is copy constructible] [iff `T` is copy constructible] [Yes] [Yes] [Yes]]
|
|
||||||
[[From `const_reference`] [iff `T` is copy constructible] [No] [No] [Yes] [Yes]]
|
|
||||||
[[From `param_type`] [iff `T` is copy constructible] [iff `T` is copy constructible] [No] [No] [Yes]]
|
|
||||||
]
|
|
||||||
|
|
||||||
If `T` is an assignable type the following assignments are possible:
|
|
||||||
|
|
||||||
[table Which __call_traits__ types are assignable from which other types
|
|
||||||
[[] [To `T`] [To `value_type`] [To `reference`] [To `const_reference`] [To `param_type`]]
|
|
||||||
[[From `T`] [Yes] [Yes] [-] [-] [-]]
|
|
||||||
[[From `value_type`] [Yes] [Yes] [-] [-] [-]]
|
|
||||||
[[From `reference`] [Yes] [Yes] [-] [-] [-]]
|
|
||||||
[[From `const_reference`] [Yes] [Yes] [-] [-] [-]]
|
|
||||||
[[From `param_type`] [Yes] [Yes] [-] [-] [-]]
|
|
||||||
]
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:examples]
|
|
||||||
[section Examples]
|
|
||||||
|
|
||||||
The following table shows the effect that __call_traits__ has on
|
|
||||||
various types.
|
|
||||||
|
|
||||||
[table Examples of __call_traits__ types
|
|
||||||
[[] [__call_traits__::`value_type`] [__call_traits__::`reference`] [__call_traits__::`const_reference`] [__call_traits__::`param_type`] [Applies to:]]
|
|
||||||
[[From `my_class`] [`my_class`] [`my_class&`] [`const my_class&`] [`my_class const&`] [All user-defined types]]
|
|
||||||
[[From `int`] [`int`] [`int&`] [`const int&`] [`int const`] [All small built-in types]]
|
|
||||||
[[From `int*`] [`int*`] [`int*&`] [`int* const &`] [`int* const`] [All pointer types]]
|
|
||||||
[[From `int&`] [`int&`] [`int&`] [`const int&`] [`int&`] [All reference types]]
|
|
||||||
[[From `const int&`] [`const int&`] [`const int&`] [`const int&`] [`const int&`] [All constant reference types]]
|
|
||||||
[[From `int[3]`] [`const int*`] [`int(&)[3]`] [`const int(&)[3]`] [`const int* const`] [All array types]]
|
|
||||||
[[From `const int[3]`] [`const int*`] [`const int(&)[3]`] [`const int(&)[3]`] [`const int* const`] [All constant array types]]
|
|
||||||
]
|
|
||||||
|
|
||||||
The table assumes the compiler supports partial
|
|
||||||
specialization: if it does not then all types behave in
|
|
||||||
the same way as the entry for "`my_class`", and
|
|
||||||
__call_traits__ can not be used with reference or array types.
|
|
||||||
|
|
||||||
[section Example 1:]
|
|
||||||
|
|
||||||
The following class is a trivial class that stores some type `T`
|
|
||||||
by value (see the [@../../../test/call_traits_test.cpp `call_traits_test.cpp`]
|
|
||||||
file). The aim is to illustrate how each of the available
|
|
||||||
__call_traits__ `typedef`s may be used:
|
|
||||||
|
|
||||||
```
|
|
||||||
template <class T>
|
|
||||||
struct contained
|
|
||||||
{
|
|
||||||
// define our typedefs first, arrays are stored by value
|
|
||||||
// so value_type is not the same as result_type:
|
|
||||||
typedef typename __boost_call_traits__<T>::param_type param_type;
|
|
||||||
typedef typename __boost_call_traits__<T>::reference reference;
|
|
||||||
typedef typename __boost_call_traits__<T>::const_reference const_reference;
|
|
||||||
typedef T value_type;
|
|
||||||
typedef typename __boost_call_traits__<T>::value_type result_type;
|
|
||||||
|
|
||||||
// stored value:
|
|
||||||
value_type v_;
|
|
||||||
|
|
||||||
// constructors:
|
|
||||||
contained() {}
|
|
||||||
contained(param_type p) : v_(p){}
|
|
||||||
// return byval:
|
|
||||||
result_type value() { return v_; }
|
|
||||||
// return by_ref:
|
|
||||||
reference get() { return v_; }
|
|
||||||
const_reference const_get()const { return v_; }
|
|
||||||
// pass value:
|
|
||||||
void call(param_type p){}
|
|
||||||
|
|
||||||
};
|
|
||||||
```
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:refs]
|
|
||||||
[section Example 2 (the reference to reference problem):]
|
|
||||||
|
|
||||||
Consider the definition of __std_binder1st__:
|
|
||||||
|
|
||||||
```
|
|
||||||
template <class Operation>
|
|
||||||
class binder1st :
|
|
||||||
public __std_unary_function__<typename Operation::second_argument_type, typename Operation::result_type>
|
|
||||||
{
|
|
||||||
protected:
|
|
||||||
Operation op;
|
|
||||||
typename Operation::first_argument_type value;
|
|
||||||
public:
|
|
||||||
binder1st(const Operation& x, const typename Operation::first_argument_type& y);
|
|
||||||
typename Operation::result_type operator()(const typename Operation::second_argument_type& x) const;
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
Now consider what happens in the relatively common case that
|
|
||||||
the functor takes its second argument as a reference, that
|
|
||||||
implies that `Operation::second_argument_type` is a
|
|
||||||
reference type, `operator()` will now end up taking a
|
|
||||||
reference to a reference as an argument, and that is not
|
|
||||||
currently legal. The solution here is to modify `operator()`
|
|
||||||
to use __call_traits__:
|
|
||||||
|
|
||||||
```
|
|
||||||
typename Operation::result_type operator()(typename __call_traits__<typename Operation::second_argument_type>::param_type x) const;
|
|
||||||
```
|
|
||||||
|
|
||||||
Now in the case that `Operation::second_argument_type`
|
|
||||||
is a reference type, the argument is passed as a reference, and
|
|
||||||
the no "reference to reference" occurs.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:example3]
|
|
||||||
[section Example 3 (the `make_pair` problem):]
|
|
||||||
|
|
||||||
If we pass the name of an array as one (or both) arguments to `__std_make_pair__`,
|
|
||||||
then template argument deduction deduces the passed parameter as
|
|
||||||
"const reference to array of `T`", this also applies to
|
|
||||||
string literals (which are really array literals). Consequently
|
|
||||||
instead of returning a pair of pointers, it tries to return a
|
|
||||||
pair of arrays, and since an array type is not copy-constructible
|
|
||||||
the code fails to compile. One solution is to explicitly cast the
|
|
||||||
arguments to __std_make_pair__ to pointers, but __call_traits__ provides a
|
|
||||||
better automatic solution that works safely even in generic code where the
|
|
||||||
cast might do the wrong thing:
|
|
||||||
|
|
||||||
```
|
|
||||||
template <class T1, class T2>
|
|
||||||
__std_pair__<
|
|
||||||
typename __boost_call_traits__<T1>::value_type,
|
|
||||||
typename __boost_call_traits__<T2>::value_type>
|
|
||||||
make_pair(const T1& t1, const T2& t2)
|
|
||||||
{
|
|
||||||
return __std_pair__<
|
|
||||||
typename __boost_call_traits__<T1>::value_type,
|
|
||||||
typename __boost_call_traits__<T2>::value_type>(t1, t2);
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
Here, the deduced argument types will be automatically
|
|
||||||
degraded to pointers if the deduced types are arrays, similar
|
|
||||||
situations occur in the standard binders and adapters: in
|
|
||||||
principle in any function that "wraps" a temporary
|
|
||||||
whose type is deduced. Note that the function arguments to
|
|
||||||
__std_make_pair__ are not expressed in terms of __call_traits__: doing so
|
|
||||||
would prevent template argument deduction from functioning.
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:example4]
|
|
||||||
[section Example 4 (optimising fill):]
|
|
||||||
|
|
||||||
The __call_traits__ template will "optimize" the passing
|
|
||||||
of a small built-in type as a function parameter. This mainly has
|
|
||||||
an effect when the parameter is used within a loop body.
|
|
||||||
|
|
||||||
In the following example (see [@boost:/libs/type_traits/examples/fill_example.cpp `fill_example.cpp`]),
|
|
||||||
a version of __std_fill__ is optimized in two ways: if the type
|
|
||||||
passed is a single byte built-in type then __std_memset__ is used to
|
|
||||||
effect the fill, otherwise a conventional C++ implementation is
|
|
||||||
used, but with the passed parameter "optimized" using
|
|
||||||
__call_traits__:
|
|
||||||
|
|
||||||
```
|
|
||||||
template <bool opt>
|
|
||||||
struct filler
|
|
||||||
{
|
|
||||||
template <typename I, typename T>
|
|
||||||
static void do_fill(I first, I last, typename __boost_call_traits__<T>::param_type val)
|
|
||||||
{
|
|
||||||
while(first != last)
|
|
||||||
{
|
|
||||||
*first = val;
|
|
||||||
++first;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template <>
|
|
||||||
struct filler<true>
|
|
||||||
{
|
|
||||||
template <typename I, typename T>
|
|
||||||
static void do_fill(I first, I last, T val)
|
|
||||||
{
|
|
||||||
__std_memset__(first, val, last-first);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class I, class T>
|
|
||||||
inline void fill(I first, I last, const T& val)
|
|
||||||
{
|
|
||||||
enum { can_opt = boost::is_pointer<I>::value
|
|
||||||
&& boost::is_arithmetic<T>::value
|
|
||||||
&& (sizeof(T) == 1) };
|
|
||||||
typedef filler<can_opt> filler_t;
|
|
||||||
filler_t::template do_fill<I,T>(first, last, val);
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
The reason that this is "optimal" for small built-in types is that
|
|
||||||
with the value passed as `T const` instead of `const T&` the compiler is
|
|
||||||
able to tell both that the value is constant and that it is free
|
|
||||||
of aliases. With this information the compiler is able to cache
|
|
||||||
the passed value in a register, unroll the loop, or use
|
|
||||||
explicitly parallel instructions: if any of these are supported.
|
|
||||||
Exactly how much mileage you will get from this depends upon your
|
|
||||||
compiler - we could really use some accurate benchmarking
|
|
||||||
software as part of boost for cases like this.
|
|
||||||
|
|
||||||
Note that the function arguments to fill are not expressed in
|
|
||||||
terms of __call_traits__: doing so would prevent template argument
|
|
||||||
deduction from functioning. Instead fill acts as a "thin
|
|
||||||
wrapper" that is there to perform template argument
|
|
||||||
deduction, the compiler will optimise away the call to fill all
|
|
||||||
together, replacing it with the call to `filler<>::do_fill`,
|
|
||||||
which does use __call_traits__.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Rationale]
|
|
||||||
|
|
||||||
The following notes are intended to briefly describe the
|
|
||||||
rationale behind choices made in __call_traits__.
|
|
||||||
|
|
||||||
All user-defined types follow "existing practice" and need no comment.
|
|
||||||
|
|
||||||
Small built-in types, what the standard calls [@https://en.cppreference.com/w/cpp/language/types fundamental
|
|
||||||
types], differ from existing practice only in the `param_type`
|
|
||||||
`typedef`. In this case passing `T const` is compatible
|
|
||||||
with existing practice, but may improve performance in some cases
|
|
||||||
(see [link sec:example4 Example 4]). In any case this should never
|
|
||||||
be any worse than existing practice.
|
|
||||||
|
|
||||||
Pointers follow the same rationale as small built-in types.
|
|
||||||
|
|
||||||
For reference types the rationale follows [link sec:refs Example 2]
|
|
||||||
- references to references are not allowed, so the __call_traits__
|
|
||||||
members must be defined such that these problems do
|
|
||||||
not occur. There is a proposal to modify the language such that
|
|
||||||
"a reference to a reference is a reference" (issue #106,
|
|
||||||
submitted by Bjarne Stroustrup). __call_traits_T__`::value_type`
|
|
||||||
and __call_traits_T__`::param_type` both provide the same effect
|
|
||||||
as that proposal, without the need for a language change. In
|
|
||||||
other words, it's a workaround.
|
|
||||||
|
|
||||||
For array types, a function that takes an array as an argument
|
|
||||||
will degrade the array type to a pointer type: this means that
|
|
||||||
the type of the actual parameter is different from its declared
|
|
||||||
type, something that can cause endless problems in template code
|
|
||||||
that relies on the declared type of a parameter.
|
|
||||||
|
|
||||||
For example:
|
|
||||||
|
|
||||||
```
|
|
||||||
template <class T>
|
|
||||||
struct A
|
|
||||||
{
|
|
||||||
void foo(T t);
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
In this case if we instantiate `A<int[2]>` then the declared type of
|
|
||||||
the parameter passed to member function `foo` is `int[2]`, but its
|
|
||||||
actual type is `const int*`. If we try to use the type `T` within the
|
|
||||||
function body, then there is a strong likelihood that our code will not compile:
|
|
||||||
|
|
||||||
```
|
|
||||||
template <class T>
|
|
||||||
void A<T>::foo(T t)
|
|
||||||
{
|
|
||||||
T dup(t); // doesn't compile for case that T is an array.
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
By using __call_traits__ the degradation from array to pointer is
|
|
||||||
explicit, and the type of the parameter is the same as it's
|
|
||||||
declared type:
|
|
||||||
|
|
||||||
```
|
|
||||||
template <class T>
|
|
||||||
struct A
|
|
||||||
{
|
|
||||||
void foo(typename __call_traits__<T>::value_type t);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T>
|
|
||||||
void A<T>::foo(typename __call_traits__<T>::value_type t)
|
|
||||||
{
|
|
||||||
typename __call_traits__<T>::value_type dup(t); // OK even if T is an array type.
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
For `value_type` (return by value), again only a pointer may be
|
|
||||||
returned, not a copy of the whole array, and again __call_traits__
|
|
||||||
makes the degradation explicit. The `value_type` member is useful
|
|
||||||
whenever an array must be explicitly degraded to a pointer -
|
|
||||||
[link sec:example3 Example 3] provides the test case.
|
|
||||||
|
|
||||||
Footnote: the array specialisation for __call_traits__ is the least
|
|
||||||
well understood of all the __call_traits__ specialisations. If the given
|
|
||||||
semantics cause specific problems for you, or does not solve a particular
|
|
||||||
array-related problem, then I would be interested to hear about
|
|
||||||
it. Most people though will probably never need to use this
|
|
||||||
specialisation.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[xinclude tmp/call_traits_reference.xml]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
@@ -1,98 +0,0 @@
|
|||||||
[/
|
|
||||||
Copyright 2000 Beman Dawes & John Maddock.
|
|
||||||
Copyright (c) 2021, Alan Freitas
|
|
||||||
|
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
|
||||||
|
|
||||||
See accompanying file LICENSE_1_0.txt
|
|
||||||
or copy at http://boost.org/LICENSE_1_0.txt
|
|
||||||
]
|
|
||||||
|
|
||||||
[section Compressed Pair]
|
|
||||||
|
|
||||||
[section Introduction]
|
|
||||||
|
|
||||||
All of the contents of [@../../../../boost/compressed_pair.hpp `<boost/compressed_pair.hpp>`] are defined inside
|
|
||||||
`namespace boost`.
|
|
||||||
|
|
||||||
The class __compressed_pair__ is very similar to __std_pair__. However, if either of
|
|
||||||
the template arguments are empty classes, then the
|
|
||||||
[@https://en.cppreference.com/w/cpp/language/ebo ['empty base-class optimisation]]
|
|
||||||
is applied to compress the size of the pair.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Synopsis]
|
|
||||||
|
|
||||||
```cpp
|
|
||||||
template <class T1, class T2>
|
|
||||||
class __compressed_pair__
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
typedef T1 first_type;
|
|
||||||
typedef T2 second_type;
|
|
||||||
typedef typename __call_traits__<first_type>::param_type first_param_type;
|
|
||||||
typedef typename __call_traits__<second_type>::param_type second_param_type;
|
|
||||||
typedef typename __call_traits__<first_type>::reference first_reference;
|
|
||||||
typedef typename __call_traits__<second_type>::reference second_reference;
|
|
||||||
typedef typename __call_traits__<first_type>::const_reference first_const_reference;
|
|
||||||
typedef typename __call_traits__<second_type>::const_reference second_const_reference;
|
|
||||||
|
|
||||||
compressed_pair() : base() {}
|
|
||||||
compressed_pair(first_param_type x, second_param_type y);
|
|
||||||
explicit compressed_pair(first_param_type x);
|
|
||||||
explicit compressed_pair(second_param_type y);
|
|
||||||
|
|
||||||
compressed_pair& operator=(const compressed_pair&);
|
|
||||||
|
|
||||||
first_reference first();
|
|
||||||
first_const_reference first() const;
|
|
||||||
|
|
||||||
second_reference second();
|
|
||||||
second_const_reference second() const;
|
|
||||||
|
|
||||||
void swap(compressed_pair& y);
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
The two members of the pair can be accessed using the member functions
|
|
||||||
`first()` and `second()`. Note that not all member functions can be
|
|
||||||
instantiated for all template parameter types. In particular
|
|
||||||
__compressed_pair__ can be instantiated for reference and array types,
|
|
||||||
however in these cases the range of constructors that can be used is
|
|
||||||
limited. If types `T1` and `T2` are the same type, then there is only
|
|
||||||
one version of the single-argument constructor, and this constructor
|
|
||||||
initialises both values in the pair to the passed value.
|
|
||||||
|
|
||||||
Note that if either member is a [@https://en.cppreference.com/w/cpp/named_req/PODType POD]
|
|
||||||
type, then that member is not zero-initialized by the __compressed_pair__ default constructor:
|
|
||||||
it is up to you to supply an initial value for these types if you want them to have
|
|
||||||
a default value.
|
|
||||||
|
|
||||||
Note that __compressed_pair__ can not be instantiated if either of the
|
|
||||||
template arguments is a union type, unless there is compiler support for
|
|
||||||
[@boost:/libs/type_traits/index.html `boost::is_union`], or
|
|
||||||
if [@boost:/libs/type_traits/index.html `boost::is_union`] is
|
|
||||||
specialised for the union type.
|
|
||||||
|
|
||||||
Finally, a word of caution for Visual C++ 6 users: if either argument is an
|
|
||||||
empty type, then assigning to that member will produce memory corruption,
|
|
||||||
unless the empty type has a "do nothing" assignment operator defined. This
|
|
||||||
is due to a bug in the way VC6 generates implicit assignment operators.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[xinclude tmp/compressed_pair_reference.xml]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Acknowledgments]
|
|
||||||
|
|
||||||
Based on contributions by Steve Cleary, Beman Dawes, Howard Hinnant and
|
|
||||||
John Maddock.
|
|
||||||
|
|
||||||
Maintained by [@mailto:john@johnmaddock.co.uk John Maddock].
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
@@ -1,308 +0,0 @@
|
|||||||
[/
|
|
||||||
/ Copyright (c) 2012 Marshall Clow
|
|
||||||
/ Copyright (c) 2021, Alan Freitas
|
|
||||||
/
|
|
||||||
/ 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)
|
|
||||||
/]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[#sec:in_place_factory]
|
|
||||||
[section In-place Factory]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Introduction]
|
|
||||||
|
|
||||||
Suppose we have a class
|
|
||||||
|
|
||||||
```
|
|
||||||
struct X
|
|
||||||
{
|
|
||||||
X ( int, __std_string__ ) ;
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
And a container for it which supports an empty state. That is, a container which can contain zero objects:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct C
|
|
||||||
{
|
|
||||||
C() : contained_(0) {}
|
|
||||||
~C() { delete contained_ ; }
|
|
||||||
X* contained_ ;
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
A container designed to support an empty state typically does not require the contained type to be
|
|
||||||
__DefaultConstructible__, but it typically requires it to be __CopyConstructible__ as a mechanism to
|
|
||||||
initialize the object to store:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct C
|
|
||||||
{
|
|
||||||
C() : contained_(0) {}
|
|
||||||
C ( X const& v ) : contained_ ( new X(v) ) {}
|
|
||||||
~C() { delete contained_ ; }
|
|
||||||
X* contained_ ;
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
There is a subtle problem with this: since the mechanism used to initialize the stored object is copy construction,
|
|
||||||
there must exist a previously constructed source object to copy from. This object is likely to be temporary and serve
|
|
||||||
no purpose besides being the source:
|
|
||||||
|
|
||||||
```
|
|
||||||
void foo()
|
|
||||||
{
|
|
||||||
// Temporary object created.
|
|
||||||
C c( X(123,"hello") ) ;
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
A solution to this problem is to support direct construction of the contained
|
|
||||||
object right in the container's storage.
|
|
||||||
|
|
||||||
In this scheme, the user supplies the arguments for the `X` constructor
|
|
||||||
directly to the container:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct C
|
|
||||||
{
|
|
||||||
C() : contained_(0) {}
|
|
||||||
C ( X const& v ) : contained_ ( new X(v) ) {}
|
|
||||||
C ( int a0, __std_string__ a1 ) : contained_ ( new X(a0,a1) ) {}
|
|
||||||
~C() { delete contained_ ; }
|
|
||||||
X* contained_ ;
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
```
|
|
||||||
void foo()
|
|
||||||
{
|
|
||||||
// Wrapped object constructed in-place
|
|
||||||
// No temporary created.
|
|
||||||
C c(123,"hello");
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
Clearly, this solution does not scale well since the container must duplicate all the constructor overloads
|
|
||||||
from the contained type, or at least all those which are to be supported directly in the container.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
[section Framework]
|
|
||||||
|
|
||||||
This library proposes a framework to allow some containers to directly construct contained objects in-place without requiring
|
|
||||||
the entire set of constructor overloads from the contained type. It also allows the container to remove the __CopyConstructible__
|
|
||||||
requirement from the contained type since objects can be directly constructed in-place without need of a copy.
|
|
||||||
|
|
||||||
The only requirement on the container is that it must provide proper storage. That is, the container should be
|
|
||||||
correctly aligned and sized. Naturally, the container will typically support uninitialized storage to avoid the
|
|
||||||
in-place construction to override a fully-constructed object, as this would defeat the purpose of in-place construction.
|
|
||||||
|
|
||||||
For this purpose, the framework provides two concepts called: InPlaceFactories and TypedInPlaceFactories.
|
|
||||||
Helpers to declare these classes are declared in [@../../../../boost/utility/in_place_factory.hpp `<boost/utility/in_place_factory.hpp>`]
|
|
||||||
and [@../../../../boost/utility/typed_in_place_factory.hpp `<boost/utility/typed_in_place_factory.hpp>`].
|
|
||||||
|
|
||||||
Essentially, these classes hold a sequence of actual parameters and a method to construct an object in place using these parameters.
|
|
||||||
Each member of the family differs only in the number and type of the parameter list. The first family
|
|
||||||
takes the type of the object to construct directly in method provided for that
|
|
||||||
purpose, whereas the second family incorporates that type in the factory class
|
|
||||||
itself. From the container point of view, using the framework amounts to calling the
|
|
||||||
factory's method to contruct the object in place. From the user point of view, it amounts to creating
|
|
||||||
the right factory object to hold the parameters and pass it to the container.
|
|
||||||
|
|
||||||
The following simplified example shows the basic idea. A complete example follows the formal specification of the framework:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct C
|
|
||||||
{
|
|
||||||
template <class InPlaceFactory>
|
|
||||||
C ( InPlaceFactory const& aFactory )
|
|
||||||
:
|
|
||||||
contained_ ( uninitialized_storage() )
|
|
||||||
{
|
|
||||||
aFactory.template apply<X>(contained_);
|
|
||||||
}
|
|
||||||
|
|
||||||
~C()
|
|
||||||
{
|
|
||||||
contained_ -> X::~X();
|
|
||||||
delete[] contained_ ;
|
|
||||||
}
|
|
||||||
|
|
||||||
char* uninitialized_storage() { return new char[sizeof(X)] ; }
|
|
||||||
|
|
||||||
char* contained_ ;
|
|
||||||
};
|
|
||||||
|
|
||||||
void foo()
|
|
||||||
{
|
|
||||||
C c( in_place(123,"hello") ) ;
|
|
||||||
}
|
|
||||||
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
[section Specification]
|
|
||||||
|
|
||||||
The following is the first member of the family of `InPlaceFactory` classes, along with its corresponding helper template function.
|
|
||||||
The rest of the family varies only in the number and type of template and constructor parameters.
|
|
||||||
|
|
||||||
|
|
||||||
```
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
struct __in_place_factory_base__ {};
|
|
||||||
|
|
||||||
template<class A0>
|
|
||||||
class in_place_factory : public __in_place_factory_base__
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
in_place_factory ( A0 const& a0 ) : m_a0(a0) {}
|
|
||||||
|
|
||||||
template< class T >
|
|
||||||
void apply ( void* address ) const
|
|
||||||
{
|
|
||||||
new (address) T(m_a0);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
A0 const& m_a0 ;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<class A0>
|
|
||||||
in_place_factory<A0> in_place ( A0 const& a0 )
|
|
||||||
{
|
|
||||||
return in_place_factory<A0>(a0);
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
Similarly, the following is the first member of the family of `typed_in_place_factory` classes, along with its corresponding
|
|
||||||
helper template function. The rest of the family varies only in the number and type of template and constructor parameters.
|
|
||||||
|
|
||||||
```
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
struct __typed_in_place_factory_base__ {};
|
|
||||||
|
|
||||||
template<class T, class A0>
|
|
||||||
class typed_in_place_factory : public __typed_in_place_factory_base__
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
typed_in_place_factory ( A0 const& a0 ) : m_a0(a0) {}
|
|
||||||
|
|
||||||
void apply ( void* address ) const
|
|
||||||
{
|
|
||||||
new (address) T(m_a0);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
A0 const& m_a0 ;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<class T, class A0>
|
|
||||||
typed_in_place_factory<A0> in_place ( A0 const& a0 )
|
|
||||||
{
|
|
||||||
return typed_in_place_factory<T,A0>(a0);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
As you can see, the `in_place_factory` and `typed_in_place_factory` template classes vary only in the way they specify
|
|
||||||
the target type: in the first family, the type is given as a template argument to the apply member function while in the
|
|
||||||
second it is given directly as part of the factory class.
|
|
||||||
|
|
||||||
When the container holds a unique non-polymorphic type, such as the case of [@boost:/libs/optional/index.html Boost.Optional],
|
|
||||||
it knows the exact dynamic-type of the contained object and can pass it to the `apply()` method of a non-typed factory.
|
|
||||||
In this case, end users can use an `in_place_factory` instance which can be constructed without the type of the object to construct.
|
|
||||||
|
|
||||||
However, if the container holds heterogeneous or polymorphic objects, such as the case of [@boost:/libs/variant/index.html Boost.Variant],
|
|
||||||
the dynamic-type of the object to be constructed must be known by the factory. In this case, end users must use a `typed_in_place_factory`
|
|
||||||
instead.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
[section Container-side Usage]
|
|
||||||
|
|
||||||
As shown in the introductory simplified example, the container class must contain methods that accept an instance of
|
|
||||||
these factories and pass the object's storage to the factory's apply method.
|
|
||||||
|
|
||||||
However, the type of the factory class cannot be completely specified in the container class because that would
|
|
||||||
defeat the whole purpose of the factories which is to allow the container to accept a variadic argument list
|
|
||||||
for the constructor of its contained object.
|
|
||||||
|
|
||||||
The correct function overload must be based on the only distinctive and common
|
|
||||||
characteristic of all the classes in each family: the base class.
|
|
||||||
|
|
||||||
Depending on the container class, you can use `enable_if` to generate the right overload, or use the following
|
|
||||||
dispatch technique, which is used in the [@boost:/libs/optional/index.html Boost.Optional] class:
|
|
||||||
|
|
||||||
|
|
||||||
```
|
|
||||||
struct C
|
|
||||||
{
|
|
||||||
C() : contained_(0) {}
|
|
||||||
C ( X const& v ) : contained_ ( new X(v) ) {}
|
|
||||||
|
|
||||||
template <class Expr>
|
|
||||||
C ( Expr const& expr )
|
|
||||||
:
|
|
||||||
contained_ ( uninitialized_storage() )
|
|
||||||
{
|
|
||||||
construct(expr,&expr);
|
|
||||||
}
|
|
||||||
|
|
||||||
~C() { delete contained_ ; }
|
|
||||||
|
|
||||||
template<class InPlaceFactory>
|
|
||||||
void construct ( InPlaceFactory const& aFactory, boost::__in_place_factory_base__* )
|
|
||||||
{
|
|
||||||
aFactory.template apply<X>(contained_);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<class TypedInPlaceFactory>
|
|
||||||
void construct ( TypedInPlaceFactory const& aFactory, boost::__typed_in_place_factory_base__* )
|
|
||||||
{
|
|
||||||
aFactory.apply(contained_);
|
|
||||||
}
|
|
||||||
|
|
||||||
X* uninitialized_storage() { return static_cast<X*>(new char[sizeof(X)]) ; }
|
|
||||||
|
|
||||||
X* contained_ ;
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
[section User-side Usage]
|
|
||||||
|
|
||||||
End users pass to the container an instance of a factory object holding the actual parameters needed to construct the
|
|
||||||
contained object directly within the container. For this, the helper template function `in_place` is used.
|
|
||||||
|
|
||||||
The call `in_place(a0,a1,a2,...,an)` constructs a (non-typed) `in_place_factory` instance with the given argument list.
|
|
||||||
|
|
||||||
The call `in_place<T>(a0,a1,a2,...,an)` constructs a `typed_in_place_factory` instance with the given argument list for the
|
|
||||||
type `T`.
|
|
||||||
|
|
||||||
```
|
|
||||||
void foo()
|
|
||||||
{
|
|
||||||
C a( in_place(123, "hello") ) ; // in_place_factory passed
|
|
||||||
C b( in_place<X>(456, "world") ) ; // typed_in_place_factory passed
|
|
||||||
}
|
|
||||||
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[#boost.typed_in_place_factory_base]
|
|
||||||
[xinclude tmp/in_place_factory_reference.xml]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Acknowledgments]
|
|
||||||
|
|
||||||
Copyright Fernando Luis Cacciola Carballal, 2004
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
[endsect]
|
|
||||||
BIN
doc/logo.png
BIN
doc/logo.png
Binary file not shown.
|
Before Width: | Height: | Size: 10 KiB |
539
doc/logo.svg
539
doc/logo.svg
@@ -1,539 +0,0 @@
|
|||||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
|
||||||
<!-- Created with Inkscape (http://www.inkscape.org/) -->
|
|
||||||
|
|
||||||
<svg
|
|
||||||
xmlns:dc="http://purl.org/dc/elements/1.1/"
|
|
||||||
xmlns:cc="http://creativecommons.org/ns#"
|
|
||||||
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
|
|
||||||
xmlns:svg="http://www.w3.org/2000/svg"
|
|
||||||
xmlns="http://www.w3.org/2000/svg"
|
|
||||||
xmlns:xlink="http://www.w3.org/1999/xlink"
|
|
||||||
xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
|
|
||||||
xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
|
|
||||||
width="744.09448819"
|
|
||||||
height="1052.3622047"
|
|
||||||
id="svg6858"
|
|
||||||
version="1.1"
|
|
||||||
inkscape:version="0.48.4 r9939"
|
|
||||||
sodipodi:docname="utility.svg">
|
|
||||||
<defs
|
|
||||||
id="defs6860">
|
|
||||||
<linearGradient
|
|
||||||
inkscape:collect="always"
|
|
||||||
xlink:href="#linearGradient4453-7-8-6-7-3-5"
|
|
||||||
id="linearGradient10687-2-5"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
x1="753.02301"
|
|
||||||
y1="3132.0801"
|
|
||||||
x2="1146.25"
|
|
||||||
y2="3132.0801" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient4453-7-8-6-7-3-5">
|
|
||||||
<stop
|
|
||||||
style="stop-color:#aac4dd;stop-opacity:1;"
|
|
||||||
offset="0"
|
|
||||||
id="stop4455-61-8-7-1-2-8" />
|
|
||||||
<stop
|
|
||||||
style="stop-color:#c2dbe9;stop-opacity:1;"
|
|
||||||
offset="1"
|
|
||||||
id="stop4457-4-1-9-1-12-1" />
|
|
||||||
</linearGradient>
|
|
||||||
<linearGradient
|
|
||||||
inkscape:collect="always"
|
|
||||||
xlink:href="#linearGradient4453-7-8-6-7-3-5"
|
|
||||||
id="linearGradient10685-2-2"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
x1="753.02301"
|
|
||||||
y1="3132.0801"
|
|
||||||
x2="1146.25"
|
|
||||||
y2="3132.0801" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient6749">
|
|
||||||
<stop
|
|
||||||
style="stop-color:#aac4dd;stop-opacity:1;"
|
|
||||||
offset="0"
|
|
||||||
id="stop6751" />
|
|
||||||
<stop
|
|
||||||
style="stop-color:#c2dbe9;stop-opacity:1;"
|
|
||||||
offset="1"
|
|
||||||
id="stop6753" />
|
|
||||||
</linearGradient>
|
|
||||||
<clipPath
|
|
||||||
clipPathUnits="userSpaceOnUse"
|
|
||||||
id="clipPath3387-3-6-4-2-8-4">
|
|
||||||
<path
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
d="m 862.109,3289.75 -109.086,-190.45 69.122,-124.42 164.511,-0.47 c 0,0 111.044,188.28 116.564,197.63 7.66,0 43.03,0 43.03,0 l -67.03,117.71 -217.111,0 z"
|
|
||||||
id="path3389-2-0-7-7-8-9" />
|
|
||||||
</clipPath>
|
|
||||||
<linearGradient
|
|
||||||
y2="3132.0801"
|
|
||||||
x2="1146.25"
|
|
||||||
y1="3132.0801"
|
|
||||||
x1="753.02301"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
id="linearGradient4492-8-8"
|
|
||||||
xlink:href="#linearGradient4453-7-8-6-7-3-5"
|
|
||||||
inkscape:collect="always" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient6758">
|
|
||||||
<stop
|
|
||||||
style="stop-color:#aac4dd;stop-opacity:1;"
|
|
||||||
offset="0"
|
|
||||||
id="stop6760" />
|
|
||||||
<stop
|
|
||||||
style="stop-color:#c2dbe9;stop-opacity:1;"
|
|
||||||
offset="1"
|
|
||||||
id="stop6762" />
|
|
||||||
</linearGradient>
|
|
||||||
<linearGradient
|
|
||||||
inkscape:collect="always"
|
|
||||||
xlink:href="#linearGradient4453-7-8-6-7-3-5"
|
|
||||||
id="linearGradient10691-7-8"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
x1="1026.6899"
|
|
||||||
y1="2937.73"
|
|
||||||
x2="1463.14"
|
|
||||||
y2="2937.73" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient6765">
|
|
||||||
<stop
|
|
||||||
style="stop-color:#aac4dd;stop-opacity:1;"
|
|
||||||
offset="0"
|
|
||||||
id="stop6767" />
|
|
||||||
<stop
|
|
||||||
style="stop-color:#c2dbe9;stop-opacity:1;"
|
|
||||||
offset="1"
|
|
||||||
id="stop6769" />
|
|
||||||
</linearGradient>
|
|
||||||
<linearGradient
|
|
||||||
inkscape:collect="always"
|
|
||||||
xlink:href="#linearGradient4453-7-8-6-7-3-5"
|
|
||||||
id="linearGradient10689-4-2"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
x1="1026.6899"
|
|
||||||
y1="2937.73"
|
|
||||||
x2="1463.14"
|
|
||||||
y2="2937.73" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient6772">
|
|
||||||
<stop
|
|
||||||
style="stop-color:#aac4dd;stop-opacity:1;"
|
|
||||||
offset="0"
|
|
||||||
id="stop6774" />
|
|
||||||
<stop
|
|
||||||
style="stop-color:#c2dbe9;stop-opacity:1;"
|
|
||||||
offset="1"
|
|
||||||
id="stop6776" />
|
|
||||||
</linearGradient>
|
|
||||||
<clipPath
|
|
||||||
clipPathUnits="userSpaceOnUse"
|
|
||||||
id="clipPath3369-1-5-6-1-0-7">
|
|
||||||
<path
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
d="m 1131.64,3128.5 -104.95,-181.12 116.38,-200.42 208.05,0.94 112.02,191.63 -112.08,188.97 -219.42,0 z"
|
|
||||||
id="path3371-89-4-1-6-0-1" />
|
|
||||||
</clipPath>
|
|
||||||
<linearGradient
|
|
||||||
y2="2937.73"
|
|
||||||
x2="1463.14"
|
|
||||||
y1="2937.73"
|
|
||||||
x1="1026.6899"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
id="linearGradient4498-5-7"
|
|
||||||
xlink:href="#linearGradient4453-7-8-6-7-3-5"
|
|
||||||
inkscape:collect="always" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient6781">
|
|
||||||
<stop
|
|
||||||
style="stop-color:#aac4dd;stop-opacity:1;"
|
|
||||||
offset="0"
|
|
||||||
id="stop6783" />
|
|
||||||
<stop
|
|
||||||
style="stop-color:#c2dbe9;stop-opacity:1;"
|
|
||||||
offset="1"
|
|
||||||
id="stop6785" />
|
|
||||||
</linearGradient>
|
|
||||||
<linearGradient
|
|
||||||
inkscape:collect="always"
|
|
||||||
xlink:href="#linearGradient4459-1-2-8-9-9-5"
|
|
||||||
id="linearGradient10695-9-9"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
x1="646.55499"
|
|
||||||
y1="2736.25"
|
|
||||||
x2="1088.27"
|
|
||||||
y2="2736.25" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient4459-1-2-8-9-9-5">
|
|
||||||
<stop
|
|
||||||
id="stop4461-2-1-5-2-5-0"
|
|
||||||
offset="0"
|
|
||||||
style="stop-color:#839bc2;stop-opacity:1;" />
|
|
||||||
<stop
|
|
||||||
id="stop4463-3-2-8-7-30-3"
|
|
||||||
offset="1"
|
|
||||||
style="stop-color:#9fb6d4;stop-opacity:1;" />
|
|
||||||
</linearGradient>
|
|
||||||
<linearGradient
|
|
||||||
inkscape:collect="always"
|
|
||||||
xlink:href="#linearGradient4459-1-2-8-9-9-5"
|
|
||||||
id="linearGradient10693-9-4"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
x1="646.55499"
|
|
||||||
y1="2736.25"
|
|
||||||
x2="1088.27"
|
|
||||||
y2="2736.25" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient6792">
|
|
||||||
<stop
|
|
||||||
id="stop6794"
|
|
||||||
offset="0"
|
|
||||||
style="stop-color:#839bc2;stop-opacity:1;" />
|
|
||||||
<stop
|
|
||||||
id="stop6796"
|
|
||||||
offset="1"
|
|
||||||
style="stop-color:#9fb6d4;stop-opacity:1;" />
|
|
||||||
</linearGradient>
|
|
||||||
<clipPath
|
|
||||||
clipPathUnits="userSpaceOnUse"
|
|
||||||
id="clipPath3351-4-7-3-5-95-0">
|
|
||||||
<path
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
d="m 757.242,2926.25 -110.687,-189.11 110.656,-190.89 219.437,0 111.622,189.1 -111.59,190.9 -219.438,0 z"
|
|
||||||
id="path3353-1-9-3-4-1-1" />
|
|
||||||
</clipPath>
|
|
||||||
<linearGradient
|
|
||||||
y2="2736.25"
|
|
||||||
x2="1088.27"
|
|
||||||
y1="2736.25"
|
|
||||||
x1="646.55499"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
id="linearGradient4510-1-5"
|
|
||||||
xlink:href="#linearGradient4459-1-2-8-9-9-5"
|
|
||||||
inkscape:collect="always" />
|
|
||||||
<linearGradient
|
|
||||||
id="linearGradient6801">
|
|
||||||
<stop
|
|
||||||
id="stop6803"
|
|
||||||
offset="0"
|
|
||||||
style="stop-color:#839bc2;stop-opacity:1;" />
|
|
||||||
<stop
|
|
||||||
id="stop6805"
|
|
||||||
offset="1"
|
|
||||||
style="stop-color:#9fb6d4;stop-opacity:1;" />
|
|
||||||
</linearGradient>
|
|
||||||
<radialGradient
|
|
||||||
inkscape:collect="always"
|
|
||||||
xlink:href="#radialGradient3327-8-4-8-0-2-4"
|
|
||||||
id="radialGradient10699-1-3"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
cx="997.46997"
|
|
||||||
cy="2896.25"
|
|
||||||
fx="997.46997"
|
|
||||||
fy="2896.25"
|
|
||||||
r="583.73999" />
|
|
||||||
<radialGradient
|
|
||||||
fx="0"
|
|
||||||
fy="0"
|
|
||||||
cx="0"
|
|
||||||
cy="0"
|
|
||||||
r="1"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
gradientTransform="matrix(58.375,0,0,-58.375,99.75,289.625)"
|
|
||||||
spreadMethod="pad"
|
|
||||||
id="radialGradient3327-8-4-8-0-2-4">
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#aeaeb3"
|
|
||||||
offset="0"
|
|
||||||
id="stop3329-7-0-1-0-33-2" />
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#ffffff"
|
|
||||||
offset="0.949438"
|
|
||||||
id="stop3331-4-3-0-0-97-3" />
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#ffffff"
|
|
||||||
offset="1"
|
|
||||||
id="stop3333-2-4-9-7-2-2" />
|
|
||||||
</radialGradient>
|
|
||||||
<radialGradient
|
|
||||||
r="583.73999"
|
|
||||||
fy="2896.25"
|
|
||||||
fx="997.46997"
|
|
||||||
cy="2896.25"
|
|
||||||
cx="997.46997"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
id="radialGradient13050"
|
|
||||||
xlink:href="#radialGradient3327-8-4-8-0-2-4"
|
|
||||||
inkscape:collect="always" />
|
|
||||||
<radialGradient
|
|
||||||
fx="0"
|
|
||||||
fy="0"
|
|
||||||
cx="0"
|
|
||||||
cy="0"
|
|
||||||
r="1"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
gradientTransform="matrix(58.375,0,0,-58.375,99.75,289.625)"
|
|
||||||
spreadMethod="pad"
|
|
||||||
id="radialGradient6813">
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#aeaeb3"
|
|
||||||
offset="0"
|
|
||||||
id="stop6815" />
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#ffffff"
|
|
||||||
offset="0.949438"
|
|
||||||
id="stop6817" />
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#ffffff"
|
|
||||||
offset="1"
|
|
||||||
id="stop6819" />
|
|
||||||
</radialGradient>
|
|
||||||
<clipPath
|
|
||||||
clipPathUnits="userSpaceOnUse"
|
|
||||||
id="clipPath3323-7-2-4-5-3-4">
|
|
||||||
<path
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
d="m 997.469,2312.51 c -322.379,0 -583.739,261.36 -583.739,583.74 0,322.38 261.36,583.74 583.739,583.74 322.381,0 583.741,-261.36 583.741,-583.74 0,-322.38 -261.36,-583.74 -583.741,-583.74"
|
|
||||||
id="path3325-9-2-9-5-04-9" />
|
|
||||||
</clipPath>
|
|
||||||
<radialGradient
|
|
||||||
r="583.73999"
|
|
||||||
fy="2896.25"
|
|
||||||
fx="997.46997"
|
|
||||||
cy="2896.25"
|
|
||||||
cx="997.46997"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
id="radialGradient4516-8-2"
|
|
||||||
xlink:href="#radialGradient3327-8-4-8-0-2-4"
|
|
||||||
inkscape:collect="always" />
|
|
||||||
<radialGradient
|
|
||||||
fx="0"
|
|
||||||
fy="0"
|
|
||||||
cx="0"
|
|
||||||
cy="0"
|
|
||||||
r="1"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
gradientTransform="matrix(58.375,0,0,-58.375,99.75,289.625)"
|
|
||||||
spreadMethod="pad"
|
|
||||||
id="radialGradient6824">
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#aeaeb3"
|
|
||||||
offset="0"
|
|
||||||
id="stop6826" />
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#ffffff"
|
|
||||||
offset="0.949438"
|
|
||||||
id="stop6828" />
|
|
||||||
<stop
|
|
||||||
style="stop-opacity:1;stop-color:#ffffff"
|
|
||||||
offset="1"
|
|
||||||
id="stop6830" />
|
|
||||||
</radialGradient>
|
|
||||||
<radialGradient
|
|
||||||
r="583.73999"
|
|
||||||
fy="2896.25"
|
|
||||||
fx="997.46997"
|
|
||||||
cy="2896.25"
|
|
||||||
cx="997.46997"
|
|
||||||
gradientUnits="userSpaceOnUse"
|
|
||||||
id="radialGradient6856"
|
|
||||||
xlink:href="#radialGradient3327-8-4-8-0-2-4"
|
|
||||||
inkscape:collect="always" />
|
|
||||||
</defs>
|
|
||||||
<sodipodi:namedview
|
|
||||||
id="base"
|
|
||||||
pagecolor="#ffffff"
|
|
||||||
bordercolor="#666666"
|
|
||||||
borderopacity="1.0"
|
|
||||||
inkscape:pageopacity="0.0"
|
|
||||||
inkscape:pageshadow="2"
|
|
||||||
inkscape:zoom="1.4"
|
|
||||||
inkscape:cx="234.05635"
|
|
||||||
inkscape:cy="581.46313"
|
|
||||||
inkscape:document-units="px"
|
|
||||||
inkscape:current-layer="layer1"
|
|
||||||
showgrid="false"
|
|
||||||
inkscape:window-width="1680"
|
|
||||||
inkscape:window-height="982"
|
|
||||||
inkscape:window-x="-8"
|
|
||||||
inkscape:window-y="-8"
|
|
||||||
inkscape:window-maximized="1">
|
|
||||||
<inkscape:grid
|
|
||||||
type="xygrid"
|
|
||||||
id="grid3066" />
|
|
||||||
</sodipodi:namedview>
|
|
||||||
<metadata
|
|
||||||
id="metadata6863">
|
|
||||||
<rdf:RDF>
|
|
||||||
<cc:Work
|
|
||||||
rdf:about="">
|
|
||||||
<dc:format>image/svg+xml</dc:format>
|
|
||||||
<dc:type
|
|
||||||
rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
|
|
||||||
<dc:title />
|
|
||||||
</cc:Work>
|
|
||||||
</rdf:RDF>
|
|
||||||
</metadata>
|
|
||||||
<g
|
|
||||||
inkscape:label="Layer 1"
|
|
||||||
inkscape:groupmode="layer"
|
|
||||||
id="layer1">
|
|
||||||
<g
|
|
||||||
id="g3319-1-2-5-1-4-4"
|
|
||||||
transform="matrix(0.10419818,0,0,-0.10419818,137.10955,897.00327)"
|
|
||||||
style="fill:url(#radialGradient10699-1-3);fill-opacity:1"
|
|
||||||
inkscape:export-filename="C:\Users\Adam\Desktop\bg_logo1.png"
|
|
||||||
inkscape:export-xdpi="63.625523"
|
|
||||||
inkscape:export-ydpi="63.625523">
|
|
||||||
<g
|
|
||||||
clip-path="url(#clipPath3323-7-2-4-5-3-4)"
|
|
||||||
id="g3321-9-2-7-4-3-9"
|
|
||||||
style="fill:url(#radialGradient6856);fill-opacity:1">
|
|
||||||
<path
|
|
||||||
id="path3335-8-7-3-8-92-0"
|
|
||||||
style="fill:url(#radialGradient4516-8-2);fill-opacity:1;fill-rule:nonzero;stroke:none"
|
|
||||||
d="m 997.469,2312.51 c -322.379,0 -583.739,261.36 -583.739,583.74 0,322.38 261.36,583.74 583.739,583.74 322.381,0 583.741,-261.36 583.741,-583.74 0,-322.38 -261.36,-583.74 -583.741,-583.74"
|
|
||||||
inkscape:connector-curvature="0" />
|
|
||||||
</g>
|
|
||||||
</g>
|
|
||||||
<g
|
|
||||||
id="g3347-6-8-3-7-4-4"
|
|
||||||
transform="matrix(0.125,0,0,-0.125,112.08304,959.82207)"
|
|
||||||
style="fill:url(#linearGradient10695-9-9);fill-opacity:1"
|
|
||||||
inkscape:export-filename="C:\Users\Adam\Desktop\bg_logo1.png"
|
|
||||||
inkscape:export-xdpi="63.625523"
|
|
||||||
inkscape:export-ydpi="63.625523">
|
|
||||||
<g
|
|
||||||
clip-path="url(#clipPath3351-4-7-3-5-95-0)"
|
|
||||||
id="g3349-5-5-4-7-9-4"
|
|
||||||
style="fill:url(#linearGradient10693-9-4);fill-opacity:1">
|
|
||||||
<path
|
|
||||||
id="path3361-0-8-2-9-0-9"
|
|
||||||
style="fill:url(#linearGradient4510-1-5);fill-opacity:1;fill-rule:nonzero;stroke:none"
|
|
||||||
d="m 757.242,2926.25 -110.687,-189.11 110.656,-190.89 219.437,0 111.622,189.1 -111.59,190.9 -219.438,0"
|
|
||||||
inkscape:connector-curvature="0" />
|
|
||||||
</g>
|
|
||||||
</g>
|
|
||||||
<path
|
|
||||||
id="path3363-6-9-0-1-5-8"
|
|
||||||
style="fill:#ffffff;fill-opacity:1;fill-rule:nonzero;stroke:none"
|
|
||||||
d="m 194.34816,617.68335 13.106,-22.3925 25.99649,0 13.21487,22.60874 -13.21487,22.39125 -25.99649,0 -13.106,-22.60749 z m 40.53761,-24.8925 -28.86524,0 -0.72412,1.23749 -13.106,22.39251 -0.73575,1.25625 0.73087,1.26 13.106,22.60744 0.72263,1.24634 28.86374,0 0.72512,-1.22884 13.215,-22.39119 0.74625,-1.265 -0.74,-1.26751 -13.21537,-22.60875 -0.72313,-1.23874"
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
inkscape:export-filename="C:\Users\Adam\Desktop\bg_logo1.png"
|
|
||||||
inkscape:export-xdpi="63.625523"
|
|
||||||
inkscape:export-ydpi="63.625523" />
|
|
||||||
<g
|
|
||||||
id="g3365-0-4-1-9-7-5"
|
|
||||||
transform="matrix(0.125,0,0,-0.125,112.08304,959.82207)"
|
|
||||||
style="fill:url(#linearGradient10691-7-8);fill-opacity:1"
|
|
||||||
inkscape:export-filename="C:\Users\Adam\Desktop\bg_logo1.png"
|
|
||||||
inkscape:export-xdpi="63.625523"
|
|
||||||
inkscape:export-ydpi="63.625523">
|
|
||||||
<g
|
|
||||||
clip-path="url(#clipPath3369-1-5-6-1-0-7)"
|
|
||||||
id="g3367-2-4-2-8-4-3"
|
|
||||||
style="fill:url(#linearGradient10689-4-2);fill-opacity:1">
|
|
||||||
<path
|
|
||||||
id="path3379-4-6-7-6-7-2"
|
|
||||||
style="fill:url(#linearGradient4498-5-7);fill-opacity:1;fill-rule:nonzero;stroke:none"
|
|
||||||
d="m 1131.64,3128.5 -104.95,-181.12 116.38,-200.42 208.05,0.94 112.02,191.63 -112.08,188.97 -219.42,0"
|
|
||||||
inkscape:connector-curvature="0" />
|
|
||||||
</g>
|
|
||||||
</g>
|
|
||||||
<path
|
|
||||||
id="path3381-6-8-0-0-66-3"
|
|
||||||
style="fill:#ffffff;fill-opacity:1;fill-rule:nonzero;stroke:none"
|
|
||||||
d="m 241.86427,591.39959 12.3925,-21.38999 25.99625,0 13.27125,22.37625 -13.27125,22.7025 -24.56875,0.11 -13.82,-23.79876 z m 39.8125,-23.88999 -28.86125,0 -0.7225,1.24625 -12.3925,21.39 -0.72625,1.255 0.7275,1.25374 13.82,23.79876 0.7275,1.25125 1.44625,-0.006 24.56875,-0.11 1.4275,-0.006 0.72,-1.2325 13.27125,-22.7025 0.7425,-1.27 -0.75125,-1.26625 -13.27125,-22.37625 -0.72625,-1.225"
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
inkscape:export-filename="C:\Users\Adam\Desktop\bg_logo1.png"
|
|
||||||
inkscape:export-xdpi="63.625523"
|
|
||||||
inkscape:export-ydpi="63.625523" />
|
|
||||||
<g
|
|
||||||
id="g3383-5-5-2-2-3-0"
|
|
||||||
transform="matrix(0.125,0,0,-0.125,112.08304,959.82207)"
|
|
||||||
style="fill:url(#linearGradient10687-2-5);fill-opacity:1"
|
|
||||||
inkscape:export-filename="C:\Users\Adam\Desktop\bg_logo1.png"
|
|
||||||
inkscape:export-xdpi="63.625523"
|
|
||||||
inkscape:export-ydpi="63.625523">
|
|
||||||
<g
|
|
||||||
clip-path="url(#clipPath3387-3-6-4-2-8-4)"
|
|
||||||
id="g3385-0-6-4-8-0-1"
|
|
||||||
style="fill:url(#linearGradient10685-2-2);fill-opacity:1">
|
|
||||||
<path
|
|
||||||
id="path3397-9-6-1-6-9-7"
|
|
||||||
style="fill:url(#linearGradient4492-8-8);fill-opacity:1;fill-rule:nonzero;stroke:none"
|
|
||||||
d="m 862.109,3289.75 -109.086,-190.45 69.122,-124.42 164.511,-0.47 c 0,0 111.044,188.28 116.564,197.63 7.66,0 43.03,0 43.03,0 l -67.03,117.71 -217.111,0"
|
|
||||||
inkscape:connector-curvature="0" />
|
|
||||||
</g>
|
|
||||||
</g>
|
|
||||||
<path
|
|
||||||
id="path3399-6-7-3-2-0-1"
|
|
||||||
style="fill:#ffffff;fill-opacity:1;fill-rule:nonzero;stroke:none"
|
|
||||||
d="m 207.64603,572.41959 12.92424,-22.56624 25.68775,0 6.95625,12.21375 -3.94375,0 -14.56837,24.7025 -19.11525,-0.055 -7.94087,-14.295 z m 40.06574,-25.06624 -28.59012,0 -0.71975,1.2575 -12.92537,22.56625 -0.70112,1.22375 0.68512,1.23249 7.94137,14.295 0.71087,1.2825 1.46638,0.004 19.11525,0.055 1.43212,0.004 0.729,-1.23375 13.84375,-23.47249 6.81625,0 -2.12875,-3.7375 -6.95625,-12.21375 -0.71875,-1.2625"
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
inkscape:export-filename="C:\Users\Adam\Desktop\bg_logo1.png"
|
|
||||||
inkscape:export-xdpi="63.625523"
|
|
||||||
inkscape:export-ydpi="63.625523" />
|
|
||||||
<g
|
|
||||||
transform="matrix(1.25,0,0,-1.25,105.02062,972.84257)"
|
|
||||||
id="g3465-0-8-9"
|
|
||||||
inkscape:export-filename="C:\Users\Adam\Desktop\bg_logo1.png"
|
|
||||||
inkscape:export-xdpi="63.625523"
|
|
||||||
inkscape:export-ydpi="63.625523">
|
|
||||||
<text
|
|
||||||
id="text3467-9-0-8"
|
|
||||||
transform="matrix(1,0,-0.17627963,-1,0,0)"
|
|
||||||
x="116.98372"
|
|
||||||
y="-267.77499"
|
|
||||||
style="font-size:11.81779194px">
|
|
||||||
<tspan
|
|
||||||
sodipodi:role="line"
|
|
||||||
style="font-size:46.39999771px;font-variant:normal;font-weight:normal;writing-mode:lr-tb;fill:#49608a;fill-opacity:1;fill-rule:nonzero;stroke:none;font-family:Denmark;-inkscape-font-specification:Denmark"
|
|
||||||
x="116.98372"
|
|
||||||
y="-267.77499"
|
|
||||||
id="tspan13239">UTILITY</tspan>
|
|
||||||
<tspan
|
|
||||||
sodipodi:role="line"
|
|
||||||
style="font-size:46.39999771px;font-variant:normal;font-weight:normal;writing-mode:lr-tb;fill:#49608a;fill-opacity:1;fill-rule:nonzero;stroke:none;font-family:Denmark;-inkscape-font-specification:Denmark"
|
|
||||||
x="116.98372"
|
|
||||||
y="-209.77499"
|
|
||||||
id="tspan11278-3" />
|
|
||||||
</text>
|
|
||||||
<text
|
|
||||||
id="text3471-0-51-2"
|
|
||||||
transform="matrix(0.99235617,0,-0.17763746,-1.0077027,0,0)"
|
|
||||||
style="font-size:38.40000153px"
|
|
||||||
x="112.74373"
|
|
||||||
y="-306.75479">
|
|
||||||
<tspan
|
|
||||||
id="tspan3473-6-0-9"
|
|
||||||
sodipodi:role="line"
|
|
||||||
style="font-size:38.40000153px;font-variant:normal;font-weight:normal;writing-mode:lr-tb;fill:#49608a;fill-opacity:1;fill-rule:nonzero;stroke:none;font-family:Denmark;-inkscape-font-specification:Denmark"
|
|
||||||
x="112.74373"
|
|
||||||
y="-306.75479">boost</tspan>
|
|
||||||
</text>
|
|
||||||
</g>
|
|
||||||
<path
|
|
||||||
style="fill:#ffffff;fill-opacity:1;stroke:none"
|
|
||||||
d="m 201.43967,613.81579 4.64114,4.2175 3.3738,-3.71306 -0.92817,-0.84354 1.68708,-1.85636 20.53445,20.81026 4.2175,-4.64111 -22.22144,-18.95384 c 0,0 1.69594,-1.83698 2.53062,-2.78454 2.53905,-2.76559 5.98925,-4.72587 5.98925,-4.72587 0,0 -6.03647,0.58224 -8.76507,2.21476 -0.84428,0.92751 -6.75676,7.40649 -6.75676,7.40649 l -0.92819,-0.84355 -3.37382,3.71308"
|
|
||||||
id="path13283"
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
sodipodi:nodetypes="cccccccccccccc" />
|
|
||||||
<g
|
|
||||||
id="g3086"
|
|
||||||
transform="matrix(0.99872217,-0.05053738,0.05053738,0.99872217,-31.539183,11.181538)">
|
|
||||||
<path
|
|
||||||
sodipodi:nodetypes="ccccccccc"
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
id="path13243"
|
|
||||||
d="m 227.74101,611.16418 -15.09943,12.783 2.55659,3.01989 15.09944,-12.78302 c 3.56324,2.16769 7.58975,-1.2411 7.0464,-5.96538 l -4.02652,3.40879 -2.55659,-3.01989 4.02652,-3.40879 c -3.56324,-2.16769 -8.59639,2.0933 -7.04641,5.9654 z"
|
|
||||||
style="fill:#ffffff;fill-opacity:1;stroke:none" />
|
|
||||||
<path
|
|
||||||
sodipodi:nodetypes="ccccccccc"
|
|
||||||
inkscape:connector-curvature="0"
|
|
||||||
id="path13243-1"
|
|
||||||
d="m 215.25729,626.9851 15.08951,-12.7947 -2.55893,-3.01791 -15.08952,12.79471 c -3.56492,-2.16491 -7.58878,1.24699 -7.04177,5.97085 l 4.02388,-3.41192 2.55892,3.01791 -4.02387,3.41192 c 3.56491,2.16492 8.59476,-2.09997 7.04178,-5.97086 z"
|
|
||||||
style="fill:#ffffff;fill-opacity:1;stroke:none" />
|
|
||||||
</g>
|
|
||||||
</g>
|
|
||||||
</svg>
|
|
||||||
|
Before Width: | Height: | Size: 20 KiB |
234
doc/main.qbk
234
doc/main.qbk
@@ -1,234 +0,0 @@
|
|||||||
[/
|
|
||||||
Copyright (c) 2021, Alan Freitas
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
Official repository: https://github.com/boostorg/utility
|
|
||||||
]
|
|
||||||
|
|
||||||
[/#############################################
|
|
||||||
DOCUMENT INFO
|
|
||||||
###############################################]
|
|
||||||
|
|
||||||
[library Boost.Utility
|
|
||||||
[id utility]
|
|
||||||
[quickbook 1.6]
|
|
||||||
[copyright 2001 Beman Dawes]
|
|
||||||
[purpose Utility Library]
|
|
||||||
[license
|
|
||||||
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])
|
|
||||||
]
|
|
||||||
[authors [Dawes, Beman]]
|
|
||||||
[category template]
|
|
||||||
[category generic]
|
|
||||||
]
|
|
||||||
|
|
||||||
[template mdash[]'''—''']
|
|
||||||
[template ndash[]'''–''']
|
|
||||||
[template sect[]'''§''']
|
|
||||||
[template hellip[]'''…''']
|
|
||||||
|
|
||||||
[template indexterm1[term1]'''<indexterm><primary>'''[term1]'''</primary></indexterm>''']
|
|
||||||
[template indexterm2[term1 term2]'''<indexterm><primary>'''[term1]'''</primary><secondary>'''[term2]'''</secondary></indexterm>''']
|
|
||||||
|
|
||||||
[template include_file[path][^<'''<ulink url="https://github.com/boostorg/utility/blob/master/include/'''[path]'''">'''[path]'''</ulink>'''>]]
|
|
||||||
[template issue[n]'''<ulink url="https://github.com/boostorg/utility/issues/'''[n]'''">#'''[n]'''</ulink>''']
|
|
||||||
|
|
||||||
[/ Named Requirements ]
|
|
||||||
|
|
||||||
[def __Handler__ ['Handler]]
|
|
||||||
[def __Allocator__ [@https://en.cppreference.com/w/cpp/named_req/Allocator ['Allocator]]]
|
|
||||||
[def __CopyAssignable__ [@https://en.cppreference.com/w/cpp/named_req/CopyAssignable ['CopyAssignable]]]
|
|
||||||
[def __CopyConstructible__ [@https://en.cppreference.com/w/cpp/named_req/CopyConstructible ['CopyConstructible]]]
|
|
||||||
[def __Copyable__ [@https://en.cppreference.com/w/cpp/concepts/copyable ['Copyable]]]
|
|
||||||
[def __DefaultConstructible__ [@https://en.cppreference.com/w/cpp/named_req/DefaultConstructible ['DefaultConstructible]]]
|
|
||||||
[def __Hash__ [@https://en.cppreference.com/w/cpp/named_req/Hash ['Hash]]]
|
|
||||||
[def __InputIterator__ [@https://en.cppreference.com/w/cpp/named_req/InputIterator ['InputIterator]]]
|
|
||||||
[def __MoveAssignable__ [@https://en.cppreference.com/w/cpp/named_req/MoveAssignable ['MoveAssignable]]]
|
|
||||||
[def __MoveConstructible__ [@https://en.cppreference.com/w/cpp/named_req/MoveConstructible ['MoveConstructible]]]
|
|
||||||
[def __RandomAccessIterator__ [@https://en.cppreference.com/w/cpp/named_req/RandomAccessIterator ['RandomAccessIterator]]]
|
|
||||||
[def __Regular__ [@https://en.cppreference.com/w/cpp/concepts/regular ['Regular]]]
|
|
||||||
[def __Swappable__ [@https://en.cppreference.com/w/cpp/named_req/Swappable ['Swappable]]]
|
|
||||||
|
|
||||||
[/ Boost types ]
|
|
||||||
[/ (Macros are defined here because these macros are often referenced in other components) ]
|
|
||||||
[/ (operators macros link to the a table of operators because there's no doxygen reference for the operators) ]
|
|
||||||
|
|
||||||
[def __BOOST_BINARY__ [link sec:BOOST_BINARY `BOOST_BINARY`]]
|
|
||||||
[def __in_place_factory__ [link sec:in_place_factory `in_place_factory`]]
|
|
||||||
|
|
||||||
[def __boost_base_from_member__ [link boost.base_from_member `boost::base_from_member`]]
|
|
||||||
[def __boost_call_traits__ [link boost.call_traits `boost::call_traits`]]
|
|
||||||
[def __boost_result_of__ [link boost.result_of `boost::result_of`]]
|
|
||||||
[def __boost_tr1_result_of__ [link boost.tr1_result_of `boost::tr1_result_of`]]
|
|
||||||
[def __boost_string_view__ [link boost.basic_string_view `boost::string_view`]]
|
|
||||||
[def __boost_basic_string_view__ [link boost.basic_string_view `boost::basic_string_view`]]
|
|
||||||
|
|
||||||
[def __additive1__ [link sec:arithmetic `additive1`]]
|
|
||||||
[def __additive2__ [link sec:arithmetic `additive2`]]
|
|
||||||
[def __arithmetic1__ [link sec:arithmetic `arithmetic1`]]
|
|
||||||
[def __arithmetic2__ [link sec:arithmetic `arithmetic2`]]
|
|
||||||
[def __base_from_member__ [link boost.base_from_member `base_from_member`]]
|
|
||||||
[def __basic_string_ref__ [link boost.basic_string_view `basic_string_ref`]]
|
|
||||||
[def __basic_string_view__ [link boost.basic_string_view `basic_string_view`]]
|
|
||||||
[def __bidirectional_iteratable__ [link sec:arithmetic `bidirectional_iteratable`]]
|
|
||||||
[def __bidirectional_iterator_helper__ [link sec:arithmetic `bidirectional_iterator_helper`]]
|
|
||||||
[def __bitwise1__ [link sec:arithmetic `bitwise1`]]
|
|
||||||
[def __bitwise2__ [link sec:arithmetic `bitwise2`]]
|
|
||||||
[def __call_traits__ [link boost.call_traits `call_traits`]]
|
|
||||||
[def __call_traits_T__ [link boost.call_traits `call_traits<T>`]]
|
|
||||||
[def __call_traits_lt__T___ [link boost.call_traits `call_traits<T&>`]]
|
|
||||||
[def __call_traits_lt__T_lb_N_rb__gt___ [link boost.call_traits `call_traits< T[N]>`]]
|
|
||||||
[def __call_traits_lt__const_T_lb_N_rb__gt___ [link boost.call_traits `call_traits< const T[N]>`]]
|
|
||||||
[def __compressed_pair__ [link boost.compressed_pair `compressed_pair`]]
|
|
||||||
[def __decrementable__ [link sec:arithmetic `decrementable`]]
|
|
||||||
[def __dereferenceable__ [link sec:arithmetic `dereferenceable`]]
|
|
||||||
[def __equal_pointees__ [link sec:arithmetic `equal_pointees`]]
|
|
||||||
[def __equal_pointees_t__ [link sec:arithmetic `equal_pointees_t`]]
|
|
||||||
[def __equality_comparable1__ [link sec:arithmetic `equality_comparable1`]]
|
|
||||||
[def __equality_comparable2__ [link sec:arithmetic `equality_comparable2`]]
|
|
||||||
[def __equivalent1__ [link sec:arithmetic `equivalent1`]]
|
|
||||||
[def __equivalent2__ [link sec:arithmetic `equivalent2`]]
|
|
||||||
[def __euclidean_ring_operators1__ [link sec:arithmetic `euclidean_ring_operators1`]]
|
|
||||||
[def __euclidean_ring_operators2__ [link sec:arithmetic `euclidean_ring_operators2`]]
|
|
||||||
[def __field_operators1__ [link sec:arithmetic `field_operators1`]]
|
|
||||||
[def __field_operators2__ [link sec:arithmetic `field_operators2`]]
|
|
||||||
[def __forward_iteratable__ [link sec:arithmetic `forward_iteratable`]]
|
|
||||||
[def __forward_iterator_helper__ [link sec:arithmetic `forward_iterator_helper`]]
|
|
||||||
[def __get__ [link boost.get `get`]]
|
|
||||||
[def __hash_range__ [link boost.hash_range `hash_range`]]
|
|
||||||
[def __hash_value__ [link boost.hash_value `hash_value`]]
|
|
||||||
[def __in_place_factory_base__ [link boost.in_place_factory_base `in_place_factory_base`]]
|
|
||||||
[def __incrementable__ [link sec:arithmetic `incrementable`]]
|
|
||||||
[def __indexable__ [link sec:arithmetic `indexable`]]
|
|
||||||
[def __initialized__ [link boost.initialized `initialized`]]
|
|
||||||
[def __initialized_value__ [link boost.initialized_value `initialized_value`]]
|
|
||||||
[def __initialized_value_t__ [link boost.initialized_value_t `initialized_value_t`]]
|
|
||||||
[def __input_iteratable__ [link sec:arithmetic `input_iteratable`]]
|
|
||||||
[def __input_iterator_helper__ [link sec:arithmetic `input_iterator_helper`]]
|
|
||||||
[def __integer_arithmetic1__ [link sec:arithmetic `integer_arithmetic1`]]
|
|
||||||
[def __integer_arithmetic2__ [link sec:arithmetic `integer_arithmetic2`]]
|
|
||||||
[def __integer_multiplicative1__ [link sec:arithmetic `integer_multiplicative1`]]
|
|
||||||
[def __integer_multiplicative2__ [link sec:arithmetic `integer_multiplicative2`]]
|
|
||||||
[def __is_chained_base__ [link sec:arithmetic `is_chained_base`]]
|
|
||||||
[def __less_pointees__ [link boost.less_pointees `less_pointees`]]
|
|
||||||
[def __less_pointees_t__ [link boost.less_pointees_t `less_pointees_t`]]
|
|
||||||
[def __less_than_comparable1__ [link sec:arithmetic `less_than_comparable1`]]
|
|
||||||
[def __less_than_comparable2__ [link sec:arithmetic `less_than_comparable2`]]
|
|
||||||
[def __multiplicative1__ [link sec:arithmetic `multiplicative1`]]
|
|
||||||
[def __multiplicative2__ [link sec:arithmetic `multiplicative2`]]
|
|
||||||
[def __operator_eq__eq__ [link sec:arithmetic `operator==`]]
|
|
||||||
[def __operator_gt__ [link sec:arithmetic `operator_gt_`]]
|
|
||||||
[def __operator_gt__eq__ [link sec:arithmetic `operator>`]]
|
|
||||||
[def __operator_lt__ [link sec:arithmetic `operator<`]]
|
|
||||||
[def __operator_lt__eq__ [link sec:arithmetic `operator<=`]]
|
|
||||||
[def __operator_lt__lt__ [link sec:arithmetic `operator<<`]]
|
|
||||||
[def __operator_not__eq__ [link sec:arithmetic `operator!=`]]
|
|
||||||
[def __operators2__ [link sec:arithmetic `operators2`]]
|
|
||||||
[def __operators__ [link sec:arithmetic `operators`]]
|
|
||||||
[def __operators_lt_T__ [link sec:arithmetic `operators<T,T>`]]
|
|
||||||
[def __ordered_euclidean_ring_operators1__ [link sec:arithmetic `ordered_euclidean_ring_operators1`]]
|
|
||||||
[def __ordered_euclidean_ring_operators2__ [link sec:arithmetic `ordered_euclidean_ring_operators2`]]
|
|
||||||
[def __ordered_euclidian_ring_operators1__ [link sec:arithmetic `ordered_euclidian_ring_operators1`]]
|
|
||||||
[def __ordered_euclidian_ring_operators2__ [link sec:arithmetic `ordered_euclidian_ring_operators2`]]
|
|
||||||
[def __ordered_field_operators1__ [link sec:arithmetic `ordered_field_operators1`]]
|
|
||||||
[def __ordered_field_operators2__ [link sec:arithmetic `ordered_field_operators2`]]
|
|
||||||
[def __ordered_ring_operators1__ [link sec:arithmetic `ordered_ring_operators1`]]
|
|
||||||
[def __ordered_ring_operators2__ [link sec:arithmetic `ordered_ring_operators2`]]
|
|
||||||
[def __output_iteratable__ [link sec:arithmetic `output_iteratable`]]
|
|
||||||
[def __output_iterator_helper__ [link sec:arithmetic `output_iterator_helper`]]
|
|
||||||
[def __partially_ordered1__ [link sec:arithmetic `partially_ordered1`]]
|
|
||||||
[def __partially_ordered2__ [link sec:arithmetic `partially_ordered2`]]
|
|
||||||
[def __random_access_iteratable__ [link sec:arithmetic `random_access_iteratable`]]
|
|
||||||
[def __random_access_iterator_helper__ [link sec:arithmetic `random_access_iterator_helper`]]
|
|
||||||
[def __result_of__ [link boost.result_of `result_of`]]
|
|
||||||
[def __ring_operators1__ [link sec:arithmetic `ring_operators1`]]
|
|
||||||
[def __ring_operators2__ [link sec:arithmetic `ring_operators2`]]
|
|
||||||
[def __shiftable1__ [link sec:arithmetic `shiftable1`]]
|
|
||||||
[def __shiftable2__ [link sec:arithmetic `shiftable2`]]
|
|
||||||
[def __string_ref__ [link boost.basic_string_view `string_ref`]]
|
|
||||||
[def __string_view__ [link boost.basic_string_view `string_view`]]
|
|
||||||
[def __swap__ [link sec:arithmetic `swap`]]
|
|
||||||
[def __totally_ordered1__ [link sec:arithmetic `totally_ordered1`]]
|
|
||||||
[def __totally_ordered2__ [link sec:arithmetic `totally_ordered2`]]
|
|
||||||
[def __tr1_result_of__ [link boost.tr1_result_of `tr1_result_of`]]
|
|
||||||
[def __typed_in_place_factory_base__ [link boost.typed_in_place_factory_base `typed_in_place_factory_base`]]
|
|
||||||
[def __u16string_ref__ [link boost.basic_string_view `u16string_ref`]]
|
|
||||||
[def __u16string_view__ [link boost.basic_string_view `u16string_view`]]
|
|
||||||
[def __u32string_ref__ [link boost.basic_string_view `u32string_ref`]]
|
|
||||||
[def __u32string_view__ [link boost.basic_string_view `u32string_view`]]
|
|
||||||
[def __unit_steppable__ [link sec:arithmetic `unit_steppable`]]
|
|
||||||
[def __value_initialized__ [link boost.value_initialized `value_initialized`]]
|
|
||||||
[def __wstring_ref__ [link boost.basic_string_view `wstring_ref`]]
|
|
||||||
[def __wstring_view__ [link boost.basic_string_view `wstring_view`]]
|
|
||||||
|
|
||||||
[/ std:: types ]
|
|
||||||
|
|
||||||
[def __assert__ [@https://en.cppreference.com/w/cpp/error/assert `assert`]]
|
|
||||||
[def __decltype__ [@https://en.cppreference.com/w/cpp/language/decltype `decltype`]]
|
|
||||||
[def __initializer_list__ [@https://en.cppreference.com/w/cpp/utility/initializer_list `std::initializer_list`]]
|
|
||||||
[def __nullptr__ [@https://en.cppreference.com/w/cpp/language/nullptr `nullptr`]]
|
|
||||||
[def __std_addressof__ [@https://en.cppreference.com/w/cpp/memory/addressof `std::addressof`]]
|
|
||||||
[def __std_array__ [@https://en.cppreference.com/w/cpp/container/array `std::array`]]
|
|
||||||
[def __std_basic_string__ [@https://en.cppreference.com/w/cpp/string/basic_string `std::basic_string`]]
|
|
||||||
[def __std_basic_string_view__ [@https://en.cppreference.com/w/cpp/string/basic_string_view `std::basic_string_view`]]
|
|
||||||
[def __std_binder1st__ [@https://en.cppreference.com/w/cpp/utility/functional/binder12 `std::binder1st`]]
|
|
||||||
[def __std_complex__ [@https://en.cppreference.com/w/cpp/numeric/complex `std::complex`]]
|
|
||||||
[def __std_declval__ [@https://en.cppreference.com/w/cpp/utility/declval `std::declval`]]
|
|
||||||
[def __std_enable_if__ [@https://en.cppreference.com/w/cpp/types/enable_if `std::enable_if`]]
|
|
||||||
[def __std_enable_if_t__ [@https://en.cppreference.com/w/cpp/types/enable_if `std::enable_if_t`]]
|
|
||||||
[def __std_fill__ [@https://en.cppreference.com/w/cpp/algorithm/fill `std::fill`]]
|
|
||||||
[def __std_hash__ [@https://en.cppreference.com/w/cpp/utility/hash `std::hash`]]
|
|
||||||
[def __std_initializer_list__ [@https://en.cppreference.com/w/cpp/utility/initializer_list `std::initializer_list`]]
|
|
||||||
[def __std_is_nothrow_constructible__ [@https://en.cppreference.com/w/cpp/types/is_constructible `std::is_nothrow_constructible`]]
|
|
||||||
[def __std_make_pair__ [@https://en.cppreference.com/w/cpp/utility/pair/make_pair `std::make_pair`]]
|
|
||||||
[def __std_memory_resource__ [@https://en.cppreference.com/w/cpp/memory/memory_resource `std::pmr::memory_resource`]]
|
|
||||||
[def __std_memset__ [@https://en.cppreference.com/w/cpp/string/byte/memset `std::memset`]]
|
|
||||||
[def __std_next__ [@https://en.cppreference.com/w/cpp/iterator/next `std::next`]]
|
|
||||||
[def __std_nullptr_t__ [@https://en.cppreference.com/w/cpp/types/nullptr_t `std::nullptr_t`]]
|
|
||||||
[def __std_ostream__ [@https://en.cppreference.com/w/cpp/io/basic_ostream `std::ostream`]]
|
|
||||||
[def __std_ostream__ [@https://en.cppreference.com/w/cpp/io/basic_ostream `__std_ostream__`]]
|
|
||||||
[def __std_pair__ [@https://en.cppreference.com/w/cpp/utility/pair `std::pair`]]
|
|
||||||
[def __std_polymorphic_allocator__ [@https://en.cppreference.com/w/cpp/memory/polymorphic_allocator `std::pmr::polymorphic_allocator`]]
|
|
||||||
[def __std_prev__ [@https://en.cppreference.com/w/cpp/iterator/prev `std::prev`]]
|
|
||||||
[def __std_ptrdiff_t__ [@https://en.cppreference.com/w/cpp/types/ptrdiff_t `std::ptrdiff_t`]]
|
|
||||||
[def __std_remove__ [@https://en.cppreference.com/w/cpp/algorithm/remove `std::remove`]]
|
|
||||||
[def __std_result_of__ [@https://en.cppreference.com/w/cpp/types/result_of `std::result_of`]]
|
|
||||||
[def __std_sort__ [@https://en.cppreference.com/w/cpp/algorithm/sort `std::sort`]]
|
|
||||||
[def __std_streambuf__ [@https://en.cppreference.com/w/cpp/header/streambuf `std::streambuf`]]
|
|
||||||
[def __std_string__ [@https://en.cppreference.com/w/cpp/string/basic_string `std::string`]]
|
|
||||||
[def __std_string_view__ [@https://en.cppreference.com/w/cpp/string/basic_string_view `std::string_view`]]
|
|
||||||
[def __std_unary_function__ [@https://en.cppreference.com/w/cpp/utility/functional/unary_function `std::unary_function`]]
|
|
||||||
[def __std_unordered_map__ [@https://en.cppreference.com/w/cpp/container/unordered_map `std::unordered_map`]]
|
|
||||||
[def __std_uses_allocator__ [@https://en.cppreference.com/w/cpp/memory/uses_allocator `std::uses_allocator`]]
|
|
||||||
[def __std_vector__ [@https://en.cppreference.com/w/cpp/container/vector `std::vector`]]
|
|
||||||
|
|
||||||
[/ Dingbats ]
|
|
||||||
|
|
||||||
[def __good__ [role green \u2714]]
|
|
||||||
[def __bad__ [role red \u2718]]
|
|
||||||
|
|
||||||
[/-----------------------------------------------------------------------------]
|
|
||||||
|
|
||||||
[include overview.qbk]
|
|
||||||
|
|
||||||
[include utilities.qbk]
|
|
||||||
|
|
||||||
[include other.qbk]
|
|
||||||
|
|
||||||
[#sec:reference]
|
|
||||||
[section:ref Quick Reference]
|
|
||||||
|
|
||||||
[/ Reference table ]
|
|
||||||
[xinclude quickref.xml]
|
|
||||||
|
|
||||||
[/ Generated reference files ]
|
|
||||||
[/ [include reference.qbk] ]
|
|
||||||
|
|
||||||
[/ Generated index ]
|
|
||||||
[/ [xinclude index.xml] ]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
2008
doc/operators.qbk
2008
doc/operators.qbk
File diff suppressed because it is too large
Load Diff
@@ -1,29 +0,0 @@
|
|||||||
[/
|
|
||||||
Copyright (c) 2021 Alan de Freitas (alandefreitas@gmail.com)
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
Official repository: https://github.com/boostorg/utility
|
|
||||||
]
|
|
||||||
|
|
||||||
[section:utilities More Utilities]
|
|
||||||
|
|
||||||
Some utilities have been moved from Boost.Utilities to more appropriate Boost libraries:
|
|
||||||
|
|
||||||
# Moved to [@boost:/libs/core/index.html Boost.Core]
|
|
||||||
# [@boost:/libs/core/doc/html/core/addressof.html addressof]
|
|
||||||
# [@boost:/libs/core/doc/html/core/checked_delete.html checked_delete]
|
|
||||||
# [@boost:/libs/core/doc/html/core/enable_if.html enable_if]
|
|
||||||
# [@boost:/libs/core/doc/html/core/noncopyable.html noncopyable]
|
|
||||||
# Moved to [@boost:/libs/type_traits/index.html Boost.TypeTraits]
|
|
||||||
# [@boost:/libs/type_traits/doc/html/boost_typetraits/reference/declval.html declval]
|
|
||||||
# Moved to [@boost:/libs/iterator/index.html Boost.Iterator]
|
|
||||||
# [@boost:/libs/iterator/doc/generator_iterator.htm generator iterator adaptors]
|
|
||||||
# [@boost:/libs/iterator/doc/html/iterator/algorithms/next_prior.html next/prior]
|
|
||||||
# Moved to [@boost:/libs/io/index.html Boost.IO]
|
|
||||||
# [@boost:/libs/io/doc/html/io.html ostream_string]
|
|
||||||
# Moved to [@boost:/libs/throw_exception/index.html Boost.ThrowException]
|
|
||||||
# [@boost:/libs/throw_exception/doc/html/throw_exception.html#using_boost_throw_exception throw_exception]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
@@ -1,46 +0,0 @@
|
|||||||
[/
|
|
||||||
Copyright (c) 2021 Alan de Freitas (alandefreitas@gmail.com)
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
Official repository: https://github.com/boostorg/utility
|
|
||||||
]
|
|
||||||
|
|
||||||
[section Overview]
|
|
||||||
[block'''<?dbhtml stop-chunking?>''']
|
|
||||||
|
|
||||||
Boost.Utility is a collection of small, useful, and general-purpose components for language support.
|
|
||||||
|
|
||||||
Over time,
|
|
||||||
|
|
||||||
* several components have been moved to more appropriate Boost libraries and
|
|
||||||
* many of these components had variants accepted into the C++ standard
|
|
||||||
|
|
||||||
When the component has moved to another Boost library, Boost.Utility headers still lead to the appropriate headers
|
|
||||||
in other libraries.
|
|
||||||
|
|
||||||
[table:id Components
|
|
||||||
[[Boost.Utility] [Moved to Boost] [C++ Standard variant]]
|
|
||||||
[[[@boost:/libs/core/doc/html/core/addressof.html `addressof`]] [[@boost:/libs/core/index.html Boost.Core]] [C++11 __std_addressof__]]
|
|
||||||
[[__base_from_member__] [] []]
|
|
||||||
[[__BOOST_BINARY__] [] [C++14 [@https://en.cppreference.com/w/cpp/language/integer_literal Binary integer literal]]]
|
|
||||||
[[__call_traits__] [] []]
|
|
||||||
[[[@boost:/libs/core/doc/html/core/checked_delete.html `checked_delete`]] [[@boost:/libs/core/index.html Boost.Core]] []]
|
|
||||||
[[__compressed_pair__] [] []]
|
|
||||||
[[[@boost:/libs/type_traits/doc/html/boost_typetraits/reference/declval.html `declval`]] [[@boost:/libs/type_traits/index.html Boost.TypeTraits]] [C++11 __std_declval__]]
|
|
||||||
[[[@boost:/libs/core/doc/html/core/enable_if.html `enable_if`]] [[@boost:/libs/core/index.html Boost.Core]] [C++11 __std_enable_if__]]
|
|
||||||
[[[@boost:/libs/iterator/doc/generator_iterator.htm generator iterator adaptors]] [[@boost:/libs/iterator/index.html Boost.Iterator]] []]
|
|
||||||
[[__in_place_factory__] [] []]
|
|
||||||
[[[@boost:/libs/iterator/index.html `iterator_adaptors`]] [[@boost:/libs/iterator/index.html Boost.Iterator]] []]
|
|
||||||
[[[@boost:/libs/iterator/doc/html/iterator/algorithms/next_prior.html `next` / `prior`]] [[@boost:/libs/iterator/index.html Boost.Iterator]] [C++11 __std_next__ / __std_prev__]]
|
|
||||||
[[[@boost:/libs/core/doc/html/core/noncopyable.html `noncopyable`]] [[@boost:/libs/core/index.html Boost.Core]] []]
|
|
||||||
[[[link sec:operators `operators`]] [] []]
|
|
||||||
[[[@boost:/libs/io/doc/html/io.html `ostream_string`]] [[@boost:/libs/io/index.html Boost.IO]] []]
|
|
||||||
[[__result_of__] [] [C++11 __std_result_of__]]
|
|
||||||
[[__string_view__] [] [C++17 __std_string_view__]]
|
|
||||||
[[[@boost:/libs/throw_exception/doc/html/throw_exception.html#using_boost_throw_exception `throw_exception`]] [[@boost:/libs/throw_exception/index.html Boost.ThrowException]] []]
|
|
||||||
[[[link sec:value_init `value_init`]] [] [C++11 [@https://en.cppreference.com/w/cpp/language/list_initialization List initialization]]]
|
|
||||||
]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
497
doc/quickref.xml
497
doc/quickref.xml
@@ -1,497 +0,0 @@
|
|||||||
<?xml version="1.0" encoding="utf-8"?>
|
|
||||||
<!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN" "../../../tools/boostbook/dtd/boostbook.dtd">
|
|
||||||
|
|
||||||
<!--
|
|
||||||
Copyright (c) 2021, Alan Freitas
|
|
||||||
|
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
|
||||||
|
|
||||||
See accompanying file LICENSE_1_0.txt
|
|
||||||
or copy at http://boost.org/LICENSE_1_0.txt
|
|
||||||
-->
|
|
||||||
|
|
||||||
<!-- See also https://tdg.docbook.org/tdg/5.1/ -->
|
|
||||||
|
|
||||||
<!-- Doxygen reference -->
|
|
||||||
<informaltable frame="all">
|
|
||||||
<tgroup cols="4">
|
|
||||||
<colspec colname="a"/>
|
|
||||||
<colspec colname="b"/>
|
|
||||||
<colspec colname="c"/>
|
|
||||||
<colspec colname="d"/>
|
|
||||||
|
|
||||||
<thead>
|
|
||||||
<row>
|
|
||||||
<entry valign="center" namest="a" nameend="a">
|
|
||||||
<bridgehead renderas="sect2">Base from Member</bridgehead>
|
|
||||||
</entry>
|
|
||||||
<entry valign="center" namest="b" nameend="b">
|
|
||||||
<bridgehead renderas="sect2">Call Traits</bridgehead>
|
|
||||||
</entry>
|
|
||||||
<entry valign="center" namest="c" nameend="c">
|
|
||||||
<bridgehead renderas="sect2">Compressed Pair</bridgehead>
|
|
||||||
</entry>
|
|
||||||
<entry valign="center" namest="d" nameend="d">
|
|
||||||
<bridgehead renderas="sect2">In-place Factory</bridgehead>
|
|
||||||
</entry>
|
|
||||||
</row>
|
|
||||||
</thead>
|
|
||||||
<tbody>
|
|
||||||
<row>
|
|
||||||
<!-- base_from_member -->
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.base_from_member">base_from_member</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<!-- call_traits -->
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Type Traits</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.call_traits">call_traits</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.call_traits">call_traits<T&></link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.call_traits">call_traits<T[N]>
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.call_traits">call_traits<const
|
|
||||||
T[N]>
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<!-- compressed_pair -->
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.compressed_pair">compressed_pair</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
|
|
||||||
<bridgehead renderas="sect3">Functions</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.detail.compressed_pair_hpp">swap</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<!-- in_place_factory -->
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.in_place_factory_base">in_place_factory_base</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.typed_in_place_factory_base">typed_in_place_factory_base
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
</row>
|
|
||||||
</tbody>
|
|
||||||
</tgroup>
|
|
||||||
|
|
||||||
<tgroup cols="5">
|
|
||||||
<colspec colname="a"/>
|
|
||||||
<colspec colname="b"/>
|
|
||||||
<colspec colname="c"/>
|
|
||||||
<colspec colname="d"/>
|
|
||||||
<colspec colname="e"/>
|
|
||||||
|
|
||||||
<thead>
|
|
||||||
<row>
|
|
||||||
<entry valign="center" namest="a" nameend="e">
|
|
||||||
<bridgehead renderas="sect2">Operators</bridgehead>
|
|
||||||
</entry>
|
|
||||||
</row>
|
|
||||||
</thead>
|
|
||||||
|
|
||||||
<tbody>
|
|
||||||
<row>
|
|
||||||
<entry valign="top">
|
|
||||||
<!-- 13 classes per cell -->
|
|
||||||
<bridgehead renderas="sect3">Classes (1 of 5)</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">additive1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">additive2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">arithmetic1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">arithmetic2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">bidirectional_iteratable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">
|
|
||||||
bidirectional_iterator_helper
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">bitwise1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">bitwise2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">decrementable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">dereferenceable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">equality_comparable1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">equality_comparable2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">equivalent1</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes (2 of 5)</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">equivalent2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">euclidean_ring_operators1
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">euclidean_ring_operators2
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">field_operators1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">field_operators2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">forward_iteratable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">forward_iterator_helper</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">incrementable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">indexable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">input_iteratable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">input_iterator_helper</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">integer_arithmetic1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">integer_arithmetic2</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes (3 of 5)</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">integer_multiplicative1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">integer_multiplicative2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">is_chained_base</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">less_than_comparable1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">less_than_comparable2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">multiplicative1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">multiplicative2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">operators</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">operators2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">operators<T,T></link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">
|
|
||||||
ordered_euclidean_ring_operators1
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">
|
|
||||||
ordered_euclidean_ring_operators2
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">
|
|
||||||
ordered_euclidian_ring_operators1
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes (4 of 5)</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">
|
|
||||||
ordered_euclidian_ring_operators2
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">ordered_field_operators1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">ordered_field_operators2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">ordered_ring_operators1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">ordered_ring_operators2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">output_iteratable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">output_iterator_helper</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">partially_ordered1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">partially_ordered2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">random_access_iteratable</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">
|
|
||||||
random_access_iterator_helper
|
|
||||||
</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">ring_operators1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">ring_operators2</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes (5 of 5)</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">shiftable1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">shiftable2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">totally_ordered1</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">totally_ordered2</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">unit_steppable</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
<bridgehead renderas="sect3">Type Traits</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="sec:arithmetic">is_chained_base</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
</row>
|
|
||||||
</tbody>
|
|
||||||
</tgroup>
|
|
||||||
|
|
||||||
<tgroup cols="5">
|
|
||||||
<colspec colname="a"/>
|
|
||||||
<colspec colname="b"/>
|
|
||||||
<colspec colname="c"/>
|
|
||||||
<colspec colname="d"/>
|
|
||||||
<colspec colname="e"/>
|
|
||||||
|
|
||||||
<thead>
|
|
||||||
<row>
|
|
||||||
<entry valign="center" namest="a" nameend="a">
|
|
||||||
<bridgehead renderas="sect2">Result of</bridgehead>
|
|
||||||
</entry>
|
|
||||||
<entry valign="center" namest="b" nameend="d">
|
|
||||||
<bridgehead renderas="sect2">String View</bridgehead>
|
|
||||||
</entry>
|
|
||||||
<entry valign="center" namest="e" nameend="e">
|
|
||||||
<bridgehead renderas="sect2">Value Init</bridgehead>
|
|
||||||
</entry>
|
|
||||||
</row>
|
|
||||||
</thead>
|
|
||||||
|
|
||||||
<tbody>
|
|
||||||
<row>
|
|
||||||
<!-- result_of -->
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Type Traits</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.result_of">result_of</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.tr1_result_of">tr1_result_of</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<!-- string_view -->
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Aliases</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">string_view</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">u16string_ref</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">u16string_view</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">u32string_ref</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">u32string_view</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">wstring_ref</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">wstring_view</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">string_ref</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">basic_string_ref</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.basic_string_view">basic_string_view</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
<bridgehead renderas="sect3">Functions</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.hash_range">hash_range</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.hash_value">hash_value</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Operators</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.string_view_hpp">operator==</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.string_view_hpp">operator!=</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.string_view_hpp">operator<</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.string_view_hpp">operator<=</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.string_view_hpp">operator></link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.string_view_hpp">operator>=</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.string_view_hpp">operator<<</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
|
|
||||||
<!-- value_init -->
|
|
||||||
<entry valign="top">
|
|
||||||
<bridgehead renderas="sect3">Classes</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.initialized">initialized</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.initialized_value_t">initialized_value_t</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.value_initialized">value_initialized</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
<bridgehead renderas="sect3">Functions</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.value_init_hpp">get</link>
|
|
||||||
</member>
|
|
||||||
<member>
|
|
||||||
<link linkend="header.boost.utility.value_init_hpp">swap</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
<bridgehead renderas="sect3">Constants</bridgehead>
|
|
||||||
<simplelist type="vert" columns="1">
|
|
||||||
<member>
|
|
||||||
<link linkend="boost.initialized_value">initialized_value</link>
|
|
||||||
</member>
|
|
||||||
</simplelist>
|
|
||||||
</entry>
|
|
||||||
</row>
|
|
||||||
</tbody>
|
|
||||||
</tgroup>
|
|
||||||
</informaltable>
|
|
||||||
@@ -1,421 +0,0 @@
|
|||||||
[/
|
|
||||||
/ Copyright (c) 2012 Marshall Clow
|
|
||||||
/ Copyright (c) 2021, Alan Freitas
|
|
||||||
/
|
|
||||||
/ 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)
|
|
||||||
/]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[section Result of]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Introduction]
|
|
||||||
|
|
||||||
The class template __result_of__ helps determine the type of a
|
|
||||||
call expression. For example, given an lvalue `f` of type `F`
|
|
||||||
and lvalues `t1`,`t2`, ..., `tN` of types `T1`, `T2`, ..., `TN`,
|
|
||||||
respectively, the type __result_of__`<F(T1, T2, ..., TN)>::type` defines
|
|
||||||
the result type of the expression `f(t1, t2, ...,tN)`.
|
|
||||||
|
|
||||||
This implementation permits the type `F` to be a function pointer,
|
|
||||||
function reference, member function pointer, or class type. By default,
|
|
||||||
N may be any value between 0 and 16. To change the upper limit, define
|
|
||||||
the macro `BOOST_RESULT_OF_NUM_ARGS` to the maximum value for N. Class
|
|
||||||
template __result_of__ resides in the header
|
|
||||||
[@../../../../boost/utility/result_of.hpp `<boost/utility/result_of.hpp>`].
|
|
||||||
|
|
||||||
If your compiler's support for __decltype__ is adequate, __result_of__
|
|
||||||
automatically uses it to deduce the type of the call expression, in
|
|
||||||
which case __result_of__`<F(T1, T2, ..., TN)>::type` names the type
|
|
||||||
__decltype__`(boost::declval<F>()(boost::declval<T1>(),
|
|
||||||
boost::declval<T2>(), ..., boost::declval<TN>()))`, as in the
|
|
||||||
following example.
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
template<class T>
|
|
||||||
T operator()(T x)
|
|
||||||
{
|
|
||||||
return x;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef __boost_result_of__<functor(int)>::type type; // type is int
|
|
||||||
```
|
|
||||||
|
|
||||||
You can test whether __result_of__ is using __decltype__ by checking if
|
|
||||||
the macro `BOOST_RESULT_OF_USE_DECLTYPE` is defined after
|
|
||||||
including `result_of.hpp`. You can also force __result_of__ to use
|
|
||||||
__decltype__ by defining `BOOST_RESULT_OF_USE_DECLTYPE` prior
|
|
||||||
to including `result_of.hpp`.
|
|
||||||
|
|
||||||
If __decltype__ is not used, then automatic result type deduction of function
|
|
||||||
objects is not possible. Instead, __result_of__ uses the following protocol
|
|
||||||
to allow the programmer to specify a type. When `F` is a class type with a
|
|
||||||
member type `result_type`, `result_of<F(T1, T2, ..., TN)>::type` is
|
|
||||||
`F::result_type`. When `F` does not contain `result_type`,
|
|
||||||
`result_of<F(T1, T2, ..., TN)>::type` is
|
|
||||||
`F::result<F(T1, T2, ..., TN)>::type` when
|
|
||||||
`N > 0` or `void` when `N = 0`.
|
|
||||||
|
|
||||||
Note that it is the responsibility of the programmer to ensure that
|
|
||||||
function objects accurately advertise their result
|
|
||||||
type via this protocol, as in the following example.
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
template <class> struct result;
|
|
||||||
|
|
||||||
template<class F, class T>
|
|
||||||
struct result<F(T)> {
|
|
||||||
typedef T type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
T operator()(T x)
|
|
||||||
{
|
|
||||||
return x;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef __boost_result_of__<functor(int)>::type type; // type is int
|
|
||||||
```
|
|
||||||
|
|
||||||
Since __decltype__ is a language feature standardized in C++11, if you are
|
|
||||||
writing a function object to be used with __result_of__, for maximum
|
|
||||||
portability, you might consider following the above protocol
|
|
||||||
even if your compiler has proper __decltype__ support.
|
|
||||||
|
|
||||||
If you wish to continue to use the protocol on compilers that
|
|
||||||
support __decltype__, there are two options:
|
|
||||||
|
|
||||||
* You can use __boost_tr1_result_of__, which is also defined in
|
|
||||||
[@../../../boost/utility/result_of.hpp `<boost/utility/result_of.hpp>`].
|
|
||||||
|
|
||||||
* Alternatively, you can define the macro `BOOST_RESULT_OF_USE_TR1`,
|
|
||||||
which causes __result_of__ to use the protocol described above instead
|
|
||||||
of __decltype__. If you choose to follow the protocol, take care to
|
|
||||||
ensure that the `result_type` and `result<>` members accurately
|
|
||||||
represent the return type of `operator()` given a call expression.
|
|
||||||
|
|
||||||
Additionally, __boost_result_of__ provides a third mode of operation,
|
|
||||||
which some users may find convenient. When
|
|
||||||
`BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK` is defined,
|
|
||||||
__boost_result_of__ behaves as follows. If the function object has a member
|
|
||||||
type `result_type` or member template `result<>`, then __boost_result_of__
|
|
||||||
will use the TR1 protocol.
|
|
||||||
|
|
||||||
Otherwise, __boost_result_of__ will use __decltype__. Using TR1 with
|
|
||||||
a __decltype__ fallback may workaround certain problems at the cost of portability.
|
|
||||||
For example:
|
|
||||||
|
|
||||||
* Deficient compiler: If your code requires __boost_result_of__ to work
|
|
||||||
with incomplete return types but your compiler's __decltype__ implementation
|
|
||||||
does not support incomplete return types, then you can use the TR1 protocol
|
|
||||||
as a workaround. Support for incomplete return types was added late in the
|
|
||||||
C++11 standardization process
|
|
||||||
(see [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3276.pdf N3276])
|
|
||||||
and is not implemented by some compilers.
|
|
||||||
|
|
||||||
* Deficient legacy code: If your existing TR1 function object advertises a different type than
|
|
||||||
the actual result type deduced by __decltype__, then using TR1 with a __decltype__ fallback
|
|
||||||
will allow you to work with both your existing TR1 function objects and new C++11
|
|
||||||
function object. This situation could occur if your legacy function objects
|
|
||||||
misused the TR1 protocol. See the documentation on known [link sec:result_of_tr1_diff differences]
|
|
||||||
between __boost_result_of__ and TR1.
|
|
||||||
|
|
||||||
* [#BOOST_NO_RESULT_OF] This implementation of __result_of__ requires class template
|
|
||||||
partial specialization, the ability to parse function types properly, and support
|
|
||||||
for SFINAE. If __result_of__ is not supported by your compiler, including the header
|
|
||||||
[@../../../boost/utility/result_of.hpp `<boost/utility/result_of.hpp>`] will define
|
|
||||||
the macro `BOOST_NO_RESULT_OF`.
|
|
||||||
|
|
||||||
For additional information about __result_of__, see the C++ Library
|
|
||||||
Technical Report, [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf N1836],
|
|
||||||
or, for motivation and design rationale, the __result_of__
|
|
||||||
[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1454.html proposal].
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:result_of_guidelines]
|
|
||||||
[section Usage guidelines for __boost_result_of__]
|
|
||||||
|
|
||||||
The following are general suggestions about when and how to use __boost_result_of__.
|
|
||||||
|
|
||||||
# If you are targeting C++11 and are not concerned about portability to
|
|
||||||
non-compliant compilers or previous versions of the standard, then use
|
|
||||||
`__std_result_of__`. If `__std_result_of__` meets your needs, then
|
|
||||||
there's no reason to stop using it.
|
|
||||||
|
|
||||||
# If you are targeting C++11 but may port your code to legacy compilers
|
|
||||||
at some time in the future, then use __boost_result_of__ with __decltype__.
|
|
||||||
When __decltype__ is used __boost_result_of__ and `__std_result_of__` are usually
|
|
||||||
interchangeable. See the documentation on known [link sec:result_of_cxx11_diff differences]
|
|
||||||
between __boost_result_of__ and C++11 __std_result_of__.
|
|
||||||
|
|
||||||
# If compiler portability is required, use __boost_result_of__ with the TR1 protocol
|
|
||||||
|
|
||||||
Regardless of how you configure __boost_result_of__, it is
|
|
||||||
important to bear in mind that the return type of a
|
|
||||||
function may change depending on its arguments, and
|
|
||||||
additionally, the return type of a member function may
|
|
||||||
change depending on the cv-qualification of the
|
|
||||||
object. __boost_result_of__ must be passed
|
|
||||||
the appropriately cv-qualified types in order to
|
|
||||||
deduce the corresponding return type.
|
|
||||||
|
|
||||||
For example:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
int& operator()(int);
|
|
||||||
int const& operator()(int) const;
|
|
||||||
|
|
||||||
float& operator()(float&);
|
|
||||||
float const& operator()(float const&);
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef __boost_result_of__<
|
|
||||||
functor(int)
|
|
||||||
>::type type1; // type1 is int &
|
|
||||||
|
|
||||||
typedef __boost_result_of__<
|
|
||||||
const functor(int)
|
|
||||||
>::type type2; // type2 is int const &
|
|
||||||
|
|
||||||
typedef __boost_result_of__<
|
|
||||||
functor(float&)
|
|
||||||
>::type type3; // type3 is float &
|
|
||||||
|
|
||||||
typedef __boost_result_of__<
|
|
||||||
functor(float const&)
|
|
||||||
>::type type4; // type4 is float const &
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:result_of_tr1_protocol_guidelines]
|
|
||||||
[section Usage guidelines for the TR1 result_of protocol]
|
|
||||||
|
|
||||||
On compliant C++11 compilers, __boost_result_of__ can
|
|
||||||
use __decltype__ to deduce the type of any
|
|
||||||
call expression, including calls to function
|
|
||||||
objects. However, on pre-C++11 compilers or on
|
|
||||||
compilers without adequate decltype support,
|
|
||||||
additional scaffolding is needed from function
|
|
||||||
objects as described above. The following are
|
|
||||||
suggestions about how to use the TR1 protocol.
|
|
||||||
|
|
||||||
* When the return type does not depend on the
|
|
||||||
argument types or the cv-qualification of the
|
|
||||||
function object, simply
|
|
||||||
define `result_type`. There is no need
|
|
||||||
to use the `result` template unless the
|
|
||||||
return type varies.</li>
|
|
||||||
|
|
||||||
* Use the protocol specified type when defining
|
|
||||||
function prototypes. This can help ensure the
|
|
||||||
actual return type does not get out of sync with
|
|
||||||
the protocol specification. For example:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
typedef int result_type;
|
|
||||||
result_type operator()(int);
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
* Always specify the `result` specialization near the corresponding
|
|
||||||
`operator()` overload. This can make it easier to keep the specializations
|
|
||||||
in sync with the overloads. For example:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
template<class> struct result;
|
|
||||||
|
|
||||||
template<class F>
|
|
||||||
struct result<F(int)> {
|
|
||||||
typedef int& type;
|
|
||||||
};
|
|
||||||
result<functor(int)>::type operator()(int);
|
|
||||||
|
|
||||||
template<class F>
|
|
||||||
struct result<const F(int)> {
|
|
||||||
typedef int const& type;
|
|
||||||
};
|
|
||||||
result<const functor(int)>::type operator()(int) const;
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
* Use type transformations to simplify
|
|
||||||
the `result` template specialization. For
|
|
||||||
example, the following uses [@../type_traits/doc/html/index.html Boost.TypeTraits]
|
|
||||||
to specialize the `result` template for
|
|
||||||
a single `operator()` that can be called on
|
|
||||||
both a const and non-const function object with
|
|
||||||
either an lvalue or rvalue argument.
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
template<class> struct result;
|
|
||||||
|
|
||||||
template<class F, class T>
|
|
||||||
struct result<F(T)>
|
|
||||||
: boost::remove_cv<
|
|
||||||
typename boost::remove_reference<T>::type
|
|
||||||
>
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
T operator()(T const& x) const;
|
|
||||||
};
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:result_of_tr1_diff]
|
|
||||||
[section Known differences between __boost_result_of__ and __boost_tr1_result_of__]
|
|
||||||
|
|
||||||
When using __decltype__, __boost_result_of__ ignores the TR1 protocol and instead deduces the
|
|
||||||
return type of function objects directly via __decltype__. In most situations, users
|
|
||||||
will not notice a difference, so long as they use the protocol correctly. The following are situations in
|
|
||||||
which the type deduced by __boost_result_of__ is known to differ depending on whether
|
|
||||||
__decltype__ or the TR1 protocol is used.
|
|
||||||
|
|
||||||
TR1 protocol misusage: When using the TR1 protocol, __boost_result_of__ cannot
|
|
||||||
detect whether the actual type of a call to a function object is the same as the
|
|
||||||
type specified by the protocol, which allows for the possibility of inadvertent
|
|
||||||
mismatches between the specified type and the actual type. When using __decltype__,
|
|
||||||
these subtle bugs may result in compilation errors. For example:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
typedef short result_type;
|
|
||||||
int operator()(short);
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
|
|
||||||
BOOST_STATIC_ASSERT((
|
|
||||||
boost::is_same<__boost_result_of__<functor(short)>::type, int>::value
|
|
||||||
));
|
|
||||||
|
|
||||||
#else
|
|
||||||
|
|
||||||
BOOST_STATIC_ASSERT((
|
|
||||||
boost::is_same<__boost_result_of__<functor(short)>::type, short>::value
|
|
||||||
));
|
|
||||||
|
|
||||||
#endif
|
|
||||||
```
|
|
||||||
|
|
||||||
Note that the user can force __boost_result_of__ to use the TR1
|
|
||||||
protocol even on platforms that support __decltype__ by
|
|
||||||
defining `BOOST_RESULT_OF_USE_TR1`.
|
|
||||||
|
|
||||||
Nullary function objects: When using the TR1 protocol, __boost_result_of__
|
|
||||||
cannot always deduce the type of calls to nullary function objects, in which case the
|
|
||||||
type defaults to void. When using __decltype__, __boost_result_of__ always gives the
|
|
||||||
actual type of the call expression. For example:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
template<class> struct result {
|
|
||||||
typedef int type;
|
|
||||||
};
|
|
||||||
int operator()();
|
|
||||||
};
|
|
||||||
|
|
||||||
#ifdef BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
|
|
||||||
BOOST_STATIC_ASSERT((
|
|
||||||
boost::is_same<__boost_result_of__<functor()>::type, int>::value
|
|
||||||
));
|
|
||||||
|
|
||||||
#else
|
|
||||||
|
|
||||||
BOOST_STATIC_ASSERT((
|
|
||||||
boost::is_same<__boost_result_of__<functor()>::type, void>::value
|
|
||||||
));
|
|
||||||
|
|
||||||
#endif
|
|
||||||
```
|
|
||||||
|
|
||||||
Note that there are some workarounds for the nullary function problem.
|
|
||||||
So long as the return type does not vary, `result_type` can always be used to
|
|
||||||
specify the return type regardless of arity. If the return type does vary,
|
|
||||||
then the user can specialize __boost_result_of__ itself for nullary calls.
|
|
||||||
|
|
||||||
Non-class prvalues and cv-qualification: When using the TR1 protocol, __boost_result_of__ will
|
|
||||||
report the cv-qualified type specified by `result_type` or the `result` template regardless of
|
|
||||||
the actual cv-qualification of the call expression. When using __decltype__, __boost_result_of__
|
|
||||||
will report the actual type of the call expression, which is not cv-qualified when the expression
|
|
||||||
is a non-class prvalue. For example:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct functor {
|
|
||||||
template<class> struct result;
|
|
||||||
template<class F, class T> struct result<F(const T)> {
|
|
||||||
typedef const T type;
|
|
||||||
};
|
|
||||||
|
|
||||||
const short operator()(const short);
|
|
||||||
int const & operator()(int const &);
|
|
||||||
};
|
|
||||||
|
|
||||||
// Non-prvalue call expressions work the same with or without decltype.
|
|
||||||
|
|
||||||
BOOST_STATIC_ASSERT((
|
|
||||||
boost::is_same<
|
|
||||||
__boost_result_of__<functor(int const &)>::type,
|
|
||||||
int const &
|
|
||||||
::value
|
|
||||||
));
|
|
||||||
|
|
||||||
// Non-class prvalue call expressions are not actually cv-qualified,
|
|
||||||
// but only the decltype-based result_of reports this accurately.
|
|
||||||
|
|
||||||
#ifdef BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
|
|
||||||
BOOST_STATIC_ASSERT((
|
|
||||||
boost::is_same<
|
|
||||||
__boost_result_of__<functor(const short)>::type,
|
|
||||||
short
|
|
||||||
::value
|
|
||||||
));
|
|
||||||
|
|
||||||
#else
|
|
||||||
|
|
||||||
BOOST_STATIC_ASSERT((
|
|
||||||
boost::is_same<
|
|
||||||
__boost_result_of__<functor(const short)>::type,
|
|
||||||
const short
|
|
||||||
::value
|
|
||||||
));
|
|
||||||
|
|
||||||
#endif
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:result_of_cxx11_diff]
|
|
||||||
[section Known differences between __boost_result_of__ and C++11 result_of]
|
|
||||||
|
|
||||||
When using __decltype__, __boost_result_of__ implements most of the C++11 __std_result_of__
|
|
||||||
specification. One known exception is that __boost_result_of__ does not implement the
|
|
||||||
requirements regarding pointers to member data.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[xinclude tmp/result_of_reference.xml]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Acknowledgments]
|
|
||||||
|
|
||||||
Created by Doug Gregor. Contributions from Daniel Walker, Eric Niebler, Michel Morin and others.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
@@ -1,209 +0,0 @@
|
|||||||
[/
|
|
||||||
/ Copyright (c) 2012 Marshall Clow
|
|
||||||
/ Copyright (c) 2021, Alan Freitas
|
|
||||||
/
|
|
||||||
/ 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)
|
|
||||||
/]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[section String View]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Introduction]
|
|
||||||
|
|
||||||
The class __boost_string_view__ and other classes derived from __basic_string_view__ represent references to strings or substrings. When you are parsing/processing strings from some external source, frequently you want to pass a piece of text to a procedure for specialized processing. Before __std_string_view__, the canonical way to do this used to be a __std_string__, but that has certain drawbacks:
|
|
||||||
|
|
||||||
1) If you are processing a buffer of text (say a HTTP response or the contents of a file), then you have to create the string from the text you want to pass, which involves memory allocation and copying of data.
|
|
||||||
|
|
||||||
2) If a routine receives a constant __std_string__ and wants to pass a portion of that string to another routine, then it must create a new string of that substring.
|
|
||||||
|
|
||||||
3) If a routine receives a constant __std_string__ and wants to return a portion of the string, then it must create a new string to return.
|
|
||||||
|
|
||||||
__boost_string_view__ is designed to solve these efficiency problems. A __boost_string_view__ is a read-only reference to a contiguous sequence of characters, and provides much of the functionality of __std_string__. A __boost_string_view__ is cheap to create, copy and pass by value, because it does not actually own the storage that it points to.
|
|
||||||
|
|
||||||
A __boost_string_view__ is implemented as a small struct that contains a pointer to the start of the character `data` and a `count`. A __boost_string_view__ is cheap to create and cheap to copy.
|
|
||||||
|
|
||||||
__boost_string_view__ acts as a container; it includes all the methods that you would expect in a container, including iteration support, `operator[]`, `at` and `size`. It can be used with any of the iterator-based algorithms in the STL - as long as you do not need to change the underlying data. For example, __std_sort__ and __std_remove__ will not work.
|
|
||||||
|
|
||||||
Besides generic container functionality, __boost_string_view__ provides a subset of the interface of __std_string__. This makes it easy to replace parameters of type `const __std_string__ &` with __boost_string_view__. Like __std_string__, __boost_string_view__ has a static member variable named `npos` to denote the result of failed searches, and to mean "the end".
|
|
||||||
|
|
||||||
[caution Because a __boost_string_view__ does not own the data that it refers to, it introduces lifetime issues into code that uses it. The programmer must ensure that the data that a __string_view__ refers to exists as long as the __string_view__ does.]
|
|
||||||
|
|
||||||
[note
|
|
||||||
|
|
||||||
Boost.Utility also includes the class __string_ref__:
|
|
||||||
|
|
||||||
- __string_ref__ is the initial implementation of Jeffrey Yaskin's [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3442.html N3442:
|
|
||||||
string_ref: a non-owning reference to a string].
|
|
||||||
|
|
||||||
- __string_view__ is an updated implementation to reflect the Library Fundamentals TS [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4480.html N4480: \[string.view\]].
|
|
||||||
|
|
||||||
Please prefer __string_view__ / __basic_string_view__ over __string_ref__ / __basic_string_ref__:
|
|
||||||
|
|
||||||
- The __basic_string_view__ class better matches __std_basic_string_view__.
|
|
||||||
|
|
||||||
- __basic_string_view__ has WAY more constexpr support.
|
|
||||||
|
|
||||||
- Code that uses __basic_string_ref__ should continue to work.
|
|
||||||
|
|
||||||
- Not much code depends on __basic_string_ref__ anymore.
|
|
||||||
|
|
||||||
|
|
||||||
]
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[section Examples]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
Integrating __string_view__ into your code is fairly simple. Wherever you pass a `const __std_string__ &` or __std_string__ as a parameter, that's a candidate for passing a __boost_string_view__.
|
|
||||||
|
|
||||||
```
|
|
||||||
__std_string__ extract_part ( const __std_string__ &bar ) {
|
|
||||||
return bar.substr ( 2, 3 );
|
|
||||||
}
|
|
||||||
|
|
||||||
if ( extract_part ( "ABCDEFG" ).front() == 'C' ) { /* do something */ }
|
|
||||||
```
|
|
||||||
|
|
||||||
Let's figure out what happens in this contrived example.
|
|
||||||
|
|
||||||
* First, a temporary string is created from the string literal `"ABCDEFG"`, and it is passed (by reference) to the routine `extract_part`.
|
|
||||||
* Then a second string is created in the call `__std_string__::substr` and returned to `extract_part` (this copy may be elided by RVO).
|
|
||||||
* Then `extract_part` returns that string back to the caller (again this copy may be elided).
|
|
||||||
* The first temporary string is deallocated, and `front` is called on the second string, and then it is deallocated as well.
|
|
||||||
|
|
||||||
Two __std_string__ s are created, and two copy operations. That is potentially four memory allocations and deallocations, and the associated copying of data.
|
|
||||||
|
|
||||||
Now let's look at the same code with __string_view__:
|
|
||||||
|
|
||||||
```
|
|
||||||
__boost_string_view__ extract_part ( __boost_string_view__ bar ) {
|
|
||||||
return bar.substr ( 2, 3 );
|
|
||||||
}
|
|
||||||
|
|
||||||
if ( extract_part ( "ABCDEFG" ).front() == "C" ) { /* do something */ }
|
|
||||||
```
|
|
||||||
|
|
||||||
No memory allocations. No copying of character data. No changes to the code other than the types. There are two __string_view__ s created, and two __string_view__ s copied, but those are cheap operations.
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/=================]
|
|
||||||
[section:reference Synopsis]
|
|
||||||
[/=================]
|
|
||||||
|
|
||||||
The header file [@../../../../boost/utility/string_view.hpp `<boost/utility/string_view.hpp>`] defines a template __boost_basic_string_view__, and four specializations __string_view__, __wstring_view__, __u16string_view__, __u32string_view__ - for `char` / `wchar_t` / `char16_t` / `char32_t`.
|
|
||||||
|
|
||||||
`#include <boost/utility/string_view.hpp>`
|
|
||||||
|
|
||||||
Construction and copying:
|
|
||||||
|
|
||||||
```
|
|
||||||
constexpr basic_string_view (); // Constructs an empty string_view
|
|
||||||
constexpr basic_string_view(const charT* str); // Constructs from a NULL-terminated string
|
|
||||||
constexpr basic_string_view(const charT* str, size_type len); // Constructs from a pointer, length pair
|
|
||||||
template<typename Allocator>
|
|
||||||
basic_string_view(const __std_basic_string__<charT, traits, Allocator>& str); // Constructs from a std::string
|
|
||||||
basic_string_view (const basic_string_view &rhs);
|
|
||||||
basic_string_view& operator=(const basic_string_view &rhs);
|
|
||||||
```
|
|
||||||
|
|
||||||
__string_view__ does not define a move constructor nor a move-assignment operator because copying a __string_view__ is just a cheap as moving one.
|
|
||||||
|
|
||||||
Basic container-like functions:
|
|
||||||
|
|
||||||
```
|
|
||||||
constexpr size_type size() const ;
|
|
||||||
constexpr size_type length() const ;
|
|
||||||
constexpr size_type max_size() const ;
|
|
||||||
constexpr bool empty() const ;
|
|
||||||
|
|
||||||
// All iterators are const_iterators
|
|
||||||
constexpr const_iterator begin() const ;
|
|
||||||
constexpr const_iterator cbegin() const ;
|
|
||||||
constexpr const_iterator end() const ;
|
|
||||||
constexpr const_iterator cend() const ;
|
|
||||||
const_reverse_iterator rbegin() const ;
|
|
||||||
const_reverse_iterator crbegin() const ;
|
|
||||||
const_reverse_iterator rend() const ;
|
|
||||||
const_reverse_iterator crend() const ;
|
|
||||||
```
|
|
||||||
|
|
||||||
Access to the individual elements (all of which are const):
|
|
||||||
|
|
||||||
```
|
|
||||||
constexpr const charT& operator[](size_type pos) const ;
|
|
||||||
const charT& at(size_t pos) const ;
|
|
||||||
constexpr const charT& front() const ;
|
|
||||||
constexpr const charT& back() const ;
|
|
||||||
constexpr const charT* data() const ;
|
|
||||||
```
|
|
||||||
|
|
||||||
Modifying the __string_view__ (but not the underlying data):
|
|
||||||
|
|
||||||
```
|
|
||||||
void clear();
|
|
||||||
void remove_prefix(size_type n);
|
|
||||||
void remove_suffix(size_type n);
|
|
||||||
```
|
|
||||||
|
|
||||||
Searching:
|
|
||||||
|
|
||||||
```
|
|
||||||
size_type find(basic_string_view s) const ;
|
|
||||||
size_type find(charT c) const ;
|
|
||||||
size_type rfind(basic_string_view s) const ;
|
|
||||||
size_type rfind(charT c) const ;
|
|
||||||
size_type find_first_of(charT c) const ;
|
|
||||||
size_type find_last_of (charT c) const ;
|
|
||||||
|
|
||||||
size_type find_first_of(basic_string_view s) const ;
|
|
||||||
size_type find_last_of(basic_string_view s) const ;
|
|
||||||
size_type find_first_not_of(basic_string_view s) const ;
|
|
||||||
size_type find_first_not_of(charT c) const ;
|
|
||||||
size_type find_last_not_of(basic_string_view s) const ;
|
|
||||||
size_type find_last_not_of(charT c) const ;
|
|
||||||
```
|
|
||||||
|
|
||||||
String-like operations:
|
|
||||||
|
|
||||||
```
|
|
||||||
constexpr basic_string_view substr(size_type pos, size_type n=npos) const ; // Creates a new string_view
|
|
||||||
bool starts_with(charT c) const ;
|
|
||||||
bool starts_with(basic_string_view x) const ;
|
|
||||||
bool ends_with(charT c) const ;
|
|
||||||
bool ends_with(basic_string_view x) const ;
|
|
||||||
```
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[section History]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[h5 boost 1.71]
|
|
||||||
* Glen Fernandes updated the implementation of the stream insertion operator to
|
|
||||||
write directly to the `basic_streambuf` and refactored that functionality into
|
|
||||||
a common utility.
|
|
||||||
|
|
||||||
[h5 boost 1.53]
|
|
||||||
* Introduced
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[xinclude tmp/string_view_reference.xml]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[section Acknowledgments]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
Author: Clow, Marshall
|
|
||||||
|
|
||||||
Copyright 2012 Marshall Clow
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
2
doc/tmp/.gitignore
vendored
2
doc/tmp/.gitignore
vendored
@@ -1,2 +0,0 @@
|
|||||||
*.qbk
|
|
||||||
*.xml
|
|
||||||
@@ -1,32 +0,0 @@
|
|||||||
[/
|
|
||||||
Copyright (c) 2021 Alan de Freitas (alandefreitas@gmail.com)
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
Official repository: https://github.com/boostorg/utility
|
|
||||||
]
|
|
||||||
|
|
||||||
[section:utilities Utilities]
|
|
||||||
|
|
||||||
The entire contents of Boost.Utility are in `namespace boost`.
|
|
||||||
|
|
||||||
[warning
|
|
||||||
|
|
||||||
Direct use of the header [@../../../../boost/utility.hpp `<boost/utility.hpp>`] is discouraged and it will be deprecated.
|
|
||||||
|
|
||||||
Please include the headers relative to individual components instead.
|
|
||||||
|
|
||||||
]
|
|
||||||
|
|
||||||
[include base_from_member.qbk]
|
|
||||||
[include BOOST_BINARY.qbk]
|
|
||||||
[include call_traits.qbk]
|
|
||||||
[include compressed_pair.qbk]
|
|
||||||
[include in_place_factory.qbk]
|
|
||||||
[include operators.qbk]
|
|
||||||
[include result_of.qbk]
|
|
||||||
[include string_view.qbk]
|
|
||||||
[include value_init.qbk]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
@@ -1,584 +0,0 @@
|
|||||||
[/
|
|
||||||
/ Copyright (c) 2012 Marshall Clow
|
|
||||||
/ Copyright (c) 2021, Alan Freitas
|
|
||||||
/
|
|
||||||
/ 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)
|
|
||||||
/]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[#sec:value_init]
|
|
||||||
[section Value Init]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[section Introduction]
|
|
||||||
|
|
||||||
Constructing and initializing objects in a generic way is difficult in
|
|
||||||
C++. The problem is that there are several different rules that apply
|
|
||||||
for initialization. Depending on the type, the value of a newly constructed
|
|
||||||
object can be zero-initialized (logically 0), default-constructed (using
|
|
||||||
the default constructor), or indeterminate. When writing generic code,
|
|
||||||
this problem must be addressed. The template __value_initialized__ provides
|
|
||||||
a solution with consistent syntax for value initialization of scalar,
|
|
||||||
union and class types. Moreover, __value_initialized__ offers a workaround to various
|
|
||||||
compiler issues regarding value-initialization.
|
|
||||||
|
|
||||||
Furthermore, a `const` object __initialized_value__ is provided,
|
|
||||||
to avoid repeating the type name when retrieving the value from a
|
|
||||||
`__value_initialized__<T>` object.
|
|
||||||
|
|
||||||
There are various ways to initialize a variable, in C++. The following
|
|
||||||
declarations all ['may] have a local variable initialized to its default
|
|
||||||
value:
|
|
||||||
|
|
||||||
```
|
|
||||||
T1 var1;
|
|
||||||
T2 var2 = 0;
|
|
||||||
T3 var3 = {};
|
|
||||||
T4 var4 = T4();
|
|
||||||
```
|
|
||||||
|
|
||||||
Unfortunately, whether or not any of those declarations correctly
|
|
||||||
initialize the variable very much depends on its type. The first
|
|
||||||
declaration is valid for any __DefaultConstructible__ type by definition.
|
|
||||||
|
|
||||||
However, it does not always do an initialization. It correctly initializes
|
|
||||||
the variable when it's an instance of a class, and the author of the class
|
|
||||||
has provided a proper default constructor. On the other hand, the value of
|
|
||||||
`var1` is ['indeterminate] when its type is an arithmetic type, like `int`,
|
|
||||||
`float`, or `char`.
|
|
||||||
|
|
||||||
An arithmetic variable is of course initialized properly by the second declaration,
|
|
||||||
`T2 var2 = 0`. But this initialization form will not usually work for a
|
|
||||||
class type, unless the class was especially written to support being
|
|
||||||
initialized that way.
|
|
||||||
|
|
||||||
The third form, `T3 var3 = {}`, initializes an aggregate, typically a "C-style"
|
|
||||||
`struct` or a "C-style" array. However, at the time this library was developed,
|
|
||||||
the syntax did not allow for a class that has an explicitly declared constructor.
|
|
||||||
|
|
||||||
The fourth form is the most generic form of them, as it can be used to initialize
|
|
||||||
arithmetic types, class types, aggregates, pointers, and other types.
|
|
||||||
The declaration, `T4 var4 = T4()`, should be read as follows: First a temporary
|
|
||||||
object is created, by `T4()`. This object is [link sec:valueinit value-initialized].
|
|
||||||
Next the temporary object is copied to the named variable, `var4`. Afterwards,
|
|
||||||
the temporary is destroyed. While the copying and the destruction are likely to
|
|
||||||
be optimized away, C++ still requires the type `T4` to be __CopyConstructible__.
|
|
||||||
So `T4` needs to be ['both] __DefaultConstructible__ ['and] __CopyConstructible__.
|
|
||||||
|
|
||||||
A class may not be CopyConstructible, for example because it may have a
|
|
||||||
private and undefined copy constructor, or because it may be derived from
|
|
||||||
`boost::noncopyable`. Scott Meyers \[[link sec:references 2]\] explains why a
|
|
||||||
class would be defined like that.
|
|
||||||
|
|
||||||
There is another, less obvious disadvantage to the fourth form, `T4 var4 = T4()`:
|
|
||||||
It suffers from various [link sec:compiler_issues compiler issues], causing
|
|
||||||
a variable to be left uninitialized in some compiler specific cases.
|
|
||||||
|
|
||||||
The template __value_initialized__ offers a generic way to initialize
|
|
||||||
an object, like `T4 var4 = T4()`, but without requiring its type
|
|
||||||
to be __CopyConstructible__. And it offers a workaround to those compiler issues
|
|
||||||
regarding value-initialization as well. It allows getting an initialized
|
|
||||||
variable of any type; it ['only] requires the type to be __DefaultConstructible__.
|
|
||||||
A properly ['value-initialized] object of type `T` is constructed by the following
|
|
||||||
declaration:
|
|
||||||
|
|
||||||
```
|
|
||||||
value_initialized<T> var;
|
|
||||||
```
|
|
||||||
|
|
||||||
The template __initialized__ offers both value-initialization and direct-initialization.
|
|
||||||
It is especially useful as a data member type, allowing the very same object
|
|
||||||
to be either direct-initialized or value-initialized.
|
|
||||||
|
|
||||||
The `const` object __initialized_value__ allows value-initializing a variable as follows:
|
|
||||||
|
|
||||||
```
|
|
||||||
T var = initialized_value;
|
|
||||||
```
|
|
||||||
|
|
||||||
This form of initialization is semantically equivalent to `T4 var4 = T4()`,
|
|
||||||
but robust against the aforementioned compiler issues.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:details]
|
|
||||||
[section Details]
|
|
||||||
|
|
||||||
The C++ standard \[[link sec:references 3]\] contains the definitions
|
|
||||||
of `zero-initialization` and `default-initialization`. Informally, zero-initialization
|
|
||||||
means that the object is given the initial value `0` converted to the type and
|
|
||||||
default-initialization means that [@https://en.cppreference.com/w/cpp/named_req/PODType POD] \[[link sec:references 4]\] types are zero-initialized,
|
|
||||||
while non-POD class types are initialized with their corresponding default constructors.
|
|
||||||
|
|
||||||
A ['declaration] can contain an ['initializer], which specifies the
|
|
||||||
object's initial value. The initializer can be just '()', which states that
|
|
||||||
the object shall be value-initialized (but see below). However, if a ['declaration]
|
|
||||||
has no ['initializer] and it is of a non-`const`, non-`static` POD type, the
|
|
||||||
initial value is indeterminate: (see [sect]8.5, \[dcl.init\], for the
|
|
||||||
accurate definitions).
|
|
||||||
|
|
||||||
```
|
|
||||||
int x; // no initializer. x value is indeterminate.
|
|
||||||
__std_string__ s; // no initializer, s is default-constructed.
|
|
||||||
|
|
||||||
int y = int();
|
|
||||||
// y is initialized using copy-initialization
|
|
||||||
// but the temporary uses an empty set of parentheses as the initializer,
|
|
||||||
// so it is default-constructed.
|
|
||||||
// A default constructed POD type is zero-initialized,
|
|
||||||
// therefore, y == 0.
|
|
||||||
|
|
||||||
void foo ( __std_string__ ) ;
|
|
||||||
foo ( __std_string__() ) ;
|
|
||||||
// the temporary string is default constructed
|
|
||||||
// as indicated by the initializer ()
|
|
||||||
```
|
|
||||||
|
|
||||||
[#sec:valueinit]
|
|
||||||
[h5 value-initialization]
|
|
||||||
|
|
||||||
The first [@http://www.open-std.org/JTC1/SC22/WG21/docs/cwg_defects.html Technical
|
|
||||||
Corrigendum for the C++ Standard] (TC1), whose draft was released to the public in
|
|
||||||
November 2001, introduced [@http://www.open-std.org/JTC1/SC22/WG21/docs/cwg_defects.html#178 Core
|
|
||||||
Issue 178], among many other issues.
|
|
||||||
|
|
||||||
That issue introduced the new concept of `value-initialization`, and also fixed the
|
|
||||||
wording for zero-initialization. Informally, value-initialization is similar to
|
|
||||||
default-initialization with the exception that in some cases non-static data members
|
|
||||||
and base class sub-objects are also value-initialized.
|
|
||||||
|
|
||||||
The difference is that an object that is value-initialized will not have, or at least
|
|
||||||
is less likely to have, indeterminate values for data members and base class sub-objects;
|
|
||||||
unlike the case of an object default constructed (see Core Issue 178 for a
|
|
||||||
normative description).
|
|
||||||
|
|
||||||
In order to specify value-initialization of an object we need to use the
|
|
||||||
empty-set initializer: `()`.
|
|
||||||
|
|
||||||
As before, a declaration with no initializer specifies default-initialization,
|
|
||||||
and a declaration with a non-empty initializer specifies copy (`=xxx`) or
|
|
||||||
direct (`xxx`) initialization.
|
|
||||||
|
|
||||||
```
|
|
||||||
template<class T> void eat(T);
|
|
||||||
|
|
||||||
int x ; // indeterminate initial value.
|
|
||||||
|
|
||||||
__std_string__ s; // default-initialized.
|
|
||||||
|
|
||||||
eat ( int() ) ; // value-initialized
|
|
||||||
|
|
||||||
eat ( __std_string__() ) ; // value-initialized
|
|
||||||
```
|
|
||||||
|
|
||||||
[#sec:valueinitsyn]
|
|
||||||
[h5 value-initialization syntax]
|
|
||||||
|
|
||||||
Value initialization is specified using `()`. However, the empty set of
|
|
||||||
parentheses is not permitted by the syntax of initializers because it is
|
|
||||||
parsed as the declaration of a function taking no arguments:
|
|
||||||
|
|
||||||
```
|
|
||||||
int x() ; // declares function int(*)()
|
|
||||||
```
|
|
||||||
|
|
||||||
Thus, the empty `()` must be put in some other initialization context.
|
|
||||||
|
|
||||||
One alternative is to use copy-initialization syntax:
|
|
||||||
|
|
||||||
```
|
|
||||||
int x = int();
|
|
||||||
```
|
|
||||||
|
|
||||||
This works perfectly fine for POD types. But for non-POD class types,
|
|
||||||
copy-initialization searches for a suitable constructor, which could be,
|
|
||||||
for instance, the copy-constructor. It also searches for a suitable conversion
|
|
||||||
sequence but this does not apply in this context.
|
|
||||||
|
|
||||||
For an arbitrary unknown type, using this syntax may not have the
|
|
||||||
value-initialization effect intended because we don't know if a copy
|
|
||||||
from a default constructed object is exactly the same as a default
|
|
||||||
constructed object, and the compiler is allowed, in
|
|
||||||
some cases, but never required to, optimize the copy away.
|
|
||||||
|
|
||||||
One possible generic solution is to use value-initialization of a non static
|
|
||||||
data member:
|
|
||||||
|
|
||||||
```
|
|
||||||
template<class T>
|
|
||||||
struct W
|
|
||||||
{
|
|
||||||
// value-initialization of 'data' here.
|
|
||||||
W() : data() {}
|
|
||||||
|
|
||||||
T data;
|
|
||||||
};
|
|
||||||
|
|
||||||
W<int> w;
|
|
||||||
// w.data is value-initialized for any type.
|
|
||||||
```
|
|
||||||
|
|
||||||
This is the solution as it was supplied by earlier versions of the
|
|
||||||
`__value_initialized__<T>` template class. Unfortunately this approach
|
|
||||||
suffered from various compiler issues.
|
|
||||||
|
|
||||||
[#sec:compiler_issues]
|
|
||||||
[h5 Compiler issues]
|
|
||||||
|
|
||||||
Various compilers have not yet fully implemented value-initialization.
|
|
||||||
So when an object should be ['value-initialized] according to the C++ Standard,
|
|
||||||
it ['may] in practice still be left uninitialized, because of those
|
|
||||||
compiler issues. It is hard to make a general statement on what those issues
|
|
||||||
are like, because they depend on the compiler you are using, its version number,
|
|
||||||
and the type of object you would like to have value-initialized.
|
|
||||||
|
|
||||||
All compilers we have tested so far support value-initialization for arithmetic types properly.
|
|
||||||
However, various compilers may leave some types of ['aggregates] uninitialized, when they
|
|
||||||
should be value-initialized. Value-initialization of objects of a pointer-to-member type may also
|
|
||||||
go wrong on various compilers.
|
|
||||||
|
|
||||||
At the moment of writing, May 2010, the following reported issues regarding
|
|
||||||
value-initialization are still there in current compiler releases:
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
* [@https://connect.microsoft.com/VisualStudio/feedback/details/100744 Microsoft Visual Studio Feedback ID 100744, Value-initialization in new-expression]: Reported by Pavel Kuznetsov (MetaCommunications Engineering), 2005.
|
|
||||||
* [@http://connect.microsoft.com/VisualStudio/feedback/details/484295 Microsoft Visual Studio Feedback ID 484295, VC++ does not value-initialize members of derived classes without user-declared constructor] Reported by Sylvester Hesp, 2009.
|
|
||||||
* [@https://connect.microsoft.com/VisualStudio/feedback/details/499606 Microsoft Visual Studio Feedback ID 499606, Presence of copy constructor breaks member class initialization] Reported by Alex Vakulenko, 2009
|
|
||||||
* [@http://qc.embarcadero.com/wc/qcmain.aspx?d=83751 Embarcadero/C++Builder Report 83751, Value-initialization: arrays should have each element value-initialized] Reported by Niels Dekker (LKEB), 2010.
|
|
||||||
* [@http://qc.embarcadero.com/wc/qcmain.aspx?d=83851 Embarcadero/C++Builder Report 83851, Value-initialized temporary triggers internal backend error C1798] Reported by Niels Dekker, 2010.
|
|
||||||
* [@http://qc.embarcadero.com/wc/qcmain.aspx?d=84279 Embarcadero/C++Builder Report 84279, Internal compiler error (F1004), value-initializing member function pointer by "new T()"] Reported by Niels Dekker, 2010
|
|
||||||
* Sun CR 6947016, Sun 5.10 may fail to value-initialize an object of a non-POD aggregate. Reported to Steve Clamage by Niels Dekker, 2010.
|
|
||||||
* IBM's XL V10.1 and V11.1 may fail to value-initialize a temporary of a non-POD aggregate. Reported to Michael Wong by Niels Dekker, 2010.
|
|
||||||
* Intel support issue 589832, Attempt to value-initialize pointer-to-member triggers internal error on Intel 11.1. Reported by John Maddock, 2010.
|
|
||||||
|
|
||||||
Note that all known GCC issues regarding value-initialization are fixed with GCC version 4.4, including
|
|
||||||
[@http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30111 GCC Bug 30111]. Clang also has completely implemented
|
|
||||||
value-initialization, as far as we know, now that [@http://llvm.org/bugs/show_bug.cgi?id=7139 Clang Bug 7139]
|
|
||||||
is fixed.
|
|
||||||
|
|
||||||
New versions of __value_initialized__ (Boost release version 1.35 or higher) offer a workaround to these
|
|
||||||
issues: __value_initialized__ may now clear its internal data, prior to constructing the object that it
|
|
||||||
contains. It will do so for those compilers that need to have such a workaround, based on the
|
|
||||||
[@boost:/libs/config/doc/html/boost_config/boost_macro_reference.html#boost_config.boost_macro_reference.macros_that_describe_defects
|
|
||||||
compiler defect macro] `BOOST_NO_COMPLETE_VALUE_INITIALIZATION`.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:types]
|
|
||||||
[section Types and objects]
|
|
||||||
|
|
||||||
[#sec:val_init]
|
|
||||||
[section `template class value_initialized<T>`]
|
|
||||||
|
|
||||||
```
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
class __value_initialized__
|
|
||||||
{
|
|
||||||
|
|
||||||
public :
|
|
||||||
|
|
||||||
__value_initialized__() : x() {}
|
|
||||||
|
|
||||||
operator T const &() const { return x ; }
|
|
||||||
|
|
||||||
operator T&() { return x ; }
|
|
||||||
|
|
||||||
T const &data() const { return x ; }
|
|
||||||
|
|
||||||
T& data() { return x ; }
|
|
||||||
|
|
||||||
void swap( __value_initialized__& );
|
|
||||||
|
|
||||||
private :
|
|
||||||
|
|
||||||
[unspecified] x ;
|
|
||||||
|
|
||||||
} ;
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
|
|
||||||
T const& get ( __value_initialized__<T> const& x )
|
|
||||||
{
|
|
||||||
return x.data();
|
|
||||||
}
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
T& get ( __value_initialized__<T>& x )
|
|
||||||
{
|
|
||||||
return x.data();
|
|
||||||
}
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
void swap ( __value_initialized__<T>& lhs, __value_initialized__<T>& rhs )
|
|
||||||
{
|
|
||||||
lhs.swap(rhs);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace boost
|
|
||||||
```
|
|
||||||
|
|
||||||
An object of this template class is a `T`-wrapper convertible to `'T&'` whose
|
|
||||||
wrapped object (data member of type `T`) is [link sec:valueinit value-initialized] upon default-initialization
|
|
||||||
of this wrapper class:
|
|
||||||
|
|
||||||
```
|
|
||||||
int zero = 0;
|
|
||||||
__value_initialized__<int> x;
|
|
||||||
assert( x == zero ) ;
|
|
||||||
|
|
||||||
__std_string__ def;
|
|
||||||
__value_initialized__< __std_string__ > y;
|
|
||||||
assert( y == def ) ;
|
|
||||||
```
|
|
||||||
|
|
||||||
The purpose of this wrapper is to provide a consistent syntax for value initialization
|
|
||||||
of scalar, union and class types (POD and non-POD) since the correct syntax for value
|
|
||||||
initialization varies (see [link sec:valueinitsyn value-initialization syntax]).
|
|
||||||
|
|
||||||
The wrapped object can be accessed either through the conversion operator
|
|
||||||
`T&`, the member function `data()`, or the non-member function `get()`:
|
|
||||||
|
|
||||||
```
|
|
||||||
void watch(int);
|
|
||||||
|
|
||||||
__value_initialized__<int> x;
|
|
||||||
|
|
||||||
watch(x) ; // operator T& used.
|
|
||||||
watch(x.data());
|
|
||||||
watch( get(x) ) // function get() used
|
|
||||||
```
|
|
||||||
|
|
||||||
Both `const` and non-`const` objects can be wrapped. Mutable objects can be
|
|
||||||
modified directly from within the wrapper but constant objects cannot:
|
|
||||||
|
|
||||||
When `T` is a __Swappable__ type, `__value_initialized__<T>`
|
|
||||||
is swappable as well, by calling its `swap` member function
|
|
||||||
as well as by calling `boost::swap`.
|
|
||||||
|
|
||||||
```
|
|
||||||
__value_initialized__<int> x;
|
|
||||||
static_cast<int&>(x) = 1 ; // OK
|
|
||||||
get(x) = 1 ; // OK
|
|
||||||
|
|
||||||
__value_initialized__<int const> y ;
|
|
||||||
static_cast<int&>(y) = 1 ; // ERROR: cannot cast to int&
|
|
||||||
static_cast<int const&>(y) = 1 ; // ERROR: cannot modify a const value
|
|
||||||
get(y) = 1 ; // ERROR: cannot modify a const value
|
|
||||||
```
|
|
||||||
|
|
||||||
[warning
|
|
||||||
|
|
||||||
The __value_initialized__ implementation of Boost version 1.40.0 and older
|
|
||||||
allowed ['non-const] access to the wrapped object, from a constant wrapper,
|
|
||||||
both by its conversion operator and its `data()` member function.
|
|
||||||
|
|
||||||
For example:
|
|
||||||
|
|
||||||
```
|
|
||||||
__value_initialized__<int> const x_c;
|
|
||||||
int& xr = x_c ; // OK, conversion to int& available even though x_c is itself const.
|
|
||||||
xr = 2 ;
|
|
||||||
```
|
|
||||||
|
|
||||||
The reason for this obscure behavior was that some compilers did not accept the following valid code:
|
|
||||||
|
|
||||||
```
|
|
||||||
struct X
|
|
||||||
{
|
|
||||||
operator int&() ;
|
|
||||||
operator int const&() const ;
|
|
||||||
};
|
|
||||||
X x ;
|
|
||||||
(x == 1) ; // ERROR HERE!
|
|
||||||
```
|
|
||||||
|
|
||||||
The current version of __value_initialized__ no longer has this obscure behavior.
|
|
||||||
As compilers nowadays widely support overloading the conversion operator by having a `const`
|
|
||||||
and a `non-const` version, we have decided to fix the issue accordingly. So the current version
|
|
||||||
supports the idea of logical constness.
|
|
||||||
|
|
||||||
]
|
|
||||||
|
|
||||||
[h5 Recommended practice: The non-member get() idiom]
|
|
||||||
|
|
||||||
The obscure behavior of being able to modify a non-`const`
|
|
||||||
wrapped object from within a constant wrapper (as was supported by previous
|
|
||||||
versions of __value_initialized__) can be avoided if access to the wrapped object
|
|
||||||
is always performed with the `get()` idiom:
|
|
||||||
|
|
||||||
```
|
|
||||||
value_initialized<int> x;
|
|
||||||
get(x) = 1; // OK
|
|
||||||
value_initialized<int const> cx;
|
|
||||||
get(x) = 1; // ERROR: Cannot modify a const object
|
|
||||||
|
|
||||||
value_initialized<int> const x_c;
|
|
||||||
get(x_c) = 1; // ERROR: Cannot modify a const object
|
|
||||||
|
|
||||||
value_initialized<int const> const cx_c;
|
|
||||||
get(cx_c) = 1; // ERROR: Cannot modify a const object
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:initialized]
|
|
||||||
[section `template class initialized<T>`]
|
|
||||||
|
|
||||||
|
|
||||||
```
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
class __initialized__
|
|
||||||
{
|
|
||||||
|
|
||||||
public :
|
|
||||||
|
|
||||||
__initialized__() : x() {}
|
|
||||||
|
|
||||||
explicit __initialized__(T const & arg) : x(arg) {}
|
|
||||||
|
|
||||||
operator T const &() const;
|
|
||||||
|
|
||||||
operator T&();
|
|
||||||
|
|
||||||
T const &data() const;
|
|
||||||
|
|
||||||
T& data();
|
|
||||||
|
|
||||||
void swap( __initialized__& );
|
|
||||||
|
|
||||||
private :
|
|
||||||
|
|
||||||
[unspecified] x ;
|
|
||||||
|
|
||||||
};
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
T const& get ( __initialized__<T> const& x );
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
T& get ( __initialized__<T>& x );
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
void swap ( __initialized__<T>& lhs, __initialized__<T>& rhs );
|
|
||||||
|
|
||||||
} // namespace boost
|
|
||||||
```
|
|
||||||
|
|
||||||
The template class `boost::__initialized__<T>` supports both value-initialization
|
|
||||||
and direct-initialization, so its interface is a superset of the interface
|
|
||||||
of `__value_initialized__<T>`: Its default-constructor value-initializes the
|
|
||||||
wrapped object just like the default-constructor of `__value_initialized__<T>`,
|
|
||||||
but `boost::__initialized__<T>` also offers an extra `explicit`
|
|
||||||
constructor, which direct-initializes the wrapped object by the specified value.
|
|
||||||
|
|
||||||
`__initialized__<T>` is especially useful when the wrapped
|
|
||||||
object must be either value-initialized or direct-initialized, depending on
|
|
||||||
runtime conditions. For example, `__initialized__<T>` could
|
|
||||||
hold the value of a data member that may be value-initialized by some
|
|
||||||
constructors, and direct-initialized by others.
|
|
||||||
|
|
||||||
On the other hand, if it is known beforehand that the
|
|
||||||
object must ['always] be value-initialized, `__value_initialized__<T>`
|
|
||||||
may be preferable. And if the object must always be
|
|
||||||
direct-initialized, none of the two wrappers really needs to be used.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:initialized_value]
|
|
||||||
[section `initialized_value`]
|
|
||||||
|
|
||||||
```
|
|
||||||
namespace boost {
|
|
||||||
class __initialized_value_t__
|
|
||||||
{
|
|
||||||
public :
|
|
||||||
template <class T> operator T() const ;
|
|
||||||
};
|
|
||||||
|
|
||||||
__initialized_value_t__ const initialized_value = {} ;
|
|
||||||
|
|
||||||
} // namespace boost
|
|
||||||
```
|
|
||||||
|
|
||||||
__initialized_value__ provides a convenient way to get
|
|
||||||
an initialized value: its conversion operator provides an appropriate
|
|
||||||
['value-initialized] object for any __CopyConstructible__ type.
|
|
||||||
|
|
||||||
Suppose you need to have an initialized variable of type `T`.
|
|
||||||
You could do it as follows:
|
|
||||||
|
|
||||||
```
|
|
||||||
T var = T();
|
|
||||||
```
|
|
||||||
|
|
||||||
But as mentioned before, this form suffers from various compiler issues.
|
|
||||||
The template __value_initialized__ offers a workaround:
|
|
||||||
|
|
||||||
```
|
|
||||||
T var = get( __value_initialized__<T>() );
|
|
||||||
```
|
|
||||||
|
|
||||||
Unfortunately both forms repeat the type name, which
|
|
||||||
is rather short now (`T`), but could of course be
|
|
||||||
more like `Namespace::Template<Arg>::Type`.
|
|
||||||
|
|
||||||
Instead, one could use __initialized_value__ as follows:
|
|
||||||
|
|
||||||
```
|
|
||||||
T var = __initialized_value__;
|
|
||||||
```
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[#sec:references]
|
|
||||||
[section References]
|
|
||||||
|
|
||||||
# Bjarne Stroustrup, Gabriel Dos Reis, and J. Stephen Adamczyk wrote various papers,
|
|
||||||
proposing to extend the support for brace-enclosed ['initializer lists]
|
|
||||||
in C++. This [@https://en.cppreference.com/w/cpp/language/list_initialization feature] has
|
|
||||||
now been available since C++11. This would allow a variable `var` of any __DefaultConstructible__ type
|
|
||||||
`T` to be ['value-initialized] by doing `T var = {}`. The papers are listed at Bjarne's web page,
|
|
||||||
[@http://www.research.att.com/~bs/WG21.html My C++ Standards committee papers].
|
|
||||||
|
|
||||||
# Scott Meyers, Effective C++, Third Edition, item 6, ['Explicitly disallow the use of
|
|
||||||
compiler-generated functions you do not want], [@http://www.aristeia.com/books.html Scott Meyers: Books and CDs]
|
|
||||||
|
|
||||||
# The C++ Standard, Second edition (2003), ISO/IEC 14882:2003
|
|
||||||
|
|
||||||
# POD stands for [@https://en.cppreference.com/w/cpp/named_req/PODType "Plain Old Data"]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[/===============]
|
|
||||||
[xinclude tmp/value_init_reference.xml]
|
|
||||||
[/===============]
|
|
||||||
|
|
||||||
[#sec:acknowledgements]
|
|
||||||
[section Acknowledgements]
|
|
||||||
|
|
||||||
__value_initialized__ was developed by Fernando Cacciola, with help and suggestions
|
|
||||||
from David Abrahams and Darin Adler.
|
|
||||||
|
|
||||||
Special thanks to Bjorn Karlsson who carefully edited and completed this documentation.
|
|
||||||
|
|
||||||
__value_initialized__ was reimplemented by Fernando Cacciola and Niels Dekker
|
|
||||||
for Boost release version 1.35 (2008), offering a workaround to various compiler issues.
|
|
||||||
|
|
||||||
`boost::__initialized__` was very much inspired by feedback from Edward Diener and Jeffrey Hellrung.
|
|
||||||
|
|
||||||
__initialized_value__ was written by Niels Dekker, and added to Boost release version 1.36 (2008).
|
|
||||||
|
|
||||||
Developed by [@mailto:fernando_cacciola@hotmail.com Fernando Cacciola]. The latest version of
|
|
||||||
this file can be found at [@http://www.boost.org www.boost.org].
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
408
enable_if.html
408
enable_if.html
@@ -1,19 +1,389 @@
|
|||||||
<html>
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"
|
||||||
<head>
|
"http://www.w3.org/TR/REC-html40/loose.dtd">
|
||||||
<title>Boost.Utility</title>
|
<HTML>
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
<HEAD><TITLE>enable_if</TITLE>
|
||||||
</head>
|
|
||||||
<body>
|
<META http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
|
||||||
Automatic redirection failed, please go to
|
<META name="GENERATOR" content="Microsoft FrontPage 5.0">
|
||||||
<a href="../core/doc/html/core/enable_if.html">../core/doc/html/core/enable_if.html</a>
|
</HEAD>
|
||||||
<hr>
|
<BODY >
|
||||||
<tt>
|
<!--HEVEA command line is: hevea -nosymb -noiso -pedantic -v enable_if_docs_for_boost.tex -->
|
||||||
Boost.Utility<br>
|
<!--HTMLHEAD-->
|
||||||
<br>
|
<!--ENDHTML-->
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
<!--PREFIX <ARG ></ARG>-->
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
<!--CUT DEF section 1 -->
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
<BR>
|
||||||
<br>
|
<BR>
|
||||||
</tt>
|
|
||||||
</body>
|
|
||||||
</html>
|
<h1>
|
||||||
|
<img border="0" src="../../boost.png" align="center" width="277" height="86">enable_if</h1>
|
||||||
|
<BR>
|
||||||
|
<BR>
|
||||||
|
Copyright 2003 Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine.<BR>
|
||||||
|
<BR>
|
||||||
|
<!--TOC section Introduction-->
|
||||||
|
|
||||||
|
<H2><A NAME="htoc1">1</A> Introduction</H2><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="introduction"></A>
|
||||||
|
The <TT>enable_if</TT> family of templates is a set of tools to allow a function template or a class template specialization
|
||||||
|
to include or exclude itself from a set of matching functions or specializations
|
||||||
|
based on properties of its template arguments.
|
||||||
|
For example, one can define function templates that
|
||||||
|
are only enabled for, and thus only match, an arbitrary set of types
|
||||||
|
defined by a traits class. The <TT>enable_if</TT> templates can also be
|
||||||
|
applied to enable class template specializations. Applications of
|
||||||
|
<TT>enable_if</TT> are discussed in length
|
||||||
|
in [<A HREF="#jarvi:03:cuj_arbitrary_overloading"><CITE>1</CITE></A>] and [<A HREF="#jarvi:03:c++typeclasses"><CITE>2</CITE></A>].<BR>
|
||||||
|
<BR>
|
||||||
|
<!--TOC subsection Synopsis-->
|
||||||
|
|
||||||
|
<H3><A NAME="htoc2">1.1</A> Synopsis</H3><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="sec:synopsis"></A>
|
||||||
|
<PRE>namespace boost {
|
||||||
|
template <class Cond, class T = void> struct enable_if;
|
||||||
|
template <class Cond, class T = void> struct disable_if;
|
||||||
|
template <class Cond, class T> struct lazy_enable_if;
|
||||||
|
template <class Cond, class T> struct lazy_disable_if;
|
||||||
|
|
||||||
|
template <bool B, class T = void> struct enable_if_c;
|
||||||
|
template <bool B, class T = void> struct disable_if_c;
|
||||||
|
template <bool B, class T> struct lazy_enable_if_c;
|
||||||
|
template <bool B, class T> struct lazy_disable_if_c;
|
||||||
|
}
|
||||||
|
</PRE>
|
||||||
|
<!--TOC subsection Background-->
|
||||||
|
|
||||||
|
<H3><A NAME="htoc3">1.2</A> Background</H3><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="sec:background"></A>
|
||||||
|
Sensible operation of template function overloading in C++ relies
|
||||||
|
on the <EM>SFINAE</EM> (substitution-failure-is-not-an-error)
|
||||||
|
principle [<A HREF="#vandevoorde2002:templates"><CITE>3</CITE></A>]: if an invalid argument
|
||||||
|
or return type is formed during the instantiation of a function
|
||||||
|
template, the instantiation is removed from the overload resolution
|
||||||
|
set instead of causing a compilation error. The following example,
|
||||||
|
taken from [<A HREF="#jarvi:03:cuj_arbitrary_overloading"><CITE>1</CITE></A>],
|
||||||
|
demonstrates why this is important:
|
||||||
|
<PRE>int negate(int i) { return -i; }
|
||||||
|
|
||||||
|
template <class F>
|
||||||
|
typename F::result_type negate(const F& f) { return -f(); }
|
||||||
|
|
||||||
|
</PRE>
|
||||||
|
Suppose the compiler encounters the call <TT>negate(1)</TT>. The first
|
||||||
|
definition is obviously a better match, but the compiler must
|
||||||
|
nevertheless consider (and instantiate the prototypes) of both
|
||||||
|
definitions to find this out. Instantiating the latter definition with
|
||||||
|
<TT>F</TT> as <TT>int</TT> would result in:
|
||||||
|
<PRE>int::result_type negate(const int&);
|
||||||
|
|
||||||
|
</PRE>
|
||||||
|
where the return type is invalid. If this was an error, adding an unrelated function template
|
||||||
|
(that was never called) could break otherwise valid code.
|
||||||
|
Due to the SFINAE principle the above example is not, however, erroneous.
|
||||||
|
The latter definition of <TT>negate</TT> is simply removed from the overload resolution set.<BR>
|
||||||
|
<BR>
|
||||||
|
The <TT>enable_if</TT> templates are tools for controlled creation of the SFINAE
|
||||||
|
conditions.<BR>
|
||||||
|
<BR>
|
||||||
|
<!--TOC section The <TT>enable_if</TT> templates-->
|
||||||
|
|
||||||
|
<H2><A NAME="htoc4">2</A> The <TT>enable_if</TT> templates</H2><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="enable_if"></A>
|
||||||
|
The names of the <TT>enable_if</TT> templates have three parts: an optional <TT>lazy_</TT> tag,
|
||||||
|
either <TT>enable_if</TT> or <TT>disable_if</TT>, and an optional <TT>_c</TT> tag.
|
||||||
|
All eight combinations of these parts are supported.
|
||||||
|
The meaning of the <TT>lazy_</TT> tag is described in Section <A HREF="#sec:enable_if_lazy">3.3</A>.
|
||||||
|
The second part of the name indicates whether a true condition argument should
|
||||||
|
enable or disable the current overload.
|
||||||
|
The third part of the name indicates whether the condition argument is a <TT>bool</TT> value
|
||||||
|
(<TT>_c</TT> suffix), or a type containing a static <TT>bool</TT> constant named <TT>value</TT> (no suffix).
|
||||||
|
The latter version interoperates with Boost.MPL. <BR>
|
||||||
|
<BR>
|
||||||
|
The definitions of <TT>enable_if_c</TT> and <TT>enable_if</TT> are as follows (we use <TT>enable_if</TT> templates
|
||||||
|
unqualified but they are in the <TT>boost</TT> namespace).
|
||||||
|
<PRE>template <bool B, class T = void>
|
||||||
|
struct enable_if_c {
|
||||||
|
typedef T type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct enable_if_c<false, T> {};
|
||||||
|
|
||||||
|
template <class Cond, class T = void>
|
||||||
|
struct enable_if : public enable_if_c<Cond::value, T> {};
|
||||||
|
|
||||||
|
</PRE>
|
||||||
|
An instantiation of the <TT>enable_if_c</TT> template with the parameter
|
||||||
|
<TT>B</TT> as <TT>true</TT> contains a member type <TT>type</TT>, defined
|
||||||
|
to be <TT>T</TT>. If <TT>B</TT> is
|
||||||
|
<TT>false</TT>, no such member is defined. Thus
|
||||||
|
<TT>enable_if_c<B, T>::type</TT> is either a valid or an invalid type
|
||||||
|
expression, depending on the value of <TT>B</TT>.
|
||||||
|
When valid, <TT>enable_if_c<B, T>::type</TT> equals <TT>T</TT>.
|
||||||
|
The <TT>enable_if_c</TT> template can thus be used for controlling when functions are considered for
|
||||||
|
overload resolution and when they are not.
|
||||||
|
For example, the following function is defined for all arithmetic types (according to the
|
||||||
|
classification of the <A HREF="../type_traits/index.html">Boost type_traits library</A>):
|
||||||
|
<PRE>template <class T>
|
||||||
|
typename enable_if_c<boost::is_arithmetic<T>::value, T>::type
|
||||||
|
foo(T t) { return t; }
|
||||||
|
|
||||||
|
</PRE>
|
||||||
|
The <TT>disable_if_c</TT> template is provided as well, and has the
|
||||||
|
same functionality as <TT>enable_if_c</TT> except for the negated condition. The following
|
||||||
|
function is enabled for all non-arithmetic types.
|
||||||
|
<PRE>template <class T>
|
||||||
|
typename disable_if_c<boost::is_arithmetic<T>::value, T>::type
|
||||||
|
bar(T t) { return t; }
|
||||||
|
|
||||||
|
</PRE>
|
||||||
|
For easier syntax in some cases and interoperation with Boost.MPL we provide versions of
|
||||||
|
the <TT>enable_if</TT> templates taking any type with a <TT>bool</TT> member constant named
|
||||||
|
<TT>value</TT> as the condition argument.
|
||||||
|
The MPL <TT>bool_</TT>, <TT>and_</TT>, <TT>or_</TT>, and <TT>not_</TT> templates are likely to be
|
||||||
|
useful for creating such types. Also, the traits classes in the Boost.Type_traits library
|
||||||
|
follow this convention.
|
||||||
|
For example, the above example function <TT>foo</TT> can be alternatively written as:
|
||||||
|
<PRE>template <class T>
|
||||||
|
typename enable_if<boost::is_arithmetic<T>, T>::type
|
||||||
|
foo(T t) { return t; }
|
||||||
|
|
||||||
|
</PRE>
|
||||||
|
<!--TOC section Using <TT>enable_if</TT>-->
|
||||||
|
|
||||||
|
<H2><A NAME="htoc5">3</A> Using <TT>enable_if</TT></H2><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="sec:using_enable_if"></A>
|
||||||
|
The <TT>enable_if</TT> templates are defined in
|
||||||
|
<TT>boost/utility/enable_if.hpp</TT>, which is included by <TT>boost/utility.hpp</TT>.<BR>
|
||||||
|
<BR>
|
||||||
|
The <TT>enable_if</TT> template can be used either as the return type, or as an
|
||||||
|
extra argument. For example, the <TT>foo</TT> function in the previous section could also be written
|
||||||
|
as:
|
||||||
|
<PRE>template <class T>
|
||||||
|
T foo(T t, typename enable_if<boost::is_arithmetic<T> >::type* dummy = 0);
|
||||||
|
|
||||||
|
</PRE>Hence, an extra parameter of type <TT>void*</TT> is added, but it is given
|
||||||
|
a default value to keep the parameter hidden from client code.
|
||||||
|
Note that the second template argument was not given to <TT>enable_if</TT>, as the default
|
||||||
|
<TT>void</TT> gives the desired behavior.<BR>
|
||||||
|
<BR>
|
||||||
|
Whether to write the enabler as an argument or within the return type is
|
||||||
|
largely a matter of taste, but for certain functions, only one
|
||||||
|
alternative is possible:
|
||||||
|
<UL><LI>
|
||||||
|
Operators have a fixed number of arguments, thus <TT>enable_if</TT> must be used in the return type.
|
||||||
|
<LI>Constructors and destructors do not have a return type; an extra argument is the only option.
|
||||||
|
<LI>There does not seem to be a way to specify an enabler for a conversion operator. Converting constructors,
|
||||||
|
however, can have enablers as extra default arguments.
|
||||||
|
</UL>
|
||||||
|
<!--TOC subsection Enabling template class specializations-->
|
||||||
|
|
||||||
|
<H3><A NAME="htoc6">3.1</A> Enabling template class specializations</H3><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="sec:enable_if_classes"></A>
|
||||||
|
Class template specializations can be enabled or disabled with <TT>enable_if</TT>.
|
||||||
|
One extra template parameter needs to be added for the enabler expressions.
|
||||||
|
This parameter has the default value <TT>void</TT>.
|
||||||
|
For example:
|
||||||
|
<PRE>template <class T, class Enable = void>
|
||||||
|
class A { ... };
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
class A<T, typename enable_if<is_integral<T> >::type> { ... };
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
class A<T, typename enable_if<is_float<T> >::type> { ... };
|
||||||
|
|
||||||
|
</PRE>Instantiating <TT>A</TT> with any integral type matches the first specialization,
|
||||||
|
whereas any floating point type matches the second one. All other types
|
||||||
|
match the primary template.
|
||||||
|
The condition can be any compile-time boolean expression that depends on the
|
||||||
|
template arguments of the class.
|
||||||
|
Note that again, the second argument to <TT>enable_if</TT> is not needed; the default (<TT>void</TT>)
|
||||||
|
is the correct value.<BR>
|
||||||
|
<BR>
|
||||||
|
<!--TOC subsection Overlapping enabler conditions-->
|
||||||
|
|
||||||
|
<H3><A NAME="htoc7">3.2</A> Overlapping enabler conditions</H3><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="sec:overlapping_conditions"></A>
|
||||||
|
Once the compiler has examined the enabling conditions and included the
|
||||||
|
function into the overload resolution set, normal C++ overload resolution
|
||||||
|
rules are used to select the best matching function.
|
||||||
|
In particular, there is no ordering between enabling conditions.
|
||||||
|
Function templates with enabling conditions that are not mutually exclusive can
|
||||||
|
lead to ambiguities. For example:
|
||||||
|
<PRE>template <class T>
|
||||||
|
typename enable_if<boost::is_integral<T>, void>::type
|
||||||
|
foo(T t) {}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
typename enable_if<boost::is_arithmetic<T>, void>::type
|
||||||
|
foo(T t) {}
|
||||||
|
|
||||||
|
</PRE>
|
||||||
|
All integral types are also arithmetic. Therefore, say, for the call <TT>foo(1)</TT>,
|
||||||
|
both conditions are true and both functions are thus in the overload resolution set.
|
||||||
|
They are both equally good matches and thus ambiguous.
|
||||||
|
Of course, more than one enabling condition can be simultaneously true as long as
|
||||||
|
other arguments disambiguate the functions.<BR>
|
||||||
|
<BR>
|
||||||
|
The above discussion applies to using <TT>enable_if</TT> in class template
|
||||||
|
partial specializations as well.<BR>
|
||||||
|
<BR>
|
||||||
|
<!--TOC subsection Lazy <TT>enable_if</TT>-->
|
||||||
|
|
||||||
|
<H3><A NAME="htoc8">3.3</A> Lazy <TT>enable_if</TT></H3><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="sec:enable_if_lazy"></A>
|
||||||
|
In some cases it is necessary to avoid instantiating part of a
|
||||||
|
function signature unless an enabling condition is true. For example:
|
||||||
|
<PRE>template <class T, class U> class mult_traits;
|
||||||
|
|
||||||
|
template <class T, class U>
|
||||||
|
typename enable_if<is_multipliable<T, U>, typename mult_traits<T, U>::type>::type
|
||||||
|
operator*(const T& t, const U& u) { ... }
|
||||||
|
|
||||||
|
</PRE>Assume the class template <TT>mult_traits</TT> is a traits class defining
|
||||||
|
the resulting type of a multiplication operator. The <TT>is_multipliable</TT> traits
|
||||||
|
class specifies for which types to enable the operator. Whenever
|
||||||
|
<TT>is_multipliable<A, B>::value</TT> is <TT>true</TT> for some types <TT>A</TT> and <TT>B</TT>,
|
||||||
|
then <TT>mult_traits<A, B>::type</TT> is defined.<BR>
|
||||||
|
<BR>
|
||||||
|
Now, trying to invoke (some other overload) of <TT>operator*</TT> with, say, operand types <TT>C</TT> and <TT>D</TT>
|
||||||
|
for which <TT>is_multipliable<C, D>::value</TT> is <TT>false</TT>
|
||||||
|
and <TT>mult_traits<C, D>::type</TT> is not defined is an error on some compilers.
|
||||||
|
The SFINAE principle is not applied because
|
||||||
|
the invalid type occurs as an argument to another template. The <TT>lazy_enable_if</TT>
|
||||||
|
and <TT>lazy_disable_if</TT> templates (and their <TT>_c</TT> versions) can be used in such
|
||||||
|
situations:
|
||||||
|
<PRE>template<class T, class U>
|
||||||
|
typename lazy_enable_if<is_multipliable<T, U>, mult_traits<T, U> >::type
|
||||||
|
operator*(const T& t, const U& u) { ... }
|
||||||
|
|
||||||
|
</PRE>The second argument of <TT>lazy_enable_if</TT> must be a class type
|
||||||
|
that defines a nested type named <TT>type</TT> whenever the first
|
||||||
|
parameter (the condition) is true.<BR>
|
||||||
|
<BR>
|
||||||
|
<!--TOC paragraph Note-->
|
||||||
|
|
||||||
|
<H5>Note</H5><!--SEC END -->
|
||||||
|
|
||||||
|
Referring to one member type or static constant in a traits class
|
||||||
|
causes all of the members (type and static constant) of that
|
||||||
|
specialization to be instantiated. Therefore, if your traits classes
|
||||||
|
can sometimes contain invalid types, you should use two distinct
|
||||||
|
templates for describing the conditions and the type mappings. In the
|
||||||
|
above example, <TT>is_multipliable<T, U>::value</TT> defines when
|
||||||
|
<TT>mult_traits<T, U>::type</TT> is valid.<BR>
|
||||||
|
<BR>
|
||||||
|
<!--TOC subsection Compiler workarounds-->
|
||||||
|
|
||||||
|
<H3><A NAME="htoc9">3.4</A> Compiler workarounds</H3><!--SEC END -->
|
||||||
|
|
||||||
|
<A NAME="sec:workarounds"></A>
|
||||||
|
Some compilers flag functions as ambiguous if the only distinguishing factor is a different
|
||||||
|
condition in an enabler (even though the functions could never be ambiguous). For example,
|
||||||
|
some compilers (e.g. GCC 3.2) diagnose the following two functions as ambiguous:
|
||||||
|
<PRE>template <class T>
|
||||||
|
typename enable_if<boost::is_arithmetic<T>, T>::type
|
||||||
|
foo(T t);
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
typename disable_if<boost::is_arithmetic<T>, T>::type
|
||||||
|
foo(T t);
|
||||||
|
|
||||||
|
</PRE>Two workarounds can be applied:
|
||||||
|
<UL><LI>
|
||||||
|
Use an extra dummy parameter which disambiguates the functions. Use a default value for
|
||||||
|
it to hide the parameter from the caller. For example:
|
||||||
|
<PRE>template <int> struct dummy { dummy(int) {} };
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
typename enable_if<boost::is_arithmetic<T>, T>::type
|
||||||
|
foo(T t, dummy<0> = 0);
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
typename disable_if<boost::is_arithmetic<T>, T>::type
|
||||||
|
foo(T t, dummy<1> = 0);
|
||||||
|
</PRE><BR>
|
||||||
|
<BR>
|
||||||
|
<LI>Define the functions in different namespaces and bring them into a common
|
||||||
|
namespace with <TT>using</TT> declarations:
|
||||||
|
<PRE>namespace A {
|
||||||
|
template <class T>
|
||||||
|
typename enable_if<boost::is_arithmetic<T>, T>::type
|
||||||
|
foo(T t);
|
||||||
|
}
|
||||||
|
|
||||||
|
namespace B {
|
||||||
|
template <class T>
|
||||||
|
typename disable_if<boost::is_arithmetic<T>, T>::type
|
||||||
|
foo(T t);
|
||||||
|
}
|
||||||
|
|
||||||
|
using A::foo;
|
||||||
|
using B::foo;
|
||||||
|
|
||||||
|
</PRE>
|
||||||
|
Note that the second workaround above cannot be used for member
|
||||||
|
templates. On the other hand, operators do not accept extra arguments,
|
||||||
|
which makes the first workaround unusable. As the net effect,
|
||||||
|
neither of the workarounds are of assistance for templated operators that
|
||||||
|
need to be defined as member functions (assignment and
|
||||||
|
subscript operators).
|
||||||
|
</UL>
|
||||||
|
<!--TOC section Acknowledgements-->
|
||||||
|
|
||||||
|
<H2><A NAME="htoc10">4</A> Acknowledgements</H2><!--SEC END -->
|
||||||
|
|
||||||
|
We are grateful to Howard Hinnant, Jason Shirk, Paul Mensonides, and Richard
|
||||||
|
Smith whose findings have influenced the library.<BR>
|
||||||
|
<BR>
|
||||||
|
<!--TOC section References-->
|
||||||
|
|
||||||
|
<H2>References</H2><!--SEC END -->
|
||||||
|
<DL COMPACT=compact><DT><A NAME="jarvi:03:cuj_arbitrary_overloading"><FONT COLOR=purple>[1]</FONT></A><DD>
|
||||||
|
Jaakko Järvi, Jeremiah Willcock, Howard Hinnant, and Andrew Lumsdaine.
|
||||||
|
Function overloading based on arbitrary properties of types.
|
||||||
|
<EM>C/C++ Users Journal</EM>, 21(6):25--32, June 2003.<BR>
|
||||||
|
<BR>
|
||||||
|
<DT><A NAME="jarvi:03:c++typeclasses"><FONT COLOR=purple>[2]</FONT></A><DD>
|
||||||
|
Jaakko Järvi, Jeremiah Willcock, and Andrew Lumsdaine.
|
||||||
|
Concept-controlled polymorphism.
|
||||||
|
In Frank Pfennig and Yannis Smaragdakis, editors, <EM>Generative
|
||||||
|
Programming and Component Engineering</EM>, volume 2830 of <EM>LNCS</EM>, pages
|
||||||
|
228--244. Springer Verlag, September 2003.<BR>
|
||||||
|
<BR>
|
||||||
|
<DT><A NAME="vandevoorde2002:templates"><FONT COLOR=purple>[3]</FONT></A><DD>
|
||||||
|
David Vandevoorde and Nicolai M. Josuttis.
|
||||||
|
<EM>C++ Templates: The Complete Guide</EM>.
|
||||||
|
Addison-Wesley, 2002.</DL>
|
||||||
|
|
||||||
|
<hr/>
|
||||||
|
<p>Copyright Jaakko Järvi, Jeremiah Willcock and Andrew Lumsdaine<BR>
|
||||||
|
<EM>{jajarvi|jewillco|lums}@osl.iu.edu</EM><BR>
|
||||||
|
Indiana University<BR>
|
||||||
|
Open Systems Lab<br/>
|
||||||
|
Use, modification and distribution are subject to the
|
||||||
|
Boost Software License, Version 1.0.
|
||||||
|
(See accompanying file LICENSE_1_0.txt
|
||||||
|
or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
|
||||||
|
http://www.boost.org/LICENSE_1_0.txt
|
||||||
|
</a>).
|
||||||
|
</p>
|
||||||
|
<!--HTMLFOOT-->
|
||||||
|
<!--ENDHTML-->
|
||||||
|
<!--FOOTER-->
|
||||||
|
<HR SIZE=2>
|
||||||
|
<BLOCKQUOTE><EM>This document was translated from L<sup>A</sup>T<sub>E</sub>X by
|
||||||
|
</EM><A HREF="http://pauillac.inria.fr/~maranget/hevea/index.html"><EM>H<FONT SIZE=2><sup>E</sup></FONT>V<FONT SIZE=2><sup>E</sup></FONT>A</EM></A><EM>.
|
||||||
|
</EM></BLOCKQUOTE>
|
||||||
|
</BODY>
|
||||||
|
</HTML>
|
||||||
23
enable_if/test/Jamfile.v2
Normal file
23
enable_if/test/Jamfile.v2
Normal file
@@ -0,0 +1,23 @@
|
|||||||
|
# Copyright David Abrahams 2003.
|
||||||
|
# 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)
|
||||||
|
|
||||||
|
# For more information, see http://www.boost.org/
|
||||||
|
|
||||||
|
project
|
||||||
|
: requirements <library>/boost/test//boost_test_exec_monitor
|
||||||
|
;
|
||||||
|
|
||||||
|
test-suite utility/enable_if
|
||||||
|
:
|
||||||
|
[ run constructors.cpp ]
|
||||||
|
[ run dummy_arg_disambiguation.cpp ]
|
||||||
|
[ run lazy.cpp ]
|
||||||
|
[ run lazy_test.cpp ]
|
||||||
|
[ run member_templates.cpp ]
|
||||||
|
[ run namespace_disambiguation.cpp ]
|
||||||
|
[ run no_disambiguation.cpp ]
|
||||||
|
[ run partial_specializations.cpp ]
|
||||||
|
;
|
||||||
|
|
||||||
62
enable_if/test/constructors.cpp
Normal file
62
enable_if/test/constructors.cpp
Normal file
@@ -0,0 +1,62 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
#include <boost/test/minimal.hpp>
|
||||||
|
|
||||||
|
#include <boost/utility/enable_if.hpp>
|
||||||
|
#include <boost/type_traits.hpp>
|
||||||
|
|
||||||
|
using boost::enable_if;
|
||||||
|
using boost::disable_if;
|
||||||
|
using boost::is_arithmetic;
|
||||||
|
|
||||||
|
struct container {
|
||||||
|
bool my_value;
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
container(const T&, const typename enable_if<is_arithmetic<T>, T>::type * = 0):
|
||||||
|
my_value(true) {}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
container(const T&, const typename disable_if<is_arithmetic<T>, T>::type * = 0):
|
||||||
|
my_value(false) {}
|
||||||
|
};
|
||||||
|
|
||||||
|
// example from Howard Hinnant (tests enable_if template members of a templated class)
|
||||||
|
template <class charT>
|
||||||
|
struct xstring
|
||||||
|
{
|
||||||
|
template <class It>
|
||||||
|
xstring(It begin, It end, typename
|
||||||
|
disable_if<is_arithmetic<It> >::type* = 0)
|
||||||
|
: data(end-begin) {}
|
||||||
|
|
||||||
|
int data;
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
int test_main(int, char*[])
|
||||||
|
{
|
||||||
|
|
||||||
|
BOOST_CHECK(container(1).my_value);
|
||||||
|
BOOST_CHECK(container(1.0).my_value);
|
||||||
|
|
||||||
|
BOOST_CHECK(!container("1").my_value);
|
||||||
|
BOOST_CHECK(!container(static_cast<void*>(0)).my_value);
|
||||||
|
|
||||||
|
char sa[] = "123456";
|
||||||
|
BOOST_CHECK(xstring<char>(sa, sa+6).data == 6);
|
||||||
|
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
46
enable_if/test/dummy_arg_disambiguation.cpp
Normal file
46
enable_if/test/dummy_arg_disambiguation.cpp
Normal file
@@ -0,0 +1,46 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
#include <boost/test/minimal.hpp>
|
||||||
|
|
||||||
|
#include <boost/utility/enable_if.hpp>
|
||||||
|
#include <boost/type_traits/is_arithmetic.hpp>
|
||||||
|
|
||||||
|
using boost::enable_if;
|
||||||
|
using boost::disable_if;
|
||||||
|
using boost::is_arithmetic;
|
||||||
|
|
||||||
|
template <int N> struct dummy {
|
||||||
|
dummy(int) {};
|
||||||
|
};
|
||||||
|
|
||||||
|
template<class T>
|
||||||
|
typename enable_if<is_arithmetic<T>, bool>::type
|
||||||
|
arithmetic_object(T t, dummy<0> = 0) { return true; }
|
||||||
|
|
||||||
|
template<class T>
|
||||||
|
typename disable_if<is_arithmetic<T>, bool>::type
|
||||||
|
arithmetic_object(T t, dummy<1> = 0) { return false; }
|
||||||
|
|
||||||
|
|
||||||
|
int test_main(int, char*[])
|
||||||
|
{
|
||||||
|
|
||||||
|
BOOST_CHECK(arithmetic_object(1));
|
||||||
|
BOOST_CHECK(arithmetic_object(1.0));
|
||||||
|
|
||||||
|
BOOST_CHECK(!arithmetic_object("1"));
|
||||||
|
BOOST_CHECK(!arithmetic_object(static_cast<void*>(0)));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
82
enable_if/test/lazy.cpp
Normal file
82
enable_if/test/lazy.cpp
Normal file
@@ -0,0 +1,82 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
#include <boost/test/minimal.hpp>
|
||||||
|
|
||||||
|
#include <boost/utility/enable_if.hpp>
|
||||||
|
#include <boost/type_traits/is_same.hpp>
|
||||||
|
|
||||||
|
using boost::enable_if_c;
|
||||||
|
using boost::lazy_enable_if_c;
|
||||||
|
|
||||||
|
// This class provides a reduced example of a traits class for
|
||||||
|
// computing the result of multiplying two types. The member typedef
|
||||||
|
// 'type' in this traits class defines the return type of this
|
||||||
|
// operator. The return type member is invalid unless both arguments
|
||||||
|
// for mult_traits are values that mult_traits expects (ints in this
|
||||||
|
// case). This kind of situation may arise if a traits class only
|
||||||
|
// makes sense for some set of types, not all C++ types.
|
||||||
|
|
||||||
|
template <class T> struct is_int {
|
||||||
|
BOOST_STATIC_CONSTANT(bool, value = (boost::is_same<T, int>::value));
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T, class U>
|
||||||
|
struct mult_traits {
|
||||||
|
typedef typename T::does_not_exist type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct mult_traits<int, int> {
|
||||||
|
typedef int type;
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
// Next, a forwarding function mult() is defined. It is enabled only
|
||||||
|
// when both arguments are of type int. The first version, using
|
||||||
|
// non-lazy enable_if_c does not work.
|
||||||
|
|
||||||
|
#if 0
|
||||||
|
template <class T, class U>
|
||||||
|
typename enable_if_c<
|
||||||
|
is_int<T>::value && is_int<U>::value,
|
||||||
|
typename mult_traits<T, U>::type
|
||||||
|
>::type
|
||||||
|
mult(const T& x, const U& y) {return x * y;}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// A correct version uses lazy_enable_if_c.
|
||||||
|
// This template removes compiler errors from invalid code used as an
|
||||||
|
// argument to enable_if_c.
|
||||||
|
|
||||||
|
#if 1
|
||||||
|
template <class T, class U>
|
||||||
|
typename lazy_enable_if_c<
|
||||||
|
is_int<T>::value & is_int<U>::value,
|
||||||
|
mult_traits<T, U>
|
||||||
|
>::type
|
||||||
|
mult(const T& x, const U& y) {return x * y;}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
double mult(int i, double d) { return (double)i * d; }
|
||||||
|
|
||||||
|
int test_main(int, char*[])
|
||||||
|
{
|
||||||
|
|
||||||
|
|
||||||
|
BOOST_CHECK(mult(1, 2) == 2);
|
||||||
|
|
||||||
|
BOOST_CHECK(mult(1, 3.0) == 3.0);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
100
enable_if/test/lazy_test.cpp
Normal file
100
enable_if/test/lazy_test.cpp
Normal file
@@ -0,0 +1,100 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
// Testing all variations of lazy_enable_if.
|
||||||
|
|
||||||
|
#include <boost/test/minimal.hpp>
|
||||||
|
#include <boost/mpl/not.hpp>
|
||||||
|
|
||||||
|
#include <boost/utility/enable_if.hpp>
|
||||||
|
#include <boost/type_traits/is_same.hpp>
|
||||||
|
|
||||||
|
using boost::lazy_enable_if;
|
||||||
|
using boost::lazy_disable_if;
|
||||||
|
|
||||||
|
using boost::lazy_enable_if_c;
|
||||||
|
using boost::lazy_disable_if_c;
|
||||||
|
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct is_int_or_double {
|
||||||
|
BOOST_STATIC_CONSTANT(bool,
|
||||||
|
value = (boost::is_same<T, int>::value ||
|
||||||
|
boost::is_same<T, double>::value));
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct some_traits {
|
||||||
|
typedef typename T::does_not_exist type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct some_traits<int> {
|
||||||
|
typedef bool type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct some_traits<double> {
|
||||||
|
typedef bool type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct make_bool {
|
||||||
|
typedef bool type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct make_bool<int> {};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct make_bool<double> {};
|
||||||
|
|
||||||
|
namespace A {
|
||||||
|
|
||||||
|
template<class T>
|
||||||
|
typename lazy_enable_if<is_int_or_double<T>, some_traits<T> >::type
|
||||||
|
foo(T t) { return true; }
|
||||||
|
|
||||||
|
template<class T>
|
||||||
|
typename lazy_enable_if_c<is_int_or_double<T>::value, some_traits<T> >::type
|
||||||
|
foo2(T t) { return true; }
|
||||||
|
}
|
||||||
|
|
||||||
|
namespace B {
|
||||||
|
template<class T>
|
||||||
|
typename lazy_disable_if<is_int_or_double<T>, make_bool<T> >::type
|
||||||
|
foo(T t) { return false; }
|
||||||
|
|
||||||
|
template<class T>
|
||||||
|
typename lazy_disable_if_c<is_int_or_double<T>::value, make_bool<T> >::type
|
||||||
|
foo2(T t) { return false; }
|
||||||
|
}
|
||||||
|
|
||||||
|
int test_main(int, char*[])
|
||||||
|
{
|
||||||
|
using namespace A;
|
||||||
|
using namespace B;
|
||||||
|
BOOST_CHECK(foo(1));
|
||||||
|
BOOST_CHECK(foo(1.0));
|
||||||
|
|
||||||
|
BOOST_CHECK(!foo("1"));
|
||||||
|
BOOST_CHECK(!foo(static_cast<void*>(0)));
|
||||||
|
|
||||||
|
BOOST_CHECK(foo2(1));
|
||||||
|
BOOST_CHECK(foo2(1.0));
|
||||||
|
|
||||||
|
BOOST_CHECK(!foo2("1"));
|
||||||
|
BOOST_CHECK(!foo2(static_cast<void*>(0)));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
43
enable_if/test/member_templates.cpp
Normal file
43
enable_if/test/member_templates.cpp
Normal file
@@ -0,0 +1,43 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
#include <boost/test/minimal.hpp>
|
||||||
|
|
||||||
|
#include <boost/utility/enable_if.hpp>
|
||||||
|
#include <boost/type_traits/is_arithmetic.hpp>
|
||||||
|
|
||||||
|
using boost::enable_if;
|
||||||
|
using boost::disable_if;
|
||||||
|
using boost::is_arithmetic;
|
||||||
|
|
||||||
|
struct container {
|
||||||
|
template <class T>
|
||||||
|
typename enable_if<is_arithmetic<T>, bool>::type
|
||||||
|
arithmetic_object(const T&, const int* /* disambiguate */ = 0) {return true;}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
typename disable_if<is_arithmetic<T>, bool>::type
|
||||||
|
arithmetic_object(const T&) {return false;}
|
||||||
|
};
|
||||||
|
|
||||||
|
int test_main(int, char*[])
|
||||||
|
{
|
||||||
|
|
||||||
|
BOOST_CHECK(container().arithmetic_object(1));
|
||||||
|
BOOST_CHECK(container().arithmetic_object(1.0));
|
||||||
|
|
||||||
|
BOOST_CHECK(!container().arithmetic_object("1"));
|
||||||
|
BOOST_CHECK(!container().arithmetic_object(static_cast<void*>(0)));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
47
enable_if/test/namespace_disambiguation.cpp
Normal file
47
enable_if/test/namespace_disambiguation.cpp
Normal file
@@ -0,0 +1,47 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
#include <boost/test/minimal.hpp>
|
||||||
|
#include <boost/mpl/not.hpp>
|
||||||
|
|
||||||
|
#include <boost/utility/enable_if.hpp>
|
||||||
|
#include <boost/type_traits/is_arithmetic.hpp>
|
||||||
|
|
||||||
|
using boost::enable_if;
|
||||||
|
using boost::mpl::not_;
|
||||||
|
using boost::is_arithmetic;
|
||||||
|
|
||||||
|
namespace A {
|
||||||
|
template<class T>
|
||||||
|
typename enable_if<is_arithmetic<T>, bool>::type
|
||||||
|
arithmetic_object(T t) { return true; }
|
||||||
|
}
|
||||||
|
|
||||||
|
namespace B {
|
||||||
|
template<class T>
|
||||||
|
typename enable_if<not_<is_arithmetic<T> >, bool>::type
|
||||||
|
arithmetic_object(T t) { return false; }
|
||||||
|
}
|
||||||
|
|
||||||
|
int test_main(int, char*[])
|
||||||
|
{
|
||||||
|
using namespace A;
|
||||||
|
using namespace B;
|
||||||
|
BOOST_CHECK(arithmetic_object(1));
|
||||||
|
BOOST_CHECK(arithmetic_object(1.0));
|
||||||
|
|
||||||
|
BOOST_CHECK(!arithmetic_object("1"));
|
||||||
|
BOOST_CHECK(!arithmetic_object(static_cast<void*>(0)));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
43
enable_if/test/no_disambiguation.cpp
Normal file
43
enable_if/test/no_disambiguation.cpp
Normal file
@@ -0,0 +1,43 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
#include <boost/test/minimal.hpp>
|
||||||
|
#include <boost/mpl/not.hpp>
|
||||||
|
|
||||||
|
#include <boost/utility/enable_if.hpp>
|
||||||
|
#include <boost/type_traits/is_arithmetic.hpp>
|
||||||
|
|
||||||
|
using boost::mpl::not_;
|
||||||
|
using boost::enable_if;
|
||||||
|
using boost::is_arithmetic;
|
||||||
|
|
||||||
|
template<class T>
|
||||||
|
typename enable_if<is_arithmetic<T>, bool>::type
|
||||||
|
arithmetic_object(T t) { return true; }
|
||||||
|
|
||||||
|
template<class T>
|
||||||
|
typename enable_if<not_<is_arithmetic<T> >, bool>::type
|
||||||
|
arithmetic_object(T t) { return false; }
|
||||||
|
|
||||||
|
|
||||||
|
int test_main(int, char*[])
|
||||||
|
{
|
||||||
|
|
||||||
|
BOOST_CHECK(arithmetic_object(1));
|
||||||
|
BOOST_CHECK(arithmetic_object(1.0));
|
||||||
|
|
||||||
|
BOOST_CHECK(!arithmetic_object("1"));
|
||||||
|
BOOST_CHECK(!arithmetic_object(static_cast<void*>(0)));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
67
enable_if/test/partial_specializations.cpp
Normal file
67
enable_if/test/partial_specializations.cpp
Normal file
@@ -0,0 +1,67 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
#include <boost/test/minimal.hpp>
|
||||||
|
|
||||||
|
#include <boost/utility/enable_if.hpp>
|
||||||
|
#include <boost/type_traits/is_arithmetic.hpp>
|
||||||
|
|
||||||
|
using boost::enable_if_c;
|
||||||
|
using boost::disable_if_c;
|
||||||
|
using boost::enable_if;
|
||||||
|
using boost::disable_if;
|
||||||
|
using boost::is_arithmetic;
|
||||||
|
|
||||||
|
template <class T, class Enable = void>
|
||||||
|
struct tester;
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct tester<T, typename enable_if_c<is_arithmetic<T>::value>::type> {
|
||||||
|
BOOST_STATIC_CONSTANT(bool, value = true);
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct tester<T, typename disable_if_c<is_arithmetic<T>::value>::type> {
|
||||||
|
BOOST_STATIC_CONSTANT(bool, value = false);
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T, class Enable = void>
|
||||||
|
struct tester2;
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct tester2<T, typename enable_if<is_arithmetic<T> >::type> {
|
||||||
|
BOOST_STATIC_CONSTANT(bool, value = true);
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct tester2<T, typename disable_if<is_arithmetic<T> >::type> {
|
||||||
|
BOOST_STATIC_CONSTANT(bool, value = false);
|
||||||
|
};
|
||||||
|
|
||||||
|
int test_main(int, char*[])
|
||||||
|
{
|
||||||
|
|
||||||
|
BOOST_CHECK(tester<int>::value);
|
||||||
|
BOOST_CHECK(tester<double>::value);
|
||||||
|
|
||||||
|
BOOST_CHECK(!tester<char*>::value);
|
||||||
|
BOOST_CHECK(!tester<void*>::value);
|
||||||
|
|
||||||
|
BOOST_CHECK(tester2<int>::value);
|
||||||
|
BOOST_CHECK(tester2<double>::value);
|
||||||
|
|
||||||
|
BOOST_CHECK(!tester2<char*>::value);
|
||||||
|
BOOST_CHECK(!tester2<void*>::value);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
163
generator_iterator.htm
Normal file
163
generator_iterator.htm
Normal file
@@ -0,0 +1,163 @@
|
|||||||
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||||||
|
|
||||||
|
<html>
|
||||||
|
<head>
|
||||||
|
<meta http-equiv="Content-Language" content="en-us">
|
||||||
|
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
|
||||||
|
|
||||||
|
<title>Generator Iterator Adaptor Documentation</title>
|
||||||
|
</head>
|
||||||
|
|
||||||
|
<body bgcolor="#FFFFFF" text="#000000">
|
||||||
|
<img src="../../boost.png" alt="boost.png (6897 bytes)" align="middle"
|
||||||
|
width="277" height="86">
|
||||||
|
|
||||||
|
<h1>Generator Iterator Adaptor</h1>
|
||||||
|
|
||||||
|
<p>Defined in header <a href=
|
||||||
|
"../../boost/generator_iterator.hpp">boost/generator_iterator.hpp</a></p>
|
||||||
|
|
||||||
|
<p>The generator iterator adaptor makes it easier to create custom input
|
||||||
|
iterators from 0-ary functions and function objects. The adaptor takes a
|
||||||
|
<a href="http://www.sgi.com/tech/stl/Generator.html">Generator</a> and
|
||||||
|
creates a model of <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>. Each
|
||||||
|
increment retrieves an item from the generator and makes it available to be
|
||||||
|
retrieved by dereferencing. The motivation for this iterator is that some
|
||||||
|
concepts can be more naturally expressed as a generator, while most STL
|
||||||
|
algorithms expect an iterator. An example is the <a href=
|
||||||
|
"../random/index.html">Random Number</a> library.</p>
|
||||||
|
|
||||||
|
<h2>Synopsis</h2>
|
||||||
|
|
||||||
|
<blockquote>
|
||||||
|
<pre>
|
||||||
|
namespace boost {
|
||||||
|
template <class Generator>
|
||||||
|
class generator_iterator_policies;
|
||||||
|
|
||||||
|
template <class Generator>
|
||||||
|
class generator_iterator_generator;
|
||||||
|
|
||||||
|
template <class Generator>
|
||||||
|
typename generator_iterator_generator<Generator>::type
|
||||||
|
make_generator_iterator(Generator & gen);
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
</blockquote>
|
||||||
|
<hr>
|
||||||
|
|
||||||
|
<h2>The Generator Iterator Generator Class</h2>
|
||||||
|
|
||||||
|
<p>The class generator_iterator_generator is a helper class whose purpose
|
||||||
|
is to construct a generator iterator type. The template parameter for this
|
||||||
|
class is the Generator function object type that is being wrapped. The
|
||||||
|
generator iterator adaptor only holds a reference (or pointer) to the
|
||||||
|
function object, therefore the function object must outlive the generator
|
||||||
|
iterator adaptor constructed from it.</p>
|
||||||
|
<pre>
|
||||||
|
template <class Generator>
|
||||||
|
class generator_iterator_generator
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
typedef <i>unspecified</i> type; // the resulting generator iterator type
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
|
||||||
|
<h3>Template Parameters</h3>
|
||||||
|
|
||||||
|
<table border summary="">
|
||||||
|
<tr>
|
||||||
|
<th>Parameter</th>
|
||||||
|
|
||||||
|
<th>Description</th>
|
||||||
|
</tr>
|
||||||
|
|
||||||
|
<tr>
|
||||||
|
<td><tt><a href=
|
||||||
|
"http://www.sgi.com/tech/stl/Generator.html">Generator</a></tt></td>
|
||||||
|
|
||||||
|
<td>The generator (0-ary function object) type being wrapped. The
|
||||||
|
return type of the function must be defined as
|
||||||
|
<tt>Generator::result_type</tt>. The function object must be a model of
|
||||||
|
<a href=
|
||||||
|
"http://www.sgi.com/tech/stl/Generator.html">Generator</a>.</td>
|
||||||
|
</tr>
|
||||||
|
</table>
|
||||||
|
|
||||||
|
<h3>Concept Model</h3>
|
||||||
|
|
||||||
|
<p>The generator iterator class is a model of <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.</p>
|
||||||
|
|
||||||
|
<h3>Members</h3>
|
||||||
|
|
||||||
|
<p>The generator iterator implements the member functions and operators
|
||||||
|
required of the <a href=
|
||||||
|
"http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>
|
||||||
|
concept.<br></p>
|
||||||
|
<hr>
|
||||||
|
|
||||||
|
<h2><a name="make_generator_iterator" id="make_generator_iterator">The
|
||||||
|
Generator Iterator Object Generator</a></h2>
|
||||||
|
|
||||||
|
<p>The <tt>make_generator_iterator()</tt> function provides a convenient
|
||||||
|
way to create generator iterator objects. The function saves the user the
|
||||||
|
trouble of explicitly writing out the iterator types.</p>
|
||||||
|
|
||||||
|
<blockquote>
|
||||||
|
<pre>
|
||||||
|
template <class Generator>
|
||||||
|
typename generator_iterator_generator<Generator>::type
|
||||||
|
make_generator_iterator(Generator & gen);
|
||||||
|
</pre>
|
||||||
|
</blockquote>
|
||||||
|
<hr>
|
||||||
|
|
||||||
|
<h3>Example</h3>
|
||||||
|
|
||||||
|
<p>The following program shows how <code>generator_iterator</code>
|
||||||
|
transforms a generator into an input iterator.</p>
|
||||||
|
|
||||||
|
<blockquote>
|
||||||
|
<pre>
|
||||||
|
#include <iostream>
|
||||||
|
#include <boost/generator_iterator.hpp>
|
||||||
|
|
||||||
|
class my_generator
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
typedef int result_type;
|
||||||
|
my_generator() : state(0) { }
|
||||||
|
int operator()() { return ++state; }
|
||||||
|
private:
|
||||||
|
int state;
|
||||||
|
};
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
my_generator gen;
|
||||||
|
boost::generator_iterator_generator<my_generator>::type it = boost::make_generator_iterator(gen);
|
||||||
|
for(int i = 0; i < 10; ++i, ++it)
|
||||||
|
std::cout << *it << std::endl;
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
</blockquote>
|
||||||
|
<hr>
|
||||||
|
|
||||||
|
<p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
|
||||||
|
"http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
|
||||||
|
height="31" width="88"></a></p>
|
||||||
|
|
||||||
|
<p>Revised
|
||||||
|
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
|
||||||
|
|
||||||
|
<p><i>Copyright © 2001 <a href=
|
||||||
|
"http://www.boost.org/people/jens_maurer.htm">Jens Maurer</a></i></p>
|
||||||
|
|
||||||
|
<p><i>Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
|
||||||
|
copy at <a href=
|
||||||
|
"http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
|
||||||
|
</body>
|
||||||
|
</html>
|
||||||
@@ -1,44 +0,0 @@
|
|||||||
|
|
||||||
# Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
# Distributed under the Boost Software License, Version 1.0
|
|
||||||
# (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
# http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
# Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
import quickbook ;
|
|
||||||
using boostbook ;
|
|
||||||
|
|
||||||
doxygen reference : ../../../../boost/utility/identity_type.hpp
|
|
||||||
: <reftitle>"Reference"
|
|
||||||
<doxygen:param>PREDEFINED="DOXYGEN"
|
|
||||||
<doxygen:param>QUIET=YES
|
|
||||||
<doxygen:param>WARN_IF_UNDOCUMENTED=NO
|
|
||||||
<doxygen:param>HIDE_UNDOC_MEMBERS=YES
|
|
||||||
<doxygen:param>HIDE_UNDOC_CLASSES=YES
|
|
||||||
<doxygen:param>ALIASES=" Params=\"<b>Parameters:</b> <table border="0">\" Param{2}=\"<tr><td><b><tt>\\1</tt></b></td><td>\\2</td></tr>\" EndParams=\"</table>\" Returns=\"<b>Returns:</b>\" Note=\"<b>Note:</b>\" Warning=\"<b>Warning:</b>\" See=\"<b>See:</b>\" RefSect{2}=\"\\xmlonly<link linkend='boost_utility_identitytype.\\1'>\\2</link>\\endxmlonly\" RefClass{1}=\"\\xmlonly<computeroutput><classname alt='\\1'>\\1</classname></computeroutput>\\endxmlonly\" RefFunc{1}=\"\\xmlonly<computeroutput><functionname alt='\\1'>\\1</functionname></computeroutput>\\endxmlonly\" RefMacro{1}=\"\\xmlonly<computeroutput><macroname alt='\\1'>\\1</macroname></computeroutput>\\endxmlonly\" "
|
|
||||||
;
|
|
||||||
|
|
||||||
# This target must be called "index" so to generate "index.html" file.
|
|
||||||
xml index : identity_type.qbk : <dependency>reference ;
|
|
||||||
|
|
||||||
boostbook doc : index
|
|
||||||
: <location>html
|
|
||||||
<format>onehtml
|
|
||||||
<xsl:param>toc.section.depth=0
|
|
||||||
<xsl:param>html.stylesheet=../../../../../doc/src/boostbook.css
|
|
||||||
<xsl:param>boost.root=../../../../..
|
|
||||||
;
|
|
||||||
|
|
||||||
#
|
|
||||||
# This is very imperfect - it results in both html and pdf docs being built,
|
|
||||||
# for some reason I can't get the "onehtml" format specified above to play nice
|
|
||||||
# with the usual incantations for mixed pdf/html builds. JM 06/2012.
|
|
||||||
#
|
|
||||||
boostbook pdf_doc : index
|
|
||||||
:
|
|
||||||
<format>pdf
|
|
||||||
<format>html:<build>no
|
|
||||||
;
|
|
||||||
|
|
||||||
install pdf_doc_install : pdf_doc : <location>. <name>identity_type.pdf <install-type>PDF ;
|
|
||||||
explicit pdf_doc_install ;
|
|
||||||
@@ -1,252 +0,0 @@
|
|||||||
<html><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8"><title>Boost.Utility/IdentityType 1.0.0</title><link rel="stylesheet" type="text/css" href="../../../../../doc/src/boostbook.css"><meta name="generator" content="DocBook XSL Stylesheets V1.76.1"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="chapter" title="Boost.Utility/IdentityType 1.0.0"><div class="titlepage"><div><div><h2 class="title"><a name="boost_utility_identitytype"></a>Boost.Utility/IdentityType 1.0.0</h2></div><div><div class="author"><h3 class="author"><span class="firstname">Lorenzo</span> <span class="surname">Caminiti <code class="email"><<a class="email" href="mailto:lorcaminiti@gmail.com">lorcaminiti@gmail.com</a>></code></span></h3></div></div><div><p class="copyright">Copyright © 2009-2012 Lorenzo
|
|
||||||
Caminiti</p></div><div><div class="legalnotice" title="Legal Notice"><a name="boost_utility_identitytype.legal"></a><p>
|
|
||||||
Distributed under the Boost Software License, Version 1.0 (see accompanying
|
|
||||||
file LICENSE_1_0.txt or a copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
|
||||||
</p></div></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="section"><a href="#boost_utility_identitytype.motivation">Motivation</a></span></dt><dt><span class="section"><a href="#boost_utility_identitytype.solution">Solution</a></span></dt><dt><span class="section"><a href="#boost_utility_identitytype.templates">Templates</a></span></dt><dt><span class="section"><a href="#boost_utility_identitytype.abstract_types">Abstract Types</a></span></dt><dt><span class="section"><a href="#boost_utility_identitytype.annex__usage">Annex: Usage</a></span></dt><dt><span class="section"><a href="#boost_utility_identitytype.annex__implementation">Annex:
|
|
||||||
Implementation</a></span></dt><dt><span class="section"><a href="#reference">Reference</a></span></dt></dl></div><p>
|
|
||||||
This library allows to wrap types within round parenthesis so they can always
|
|
||||||
be passed as macro parameters.
|
|
||||||
</p><div class="section boost_utility_identitytype_motivation" title="Motivation"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="boost_utility_identitytype.motivation"></a><a class="link" href="#boost_utility_identitytype.motivation" title="Motivation">Motivation</a></h2></div></div></div><p>
|
|
||||||
Consider the following macro which declares a variable named <code class="computeroutput"><span class="identifier">var</span></code><code class="literal"><span class="emphasis"><em>n</em></span></code>
|
|
||||||
with the specified <code class="literal"><span class="emphasis"><em>type</em></span></code> (see also
|
|
||||||
<a href="../../test/var_error.cpp" target="_top"><code class="literal">var_error.cpp</code></a>):
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">VAR</span><span class="special">(</span><span class="identifier">type</span><span class="special">,</span> <span class="identifier">n</span><span class="special">)</span> <span class="identifier">type</span> <span class="identifier">var</span> <span class="error">#</span><span class="preprocessor"># n</span>
|
|
||||||
|
|
||||||
<span class="identifier">VAR</span><span class="special">(</span><span class="keyword">int</span><span class="special">,</span> <span class="number">1</span><span class="special">);</span> <span class="comment">// OK.</span>
|
|
||||||
<span class="identifier">VAR</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">>,</span> <span class="number">2</span><span class="special">);</span> <span class="comment">// Error.</span>
|
|
||||||
</pre><p>
|
|
||||||
</p><p>
|
|
||||||
The first macro invocation works correctly declaring a variable named <code class="computeroutput"><span class="identifier">var1</span></code> of type <code class="computeroutput"><span class="keyword">int</span></code>.
|
|
||||||
However, the second macro invocation fails generating a preprocessor error
|
|
||||||
similar to the following:
|
|
||||||
</p><pre class="programlisting">error: macro "VAR" passed 3 arguments, but takes just 2
|
|
||||||
</pre><p>
|
|
||||||
That is because the <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span></code> type passed as the first macro parameter
|
|
||||||
contains a comma <code class="computeroutput"><span class="special">,</span></code> not wrapped
|
|
||||||
by round parenthesis <code class="computeroutput"><span class="special">()</span></code>. The preprocessor
|
|
||||||
interprets that unwrapped comma as a separation between macro parameters concluding
|
|
||||||
that a total of three (and not two) parameters are passed to the macro in the
|
|
||||||
following order:
|
|
||||||
</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span></code>
|
|
||||||
</li><li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="keyword">char</span><span class="special">></span></code>
|
|
||||||
</li><li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="number">2</span></code>
|
|
||||||
</li></ol></div><p>
|
|
||||||
Note that, differently from the compiler, the preprocessor only recognizes
|
|
||||||
round parenthesis <code class="computeroutput"><span class="special">()</span></code>. Angular
|
|
||||||
<code class="computeroutput"><span class="special"><></span></code> and squared <code class="computeroutput"><span class="special">[]</span></code> parenthesis are not recognized by the preprocessor
|
|
||||||
when parsing macro parameters.
|
|
||||||
</p></div><div class="section boost_utility_identitytype_solution" title="Solution"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="boost_utility_identitytype.solution"></a><a class="link" href="#boost_utility_identitytype.solution" title="Solution">Solution</a></h2></div></div></div><p>
|
|
||||||
In some cases, it might be possible to workaround this issue by avoiding to
|
|
||||||
pass the type expression to the macro all together. For example, in the case
|
|
||||||
above a <code class="computeroutput"><span class="keyword">typedef</span></code> could have been
|
|
||||||
used to specify the type expression with the commas outside the macro (see
|
|
||||||
also <a href="../../test/var.cpp" target="_top"><code class="literal">var.cpp</code></a>):
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">></span> <span class="identifier">map_type</span><span class="special">;</span>
|
|
||||||
<span class="identifier">VAR</span><span class="special">(</span><span class="identifier">map_type</span><span class="special">,</span> <span class="number">3</span><span class="special">);</span> <span class="comment">// OK.</span>
|
|
||||||
</pre><p>
|
|
||||||
</p><p>
|
|
||||||
When this is neither possible nor desired (e.g., see the function template
|
|
||||||
<code class="computeroutput"><span class="identifier">f</span></code> in the section below), this
|
|
||||||
library header <code class="computeroutput"><a class="link" href="#header.boost.utility.identity_type_hpp" title="Header <boost/utility/identity_type.hpp>">boost/utility/identity_type.hpp</a></code>
|
|
||||||
defines a macro <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code>
|
|
||||||
which can be used to workaround the issue while keeping the type expression
|
|
||||||
as one of the macro parameters (see also <a href="../../test/var.cpp" target="_top"><code class="literal">var.cpp</code></a>).
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">utility</span><span class="special">/</span><span class="identifier">identity_type</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
|
|
||||||
|
|
||||||
<span class="identifier">VAR</span><span class="special">(</span><span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">((</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">>)),</span> <span class="number">4</span><span class="special">);</span> <span class="comment">// OK.</span>
|
|
||||||
</pre><p>
|
|
||||||
</p><p>
|
|
||||||
The <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code> macro
|
|
||||||
expands to an expression that evaluates (at compile-time) to the specified
|
|
||||||
type. The specified type is never split into multiple macro parameters because
|
|
||||||
it is always wrapped by a set of extra round parenthesis <code class="computeroutput"><span class="special">()</span></code>.
|
|
||||||
In fact, a total of two sets of round parenthesis must be used: The parenthesis
|
|
||||||
to invoke the macro <code class="computeroutput"><span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">(...)</span></code> plus the inner parenthesis to wrap the
|
|
||||||
type passed to the macro <code class="computeroutput"><span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">((...))</span></code>.
|
|
||||||
</p><p>
|
|
||||||
This macro works on any <a href="http://www.open-std.org/JTC1/SC22/WG21/docs/standards" target="_top">C++03</a>
|
|
||||||
compiler (and it does not use <a href="http://en.wikipedia.org/wiki/Variadic_macro" target="_top">variadic
|
|
||||||
macros</a>). <sup>[<a name="boost_utility_identitytype.solution.f0" href="#ftn.boost_utility_identitytype.solution.f0" class="footnote">1</a>]</sup> The authors originally developed and tested this library using
|
|
||||||
GNU Compiler Collection (GCC) C++ 4.5.3 (with and without C++11 features enabled
|
|
||||||
<code class="computeroutput"><span class="special">-</span><span class="identifier">std</span><span class="special">=</span><span class="identifier">c</span><span class="special">++</span><span class="number">0</span><span class="identifier">x</span></code>) on Cygwin
|
|
||||||
and Miscrosoft Visual C++ (MSVC) 8.0 on Windows 7. See the library <a href="http://www.boost.org/development/tests/release/developer/utility-identity_type.html" target="_top">regressions
|
|
||||||
test results</a> for more information on supported compilers and platforms.
|
|
||||||
</p></div><div class="section boost_utility_identitytype_templates" title="Templates"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="boost_utility_identitytype.templates"></a><a class="link" href="#boost_utility_identitytype.templates" title="Templates">Templates</a></h2></div></div></div><p>
|
|
||||||
This macro must be prefixed by <code class="computeroutput"><span class="keyword">typename</span></code>
|
|
||||||
when used within templates. For example, let's program a macro that declares
|
|
||||||
a function parameter named <code class="computeroutput"><span class="identifier">arg</span></code><code class="literal"><span class="emphasis"><em>n</em></span></code>
|
|
||||||
with the specified <code class="literal"><span class="emphasis"><em>type</em></span></code> (see also
|
|
||||||
<a href="../../test/template.cpp" target="_top"><code class="literal">template.cpp</code></a>):
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">ARG</span><span class="special">(</span><span class="identifier">type</span><span class="special">,</span> <span class="identifier">n</span><span class="special">)</span> <span class="identifier">type</span> <span class="identifier">arg</span> <span class="error">#</span><span class="preprocessor"># n</span>
|
|
||||||
|
|
||||||
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
|
|
||||||
<span class="keyword">void</span> <span class="identifier">f</span><span class="special">(</span> <span class="comment">// Prefix macro with `typename` in templates.</span>
|
|
||||||
<span class="identifier">ARG</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">((</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">T</span><span class="special">>)),</span> <span class="number">1</span><span class="special">)</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"><<</span> <span class="identifier">arg1</span><span class="special">[</span><span class="number">0</span><span class="special">]</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
|
|
||||||
<span class="special">}</span>
|
|
||||||
</pre><p>
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">></span> <span class="identifier">a</span><span class="special">;</span>
|
|
||||||
<span class="identifier">a</span><span class="special">[</span><span class="number">0</span><span class="special">]</span> <span class="special">=</span> <span class="char">'a'</span><span class="special">;</span>
|
|
||||||
|
|
||||||
<span class="identifier">f</span><span class="special"><</span><span class="keyword">char</span><span class="special">>(</span><span class="identifier">a</span><span class="special">);</span> <span class="comment">// OK...</span>
|
|
||||||
<span class="comment">// f(a); // ... but error.</span>
|
|
||||||
</pre><p>
|
|
||||||
</p><p>
|
|
||||||
However, note that the template parameter <code class="computeroutput"><span class="keyword">char</span></code>
|
|
||||||
must be manually specified when invoking the function as in <code class="computeroutput"><span class="identifier">f</span><span class="special"><</span><span class="keyword">char</span><span class="special">>(</span><span class="identifier">a</span><span class="special">)</span></code>. In fact,
|
|
||||||
when the <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code>
|
|
||||||
macro is used to wrap a function template parameter, the template parameter
|
|
||||||
can no longer be automatically deduced by the compiler form the function call
|
|
||||||
as <code class="computeroutput"><span class="identifier">f</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> would
|
|
||||||
have done. <sup>[<a name="boost_utility_identitytype.templates.f0" href="#ftn.boost_utility_identitytype.templates.f0" class="footnote">2</a>]</sup> (This limitation does not apply to class templates because class
|
|
||||||
template parameters must always be explicitly specified.) In other words, without
|
|
||||||
using the <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code>
|
|
||||||
macro, C++ would normally be able to automatically deduce the function template
|
|
||||||
parameter as shown below:
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
|
|
||||||
<span class="keyword">void</span> <span class="identifier">g</span><span class="special">(</span>
|
|
||||||
<span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">arg1</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"><<</span> <span class="identifier">arg1</span><span class="special">[</span><span class="number">0</span><span class="special">]</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
|
|
||||||
<span class="special">}</span>
|
|
||||||
</pre><p>
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="identifier">g</span><span class="special"><</span><span class="keyword">char</span><span class="special">>(</span><span class="identifier">a</span><span class="special">);</span> <span class="comment">// OK...</span>
|
|
||||||
<span class="identifier">g</span><span class="special">(</span><span class="identifier">a</span><span class="special">);</span> <span class="comment">// ... and also OK.</span>
|
|
||||||
</pre><p>
|
|
||||||
</p></div><div class="section boost_utility_identitytype_abstract_types" title="Abstract Types"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="boost_utility_identitytype.abstract_types"></a><a class="link" href="#boost_utility_identitytype.abstract_types" title="Abstract Types">Abstract Types</a></h2></div></div></div><p>
|
|
||||||
On some compilers (e.g., GCC), using this macro on abstract types (i.e., classes
|
|
||||||
with one or more pure virtual functions) generates a compiler error. This can
|
|
||||||
be avoided by manipulating the type adding and removing a reference to it.
|
|
||||||
</p><p>
|
|
||||||
Let's program a macro that performs a static assertion on a <a href="http://en.wikipedia.org/wiki/Template_metaprogramming" target="_top">Template
|
|
||||||
Meta-Programming</a> (TMP) meta-function (similarly to Boost.MPL <a href="http://www.boost.org/doc/libs/1_36_0/libs/mpl/doc/refmanual/assert.html" target="_top"><code class="computeroutput"><span class="identifier">BOOST_MPL_ASSERT</span></code></a>). The <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code> macro can be used
|
|
||||||
to pass a meta-function with multiple template parameters to the assert macro
|
|
||||||
(so to handle the commas separating the template parameters). In this case,
|
|
||||||
if the meta-function is an abstract type, it needs to be manipulated adding
|
|
||||||
and removing a reference to it (see also <a href="../../test/abstract.cpp" target="_top"><code class="literal">abstract.cpp</code></a>):
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">TMP_ASSERT</span><span class="special">(</span><span class="identifier">metafunction</span><span class="special">)</span> <span class="special">\</span>
|
|
||||||
<span class="identifier">BOOST_STATIC_ASSERT</span><span class="special">(</span><span class="identifier">metafunction</span><span class="special">::</span><span class="identifier">value</span><span class="special">)</span>
|
|
||||||
|
|
||||||
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">bool</span> <span class="identifier">b</span><span class="special">></span>
|
|
||||||
<span class="keyword">struct</span> <span class="identifier">abstract</span> <span class="special">{</span>
|
|
||||||
<span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">bool</span> <span class="identifier">value</span> <span class="special">=</span> <span class="identifier">b</span><span class="special">;</span>
|
|
||||||
<span class="keyword">virtual</span> <span class="keyword">void</span> <span class="identifier">f</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="comment">// Pure virtual function.</span>
|
|
||||||
<span class="special">};</span>
|
|
||||||
|
|
||||||
<span class="identifier">TMP_ASSERT</span><span class="special">(</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">remove_reference</span><span class="special"><</span> <span class="comment">// Add and remove</span>
|
|
||||||
<span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">((</span> <span class="comment">// reference for</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">add_reference</span><span class="special"><</span> <span class="comment">// abstract type.</span>
|
|
||||||
<span class="identifier">abstract</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">true</span><span class="special">></span>
|
|
||||||
<span class="special">>::</span><span class="identifier">type</span>
|
|
||||||
<span class="special">))</span>
|
|
||||||
<span class="special">>::</span><span class="identifier">type</span>
|
|
||||||
<span class="special">);</span>
|
|
||||||
</pre><p>
|
|
||||||
</p></div><div class="section boost_utility_identitytype_annex__usage" title="Annex: Usage"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="boost_utility_identitytype.annex__usage"></a><a class="link" href="#boost_utility_identitytype.annex__usage" title="Annex: Usage">Annex: Usage</a></h2></div></div></div><p>
|
|
||||||
The <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code> macro
|
|
||||||
can be used either when calling a user-defined macro (as shown by the examples
|
|
||||||
so far), or internally when implementing a user-defined macro (as shown below).
|
|
||||||
When <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code> is
|
|
||||||
used in the implementation of the user-defined macro, the caller of the user
|
|
||||||
macro will have to specify the extra parenthesis (see also <a href="../../test/paren.cpp" target="_top"><code class="literal">paren.cpp</code></a>):
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">TMP_ASSERT_PAREN</span><span class="special">(</span><span class="identifier">parenthesized_metafunction</span><span class="special">)</span> <span class="special">\</span>
|
|
||||||
<span class="comment">/* use `BOOST_IDENTITY_TYPE` in macro definition instead of invocation */</span> <span class="special">\</span>
|
|
||||||
<span class="identifier">BOOST_STATIC_ASSERT</span><span class="special">(</span><span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">(</span><span class="identifier">parenthesized_metafunction</span><span class="special">)::</span><span class="identifier">value</span><span class="special">)</span>
|
|
||||||
|
|
||||||
<span class="preprocessor">#define</span> <span class="identifier">TMP_ASSERT</span><span class="special">(</span><span class="identifier">metafunction</span><span class="special">)</span> <span class="special">\</span>
|
|
||||||
<span class="identifier">BOOST_STATIC_ASSERT</span><span class="special">(</span><span class="identifier">metafunction</span><span class="special">::</span><span class="identifier">value</span><span class="special">)</span>
|
|
||||||
|
|
||||||
<span class="comment">// Specify only extra parenthesis `((...))`.</span>
|
|
||||||
<span class="identifier">TMP_ASSERT_PAREN</span><span class="special">((</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_const</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">></span> <span class="keyword">const</span><span class="special">>));</span>
|
|
||||||
|
|
||||||
<span class="comment">// Specify both the extra parenthesis `((...))` and `BOOST_IDENTITY_TYPE` macro.</span>
|
|
||||||
<span class="identifier">TMP_ASSERT</span><span class="special">(</span><span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">((</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_const</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">></span> <span class="keyword">const</span><span class="special">>)));</span>
|
|
||||||
</pre><p>
|
|
||||||
</p><p>
|
|
||||||
However, note that the caller will <span class="emphasis"><em>always</em></span> have to specify
|
|
||||||
the extra parenthesis even when the macro parameters contain no comma:
|
|
||||||
</p><p>
|
|
||||||
</p><pre class="programlisting"><span class="identifier">TMP_ASSERT_PAREN</span><span class="special">((</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_const</span><span class="special"><</span><span class="keyword">int</span> <span class="keyword">const</span><span class="special">>));</span> <span class="comment">// Always extra `((...))`.</span>
|
|
||||||
|
|
||||||
<span class="identifier">TMP_ASSERT</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_const</span><span class="special"><</span><span class="keyword">int</span> <span class="keyword">const</span><span class="special">>);</span> <span class="comment">// No extra `((...))` and no macro.</span>
|
|
||||||
</pre><p>
|
|
||||||
</p><p>
|
|
||||||
In some cases, using <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code>
|
|
||||||
in the implementation of the user-defined macro might provide the best syntax
|
|
||||||
for the caller. For example, this is the case for <code class="computeroutput"><span class="identifier">BOOST_MPL_ASSERT</span></code>
|
|
||||||
because the majority of template meta-programming expressions contain unwrapped
|
|
||||||
commas so it is less confusing for the user to always specify the extra parenthesis
|
|
||||||
<code class="computeroutput"><span class="special">((...))</span></code> instead of using <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code>:
|
|
||||||
</p><pre class="programlisting"><span class="identifier">BOOST_MPL_ASSERT</span><span class="special">((</span> <span class="comment">// Natural syntax.</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">and_</span><span class="special"><</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_const</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
|
|
||||||
<span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_reference</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
|
|
||||||
<span class="special">></span>
|
|
||||||
<span class="special">));</span>
|
|
||||||
</pre><p>
|
|
||||||
However, in other situations it might be preferable to not require the extra
|
|
||||||
parenthesis in the common cases and handle commas as special cases using <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code>. For example, this
|
|
||||||
is the case for <a href="http://www.boost.org/libs/local_function" target="_top"><code class="computeroutput"><span class="identifier">BOOST_LOCAL_FUNCTION</span></code></a> for which always
|
|
||||||
requiring the extra parenthesis <code class="computeroutput"><span class="special">((...))</span></code>
|
|
||||||
around the types would lead to an unnatural syntax for the local function signature:
|
|
||||||
</p><pre class="programlisting"><span class="keyword">int</span> <span class="identifier">BOOST_LOCAL_FUNCTION</span><span class="special">(</span> <span class="special">((</span><span class="keyword">int</span><span class="special">&))</span> <span class="identifier">x</span><span class="special">,</span> <span class="special">((</span><span class="keyword">int</span><span class="special">&))</span> <span class="identifier">y</span> <span class="special">)</span> <span class="special">{</span> <span class="comment">// Unnatural syntax.</span>
|
|
||||||
<span class="keyword">return</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="identifier">BOOST_LOCAL_FUNCTION_NAME</span><span class="special">(</span><span class="identifier">add</span><span class="special">)</span>
|
|
||||||
</pre><p>
|
|
||||||
Instead requiring the user to specify <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code>
|
|
||||||
only when needed allows for the more natural syntax <code class="computeroutput"><span class="identifier">BOOST_LOCAL_FUNCTION</span><span class="special">(</span><span class="keyword">int</span><span class="special">&</span>
|
|
||||||
<span class="identifier">x</span><span class="special">,</span> <span class="keyword">int</span><span class="special">&</span> <span class="identifier">y</span><span class="special">)</span></code> in the common cases when the parameter types
|
|
||||||
contain no comma (while still allowing to specify parameter types with commas
|
|
||||||
as special cases using <code class="computeroutput"><span class="identifier">BOOST_LOCAL_FUNCTION</span><span class="special">(</span><span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">((</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">>))&</span>
|
|
||||||
<span class="identifier">x</span><span class="special">,</span> <span class="keyword">int</span><span class="special">&</span> <span class="identifier">y</span><span class="special">)</span></code>).
|
|
||||||
</p></div><div class="section boost_utility_identitytype_annex__implementation" title="Annex: Implementation"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="boost_utility_identitytype.annex__implementation"></a><a class="link" href="#boost_utility_identitytype.annex__implementation" title="Annex: Implementation">Annex:
|
|
||||||
Implementation</a></h2></div></div></div><p>
|
|
||||||
The implementation of this library macro is equivalent to the following: <sup>[<a name="boost_utility_identitytype.annex__implementation.f0" href="#ftn.boost_utility_identitytype.annex__implementation.f0" class="footnote">3</a>]</sup>
|
|
||||||
</p><pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">type_traits</span><span class="special">/</span><span class="identifier">function_traits</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
|
|
||||||
|
|
||||||
<span class="preprocessor">#define</span> <span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">(</span><span class="identifier">parenthesized_type</span><span class="special">)</span> <span class="special">\</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">function_traits</span><span class="special"><</span><span class="keyword">void</span> <span class="identifier">parenthesized_type</span><span class="special">>::</span><span class="identifier">arg1_type</span>
|
|
||||||
</pre><p>
|
|
||||||
Essentially, the type is wrapped between round parenthesis <code class="computeroutput"><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span>
|
|
||||||
<span class="keyword">char</span><span class="special">>)</span></code>
|
|
||||||
so it can be passed as a single macro parameter even if it contains commas.
|
|
||||||
Then the parenthesized type is transformed into the type of a function returning
|
|
||||||
<code class="computeroutput"><span class="keyword">void</span></code> and with the specified type
|
|
||||||
as the type of the first and only argument <code class="computeroutput"><span class="keyword">void</span>
|
|
||||||
<span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">>)</span></code>. Finally, the type of the first argument
|
|
||||||
<code class="computeroutput"><span class="identifier">arg1_type</span></code> is extracted at compile-time
|
|
||||||
using the <code class="computeroutput"><span class="identifier">function_traits</span></code> meta-function
|
|
||||||
therefore obtaining the original type from the parenthesized type (effectively
|
|
||||||
stripping the extra parenthesis from around the specified type).
|
|
||||||
</p></div><div class="section reference" title="Reference"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="reference"></a>Reference</h2></div></div></div><div class="section header_boost_utility_identity_type_hpp" title="Header <boost/utility/identity_type.hpp>"><div class="titlepage"><div><div><h3 class="title"><a name="header.boost.utility.identity_type_hpp"></a>Header <<a href="../../../../../boost/utility/identity_type.hpp" target="_top">boost/utility/identity_type.hpp</a>></h3></div></div></div><p>Wrap type expressions with round parenthesis so they can be passed to macros even if they contain commas. </p><pre class="synopsis">
|
|
||||||
|
|
||||||
<a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a>(parenthesized_type)</pre><div class="refentry" title="Macro BOOST_IDENTITY_TYPE"><a name="BOOST_IDENTITY_TYPE"></a><div class="titlepage"></div><div class="refnamediv"><h2><span class="refentrytitle">Macro BOOST_IDENTITY_TYPE</span></h2><p>BOOST_IDENTITY_TYPE — This macro allows to wrap the specified type expression within extra round parenthesis so the type can be passed as a single macro parameter even if it contains commas (not already wrapped within round parenthesis). </p></div><h2 class="refsynopsisdiv-title">Synopsis</h2><div class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="#header.boost.utility.identity_type_hpp" title="Header <boost/utility/identity_type.hpp>">boost/utility/identity_type.hpp</a>>
|
|
||||||
|
|
||||||
</span>BOOST_IDENTITY_TYPE(parenthesized_type)</pre></div><div class="refsect1" title="Description"><a name="id554262"></a><h2>Description</h2><p><span class="bold"><strong>Parameters:</strong></span> </p><div class="informaltable"><table class="table"><colgroup><col><col></colgroup><tbody><tr><td><span class="bold"><strong><code class="computeroutput">parenthesized_type</code></strong></span></td><td>The type expression to be passed as macro parameter wrapped by a single set of round parenthesis <code class="computeroutput">(...)</code>. This type expression can contain an arbitrary number of commas. </td></tr></tbody></table></div><p>
|
|
||||||
</p><p>This macro works on any C++03 compiler (it does not use variadic macros).</p><p>This macro must be prefixed by <code class="computeroutput">typename</code> when used within templates. Note that the compiler will not be able to automatically determine function template parameters when they are wrapped with this macro (these parameters need to be explicitly specified when calling the function template).</p><p>On some compilers (like GCC), using this macro on abstract types requires to add and remove a reference to the specified type. </p></div></div></div></div><div class="footnotes"><br><hr width="100" align="left"><div class="footnote"><p><sup>[<a id="ftn.boost_utility_identitytype.solution.f0" href="#boost_utility_identitytype.solution.f0" class="para">1</a>] </sup>
|
|
||||||
Using variadic macros, it would be possible to require a single set of extra
|
|
||||||
parenthesis <code class="computeroutput"><span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">(</span></code><code class="literal"><span class="emphasis"><em>type</em></span></code><code class="computeroutput"><span class="special">)</span></code> instead of two <code class="computeroutput"><span class="identifier">BOOST_IDENTITY_TYPE</span><span class="special">((</span></code><code class="literal"><span class="emphasis"><em>type</em></span></code><code class="computeroutput"><span class="special">))</span></code> but variadic macros are not part of C++03
|
|
||||||
(even if nowadays they are supported by most modern compilers and they are
|
|
||||||
also part of C++11).
|
|
||||||
</p></div><div class="footnote"><p><sup>[<a id="ftn.boost_utility_identitytype.templates.f0" href="#boost_utility_identitytype.templates.f0" class="para">2</a>] </sup>
|
|
||||||
This is because the implementation of <code class="computeroutput"><a class="link" href="#BOOST_IDENTITY_TYPE" title="Macro BOOST_IDENTITY_TYPE">BOOST_IDENTITY_TYPE</a></code>
|
|
||||||
wraps the specified type within a meta-function.
|
|
||||||
</p></div><div class="footnote"><p><sup>[<a id="ftn.boost_utility_identitytype.annex__implementation.f0" href="#boost_utility_identitytype.annex__implementation.f0" class="para">3</a>] </sup>
|
|
||||||
There is absolutely no guarantee that the macro is actually implemented using
|
|
||||||
the code listed in this documentation. The listed code is for explanatory
|
|
||||||
purposes only.
|
|
||||||
</p></div></div></div></body></html>
|
|
||||||
@@ -1,165 +0,0 @@
|
|||||||
|
|
||||||
[/ Copyright (C) 2009-2012 Lorenzo Caminiti ]
|
|
||||||
[/ Distributed under the Boost Software License, Version 1.0 ]
|
|
||||||
[/ (see accompanying file LICENSE_1_0.txt or a copy at ]
|
|
||||||
[/ http://www.boost.org/LICENSE_1_0.txt) ]
|
|
||||||
[/ Home at http://www.boost.org/libs/utility/identity_type ]
|
|
||||||
|
|
||||||
[library Boost.Utility/IdentityType
|
|
||||||
[quickbook 1.5]
|
|
||||||
[version 1.0.0]
|
|
||||||
[copyright 2009-2012 Lorenzo Caminiti]
|
|
||||||
[purpose wraps types with round parenthesis]
|
|
||||||
[license
|
|
||||||
Distributed under the Boost Software License, Version 1.0
|
|
||||||
(see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
[@http://www.boost.org/LICENSE_1_0.txt])
|
|
||||||
]
|
|
||||||
[authors [Caminiti <email>lorcaminiti@gmail.com</email>, Lorenzo]]
|
|
||||||
[category Utilities]
|
|
||||||
]
|
|
||||||
|
|
||||||
This library allows to wrap types within round parenthesis so they can always be passed as macro parameters.
|
|
||||||
|
|
||||||
[import ../test/var_error.cpp]
|
|
||||||
[import ../test/var.cpp]
|
|
||||||
[import ../test/template.cpp]
|
|
||||||
[import ../test/abstract.cpp]
|
|
||||||
[import ../test/paren.cpp]
|
|
||||||
|
|
||||||
[section Motivation]
|
|
||||||
|
|
||||||
Consider the following macro which declares a variable named `var`[^['n]] with the specified [^['type]] (see also [@../../test/var_error.cpp =var_error.cpp=]):
|
|
||||||
|
|
||||||
[var_error]
|
|
||||||
|
|
||||||
The first macro invocation works correctly declaring a variable named `var1` of type `int`.
|
|
||||||
However, the second macro invocation fails generating a preprocessor error similar to the following:
|
|
||||||
|
|
||||||
[pre
|
|
||||||
error: macro "VAR" passed 3 arguments, but takes just 2
|
|
||||||
]
|
|
||||||
|
|
||||||
That is because the `std::map` type passed as the first macro parameter contains a comma `,` not wrapped by round parenthesis `()`.
|
|
||||||
The preprocessor interprets that unwrapped comma as a separation between macro parameters concluding that a total of three (and not two) parameters are passed to the macro in the following order:
|
|
||||||
|
|
||||||
# `std::map<int`
|
|
||||||
# `char>`
|
|
||||||
# `2`
|
|
||||||
|
|
||||||
Note that, differently from the compiler, the preprocessor only recognizes round parenthesis `()`.
|
|
||||||
Angular `<>` and squared `[]` parenthesis are not recognized by the preprocessor when parsing macro parameters.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Solution]
|
|
||||||
|
|
||||||
In some cases, it might be possible to workaround this issue by avoiding to pass the type expression to the macro all together.
|
|
||||||
For example, in the case above a `typedef` could have been used to specify the type expression with the commas outside the macro (see also [@../../test/var.cpp =var.cpp=]):
|
|
||||||
|
|
||||||
[var_typedef]
|
|
||||||
|
|
||||||
When this is neither possible nor desired (e.g., see the function template `f` in the section below), this library header [headerref boost/utility/identity_type.hpp] defines a macro [macroref BOOST_IDENTITY_TYPE] which can be used to workaround the issue while keeping the type expression as one of the macro parameters (see also [@../../test/var.cpp =var.cpp=]).
|
|
||||||
|
|
||||||
[var_ok]
|
|
||||||
|
|
||||||
The [macroref BOOST_IDENTITY_TYPE] macro expands to an expression that evaluates (at compile-time) to the specified type.
|
|
||||||
The specified type is never split into multiple macro parameters because it is always wrapped by a set of extra round parenthesis `()`.
|
|
||||||
In fact, a total of two sets of round parenthesis must be used: The parenthesis to invoke the macro `BOOST_IDENTITY_TYPE(...)` plus the inner parenthesis to wrap the type passed to the macro `BOOST_IDENTITY_TYPE((...))`.
|
|
||||||
|
|
||||||
This macro works on any [@http://www.open-std.org/JTC1/SC22/WG21/docs/standards C++03] compiler (and it does not use [@http://en.wikipedia.org/wiki/Variadic_macro variadic macros]).
|
|
||||||
[footnote
|
|
||||||
Using variadic macros, it would be possible to require a single set of extra parenthesis `BOOST_IDENTITY_TYPE(`[^['type]]`)` instead of two `BOOST_IDENTITY_TYPE((`[^['type]]`))` but variadic macros are not part of C++03 (even if nowadays they are supported by most modern compilers and they are also part of C++11).
|
|
||||||
]
|
|
||||||
The authors originally developed and tested this library using GNU Compiler Collection (GCC) C++ 4.5.3 (with and without C++11 features enabled `-std=c++0x`) on Cygwin and Miscrosoft Visual C++ (MSVC) 8.0 on Windows 7.
|
|
||||||
See the library [@http://www.boost.org/development/tests/release/developer/utility-identity_type.html regressions test results] for more information on supported compilers and platforms.
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Templates]
|
|
||||||
|
|
||||||
This macro must be prefixed by `typename` when used within templates.
|
|
||||||
For example, let's program a macro that declares a function parameter named `arg`[^['n]] with the specified [^['type]] (see also [@../../test/template.cpp =template.cpp=]):
|
|
||||||
|
|
||||||
[template_f_decl]
|
|
||||||
[template_f_call]
|
|
||||||
|
|
||||||
However, note that the template parameter `char` must be manually specified when invoking the function as in `f<char>(a)`.
|
|
||||||
In fact, when the [macroref BOOST_IDENTITY_TYPE] macro is used to wrap a function template parameter, the template parameter can no longer be automatically deduced by the compiler form the function call as `f(a)` would have done.
|
|
||||||
[footnote
|
|
||||||
This is because the implementation of [macroref BOOST_IDENTITY_TYPE] wraps the specified type within a meta-function.
|
|
||||||
]
|
|
||||||
(This limitation does not apply to class templates because class template parameters must always be explicitly specified.)
|
|
||||||
In other words, without using the [macroref BOOST_IDENTITY_TYPE] macro, C++ would normally be able to automatically deduce the function template parameter as shown below:
|
|
||||||
|
|
||||||
[template_g_decl]
|
|
||||||
[template_g_call]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Abstract Types]
|
|
||||||
|
|
||||||
On some compilers (e.g., GCC), using this macro on abstract types (i.e., classes with one or more pure virtual functions) generates a compiler error.
|
|
||||||
This can be avoided by manipulating the type adding and removing a reference to it.
|
|
||||||
|
|
||||||
Let's program a macro that performs a static assertion on a [@http://en.wikipedia.org/wiki/Template_metaprogramming Template Meta-Programming] (TMP) meta-function (similarly to Boost.MPL [@http://www.boost.org/doc/libs/1_36_0/libs/mpl/doc/refmanual/assert.html `BOOST_MPL_ASSERT`]).
|
|
||||||
The [macroref BOOST_IDENTITY_TYPE] macro can be used to pass a meta-function with multiple template parameters to the assert macro (so to handle the commas separating the template parameters).
|
|
||||||
In this case, if the meta-function is an abstract type, it needs to be manipulated adding and removing a reference to it (see also [@../../test/abstract.cpp =abstract.cpp=]):
|
|
||||||
|
|
||||||
[abstract]
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Annex: Usage]
|
|
||||||
|
|
||||||
The [macroref BOOST_IDENTITY_TYPE] macro can be used either when calling a user-defined macro (as shown by the examples so far), or internally when implementing a user-defined macro (as shown below).
|
|
||||||
When [macroref BOOST_IDENTITY_TYPE] is used in the implementation of the user-defined macro, the caller of the user macro will have to specify the extra parenthesis (see also [@../../test/paren.cpp =paren.cpp=]):
|
|
||||||
|
|
||||||
[paren]
|
|
||||||
|
|
||||||
However, note that the caller will /always/ have to specify the extra parenthesis even when the macro parameters contain no comma:
|
|
||||||
|
|
||||||
[paren_always]
|
|
||||||
|
|
||||||
In some cases, using [macroref BOOST_IDENTITY_TYPE] in the implementation of the user-defined macro might provide the best syntax for the caller.
|
|
||||||
For example, this is the case for `BOOST_MPL_ASSERT` because the majority of template meta-programming expressions contain unwrapped commas so it is less confusing for the user to always specify the extra parenthesis `((...))` instead of using [macroref BOOST_IDENTITY_TYPE]:
|
|
||||||
|
|
||||||
BOOST_MPL_ASSERT(( // Natural syntax.
|
|
||||||
boost::mpl::and_<
|
|
||||||
boost::is_const<T>
|
|
||||||
, boost::is_reference<T>
|
|
||||||
>
|
|
||||||
));
|
|
||||||
|
|
||||||
However, in other situations it might be preferable to not require the extra parenthesis in the common cases and handle commas as special cases using [macroref BOOST_IDENTITY_TYPE].
|
|
||||||
For example, this is the case for [@http://www.boost.org/libs/local_function `BOOST_LOCAL_FUNCTION`] for which always requiring the extra parenthesis `((...))` around the types would lead to an unnatural syntax for the local function signature:
|
|
||||||
|
|
||||||
int BOOST_LOCAL_FUNCTION( ((int&)) x, ((int&)) y ) { // Unnatural syntax.
|
|
||||||
return x + y;
|
|
||||||
} BOOST_LOCAL_FUNCTION_NAME(add)
|
|
||||||
|
|
||||||
Instead requiring the user to specify [macroref BOOST_IDENTITY_TYPE] only when needed allows for the more natural syntax `BOOST_LOCAL_FUNCTION(int& x, int& y)` in the common cases when the parameter types contain no comma (while still allowing to specify parameter types with commas as special cases using `BOOST_LOCAL_FUNCTION(BOOST_IDENTITY_TYPE((std::map<int, char>))& x, int& y)`).
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[section Annex: Implementation]
|
|
||||||
|
|
||||||
The implementation of this library macro is equivalent to the following:
|
|
||||||
[footnote
|
|
||||||
There is absolutely no guarantee that the macro is actually implemented using the code listed in this documentation.
|
|
||||||
The listed code is for explanatory purposes only.
|
|
||||||
]
|
|
||||||
|
|
||||||
#include <boost/type_traits/function_traits.hpp>
|
|
||||||
|
|
||||||
#define BOOST_IDENTITY_TYPE(parenthesized_type) \
|
|
||||||
boost::function_traits<void parenthesized_type>::arg1_type
|
|
||||||
|
|
||||||
Essentially, the type is wrapped between round parenthesis `(std::map<int, char>)` so it can be passed as a single macro parameter even if it contains commas.
|
|
||||||
Then the parenthesized type is transformed into the type of a function returning `void` and with the specified type as the type of the first and only argument `void (std::map<int, char>)`.
|
|
||||||
Finally, the type of the first argument `arg1_type` is extracted at compile-time using the `function_traits` meta-function therefore obtaining the original type from the parenthesized type (effectively stripping the extra parenthesis from around the specified type).
|
|
||||||
|
|
||||||
[endsect]
|
|
||||||
|
|
||||||
[xinclude reference.xml]
|
|
||||||
|
|
||||||
@@ -1,15 +0,0 @@
|
|||||||
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
||||||
<html>
|
|
||||||
<head>
|
|
||||||
<meta http-equiv="refresh" content="0; URL=doc/html/index.html">
|
|
||||||
</head>
|
|
||||||
<body>
|
|
||||||
Automatic redirection failed, click this
|
|
||||||
<a href="doc/html/index.html">link</a> <hr>
|
|
||||||
<p>Copyright © Lorenzo Caminiti, 2009-2012</p>
|
|
||||||
<p>Distributed under the Boost Software License, Version 1.0 (see
|
|
||||||
accompanying file <a href="../../../LICENSE_1_0.txt">
|
|
||||||
LICENSE_1_0.txt</a> or a copy at
|
|
||||||
<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
@@ -1,16 +0,0 @@
|
|||||||
|
|
||||||
# Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
# Distributed under the Boost Software License, Version 1.0
|
|
||||||
# (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
# http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
# Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
import testing ;
|
|
||||||
|
|
||||||
compile-fail var_error.cpp ;
|
|
||||||
run var.cpp ;
|
|
||||||
run template.cpp ;
|
|
||||||
run abstract.cpp ;
|
|
||||||
run noncopyable.cpp ;
|
|
||||||
run paren.cpp ;
|
|
||||||
|
|
||||||
@@ -1,35 +0,0 @@
|
|||||||
|
|
||||||
// Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
// Distributed under the Boost Software License, Version 1.0
|
|
||||||
// (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
// Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
#include <boost/utility/identity_type.hpp>
|
|
||||||
#include <boost/static_assert.hpp>
|
|
||||||
#include <boost/type_traits/add_reference.hpp>
|
|
||||||
#include <boost/type_traits/remove_reference.hpp>
|
|
||||||
|
|
||||||
//[abstract
|
|
||||||
#define TMP_ASSERT(metafunction) \
|
|
||||||
BOOST_STATIC_ASSERT(metafunction::value)
|
|
||||||
|
|
||||||
template<typename T, bool b>
|
|
||||||
struct abstract {
|
|
||||||
static const bool value = b;
|
|
||||||
virtual void f(T const& x) = 0; // Pure virtual function.
|
|
||||||
};
|
|
||||||
|
|
||||||
TMP_ASSERT(
|
|
||||||
boost::remove_reference< // Add and remove
|
|
||||||
BOOST_IDENTITY_TYPE(( // reference for
|
|
||||||
boost::add_reference< // abstract type.
|
|
||||||
abstract<int, true>
|
|
||||||
>::type
|
|
||||||
))
|
|
||||||
>::type
|
|
||||||
);
|
|
||||||
//]
|
|
||||||
|
|
||||||
int main() { return 0; }
|
|
||||||
|
|
||||||
@@ -1,25 +0,0 @@
|
|||||||
|
|
||||||
// Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
// Distributed under the Boost Software License, Version 1.0
|
|
||||||
// (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
// Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
#include <boost/utility/identity_type.hpp>
|
|
||||||
#include <boost/static_assert.hpp>
|
|
||||||
#include <boost/noncopyable.hpp>
|
|
||||||
|
|
||||||
//[noncopyable
|
|
||||||
#define TMP_ASSERT(metafunction) \
|
|
||||||
BOOST_STATIC_ASSERT(metafunction::value)
|
|
||||||
|
|
||||||
template<typename T, T init>
|
|
||||||
struct noncopyable : boost::noncopyable {
|
|
||||||
static const T value = init;
|
|
||||||
};
|
|
||||||
|
|
||||||
TMP_ASSERT(BOOST_IDENTITY_TYPE((noncopyable<bool, true>)));
|
|
||||||
//]
|
|
||||||
|
|
||||||
int main() { return 0; }
|
|
||||||
|
|
||||||
@@ -1,35 +0,0 @@
|
|||||||
|
|
||||||
// Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
// Distributed under the Boost Software License, Version 1.0
|
|
||||||
// (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
// Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
#include <boost/utility/identity_type.hpp>
|
|
||||||
#include <boost/static_assert.hpp>
|
|
||||||
#include <boost/type_traits/is_const.hpp>
|
|
||||||
#include <map>
|
|
||||||
|
|
||||||
//[paren
|
|
||||||
#define TMP_ASSERT_PAREN(parenthesized_metafunction) \
|
|
||||||
/* use `BOOST_IDENTITY_TYPE` in macro definition instead of invocation */ \
|
|
||||||
BOOST_STATIC_ASSERT(BOOST_IDENTITY_TYPE(parenthesized_metafunction)::value)
|
|
||||||
|
|
||||||
#define TMP_ASSERT(metafunction) \
|
|
||||||
BOOST_STATIC_ASSERT(metafunction::value)
|
|
||||||
|
|
||||||
// Specify only extra parenthesis `((...))`.
|
|
||||||
TMP_ASSERT_PAREN((boost::is_const<std::map<int, char> const>));
|
|
||||||
|
|
||||||
// Specify both the extra parenthesis `((...))` and `BOOST_IDENTITY_TYPE` macro.
|
|
||||||
TMP_ASSERT(BOOST_IDENTITY_TYPE((boost::is_const<std::map<int, char> const>)));
|
|
||||||
//]
|
|
||||||
|
|
||||||
//[paren_always
|
|
||||||
TMP_ASSERT_PAREN((boost::is_const<int const>)); // Always extra `((...))`.
|
|
||||||
|
|
||||||
TMP_ASSERT(boost::is_const<int const>); // No extra `((...))` and no macro.
|
|
||||||
//]
|
|
||||||
|
|
||||||
int main() { return 0; }
|
|
||||||
|
|
||||||
@@ -1,48 +0,0 @@
|
|||||||
|
|
||||||
// Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
// Distributed under the Boost Software License, Version 1.0
|
|
||||||
// (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
// Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
#include <boost/utility/identity_type.hpp>
|
|
||||||
#include <map>
|
|
||||||
#include <iostream>
|
|
||||||
|
|
||||||
//[template_f_decl
|
|
||||||
#define ARG(type, n) type arg ## n
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
void f( // Prefix macro with `typename` in templates.
|
|
||||||
ARG(typename BOOST_IDENTITY_TYPE((std::map<int, T>)), 1)
|
|
||||||
) {
|
|
||||||
std::cout << arg1[0] << std::endl;
|
|
||||||
}
|
|
||||||
//]
|
|
||||||
|
|
||||||
//[template_g_decl
|
|
||||||
template<typename T>
|
|
||||||
void g(
|
|
||||||
std::map<int, T> arg1
|
|
||||||
) {
|
|
||||||
std::cout << arg1[0] << std::endl;
|
|
||||||
}
|
|
||||||
//]
|
|
||||||
|
|
||||||
int main() {
|
|
||||||
//[template_f_call
|
|
||||||
std::map<int, char> a;
|
|
||||||
a[0] = 'a';
|
|
||||||
|
|
||||||
f<char>(a); // OK...
|
|
||||||
// f(a); // ... but error.
|
|
||||||
//]
|
|
||||||
|
|
||||||
//[template_g_call
|
|
||||||
g<char>(a); // OK...
|
|
||||||
g(a); // ... and also OK.
|
|
||||||
//]
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
@@ -1,26 +0,0 @@
|
|||||||
|
|
||||||
// Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
// Distributed under the Boost Software License, Version 1.0
|
|
||||||
// (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
// Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
#include <map>
|
|
||||||
|
|
||||||
#define VAR(type, n) type var ## n
|
|
||||||
|
|
||||||
VAR(int, 1); // OK.
|
|
||||||
|
|
||||||
//[var_typedef
|
|
||||||
typedef std::map<int, char> map_type;
|
|
||||||
VAR(map_type, 3); // OK.
|
|
||||||
//]
|
|
||||||
|
|
||||||
//[var_ok
|
|
||||||
#include <boost/utility/identity_type.hpp>
|
|
||||||
|
|
||||||
VAR(BOOST_IDENTITY_TYPE((std::map<int, char>)), 4); // OK.
|
|
||||||
//]
|
|
||||||
|
|
||||||
int main() { return 0; }
|
|
||||||
|
|
||||||
@@ -1,18 +0,0 @@
|
|||||||
|
|
||||||
// Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
// Distributed under the Boost Software License, Version 1.0
|
|
||||||
// (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
// Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
#include <map>
|
|
||||||
|
|
||||||
//[var_error
|
|
||||||
#define VAR(type, n) type var ## n
|
|
||||||
|
|
||||||
VAR(int, 1); // OK.
|
|
||||||
VAR(std::map<int, char>, 2); // Error.
|
|
||||||
//]
|
|
||||||
|
|
||||||
int main() { return 0; }
|
|
||||||
|
|
||||||
@@ -1,19 +1,296 @@
|
|||||||
<html>
|
<!DOCTYPE HTML PUBLIC "-//SoftQuad Software//DTD HoTMetaL PRO 5.0::19981217::extensions to HTML 4.0//EN" "hmpro5.dtd">
|
||||||
<head>
|
|
||||||
<title>Boost.Utility</title>
|
<HTML>
|
||||||
<meta http-equiv="refresh" content="0; URL=./doc/html/index.html">
|
|
||||||
</head>
|
<HEAD>
|
||||||
<body>
|
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=windows-1252">
|
||||||
Automatic redirection failed, please go to
|
<TITLE>In_place_factory Documentation</TITLE>
|
||||||
<a href="./doc/html/utility/utilities/in_place_factory.html">./doc/html/utility/utilities/in_place_factory.html</a>
|
</HEAD>
|
||||||
|
|
||||||
|
<BODY BGCOLOR="#FFFFFF" TEXT="#000000" LINK="#0000FF" VLINK="#800080">
|
||||||
|
<H2 align="left"><IMG SRC="../../boost.png" WIDTH="276" HEIGHT="86"></H2>
|
||||||
|
|
||||||
|
<blockquote>
|
||||||
|
<blockquote>
|
||||||
|
<blockquote>
|
||||||
|
<blockquote>
|
||||||
|
<blockquote>
|
||||||
|
<blockquote>
|
||||||
|
<H2 align="left">Header <<A
|
||||||
|
HREF="../../boost/utility/in_place_factory.hpp">boost/utility/in_place_factory.hpp</A>> </H2>
|
||||||
|
|
||||||
|
<H2 align="left">Header <<A
|
||||||
|
HREF="../../boost/utility/typed_in_place_factory.hpp">boost/utility/typed_in_place_factory.hpp</A>> </H2>
|
||||||
|
|
||||||
|
</blockquote>
|
||||||
|
</blockquote>
|
||||||
|
</blockquote>
|
||||||
|
</blockquote>
|
||||||
|
</blockquote>
|
||||||
|
</blockquote>
|
||||||
|
<p> </p>
|
||||||
|
|
||||||
|
<H2>Contents</H2>
|
||||||
|
<DL CLASS="page-index">
|
||||||
|
<DT><A HREF="#mot">Motivation</A></DT>
|
||||||
|
<DT><A HREF="#framework">Framework</A></DT>
|
||||||
|
<DT><A HREF="#specification">Specification</A></DT>
|
||||||
|
<DT><A HREF="#container-usage">Container-side Usage</A></DT>
|
||||||
|
<DT><A HREF="#user-usage">User-side Usage</A></DT>
|
||||||
|
</DL>
|
||||||
|
|
||||||
|
<HR>
|
||||||
|
|
||||||
|
<H2><A NAME="mot"></A>Motivation</H2>
|
||||||
|
|
||||||
|
<p>Suppose we have a class</p>
|
||||||
|
<pre>struct X
|
||||||
|
{
|
||||||
|
X ( int, std:::string ) ;
|
||||||
|
} ;</pre>
|
||||||
|
<p>And a container for it which supports an empty state (that is, which can contain zero objects):</p>
|
||||||
|
<pre>struct C
|
||||||
|
{
|
||||||
|
C() : contained_(0) {}
|
||||||
|
~C() { delete contained_ ; }
|
||||||
|
X* contained_ ;
|
||||||
|
} ;</pre>
|
||||||
|
<p>A container designed to support an empty state typically doesn't require the contained type to be DefaultConstructible,
|
||||||
|
but it typically requires it to be CopyConstructible as a mechanism to
|
||||||
|
initialize the object to store:</p>
|
||||||
|
<pre>struct C
|
||||||
|
{
|
||||||
|
C() : contained_(0) {}
|
||||||
|
C ( X const& v ) : contained_ ( new X(v) ) {}
|
||||||
|
~C() { delete contained_ ; }
|
||||||
|
X* contained_ ;
|
||||||
|
} ;</pre>
|
||||||
|
<p>There is a subtle problem with this: since the mechanism used to initialize the stored object is copy construction,
|
||||||
|
there must exist a previously constructed source object to copy from. This
|
||||||
|
object is likely to be temporary and serve no purpose besides being the source</p>
|
||||||
|
<pre>void foo()
|
||||||
|
{
|
||||||
|
// Temporary object created.
|
||||||
|
C c( X(123,"hello") ) ;
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
<p>A solution to this problem is to support direct construction of the contained
|
||||||
|
object right in the container's storage.<br>
|
||||||
|
In this scheme, the user supplies the arguments for the X constructor
|
||||||
|
directly to the container:</p>
|
||||||
|
<pre>struct C
|
||||||
|
{
|
||||||
|
C() : contained_(0) {}
|
||||||
|
C ( X const& v ) : contained_ ( new X(v) ) {}
|
||||||
|
C ( int a0, std::string a1 ) : contained_ ( new X(a0,a1) ) {}
|
||||||
|
~C() { delete contained_ ; }
|
||||||
|
X* contained_ ;
|
||||||
|
} ;</pre>
|
||||||
|
<pre>void foo()
|
||||||
|
{
|
||||||
|
// Wrapped object constructed in-place
|
||||||
|
// No temporary created.
|
||||||
|
C c(123,"hello") ;
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
<p>Clearly, this solution doesn't scale well since the container must duplicate all the constructor overloads from the contained type
|
||||||
|
(at least all those which are to be supported directly in the container).</p>
|
||||||
|
|
||||||
|
<H2><A NAME="framework"></A>Framework</H2>
|
||||||
|
<p>
|
||||||
|
This library proposes a framework to allow some containers to directly contruct contained objects in-place without requiring
|
||||||
|
the entire set of constructor overloads ftom the contained type. It also allows the container to remove the CopyConstuctible
|
||||||
|
requirement from the contained type since objects can be directly constructed in-place without need of a copy.<br>
|
||||||
|
The only requirement on the container is that it must provide proper storage (that is, correctly aligned and sized).
|
||||||
|
Naturally, the container will typically support uninitialized storage to avoid the in-place construction to override
|
||||||
|
a fully-constructed object (as this would defeat the purpose of in-place construction)
|
||||||
|
</p>
|
||||||
|
<p>For this purpose, the framework provides two families of classes collectively called: InPlaceFactories and TypedInPlaceFactories.<br>
|
||||||
|
Essentially, these classes hold a sequence of actual parameters and a method to contruct an object in place using these parameters.
|
||||||
|
Each member of the family differs only in the number (and type) of the parameter list. The first family
|
||||||
|
takes the type of the object to construct directly in method provided for that
|
||||||
|
purpose, whereas the second family incorporates that type in the factory class
|
||||||
|
itself..</p>
|
||||||
|
<p>From the container POV, using the framework amounts to calling the factory's method to contruct the object in place.
|
||||||
|
From the user POV, it amounts to creating the right factory object to hold the parameters and pass it to the container.<br>
|
||||||
|
The following simplified example shows the basic idea. A complete example follows the formal specification of the framework:</p>
|
||||||
|
<pre>struct C
|
||||||
|
{
|
||||||
|
template<class InPlaceFactory>
|
||||||
|
C ( InPlaceFactory const& aFactoty )
|
||||||
|
:
|
||||||
|
contained_ ( uninitialized_storage() )
|
||||||
|
{
|
||||||
|
aFactory.template apply<X>(contained_);
|
||||||
|
}
|
||||||
|
|
||||||
|
~C()
|
||||||
|
{
|
||||||
|
contained_ -> X::~X();
|
||||||
|
delete[] contained_ ;
|
||||||
|
}
|
||||||
|
|
||||||
|
char* uninitialized_storage() { return new char[sizeof(X)] ; }
|
||||||
|
|
||||||
|
char* contained_ ;
|
||||||
|
} ;
|
||||||
|
|
||||||
|
void foo()
|
||||||
|
{
|
||||||
|
C c( in_place(123,"hello") ) ;
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
|
||||||
|
<HR>
|
||||||
|
|
||||||
|
<H2><A NAME="specification">Specification</A></H2>
|
||||||
|
|
||||||
|
<p>The following is the first member of the family of 'in_place_factory' classes, along with its corresponding helper template function.
|
||||||
|
The rest of the family varies only in the number and type of template (and constructor) parameters.</p>
|
||||||
|
<PRE>namespace boost {
|
||||||
|
|
||||||
|
struct in_place_factory_base {} ;
|
||||||
|
|
||||||
|
template<class A0>
|
||||||
|
class in_place_factory : public in_place_factory_base
|
||||||
|
{
|
||||||
|
public:</PRE>
|
||||||
|
|
||||||
|
<PRE> in_place_factory ( A0 const& a0 ) : m_a0(a0) {}
|
||||||
|
|
||||||
|
template< class T >
|
||||||
|
void apply ( void* address ) const
|
||||||
|
{
|
||||||
|
new (address) T(m_a0);
|
||||||
|
}
|
||||||
|
|
||||||
|
private:</PRE>
|
||||||
|
|
||||||
|
<PRE> A0 const& m_a0 ;
|
||||||
|
} ;
|
||||||
|
|
||||||
|
template<class A0>
|
||||||
|
in_place_factory<A0> in_place ( A0 const& a0 )
|
||||||
|
{
|
||||||
|
return in_place_factory<A0>(a0);
|
||||||
|
}
|
||||||
|
</PRE>
|
||||||
|
|
||||||
|
<p>Similarly, the following is the first member of the family of 'typed_in_place_factory' classes, along with its corresponding
|
||||||
|
helper template function. The rest of the family varies only in the number and type of template (and constructor) parameters.</p>
|
||||||
|
<PRE>namespace boost {
|
||||||
|
|
||||||
|
struct typed_in_place_factory_base {} ;
|
||||||
|
|
||||||
|
template<class T, class A0>
|
||||||
|
class typed_in_place_factory : public typed_in_place_factory_base
|
||||||
|
{
|
||||||
|
public:</PRE>
|
||||||
|
|
||||||
|
<PRE> typed_in_place_factory ( A0 const& a0 ) : m_a0(a0) {}
|
||||||
|
|
||||||
|
void apply ( void* address ) const
|
||||||
|
{
|
||||||
|
new (address) T(m_a0);
|
||||||
|
}
|
||||||
|
|
||||||
|
private:</PRE>
|
||||||
|
|
||||||
|
<PRE> A0 const& m_a0 ;
|
||||||
|
} ;
|
||||||
|
|
||||||
|
template<class T, class A0>
|
||||||
|
typed_in_place_factory<A0> in_place ( A0 const& a0 )
|
||||||
|
{
|
||||||
|
return typed_in_place_factory<T,A0>(a0);
|
||||||
|
}</PRE>
|
||||||
|
|
||||||
|
<PRE>}
|
||||||
|
</PRE>
|
||||||
|
|
||||||
|
<p>As you can see, the 'in_place_factory' and 'typed_in_place_factory' template classes varies only in the way they specify
|
||||||
|
the target type: in the first family, the type is given as a template argument to the apply member function while in the
|
||||||
|
second it is given directly as part of the factory class.<br>
|
||||||
|
When the container holds a unique non-polymorphic type (such as the case of Boost.Optional), it knows the exact dynamic-type
|
||||||
|
of the contained object and can pass it to the apply() method of a (non-typed) factory.
|
||||||
|
In this case, end users can use an 'in_place_factory' instance which can be constructed without the type of the object to construct.<br>
|
||||||
|
However, if the container holds heterogeneous or polymorphic objects (such as the case of Boost.Variant), the dynamic-type
|
||||||
|
of the object to be constructed must be known by the factory itslef. In this case, end users must use a 'typed_in_place_factory'
|
||||||
|
instead.</p>
|
||||||
|
|
||||||
|
<HR>
|
||||||
|
|
||||||
|
<h2><A NAME="container-usage">Container-side Usage</a></h2>
|
||||||
|
|
||||||
|
<p>As shown in the introductory simplified example, the container class must
|
||||||
|
contain methods that accept an instance of
|
||||||
|
these factories and pass the object's storage to the factory's apply method.<br>
|
||||||
|
However, the type of the factory class cannot be completly specified in the container class because that would
|
||||||
|
defeat the whole purpose of the factories which is to allow the container to accept a variadic argument list
|
||||||
|
for the constructor of its contained object.<br>
|
||||||
|
The correct function overload must be based on the only distinctive and common
|
||||||
|
characteristic of all the classes in each family, the base class.<br>
|
||||||
|
Depending on the container class, you can use 'enable_if' to generate the right overload, or use the following
|
||||||
|
dispatch technique (used in the Boost.Optional class):
|
||||||
|
</p>
|
||||||
|
<pre>struct C
|
||||||
|
{
|
||||||
|
C() : contained_(0) {}
|
||||||
|
C ( X const& v ) : contained_ ( new X(v) ) {}
|
||||||
|
|
||||||
|
template<class Expr>
|
||||||
|
C ( Expr const& expr )
|
||||||
|
:
|
||||||
|
contained_ ( uninitialized_storage() )
|
||||||
|
{
|
||||||
|
construct(expr,&expr)
|
||||||
|
}
|
||||||
|
|
||||||
|
~C() { delete contained_ ; }
|
||||||
|
|
||||||
|
template<class InPlaceFactory>
|
||||||
|
void construct ( InPlaceFactory const& aFactory, boost::in_place_factory_base* )
|
||||||
|
{
|
||||||
|
aFactory.template apply<X>(contained_);
|
||||||
|
}
|
||||||
|
|
||||||
|
template<class TypedInPlaceFactory>
|
||||||
|
void construct ( TypedInPlaceFactory const& aFactory, boost::typed_in_place_factory_base* )
|
||||||
|
{
|
||||||
|
aFactory.apply(contained_);
|
||||||
|
}
|
||||||
|
|
||||||
|
X* uninitialized_storage() { return static_cast<X*>(new char[sizeof(X)]) ; }
|
||||||
|
|
||||||
|
X* contained_ ;
|
||||||
|
} ;
|
||||||
|
</pre>
|
||||||
|
|
||||||
<hr>
|
<hr>
|
||||||
<tt>
|
|
||||||
Boost.Utility<br>
|
<h2><A NAME="user-usage">User-side Usage</a></h2>
|
||||||
<br>
|
|
||||||
Distributed under the Boost Software License, Version 1.0.
|
<p>End users pass to the container an instance of a factory object holding the actual parameters needed to construct the
|
||||||
(See accompanying file LICENSE_1_0.txt or copy at
|
contained object directly within the container. For this, the helper template function 'in_place' is used.<br>
|
||||||
<a href=http://www.boost.org/LICENSE_1_0.txt>http://www.boost.org/LICENSE_1_0.txt</a>) <br>
|
The call 'in_place(a0,a1,a2,...,an)' constructs a (non-typed) 'in_place_factory' instance with the given argument list.<br>
|
||||||
<br>
|
The call 'in_place<T>(a0,a1,a2,...,an)' constructs a 'typed_in_place_factory' instance with the given argument list for the
|
||||||
</tt>
|
type 'T'.</p>
|
||||||
</body>
|
<pre>void foo()
|
||||||
</html>
|
{
|
||||||
|
C a( in_place(123,"hello") ) ; // in_place_factory passed
|
||||||
|
C b( in_place<X>(456,"world") ) ; // typed_in_place_factory passed
|
||||||
|
}
|
||||||
|
</pre>
|
||||||
|
|
||||||
|
<P>Revised September 17, 2004</P>
|
||||||
|
<p><EFBFBD> Copyright Fernando Luis Cacciola Carballal, 2004</p>
|
||||||
|
<p> Use, modification, and distribution are subject to the Boost Software
|
||||||
|
License, Version 1.0. (See accompanying file <a href="../../LICENSE_1_0.txt">
|
||||||
|
LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
|
||||||
|
www.boost.org/LICENSE_1_0.txt</a>)</p>
|
||||||
|
<P>Developed by <A HREF="mailto:fernando_cacciola@hotmail.com">Fernando Cacciola</A>,
|
||||||
|
the latest version of this file can be found at <A
|
||||||
|
HREF="http://www.boost.org">www.boost.org</A>, and the boost
|
||||||
|
<A HREF="http://www.boost.org/more/mailing_lists.htm#main">discussion lists</A></P>
|
||||||
|
</BODY>
|
||||||
|
</HTML>
|
||||||
50
include/boost/assert.hpp
Normal file
50
include/boost/assert.hpp
Normal file
@@ -0,0 +1,50 @@
|
|||||||
|
//
|
||||||
|
// boost/assert.hpp - BOOST_ASSERT(expr)
|
||||||
|
//
|
||||||
|
// Copyright (c) 2001, 2002 Peter Dimov and Multi Media Ltd.
|
||||||
|
// Copyright (c) 2007 Peter Dimov
|
||||||
|
//
|
||||||
|
// Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
// accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
// Note: There are no include guards. This is intentional.
|
||||||
|
//
|
||||||
|
// See http://www.boost.org/libs/utility/assert.html for documentation.
|
||||||
|
//
|
||||||
|
|
||||||
|
#undef BOOST_ASSERT
|
||||||
|
|
||||||
|
#if defined(BOOST_DISABLE_ASSERTS)
|
||||||
|
|
||||||
|
# define BOOST_ASSERT(expr) ((void)0)
|
||||||
|
|
||||||
|
#elif defined(BOOST_ENABLE_ASSERT_HANDLER)
|
||||||
|
|
||||||
|
#include <boost/current_function.hpp>
|
||||||
|
|
||||||
|
namespace boost
|
||||||
|
{
|
||||||
|
|
||||||
|
void assertion_failed(char const * expr, char const * function, char const * file, long line); // user defined
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#define BOOST_ASSERT(expr) ((expr)? ((void)0): ::boost::assertion_failed(#expr, BOOST_CURRENT_FUNCTION, __FILE__, __LINE__))
|
||||||
|
|
||||||
|
#else
|
||||||
|
# include <assert.h> // .h to support old libraries w/o <cassert> - effect is the same
|
||||||
|
# define BOOST_ASSERT(expr) assert(expr)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#undef BOOST_VERIFY
|
||||||
|
|
||||||
|
#if defined(BOOST_DISABLE_ASSERTS) || ( !defined(BOOST_ENABLE_ASSERT_HANDLER) && defined(NDEBUG) )
|
||||||
|
|
||||||
|
# define BOOST_VERIFY(expr) ((void)(expr))
|
||||||
|
|
||||||
|
#else
|
||||||
|
|
||||||
|
# define BOOST_VERIFY(expr) BOOST_ASSERT(expr)
|
||||||
|
|
||||||
|
#endif
|
||||||
@@ -5,7 +5,7 @@
|
|||||||
//
|
//
|
||||||
// See http://www.boost.org/libs/utility for most recent version including documentation.
|
// See http://www.boost.org/libs/utility for most recent version including documentation.
|
||||||
|
|
||||||
// See boost/detail/call_traits.hpp
|
// See boost/detail/call_traits.hpp and boost/detail/ob_call_traits.hpp
|
||||||
// for full copyright notices.
|
// for full copyright notices.
|
||||||
|
|
||||||
#ifndef BOOST_CALL_TRAITS_HPP
|
#ifndef BOOST_CALL_TRAITS_HPP
|
||||||
@@ -15,6 +15,10 @@
|
|||||||
#include <boost/config.hpp>
|
#include <boost/config.hpp>
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
|
#include <boost/detail/ob_call_traits.hpp>
|
||||||
|
#else
|
||||||
#include <boost/detail/call_traits.hpp>
|
#include <boost/detail/call_traits.hpp>
|
||||||
|
#endif
|
||||||
|
|
||||||
#endif // BOOST_CALL_TRAITS_HPP
|
#endif // BOOST_CALL_TRAITS_HPP
|
||||||
|
|||||||
69
include/boost/checked_delete.hpp
Normal file
69
include/boost/checked_delete.hpp
Normal file
@@ -0,0 +1,69 @@
|
|||||||
|
#ifndef BOOST_CHECKED_DELETE_HPP_INCLUDED
|
||||||
|
#define BOOST_CHECKED_DELETE_HPP_INCLUDED
|
||||||
|
|
||||||
|
// MS compatible compilers support #pragma once
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
|
||||||
|
# pragma once
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//
|
||||||
|
// boost/checked_delete.hpp
|
||||||
|
//
|
||||||
|
// Copyright (c) 2002, 2003 Peter Dimov
|
||||||
|
// Copyright (c) 2003 Daniel Frey
|
||||||
|
// Copyright (c) 2003 Howard Hinnant
|
||||||
|
//
|
||||||
|
// 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/utility/checked_delete.html for documentation.
|
||||||
|
//
|
||||||
|
|
||||||
|
namespace boost
|
||||||
|
{
|
||||||
|
|
||||||
|
// verify that types are complete for increased safety
|
||||||
|
|
||||||
|
template<class T> inline void checked_delete(T * x)
|
||||||
|
{
|
||||||
|
// intentionally complex - simplification causes regressions
|
||||||
|
typedef char type_must_be_complete[ sizeof(T)? 1: -1 ];
|
||||||
|
(void) sizeof(type_must_be_complete);
|
||||||
|
delete x;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<class T> inline void checked_array_delete(T * x)
|
||||||
|
{
|
||||||
|
typedef char type_must_be_complete[ sizeof(T)? 1: -1 ];
|
||||||
|
(void) sizeof(type_must_be_complete);
|
||||||
|
delete [] x;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<class T> struct checked_deleter
|
||||||
|
{
|
||||||
|
typedef void result_type;
|
||||||
|
typedef T * argument_type;
|
||||||
|
|
||||||
|
void operator()(T * x) const
|
||||||
|
{
|
||||||
|
// boost:: disables ADL
|
||||||
|
boost::checked_delete(x);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
template<class T> struct checked_array_deleter
|
||||||
|
{
|
||||||
|
typedef void result_type;
|
||||||
|
typedef T * argument_type;
|
||||||
|
|
||||||
|
void operator()(T * x) const
|
||||||
|
{
|
||||||
|
boost::checked_array_delete(x);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#endif // #ifndef BOOST_CHECKED_DELETE_HPP_INCLUDED
|
||||||
@@ -5,7 +5,7 @@
|
|||||||
//
|
//
|
||||||
// See http://www.boost.org/libs/utility for most recent version including documentation.
|
// See http://www.boost.org/libs/utility for most recent version including documentation.
|
||||||
|
|
||||||
// See boost/detail/compressed_pair.hpp
|
// See boost/detail/compressed_pair.hpp and boost/detail/ob_compressed_pair.hpp
|
||||||
// for full copyright notices.
|
// for full copyright notices.
|
||||||
|
|
||||||
#ifndef BOOST_COMPRESSED_PAIR_HPP
|
#ifndef BOOST_COMPRESSED_PAIR_HPP
|
||||||
@@ -15,6 +15,10 @@
|
|||||||
#include <boost/config.hpp>
|
#include <boost/config.hpp>
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
|
#include <boost/detail/ob_compressed_pair.hpp>
|
||||||
|
#else
|
||||||
#include <boost/detail/compressed_pair.hpp>
|
#include <boost/detail/compressed_pair.hpp>
|
||||||
|
#endif
|
||||||
|
|
||||||
#endif // BOOST_COMPRESSED_PAIR_HPP
|
#endif // BOOST_COMPRESSED_PAIR_HPP
|
||||||
|
|||||||
67
include/boost/current_function.hpp
Normal file
67
include/boost/current_function.hpp
Normal file
@@ -0,0 +1,67 @@
|
|||||||
|
#ifndef BOOST_CURRENT_FUNCTION_HPP_INCLUDED
|
||||||
|
#define BOOST_CURRENT_FUNCTION_HPP_INCLUDED
|
||||||
|
|
||||||
|
// MS compatible compilers support #pragma once
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
|
||||||
|
# pragma once
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//
|
||||||
|
// boost/current_function.hpp - BOOST_CURRENT_FUNCTION
|
||||||
|
//
|
||||||
|
// Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
|
||||||
|
//
|
||||||
|
// 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)
|
||||||
|
//
|
||||||
|
// http://www.boost.org/libs/utility/current_function.html
|
||||||
|
//
|
||||||
|
|
||||||
|
namespace boost
|
||||||
|
{
|
||||||
|
|
||||||
|
namespace detail
|
||||||
|
{
|
||||||
|
|
||||||
|
inline void current_function_helper()
|
||||||
|
{
|
||||||
|
|
||||||
|
#if defined(__GNUC__) || (defined(__MWERKS__) && (__MWERKS__ >= 0x3000)) || (defined(__ICC) && (__ICC >= 600))
|
||||||
|
|
||||||
|
# define BOOST_CURRENT_FUNCTION __PRETTY_FUNCTION__
|
||||||
|
|
||||||
|
#elif defined(__DMC__) && (__DMC__ >= 0x810)
|
||||||
|
|
||||||
|
# define BOOST_CURRENT_FUNCTION __PRETTY_FUNCTION__
|
||||||
|
|
||||||
|
#elif defined(__FUNCSIG__)
|
||||||
|
|
||||||
|
# define BOOST_CURRENT_FUNCTION __FUNCSIG__
|
||||||
|
|
||||||
|
#elif (defined(__INTEL_COMPILER) && (__INTEL_COMPILER >= 600)) || (defined(__IBMCPP__) && (__IBMCPP__ >= 500))
|
||||||
|
|
||||||
|
# define BOOST_CURRENT_FUNCTION __FUNCTION__
|
||||||
|
|
||||||
|
#elif defined(__BORLANDC__) && (__BORLANDC__ >= 0x550)
|
||||||
|
|
||||||
|
# define BOOST_CURRENT_FUNCTION __FUNC__
|
||||||
|
|
||||||
|
#elif defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901)
|
||||||
|
|
||||||
|
# define BOOST_CURRENT_FUNCTION __func__
|
||||||
|
|
||||||
|
#else
|
||||||
|
|
||||||
|
# define BOOST_CURRENT_FUNCTION "(unknown)"
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace detail
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#endif // #ifndef BOOST_CURRENT_FUNCTION_HPP_INCLUDED
|
||||||
@@ -24,7 +24,6 @@
|
|||||||
#include <cstddef>
|
#include <cstddef>
|
||||||
|
|
||||||
#include <boost/type_traits/is_arithmetic.hpp>
|
#include <boost/type_traits/is_arithmetic.hpp>
|
||||||
#include <boost/type_traits/is_enum.hpp>
|
|
||||||
#include <boost/type_traits/is_pointer.hpp>
|
#include <boost/type_traits/is_pointer.hpp>
|
||||||
#include <boost/detail/workaround.hpp>
|
#include <boost/detail/workaround.hpp>
|
||||||
|
|
||||||
@@ -44,26 +43,20 @@ struct ct_imp2<T, true>
|
|||||||
typedef const T param_type;
|
typedef const T param_type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template <typename T, bool isp, bool b1, bool b2>
|
template <typename T, bool isp, bool b1>
|
||||||
struct ct_imp
|
struct ct_imp
|
||||||
{
|
{
|
||||||
typedef const T& param_type;
|
typedef const T& param_type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template <typename T, bool isp, bool b2>
|
template <typename T, bool isp>
|
||||||
struct ct_imp<T, isp, true, b2>
|
struct ct_imp<T, isp, true>
|
||||||
{
|
{
|
||||||
typedef typename ct_imp2<T, sizeof(T) <= sizeof(void*)>::param_type param_type;
|
typedef typename ct_imp2<T, sizeof(T) <= sizeof(void*)>::param_type param_type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template <typename T, bool isp, bool b1>
|
template <typename T, bool b1>
|
||||||
struct ct_imp<T, isp, b1, true>
|
struct ct_imp<T, true, b1>
|
||||||
{
|
|
||||||
typedef typename ct_imp2<T, sizeof(T) <= sizeof(void*)>::param_type param_type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename T, bool b1, bool b2>
|
|
||||||
struct ct_imp<T, true, b1, b2>
|
|
||||||
{
|
{
|
||||||
typedef const T param_type;
|
typedef const T param_type;
|
||||||
};
|
};
|
||||||
@@ -86,8 +79,7 @@ public:
|
|||||||
typedef typename boost::detail::ct_imp<
|
typedef typename boost::detail::ct_imp<
|
||||||
T,
|
T,
|
||||||
::boost::is_pointer<T>::value,
|
::boost::is_pointer<T>::value,
|
||||||
::boost::is_arithmetic<T>::value,
|
::boost::is_arithmetic<T>::value
|
||||||
::boost::is_enum<T>::value
|
|
||||||
>::param_type param_type;
|
>::param_type param_type;
|
||||||
};
|
};
|
||||||
|
|
||||||
@@ -100,7 +92,7 @@ struct call_traits<T&>
|
|||||||
typedef T& param_type; // hh removed const
|
typedef T& param_type; // hh removed const
|
||||||
};
|
};
|
||||||
|
|
||||||
#if BOOST_WORKAROUND( BOOST_BORLANDC, < 0x5A0 )
|
#if BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT( 0x581 ) )
|
||||||
// these are illegal specialisations; cv-qualifies applied to
|
// these are illegal specialisations; cv-qualifies applied to
|
||||||
// references have no effect according to [8.3.2p1],
|
// references have no effect according to [8.3.2p1],
|
||||||
// C++ Builder requires them though as it treats cv-qualified
|
// C++ Builder requires them though as it treats cv-qualified
|
||||||
|
|||||||
@@ -6,7 +6,7 @@
|
|||||||
// See http://www.boost.org/libs/utility for most recent version including documentation.
|
// See http://www.boost.org/libs/utility for most recent version including documentation.
|
||||||
|
|
||||||
// compressed_pair: pair that "compresses" empty members
|
// compressed_pair: pair that "compresses" empty members
|
||||||
// (see libs/utility/doc/html/compressed_pair.html)
|
// (see libs/utility/compressed_pair.htm)
|
||||||
//
|
//
|
||||||
// JM changes 25 Jan 2004:
|
// JM changes 25 Jan 2004:
|
||||||
// For the case where T1 == T2 and both are empty, then first() and second()
|
// For the case where T1 == T2 and both are empty, then first() and second()
|
||||||
@@ -24,7 +24,6 @@
|
|||||||
|
|
||||||
#include <boost/type_traits/remove_cv.hpp>
|
#include <boost/type_traits/remove_cv.hpp>
|
||||||
#include <boost/type_traits/is_empty.hpp>
|
#include <boost/type_traits/is_empty.hpp>
|
||||||
#include <boost/type_traits/is_final.hpp>
|
|
||||||
#include <boost/type_traits/is_same.hpp>
|
#include <boost/type_traits/is_same.hpp>
|
||||||
#include <boost/call_traits.hpp>
|
#include <boost/call_traits.hpp>
|
||||||
|
|
||||||
@@ -43,14 +42,6 @@ class compressed_pair;
|
|||||||
|
|
||||||
namespace details
|
namespace details
|
||||||
{
|
{
|
||||||
template<class T, bool E = boost::is_final<T>::value>
|
|
||||||
struct compressed_pair_empty
|
|
||||||
: ::boost::false_type { };
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
struct compressed_pair_empty<T, false>
|
|
||||||
: ::boost::is_empty<T> { };
|
|
||||||
|
|
||||||
// JM altered 26 Jan 2000:
|
// JM altered 26 Jan 2000:
|
||||||
template <class T1, class T2, bool IsSame, bool FirstEmpty, bool SecondEmpty>
|
template <class T1, class T2, bool IsSame, bool FirstEmpty, bool SecondEmpty>
|
||||||
struct compressed_pair_switch;
|
struct compressed_pair_switch;
|
||||||
@@ -347,15 +338,13 @@ namespace details
|
|||||||
|
|
||||||
template <class T1, class T2>
|
template <class T1, class T2>
|
||||||
class compressed_pair
|
class compressed_pair
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
: private ::boost::details::compressed_pair_imp<T1, T2,
|
: private ::boost::details::compressed_pair_imp<T1, T2,
|
||||||
::boost::details::compressed_pair_switch<
|
::boost::details::compressed_pair_switch<
|
||||||
T1,
|
T1,
|
||||||
T2,
|
T2,
|
||||||
::boost::is_same<typename remove_cv<T1>::type, typename remove_cv<T2>::type>::value,
|
::boost::is_same<typename remove_cv<T1>::type, typename remove_cv<T2>::type>::value,
|
||||||
::boost::details::compressed_pair_empty<T1>::value,
|
::boost::is_empty<T1>::value,
|
||||||
::boost::details::compressed_pair_empty<T2>::value>::value>
|
::boost::is_empty<T2>::value>::value>
|
||||||
#endif // BOOST_UTILITY_DOCS
|
|
||||||
{
|
{
|
||||||
private:
|
private:
|
||||||
typedef details::compressed_pair_imp<T1, T2,
|
typedef details::compressed_pair_imp<T1, T2,
|
||||||
@@ -363,8 +352,8 @@ private:
|
|||||||
T1,
|
T1,
|
||||||
T2,
|
T2,
|
||||||
::boost::is_same<typename remove_cv<T1>::type, typename remove_cv<T2>::type>::value,
|
::boost::is_same<typename remove_cv<T1>::type, typename remove_cv<T2>::type>::value,
|
||||||
::boost::details::compressed_pair_empty<T1>::value,
|
::boost::is_empty<T1>::value,
|
||||||
::boost::details::compressed_pair_empty<T2>::value>::value> base;
|
::boost::is_empty<T2>::value>::value> base;
|
||||||
public:
|
public:
|
||||||
typedef T1 first_type;
|
typedef T1 first_type;
|
||||||
typedef T2 second_type;
|
typedef T2 second_type;
|
||||||
@@ -394,15 +383,13 @@ public:
|
|||||||
//
|
//
|
||||||
template <class T>
|
template <class T>
|
||||||
class compressed_pair<T, T>
|
class compressed_pair<T, T>
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
: private details::compressed_pair_imp<T, T,
|
: private details::compressed_pair_imp<T, T,
|
||||||
::boost::details::compressed_pair_switch<
|
::boost::details::compressed_pair_switch<
|
||||||
T,
|
T,
|
||||||
T,
|
T,
|
||||||
::boost::is_same<typename remove_cv<T>::type, typename remove_cv<T>::type>::value,
|
::boost::is_same<typename remove_cv<T>::type, typename remove_cv<T>::type>::value,
|
||||||
::boost::details::compressed_pair_empty<T>::value,
|
::boost::is_empty<T>::value,
|
||||||
::boost::details::compressed_pair_empty<T>::value>::value>
|
::boost::is_empty<T>::value>::value>
|
||||||
#endif // BOOST_UTILITY_DOCS
|
|
||||||
{
|
{
|
||||||
private:
|
private:
|
||||||
typedef details::compressed_pair_imp<T, T,
|
typedef details::compressed_pair_imp<T, T,
|
||||||
@@ -410,8 +397,8 @@ private:
|
|||||||
T,
|
T,
|
||||||
T,
|
T,
|
||||||
::boost::is_same<typename remove_cv<T>::type, typename remove_cv<T>::type>::value,
|
::boost::is_same<typename remove_cv<T>::type, typename remove_cv<T>::type>::value,
|
||||||
::boost::details::compressed_pair_empty<T>::value,
|
::boost::is_empty<T>::value,
|
||||||
::boost::details::compressed_pair_empty<T>::value>::value> base;
|
::boost::is_empty<T>::value>::value> base;
|
||||||
public:
|
public:
|
||||||
typedef T first_type;
|
typedef T first_type;
|
||||||
typedef T second_type;
|
typedef T second_type;
|
||||||
|
|||||||
168
include/boost/detail/ob_call_traits.hpp
Normal file
168
include/boost/detail/ob_call_traits.hpp
Normal file
@@ -0,0 +1,168 @@
|
|||||||
|
// (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000.
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License,
|
||||||
|
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt).
|
||||||
|
//
|
||||||
|
// See http://www.boost.org/libs/utility for most recent version including documentation.
|
||||||
|
//
|
||||||
|
// Crippled version for crippled compilers:
|
||||||
|
// see libs/utility/call_traits.htm
|
||||||
|
//
|
||||||
|
|
||||||
|
/* Release notes:
|
||||||
|
01st October 2000:
|
||||||
|
Fixed call_traits on VC6, using "poor man's partial specialisation",
|
||||||
|
using ideas taken from "Generative programming" by Krzysztof Czarnecki
|
||||||
|
& Ulrich Eisenecker.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef BOOST_OB_CALL_TRAITS_HPP
|
||||||
|
#define BOOST_OB_CALL_TRAITS_HPP
|
||||||
|
|
||||||
|
#ifndef BOOST_CONFIG_HPP
|
||||||
|
#include <boost/config.hpp>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef BOOST_ARITHMETIC_TYPE_TRAITS_HPP
|
||||||
|
#include <boost/type_traits/arithmetic_traits.hpp>
|
||||||
|
#endif
|
||||||
|
#ifndef BOOST_COMPOSITE_TYPE_TRAITS_HPP
|
||||||
|
#include <boost/type_traits/composite_traits.hpp>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
namespace boost{
|
||||||
|
|
||||||
|
#ifdef BOOST_MSVC6_MEMBER_TEMPLATES
|
||||||
|
//
|
||||||
|
// use member templates to emulate
|
||||||
|
// partial specialisation:
|
||||||
|
//
|
||||||
|
namespace detail{
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct standard_call_traits
|
||||||
|
{
|
||||||
|
typedef T value_type;
|
||||||
|
typedef T& reference;
|
||||||
|
typedef const T& const_reference;
|
||||||
|
typedef const T& param_type;
|
||||||
|
};
|
||||||
|
template <class T>
|
||||||
|
struct simple_call_traits
|
||||||
|
{
|
||||||
|
typedef T value_type;
|
||||||
|
typedef T& reference;
|
||||||
|
typedef const T& const_reference;
|
||||||
|
typedef const T param_type;
|
||||||
|
};
|
||||||
|
template <class T>
|
||||||
|
struct reference_call_traits
|
||||||
|
{
|
||||||
|
typedef T value_type;
|
||||||
|
typedef T reference;
|
||||||
|
typedef T const_reference;
|
||||||
|
typedef T param_type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <bool pointer, bool arithmetic, bool reference>
|
||||||
|
struct call_traits_chooser
|
||||||
|
{
|
||||||
|
template <class T>
|
||||||
|
struct rebind
|
||||||
|
{
|
||||||
|
typedef standard_call_traits<T> type;
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct call_traits_chooser<true, false, false>
|
||||||
|
{
|
||||||
|
template <class T>
|
||||||
|
struct rebind
|
||||||
|
{
|
||||||
|
typedef simple_call_traits<T> type;
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct call_traits_chooser<false, false, true>
|
||||||
|
{
|
||||||
|
template <class T>
|
||||||
|
struct rebind
|
||||||
|
{
|
||||||
|
typedef reference_call_traits<T> type;
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
template <bool size_is_small>
|
||||||
|
struct call_traits_sizeof_chooser2
|
||||||
|
{
|
||||||
|
template <class T>
|
||||||
|
struct small_rebind
|
||||||
|
{
|
||||||
|
typedef simple_call_traits<T> small_type;
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
template<>
|
||||||
|
struct call_traits_sizeof_chooser2<false>
|
||||||
|
{
|
||||||
|
template <class T>
|
||||||
|
struct small_rebind
|
||||||
|
{
|
||||||
|
typedef standard_call_traits<T> small_type;
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct call_traits_chooser<false, true, false>
|
||||||
|
{
|
||||||
|
template <class T>
|
||||||
|
struct rebind
|
||||||
|
{
|
||||||
|
enum { sizeof_choice = (sizeof(T) <= sizeof(void*)) };
|
||||||
|
typedef call_traits_sizeof_chooser2<(sizeof(T) <= sizeof(void*))> chooser;
|
||||||
|
typedef typename chooser::template small_rebind<T> bound_type;
|
||||||
|
typedef typename bound_type::small_type type;
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace detail
|
||||||
|
template <typename T>
|
||||||
|
struct call_traits
|
||||||
|
{
|
||||||
|
private:
|
||||||
|
typedef detail::call_traits_chooser<
|
||||||
|
::boost::is_pointer<T>::value,
|
||||||
|
::boost::is_arithmetic<T>::value,
|
||||||
|
::boost::is_reference<T>::value
|
||||||
|
> chooser;
|
||||||
|
typedef typename chooser::template rebind<T> bound_type;
|
||||||
|
typedef typename bound_type::type call_traits_type;
|
||||||
|
public:
|
||||||
|
typedef typename call_traits_type::value_type value_type;
|
||||||
|
typedef typename call_traits_type::reference reference;
|
||||||
|
typedef typename call_traits_type::const_reference const_reference;
|
||||||
|
typedef typename call_traits_type::param_type param_type;
|
||||||
|
};
|
||||||
|
|
||||||
|
#else
|
||||||
|
//
|
||||||
|
// sorry call_traits is completely non-functional
|
||||||
|
// blame your broken compiler:
|
||||||
|
//
|
||||||
|
|
||||||
|
template <typename T>
|
||||||
|
struct call_traits
|
||||||
|
{
|
||||||
|
typedef T value_type;
|
||||||
|
typedef T& reference;
|
||||||
|
typedef const T& const_reference;
|
||||||
|
typedef const T& param_type;
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif // member templates
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif // BOOST_OB_CALL_TRAITS_HPP
|
||||||
@@ -20,11 +20,10 @@
|
|||||||
- John Maddock Jan 2000.
|
- John Maddock Jan 2000.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
#ifndef BOOST_OB_COMPRESSED_PAIR_HPP
|
#ifndef BOOST_OB_COMPRESSED_PAIR_HPP
|
||||||
#define BOOST_OB_COMPRESSED_PAIR_HPP
|
#define BOOST_OB_COMPRESSED_PAIR_HPP
|
||||||
|
|
||||||
|
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
#ifndef BOOST_OBJECT_TYPE_TRAITS_HPP
|
#ifndef BOOST_OBJECT_TYPE_TRAITS_HPP
|
||||||
#include <boost/type_traits/object_traits.hpp>
|
#include <boost/type_traits/object_traits.hpp>
|
||||||
@@ -168,6 +167,17 @@ public:
|
|||||||
compressed_pair_1(const ::boost::compressed_pair<T1,T2>& x)
|
compressed_pair_1(const ::boost::compressed_pair<T1,T2>& x)
|
||||||
: T2(x.second()), _first(x.first()) {}
|
: T2(x.second()), _first(x.first()) {}
|
||||||
|
|
||||||
|
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
|
||||||
|
// Total weirdness. If the assignment to _first is moved after
|
||||||
|
// the call to the inherited operator=, then this breaks graph/test/graph.cpp
|
||||||
|
// by way of iterator_adaptor.
|
||||||
|
compressed_pair_1& operator=(const compressed_pair_1& x) {
|
||||||
|
_first = x._first;
|
||||||
|
T2::operator=(x);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
first_reference first() { return _first; }
|
first_reference first() { return _first; }
|
||||||
first_const_reference first() const { return _first; }
|
first_const_reference first() const { return _first; }
|
||||||
|
|
||||||
@@ -495,4 +505,6 @@ inline void swap(compressed_pair<T1, T2>& x, compressed_pair<T1, T2>& y)
|
|||||||
} // boost
|
} // boost
|
||||||
|
|
||||||
#endif // BOOST_OB_COMPRESSED_PAIR_HPP
|
#endif // BOOST_OB_COMPRESSED_PAIR_HPP
|
||||||
#endif // BOOST_UTILITY_DOCS
|
|
||||||
|
|
||||||
|
|
||||||
|
|||||||
13
include/boost/exception.hpp
Normal file
13
include/boost/exception.hpp
Normal file
@@ -0,0 +1,13 @@
|
|||||||
|
//Copyright (c) 2006-2008 Emil Dotchevski and Reverge Studios, Inc.
|
||||||
|
|
||||||
|
//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)
|
||||||
|
|
||||||
|
#ifndef UUID_1D94A7C6054E11DB9804B622A1EF5492
|
||||||
|
#define UUID_1D94A7C6054E11DB9804B622A1EF5492
|
||||||
|
|
||||||
|
#include <boost/exception/info_tuple.hpp>
|
||||||
|
#include <boost/exception/cloning.hpp>
|
||||||
|
#include <boost/throw_exception.hpp>
|
||||||
|
|
||||||
|
#endif
|
||||||
80
include/boost/generator_iterator.hpp
Normal file
80
include/boost/generator_iterator.hpp
Normal file
@@ -0,0 +1,80 @@
|
|||||||
|
// (C) Copyright Jens Maurer 2001.
|
||||||
|
// 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)
|
||||||
|
//
|
||||||
|
// Revision History:
|
||||||
|
|
||||||
|
// 15 Nov 2001 Jens Maurer
|
||||||
|
// created.
|
||||||
|
|
||||||
|
// See http://www.boost.org/libs/utility/iterator_adaptors.htm for documentation.
|
||||||
|
|
||||||
|
#ifndef BOOST_ITERATOR_ADAPTOR_GENERATOR_ITERATOR_HPP
|
||||||
|
#define BOOST_ITERATOR_ADAPTOR_GENERATOR_ITERATOR_HPP
|
||||||
|
|
||||||
|
#include <boost/iterator/iterator_facade.hpp>
|
||||||
|
#include <boost/ref.hpp>
|
||||||
|
|
||||||
|
namespace boost {
|
||||||
|
|
||||||
|
template<class Generator>
|
||||||
|
class generator_iterator
|
||||||
|
: public iterator_facade<
|
||||||
|
generator_iterator<Generator>
|
||||||
|
, typename Generator::result_type
|
||||||
|
, single_pass_traversal_tag
|
||||||
|
, typename Generator::result_type const&
|
||||||
|
>
|
||||||
|
{
|
||||||
|
typedef iterator_facade<
|
||||||
|
generator_iterator<Generator>
|
||||||
|
, typename Generator::result_type
|
||||||
|
, single_pass_traversal_tag
|
||||||
|
, typename Generator::result_type const&
|
||||||
|
> super_t;
|
||||||
|
|
||||||
|
public:
|
||||||
|
generator_iterator() {}
|
||||||
|
generator_iterator(Generator* g) : m_g(g), m_value((*m_g)()) {}
|
||||||
|
|
||||||
|
void increment()
|
||||||
|
{
|
||||||
|
m_value = (*m_g)();
|
||||||
|
}
|
||||||
|
|
||||||
|
const typename Generator::result_type&
|
||||||
|
dereference() const
|
||||||
|
{
|
||||||
|
return m_value;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool equal(generator_iterator const& y) const
|
||||||
|
{
|
||||||
|
return this->m_g == y.m_g && this->m_value == y.m_value;
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
Generator* m_g;
|
||||||
|
typename Generator::result_type m_value;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<class Generator>
|
||||||
|
struct generator_iterator_generator
|
||||||
|
{
|
||||||
|
typedef generator_iterator<Generator> type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class Generator>
|
||||||
|
inline generator_iterator<Generator>
|
||||||
|
make_generator_iterator(Generator & gen)
|
||||||
|
{
|
||||||
|
typedef generator_iterator<Generator> result_t;
|
||||||
|
return result_t(&gen);
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
|
||||||
|
#endif // BOOST_ITERATOR_ADAPTOR_GENERATOR_ITERATOR_HPP
|
||||||
|
|
||||||
51
include/boost/next_prior.hpp
Normal file
51
include/boost/next_prior.hpp
Normal file
@@ -0,0 +1,51 @@
|
|||||||
|
// Boost next_prior.hpp header file ---------------------------------------//
|
||||||
|
|
||||||
|
// (C) Copyright Dave Abrahams and Daniel Walker 1999-2003. 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/utility for documentation.
|
||||||
|
|
||||||
|
// Revision History
|
||||||
|
// 13 Dec 2003 Added next(x, n) and prior(x, n) (Daniel Walker)
|
||||||
|
|
||||||
|
#ifndef BOOST_NEXT_PRIOR_HPP_INCLUDED
|
||||||
|
#define BOOST_NEXT_PRIOR_HPP_INCLUDED
|
||||||
|
|
||||||
|
#include <iterator>
|
||||||
|
|
||||||
|
namespace boost {
|
||||||
|
|
||||||
|
// Helper functions for classes like bidirectional iterators not supporting
|
||||||
|
// operator+ and operator-
|
||||||
|
//
|
||||||
|
// Usage:
|
||||||
|
// const std::list<T>::iterator p = get_some_iterator();
|
||||||
|
// const std::list<T>::iterator prev = boost::prior(p);
|
||||||
|
// const std::list<T>::iterator next = boost::next(prev, 2);
|
||||||
|
|
||||||
|
// Contributed by Dave Abrahams
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
inline T next(T x) { return ++x; }
|
||||||
|
|
||||||
|
template <class T, class Distance>
|
||||||
|
inline T next(T x, Distance n)
|
||||||
|
{
|
||||||
|
std::advance(x, n);
|
||||||
|
return x;
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
inline T prior(T x) { return --x; }
|
||||||
|
|
||||||
|
template <class T, class Distance>
|
||||||
|
inline T prior(T x, Distance n)
|
||||||
|
{
|
||||||
|
std::advance(x, -n);
|
||||||
|
return x;
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#endif // BOOST_NEXT_PRIOR_HPP_INCLUDED
|
||||||
36
include/boost/noncopyable.hpp
Normal file
36
include/boost/noncopyable.hpp
Normal file
@@ -0,0 +1,36 @@
|
|||||||
|
// Boost noncopyable.hpp header file --------------------------------------//
|
||||||
|
|
||||||
|
// (C) Copyright Beman Dawes 1999-2003. 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/utility for documentation.
|
||||||
|
|
||||||
|
#ifndef BOOST_NONCOPYABLE_HPP_INCLUDED
|
||||||
|
#define BOOST_NONCOPYABLE_HPP_INCLUDED
|
||||||
|
|
||||||
|
namespace boost {
|
||||||
|
|
||||||
|
// Private copy constructor and copy assignment ensure classes derived from
|
||||||
|
// class noncopyable cannot be copied.
|
||||||
|
|
||||||
|
// Contributed by Dave Abrahams
|
||||||
|
|
||||||
|
namespace noncopyable_ // protection from unintended ADL
|
||||||
|
{
|
||||||
|
class noncopyable
|
||||||
|
{
|
||||||
|
protected:
|
||||||
|
noncopyable() {}
|
||||||
|
~noncopyable() {}
|
||||||
|
private: // emphasize the following members are private
|
||||||
|
noncopyable( const noncopyable& );
|
||||||
|
const noncopyable& operator=( const noncopyable& );
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
|
typedef noncopyable_::noncopyable noncopyable;
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#endif // BOOST_NONCOPYABLE_HPP_INCLUDED
|
||||||
@@ -1,7 +1,6 @@
|
|||||||
// Boost operators.hpp header file ----------------------------------------//
|
// Boost operators.hpp header file ----------------------------------------//
|
||||||
|
|
||||||
// (C) Copyright David Abrahams, Jeremy Siek, Daryle Walker 1999-2001.
|
// (C) Copyright David Abrahams, Jeremy Siek, Daryle Walker 1999-2001.
|
||||||
// (C) Copyright Daniel Frey 2002-2017.
|
|
||||||
// Distributed under the Boost Software License, Version 1.0. (See
|
// Distributed under the Boost Software License, Version 1.0. (See
|
||||||
// accompanying file LICENSE_1_0.txt or copy at
|
// accompanying file LICENSE_1_0.txt or copy at
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
@@ -9,16 +8,6 @@
|
|||||||
// See http://www.boost.org/libs/utility/operators.htm for documentation.
|
// See http://www.boost.org/libs/utility/operators.htm for documentation.
|
||||||
|
|
||||||
// Revision History
|
// Revision History
|
||||||
// 23 Nov 17 Protect dereferenceable<> from overloaded operator&.
|
|
||||||
// 15 Oct 17 Adapted to C++17, replace std::iterator<> with manual
|
|
||||||
// implementation.
|
|
||||||
// 22 Feb 16 Added ADL protection, preserve old work-arounds in
|
|
||||||
// operators_v1.hpp and clean up this file. (Daniel Frey)
|
|
||||||
// 16 Dec 10 Limit warning suppression for 4284 to older versions of VC++
|
|
||||||
// (Matthew Bradbury, fixes #4432)
|
|
||||||
// 07 Aug 08 Added "euclidean" spelling. (Daniel Frey)
|
|
||||||
// 03 Apr 08 Make sure "convertible to bool" is sufficient
|
|
||||||
// for T::operator<, etc. (Daniel Frey)
|
|
||||||
// 24 May 07 Changed empty_base to depend on T, see
|
// 24 May 07 Changed empty_base to depend on T, see
|
||||||
// http://svn.boost.org/trac/boost/ticket/979
|
// http://svn.boost.org/trac/boost/ticket/979
|
||||||
// 21 Oct 02 Modified implementation of operators to allow compilers with a
|
// 21 Oct 02 Modified implementation of operators to allow compilers with a
|
||||||
@@ -76,7 +65,7 @@
|
|||||||
// issue at the cost of some simplicity.
|
// issue at the cost of some simplicity.
|
||||||
//
|
//
|
||||||
// One of the complications is an existence of special auxiliary class template
|
// One of the complications is an existence of special auxiliary class template
|
||||||
// 'is_chained_base<>' (see 'operators_detail' namespace below), which is used
|
// 'is_chained_base<>' (see 'detail' namespace below), which is used
|
||||||
// to determine whether its template parameter is a library's operator template
|
// to determine whether its template parameter is a library's operator template
|
||||||
// or not. You have to specialize 'is_chained_base<>' for each new
|
// or not. You have to specialize 'is_chained_base<>' for each new
|
||||||
// operator template you add to the library.
|
// operator template you add to the library.
|
||||||
@@ -88,87 +77,81 @@
|
|||||||
#ifndef BOOST_OPERATORS_HPP
|
#ifndef BOOST_OPERATORS_HPP
|
||||||
#define BOOST_OPERATORS_HPP
|
#define BOOST_OPERATORS_HPP
|
||||||
|
|
||||||
// If old work-arounds are needed, refer to the preserved version without
|
|
||||||
// ADL protection.
|
|
||||||
#if defined(BOOST_NO_OPERATORS_IN_NAMESPACE) || defined(BOOST_USE_OPERATORS_V1)
|
|
||||||
#include "operators_v1.hpp"
|
|
||||||
#else
|
|
||||||
|
|
||||||
#include <cstddef>
|
|
||||||
#include <iterator>
|
|
||||||
|
|
||||||
#include <boost/config.hpp>
|
#include <boost/config.hpp>
|
||||||
|
#include <boost/iterator.hpp>
|
||||||
#include <boost/detail/workaround.hpp>
|
#include <boost/detail/workaround.hpp>
|
||||||
#include <boost/core/addressof.hpp>
|
|
||||||
|
|
||||||
#if defined(__sgi) && !defined(__GNUC__)
|
#if defined(__sgi) && !defined(__GNUC__)
|
||||||
# pragma set woff 1234
|
# pragma set woff 1234
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#if BOOST_WORKAROUND(BOOST_MSVC, < 1600)
|
#if defined(BOOST_MSVC)
|
||||||
# pragma warning( disable : 4284 ) // complaint about return type of
|
# pragma warning( disable : 4284 ) // complaint about return type of
|
||||||
#endif // operator-> not begin a UDT
|
#endif // operator-> not begin a UDT
|
||||||
|
|
||||||
// Define BOOST_OPERATORS_CONSTEXPR to be like BOOST_CONSTEXPR but empty under MSVC < v19.22
|
namespace boost {
|
||||||
#if BOOST_WORKAROUND(BOOST_MSVC, < 1922)
|
namespace detail {
|
||||||
#define BOOST_OPERATORS_CONSTEXPR
|
|
||||||
#elif defined __sun
|
template <typename T> class empty_base {
|
||||||
#define BOOST_OPERATORS_CONSTEXPR
|
|
||||||
#else
|
// Helmut Zeisel, empty base class optimization bug with GCC 3.0.0
|
||||||
#define BOOST_OPERATORS_CONSTEXPR BOOST_CONSTEXPR
|
#if defined(__GNUC__) && __GNUC__==3 && __GNUC_MINOR__==0 && __GNU_PATCHLEVEL__==0
|
||||||
|
bool dummy;
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace detail
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
// In this section we supply the xxxx1 and xxxx2 forms of the operator
|
// In this section we supply the xxxx1 and xxxx2 forms of the operator
|
||||||
// templates, which are explicitly targeted at the 1-type-argument and
|
// templates, which are explicitly targeted at the 1-type-argument and
|
||||||
// 2-type-argument operator forms, respectively.
|
// 2-type-argument operator forms, respectively. Some compilers get confused
|
||||||
|
// when inline friend functions are overloaded in namespaces other than the
|
||||||
|
// global namespace. When BOOST_NO_OPERATORS_IN_NAMESPACE is defined, all of
|
||||||
|
// these templates must go in the global namespace.
|
||||||
|
|
||||||
|
#ifndef BOOST_NO_OPERATORS_IN_NAMESPACE
|
||||||
namespace boost
|
namespace boost
|
||||||
{
|
{
|
||||||
namespace operators_impl
|
#endif
|
||||||
{
|
|
||||||
namespace operators_detail
|
|
||||||
{
|
|
||||||
|
|
||||||
template <typename T> class empty_base {};
|
|
||||||
|
|
||||||
} // namespace operators_detail
|
|
||||||
|
|
||||||
// Basic operator classes (contributed by Dave Abrahams) ------------------//
|
// Basic operator classes (contributed by Dave Abrahams) ------------------//
|
||||||
|
|
||||||
// Note that friend functions defined in a class are implicitly inline.
|
// Note that friend functions defined in a class are implicitly inline.
|
||||||
// See the C++ std, 11.4 [class.friend] paragraph 5
|
// See the C++ std, 11.4 [class.friend] paragraph 5
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct less_than_comparable2 : B
|
struct less_than_comparable2 : B
|
||||||
{
|
{
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator<=(const T& x, const U& y) { return !static_cast<bool>(x > y); }
|
friend bool operator<=(const T& x, const U& y) { return !(x > y); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>=(const T& x, const U& y) { return !static_cast<bool>(x < y); }
|
friend bool operator>=(const T& x, const U& y) { return !(x < y); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>(const U& x, const T& y) { return y < x; }
|
friend bool operator>(const U& x, const T& y) { return y < x; }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator<(const U& x, const T& y) { return y > x; }
|
friend bool operator<(const U& x, const T& y) { return y > x; }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator<=(const U& x, const T& y) { return !static_cast<bool>(y < x); }
|
friend bool operator<=(const U& x, const T& y) { return !(y < x); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>=(const U& x, const T& y) { return !static_cast<bool>(y > x); }
|
friend bool operator>=(const U& x, const T& y) { return !(y > x); }
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct less_than_comparable1 : B
|
struct less_than_comparable1 : B
|
||||||
{
|
{
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>(const T& x, const T& y) { return y < x; }
|
friend bool operator>(const T& x, const T& y) { return y < x; }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator<=(const T& x, const T& y) { return !static_cast<bool>(y < x); }
|
friend bool operator<=(const T& x, const T& y) { return !(y < x); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>=(const T& x, const T& y) { return !static_cast<bool>(x < y); }
|
friend bool operator>=(const T& x, const T& y) { return !(x < y); }
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct equality_comparable2 : B
|
struct equality_comparable2 : B
|
||||||
{
|
{
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator==(const U& y, const T& x) { return x == y; }
|
friend bool operator==(const U& y, const T& x) { return x == y; }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator!=(const U& y, const T& x) { return !static_cast<bool>(x == y); }
|
friend bool operator!=(const U& y, const T& x) { return !(x == y); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator!=(const T& y, const U& x) { return !static_cast<bool>(y == x); }
|
friend bool operator!=(const T& y, const U& x) { return !(y == x); }
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct equality_comparable1 : B
|
struct equality_comparable1 : B
|
||||||
{
|
{
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator!=(const T& x, const T& y) { return !static_cast<bool>(x == y); }
|
friend bool operator!=(const T& x, const T& y) { return !(x == y); }
|
||||||
};
|
};
|
||||||
|
|
||||||
// A macro which produces "name_2left" from "name".
|
// A macro which produces "name_2left" from "name".
|
||||||
@@ -184,7 +167,7 @@ struct equality_comparable1 : B
|
|||||||
// implementation available.
|
// implementation available.
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR_COMMUTATIVE( NAME, OP ) \
|
#define BOOST_BINARY_OPERATOR_COMMUTATIVE( NAME, OP ) \
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> > \
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##2 : B \
|
struct NAME##2 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( const T& lhs, const U& rhs ) \
|
friend T operator OP( const T& lhs, const U& rhs ) \
|
||||||
@@ -193,7 +176,7 @@ struct NAME##2 : B \
|
|||||||
{ T nrv( rhs ); nrv OP##= lhs; return nrv; } \
|
{ T nrv( rhs ); nrv OP##= lhs; return nrv; } \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
template <class T, class B = operators_detail::empty_base<T> > \
|
template <class T, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##1 : B \
|
struct NAME##1 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( const T& lhs, const T& rhs ) \
|
friend T operator OP( const T& lhs, const T& rhs ) \
|
||||||
@@ -201,21 +184,21 @@ struct NAME##1 : B \
|
|||||||
};
|
};
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( NAME, OP ) \
|
#define BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( NAME, OP ) \
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> > \
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##2 : B \
|
struct NAME##2 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( const T& lhs, const U& rhs ) \
|
friend T operator OP( const T& lhs, const U& rhs ) \
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> > \
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct BOOST_OPERATOR2_LEFT(NAME) : B \
|
struct BOOST_OPERATOR2_LEFT(NAME) : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( const U& lhs, const T& rhs ) \
|
friend T operator OP( const U& lhs, const T& rhs ) \
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
template <class T, class B = operators_detail::empty_base<T> > \
|
template <class T, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##1 : B \
|
struct NAME##1 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( const T& lhs, const T& rhs ) \
|
friend T operator OP( const T& lhs, const T& rhs ) \
|
||||||
@@ -230,34 +213,34 @@ struct NAME##1 : B \
|
|||||||
// optimization opportunities to the compiler :)
|
// optimization opportunities to the compiler :)
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR_COMMUTATIVE( NAME, OP ) \
|
#define BOOST_BINARY_OPERATOR_COMMUTATIVE( NAME, OP ) \
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> > \
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##2 : B \
|
struct NAME##2 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
||||||
friend T operator OP( const U& lhs, T rhs ) { return rhs OP##= lhs; } \
|
friend T operator OP( const U& lhs, T rhs ) { return rhs OP##= lhs; } \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
template <class T, class B = operators_detail::empty_base<T> > \
|
template <class T, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##1 : B \
|
struct NAME##1 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
||||||
};
|
};
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( NAME, OP ) \
|
#define BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( NAME, OP ) \
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> > \
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##2 : B \
|
struct NAME##2 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> > \
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct BOOST_OPERATOR2_LEFT(NAME) : B \
|
struct BOOST_OPERATOR2_LEFT(NAME) : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( const U& lhs, const T& rhs ) \
|
friend T operator OP( const U& lhs, const T& rhs ) \
|
||||||
{ return T( lhs ) OP##= rhs; } \
|
{ return T( lhs ) OP##= rhs; } \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
template <class T, class B = operators_detail::empty_base<T> > \
|
template <class T, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##1 : B \
|
struct NAME##1 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
||||||
@@ -280,7 +263,7 @@ BOOST_BINARY_OPERATOR_COMMUTATIVE( orable, | )
|
|||||||
|
|
||||||
// incrementable and decrementable contributed by Jeremy Siek
|
// incrementable and decrementable contributed by Jeremy Siek
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct incrementable : B
|
struct incrementable : B
|
||||||
{
|
{
|
||||||
friend T operator++(T& x, int)
|
friend T operator++(T& x, int)
|
||||||
@@ -293,7 +276,7 @@ private: // The use of this typedef works around a Borland bug
|
|||||||
typedef T incrementable_type;
|
typedef T incrementable_type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct decrementable : B
|
struct decrementable : B
|
||||||
{
|
{
|
||||||
friend T operator--(T& x, int)
|
friend T operator--(T& x, int)
|
||||||
@@ -308,16 +291,16 @@ private: // The use of this typedef works around a Borland bug
|
|||||||
|
|
||||||
// Iterator operator classes (contributed by Jeremy Siek) ------------------//
|
// Iterator operator classes (contributed by Jeremy Siek) ------------------//
|
||||||
|
|
||||||
template <class T, class P, class B = operators_detail::empty_base<T> >
|
template <class T, class P, class B = ::boost::detail::empty_base<T> >
|
||||||
struct dereferenceable : B
|
struct dereferenceable : B
|
||||||
{
|
{
|
||||||
P operator->() const
|
P operator->() const
|
||||||
{
|
{
|
||||||
return ::boost::addressof(*static_cast<const T&>(*this));
|
return &*static_cast<const T&>(*this);
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class T, class I, class R, class B = operators_detail::empty_base<T> >
|
template <class T, class I, class R, class B = ::boost::detail::empty_base<T> >
|
||||||
struct indexable : B
|
struct indexable : B
|
||||||
{
|
{
|
||||||
R operator[](I n) const
|
R operator[](I n) const
|
||||||
@@ -332,14 +315,14 @@ struct indexable : B
|
|||||||
#if defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
#if defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR( NAME, OP ) \
|
#define BOOST_BINARY_OPERATOR( NAME, OP ) \
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> > \
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##2 : B \
|
struct NAME##2 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( const T& lhs, const U& rhs ) \
|
friend T operator OP( const T& lhs, const U& rhs ) \
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
template <class T, class B = operators_detail::empty_base<T> > \
|
template <class T, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##1 : B \
|
struct NAME##1 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( const T& lhs, const T& rhs ) \
|
friend T operator OP( const T& lhs, const T& rhs ) \
|
||||||
@@ -349,13 +332,13 @@ struct NAME##1 : B \
|
|||||||
#else // defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
#else // defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR( NAME, OP ) \
|
#define BOOST_BINARY_OPERATOR( NAME, OP ) \
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> > \
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##2 : B \
|
struct NAME##2 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
template <class T, class B = operators_detail::empty_base<T> > \
|
template <class T, class B = ::boost::detail::empty_base<T> > \
|
||||||
struct NAME##1 : B \
|
struct NAME##1 : B \
|
||||||
{ \
|
{ \
|
||||||
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
||||||
@@ -368,209 +351,209 @@ BOOST_BINARY_OPERATOR( right_shiftable, >> )
|
|||||||
|
|
||||||
#undef BOOST_BINARY_OPERATOR
|
#undef BOOST_BINARY_OPERATOR
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct equivalent2 : B
|
struct equivalent2 : B
|
||||||
{
|
{
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator==(const T& x, const U& y)
|
friend bool operator==(const T& x, const U& y)
|
||||||
{
|
{
|
||||||
return !static_cast<bool>(x < y) && !static_cast<bool>(x > y);
|
return !(x < y) && !(x > y);
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct equivalent1 : B
|
struct equivalent1 : B
|
||||||
{
|
{
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator==(const T&x, const T&y)
|
friend bool operator==(const T&x, const T&y)
|
||||||
{
|
{
|
||||||
return !static_cast<bool>(x < y) && !static_cast<bool>(y < x);
|
return !(x < y) && !(y < x);
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct partially_ordered2 : B
|
struct partially_ordered2 : B
|
||||||
{
|
{
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator<=(const T& x, const U& y)
|
friend bool operator<=(const T& x, const U& y)
|
||||||
{ return static_cast<bool>(x < y) || static_cast<bool>(x == y); }
|
{ return (x < y) || (x == y); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>=(const T& x, const U& y)
|
friend bool operator>=(const T& x, const U& y)
|
||||||
{ return static_cast<bool>(x > y) || static_cast<bool>(x == y); }
|
{ return (x > y) || (x == y); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>(const U& x, const T& y)
|
friend bool operator>(const U& x, const T& y)
|
||||||
{ return y < x; }
|
{ return y < x; }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator<(const U& x, const T& y)
|
friend bool operator<(const U& x, const T& y)
|
||||||
{ return y > x; }
|
{ return y > x; }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator<=(const U& x, const T& y)
|
friend bool operator<=(const U& x, const T& y)
|
||||||
{ return static_cast<bool>(y > x) || static_cast<bool>(y == x); }
|
{ return (y > x) || (y == x); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>=(const U& x, const T& y)
|
friend bool operator>=(const U& x, const T& y)
|
||||||
{ return static_cast<bool>(y < x) || static_cast<bool>(y == x); }
|
{ return (y < x) || (y == x); }
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct partially_ordered1 : B
|
struct partially_ordered1 : B
|
||||||
{
|
{
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>(const T& x, const T& y)
|
friend bool operator>(const T& x, const T& y)
|
||||||
{ return y < x; }
|
{ return y < x; }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator<=(const T& x, const T& y)
|
friend bool operator<=(const T& x, const T& y)
|
||||||
{ return static_cast<bool>(x < y) || static_cast<bool>(x == y); }
|
{ return (x < y) || (x == y); }
|
||||||
friend BOOST_OPERATORS_CONSTEXPR bool operator>=(const T& x, const T& y)
|
friend bool operator>=(const T& x, const T& y)
|
||||||
{ return static_cast<bool>(y < x) || static_cast<bool>(x == y); }
|
{ return (y < x) || (x == y); }
|
||||||
};
|
};
|
||||||
|
|
||||||
// Combined operator classes (contributed by Daryle Walker) ----------------//
|
// Combined operator classes (contributed by Daryle Walker) ----------------//
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct totally_ordered2
|
struct totally_ordered2
|
||||||
: less_than_comparable2<T, U
|
: less_than_comparable2<T, U
|
||||||
, equality_comparable2<T, U, B
|
, equality_comparable2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct totally_ordered1
|
struct totally_ordered1
|
||||||
: less_than_comparable1<T
|
: less_than_comparable1<T
|
||||||
, equality_comparable1<T, B
|
, equality_comparable1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct additive2
|
struct additive2
|
||||||
: addable2<T, U
|
: addable2<T, U
|
||||||
, subtractable2<T, U, B
|
, subtractable2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct additive1
|
struct additive1
|
||||||
: addable1<T
|
: addable1<T
|
||||||
, subtractable1<T, B
|
, subtractable1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct multiplicative2
|
struct multiplicative2
|
||||||
: multipliable2<T, U
|
: multipliable2<T, U
|
||||||
, dividable2<T, U, B
|
, dividable2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct multiplicative1
|
struct multiplicative1
|
||||||
: multipliable1<T
|
: multipliable1<T
|
||||||
, dividable1<T, B
|
, dividable1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct integer_multiplicative2
|
struct integer_multiplicative2
|
||||||
: multiplicative2<T, U
|
: multiplicative2<T, U
|
||||||
, modable2<T, U, B
|
, modable2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct integer_multiplicative1
|
struct integer_multiplicative1
|
||||||
: multiplicative1<T
|
: multiplicative1<T
|
||||||
, modable1<T, B
|
, modable1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct arithmetic2
|
struct arithmetic2
|
||||||
: additive2<T, U
|
: additive2<T, U
|
||||||
, multiplicative2<T, U, B
|
, multiplicative2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct arithmetic1
|
struct arithmetic1
|
||||||
: additive1<T
|
: additive1<T
|
||||||
, multiplicative1<T, B
|
, multiplicative1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct integer_arithmetic2
|
struct integer_arithmetic2
|
||||||
: additive2<T, U
|
: additive2<T, U
|
||||||
, integer_multiplicative2<T, U, B
|
, integer_multiplicative2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct integer_arithmetic1
|
struct integer_arithmetic1
|
||||||
: additive1<T
|
: additive1<T
|
||||||
, integer_multiplicative1<T, B
|
, integer_multiplicative1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct bitwise2
|
struct bitwise2
|
||||||
: xorable2<T, U
|
: xorable2<T, U
|
||||||
, andable2<T, U
|
, andable2<T, U
|
||||||
, orable2<T, U, B
|
, orable2<T, U, B
|
||||||
> > > {};
|
> > > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct bitwise1
|
struct bitwise1
|
||||||
: xorable1<T
|
: xorable1<T
|
||||||
, andable1<T
|
, andable1<T
|
||||||
, orable1<T, B
|
, orable1<T, B
|
||||||
> > > {};
|
> > > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct unit_steppable
|
struct unit_steppable
|
||||||
: incrementable<T
|
: incrementable<T
|
||||||
, decrementable<T, B
|
, decrementable<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct shiftable2
|
struct shiftable2
|
||||||
: left_shiftable2<T, U
|
: left_shiftable2<T, U
|
||||||
, right_shiftable2<T, U, B
|
, right_shiftable2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct shiftable1
|
struct shiftable1
|
||||||
: left_shiftable1<T
|
: left_shiftable1<T
|
||||||
, right_shiftable1<T, B
|
, right_shiftable1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct ring_operators2
|
struct ring_operators2
|
||||||
: additive2<T, U
|
: additive2<T, U
|
||||||
, subtractable2_left<T, U
|
, subtractable2_left<T, U
|
||||||
, multipliable2<T, U, B
|
, multipliable2<T, U, B
|
||||||
> > > {};
|
> > > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct ring_operators1
|
struct ring_operators1
|
||||||
: additive1<T
|
: additive1<T
|
||||||
, multipliable1<T, B
|
, multipliable1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct ordered_ring_operators2
|
struct ordered_ring_operators2
|
||||||
: ring_operators2<T, U
|
: ring_operators2<T, U
|
||||||
, totally_ordered2<T, U, B
|
, totally_ordered2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct ordered_ring_operators1
|
struct ordered_ring_operators1
|
||||||
: ring_operators1<T
|
: ring_operators1<T
|
||||||
, totally_ordered1<T, B
|
, totally_ordered1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct field_operators2
|
struct field_operators2
|
||||||
: ring_operators2<T, U
|
: ring_operators2<T, U
|
||||||
, dividable2<T, U
|
, dividable2<T, U
|
||||||
, dividable2_left<T, U, B
|
, dividable2_left<T, U, B
|
||||||
> > > {};
|
> > > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct field_operators1
|
struct field_operators1
|
||||||
: ring_operators1<T
|
: ring_operators1<T
|
||||||
, dividable1<T, B
|
, dividable1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct ordered_field_operators2
|
struct ordered_field_operators2
|
||||||
: field_operators2<T, U
|
: field_operators2<T, U
|
||||||
, totally_ordered2<T, U, B
|
, totally_ordered2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct ordered_field_operators1
|
struct ordered_field_operators1
|
||||||
: field_operators1<T
|
: field_operators1<T
|
||||||
, totally_ordered1<T, B
|
, totally_ordered1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct euclidian_ring_operators2
|
struct euclidian_ring_operators2
|
||||||
: ring_operators2<T, U
|
: ring_operators2<T, U
|
||||||
, dividable2<T, U
|
, dividable2<T, U
|
||||||
@@ -579,71 +562,43 @@ struct euclidian_ring_operators2
|
|||||||
, modable2_left<T, U, B
|
, modable2_left<T, U, B
|
||||||
> > > > > {};
|
> > > > > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct euclidian_ring_operators1
|
struct euclidian_ring_operators1
|
||||||
: ring_operators1<T
|
: ring_operators1<T
|
||||||
, dividable1<T
|
, dividable1<T
|
||||||
, modable1<T, B
|
, modable1<T, B
|
||||||
> > > {};
|
> > > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
||||||
struct ordered_euclidian_ring_operators2
|
struct ordered_euclidian_ring_operators2
|
||||||
: totally_ordered2<T, U
|
: totally_ordered2<T, U
|
||||||
, euclidian_ring_operators2<T, U, B
|
, euclidian_ring_operators2<T, U, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct ordered_euclidian_ring_operators1
|
struct ordered_euclidian_ring_operators1
|
||||||
: totally_ordered1<T
|
: totally_ordered1<T
|
||||||
, euclidian_ring_operators1<T, B
|
, euclidian_ring_operators1<T, B
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
template <class T, class P, class B = ::boost::detail::empty_base<T> >
|
||||||
struct euclidean_ring_operators2
|
|
||||||
: ring_operators2<T, U
|
|
||||||
, dividable2<T, U
|
|
||||||
, dividable2_left<T, U
|
|
||||||
, modable2<T, U
|
|
||||||
, modable2_left<T, U, B
|
|
||||||
> > > > > {};
|
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
|
||||||
struct euclidean_ring_operators1
|
|
||||||
: ring_operators1<T
|
|
||||||
, dividable1<T
|
|
||||||
, modable1<T, B
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = operators_detail::empty_base<T> >
|
|
||||||
struct ordered_euclidean_ring_operators2
|
|
||||||
: totally_ordered2<T, U
|
|
||||||
, euclidean_ring_operators2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
|
||||||
struct ordered_euclidean_ring_operators1
|
|
||||||
: totally_ordered1<T
|
|
||||||
, euclidean_ring_operators1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class P, class B = operators_detail::empty_base<T> >
|
|
||||||
struct input_iteratable
|
struct input_iteratable
|
||||||
: equality_comparable1<T
|
: equality_comparable1<T
|
||||||
, incrementable<T
|
, incrementable<T
|
||||||
, dereferenceable<T, P, B
|
, dereferenceable<T, P, B
|
||||||
> > > {};
|
> > > {};
|
||||||
|
|
||||||
template <class T, class B = operators_detail::empty_base<T> >
|
template <class T, class B = ::boost::detail::empty_base<T> >
|
||||||
struct output_iteratable
|
struct output_iteratable
|
||||||
: incrementable<T, B
|
: incrementable<T, B
|
||||||
> {};
|
> {};
|
||||||
|
|
||||||
template <class T, class P, class B = operators_detail::empty_base<T> >
|
template <class T, class P, class B = ::boost::detail::empty_base<T> >
|
||||||
struct forward_iteratable
|
struct forward_iteratable
|
||||||
: input_iteratable<T, P, B
|
: input_iteratable<T, P, B
|
||||||
> {};
|
> {};
|
||||||
|
|
||||||
template <class T, class P, class B = operators_detail::empty_base<T> >
|
template <class T, class P, class B = ::boost::detail::empty_base<T> >
|
||||||
struct bidirectional_iteratable
|
struct bidirectional_iteratable
|
||||||
: forward_iteratable<T, P
|
: forward_iteratable<T, P
|
||||||
, decrementable<T, B
|
, decrementable<T, B
|
||||||
@@ -653,7 +608,7 @@ struct bidirectional_iteratable
|
|||||||
// which is an indirect base class of bidirectional_iterable,
|
// which is an indirect base class of bidirectional_iterable,
|
||||||
// random_access_iteratable must not be derived from totally_ordered1
|
// random_access_iteratable must not be derived from totally_ordered1
|
||||||
// but from less_than_comparable1 only. (Helmut Zeisel, 02-Dec-2001)
|
// but from less_than_comparable1 only. (Helmut Zeisel, 02-Dec-2001)
|
||||||
template <class T, class P, class D, class R, class B = operators_detail::empty_base<T> >
|
template <class T, class P, class D, class R, class B = ::boost::detail::empty_base<T> >
|
||||||
struct random_access_iteratable
|
struct random_access_iteratable
|
||||||
: bidirectional_iteratable<T, P
|
: bidirectional_iteratable<T, P
|
||||||
, less_than_comparable1<T
|
, less_than_comparable1<T
|
||||||
@@ -661,64 +616,125 @@ struct random_access_iteratable
|
|||||||
, indexable<T, D, R, B
|
, indexable<T, D, R, B
|
||||||
> > > > {};
|
> > > > {};
|
||||||
|
|
||||||
|
#ifndef BOOST_NO_OPERATORS_IN_NAMESPACE
|
||||||
|
} // namespace boost
|
||||||
|
#endif // BOOST_NO_OPERATORS_IN_NAMESPACE
|
||||||
|
|
||||||
|
|
||||||
|
// BOOST_IMPORT_TEMPLATE1 .. BOOST_IMPORT_TEMPLATE4 -
|
||||||
|
//
|
||||||
|
// When BOOST_NO_OPERATORS_IN_NAMESPACE is defined we need a way to import an
|
||||||
|
// operator template into the boost namespace. BOOST_IMPORT_TEMPLATE1 is used
|
||||||
|
// for one-argument forms of operator templates; BOOST_IMPORT_TEMPLATE2 for
|
||||||
|
// two-argument forms. Note that these macros expect to be invoked from within
|
||||||
|
// boost.
|
||||||
|
|
||||||
|
#ifndef BOOST_NO_OPERATORS_IN_NAMESPACE
|
||||||
|
|
||||||
|
// The template is already in boost so we have nothing to do.
|
||||||
|
# define BOOST_IMPORT_TEMPLATE4(template_name)
|
||||||
|
# define BOOST_IMPORT_TEMPLATE3(template_name)
|
||||||
|
# define BOOST_IMPORT_TEMPLATE2(template_name)
|
||||||
|
# define BOOST_IMPORT_TEMPLATE1(template_name)
|
||||||
|
|
||||||
|
#else // BOOST_NO_OPERATORS_IN_NAMESPACE
|
||||||
|
|
||||||
|
# ifndef BOOST_NO_USING_TEMPLATE
|
||||||
|
|
||||||
|
// Bring the names in with a using-declaration
|
||||||
|
// to avoid stressing the compiler.
|
||||||
|
# define BOOST_IMPORT_TEMPLATE4(template_name) using ::template_name;
|
||||||
|
# define BOOST_IMPORT_TEMPLATE3(template_name) using ::template_name;
|
||||||
|
# define BOOST_IMPORT_TEMPLATE2(template_name) using ::template_name;
|
||||||
|
# define BOOST_IMPORT_TEMPLATE1(template_name) using ::template_name;
|
||||||
|
|
||||||
|
# else
|
||||||
|
|
||||||
|
// Otherwise, because a Borland C++ 5.5 bug prevents a using declaration
|
||||||
|
// from working, we are forced to use inheritance for that compiler.
|
||||||
|
# define BOOST_IMPORT_TEMPLATE4(template_name) \
|
||||||
|
template <class T, class U, class V, class W, class B = ::boost::detail::empty_base<T> > \
|
||||||
|
struct template_name : ::template_name<T, U, V, W, B> {};
|
||||||
|
|
||||||
|
# define BOOST_IMPORT_TEMPLATE3(template_name) \
|
||||||
|
template <class T, class U, class V, class B = ::boost::detail::empty_base<T> > \
|
||||||
|
struct template_name : ::template_name<T, U, V, B> {};
|
||||||
|
|
||||||
|
# define BOOST_IMPORT_TEMPLATE2(template_name) \
|
||||||
|
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
||||||
|
struct template_name : ::template_name<T, U, B> {};
|
||||||
|
|
||||||
|
# define BOOST_IMPORT_TEMPLATE1(template_name) \
|
||||||
|
template <class T, class B = ::boost::detail::empty_base<T> > \
|
||||||
|
struct template_name : ::template_name<T, B> {};
|
||||||
|
|
||||||
|
# endif // BOOST_NO_USING_TEMPLATE
|
||||||
|
|
||||||
|
#endif // BOOST_NO_OPERATORS_IN_NAMESPACE
|
||||||
|
|
||||||
//
|
//
|
||||||
// Here's where we put it all together, defining the xxxx forms of the templates.
|
// Here's where we put it all together, defining the xxxx forms of the templates
|
||||||
// We also define specializations of is_chained_base<> for
|
// in namespace boost. We also define specializations of is_chained_base<> for
|
||||||
// the xxxx, xxxx1, and xxxx2 templates.
|
// the xxxx, xxxx1, and xxxx2 templates, importing them into boost:: as
|
||||||
|
// necessary.
|
||||||
//
|
//
|
||||||
|
#ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
namespace operators_detail
|
|
||||||
{
|
|
||||||
|
|
||||||
// A type parameter is used instead of a plain bool because Borland's compiler
|
|
||||||
// didn't cope well with the more obvious non-type template parameter.
|
|
||||||
struct true_t {};
|
|
||||||
struct false_t {};
|
|
||||||
|
|
||||||
} // namespace operators_detail
|
|
||||||
|
|
||||||
// is_chained_base<> - a traits class used to distinguish whether an operator
|
// is_chained_base<> - a traits class used to distinguish whether an operator
|
||||||
// template argument is being used for base class chaining, or is specifying a
|
// template argument is being used for base class chaining, or is specifying a
|
||||||
// 2nd argument type.
|
// 2nd argument type.
|
||||||
|
|
||||||
|
namespace boost {
|
||||||
|
// A type parameter is used instead of a plain bool because Borland's compiler
|
||||||
|
// didn't cope well with the more obvious non-type template parameter.
|
||||||
|
namespace detail {
|
||||||
|
struct true_t {};
|
||||||
|
struct false_t {};
|
||||||
|
} // namespace detail
|
||||||
|
|
||||||
// Unspecialized version assumes that most types are not being used for base
|
// Unspecialized version assumes that most types are not being used for base
|
||||||
// class chaining. We specialize for the operator templates defined in this
|
// class chaining. We specialize for the operator templates defined in this
|
||||||
// library.
|
// library.
|
||||||
template<class T> struct is_chained_base {
|
template<class T> struct is_chained_base {
|
||||||
typedef operators_detail::false_t value;
|
typedef ::boost::detail::false_t value;
|
||||||
};
|
};
|
||||||
|
|
||||||
// Provide a specialization of 'is_chained_base<>'
|
} // namespace boost
|
||||||
// for a 4-type-argument operator template.
|
|
||||||
|
// Import a 4-type-argument operator template into boost (if necessary) and
|
||||||
|
// provide a specialization of 'is_chained_base<>' for it.
|
||||||
# define BOOST_OPERATOR_TEMPLATE4(template_name4) \
|
# define BOOST_OPERATOR_TEMPLATE4(template_name4) \
|
||||||
|
BOOST_IMPORT_TEMPLATE4(template_name4) \
|
||||||
template<class T, class U, class V, class W, class B> \
|
template<class T, class U, class V, class W, class B> \
|
||||||
struct is_chained_base< template_name4<T, U, V, W, B> > { \
|
struct is_chained_base< ::boost::template_name4<T, U, V, W, B> > { \
|
||||||
typedef operators_detail::true_t value; \
|
typedef ::boost::detail::true_t value; \
|
||||||
};
|
};
|
||||||
|
|
||||||
// Provide a specialization of 'is_chained_base<>'
|
// Import a 3-type-argument operator template into boost (if necessary) and
|
||||||
// for a 3-type-argument operator template.
|
// provide a specialization of 'is_chained_base<>' for it.
|
||||||
# define BOOST_OPERATOR_TEMPLATE3(template_name3) \
|
# define BOOST_OPERATOR_TEMPLATE3(template_name3) \
|
||||||
|
BOOST_IMPORT_TEMPLATE3(template_name3) \
|
||||||
template<class T, class U, class V, class B> \
|
template<class T, class U, class V, class B> \
|
||||||
struct is_chained_base< template_name3<T, U, V, B> > { \
|
struct is_chained_base< ::boost::template_name3<T, U, V, B> > { \
|
||||||
typedef operators_detail::true_t value; \
|
typedef ::boost::detail::true_t value; \
|
||||||
};
|
};
|
||||||
|
|
||||||
// Provide a specialization of 'is_chained_base<>'
|
// Import a 2-type-argument operator template into boost (if necessary) and
|
||||||
// for a 2-type-argument operator template.
|
// provide a specialization of 'is_chained_base<>' for it.
|
||||||
# define BOOST_OPERATOR_TEMPLATE2(template_name2) \
|
# define BOOST_OPERATOR_TEMPLATE2(template_name2) \
|
||||||
|
BOOST_IMPORT_TEMPLATE2(template_name2) \
|
||||||
template<class T, class U, class B> \
|
template<class T, class U, class B> \
|
||||||
struct is_chained_base< template_name2<T, U, B> > { \
|
struct is_chained_base< ::boost::template_name2<T, U, B> > { \
|
||||||
typedef operators_detail::true_t value; \
|
typedef ::boost::detail::true_t value; \
|
||||||
};
|
};
|
||||||
|
|
||||||
// Provide a specialization of 'is_chained_base<>'
|
// Import a 1-type-argument operator template into boost (if necessary) and
|
||||||
// for a 1-type-argument operator template.
|
// provide a specialization of 'is_chained_base<>' for it.
|
||||||
# define BOOST_OPERATOR_TEMPLATE1(template_name1) \
|
# define BOOST_OPERATOR_TEMPLATE1(template_name1) \
|
||||||
|
BOOST_IMPORT_TEMPLATE1(template_name1) \
|
||||||
template<class T, class B> \
|
template<class T, class B> \
|
||||||
struct is_chained_base< template_name1<T, B> > { \
|
struct is_chained_base< ::boost::template_name1<T, B> > { \
|
||||||
typedef operators_detail::true_t value; \
|
typedef ::boost::detail::true_t value; \
|
||||||
};
|
};
|
||||||
|
|
||||||
// BOOST_OPERATOR_TEMPLATE(template_name) defines template_name<> such that it
|
// BOOST_OPERATOR_TEMPLATE(template_name) defines template_name<> such that it
|
||||||
@@ -738,31 +754,49 @@ template<class T> struct is_chained_base {
|
|||||||
# define BOOST_OPERATOR_TEMPLATE(template_name) \
|
# define BOOST_OPERATOR_TEMPLATE(template_name) \
|
||||||
template <class T \
|
template <class T \
|
||||||
,class U = T \
|
,class U = T \
|
||||||
,class B = operators_detail::empty_base<T> \
|
,class B = ::boost::detail::empty_base<T> \
|
||||||
,class O = typename is_chained_base<U>::value \
|
,class O = typename is_chained_base<U>::value \
|
||||||
> \
|
> \
|
||||||
struct template_name; \
|
struct template_name : template_name##2<T, U, B> {}; \
|
||||||
\
|
\
|
||||||
template<class T, class U, class B> \
|
template<class T, class U, class B> \
|
||||||
struct template_name<T, U, B, operators_detail::false_t> \
|
struct template_name<T, U, B, ::boost::detail::true_t> \
|
||||||
: template_name##2<T, U, B> {}; \
|
|
||||||
\
|
|
||||||
template<class T, class U> \
|
|
||||||
struct template_name<T, U, operators_detail::empty_base<T>, operators_detail::true_t> \
|
|
||||||
: template_name##1<T, U> {}; \
|
: template_name##1<T, U> {}; \
|
||||||
\
|
\
|
||||||
template <class T, class B> \
|
template <class T, class B> \
|
||||||
struct template_name<T, T, B, operators_detail::false_t> \
|
struct template_name<T, T, B, ::boost::detail::false_t> \
|
||||||
: template_name##1<T, B> {}; \
|
: template_name##1<T, B> {}; \
|
||||||
\
|
\
|
||||||
template<class T, class U, class B, class O> \
|
template<class T, class U, class B, class O> \
|
||||||
struct is_chained_base< template_name<T, U, B, O> > { \
|
struct is_chained_base< ::boost::template_name<T, U, B, O> > { \
|
||||||
typedef operators_detail::true_t value; \
|
typedef ::boost::detail::true_t value; \
|
||||||
}; \
|
}; \
|
||||||
\
|
\
|
||||||
BOOST_OPERATOR_TEMPLATE2(template_name##2) \
|
BOOST_OPERATOR_TEMPLATE2(template_name##2) \
|
||||||
BOOST_OPERATOR_TEMPLATE1(template_name##1)
|
BOOST_OPERATOR_TEMPLATE1(template_name##1)
|
||||||
|
|
||||||
|
|
||||||
|
#else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
|
|
||||||
|
# define BOOST_OPERATOR_TEMPLATE4(template_name4) \
|
||||||
|
BOOST_IMPORT_TEMPLATE4(template_name4)
|
||||||
|
# define BOOST_OPERATOR_TEMPLATE3(template_name3) \
|
||||||
|
BOOST_IMPORT_TEMPLATE3(template_name3)
|
||||||
|
# define BOOST_OPERATOR_TEMPLATE2(template_name2) \
|
||||||
|
BOOST_IMPORT_TEMPLATE2(template_name2)
|
||||||
|
# define BOOST_OPERATOR_TEMPLATE1(template_name1) \
|
||||||
|
BOOST_IMPORT_TEMPLATE1(template_name1)
|
||||||
|
|
||||||
|
// In this case we can only assume that template_name<> is equivalent to the
|
||||||
|
// more commonly needed template_name1<> form.
|
||||||
|
# define BOOST_OPERATOR_TEMPLATE(template_name) \
|
||||||
|
template <class T, class B = ::boost::detail::empty_base<T> > \
|
||||||
|
struct template_name : template_name##1<T, B> {};
|
||||||
|
|
||||||
|
#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
|
|
||||||
|
namespace boost {
|
||||||
|
|
||||||
BOOST_OPERATOR_TEMPLATE(less_than_comparable)
|
BOOST_OPERATOR_TEMPLATE(less_than_comparable)
|
||||||
BOOST_OPERATOR_TEMPLATE(equality_comparable)
|
BOOST_OPERATOR_TEMPLATE(equality_comparable)
|
||||||
BOOST_OPERATOR_TEMPLATE(multipliable)
|
BOOST_OPERATOR_TEMPLATE(multipliable)
|
||||||
@@ -803,8 +837,6 @@ BOOST_OPERATOR_TEMPLATE(field_operators)
|
|||||||
BOOST_OPERATOR_TEMPLATE(ordered_field_operators)
|
BOOST_OPERATOR_TEMPLATE(ordered_field_operators)
|
||||||
BOOST_OPERATOR_TEMPLATE(euclidian_ring_operators)
|
BOOST_OPERATOR_TEMPLATE(euclidian_ring_operators)
|
||||||
BOOST_OPERATOR_TEMPLATE(ordered_euclidian_ring_operators)
|
BOOST_OPERATOR_TEMPLATE(ordered_euclidian_ring_operators)
|
||||||
BOOST_OPERATOR_TEMPLATE(euclidean_ring_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(ordered_euclidean_ring_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(input_iteratable)
|
BOOST_OPERATOR_TEMPLATE2(input_iteratable)
|
||||||
BOOST_OPERATOR_TEMPLATE1(output_iteratable)
|
BOOST_OPERATOR_TEMPLATE1(output_iteratable)
|
||||||
BOOST_OPERATOR_TEMPLATE2(forward_iteratable)
|
BOOST_OPERATOR_TEMPLATE2(forward_iteratable)
|
||||||
@@ -816,7 +848,13 @@ BOOST_OPERATOR_TEMPLATE4(random_access_iteratable)
|
|||||||
#undef BOOST_OPERATOR_TEMPLATE3
|
#undef BOOST_OPERATOR_TEMPLATE3
|
||||||
#undef BOOST_OPERATOR_TEMPLATE2
|
#undef BOOST_OPERATOR_TEMPLATE2
|
||||||
#undef BOOST_OPERATOR_TEMPLATE1
|
#undef BOOST_OPERATOR_TEMPLATE1
|
||||||
|
#undef BOOST_IMPORT_TEMPLATE1
|
||||||
|
#undef BOOST_IMPORT_TEMPLATE2
|
||||||
|
#undef BOOST_IMPORT_TEMPLATE3
|
||||||
|
#undef BOOST_IMPORT_TEMPLATE4
|
||||||
|
|
||||||
|
// The following 'operators' classes can only be used portably if the derived class
|
||||||
|
// declares ALL of the required member operators.
|
||||||
template <class T, class U>
|
template <class T, class U>
|
||||||
struct operators2
|
struct operators2
|
||||||
: totally_ordered2<T,U
|
: totally_ordered2<T,U
|
||||||
@@ -824,10 +862,14 @@ struct operators2
|
|||||||
, bitwise2<T,U
|
, bitwise2<T,U
|
||||||
> > > {};
|
> > > {};
|
||||||
|
|
||||||
|
#ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
template <class T, class U = T>
|
template <class T, class U = T>
|
||||||
struct operators : operators2<T, U> {};
|
struct operators : operators2<T, U> {};
|
||||||
|
|
||||||
template <class T> struct operators<T, T>
|
template <class T> struct operators<T, T>
|
||||||
|
#else
|
||||||
|
template <class T> struct operators
|
||||||
|
#endif
|
||||||
: totally_ordered<T
|
: totally_ordered<T
|
||||||
, integer_arithmetic<T
|
, integer_arithmetic<T
|
||||||
, bitwise<T
|
, bitwise<T
|
||||||
@@ -837,21 +879,6 @@ template <class T> struct operators<T, T>
|
|||||||
// Iterator helper classes (contributed by Jeremy Siek) -------------------//
|
// Iterator helper classes (contributed by Jeremy Siek) -------------------//
|
||||||
// (Input and output iterator helpers contributed by Daryle Walker) -------//
|
// (Input and output iterator helpers contributed by Daryle Walker) -------//
|
||||||
// (Changed to use combined operator classes by Daryle Walker) ------------//
|
// (Changed to use combined operator classes by Daryle Walker) ------------//
|
||||||
// (Adapted to C++17 by Daniel Frey) --------------------------------------//
|
|
||||||
template <class Category,
|
|
||||||
class T,
|
|
||||||
class Distance = std::ptrdiff_t,
|
|
||||||
class Pointer = T*,
|
|
||||||
class Reference = T&>
|
|
||||||
struct iterator_helper
|
|
||||||
{
|
|
||||||
typedef Category iterator_category;
|
|
||||||
typedef T value_type;
|
|
||||||
typedef Distance difference_type;
|
|
||||||
typedef Pointer pointer;
|
|
||||||
typedef Reference reference;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T,
|
template <class T,
|
||||||
class V,
|
class V,
|
||||||
class D = std::ptrdiff_t,
|
class D = std::ptrdiff_t,
|
||||||
@@ -859,13 +886,13 @@ template <class T,
|
|||||||
class R = V const &>
|
class R = V const &>
|
||||||
struct input_iterator_helper
|
struct input_iterator_helper
|
||||||
: input_iteratable<T, P
|
: input_iteratable<T, P
|
||||||
, iterator_helper<std::input_iterator_tag, V, D, P, R
|
, boost::iterator<std::input_iterator_tag, V, D, P, R
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template<class T>
|
template<class T>
|
||||||
struct output_iterator_helper
|
struct output_iterator_helper
|
||||||
: output_iteratable<T
|
: output_iteratable<T
|
||||||
, iterator_helper<std::output_iterator_tag, void, void, void, void
|
, boost::iterator<std::output_iterator_tag, void, void, void, void
|
||||||
> >
|
> >
|
||||||
{
|
{
|
||||||
T& operator*() { return static_cast<T&>(*this); }
|
T& operator*() { return static_cast<T&>(*this); }
|
||||||
@@ -879,7 +906,7 @@ template <class T,
|
|||||||
class R = V&>
|
class R = V&>
|
||||||
struct forward_iterator_helper
|
struct forward_iterator_helper
|
||||||
: forward_iteratable<T, P
|
: forward_iteratable<T, P
|
||||||
, iterator_helper<std::forward_iterator_tag, V, D, P, R
|
, boost::iterator<std::forward_iterator_tag, V, D, P, R
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T,
|
template <class T,
|
||||||
@@ -889,7 +916,7 @@ template <class T,
|
|||||||
class R = V&>
|
class R = V&>
|
||||||
struct bidirectional_iterator_helper
|
struct bidirectional_iterator_helper
|
||||||
: bidirectional_iteratable<T, P
|
: bidirectional_iteratable<T, P
|
||||||
, iterator_helper<std::bidirectional_iterator_tag, V, D, P, R
|
, boost::iterator<std::bidirectional_iterator_tag, V, D, P, R
|
||||||
> > {};
|
> > {};
|
||||||
|
|
||||||
template <class T,
|
template <class T,
|
||||||
@@ -899,7 +926,7 @@ template <class T,
|
|||||||
class R = V&>
|
class R = V&>
|
||||||
struct random_access_iterator_helper
|
struct random_access_iterator_helper
|
||||||
: random_access_iteratable<T, P, D, R
|
: random_access_iteratable<T, P, D, R
|
||||||
, iterator_helper<std::random_access_iterator_tag, V, D, P, R
|
, boost::iterator<std::random_access_iterator_tag, V, D, P, R
|
||||||
> >
|
> >
|
||||||
{
|
{
|
||||||
friend D requires_difference_operator(const T& x, const T& y) {
|
friend D requires_difference_operator(const T& x, const T& y) {
|
||||||
@@ -907,14 +934,10 @@ struct random_access_iterator_helper
|
|||||||
}
|
}
|
||||||
}; // random_access_iterator_helper
|
}; // random_access_iterator_helper
|
||||||
|
|
||||||
} // namespace operators_impl
|
|
||||||
using namespace operators_impl;
|
|
||||||
|
|
||||||
} // namespace boost
|
} // namespace boost
|
||||||
|
|
||||||
#if defined(__sgi) && !defined(__GNUC__)
|
#if defined(__sgi) && !defined(__GNUC__)
|
||||||
#pragma reset woff 1234
|
#pragma reset woff 1234
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#endif // BOOST_NO_OPERATORS_IN_NAMESPACE
|
|
||||||
#endif // BOOST_OPERATORS_HPP
|
#endif // BOOST_OPERATORS_HPP
|
||||||
|
|||||||
@@ -1,951 +0,0 @@
|
|||||||
// Boost operators.hpp header file ----------------------------------------//
|
|
||||||
|
|
||||||
// (C) Copyright David Abrahams, Jeremy Siek, Daryle Walker 1999-2001.
|
|
||||||
// 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/utility/operators.htm for documentation.
|
|
||||||
|
|
||||||
// Revision History
|
|
||||||
// 22 Feb 16 Preserve old work-arounds. (Daniel Frey)
|
|
||||||
// 16 Dec 10 Limit warning suppression for 4284 to older versions of VC++
|
|
||||||
// (Matthew Bradbury, fixes #4432)
|
|
||||||
// 07 Aug 08 Added "euclidean" spelling. (Daniel Frey)
|
|
||||||
// 03 Apr 08 Make sure "convertible to bool" is sufficient
|
|
||||||
// for T::operator<, etc. (Daniel Frey)
|
|
||||||
// 24 May 07 Changed empty_base to depend on T, see
|
|
||||||
// http://svn.boost.org/trac/boost/ticket/979
|
|
||||||
// 21 Oct 02 Modified implementation of operators to allow compilers with a
|
|
||||||
// correct named return value optimization (NRVO) to produce optimal
|
|
||||||
// code. (Daniel Frey)
|
|
||||||
// 02 Dec 01 Bug fixed in random_access_iteratable. (Helmut Zeisel)
|
|
||||||
// 28 Sep 01 Factored out iterator operator groups. (Daryle Walker)
|
|
||||||
// 27 Aug 01 'left' form for non commutative operators added;
|
|
||||||
// additional classes for groups of related operators added;
|
|
||||||
// workaround for empty base class optimization
|
|
||||||
// bug of GCC 3.0 (Helmut Zeisel)
|
|
||||||
// 25 Jun 01 output_iterator_helper changes: removed default template
|
|
||||||
// parameters, added support for self-proxying, additional
|
|
||||||
// documentation and tests (Aleksey Gurtovoy)
|
|
||||||
// 29 May 01 Added operator classes for << and >>. Added input and output
|
|
||||||
// iterator helper classes. Added classes to connect equality and
|
|
||||||
// relational operators. Added classes for groups of related
|
|
||||||
// operators. Reimplemented example operator and iterator helper
|
|
||||||
// classes in terms of the new groups. (Daryle Walker, with help
|
|
||||||
// from Alexy Gurtovoy)
|
|
||||||
// 11 Feb 01 Fixed bugs in the iterator helpers which prevented explicitly
|
|
||||||
// supplied arguments from actually being used (Dave Abrahams)
|
|
||||||
// 04 Jul 00 Fixed NO_OPERATORS_IN_NAMESPACE bugs, major cleanup and
|
|
||||||
// refactoring of compiler workarounds, additional documentation
|
|
||||||
// (Alexy Gurtovoy and Mark Rodgers with some help and prompting from
|
|
||||||
// Dave Abrahams)
|
|
||||||
// 28 Jun 00 General cleanup and integration of bugfixes from Mark Rodgers and
|
|
||||||
// Jeremy Siek (Dave Abrahams)
|
|
||||||
// 20 Jun 00 Changes to accommodate Borland C++Builder 4 and Borland C++ 5.5
|
|
||||||
// (Mark Rodgers)
|
|
||||||
// 20 Jun 00 Minor fixes to the prior revision (Aleksey Gurtovoy)
|
|
||||||
// 10 Jun 00 Support for the base class chaining technique was added
|
|
||||||
// (Aleksey Gurtovoy). See documentation and the comments below
|
|
||||||
// for the details.
|
|
||||||
// 12 Dec 99 Initial version with iterator operators (Jeremy Siek)
|
|
||||||
// 18 Nov 99 Change name "divideable" to "dividable", remove unnecessary
|
|
||||||
// specializations of dividable, subtractable, modable (Ed Brey)
|
|
||||||
// 17 Nov 99 Add comments (Beman Dawes)
|
|
||||||
// Remove unnecessary specialization of operators<> (Ed Brey)
|
|
||||||
// 15 Nov 99 Fix less_than_comparable<T,U> second operand type for first two
|
|
||||||
// operators.(Beman Dawes)
|
|
||||||
// 12 Nov 99 Add operators templates (Ed Brey)
|
|
||||||
// 11 Nov 99 Add single template parameter version for compilers without
|
|
||||||
// partial specialization (Beman Dawes)
|
|
||||||
// 10 Nov 99 Initial version
|
|
||||||
|
|
||||||
// 10 Jun 00:
|
|
||||||
// An additional optional template parameter was added to most of
|
|
||||||
// operator templates to support the base class chaining technique (see
|
|
||||||
// documentation for the details). Unfortunately, a straightforward
|
|
||||||
// implementation of this change would have broken compatibility with the
|
|
||||||
// previous version of the library by making it impossible to use the same
|
|
||||||
// template name (e.g. 'addable') for both the 1- and 2-argument versions of
|
|
||||||
// an operator template. This implementation solves the backward-compatibility
|
|
||||||
// issue at the cost of some simplicity.
|
|
||||||
//
|
|
||||||
// One of the complications is an existence of special auxiliary class template
|
|
||||||
// 'is_chained_base<>' (see 'detail' namespace below), which is used
|
|
||||||
// to determine whether its template parameter is a library's operator template
|
|
||||||
// or not. You have to specialize 'is_chained_base<>' for each new
|
|
||||||
// operator template you add to the library.
|
|
||||||
//
|
|
||||||
// However, most of the non-trivial implementation details are hidden behind
|
|
||||||
// several local macros defined below, and as soon as you understand them,
|
|
||||||
// you understand the whole library implementation.
|
|
||||||
|
|
||||||
#ifndef BOOST_OPERATORS_V1_HPP
|
|
||||||
#define BOOST_OPERATORS_V1_HPP
|
|
||||||
|
|
||||||
#include <cstddef>
|
|
||||||
#include <iterator>
|
|
||||||
|
|
||||||
#include <boost/config.hpp>
|
|
||||||
#include <boost/detail/workaround.hpp>
|
|
||||||
|
|
||||||
#if defined(__sgi) && !defined(__GNUC__)
|
|
||||||
# pragma set woff 1234
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if BOOST_WORKAROUND(BOOST_MSVC, < 1600)
|
|
||||||
# pragma warning( disable : 4284 ) // complaint about return type of
|
|
||||||
#endif // operator-> not begin a UDT
|
|
||||||
|
|
||||||
namespace boost {
|
|
||||||
namespace detail {
|
|
||||||
|
|
||||||
template <typename T> class empty_base {};
|
|
||||||
|
|
||||||
} // namespace detail
|
|
||||||
} // namespace boost
|
|
||||||
|
|
||||||
// In this section we supply the xxxx1 and xxxx2 forms of the operator
|
|
||||||
// templates, which are explicitly targeted at the 1-type-argument and
|
|
||||||
// 2-type-argument operator forms, respectively. Some compilers get confused
|
|
||||||
// when inline friend functions are overloaded in namespaces other than the
|
|
||||||
// global namespace. When BOOST_NO_OPERATORS_IN_NAMESPACE is defined, all of
|
|
||||||
// these templates must go in the global namespace.
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_OPERATORS_IN_NAMESPACE
|
|
||||||
namespace boost
|
|
||||||
{
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Basic operator classes (contributed by Dave Abrahams) ------------------//
|
|
||||||
|
|
||||||
// Note that friend functions defined in a class are implicitly inline.
|
|
||||||
// See the C++ std, 11.4 [class.friend] paragraph 5
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct less_than_comparable2 : B
|
|
||||||
{
|
|
||||||
friend bool operator<=(const T& x, const U& y) { return !static_cast<bool>(x > y); }
|
|
||||||
friend bool operator>=(const T& x, const U& y) { return !static_cast<bool>(x < y); }
|
|
||||||
friend bool operator>(const U& x, const T& y) { return y < x; }
|
|
||||||
friend bool operator<(const U& x, const T& y) { return y > x; }
|
|
||||||
friend bool operator<=(const U& x, const T& y) { return !static_cast<bool>(y < x); }
|
|
||||||
friend bool operator>=(const U& x, const T& y) { return !static_cast<bool>(y > x); }
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct less_than_comparable1 : B
|
|
||||||
{
|
|
||||||
friend bool operator>(const T& x, const T& y) { return y < x; }
|
|
||||||
friend bool operator<=(const T& x, const T& y) { return !static_cast<bool>(y < x); }
|
|
||||||
friend bool operator>=(const T& x, const T& y) { return !static_cast<bool>(x < y); }
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct equality_comparable2 : B
|
|
||||||
{
|
|
||||||
friend bool operator==(const U& y, const T& x) { return x == y; }
|
|
||||||
friend bool operator!=(const U& y, const T& x) { return !static_cast<bool>(x == y); }
|
|
||||||
friend bool operator!=(const T& y, const U& x) { return !static_cast<bool>(y == x); }
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct equality_comparable1 : B
|
|
||||||
{
|
|
||||||
friend bool operator!=(const T& x, const T& y) { return !static_cast<bool>(x == y); }
|
|
||||||
};
|
|
||||||
|
|
||||||
// A macro which produces "name_2left" from "name".
|
|
||||||
#define BOOST_OPERATOR2_LEFT(name) name##2##_##left
|
|
||||||
|
|
||||||
// NRVO-friendly implementation (contributed by Daniel Frey) ---------------//
|
|
||||||
|
|
||||||
#if defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
|
||||||
|
|
||||||
// This is the optimal implementation for ISO/ANSI C++,
|
|
||||||
// but it requires the compiler to implement the NRVO.
|
|
||||||
// If the compiler has no NRVO, this is the best symmetric
|
|
||||||
// implementation available.
|
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR_COMMUTATIVE( NAME, OP ) \
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##2 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( const T& lhs, const U& rhs ) \
|
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
|
||||||
friend T operator OP( const U& lhs, const T& rhs ) \
|
|
||||||
{ T nrv( rhs ); nrv OP##= lhs; return nrv; } \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##1 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( const T& lhs, const T& rhs ) \
|
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
|
||||||
};
|
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( NAME, OP ) \
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##2 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( const T& lhs, const U& rhs ) \
|
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct BOOST_OPERATOR2_LEFT(NAME) : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( const U& lhs, const T& rhs ) \
|
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##1 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( const T& lhs, const T& rhs ) \
|
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
|
||||||
};
|
|
||||||
|
|
||||||
#else // defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
|
||||||
|
|
||||||
// For compilers without NRVO the following code is optimal, but not
|
|
||||||
// symmetric! Note that the implementation of
|
|
||||||
// BOOST_OPERATOR2_LEFT(NAME) only looks cool, but doesn't provide
|
|
||||||
// optimization opportunities to the compiler :)
|
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR_COMMUTATIVE( NAME, OP ) \
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##2 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
|
||||||
friend T operator OP( const U& lhs, T rhs ) { return rhs OP##= lhs; } \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##1 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
|
||||||
};
|
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( NAME, OP ) \
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##2 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct BOOST_OPERATOR2_LEFT(NAME) : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( const U& lhs, const T& rhs ) \
|
|
||||||
{ return T( lhs ) OP##= rhs; } \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##1 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
|
||||||
};
|
|
||||||
|
|
||||||
#endif // defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
|
||||||
|
|
||||||
BOOST_BINARY_OPERATOR_COMMUTATIVE( multipliable, * )
|
|
||||||
BOOST_BINARY_OPERATOR_COMMUTATIVE( addable, + )
|
|
||||||
BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( subtractable, - )
|
|
||||||
BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( dividable, / )
|
|
||||||
BOOST_BINARY_OPERATOR_NON_COMMUTATIVE( modable, % )
|
|
||||||
BOOST_BINARY_OPERATOR_COMMUTATIVE( xorable, ^ )
|
|
||||||
BOOST_BINARY_OPERATOR_COMMUTATIVE( andable, & )
|
|
||||||
BOOST_BINARY_OPERATOR_COMMUTATIVE( orable, | )
|
|
||||||
|
|
||||||
#undef BOOST_BINARY_OPERATOR_COMMUTATIVE
|
|
||||||
#undef BOOST_BINARY_OPERATOR_NON_COMMUTATIVE
|
|
||||||
#undef BOOST_OPERATOR2_LEFT
|
|
||||||
|
|
||||||
// incrementable and decrementable contributed by Jeremy Siek
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct incrementable : B
|
|
||||||
{
|
|
||||||
friend T operator++(T& x, int)
|
|
||||||
{
|
|
||||||
incrementable_type nrv(x);
|
|
||||||
++x;
|
|
||||||
return nrv;
|
|
||||||
}
|
|
||||||
private: // The use of this typedef works around a Borland bug
|
|
||||||
typedef T incrementable_type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct decrementable : B
|
|
||||||
{
|
|
||||||
friend T operator--(T& x, int)
|
|
||||||
{
|
|
||||||
decrementable_type nrv(x);
|
|
||||||
--x;
|
|
||||||
return nrv;
|
|
||||||
}
|
|
||||||
private: // The use of this typedef works around a Borland bug
|
|
||||||
typedef T decrementable_type;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Iterator operator classes (contributed by Jeremy Siek) ------------------//
|
|
||||||
|
|
||||||
template <class T, class P, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct dereferenceable : B
|
|
||||||
{
|
|
||||||
P operator->() const
|
|
||||||
{
|
|
||||||
return &*static_cast<const T&>(*this);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T, class I, class R, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct indexable : B
|
|
||||||
{
|
|
||||||
R operator[](I n) const
|
|
||||||
{
|
|
||||||
return *(static_cast<const T&>(*this) + n);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// More operator classes (contributed by Daryle Walker) --------------------//
|
|
||||||
// (NRVO-friendly implementation contributed by Daniel Frey) ---------------//
|
|
||||||
|
|
||||||
#if defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR( NAME, OP ) \
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##2 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( const T& lhs, const U& rhs ) \
|
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##1 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( const T& lhs, const T& rhs ) \
|
|
||||||
{ T nrv( lhs ); nrv OP##= rhs; return nrv; } \
|
|
||||||
};
|
|
||||||
|
|
||||||
#else // defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
|
||||||
|
|
||||||
#define BOOST_BINARY_OPERATOR( NAME, OP ) \
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##2 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( T lhs, const U& rhs ) { return lhs OP##= rhs; } \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct NAME##1 : B \
|
|
||||||
{ \
|
|
||||||
friend T operator OP( T lhs, const T& rhs ) { return lhs OP##= rhs; } \
|
|
||||||
};
|
|
||||||
|
|
||||||
#endif // defined(BOOST_HAS_NRVO) || defined(BOOST_FORCE_SYMMETRIC_OPERATORS)
|
|
||||||
|
|
||||||
BOOST_BINARY_OPERATOR( left_shiftable, << )
|
|
||||||
BOOST_BINARY_OPERATOR( right_shiftable, >> )
|
|
||||||
|
|
||||||
#undef BOOST_BINARY_OPERATOR
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct equivalent2 : B
|
|
||||||
{
|
|
||||||
friend bool operator==(const T& x, const U& y)
|
|
||||||
{
|
|
||||||
return !static_cast<bool>(x < y) && !static_cast<bool>(x > y);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct equivalent1 : B
|
|
||||||
{
|
|
||||||
friend bool operator==(const T&x, const T&y)
|
|
||||||
{
|
|
||||||
return !static_cast<bool>(x < y) && !static_cast<bool>(y < x);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct partially_ordered2 : B
|
|
||||||
{
|
|
||||||
friend bool operator<=(const T& x, const U& y)
|
|
||||||
{ return static_cast<bool>(x < y) || static_cast<bool>(x == y); }
|
|
||||||
friend bool operator>=(const T& x, const U& y)
|
|
||||||
{ return static_cast<bool>(x > y) || static_cast<bool>(x == y); }
|
|
||||||
friend bool operator>(const U& x, const T& y)
|
|
||||||
{ return y < x; }
|
|
||||||
friend bool operator<(const U& x, const T& y)
|
|
||||||
{ return y > x; }
|
|
||||||
friend bool operator<=(const U& x, const T& y)
|
|
||||||
{ return static_cast<bool>(y > x) || static_cast<bool>(y == x); }
|
|
||||||
friend bool operator>=(const U& x, const T& y)
|
|
||||||
{ return static_cast<bool>(y < x) || static_cast<bool>(y == x); }
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct partially_ordered1 : B
|
|
||||||
{
|
|
||||||
friend bool operator>(const T& x, const T& y)
|
|
||||||
{ return y < x; }
|
|
||||||
friend bool operator<=(const T& x, const T& y)
|
|
||||||
{ return static_cast<bool>(x < y) || static_cast<bool>(x == y); }
|
|
||||||
friend bool operator>=(const T& x, const T& y)
|
|
||||||
{ return static_cast<bool>(y < x) || static_cast<bool>(x == y); }
|
|
||||||
};
|
|
||||||
|
|
||||||
// Combined operator classes (contributed by Daryle Walker) ----------------//
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct totally_ordered2
|
|
||||||
: less_than_comparable2<T, U
|
|
||||||
, equality_comparable2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct totally_ordered1
|
|
||||||
: less_than_comparable1<T
|
|
||||||
, equality_comparable1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct additive2
|
|
||||||
: addable2<T, U
|
|
||||||
, subtractable2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct additive1
|
|
||||||
: addable1<T
|
|
||||||
, subtractable1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct multiplicative2
|
|
||||||
: multipliable2<T, U
|
|
||||||
, dividable2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct multiplicative1
|
|
||||||
: multipliable1<T
|
|
||||||
, dividable1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct integer_multiplicative2
|
|
||||||
: multiplicative2<T, U
|
|
||||||
, modable2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct integer_multiplicative1
|
|
||||||
: multiplicative1<T
|
|
||||||
, modable1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct arithmetic2
|
|
||||||
: additive2<T, U
|
|
||||||
, multiplicative2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct arithmetic1
|
|
||||||
: additive1<T
|
|
||||||
, multiplicative1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct integer_arithmetic2
|
|
||||||
: additive2<T, U
|
|
||||||
, integer_multiplicative2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct integer_arithmetic1
|
|
||||||
: additive1<T
|
|
||||||
, integer_multiplicative1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct bitwise2
|
|
||||||
: xorable2<T, U
|
|
||||||
, andable2<T, U
|
|
||||||
, orable2<T, U, B
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct bitwise1
|
|
||||||
: xorable1<T
|
|
||||||
, andable1<T
|
|
||||||
, orable1<T, B
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct unit_steppable
|
|
||||||
: incrementable<T
|
|
||||||
, decrementable<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct shiftable2
|
|
||||||
: left_shiftable2<T, U
|
|
||||||
, right_shiftable2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct shiftable1
|
|
||||||
: left_shiftable1<T
|
|
||||||
, right_shiftable1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ring_operators2
|
|
||||||
: additive2<T, U
|
|
||||||
, subtractable2_left<T, U
|
|
||||||
, multipliable2<T, U, B
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ring_operators1
|
|
||||||
: additive1<T
|
|
||||||
, multipliable1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ordered_ring_operators2
|
|
||||||
: ring_operators2<T, U
|
|
||||||
, totally_ordered2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ordered_ring_operators1
|
|
||||||
: ring_operators1<T
|
|
||||||
, totally_ordered1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct field_operators2
|
|
||||||
: ring_operators2<T, U
|
|
||||||
, dividable2<T, U
|
|
||||||
, dividable2_left<T, U, B
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct field_operators1
|
|
||||||
: ring_operators1<T
|
|
||||||
, dividable1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ordered_field_operators2
|
|
||||||
: field_operators2<T, U
|
|
||||||
, totally_ordered2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ordered_field_operators1
|
|
||||||
: field_operators1<T
|
|
||||||
, totally_ordered1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct euclidian_ring_operators2
|
|
||||||
: ring_operators2<T, U
|
|
||||||
, dividable2<T, U
|
|
||||||
, dividable2_left<T, U
|
|
||||||
, modable2<T, U
|
|
||||||
, modable2_left<T, U, B
|
|
||||||
> > > > > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct euclidian_ring_operators1
|
|
||||||
: ring_operators1<T
|
|
||||||
, dividable1<T
|
|
||||||
, modable1<T, B
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ordered_euclidian_ring_operators2
|
|
||||||
: totally_ordered2<T, U
|
|
||||||
, euclidian_ring_operators2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ordered_euclidian_ring_operators1
|
|
||||||
: totally_ordered1<T
|
|
||||||
, euclidian_ring_operators1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct euclidean_ring_operators2
|
|
||||||
: ring_operators2<T, U
|
|
||||||
, dividable2<T, U
|
|
||||||
, dividable2_left<T, U
|
|
||||||
, modable2<T, U
|
|
||||||
, modable2_left<T, U, B
|
|
||||||
> > > > > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct euclidean_ring_operators1
|
|
||||||
: ring_operators1<T
|
|
||||||
, dividable1<T
|
|
||||||
, modable1<T, B
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ordered_euclidean_ring_operators2
|
|
||||||
: totally_ordered2<T, U
|
|
||||||
, euclidean_ring_operators2<T, U, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct ordered_euclidean_ring_operators1
|
|
||||||
: totally_ordered1<T
|
|
||||||
, euclidean_ring_operators1<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T, class P, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct input_iteratable
|
|
||||||
: equality_comparable1<T
|
|
||||||
, incrementable<T
|
|
||||||
, dereferenceable<T, P, B
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct output_iteratable
|
|
||||||
: incrementable<T, B
|
|
||||||
> {};
|
|
||||||
|
|
||||||
template <class T, class P, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct forward_iteratable
|
|
||||||
: input_iteratable<T, P, B
|
|
||||||
> {};
|
|
||||||
|
|
||||||
template <class T, class P, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct bidirectional_iteratable
|
|
||||||
: forward_iteratable<T, P
|
|
||||||
, decrementable<T, B
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
// To avoid repeated derivation from equality_comparable,
|
|
||||||
// which is an indirect base class of bidirectional_iterable,
|
|
||||||
// random_access_iteratable must not be derived from totally_ordered1
|
|
||||||
// but from less_than_comparable1 only. (Helmut Zeisel, 02-Dec-2001)
|
|
||||||
template <class T, class P, class D, class R, class B = ::boost::detail::empty_base<T> >
|
|
||||||
struct random_access_iteratable
|
|
||||||
: bidirectional_iteratable<T, P
|
|
||||||
, less_than_comparable1<T
|
|
||||||
, additive2<T, D
|
|
||||||
, indexable<T, D, R, B
|
|
||||||
> > > > {};
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_OPERATORS_IN_NAMESPACE
|
|
||||||
} // namespace boost
|
|
||||||
#endif // BOOST_NO_OPERATORS_IN_NAMESPACE
|
|
||||||
|
|
||||||
|
|
||||||
// BOOST_IMPORT_TEMPLATE1 .. BOOST_IMPORT_TEMPLATE4 -
|
|
||||||
//
|
|
||||||
// When BOOST_NO_OPERATORS_IN_NAMESPACE is defined we need a way to import an
|
|
||||||
// operator template into the boost namespace. BOOST_IMPORT_TEMPLATE1 is used
|
|
||||||
// for one-argument forms of operator templates; BOOST_IMPORT_TEMPLATE2 for
|
|
||||||
// two-argument forms. Note that these macros expect to be invoked from within
|
|
||||||
// boost.
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_OPERATORS_IN_NAMESPACE
|
|
||||||
|
|
||||||
// The template is already in boost so we have nothing to do.
|
|
||||||
# define BOOST_IMPORT_TEMPLATE4(template_name)
|
|
||||||
# define BOOST_IMPORT_TEMPLATE3(template_name)
|
|
||||||
# define BOOST_IMPORT_TEMPLATE2(template_name)
|
|
||||||
# define BOOST_IMPORT_TEMPLATE1(template_name)
|
|
||||||
|
|
||||||
#else // BOOST_NO_OPERATORS_IN_NAMESPACE
|
|
||||||
|
|
||||||
# ifndef BOOST_NO_USING_TEMPLATE
|
|
||||||
|
|
||||||
// Bring the names in with a using-declaration
|
|
||||||
// to avoid stressing the compiler.
|
|
||||||
# define BOOST_IMPORT_TEMPLATE4(template_name) using ::template_name;
|
|
||||||
# define BOOST_IMPORT_TEMPLATE3(template_name) using ::template_name;
|
|
||||||
# define BOOST_IMPORT_TEMPLATE2(template_name) using ::template_name;
|
|
||||||
# define BOOST_IMPORT_TEMPLATE1(template_name) using ::template_name;
|
|
||||||
|
|
||||||
# else
|
|
||||||
|
|
||||||
// Otherwise, because a Borland C++ 5.5 bug prevents a using declaration
|
|
||||||
// from working, we are forced to use inheritance for that compiler.
|
|
||||||
# define BOOST_IMPORT_TEMPLATE4(template_name) \
|
|
||||||
template <class T, class U, class V, class W, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct template_name : ::template_name<T, U, V, W, B> {};
|
|
||||||
|
|
||||||
# define BOOST_IMPORT_TEMPLATE3(template_name) \
|
|
||||||
template <class T, class U, class V, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct template_name : ::template_name<T, U, V, B> {};
|
|
||||||
|
|
||||||
# define BOOST_IMPORT_TEMPLATE2(template_name) \
|
|
||||||
template <class T, class U, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct template_name : ::template_name<T, U, B> {};
|
|
||||||
|
|
||||||
# define BOOST_IMPORT_TEMPLATE1(template_name) \
|
|
||||||
template <class T, class B = ::boost::detail::empty_base<T> > \
|
|
||||||
struct template_name : ::template_name<T, B> {};
|
|
||||||
|
|
||||||
# endif // BOOST_NO_USING_TEMPLATE
|
|
||||||
|
|
||||||
#endif // BOOST_NO_OPERATORS_IN_NAMESPACE
|
|
||||||
|
|
||||||
//
|
|
||||||
// Here's where we put it all together, defining the xxxx forms of the templates
|
|
||||||
// in namespace boost. We also define specializations of is_chained_base<> for
|
|
||||||
// the xxxx, xxxx1, and xxxx2 templates, importing them into boost:: as
|
|
||||||
// necessary.
|
|
||||||
//
|
|
||||||
|
|
||||||
// is_chained_base<> - a traits class used to distinguish whether an operator
|
|
||||||
// template argument is being used for base class chaining, or is specifying a
|
|
||||||
// 2nd argument type.
|
|
||||||
|
|
||||||
namespace boost {
|
|
||||||
// A type parameter is used instead of a plain bool because Borland's compiler
|
|
||||||
// didn't cope well with the more obvious non-type template parameter.
|
|
||||||
namespace detail {
|
|
||||||
struct true_t {};
|
|
||||||
struct false_t {};
|
|
||||||
} // namespace detail
|
|
||||||
|
|
||||||
// Unspecialized version assumes that most types are not being used for base
|
|
||||||
// class chaining. We specialize for the operator templates defined in this
|
|
||||||
// library.
|
|
||||||
template<class T> struct is_chained_base {
|
|
||||||
typedef ::boost::detail::false_t value;
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace boost
|
|
||||||
|
|
||||||
// Import a 4-type-argument operator template into boost (if necessary) and
|
|
||||||
// provide a specialization of 'is_chained_base<>' for it.
|
|
||||||
# define BOOST_OPERATOR_TEMPLATE4(template_name4) \
|
|
||||||
BOOST_IMPORT_TEMPLATE4(template_name4) \
|
|
||||||
template<class T, class U, class V, class W, class B> \
|
|
||||||
struct is_chained_base< ::boost::template_name4<T, U, V, W, B> > { \
|
|
||||||
typedef ::boost::detail::true_t value; \
|
|
||||||
};
|
|
||||||
|
|
||||||
// Import a 3-type-argument operator template into boost (if necessary) and
|
|
||||||
// provide a specialization of 'is_chained_base<>' for it.
|
|
||||||
# define BOOST_OPERATOR_TEMPLATE3(template_name3) \
|
|
||||||
BOOST_IMPORT_TEMPLATE3(template_name3) \
|
|
||||||
template<class T, class U, class V, class B> \
|
|
||||||
struct is_chained_base< ::boost::template_name3<T, U, V, B> > { \
|
|
||||||
typedef ::boost::detail::true_t value; \
|
|
||||||
};
|
|
||||||
|
|
||||||
// Import a 2-type-argument operator template into boost (if necessary) and
|
|
||||||
// provide a specialization of 'is_chained_base<>' for it.
|
|
||||||
# define BOOST_OPERATOR_TEMPLATE2(template_name2) \
|
|
||||||
BOOST_IMPORT_TEMPLATE2(template_name2) \
|
|
||||||
template<class T, class U, class B> \
|
|
||||||
struct is_chained_base< ::boost::template_name2<T, U, B> > { \
|
|
||||||
typedef ::boost::detail::true_t value; \
|
|
||||||
};
|
|
||||||
|
|
||||||
// Import a 1-type-argument operator template into boost (if necessary) and
|
|
||||||
// provide a specialization of 'is_chained_base<>' for it.
|
|
||||||
# define BOOST_OPERATOR_TEMPLATE1(template_name1) \
|
|
||||||
BOOST_IMPORT_TEMPLATE1(template_name1) \
|
|
||||||
template<class T, class B> \
|
|
||||||
struct is_chained_base< ::boost::template_name1<T, B> > { \
|
|
||||||
typedef ::boost::detail::true_t value; \
|
|
||||||
};
|
|
||||||
|
|
||||||
// BOOST_OPERATOR_TEMPLATE(template_name) defines template_name<> such that it
|
|
||||||
// can be used for specifying both 1-argument and 2-argument forms. Requires the
|
|
||||||
// existence of two previously defined class templates named '<template_name>1'
|
|
||||||
// and '<template_name>2' which must implement the corresponding 1- and 2-
|
|
||||||
// argument forms.
|
|
||||||
//
|
|
||||||
// The template type parameter O == is_chained_base<U>::value is used to
|
|
||||||
// distinguish whether the 2nd argument to <template_name> is being used for
|
|
||||||
// base class chaining from another boost operator template or is describing a
|
|
||||||
// 2nd operand type. O == true_t only when U is actually an another operator
|
|
||||||
// template from the library. Partial specialization is used to select an
|
|
||||||
// implementation in terms of either '<template_name>1' or '<template_name>2'.
|
|
||||||
//
|
|
||||||
|
|
||||||
# define BOOST_OPERATOR_TEMPLATE(template_name) \
|
|
||||||
template <class T \
|
|
||||||
,class U = T \
|
|
||||||
,class B = ::boost::detail::empty_base<T> \
|
|
||||||
,class O = typename is_chained_base<U>::value \
|
|
||||||
> \
|
|
||||||
struct template_name : template_name##2<T, U, B> {}; \
|
|
||||||
\
|
|
||||||
template<class T, class U, class B> \
|
|
||||||
struct template_name<T, U, B, ::boost::detail::true_t> \
|
|
||||||
: template_name##1<T, U> {}; \
|
|
||||||
\
|
|
||||||
template <class T, class B> \
|
|
||||||
struct template_name<T, T, B, ::boost::detail::false_t> \
|
|
||||||
: template_name##1<T, B> {}; \
|
|
||||||
\
|
|
||||||
template<class T, class U, class B, class O> \
|
|
||||||
struct is_chained_base< ::boost::template_name<T, U, B, O> > { \
|
|
||||||
typedef ::boost::detail::true_t value; \
|
|
||||||
}; \
|
|
||||||
\
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(template_name##2) \
|
|
||||||
BOOST_OPERATOR_TEMPLATE1(template_name##1)
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
BOOST_OPERATOR_TEMPLATE(less_than_comparable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(equality_comparable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(multipliable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(addable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(subtractable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(subtractable2_left)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(dividable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(dividable2_left)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(modable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(modable2_left)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(xorable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(andable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(orable)
|
|
||||||
|
|
||||||
BOOST_OPERATOR_TEMPLATE1(incrementable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE1(decrementable)
|
|
||||||
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(dereferenceable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE3(indexable)
|
|
||||||
|
|
||||||
BOOST_OPERATOR_TEMPLATE(left_shiftable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(right_shiftable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(equivalent)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(partially_ordered)
|
|
||||||
|
|
||||||
BOOST_OPERATOR_TEMPLATE(totally_ordered)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(additive)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(multiplicative)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(integer_multiplicative)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(arithmetic)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(integer_arithmetic)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(bitwise)
|
|
||||||
BOOST_OPERATOR_TEMPLATE1(unit_steppable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(shiftable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(ring_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(ordered_ring_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(field_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(ordered_field_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(euclidian_ring_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(ordered_euclidian_ring_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(euclidean_ring_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE(ordered_euclidean_ring_operators)
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(input_iteratable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE1(output_iteratable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(forward_iteratable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE2(bidirectional_iteratable)
|
|
||||||
BOOST_OPERATOR_TEMPLATE4(random_access_iteratable)
|
|
||||||
|
|
||||||
#undef BOOST_OPERATOR_TEMPLATE
|
|
||||||
#undef BOOST_OPERATOR_TEMPLATE4
|
|
||||||
#undef BOOST_OPERATOR_TEMPLATE3
|
|
||||||
#undef BOOST_OPERATOR_TEMPLATE2
|
|
||||||
#undef BOOST_OPERATOR_TEMPLATE1
|
|
||||||
#undef BOOST_IMPORT_TEMPLATE1
|
|
||||||
#undef BOOST_IMPORT_TEMPLATE2
|
|
||||||
#undef BOOST_IMPORT_TEMPLATE3
|
|
||||||
#undef BOOST_IMPORT_TEMPLATE4
|
|
||||||
|
|
||||||
// The following 'operators' classes can only be used portably if the derived class
|
|
||||||
// declares ALL of the required member operators.
|
|
||||||
template <class T, class U>
|
|
||||||
struct operators2
|
|
||||||
: totally_ordered2<T,U
|
|
||||||
, integer_arithmetic2<T,U
|
|
||||||
, bitwise2<T,U
|
|
||||||
> > > {};
|
|
||||||
|
|
||||||
template <class T, class U = T>
|
|
||||||
struct operators : operators2<T, U> {};
|
|
||||||
|
|
||||||
template <class T> struct operators<T, T>
|
|
||||||
: totally_ordered<T
|
|
||||||
, integer_arithmetic<T
|
|
||||||
, bitwise<T
|
|
||||||
, unit_steppable<T
|
|
||||||
> > > > {};
|
|
||||||
|
|
||||||
// Iterator helper classes (contributed by Jeremy Siek) -------------------//
|
|
||||||
// (Input and output iterator helpers contributed by Daryle Walker) -------//
|
|
||||||
// (Changed to use combined operator classes by Daryle Walker) ------------//
|
|
||||||
template <class T,
|
|
||||||
class V,
|
|
||||||
class D = std::ptrdiff_t,
|
|
||||||
class P = V const *,
|
|
||||||
class R = V const &>
|
|
||||||
struct input_iterator_helper
|
|
||||||
: input_iteratable<T, P
|
|
||||||
, std::iterator<std::input_iterator_tag, V, D, P, R
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template<class T>
|
|
||||||
struct output_iterator_helper
|
|
||||||
: output_iteratable<T
|
|
||||||
, std::iterator<std::output_iterator_tag, void, void, void, void
|
|
||||||
> >
|
|
||||||
{
|
|
||||||
T& operator*() { return static_cast<T&>(*this); }
|
|
||||||
T& operator++() { return static_cast<T&>(*this); }
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class T,
|
|
||||||
class V,
|
|
||||||
class D = std::ptrdiff_t,
|
|
||||||
class P = V*,
|
|
||||||
class R = V&>
|
|
||||||
struct forward_iterator_helper
|
|
||||||
: forward_iteratable<T, P
|
|
||||||
, std::iterator<std::forward_iterator_tag, V, D, P, R
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T,
|
|
||||||
class V,
|
|
||||||
class D = std::ptrdiff_t,
|
|
||||||
class P = V*,
|
|
||||||
class R = V&>
|
|
||||||
struct bidirectional_iterator_helper
|
|
||||||
: bidirectional_iteratable<T, P
|
|
||||||
, std::iterator<std::bidirectional_iterator_tag, V, D, P, R
|
|
||||||
> > {};
|
|
||||||
|
|
||||||
template <class T,
|
|
||||||
class V,
|
|
||||||
class D = std::ptrdiff_t,
|
|
||||||
class P = V*,
|
|
||||||
class R = V&>
|
|
||||||
struct random_access_iterator_helper
|
|
||||||
: random_access_iteratable<T, P, D, R
|
|
||||||
, std::iterator<std::random_access_iterator_tag, V, D, P, R
|
|
||||||
> >
|
|
||||||
{
|
|
||||||
friend D requires_difference_operator(const T& x, const T& y) {
|
|
||||||
return x - y;
|
|
||||||
}
|
|
||||||
}; // random_access_iterator_helper
|
|
||||||
|
|
||||||
} // namespace boost
|
|
||||||
|
|
||||||
#if defined(__sgi) && !defined(__GNUC__)
|
|
||||||
#pragma reset woff 1234
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // BOOST_OPERATORS_V1_HPP
|
|
||||||
178
include/boost/ref.hpp
Normal file
178
include/boost/ref.hpp
Normal file
@@ -0,0 +1,178 @@
|
|||||||
|
#ifndef BOOST_REF_HPP_INCLUDED
|
||||||
|
#define BOOST_REF_HPP_INCLUDED
|
||||||
|
|
||||||
|
// MS compatible compilers support #pragma once
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
|
||||||
|
# pragma once
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#include <boost/config.hpp>
|
||||||
|
#include <boost/utility/addressof.hpp>
|
||||||
|
#include <boost/mpl/bool.hpp>
|
||||||
|
#include <boost/detail/workaround.hpp>
|
||||||
|
|
||||||
|
//
|
||||||
|
// ref.hpp - ref/cref, useful helper functions
|
||||||
|
//
|
||||||
|
// Copyright (C) 1999, 2000 Jaakko J<>rvi (jaakko.jarvi@cs.utu.fi)
|
||||||
|
// Copyright (C) 2001, 2002 Peter Dimov
|
||||||
|
// Copyright (C) 2002 David Abrahams
|
||||||
|
//
|
||||||
|
// 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/bind/ref.html for documentation.
|
||||||
|
//
|
||||||
|
|
||||||
|
namespace boost
|
||||||
|
{
|
||||||
|
|
||||||
|
template<class T> class reference_wrapper
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
typedef T type;
|
||||||
|
|
||||||
|
#if defined( BOOST_MSVC ) && BOOST_WORKAROUND( BOOST_MSVC, < 1300 )
|
||||||
|
|
||||||
|
explicit reference_wrapper(T& t): t_(&t) {}
|
||||||
|
|
||||||
|
#else
|
||||||
|
|
||||||
|
explicit reference_wrapper(T& t): t_(boost::addressof(t)) {}
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
|
operator T& () const { return *t_; }
|
||||||
|
|
||||||
|
T& get() const { return *t_; }
|
||||||
|
|
||||||
|
T* get_pointer() const { return t_; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
|
||||||
|
T* t_;
|
||||||
|
};
|
||||||
|
|
||||||
|
# if defined( __BORLANDC__ ) && BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT(0x581) )
|
||||||
|
# define BOOST_REF_CONST
|
||||||
|
# else
|
||||||
|
# define BOOST_REF_CONST const
|
||||||
|
# endif
|
||||||
|
|
||||||
|
template<class T> inline reference_wrapper<T> BOOST_REF_CONST ref(T & t)
|
||||||
|
{
|
||||||
|
return reference_wrapper<T>(t);
|
||||||
|
}
|
||||||
|
|
||||||
|
template<class T> inline reference_wrapper<T const> BOOST_REF_CONST cref(T const & t)
|
||||||
|
{
|
||||||
|
return reference_wrapper<T const>(t);
|
||||||
|
}
|
||||||
|
|
||||||
|
# undef BOOST_REF_CONST
|
||||||
|
|
||||||
|
# ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
class is_reference_wrapper
|
||||||
|
: public mpl::false_
|
||||||
|
{
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
class unwrap_reference
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
typedef T type;
|
||||||
|
};
|
||||||
|
|
||||||
|
# define AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(X) \
|
||||||
|
template<typename T> \
|
||||||
|
class is_reference_wrapper< X > \
|
||||||
|
: public mpl::true_ \
|
||||||
|
{ \
|
||||||
|
}; \
|
||||||
|
\
|
||||||
|
template<typename T> \
|
||||||
|
class unwrap_reference< X > \
|
||||||
|
{ \
|
||||||
|
public: \
|
||||||
|
typedef T type; \
|
||||||
|
}; \
|
||||||
|
/**/
|
||||||
|
|
||||||
|
AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper<T>)
|
||||||
|
#if !defined(BOOST_NO_CV_SPECIALIZATIONS)
|
||||||
|
AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper<T> const)
|
||||||
|
AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper<T> volatile)
|
||||||
|
AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper<T> const volatile)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
# undef AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF
|
||||||
|
|
||||||
|
# else // no partial specialization
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#include <boost/type.hpp>
|
||||||
|
|
||||||
|
namespace boost
|
||||||
|
{
|
||||||
|
|
||||||
|
namespace detail
|
||||||
|
{
|
||||||
|
typedef char (&yes_reference_wrapper_t)[1];
|
||||||
|
typedef char (&no_reference_wrapper_t)[2];
|
||||||
|
|
||||||
|
no_reference_wrapper_t is_reference_wrapper_test(...);
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
yes_reference_wrapper_t is_reference_wrapper_test(type< reference_wrapper<T> >);
|
||||||
|
|
||||||
|
template<bool wrapped>
|
||||||
|
struct reference_unwrapper
|
||||||
|
{
|
||||||
|
template <class T>
|
||||||
|
struct apply
|
||||||
|
{
|
||||||
|
typedef T type;
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
template<>
|
||||||
|
struct reference_unwrapper<true>
|
||||||
|
{
|
||||||
|
template <class T>
|
||||||
|
struct apply
|
||||||
|
{
|
||||||
|
typedef typename T::type type;
|
||||||
|
};
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
class is_reference_wrapper
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
BOOST_STATIC_CONSTANT(
|
||||||
|
bool, value = (
|
||||||
|
sizeof(detail::is_reference_wrapper_test(type<T>()))
|
||||||
|
== sizeof(detail::yes_reference_wrapper_t)));
|
||||||
|
|
||||||
|
typedef ::boost::mpl::bool_<value> type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <typename T>
|
||||||
|
class unwrap_reference
|
||||||
|
: public detail::reference_unwrapper<
|
||||||
|
is_reference_wrapper<T>::value
|
||||||
|
>::template apply<T>
|
||||||
|
{};
|
||||||
|
|
||||||
|
# endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#endif // #ifndef BOOST_REF_HPP_INCLUDED
|
||||||
@@ -9,16 +9,11 @@
|
|||||||
#ifndef BOOST_UTILITY_HPP
|
#ifndef BOOST_UTILITY_HPP
|
||||||
#define BOOST_UTILITY_HPP
|
#define BOOST_UTILITY_HPP
|
||||||
|
|
||||||
// Use of this header is discouraged and it will be deprecated.
|
#include <boost/utility/addressof.hpp>
|
||||||
// Please include one or more of the headers below instead.
|
|
||||||
|
|
||||||
#include <boost/utility/base_from_member.hpp>
|
#include <boost/utility/base_from_member.hpp>
|
||||||
#include <boost/utility/binary.hpp>
|
#include <boost/utility/enable_if.hpp>
|
||||||
#include <boost/utility/identity_type.hpp>
|
#include <boost/checked_delete.hpp>
|
||||||
|
#include <boost/next_prior.hpp>
|
||||||
#include <boost/core/addressof.hpp>
|
#include <boost/noncopyable.hpp>
|
||||||
#include <boost/core/enable_if.hpp>
|
|
||||||
#include <boost/core/checked_delete.hpp>
|
|
||||||
#include <boost/core/noncopyable.hpp>
|
|
||||||
|
|
||||||
#endif // BOOST_UTILITY_HPP
|
#endif // BOOST_UTILITY_HPP
|
||||||
|
|||||||
58
include/boost/utility/addressof.hpp
Normal file
58
include/boost/utility/addressof.hpp
Normal file
@@ -0,0 +1,58 @@
|
|||||||
|
// Copyright (C) 2002 Brad King (brad.king@kitware.com)
|
||||||
|
// Douglas Gregor (gregod@cs.rpi.edu)
|
||||||
|
// Peter Dimov
|
||||||
|
//
|
||||||
|
// Distributed under the Boost Software License, Version 1.0. (See
|
||||||
|
// accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// For more information, see http://www.boost.org
|
||||||
|
|
||||||
|
#ifndef BOOST_UTILITY_ADDRESSOF_HPP
|
||||||
|
# define BOOST_UTILITY_ADDRESSOF_HPP
|
||||||
|
|
||||||
|
# include <boost/config.hpp>
|
||||||
|
# include <boost/detail/workaround.hpp>
|
||||||
|
|
||||||
|
namespace boost {
|
||||||
|
|
||||||
|
// Do not make addressof() inline. Breaks MSVC 7. (Peter Dimov)
|
||||||
|
|
||||||
|
// VC7 strips const from nested classes unless we add indirection here
|
||||||
|
# if BOOST_WORKAROUND(BOOST_MSVC, == 1300)
|
||||||
|
|
||||||
|
template<class T> struct _addp
|
||||||
|
{
|
||||||
|
typedef T * type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <typename T> typename _addp<T>::type
|
||||||
|
|
||||||
|
# else
|
||||||
|
template <typename T> T*
|
||||||
|
# endif
|
||||||
|
addressof(T& v)
|
||||||
|
{
|
||||||
|
return reinterpret_cast<T*>(
|
||||||
|
&const_cast<char&>(reinterpret_cast<const volatile char &>(v)));
|
||||||
|
}
|
||||||
|
|
||||||
|
// Borland doesn't like casting an array reference to a char reference
|
||||||
|
// but these overloads work around the problem.
|
||||||
|
# if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
|
||||||
|
template<typename T,std::size_t N>
|
||||||
|
T (*addressof(T (&t)[N]))[N]
|
||||||
|
{
|
||||||
|
return reinterpret_cast<T(*)[N]>(&t);
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T,std::size_t N>
|
||||||
|
const T (*addressof(const T (&t)[N]))[N]
|
||||||
|
{
|
||||||
|
return reinterpret_cast<const T(*)[N]>(&t);
|
||||||
|
}
|
||||||
|
# endif
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif // BOOST_UTILITY_ADDRESSOF_HPP
|
||||||
@@ -1,6 +1,6 @@
|
|||||||
// boost utility/base_from_member.hpp header file --------------------------//
|
// boost utility/base_from_member.hpp header file --------------------------//
|
||||||
|
|
||||||
// Copyright 2001, 2003, 2004, 2012 Daryle Walker. Use, modification, and
|
// Copyright 2001, 2003, 2004 Daryle Walker. Use, modification, and
|
||||||
// distribution are subject to the Boost Software License, Version 1.0. (See
|
// distribution are subject to the Boost Software License, Version 1.0. (See
|
||||||
// accompanying file LICENSE_1_0.txt or a copy at
|
// accompanying file LICENSE_1_0.txt or a copy at
|
||||||
// <http://www.boost.org/LICENSE_1_0.txt>.)
|
// <http://www.boost.org/LICENSE_1_0.txt>.)
|
||||||
@@ -10,15 +10,10 @@
|
|||||||
#ifndef BOOST_UTILITY_BASE_FROM_MEMBER_HPP
|
#ifndef BOOST_UTILITY_BASE_FROM_MEMBER_HPP
|
||||||
#define BOOST_UTILITY_BASE_FROM_MEMBER_HPP
|
#define BOOST_UTILITY_BASE_FROM_MEMBER_HPP
|
||||||
|
|
||||||
#include <boost/config.hpp>
|
|
||||||
#include <boost/preprocessor/arithmetic/inc.hpp>
|
#include <boost/preprocessor/arithmetic/inc.hpp>
|
||||||
#include <boost/preprocessor/repetition/enum_binary_params.hpp>
|
#include <boost/preprocessor/repetition/enum_binary_params.hpp>
|
||||||
#include <boost/preprocessor/repetition/enum_params.hpp>
|
#include <boost/preprocessor/repetition/enum_params.hpp>
|
||||||
#include <boost/preprocessor/repetition/repeat_from_to.hpp>
|
#include <boost/preprocessor/repetition/repeat_from_to.hpp>
|
||||||
#include <boost/type_traits/is_same.hpp>
|
|
||||||
#include <boost/type_traits/remove_cv.hpp>
|
|
||||||
#include <boost/type_traits/remove_reference.hpp>
|
|
||||||
#include <boost/utility/enable_if.hpp>
|
|
||||||
|
|
||||||
|
|
||||||
// Base-from-member arity configuration macro ------------------------------//
|
// Base-from-member arity configuration macro ------------------------------//
|
||||||
@@ -47,71 +42,17 @@
|
|||||||
// {}
|
// {}
|
||||||
// This macro should only persist within this file.
|
// This macro should only persist within this file.
|
||||||
|
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
#define BOOST_PRIVATE_CTR_DEF( z, n, data ) \
|
#define BOOST_PRIVATE_CTR_DEF( z, n, data ) \
|
||||||
template < BOOST_PP_ENUM_PARAMS(n, typename T) > \
|
template < BOOST_PP_ENUM_PARAMS(n, typename T) > \
|
||||||
base_from_member( BOOST_PP_ENUM_BINARY_PARAMS(n, T, x) ) \
|
explicit base_from_member( BOOST_PP_ENUM_BINARY_PARAMS(n, T, x) ) \
|
||||||
: member( BOOST_PP_ENUM_PARAMS(n, x) ) \
|
: member( BOOST_PP_ENUM_PARAMS(n, x) ) \
|
||||||
{} \
|
{} \
|
||||||
/**/
|
/**/
|
||||||
#endif // BOOST_UTILITY_DOCS
|
|
||||||
|
|
||||||
namespace boost
|
namespace boost
|
||||||
{
|
{
|
||||||
|
|
||||||
namespace detail
|
|
||||||
{
|
|
||||||
|
|
||||||
// Type-unmarking class template -------------------------------------------//
|
|
||||||
|
|
||||||
// Type-trait to get the raw type, i.e. the type without top-level reference nor
|
|
||||||
// cv-qualification, from a type expression. Mainly for function arguments, any
|
|
||||||
// reference part is stripped first.
|
|
||||||
|
|
||||||
// Contributed by Daryle Walker
|
|
||||||
|
|
||||||
template < typename T >
|
|
||||||
struct remove_cv_ref
|
|
||||||
{
|
|
||||||
typedef typename ::boost::remove_cv<typename
|
|
||||||
::boost::remove_reference<T>::type>::type type;
|
|
||||||
|
|
||||||
}; // boost::detail::remove_cv_ref
|
|
||||||
|
|
||||||
// Unmarked-type comparison class template ---------------------------------//
|
|
||||||
|
|
||||||
// Type-trait to check if two type expressions have the same raw type.
|
|
||||||
|
|
||||||
// Contributed by Daryle Walker, based on a work-around by Luc Danton
|
|
||||||
|
|
||||||
template < typename T, typename U >
|
|
||||||
struct is_related
|
|
||||||
: public ::boost::is_same<
|
|
||||||
typename ::boost::detail::remove_cv_ref<T>::type,
|
|
||||||
typename ::boost::detail::remove_cv_ref<U>::type >
|
|
||||||
{};
|
|
||||||
|
|
||||||
// Enable-if-on-unidentical-unmarked-type class template -------------------//
|
|
||||||
|
|
||||||
// Enable-if on the first two type expressions NOT having the same raw type.
|
|
||||||
|
|
||||||
// Contributed by Daryle Walker, based on a work-around by Luc Danton
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_CXX11_VARIADIC_TEMPLATES
|
|
||||||
template<typename ...T>
|
|
||||||
struct enable_if_unrelated
|
|
||||||
: public ::boost::enable_if_c<true>
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename T, typename U, typename ...U2>
|
|
||||||
struct enable_if_unrelated<T, U, U2...>
|
|
||||||
: public ::boost::disable_if< ::boost::detail::is_related<T, U> >
|
|
||||||
{};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
} // namespace boost::detail
|
|
||||||
|
|
||||||
|
|
||||||
// Base-from-member class template -----------------------------------------//
|
// Base-from-member class template -----------------------------------------//
|
||||||
|
|
||||||
// Helper to initialize a base object so a derived class can use this
|
// Helper to initialize a base object so a derived class can use this
|
||||||
@@ -127,39 +68,12 @@ class base_from_member
|
|||||||
protected:
|
protected:
|
||||||
MemberType member;
|
MemberType member;
|
||||||
|
|
||||||
#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && \
|
|
||||||
!defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && \
|
|
||||||
!defined(BOOST_NO_CXX11_FUNCTION_TEMPLATE_DEFAULT_ARGS) && \
|
|
||||||
!(defined(__GNUC__) && (__GNUC__ == 4) && (__GNUC_MINOR__ < 4))
|
|
||||||
template <typename ...T, typename EnableIf = typename
|
|
||||||
::boost::detail::enable_if_unrelated<base_from_member, T...>::type>
|
|
||||||
explicit BOOST_CONSTEXPR base_from_member( T&& ...x )
|
|
||||||
BOOST_NOEXCEPT_IF( BOOST_NOEXCEPT_EXPR(::new ((void*) 0) MemberType(
|
|
||||||
static_cast<T&&>(x)... )) ) // no std::is_nothrow_constructible...
|
|
||||||
: member( static_cast<T&&>(x)... ) // ...nor std::forward needed
|
|
||||||
{}
|
|
||||||
#else
|
|
||||||
base_from_member()
|
base_from_member()
|
||||||
: member()
|
: member()
|
||||||
{}
|
{}
|
||||||
|
|
||||||
template < typename T0 > explicit base_from_member( T0 x0 ) : member( x0 ) {}
|
BOOST_PP_REPEAT_FROM_TO( 1, BOOST_PP_INC(BOOST_BASE_FROM_MEMBER_MAX_ARITY),
|
||||||
BOOST_PP_REPEAT_FROM_TO( 2, BOOST_PP_INC(BOOST_BASE_FROM_MEMBER_MAX_ARITY),
|
|
||||||
BOOST_PRIVATE_CTR_DEF, _ )
|
BOOST_PRIVATE_CTR_DEF, _ )
|
||||||
#endif
|
|
||||||
|
|
||||||
}; // boost::base_from_member
|
|
||||||
|
|
||||||
template < typename MemberType, int UniqueID >
|
|
||||||
class base_from_member<MemberType&, UniqueID>
|
|
||||||
{
|
|
||||||
protected:
|
|
||||||
MemberType& member;
|
|
||||||
|
|
||||||
explicit BOOST_CONSTEXPR base_from_member( MemberType& x )
|
|
||||||
BOOST_NOEXCEPT
|
|
||||||
: member( x )
|
|
||||||
{}
|
|
||||||
|
|
||||||
}; // boost::base_from_member
|
}; // boost::base_from_member
|
||||||
|
|
||||||
|
|||||||
@@ -1,709 +0,0 @@
|
|||||||
/*=============================================================================
|
|
||||||
Copyright (c) 2005 Matthew Calabrese
|
|
||||||
|
|
||||||
Use, modification and distribution is subject to the Boost Software
|
|
||||||
License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
|
||||||
http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
==============================================================================*/
|
|
||||||
|
|
||||||
#ifndef BOOST_UTILITY_BINARY_HPP
|
|
||||||
#define BOOST_UTILITY_BINARY_HPP
|
|
||||||
|
|
||||||
/*=============================================================================
|
|
||||||
|
|
||||||
Binary Literal Utility
|
|
||||||
______________________
|
|
||||||
|
|
||||||
|
|
||||||
The following code works by converting the input bit pattern into a
|
|
||||||
Boost.Preprocessor sequence, then converting groupings of 3 bits each into
|
|
||||||
the corresponding octal digit, and finally concatenating all of the digits
|
|
||||||
together along with a leading zero. This yields a standard octal literal
|
|
||||||
with the desired value as specified in bits.
|
|
||||||
|
|
||||||
==============================================================================*/
|
|
||||||
|
|
||||||
#include <boost/preprocessor/control/deduce_d.hpp>
|
|
||||||
#include <boost/preprocessor/facilities/identity.hpp>
|
|
||||||
#include <boost/preprocessor/cat.hpp>
|
|
||||||
#include <boost/preprocessor/seq/cat.hpp>
|
|
||||||
#include <boost/preprocessor/seq/transform.hpp>
|
|
||||||
#include <boost/preprocessor/arithmetic/mod.hpp>
|
|
||||||
#include <boost/preprocessor/seq/size.hpp>
|
|
||||||
#include <boost/preprocessor/facilities/empty.hpp>
|
|
||||||
#include <boost/preprocessor/control/while.hpp>
|
|
||||||
|
|
||||||
#define BOOST_BINARY( bit_groupings ) \
|
|
||||||
BOOST_BINARY_LITERAL_D( BOOST_PP_DEDUCE_D(), bit_groupings )
|
|
||||||
|
|
||||||
#define BOOST_BINARY_U( bit_groupings ) \
|
|
||||||
BOOST_SUFFIXED_BINARY_LITERAL( bit_groupings, U )
|
|
||||||
|
|
||||||
#define BOOST_BINARY_L( bit_groupings ) \
|
|
||||||
BOOST_SUFFIXED_BINARY_LITERAL( bit_groupings, L )
|
|
||||||
|
|
||||||
#define BOOST_BINARY_UL( bit_groupings ) \
|
|
||||||
BOOST_SUFFIXED_BINARY_LITERAL( bit_groupings, UL )
|
|
||||||
|
|
||||||
#define BOOST_BINARY_LU( bit_groupings ) \
|
|
||||||
BOOST_SUFFIXED_BINARY_LITERAL( bit_groupings, LU )
|
|
||||||
|
|
||||||
#define BOOST_BINARY_LL( bit_groupings ) \
|
|
||||||
BOOST_SUFFIXED_BINARY_LITERAL( bit_groupings, LL )
|
|
||||||
|
|
||||||
#define BOOST_BINARY_ULL( bit_groupings ) \
|
|
||||||
BOOST_SUFFIXED_BINARY_LITERAL( bit_groupings, ULL )
|
|
||||||
|
|
||||||
#define BOOST_BINARY_LLU( bit_groupings ) \
|
|
||||||
BOOST_SUFFIXED_BINARY_LITERAL( bit_groupings, LLU )
|
|
||||||
|
|
||||||
#define BOOST_SUFFIXED_BINARY_LITERAL( bit_groupings, suffix ) \
|
|
||||||
BOOST_SUFFIXED_BINARY_LITERAL_D( BOOST_PP_DEDUCE_D(), bit_groupings, suffix )
|
|
||||||
|
|
||||||
#define BOOST_SUFFIXED_BINARY_LITERAL_D( d, bit_groupings, suffix ) \
|
|
||||||
BOOST_PP_CAT( BOOST_BINARY_LITERAL_D( d, bit_groupings ), suffix )
|
|
||||||
|
|
||||||
#define BOOST_BINARY_LITERAL_D( d, bit_groupings ) \
|
|
||||||
BOOST_PP_SEQ_CAT \
|
|
||||||
( (0) BOOST_DETAIL_CREATE_BINARY_LITERAL_OCTAL_SEQUENCE( d, bit_groupings ) \
|
|
||||||
)
|
|
||||||
|
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
#define BOOST_DETAIL_CREATE_BINARY_LITERAL_OCTAL_SEQUENCE( d, bit_groupings ) \
|
|
||||||
BOOST_PP_SEQ_TRANSFORM \
|
|
||||||
( BOOST_DETAIL_TRIPLE_TO_OCTAL_OPERATION \
|
|
||||||
, BOOST_PP_NIL \
|
|
||||||
, BOOST_PP_IDENTITY( BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_TRIPLE_SEQUENCE )()\
|
|
||||||
( BOOST_DETAIL_COMPLETE_TRIPLE_SEQUENCE \
|
|
||||||
( \
|
|
||||||
d \
|
|
||||||
, BOOST_DETAIL_CREATE_BINARY_LITERAL_BIT_SEQUENCE( d, bit_groupings ) \
|
|
||||||
) \
|
|
||||||
) \
|
|
||||||
)
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_TRIPLE_SEQUENCE( bit_sequence ) \
|
|
||||||
BOOST_PP_CAT \
|
|
||||||
( BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_PARENTHETIC_TUPLE_1 bit_sequence \
|
|
||||||
, END_BIT \
|
|
||||||
)
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BITS_PER_OCTIT 3
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_COMPLETE_TRIPLE_SEQUENCE( d, incomplete_nibble_sequence ) \
|
|
||||||
BOOST_PP_CAT \
|
|
||||||
( BOOST_DETAIL_CREATE_TRIPLE_COMPLETION_SEQUENCE_ \
|
|
||||||
, BOOST_PP_MOD_D( d \
|
|
||||||
, BOOST_PP_SEQ_SIZE( incomplete_nibble_sequence ) \
|
|
||||||
, BOOST_DETAIL_BITS_PER_OCTIT \
|
|
||||||
) \
|
|
||||||
) \
|
|
||||||
incomplete_nibble_sequence
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_FIXED_COMPL( bit ) \
|
|
||||||
BOOST_PP_CAT( BOOST_DETAIL_FIXED_COMPL_, bit )
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_FIXED_COMPL_0 1
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_FIXED_COMPL_1 0
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_CREATE_BINARY_LITERAL_BIT_SEQUENCE( d, bit_groupings ) \
|
|
||||||
BOOST_PP_EMPTY \
|
|
||||||
BOOST_PP_CAT( BOOST_PP_WHILE_, d ) \
|
|
||||||
( BOOST_DETAIL_BINARY_LITERAL_PREDICATE \
|
|
||||||
, BOOST_DETAIL_BINARY_LITERAL_OPERATION \
|
|
||||||
, bit_groupings () \
|
|
||||||
)
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_PREDICATE( d, state ) \
|
|
||||||
BOOST_DETAIL_FIXED_COMPL( BOOST_DETAIL_IS_NULLARY_ARGS( state ) )
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_OPERATION( d, state ) \
|
|
||||||
BOOST_DETAIL_SPLIT_AND_SWAP \
|
|
||||||
( BOOST_PP_CAT( BOOST_DETAIL_BINARY_LITERAL_ELEMENT_, state ) )
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_OPERATION( s, dummy_param, tuple ) \
|
|
||||||
BOOST_DETAIL_TERNARY_TRIPLE_TO_OCTAL tuple
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_TERNARY_TRIPLE_TO_OCTAL( bit2, bit1, bit0 ) \
|
|
||||||
BOOST_DETAIL_TRIPLE_TO_OCTAL_ ## bit2 ## bit1 ## bit0
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_CREATE_TRIPLE_COMPLETION_SEQUENCE_1 (0)(0)
|
|
||||||
#define BOOST_DETAIL_CREATE_TRIPLE_COMPLETION_SEQUENCE_2 (0)
|
|
||||||
#define BOOST_DETAIL_CREATE_TRIPLE_COMPLETION_SEQUENCE_0
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_PARENTHETIC_TUPLE_1END_BIT
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_PARENTHETIC_TUPLE_1( bit ) \
|
|
||||||
( ( bit, BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_PARENTHETIC_TUPLE_2
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_PARENTHETIC_TUPLE_2( bit ) \
|
|
||||||
bit, BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_PARENTHETIC_TUPLE_3
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_PARENTHETIC_TUPLE_3( bit ) \
|
|
||||||
bit ) ) BOOST_DETAIL_CONVERT_BIT_SEQUENCE_TO_PARENTHETIC_TUPLE_1
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_SPLIT_AND_SWAP( params ) \
|
|
||||||
BOOST_PP_IDENTITY( BOOST_DETAIL_SPLIT_AND_SWAP_PARAMS )()( params )
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_SPLIT_AND_SWAP_PARAMS( first_param, second_param ) \
|
|
||||||
second_param first_param
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_LEFT_OF_COMMA( params ) \
|
|
||||||
BOOST_PP_IDENTITY( BOOST_DETAIL_FIRST_MACRO_PARAM )()( params )
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_FIRST_MACRO_PARAM( first_param, second_param ) \
|
|
||||||
first_param
|
|
||||||
|
|
||||||
/* Begin derived concepts from Chaos by Paul Mensonides */
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_IS_NULLARY_ARGS( param ) \
|
|
||||||
BOOST_DETAIL_LEFT_OF_COMMA \
|
|
||||||
( BOOST_PP_CAT( BOOST_DETAIL_IS_NULLARY_ARGS_R_ \
|
|
||||||
, BOOST_DETAIL_IS_NULLARY_ARGS_C param \
|
|
||||||
) \
|
|
||||||
)
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_IS_NULLARY_ARGS_C() \
|
|
||||||
1
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_IS_NULLARY_ARGS_R_1 \
|
|
||||||
1, BOOST_PP_NIL
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_IS_NULLARY_ARGS_R_BOOST_DETAIL_IS_NULLARY_ARGS_C \
|
|
||||||
0, BOOST_PP_NIL
|
|
||||||
|
|
||||||
/* End derived concepts from Chaos by Paul Mensonides */
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_000 0
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_001 1
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_010 2
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_011 3
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_100 4
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_101 5
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_110 6
|
|
||||||
#define BOOST_DETAIL_TRIPLE_TO_OCTAL_111 7
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0 (0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1 (1),
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00 (0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01 (0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10 (1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11 (1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00 (0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01 (0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10 (1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11 (1)(1),
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000 (0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001 (0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010 (0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011 (0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100 (1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101 (1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110 (1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111 (1)(1)(1),
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000 (0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001 (0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010 (0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011 (0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100 (0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101 (0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110 (0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111 (0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000 (1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001 (1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010 (1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011 (1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100 (1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101 (1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110 (1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111 (1)(1)(1)(1),
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000 (0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001 (0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010 (0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011 (0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100 (0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101 (0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110 (0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111 (0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000 (0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001 (0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010 (0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011 (0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100 (0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101 (0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110 (0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111 (0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000 (1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001 (1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010 (1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011 (1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100 (1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101 (1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110 (1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111 (1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000 (1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001 (1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010 (1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011 (1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100 (1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101 (1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110 (1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111 (1)(1)(1)(1)(1),
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000000 (0)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000001 (0)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000010 (0)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000011 (0)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000100 (0)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000101 (0)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000110 (0)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_000111 (0)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001000 (0)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001001 (0)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001010 (0)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001011 (0)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001100 (0)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001101 (0)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001110 (0)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_001111 (0)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010000 (0)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010001 (0)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010010 (0)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010011 (0)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010100 (0)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010101 (0)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010110 (0)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_010111 (0)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011000 (0)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011001 (0)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011010 (0)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011011 (0)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011100 (0)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011101 (0)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011110 (0)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_011111 (0)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100000 (1)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100001 (1)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100010 (1)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100011 (1)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100100 (1)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100101 (1)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100110 (1)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_100111 (1)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101000 (1)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101001 (1)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101010 (1)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101011 (1)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101100 (1)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101101 (1)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101110 (1)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_101111 (1)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110000 (1)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110001 (1)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110010 (1)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110011 (1)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110100 (1)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110101 (1)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110110 (1)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_110111 (1)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111000 (1)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111001 (1)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111010 (1)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111011 (1)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111100 (1)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111101 (1)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111110 (1)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_111111 (1)(1)(1)(1)(1)(1),
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000000 (0)(0)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000001 (0)(0)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000010 (0)(0)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000011 (0)(0)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000100 (0)(0)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000101 (0)(0)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000110 (0)(0)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0000111 (0)(0)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001000 (0)(0)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001001 (0)(0)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001010 (0)(0)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001011 (0)(0)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001100 (0)(0)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001101 (0)(0)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001110 (0)(0)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0001111 (0)(0)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010000 (0)(0)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010001 (0)(0)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010010 (0)(0)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010011 (0)(0)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010100 (0)(0)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010101 (0)(0)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010110 (0)(0)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0010111 (0)(0)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011000 (0)(0)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011001 (0)(0)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011010 (0)(0)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011011 (0)(0)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011100 (0)(0)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011101 (0)(0)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011110 (0)(0)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0011111 (0)(0)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100000 (0)(1)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100001 (0)(1)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100010 (0)(1)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100011 (0)(1)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100100 (0)(1)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100101 (0)(1)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100110 (0)(1)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0100111 (0)(1)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101000 (0)(1)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101001 (0)(1)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101010 (0)(1)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101011 (0)(1)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101100 (0)(1)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101101 (0)(1)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101110 (0)(1)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0101111 (0)(1)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110000 (0)(1)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110001 (0)(1)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110010 (0)(1)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110011 (0)(1)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110100 (0)(1)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110101 (0)(1)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110110 (0)(1)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0110111 (0)(1)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111000 (0)(1)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111001 (0)(1)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111010 (0)(1)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111011 (0)(1)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111100 (0)(1)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111101 (0)(1)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111110 (0)(1)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_0111111 (0)(1)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000000 (1)(0)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000001 (1)(0)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000010 (1)(0)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000011 (1)(0)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000100 (1)(0)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000101 (1)(0)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000110 (1)(0)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1000111 (1)(0)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001000 (1)(0)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001001 (1)(0)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001010 (1)(0)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001011 (1)(0)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001100 (1)(0)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001101 (1)(0)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001110 (1)(0)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1001111 (1)(0)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010000 (1)(0)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010001 (1)(0)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010010 (1)(0)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010011 (1)(0)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010100 (1)(0)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010101 (1)(0)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010110 (1)(0)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1010111 (1)(0)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011000 (1)(0)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011001 (1)(0)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011010 (1)(0)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011011 (1)(0)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011100 (1)(0)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011101 (1)(0)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011110 (1)(0)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1011111 (1)(0)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100000 (1)(1)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100001 (1)(1)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100010 (1)(1)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100011 (1)(1)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100100 (1)(1)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100101 (1)(1)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100110 (1)(1)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1100111 (1)(1)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101000 (1)(1)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101001 (1)(1)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101010 (1)(1)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101011 (1)(1)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101100 (1)(1)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101101 (1)(1)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101110 (1)(1)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1101111 (1)(1)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110000 (1)(1)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110001 (1)(1)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110010 (1)(1)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110011 (1)(1)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110100 (1)(1)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110101 (1)(1)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110110 (1)(1)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1110111 (1)(1)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111000 (1)(1)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111001 (1)(1)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111010 (1)(1)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111011 (1)(1)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111100 (1)(1)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111101 (1)(1)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111110 (1)(1)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_1111111 (1)(1)(1)(1)(1)(1)(1),
|
|
||||||
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000000 (0)(0)(0)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000001 (0)(0)(0)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000010 (0)(0)(0)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000011 (0)(0)(0)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000100 (0)(0)(0)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000101 (0)(0)(0)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000110 (0)(0)(0)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00000111 (0)(0)(0)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001000 (0)(0)(0)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001001 (0)(0)(0)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001010 (0)(0)(0)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001011 (0)(0)(0)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001100 (0)(0)(0)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001101 (0)(0)(0)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001110 (0)(0)(0)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00001111 (0)(0)(0)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010000 (0)(0)(0)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010001 (0)(0)(0)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010010 (0)(0)(0)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010011 (0)(0)(0)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010100 (0)(0)(0)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010101 (0)(0)(0)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010110 (0)(0)(0)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00010111 (0)(0)(0)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011000 (0)(0)(0)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011001 (0)(0)(0)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011010 (0)(0)(0)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011011 (0)(0)(0)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011100 (0)(0)(0)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011101 (0)(0)(0)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011110 (0)(0)(0)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00011111 (0)(0)(0)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100000 (0)(0)(1)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100001 (0)(0)(1)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100010 (0)(0)(1)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100011 (0)(0)(1)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100100 (0)(0)(1)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100101 (0)(0)(1)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100110 (0)(0)(1)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00100111 (0)(0)(1)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101000 (0)(0)(1)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101001 (0)(0)(1)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101010 (0)(0)(1)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101011 (0)(0)(1)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101100 (0)(0)(1)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101101 (0)(0)(1)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101110 (0)(0)(1)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00101111 (0)(0)(1)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110000 (0)(0)(1)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110001 (0)(0)(1)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110010 (0)(0)(1)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110011 (0)(0)(1)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110100 (0)(0)(1)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110101 (0)(0)(1)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110110 (0)(0)(1)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00110111 (0)(0)(1)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111000 (0)(0)(1)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111001 (0)(0)(1)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111010 (0)(0)(1)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111011 (0)(0)(1)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111100 (0)(0)(1)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111101 (0)(0)(1)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111110 (0)(0)(1)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_00111111 (0)(0)(1)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000000 (0)(1)(0)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000001 (0)(1)(0)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000010 (0)(1)(0)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000011 (0)(1)(0)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000100 (0)(1)(0)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000101 (0)(1)(0)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000110 (0)(1)(0)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01000111 (0)(1)(0)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001000 (0)(1)(0)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001001 (0)(1)(0)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001010 (0)(1)(0)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001011 (0)(1)(0)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001100 (0)(1)(0)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001101 (0)(1)(0)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001110 (0)(1)(0)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01001111 (0)(1)(0)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010000 (0)(1)(0)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010001 (0)(1)(0)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010010 (0)(1)(0)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010011 (0)(1)(0)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010100 (0)(1)(0)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010101 (0)(1)(0)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010110 (0)(1)(0)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01010111 (0)(1)(0)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011000 (0)(1)(0)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011001 (0)(1)(0)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011010 (0)(1)(0)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011011 (0)(1)(0)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011100 (0)(1)(0)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011101 (0)(1)(0)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011110 (0)(1)(0)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01011111 (0)(1)(0)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100000 (0)(1)(1)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100001 (0)(1)(1)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100010 (0)(1)(1)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100011 (0)(1)(1)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100100 (0)(1)(1)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100101 (0)(1)(1)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100110 (0)(1)(1)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01100111 (0)(1)(1)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101000 (0)(1)(1)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101001 (0)(1)(1)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101010 (0)(1)(1)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101011 (0)(1)(1)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101100 (0)(1)(1)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101101 (0)(1)(1)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101110 (0)(1)(1)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01101111 (0)(1)(1)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110000 (0)(1)(1)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110001 (0)(1)(1)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110010 (0)(1)(1)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110011 (0)(1)(1)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110100 (0)(1)(1)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110101 (0)(1)(1)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110110 (0)(1)(1)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01110111 (0)(1)(1)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111000 (0)(1)(1)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111001 (0)(1)(1)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111010 (0)(1)(1)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111011 (0)(1)(1)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111100 (0)(1)(1)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111101 (0)(1)(1)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111110 (0)(1)(1)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_01111111 (0)(1)(1)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000000 (1)(0)(0)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000001 (1)(0)(0)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000010 (1)(0)(0)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000011 (1)(0)(0)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000100 (1)(0)(0)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000101 (1)(0)(0)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000110 (1)(0)(0)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10000111 (1)(0)(0)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001000 (1)(0)(0)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001001 (1)(0)(0)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001010 (1)(0)(0)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001011 (1)(0)(0)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001100 (1)(0)(0)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001101 (1)(0)(0)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001110 (1)(0)(0)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10001111 (1)(0)(0)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010000 (1)(0)(0)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010001 (1)(0)(0)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010010 (1)(0)(0)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010011 (1)(0)(0)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010100 (1)(0)(0)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010101 (1)(0)(0)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010110 (1)(0)(0)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10010111 (1)(0)(0)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011000 (1)(0)(0)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011001 (1)(0)(0)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011010 (1)(0)(0)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011011 (1)(0)(0)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011100 (1)(0)(0)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011101 (1)(0)(0)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011110 (1)(0)(0)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10011111 (1)(0)(0)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100000 (1)(0)(1)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100001 (1)(0)(1)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100010 (1)(0)(1)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100011 (1)(0)(1)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100100 (1)(0)(1)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100101 (1)(0)(1)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100110 (1)(0)(1)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10100111 (1)(0)(1)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101000 (1)(0)(1)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101001 (1)(0)(1)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101010 (1)(0)(1)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101011 (1)(0)(1)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101100 (1)(0)(1)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101101 (1)(0)(1)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101110 (1)(0)(1)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10101111 (1)(0)(1)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110000 (1)(0)(1)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110001 (1)(0)(1)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110010 (1)(0)(1)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110011 (1)(0)(1)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110100 (1)(0)(1)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110101 (1)(0)(1)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110110 (1)(0)(1)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10110111 (1)(0)(1)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111000 (1)(0)(1)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111001 (1)(0)(1)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111010 (1)(0)(1)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111011 (1)(0)(1)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111100 (1)(0)(1)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111101 (1)(0)(1)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111110 (1)(0)(1)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_10111111 (1)(0)(1)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000000 (1)(1)(0)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000001 (1)(1)(0)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000010 (1)(1)(0)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000011 (1)(1)(0)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000100 (1)(1)(0)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000101 (1)(1)(0)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000110 (1)(1)(0)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11000111 (1)(1)(0)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001000 (1)(1)(0)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001001 (1)(1)(0)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001010 (1)(1)(0)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001011 (1)(1)(0)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001100 (1)(1)(0)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001101 (1)(1)(0)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001110 (1)(1)(0)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11001111 (1)(1)(0)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010000 (1)(1)(0)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010001 (1)(1)(0)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010010 (1)(1)(0)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010011 (1)(1)(0)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010100 (1)(1)(0)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010101 (1)(1)(0)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010110 (1)(1)(0)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11010111 (1)(1)(0)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011000 (1)(1)(0)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011001 (1)(1)(0)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011010 (1)(1)(0)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011011 (1)(1)(0)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011100 (1)(1)(0)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011101 (1)(1)(0)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011110 (1)(1)(0)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11011111 (1)(1)(0)(1)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100000 (1)(1)(1)(0)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100001 (1)(1)(1)(0)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100010 (1)(1)(1)(0)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100011 (1)(1)(1)(0)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100100 (1)(1)(1)(0)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100101 (1)(1)(1)(0)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100110 (1)(1)(1)(0)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11100111 (1)(1)(1)(0)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101000 (1)(1)(1)(0)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101001 (1)(1)(1)(0)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101010 (1)(1)(1)(0)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101011 (1)(1)(1)(0)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101100 (1)(1)(1)(0)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101101 (1)(1)(1)(0)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101110 (1)(1)(1)(0)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11101111 (1)(1)(1)(0)(1)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110000 (1)(1)(1)(1)(0)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110001 (1)(1)(1)(1)(0)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110010 (1)(1)(1)(1)(0)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110011 (1)(1)(1)(1)(0)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110100 (1)(1)(1)(1)(0)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110101 (1)(1)(1)(1)(0)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110110 (1)(1)(1)(1)(0)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11110111 (1)(1)(1)(1)(0)(1)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111000 (1)(1)(1)(1)(1)(0)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111001 (1)(1)(1)(1)(1)(0)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111010 (1)(1)(1)(1)(1)(0)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111011 (1)(1)(1)(1)(1)(0)(1)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111100 (1)(1)(1)(1)(1)(1)(0)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111101 (1)(1)(1)(1)(1)(1)(0)(1),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111110 (1)(1)(1)(1)(1)(1)(1)(0),
|
|
||||||
#define BOOST_DETAIL_BINARY_LITERAL_ELEMENT_11111111 (1)(1)(1)(1)(1)(1)(1)(1),
|
|
||||||
#endif // BOOST_UTILITY_DOCS
|
|
||||||
#endif
|
|
||||||
@@ -4,7 +4,7 @@
|
|||||||
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
//
|
//
|
||||||
// See http://www.boost.org/libs/optional for documentation.
|
// See http://www.boost.org/lib/optional for documentation.
|
||||||
//
|
//
|
||||||
// You are welcome to contact the author at:
|
// You are welcome to contact the author at:
|
||||||
// fernando_cacciola@hotmail.com
|
// fernando_cacciola@hotmail.com
|
||||||
@@ -33,12 +33,8 @@ bool equal_pointees ( OptionalPointee const& x, OptionalPointee const& y )
|
|||||||
}
|
}
|
||||||
|
|
||||||
template<class OptionalPointee>
|
template<class OptionalPointee>
|
||||||
struct equal_pointees_t
|
struct equal_pointees_t : std::binary_function<OptionalPointee,OptionalPointee,bool>
|
||||||
{
|
{
|
||||||
typedef bool result_type;
|
|
||||||
typedef OptionalPointee first_argument_type;
|
|
||||||
typedef OptionalPointee second_argument_type;
|
|
||||||
|
|
||||||
bool operator() ( OptionalPointee const& x, OptionalPointee const& y ) const
|
bool operator() ( OptionalPointee const& x, OptionalPointee const& y ) const
|
||||||
{ return equal_pointees(x,y) ; }
|
{ return equal_pointees(x,y) ; }
|
||||||
} ;
|
} ;
|
||||||
@@ -60,12 +56,8 @@ bool less_pointees ( OptionalPointee const& x, OptionalPointee const& y )
|
|||||||
}
|
}
|
||||||
|
|
||||||
template<class OptionalPointee>
|
template<class OptionalPointee>
|
||||||
struct less_pointees_t
|
struct less_pointees_t : std::binary_function<OptionalPointee,OptionalPointee,bool>
|
||||||
{
|
{
|
||||||
typedef bool result_type;
|
|
||||||
typedef OptionalPointee first_argument_type;
|
|
||||||
typedef OptionalPointee second_argument_type;
|
|
||||||
|
|
||||||
bool operator() ( OptionalPointee const& x, OptionalPointee const& y ) const
|
bool operator() ( OptionalPointee const& x, OptionalPointee const& y ) const
|
||||||
{ return less_pointees(x,y) ; }
|
{ return less_pointees(x,y) ; }
|
||||||
} ;
|
} ;
|
||||||
|
|||||||
@@ -5,7 +5,7 @@
|
|||||||
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
//
|
//
|
||||||
// See http://www.boost.org/libs/optional for documentation.
|
// See http://www.boost.org/lib/optional for documentation.
|
||||||
//
|
//
|
||||||
// You are welcome to contact the author at:
|
// You are welcome to contact the author at:
|
||||||
// fernando_cacciola@hotmail.com
|
// fernando_cacciola@hotmail.com
|
||||||
|
|||||||
@@ -5,7 +5,7 @@
|
|||||||
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
//
|
//
|
||||||
// See http://www.boost.org/libs/optional for documentation.
|
// See http://www.boost.org/lib/optional for documentation.
|
||||||
//
|
//
|
||||||
// You are welcome to contact the author at:
|
// You are welcome to contact the author at:
|
||||||
// fernando_cacciola@hotmail.com
|
// fernando_cacciola@hotmail.com
|
||||||
|
|||||||
@@ -1,58 +0,0 @@
|
|||||||
#ifndef BOOST_UTILITY_DETAIL_MINSTD_RAND_HPP_INCLUDED
|
|
||||||
#define BOOST_UTILITY_DETAIL_MINSTD_RAND_HPP_INCLUDED
|
|
||||||
|
|
||||||
// Copyright 2017 Peter Dimov
|
|
||||||
//
|
|
||||||
// Distributed under the Boost Software License, Version 1.0.
|
|
||||||
//
|
|
||||||
// See accompanying file LICENSE_1_0.txt or copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt
|
|
||||||
//
|
|
||||||
// An implementation of minstd_rand that does not require
|
|
||||||
// the Random library
|
|
||||||
|
|
||||||
#include <boost/cstdint.hpp>
|
|
||||||
|
|
||||||
namespace boost
|
|
||||||
{
|
|
||||||
namespace detail
|
|
||||||
{
|
|
||||||
|
|
||||||
class minstd_rand
|
|
||||||
{
|
|
||||||
private:
|
|
||||||
|
|
||||||
boost::uint_least32_t x_;
|
|
||||||
|
|
||||||
enum { a = 48271, m = 2147483647 };
|
|
||||||
|
|
||||||
public:
|
|
||||||
|
|
||||||
minstd_rand(): x_( 1 )
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
explicit minstd_rand( boost::uint_least32_t x ): x_( x % m )
|
|
||||||
{
|
|
||||||
if( x_ == 0 )
|
|
||||||
{
|
|
||||||
x_ = 1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
boost::uint_least32_t operator()()
|
|
||||||
{
|
|
||||||
boost::uint_least64_t y = x_;
|
|
||||||
|
|
||||||
y = ( a * y ) % m;
|
|
||||||
|
|
||||||
x_ = static_cast<boost::uint_least32_t>( y );
|
|
||||||
|
|
||||||
return x_;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace detail
|
|
||||||
} // namespace boost
|
|
||||||
|
|
||||||
#endif // #ifndef BOOST_UTILITY_DETAIL_MINSTD_RAND_HPP_INCLUDED
|
|
||||||
@@ -5,11 +5,6 @@
|
|||||||
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
// Copyright Daniel Walker, Eric Niebler, Michel Morin 2008-2012.
|
|
||||||
// Use, modification and distribution is subject to the Boost Software
|
|
||||||
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or
|
|
||||||
// copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
|
|
||||||
// For more information, see http://www.boost.org/libs/utility
|
// For more information, see http://www.boost.org/libs/utility
|
||||||
#if !defined(BOOST_PP_IS_ITERATING)
|
#if !defined(BOOST_PP_IS_ITERATING)
|
||||||
# error Boost result_of - do not include this file!
|
# error Boost result_of - do not include this file!
|
||||||
@@ -22,172 +17,46 @@
|
|||||||
# define BOOST_RESULT_OF_ARGS BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)
|
# define BOOST_RESULT_OF_ARGS BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#if !BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x551))
|
#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551))
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
template<typename F BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
|
||||||
struct tr1_result_of<F(BOOST_RESULT_OF_ARGS)>
|
BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
||||||
: conditional<
|
struct result_of<F(BOOST_RESULT_OF_ARGS)>
|
||||||
is_pointer<F>::value || is_member_function_pointer<F>::value
|
: boost::detail::result_of_impl<F, F(BOOST_RESULT_OF_ARGS), (boost::detail::has_result_type<F>::value)> {};
|
||||||
, boost::detail::tr1_result_of_impl<
|
|
||||||
typename remove_cv<F>::type,
|
|
||||||
typename remove_cv<F>::type(BOOST_RESULT_OF_ARGS),
|
|
||||||
(boost::detail::result_of_has_result_type<F>::value)>
|
|
||||||
, boost::detail::tr1_result_of_impl<
|
|
||||||
F,
|
|
||||||
F(BOOST_RESULT_OF_ARGS),
|
|
||||||
(boost::detail::result_of_has_result_type<F>::value)> >::type { };
|
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#ifdef BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
|
||||||
struct result_of<F(BOOST_RESULT_OF_ARGS)>
|
|
||||||
: detail::cpp0x_result_of<F(BOOST_RESULT_OF_ARGS)> { };
|
|
||||||
#endif // BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
|
|
||||||
#ifdef BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK
|
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
|
||||||
struct result_of<F(BOOST_RESULT_OF_ARGS)>
|
|
||||||
: conditional<detail::result_of_has_result_type<F>::value || detail::result_of_has_result<F>::value,
|
|
||||||
tr1_result_of<F(BOOST_RESULT_OF_ARGS)>,
|
|
||||||
detail::cpp0x_result_of<F(BOOST_RESULT_OF_ARGS)> >::type { };
|
|
||||||
#endif // BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK
|
|
||||||
|
|
||||||
#if defined(BOOST_RESULT_OF_USE_DECLTYPE) || defined(BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK)
|
|
||||||
|
|
||||||
namespace detail {
|
|
||||||
|
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
|
||||||
struct cpp0x_result_of<F(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T))>
|
|
||||||
: conditional<
|
|
||||||
is_member_function_pointer<F>::value
|
|
||||||
, detail::tr1_result_of_impl<
|
|
||||||
typename remove_cv<F>::type,
|
|
||||||
typename remove_cv<F>::type(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)), false
|
|
||||||
>
|
|
||||||
, detail::cpp0x_result_of_impl<
|
|
||||||
F(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T))
|
|
||||||
>
|
|
||||||
>::type
|
|
||||||
{};
|
|
||||||
|
|
||||||
#ifdef BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
template<typename F>
|
|
||||||
struct BOOST_PP_CAT(result_of_callable_fun_2_, BOOST_PP_ITERATION());
|
|
||||||
|
|
||||||
template<typename R BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(), typename T)>
|
|
||||||
struct BOOST_PP_CAT(result_of_callable_fun_2_, BOOST_PP_ITERATION())<R(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(), T))> {
|
|
||||||
R operator()(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(), T)) const;
|
|
||||||
typedef result_of_private_type const &(*pfn_t)(...);
|
|
||||||
operator pfn_t() const volatile;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename F>
|
|
||||||
struct BOOST_PP_CAT(result_of_callable_fun_, BOOST_PP_ITERATION())
|
|
||||||
: BOOST_PP_CAT(result_of_callable_fun_2_, BOOST_PP_ITERATION())<F>
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename F>
|
|
||||||
struct BOOST_PP_CAT(result_of_callable_fun_, BOOST_PP_ITERATION())<F *>
|
|
||||||
: BOOST_PP_CAT(result_of_callable_fun_2_, BOOST_PP_ITERATION())<F>
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename F>
|
|
||||||
struct BOOST_PP_CAT(result_of_select_call_wrapper_type_, BOOST_PP_ITERATION())
|
|
||||||
: conditional<
|
|
||||||
is_class<typename remove_reference<F>::type>::value,
|
|
||||||
result_of_wrap_callable_class<F>,
|
|
||||||
type_identity<BOOST_PP_CAT(result_of_callable_fun_, BOOST_PP_ITERATION())<typename remove_cv<typename remove_reference<F>::type>::type> >
|
|
||||||
>::type
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(), typename T)>
|
|
||||||
struct BOOST_PP_CAT(result_of_is_callable_, BOOST_PP_ITERATION()) {
|
|
||||||
typedef typename BOOST_PP_CAT(result_of_select_call_wrapper_type_, BOOST_PP_ITERATION())<F>::type wrapper_t;
|
|
||||||
static const bool value = (
|
|
||||||
sizeof(result_of_no_type) == sizeof(detail::result_of_is_private_type(
|
|
||||||
(boost::declval<wrapper_t>()(BOOST_PP_ENUM_BINARY_PARAMS(BOOST_PP_ITERATION(), boost::declval<T, >() BOOST_PP_INTERCEPT)), result_of_weird_type())
|
|
||||||
))
|
|
||||||
);
|
|
||||||
typedef integral_constant<bool, value> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
|
||||||
struct cpp0x_result_of_impl<F(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)), true>
|
|
||||||
: lazy_enable_if<
|
|
||||||
BOOST_PP_CAT(result_of_is_callable_, BOOST_PP_ITERATION())<F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(), T)>
|
|
||||||
, cpp0x_result_of_impl<F(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)), false>
|
|
||||||
>
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
|
||||||
struct cpp0x_result_of_impl<F(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)), false>
|
|
||||||
{
|
|
||||||
typedef decltype(
|
|
||||||
boost::declval<F>()(
|
|
||||||
BOOST_PP_ENUM_BINARY_PARAMS(BOOST_PP_ITERATION(), boost::declval<T, >() BOOST_PP_INTERCEPT)
|
|
||||||
)
|
|
||||||
) type;
|
|
||||||
};
|
|
||||||
|
|
||||||
#else // BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
|
||||||
struct cpp0x_result_of_impl<F(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)),
|
|
||||||
typename result_of_always_void<decltype(
|
|
||||||
boost::declval<F>()(
|
|
||||||
BOOST_PP_ENUM_BINARY_PARAMS(BOOST_PP_ITERATION(), boost::declval<T, >() BOOST_PP_INTERCEPT)
|
|
||||||
)
|
|
||||||
)>::type> {
|
|
||||||
typedef decltype(
|
|
||||||
boost::declval<F>()(
|
|
||||||
BOOST_PP_ENUM_BINARY_PARAMS(BOOST_PP_ITERATION(), boost::declval<T, >() BOOST_PP_INTERCEPT)
|
|
||||||
)
|
|
||||||
) type;
|
|
||||||
};
|
|
||||||
|
|
||||||
#endif // BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
} // namespace detail
|
|
||||||
|
|
||||||
#else // defined(BOOST_RESULT_OF_USE_DECLTYPE) || defined(BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK)
|
|
||||||
|
|
||||||
#if !BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x551))
|
|
||||||
template<typename F BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
|
||||||
struct result_of<F(BOOST_RESULT_OF_ARGS)>
|
|
||||||
: tr1_result_of<F(BOOST_RESULT_OF_ARGS)> { };
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // defined(BOOST_RESULT_OF_USE_DECLTYPE)
|
|
||||||
|
|
||||||
#undef BOOST_RESULT_OF_ARGS
|
#undef BOOST_RESULT_OF_ARGS
|
||||||
|
|
||||||
#if BOOST_PP_ITERATION() >= 1
|
#if BOOST_PP_ITERATION() >= 1
|
||||||
|
|
||||||
namespace detail {
|
namespace detail {
|
||||||
|
|
||||||
template<typename R, typename FArgs BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
|
||||||
struct tr1_result_of_impl<R (*)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)), FArgs, false>
|
BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
||||||
|
struct result_of_impl<R (*)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)), FArgs, false>
|
||||||
{
|
{
|
||||||
typedef R type;
|
typedef R type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template<typename R, typename FArgs BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
|
||||||
struct tr1_result_of_impl<R (&)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)), FArgs, false>
|
BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
||||||
|
struct result_of_impl<R (&)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),T)), FArgs, false>
|
||||||
{
|
{
|
||||||
typedef R type;
|
typedef R type;
|
||||||
};
|
};
|
||||||
|
|
||||||
#if !BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x551))
|
#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551))
|
||||||
template<typename R, typename FArgs BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
|
||||||
struct tr1_result_of_impl<R (T0::*)
|
BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
||||||
|
struct result_of_impl<R (T0::*)
|
||||||
(BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T)),
|
(BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T)),
|
||||||
FArgs, false>
|
FArgs, false>
|
||||||
{
|
{
|
||||||
typedef R type;
|
typedef R type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template<typename R, typename FArgs BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
|
||||||
struct tr1_result_of_impl<R (T0::*)
|
BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
||||||
|
struct result_of_impl<R (T0::*)
|
||||||
(BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
|
(BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
|
||||||
const,
|
const,
|
||||||
FArgs, false>
|
FArgs, false>
|
||||||
@@ -195,8 +64,9 @@ struct tr1_result_of_impl<R (T0::*)
|
|||||||
typedef R type;
|
typedef R type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template<typename R, typename FArgs BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
|
||||||
struct tr1_result_of_impl<R (T0::*)
|
BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
||||||
|
struct result_of_impl<R (T0::*)
|
||||||
(BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
|
(BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
|
||||||
volatile,
|
volatile,
|
||||||
FArgs, false>
|
FArgs, false>
|
||||||
@@ -204,8 +74,9 @@ struct tr1_result_of_impl<R (T0::*)
|
|||||||
typedef R type;
|
typedef R type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template<typename R, typename FArgs BOOST_PP_ENUM_TRAILING_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
|
||||||
struct tr1_result_of_impl<R (T0::*)
|
BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
|
||||||
|
struct result_of_impl<R (T0::*)
|
||||||
(BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
|
(BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
|
||||||
const volatile,
|
const volatile,
|
||||||
FArgs, false>
|
FArgs, false>
|
||||||
|
|||||||
@@ -1,190 +0,0 @@
|
|||||||
// Boost result_of library
|
|
||||||
|
|
||||||
// Copyright Douglas Gregor 2004. Use, modification and
|
|
||||||
// distribution is subject to the Boost Software License, Version
|
|
||||||
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
|
|
||||||
// Copyright Daniel Walker, Eric Niebler, Michel Morin 2008-2012.
|
|
||||||
// Use, modification and distribution is subject to the Boost Software
|
|
||||||
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or
|
|
||||||
// copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
|
|
||||||
// For more information, see http://www.boost.org/libs/utility
|
|
||||||
|
|
||||||
#ifndef BOOST_RESULT_OF_HPP
|
|
||||||
# error Boost result_of - do not include this file!
|
|
||||||
#endif
|
|
||||||
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct tr1_result_of<F(Args...)>
|
|
||||||
: conditional<
|
|
||||||
is_pointer<F>::value || is_member_function_pointer<F>::value
|
|
||||||
, boost::detail::tr1_result_of_impl<
|
|
||||||
typename remove_cv<F>::type,
|
|
||||||
typename remove_cv<F>::type(Args...),
|
|
||||||
(boost::detail::result_of_has_result_type<F>::value)>
|
|
||||||
, boost::detail::tr1_result_of_impl<
|
|
||||||
F,
|
|
||||||
F(Args...),
|
|
||||||
(boost::detail::result_of_has_result_type<F>::value)> >::type { };
|
|
||||||
|
|
||||||
#ifdef BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct result_of<F(Args...)>
|
|
||||||
: detail::cpp0x_result_of<F(Args...)> { };
|
|
||||||
#endif // BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
|
|
||||||
#ifdef BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct result_of<F(Args...)>
|
|
||||||
: conditional<detail::result_of_has_result_type<F>::value || detail::result_of_has_result<F>::value,
|
|
||||||
tr1_result_of<F(Args...)>,
|
|
||||||
detail::cpp0x_result_of<F(Args...)> >::type { };
|
|
||||||
#endif // BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK
|
|
||||||
|
|
||||||
#if defined(BOOST_RESULT_OF_USE_DECLTYPE) || defined(BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK)
|
|
||||||
|
|
||||||
namespace detail {
|
|
||||||
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct cpp0x_result_of<F(Args...)>
|
|
||||||
: conditional<
|
|
||||||
is_member_function_pointer<F>::value
|
|
||||||
, detail::tr1_result_of_impl<
|
|
||||||
typename remove_cv<F>::type,
|
|
||||||
typename remove_cv<F>::type(Args...), false
|
|
||||||
>
|
|
||||||
, detail::cpp0x_result_of_impl<
|
|
||||||
F(Args...)
|
|
||||||
>
|
|
||||||
>::type
|
|
||||||
{};
|
|
||||||
|
|
||||||
#ifdef BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
template<typename F>
|
|
||||||
struct result_of_callable_fun_2;
|
|
||||||
|
|
||||||
template<typename R, typename... Args>
|
|
||||||
struct result_of_callable_fun_2<R(Args...)> {
|
|
||||||
R operator()(Args...) const;
|
|
||||||
typedef result_of_private_type const &(*pfn_t)(...);
|
|
||||||
operator pfn_t() const volatile;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename F>
|
|
||||||
struct result_of_callable_fun
|
|
||||||
: result_of_callable_fun_2<F>
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename F>
|
|
||||||
struct result_of_callable_fun<F *>
|
|
||||||
: result_of_callable_fun_2<F>
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename F>
|
|
||||||
struct result_of_select_call_wrapper_type
|
|
||||||
: conditional<
|
|
||||||
is_class<typename remove_reference<F>::type>::value,
|
|
||||||
result_of_wrap_callable_class<F>,
|
|
||||||
type_identity<result_of_callable_fun<typename remove_cv<typename remove_reference<F>::type>::type> >
|
|
||||||
>::type
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct result_of_is_callable {
|
|
||||||
typedef typename result_of_select_call_wrapper_type<F>::type wrapper_t;
|
|
||||||
static const bool value = (
|
|
||||||
sizeof(result_of_no_type) == sizeof(detail::result_of_is_private_type(
|
|
||||||
(boost::declval<wrapper_t>()(boost::declval<Args>()...), result_of_weird_type())
|
|
||||||
))
|
|
||||||
);
|
|
||||||
typedef integral_constant<bool, value> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct cpp0x_result_of_impl<F(Args...), true>
|
|
||||||
: lazy_enable_if<
|
|
||||||
result_of_is_callable<F, Args...>
|
|
||||||
, cpp0x_result_of_impl<F(Args...), false>
|
|
||||||
>
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct cpp0x_result_of_impl<F(Args...), false>
|
|
||||||
{
|
|
||||||
typedef decltype(
|
|
||||||
boost::declval<F>()(
|
|
||||||
boost::declval<Args>()...
|
|
||||||
)
|
|
||||||
) type;
|
|
||||||
};
|
|
||||||
|
|
||||||
#else // BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct cpp0x_result_of_impl<F(Args...),
|
|
||||||
typename result_of_always_void<decltype(
|
|
||||||
boost::declval<F>()(
|
|
||||||
boost::declval<Args>()...
|
|
||||||
)
|
|
||||||
)>::type> {
|
|
||||||
typedef decltype(
|
|
||||||
boost::declval<F>()(
|
|
||||||
boost::declval<Args>()...
|
|
||||||
)
|
|
||||||
) type;
|
|
||||||
};
|
|
||||||
|
|
||||||
#endif // BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
} // namespace detail
|
|
||||||
|
|
||||||
#else // defined(BOOST_RESULT_OF_USE_DECLTYPE) || defined(BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK)
|
|
||||||
|
|
||||||
template<typename F, typename... Args>
|
|
||||||
struct result_of<F(Args...)>
|
|
||||||
: tr1_result_of<F(Args...)> { };
|
|
||||||
|
|
||||||
#endif // defined(BOOST_RESULT_OF_USE_DECLTYPE)
|
|
||||||
|
|
||||||
namespace detail {
|
|
||||||
|
|
||||||
template<typename R, typename FArgs, typename... Args>
|
|
||||||
struct tr1_result_of_impl<R (*)(Args...), FArgs, false>
|
|
||||||
{
|
|
||||||
typedef R type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename R, typename FArgs, typename... Args>
|
|
||||||
struct tr1_result_of_impl<R (&)(Args...), FArgs, false>
|
|
||||||
{
|
|
||||||
typedef R type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename R, typename FArgs, typename C, typename... Args>
|
|
||||||
struct tr1_result_of_impl<R (C::*)(Args...), FArgs, false>
|
|
||||||
{
|
|
||||||
typedef R type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename R, typename FArgs, typename C, typename... Args>
|
|
||||||
struct tr1_result_of_impl<R (C::*)(Args...) const, FArgs, false>
|
|
||||||
{
|
|
||||||
typedef R type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename R, typename FArgs, typename C, typename... Args>
|
|
||||||
struct tr1_result_of_impl<R (C::*)(Args...) volatile, FArgs, false>
|
|
||||||
{
|
|
||||||
typedef R type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename R, typename FArgs, typename C, typename... Args>
|
|
||||||
struct tr1_result_of_impl<R (C::*)(Args...) const volatile, FArgs, false>
|
|
||||||
{
|
|
||||||
typedef R type;
|
|
||||||
};
|
|
||||||
|
|
||||||
}
|
|
||||||
119
include/boost/utility/enable_if.hpp
Normal file
119
include/boost/utility/enable_if.hpp
Normal file
@@ -0,0 +1,119 @@
|
|||||||
|
// Boost enable_if library
|
||||||
|
|
||||||
|
// Copyright 2003 <20> The Trustees of Indiana University.
|
||||||
|
|
||||||
|
// Use, modification, and distribution is subject to the Boost Software
|
||||||
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
|
||||||
|
// Authors: Jaakko J<>rvi (jajarvi at osl.iu.edu)
|
||||||
|
// Jeremiah Willcock (jewillco at osl.iu.edu)
|
||||||
|
// Andrew Lumsdaine (lums at osl.iu.edu)
|
||||||
|
|
||||||
|
|
||||||
|
#ifndef BOOST_UTILITY_ENABLE_IF_HPP
|
||||||
|
#define BOOST_UTILITY_ENABLE_IF_HPP
|
||||||
|
|
||||||
|
#include "boost/config.hpp"
|
||||||
|
|
||||||
|
// Even the definition of enable_if causes problems on some compilers,
|
||||||
|
// so it's macroed out for all compilers that do not support SFINAE
|
||||||
|
|
||||||
|
#ifndef BOOST_NO_SFINAE
|
||||||
|
|
||||||
|
namespace boost
|
||||||
|
{
|
||||||
|
|
||||||
|
template <bool B, class T = void>
|
||||||
|
struct enable_if_c {
|
||||||
|
typedef T type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct enable_if_c<false, T> {};
|
||||||
|
|
||||||
|
template <class Cond, class T = void>
|
||||||
|
struct enable_if : public enable_if_c<Cond::value, T> {};
|
||||||
|
|
||||||
|
template <bool B, class T>
|
||||||
|
struct lazy_enable_if_c {
|
||||||
|
typedef typename T::type type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct lazy_enable_if_c<false, T> {};
|
||||||
|
|
||||||
|
template <class Cond, class T>
|
||||||
|
struct lazy_enable_if : public lazy_enable_if_c<Cond::value, T> {};
|
||||||
|
|
||||||
|
|
||||||
|
template <bool B, class T = void>
|
||||||
|
struct disable_if_c {
|
||||||
|
typedef T type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct disable_if_c<true, T> {};
|
||||||
|
|
||||||
|
template <class Cond, class T = void>
|
||||||
|
struct disable_if : public disable_if_c<Cond::value, T> {};
|
||||||
|
|
||||||
|
template <bool B, class T>
|
||||||
|
struct lazy_disable_if_c {
|
||||||
|
typedef typename T::type type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
struct lazy_disable_if_c<true, T> {};
|
||||||
|
|
||||||
|
template <class Cond, class T>
|
||||||
|
struct lazy_disable_if : public lazy_disable_if_c<Cond::value, T> {};
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#else
|
||||||
|
|
||||||
|
namespace boost {
|
||||||
|
|
||||||
|
namespace detail { typedef void enable_if_default_T; }
|
||||||
|
|
||||||
|
template <typename T>
|
||||||
|
struct enable_if_does_not_work_on_this_compiler;
|
||||||
|
|
||||||
|
template <bool B, class T = detail::enable_if_default_T>
|
||||||
|
struct enable_if_c : enable_if_does_not_work_on_this_compiler<T>
|
||||||
|
{ };
|
||||||
|
|
||||||
|
template <bool B, class T = detail::enable_if_default_T>
|
||||||
|
struct disable_if_c : enable_if_does_not_work_on_this_compiler<T>
|
||||||
|
{ };
|
||||||
|
|
||||||
|
template <bool B, class T = detail::enable_if_default_T>
|
||||||
|
struct lazy_enable_if_c : enable_if_does_not_work_on_this_compiler<T>
|
||||||
|
{ };
|
||||||
|
|
||||||
|
template <bool B, class T = detail::enable_if_default_T>
|
||||||
|
struct lazy_disable_if_c : enable_if_does_not_work_on_this_compiler<T>
|
||||||
|
{ };
|
||||||
|
|
||||||
|
template <class Cond, class T = detail::enable_if_default_T>
|
||||||
|
struct enable_if : enable_if_does_not_work_on_this_compiler<T>
|
||||||
|
{ };
|
||||||
|
|
||||||
|
template <class Cond, class T = detail::enable_if_default_T>
|
||||||
|
struct disable_if : enable_if_does_not_work_on_this_compiler<T>
|
||||||
|
{ };
|
||||||
|
|
||||||
|
template <class Cond, class T = detail::enable_if_default_T>
|
||||||
|
struct lazy_enable_if : enable_if_does_not_work_on_this_compiler<T>
|
||||||
|
{ };
|
||||||
|
|
||||||
|
template <class Cond, class T = detail::enable_if_default_T>
|
||||||
|
struct lazy_disable_if : enable_if_does_not_work_on_this_compiler<T>
|
||||||
|
{ };
|
||||||
|
|
||||||
|
} // namespace boost
|
||||||
|
|
||||||
|
#endif // BOOST_NO_SFINAE
|
||||||
|
|
||||||
|
#endif
|
||||||
@@ -1,46 +0,0 @@
|
|||||||
|
|
||||||
// Copyright (C) 2009-2012 Lorenzo Caminiti
|
|
||||||
// Distributed under the Boost Software License, Version 1.0
|
|
||||||
// (see accompanying file LICENSE_1_0.txt or a copy at
|
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
|
||||||
// Home at http://www.boost.org/libs/utility/identity_type
|
|
||||||
|
|
||||||
/** @file
|
|
||||||
Wrap type expressions with round parenthesis so they can be passed to macros
|
|
||||||
even if they contain commas.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef BOOST_IDENTITY_TYPE_HPP_
|
|
||||||
#define BOOST_IDENTITY_TYPE_HPP_
|
|
||||||
|
|
||||||
#include <boost/type_traits/function_traits.hpp>
|
|
||||||
|
|
||||||
/**
|
|
||||||
@brief This macro allows to wrap the specified type expression within extra
|
|
||||||
round parenthesis so the type can be passed as a single macro parameter even if
|
|
||||||
it contains commas (not already wrapped within round parenthesis).
|
|
||||||
|
|
||||||
@Params
|
|
||||||
@Param{parenthesized_type,
|
|
||||||
The type expression to be passed as macro parameter wrapped by a single set
|
|
||||||
of round parenthesis <c>(...)</c>.
|
|
||||||
This type expression can contain an arbitrary number of commas.
|
|
||||||
}
|
|
||||||
@EndParams
|
|
||||||
|
|
||||||
This macro works on any C++03 compiler (it does not use variadic macros).
|
|
||||||
|
|
||||||
This macro must be prefixed by <c>typename</c> when used within templates.
|
|
||||||
Note that the compiler will not be able to automatically determine function
|
|
||||||
template parameters when they are wrapped with this macro (these parameters
|
|
||||||
need to be explicitly specified when calling the function template).
|
|
||||||
|
|
||||||
On some compilers (like GCC), using this macro on abstract types requires to
|
|
||||||
add and remove a reference to the specified type.
|
|
||||||
*/
|
|
||||||
#define BOOST_IDENTITY_TYPE(parenthesized_type) \
|
|
||||||
/* must NOT prefix this with `::` to work with parenthesized syntax */ \
|
|
||||||
boost::function_traits< void parenthesized_type >::arg1_type
|
|
||||||
|
|
||||||
#endif // #include guard
|
|
||||||
|
|
||||||
@@ -5,7 +5,7 @@
|
|||||||
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||||
// http://www.boost.org/LICENSE_1_0.txt)
|
// http://www.boost.org/LICENSE_1_0.txt)
|
||||||
//
|
//
|
||||||
// See http://www.boost.org/libs/optional for documentation.
|
// See http://www.boost.org/lib/optional for documentation.
|
||||||
//
|
//
|
||||||
// You are welcome to contact the author at:
|
// You are welcome to contact the author at:
|
||||||
// fernando_cacciola@hotmail.com
|
// fernando_cacciola@hotmail.com
|
||||||
@@ -19,21 +19,15 @@ namespace boost {
|
|||||||
|
|
||||||
class in_place_factory_base {} ;
|
class in_place_factory_base {} ;
|
||||||
|
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
#define BOOST_PP_ITERATION_LIMITS (0, BOOST_MAX_INPLACE_FACTORY_ARITY)
|
#define BOOST_PP_ITERATION_LIMITS (0, BOOST_MAX_INPLACE_FACTORY_ARITY)
|
||||||
#define BOOST_PP_FILENAME_1 <boost/utility/in_place_factory.hpp>
|
#define BOOST_PP_FILENAME_1 <boost/utility/in_place_factory.hpp>
|
||||||
#endif // BOOST_UTILITY_DOCS
|
|
||||||
|
|
||||||
#include BOOST_PP_ITERATE()
|
#include BOOST_PP_ITERATE()
|
||||||
|
|
||||||
} // namespace boost
|
} // namespace boost
|
||||||
|
|
||||||
#include <boost/utility/detail/in_place_factory_suffix.hpp>
|
#include <boost/utility/detail/in_place_factory_suffix.hpp>
|
||||||
|
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
#define BOOST_UTILITY_INPLACE_FACTORY_04APR2007_HPP
|
#define BOOST_UTILITY_INPLACE_FACTORY_04APR2007_HPP
|
||||||
#endif
|
|
||||||
|
|
||||||
#else
|
#else
|
||||||
#define N BOOST_PP_ITERATION()
|
#define N BOOST_PP_ITERATION()
|
||||||
|
|
||||||
@@ -54,13 +48,15 @@ public:
|
|||||||
{}
|
{}
|
||||||
|
|
||||||
template<class T>
|
template<class T>
|
||||||
void* apply(void* address) const
|
void* apply(void* address
|
||||||
|
BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(T)) const
|
||||||
{
|
{
|
||||||
return new(address) T( BOOST_PP_ENUM_PARAMS(N, m_a) );
|
return new(address) T( BOOST_PP_ENUM_PARAMS(N, m_a) );
|
||||||
}
|
}
|
||||||
|
|
||||||
template<class T>
|
template<class T>
|
||||||
void* apply(void* address, std::size_t n) const
|
void* apply(void* address, std::size_t n
|
||||||
|
BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(T)) const
|
||||||
{
|
{
|
||||||
for(char* next = address = this->BOOST_NESTED_TEMPLATE apply<T>(address);
|
for(char* next = address = this->BOOST_NESTED_TEMPLATE apply<T>(address);
|
||||||
!! --n;)
|
!! --n;)
|
||||||
|
|||||||
@@ -10,182 +10,29 @@
|
|||||||
#define BOOST_RESULT_OF_HPP
|
#define BOOST_RESULT_OF_HPP
|
||||||
|
|
||||||
#include <boost/config.hpp>
|
#include <boost/config.hpp>
|
||||||
#include <boost/detail/workaround.hpp>
|
|
||||||
#include <boost/type_traits/is_class.hpp>
|
|
||||||
#include <boost/type_traits/is_pointer.hpp>
|
|
||||||
#include <boost/type_traits/is_member_function_pointer.hpp>
|
|
||||||
#include <boost/type_traits/remove_cv.hpp>
|
|
||||||
#include <boost/type_traits/remove_reference.hpp>
|
|
||||||
#include <boost/type_traits/declval.hpp>
|
|
||||||
#include <boost/type_traits/conditional.hpp>
|
|
||||||
#include <boost/type_traits/type_identity.hpp>
|
|
||||||
#include <boost/type_traits/integral_constant.hpp>
|
|
||||||
#include <boost/core/enable_if.hpp>
|
|
||||||
|
|
||||||
#ifdef BOOST_NO_CXX11_VARIADIC_TEMPLATES
|
|
||||||
# undef BOOST_RESULT_OF_NO_VARIADIC_TEMPLATES
|
|
||||||
# define BOOST_RESULT_OF_NO_VARIADIC_TEMPLATES
|
|
||||||
#endif
|
|
||||||
#ifdef BOOST_RESULT_OF_NO_VARIADIC_TEMPLATES
|
|
||||||
# include <boost/preprocessor/cat.hpp>
|
|
||||||
#include <boost/preprocessor/iteration/iterate.hpp>
|
#include <boost/preprocessor/iteration/iterate.hpp>
|
||||||
|
#include <boost/preprocessor/punctuation/comma_if.hpp>
|
||||||
#include <boost/preprocessor/repetition/enum_params.hpp>
|
#include <boost/preprocessor/repetition/enum_params.hpp>
|
||||||
# include <boost/preprocessor/repetition/enum_trailing_params.hpp>
|
|
||||||
# include <boost/preprocessor/repetition/enum_binary_params.hpp>
|
|
||||||
#include <boost/preprocessor/repetition/enum_shifted_params.hpp>
|
#include <boost/preprocessor/repetition/enum_shifted_params.hpp>
|
||||||
# include <boost/preprocessor/facilities/intercept.hpp>
|
#include <boost/detail/workaround.hpp>
|
||||||
#endif
|
#include <boost/mpl/has_xxx.hpp>
|
||||||
|
#include <boost/mpl/if.hpp>
|
||||||
|
#include <boost/mpl/bool.hpp>
|
||||||
|
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
#ifndef BOOST_RESULT_OF_NUM_ARGS
|
#ifndef BOOST_RESULT_OF_NUM_ARGS
|
||||||
# define BOOST_RESULT_OF_NUM_ARGS 16
|
# define BOOST_RESULT_OF_NUM_ARGS 10
|
||||||
#endif
|
#endif
|
||||||
#endif // BOOST_UTILITY_DOCS
|
|
||||||
|
|
||||||
// Use the decltype-based version of result_of by default if the compiler
|
|
||||||
// supports N3276 <http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2011/n3276.pdf>.
|
|
||||||
// The user can force the choice by defining BOOST_RESULT_OF_USE_DECLTYPE,
|
|
||||||
// BOOST_RESULT_OF_USE_TR1, or BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK but not more than one!
|
|
||||||
#if (defined(BOOST_RESULT_OF_USE_DECLTYPE) && defined(BOOST_RESULT_OF_USE_TR1)) || \
|
|
||||||
(defined(BOOST_RESULT_OF_USE_DECLTYPE) && defined(BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK)) || \
|
|
||||||
(defined(BOOST_RESULT_OF_USE_TR1) && defined(BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK))
|
|
||||||
# error More than one of BOOST_RESULT_OF_USE_DECLTYPE, BOOST_RESULT_OF_USE_TR1 and \
|
|
||||||
BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK cannot be defined at the same time.
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef BOOST_UTILITY_DOCS
|
|
||||||
#ifndef BOOST_RESULT_OF_USE_TR1
|
|
||||||
# ifndef BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
# ifndef BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK
|
|
||||||
# ifndef BOOST_NO_CXX11_DECLTYPE_N3276 // this implies !defined(BOOST_NO_CXX11_DECLTYPE)
|
|
||||||
# define BOOST_RESULT_OF_USE_DECLTYPE
|
|
||||||
# else
|
|
||||||
# define BOOST_RESULT_OF_USE_TR1
|
|
||||||
# endif
|
|
||||||
# endif
|
|
||||||
# endif
|
|
||||||
#endif
|
|
||||||
#endif // BOOST_UTILITY_DOCS
|
|
||||||
|
|
||||||
namespace boost {
|
namespace boost {
|
||||||
|
|
||||||
template<typename F> struct result_of;
|
template<typename F> struct result_of;
|
||||||
template<typename F> struct tr1_result_of; // a TR1-style implementation of result_of
|
|
||||||
|
|
||||||
#if !defined(BOOST_NO_SFINAE)
|
#if !defined(BOOST_NO_SFINAE) && !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
|
||||||
namespace detail {
|
namespace detail {
|
||||||
|
|
||||||
typedef char result_of_yes_type; // sizeof(result_of_yes_type) == 1
|
BOOST_MPL_HAS_XXX_TRAIT_DEF(result_type)
|
||||||
typedef char (&result_of_no_type)[2]; // sizeof(result_of_no_type) == 2
|
|
||||||
|
|
||||||
template<class T> struct result_of_has_type {};
|
template<typename F, typename FArgs, bool HasResultType> struct result_of_impl;
|
||||||
|
|
||||||
template<class T> struct result_of_has_result_type_impl
|
|
||||||
{
|
|
||||||
template<class U> static result_of_yes_type f( result_of_has_type<typename U::result_type>* );
|
|
||||||
template<class U> static result_of_no_type f( ... );
|
|
||||||
|
|
||||||
typedef boost::integral_constant<bool, sizeof(f<T>(0)) == sizeof(result_of_yes_type)> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<class T> struct result_of_has_result_type: result_of_has_result_type_impl<T>::type
|
|
||||||
{
|
|
||||||
};
|
|
||||||
|
|
||||||
// Work around a nvcc bug by only defining has_result when it's needed.
|
|
||||||
#ifdef BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK
|
|
||||||
|
|
||||||
template<template<class> class C> struct result_of_has_template {};
|
|
||||||
|
|
||||||
template<class T> struct result_of_has_result_impl
|
|
||||||
{
|
|
||||||
template<class U> static result_of_yes_type f( result_of_has_template<U::template result>* );
|
|
||||||
template<class U> static result_of_no_type f( ... );
|
|
||||||
|
|
||||||
typedef boost::integral_constant<bool, sizeof(f<T>(0)) == sizeof(result_of_yes_type)> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<class T> struct result_of_has_result: result_of_has_result_impl<T>::type
|
|
||||||
{
|
|
||||||
};
|
|
||||||
|
|
||||||
#endif
|
|
||||||
|
|
||||||
template<typename F, typename FArgs, bool HasResultType> struct tr1_result_of_impl;
|
|
||||||
|
|
||||||
template<typename F> struct cpp0x_result_of;
|
|
||||||
|
|
||||||
#ifdef BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
// There doesn't seem to be any other way to turn this off such that the presence of
|
|
||||||
// the user-defined operator,() below doesn't cause spurious warning all over the place,
|
|
||||||
// so unconditionally and globally turn it off. (https://svn.boost.org/trac10/ticket/7663)
|
|
||||||
#ifdef BOOST_MSVC
|
|
||||||
# pragma warning(disable: 4913) // user defined binary operator ',' exists but no overload could convert all operands, default built-in binary operator ',' used
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct result_of_private_type {};
|
|
||||||
|
|
||||||
struct result_of_weird_type {
|
|
||||||
friend result_of_private_type operator,(result_of_private_type, result_of_weird_type);
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
result_of_no_type result_of_is_private_type(T const &);
|
|
||||||
result_of_yes_type result_of_is_private_type(result_of_private_type);
|
|
||||||
|
|
||||||
#ifdef BOOST_MSVC
|
|
||||||
# pragma warning(push)
|
|
||||||
# pragma warning(disable: 4512) // assignment operator could not be generated.
|
|
||||||
#endif
|
|
||||||
template<typename C>
|
|
||||||
struct result_of_callable_class : C {
|
|
||||||
result_of_callable_class();
|
|
||||||
typedef result_of_private_type const &(*pfn_t)(...);
|
|
||||||
operator pfn_t() const volatile;
|
|
||||||
};
|
|
||||||
#ifdef BOOST_MSVC
|
|
||||||
# pragma warning(pop)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
template<typename C>
|
|
||||||
struct result_of_wrap_callable_class {
|
|
||||||
typedef result_of_callable_class<C> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename C>
|
|
||||||
struct result_of_wrap_callable_class<C const> {
|
|
||||||
typedef result_of_callable_class<C> const type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename C>
|
|
||||||
struct result_of_wrap_callable_class<C volatile> {
|
|
||||||
typedef result_of_callable_class<C> volatile type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename C>
|
|
||||||
struct result_of_wrap_callable_class<C const volatile> {
|
|
||||||
typedef result_of_callable_class<C> const volatile type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename C>
|
|
||||||
struct result_of_wrap_callable_class<C &> {
|
|
||||||
typedef typename result_of_wrap_callable_class<C>::type &type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename F, bool TestCallability = true> struct cpp0x_result_of_impl;
|
|
||||||
|
|
||||||
#else // BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
struct result_of_always_void
|
|
||||||
{
|
|
||||||
typedef void type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename F, typename Enable = void> struct cpp0x_result_of_impl {};
|
|
||||||
|
|
||||||
#endif // BOOST_NO_SFINAE_EXPR
|
|
||||||
|
|
||||||
template<typename F>
|
template<typename F>
|
||||||
struct result_of_void_impl
|
struct result_of_void_impl
|
||||||
@@ -205,47 +52,33 @@ struct result_of_void_impl<R (&)(void)>
|
|||||||
typedef R type;
|
typedef R type;
|
||||||
};
|
};
|
||||||
|
|
||||||
// Determine the return type of a function pointer or pointer to member.
|
|
||||||
template<typename F, typename FArgs>
|
template<typename F, typename FArgs>
|
||||||
struct result_of_pointer
|
struct result_of_impl<F, FArgs, true>
|
||||||
: tr1_result_of_impl<typename remove_cv<F>::type, FArgs, false> { };
|
|
||||||
|
|
||||||
template<typename F, typename FArgs>
|
|
||||||
struct tr1_result_of_impl<F, FArgs, true>
|
|
||||||
{
|
{
|
||||||
typedef typename F::result_type type;
|
typedef typename F::result_type type;
|
||||||
};
|
};
|
||||||
|
|
||||||
template<typename FArgs>
|
template<typename FArgs>
|
||||||
struct is_function_with_no_args : false_type {};
|
struct is_function_with_no_args : mpl::false_ {};
|
||||||
|
|
||||||
template<typename F>
|
template<typename F>
|
||||||
struct is_function_with_no_args<F(void)> : true_type {};
|
struct is_function_with_no_args<F(void)> : mpl::true_ {};
|
||||||
|
|
||||||
template<typename F, typename FArgs>
|
template<typename F, typename FArgs>
|
||||||
struct result_of_nested_result : F::template result<FArgs>
|
struct result_of_nested_result : F::template result<FArgs>
|
||||||
{};
|
{};
|
||||||
|
|
||||||
template<typename F, typename FArgs>
|
template<typename F, typename FArgs>
|
||||||
struct tr1_result_of_impl<F, FArgs, false>
|
struct result_of_impl<F, FArgs, false>
|
||||||
: conditional<is_function_with_no_args<FArgs>::value,
|
: mpl::if_<is_function_with_no_args<FArgs>,
|
||||||
result_of_void_impl<F>,
|
result_of_void_impl<F>,
|
||||||
result_of_nested_result<F, FArgs> >::type
|
result_of_nested_result<F, FArgs> >::type
|
||||||
{};
|
{};
|
||||||
|
|
||||||
} // end namespace detail
|
} // end namespace detail
|
||||||
|
|
||||||
#ifndef BOOST_RESULT_OF_NO_VARIADIC_TEMPLATES
|
|
||||||
# include <boost/utility/detail/result_of_variadic.hpp>
|
|
||||||
#else
|
|
||||||
#define BOOST_PP_ITERATION_PARAMS_1 (3,(0,BOOST_RESULT_OF_NUM_ARGS,<boost/utility/detail/result_of_iterate.hpp>))
|
#define BOOST_PP_ITERATION_PARAMS_1 (3,(0,BOOST_RESULT_OF_NUM_ARGS,<boost/utility/detail/result_of_iterate.hpp>))
|
||||||
#include BOOST_PP_ITERATE()
|
#include BOOST_PP_ITERATE()
|
||||||
#endif
|
|
||||||
|
|
||||||
#if 0
|
|
||||||
// inform dependency trackers, as they can't see through macro includes
|
|
||||||
#include <boost/utility/detail/result_of_iterate.hpp>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#else
|
#else
|
||||||
# define BOOST_NO_RESULT_OF 1
|
# define BOOST_NO_RESULT_OF 1
|
||||||
|
|||||||
@@ -1,520 +0,0 @@
|
|||||||
/*
|
|
||||||
Copyright (c) Marshall Clow 2012-2015.
|
|
||||||
Copyright (c) Glen Joseph Fernandes 2019 (glenjofe@gmail.com)
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
For more information, see http://www.boost.org
|
|
||||||
|
|
||||||
Based on the StringRef implementation in LLVM (http://llvm.org) and
|
|
||||||
N3422 by Jeffrey Yasskin
|
|
||||||
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3442.html
|
|
||||||
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef BOOST_STRING_REF_HPP
|
|
||||||
#define BOOST_STRING_REF_HPP
|
|
||||||
|
|
||||||
#include <boost/config.hpp>
|
|
||||||
#include <boost/detail/workaround.hpp>
|
|
||||||
#include <boost/io/ostream_put.hpp>
|
|
||||||
#include <boost/utility/string_ref_fwd.hpp>
|
|
||||||
#include <boost/throw_exception.hpp>
|
|
||||||
|
|
||||||
#include <cstddef>
|
|
||||||
#include <stdexcept>
|
|
||||||
#include <algorithm>
|
|
||||||
#include <iterator>
|
|
||||||
#include <string>
|
|
||||||
#include <iosfwd>
|
|
||||||
|
|
||||||
#if defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) || (defined(BOOST_GCC) && ((BOOST_GCC+0) / 100) <= 406)
|
|
||||||
// GCC 4.6 cannot handle a defaulted function with noexcept specifier
|
|
||||||
#define BOOST_STRING_REF_NO_CXX11_DEFAULTED_NOEXCEPT_FUNCTIONS
|
|
||||||
#endif
|
|
||||||
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
namespace detail {
|
|
||||||
// A helper functor because sometimes we don't have lambdas
|
|
||||||
template <typename charT, typename traits>
|
|
||||||
class string_ref_traits_eq {
|
|
||||||
public:
|
|
||||||
string_ref_traits_eq ( charT ch ) : ch_(ch) {}
|
|
||||||
bool operator () ( charT val ) const { return traits::eq ( ch_, val ); }
|
|
||||||
charT ch_;
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
class basic_string_ref {
|
|
||||||
public:
|
|
||||||
// types
|
|
||||||
typedef charT value_type;
|
|
||||||
typedef const charT* pointer;
|
|
||||||
typedef const charT& reference;
|
|
||||||
typedef const charT& const_reference;
|
|
||||||
typedef pointer const_iterator; // impl-defined
|
|
||||||
typedef const_iterator iterator;
|
|
||||||
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
|
|
||||||
typedef const_reverse_iterator reverse_iterator;
|
|
||||||
typedef std::size_t size_type;
|
|
||||||
typedef std::ptrdiff_t difference_type;
|
|
||||||
static BOOST_CONSTEXPR_OR_CONST size_type npos = size_type(-1);
|
|
||||||
|
|
||||||
// construct/copy
|
|
||||||
BOOST_CONSTEXPR basic_string_ref () BOOST_NOEXCEPT
|
|
||||||
: ptr_(NULL), len_(0) {}
|
|
||||||
|
|
||||||
// by defaulting these functions, basic_string_ref becomes
|
|
||||||
// trivially copy/move constructible.
|
|
||||||
BOOST_CONSTEXPR basic_string_ref (const basic_string_ref &rhs) BOOST_NOEXCEPT
|
|
||||||
#ifndef BOOST_STRING_REF_NO_CXX11_DEFAULTED_NOEXCEPT_FUNCTIONS
|
|
||||||
= default;
|
|
||||||
#else
|
|
||||||
: ptr_(rhs.ptr_), len_(rhs.len_) {}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
basic_string_ref& operator=(const basic_string_ref &rhs) BOOST_NOEXCEPT
|
|
||||||
#ifndef BOOST_STRING_REF_NO_CXX11_DEFAULTED_NOEXCEPT_FUNCTIONS
|
|
||||||
= default;
|
|
||||||
#else
|
|
||||||
{
|
|
||||||
ptr_ = rhs.ptr_;
|
|
||||||
len_ = rhs.len_;
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
basic_string_ref(const charT* str) BOOST_NOEXCEPT
|
|
||||||
: ptr_(str), len_(traits::length(str)) {}
|
|
||||||
|
|
||||||
template<typename Allocator>
|
|
||||||
basic_string_ref(const std::basic_string<charT, traits, Allocator>& str)
|
|
||||||
: ptr_(str.data()), len_(str.length()) {}
|
|
||||||
|
|
||||||
// #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_CXX11_DELETED_FUNCTIONS)
|
|
||||||
// // Constructing a string_ref from a temporary string is a bad idea
|
|
||||||
// template<typename Allocator>
|
|
||||||
// basic_string_ref( std::basic_string<charT, traits, Allocator>&&)
|
|
||||||
// = delete;
|
|
||||||
// #endif
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR basic_string_ref(const charT* str, size_type len) BOOST_NOEXCEPT
|
|
||||||
: ptr_(str), len_(len) {}
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS
|
|
||||||
template<typename Allocator>
|
|
||||||
explicit operator std::basic_string<charT, traits, Allocator>() const {
|
|
||||||
return std::basic_string<charT, traits, Allocator> ( begin(), end());
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
std::basic_string<charT, traits> to_string () const {
|
|
||||||
return std::basic_string<charT, traits> ( begin(), end());
|
|
||||||
}
|
|
||||||
|
|
||||||
// iterators
|
|
||||||
BOOST_CONSTEXPR const_iterator begin() const { return ptr_; }
|
|
||||||
BOOST_CONSTEXPR const_iterator cbegin() const { return ptr_; }
|
|
||||||
BOOST_CONSTEXPR const_iterator end() const { return ptr_ + len_; }
|
|
||||||
BOOST_CONSTEXPR const_iterator cend() const { return ptr_ + len_; }
|
|
||||||
const_reverse_iterator rbegin() const { return const_reverse_iterator (end()); }
|
|
||||||
const_reverse_iterator crbegin() const { return const_reverse_iterator (end()); }
|
|
||||||
const_reverse_iterator rend() const { return const_reverse_iterator (begin()); }
|
|
||||||
const_reverse_iterator crend() const { return const_reverse_iterator (begin()); }
|
|
||||||
|
|
||||||
// capacity
|
|
||||||
BOOST_CONSTEXPR size_type size() const { return len_; }
|
|
||||||
BOOST_CONSTEXPR size_type length() const { return len_; }
|
|
||||||
BOOST_CONSTEXPR size_type max_size() const { return ~static_cast<size_type>(0) / (sizeof(value_type) * 2u); }
|
|
||||||
BOOST_CONSTEXPR bool empty() const { return len_ == 0; }
|
|
||||||
|
|
||||||
// element access
|
|
||||||
BOOST_CONSTEXPR const charT& operator[](size_type pos) const { return ptr_[pos]; }
|
|
||||||
|
|
||||||
const charT& at(size_type pos) const {
|
|
||||||
if ( pos >= len_ )
|
|
||||||
BOOST_THROW_EXCEPTION( std::out_of_range ( "boost::string_ref::at" ) );
|
|
||||||
return ptr_[pos];
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR const charT& front() const { return ptr_[0]; }
|
|
||||||
BOOST_CONSTEXPR const charT& back() const { return ptr_[len_-1]; }
|
|
||||||
BOOST_CONSTEXPR const charT* data() const { return ptr_; }
|
|
||||||
|
|
||||||
// modifiers
|
|
||||||
void clear() { len_ = 0; }
|
|
||||||
void remove_prefix(size_type n) {
|
|
||||||
if ( n > len_ )
|
|
||||||
n = len_;
|
|
||||||
ptr_ += n;
|
|
||||||
len_ -= n;
|
|
||||||
}
|
|
||||||
|
|
||||||
void remove_suffix(size_type n) {
|
|
||||||
if ( n > len_ )
|
|
||||||
n = len_;
|
|
||||||
len_ -= n;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
// basic_string_ref string operations
|
|
||||||
basic_string_ref substr() const {
|
|
||||||
return basic_string_ref(data(), size());
|
|
||||||
}
|
|
||||||
|
|
||||||
basic_string_ref substr(size_type pos, size_type n=npos) const {
|
|
||||||
if ( pos > size())
|
|
||||||
BOOST_THROW_EXCEPTION( std::out_of_range ( "string_ref::substr" ) );
|
|
||||||
return basic_string_ref(data() + pos, (std::min)(size() - pos, n));
|
|
||||||
}
|
|
||||||
|
|
||||||
int compare(basic_string_ref x) const {
|
|
||||||
const int cmp = traits::compare ( ptr_, x.ptr_, (std::min)(len_, x.len_));
|
|
||||||
return cmp != 0 ? cmp : ( len_ == x.len_ ? 0 : len_ < x.len_ ? -1 : 1 );
|
|
||||||
}
|
|
||||||
|
|
||||||
bool starts_with(charT c) const { return !empty() && traits::eq ( c, front()); }
|
|
||||||
bool starts_with(basic_string_ref x) const {
|
|
||||||
return len_ >= x.len_ && traits::compare ( ptr_, x.ptr_, x.len_ ) == 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool ends_with(charT c) const { return !empty() && traits::eq ( c, back()); }
|
|
||||||
bool ends_with(basic_string_ref x) const {
|
|
||||||
return len_ >= x.len_ && traits::compare ( ptr_ + len_ - x.len_, x.ptr_, x.len_ ) == 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type find(basic_string_ref s) const {
|
|
||||||
if (s.empty()) return 0;
|
|
||||||
const_iterator iter = std::search ( this->cbegin (), this->cend (),
|
|
||||||
s.cbegin (), s.cend (), traits::eq );
|
|
||||||
return iter == this->cend () ? npos : std::distance ( this->cbegin (), iter );
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type find(charT c) const {
|
|
||||||
const_iterator iter = std::find_if ( this->cbegin (), this->cend (),
|
|
||||||
detail::string_ref_traits_eq<charT, traits> ( c ));
|
|
||||||
return iter == this->cend () ? npos : std::distance ( this->cbegin (), iter );
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type rfind(basic_string_ref s) const {
|
|
||||||
if (s.empty()) return 0;
|
|
||||||
const_reverse_iterator iter = std::search ( this->crbegin (), this->crend (),
|
|
||||||
s.crbegin (), s.crend (), traits::eq );
|
|
||||||
return iter == this->crend () ? npos : (std::distance(iter, this->crend()) - s.size());
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type rfind(charT c) const {
|
|
||||||
const_reverse_iterator iter = std::find_if ( this->crbegin (), this->crend (),
|
|
||||||
detail::string_ref_traits_eq<charT, traits> ( c ));
|
|
||||||
return iter == this->crend () ? npos : (this->size() - 1 - std::distance(this->crbegin(), iter));
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type find_first_of(charT c) const { return find (c); }
|
|
||||||
size_type find_last_of (charT c) const { return rfind (c); }
|
|
||||||
|
|
||||||
size_type find_first_of(basic_string_ref s) const {
|
|
||||||
const_iterator iter = std::find_first_of
|
|
||||||
( this->cbegin (), this->cend (), s.cbegin (), s.cend (), traits::eq );
|
|
||||||
return iter == this->cend () ? npos : std::distance ( this->cbegin (), iter );
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type find_last_of(basic_string_ref s) const {
|
|
||||||
const_reverse_iterator iter = std::find_first_of
|
|
||||||
( this->crbegin (), this->crend (), s.cbegin (), s.cend (), traits::eq );
|
|
||||||
return iter == this->crend () ? npos : (this->size() - 1 - std::distance(this->crbegin(), iter));
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type find_first_not_of(basic_string_ref s) const {
|
|
||||||
const_iterator iter = find_not_of ( this->cbegin (), this->cend (), s );
|
|
||||||
return iter == this->cend () ? npos : std::distance ( this->cbegin (), iter );
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type find_first_not_of(charT c) const {
|
|
||||||
for ( const_iterator iter = this->cbegin (); iter != this->cend (); ++iter )
|
|
||||||
if ( !traits::eq ( c, *iter ))
|
|
||||||
return std::distance ( this->cbegin (), iter );
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type find_last_not_of(basic_string_ref s) const {
|
|
||||||
const_reverse_iterator iter = find_not_of ( this->crbegin (), this->crend (), s );
|
|
||||||
return iter == this->crend () ? npos : (this->size() - 1 - std::distance(this->crbegin(), iter));
|
|
||||||
}
|
|
||||||
|
|
||||||
size_type find_last_not_of(charT c) const {
|
|
||||||
for ( const_reverse_iterator iter = this->crbegin (); iter != this->crend (); ++iter )
|
|
||||||
if ( !traits::eq ( c, *iter ))
|
|
||||||
return this->size() - 1 - std::distance(this->crbegin(), iter);
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
|
|
||||||
template <typename Iterator>
|
|
||||||
Iterator find_not_of ( Iterator first, Iterator last, basic_string_ref s ) const {
|
|
||||||
for ( ; first != last ; ++first )
|
|
||||||
if ( 0 == traits::find ( s.ptr_, s.len_, *first ))
|
|
||||||
return first;
|
|
||||||
return last;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
const charT *ptr_;
|
|
||||||
std::size_t len_;
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
// Comparison operators
|
|
||||||
// Equality
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator==(basic_string_ref<charT, traits> x, basic_string_ref<charT, traits> y) {
|
|
||||||
if ( x.size () != y.size ()) return false;
|
|
||||||
return x.compare(y) == 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator==(basic_string_ref<charT, traits> x, const std::basic_string<charT, traits, Allocator> & y) {
|
|
||||||
return x == basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator==(const std::basic_string<charT, traits, Allocator> & x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) == y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator==(basic_string_ref<charT, traits> x, const charT * y) {
|
|
||||||
return x == basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator==(const charT * x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) == y;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Inequality
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator!=(basic_string_ref<charT, traits> x, basic_string_ref<charT, traits> y) {
|
|
||||||
if ( x.size () != y.size ()) return true;
|
|
||||||
return x.compare(y) != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator!=(basic_string_ref<charT, traits> x, const std::basic_string<charT, traits, Allocator> & y) {
|
|
||||||
return x != basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator!=(const std::basic_string<charT, traits, Allocator> & x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) != y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator!=(basic_string_ref<charT, traits> x, const charT * y) {
|
|
||||||
return x != basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator!=(const charT * x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) != y;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Less than
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator<(basic_string_ref<charT, traits> x, basic_string_ref<charT, traits> y) {
|
|
||||||
return x.compare(y) < 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator<(basic_string_ref<charT, traits> x, const std::basic_string<charT, traits, Allocator> & y) {
|
|
||||||
return x < basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator<(const std::basic_string<charT, traits, Allocator> & x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) < y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator<(basic_string_ref<charT, traits> x, const charT * y) {
|
|
||||||
return x < basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator<(const charT * x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) < y;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Greater than
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator>(basic_string_ref<charT, traits> x, basic_string_ref<charT, traits> y) {
|
|
||||||
return x.compare(y) > 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator>(basic_string_ref<charT, traits> x, const std::basic_string<charT, traits, Allocator> & y) {
|
|
||||||
return x > basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator>(const std::basic_string<charT, traits, Allocator> & x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) > y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator>(basic_string_ref<charT, traits> x, const charT * y) {
|
|
||||||
return x > basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator>(const charT * x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) > y;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Less than or equal to
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator<=(basic_string_ref<charT, traits> x, basic_string_ref<charT, traits> y) {
|
|
||||||
return x.compare(y) <= 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator<=(basic_string_ref<charT, traits> x, const std::basic_string<charT, traits, Allocator> & y) {
|
|
||||||
return x <= basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator<=(const std::basic_string<charT, traits, Allocator> & x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) <= y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator<=(basic_string_ref<charT, traits> x, const charT * y) {
|
|
||||||
return x <= basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator<=(const charT * x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) <= y;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Greater than or equal to
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator>=(basic_string_ref<charT, traits> x, basic_string_ref<charT, traits> y) {
|
|
||||||
return x.compare(y) >= 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator>=(basic_string_ref<charT, traits> x, const std::basic_string<charT, traits, Allocator> & y) {
|
|
||||||
return x >= basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline bool operator>=(const std::basic_string<charT, traits, Allocator> & x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) >= y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator>=(basic_string_ref<charT, traits> x, const charT * y) {
|
|
||||||
return x >= basic_string_ref<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline bool operator>=(const charT * x, basic_string_ref<charT, traits> y) {
|
|
||||||
return basic_string_ref<charT, traits>(x) >= y;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Inserter
|
|
||||||
template<class charT, class traits>
|
|
||||||
inline std::basic_ostream<charT, traits>&
|
|
||||||
operator<<(std::basic_ostream<charT, traits>& os, const basic_string_ref<charT,traits>& str) {
|
|
||||||
return boost::io::ostream_put(os, str.data(), str.size());
|
|
||||||
}
|
|
||||||
|
|
||||||
#if 0
|
|
||||||
// numeric conversions
|
|
||||||
//
|
|
||||||
// These are short-term implementations.
|
|
||||||
// In a production environment, I would rather avoid the copying.
|
|
||||||
//
|
|
||||||
inline int stoi (string_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoi ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long stol (string_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stol ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned long stoul (string_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoul ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long long stoll (string_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoll ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned long long stoull (string_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoull ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline float stof (string_ref str, size_t* idx=0) {
|
|
||||||
return std::stof ( std::string(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline double stod (string_ref str, size_t* idx=0) {
|
|
||||||
return std::stod ( std::string(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long double stold (string_ref str, size_t* idx=0) {
|
|
||||||
return std::stold ( std::string(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline int stoi (wstring_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoi ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long stol (wstring_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stol ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned long stoul (wstring_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoul ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long long stoll (wstring_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoll ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned long long stoull (wstring_ref str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoull ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline float stof (wstring_ref str, size_t* idx=0) {
|
|
||||||
return std::stof ( std::wstring(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline double stod (wstring_ref str, size_t* idx=0) {
|
|
||||||
return std::stod ( std::wstring(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long double stold (wstring_ref str, size_t* idx=0) {
|
|
||||||
return std::stold ( std::wstring(str), idx );
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
#if 0
|
|
||||||
namespace std {
|
|
||||||
// Hashing
|
|
||||||
template<> struct hash<boost::string_ref>;
|
|
||||||
template<> struct hash<boost::u16string_ref>;
|
|
||||||
template<> struct hash<boost::u32string_ref>;
|
|
||||||
template<> struct hash<boost::wstring_ref>;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,37 +0,0 @@
|
|||||||
/*
|
|
||||||
Copyright (c) Marshall Clow 2012-2012.
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
For more information, see http://www.boost.org
|
|
||||||
|
|
||||||
Based on the StringRef implementation in LLVM (http://llvm.org) and
|
|
||||||
N3422 by Jeffrey Yasskin
|
|
||||||
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3442.html
|
|
||||||
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef BOOST_STRING_REF_FWD_HPP
|
|
||||||
#define BOOST_STRING_REF_FWD_HPP
|
|
||||||
|
|
||||||
#include <boost/config.hpp>
|
|
||||||
#include <string>
|
|
||||||
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
template<typename charT, typename traits = std::char_traits<charT> > class basic_string_ref;
|
|
||||||
typedef basic_string_ref<char, std::char_traits<char> > string_ref;
|
|
||||||
typedef basic_string_ref<wchar_t, std::char_traits<wchar_t> > wstring_ref;
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_CXX11_CHAR16_T
|
|
||||||
typedef basic_string_ref<char16_t, std::char_traits<char16_t> > u16string_ref;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_CXX11_CHAR32_T
|
|
||||||
typedef basic_string_ref<char32_t, std::char_traits<char32_t> > u32string_ref;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,689 +0,0 @@
|
|||||||
/*
|
|
||||||
Copyright (c) Marshall Clow 2012-2015.
|
|
||||||
Copyright (c) Beman Dawes 2015
|
|
||||||
Copyright (c) Glen Joseph Fernandes 2019 (glenjofe@gmail.com)
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
For more information, see http://www.boost.org
|
|
||||||
|
|
||||||
Based on the StringRef implementation in LLVM (http://llvm.org) and
|
|
||||||
N3422 by Jeffrey Yasskin
|
|
||||||
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3442.html
|
|
||||||
Updated July 2015 to reflect the Library Fundamentals TS
|
|
||||||
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4480.html
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef BOOST_STRING_VIEW_HPP
|
|
||||||
#define BOOST_STRING_VIEW_HPP
|
|
||||||
|
|
||||||
#include <boost/config.hpp>
|
|
||||||
#include <boost/detail/workaround.hpp>
|
|
||||||
#include <boost/io/ostream_put.hpp>
|
|
||||||
#include <boost/utility/string_view_fwd.hpp>
|
|
||||||
#include <boost/throw_exception.hpp>
|
|
||||||
|
|
||||||
#include <cstddef>
|
|
||||||
#include <stdexcept>
|
|
||||||
#include <algorithm>
|
|
||||||
#include <iterator>
|
|
||||||
#include <string>
|
|
||||||
#include <cstring>
|
|
||||||
#include <iosfwd>
|
|
||||||
|
|
||||||
#if defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) || (defined(BOOST_GCC) && ((BOOST_GCC+0) / 100) <= 406)
|
|
||||||
// GCC 4.6 cannot handle a defaulted function with noexcept specifier
|
|
||||||
#define BOOST_STRING_VIEW_NO_CXX11_DEFAULTED_NOEXCEPT_FUNCTIONS
|
|
||||||
#endif
|
|
||||||
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
namespace detail {
|
|
||||||
// A helper functor because sometimes we don't have lambdas
|
|
||||||
template <typename charT, typename traits>
|
|
||||||
class string_view_traits_eq {
|
|
||||||
public:
|
|
||||||
string_view_traits_eq ( charT ch ) : ch_(ch) {}
|
|
||||||
bool operator()( charT val ) const { return traits::eq (ch_, val); }
|
|
||||||
charT ch_;
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits> // traits defaulted in string_view_fwd.hpp
|
|
||||||
class basic_string_view {
|
|
||||||
public:
|
|
||||||
// types
|
|
||||||
typedef traits traits_type;
|
|
||||||
typedef charT value_type;
|
|
||||||
typedef charT* pointer;
|
|
||||||
typedef const charT* const_pointer;
|
|
||||||
typedef charT& reference;
|
|
||||||
typedef const charT& const_reference;
|
|
||||||
typedef const_pointer const_iterator; // impl-defined
|
|
||||||
typedef const_iterator iterator;
|
|
||||||
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
|
|
||||||
typedef const_reverse_iterator reverse_iterator;
|
|
||||||
typedef std::size_t size_type;
|
|
||||||
typedef std::ptrdiff_t difference_type;
|
|
||||||
static BOOST_CONSTEXPR_OR_CONST size_type npos = size_type(-1);
|
|
||||||
|
|
||||||
// construct/copy
|
|
||||||
BOOST_CONSTEXPR basic_string_view() BOOST_NOEXCEPT
|
|
||||||
: ptr_(NULL), len_(0) {}
|
|
||||||
|
|
||||||
// by defaulting these functions, basic_string_ref becomes
|
|
||||||
// trivially copy/move constructible.
|
|
||||||
BOOST_CONSTEXPR basic_string_view(const basic_string_view &rhs) BOOST_NOEXCEPT
|
|
||||||
#ifndef BOOST_STRING_VIEW_NO_CXX11_DEFAULTED_NOEXCEPT_FUNCTIONS
|
|
||||||
= default;
|
|
||||||
#else
|
|
||||||
: ptr_(rhs.ptr_), len_(rhs.len_) {}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
basic_string_view& operator=(const basic_string_view &rhs) BOOST_NOEXCEPT
|
|
||||||
#ifndef BOOST_STRING_VIEW_NO_CXX11_DEFAULTED_NOEXCEPT_FUNCTIONS
|
|
||||||
= default;
|
|
||||||
#else
|
|
||||||
{
|
|
||||||
ptr_ = rhs.ptr_;
|
|
||||||
len_ = rhs.len_;
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
template<typename Allocator>
|
|
||||||
basic_string_view(const std::basic_string<charT, traits, Allocator>& str) BOOST_NOEXCEPT
|
|
||||||
: ptr_(str.data()), len_(str.length()) {}
|
|
||||||
|
|
||||||
// #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_CXX11_DELETED_FUNCTIONS)
|
|
||||||
// // Constructing a string_view from a temporary string is a bad idea
|
|
||||||
// template<typename Allocator>
|
|
||||||
// basic_string_view( std::basic_string<charT, traits, Allocator>&&)
|
|
||||||
// = delete;
|
|
||||||
// #endif
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR basic_string_view(const charT* str)
|
|
||||||
: ptr_(str), len_(traits::length(str)) {}
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR basic_string_view(const charT* str, size_type len)
|
|
||||||
: ptr_(str), len_(len) {}
|
|
||||||
|
|
||||||
// iterators
|
|
||||||
BOOST_CONSTEXPR const_iterator begin() const BOOST_NOEXCEPT { return ptr_; }
|
|
||||||
BOOST_CONSTEXPR const_iterator cbegin() const BOOST_NOEXCEPT { return ptr_; }
|
|
||||||
BOOST_CONSTEXPR const_iterator end() const BOOST_NOEXCEPT { return ptr_ + len_; }
|
|
||||||
BOOST_CONSTEXPR const_iterator cend() const BOOST_NOEXCEPT { return ptr_ + len_; }
|
|
||||||
const_reverse_iterator rbegin() const BOOST_NOEXCEPT { return const_reverse_iterator(end()); }
|
|
||||||
const_reverse_iterator crbegin() const BOOST_NOEXCEPT { return const_reverse_iterator(end()); }
|
|
||||||
const_reverse_iterator rend() const BOOST_NOEXCEPT { return const_reverse_iterator(begin()); }
|
|
||||||
const_reverse_iterator crend() const BOOST_NOEXCEPT { return const_reverse_iterator(begin()); }
|
|
||||||
|
|
||||||
// capacity
|
|
||||||
BOOST_CONSTEXPR size_type size() const BOOST_NOEXCEPT { return len_; }
|
|
||||||
BOOST_CONSTEXPR size_type length() const BOOST_NOEXCEPT { return len_; }
|
|
||||||
BOOST_CONSTEXPR size_type max_size() const BOOST_NOEXCEPT { return ~static_cast<size_type>(0) / (sizeof(value_type) * 2u); }
|
|
||||||
BOOST_CONSTEXPR bool empty() const BOOST_NOEXCEPT { return len_ == 0; }
|
|
||||||
|
|
||||||
// element access
|
|
||||||
BOOST_CONSTEXPR const_reference operator[](size_type pos) const BOOST_NOEXCEPT { return ptr_[pos]; }
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR const_reference at(size_type pos) const {
|
|
||||||
return pos >= len_ ? BOOST_THROW_EXCEPTION(std::out_of_range("boost::string_view::at")), ptr_[0] : ptr_[pos];
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR const_reference front() const { return ptr_[0]; }
|
|
||||||
BOOST_CONSTEXPR const_reference back() const { return ptr_[len_-1]; }
|
|
||||||
BOOST_CONSTEXPR const_pointer data() const BOOST_NOEXCEPT { return ptr_; }
|
|
||||||
|
|
||||||
// modifiers
|
|
||||||
void clear() BOOST_NOEXCEPT { len_ = 0; } // Boost extension
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR void remove_prefix(size_type n) {
|
|
||||||
if ( n > len_ )
|
|
||||||
n = len_;
|
|
||||||
ptr_ += n;
|
|
||||||
len_ -= n;
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR void remove_suffix(size_type n) {
|
|
||||||
if ( n > len_ )
|
|
||||||
n = len_;
|
|
||||||
len_ -= n;
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR void swap(basic_string_view& s) BOOST_NOEXCEPT {
|
|
||||||
std::swap(ptr_, s.ptr_);
|
|
||||||
std::swap(len_, s.len_);
|
|
||||||
}
|
|
||||||
|
|
||||||
// basic_string_view string operations
|
|
||||||
#ifndef BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS
|
|
||||||
template<typename Allocator>
|
|
||||||
explicit operator std::basic_string<charT, traits, Allocator>() const {
|
|
||||||
return std::basic_string<charT, traits, Allocator>(begin(), end());
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_CXX11_FUNCTION_TEMPLATE_DEFAULT_ARGS
|
|
||||||
template<typename Allocator = std::allocator<charT> >
|
|
||||||
std::basic_string<charT, traits, Allocator> to_string(const Allocator& a = Allocator()) const {
|
|
||||||
return std::basic_string<charT, traits, Allocator>(begin(), end(), a);
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
std::basic_string<charT, traits> to_string() const {
|
|
||||||
return std::basic_string<charT, traits>(begin(), end());
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename Allocator>
|
|
||||||
std::basic_string<charT, traits, Allocator> to_string(const Allocator& a) const {
|
|
||||||
return std::basic_string<charT, traits, Allocator>(begin(), end(), a);
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
size_type copy(charT* s, size_type n, size_type pos=0) const {
|
|
||||||
if (pos > size())
|
|
||||||
BOOST_THROW_EXCEPTION(std::out_of_range("string_view::copy" ));
|
|
||||||
size_type rlen = (std::min)(n, len_ - pos);
|
|
||||||
traits_type::copy(s, data() + pos, rlen);
|
|
||||||
return rlen;
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR basic_string_view substr() const {
|
|
||||||
return basic_string_view(data(), size());
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR basic_string_view substr(size_type pos, size_type n=npos) const {
|
|
||||||
if ( pos > size())
|
|
||||||
BOOST_THROW_EXCEPTION( std::out_of_range ( "string_view::substr" ) );
|
|
||||||
return basic_string_view(data() + pos, (std::min)(size() - pos, n));
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR int compare(basic_string_view x) const BOOST_NOEXCEPT {
|
|
||||||
const int cmp = traits::compare(ptr_, x.ptr_, (std::min)(len_, x.len_));
|
|
||||||
return cmp != 0 ? cmp : (len_ == x.len_ ? 0 : len_ < x.len_ ? -1 : 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR int compare(size_type pos1, size_type n1, basic_string_view x)
|
|
||||||
const {
|
|
||||||
return substr(pos1, n1).compare(x);
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR int compare(size_type pos1, size_type n1,
|
|
||||||
basic_string_view x, size_type pos2, size_type n2) const {
|
|
||||||
return substr(pos1, n1).compare(x.substr(pos2, n2));
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR int compare(const charT* x) const {
|
|
||||||
return compare(basic_string_view(x));
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR int compare(size_type pos1, size_type n1, const charT* x) const {
|
|
||||||
return substr(pos1, n1).compare(basic_string_view(x));
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR int compare(size_type pos1, size_type n1,
|
|
||||||
const charT* x, size_type n2) const {
|
|
||||||
return substr(pos1, n1).compare(basic_string_view(x, n2));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Searches
|
|
||||||
BOOST_CONSTEXPR bool starts_with(charT c) const BOOST_NOEXCEPT { // Boost extension
|
|
||||||
return !empty() && traits::eq(c, front());
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR bool starts_with(basic_string_view x) const BOOST_NOEXCEPT { // Boost extension
|
|
||||||
return len_ >= x.len_ && traits::compare(ptr_, x.ptr_, x.len_) == 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR bool ends_with(charT c) const BOOST_NOEXCEPT { // Boost extension
|
|
||||||
return !empty() && traits::eq(c, back());
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CONSTEXPR bool ends_with(basic_string_view x) const BOOST_NOEXCEPT { // Boost extension
|
|
||||||
return len_ >= x.len_ &&
|
|
||||||
traits::compare(ptr_ + len_ - x.len_, x.ptr_, x.len_) == 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR bool contains(basic_string_view s) const BOOST_NOEXCEPT {
|
|
||||||
return find(s) != npos;
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR bool contains(charT c) const BOOST_NOEXCEPT {
|
|
||||||
return find(c) != npos;
|
|
||||||
}
|
|
||||||
|
|
||||||
BOOST_CXX14_CONSTEXPR bool contains(const charT* s) const BOOST_NOEXCEPT {
|
|
||||||
return find(s) != npos;
|
|
||||||
}
|
|
||||||
|
|
||||||
// find
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find(basic_string_view s, size_type pos = 0) const BOOST_NOEXCEPT {
|
|
||||||
if (pos > size())
|
|
||||||
return npos;
|
|
||||||
if (s.empty())
|
|
||||||
return pos;
|
|
||||||
if (s.size() > size() - pos)
|
|
||||||
return npos;
|
|
||||||
const charT* cur = ptr_ + pos;
|
|
||||||
const charT* last = cend() - s.size() + 1;
|
|
||||||
for (; cur != last ; ++cur) {
|
|
||||||
cur = traits::find(cur, last - cur, s[0]);
|
|
||||||
if (!cur)
|
|
||||||
return npos;
|
|
||||||
if (traits::compare(cur, s.cbegin(), s.size()) == 0)
|
|
||||||
return cur - ptr_;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find(charT c, size_type pos = 0) const BOOST_NOEXCEPT {
|
|
||||||
if (pos > size())
|
|
||||||
return npos;
|
|
||||||
const charT* ret_ptr = traits::find(ptr_ + pos, len_ - pos, c);
|
|
||||||
if (ret_ptr)
|
|
||||||
return ret_ptr - ptr_;
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find(const charT* s, size_type pos, size_type n) const BOOST_NOEXCEPT
|
|
||||||
{ return find(basic_string_view(s, n), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find(const charT* s, size_type pos = 0) const BOOST_NOEXCEPT
|
|
||||||
{ return find(basic_string_view(s), pos); }
|
|
||||||
|
|
||||||
// rfind
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type rfind(basic_string_view s, size_type pos = npos) const BOOST_NOEXCEPT {
|
|
||||||
if (len_ < s.len_)
|
|
||||||
return npos;
|
|
||||||
if (pos > len_ - s.len_)
|
|
||||||
pos = len_ - s.len_;
|
|
||||||
if (s.len_ == 0u) // an empty string is always found
|
|
||||||
return pos;
|
|
||||||
for (const charT* cur = ptr_ + pos; ; --cur) {
|
|
||||||
if (traits::compare(cur, s.ptr_, s.len_) == 0)
|
|
||||||
return cur - ptr_;
|
|
||||||
if (cur == ptr_)
|
|
||||||
return npos;
|
|
||||||
};
|
|
||||||
}
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type rfind(charT c, size_type pos = npos) const BOOST_NOEXCEPT
|
|
||||||
{ return rfind(basic_string_view(&c, 1), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type rfind(const charT* s, size_type pos, size_type n) const BOOST_NOEXCEPT
|
|
||||||
{ return rfind(basic_string_view(s, n), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type rfind(const charT* s, size_type pos = npos) const BOOST_NOEXCEPT
|
|
||||||
{ return rfind(basic_string_view(s), pos); }
|
|
||||||
|
|
||||||
// find_first_of
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_first_of(basic_string_view s, size_type pos = 0) const BOOST_NOEXCEPT {
|
|
||||||
if (pos >= len_ || s.len_ == 0)
|
|
||||||
return npos;
|
|
||||||
const_iterator iter = std::find_first_of
|
|
||||||
(this->cbegin () + pos, this->cend (), s.cbegin (), s.cend (), traits::eq);
|
|
||||||
return iter == this->cend () ? npos : std::distance ( this->cbegin (), iter );
|
|
||||||
}
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_first_of(charT c, size_type pos = 0) const BOOST_NOEXCEPT
|
|
||||||
{ return find(c, pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_first_of(const charT* s, size_type pos, size_type n) const BOOST_NOEXCEPT
|
|
||||||
{ return find_first_of(basic_string_view(s, n), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_first_of(const charT* s, size_type pos = 0) const BOOST_NOEXCEPT
|
|
||||||
{ return find_first_of(basic_string_view(s), pos); }
|
|
||||||
|
|
||||||
// find_last_of
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_last_of(basic_string_view s, size_type pos = npos) const BOOST_NOEXCEPT {
|
|
||||||
if (s.len_ == 0u)
|
|
||||||
return npos;
|
|
||||||
if (pos >= len_)
|
|
||||||
pos = 0;
|
|
||||||
else
|
|
||||||
pos = len_ - (pos+1);
|
|
||||||
const_reverse_iterator iter = std::find_first_of
|
|
||||||
( this->crbegin () + pos, this->crend (), s.cbegin (), s.cend (), traits::eq );
|
|
||||||
return iter == this->crend () ? npos : reverse_distance ( this->crbegin (), iter);
|
|
||||||
}
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_last_of(charT c, size_type pos = npos) const BOOST_NOEXCEPT
|
|
||||||
{ return find_last_of(basic_string_view(&c, 1), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_last_of(const charT* s, size_type pos, size_type n) const BOOST_NOEXCEPT
|
|
||||||
{ return find_last_of(basic_string_view(s, n), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_last_of(const charT* s, size_type pos = npos) const BOOST_NOEXCEPT
|
|
||||||
{ return find_last_of(basic_string_view(s), pos); }
|
|
||||||
|
|
||||||
// find_first_not_of
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_first_not_of(basic_string_view s, size_type pos = 0) const BOOST_NOEXCEPT {
|
|
||||||
if (pos >= len_)
|
|
||||||
return npos;
|
|
||||||
if (s.len_ == 0)
|
|
||||||
return pos;
|
|
||||||
const_iterator iter = find_not_of ( this->cbegin () + pos, this->cend (), s );
|
|
||||||
return iter == this->cend () ? npos : std::distance ( this->cbegin (), iter );
|
|
||||||
}
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_first_not_of(charT c, size_type pos = 0) const BOOST_NOEXCEPT
|
|
||||||
{ return find_first_not_of(basic_string_view(&c, 1), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_first_not_of(const charT* s, size_type pos, size_type n) const BOOST_NOEXCEPT
|
|
||||||
{ return find_first_not_of(basic_string_view(s, n), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_first_not_of(const charT* s, size_type pos = 0) const BOOST_NOEXCEPT
|
|
||||||
{ return find_first_not_of(basic_string_view(s), pos); }
|
|
||||||
|
|
||||||
// find_last_not_of
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_last_not_of(basic_string_view s, size_type pos = npos) const BOOST_NOEXCEPT {
|
|
||||||
if (pos >= len_)
|
|
||||||
pos = len_ - 1;
|
|
||||||
if (s.len_ == 0u)
|
|
||||||
return pos;
|
|
||||||
pos = len_ - (pos+1);
|
|
||||||
const_reverse_iterator iter = find_not_of ( this->crbegin () + pos, this->crend (), s );
|
|
||||||
return iter == this->crend () ? npos : reverse_distance ( this->crbegin (), iter );
|
|
||||||
}
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_last_not_of(charT c, size_type pos = npos) const BOOST_NOEXCEPT
|
|
||||||
{ return find_last_not_of(basic_string_view(&c, 1), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_last_not_of(const charT* s, size_type pos, size_type n) const BOOST_NOEXCEPT
|
|
||||||
{ return find_last_not_of(basic_string_view(s, n), pos); }
|
|
||||||
BOOST_CXX14_CONSTEXPR size_type find_last_not_of(const charT* s, size_type pos = npos) const BOOST_NOEXCEPT
|
|
||||||
{ return find_last_not_of(basic_string_view(s), pos); }
|
|
||||||
|
|
||||||
private:
|
|
||||||
template <typename r_iter>
|
|
||||||
size_type reverse_distance(r_iter first, r_iter last) const BOOST_NOEXCEPT {
|
|
||||||
// Portability note here: std::distance is not NOEXCEPT, but calling it with a string_view::reverse_iterator will not throw.
|
|
||||||
return len_ - 1 - std::distance ( first, last );
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename Iterator>
|
|
||||||
Iterator find_not_of(Iterator first, Iterator last, basic_string_view s) const BOOST_NOEXCEPT {
|
|
||||||
for (; first != last ; ++first)
|
|
||||||
if ( 0 == traits::find(s.ptr_, s.len_, *first))
|
|
||||||
return first;
|
|
||||||
return last;
|
|
||||||
}
|
|
||||||
|
|
||||||
const charT *ptr_;
|
|
||||||
std::size_t len_;
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
// Comparison operators
|
|
||||||
// Equality
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator==(basic_string_view<charT, traits> x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
if (x.size () != y.size ()) return false;
|
|
||||||
return x.compare(y) == 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Inequality
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator!=(basic_string_view<charT, traits> x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
if ( x.size () != y.size ()) return true;
|
|
||||||
return x.compare(y) != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Less than
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<(basic_string_view<charT, traits> x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return x.compare(y) < 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Greater than
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>(basic_string_view<charT, traits> x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return x.compare(y) > 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Less than or equal to
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<=(basic_string_view<charT, traits> x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return x.compare(y) <= 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Greater than or equal to
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>=(basic_string_view<charT, traits> x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return x.compare(y) >= 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
// "sufficient additional overloads of comparison functions"
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator==(basic_string_view<charT, traits> x,
|
|
||||||
const std::basic_string<charT, traits, Allocator> & y) BOOST_NOEXCEPT {
|
|
||||||
return x == basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator==(const std::basic_string<charT, traits, Allocator> & x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) == y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator==(basic_string_view<charT, traits> x,
|
|
||||||
const charT * y) BOOST_NOEXCEPT {
|
|
||||||
return x == basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator==(const charT * x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) == y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator!=(basic_string_view<charT, traits> x,
|
|
||||||
const std::basic_string<charT, traits, Allocator> & y) BOOST_NOEXCEPT {
|
|
||||||
return x != basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator!=(const std::basic_string<charT, traits, Allocator> & x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) != y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator!=(basic_string_view<charT, traits> x,
|
|
||||||
const charT * y) BOOST_NOEXCEPT {
|
|
||||||
return x != basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator!=(const charT * x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) != y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<(basic_string_view<charT, traits> x,
|
|
||||||
const std::basic_string<charT, traits, Allocator> & y) BOOST_NOEXCEPT {
|
|
||||||
return x < basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<(const std::basic_string<charT, traits, Allocator> & x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) < y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<(basic_string_view<charT, traits> x,
|
|
||||||
const charT * y) BOOST_NOEXCEPT {
|
|
||||||
return x < basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<(const charT * x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) < y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>(basic_string_view<charT, traits> x,
|
|
||||||
const std::basic_string<charT, traits, Allocator> & y) BOOST_NOEXCEPT {
|
|
||||||
return x > basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>(const std::basic_string<charT, traits, Allocator> & x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) > y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>(basic_string_view<charT, traits> x,
|
|
||||||
const charT * y) BOOST_NOEXCEPT {
|
|
||||||
return x > basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>(const charT * x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) > y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<=(basic_string_view<charT, traits> x,
|
|
||||||
const std::basic_string<charT, traits, Allocator> & y) BOOST_NOEXCEPT {
|
|
||||||
return x <= basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<=(const std::basic_string<charT, traits, Allocator> & x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) <= y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<=(basic_string_view<charT, traits> x,
|
|
||||||
const charT * y) BOOST_NOEXCEPT {
|
|
||||||
return x <= basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator<=(const charT * x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) <= y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>=(basic_string_view<charT, traits> x,
|
|
||||||
const std::basic_string<charT, traits, Allocator> & y) BOOST_NOEXCEPT {
|
|
||||||
return x >= basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits, typename Allocator>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>=(const std::basic_string<charT, traits, Allocator> & x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) >= y;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>=(basic_string_view<charT, traits> x,
|
|
||||||
const charT * y) BOOST_NOEXCEPT {
|
|
||||||
return x >= basic_string_view<charT, traits>(y);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename charT, typename traits>
|
|
||||||
inline BOOST_CXX14_CONSTEXPR bool operator>=(const charT * x,
|
|
||||||
basic_string_view<charT, traits> y) BOOST_NOEXCEPT {
|
|
||||||
return basic_string_view<charT, traits>(x) >= y;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Inserter
|
|
||||||
template<class charT, class traits>
|
|
||||||
inline std::basic_ostream<charT, traits>&
|
|
||||||
operator<<(std::basic_ostream<charT, traits>& os,
|
|
||||||
const basic_string_view<charT,traits>& str) {
|
|
||||||
return boost::io::ostream_put(os, str.data(), str.size());
|
|
||||||
}
|
|
||||||
|
|
||||||
#if 0
|
|
||||||
// numeric conversions
|
|
||||||
//
|
|
||||||
// These are short-term implementations.
|
|
||||||
// In a production environment, I would rather avoid the copying.
|
|
||||||
//
|
|
||||||
inline int stoi (string_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoi ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long stol (string_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stol ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned long stoul (string_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoul ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long long stoll (string_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoll ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned long long stoull (string_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoull ( std::string(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline float stof (string_view str, size_t* idx=0) {
|
|
||||||
return std::stof ( std::string(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline double stod (string_view str, size_t* idx=0) {
|
|
||||||
return std::stod ( std::string(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long double stold (string_view str, size_t* idx=0) {
|
|
||||||
return std::stold ( std::string(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline int stoi (wstring_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoi ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long stol (wstring_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stol ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned long stoul (wstring_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoul ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long long stoll (wstring_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoll ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned long long stoull (wstring_view str, size_t* idx=0, int base=10) {
|
|
||||||
return std::stoull ( std::wstring(str), idx, base );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline float stof (wstring_view str, size_t* idx=0) {
|
|
||||||
return std::stof ( std::wstring(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline double stod (wstring_view str, size_t* idx=0) {
|
|
||||||
return std::stod ( std::wstring(str), idx );
|
|
||||||
}
|
|
||||||
|
|
||||||
inline long double stold (wstring_view str, size_t* idx=0) {
|
|
||||||
return std::stold ( std::wstring(str), idx );
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Forward declaration of Boost.ContainerHash function
|
|
||||||
template <class It> std::size_t hash_range(It, It);
|
|
||||||
|
|
||||||
template <class charT, class traits>
|
|
||||||
std::size_t hash_value(basic_string_view<charT, traits> s) {
|
|
||||||
return boost::hash_range(s.begin(), s.end());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#if 0
|
|
||||||
namespace std {
|
|
||||||
// Hashing
|
|
||||||
template<> struct hash<boost::string_view>;
|
|
||||||
template<> struct hash<boost::u16string_view>;
|
|
||||||
template<> struct hash<boost::u32string_view>;
|
|
||||||
template<> struct hash<boost::wstring_view>;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,39 +0,0 @@
|
|||||||
/*
|
|
||||||
Copyright (c) Marshall Clow 2012-2012.
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
For more information, see http://www.boost.org
|
|
||||||
|
|
||||||
Based on the StringRef implementation in LLVM (http://llvm.org) and
|
|
||||||
N3422 by Jeffrey Yasskin
|
|
||||||
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3442.html
|
|
||||||
Updated July 2015 to reflect the Library Fundamentals TS
|
|
||||||
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4480.html
|
|
||||||
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef BOOST_STRING_VIEW_FWD_HPP
|
|
||||||
#define BOOST_STRING_VIEW_FWD_HPP
|
|
||||||
|
|
||||||
#include <boost/config.hpp>
|
|
||||||
#include <string>
|
|
||||||
|
|
||||||
namespace boost {
|
|
||||||
|
|
||||||
template<typename charT, typename traits = std::char_traits<charT> > class basic_string_view;
|
|
||||||
typedef basic_string_view<char, std::char_traits<char> > string_view;
|
|
||||||
typedef basic_string_view<wchar_t, std::char_traits<wchar_t> > wstring_view;
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_CXX11_CHAR16_T
|
|
||||||
typedef basic_string_view<char16_t, std::char_traits<char16_t> > u16string_view;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_CXX11_CHAR32_T
|
|
||||||
typedef basic_string_view<char32_t, std::char_traits<char32_t> > u32string_view;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user