[ { "path": ".circleci/autocancel.sh", "content": "#!/bin/bash\n\n# Auto-cancel preceding workflows\n# https://discuss.circleci.com/t/workaround-auto-cancel-redundant-builds-on-the-default-branch/39468\n\nset -x\n\n## Get the name of the workflow and the related pipeline number\ncurl --header \"Circle-Token: $PERS_API_TOKEN_BOOST_5\" --request GET \"https://circleci.com/api/v2/workflow/${CIRCLE_WORKFLOW_ID}\" -o current_workflow.json\nWF_NAME=$(jq -r '.name' current_workflow.json)\nCURRENT_PIPELINE_NUM=$(jq -r '.pipeline_number' current_workflow.json)\nCURRENT_PIPELINE_CREATED=$(jq -r '.created_at' current_workflow.json)\nTIME_THRESHOLD=$(date --utc +'%Y-%m-%dT%TZ' -d \"${CURRENT_PIPELINE_CREATED} -10 minutes\")\n\n## Get the IDs of pipelines created by the current user on the same branch. (Only consider pipelines that have a pipeline number inferior to the current pipeline)\nPIPE_IDS=$(curl --header \"Circle-Token: $PERS_API_TOKEN_BOOST_5\" --request GET \"https://circleci.com/api/v2/project/gh/$CIRCLE_PROJECT_USERNAME/$CIRCLE_PROJECT_REPONAME/pipeline?branch=$CIRCLE_BRANCH\"|jq -r --argjson CURRENT_PIPELINE_NUM \"$CURRENT_PIPELINE_NUM\" --arg TIME_THRESHOLD \"${TIME_THRESHOLD}\" '.items[] | select(.state == \"created\") | select(.number < $CURRENT_PIPELINE_NUM) | select(.created_at > $TIME_THRESHOLD) | .id')\n\n## Get the IDs of currently running/on_hold workflows that have the same name as the current workflow, in all previously created pipelines.\nif [ ! -z \"$PIPE_IDS\" ]; then\n for PIPE_ID in $PIPE_IDS\n do\n curl --header \"Circle-Token: $PERS_API_TOKEN_BOOST_5\" --request GET \"https://circleci.com/api/v2/pipeline/${PIPE_ID}/workflow\"|jq -r --arg WF_NAME \"${WF_NAME}\" '.items[]|select(.status == \"on_hold\" or .status == \"running\") | select(.name == $WF_NAME) | .id' >> WF_to_cancel.txt\n done\nfi\n\n## Cancel any currently running/on_hold workflow with the same name\nif [ -s WF_to_cancel.txt ]; then\n echo \"Cancelling the following workflow(s):\"\n cat WF_to_cancel.txt\n while read WF_ID;\n do\n curl --header \"Circle-Token: $PERS_API_TOKEN_BOOST_5\" --request POST https://circleci.com/api/v2/workflow/$WF_ID/cancel\n done < WF_to_cancel.txt\n ## Allowing some time to complete the cancellation\n sleep 2\n else\n echo \"Nothing to cancel\"\nfi\n" }, { "path": ".circleci/config.yml", "content": "version: 2.1\njobs:\n build:\n resource_class: large\n docker:\n - image: cppalliance/boost_superproject_build:24.04-v4\n parallelism: 2\n steps:\n - checkout\n - run: ./.circleci/autocancel.sh || true\n - run: wget \"https://raw.githubusercontent.com/boostorg/release-tools/master/ci_boost_common.py\" -P ${HOME}\n - run: wget \"https://raw.githubusercontent.com/boostorg/release-tools/master/ci_boost_release.py\" -P ${HOME}\n - run: python3 ${HOME}/ci_boost_release.py checkout_post\n # - run: python3 ${HOME}/ci_boost_release.py dependencies_override\n - run: '[ \"$CIRCLE_NODE_INDEX\" != \"0\" ] || EOL=LF python3 ${HOME}/ci_boost_release.py test_pre'\n - run: '[ \"$CIRCLE_NODE_INDEX\" != \"1\" ] || EOL=CRLF python3 ${HOME}/ci_boost_release.py test_pre'\n - run: '[ \"$CIRCLE_NODE_INDEX\" != \"0\" ] || EOL=LF python3 ${HOME}/ci_boost_release.py test_override'\n - run: '[ \"$CIRCLE_NODE_INDEX\" != \"1\" ] || EOL=CRLF python3 ${HOME}/ci_boost_release.py test_override'\n" }, { "path": ".gitattributes", "content": "* text=auto !eol svneol=native#text/plain\n*.gitattributes text svneol=native#text/plain\n\n# Scriptish formats\n*.bat text svneol=native#text/plain\n*.bsh text svneol=native#text/x-beanshell\n*.cgi text svneol=native#text/plain\n*.cmd text svneol=native#text/plain\n*.js text svneol=native#text/javascript\n*.php text svneol=native#text/x-php\n*.pl text svneol=native#text/x-perl\n*.pm text svneol=native#text/x-perl\n*.py text svneol=native#text/x-python\n*.sh eol=lf svneol=LF#text/x-sh\nconfigure eol=lf svneol=LF#text/x-sh\n\n# Image formats\n*.bmp binary svneol=unset#image/bmp\n*.gif binary svneol=unset#image/gif\n*.ico binary svneol=unset#image/ico\n*.jpeg binary svneol=unset#image/jpeg\n*.jpg binary svneol=unset#image/jpeg\n*.png binary svneol=unset#image/png\n*.tif binary svneol=unset#image/tiff\n*.tiff binary svneol=unset#image/tiff\n*.svg text svneol=native#image/svg%2Bxml\n\n# Data formats\n*.pdf binary svneol=unset#application/pdf\n*.avi binary svneol=unset#video/avi\n*.doc binary svneol=unset#application/msword\n*.dsp text svneol=crlf#text/plain\n*.dsw text svneol=crlf#text/plain\n*.eps binary svneol=unset#application/postscript\n*.gz binary svneol=unset#application/gzip\n*.mov binary svneol=unset#video/quicktime\n*.mp3 binary svneol=unset#audio/mpeg\n*.ppt binary svneol=unset#application/vnd.ms-powerpoint\n*.ps binary svneol=unset#application/postscript\n*.psd binary svneol=unset#application/photoshop\n*.rdf binary svneol=unset#text/rdf\n*.rss text svneol=unset#text/xml\n*.rtf binary svneol=unset#text/rtf\n*.sln text svneol=native#text/plain\n*.swf binary svneol=unset#application/x-shockwave-flash\n*.tgz binary svneol=unset#application/gzip\n*.vcproj text svneol=native#text/xml\n*.vcxproj text svneol=native#text/xml\n*.vsprops text svneol=native#text/xml\n*.wav binary svneol=unset#audio/wav\n*.xls binary svneol=unset#application/vnd.ms-excel\n*.zip binary svneol=unset#application/zip\n\n# Text formats\n.htaccess text svneol=native#text/plain\n*.bbk text svneol=native#text/xml\n*.cmake text svneol=native#text/plain\n*.css text svneol=native#text/css\n*.dtd text svneol=native#text/xml\n*.htm text svneol=native#text/html\n*.html text svneol=native#text/html\n*.ini text svneol=native#text/plain\n*.log text svneol=native#text/plain\n*.mak text svneol=native#text/plain\n*.qbk text svneol=native#text/plain\n*.rst text svneol=native#text/plain\n*.sql text svneol=native#text/x-sql\n*.txt text svneol=native#text/plain\n*.xhtml text svneol=native#text/xhtml%2Bxml\n*.xml text svneol=native#text/xml\n*.xsd text svneol=native#text/xml\n*.xsl text svneol=native#text/xml\n*.xslt text svneol=native#text/xml\n*.xul text svneol=native#text/xul\n*.yml text svneol=native#text/plain\nboost-no-inspect text svneol=native#text/plain\nCHANGES text svneol=native#text/plain\nCOPYING text svneol=native#text/plain\nINSTALL text svneol=native#text/plain\nJamfile text svneol=native#text/plain\nJamroot text svneol=native#text/plain\nJamfile.v2 text svneol=native#text/plain\nJamrules text svneol=native#text/plain\nMakefile* text svneol=native#text/plain\nREADME text svneol=native#text/plain\nTODO text svneol=native#text/plain\n\n# Code formats\n*.c text svneol=native#text/plain\n*.cpp text svneol=native#text/plain\n*.h text svneol=native#text/plain\n*.hpp text svneol=native#text/plain\n*.ipp text svneol=native#text/plain\n*.tpp text svneol=native#text/plain\n*.jam text svneol=native#text/plain\n*.java text svneol=native#text/plain\n" }, { "path": ".github/workflows/ci.yml", "content": "name: CI\n\non:\n pull_request:\n push:\n branches:\n - master\n - develop\n - feature/**\n tags:\n - '**'\n\njobs:\n b2-posix:\n strategy:\n fail-fast: false\n matrix:\n include:\n - os: ubuntu-22.04\n - os: ubuntu-22.04-arm\n - os: ubuntu-24.04\n - os: ubuntu-24.04-arm\n - os: macos-14\n - os: macos-15\n - os: macos-26\n\n runs-on: ${{matrix.os}}\n\n steps:\n - uses: actions/checkout@v4\n with:\n submodules: true\n\n - name: Setup Boost\n run: |\n ./bootstrap.sh\n ./b2 -d0 headers\n\n - name: Build Boost\n run: |\n ./b2 -j3 stage\n\n - name: Install Boost\n run: |\n ./b2 -j3 --prefix=$HOME/.local install\n\n - name: Test Boost\n run: |\n cd status\n ../b2 -j3 quick\n\n b2-windows:\n strategy:\n fail-fast: false\n matrix:\n include:\n - os: windows-2022\n - os: windows-2025\n\n runs-on: ${{matrix.os}}\n\n steps:\n - uses: actions/checkout@v4\n with:\n submodules: true\n\n - name: Setup Boost\n shell: cmd\n run: |\n cmd /c bootstrap\n b2 -d0 headers\n\n - name: Build Boost\n run: |\n ./b2 -j3 stage\n\n - name: Install Boost\n run: |\n ./b2 -j3 install\n\n - name: Test Boost\n run: |\n cd status\n ../b2 -j3 quick\n\n cmake-install-posix:\n strategy:\n fail-fast: false\n matrix:\n include:\n - os: ubuntu-22.04\n - os: ubuntu-22.04-arm\n - os: ubuntu-24.04\n - os: ubuntu-24.04-arm\n - os: macos-14\n - os: macos-15\n - os: macos-26\n\n runs-on: ${{matrix.os}}\n timeout-minutes: 20\n\n steps:\n - uses: actions/checkout@v4\n with:\n submodules: true\n\n - name: Configure Boost\n run: |\n mkdir __build__ && cd __build__\n cmake -DBUILD_SHARED_LIBS=ON -DCMAKE_INSTALL_PREFIX=~/.local ..\n\n - name: Build Boost\n run: |\n cd __build__\n cmake --build . -j 3\n\n - name: Install Boost\n run: |\n cd __build__\n cmake --build . -j 3 --target install\n\n cmake-install-windows:\n strategy:\n fail-fast: false\n matrix:\n include:\n - os: windows-2022\n - os: windows-2025\n\n runs-on: ${{matrix.os}}\n\n steps:\n - uses: actions/checkout@v4\n with:\n submodules: true\n\n - name: Configure Boost\n run: |\n mkdir __build__ && cd __build__\n cmake -DBUILD_SHARED_LIBS=ON ..\n\n - name: Build Boost\n run: |\n cd __build__\n cmake --build . -j 3\n\n - name: Install Boost\n run: |\n cd __build__\n cmake --build . -j 3 --target install\n\n cmake-test-posix:\n strategy:\n fail-fast: false\n matrix:\n include:\n - os: ubuntu-latest\n\n runs-on: ${{matrix.os}}\n\n steps:\n - uses: actions/checkout@v4\n with:\n submodules: true\n\n - name: Configure Boost\n run: |\n mkdir __build__ && cd __build__\n cmake -DBUILD_TESTING=ON -DBOOST_EXCLUDE_LIBRARIES=\"process;geometry\" ..\n\n - name: Build tests\n run: |\n cd __build__\n cmake --build . -j 3 --target tests\n\n - name: Run tests\n run: |\n cd __build__\n ctest --output-on-failure --no-tests=error -j 3\n\n cmake-test-posix-quick:\n strategy:\n fail-fast: false\n matrix:\n include:\n - os: ubuntu-22.04\n - os: ubuntu-22.04-arm\n - os: ubuntu-24.04\n - os: ubuntu-24.04-arm\n - os: macos-14\n - os: macos-15\n - os: macos-26\n\n runs-on: ${{matrix.os}}\n timeout-minutes: 90\n\n steps:\n - uses: actions/checkout@v4\n with:\n submodules: true\n\n - name: Configure Boost\n run: |\n mkdir __build__ && cd __build__\n cmake -DBUILD_TESTING=ON ..\n\n - name: Build tests\n run: |\n cd __build__\n cmake --build . -j 3 --target tests-quick\n\n - name: Run tests\n run: |\n cd __build__\n ctest --output-on-failure --no-tests=error -j 3 -R quick\n\n cmake-test-windows-quick:\n strategy:\n fail-fast: false\n matrix:\n include:\n - os: windows-2022\n - os: windows-2025\n\n runs-on: ${{matrix.os}}\n\n steps:\n - uses: actions/checkout@v4\n with:\n submodules: true\n\n - name: Configure Boost\n run: |\n mkdir __build__ && cd __build__\n cmake -DBUILD_TESTING=ON ..\n\n - name: Build tests\n run: |\n cd __build__\n cmake --build . -j 3 --target tests-quick\n\n - name: Run tests\n run: |\n cd __build__\n ctest --output-on-failure --no-tests=error -j 3 -R quick -C Debug\n" }, { "path": ".github/workflows/commit-bot.yml", "content": "name: Commit Bot\n\n# Instructions\n#\n# - One-time setup: create a personal access token with permissions. Then configure it here\n# as secrets.CI_PAT. https://github.com/boostorg/boost/settings/secrets/actions\n# The reason is explained in https://github.com/orgs/community/discussions/25702\n# \"If an action pushes code using the repository's GITHUB_TOKEN, a new workflow will not run\"\n#\n# - Processing of either the 'master' or 'develop' branch may be stopped by creating the variables\n# vars.block_master or vars.block_develop with the value \"yes\" (case-insensitive).\n# https://github.com/boostorg/boost/settings/variables/actions\n#\n\n# To avoid infinite loops, don't trigger on \"push\"\non:\n schedule:\n - cron: \"0,30 * * * *\"\n\nconcurrency:\n group: ${{format('commit-bot-{0}:{1}', github.repository, github.ref)}}\n cancel-in-progress: true\n\njobs:\n update-modules:\n runs-on: ubuntu-latest\n name: Commit Bot\n if: github.repository == 'boostorg/boost'\n\n steps:\n - name: Check for module updates\n id: branches\n run: |\n set -xe\n branches=\"\"\n block_master=\"${{ vars.block_master }}\"\n block_develop=\"${{ vars.block_develop }}\"\n if [[ \"${{ github.event_name }}\" == \"push\" ]]; then\n # The job doesn't run on \"push\" so this will not execute.\n if [[ ! ${block_master,,} =~ yes && \"${{ github.ref_name }}\" == \"master\" ]]; then\n branches=\"master\"\n elif [[ ! ${block_develop,,} =~ yes && \"${{ github.ref_name }}\" == \"develop\" ]]; then\n branches=\"develop\"\n fi\n else\n # from a schedule:\n if [[ ! ${block_master,,} =~ yes ]]; then\n branches=\"master\"\n fi\n if [[ ! ${block_develop,,} =~ yes ]]; then\n branches=\"${branches} develop\"\n fi\n fi\n echo \"branches=$branches\" >> $GITHUB_OUTPUT\n echo \"branches is ${branches}\"\n\n - name: Checkout master repository\n uses: actions/checkout@v4\n if: contains(steps.branches.outputs.branches, 'master')\n with:\n ref: master\n path: master\n persist-credentials: false\n\n - name: Checkout develop repository\n uses: actions/checkout@v4\n if: contains(steps.branches.outputs.branches, 'develop')\n with:\n ref: develop\n path: develop\n persist-credentials: false\n\n - name: Check for module updates\n run: |\n branches=\"${{ steps.branches.outputs.branches }}\"\n\n # Set up Git\n git config --global user.name \"boost-commitbot\"\n git config --global user.email \"boost-commitbot@example.com\"\n\n # Update each branch\n for branch in $branches; do\n cd $branch\n module_paths=$(git config --file .gitmodules --get-regexp '^submodule\\..*\\.path$')\n while IFS=' ' read -r key path; do\n submodule_name=$(echo \"$key\" | awk -F '.' '{print $2}')\n submodule_path=$(echo \"$path\")\n url=$(git config --file .gitmodules --get-regexp \"^submodule\\.$submodule_name\\.url$\" | awk '{print $2}')\n if [[ ! \"$url\" =~ ^https:// ]]; then\n basicreponame=$(basename $url)\n url=${GITHUB_SERVER_URL}/${GITHUB_REPOSITORY_OWNER}/${basicreponame}\n fi\n hash=$(git ls-remote \"$url\" \"refs/heads/$branch\" | cut -f 1)\n hash=\"${hash#\"${hash%%[![:space:]]*}\"}\"\n hash=\"${hash%\"${hash##*[![:space:]]}\"}\"\n commit_id=\"${hash:0:8}\"\n previous_hash=$(git ls-tree HEAD \"$submodule_path\" | awk '{print $3}')\n previous_hash=\"${previous_hash#\"${previous_hash%%[![:space:]]*}\"}\"\n previous_hash=\"${previous_hash%\"${previous_hash##*[![:space:]]}\"}\"\n previous_commit_id=\"${previous_hash:0:8}\"\n if [ \"$hash\" == \"$previous_hash\" ]; then\n echo \"$submodule_name ($commit_id): OK\"\n else\n echo \"$submodule_name: $previous_commit_id -> $commit_id\"\n set -x\n set +e\n git submodule update --init \"$submodule_path\"\n git submodule update --remote \"$submodule_path\"\n git add \"$submodule_path\"\n git commit -m \"Update $submodule_name from $branch\"\n set -e\n set +x\n fi\n done <<< \"$module_paths\"\n cd ..\n done\n\n - name: Push changes from master\n uses: ad-m/github-push-action@v0.8.0\n if: contains(steps.branches.outputs.branches, 'master')\n with:\n # github_token: ${{ secrets.GITHUB_TOKEN }}\n github_token: ${{ secrets.CI_PAT }}\n branch: master\n directory: master\n\n - name: Push changes from develop\n uses: ad-m/github-push-action@v0.8.0\n if: contains(steps.branches.outputs.branches, 'develop')\n with:\n # github_token: ${{ secrets.GITHUB_TOKEN }}\n github_token: ${{ secrets.CI_PAT }}\n branch: develop\n directory: develop\n" }, { "path": ".github/workflows/release-cmake.yml", "content": "name: Release\n\non:\n push:\n tags:\n - boost-*\n\njobs:\n release-posix-cmake:\n runs-on: ubuntu-latest\n\n steps:\n - uses: actions/checkout@v4\n with:\n path: ${{ github.ref_name }}\n submodules: true\n\n - name: Cleanup\n shell: bash\n run: |\n find ${{ github.ref_name }} -name \".git\" -prune -exec rm -rf {} +\n\n - name: Create archives\n run: |\n tar -czf ${{ github.ref_name }}-cmake.tar.gz ${{ github.ref_name }}\n sha256sum ${{ github.ref_name }}-cmake.tar.gz > ${{ github.ref_name }}-cmake.tar.gz.txt\n tar -cJf ${{ github.ref_name }}-cmake.tar.xz ${{ github.ref_name }}\n sha256sum ${{ github.ref_name }}-cmake.tar.xz > ${{ github.ref_name }}-cmake.tar.xz.txt\n\n - uses: softprops/action-gh-release@v2\n with:\n files: |\n ${{ github.ref_name }}-cmake.tar.gz\n ${{ github.ref_name }}-cmake.tar.gz.txt\n ${{ github.ref_name }}-cmake.tar.xz\n ${{ github.ref_name }}-cmake.tar.xz.txt\n\n release-windows-cmake:\n runs-on: windows-latest\n\n needs: release-posix-cmake\n\n steps:\n - uses: actions/checkout@v4\n with:\n path: ${{ github.ref_name }}\n submodules: true\n\n - name: Cleanup\n shell: bash\n run: |\n find ${{ github.ref_name }} -name \".git\" -prune -exec rm -rf {} +\n\n - name: Create archives\n shell: cmd\n run: |\n 7z a ${{ github.ref_name }}-cmake.zip ${{ github.ref_name }}\n sha256sum ${{ github.ref_name }}-cmake.zip > ${{ github.ref_name }}-cmake.zip.txt\n 7z a ${{ github.ref_name }}-cmake.7z ${{ github.ref_name }}\n sha256sum ${{ github.ref_name }}-cmake.7z > ${{ github.ref_name }}-cmake.7z.txt\n\n - uses: softprops/action-gh-release@v2\n with:\n files: |\n ${{ github.ref_name }}-cmake.zip\n ${{ github.ref_name }}-cmake.zip.txt\n ${{ github.ref_name }}-cmake.7z\n ${{ github.ref_name }}-cmake.7z.txt\n\n release-posix-b2-nodocs:\n runs-on: ubuntu-latest\n\n needs: release-windows-cmake\n\n steps:\n - uses: actions/checkout@v4\n with:\n path: ${{ github.ref_name }}\n submodules: true\n\n - name: Cleanup\n shell: bash\n run: |\n find ${{ github.ref_name }} -name \".git\" -prune -exec rm -rf {} +\n\n - name: Move headers, remove docs\n shell: bash\n run: |\n cd ${{ github.ref_name }}\n cp -r libs/*/include/boost libs/numeric/*/include/boost .\n rm -rf libs/*/include libs/numeric/*/include\n rm -rf libs/*/doc libs/numeric/*/doc\n rm -f CMakeLists.txt\n\n - name: Create archives\n run: |\n tar -czf ${{ github.ref_name }}-b2-nodocs.tar.gz ${{ github.ref_name }}\n sha256sum ${{ github.ref_name }}-b2-nodocs.tar.gz > ${{ github.ref_name }}-b2-nodocs.tar.gz.txt\n tar -cJf ${{ github.ref_name }}-b2-nodocs.tar.xz ${{ github.ref_name }}\n sha256sum ${{ github.ref_name }}-b2-nodocs.tar.xz > ${{ github.ref_name }}-b2-nodocs.tar.xz.txt\n\n - uses: softprops/action-gh-release@v2\n with:\n files: |\n ${{ github.ref_name }}-b2-nodocs.tar.gz\n ${{ github.ref_name }}-b2-nodocs.tar.gz.txt\n ${{ github.ref_name }}-b2-nodocs.tar.xz\n ${{ github.ref_name }}-b2-nodocs.tar.xz.txt\n\n release-windows-b2-nodocs:\n runs-on: windows-latest\n\n needs: release-posix-b2-nodocs\n\n steps:\n - uses: actions/checkout@v4\n with:\n path: ${{ github.ref_name }}\n submodules: true\n\n - name: Cleanup\n shell: bash\n run: |\n find ${{ github.ref_name }} -name \".git\" -prune -exec rm -rf {} +\n\n - name: Move headers, remove docs\n shell: bash\n run: |\n cd ${{ github.ref_name }}\n cp -r libs/*/include/boost libs/numeric/*/include/boost .\n rm -rf libs/*/include libs/numeric/*/include\n rm -rf libs/*/doc libs/numeric/*/doc\n rm -f CMakeLists.txt\n\n - name: Create archives\n shell: cmd\n run: |\n 7z a ${{ github.ref_name }}-b2-nodocs.zip ${{ github.ref_name }}\n sha256sum ${{ github.ref_name }}-b2-nodocs.zip > ${{ github.ref_name }}-b2-nodocs.zip.txt\n 7z a ${{ github.ref_name }}-b2-nodocs.7z ${{ github.ref_name }}\n sha256sum ${{ github.ref_name }}-b2-nodocs.7z > ${{ github.ref_name }}-b2-nodocs.7z.txt\n\n - uses: softprops/action-gh-release@v2\n with:\n files: |\n ${{ github.ref_name }}-b2-nodocs.zip\n ${{ github.ref_name }}-b2-nodocs.zip.txt\n ${{ github.ref_name }}-b2-nodocs.7z\n ${{ github.ref_name }}-b2-nodocs.7z.txt\n" }, { "path": ".gitignore", "content": "/b2\n/b2.exe\n/bin.v2\n/bjam\n/bjam.exe\n/bootstrap.log\n/boost\n/dist\n/project-config.jam*\n/stage\n/stage_x64/\n/user-config.jam\n/.settings/\n/.project\n/.pydevproject\n" }, { "path": ".gitmodules", "content": "[submodule \"system\"]\n\tpath = libs/system\n\turl = ../system.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"multi_array\"]\n\tpath = libs/multi_array\n\turl = ../multi_array.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"math\"]\n\tpath = libs/math\n\turl = ../math.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"smart_ptr\"]\n\tpath = libs/smart_ptr\n\turl = ../smart_ptr.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"parameter\"]\n\tpath = libs/parameter\n\turl = ../parameter.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"algorithm\"]\n\tpath = libs/algorithm\n\turl = ../algorithm.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"any\"]\n\tpath = libs/any\n\turl = ../any.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"concept_check\"]\n\tpath = libs/concept_check\n\turl = ../concept_check.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"python\"]\n\tpath = libs/python\n\turl = ../python.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"tti\"]\n\tpath = libs/tti\n\turl = ../tti.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"functional\"]\n\tpath = libs/functional\n\turl = ../functional.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"config\"]\n\tpath = libs/config\n\turl = ../config.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"log\"]\n\tpath = libs/log\n\turl = ../log.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"interprocess\"]\n\tpath = libs/interprocess\n\turl = ../interprocess.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"exception\"]\n\tpath = libs/exception\n\turl = ../exception.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"foreach\"]\n\tpath = libs/foreach\n\turl = ../foreach.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"spirit\"]\n\tpath = libs/spirit\n\turl = ../spirit.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"io\"]\n\tpath = libs/io\n\turl = ../io.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"units\"]\n\tpath = libs/units\n\turl = ../units.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"preprocessor\"]\n\tpath = libs/preprocessor\n\turl = ../preprocessor.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"format\"]\n\tpath = libs/format\n\turl = ../format.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"xpressive\"]\n\tpath = libs/xpressive\n\turl = ../xpressive.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"integer\"]\n\tpath = libs/integer\n\turl = ../integer.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"thread\"]\n\tpath = libs/thread\n\turl = ../thread.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"tokenizer\"]\n\tpath = libs/tokenizer\n\turl = ../tokenizer.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"timer\"]\n\tpath = libs/timer\n\turl = ../timer.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"inspect\"]\n\tpath = tools/inspect\n\turl = ../inspect.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"boostbook\"]\n\tpath = tools/boostbook\n\turl = ../boostbook.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"regex\"]\n\tpath = libs/regex\n\turl = ../regex.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"crc\"]\n\tpath = libs/crc\n\turl = ../crc.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"random\"]\n\tpath = libs/random\n\turl = ../random.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"serialization\"]\n\tpath = libs/serialization\n\turl = ../serialization.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"test\"]\n\tpath = libs/test\n\turl = ../test.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"date_time\"]\n\tpath = libs/date_time\n\turl = ../date_time.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"logic\"]\n\tpath = libs/logic\n\turl = ../logic.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"graph\"]\n\tpath = libs/graph\n\turl = ../graph.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"numeric_conversion\"]\n\tpath = libs/numeric/conversion\n\turl = ../numeric_conversion.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"lambda\"]\n\tpath = libs/lambda\n\turl = ../lambda.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"mpl\"]\n\tpath = libs/mpl\n\turl = ../mpl.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"typeof\"]\n\tpath = libs/typeof\n\turl = ../typeof.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"tuple\"]\n\tpath = libs/tuple\n\turl = ../tuple.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"utility\"]\n\tpath = libs/utility\n\turl = ../utility.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"dynamic_bitset\"]\n\tpath = libs/dynamic_bitset\n\turl = ../dynamic_bitset.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"assign\"]\n\tpath = libs/assign\n\turl = ../assign.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"filesystem\"]\n\tpath = libs/filesystem\n\turl = ../filesystem.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"function\"]\n\tpath = libs/function\n\turl = ../function.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"conversion\"]\n\tpath = libs/conversion\n\turl = ../conversion.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"optional\"]\n\tpath = libs/optional\n\turl = ../optional.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"property_tree\"]\n\tpath = libs/property_tree\n\turl = ../property_tree.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"bimap\"]\n\tpath = libs/bimap\n\turl = ../bimap.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"variant\"]\n\tpath = libs/variant\n\turl = ../variant.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"array\"]\n\tpath = libs/array\n\turl = ../array.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"iostreams\"]\n\tpath = libs/iostreams\n\turl = ../iostreams.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"multi_index\"]\n\tpath = libs/multi_index\n\turl = ../multi_index.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"bcp\"]\n\tpath = tools/bcp\n\turl = ../bcp.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"ptr_container\"]\n\tpath = libs/ptr_container\n\turl = ../ptr_container.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"statechart\"]\n\tpath = libs/statechart\n\turl = ../statechart.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"static_assert\"]\n\tpath = libs/static_assert\n\turl = ../static_assert.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"range\"]\n\tpath = libs/range\n\turl = ../range.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"rational\"]\n\tpath = libs/rational\n\turl = ../rational.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"iterator\"]\n\tpath = libs/iterator\n\turl = ../iterator.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"build\"]\n\tpath = tools/build\n\turl = ../build.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"quickbook\"]\n\tpath = tools/quickbook\n\turl = ../quickbook.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"graph_parallel\"]\n\tpath = libs/graph_parallel\n\turl = ../graph_parallel.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"property_map\"]\n\tpath = libs/property_map\n\turl = ../property_map.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"program_options\"]\n\tpath = libs/program_options\n\turl = ../program_options.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"detail\"]\n\tpath = libs/detail\n\turl = ../detail.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"interval\"]\n\tpath = libs/numeric/interval\n\turl = ../interval.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"ublas\"]\n\tpath = libs/numeric/ublas\n\turl = ../ublas.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"wave\"]\n\tpath = libs/wave\n\turl = ../wave.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"type_traits\"]\n\tpath = libs/type_traits\n\turl = ../type_traits.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"bind\"]\n\tpath = libs/bind\n\turl = ../bind.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"pool\"]\n\tpath = libs/pool\n\turl = ../pool.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"proto\"]\n\tpath = libs/proto\n\turl = ../proto.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"fusion\"]\n\tpath = libs/fusion\n\turl = ../fusion.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"function_types\"]\n\tpath = libs/function_types\n\turl = ../function_types.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"gil\"]\n\tpath = libs/gil\n\turl = ../gil.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"intrusive\"]\n\tpath = libs/intrusive\n\turl = ../intrusive.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"asio\"]\n\tpath = libs/asio\n\turl = ../asio.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"uuid\"]\n\tpath = libs/uuid\n\turl = ../uuid.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"litre\"]\n\tpath = tools/litre\n\turl = ../litre.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"circular_buffer\"]\n\tpath = libs/circular_buffer\n\turl = ../circular_buffer.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"mpi\"]\n\tpath = libs/mpi\n\turl = ../mpi.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"unordered\"]\n\tpath = libs/unordered\n\turl = ../unordered.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"signals2\"]\n\tpath = libs/signals2\n\turl = ../signals2.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"accumulators\"]\n\tpath = libs/accumulators\n\turl = ../accumulators.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"atomic\"]\n\tpath = libs/atomic\n\turl = ../atomic.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"scope_exit\"]\n\tpath = libs/scope_exit\n\turl = ../scope_exit.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"flyweight\"]\n\tpath = libs/flyweight\n\turl = ../flyweight.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"icl\"]\n\tpath = libs/icl\n\turl = ../icl.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"predef\"]\n\tpath = libs/predef\n\turl = ../predef.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"chrono\"]\n\tpath = libs/chrono\n\turl = ../chrono.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"polygon\"]\n\tpath = libs/polygon\n\turl = ../polygon.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"msm\"]\n\tpath = libs/msm\n\turl = ../msm.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"heap\"]\n\tpath = libs/heap\n\turl = ../heap.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"coroutine\"]\n\tpath = libs/coroutine\n\turl = ../coroutine.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"coroutine2\"]\n\tpath = libs/coroutine2\n\turl = ../coroutine2.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"ratio\"]\n\tpath = libs/ratio\n\turl = ../ratio.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"odeint\"]\n\tpath = libs/numeric/odeint\n\turl = ../odeint.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"geometry\"]\n\tpath = libs/geometry\n\turl = ../geometry.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"phoenix\"]\n\tpath = libs/phoenix\n\turl = ../phoenix.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"move\"]\n\tpath = libs/move\n\turl = ../move.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"locale\"]\n\tpath = libs/locale\n\turl = ../locale.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"auto_index\"]\n\tpath = tools/auto_index\n\turl = ../auto_index.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"container\"]\n\tpath = libs/container\n\turl = ../container.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"local_function\"]\n\tpath = libs/local_function\n\turl = ../local_function.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"context\"]\n\tpath = libs/context\n\turl = ../context.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"type_erasure\"]\n\tpath = libs/type_erasure\n\turl = ../type_erasure.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"multiprecision\"]\n\tpath = libs/multiprecision\n\turl = ../multiprecision.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"lockfree\"]\n\tpath = libs/lockfree\n\turl = ../lockfree.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"assert\"]\n\tpath = libs/assert\n\turl = ../assert.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"align\"]\n\tpath = libs/align\n\turl = ../align.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"type_index\"]\n\tpath = libs/type_index\n\turl = ../type_index.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"core\"]\n\tpath = libs/core\n\turl = ../core.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"throw_exception\"]\n\tpath = libs/throw_exception\n\turl = ../throw_exception.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"winapi\"]\n\tpath = libs/winapi\n\turl = ../winapi.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"boostdep\"]\n\tpath = tools/boostdep\n\turl = ../boostdep.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"lexical_cast\"]\n\tpath = libs/lexical_cast\n\turl = ../lexical_cast.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"sort\"]\n\tpath = libs/sort\n\turl = ../sort.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"convert\"]\n\tpath = libs/convert\n\turl = ../convert.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"endian\"]\n\tpath = libs/endian\n\turl = ../endian.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"vmd\"]\n\tpath = libs/vmd\n\turl = ../vmd.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"dll\"]\n\tpath = libs/dll\n\turl = ../dll.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"compute\"]\n\tpath = libs/compute\n\turl = ../compute.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"hana\"]\n\tpath = libs/hana\n\turl = ../hana.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"metaparse\"]\n\tpath = libs/metaparse\n\turl = ../metaparse.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"qvm\"]\n\tpath = libs/qvm\n\turl = ../qvm.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"fiber\"]\n\tpath = libs/fiber\n\turl = ../fiber.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"process\"]\n\tpath = libs/process\n\turl = ../process.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"stacktrace\"]\n\tpath = libs/stacktrace\n\turl = ../stacktrace.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"poly_collection\"]\n\tpath = libs/poly_collection\n\turl = ../poly_collection.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"beast\"]\n\tpath = libs/beast\n\turl = ../beast.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"mp11\"]\n\tpath = libs/mp11\n\turl = ../mp11.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"callable_traits\"]\n\tpath = libs/callable_traits\n\turl = ../callable_traits.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"contract\"]\n\tpath = libs/contract\n\turl = ../contract.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"check_build\"]\n\tpath = tools/check_build\n\turl = ../check_build.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"container_hash\"]\n\tpath = libs/container_hash\n\turl = ../container_hash.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"hof\"]\n\tpath = libs/hof\n\turl = ../hof.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"yap\"]\n\tpath = libs/yap\n\turl = ../yap.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"safe_numerics\"]\n\tpath = libs/safe_numerics\n\turl = ../safe_numerics.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"parameter_python\"]\n\tpath = libs/parameter_python\n\turl = ../parameter_python.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"headers\"]\n\tpath = libs/headers\n\turl = ../headers.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"boost_install\"]\n\tpath = tools/boost_install\n\turl = ../boost_install.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"outcome\"]\n\tpath = libs/outcome\n\turl = ../outcome.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"histogram\"]\n\tpath = libs/histogram\n\turl = ../histogram.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"variant2\"]\n\tpath = libs/variant2\n\turl = ../variant2.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"nowide\"]\n\tpath = libs/nowide\n\turl = ../nowide.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"docca\"]\n\tpath = tools/docca\n\turl = ../docca.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"cmake\"]\n\tpath = tools/cmake\n\turl = ../cmake.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"static_string\"]\n\tpath = libs/static_string\n\turl = ../static_string.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"stl_interfaces\"]\n\tpath = libs/stl_interfaces\n\turl = ../stl_interfaces.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"more\"]\n\tpath = more\n\turl = ../more.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"leaf\"]\n\tpath = libs/leaf\n\turl = ../leaf.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"json\"]\n\tpath = libs/json\n\turl = ../json.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"pfr\"]\n\tpath = libs/pfr\n\turl = ../pfr.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"describe\"]\n\tpath = libs/describe\n\turl = ../describe.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"lambda2\"]\n\tpath = libs/lambda2\n\turl = ../lambda2.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"property_map_parallel\"]\n\tpath = libs/property_map_parallel\n\turl = ../property_map_parallel.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"url\"]\n\tpath = libs/url\n\turl = ../url.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"mysql\"]\n\tpath = libs/mysql\n\turl = ../mysql.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"compat\"]\n\tpath = libs/compat\n\turl = ../compat.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"redis\"]\n\tpath = libs/redis\n\turl = ../redis.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"cobalt\"]\n\tpath = libs/cobalt\n\turl = ../cobalt.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"charconv\"]\n\tpath = libs/charconv\n\turl = ../charconv.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"scope\"]\n\tpath = libs/scope\n\turl = ../scope.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"boostlook\"]\n\tpath = tools/boostlook\n\turl = ../boostlook.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"parser\"]\n\tpath = libs/parser\n\turl = ../parser.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"mqtt5\"]\n\tpath = libs/mqtt5\n\turl = ../mqtt5.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"hash2\"]\n\tpath = libs/hash2\n\turl = ../hash2.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"bloom\"]\n\tpath = libs/bloom\n\turl = ../bloom.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"openmethod\"]\n\tpath = libs/openmethod\n\turl = ../openmethod.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n[submodule \"decimal\"]\n\tpath = libs/decimal\n\turl = ../decimal.git\n\tfetchRecurseSubmodules = on-demand\n\tbranch = .\n" }, { "path": ".travis.yml", "content": "# Use, modification, and distribution are\n# subject to the Boost Software License, Version 1.0. (See accompanying\n# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n#\n# Copyright Rene Rivera 2015-2016.\n# Copyright Peter Dimov 2017-2021.\n\nbranches:\n only:\n - master\n - develop\n - /feature\\/.*/\n\ndist: bionic\n\nlanguage: cpp\n\ncompiler: gcc\n\ngit:\n submodules: false\n\nenv:\n matrix:\n - TRAVIS_EMPTY_JOB_WORKAROUND=true\n\nmatrix:\n exclude:\n - env: TRAVIS_EMPTY_JOB_WORKAROUND=true\n\n include:\n\n - env: SCRIPT=ci_boost_release MODE=check\n addons:\n apt:\n packages:\n - xsltproc\n\n # Simple integrated status tests check.\n - env: SCRIPT=ci_boost_status\n\n # Same, but using release layout\n - env: SCRIPT=ci_boost_status RELEASE=1\n\n # Run 'quick' tests.\n - env: SCRIPT=ci_boost_status TARGET=quick TOOLSET=gcc CXXSTD=03,11,14\n compiler: g++\n\n - env: SCRIPT=ci_boost_status TARGET=quick TOOLSET=clang CXXSTD=03,11,14\n compiler: clang++\n\n # Build Boost\n - env: SCRIPT=ci_boost_build TOOLSET=gcc\n compiler: g++\n\n # Build Boost with release layout\n - env: SCRIPT=ci_boost_build TOOLSET=gcc RELEASE=1\n compiler: g++\n\n # Build Boost with CMake\n - env: CMAKE_BUILD=1\n dist: xenial\n compiler: g++\n\n before_script: true\n before_install: true\n after_success: true\n after_failure: true\n after_script: true\n\n addons:\n apt:\n packages:\n - libzstd-dev\n\n install:\n - git submodule update --init --jobs 3\n\n script:\n - mkdir __build && cd __build\n - cmake -DBOOST_INSTALL_LAYOUT=tagged -DBUILD_SHARED_LIBS=ON ..\n - cmake --build .\n\n # Install Boost with CMake\n - env: CMAKE_INSTALL=1\n compiler: g++\n\n before_script: true\n before_install: true\n after_success: true\n after_failure: true\n after_script: true\n\n install:\n - pip install --user cmake\n - git submodule update --init --jobs 3\n\n script:\n - mkdir __build && cd __build\n - cmake -DBOOST_INSTALL_LAYOUT=tagged -DBUILD_SHARED_LIBS=ON -DCMAKE_INSTALL_PREFIX=~/.local ..\n - cmake --build .\n - cmake --build . --target install\n\n # Test Boost with CMake\n - env: CMAKE_TEST=1\n dist: bionic\n compiler: g++\n\n before_script: true\n before_install: true\n after_success: true\n after_failure: true\n after_script: true\n\n addons:\n apt:\n packages:\n - liblzma-dev\n - libzstd-dev\n\n install:\n - git submodule update --init --jobs 3\n\n script:\n - mkdir __build && cd __build\n - cmake -DBUILD_TESTING=ON ..\n - cmake --build . -j 3\n - cmake --build . --target tests -j 3 -- -k\n - ctest --output-on-failure -j 3 -R quick\n\nbefore_install:\n # Fetch the scripts to do the actual building/testing.\n - git submodule update --init --jobs 3\n - |\n wget \"https://raw.githubusercontent.com/boostorg/release-tools/develop/ci_boost_common.py\" -P ..\n wget \"https://raw.githubusercontent.com/boostorg/release-tools/develop/${SCRIPT}.py\" -P ..\n\ninstall: python \"${TRAVIS_BUILD_DIR}/../${SCRIPT}.py\" install\nbefore_script: python \"${TRAVIS_BUILD_DIR}/../${SCRIPT}.py\" before_script\nscript: python \"${TRAVIS_BUILD_DIR}/../${SCRIPT}.py\" script\nafter_success: python \"${TRAVIS_BUILD_DIR}/../${SCRIPT}.py\" after_success\nafter_failure: python \"${TRAVIS_BUILD_DIR}/../${SCRIPT}.py\" after_failure\nafter_script: python \"${TRAVIS_BUILD_DIR}/../${SCRIPT}.py\" after_script\n" }, { "path": "CMakeLists.txt", "content": "# Copyright 2019, 2021 Peter Dimov\n# Distributed under the Boost Software License, Version 1.0.\n# See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt\n\ncmake_minimum_required(VERSION 3.8...3.16)\n\n# The default build type must be set before project()\nif(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND NOT CMAKE_BUILD_TYPE AND NOT CMAKE_CONFIGURATION_TYPES)\n set(CMAKE_BUILD_TYPE Release CACHE STRING \"Build type\" FORCE)\n set_property(CACHE CMAKE_BUILD_TYPE PROPERTY STRINGS \"Debug\" \"Release\" \"MinSizeRel\" \"RelWithDebInfo\")\nendif()\n\nproject(Boost VERSION 1.91.0 LANGUAGES CXX)\n\nset(BOOST_SUPERPROJECT_VERSION ${PROJECT_VERSION})\nset(BOOST_SUPERPROJECT_SOURCE_DIR ${PROJECT_SOURCE_DIR})\n\nlist(APPEND CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/tools/cmake/include)\n\ninclude(BoostRoot)\n" }, { "path": "INSTALL", "content": "See ./index.html for information about this release. The \"Getting Started\" \nsection is a useful starting place.\n\n---------------------------\nCopyright Beman Dawes, 2008\n\nDistributed under the Boost Software License, Version 1.0.\nSee ./LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt " }, { "path": "Jamroot", "content": "# Copyright Vladimir Prus 2002-2006.\n# Copyright Dave Abrahams 2005-2006.\n# Copyright René Ferdinand Rivera Morell 2005-2024.\n# Copyright Douglas Gregor 2005.\n#\n# Distributed under the Boost Software License, Version 1.0.\n# (See accompanying file LICENSE_1_0.txt or copy at\n# http://www.boost.org/LICENSE_1_0.txt)\n\n# Usage:\n#\n# b2 [options] [properties] [install|stage]\n#\n# Builds and installs Boost.\n#\n# Targets and Related Options:\n#\n# install Install headers and compiled library files to the\n# ======= configured locations (below).\n#\n# --prefix= Install architecture independent files here.\n# Default: C:\\Boost on Windows\n# Default: /usr/local on Unix, Linux, etc.\n#\n# --exec-prefix= Install architecture dependent files here.\n# Default: \n#\n# --libdir= Install library files here.\n# Default: /lib\n#\n# --includedir= Install header files here.\n# Default: /include\n#\n# --cmakedir= Install CMake configuration files here.\n# Default: /cmake\n#\n# --no-cmake-config Do not install CMake configuration files.\n#\n# stage Build and install only compiled library files to the\n# ===== stage directory.\n#\n# --stagedir= Install library files here\n# Default: ./stage\n#\n# Other Options:\n#\n# --build-type= Build the specified pre-defined set of variations of\n# the libraries. Note, that which variants get built\n# depends on what each library supports.\n#\n# -- minimal -- (default) Builds a minimal set of\n# variants. On Windows, these are static\n# multithreaded libraries in debug and release\n# modes, using shared runtime. On Linux, these are\n# static and shared multithreaded libraries in\n# release mode.\n#\n# -- complete -- Build all possible variations.\n#\n# --build-dir=DIR Build in this location instead of building within\n# the distribution tree. Recommended!\n#\n# --show-libraries Display the list of Boost libraries that require\n# build and installation steps, and then exit.\n#\n# --layout= Determine whether to choose library names and header\n# locations such that multiple versions of Boost or\n# multiple compilers can be used on the same system.\n#\n# -- versioned -- Names of boost binaries include\n# the Boost version number, name and version of\n# the compiler and encoded build properties. Boost\n# headers are installed in a subdirectory of\n# whose name contains the Boost version\n# number.\n#\n# -- tagged -- Names of boost binaries include the\n# encoded build properties such as variant and\n# threading, but do not including compiler name\n# and version, or Boost version. This option is\n# useful if you build several variants of Boost,\n# using the same compiler.\n#\n# -- system -- Binaries names do not include the\n# Boost version number or the name and version\n# number of the compiler. Boost headers are\n# installed directly into . This option is\n# intended for system integrators building\n# distribution packages.\n#\n# The default value is 'versioned' on Windows, and\n# 'system' on Unix.\n#\n# --buildid=ID Add the specified ID to the name of built libraries.\n# The default is to not add anything.\n#\n# --python-buildid=ID Add the specified ID to the name of built libraries\n# that depend on Python. The default is to not add\n# anything. This ID is added in addition to --buildid.\n#\n# --help This message.\n#\n# --with- Build and install the specified . If this\n# option is used, only libraries specified using this\n# option will be built.\n#\n# --without- Do not build, stage, or install the specified\n# . By default, all libraries are built.\n#\n# Properties:\n#\n# toolset=toolset Indicate the toolset to build with.\n#\n# variant=debug|release Select the build variant\n#\n# link=static|shared Whether to build static or shared libraries\n#\n# threading=single|multi Whether to build single or multithreaded binaries\n#\n# runtime-link=static|shared\n# Whether to link to static or shared C and C++\n# runtime.\n#\n\nrequire-b2 5.1.0 ;\n\n# TODO:\n# - handle boost version\n# - handle python options such as pydebug\n\nimport boostcpp ;\nimport package ;\n\nimport sequence ;\nimport xsltproc ;\nimport set ;\nimport path ;\nimport link ;\nimport notfile ;\nimport virtual-target ;\nimport \"class\" : new ;\nimport property-set ;\nimport threadapi-feature ;\nimport option ;\nimport property ;\nimport project ;\n# Backslash because of `bcp --namespace`\nimport tools/boost\\_install/boost-install ;\n\npath-constant BOOST_ROOT : . ;\nconstant BOOST_VERSION : 1.91.0 ;\nconstant BOOST_JAMROOT_MODULE : $(__name__) ;\n\n# Allow subprojects to simply `import config : requires ;` to get access to the requires rule\nimport-search $(BOOST_ROOT)/libs/config/checks ;\nimport-search $(BOOST_ROOT)/libs/predef/tools/check ;\n\nboostcpp.set-version $(BOOST_VERSION) ;\n\nuse-project /boost/architecture : libs/config/checks/architecture ;\n\nlocal all-headers =\n [ MATCH .*libs/(.*)/include/boost : [ glob libs/*/include/boost libs/*/*/include/boost ] ] ;\n\nfor dir in $(all-headers)\n{\n link-directory $(dir)-headers : libs/$(dir)/include/boost : . ;\n explicit $(dir)-headers ;\n}\n\nif $(all-headers)\n{\n constant BOOST_MODULARLAYOUT : $(all-headers) ;\n}\n\nproject /boost\n : requirements .\n\n [ boostcpp.platform ]\n\n # Disable auto-linking for all targets here, primarily because it caused\n # troubles with V2.\n BOOST_ALL_NO_LIB=1\n # Used to encode variant in target name. See the 'tag' rule below.\n @$(__name__).tag\n @handle-static-runtime\n @clang-darwin-cxxstd-11\n # Comeau does not support shared lib\n como:static\n como-linux:_GNU_SOURCE=1\n # When building docs within Boost, we want the standard Boost style\n boost.defaults=Boost\n @threadapi-feature.detect\n : usage-requirements .\n : default-build\n hidden\n multi\n : build-dir bin.v2\n ;\n\n# General, top-level, modular project searching. Also include tools in the\n# project search.\nproject-search /boost : libs tools ;\n# Temporary custom project searching to account for special library paths.\nproject-search /boost : libs/numeric ;\nproject-search /boost/numeric_conversion : libs/numeric/conversion ;\n\n# This rule is called by Boost.Build to determine the name of target. We use it\n# to encode the build variant, compiler name and boost version in the target\n# name.\n#\nrule tag ( name : type ? : property-set )\n{\n return [ boostcpp.tag $(name) : $(type) : $(property-set) ] ;\n}\n\nrule python-tag ( name : type ? : property-set )\n{\n return [ boostcpp.python-tag $(name) : $(type) : $(property-set) ] ;\n}\n\nrule handle-static-runtime ( properties * )\n{\n # Using static runtime with shared libraries is impossible on Linux, and\n # dangerous on Windows. Therefore, we disallow it. This might be drastic,\n # but it was disabled for a while without anybody complaining.\n\n local argv = [ modules.peek : ARGV ] ;\n\n if shared in $(properties)\n && static in $(properties)\n # For CW, static runtime is needed so that std::locale works.\n && ! ( cw in $(properties) )\n && ! --allow-shared-static in $(argv)\n {\n boostcpp.emit-shared-static-warning ;\n return no ;\n }\n}\n\nrule clang-darwin-cxxstd-11 ( properties * )\n{\n # AppleClang defaults to C++03\n\n local result = [ property.select : $(properties) ] ;\n\n if darwin in $(properties)\n {\n result ?= 11 ;\n }\n\n return $(result) ;\n}\n\n# All libraries.\nlocal all-libraries\n = [ MATCH .*libs/(.*)/meta/libraries.json : [ glob libs/*/meta/libraries.json ] ] ;\n\n# Find all the libraries that have something to build (the old way).\nlocal all-libraries-to-build\n = [ MATCH .*libs/(.*)/build/.* : [ glob libs/*/build/Jamfile.v2 ]\n [ glob libs/*/build/Jamfile ] ] ;\nall-libraries-to-build = [ sequence.unique $(all-libraries-to-build) ] ;\n# The function_types library has a Jamfile, but it's used for maintenance\n# purposes, there's no library to build and install.\nall-libraries-to-build = [ set.difference $(all-libraries-to-build) : function_types ] ;\n\n# Find all the libraries that have a library-root build declaration (modular way).\nlocal all-libraries-modular-build\n = [ MATCH .*libs/(.*)/build.jam : [ glob libs/*/build.jam ] ] ;\n\n# Modular and not are mutually exclusive as they have different lib targets.\nlocal all-libraries-old-build = [ set.difference $(all-libraries-to-build) : $(all-libraries-modular-build) ] ;\n\n# The header only libraries that are not of the new modular form. For which we\n# will create synthetic projects and targets to simulate the new modular form.\nlocal all-libraries-to-declare\n = [ set.difference $(all-libraries)\n : $(all-libraries-modular-build) $(all-libraries-old-build) ] ;\nif ! [ glob libs/numeric/conversion/build.jam ]\n{\n all-libraries-to-declare += numeric_conversion ;\n}\nif ! [ glob libs/numeric/interval/build.jam ]\n{\n all-libraries-to-declare += interval ;\n}\nif ! [ glob libs/numeric/odeint/build.jam ]\n{\n all-libraries-to-declare += odeint ;\n}\nif ! [ glob libs/numeric/ublas/build.jam ]\n{\n all-libraries-to-declare += ublas ;\n}\nall-libraries-to-declare = [ SORT $(all-libraries-to-declare) ] ;\n\n# ECHO \"INFO: Build Libraries:\" [ SORT $(all-libraries-old-build) ] ;\n# ECHO \"INFO: Modular Libraries:\" [ SORT $(all-libraries-modular-build) ] ;\n# ECHO \"INFO: Declared Libraries:\" [ SORT $(all-libraries-to-declare) ] ;\n# EXIT : 0 ;\n\n# Setup convenient aliases for all libraries.\n\n# First, the complicated libraries: where the target name in Jamfile is\n# different from its directory name.\nexplicit\n [ alias prg_exec_monitor : libs/test/build//boost_prg_exec_monitor ]\n [ alias test_exec_monitor : libs/test/build//boost_test_exec_monitor ]\n [ alias unit_test_framework : libs/test/build//boost_unit_test_framework ]\n [ alias serialization : libs/serialization/build//boost_serialization ]\n [ alias wserialization : libs/serialization/build//boost_wserialization ]\n ;\nfor local l in $(all-libraries-old-build)\n{\n if ! $(l) in test graph serialization headers\n {\n explicit [ alias $(l) : libs/$(l)/build//boost_$(l) ] ;\n }\n}\nfor local l in $(all-libraries-modular-build)\n{\n if ! $(l) in test graph serialization headers\n {\n explicit [ alias $(l) : /boost/$(l)//boost_$(l) ] ;\n }\n}\n\nrule do-nothing { }\n\nrule generate-alias ( project name : property-set : sources * )\n{\n local action-name = [ $(property-set).get ] ;\n local m = [ MATCH ^@(.*) : $(action-name) ] ;\n property-set = [ property-set.empty ] ;\n local action = [ new action $(sources) : $(m[1]) : $(property-set) ] ;\n local t = [ new notfile-target $(name) : $(project) : $(action) ] ;\n return [ virtual-target.register $(t) ] ;\n}\n\ngenerate headers : $(all-headers)-headers : @generate-alias @do-nothing : : . ;\n\n#alias headers : $(all-headers)-headers : : : . ;\nexplicit headers ;\n\n# Make project ids of all libraries known.\nfor local l in $(all-libraries-old-build)\n{\n use-project /boost/$(l) : libs/$(l)/build ;\n}\n\nif [ path.exists $(BOOST_ROOT)/tools/inspect/build ]\n{\n use-project /boost/tools/inspect : tools/inspect/build ;\n}\n\nif [ path.exists $(BOOST_ROOT)/libs/wave/tool/build ]\n{\n use-project /boost/libs/wave/tool : $(BOOST_ROOT)/libs/wave/tool/build ;\n}\n\n# Make the boost-install rule visible in subprojects\n\n# This rule should be called from libraries' Jamfiles and will create two\n# targets, \"install\" and \"stage\", that will install or stage that library. The\n# --prefix option is respected, but --with and --without options, naturally, are\n# ignored.\n#\n# - libraries -- list of library targets to install.\n\nrule boost-install ( libraries * )\n{\n boost-install.boost-install $(libraries) ;\n}\n\n# Creates a library target, adding autolink support and also creates\n# stage and install targets via boost-install, above.\nrule boost-lib ( name : sources * : requirements * : default-build * : usage-requirements * )\n{\n autolink = shared:BOOST_$(name:U)_DYN_LINK=1 ;\n name = boost_$(name) ;\n lib $(name)\n : $(sources)\n : $(requirements) $(autolink)\n : $(default-build)\n : $(usage-requirements) $(autolink)\n ;\n boost-install $(name) ;\n}\n\n\n# Declare special top-level targets that build and install the desired variants\n# of the libraries.\nboostcpp.declare-targets $(all-libraries-to-build) ;\n\n# Declare a Boost library and run related declaration rules. This should be\n# called from the libroot/build.jam to define the components of a Boost lib.\n# The first arg is the base ID of the library. Each subsequence arg is a\n# Boost (boost-x) declaration rule to call with arguments.\n#\n# For example:\n#\n# call-if : boost-library serialization\n# : install boost_serialization boost_wserialization ;\n#\nrule boost-library ( id ? : options * : * )\n{\n # ECHO \"INFO: Declare Boost library:\" $(id) ;\n local called-boost-install ;\n for n in 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19\n {\n local option = $($(n)) ;\n if $(option)\n {\n call-if : boost-$(option[1]) $(option[2-]) ;\n if $(option[1]) = install\n {\n called-boost-install = true ;\n }\n }\n }\n if ! $(called-boost-install)\n {\n # If the library didn't indicate an install build target it's likely\n # header only. We should declare empty install targets to allow for\n # generic handling.\n boost-install.boost-install ;\n }\n}\n\n# Declare projects and targets for all placeholder, header only, not yet\n# modular libraries.\n#\n# NOTE: This has to be after the boost-* rule definitions to ensure that those\n# are available for import into the new projects.\nlocal location = [ project.attribute $(__name__) location ] ;\nfor local lib in $(all-libraries-to-declare)\n{\n local lib-path\n = [ path.join $(location) libs $(lib) ] ;\n if $(lib) = numeric_conversion\n {\n lib-path = [ path.join $(location) libs/numeric/conversion ] ;\n }\n else if $(lib) in interval odeint ublas\n {\n lib-path = [ path.join $(location) libs/numeric/$(lib) ] ;\n }\n local lib-module\n = [ project.load $(lib-path) : synthesize ] ;\n modules.poke $(lib-module) : BOOST_LIB_PROJECT : /boost/$(lib) ;\n modules.poke $(lib-module) : BOOST_LIB_TARGET : boost_$(lib) ;\n project.push-current [ project.target $(lib-module) ] ;\n module $(lib-module)\n {\n project $(BOOST_LIB_PROJECT)\n : requirements\n /boost//headers\n ;\n alias $(BOOST_LIB_TARGET) ;\n }\n project.pop-current ;\n}\n\n# Backslash because of `bcp --namespace`\n\nif ! [ project.search /boost/tools/boost\\_install ]\n{\n use-project /boost/tools/boost\\_install : tools/boost\\_install ;\n}\n\n# Ensure \"modular\" libraries' projects are loaded before build request is\n# calculated. This is necessary for subprojects that define custom features\n# to be set by users on command line.\n# This part should stay at the bottom of the file, because subprojects may rely\n# on rules or constants from it.\nfor local l in $(all-libraries-modular-build)\n{\n # project.find returns the module for the project, which ensures that the\n # project is loaded. The convoluted way the rule is invoked is due to the\n # fact that project.find can only be called from a project target instance.\n modules.call-in [ project.target $(__name__) ]\n : project.find /boost/$(l)\n : $(location) ;\n}\n" }, { "path": "LICENSE_1_0.txt", "content": "Boost Software License - Version 1.0 - August 17th, 2003\n\nPermission is hereby granted, free of charge, to any person or organization\nobtaining a copy of the software and accompanying documentation covered by\nthis license (the \"Software\") to use, reproduce, display, distribute,\nexecute, and transmit the Software, and to prepare derivative works of the\nSoftware, and to permit third-parties to whom the Software is furnished to\ndo so, all subject to the following:\n\nThe copyright notices in the Software and this entire statement, including\nthe above license grant, this restriction and the following disclaimer,\nmust be included in all copies of the Software, in whole or in part, and\nall derivative works of the Software, unless such copies or derivative\nworks are solely in the form of machine-executable object code generated by\na source language processor.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\nSHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\nFOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\nDEALINGS IN THE SOFTWARE.\n" }, { "path": "README.md", "content": "# Boost C++ Libraries\n\nThe Boost project provides free peer-reviewed portable C++ source libraries.\n\nWe emphasize libraries that work well with the C++ Standard Library. Boost\nlibraries are intended to be widely useful, and usable across a broad spectrum\nof applications. The Boost license encourages both commercial and non-commercial use\nand does not require attribution for binary use.\n\nThe project website is www.boost.org, where you can obtain more information and\n[download](https://www.boost.org/users/download/) the current release.\n" }, { "path": "appveyor.yml", "content": "version: 1.0.{build}-{branch}\n\nbranches:\n only:\n - develop\n - master\n\nenvironment:\n matrix:\n - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2013\n SCRIPT: ci_boost_test_library\n - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015\n SCRIPT: ci_boost_test_library\n - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017\n SCRIPT: ci_boost_test_library\n - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017\n SCRIPT: ci_boost_status\n TARGET: quick\n\ninit:\n - cd %APPVEYOR_BUILD_FOLDER%/..\n - appveyor DownloadFile \"https://raw.githubusercontent.com/boostorg/release-tools/develop/ci_boost_common.py\"\n - appveyor DownloadFile \"https://raw.githubusercontent.com/boostorg/release-tools/develop/%SCRIPT%.py\"\n - cd %APPVEYOR_BUILD_FOLDER%\ninstall: python ../%SCRIPT%.py install\nbefore_build: python ../%SCRIPT%.py before_build\nbuild_script: python ../%SCRIPT%.py build_script\nafter_build: python ../%SCRIPT%.py after_build\nbefore_test: python ../%SCRIPT%.py before_test\ntest_script: python ../%SCRIPT%.py test_script\nafter_test: python ../%SCRIPT%.py after_test\non_success: python ../%SCRIPT%.py on_success\non_failure: python ../%SCRIPT%.py on_failure\non_finish: python ../%SCRIPT%.py on_finish\n" }, { "path": "boost-build.jam", "content": "# Copyright (C) 2002-2003 David Abrahams.\n# Copyright (C) 2002-2003 Vladimir Prus.\n# Copyright (C) 2003,2007 Rene Rivera.\n# Use, modification and distribution are subject to the\n# Boost Software License, Version 1.0. (See accompanying file\n# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n# This is the initial file loaded by Boost Jam when run from any Boost library\n# folder. It allows us to choose which Boost Build installation to use for\n# building Boost libraries. Unless explicitly selected using a command-line\n# option, the version included with the Boost library distribution is used (as\n# opposed to any other Boost Build version installed on the user's system).\n\nBOOST_ROOT = $(.boost-build-file:D) ;\nBOOST_BUILD = [ MATCH --boost-build=(.*) : $(ARGV) ] ;\nBOOST_BUILD ?= tools/build/src ;\nboost-build $(BOOST_BUILD) ;\n" }, { "path": "boost.css", "content": "/*=============================================================================\n Copyright 2002 William E. Kempf\n Distributed under the Boost Software License, Version 1.0. (See accompany-\n ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n=============================================================================*/\n\nH1\n{\n FONT-SIZE: 200%;\n COLOR: #00008B;\n}\nH2\n{\n FONT-SIZE: 150%;\n}\nH3\n{\n FONT-SIZE: 125%;\n}\nH4\n{\n FONT-SIZE: 108%;\n}\nBODY\n{\n FONT-SIZE: 100%;\n BACKGROUND-COLOR: #ffffff;\n COLOR: #000000;\n}\nPRE\n{\n MARGIN-LEFT: 2em;\n FONT-FAMILY: Courier,\n monospace;\n}\nCODE\n{\n FONT-FAMILY: Courier,\n monospace;\n}\nCODE.as_pre\n{\n white-space: pre;\n}\n.index\n{\n TEXT-ALIGN: left;\n}\n.page-index\n{\n TEXT-ALIGN: left;\n}\n.definition\n{\n TEXT-ALIGN: left;\n}\n.footnote\n{\n FONT-SIZE: 66%;\n VERTICAL-ALIGN: super;\n TEXT-DECORATION: none;\n}\n.function-semantics\n{\n CLEAR: left;\n}" }, { "path": "boostcpp.jam", "content": "# Boost.Build support specific for the Boost C++ Libraries.\n# Copyright Vladimir Prus 2002-2010.\n# Copyright Dave Abrahams 2005-2006.\n# Copyright Rene Rivera 2005-2007.\n# Copyright Douglas Gregor 2005.\n#\n# Distributed under the Boost Software License, Version 1.0.\n# (See accompanying file LICENSE_1_0.txt or copy at\n# http://www.boost.org/LICENSE_1_0.txt)\n\nimport \"class\" : new ;\nimport common ;\nimport configure ;\nimport build-system ;\nimport generate ;\nimport modules ;\nimport option ;\nimport os ;\nimport package ;\nimport path ;\nimport project ;\nimport regex ;\nimport sequence ;\nimport set ;\nimport targets ;\nimport feature ;\nimport property ;\nimport version : version-less ;\n\n##############################################################################\n#\n# 0. General setup. Parse options, check them.\n#\n##############################################################################\n\nBOOST_ROOT = [ modules.binding $(__name__) ] ;\nBOOST_ROOT = $(BOOST_ROOT:D) ;\n\nrule set-version ( version )\n{\n BOOST_VERSION = $(version) ;\n\n local version-tag =\n [ MATCH \"^([^.]+)[.]([^.]+)[.]([^.]+)\" : $(BOOST_VERSION) ] ;\n if $(version-tag[3]) = 0\n {\n version-tag = $(version-tag[1-2]) ;\n }\n BOOST_VERSION_TAG = $(version-tag:J=_) ;\n}\n\n# Option to choose how many variants to build. The default is \"minimal\".\nbuild-type = [ option.get build-type ] ;\nbuild-type ?= minimal ;\nif ! ( $(build-type) in complete minimal )\n{\n EXIT The value of the --build-type option should be either 'complete' or\n 'minimal' ;\n}\n\n# What kind of layout are we doing?\nlayout = [ option.get layout : \"\" ] ;\n\nlayout = [ MATCH (versioned|tagged|system)(-(.+))? : $(layout) ] ;\nif $(layout[3])\n{\n layout-version = $(layout[3]) ;\n layout = $(layout[1]) ;\n if [ version-less [ regex.split $(layout-version) \"[.]\" ] : 1 66 ]\n {\n layout-version = 1.40 ;\n }\n else if [ version-less [ regex.split $(layout-version) \"[.]\" ] : 1 69 ]\n {\n layout-version = 1.66 ;\n }\n}\nlayout-version ?= 1.69 ;\n\n# On Windows, we used versioned layout by default in order to be compatible with\n# autolink. On other systems, we use system layout which is what every other\n# program uses. Note that the Windows check is static, and will not be affected\n# by specific build properties used.\nif ! $(layout)\n{\n if [ os.name ] = NT\n {\n layout = versioned ;\n }\n else\n {\n layout = system ;\n }\n}\nlayout-$(layout) = true ;\n\nif $(layout) = system && $(build-type) = complete\n{\n ECHO error\\: Cannot use --layout=system with --build-type complete. ;\n ECHO error\\: Please use either --layout=versioned or --layout=tagged ;\n ECHO error\\: if you wish to build multiple variants. ;\n if [ os.name ] != NT\n {\n ECHO error\\: Note that --layout=system is used by default on Unix\n starting with Boost 1.40. ;\n }\n EXIT ;\n}\n\n# Possible stage only location.\nstage-locate = [ option.get stagedir ] ;\n\nif $(stage-locate)\n{\n stage-locate = [ path.root [ path.make $(stage-locate) ] [ path.pwd ] ] ;\n}\nelse\n{\n stage-locate = $(BOOST_ROOT)/stage ;\n}\n\nBOOST_STAGE_LOCATE = $(stage-locate) ;\n\n# Custom build ID.\nbuild-id = [ option.get buildid ] ;\nif $(build-id)\n{\n BUILD_ID = [ regex.replace $(build-id) \"[*\\\\/:.\\\"\\' ]\" _ ] ;\n}\n\n# Python build id (for Python libraries only).\npython-id = [ option.get \"python-buildid\" ] ;\nif $(python-id)\n{\n PYTHON_ID = [ regex.replace $(python-id) \"[*\\\\/:.\\\"\\']\" _ ] ;\n}\n\n\nif $(layout) = versioned\n{\n switch $(layout-version)\n {\n case 1.40 :\n .format-name-args =\n ;\n case 1.66 :\n .format-name-args =\n ;\n case 1.69 :\n .format-name-args =\n ;\n }\n}\nelse if $(layout) = tagged\n{\n switch $(layout-version)\n {\n case 1.40 :\n .format-name-args =\n ;\n case 1.66 :\n .format-name-args =\n ;\n case 1.69 :\n .format-name-args =\n ;\n }\n}\nelse if $(layout) = system\n{\n .format-name-args = ;\n}\nelse\n{\n .format-name-error = true ;\n}\n\n\n################################################################################\n#\n# 1. 'tag' function adding decorations suitable to the properties if versioned\n# or tagged layout is requested. Called from Jamroot.\n#\n################################################################################\n\nrule tag ( name : type ? : property-set )\n{\n if $(type:E=x) in STATIC_LIB SHARED_LIB IMPORT_LIB\n {\n local args = $(.format-name-args) ;\n if $(layout) = versioned\n {\n args += -$(BOOST_VERSION_TAG) ;\n }\n local result = [ common.format-name\n $(args) -$(BUILD_ID)\n : $(name) : $(type) : $(property-set) ] ;\n if $(.format-name-error)\n {\n EXIT error\\: invalid layout '$(layout:E=)' ;\n }\n\n # Optionally add version suffix. On NT, library with version suffix will\n # not be recognized by linkers. On CYGWIN, we get strage duplicate\n # symbol errors when library is generated with version suffix. On OSX,\n # version suffix is not needed -- the linker expects the\n # libFoo.1.2.3.dylib format. AIX linkers do not accept version suffixes\n # either. Pgi compilers can not accept a library with version suffix.\n # For android, if we link to libFoo.so, which is a soft link to libFoo.so.1.2.3,\n # the android studio will only pack the former into the final apk.\n if $(type) = SHARED_LIB &&\n ! [ $(property-set).get ] in windows cygwin darwin aix android &&\n ! [ $(property-set).get ] in pgi\n {\n result = $(result).$(BOOST_VERSION) ;\n }\n\n return $(result) ;\n }\n}\n\n# Specialized tag function to use for libraries linking to Python.\n# Appends value of --python-buildid if provided.\nrule python-tag ( name : type ? : property-set )\n{\n local result = $(name) ;\n\n if $(type) in STATIC_LIB SHARED_LIB IMPORT_LIB\n {\n # Add Python version suffix\n\n local version = [ $(property-set).get ] ;\n\n local major-minor = [ MATCH \"^([0-9]+)\\.([0-9]+)\" : $(version) ] ;\n local suffix = $(major-minor:J=\"\") ;\n\n if $(suffix)\n {\n result = $(result)$(suffix) ;\n }\n\n # Add PYTHON_ID if supplied\n\n if $(PYTHON_ID)\n {\n result = $(result)-$(PYTHON_ID) ;\n }\n }\n\n # forward to the boost tagging rule\n return [ tag $(result) : $(type) : $(property-set) ] ;\n}\n\n################################################################################\n#\n# 2. Declare targets that build and install all libraries. Specifically:\n#\n# - 'stage-proper' that puts all libraries in stage/lib\n# - 'install-proper' that install libraries and headers to system location\n#\n################################################################################\n\nrule declare_install_and_stage_proper_targets ( libraries * )\n{\n local p = [ project.current ] ;\n local install-targets ;\n local stage-targets ;\n for local library in $(libraries)\n {\n local mp = [ project.search /boost/$(library) ] ;\n if $(mp)\n {\n install-targets += /boost/$(library)//install ;\n stage-targets += /boost/$(library)//stage ;\n }\n else\n {\n install-targets += libs/$(library)/build//install ;\n stage-targets += libs/$(library)/build//stage ;\n }\n }\n\n alias install-proper : $(install-targets) ;\n $(p).mark-target-as-explicit install-proper ;\n\n alias stage-proper : $(stage-targets) ;\n $(p).mark-target-as-explicit stage-proper ;\n}\n\n\n################################################################################\n#\n# 3. Declare top-level targets 'stage' and 'install'. These examine the\n# --build-type option and, in case it is 'complete', build the 'install-proper'\n# and 'stage-proper' targets with a number of property sets.\n#\n################################################################################\n\nrule emit-shared-static-warning ( )\n{\n if ! $(.shared-static-warning-emitted)\n {\n ECHO \"\" ;\n ECHO \"warning: The configuration link=shared, runtime-link=static is disabled\" ;\n ECHO \"warning: by default as being too dangerous to use, and will not be built.\" ;\n ECHO \"warning: To enable it, use --allow-shared-static.\" ;\n ECHO \"\" ;\n\n .shared-static-warning-emitted = 1 ;\n }\n}\n\nclass top-level-target : alias-target-class\n{\n import modules ;\n import boostcpp ;\n\n rule __init__ ( name : project : sources * : requirements *\n : default-build * : usage-requirements * )\n {\n alias-target-class.__init__ $(name) : $(project) : $(sources) :\n $(requirements) : $(default-build) : $(usage-requirements) ;\n\n self.build-type = [ modules.peek boostcpp : build-type ] ;\n # On Linux, we build the release variant by default, since few users\n # will ever want to debug C++ Boost libraries, and there is no ABI\n # incompatibility between debug and release variants. We build shared\n # and static libraries since that is what most packages seem to provide\n # (.so in libfoo and .a in libfoo-dev).\n\n self.minimal-properties = [ property-set.create release\n multi shared static shared ] ;\n\n # On Windows, new IDE projects use:\n #\n # runtime-link=dynamic, threading=multi, variant=(debug|release)\n #\n # and in addition, C++ Boost's autolink defaults to static linking.\n\n self.minimal-properties-win = [ property-set.create debug\n release multi static shared\n 32 64 ] ;\n\n self.complete-properties = [ property-set.create\n debug release\n multi\n shared static\n shared static ] ;\n\n self.complete-properties-win = [ property-set.create\n debug release\n multi\n shared static\n shared static\n 32 64 ] ;\n }\n\n rule generate ( property-set )\n {\n modules.poke : top-level-targets : [ modules.peek : top-level-targets ]\n $(self.name) ;\n\n local os = [ $(property-set).get ] ;\n\n # Because we completely override the parent's 'generate' we need to\n # check for default feature values ourselves.\n\n if ! $(os)\n {\n os = [ feature.defaults ] ;\n os = $(os:G=) ;\n }\n\n local build-type-set ;\n\n if $(self.build-type) = minimal\n {\n if $(os) = windows\n {\n build-type-set = $(self.minimal-properties-win) ;\n }\n else\n {\n build-type-set = $(self.minimal-properties) ;\n }\n }\n else if $(self.build-type) = complete\n {\n if $(os) = windows\n {\n build-type-set = $(self.complete-properties-win) ;\n }\n else\n {\n build-type-set = $(self.complete-properties) ;\n }\n }\n else\n {\n import errors ;\n errors.error \"Unknown build type\" ;\n }\n\n if $(build-type-set)\n {\n local expanded = [ targets.apply-default-build $(property-set)\n : $(build-type-set) ] ;\n\n # Filter inappropriate combinations.\n\n local filtered ;\n local skipped ;\n\n local argv = [ modules.peek : ARGV ] ;\n\n for local p in $(expanded)\n {\n # See comment in handle-static-runtime regarding this logic.\n if [ $(p).get ] = shared\n && [ $(p).get ] = static\n && [ $(p).get ] != cw\n && ! --allow-shared-static in $(argv)\n {\n # Skip this.\n skipped += $(p) ;\n }\n else\n {\n filtered += $(p) ;\n }\n }\n\n if $(expanded) = $(skipped)\n {\n boostcpp.emit-shared-static-warning ;\n }\n\n return [ build-multiple $(filtered) ] ;\n }\n }\n\n rule build-multiple ( property-sets * )\n {\n local usage-requirements = [ property-set.empty ] ;\n local result ;\n for local p in $(property-sets)\n {\n local r = [ alias-target-class.generate $(p) ] ;\n if $(r)\n {\n usage-requirements = [ $(usage-requirements).add $(r[1]) ] ;\n result += $(r[2-]) ;\n }\n }\n return $(usage-requirements) [ sequence.unique $(result) ] ;\n }\n}\n\nrule declare_top_level_targets ( libraries * )\n{\n declare_install_and_stage_proper_targets $(libraries) ;\n\n targets.create-metatarget top-level-target : [ project.current ]\n : install\n : install-proper\n ;\n targets.create-metatarget top-level-target : [ project.current ]\n : stage\n : stage-proper headers\n ;\n\n p = [ project.current ] ;\n $(p).mark-target-as-explicit install stage ;\n\n # This target is built by default, and will forward to 'stage' after\n # producing some explanations.\n targets.create-metatarget top-level-target : [ project.current ]\n : forward\n : explain stage\n ;\n}\n\n\n################################################################################\n#\n# 4. Add hook to report configuration before the build, and confirmation with\n# setup instructions after the build.\n#\n################################################################################\n\nmessage explain : \"\\nBuilding the Boost C++ Libraries.\\n\\n\" ;\nlocal p = [ project.current ] ;\n$(p).mark-target-as-explicit explain ;\n\nrule pre-build ( )\n{\n local tl = [ modules.peek : top-level-targets ] ;\n if stage in $(tl) || install in $(tl)\n {\n # FIXME: Remove 'if' when Boost regression tests start using trunk bjam.\n if PAD in [ RULENAMES ]\n {\n configure.print-component-configuration ;\n }\n }\n}\nIMPORT $(__name__) : pre-build : : $(__name__).pre-build ;\nbuild-system.set-pre-build-hook $(__name__).pre-build ;\n\nrule post-build ( ok ? )\n{\n if forward in [ modules.peek : top-level-targets ]\n {\n if $(ok)\n {\n local include-path = [ path.native $(BOOST_ROOT) ] ;\n local stage-abs = [ path.native $(stage-locate)/lib ] ;\n\n ECHO \"\n\nThe Boost C++ Libraries were successfully built!\n\nThe following directory should be added to compiler include paths:\n\n $(include-path)\n\nThe following directory should be added to linker library paths:\n\n $(stage-abs)\n\" ;\n }\n }\n}\nIMPORT $(__name__) : post-build : : $(__name__).post-build ;\nbuild-system.set-post-build-hook $(__name__).post-build ;\n\n\n################################################################################\n#\n# 5. Top-level setup.\n#\n################################################################################\n\n# Decides which libraries are to be installed by looking at --with-\n# --without- arguments. Returns the list of directories under \"libs\"\n# which must be built and installed.\n#\nrule libraries-to-install ( existing-libs * )\n{\n local argv = [ modules.peek : ARGV ] ;\n local with-parameter = [ MATCH ^--with-(.*) : $(argv) ] ;\n local without-parameter = [ MATCH ^--without-(.*) : $(argv) ] ;\n\n if ! $(with-parameter) && ! $(without-parameter)\n {\n # Nothing is specified on command line. See if maybe project-config.jam\n # has some choices.\n local libs = [ modules.peek project-config : libraries ] ;\n with-parameter = [ MATCH ^--with-(.*) : $(libs) ] ;\n without-parameter = [ MATCH ^--without-(.*) : $(libs) ] ;\n }\n\n # Do some checks.\n if $(with-parameter) && $(without-parameter)\n {\n EXIT error\\: both --with- and --without- specified ;\n }\n\n local wrong = [ set.difference $(with-parameter) : $(existing-libs) ] ;\n if $(wrong)\n {\n EXIT error\\: wrong library name '$(wrong[1])' in the --with-\n option. ;\n }\n local wrong = [ set.difference $(without-parameter) : $(existing-libs) ] ;\n if $(wrong)\n {\n EXIT error\\: wrong library name '$(wrong[1])' in the --without-\n option. ;\n }\n\n if $(with-parameter)\n {\n return [ set.intersection $(existing-libs) : $(with-parameter) ] ;\n }\n else\n {\n return [ set.difference $(existing-libs) : $(without-parameter) ] ;\n }\n}\n\nrule declare-targets ( all-libraries * )\n{\n configure.register-components $(all-libraries) ;\n\n # Select the libraries to install.\n libraries = [ libraries-to-install $(all-libraries) ] ;\n configure.components-building $(libraries) ;\n\n if [ option.get \"show-libraries\" : : true ]\n {\n ECHO The following libraries require building\\: ;\n for local l in $(libraries)\n {\n if $(l) = function_types\n {\n continue ;\n }\n if [ path.glob $(BOOST_ROOT)/libs/$(l)/build : Jamfile Jamfile.v2 ]\n {\n echo \" - $(l)\" ;\n }\n }\n EXIT ;\n }\n\n declare_top_level_targets $(libraries) ;\n}\n\n# Returns the properties identifying the toolset. We'll use them\n# below to configure checks. These are essentially same as in\n# configure.builds, except we don't use address-model and\n# architecture - as we're trying to detect them here.\n#\nrule toolset-properties ( properties * )\n{\n local toolset = [ property.select : $(properties) ] ;\n local toolset-version-property = \"\" ;\n return [ property.select $(toolset-version-property) : $(properties) ] ;\n}\n\n.deducible-architectures = arm loongarch mips power riscv s390x sparc x86 combined ;\nfeature.feature x-deduced-platform\n : $(.deducible-architectures)_32 $(.deducible-architectures)_64\n : composite implicit optional propagated ;\nfor a in $(.deducible-architectures)\n{\n feature.compose $(a)_32 : $(a) 32 ;\n feature.compose $(a)_64 : $(a) 64 ;\n}\n\nrule deduce-architecture ( properties * )\n{\n local deduced-pl = [ property.select : $(properties) ] ;\n if $(deduced-pl)\n {\n return $(deduced-pl) ;\n }\n\n local filtered = [ toolset-properties $(properties) ] ;\n\n local names = 32 64 ;\n local idx = [ configure.find-builds \"default address-model\" : $(filtered)\n : /boost/architecture//32 \"32-bit\"\n : /boost/architecture//64 \"64-bit\" ] ;\n local deduced-am = $(names[$(idx)]) ;\n if ! $(deduced-am)\n {\n return ;\n }\n\n names = $(.deducible-architectures) ;\n idx = [ configure.find-builds \"default architecture\" : $(filtered)\n : /boost/architecture//arm\n : /boost/architecture//loongarch\n : /boost/architecture//mips\n : /boost/architecture//power\n : /boost/architecture//riscv\n : /boost/architecture//s390x\n : /boost/architecture//sparc\n : /boost/architecture//x86\n : /boost/architecture//combined ] ;\n local deduced-arch = $(names[$(idx)]) ;\n if ! $(deduced-arch)\n {\n return ;\n }\n\n local requested-am = [ property.select : $(properties) ] ;\n requested-am ?= $(deduced-am) ;\n\n local requested-arch = [ property.select : $(properties) ] ;\n requested-arch ?= $(deduced-arch) ;\n\n deduced-pl = $(requested-arch:G=)_$(requested-am:G=) ;\n\n if ! $(deduced-pl:G=) in [ feature.values ]\n {\n deduced-pl = ;\n }\n return $(deduced-pl) ;\n}\n\n\nrule deduce-address-model ( properties * )\n{\n # this rule is a noop and exists for legacy reasons\n}\n\nrule platform ( )\n{\n return @boostcpp.deduce-architecture\n @boostcpp.deduce-address-model ;\n}\n" }, { "path": "bootstrap.bat", "content": "@ECHO OFF\n\nSETLOCAL\n\nREM Copyright 2019-2020 Rene Rivera\nREM Copyright (C) 2009 Vladimir Prus\nREM\nREM Distributed under the Boost Software License, Version 1.0.\nREM (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)\n\nECHO Building Boost.Build engine\nif exist \".\\tools\\build\\src\\engine\\b2.exe\" del tools\\build\\src\\engine\\b2.exe\npushd tools\\build\\src\\engine\n\ncall .\\build.bat %*\n@ECHO OFF\n\npopd\n\nif exist \".\\tools\\build\\src\\engine\\b2.exe\" (\n copy .\\tools\\build\\src\\engine\\b2.exe . > nul\n goto :bjam_built)\n\ngoto :bjam_failure\n\n:bjam_built\n\nREM Ideally, we should obtain the toolset that build.bat has\nREM guessed. However, it uses setlocal at the start and does not\nREM export BOOST_JAM_TOOLSET, and I don't know how to do that\nREM properly. Default to msvc if not specified.\n\nSET TOOLSET=msvc\n\nIF \"%1\"==\"gcc\" SET TOOLSET=gcc\nIF \"%1\"==\"clang\" SET TOOLSET=clang\nIF \"%1\"==\"borland\" SET TOOLSET=embarcadero\nIF \"%1\"==\"vc71\" SET TOOLSET=msvc : 7.1\nIF \"%1\"==\"vc8\" SET TOOLSET=msvc : 8.0\nIF \"%1\"==\"vc9\" SET TOOLSET=msvc : 9.0\nIF \"%1\"==\"vc10\" SET TOOLSET=msvc : 10.0\nIF \"%1\"==\"vc11\" SET TOOLSET=msvc : 11.0\nIF \"%1\"==\"vc12\" SET TOOLSET=msvc : 12.0\nIF \"%1\"==\"vc14\" SET TOOLSET=msvc : 14.0\nIF \"%1\"==\"vc141\" SET TOOLSET=msvc : 14.1\nIF \"%1\"==\"vc142\" SET TOOLSET=msvc : 14.2\nIF \"%1\"==\"vc143\" SET TOOLSET=msvc : 14.3\nIF \"%1\"==\"vc145\" SET TOOLSET=msvc : 14.5\n\nECHO.\nECHO Generating Boost.Build configuration in project-config.jam for %TOOLSET%...\nECHO # Boost.Build Configuration > project-config.jam\nECHO # Automatically generated by bootstrap.bat >> project-config.jam\nECHO. >> project-config.jam\nECHO import option ; >> project-config.jam\nECHO. >> project-config.jam\nECHO using %TOOLSET% ; >> project-config.jam\nECHO. >> project-config.jam\nECHO option.set keep-going : false ; >> project-config.jam\nECHO. >> project-config.jam\n\nECHO.\nECHO Bootstrapping is done. To build, run:\nECHO.\nECHO .\\b2\nECHO.\n\nIF EXIST libs\\config\\include (\nECHO. To generate header files, run:\nECHO.\nECHO. .\\b2 headers\nECHO.\n)\n\nECHO To adjust configuration, edit 'project-config.jam'.\nECHO Further information:\nECHO.\nECHO - Command line help:\nECHO .\\b2 --help\nECHO. \nECHO - Getting started guide: \nECHO http://boost.org/more/getting_started/windows.html\nECHO. \nECHO - Boost.Build documentation:\nECHO http://www.boost.org/build/\nECHO.\n\ngoto :end\n\n:bjam_failure\n\nECHO.\nECHO Failed to build Boost.Build engine.\nECHO.\n\nREM Set an error code to allow `bootstrap && b2`\ncmd /c exit /b 1 > nul\n\n:end\n" }, { "path": "bootstrap.sh", "content": "#!/bin/sh\n# Copyright 2019-2021 René Ferdinand Rivera Morell\n# Copyright (C) 2005, 2006 Douglas Gregor.\n# Copyright (C) 2006 The Trustees of Indiana University\n#\n# Distributed under the Boost Software License, Version 1.0.\n# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)\n\n# boostinspect:notab - Tabs are required for the Makefile.\n\nBJAM=\"\"\nTOOLSET=\"\"\nBJAM_CONFIG=\"\"\nBUILD=\"\"\nPREFIX=/usr/local\nEPREFIX=\nLIBDIR=\nINCLUDEDIR=\nLIBS=\"\"\nPYTHON=python\nPYTHON_VERSION=\nPYTHON_ROOT=\nICU_ROOT=\n\n# Handle case where builtin shell version of echo command doesn't \n# support -n. Use the installed echo executable if there is one \n# rather than builtin version to ensure -n is supported.\nECHO=`which echo`\nif test \"x$ECHO\" = x; then\n ECHO=echo\nfi\n\n# Internal flags\nflag_no_python=\nflag_icu=\nflag_show_libraries=\n\nfor option\ndo\n case $option in\n\n -help | --help | -h)\n want_help=yes ;;\n\n -prefix=* | --prefix=*)\n PREFIX=`expr \"x$option\" : \"x-*prefix=\\(.*\\)\"`\n ;;\n\n -exec-prefix=* | --exec-prefix=*)\n EPREFIX=`expr \"x$option\" : \"x-*exec-prefix=\\(.*\\)\"`\n ;;\n\n -libdir=* | --libdir=*)\n LIBDIR=`expr \"x$option\" : \"x-*libdir=\\(.*\\)\"`\n ;;\n\n -includedir=* | --includedir=*)\n INCLUDEDIR=`expr \"x$option\" : \"x-*includedir=\\(.*\\)\"`\n ;;\n\n -show-libraries | --show-libraries )\n flag_show_libraries=yes\n ;;\n\n -with-bjam=* | --with-bjam=* )\n BJAM=`expr \"x$option\" : \"x-*with-bjam=\\(.*\\)\"`\n ;;\n\n -with-icu | --with-icu )\n flag_icu=yes\n ;;\n\n -with-icu=* | --with-icu=* )\n flag_icu=yes\n ICU_ROOT=`expr \"x$option\" : \"x-*with-icu=\\(.*\\)\"`\n ;;\n\n -without-icu | --without-icu )\n flag_icu=no\n ;;\n\n -with-libraries=* | --with-libraries=* )\n library_list=`expr \"x$option\" : \"x-*with-libraries=\\(.*\\)\"`\n if test \"$library_list\" != \"all\"; then\n old_IFS=$IFS\n IFS=,\n for library in $library_list\n do\n LIBS=\"$LIBS --with-$library\"\n\n if test $library = python; then\n requested_python=yes\n fi\n done\n IFS=$old_IFS\n\n if test \"x$requested_python\" != xyes; then\n flag_no_python=yes\n fi\n fi\n ;;\n\n -without-libraries=* | --without-libraries=* )\n library_list=`expr \"x$option\" : \"x-*without-libraries=\\(.*\\)\"`\n old_IFS=$IFS\n IFS=,\n for library in $library_list\n do\n LIBS=\"$LIBS --without-$library\"\n\n if test $library = python; then\n flag_no_python=yes\n fi\n done\n IFS=$old_IFS\n ;;\n\n -with-python=* | --with-python=* )\n PYTHON=`expr \"x$option\" : \"x-*with-python=\\(.*\\)\"`\n ;;\n\n -with-python-root=* | --with-python-root=* )\n PYTHON_ROOT=`expr \"x$option\" : \"x-*with-python-root=\\(.*\\)\"`\n ;;\n\n -with-python-version=* | --with-python-version=* )\n PYTHON_VERSION=`expr \"x$option\" : \"x-*with-python-version=\\(.*\\)\"`\n ;;\n\n -with-toolset=* | --with-toolset=* )\n TOOLSET=`expr \"x$option\" : \"x-*with-toolset=\\(.*\\)\"`\n ;;\n\n -*)\n { echo \"error: unrecognized option: $option\nTry \\`$0 --help' for more information.\" >&2\n { (exit 1); exit 1; }; }\n ;; \n\n esac\ndone\n\nif test \"x$want_help\" = xyes; then\n cat < /dev/null 2>&1`\n if [ \"$?\" -ne \"0\" ]; then\n flag_no_python=yes\n fi\nfi\n\nif test \"x$flag_no_python\" = x; then\n if test \"x$PYTHON_VERSION\" = x; then\n $ECHO -n \"Detecting Python version... \"\n PYTHON_VERSION=`$PYTHON -c \"import sys; print (\\\"%d.%d\\\" % (sys.version_info[0], sys.version_info[1]))\"`\n echo $PYTHON_VERSION\n fi\n\n if test \"x$PYTHON_ROOT\" = x; then\n $ECHO -n \"Detecting Python root... \"\n PYTHON_ROOT=`$PYTHON -c \"import sys; print(sys.prefix)\"`\n echo $PYTHON_ROOT\n fi \nfi\n\n# Configure ICU\n$ECHO -n \"Unicode/ICU support for Boost.Regex?... \"\nif test \"x$flag_icu\" != xno; then\n if test \"x$ICU_ROOT\" = x; then\n if command -v pkg-config > /dev/null && pkg-config icu-uc ; then\n ICU_ROOT=`pkg-config --variable=prefix icu-uc`\n fi\n fi\n if test \"x$ICU_ROOT\" = x; then\n COMMON_ICU_PATHS=\"/usr /usr/local /sw\"\n for p in $COMMON_ICU_PATHS; do\n if test -r $p/include/unicode/utypes.h; then\n ICU_ROOT=$p\n fi\n done\n \n if test \"x$ICU_ROOT\" = x; then\n echo \"not found.\"\n else \n BJAM_CONFIG=\"$BJAM_CONFIG -sICU_PATH=$ICU_ROOT\"\n echo \"$ICU_ROOT\"\n fi\n else\n BJAM_CONFIG=\"$BJAM_CONFIG -sICU_PATH=$ICU_ROOT\"\n echo \"$ICU_ROOT\"\n fi\nelse\n echo \"disabled.\"\nfi\n\n# Backup the user's existing project-config.jam\nJAM_CONFIG_OUT=\"project-config.jam\"\nif test -r \"project-config.jam\"; then\n counter=1\n \n while test -r \"project-config.jam.$counter\"; do\n counter=`expr $counter + 1`\n done\n\n echo \"Backing up existing B2 configuration in project-config.jam.$counter\"\n mv \"project-config.jam\" \"project-config.jam.$counter\"\nfi\n\n# Generate user-config.jam\necho \"Generating B2 configuration in project-config.jam for $TOOLSET...\"\ncat > project-config.jam < ]\n{\n using $TOOLSET ; \n}\n\nproject : default-build $TOOLSET ;\nEOF\n\n# - Python configuration\nif test \"x$flag_no_python\" = x; then\n cat >> project-config.jam <> project-config.jam << EOF\n\npath-constant ICU_PATH : $ICU_ROOT ;\n\nEOF\nfi\n\ncat >> project-config.jam << EOF\n\n# List of --with- and --without-\n# options. If left empty, all libraries will be built.\n# Options specified on the command line completely\n# override this variable.\nlibraries = $LIBS ;\n\n# These settings are equivalent to corresponding command-line\n# options.\noption.set prefix : $PREFIX ;\noption.set exec-prefix : $EPREFIX ;\noption.set libdir : $LIBDIR ;\noption.set includedir : $INCLUDEDIR ;\n\n# Stop on first error\noption.set keep-going : false ;\nEOF\n\ncat << EOF\n\nBootstrapping is done. To build, run:\n\n ./b2\n \nTo generate header files, run:\n\n ./b2 headers\n\nThe configuration generated uses ${TOOLSET} to build by default. If that is\nunintended either use the --with-toolset option or adjust configuration, by\nediting 'project-config.jam'.\n\nFurther information:\n\n - Command line help:\n ./b2 --help\n \n - Getting started guide: \n http://www.boost.org/more/getting_started/unix-variants.html\n \n - B2 documentation:\n http://www.boost.org/build/\n\nEOF\n" }, { "path": "doc/Jamfile.v2", "content": "# Copyright (c) 2002 Douglas Gregor \n# Copyright (c) 2016-2018 Rene Rivera\n#\n# Distributed under the Boost Software License, Version 1.0.\n# (See accompanying file LICENSE_1_0.txt or copy at\n# http://www.boost.org/LICENSE_1_0.txt)\n\nproject boost/doc\n : requirements\n boost.libraries=../../libs/libraries.htm\n html:chunker.output.doctype-public=\"-//W3C//DTD HTML 4.01 Transitional//EN\"\n html:chunker.output.doctype-system=\"http://www.w3.org/TR/html4/loose.dtd\"\n ;\n\nimport boostbook : boostbook ;\nimport project ;\nimport targets ;\nimport print ;\nimport type ;\nimport generators ;\nimport sequence ;\nimport path ;\nimport \"class\" : is-a ;\nimport regex ;\n\npath-constant BOOST_DOC : . ;\n\nlocal lib-docs = [ path.glob [ path.glob $(BOOST_DOC)/../libs $(BOOST_DOC)/../tools : */doc ]\n : [ modules.peek project : JAMFILE ] ] ;\n\nlocal rule find-target-of-class-or-type ( root-target : klass ? : type ? )\n{\n local result ;\n if ! $(result) && $(klass) && [ is-a $(root-target) : $(klass) ]\n {\n result ?= $(root-target) $(klass) ;\n }\n if ! $(result) && $(type) && $(type:U) = [ modules.peek $(root-target) : self.type ]\n {\n result ?= $(root-target) $(type:U) ;\n }\n local alternatives = [ modules.peek $(root-target) : self.alternatives ] ;\n if ! $(result)\n {\n for local alternative in $(alternatives)\n {\n if $(result) { break ; }\n result ?= [ find-target-of-class-or-type $(alternative) : $(klass) : $(type) ] ;\n }\n }\n if ! $(result)\n {\n for local alternative in $(alternatives)\n {\n if $(result) { break ; }\n local sources = [ modules.peek $(alternative) : self.sources ] ;\n for local source in [ $(alternative).sources ]\n {\n if $(result) { break ; }\n result ?= [ find-target-of-class-or-type $(source) : $(klass) : $(type) ] ;\n }\n }\n }\n return $(result) ;\n}\n\nlocal rule docbook-target-spec ( main-target )\n{\n local spec ;\n local doc-sub-target\n = [ find-target-of-class-or-type $(main-target) : boostbook-target-class : XML ] ;\n if $(doc-sub-target)\n {\n #ECHO *** $(main-target) ;\n #ECHO \" ::\" [ $(main-target).full-name ] ;\n #ECHO \" ::\" $(doc-sub-target) :: [ $(doc-sub-target[0]).full-name ] ;\n local full-name = [ $(doc-sub-target[0]).full-name ] ;\n local target-path = $(full-name:D) ;\n local target-name = $(full-name:B) ;\n local this-path = [ path.root [ project.attribute $(__name__) location ] [ path.pwd ] ] ;\n target-path = [ path.relative-to $(this-path) $(target-path) ] ;\n #ECHO \" ::\" $(target-path) :: $(target-name) ;\n spec = $(target-path)//$(target-name) ;\n }\n return $(spec) ;\n}\n\nlocal exclude-libs = [ MATCH \"^--exclude-libraries=(.*)\" : [ modules.peek : ARGV ] ] ;\nexclude-libs = [ regex.split-list $(exclude-libs) : \",\" ] ;\n\n#ECHO \"=== --exclude-libraries:\" $(exclude-libs) ;\n\nlocal lib-doc-boostdoc-refs ;\nlocal lib-doc-boostrelease-refs ;\n\nlocal this-path = [ path.root [ project.attribute $(__name__) location ] [ path.pwd ] ] ;\nfor local lib-doc in $(lib-docs)\n{\n #ECHO === $(lib-doc) ... ;\n local doc-project = $(lib-doc:D) ;\n\n local lib-dir = $(doc-project:D) ;\n local lib-name = $(lib-dir:BS) ;\n\n #ECHO \"=== lib-name:\" $(lib-name) ... ;\n\n if $(lib-name) in $(exclude-libs)\n {\n ECHO \"-- Excluded library\" '$(lib-name)' ;\n }\n else\n {\n local doc-module = [ project.find $(doc-project)\n : [ project.attribute $(__name__) location ] ] ;\n local doc-target = [ project.target $(doc-module) ] ;\n $(doc-target).build-main-targets ;\n local boostrelease-target = [ $(doc-target).main-target boostrelease ] ;\n if $(boostrelease-target)\n {\n local full-name = [ $(boostrelease-target).full-name ] ;\n local target-path = [ path.relative-to $(this-path) $(full-name:D) ] ;\n lib-doc-boostrelease-refs += $(target-path)//boostrelease ;\n #ECHO \" ::\" $(target-path)//boostrelease ;\n }\n local boostdoc-target = [ $(doc-target).main-target boostdoc ] ;\n if $(boostdoc-target)\n {\n local full-name = [ $(boostdoc-target).full-name ] ;\n local target-path = [ path.relative-to $(this-path) $(full-name:D) ] ;\n lib-doc-boostdoc-refs += $(target-path)//boostdoc ;\n #ECHO \" ::\" $(target-path)//boostdoc ;\n }\n }\n}\n\n# Build non-integrated library docs for release.\nif \"--release-build\" in [ modules.peek : ARGV ]\n{\n alias release-build : $(lib-doc-boostrelease-refs) ;\n}\n\nlocal rule component-order ( x y )\n{\n local a = [ MATCH \"(/libs/[^/]+)\" \"(/tools/[^/]+)\" : $(x:G) $(x:G=) ] ;\n local b = [ MATCH \"(/libs/[^/]+)\" \"(/tools/[^/]+)\" : $(y:G) $(y:G=) ] ;\n if $(a[1]) < $(b[1])\n {\n return true ;\n }\n else if $(a[1]) = $(b[1]) && $(x) < $(y)\n {\n return true ;\n }\n}\n\nrule xinclude-generator ( target : sources * : properties * )\n{\n print.output $(target) ;\n local includes ;\n sources = [ sequence.insertion-sort $(sources) : component-order ] ;\n locate = [ path.root [ on $(target) return $(LOCATE) ] [ path.pwd ] ] ;\n for local xml in $(sources)\n {\n local dir ;\n dir ?= [ on $(xml) return $(LOCATE) ] ;\n dir ?= [ on $(xml) return $(SEARCH) ] ;\n dir ?= \"\" ;\n dir = [ path.root $(dir[1]) [ path.pwd ] ] ;\n dir = [ path.relative-to $(locate) $(dir) ] ;\n includes += \"\" ;\n }\n print.text\n \"\"\n \"\"\n $(includes)\n \"\"\n : overwrite ;\n}\ntype.register XINCLUDE_XML : xinclude : XML ;\ngenerators.register-composing $(__name__).xinclude-generator : XML : XINCLUDE_XML ;\n\nrule xinclude ( name : sources * : requirements * : default-build * : usage-requirements * )\n{\n targets.create-typed-target XINCLUDE_XML\n : [ project.current ]\n : $(name)\n : $(sources)\n : $(requirements)\n : $(default-build)\n : $(usage-requirements)\n ;\n}\n\nxinclude libraries :\n $(lib-doc-boostdoc-refs)\n ;\nexplicit libraries ;\n\nxinclude tools :\n ../tools/quickbook/doc//quickbook\n ../tools/boostbook/doc//boostbook\n ;\nexplicit tools ;\n\nboostbook doc\n :\n src/boost.xml\n :\n generate.consistent.ids=1\n $(lib-doc-boostdoc-refs)\n libraries\n libraries\n tools\n tools\n\n images\n callouts\n $(BOOST_DOC)\n ;\n\ninstall images : [ glob src/images/*.png ] : html/images ;\nexplicit images ;\ninstall callouts : [ glob src/images/callouts/*.png ] : html/images/callouts ;\nexplicit callouts ;\n" }, { "path": "doc/html/Assignable.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/Assignable.html\n \n\n" }, { "path": "doc/html/CopyConstructible.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/CopyConstructible.html\n \n\n" }, { "path": "doc/html/accumulators.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/accumulators.html\n \n\n" }, { "path": "doc/html/any.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/any.html\n \n\n" }, { "path": "doc/html/array.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/array.html\n \n\n" }, { "path": "doc/html/atomic.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/atomic.html\n \n\n" }, { "path": "doc/html/bbv2/installation.html", "content": "\n\n \n \n Redirect to new location\n \n \n \n Automatic redirection failed, please go to\n ../bbv2.html#bbv2.installation\n \n\n\n\n" }, { "path": "doc/html/bbv2.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n ../../tools/build/doc/html/index.html\n \n\n" }, { "path": "doc/html/boost_asio.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/boost_asio.html\n \n\n\n" }, { "path": "doc/html/boost_lexical_cast.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/boost_lexical_cast.html\n \n\n" }, { "path": "doc/html/boost_random.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/boost_random.html\n \n\n\n" }, { "path": "doc/html/boost_staticassert.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/boost_staticassert.html\n \n\n\n" }, { "path": "doc/html/boost_typeerasure.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/boost_typeerasure.html\n \n\n" }, { "path": "doc/html/boostbook.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n ../../tools/boostbook/index.html\n \n\n" }, { "path": "doc/html/chrono.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/chrono.html\n \n\n" }, { "path": "doc/html/circular_buffer.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/circular_buffer.html\n \n\n\n" }, { "path": "doc/html/container.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/container.html\n \n\n" }, { "path": "doc/html/date_time/date_time_io.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/date_time/date_time_io.html\n \n\n\n" }, { "path": "doc/html/date_time/details.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/date_time/details.html\n \n\n\n" }, { "path": "doc/html/date_time/local_time.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/date_time/local_time.html\n \n\n\n" }, { "path": "doc/html/date_time.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/date_time.html\n \n\n" }, { "path": "doc/html/foreach.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/foreach.html\n \n\n\n" }, { "path": "doc/html/function.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/function.html\n \n\n" }, { "path": "doc/html/hash/custom.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/hash/custom.html\n \n\n" }, { "path": "doc/html/hash.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/hash.html\n \n\n" }, { "path": "doc/html/heap.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/heap.html\n \n\n" }, { "path": "doc/html/interprocess.html", "content": "\n\n \n \n \n Redirect to generated documentation\n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/interprocess.html\n \n\n\n" }, { "path": "doc/html/intrusive.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/intrusive.html\n \n\n\n" }, { "path": "doc/html/lambda.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/lambda.html\n \n\n" }, { "path": "doc/html/lockfree.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/lockfree.html\n \n\n" }, { "path": "doc/html/move.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/move.html\n \n\n" }, { "path": "doc/html/mpi.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/mpi.html\n \n\n" }, { "path": "doc/html/program_options.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/program_options.html\n \n\n" }, { "path": "doc/html/property_tree.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/property_tree.html\n \n\n" }, { "path": "doc/html/proto.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/proto.html\n \n\n" }, { "path": "doc/html/quickbook.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/quickbook.html\n \n\n" }, { "path": "doc/html/ratio.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/ratio.html\n \n\n" }, { "path": "doc/html/ref.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n ../../libs/core/doc/html/core/ref.html\n \n\n" }, { "path": "doc/html/signals.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/signals.html\n \n\n" }, { "path": "doc/html/signals2.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/signals2.html\n \n\n" }, { "path": "doc/html/string_algo.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/string_algo.html\n \n\n" }, { "path": "doc/html/thread.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/thread.html\n \n\n" }, { "path": "doc/html/tribool.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/tribool.html\n \n\n" }, { "path": "doc/html/typeof.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/typeof.html\n \n\n" }, { "path": "doc/html/unordered.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/unordered.html\n \n\n" }, { "path": "doc/html/variant.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/variant.html\n \n\n" }, { "path": "doc/html/xpressive.html", "content": "\n\n \n \n Redirect to generated documentation\n \n \n \n Automatic redirection failed, please go to\n http://www.boost.org/doc/libs/master/doc/html/xpressive.html\n \n\n\n" }, { "path": "doc/pdf/Jamfile.v2", "content": "# Copyright (c) 2008 John Maddock\n#\n# Distributed under the Boost Software License, Version 1.0.\n# (See accompanying file LICENSE_1_0.txt or copy at\n# http://www.boost.org/LICENSE_1_0.txt)\n\nimport boostbook ;\nimport os ;\nimport common ;\nimport doxygen ;\nimport quickbook ;\n\nproject : requirements ../../libs/geometry/doc ;\n\n\n\n\n\n\nboostbook array_docs \n\t: ../../libs/array/doc/array.xml \n\t:\n pdf:boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html\n pdf\n\t;\n\nboostbook any_docs \n\t: ../../libs/any/doc/any.xml \n\t:\n pdf:boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html\n pdf\n\t;\n\ninstall pdf-install \n : \n array_docs\n any_docs\n ../../libs/align/doc//standalone\n ../../libs/atomic/doc//standalone\n ../../libs/accumulators/doc//standalone \n ../../libs/algorithm/string/doc//string_algo \n ../../libs/algorithm/doc//standalone\n ../../libs/bimap/doc//standalone \n ../../libs/bind/doc//ref-doc \n ../../libs/chrono/doc//standalone\n ../../libs/concept_check/doc//concepts \n ../../libs/config/doc//standalone \n ../../libs/context/doc//context\n ../../libs/core/doc//standalone\n ../../libs/date_time/xmldoc//date_time\n ../../libs/dll/doc//dll-doc \n ../../libs/foreach/doc//standalone \n ../../libs/function/doc//function-doc \n# ../../libs/functional/overloaded_function/doc//doc\n ../../libs/fusion/doc//quickbook\n #../../libs/geometry/doc//geometry\n ../../libs/heap/doc//standalone\n ../../libs/icl/doc//standalone\n ../../libs/integer/doc//standalone\n ../../libs/iterator/doc//standalone\n ../../libs/lambda/doc//lambda-doc\n ../../libs/lockfree/doc//standalone\n ../../libs/lexical_cast/doc//standalone\n# ../../libs/local_function/doc//doc\n ../../libs/logic/doc//tribool\n ../../libs/move/doc//standalone\n ../../libs/mpi/doc//standalone\n ../../libs/numeric/conversion/doc//standalone\n# ../../libs/numeric/odeint/doc//standalone\n ../../libs/optional/doc//standalone\n ../../libs/phoenix/doc//phoenix-doc\n ../../libs/program_options/doc//program_option\n ../../libs/property_tree/doc//standalone\n ../../libs/proto/doc//standalone\n # Invalid Jamfile, doesn't use Boostbook anyway??\n #../../libs/ptr_container/doc//standalone\n ../../libs/ratio/doc//standalone\n ../../libs/random/doc//standalone\n ../../libs/regex/doc//standalone\n ../../libs/spirit/repository/doc//spirit2_repository\n ../../libs/static_assert/doc//standalone\n ../../libs/thread/doc//standalone\n ../../libs/tr1/doc//standalone\n ../../libs/type_index/doc//standalone\n ../../libs/type_traits/doc//pdfinstall\n ../../libs/typeof/doc//standalone\n ../../libs/units/doc//standalone\n# ../../libs/utility/identity_type/doc//doc\n ../../libs/unordered/doc//standalone\n ../../libs/variant/doc//variant-doc\n ../../libs/xpressive/doc//standalone\n ../../libs/utility/doc//standalone_base_from_member\n ../../libs/utility/doc//standalone_compressed_pair\n ../../libs/utility/doc//standalone_declval\n ../../libs/utility/doc//standalone_string_ref\n\n ../../tools/boostbook/doc//boostbook\n ../../tools/build/doc//jam_docs\n ../../tools/quickbook/doc//standalone\n ../../tools/bcp/doc//standalone\n :\n .\n PDF\n pdf\n ;\n\n\ninstall python-tutorial-install\n :\n ../../libs/python/doc/tutorial/doc//tutorial\n :\n .\n PDF\n pdf\n python_tutorial.pdf\n ;\n\ninstall asio-install\n :\n ../../libs/asio/doc//asio \n :\n .\n PDF\n pdf\n asio.pdf\n ;\n\ninstall boost-build-install\n :\n ../../tools/build/doc//userman\n :\n .\n PDF\n pdf\n boost_build.pdf\n ;\n\ninstall signals2-install\n :\n ../../libs/signals2/doc//standalone\n :\n .\n PDF\n pdf\n signals2.pdf\n ../../libs/signals2/doc//hello_world_def_code_snippet.xml\n ;\n\ninstall range-install\n :\n ../../libs/range/doc//quickbook\n :\n .\n PDF\n pdf\n range.pdf\n ;\n\n# Just copy the MSM PDF over:\ninstall msm_install : ../../libs/msm/doc/pdf/msm.pdf : . ;\n\ninstall spirit-install\n :\n ../../libs/spirit/doc//spirit2\n :\n .\n PDF\n pdf\n spirit2.pdf\n;\n\ninstall scope_exit_install\n :\n ../../libs/scope_exit/doc//doc\n :\n .\n PDF\n pdf\n scope_exit.pdf\n;\n\ninstall math_install\n :\n ../../libs/math/doc//standalone\n :\n .\n PDF\n pdf\n math.pdf\n;\n\ninstall multiprecision_install\n :\n ../../libs/multiprecision/doc//standalone\n :\n .\n PDF\n pdf\n multiprecision.pdf\n;\n\ninstall tti_install\n :\n ../../libs/tti/doc//standalone\n :\n .\n PDF\n pdf\n TypeTraitsIntrospection.pdf\n;\n\ninstall circular_buffer_install\n :\n ../../libs/circular_buffer/doc//standalone\n :\n .\n PDF\n pdf\n circular_buffer.pdf\n;\n\n\ninstall coroutine_install\n :\n ../../libs/coroutine/doc//coro\n :\n .\n PDF\n pdf\n coroutine.pdf\n;\n\ninstall pool_install\n :\n ../../libs/pool/doc//standalone\n :\n .\n PDF\n pdf\n pool.pdf\n;\n\ninstall multi_array_install\n :\n ../../libs/multi_array/doc/xml//multi_array-doc\n :\n .\n PDF\n pdf\n multi_array.pdf\n;\n\ninstall factory_install\n :\n ../../libs/functional/factory/doc//standalone\n :\n .\n PDF\n pdf\n functional_factory.pdf\n;\n\ninstall forward_install\n :\n ../../libs/functional/forward/doc//standalone\n :\n .\n PDF\n pdf\n functional_forward.pdf\n;\n\ninstall hash_install\n :\n ../../libs/functional/hash/doc//standalone\n :\n .\n PDF\n pdf\n functional_hash.pdf\n;\n\ninstall log_install\n :\n ../../libs/log/doc//log\n :\n .\n PDF\n pdf\n log.pdf\n;\n\n\n" }, { "path": "doc/pdf/build", "content": "#!/usr/bin/env bash\nboost_version=$(grep 'define.*BOOST_LIB_VERSION' ../../boost/version.hpp | sed 's/.*\"\\([^\"]*\\)\".*/\\1/')\necho Boost version tag = $boost_version\n(cd ../../libs/accumulators/doc && bjam -a --hash) 2>&1 | tee build.log\n(cd ../../libs/container/doc && rm -rf *.pdf && bjam -a --hash pdfinstall xsl:param=fop1.extensions=1 && cp *.pdf ../../../doc/pdf) 2>&1 | tee -a build.log\n(cd ../../libs/interprocess/doc && rm -rf *.pdf && bjam -a --hash pdf pdfinstall xsl:param=fop1.extensions=1 && cp *.pdf ../../../doc/pdf) 2>&1 | tee -a build.log\n(cd ../../libs/intrusive/doc && rm -rf *.pdf && bjam -a --hash pdf pdfinstall xsl:param=fop1.extensions=1 && cp *.pdf ../../../doc/pdf) 2>&1 | tee -a build.log\n(cd ../../libs/functional/overloaded_function/doc && rm -rf *.pdf && bjam -a --hash pdf pdfinstall && cp *.pdf ../../../../doc/pdf) 2>&1 | tee -a build.log\n(cd ../../libs/local_function/doc && rm -rf *.pdf && bjam -a --hash pdf pdfinstall && cp *.pdf ../../../doc/pdf) 2>&1 | tee -a build.log\n(cd ../../libs/utility/identity_type/doc && rm -rf *.pdf && bjam -a --hash pdf pdf_doc_install && cp *.pdf ../../../../doc/pdf) 2>&1 | tee -a build.log\n(cd ../../libs/numeric/odeint/doc && rm -rf *.pdf && bjam -a --hash --enable-index pdf pdfinstall && cp *.pdf ../../../../doc/pdf) 2>&1 | tee -a build.log\n(cd ../../libs/geometry/doc/src/docutils/tools/doxygen_xml2qbk && bjam release) 2>&1 | tee -a build.log\ncp ../../dist/bin/doxygen_xml2qbk* /usr/bin\nchmod +wrx /usr/bin/doxygen_xml2qbk*\n(cd ../../libs/geometry/doc && rm -rf *.pdf && ./make_qbk.py && bjam pdfinstall -a --hash xsl:param=fop1.extensions=1 xsl:param=xep.extensions=0 && cp *.pdf ../../../doc/pdf) 2>&1 | tee -a build.log\nbjam -a --hash --enable-index pdf -d2 xsl:param=fop1.extensions=0 xsl:param=xep.extensions=1 2>&1 | tee -a build.log\nrm -rf boost_${boost_version}_pdf\nmkdir boost_${boost_version}_pdf\nmv *.pdf boost_${boost_version}_pdf\n" }, { "path": "doc/src/boost.xml", "content": "\n\n\n The Boost C++ Libraries BoostBook Documentation Subset\n\n \n What's Included in This Document\n\n This document represents only a subset of the full Boost\n documentation: that part which is generated from BoostBook or\n QuickBook sources. Eventually all Boost libraries may use these\n formats, but in the meantime, much of Boost's documentation is not\n available here. Please\n see http://www.boost.org/libs\n for complete documentation.\n \n\n \n Documentation for some of the libraries described in this document is\n available in alternative formats:\n \n \n HTML\n \n \n \n \n PDF\n \n \n \n\n \n\n \n The Boost C++ Libraries (BoostBook Subset)\n \n\n \n \n \n Jeremy\n Siek\n \n Tools for generic programming\n \n \n \n Boost.Concept_Check\n \n \n \n\n \n Boost Tools\n \n \n Boost developers, testers, and maintainers have developed various programs to \n help with the administration of the Boost Libraries. Like everything else about \n Boost, these tools are available in source form, and are part of the regular \n Boost distribution.\n \n \n Users may find these tools useful when porting Boost libraries to a new platform, \n or for use with their own applications.\n \n \n \n \n\n" }, { "path": "doc/src/boostbook.css", "content": "\n/*=============================================================================\nCopyright (c) 2004 Joel de Guzman\nhttp://spirit.sourceforge.net/\n\nCopyright 2013 Niall Douglas additions for colors and alignment.\nCopyright 2013 Paul A. Bristow additions for more colors and alignments.\nCopyright 2017 Tom Westerhout font fixes to support Sphinx\n\nDistributed under the Boost Software License, Version 1.0. (See accompany-\ning file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n=============================================================================*/\n\n/*=============================================================================\nBody defaults\n=============================================================================*/\n\n body\n {\n margin: 1em;\n font-size: 16px;\n font-family: sans-serif;\n }\n\n/*=============================================================================\nParagraphs\n=============================================================================*/\n\n p, div.document, div.footer\n {\n text-align: left;\n font-size: 10pt;\n line-height: 1.15;\n }\n\n/*=============================================================================\nProgram listings\n=============================================================================*/\n\n /* Code on paragraphs */\n p tt.computeroutput\n {\n font-size: 9pt;\n }\n\n pre.synopsis\n {\n font-size: 9pt;\n margin: 1pc 4% 0pc 4%;\n padding: 0.5pc 0.5pc 0.5pc 0.5pc;\n }\n\n div.highlight,\n .programlisting,\n .screen\n {\n font-size: 9pt;\n display: block;\n margin: 1pc 4% 0pc 4%;\n padding: 0.5pc 0.5pc 0.5pc 0.5pc;\n }\n\n /* Program listings in tables don't get borders */\n td .programlisting,\n td .screen\n {\n margin: 0pc 0pc 0pc 0pc;\n padding: 0pc 0pc 0pc 0pc;\n }\n\n/*=============================================================================\nHeadings\n=============================================================================*/\n\n h1, h2, h3, h4, h5, h6\n {\n text-align: left;\n margin: 1em 0em 0.5em 0em;\n font-weight: bold;\n }\n\n h1 { font-size: 140%; }\n h2 { font-weight: bold; font-size: 140%; }\n h3 { font-weight: bold; font-size: 130%; }\n h4 { font-weight: bold; font-size: 120%; }\n h5 { font-weight: normal; font-style: italic; font-size: 110%; }\n h6 { font-weight: normal; font-style: italic; font-size: 100%; }\n\n /* Top page titles */\n title,\n h1.title,\n h2.title\n h3.title,\n h4.title,\n h5.title,\n h6.title,\n .refentrytitle\n {\n font-weight: bold;\n margin-bottom: 1pc;\n }\n\n h1.title { font-size: 140% }\n h2.title { font-size: 140% }\n h3.title { font-size: 130% }\n h4.title { font-size: 120% }\n h5.title { font-size: 110% }\n h6.title { font-size: 100% }\n\n .section h1\n {\n margin: 0em 0em 0.5em 0em;\n font-size: 140%;\n }\n\n .section h2 { font-size: 140% }\n .section h3 { font-size: 130% }\n .section h4 { font-size: 120% }\n .section h5 { font-size: 110% }\n .section h6 { font-size: 100% }\n\n /* Code on titles */\n h1 tt.computeroutput { font-size: 140% }\n h2 tt.computeroutput { font-size: 140% }\n h3 tt.computeroutput { font-size: 130% }\n h4 tt.computeroutput { font-size: 130% }\n h5 tt.computeroutput { font-size: 130% }\n h6 tt.computeroutput { font-size: 130% }\n\n\n/*=============================================================================\nAuthor\n=============================================================================*/\n\n h3.author\n {\n font-size: 100%\n }\n\n/*=============================================================================\nLists\n=============================================================================*/\n\n li\n {\n font-size: 10pt;\n line-height: 1.3;\n }\n\n /* Unordered lists */\n ul\n {\n text-align: left;\n }\n\n /* Ordered lists */\n ol\n {\n text-align: left;\n }\n\n/*=============================================================================\nLinks\n=============================================================================*/\n\n a\n {\n text-decoration: none; /* no underline */\n }\n\n a:hover\n {\n text-decoration: underline;\n }\n\n/*=============================================================================\nSpirit style navigation\n=============================================================================*/\n\n .spirit-nav\n {\n text-align: right;\n }\n\n .spirit-nav a\n {\n color: white;\n padding-left: 0.5em;\n }\n\n .spirit-nav img\n {\n border-width: 0px;\n }\n\n/*=============================================================================\nCopyright footer\n=============================================================================*/\n .copyright-footer\n {\n text-align: right;\n font-size: 70%;\n }\n\n .copyright-footer p\n {\n text-align: right;\n font-size: 80%;\n }\n\n/*=============================================================================\nTable of contents\n=============================================================================*/\n\n div.toc\n {\n margin: 1pc 4% 0pc 4%;\n padding: 0.1pc 1pc 0.1pc 1pc;\n font-size: 80%;\n line-height: 1.15;\n }\n\n .boost-toc\n {\n float: right;\n padding: 0.5pc;\n }\n\n /* Code on toc */\n .toc .computeroutput { font-size: 120% }\n\n /* No margin on nested menus */\n\n .toc dl dl { margin: 0; }\n\n/*=============================================================================\nTables\n=============================================================================*/\n\n .table-title,\n div.table p.title\n {\n margin-left: 4%;\n padding-right: 0.5em;\n padding-left: 0.5em;\n }\n\n .informaltable table,\n .table table\n {\n width: 92%;\n margin-left: 4%;\n margin-right: 4%;\n }\n\n div.informaltable table,\n div.table table\n {\n padding: 4px;\n }\n\n /* Table Cells */\n div.informaltable table tr td,\n div.table table tr td\n {\n padding: 0.5em;\n text-align: left;\n font-size: 9pt;\n }\n\n div.informaltable table tr th,\n div.table table tr th\n {\n padding: 0.5em 0.5em 0.5em 0.5em;\n border: 1pt solid white;\n font-size: 80%;\n }\n\n table.simplelist\n {\n width: auto !important;\n margin: 0em !important;\n padding: 0em !important;\n border: none !important;\n }\n table.simplelist td\n {\n margin: 0em !important;\n padding: 0em !important;\n text-align: left !important;\n font-size: 9pt !important;\n border: none !important;\n }\n\n/*=============================================================================\nSuppress margins in tables\n=============================================================================*/\n\n table th > *:first-child,\n table td > *:first-child\n {\n margin-top: 0;\n }\n\n table th > *:last-child,\n table td > *:last-child\n {\n margin-bottom: 0;\n }\n\n/*=============================================================================\nBlurbs\n=============================================================================*/\n\n div.note,\n div.tip,\n div.important,\n div.caution,\n div.warning,\n div.blurb,\n p.blurb\n {\n font-size: 9pt; /* A little bit smaller than the main text */\n line-height: 1.2;\n display: block;\n margin: 1pc 4% 0pc 4%;\n padding: 0.5pc 0.5pc 0.5pc 0.5pc;\n }\n\n div.blurb img,\n p.blurb img\n {\n padding: 1pt;\n }\n\n/*=============================================================================\nVariable Lists\n=============================================================================*/\n\n div.variablelist\n {\n margin: 1em 0;\n }\n\n /* Make the terms in definition lists bold */\n div.variablelist dl dt,\n span.term\n {\n font-weight: bold;\n font-size: 10pt;\n }\n\n div.variablelist table tbody tr td\n {\n text-align: left;\n vertical-align: top;\n padding: 0em 2em 0em 0em;\n font-size: 10pt;\n margin: 0em 0em 0.5em 0em;\n line-height: 1;\n }\n\n div.variablelist dl dt\n {\n margin-bottom: 0.2em;\n }\n\n div.variablelist dl dd\n {\n margin: 0em 0em 0.5em 2em;\n font-size: 10pt;\n }\n\n div.variablelist table tbody tr td p,\n div.variablelist dl dd p\n {\n margin: 0em 0em 0.5em 0em;\n line-height: 1;\n }\n\n/*=============================================================================\nMisc\n=============================================================================*/\n\n /* Title of books and articles in bibliographies */\n span.title\n {\n font-style: italic;\n }\n\n span.underline\n {\n text-decoration: underline;\n }\n\n span.strikethrough\n {\n text-decoration: line-through;\n }\n\n /* Copyright, Legal Notice */\n div div.legalnotice p\n {\n text-align: left\n }\n\n/*=============================================================================\nColors\n=============================================================================*/\n\n @media screen\n {\n body {\n background-color: #FFFFFF;\n color: #000000;\n }\n\n /* Syntax Highlighting */\n .property,\n .highlight .k,\n .highlight .kc,\n .highlight .kd,\n .highlight .kn,\n .highlight .kp,\n .highlight .kr,\n .highlight .kt,\n .keyword { color: #0000AA; }\n\n .highlight .n,\n .highlight .na,\n .highlight .nb,\n .highlight .bp,\n .highlight .nc,\n .highlight .no,\n .highlight .nd,\n .highlight .ni,\n .highlight .ne,\n .highlight .nf,\n .highlight .py,\n .highlight .nl,\n .highlight .nn,\n .highlight .nx,\n .highlight .nt,\n .highlight .nv,\n .highlight .vc,\n .highlight .vg,\n .highlight .vi,\n .identifier { color: #000000; }\n\n .special { color: #707070; }\n\n .highlight .cp,\n .preprocessor { color: #402080; }\n\n .highlight .sc\n .char { color: teal; }\n\n .highlight .c,\n .highlight .ch,\n .highlight .cm,\n .highlight .cp,\n .highlight .cpf,\n .highlight .c1,\n .highlight .cs,\n .highlight .sd,\n .highlight .sh,\n .comment { color: #800000; }\n\n .highlight .s,\n .highlight .sa,\n .highlight .sb,\n .highlight .dl,\n .highlight .s2,\n .highlight .se,\n .highlight .si,\n .highlight .sx,\n .highlight .sr,\n .highlight .s1,\n .highlight .ss,\n .string { color: teal; }\n\n .highlight .m,\n .highlight .mf,\n .highlight .mh,\n .highlight .mi,\n .highlight .mo,\n .number { color: teal; }\n\n .highlight,\n .white_bkd { background-color: #FFFFFF; }\n\n .highlight .hll,\n .dk_grey_bkd { background-color: #999999; }\n\n /* Links */\n a, a .keyword, a .identifier, a .special, a .preprocessor\n a .char, a .comment, a .string, a .number\n {\n color: #005a9c;\n }\n\n a:visited, a:visited .keyword, a:visited .identifier,\n a:visited .special, a:visited .preprocessor a:visited .char,\n a:visited .comment, a:visited .string, a:visited .number\n {\n color: #9c5a9c;\n }\n\n h1 a, h2 a, h3 a, h4 a, h5 a, h6 a,\n h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover,\n h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited\n {\n text-decoration: none; /* no underline */\n color: #000000;\n }\n\n /* Copyright, Legal Notice */\n .copyright\n {\n color: #666666;\n font-size: small;\n }\n\n div div.legalnotice p\n {\n color: #666666;\n }\n\n /* Program listing */\n pre.synopsis\n {\n border: 1px solid #DCDCDC;\n }\n\n div.highlight,\n .programlisting,\n .screen\n {\n border: 1px solid #DCDCDC;\n }\n\n td .programlisting,\n td .screen\n {\n border: 0px solid #DCDCDC;\n }\n\n /* Blurbs */\n div.note,\n div.tip,\n div.important,\n div.caution,\n div.warning,\n div.blurb,\n p.blurb\n {\n border: 1px solid #DCDCDC;\n }\n\n /* Table of contents */\n div.toc\n {\n border: 1px solid #DCDCDC;\n }\n\n /* Tables */\n div.informaltable table tr td,\n div.table table tr td\n {\n border: 1px solid #DCDCDC;\n }\n\n div.informaltable table tr th,\n div.table table tr th\n {\n background-color: #F0F0F0;\n border: 1px solid #DCDCDC;\n }\n\n .copyright-footer\n {\n color: #8F8F8F;\n }\n\n /* Misc */\n span.highlight\n {\n color: #00A000;\n }\n }\n\n @media print\n {\n /* Links */\n a\n {\n color: black;\n }\n\n a:visited\n {\n color: black;\n }\n\n .spirit-nav\n {\n display: none;\n }\n\n /* Program listing */\n pre.synopsis\n {\n border: 1px solid gray;\n }\n\n div.highlight,\n .programlisting,\n .screen\n {\n border: 1px solid gray;\n }\n\n td .programlisting,\n td .screen\n {\n border: 0px solid #DCDCDC;\n }\n\n /* Table of contents */\n div.toc\n {\n border: 1px solid gray;\n }\n\n .informaltable table,\n .table table\n {\n border: 1px solid gray;\n border-collapse: collapse;\n }\n\n /* Tables */\n div.informaltable table tr td,\n div.table table tr td\n {\n border: 1px solid gray;\n }\n\n div.informaltable table tr th,\n div.table table tr th\n {\n border: 1px solid gray;\n }\n\n table.simplelist tr td\n {\n border: none !important;\n }\n\n /* Misc */\n span.highlight\n {\n font-weight: bold;\n }\n }\n\n/*=============================================================================\nImages\n=============================================================================*/\n\n span.inlinemediaobject img\n {\n vertical-align: middle;\n }\n\n/*==============================================================================\nSuper and Subscript: style so that line spacing isn't effected, see\nhttp://www.adobe.com/cfusion/communityengine/index.cfm?event=showdetails&productId=1&postId=5341\n==============================================================================*/\n\nsup,\nsub {\nheight: 0;\nline-height: 1;\nvertical-align: baseline;\nposition: relative;\n\n}\n\n/* For internet explorer: */\n\n* html sup,\n* html sub {\nvertical-align: bottom;\n}\n\nsup {\nbottom: 1ex;\n}\n\nsub {\ntop: .5ex;\n}\n\n/*==============================================================================\nIndexes: pretty much the same as the TOC.\n==============================================================================*/\n\n .index\n {\n font-size: 80%;\n padding-top: 0px;\n padding-bottom: 0px;\n margin-top: 0px;\n margin-bottom: 0px;\n margin-left: 0px;\n }\n\n .index ul\n {\n padding-left: 3em;\n }\n\n .index p\n {\n padding: 2px;\n margin: 2px;\n }\n\n .index-entry-level-0\n {\n font-weight: bold;\n }\n\n .index em\n {\n font-weight: bold;\n }\n\n\n/*==============================================================================\nAlignment and coloring use 'role' feature, available from Quickbook 1.6 up.\nAdded from Niall Douglas for role color and alignment.\nhttp://article.gmane.org/gmane.comp.lib.boost.devel/243318\n*/\n\n/* Add text alignment (see http://www.w3schools.com/cssref/pr_text_text-align.asp) */\nspan.aligncenter\n{\n display: inline-block; width: 100%; text-align: center;\n}\nspan.alignright\n{\n display: inline-block; width: 100%; text-align: right;\n}\n/* alignleft is the default. */\nspan.alignleft\n{\n display: inline-block; width: 100%; text-align: left;\n}\n\n/* alignjustify stretches the word spacing so that each line has equal width\nwithin a chosen fraction of page width (here arbitrarily 20%).\n*Not* useful inside table items as the column width remains the total string width.\nNor very useful, except to temporarily restrict the width.\n*/\nspan.alignjustify\n{\n display: inline-block; width: 20%; text-align: justify;\n}\n\n/* Text colors.\nNames at http://www.w3.org/TR/2002/WD-css3-color-20020219/ 4.3. X11 color keywords.\nQuickbook Usage: [role red Some red text]\n\n*/\nspan.red { inline-block; color: red; }\nspan.green { color: green; }\nspan.lime { color: #00FF00; }\nspan.blue { color: blue; }\nspan.navy { color: navy; }\nspan.yellow { color: yellow; }\nspan.magenta { color: magenta; }\nspan.indigo { color: #4B0082; }\nspan.cyan { color: cyan; }\nspan.purple { color: purple; }\nspan.gold { color: gold; }\nspan.silver { color: silver; } /* lighter gray */\nspan.gray { color: #808080; } /* light gray */\n" }, { "path": "doc/src/docutils.css", "content": "/*\n:Author: David Goodger\n:Contact: goodger@python.org\n:Date: $Date$\n:Revision: $Revision$\n:Copyright: This stylesheet has been placed in the public domain.\n\nDefault cascading style sheet for the HTML output of Docutils.\n\nSee http://docutils.sf.net/docs/howto/html-stylesheets.html for how to\ncustomize this style sheet.\n*/\n\n/* used to remove borders from tables and images */\n.borderless, table.borderless td, table.borderless th {\n border: 0 }\n\ntable.borderless td, table.borderless th {\n /* Override padding for \"table.docutils td\" with \"! important\".\n The right padding separates the table cells. */\n padding: 0 0.5em 0 0 ! important }\n\n.first {\n /* Override more specific margin styles with \"! important\". */\n margin-top: 0 ! important }\n\n.last, .with-subtitle {\n margin-bottom: 0 ! important }\n\n.hidden {\n display: none }\n\na.toc-backref {\n text-decoration: none ;\n color: black }\n\nblockquote.epigraph {\n margin: 2em 5em ; }\n\ndl.docutils dd {\n margin-bottom: 0.5em }\n\n/* Uncomment (and remove this text!) to get bold-faced definition list terms\ndl.docutils dt {\n font-weight: bold }\n*/\n\ndiv.abstract {\n margin: 2em 5em }\n\ndiv.abstract p.topic-title {\n font-weight: bold ;\n text-align: center }\n\ndiv.admonition, div.attention, div.caution, div.danger, div.error,\ndiv.hint, div.important, div.note, div.tip, div.warning {\n margin: 2em ;\n border: medium outset ;\n padding: 1em }\n\ndiv.admonition p.admonition-title, div.hint p.admonition-title,\ndiv.important p.admonition-title, div.note p.admonition-title,\ndiv.tip p.admonition-title {\n font-weight: bold ;\n font-family: sans-serif }\n\ndiv.attention p.admonition-title, div.caution p.admonition-title,\ndiv.danger p.admonition-title, div.error p.admonition-title,\ndiv.warning p.admonition-title {\n color: red ;\n font-weight: bold ;\n font-family: sans-serif }\n\n/* Uncomment (and remove this text!) to get reduced vertical space in\n compound paragraphs.\ndiv.compound .compound-first, div.compound .compound-middle {\n margin-bottom: 0.5em }\n\ndiv.compound .compound-last, div.compound .compound-middle {\n margin-top: 0.5em }\n*/\n\ndiv.dedication {\n margin: 2em 5em ;\n text-align: center ;\n font-style: italic }\n\ndiv.dedication p.topic-title {\n font-weight: bold ;\n font-style: normal }\n\ndiv.figure {\n margin-left: 2em ;\n margin-right: 2em }\n\ndiv.footer, div.header {\n clear: both;\n font-size: smaller }\n\ndiv.line-block {\n display: block ;\n margin-top: 1em ;\n margin-bottom: 1em }\n\ndiv.line-block div.line-block {\n margin-top: 0 ;\n margin-bottom: 0 ;\n margin-left: 1.5em }\n\ndiv.sidebar {\n margin-left: 1em ;\n border: medium outset ;\n padding: 1em ;\n background-color: #ffffee ;\n width: 40% ;\n float: right ;\n clear: right }\n\ndiv.sidebar p.rubric {\n font-family: sans-serif ;\n font-size: medium }\n\ndiv.system-messages {\n margin: 5em }\n\ndiv.system-messages h1 {\n color: red }\n\ndiv.system-message {\n border: medium outset ;\n padding: 1em }\n\ndiv.system-message p.system-message-title {\n color: red ;\n font-weight: bold }\n\ndiv.topic {\n margin: 2em }\n\nh1.section-subtitle, h2.section-subtitle, h3.section-subtitle,\nh4.section-subtitle, h5.section-subtitle, h6.section-subtitle {\n margin-top: 0.4em }\n\nh1.title {\n text-align: center }\n\nh2.subtitle {\n text-align: center }\n\nhr.docutils {\n width: 75% }\n\nimg.align-left {\n clear: left }\n\nimg.align-right {\n clear: right }\n\nol.simple, ul.simple {\n margin-bottom: 1em }\n\nol.arabic {\n list-style: decimal }\n\nol.loweralpha {\n list-style: lower-alpha }\n\nol.upperalpha {\n list-style: upper-alpha }\n\nol.lowerroman {\n list-style: lower-roman }\n\nol.upperroman {\n list-style: upper-roman }\n\np.attribution {\n text-align: right ;\n margin-left: 50% }\n\np.caption {\n font-style: italic }\n\np.credits {\n font-style: italic ;\n font-size: smaller }\n\np.label {\n white-space: nowrap }\n\np.rubric {\n font-weight: bold ;\n font-size: larger ;\n color: maroon ;\n text-align: center }\n\np.sidebar-title {\n font-family: sans-serif ;\n font-weight: bold ;\n font-size: larger }\n\np.sidebar-subtitle {\n font-family: sans-serif ;\n font-weight: bold }\n\np.topic-title {\n font-weight: bold }\n\npre.address {\n margin-bottom: 0 ;\n margin-top: 0 ;\n font-family: serif ;\n font-size: 100% }\n\npre.literal-block, pre.doctest-block {\n margin-left: 2em ;\n margin-right: 2em }\n\nspan.classifier {\n font-family: sans-serif ;\n font-style: oblique }\n\nspan.classifier-delimiter {\n font-family: sans-serif ;\n font-weight: bold }\n\nspan.interpreted {\n font-family: sans-serif }\n\nspan.option {\n white-space: nowrap }\n\nspan.pre {\n white-space: pre }\n\nspan.problematic {\n color: red }\n\nspan.section-subtitle {\n /* font-size relative to parent (h1..h6 element) */\n font-size: 80% }\n\ntable.citation {\n border-left: solid 1px gray;\n margin-left: 1px }\n\ntable.docinfo {\n margin: 2em 4em }\n\ntable.docutils {\n margin-top: 0.5em ;\n margin-bottom: 0.5em }\n\ntable.footnote {\n border-left: solid 1px black;\n margin-left: 1px }\n\ntable.docutils td, table.docutils th,\ntable.docinfo td, table.docinfo th {\n padding-left: 0.5em ;\n padding-right: 0.5em ;\n vertical-align: top }\n\ntable.docutils th.field-name, table.docinfo th.docinfo-name {\n font-weight: bold ;\n text-align: left ;\n white-space: nowrap ;\n padding-left: 0 }\n\nh1 tt.docutils, h2 tt.docutils, h3 tt.docutils,\nh4 tt.docutils, h5 tt.docutils, h6 tt.docutils {\n font-size: 100% }\n\nul.auto-toc {\n list-style-type: none }\n" }, { "path": "doc/src/minimal.css", "content": "/*\n\n Copyright (c) 2007 Beman Dawes\n\n Distributed under the Boost Software License, Version 1.0.\n See www.boost.org/LICENSE_1_0.txt\n \n*/\n\nbody {\n font-family: sans-serif;\n margin: 1em;\n max-width : 8.5in;\n }\n\ntable { margin: 0.5em; }\n\npre { background-color:#D7EEFF }\n\nins { background-color:#A0FFA0 }\ndel { background-color:#FFA0A0 }\n\n/*** end ***/" }, { "path": "doc/src/reference.css", "content": "/*============================================================================\n Copyright 2003-2004 Douglas Gregor\n Distributed under the Boost Software License, Version 1.0. (See accompany-\n ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n============================================================================*/\n\nPRE.synopsis { \n background-color: #e0ffff;\n border: thin solid blue;\n padding: 1em\n}" }, { "path": "doc/test/HTML4_symbols.qbk", "content": "[/ File Latin1_symbols.qbk\nCopyright 2006-2007 Paul A. Bristow.\nDistributed under the Boost Software License, Version 1.0.\n(See accompanying file LICENSE_1_0.txt or copy at\nhttp://www.boost.org/LICENSE_1_0.txt).\n]\n\n\n[/ Symbols and Greek letters (about 120) from HTML4 ]\n[/ File HTML4_symbols.qbk]\n[/ See http://www.htmlhelp.com/reference/html40/entities/symbols.html]\n[/ All (except 2 angle brackets) show OK on Firefox 2.0]\n\n[/ Also some miscellaneous math characters added to this list - see the end.]\n\n[/ To use, enclose the template name in square brackets.]\n\n[template fnof[]'''ƒ'''] [/ � Latin small f with hook = function = florin]\n[template Alpha[]'''Α'''] [/ ? Greek capital letter alpha]\n[template Beta[]'''Β'''] [/ ? Greek capital letter beta]\n[template Gamma[]'''Γ'''] [/ G Greek capital letter gamma]\n[template Delta[]'''Δ'''] [/ ? Greek capital letter delta]\n[template Epsilon[]'''Ε'''] [/ ? Greek capital letter epsilon]\n[template Zeta[]'''Ζ'''] [/ ? Greek capital letter zeta]\n[template Eta[]'''Η'''] [/ ? Greek capital letter eta]\n[template Theta[]'''Θ'''] [/ T Greek capital letter theta]\n[template Iota[]'''Ι'''] [/ ? Greek capital letter iota]\n[template Kappa[]'''Κ'''] [/ ? Greek capital letter kappa]\n[template Lambda[]'''Λ'''] [/ ? Greek capital letter lambda]\n[template Mu[]'''Μ'''] [/ ? Greek capital letter mu]\n[template Nu[]'''Ν'''] [/ ? Greek capital letter nu]\n[template Xi[]'''Ξ'''] [/ ? Greek capital letter xi]\n[template Omicron[]'''Ο'''] [/ ? Greek capital letter omicron]\n[template Pi[]'''Π'''] [/ ? Greek capital letter pi]\n[template Rho[]'''Ρ'''] [/ ? Greek capital letter rho]\n[template Sigma[]'''Σ'''] [/ S Greek capital letter sigma]\n[template Tau[]'''Τ'''] [/ ? Greek capital letter tau]\n[template Upsilon[]'''Υ'''] [/ ? Greek capital letter upsilon]\n[template Phi[]'''Φ'''] [/ F Greek capital letter phi]\n[template Chi[]'''Χ'''] [/ ? Greek capital letter chi]\n[template Psi[]'''Ψ'''] [/ ? Greek capital letter psi]\n[template Omega[]'''Ω'''] [/ O Greek capital letter omega]\n[template alpha[]'''α'''] [/ a Greek small letter alpha]\n[template beta[]'''β'''] [/ � Greek small letter beta]\n[template gamma[]'''γ'''] [/ ? Greek small letter gamma]\n[template delta[]'''δ'''] [/ d Greek small letter delta]\n[template epsilon[]'''ε'''] [/ e Greek small letter epsilon]\n[template zeta[]'''ζ'''] [/ ? Greek small letter zeta]\n[template eta[]'''η'''] [/ ? Greek small letter eta]\n[template theta[]'''θ'''] [/ ? Greek small letter theta]\n[template iota[]'''ι'''] [/ ? Greek small letter iota]\n[template kappa[]'''κ'''] [/ ? Greek small letter kappa]\n[template lambda[]'''λ'''] [/ ? Greek small letter lambda]\n[template mu[]'''μ'''] [/ � Greek small letter mu]\n[template nu[]'''ν'''] [/ ? Greek small letter nu]\n[template xi[]'''ξ'''] [/ ? Greek small letter xi]\n[template omicron[]'''ο'''] [/ ? Greek small letter omicron]\n[template pi[]'''π'''] [/ p Greek small letter pi]\n[template rho[]'''ρ'''] [/ ? Greek small letter rho]\n[template sigmaf[]'''ς'''] [/ ? Greek small letter final sigma]\n[template sigma[]'''σ'''] [/ s Greek small letter sigma]\n[template tau[]'''τ'''] [/ t Greek small letter tau]\n[template upsilon[]'''υ'''] [/ ? Greek small letter upsilon]\n[template phi[]'''φ'''] [/ f Greek small letter phi]\n[template chi[]'''χ'''] [/ ? Greek small letter chi]\n[template psi[]'''ψ'''] [/ ? Greek small letter psi]\n[template omega[]'''ω'''] [/ ? Greek small letter omega]\n[template thetasym[]'''ϑ'''] [/ ? Greek small letter theta symbol]\n[template upsih[]'''ϒ'''] [/ ? Greek upsilon with hook symbol]\n[template piv[]'''ϖ'''] [/ ? Greek pi symbol]\n[template bull[]'''•'''] [/ � bullet = black small circle]\n[template hellip[]'''…'''] [/ � horizontal ellipsis = three dot leader]\n[template prime[]'''′'''] [/ ' prime = minutes = feet]\n[template Prime[]'''″'''] [/ ? double prime = seconds = inches]\n[template oline[]'''‾'''] [/ ? overline = spacing overscore]\n[template frasl[]'''⁄'''] [/ / fraction slash]\n[template weierp[]'''℘'''] [/ P script capital P = power set = Weierstrass p]\n[template image[]'''ℑ'''] [/ I blackletter capital I = imaginary part]\n[template real[]'''ℜ'''] [/ R blackletter capital R = real part symbol]\n[template trade[]'''™'''] [/ � trade mark sign]\n[template alefsym[]'''ℵ'''] [/ ? alef symbol = first transfinite cardinal]\n[template larr[]'''←'''] [/ ? leftwards arrow]\n[template uarr[]'''↑'''] [/ ? upwards arrow]\n[template rarr[]'''→'''] [/ ? rightwards arrow]\n[template darr[]'''↓'''] [/ ? downwards arrow]\n[template harr[]'''↔'''] [/ ? left right arrow]\n[template crarr[]'''↵'''] [/ ? downwards arrow with corner leftwards = CR]\n[template lArr[]'''⇐'''] [/ ? leftwards double arrow]\n[template uArr[]'''⇑'''] [/ ? upwards double arrow]\n[template rArr[]'''⇒'''] [/ ? rightwards double arrow]\n[template dArr[]'''⇓'''] [/ ? downwards double arrow]\n[template hArr[]'''⇔'''] [/ ? left right double arrow]\n[template forall[]'''∀'''] [/ ? for all]\n[template part[]'''∂'''] [/ ? partial differential]\n[template exist[]'''∃'''] [/ ? there exists]\n[template empty[]'''∅'''] [/ � empty set = null set = diameter]\n[template nabla[]'''∇'''] [/ ? nabla = backward difference]\n[template isin[]'''∈'''] [/ ? element of]\n[template notin[]'''∉'''] [/ ? not an element of]\n[template ni[]'''∋'''] [/ ? contains as member]\n[template prod[]'''∏'''] [/ ? n-ary product = product sign]\n[template sum[]'''∑'''] [/ ? n-ary summation]\n[template minus[]'''−'''] [/ - minus sign]\n[template lowast[]'''∗'''] [/ * asterisk operator]\n[template radic[]'''√'''] [/ v square root = radical sign]\n[template prop[]'''∝'''] [/ ? proportional to]\n[template infin[]'''∞'''] [/ 8 infinity]\n[template ang[]'''∠'''] [/ ? angle]\n[template and[]'''∧'''] [/ ? logical and = wedge]\n[template or[]'''∨'''] [/ ? logical or = vee]\n[template cap[]'''∩'''] [/ n intersection = cap]\n[template cup[]'''∪'''] [/ ? union = cup]\n[template int[]'''∫'''] [/ ? integral]\n[template there4[]'''∴'''] [/ ? therefore]\n[template sim[]'''∼'''] [/ ~ tilde operator = varies with = similar to]\n[template cong[]'''≅'''] [/ ? approximately equal to]\n[template asymp[]'''≈'''] [/ � almost equal to = asymptotic to]\n[template ne[]'''≠'''] [/ ? not equal to]\n[template equiv[]'''≡'''] [/ = identical to]\n[template le[]'''≤'''] [/ = less-than or equal to]\n[template ge[]'''≥'''] [/ = greater-than or equal to]\n[template subset[]'''⊂'''] [/ ? subset of]\n[template superset[]'''⊃'''] [/ ? superset of]\n[template nsubset[]'''⊄'''] [/ ? not a subset of]\n[template sube[]'''⊆'''] [/ ? subset of or equal to]\n[template supe[]'''⊇'''] [/ ? superset of or equal to]\n[template oplus[]'''⊕'''] [/ ? circled plus = direct sum]\n[template otimes[]'''⊗'''] [/ ? circled times = vector product]\n[template perp[]'''⊥'''] [/ ? up tack = orthogonal to = perpendicular]\n[template sdot[]'''⋅'''] [/ � dot operator]\n[template lceil[]'''⌈'''] [/ ? left ceiling = APL upstile]\n[template rceil[]'''⌉'''] [/ ? right ceiling]\n[template lfloor[]'''⌊'''] [/ ? left floor = APL downstile]\n[template rfloor[]'''⌋'''] [/ ? right floor]\n[template lang[]'''〈'''] [/ < left-pointing angle bracket = bra (Firefox shows ?)]\n[template rang[]'''〉'''] [/ > right-pointing angle bracket = ket (Firefox shows ?)]\n[template loz[]'''◊'''] [/ ? lozenge]\n[template spades[]'''♠'''] [/ ? black spade suit]\n[template clubs[]'''♣'''] [/ ? black club suit = shamrock]\n[template hearts[]'''♥'''] [/ ? black heart suit = valentine]\n[template diams[]'''♦'''] [/ ? black diamond suit]\n\n[/ Other symbols, not in the HTML4 list:]\n[template space[]''' ''']\n[template plusminus[]'''±'''] [/ ? plus or minus sign]\n\n\n[/ Symbols and accented letters from Latin-1]\n[/ File Latin1_symbols.qbk]\n[/ http://www.htmlhelp.com/reference/html40/entities/latin1.html ]\n[/ based on table Copyright 1998-2006 Liam Quinn.]\n[/ Glyphs of the characters ]\n[/ are available at the Unicode Consortium . ]\n\n[template nbsp[]''' '''] [/ no-break space = non-breaking space]\n[template iexcl[]'''¡'''] [/ inverted exclamation mark ]\n[template cent[]'''¢'''] [/ cent sign ]\n[template pound[]'''£'''] [/ pound sign ]\n[template curren[]'''¤'''] [/ currency sign ]\n[template yen[]'''¥'''] [/ yen sign = yuan sign ]\n[template brvbar[]'''¦'''] [/ broken vertical bar ]\n[template sectsign[]'''§'''] [/ section sign ]\n[template uml[]'''¨'''] [/ diaeresis ]\n[template copy[]'''©'''] [/ copyright ]\n[template ordf[]'''ª'''] [/ feminine ordinal indicator ]\n[template laquo[]'''«'''] [/ left-pointing double angle quotation mark = left pointing guillemet ]\n[template not[]'''¬'''] [/ not sign ]\n[template shy[]'''­'''] [/ soft hyphen = discretionary hyphen ]\n[template reg[]'''®'''] [/ registered sign = registered trade mark sign ]\n[template macron[]'''¯'''] [/ macron = spacing macron = overline = APL overbar ]\n[template deg[]'''°'''] [/ degree sign ]\n[template plusmn[]'''±'''] [/ plus-minus sign = plus-or-minus sign ]\n[template sup2[]'''²'''] [/ superscript two = superscript digit two = squared ]\n[template cubed[]'''³'''] [/ superscript three = superscript digit three = cubed ]\n[template acute[]'''´'''] [/ acute accent = spacing acute ]\n[template micro[]'''µ'''] [/ micro sign ]\n[template para[]'''¶'''] [/ pilcrow sign = paragraph sign ]\n[template middot[]'''·'''] [/ middle dot = Georgian comma = Greek middle dot ]\n[template cedil[]'''¸'''] [/ cedilla = spacing cedilla ]\n[template sup1[]'''¹'''] [/ superscript one = superscript digit one ]\n[template ordm[]'''º'''] [/ masculine ordinal indicator ]\n[template raquo[]'''»'''] [/ right-pointing double angle quotation mark = right pointing guillemet ]\n[template frac14[]'''¼'''] [/ vulgar fraction one quarter = fraction one quarter ]\n[template frac12[]'''½'''] [/ vulgar fraction one half = fraction one half ]\n[template frac34[]'''¾'''] [/vulgar fraction three quarters = fraction three quarters ]\n[template iquest[]'''¿'''] [/ inverted question mark = turned question mark ]\n[template Agrave[]'''À'''] [/ Latin capital letter A with grave = Latin capital letter A grave ]\n[template Aacute[]'''Á'''] [/ Latin capital letter A with acute = Latin capital letter A acute ]\n[template Acirc[]'''Â'''] [/ Latin capital letter A with circumflex ]\n[template Atilde[]'''Ã'''] [/Latin capital letter A with tilde ]\n[template Auml[]'''Ä'''] [/ Latin capital letter A with diaeresis ]\n[template Aring[]'''Å'''] [/ Latin capital letter A with ring above = Latin capital letter A ring ]\n[template AElig[]'''Æ'''] [/ Latin capital letter AE = Latin capital ligature AE ]\n[template Ccedil[]'''Ç'''] [/ Latin capital letter C with cedilla ]\n[template Egrave[]'''È'''] [/ Latin capital letter E with grave ]\n[template Eacute[]'''É'''] [/ Latin capital letter E with acute ]\n[template Ecirc[]'''Ê'''] [/ Latin capital letter E with circumflex ]\n[template Euml[]'''Ë'''] [/ Latin capital letter E with diaeresis ]\n[template Igrave[]'''Ì'''] [/ Latin capital letter I with grave ]\n[template Iacute[]'''Í'''] [/ Latin capital letter I with acute ]\n[template Icirc[]'''Î'''] [/ Latin capital letter I with circumflex ]\n[template Iuml[]'''Ï'''] [/ Latin capital letter I with diaeresis ]\n[template ETH[]'''Ð'''] [/ Latin capital letter ETH ]\n[template Ntilde[]'''Ñ'''] [/ Latin capital letter N with tilde ]\n[template Ograve[]'''Ò'''] [/ Latin capital letter O with grave]\n[template Oacute[]'''Ó'''] [/ Latin capital letter O with acute ]\n[template Ocirc[]'''Ô'''] [/ Latin capital letter O with circumflex ]\n[template Otilde[]'''Õ'''] [/ Latin capital letter O with tilde ]\n[template Ouml[]'''Ö'''] [/ Latin capital letter O with diaeresis ]\n[template times[]'''×'''] [/ multiplication sign ]\n[template Oslash[]'''Ø'''] [/ Latin capital letter O with stroke = Latin capital letter O slash ]\n[template Ugrave[]'''Ù'''] [/ Latin capital letter U with grave ]\n[template Uacute[]'''Ú'''] [/ Latin capital letter U with acute ]\n[template Ucirc[]'''Û'''] [/ Latin capital letter U with circumflex ]\n[template Uuml[]'''Ü'''] [/ Latin capital letter U with diaeresis ]\n[template Yacute[]'''Ý'''] [/ Latin capital letter Y with acute ]\n[template THORN[]'''Þ'''] [/ Latin capital letter THORN ]\n[template szlig[]'''ß'''] [/ Latin small letter sharp s = ess-zed ]\n[template agrave[]'''à'''] [/ Latin small letter a with grave = Latin small letter a grave ]\n[template aacute[]'''á'''] [/ Latin small letter a with acute ]\n[template acirc[]'''â'''] [/ Latin small letter a with circumflex ]\n[template atilde[]'''ã'''] [/ Latin small letter a with tilde ]\n[template auml[]'''ä'''] [/ Latin small letter a with diaeresis ]\n[template aring[]'''å'''] [/ Latin small letter a with ring above = Latin small letter a ring ]\n[template aelig[]'''æ'''] [/ Latin small letter ae = Latin small ligature ae ]\n[template ccedil[]'''ç'''] [/ Latin small letter c with cedilla ]\n[template egrave[]'''è'''] [/ Latin small letter e with grave ]\n[template eacute[]'''é'''] [/ Latin small letter e with acute ]\n[template ecirc[]'''ê'''] [/ Latin small letter e with circumflex ]\n[template euml[]'''ë'''] [/ Latin small letter e with diaeresis ]\n[template igrave[]'''ì'''] [/ Latin small letter i with grave ]\n[template iacute[]'''í'''] [/ Latin small letter i with acute ]\n[template icirc[]'''î'''] [/ Latin small letter i with circumflex ]\n[template iuml[]'''ï'''] [/ Latin small letter i with diaeresis ]\n[template eth[]'''ð'''] [/ Latin small letter eth ]\n[template ntilde[]'''ñ'''] [/ Latin small letter n with tilde ]\n[template ograve[]'''ò'''] [/Latin small letter o with grave ]\n[template oacute[]'''ó'''] [/ Latin small letter o with acute ]\n[template ocirc[]'''ô'''] [/ Latin small letter o with circumflex ]\n[template otilde[]'''õ'''] [/ Latin small letter o with tilde ]\n[template ouml[]'''ö'''] [/ Latin small letter o with diaeresis ]\n[template divide[]'''÷'''] [/ division sign ]\n[template oslash[]'''ø'''] [/ Latin small letter o with stroke = Latin small letter o slash ]\n[template ugrave[]'''ù'''] [/ Latin small letter u with grave ]\n[template uacute[]'''ú'''] [/ Latin small letter u with acute ]\n[template ucirc[]'''û'''] [/ Latin small letter u with circumflex ]\n[template uuml[]'''ü'''] [/ Latin small letter u with diaeresis ]\n[template yacute[]'''ý'''] [/ Latin small letter y with acute ]\n[template thorn[]'''þ'''] [/ Latin small letter thorn ]\n[template yuml[]'''ÿ'''] [/ Latin small letter y with diaeresis ]\n\n\n\n" }, { "path": "doc/test/Jamfile.v2", "content": "# Copyright John Maddock 2008. Use, modification, and distribution are\n# subject to the Boost Software License, Version 1.0. (See accompanying\n# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\nimport os ;\nimport common ;\nimport doxygen ;\nusing quickbook ;\nimport modules ;\n\npath-constant images_location : html ;\n\n#\n# Accumulators docs are dependent upon\n# latex dvips and ps being in your PATH.\n# This is true for most Unix installs, but\n# not on Win32, where you will need to install\n# MkTex and Ghostscript and add these tools\n# to your path.\n#\nmake latex.check : : @check-latex ;\nactions check-latex\n{\n latex -version > latex.version\n}\n\nmake dvips.check : : @check-dvips ;\nactions check-dvips\n{\n dvips -version > dvips.version\n}\n\nmake gs.check : : @check-gs ;\n\nimport os ;\n\nif [ os.name ] = \"NT\"\n{\n actions check-gs\n {\n gswin32c -version > gs.version\n }\n}\nelse\n{\n actions check-gs\n {\n gs -version > gs.version\n }\n}\n\n\n# Use Doxygen to emit a tagfile with the definition of depends_on<>. That\n# tagfile will be used by Doxygen below when generating the Statistics Library\n# Reference. This is all so that the Doxygen-generated documentation for the\n# features shows the dependency relationships between them.\ndoxygen tagfile\n :\n ../../boost/accumulators/framework/depends_on.hpp\n ../../boost/accumulators/framework/extractor.hpp\n :\n MACRO_EXPANSION=YES\n EXPAND_ONLY_PREDEF=YES\n GENERATE_TAGFILE=accumulators.tag\n \"PREDEFINED=\\\"BOOST_ACCUMULATORS_DOXYGEN_INVOKED=1\\\" \\\\\n \\\"BOOST_PP_REPEAT_FROM_TO(a,b,c,d)=\\\" \\\\\n \\\"BOOST_PP_ENUM_PARAMS(a,b)=b ## 1, b ## 2, ...\\\"\"\n latex.check\n dvips.check\n gs.check\n ;\n\n# Generate the HTML form of the stats documentation, as this causes Doxygen to\n# generate .png images for the LaTeX formulas embedded in the doc comments.\ndoxygen statsdoc.html\n :\n weighted_tail_quantile.hpp\n :\n latex.check\n dvips.check\n gs.check\n ;\n\nif [ os.name ] = NT\n{\n CP = copy /y ;\n MKDIR = mkdir ;\n FROM = \\\\..\\\\..\\\\..\\\\html\\\\statsdoc\\\\*.png ;\n TOHTML = .\\\\html\\\\images\\\\accumulators ;\n TOPDF = \\\\images\\\\accumulators ;\n}\nelse\n{\n CP = cp ;\n MKDIR = mkdir -p ;\n FROM = /../../html/statsdoc/*.png ;\n TOHTML = ./html/images/accumulators ;\n TOPDF = /images/accumulators ;\n}\n\nactions copy-latex-pngs\n{\n $(MKDIR) $(TOHTML)\n $(MKDIR) $(<:D)$(TOPDF)\n $(CP) $(<:D)$(FROM) $(TOHTML)\n $(CP) $(<:D)$(FROM) $(<:D)$(TOPDF)\n echo \"Stamped\" > \"$(<)\"\n}\n\n# This causes the png files built above to be copied into the\n# html/images/accumulators directory.\nmake statsdoclatex.tag\n : statsdoc.html\n : @copy-latex-pngs\n ;\n\ndoxygen statsdoc\n :\n weighted_tail_quantile.hpp\n :\n EXTRACT_ALL=YES\n \"PREDEFINED=\\\"BOOST_ACCUMULATORS_DOXYGEN_INVOKED=1\\\" \\\\\n \\\"BOOST_PP_REPEAT_FROM_TO(a,b,c,d)=\\\" \\\\\n \\\"BOOST_PP_REPEAT(a,b,c)=\\\" \\\\\n \\\"BOOST_PARAMETER_KEYWORD(a,b)=\\\\\n namespace a { struct b {}; } \\\\\n boost::parameter::keyword const b;\\\" \\\\\n \\\"BOOST_PP_ENUM_PARAMS(a,b)=b ## 1, b ## 2, ...\\\"\"\n HIDE_UNDOC_MEMBERS=NO\n EXTRACT_PRIVATE=NO\n ENABLE_PREPROCESSING=YES\n MACRO_EXPANSION=YES\n EXPAND_ONLY_PREDEF=YES\n SEARCH_INCLUDES=NO\n TAGFILES=accumulators.tag\n boost.doxygen.header.prefix=doc\n boost.doxygen.formuladir=images/accumulators/\n \"Statistics Library Reference\"\n tagfile\n statsdoclatex.tag\n latex.check\n dvips.check\n gs.check\n ;\n\nif htmlhelp in [ modules.peek : ARGV ]\n{\n\t#\n\t# Start with a rule to convert htmlhelp project into\n\t# compiled help file:\n\t#\n\tmake htmlhelp/htmlhelp.chm : standalone : @hhc ;\n\tactions ignore hhc\n\t{\n\t\thhc htmlhelp/htmlhelp.hhp\n\t}\n\t#\n\t# These install rules copy our images into a subdirectory of the created\n\t# htmlhelp project directory: unfortunately hhc.exe will only embed\n\t# images in a subdirectory of the project root.\n\t#\n\tinstall htmlhelp1 : [ glob html/images/*.png ] : htmlhelp/images ;\n\tinstall htmlhelp1a : [ glob html/images/*.svg ] : htmlhelp/images ;\n\tinstall htmlhelp2 : [ glob html/images/accumulators/*.png ] : statsdoc htmlhelp/images/accumulators ;\n\tinstall htmlhelp3 : [ glob ../src/images/*.png ] : statsdoc htmlhelp/images ;\n\tinstall htmlhelp4 : [ glob ../src/images/callouts/*.png ] : statsdoc htmlhelp/images/callouts ;\n}\n\nxml test : test.qbk ;\nboostbook standalone\n :\n test\n :\n statsdoc\n htmlhelp:htmlhelp1\n htmlhelp:htmlhelp1a\n htmlhelp:htmlhelp2\n htmlhelp:htmlhelp3\n htmlhelp:htmlhelp4\n\n # HTML options first:\n #======================================================================\n\n toc.max.depth=2\n toc.section.depth=2\n chunk.section.depth=1\n boost.root=../../..\n navig.graphics=1\n boost.mathjax=1\n $(images_location)/..\n\n\n # PDF Options:\n #======================================================================\n pdf:img.src.path=$(images_location)/\n pdf:boost.url.prefix=http://www.boost.org/doc/libs/release/doc/test/html\n\n # HTML Help Options:\n #======================================================================\n #htmlhelp:img.src.path=../html\n htmlhelp:boost.url.prefix=http://www.boost.org/doc/libs/release/doc/test/html\n htmlhelp:htmlhelp.chm=test.chm\n ;\n\n\ninstall pdfinstall : standalone/pdf : . PDF ;\nexplicit pdfinstall ;\n" }, { "path": "doc/test/array.xml", "content": "
\n Introduction \n\n \n \n\n The C++ Standard Template Library STL as part of the C++\n Standard Library provides a framework for processing algorithms on\n different kind of containers. However, ordinary arrays don't\n provide the interface of STL containers (although, they provide\n the iterator interface of STL containers).\n\n As replacement for ordinary arrays, the STL provides class\n std::vector. However,\n std::vector<> provides\n the semantics of dynamic arrays. Thus, it manages data to be able\n to change the number of elements. This results in some overhead in\n case only arrays with static size are needed.\n\n In his book, Generic Programming and the\n STL, Matthew H. Austern introduces a useful wrapper\n class for ordinary arrays with static size, called\n block. It is safer and has no worse performance than\n ordinary arrays. In The C++ Programming\n Language, 3rd edition, Bjarne Stroustrup introduces a\n similar class, called c_array, which I (Nicolai Josuttis) present\n slightly modified in my book The C++ Standard Library -\n A Tutorial and Reference, called\n carray. This is the essence of these approaches\n spiced with many feedback from boost.\n\n After considering different names, we decided to name this\n class simply array.\n\n Note that this class is suggested to be part of the next\n Technical Report, which will extend the C++ Standard (see\n http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).\n\n Class array fulfills most\n but not all of the requirements of \"reversible containers\" (see\n Section 23.1, [lib.container.requirements] of the C++\n Standard). The reasons array is not an reversible STL container is\n because:\n \n No constructors are provided.\n Elements may have an undetermined initial value (see ).\n swap() has no constant complexity.\n size() is always constant, based on the second template argument of the type.\n The container provides no allocator support.\n \n \n\n It doesn't fulfill the requirements of a \"sequence\" (see Section 23.1.1, [lib.sequence.reqmts] of the C++ Standard), except that:\n \n front() and back() are provided.\n operator[] and at() are provided.\n \n \n
\n \n\n\n" }, { "path": "doc/test/array1.xml", "content": "\n
\n \n \n \n\n \n STL compliant container wrapper for arrays of constant size\n \n \n T\n \n \n T*\n \n \n const T*\n \n \n \n std::reverse_iterator<iterator>\n \n \n \n \n std::reverse_iterator<const_iterator>\n \n \n \n T&\n \n \n const T&\n \n \n std::size_t\n \n \n std::ptrdiff_t\n \n\n \n size_type\n N\n \n\n \n \n \n const array<U, N>&\n \n \n \n \n std::copy(rhs.begin(),rhs.end(), begin())\n \n \n \n \n\n \n \n \n iterator\n \n \n const_iterator\n \n\n \n iterator for the first element\n \n \n will not throw\n \n \n\n \n \n iterator\n \n \n const_iterator\n \n\n \n iterator for position after the last element\n \n \n will not throw\n \n \n \n\n \n \n \n reverse_iterator\n \n \n const_reverse_iterator\n \n\n \n reverse iterator for the first element of reverse iteration\n \n \n\n \n \n reverse_iterator\n \n \n const_reverse_iterator\n \n\n \n reverse iterator for position after the last element in reverse iteration\n \n \n \n\n \n \n size_type\n \n \n N\n \n \n \n \n bool\n \n \n N==0\n \n \n \n will not throw\n \n \n \n size_type\n \n \n N\n \n \n \n will not throw\n \n \n \n\n \n \n \n reference\n \n size_type\n \n \n\n \n const_reference\n \n size_type\n \n \n\n \n \n i < N\n \n \n \n \n element with index i\n \n \n \n will not throw.\n \n \n\n \n \n reference\n \n size_type\n \n \n\n \n const_reference\n \n size_type\n \n \n\n \n \n element with index i\n \n \n \n \n \n std::range_error\n if i >= N\n \n \n \n\n \n \n reference\n \n \n const_reference\n \n \n \n N > 0\n \n \n \n the first element\n \n \n will not throw\n \n \n\n \n \n reference\n \n \n const_reference\n \n \n \n N > 0\n \n \n \n the last element\n \n \n will not throw\n \n \n\n \n const T*\n \n \n elems\n \n \n \n will not throw\n \n \n\n \n T*\n \n \n elems\n \n \n \n will not throw\n \n \n \n\n \n \n void\n \n array<T, N>&\n \n \n \n \n std::swap_ranges(begin(), end(), other.begin())\n \n \n \n \n \n linear in N\n \n \n \n \n void\n \n const T&\n \n \n \n \n std::fill_n(begin(), N, value)\n \n \n \n \n \n\n \n \n T\n \n\n \n \n \n\n void\n\n \n array<T, N>&\n \n \n array<T, N>&\n \n\n \n \n \n x.swap(y)\n \n \n \n \n will not throw.\n \n \n \n\n \n \n \n\n bool\n\n \n const array<T, N>&\n \n \n const array<T, N>&\n \n\n \n \n \n std::equal(x.begin(), x.end(), y.begin())\n \n \n \n \n\n \n \n\n bool\n\n \n const array<T, N>&\n \n \n const array<T, N>&\n \n\n \n \n !(x == y)\n \n \n \n\n \n \n\n bool\n\n \n const array<T, N>&\n \n \n const array<T, N>&\n \n\n \n \n \n std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end())\n \n \n \n \n\n \n \n\n bool\n\n \n const array<T, N>&\n \n \n const array<T, N>&\n \n\n \n \n y < x\n \n \n \n\n \n \n\n bool\n\n \n const array<T, N>&\n \n \n const array<T, N>&\n \n\n \n \n !(y < x)\n \n \n \n\n \n \n\n bool\n\n \n const array<T, N>&\n \n \n const array<T, N>&\n \n\n \n \n !(x < y)\n \n \n \n \n \n \n
\n\n\n" }, { "path": "doc/test/array2.xml", "content": "
\n Design Rationale\n\n \n There was an important design tradeoff regarding the\n constructors: We could implement array as an \"aggregate\" (see\n Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would\n mean:\n \n \n \n An array can be initialized with a\n brace-enclosing, comma-separated list of initializers for the\n elements of the container, written in increasing subscript\n order:\n \n\n \n boost::array<int,4> a = { { 1, 2, 3 } };\n \n\n \n Note that if there are fewer elements in the\n initializer list, then each remaining element gets\n default-initialized (thus, it has a defined value).\n \n \n \n \n\n \n However, this approach has its drawbacks: \n passing no initializer list means that the elements\n have an indetermined initial value\n , because the rule says\n that aggregates may have:\n \n \n No user-declared constructors.\n \n \n No private or protected non-static data members.\n \n \n No base classes.\n \n \n No virtual functions.\n \n \n \n\n Nevertheless, The current implementation uses this approach.\n\n \n Note that for standard conforming compilers it is possible to\n use fewer braces (according to 8.5.1 (11) of the Standard). That is,\n you can initialize an array as follows:\n \n\n \n boost::array<int,4> a = { 1, 2, 3 };\n \n\n \n I'd appreciate any constructive feedback. \n Please note: I don't have time to read all boost\n mails. Thus, to make sure that feedback arrives to me, please send\n me a copy of each mail regarding this class.\n \n \n\n \n The code is provided \"as is\" without expressed or implied\n warranty.\n \n\n
\n\n\n" }, { "path": "doc/test/array3.xml", "content": "
\n For more information...\n \n To find more details about using ordinary arrays in C++ and\n the framework of the STL, see e.g.\n\n \n The C++ Standard Library - A Tutorial and Reference\n by Nicolai M. Josuttis\n Addison Wesley Longman, 1999\n ISBN 0-201-37926-0\n \n \n\n \n \n Home Page of Nicolai\n Josuttis\n \n \n
\n\n" }, { "path": "doc/test/array4.xml", "content": "
\n Acknowledgements\n\n Doug Gregor ported the documentation to the BoostBook format.\n
\n" }, { "path": "doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html", "content": "\n\n\nGlobal weighted_tail_quantile\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
\n

Global weighted_tail_quantile

\n

boost::accumulators::extract::weighted_tail_quantile

\n
\n

Synopsis

\n
// In header: <doc/test/weighted_tail_quantile.hpp>\n\nextractor< tag::quantile > const weighted_tail_quantile;
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330053.html", "content": "\n\n\nStruct template weighted_tail_quantile_impl\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
\n

Struct template weighted_tail_quantile_impl

\n

boost::accumulators::impl::weighted_tail_quantile_impl — Tail quantile estimation based on order statistics of weighted samples (for both left and right tails).

\n
\n

Synopsis

\n
// In header: <doc/test/weighted_tail_quantile.hpp>\n\ntemplate<typename Sample, typename Weight, typename LeftRight> \nstruct weighted_tail_quantile_impl {\n  // types\n  typedef numeric::functional::average< Weight, std::size_t >::result_type float_type; \n  typedef Sample                                                           result_type;\n\n  // construct/copy/destruct\n  weighted_tail_quantile_impl(dont_care);\n\n  // public member functions\n  template<typename Args> result_type result(Args const &) const;\n};
\n
\n

Description

\n

An estimator of tail quantiles with level based on order statistics of weighted samples are given by (left tail) and (right tail), where

\n
\n

Equation 1. 

\n
\n
\n


\n

and

\n
\n

Equation 2. 

\n
\n
\n


\n

being the number of samples and the sum of all weights.

\n

\n

\n
\n

\nweighted_tail_quantile_impl \n public\n construct/copy/destruct

\n
  1. weighted_tail_quantile_impl(dont_care);
\n
\n
\n

\nweighted_tail_quantile_impl public member functions

\n
  1. template<typename Args> result_type result(Args const & args) const;
\n
\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html", "content": "\n\n\nStruct template weighted_tail_quantile\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\n
\n
\n
\n
\n

Struct template weighted_tail_quantile

\n

boost::accumulators::tag::weighted_tail_quantile

\n
\n

Synopsis

\n
// In header: <doc/test/weighted_tail_quantile.hpp>\n\ntemplate<typename LeftRight> \nstruct weighted_tail_quantile : public boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >\n{\n};
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\n
\n\n\n" }, { "path": "doc/test/gold/boost/array.html", "content": "\n\n\nClass template array\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
\n

Class template array

\n

boost::array — STL compliant container wrapper for arrays of constant size

\n
\n

Synopsis

\n
// In header: <boost/array.hpp>\n\ntemplate<typename T, std::size_t N> \nclass array {\npublic:\n  // types\n  typedef T                                                                        value_type;            \n  typedef T*                                                                       iterator;              \n  typedef const T*                                                                 const_iterator;        \n  typedef \n                  std::reverse_iterator<iterator>\n                      reverse_iterator;      \n  typedef \n                  std::reverse_iterator<const_iterator>\n                const_reverse_iterator;\n  typedef T&                                                                       reference;             \n  typedef const T&                                                                 const_reference;       \n  typedef std::size_t                                                              size_type;             \n  typedef std::ptrdiff_t                                                           difference_type;       \n\n  // static constants\n  static const size_type static_size = N;\n\n  // construct/copy/destruct\n  template<typename U> array& operator=(const array<U, N>&);\n\n  // iterator support\n  iterator begin();\n  const_iterator begin() const;\n  iterator end();\n  const_iterator end() const;\n\n  // reverse iterator support\n  reverse_iterator rbegin();\n  const_reverse_iterator rbegin() const;\n  reverse_iterator rend();\n  const_reverse_iterator rend() const;\n\n  // capacity\n  size_type size();\n  bool empty();\n  size_type max_size();\n\n  // element access\n  reference operator[](size_type);\n  const_reference operator[](size_type) const;\n  reference at(size_type);\n  const_reference at(size_type) const;\n  reference front();\n  const_reference front() const;\n  reference back();\n  const_reference back() const;\n  const T* data() const;\n  T* c_array();\n\n  // modifiers\n  void swap(array<T, N>&);\n  void assign(const T&);\n  T elems[N];\n};\n\n// specialized algorithms\ntemplate<typename T, std::size_t N> void swap(array<T, N>&, array<T, N>&);\n\n// comparisons\ntemplate<typename T, std::size_t N> \n  bool operator==(const array<T, N>&, const array<T, N>&);\ntemplate<typename T, std::size_t N> \n  bool operator!=(const array<T, N>&, const array<T, N>&);\ntemplate<typename T, std::size_t N> \n  bool operator<(const array<T, N>&, const array<T, N>&);\ntemplate<typename T, std::size_t N> \n  bool operator>(const array<T, N>&, const array<T, N>&);\ntemplate<typename T, std::size_t N> \n  bool operator<=(const array<T, N>&, const array<T, N>&);\ntemplate<typename T, std::size_t N> \n  bool operator>=(const array<T, N>&, const array<T, N>&);
\n
\n

Description

\n
\n

\narray \n public\n construct/copy/destruct

\n
  1. \n
    template<typename U> array& operator=(const array<U, N>& other);
    \n
    \n\n\n\n\n\n

    Effects:

    		\n \n std::copy(rhs.begin(),rhs.end(), begin())\n \n
    \n
\n
\n
\n

\narray iterator support

\n
    \n
  1. \n
    iterator begin();\nconst_iterator begin() const;
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Returns:

    		iterator for the first element

    Throws:

    		will not throw
    \n
    2. \n
  2. \n
    iterator end();\nconst_iterator end() const;
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Returns:

    		iterator for position after the last element

    Throws:

    		will not throw
    \n
    3. \n
\n
\n
\n

\narray reverse iterator support

\n
    \n
  1. \n
    reverse_iterator rbegin();\nconst_reverse_iterator rbegin() const;
    \n
    \n\n\n\n\n\n

    Returns:

    		reverse iterator for the first element of reverse iteration
    \n
    2. \n
  2. \n
    reverse_iterator rend();\nconst_reverse_iterator rend() const;
    \n
    \n\n\n\n\n\n

    Returns:

    		reverse iterator for position after the last element in reverse iteration
    \n
    3. \n
\n
\n
\n

\narray capacity

\n
    \n
  1. \n
    size_type size();
    \n
    \n\n\n\n\n\n

    Returns:

    		\n N\n
    \n
    2. \n
  2. \n
    bool empty();
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Returns:

    		\n N==0\n

    Throws:

    		will not throw
    \n
    3. \n
  3. \n
    size_type max_size();
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Returns:

    		\n N\n

    Throws:

    		will not throw
    \n
    4. \n
\n
\n
\n

\narray element access

\n
    \n
  1. \n
    reference operator[](size_type i);\nconst_reference operator[](size_type i) const;
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

    Requires:

    		\n i < N\n

    Returns:

    		\n element with index i\n

    Throws:

    		will not throw.
    \n
    2. \n
  2. \n
    reference at(size_type i);\nconst_reference at(size_type i) const;
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Returns:

    		\n element with index i\n

    Throws:

    		\n \n std::range_error\n if i >= N\n
    \n
    3. \n
  3. \n
    reference front();\nconst_reference front() const;
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

    Requires:

    		\n N > 0\n

    Returns:

    		the first element

    Throws:

    		will not throw
    \n
    4. \n
  4. \n
    reference back();\nconst_reference back() const;
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

    Requires:

    		\n N > 0\n

    Returns:

    		the last element

    Throws:

    		will not throw
    \n
    5. \n
  5. \n
    const T* data() const;
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Returns:

    		\n elems\n

    Throws:

    		will not throw
    \n
    6. \n
  6. \n
    T* c_array();
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Returns:

    		\n elems\n

    Throws:

    		will not throw
    \n
    7. \n
\n
\n
\n

\narray modifiers

\n
    \n
  1. \n
    void swap(array<T, N>& other);
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Effects:

    		\n \n std::swap_ranges(begin(), end(), other.begin())\n \n

    Complexity:

    		\n linear in N\n
    \n
    2. \n
  2. \n
    void assign(const T& value);
    \n
    \n\n\n\n\n\n

    Effects:

    		\n \n std::fill_n(begin(), N, value)\n \n
    \n
    3. \n
\n
\n
\n

\narray specialized algorithms

\n
  1. \n
    template<typename T, std::size_t N> void swap(array<T, N>& x, array<T, N>& y);
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n

    Effects:

    		\n \n x.swap(y)\n \n

    Throws:

    		will not throw.
    \n
\n
\n
\n

\narray comparisons

\n
    \n
  1. \n
    template<typename T, std::size_t N> \n  bool operator==(const array<T, N>& x, const array<T, N>& y);
    \n
    \n\n\n\n\n\n

    Returns:

    		\n \n std::equal(x.begin(), x.end(), y.begin())\n \n
    \n
    2. \n
  2. \n
    template<typename T, std::size_t N> \n  bool operator!=(const array<T, N>& x, const array<T, N>& y);
    \n
    \n\n\n\n\n\n

    Returns:

    		\n !(x == y)\n
    \n
    3. \n
  3. \n
    template<typename T, std::size_t N> \n  bool operator<(const array<T, N>& x, const array<T, N>& y);
    \n
    \n\n\n\n\n\n

    Returns:

    		\n \n std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end())\n \n
    \n
    4. \n
  4. \n
    template<typename T, std::size_t N> \n  bool operator>(const array<T, N>& x, const array<T, N>& y);
    \n
    \n\n\n\n\n\n

    Returns:

    		\n y < x\n
    \n
    5. \n
  5. \n
    template<typename T, std::size_t N> \n  bool operator<=(const array<T, N>& x, const array<T, N>& y);
    \n
    \n\n\n\n\n\n

    Returns:

    		\n !(y < x)\n
    \n
    6. \n
  6. \n
    template<typename T, std::size_t N> \n  bool operator>=(const array<T, N>& x, const array<T, N>& y);
    \n
    \n\n\n\n\n\n

    Returns:

    		\n !(x < y)\n
    \n
    7. \n
\n
\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/accumulators.html", "content": "\n\n\nAccumulators Example Doxygen Documentation\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
Statistics Library Reference
\n
\n

\nStatistics Library Reference

\n
Header <doc/test/weighted_tail_quantile.hpp>
\n
\n
\n
namespace boost {\n  namespace accumulators {\n    namespace extract {\n      extractor< tag::quantile > const weighted_tail_quantile;\n    }\n    namespace impl {\n      template<typename Sample, typename Weight, typename LeftRight> \n        struct weighted_tail_quantile_impl;\n    }\n    namespace tag {\n      template<typename LeftRight> struct weighted_tail_quantile;\n    }\n  }\n}
\n
\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/array.html", "content": "\n\n\nArray Example Boostbook XML Documentation\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
\n
Introduction
\n
Reference
\n
Design Rationale
\n
For more information...
\n
Acknowledgements
\n
\n
\n

\nIntroduction

\n

The C++ Standard Template Library STL as part of the C++\n Standard Library provides a framework for processing algorithms on\n different kind of containers. However, ordinary arrays don't\n provide the interface of STL containers (although, they provide\n the iterator interface of STL containers).

\n

As replacement for ordinary arrays, the STL provides class\n std::vector. However,\n std::vector<> provides\n the semantics of dynamic arrays. Thus, it manages data to be able\n to change the number of elements. This results in some overhead in\n case only arrays with static size are needed.

\n

In his book, Generic Programming and the\n STL, Matthew H. Austern introduces a useful wrapper\n class for ordinary arrays with static size, called\n block. It is safer and has no worse performance than\n ordinary arrays. In The C++ Programming\n Language, 3rd edition, Bjarne Stroustrup introduces a\n similar class, called c_array, which I (Nicolai Josuttis) present\n slightly modified in my book The C++ Standard Library -\n A Tutorial and Reference, called\n carray. This is the essence of these approaches\n spiced with many feedback from boost.

\n

After considering different names, we decided to name this\n class simply array.

\n

Note that this class is suggested to be part of the next\n Technical Report, which will extend the C++ Standard (see\n http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).

\n

Class array fulfills most\n but not all of the requirements of \"reversible containers\" (see\n Section 23.1, [lib.container.requirements] of the C++\n Standard). The reasons array is not an reversible STL container is\n because:\n

\n
    \n
  • No constructors are provided.
    • \n
  • Elements may have an undetermined initial value (see the section called “Design Rationale”).
    • \n
  • \nswap() has no constant complexity.
    • \n
  • \nsize() is always constant, based on the second template argument of the type.
    • \n
  • The container provides no allocator support.
    • \n
\n

\n

\n

It doesn't fulfill the requirements of a \"sequence\" (see Section 23.1.1, [lib.sequence.reqmts] of the C++ Standard), except that:\n

\n
\n

\n

\n
\n
\n

\nReference

\n
Header <boost/array.hpp>
\n
\n

\nHeader <boost/array.hpp>

\n
namespace boost {\n  template<typename T, std::size_t N> class array;\n  template<typename T, std::size_t N> void swap(array<T, N>&, array<T, N>&);\n  template<typename T, std::size_t N> \n    bool operator==(const array<T, N>&, const array<T, N>&);\n  template<typename T, std::size_t N> \n    bool operator!=(const array<T, N>&, const array<T, N>&);\n  template<typename T, std::size_t N> \n    bool operator<(const array<T, N>&, const array<T, N>&);\n  template<typename T, std::size_t N> \n    bool operator>(const array<T, N>&, const array<T, N>&);\n  template<typename T, std::size_t N> \n    bool operator<=(const array<T, N>&, const array<T, N>&);\n  template<typename T, std::size_t N> \n    bool operator>=(const array<T, N>&, const array<T, N>&);\n}
\n
\n
\n
\n

\nDesign Rationale

\n

\n There was an important design tradeoff regarding the\n constructors: We could implement array as an \"aggregate\" (see\n Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would\n mean:\n

\n
  • \n

    \n An array can be initialized with a\n brace-enclosing, comma-separated list of initializers for the\n elements of the container, written in increasing subscript\n order:\n

    \n
    \n               boost::array<int,4> a = { { 1, 2, 3 } };\n
    \n

    \n Note that if there are fewer elements in the\n initializer list, then each remaining element gets\n default-initialized (thus, it has a defined value).\n

    \n
\n

\n

\n

\n However, this approach has its drawbacks: \n passing no initializer list means that the elements\n have an indetermined initial value\n , because the rule says\n that aggregates may have:\n

\n
    \n
  • No user-declared constructors.
    • \n
  • No private or protected non-static data members.
    • \n
  • No base classes.
    • \n
  • No virtual functions.
    • \n
\n

\n

\n

Nevertheless, The current implementation uses this approach.

\n

\n Note that for standard conforming compilers it is possible to\n use fewer braces (according to 8.5.1 (11) of the Standard). That is,\n you can initialize an array as follows:\n

\n
\n      boost::array<int,4> a = { 1, 2, 3 };\n
\n

\n I'd appreciate any constructive feedback. \n Please note: I don't have time to read all boost\n mails. Thus, to make sure that feedback arrives to me, please send\n me a copy of each mail regarding this class.\n \n

\n

\n The code is provided \"as is\" without expressed or implied\n warranty.\n

\n
\n
\n

\nFor more information...

\n

\n To find more details about using ordinary arrays in C++ and\n the framework of the STL, see e.g.\n\n

\n


\n         The C++ Standard Library - A Tutorial and Reference
\n         by Nicolai M. Josuttis
\n         Addison Wesley Longman, 1999
\n         ISBN 0-201-37926-0
\n      

\n

\n

\n

\n \n Home Page of Nicolai\n Josuttis\n \n

\n
\n
\n

\nAcknowledgements

\n

Doug Gregor ported the documentation to the BoostBook format.

\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/basic_formatting.html", "content": "\n\n\nBasic Formatting\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
\n
Font\n Styles
\n
Replaceable\n Text
\n
Quotations
\n
Inline\n Code
\n
Links
\n
Footnotes
\n
Blockquote
\n
Headings
\n
\n
\n
\n

\n Here we go with some inline formatting: italic, bold, underline,\n teletype, strikethrough,\n we can combine styles as well: bold italic,\n teletype with underline.\n

\n
\n
\n
\n

\n Text that is intended to be user-replaceable is rendered like\n this.\n

\n
\n
\n
\n

\n Here we go: “A question that sometimes drives me hazy: am I or are\n the others crazy?”--Einstein\n

\n

\n Note the proper left and right quote marks. Also, while you can simply use\n ordinary quote marks like \"quoted\", our quotation, above, will\n generate correct DocBook quotations (e.g. <quote>quoted</quote>).\n

\n

\n Like all phrase elements, quotations may be nested. Example:\n

\n

\n “Here's the rule for bargains: ‘Do other men, for they would\n do you.’ That's the true business precept.”\n

\n
\n
\n
\n

\n This text has inlined code int main() { return 0; }\n in it. The code should be syntax highlighted.\n

\n
\n
\n

\nLinks\n

\n

\n Try this: this is boost's\n website.... it should be visible as a link.\n

\n

\n This is a link to a header\n file (boost/math/distributions.hpp), it should be rewritable and\n point to the website when built as a PDF.\n

\n

\n This is a link to another library's\n documentation (Boost.Regex), using the boost: protocol, it should\n be rewritten to point to the website when building a PDF.\n

\n

\n This is a link to another library's\n documentation (Boost.Regex), using the boost:/ protocol, it should\n be rewritten to point to the website when building a PDF.\n

\n

\n This is a relative link to a header\n file within the test source, it should be rewritten to point to the\n website when building a PDF. Although it might be on the website yet.\n

\n
\n
\n
\n

\n Here's one [1].\n

\n

\n And here's another [2].\n

\n
\n
\n
\n

\n Lets indent the next paragraph:\n

\n

\n Here we go!!!\n

\n
\n
\n
\n

\n Now try rendering some heading styles:\n

\n

\n\n Heading\n 1\n

\n

\n\n Heading\n 2\n

\n

\n\n Heading\n 3\n

\n
\n\n Heading\n 4\n
\n
\n\n Heading\n 5\n
\n

\n\n Heading\n 6\n

\n
\n
\n
\n

[1] \n A sample footnote\n

\n

[2] \n Another sample footnote\n

\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/blurbs.html", "content": "\n\n\nBlurbs\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n

\nBlurbs\n

\n
\n
Preformatted\n text
\n
Admonishments
\n
Blurbs
\n
\n
\n
\n

\n Here's some sample program output:\n

\n
F test for equal standard deviations\n____________________________________\n\nSample 1:\nNumber of Observations                                 =  240\nSample Standard Deviation                              =  65.549\n\nSample 2:\nNumber of Observations                                 =  240\nSample Standard Deviation                              =  61.854\n\nTest Statistic                                         =  1.123\n\nCDF of test statistic:                                 =  8.148e-001\nUpper Critical Value at alpha:                         =  1.238e+000\nUpper Critical Value at alpha/2:                       =  1.289e+000\nLower Critical Value at alpha:                         =  8.080e-001\nLower Critical Value at alpha/2:                       =  7.756e-001\n\nResults for Alternative Hypothesis and alpha           =  0.0500\n\nAlternative Hypothesis                                    Conclusion\nStandard deviations are unequal (two sided test)          REJECTED\nStandard deviation 1 is less than standard deviation 2    REJECTED\nStandard deviation 1 is greater than standard deviation 2 REJECTED\n
\n
\n
\n
\n

\n There are four admonishments supported by Docbook XML:\n

\n
\n\n\n\n\n\n
\"[Note]\"Note

\n This is a note\n

\n
\n\n\n\n\n\n
\"[Tip]\"Tip

\n This is a tip\n

\n
\n\n\n\n\n\n
\"[Important]\"Important

\n This is important\n

\n
\n\n\n\n\n\n
\"[Caution]\"Caution

\n This is a caution\n

\n
\n\n\n\n\n\n
\"[Warning]\"Warning
\n

\n This is a warning\n

\n

\n They can contain more than one paragraph.\n

\n
\n
\n
\n

\nBlurbs\n

\n
\n

\n

\n An eye catching advertisement or note...\n

\n

\n These should be rendered in a manner similar to admonishments.\n

\n

\n They can contain more than one paragraph.\n

\n
\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/code_blocks.html", "content": "\n\n\nCode Blocks\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
\n
Embedded\n code
\n
Code\n With a Very Long Line
\n
Imported\n code and callouts
\n
Larger\n example
\n
\n
\n
\n

\n These should be syntax highlighted:\n

\n
#include <iostream>\n\nint main()\n{\n    // Sample code\n    std::cout << \"Hello, World\\n\";\n    return 0;\n}\n
\n
\n
\n
\n
template <class RealType> RealType inline foo(const RealType& a, const RealType& b, const RealType& c, const RealType& d, const RealType& e, const RealType& f, const RealType& g, const RealType& h){ return 0; }\n
\n
\n
\n
\n

\n Here's some code with left-placed callouts:\n

\n

\n \n

\n
class x\n{\npublic:\n\n    \"1\"x() : n(0)\n    {\n    }\n\n    \"2\"~x()\n    {\n    }\n\n    \"3\"int get() const\n    {\n        return n; \n    }\n\n    \"4\"void set(int n_)\n    {\n        n = n_;\n    }\n};\n
\n

\n

\n

\n

\n
\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

\"1\"

Constructor

\"2\"

Destructor

\"3\"

Get the n\n member variable

\"4\"

Set the n\n member variable

\n

\n

\n

\n And again with callouts placed exactly where we put them:\n

\n

\n \n

\n
std::string foo_bar() \"1\"\n{\n    return \"foo-bar\"; \"2\"\n}\n
\n

\n

\n

\n

\n
\n\n\n\n\n\n\n\n\n

\"1\"

The Mythical FooBar. See Foobar\n for details

\"2\"

return 'em, foo-bar man!

\n

\n

\n
\n
\n
\n

\n Now let's include a larger example, this may span several pages and should\n not be chopped off half way through... some FO processors get this wrong!\n

\n
namespace boost{\n\ntemplate <class BidirectionalIterator>\nclass sub_match;\n\ntypedef sub_match<const char*>                    csub_match;\ntypedef sub_match<const wchar_t*>                 wcsub_match;\ntypedef sub_match<std::string::const_iterator>    ssub_match;\ntypedef sub_match<std::wstring::const_iterator>   wssub_match;\n\ntemplate <class BidirectionalIterator>\nclass sub_match : public std::pair<BidirectionalIterator, BidirectionalIterator>\n{\npublic:\n   typedef typename iterator_traits<BidirectionalIterator>::value_type value_type;\n   typedef typename iterator_traits<BidirectionalIterator>::difference_type   difference_type;\n   typedef          BidirectionalIterator                                    iterator;\n\n   bool  matched;\n\n   difference_type length()const;\n   operator basic_string<value_type>()const;\n   basic_string<value_type> str()const;\n\n   int compare(const sub_match& s)const;\n   int compare(const basic_string<value_type>& s)const;\n   int compare(const value_type* s)const;\n#ifdef BOOST_REGEX_MATCH_EXTRA\n   typedef implementation-private capture_sequence_type;\n   const capture_sequence_type& captures()const;\n#endif\n};\n//\n// comparisons to another sub_match:\n//\ntemplate <class BidirectionalIterator>\nbool operator == (const sub_match<BidirectionalIterator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator>\nbool operator != (const sub_match<BidirectionalIterator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator>\nbool operator < (const sub_match<BidirectionalIterator>& lhs,\n               const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator>\nbool operator <= (const sub_match<BidirectionalIterator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator>\nbool operator >= (const sub_match<BidirectionalIterator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator>\nbool operator > (const sub_match<BidirectionalIterator>& lhs,\n               const sub_match<BidirectionalIterator>& rhs);\n\n\n//\n// comparisons to a basic_string:\n//\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator == (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,\n                                          traits, \n                                          Allocator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator != (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,\n                                          traits, \n                                          Allocator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator < (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,\n                                          traits, \n                                          Allocator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator > (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,\n                                          traits, \n                                          Allocator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator >= (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,\n                                          traits, \n                                          Allocator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator <= (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,\n                                          traits, \n                                          Allocator>& lhs,\n                  const sub_match<BidirectionalIterator>& rhs);\n\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator == (const sub_match<BidirectionalIterator>& lhs,\n                  const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, \n                                          traits, \n                                          Allocator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator != (const sub_match<BidirectionalIterator>& lhs,\n                  const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, \n                                          traits, \n                                          Allocator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator < (const sub_match<BidirectionalIterator>& lhs,\n               const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, \n                                       traits, \n                                       Allocator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator > (const sub_match<BidirectionalIterator>& lhs,\n               const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, \n                                       traits, \n                                       Allocator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator >= (const sub_match<BidirectionalIterator>& lhs,\n                  const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, \n                                       traits, \n                                       Allocator>& rhs);\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nbool operator <= (const sub_match<BidirectionalIterator>& lhs,\n                  const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, \n                                          traits, \n                                          Allocator>& rhs);\n\n//\n// comparisons to a pointer to a character array:\n//\ntemplate <class BidirectionalIterator> \nbool operator == (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,\n                  const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator != (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,\n                  const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator < (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,\n               const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator > (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,\n               const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator >= (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,\n                  const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator <= (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,\n                  const sub_match<BidirectionalIterator>& rhs); \n\ntemplate <class BidirectionalIterator> \nbool operator == (const sub_match<BidirectionalIterator>& lhs,\n                  typename iterator_traits<BidirectionalIterator>::value_type const* rhs); \ntemplate <class BidirectionalIterator> \nbool operator != (const sub_match<BidirectionalIterator>& lhs,\n                  typename iterator_traits<BidirectionalIterator>::value_type const* rhs); \ntemplate <class BidirectionalIterator> \nbool operator < (const sub_match<BidirectionalIterator>& lhs,\n               typename iterator_traits<BidirectionalIterator>::value_type const* rhs); \ntemplate <class BidirectionalIterator> \nbool operator > (const sub_match<BidirectionalIterator>& lhs,\n               typename iterator_traits<BidirectionalIterator>::value_type const* rhs); \ntemplate <class BidirectionalIterator> \nbool operator >= (const sub_match<BidirectionalIterator>& lhs,\n                  typename iterator_traits<BidirectionalIterator>::value_type const* rhs); \ntemplate <class BidirectionalIterator> \nbool operator <= (const sub_match<BidirectionalIterator>& lhs,\n                  typename iterator_traits<BidirectionalIterator>::value_type const* rhs); \n\n//\n// comparisons to a single character:\n//\ntemplate <class BidirectionalIterator> \nbool operator == (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,\n                  const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator != (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,\n                  const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator < (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,\n               const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator > (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,\n               const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator >= (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,\n                  const sub_match<BidirectionalIterator>& rhs); \ntemplate <class BidirectionalIterator> \nbool operator <= (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,\n                  const sub_match<BidirectionalIterator>& rhs); \n\ntemplate <class BidirectionalIterator> \nbool operator == (const sub_match<BidirectionalIterator>& lhs,\n                  typename iterator_traits<BidirectionalIterator>::value_type const& rhs); \ntemplate <class BidirectionalIterator> \nbool operator != (const sub_match<BidirectionalIterator>& lhs,\n                  typename iterator_traits<BidirectionalIterator>::value_type const& rhs); \ntemplate <class BidirectionalIterator> \nbool operator < (const sub_match<BidirectionalIterator>& lhs,\n               typename iterator_traits<BidirectionalIterator>::value_type const& rhs); \ntemplate <class BidirectionalIterator> \nbool operator > (const sub_match<BidirectionalIterator>& lhs,\n               typename iterator_traits<BidirectionalIterator>::value_type const& rhs); \ntemplate <class BidirectionalIterator> \nbool operator >= (const sub_match<BidirectionalIterator>& lhs,\n                  typename iterator_traits<BidirectionalIterator>::value_type const& rhs); \ntemplate <class BidirectionalIterator> \nbool operator <= (const sub_match<BidirectionalIterator>& lhs,\n                  typename iterator_traits<BidirectionalIterator>::value_type const& rhs); \n// \n// addition operators: \n//\ntemplate <class BidirectionalIterator, class traits, class Allocator> \nstd::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator> \n   operator + (const std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type,\n                                       traits, \n                                       Allocator>& s, \n               const sub_match<BidirectionalIterator>& m); \ntemplate <class BidirectionalIterator, class traits, class Allocator> \nstd::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>\n   operator + (const sub_match<BidirectionalIterator>& m,\n               const std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, \n                                       traits, \n                                       Allocator>& s); \ntemplate <class BidirectionalIterator> \nstd::basic_string<typename iterator_traits<BidirectionalIterator>::value_type> \n   operator + (typename iterator_traits<BidirectionalIterator>::value_type const* s,\n               const sub_match<BidirectionalIterator>& m); \ntemplate <class BidirectionalIterator> \nstd::basic_string<typename iterator_traits<BidirectionalIterator>::value_type> \n   operator + (const sub_match<BidirectionalIterator>& m,\n               typename iterator_traits<BidirectionalIterator>::value_type const * s);\ntemplate <class BidirectionalIterator> \nstd::basic_string<typename iterator_traits<BidirectionalIterator>::value_type> \n   operator + (typename iterator_traits<BidirectionalIterator>::value_type const& s,\n               const sub_match<BidirectionalIterator>& m); \ntemplate <class BidirectionalIterator> \nstd::basic_string<typename iterator_traits<BidirectionalIterator>::value_type> \n   operator + (const sub_match<BidirectionalIterator>& m,\n               typename iterator_traits<BidirectionalIterator>::value_type const& s); \ntemplate <class BidirectionalIterator> \nstd::basic_string<typename iterator_traits<BidirectionalIterator>::value_type> \n   operator + (const sub_match<BidirectionalIterator>& m1,\n               const sub_match<BidirectionalIterator>& m2);\n\n//\n// stream inserter:\n//\ntemplate <class charT, class traits, class BidirectionalIterator>\nbasic_ostream<charT, traits>&\n   operator << (basic_ostream<charT, traits>& os,\n               const sub_match<BidirectionalIterator>& m);\n\n} // namespace boost\n
\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/images.html", "content": "\n\n\nImages\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n

\nImages\n

\n

\n These are tricky enough that they warrant their own section.\n

\n

\n Let's start with a PNG file that's set to 120dpi, it should render at a sensible\n size in both html and PDF forms. It should print OK too!\n

\n

\n \"digamma3\"\n

\n

\n Now try again with a sample SVG image:\n

\n

\n \n

\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/lists_and_tables.html", "content": "\n\n\nLists and Tables\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
\n
Lists
\n
Variable\n Lists
\n
Tables
\n
\n
\n

\nLists\n

\n

\n A numbered list:\n

\n
    \n
  1. \n One\n
    2. \n
  2. \n Two\n
    3. \n
  3. \n Three\n
      \n
    1. \n Three.a\n
      2. \n
    2. \n Three.b\n
      3. \n
    3. \n Three.c\n
      4. \n
    \n
    4. \n
  4. \n Four\n
    1. \n Four.a\n
        \n
      1. \n Four.a.i\n
        2. \n
      2. \n Four.a.ii\n
        3. \n
      \n
    \n
    5. \n
  5. \n Five\n
    6. \n
\n

\n An unordered list:\n

\n
    \n
  • \n First\n
    • \n
  • \n Second\n
    • \n
  • \n Third\n
    • \n
\n

\n A mixture of the two:\n

\n
    \n
  1. \n 1\n
      \n
    • \n 1.a\n
        \n
      1. \n 1.a.1\n
        2. \n
      2. \n 1.a.2\n
        3. \n
      \n
      • \n
    • \n 1.b\n
      • \n
    \n
    2. \n
  2. \n 2\n
      \n
    • \n 2.a\n
      • \n
    • \n 2.b\n
        \n
      1. \n 2.b.1\n
        2. \n
      2. \n 2.b.2\n
          \n
        • \n 2.b.2.a\n
          • \n
        • \n 2.b.2.b\n
          • \n
        \n
        3. \n
      \n
      • \n
    \n
    3. \n
\n
\n
\n
\n
\n

A Variable List

\n
\n
term 1
\n

\n The definition of term 1\n

\n
term 2
\n

\n The definition of term 2\n

\n
term 3
\n

\n The definition of term 3\n

\n
\n
\n
\n
\n

\nTables\n

\n

\n Here's a big table with code and other tricky things:\n

\n
\n

Table 1. Notes on the Implementation of the Beta Distribution

\n
\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

\n Function\n

\n 		\n

\n Implementation Notes\n

\n
\n

\n pdf\n

\n 		\n

\n f(x;α,β) = xα - 1 (1 - x)β -1 / B(α, β)\n

\n

\n Implemented using ibeta_derivative(a, b, x).\n

\n
\n

\n cdf\n

\n 		\n

\n Using the incomplete beta function ibeta(a, b, x)\n

\n
\n

\n cdf complement\n

\n 		\n

\n ibetac(a, b, x)\n

\n
\n

\n quantile\n

\n 		\n

\n Using the inverse incomplete beta function ibeta_inv(a, b, p)\n

\n
\n

\n quantile from the complement\n

\n 		\n

\n ibetac_inv(a, b, q)\n

\n
\n

\n mean\n

\n 		\n

\n a/(a+b)\n

\n
\n

\n variance\n

\n 		\n

\n a *\n b /\n (a+b)^2 * (a +\n b +\n 1)\n

\n
\n

\n mode\n

\n 		\n

\n (a-1) / (a\n + b\n + 2)\n

\n
\n

\n skewness\n

\n 		\n

\n 2 (b-a)\n sqrt(a+b+1)/(a+b+2) * sqrt(a\n * b)\n

\n
\n

\n kurtosis excess\n

\n 		\n

\n \"beta_dist_kurtosis\"\n

\n
\n

\n kurtosis\n

\n 		\n

\n kurtosis +\n 3\n

\n
\n

\n parameter estimation\n

\n 		\n
\n

\n alpha\n

\n

\n from mean and variance\n

\n 		\n

\n mean *\n (( (mean *\n (1\n - mean)) / variance)-\n 1)\n

\n
\n

\n beta\n

\n

\n from mean and variance\n

\n 		\n

\n (1\n - mean) * (((mean\n * (1 - mean))\n /variance)-1)\n

\n
\n

\n The member functions estimate_alpha\n and estimate_beta\n

\n

\n from cdf and probability x\n

\n

\n and either alpha\n or beta\n

\n 		\n

\n Implemented in terms of the inverse incomplete beta functions\n

\n

\n ibeta_inva, and ibeta_invb respectively.\n

\n
\n

\n estimate_alpha\n

\n 		\n

\n ibeta_inva(beta,\n x,\n probability)\n

\n
\n

\n estimate_beta\n

\n 		\n

\n ibeta_invb(alpha,\n x,\n probability)\n

\n
\n
\n
\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/remez.html", "content": "\n\n\nSample Article (The Remez Method)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n

\n The Remez algorithm\n is a methodology for locating the minimax rational approximation to a function.\n This short article gives a brief overview of the method, but it should not\n be regarded as a thorough theoretical treatment, for that you should consult\n your favorite textbook.\n

\n

\n Imagine that you want to approximate some function f(x) by way of a rational\n function R(x), where R(x) may be either a polynomial P(x) or a ratio of two\n polynomials P(x)/Q(x) (a rational function). Initially we'll concentrate on\n the polynomial case, as it's by far the easier to deal with, later we'll extend\n to the full rational function case.\n

\n

\n We want to find the \"best\" rational approximation, where \"best\"\n is defined to be the approximation that has the least deviation from f(x).\n We can measure the deviation by way of an error function:\n

\n

\n Eabs(x) = f(x) - R(x)\n

\n

\n which is expressed in terms of absolute error, but we can equally use relative\n error:\n

\n

\n Erel(x) = (f(x) - R(x)) / |f(x)|\n

\n

\n And indeed in general we can scale the error function in any way we want, it\n makes no difference to the maths, although the two forms above cover almost\n every practical case that you're likely to encounter.\n

\n

\n The minimax rational function R(x) is then defined to be the function that\n yields the smallest maximal value of the error function. Chebyshev showed that\n there is a unique minimax solution for R(x) that has the following properties:\n

\n
    \n
  • \n If R(x) is a polynomial of degree N, then there are N+2 unknowns: the N+1\n coefficients of the polynomial, and maximal value of the error function.\n
    • \n
  • \n The error function has N+1 roots, and N+2 extrema (minima and maxima).\n
    • \n
  • \n The extrema alternate in sign, and all have the same magnitude.\n
    • \n
\n

\n That means that if we know the location of the extrema of the error function\n then we can write N+2 simultaneous equations:\n

\n

\n R(xi) + (-1)iE = f(xi)\n

\n

\n where E is the maximal error term, and xi are the abscissa values of the N+2\n extrema of the error function. It is then trivial to solve the simultaneous\n equations to obtain the polynomial coefficients and the error term.\n

\n

\n Unfortunately we don't know where the extrema of the error function\n are located!\n

\n
\n\n The Remez\n Method\n
\n

\n The Remez method is an iterative technique which, given a broad range of assumptions,\n will converge on the extrema of the error function, and therefore the minimax\n solution.\n

\n

\n In the following discussion we'll use a concrete example to illustrate the\n Remez method: an approximation to the function ex over the range [-1, 1].\n

\n

\n Before we can begin the Remez method, we must obtain an initial value for the\n location of the extrema of the error function. We could \"guess\" these,\n but a much closer first approximation can be obtained by first constructing\n an interpolated polynomial approximation to f(x).\n

\n

\n In order to obtain the N+1 coefficients of the interpolated polynomial we need\n N+1 points (x0...xN): with our interpolated form passing through each of those\n points that yields N+1 simultaneous equations:\n

\n

\n f(xi) = P(xi) = c0 + c1xi ... + cNxiN\n

\n

\n Which can be solved for the coefficients c0...cN in P(x).\n

\n

\n Obviously this is not a minimax solution, indeed our only guarantee is that\n f(x) and P(x) touch at N+1 locations, away from those points the error may\n be arbitrarily large. However, we would clearly like this initial approximation\n to be as close to f(x) as possible, and it turns out that using the zeros of\n an orthogonal polynomial as the initial interpolation points is a good choice.\n In our example we'll use the zeros of a Chebyshev polynomial as these are particularly\n easy to calculate, interpolating for a polynomial of degree 4, and measuring\n relative error we get the following error function:\n

\n

\n \"remez-2\"\n

\n

\n Which has a peak relative error of 1.2x10-3.\n

\n

\n While this is a pretty good approximation already, judging by the shape of\n the error function we can clearly do better. Before starting on the Remez method\n propper, we have one more step to perform: locate all the extrema of the error\n function, and store these locations as our initial Chebyshev control\n points.\n

\n
\n\n\n\n\n\n
\"[Note]\"Note
\n

\n In the simple case of a polynomial approximation, by interpolating through\n the roots of a Chebyshev polynomial we have in fact created a Chebyshev\n approximation to the function: in terms of absolute\n error this is the best a priori choice for the interpolated form\n we can achieve, and typically is very close to the minimax solution.\n

\n

\n However, if we want to optimise for relative error,\n or if the approximation is a rational function, then the initial Chebyshev\n solution can be quite far from the ideal minimax solution.\n

\n

\n A more technical discussion of the theory involved can be found in this\n online\n course.\n

\n
\n
\n\n Remez Step 1\n
\n

\n The first step in the Remez method, given our current set of N+2 Chebyshev\n control points xi, is to solve the N+2 simultaneous equations:\n

\n

\n P(xi) + (-1)iE = f(xi)\n

\n

\n To obtain the error term E, and the coefficients of the polynomial P(x).\n

\n

\n This gives us a new approximation to f(x) that has the same error E\n at each of the control points, and whose error function alternates\n in sign at the control points. This is still not necessarily the\n minimax solution though: since the control points may not be at the extrema\n of the error function. After this first step here's what our approximation's\n error function looks like:\n

\n

\n \"remez-3\"\n

\n

\n Clearly this is still not the minimax solution since the control points are\n not located at the extrema, but the maximum relative error has now dropped\n to 5.6x10-4.\n

\n
\n\n Remez Step 2\n
\n

\n The second step is to locate the extrema of the new approximation, which we\n do in two stages: first, since the error function changes sign at each control\n point, we must have N+1 roots of the error function located between each pair\n of N+2 control points. Once these roots are found by standard root finding\n techniques, we know that N extrema are bracketed between each pair of roots,\n plus two more between the endpoints of the range and the first and last roots.\n The N+2 extrema can then be found using standard function minimisation techniques.\n

\n

\n We now have a choice: multi-point exchange, or single point exchange.\n

\n

\n In single point exchange, we move the control point nearest to the largest\n extrema to the abscissa value of the extrema.\n

\n

\n In multi-point exchange we swap all the current control points, for the locations\n of the extrema.\n

\n

\n In our example we perform multi-point exchange.\n

\n
\n\n Iteration\n
\n

\n The Remez method then performs steps 1 and 2 above iteratively until the control\n points are located at the extrema of the error function: this is then the minimax\n solution.\n

\n

\n For our current example, two more iterations converges on a minimax solution\n with a peak relative error of 5x10-4 and an error function that looks like:\n

\n

\n \"remez-4\"\n

\n
\n\n Rational\n Approximations\n
\n

\n If we wish to extend the Remez method to a rational approximation of the form\n

\n

\n f(x) = R(x) = P(x) / Q(x)\n

\n

\n where P(x) and Q(x) are polynomials, then we proceed as before, except that\n now we have N+M+2 unknowns if P(x) is of order N and Q(x) is of order M. This\n assumes that Q(x) is normalised so that it's leading coefficient is 1, giving\n N+M+1 polynomial coefficients in total, plus the error term E.\n

\n

\n The simultaneous equations to be solved are now:\n

\n

\n P(xi) / Q(xi) + (-1)iE = f(xi)\n

\n

\n Evaluated at the N+M+2 control points xi.\n

\n

\n Unfortunately these equations are non-linear in the error term E: we can only\n solve them if we know E, and yet E is one of the unknowns!\n

\n

\n The method usually adopted to solve these equations is an iterative one: we\n guess the value of E, solve the equations to obtain a new value for E (as well\n as the polynomial coefficients), then use the new value of E as the next guess.\n The method is repeated until E converges on a stable value.\n

\n

\n These complications extend the running time required for the development of\n rational approximations quite considerably. It is often desirable to obtain\n a rational rather than polynomial approximation none the less: rational approximations\n will often match more difficult to approximate functions, to greater accuracy,\n and with greater efficiency, than their polynomial alternatives. For example,\n if we takes our previous example of an approximation to ex, we obtained 5x10-4 accuracy\n with an order 4 polynomial. If we move two of the unknowns into the denominator\n to give a pair of order 2 polynomials, and re-minimise, then the peak relative\n error drops to 8.7x10-5. That's a 5 fold increase in accuracy, for the same\n number of terms overall.\n

\n
\n\n Practical\n Considerations\n
\n

\n Most treatises on approximation theory stop at this point. However, from a\n practical point of view, most of the work involves finding the right approximating\n form, and then persuading the Remez method to converge on a solution.\n

\n

\n So far we have used a direct approximation:\n

\n

\n f(x) = R(x)\n

\n

\n But this will converge to a useful approximation only if f(x) is smooth. In\n addition round-off errors when evaluating the rational form mean that this\n will never get closer than within a few epsilon of machine precision. Therefore\n this form of direct approximation is often reserved for situations where we\n want efficiency, rather than accuracy.\n

\n

\n The first step in improving the situation is generally to split f(x) into a\n dominant part that we can compute accurately by another method, and a slowly\n changing remainder which can be approximated by a rational approximation. We\n might be tempted to write:\n

\n

\n f(x) = g(x) + R(x)\n

\n

\n where g(x) is the dominant part of f(x), but if f(x)/g(x) is approximately\n constant over the interval of interest then:\n

\n

\n f(x) = g(x)(c + R(x))\n

\n

\n Will yield a much better solution: here c is a constant\n that is the approximate value of f(x)/g(x) and R(x) is typically tiny compared\n to c. In this situation if R(x) is optimised for absolute\n error, then as long as its error is small compared to the constant c,\n that error will effectively get wiped out when R(x) is added to c.\n

\n

\n The difficult part is obviously finding the right g(x) to extract from your\n function: often the asymptotic behaviour of the function will give a clue,\n so for example the function __erfc becomes proportional to e-x2/x as x becomes\n large. Therefore using:\n

\n

\n erfc(z) = (C + R(x)) e-x2/x\n

\n

\n as the approximating form seems like an obvious thing to try, and does indeed\n yield a useful approximation.\n

\n

\n However, the difficulty then becomes one of converging the minimax solution.\n Unfortunately, it is known that for some functions the Remez method can lead\n to divergent behaviour, even when the initial starting approximation is quite\n good. Furthermore, it is not uncommon for the solution obtained in the first\n Remez step above to be a bad one: the equations to be solved are generally\n \"stiff\", often very close to being singular, and assuming a solution\n is found at all, round-off errors and a rapidly changing error function, can\n lead to a situation where the error function does not in fact change sign at\n each control point as required. If this occurs, it is fatal to the Remez method.\n It is also possible to obtain solutions that are perfectly valid mathematically,\n but which are quite useless computationally: either because there is an unavoidable\n amount of roundoff error in the computation of the rational function, or because\n the denominator has one or more roots over the interval of the approximation.\n In the latter case while the approximation may have the correct limiting value\n at the roots, the approximation is nonetheless useless.\n

\n

\n Assuming that the approximation does not have any fatal errors, and that the\n only issue is converging adequately on the minimax solution, the aim is to\n get as close as possible to the minimax solution before beginning the Remez\n method. Using the zeros of a Chebyshev polynomial for the initial interpolation\n is a good start, but may not be ideal when dealing with relative errors and/or\n rational (rather than polynomial) approximations. One approach is to skew the\n initial interpolation points to one end: for example if we raise the roots\n of the Chebyshev polynomial to a positive power greater than 1 then the roots\n will be skewed towards the middle of the [-1,1] interval, while a positive\n power less than one will skew them towards either end. More usefully, if we\n initially rescale the points over [0,1] and then raise to a positive power,\n we can skew them to the left or right. Returning to our example of ex over [-1,1],\n the initial interpolated form was some way from the minimax solution:\n

\n

\n \"remez-2\"\n

\n

\n However, if we first skew the interpolation points to the left (rescale them\n to [0, 1], raise to the power 1.3, and then rescale back to [-1,1]) we reduce\n the error from 1.3x10-3to 6x10-4:\n

\n

\n \"remez-5\"\n

\n

\n It's clearly still not ideal, but it is only a few percent away from our desired\n minimax solution (5x10-4).\n

\n
\n\n Remez\n Method Checklist\n
\n

\n The following lists some of the things to check if the Remez method goes wrong,\n it is by no means an exhaustive list, but is provided in the hopes that it\n will prove useful.\n

\n
    \n
  • \n Is the function smooth enough? Can it be better separated into a rapidly\n changing part, and an asymptotic part?\n
    • \n
  • \n Does the function being approximated have any \"blips\" in it?\n Check for problems as the function changes computation method, or if a\n root, or an infinity has been divided out. The telltale sign is if there\n is a narrow region where the Remez method will not converge.\n
    • \n
  • \n Check you have enough accuracy in your calculations: remember that the\n Remez method works on the difference between the approximation and the\n function being approximated: so you must have more digits of precision\n available than the precision of the approximation being constructed. So\n for example at double precision, you shouldn't expect to be able to get\n better than a float precision approximation.\n
    • \n
  • \n Try skewing the initial interpolated approximation to minimise the error\n before you begin the Remez steps.\n
    • \n
  • \n If the approximation won't converge or is ill-conditioned from one starting\n location, try starting from a different location.\n
    • \n
  • \n If a rational function won't converge, one can minimise a polynomial (which\n presents no problems), then rotate one term from the numerator to the denominator\n and minimise again. In theory one can continue moving terms one at a time\n from numerator to denominator, and then re-minimising, retaining the last\n set of control points at each stage.\n
    • \n
  • \n Try using a smaller interval. It may also be possible to optimise over\n one (small) interval, rescale the control points over a larger interval,\n and then re-minimise.\n
    • \n
  • \n Keep abscissa values small: use a change of variable to keep the abscissa\n over, say [0, b], for some smallish value b.\n
    • \n
\n
\n\n References\n
\n

\n The original references for the Remez Method and it's extension to rational\n functions are unfortunately in Russian:\n

\n

\n Remez, E.Ya., Fundamentals of numerical methods for Chebyshev approximations,\n \"Naukova Dumka\", Kiev, 1969.\n

\n

\n Remez, E.Ya., Gavrilyuk, V.T., Computer development of certain approaches\n to the approximate construction of solutions of Chebyshev problems nonlinearly\n depending on parameters, Ukr. Mat. Zh. 12 (1960), 324-338.\n

\n

\n Gavrilyuk, V.T., Generalization of the first polynomial algorithm\n of E.Ya.Remez for the problem of constructing rational-fractional Chebyshev\n approximations, Ukr. Mat. Zh. 16 (1961), 575-585.\n

\n

\n Some English language sources include:\n

\n

\n Fraser, W., Hart, J.F., On the computation of rational approximations\n to continuous functions, Comm. of the ACM 5 (1962), 401-403, 414.\n

\n

\n Ralston, A., Rational Chebyshev approximation by Remes' algorithms,\n Numer.Math. 7 (1965), no. 4, 322-330.\n

\n

\n A. Ralston, Rational Chebyshev approximation, Mathematical Methods\n for Digital Computers v. 2 (Ralston A., Wilf H., eds.), Wiley, New\n York, 1967, pp. 264-284.\n

\n

\n Hart, J.F. e.a., Computer approximations, Wiley, New York\n a.o., 1968.\n

\n

\n Cody, W.J., Fraser, W., Hart, J.F., Rational Chebyshev approximation\n using linear equations, Numer.Math. 12 (1968), 242-251.\n

\n

\n Cody, W.J., A survey of practical rational and polynomial approximation\n of functions, SIAM Review 12 (1970), no. 3, 400-423.\n

\n

\n Barrar, R.B., Loeb, H.J., On the Remez algorithm for non-linear families,\n Numer.Math. 15 (1970), 382-391.\n

\n

\n Dunham, Ch.B., Convergence of the Fraser-Hart algorithm for rational\n Chebyshev approximation, Math. Comp. 29 (1975), no. 132, 1078-1082.\n

\n

\n G. L. Litvinov, Approximate construction of rational approximations\n and the effect of error autocorrection, Russian Journal of Mathematical\n Physics, vol.1, No. 3, 1994.\n

\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/document_to_test_formatting/test.html", "content": "\n\n\ntest HTML4 symbols\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n
\n
\n
\n
test\n Greek and Math symbols
\n
test\n Latin1 symbols
\n
\n
\n
\n

\n ƒ, Α, Β, Γ, Δ, Ε, Ζ, Η, Θ, Ι, Κ, Λ, Μ, Ν, Ξ, Ο, Π, Ρ, Σ, Τ, Υ, Φ, Χ, Ψ, Ω, α, β, γ, δ, ε, ζ, η, θ, ι, κ, λ, μ,\n ν, ξ, ο, π, ρ, ς, σ, τ, υ, φ, χ, ψ, ω, ϑ, ϒ, ϖ, •, …, ′, ″, ‾, ⁄, ℘, ℑ, ℜ, ™, ℵ, ←, ↑, →, ↓, ↔, ↵, ⇐, ⇑, ⇒, ⇓,\n ⇔, ∀, ∂, ∃, ∅, ∇, ∈, ∉, ∋, ∏, ∑, −, ∗, √, ∝, ∞, ∠, ∧, ∨, ∩, ∪, ∫, ∴, ∼, ≅, ≈, ≠, ≡, ≤, ≥, ⊂, ⊃, ⊄, ⊆, ⊇, ⊕, ⊗,\n ⊥, ⋅, ⌈, ⌉, ⌊, ⌋, 〈, 〉, ◊, ♠, ♣, ♥, ♦\n

\n
\n
\n
\n

\n  , ¡, ¢, £, ¤, ¥, ¦, §, ¨, ©, ª, «, ¬, ­, ®, ¯, °, ±, ², ³, ´, µ, ¶, ·, ¸, ¹, º, », ¼, ½, ¾, ¿, À, Á, Â, Ã, Ä,\n Å, Æ, Ç, È, É, Ê, Ë, Ì, Í, Î, Ï, Ð, Ñ, Ò, Ó, Ô, Õ, Ö, ×, Ø, Ù, Ú, Û, Ü, Ý, Þ, ß, à, á, â, ã, ä, å, æ, ç, è, é,\n ê, ë, ì, í, î, ï, ð, ñ, ò, ó, ô, õ, ö, ÷, ø, ù, ú, û, ü, ý, þ, ÿ,\n

\n
\n
\n\n\n\n
Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n\"Prev\"\"Up\"\"Home\"\"Next\"\n
\n\n\n" }, { "path": "doc/test/gold/index.html", "content": "\n\n\nDocument To Test Formatting\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\"BoostHomeLibrariesPeopleFAQMore
\n
\n
\"Next\"
\n
\n
\n
\n

\nDocument To Test Formatting

\n
\n

\nJohn Maddock\n

\n

\nJoel de Guzman\n

\n

\nEric Niebler\n

\n

\nMatias Capeletto\n

\n
\n

Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias\n Capeletto

\n
\n

\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

\n
\n
\n
\n
\n
\n

Table of Contents

\n
\n
Introduction
\n
Code Blocks
\n
\n
Embedded\n code
\n
Code\n With a Very Long Line
\n
Imported\n code and callouts
\n
Larger\n example
\n
\n
Basic Formatting
\n
\n
Font\n Styles
\n
Replaceable\n Text
\n
Quotations
\n
Inline\n Code
\n
Links
\n
Footnotes
\n
Blockquote
\n
Headings
\n
\n
Blurbs
\n
\n
Preformatted\n text
\n
Admonishments
\n
Blurbs
\n
\n
Lists and\n Tables
\n
\n
Lists
\n
Variable\n Lists
\n
Tables
\n
\n
Images
\n
test HTML4 symbols
\n
\n
test\n Greek and Math symbols
\n
test\n Latin1 symbols
\n
\n
Sample Article (The\n Remez Method)
\n
Array Example Boostbook\n XML Documentation
\n
\n
Introduction
\n
Reference
\n
Design Rationale
\n
For more information...
\n
Acknowledgements
\n
\n
Accumulators\n Example Doxygen Documentation
\n
Statistics Library Reference
\n
\n
\n
\n
\n

\n This document is purely a test case to test out HTML and PDF generation and\n style.\n

\n

\n This is some body text.\n

\n
int main()\n{\n    double d = 2.345;\n    return d;\n}\n
\n

\n We can count in Greek too: α, β, γ.\n

\n

\n Try some superscripts and subscripts: x2, xi3, α2, βα, ⌊x⌋, ⌊α⌋, ⌈a⌉.\n

\n
\n
\n\n\n\n

Last revised: July 22, 2010 at 21:58:58 GMT

\n
\n
\"Next\"
\n\n\n" }, { "path": "doc/test/remez.qbk", "content": "[section:remez Sample Article (The Remez Method)]\n\nThe [@http://en.wikipedia.org/wiki/Remez_algorithm Remez algorithm]\nis a methodology for locating the minimax rational approximation\nto a function. This short article gives a brief overview of the method, but\nit should not be regarded as a thorough theoretical treatment, for that you\nshould consult your favorite textbook.\n\nImagine that you want to approximate some function f(x) by way of a rational\nfunction R(x), where R(x) may be either a polynomial P(x) or a ratio of two\npolynomials P(x)/Q(x) (a rational function). Initially we'll concentrate on the \npolynomial case, as it's by far the easier to deal with, later we'll extend \nto the full rational function case. \n\nWe want to find the \"best\" rational approximation, where\n\"best\" is defined to be the approximation that has the least deviation\nfrom f(x). We can measure the deviation by way of an error function:\n\nE[sub abs](x) = f(x) - R(x)\n\nwhich is expressed in terms of absolute error, but we can equally use\nrelative error:\n\nE[sub rel](x) = (f(x) - R(x)) / |f(x)|\n\nAnd indeed in general we can scale the error function in any way we want, it\nmakes no difference to the maths, although the two forms above cover almost\nevery practical case that you're likely to encounter.\n\nThe minimax rational function R(x) is then defined to be the function that\nyields the smallest maximal value of the error function. Chebyshev showed\nthat there is a unique minimax solution for R(x) that has the following\nproperties:\n\n* If R(x) is a polynomial of degree N, then there are N+2 unknowns:\nthe N+1 coefficients of the polynomial, and maximal value of the error\nfunction.\n* The error function has N+1 roots, and N+2 extrema (minima and maxima).\n* The extrema alternate in sign, and all have the same magnitude.\n\nThat means that if we know the location of the extrema of the error function\nthen we can write N+2 simultaneous equations:\n\nR(x[sub i]) + (-1)[super i]E = f(x[sub i])\n\nwhere E is the maximal error term, and x[sub i] are the abscissa values of the\nN+2 extrema of the error function. It is then trivial to solve the simultaneous\nequations to obtain the polynomial coefficients and the error term.\n\n['Unfortunately we don't know where the extrema of the error function are located!]\n\n[h4 The Remez Method]\n\nThe Remez method is an iterative technique which, given a broad range of\nassumptions, will converge on the extrema of the error function, and therefore\nthe minimax solution.\n\nIn the following discussion we'll use a concrete example to illustrate\nthe Remez method: an approximation to the function e[super x][space] over\nthe range \\[-1, 1\\].\n\nBefore we can begin the Remez method, we must obtain an initial value\nfor the location of the extrema of the error function. We could \"guess\"\nthese, but a much closer first approximation can be obtained by first \nconstructing an interpolated polynomial approximation to f(x).\n\nIn order to obtain the N+1 coefficients of the interpolated polynomial\nwe need N+1 points (x[sub 0]...x[sub N]): with our interpolated form \npassing through each of those points\nthat yields N+1 simultaneous equations:\n\nf(x[sub i]) = P(x[sub i]) = c[sub 0] + c[sub 1]x[sub i] ... + c[sub N]x[sub i][super N]\n\nWhich can be solved for the coefficients c[sub 0]...c[sub N] in P(x).\n\nObviously this is not a minimax solution, indeed our only guarantee is that f(x) and \nP(x) touch at N+1 locations, away from those points the error may be arbitrarily\nlarge. However, we would clearly like this initial approximation to be as close to\nf(x) as possible, and it turns out that using the zeros of an orthogonal polynomial\nas the initial interpolation points is a good choice. In our example we'll use the \nzeros of a Chebyshev polynomial as these are particularly easy to calculate, \ninterpolating for a polynomial of degree 4, and measuring /relative error/\nwe get the following error function:\n\n[$images/remez-2.png]\n\nWhich has a peak relative error of 1.2x10[super -3].\n\nWhile this is a pretty good approximation already, judging by the \nshape of the error function we can clearly do better. Before starting\non the Remez method propper, we have one more step to perform: locate\nall the extrema of the error function, and store\nthese locations as our initial ['Chebyshev control points].\n\n[note\nIn the simple case of a polynomial approximation, by interpolating through\nthe roots of a Chebyshev polynomial we have in fact created a ['Chebyshev\napproximation] to the function: in terms of /absolute error/\nthis is the best a priori choice for the interpolated form we can\nachieve, and typically is very close to the minimax solution.\n\nHowever, if we want to optimise for /relative error/, or if the approximation\nis a rational function, then the initial Chebyshev solution can be quite far\nfrom the ideal minimax solution. \n\nA more technical discussion of the theory involved can be found in this\n[@http://math.fullerton.edu/mathews/n2003/ChebyshevPolyMod.html online course].]\n\n[h4 Remez Step 1]\n\nThe first step in the Remez method, given our current set of\nN+2 Chebyshev control points x[sub i], is to solve the N+2 simultaneous\nequations:\n\nP(x[sub i]) + (-1)[super i]E = f(x[sub i])\n\nTo obtain the error term E, and the coefficients of the polynomial P(x).\n\nThis gives us a new approximation to f(x) that has the same error /E/ at\neach of the control points, and whose error function ['alternates in sign]\nat the control points. This is still not necessarily the minimax \nsolution though: since the control points may not be at the extrema of the error\nfunction. After this first step here's what our approximation's error\nfunction looks like:\n\n[$images/remez-3.png]\n\nClearly this is still not the minimax solution since the control points\nare not located at the extrema, but the maximum relative error has now\ndropped to 5.6x10[super -4].\n\n[h4 Remez Step 2]\n\nThe second step is to locate the extrema of the new approximation, which we do \nin two stages: first, since the error function changes sign at each\ncontrol point, we must have N+1 roots of the error function located between\neach pair of N+2 control points. Once these roots are found by standard root finding \ntechniques, we know that N extrema are bracketed between each pair of\nroots, plus two more between the endpoints of the range and the first and last roots.\nThe N+2 extrema can then be found using standard function minimisation techniques.\n\nWe now have a choice: multi-point exchange, or single point exchange.\n\nIn single point exchange, we move the control point nearest to the largest extrema to\nthe abscissa value of the extrema.\n\nIn multi-point exchange we swap all the current control points, for the locations\nof the extrema.\n\nIn our example we perform multi-point exchange.\n\n[h4 Iteration]\n\nThe Remez method then performs steps 1 and 2 above iteratively until the control\npoints are located at the extrema of the error function: this is then\nthe minimax solution.\n\nFor our current example, two more iterations converges on a minimax\nsolution with a peak relative error of\n5x10[super -4] and an error function that looks like:\n\n[$images/remez-4.png]\n\n[h4 Rational Approximations]\n\nIf we wish to extend the Remez method to a rational approximation of the form\n\nf(x) = R(x) = P(x) / Q(x)\n\nwhere P(x) and Q(x) are polynomials, then we proceed as before, except that now\nwe have N+M+2 unknowns if P(x) is of order N and Q(x) is of order M. This assumes\nthat Q(x) is normalised so that it's leading coefficient is 1, giving\nN+M+1 polynomial coefficients in total, plus the error term E.\n\nThe simultaneous equations to be solved are now:\n\nP(x[sub i]) / Q(x[sub i]) + (-1)[super i]E = f(x[sub i])\n\nEvaluated at the N+M+2 control points x[sub i].\n\nUnfortunately these equations are non-linear in the error term E: we can only\nsolve them if we know E, and yet E is one of the unknowns!\n\nThe method usually adopted to solve these equations is an iterative one: we guess the\nvalue of E, solve the equations to obtain a new value for E (as well as the polynomial\ncoefficients), then use the new value of E as the next guess. The method is\nrepeated until E converges on a stable value.\n\nThese complications extend the running time required for the development\nof rational approximations quite considerably. It is often desirable\nto obtain a rational rather than polynomial approximation none the less:\nrational approximations will often match more difficult to approximate\nfunctions, to greater accuracy, and with greater efficiency, than their\npolynomial alternatives. For example, if we takes our previous example\nof an approximation to e[super x], we obtained 5x10[super -4] accuracy\nwith an order 4 polynomial. If we move two of the unknowns into the denominator\nto give a pair of order 2 polynomials, and re-minimise, then the peak relative error drops\nto 8.7x10[super -5]. That's a 5 fold increase in accuracy, for the same number \nof terms overall.\n\n[h4 Practical Considerations]\n\nMost treatises on approximation theory stop at this point. However, from\na practical point of view, most of the work involves finding the right\napproximating form, and then persuading the Remez method to converge\non a solution.\n\nSo far we have used a direct approximation:\n\nf(x) = R(x)\n\nBut this will converge to a useful approximation only if f(x) is smooth. In\naddition round-off errors when evaluating the rational form mean that this\nwill never get closer than within a few epsilon of machine precision. \nTherefore this form of direct approximation is often reserved for situations\nwhere we want efficiency, rather than accuracy.\n\nThe first step in improving the situation is generally to split f(x) into\na dominant part that we can compute accurately by another method, and a \nslowly changing remainder which can be approximated by a rational approximation.\nWe might be tempted to write:\n\nf(x) = g(x) + R(x)\n\nwhere g(x) is the dominant part of f(x), but if f(x)\\/g(x) is approximately\nconstant over the interval of interest then:\n\nf(x) = g(x)(c + R(x))\n\nWill yield a much better solution: here /c/ is a constant that is the approximate\nvalue of f(x)\\/g(x) and R(x) is typically tiny compared to /c/. In this situation\nif R(x) is optimised for absolute error, then as long as its error is small compared\nto the constant /c/, that error will effectively get wiped out when R(x) is added to\n/c/.\n\nThe difficult part is obviously finding the right g(x) to extract from your\nfunction: often the asymptotic behaviour of the function will give a clue, so\nfor example the function __erfc becomes proportional to \ne[super -x[super 2]]\\/x as x becomes large. Therefore using:\n\nerfc(z) = (C + R(x)) e[super -x[super 2]]/x\n\nas the approximating form seems like an obvious thing to try, and does indeed\nyield a useful approximation.\n\nHowever, the difficulty then becomes one of converging the minimax solution.\nUnfortunately, it is known that for some functions the Remez method can lead\nto divergent behaviour, even when the initial starting approximation is quite good.\nFurthermore, it is not uncommon for the solution obtained in the first Remez step\nabove to be a bad one: the equations to be solved are generally \"stiff\", often\nvery close to being singular, and assuming a solution is found at all, round-off\nerrors and a rapidly changing error function, can lead to a situation where the\nerror function does not in fact change sign at each control point as required.\nIf this occurs, it is fatal to the Remez method. It is also possible to\nobtain solutions that are perfectly valid mathematically, but which are\nquite useless computationally: either because there is an unavoidable amount\nof roundoff error in the computation of the rational function, or because\nthe denominator has one or more roots over the interval of the approximation.\nIn the latter case while the approximation may have the correct limiting value at\nthe roots, the approximation is nonetheless useless.\n\nAssuming that the approximation does not have any fatal errors, and that the only\nissue is converging adequately on the minimax solution, the aim is to\nget as close as possible to the minimax solution before beginning the Remez method.\nUsing the zeros of a Chebyshev polynomial for the initial interpolation is a \ngood start, but may not be ideal when dealing with relative errors and\\/or\nrational (rather than polynomial) approximations. One approach is to skew\nthe initial interpolation points to one end: for example if we raise the\nroots of the Chebyshev polynomial to a positive power greater than 1 \nthen the roots will be skewed towards the middle of the \\[-1,1\\] interval, \nwhile a positive power less than one\nwill skew them towards either end. More usefully, if we initially rescale the\npoints over \\[0,1\\] and then raise to a positive power, we can skew them to the left \nor right. Returning to our example of e[super x][space] over \\[-1,1\\], the initial\ninterpolated form was some way from the minimax solution:\n\n[$images/remez-2.png]\n\nHowever, if we first skew the interpolation points to the left (rescale them\nto \\[0, 1\\], raise to the power 1.3, and then rescale back to \\[-1,1\\]) we\nreduce the error from 1.3x10[super -3][space]to 6x10[super -4]:\n\n[$images/remez-5.png]\n\nIt's clearly still not ideal, but it is only a few percent away from\nour desired minimax solution (5x10[super -4]).\n\n[h4 Remez Method Checklist]\n\nThe following lists some of the things to check if the Remez method goes wrong, \nit is by no means an exhaustive list, but is provided in the hopes that it will\nprove useful.\n\n* Is the function smooth enough? Can it be better separated into\na rapidly changing part, and an asymptotic part?\n* Does the function being approximated have any \"blips\" in it? Check\nfor problems as the function changes computation method, or\nif a root, or an infinity has been divided out. The telltale\nsign is if there is a narrow region where the Remez method will\nnot converge.\n* Check you have enough accuracy in your calculations: remember that\nthe Remez method works on the difference between the approximation\nand the function being approximated: so you must have more digits of\nprecision available than the precision of the approximation\nbeing constructed. So for example at double precision, you\nshouldn't expect to be able to get better than a float precision\napproximation.\n* Try skewing the initial interpolated approximation to minimise the\nerror before you begin the Remez steps.\n* If the approximation won't converge or is ill-conditioned from one starting\nlocation, try starting from a different location.\n* If a rational function won't converge, one can minimise a polynomial\n(which presents no problems), then rotate one term from the numerator to\nthe denominator and minimise again. In theory one can continue moving\nterms one at a time from numerator to denominator, and then re-minimising, \nretaining the last set of control points at each stage.\n* Try using a smaller interval. It may also be possible to optimise over\none (small) interval, rescale the control points over a larger interval,\nand then re-minimise.\n* Keep abscissa values small: use a change of variable to keep the abscissa\nover, say \\[0, b\\], for some smallish value /b/.\n\n[h4 References]\n\nThe original references for the Remez Method and it's extension\nto rational functions are unfortunately in Russian:\n\nRemez, E.Ya., ['Fundamentals of numerical methods for Chebyshev approximations], \n\"Naukova Dumka\", Kiev, 1969.\n\nRemez, E.Ya., Gavrilyuk, V.T., ['Computer development of certain approaches \nto the approximate construction of solutions of Chebyshev problems \nnonlinearly depending on parameters], Ukr. Mat. Zh. 12 (1960), 324-338.\n\nGavrilyuk, V.T., ['Generalization of the first polynomial algorithm of \nE.Ya.Remez for the problem of constructing rational-fractional \nChebyshev approximations], Ukr. Mat. Zh. 16 (1961), 575-585.\n\nSome English language sources include:\n\nFraser, W., Hart, J.F., ['On the computation of rational approximations \nto continuous functions], Comm. of the ACM 5 (1962), 401-403, 414.\n\nRalston, A., ['Rational Chebyshev approximation by Remes' algorithms], \nNumer.Math. 7 (1965), no. 4, 322-330.\n\nA. Ralston, ['Rational Chebyshev approximation, Mathematical \nMethods for Digital Computers v. 2] (Ralston A., Wilf H., eds.), \nWiley, New York, 1967, pp. 264-284.\n\nHart, J.F. e.a., ['Computer approximations], Wiley, New York a.o., 1968.\n\nCody, W.J., Fraser, W., Hart, J.F., ['Rational Chebyshev approximation \nusing linear equations], Numer.Math. 12 (1968), 242-251.\n\nCody, W.J., ['A survey of practical rational and polynomial \napproximation of functions], SIAM Review 12 (1970), no. 3, 400-423.\n\nBarrar, R.B., Loeb, H.J., ['On the Remez algorithm for non-linear \nfamilies], Numer.Math. 15 (1970), 382-391.\n\nDunham, Ch.B., ['Convergence of the Fraser-Hart algorithm for rational \nChebyshev approximation], Math. Comp. 29 (1975), no. 132, 1078-1082.\n\nG. L. Litvinov, ['Approximate construction of rational\napproximations and the effect of error autocorrection],\nRussian Journal of Mathematical Physics, vol.1, No. 3, 1994.\n\n[endsect][/section:remez The Remez Method]\n\n\n\n" }, { "path": "doc/test/stub.cpp", "content": "/*=============================================================================\n Copyright (c) 2006 Joel de Guzman\n http://spirit.sourceforge.net/\n\n Use, modification and distribution is subject to the Boost Software\n License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n http://www.boost.org/LICENSE_1_0.txt)\n=============================================================================*/\n#include \n\n//[ bar\n//` This is the [*/bar/] function\nstd::string bar()\n{\n // return 'em, bar man!\n return \"bar\";\n}\n//]\n\n//[ foo\n/*` This is the [*['foo]] function. */\nstd::string foo()\n{\n // return 'em, foo man!\n return \"foo\";\n}\n//]\n\n//[ foo_bar\nstd::string foo_bar() /*< The /Mythical/ FooBar.\n See [@http://en.wikipedia.org/wiki/Foobar Foobar for details] >*/\n{\n return \"foo-bar\"; /*< return 'em, foo-bar man! >*/\n}\n//]\n\n//[ class_\nclass x\n{\npublic:\n\n /*<< Constructor >>*/\n x() : n(0)\n {\n }\n\n /*<< Destructor >>*/\n ~x()\n {\n }\n\n /*<< Get the `n` member variable >>*/\n int get() const\n {\n return n; /*<- this will be ignored by quickbook ->*/\n }\n\n /*<< Set the `n` member variable >>*/\n void set(int n_)\n {\n n = n_;\n }\n//<- this will be ignored by quickbook\nprivate:\n\n int n;\n//->\n};\n//]\n" }, { "path": "doc/test/test.mml", "content": "\n \n asinh\n \n \n x\n \n \n ≈\n x\n −\n \n \n \n x\n 3\n \n \n 6\n \n \n ;\n \n x\n <\n \n ε\n \n \n\n" }, { "path": "doc/test/test.qbk", "content": "[article Document To Test Formatting\n [quickbook 1.4]\n [copyright 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias Capeletto]\n [purpose Test Formatting Document]\n [license\n Distributed under the Boost Software License, Version 1.0.\n (See accompanying file LICENSE_1_0.txt or copy at\n [@http://www.boost.org/LICENSE_1_0.txt])\n ]\n [authors [Maddock, John], [de Guzman, Joel], [Niebler, Eric], [Capeletto, Matias] ]\n [category math]\n [/last-revision $Date: 2007-05-07 10:21:52 +0100 (Mon, 07 May 2007) $]\n]\n\n[include HTML4_symbols.qbk]\n\n[/ Some composite templates]\n[template super[x]''''''[x]'''''']\n[template sub[x]''''''[x]'''''']\n[template floor[x]'''⌊'''[x]'''⌋''']\n[template floorlr[x][lfloor][x][rfloor]]\n[template ceil[x] '''⌈'''[x]'''⌉''']\n\n[section Introduction]\n\nThis document is purely a test case to test out HTML and PDF generation and style.\n\nThis is some body text.\n\n int main()\n {\n double d = 2.345;\n return d;\n }\n\nWe can count in Greek too: [alpha], [beta], [gamma].\n\nTry some superscripts and subscripts: x[super 2], x[sub i][super 3], [alpha][super 2], \n[beta][super [alpha]], [floor x], [floor [alpha]], [ceil a].\n\n[endsect]\n\n[section Code Blocks]\n\n[section Embedded code]\n\nThese should be syntax highlighted:\n\n #include \n\n int main()\n {\n // Sample code\n std::cout << \"Hello, World\\n\";\n return 0;\n }\n\n[endsect]\n\n[section Code With a Very Long Line]\n\n\ttemplate RealType inline foo(const RealType& a, const RealType& b, const RealType& c, const RealType& d, const RealType& e, const RealType& f, const RealType& g, const RealType& h){ return 0; }\n\n[endsect]\n\n[section Imported code and callouts]\n\n[import stub.cpp]\n\nHere's some code with left-placed callouts:\n\n[class_]\n\nAnd again with callouts placed exactly where we put them:\n\n[foo_bar]\n\n[endsect]\n\n[section Larger example]\n\nNow let's include a larger example, this may span several pages\nand should not be chopped off half way through... some FO processors\nget this wrong!\n\n namespace boost{\n\n template \n class sub_match;\n\n typedef sub_match csub_match;\n typedef sub_match wcsub_match;\n typedef sub_match ssub_match;\n typedef sub_match wssub_match;\n\n template \n class sub_match : public std::pair\n {\n public:\n typedef typename iterator_traits::value_type value_type;\n typedef typename iterator_traits::difference_type difference_type;\n typedef BidirectionalIterator iterator;\n\n bool matched;\n\n difference_type length()const;\n operator basic_string()const;\n basic_string str()const;\n\n int compare(const sub_match& s)const;\n int compare(const basic_string& s)const;\n int compare(const value_type* s)const;\n #ifdef BOOST_REGEX_MATCH_EXTRA\n typedef implementation-private capture_sequence_type;\n const capture_sequence_type& captures()const;\n #endif\n };\n //\n // comparisons to another sub_match:\n //\n template \n bool operator == (const sub_match& lhs,\n const sub_match& rhs);\n template \n bool operator != (const sub_match& lhs,\n const sub_match& rhs);\n template \n bool operator < (const sub_match& lhs,\n const sub_match& rhs);\n template \n bool operator <= (const sub_match& lhs,\n const sub_match& rhs);\n template \n bool operator >= (const sub_match& lhs,\n const sub_match& rhs);\n template \n bool operator > (const sub_match& lhs,\n const sub_match& rhs);\n\n\n //\n // comparisons to a basic_string:\n //\n template \n bool operator == (const std::basic_string::value_type,\n traits, \n Allocator>& lhs,\n const sub_match& rhs);\n template \n bool operator != (const std::basic_string::value_type,\n traits, \n Allocator>& lhs,\n const sub_match& rhs);\n template \n bool operator < (const std::basic_string::value_type,\n traits, \n Allocator>& lhs,\n const sub_match& rhs);\n template \n bool operator > (const std::basic_string::value_type,\n traits, \n Allocator>& lhs,\n const sub_match& rhs);\n template \n bool operator >= (const std::basic_string::value_type,\n traits, \n Allocator>& lhs,\n const sub_match& rhs);\n template \n bool operator <= (const std::basic_string::value_type,\n traits, \n Allocator>& lhs,\n const sub_match& rhs);\n\n template \n bool operator == (const sub_match& lhs,\n const std::basic_string::value_type, \n traits, \n Allocator>& rhs);\n template \n bool operator != (const sub_match& lhs,\n const std::basic_string::value_type, \n traits, \n Allocator>& rhs);\n template \n bool operator < (const sub_match& lhs,\n const std::basic_string::value_type, \n traits, \n Allocator>& rhs);\n template \n bool operator > (const sub_match& lhs,\n const std::basic_string::value_type, \n traits, \n Allocator>& rhs);\n template \n bool operator >= (const sub_match& lhs,\n const std::basic_string::value_type, \n traits, \n Allocator>& rhs);\n template \n bool operator <= (const sub_match& lhs,\n const std::basic_string::value_type, \n traits, \n Allocator>& rhs);\n\n //\n // comparisons to a pointer to a character array:\n //\n template \n bool operator == (typename iterator_traits::value_type const* lhs,\n const sub_match& rhs); \n template \n bool operator != (typename iterator_traits::value_type const* lhs,\n const sub_match& rhs); \n template \n bool operator < (typename iterator_traits::value_type const* lhs,\n const sub_match& rhs); \n template \n bool operator > (typename iterator_traits::value_type const* lhs,\n const sub_match& rhs); \n template \n bool operator >= (typename iterator_traits::value_type const* lhs,\n const sub_match& rhs); \n template \n bool operator <= (typename iterator_traits::value_type const* lhs,\n const sub_match& rhs); \n\n template \n bool operator == (const sub_match& lhs,\n typename iterator_traits::value_type const* rhs); \n template \n bool operator != (const sub_match& lhs,\n typename iterator_traits::value_type const* rhs); \n template \n bool operator < (const sub_match& lhs,\n typename iterator_traits::value_type const* rhs); \n template \n bool operator > (const sub_match& lhs,\n typename iterator_traits::value_type const* rhs); \n template \n bool operator >= (const sub_match& lhs,\n typename iterator_traits::value_type const* rhs); \n template \n bool operator <= (const sub_match& lhs,\n typename iterator_traits::value_type const* rhs); \n\n //\n // comparisons to a single character:\n //\n template \n bool operator == (typename iterator_traits::value_type const& lhs,\n const sub_match& rhs); \n template \n bool operator != (typename iterator_traits::value_type const& lhs,\n const sub_match& rhs); \n template \n bool operator < (typename iterator_traits::value_type const& lhs,\n const sub_match& rhs); \n template \n bool operator > (typename iterator_traits::value_type const& lhs,\n const sub_match& rhs); \n template \n bool operator >= (typename iterator_traits::value_type const& lhs,\n const sub_match& rhs); \n template \n bool operator <= (typename iterator_traits::value_type const& lhs,\n const sub_match& rhs); \n\n template \n bool operator == (const sub_match& lhs,\n typename iterator_traits::value_type const& rhs); \n template \n bool operator != (const sub_match& lhs,\n typename iterator_traits::value_type const& rhs); \n template \n bool operator < (const sub_match& lhs,\n typename iterator_traits::value_type const& rhs); \n template \n bool operator > (const sub_match& lhs,\n typename iterator_traits::value_type const& rhs); \n template \n bool operator >= (const sub_match& lhs,\n typename iterator_traits::value_type const& rhs); \n template \n bool operator <= (const sub_match& lhs,\n typename iterator_traits::value_type const& rhs); \n // \n // addition operators: \n //\n template \n std::basic_string::value_type, traits, Allocator> \n operator + (const std::basic_string::value_type,\n traits, \n Allocator>& s, \n const sub_match& m); \n template \n std::basic_string::value_type, traits, Allocator>\n operator + (const sub_match& m,\n const std::basic_string::value_type, \n traits, \n Allocator>& s); \n template \n std::basic_string::value_type> \n operator + (typename iterator_traits::value_type const* s,\n const sub_match& m); \n template \n std::basic_string::value_type> \n operator + (const sub_match& m,\n typename iterator_traits::value_type const * s);\n template \n std::basic_string::value_type> \n operator + (typename iterator_traits::value_type const& s,\n const sub_match& m); \n template \n std::basic_string::value_type> \n operator + (const sub_match& m,\n typename iterator_traits::value_type const& s); \n template \n std::basic_string::value_type> \n operator + (const sub_match& m1,\n const sub_match& m2);\n\n //\n // stream inserter:\n //\n template \n basic_ostream&\n operator << (basic_ostream& os,\n const sub_match& m);\n\n } // namespace boost\n\n[endsect]\n\n[endsect]\n\n[section Basic Formatting]\n\n[section Font Styles]\n\nHere we go with some inline formatting: \n['italic], [*bold], [_underline], [^teletype], [-strikethrough],\nwe can combine styles as well: ['[*bold italic]], [_[^teletype with underline]].\n\n[endsect]\n\n[section Replaceable Text]\n\nText that is intended to be user-replaceable is [~rendered like this].\n\n[endsect]\n\n[section Quotations]\n\nHere we go: [\"A question that sometimes drives me hazy: am I or are the others crazy?]--Einstein\n\nNote the proper left and right quote marks. Also, while you can simply use ordinary quote marks like \"quoted\", our quotation, above, will generate correct DocBook quotations (e.g. quoted).\n\nLike all phrase elements, quotations may be nested. Example:\n\n[\"Here's the rule for bargains: [\"Do other men, for they would do you.] That's\nthe true business precept.]\n\n[endsect]\n\n[section Inline Code]\n\nThis text has inlined code `int main() { return 0; }` in it. \nThe code should be syntax highlighted.\n\n[endsect]\n\n[section Links]\n\nTry this: [@http://www.boost.org this is [*boost's] website....] it should\nbe visible as a link.\n\nThis is [@../../../boost/math/distributions.hpp a link to a header file (boost/math/distributions.hpp)],\nit should be rewritable and point to the website when built as a PDF.\n\nThis is [@boost:libs/regex/index.html a link to another library's documentation (Boost.Regex)], using the boost: protocol,\nit should be rewritten to point to the website when building a PDF.\n\nThis is [@boost:/libs/regex/index.html a link to another library's documentation (Boost.Regex)], using the boost:/ protocol,\nit should be rewritten to point to the website when building a PDF.\n\nThis is [@../weighted_tail_quantile.hpp a relative link to a header file within the test source],\nit should be rewritten to point to the website when building a PDF.\nAlthough it might be on the website yet.\n\n[endsect]\n\n[section Footnotes]\n\nHere's one [footnote A sample footnote].\n\nAnd here's another [footnote Another sample footnote].\n\n[endsect]\n\n[section Blockquote]\n\nLets indent the next paragraph:\n\n[:Here we go!!!]\n\n[endsect]\n\n[section Headings]\n\nNow try rendering some heading styles:\n\n[h1 Heading 1]\n\n[h2 Heading 2]\n\n[h3 Heading 3]\n\n[h4 Heading 4]\n\n[h5 Heading 5]\n\n[h6 Heading 6]\n\n[endsect]\n\n[endsect]\n\n[section Blurbs]\n\n[section Preformatted text]\n\nHere's some sample program output:\n\n[pre\n'''F test for equal standard deviations\n____________________________________\n\nSample 1:\nNumber of Observations = 240\nSample Standard Deviation = 65.549\n\nSample 2:\nNumber of Observations = 240\nSample Standard Deviation = 61.854\n\nTest Statistic = 1.123\n\nCDF of test statistic: = 8.148e-001\nUpper Critical Value at alpha: = 1.238e+000\nUpper Critical Value at alpha/2: = 1.289e+000\nLower Critical Value at alpha: = 8.080e-001\nLower Critical Value at alpha/2: = 7.756e-001\n\nResults for Alternative Hypothesis and alpha = 0.0500\n\nAlternative Hypothesis Conclusion\nStandard deviations are unequal (two sided test) REJECTED\nStandard deviation 1 is less than standard deviation 2 REJECTED\nStandard deviation 1 is greater than standard deviation 2 REJECTED'''\n]\n\n[endsect]\n\n[section Admonishments]\n\nThere are four admonishments supported by Docbook XML:\n\n[note This is a note]\n\n[tip This is a tip]\n\n[important This is important]\n\n[caution This is a caution]\n\n[warning This is a warning\n\nThey can contain more than one paragraph.\n]\n\n[endsect]\n\n[section Blurbs]\n\n[blurb [*An eye catching advertisement or note...]\n\nThese should be rendered in a manner similar to admonishments.\n\nThey can contain more than one paragraph.\n]\n\n[endsect]\n\n[endsect]\n\n[section Lists and Tables]\n\n[section Lists]\n\nA numbered list:\n\n# One\n# Two\n# Three\n # Three.a\n # Three.b\n # Three.c\n# Four\n # Four.a\n # Four.a.i\n # Four.a.ii\n# Five\n\nAn unordered list:\n\n* First\n* Second\n* Third\n\nA mixture of the two:\n\n# 1\n * 1.a\n # 1.a.1\n # 1.a.2\n * 1.b\n# 2\n * 2.a\n * 2.b\n # 2.b.1\n # 2.b.2\n * 2.b.2.a\n * 2.b.2.b\n\n\n[endsect]\n\n[section Variable Lists]\n\n[variablelist A Variable List\n [[term 1] [The definition of term 1]]\n [[term 2] [The definition of term 2]]\n [[term 3] [The definition of term 3]]\n]\n\n[endsect]\n\n[section Tables]\n\nHere's a big table with code and other tricky things:\n\n[table Notes on the Implementation of the Beta Distribution\n[[Function][Implementation Notes]]\n[[pdf]\n [f(x;[alpha],[beta]) = x[super[alpha] - 1] (1 - x)[super[beta] -1] / B([alpha], [beta])\n\n Implemented using ibeta_derivative(a, b, x).]]\n\n[[cdf][Using the incomplete beta function ibeta(a, b, x)]]\n[[cdf complement][ibetac(a, b, x)]]\n[[quantile][Using the inverse incomplete beta function ibeta_inv(a, b, p)]]\n[[quantile from the complement][ibetac_inv(a, b, q)]]\n[[mean][`a/(a+b)`]]\n[[variance][`a * b / (a+b)^2 * (a + b + 1)`]]\n[[mode][`(a-1) / (a + b + 2)`]]\n[[skewness][`2 (b-a) sqrt(a+b+1)/(a+b+2) * sqrt(a * b)`]]\n[[kurtosis excess][ [$images/beta_dist_kurtosis.png] ]]\n[[kurtosis][`kurtosis + 3`]]\n[[parameter estimation][ ]]\n[[alpha\n\n from mean and variance][`mean * (( (mean * (1 - mean)) / variance)- 1)`]]\n[[beta\n\n from mean and variance][`(1 - mean) * (((mean * (1 - mean)) /variance)-1)`]]\n[[The member functions `estimate_alpha` and `estimate_beta`\n\n from cdf and probability x\n \n and *either* `alpha` or `beta`]\n [Implemented in terms of the inverse incomplete beta functions\n \nibeta_inva, and ibeta_invb respectively.]]\n[[`estimate_alpha`][`ibeta_inva(beta, x, probability)`]]\n[[`estimate_beta`][`ibeta_invb(alpha, x, probability)`]]\n]\n\n[endsect]\n\n[endsect]\n\n[section Images]\n\nThese are tricky enough that they warrant their own section.\n\nLet's start with a PNG file that's set to 120dpi, it should render at \na sensible size in both html and PDF forms. It should print OK too!\n\n[$images/digamma3.png]\n\nNow try again with a sample SVG image:\n\n[$images/open_clipart_library_logo.svg]\n\n\n[endsect]\n\n[section Equations]\n\nThis page is largely to test equation handling in various browsers, unfortunately none of this works as well as it should (or at all?)\nin Internet Explorer....\n\nThis equation is formatted from Latex text:\n\n'''ax^2 + bx + c = 0'''\n\nThis equation is formed from MathML:\n\n''''''\n\nThis equation is SVG:\n\n''''''\n\n\n[endsect]\n\n[include test_HTML4_symbols.qbk]\n\n[include remez.qbk]\n\n[section:array Array Example Boostbook XML Documentation]\n[xinclude array.xml]\n[xinclude array1.xml]\n[xinclude array2.xml]\n[xinclude array3.xml]\n[xinclude array4.xml]\n[endsect]\n\n[section:accumulators Accumulators Example Doxygen Documentation]\n[xinclude statsdoc.xml]\n[endsect]\n\n\n\n" }, { "path": "doc/test/test_HTML4_symbols.qbk", "content": "[section:test test HTML4 symbols]\n[/ Examples of using all the Greek and Math symbols defined in HTML4_symbols.qbk]\n[/ See http://www.htmlhelp.com/reference/html40/entities/symbols.html]\n\n[/ Also some miscellaneous math characters added to this list - see the end.]\n\n[/ To use, enclose the template name in square brackets.]\n\n[section test Greek and Math symbols]\n\n[fnof],\n[Alpha],\n[Beta],\n[Gamma],\n[Delta],\n[Epsilon],\n[Zeta],\n[Eta],\n[Theta],\n[Iota],\n[Kappa],\n[Lambda],\n[Mu],\n[Nu],\n[Xi],\n[Omicron],\n[Pi],\n[Rho],\n[Sigma],\n[Tau],\n[Upsilon],\n[Phi],\n[Chi],\n[Psi],\n[Omega],\n[alpha],\n[beta],\n[gamma],\n[delta],\n[epsilon],\n[zeta],\n[eta],\n[theta],\n[iota],\n[kappa],\n[lambda],\n[mu],\n[nu],\n[xi],\n[omicron],\n[pi],\n[rho],\n[sigmaf],\n[sigma],\n[tau],\n[upsilon],\n[phi],\n[chi],\n[psi],\n[omega],\n[thetasym],\n[upsih],\n[piv],\n[bull],\n[hellip],\n[prime],\n[Prime],\n[oline],\n[frasl],\n[weierp],\n[image],\n[real],\n[trade],\n[alefsym],\n[larr],\n[uarr],\n[rarr],\n[darr],\n[harr],\n[crarr],\n[lArr],\n[uArr],\n[rArr],\n[dArr],\n[hArr],\n[forall],\n[part],\n[exist],\n[empty],\n[nabla],\n[isin],\n[notin],\n[ni],\n[prod],\n[sum],\n[minus],\n[lowast],\n[radic],\n[prop],\n[infin],\n[ang],\n[and],\n[or],\n[cap],\n[cup],\n[int],\n[there4],\n[sim],\n[cong],\n[asymp],\n[ne],\n[equiv],\n[le],\n[ge],\n[subset],\n[superset],\n[nsubset],\n[sube],\n[supe],\n[oplus],\n[otimes],\n[perp],\n[sdot],\n[lceil],\n[rceil],\n[lfloor],\n[rfloor],\n[lang],\n[rang],\n[loz],\n[spades],\n[clubs],\n[hearts],\n[diams]\n\n[endsect]\n\n[section test Latin1 symbols]\n[/ Examples of using all the symbols defined in Latin1_symbols.qbk]\n[/ http://www.htmlhelp.com/reference/html40/entities/latin1.html ]\n\n[/ To use, enclose the template name in square brackets.]\n\n[nbsp],\n[iexcl],\n[cent],\n[pound],\n[curren],\n[yen],\n[brvbar],\n[sectsign],\n[uml],\n[copy],\n[ordf],\n[laquo],\n[not],\n[shy],\n[reg],\n[macron],\n[deg],\n[plusmn],\n[sup2],\n[cubed],\n[acute],\n[micro],\n[para],\n[middot],\n[cedil],\n[sup1],\n[ordm],\n[raquo],\n[frac14],\n[frac12],\n[frac34],\n[iquest],\n[Agrave],\n[Aacute],\n[Acirc],\n[Atilde],\n[Auml],\n[Aring],\n[AElig],\n[Ccedil],\n[Egrave],\n[Eacute],\n[Ecirc],\n[Euml],\n[Igrave],\n[Iacute],\n[Icirc],\n[Iuml],\n[ETH],\n[Ntilde],\n[Ograve],\n[Oacute],\n[Ocirc],\n[Otilde],\n[Ouml],\n[times],\n[Oslash],\n[Ugrave],\n[Uacute],\n[Ucirc],\n[Uuml],\n[Yacute],\n[THORN],\n[szlig],\n[agrave],\n[aacute],\n[acirc],\n[atilde],\n[auml],\n[aring],\n[aelig],\n[ccedil],\n[egrave],\n[eacute],\n[ecirc],\n[euml],\n[igrave],\n[iacute],\n[icirc],\n[iuml],\n[eth],\n[ntilde],\n[ograve],\n[oacute],\n[ocirc],\n[otilde],\n[ouml],\n[divide],\n[oslash],\n[ugrave],\n[uacute],\n[ucirc],\n[uuml],\n[yacute],\n[thorn],\n[yuml],\n\n[endsect]\n\n\n[endsect]\n\n[/ testsymbols.qbk\n Copyright 2006 John Maddock and Paul A. Bristow.\n Distributed under the Boost Software License, Version 1.0.\n (See accompanying file LICENSE_1_0.txt or copy at\n http://www.boost.org/LICENSE_1_0.txt).\n]\n\n\n" }, { "path": "doc/test/weighted_tail_quantile.hpp", "content": "///////////////////////////////////////////////////////////////////////////////\n// weighted_tail_quantile.hpp\n//\n// Copyright 2006 Daniel Egloff, Olivier Gygi. Distributed under the Boost\n// Software License, Version 1.0. (See accompanying file\n// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n#ifndef BOOST_ACCUMULATORS_STATISTICS_WEIGHTED_TAIL_QUANTILE_HPP_DE_01_01_2006\n#define BOOST_ACCUMULATORS_STATISTICS_WEIGHTED_TAIL_QUANTILE_HPP_DE_01_01_2006\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#ifdef _MSC_VER\n# pragma warning(push)\n# pragma warning(disable: 4127) // conditional expression is constant\n#endif\n\nnamespace boost { namespace accumulators\n{\n\nnamespace impl\n{\n ///////////////////////////////////////////////////////////////////////////////\n // weighted_tail_quantile_impl\n // Tail quantile estimation based on order statistics of weighted samples\n /**\n @brief Tail quantile estimation based on order statistics of weighted samples (for both left and right tails)\n\n An estimator \\f$\\hat{q}\\f$ of tail quantiles with level \\f$\\alpha\\f$ based on order statistics\n \\f$X_{1:n} \\leq X_{2:n} \\leq\\dots\\leq X_{n:n}\\f$ of weighted samples are given by \\f$X_{\\lambda:n}\\f$ (left tail)\n and \\f$X_{\\rho:n}\\f$ (right tail), where\n\n \\f[\n \\lambda = \\inf\\left\\{ l \\left| \\frac{1}{\\bar{w}_n}\\sum_{i=1}^{l} w_i \\geq \\alpha \\right. \\right\\}\n \\f]\n\n and\n\n \\f[\n \\rho = \\sup\\left\\{ r \\left| \\frac{1}{\\bar{w}_n}\\sum_{i=r}^{n} w_i \\geq (1 - \\alpha) \\right. \\right\\},\n \\f]\n\n \\f$n\\f$ being the number of samples and \\f$\\bar{w}_n\\f$ the sum of all weights.\n\n @param quantile_probability\n */\n template\n struct weighted_tail_quantile_impl\n : accumulator_base\n {\n typedef typename numeric::functional::average::result_type float_type;\n // for boost::result_of\n typedef Sample result_type;\n\n weighted_tail_quantile_impl(dont_care) {}\n\n template\n result_type result(Args const &args) const\n {\n float_type threshold = sum_of_weights(args)\n * ( ( is_same::value ) ? args[quantile_probability] : 1. - args[quantile_probability] );\n\n std::size_t n = 0;\n Weight sum = Weight(0);\n\n while (sum < threshold)\n {\n if (n < static_cast(tail_weights(args).size()))\n {\n sum += *(tail_weights(args).begin() + n);\n n++;\n }\n else\n {\n if (std::numeric_limits::has_quiet_NaN)\n {\n return std::numeric_limits::quiet_NaN();\n }\n else\n {\n std::ostringstream msg;\n msg << \"index n = \" << n << \" is not in valid range [0, \" << tail(args).size() << \")\";\n boost::throw_exception(std::runtime_error(msg.str()));\n return Sample(0);\n }\n }\n }\n\n // Note that the cached samples of the left are sorted in ascending order,\n // whereas the samples of the right tail are sorted in descending order\n return *(boost::begin(tail(args)) + n - 1);\n }\n };\n} // namespace impl\n\n///////////////////////////////////////////////////////////////////////////////\n// tag::weighted_tail_quantile<>\n//\nnamespace tag\n{\n template\n struct weighted_tail_quantile\n : depends_on >\n {\n /// INTERNAL ONLY\n typedef accumulators::impl::weighted_tail_quantile_impl impl;\n };\n}\n\n///////////////////////////////////////////////////////////////////////////////\n// extract::weighted_tail_quantile\n//\nnamespace extract\n{\n extractor const weighted_tail_quantile = {};\n}\n\nusing extract::weighted_tail_quantile;\n\n}} // namespace boost::accumulators\n\n#ifdef _MSC_VER\n# pragma warning(pop)\n#endif\n\n#endif\n" }, { "path": "index.htm", "content": "\n\n\n\n \n\n \n \n\n\n\n Automatic redirection failed, please go to index.html.\n\n
\n

Copyright 2008 Rene Rivera

\n\n

Distributed under the Boost Software License, Version 1.0. (See\n accompanying file LICENSE_1_0.txt or copy\n at http://www.boost.org/LICENSE_1_0.txt)

\n
\n\n\n" }, { "path": "index.html", "content": "\n\n\n\n Boost C++ Libraries\n \n\n\n\n \n \n \n \n \n
\n \n \"boost.png\n

\n {{#is_develop}}Development Snapshot{{/is_develop}}\n {{^is_develop}}Release {{version}}{{/is_develop}}\n

\n
\n\n \n \n \n \n
Getting Started   \n   Libraries   \n   Tools   \n   Web Site   \n   News   \n   Community   \n   FAQ   \n   More Info
\n\n\n

Welcome to the Boost C++ Libraries

\n\n

Boost provides free peer-reviewed portable C++ source libraries.

\n\n

We emphasize libraries that work well with the C++ Standard Library.\n Boost libraries are intended to be widely useful, and usable across a broad\n spectrum of applications. The Boost license encourages both\n commercial and non-commercial use.

\n\n

We aim to establish \"existing practice\" and provide reference\n implementations so that Boost libraries are suitable for eventual\n standardization. Ten Boost libraries are already included in the C++ Standards Committee's\n Library Technical Report (TR1)\n and will be included in the upcoming revision of the C++ Standard. More\n Boost libraries are proposed for the upcoming TR2.

\n\n

Changes in this release

\n\n {{#unreleased_lib_count}}\n

\n {{#is_develop}}This development snapshot{{/is_develop}}\n {{^is_develop}}Boost {{minor_release}}{{/is_develop}}\n includes {{unreleased_lib_count}} new\n {{#unreleased_library_plural}}libraries{{/unreleased_library_plural}}\n {{^unreleased_library_plural}}library{{/unreleased_library_plural}}\n ({{#unreleased_libs}}{{#index}}, {{/index}}{{name}}{{/unreleased_libs}})\n as well as updates to many existing libraries.\n {{/unreleased_lib_count}}\n {{^unreleased_lib_count}}\n

The release includes updates to many existing libraries.\n {{/unreleased_lib_count}}\n See\n Release\n History for more information.

\n\n

Getting Started

\n\n

If Boost hasn't already been installed on your system, follow the\n Getting Started Guide to\n complete the installation. But if you've reached to this point by\n installing Boost from a Windows pre-build executable or a pre-built Linux\n and Unix distribution package, that's already been completed. Likewise, if\n you're reading this on your organization's internal web server, the\n installation is probably already complete.

\n\n

Contents

\n\n

The release directory tree contains almost all of Boost; documentation,\n sources, headers, scripts, tools, and everything else a Boost user might\n need!

\n\n

Library Documentation

\n\n

The starting point for the documentation of individual libraries is the\n Libraries page, which gives a brief\n description of each library and links to its documentation.

\n\n

Web Site

\n\n

Some general interest or often changing Boost information lives only on\n the Boost web site. The release contains\n links to the site, so while browsing it you'll see occasional broken links\n if you aren't connected to the Internet. But everything needed to use the\n Boost libraries is contained within the release.

\n\n

Background

\n\n

Read the introductory material\n to help you understand what Boost is about and to help in educating your\n organization about Boost.

\n\n

Community

\n\n

Boost welcomes and thrives on participation from a variety of\n individuals and organizations. Many avenues for participation are available\n in the Boost Community.

\n\n
\n

Copyright © 2008 Beman Dawes, Rene Rivera

\n\n

Distributed under the Boost Software License, Version 1.0. (See\n accompanying file LICENSE_1_0.txt or copy\n at http://www.boost.org/LICENSE_1_0.txt)

\n\n

This software is Open Source\n Initiative approved Open Source Software.

\n\n

Open Source Initiative Approved is a trademark of the Open Source\n Initiative.

\n
\n\n\n" }, { "path": "libs/Jamfile.v2", "content": "# Jamfile.v2\n#\n# Copyright (C) 2013 Bjorn Roald\n#\n# Distributed under the Boost Software License, Version 1.0.\n# See www.boost.org/LICENSE_1_0.txt\n#\n# Boost libraries common project properties:\n#\n# Under modularized layout, ensure all inheriting projects get\n# implicit dependency to headers staged as links in /boost\n\nproject boost/libs\n : requirements /boost//headers\n ;\n" }, { "path": "libs/index.html", "content": "\n\n\n\n\nAutomatic redirection failed, please go to\nlibraries.htm.\n
\n

Copyright Beman Dawes, 2001

\n

Distributed under the Boost Software \nLicense, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at \nwww.boost.org/LICENSE_1_0.txt)

\n\n" }, { "path": "libs/libraries.htm", "content": "{{! This is a template for the library list. See the generated file at:\n http://www.boost.org/doc/libs/develop/libs/libraries.htm\n}}\n\n\n\n\n\n\n\n\nBoost Libraries\n\n\n\n\n\n \n \n \n \n \n
\n \n \"boost.png\n Libraries\n
\n\n \n \n \n \n
Getting Started   \n      Tools   \n      Web Site   \n      News   \n      Community   \n     \n FAQ   \n      More Info
\n\n
\n
Libraries Listed Alphabetically
\n
Libraries Listed by Category
\n
\n{{#categorized}}\n
{{title}}
\n{{/categorized}}\n
\n
Libraries Retired from Boost
\n
\n\n

See Getting Started page to find out\nhow to download, build, and install the libraries.

\n\n
\n\n

Libraries Listed Alphabetically

\n\n
    \n{{#alphabetic}}\n
  • {{name}} - {{description}}{{#authors}}, from {{authors}}{{/authors}}
    • \n{{/alphabetic}}\n
\n\n
\n\n

Libraries Listed by Category

\n\n{{#categorized}}\n

{{title}}

\n\n
    \n{{#libraries}}\n
  • {{name}} - {{description}}{{#authors}}, from {{authors}}{{/authors}}
    • \n{{/libraries}}\n
\n\n{{/categorized}}\n\n

[Category suggestions from Aleksey Gurtovoy, Beman Dawes and Vicente J. Botet Escribá]

\n\n
\n\n

Libraries Retired from Boost

\n\n
    \n
  • compose - Functional composition adapters for the STL,\n from Nicolai Josuttis. Removed in Boost version 1.32.\n Please use Bind or Lambda instead.
    • \n
  • signals (v1) - Managed signals and slots callback implementation, from\n Doug Gregor. Removed in Boost version 1.69. Please use\n Signals2 instead.
    • \n
\n\n
\n\n

Revised\n19 Feb 2015

\n\n

© Copyright Beman Dawes 2000-2004

\n

Distributed under the Boost Software License, Version 1.0.\n(See file LICENSE_1_0.txt\nor www.boost.org/LICENSE_1_0.txt)\n

\n\n\n\n" }, { "path": "libs/maintainers.txt", "content": "# Copyright (C) 2005, 2007 Douglas Gregor \n# Distributed under the Boost Software License, Version 1.0. \n# See www.boost.org/LICENSE_1_0.txt\n#\n# This file lists the names and e-mail addresses of the maintainers\n# of each Boost library, and is used by the regression-reporting \n# scripts to direct e-mail related to those libraries to the \n# maintainers.\n#\n# This file is automatically updated from library metadata.\n\naccumulators Eric Niebler \nalgorithm Marshall Clow \nalgorithm/minmax Marshall Clow \nalgorithm/string Marshall Clow \nalign Glen Fernandes \nany Antony Polukhin \narray Marshall Clow \nasio Chris Kohlhoff \nassert Peter Dimov \nassign Thorsten Ottosen \natomic Helge Bahmann , Tim Blechmann , Andrey Semashev \nbeast Vinnie Falco \nbimap Matias Capeletto \nbind Peter Dimov \ncallable_traits Barrett Adair \ncharconv Matt Borland \nchrono Vicente J. Botet Escriba \nchrono/stopwatch Vicente J. Botet Escriba \ncircular_buffer Jan Gaspar \ncobalt Klemens Morgenstern \ncompat Peter Dimov \ncompute Kyle Lutz \nconcept_check Jeremy Siek \nconfig John Maddock \ncontainer Ion Gaztanaga \ncontainer_hash Peter Dimov \ncontext Oliver Kowalke \ncontract Lorenzo Caminiti \nconversion Antony Polukhin \nconvert Vladimir Batov \ncore Peter Dimov , Glen Fernandes , Andrey Semashev \ncoroutine Oliver Kowalke \ncoroutine2 Oliver Kowalke \ncrc Daryle Walker \ndate_time Jeff Garland , James E. King III \ndescribe Peter Dimov \ndetail Robert Ramey , Rene Rivera , Andrey Semashev \ndisjoint_sets Jeremy Siek \ndll Antony Polukhin \ndynamic_bitset Jeremy Siek \nendian Peter Dimov \nexception Emil Dotchevski \nfiber Oliver Kowalke \nfilesystem Andrey Semashev \nflyweight Joaquin M Lopez Munoz \nforeach Eric Niebler \nformat Samuel Krempp , James E. King III \nfunction Peter Dimov \nfunction_types Tobias Schwinger \nfunctional\nfunctional/factory Glen Fernandes , Tobias Schwinger \nfunctional/forward Tobias Schwinger \nfunctional/hash Daniel James \nfunctional/overloaded_function Lorenzo Caminiti \nfusion Joel de Guzman , Dan Marsden , Tobias Schwinger \ngeometry Barend Gehrels , Bruno Lalande , Mateusz Loskot , Adam Wulkiewicz , Vissarion Fisikopoulos \ngeometry/extensions Barend Gehrels , Bruno Lalande , Mateusz Loskot , Adam Wulkiewicz \ngeometry/index Barend Gehrels , Bruno Lalande , Mateusz Loskot , Adam Wulkiewicz , Vissarion Fisikopoulos \ngil Stefan Seefeld , Mateusz Loskot , Pranam Lashkari \ngraph Jeremy W. Murphy \ngraph_parallel K. Noel Belcourt \nhana Louis Dionne \nheap Tim Blechmann \nhistogram Hans Dembinski \nhof Paul Fultz II \nicl Joachim Faulhaber \ninteger Daryle Walker , Andrey Semashev \ninterprocess Ion Gaztanaga \nintrusive Ion Gaztanaga \nio Glen Fernandes \niostreams Jonathan Turkanis \niterator David Abrahams , Thomas Witt , Jeffrey Lee Hellrung Jr. \niterator_facade Zach Laine \njson Vinnie Falco \nlambda Jaakko Jarvi \nlambda2 Peter Dimov \nleaf Emil Dotchevski\nlexical_cast Antony Polukhin \nlocal_function Lorenzo Caminiti \nlocale Artyom Beilis , Alexander Grund \nlockfree Tim Blechmann \nlog Andrey Semashev \nlogic Douglas Gregor \nmath John Maddock , Chris Kormanyos , Nick Thompson , Matt Borland \nmetaparse Abel Sinkovics \nmove Ion Gaztanaga \nmp11 Peter Dimov \nmpi K. Noel Belcourt , Alain Miniussi \nmpl Aleksey Gurtovoy \nmsm Christophe Henry \nmulti_array Ronald Garcia \nmulti_index Joaquin M Lopez Munoz \nmultiprecision John Maddock , christopher Kormanyos \nmysql Rubén Pérez \nnowide Alexander Grund \nnumeric/conversion Fernando Cacciola , Brandon Kohn \nnumeric/interval Sylvain Pion , Herve Bronnimann , Guillaume Melquiond \nnumeric/odeint Karsten Ahnert , Mario Mulansky , Matt Borland , Nick Thompson \nnumeric/ublas David Bellot , Stefan Seefeld \noperators Daniel Frey \noptional Fernando Cacciola , Andrzej Krzemienski \noutcome Niall Douglas \nparameter David Abrahams , Daniel Wallin \nparameter_python David Abrahams , Daniel Wallin \npfr Antony Polukhin \nphoenix Joel de Guzman , Thomas Heller , John Fletcher \npoly_collection Joaquin M Lopez Munoz \npolygon Lucanus Simonson , Andrii Sydorchuk \npool Stephen Cleary \npredef René Ferdinand Rivera Morell \npreprocessor Paul Mensonides , Edward Diener \nprocess Klemens D. Morgenstern \nprogram_options Vladimir Prus \nproperty_map Douglas Gregor \nproperty_map_parallel Douglas Gregor \nproperty_tree Richard Hodges \nproto Eric Niebler \nptr_container Thorsten Ottosen \npython Stefan Seefeld \nqvm Emil Dotchevski \nrandom Steven Watanabe , Matt Borland \nrange Neil Groves , Nathan Ridge \nratio Vicente J. Botet Escriba \nrational Jonathan Turkanis \nredis Marcelo Zimbres Silva \nregex John Maddock \nsafe_numerics Robert Ramey \nscope Andrey Semashev \nscope_exit Alexander Nasonov , Lorenzo Caminiti \nserialization Robert Ramey \nsignals Douglas Gregor \nsignals2 Frank Mori Hess \nsmart_ptr Peter Dimov \nsmart_ptr/make_shared Glen Fernandes \nsort Steven Ross \nspirit Joel de Guzman , Hartmut Kaiser \nspirit/classic Joel de Guzman , Hartmut Kaiser \nspirit/repository Joel de Guzman , Hartmut Kaiser \nstacktrace Antony Polukhin \nstatechart Andreas Huber \nstatic_assert John Maddock \nstatic_string Krystian Stasiowski , Alan de Freitas , Vinnie Falco \nstl_interfaces Zach Laine \nsystem Peter Dimov \ntest Gennadiy Rozental , Raffi Enficiaud , Matt Borland \nthread Vicente J. Botet Escriba \nthrow_exception Emil Dotchevski , Peter Dimov \ntimer Peter Dimov \ntokenizer John R. Bandela \ntr1 John Maddock \ntti Edward Diener \ntuple Jaakko Jarvi \ntype_erasure Steven Watanabe \ntype_index Antony Polukhin \ntype_traits John Maddock \ntypeof Arkadiy Vertleyb , Peder Holt \nunits Jürgen Hunold , Steven Watanabe \nunordered Christian Mazakas , Joaquín M López Muñoz \nurl Vinnie Falco , Alan de Freitas \nutility\nutility/enable_if Jaakko Jarvi , Jeremiah Willcock \nutility/identity_type Lorenzo Caminiti \nutility/ostream_string Glen Fernandes \nutility/result_of Daniel Walker \nutility/string_ref Marshall Clow \nutility/string_view Marshall Clow \nutility/swap Joseph Gauterin \nuuid Andy Tompkins , James E. King III \nvariant Antony Polukhin , Eric Friedman \nvariant2 Peter Dimov \nvmd Edward Diener \nwave Hartmut Kaiser \nwinapi Andrey Semashev \nxpressive Eric Niebler \nyap Zach Laine \n\n\n\n" }, { "path": "libs/numeric/doc/build.jam", "content": "# Copyright (c) 2016 Rene Rivera\n#\n# Distributed under the Boost Software License, Version 1.0.\n# (See accompanying file LICENSE_1_0.txt or copy at\n# http://www.boost.org/LICENSE_1_0.txt)\n\n###############################################################################\nalias boostdoc ;\nexplicit boostdoc ;\nalias boostrelease : ../conversion/doc//standalone ../odeint/doc//standalone ;\nexplicit boostrelease ;\n" }, { "path": "libs/numeric/index.html", "content": "\n\n\n\n\nAutomatic redirection failed, please go to\nublas/doc/index.html. 
\n

Copyright Beman Dawes, 2001

\n

Distributed under the Boost Software License, Version 1.0. (See accompanying \nfile LICENSE_1_0.txt or copy \nat www.boost.org/LICENSE_1_0.txt)\n

\n\n\n" }, { "path": "libs/numeric/sublibs", "content": "The existance of this file tells the regression reporting programs that the directory contains sub-directories which are libraries." }, { "path": "libs/platform_maintainers.txt", "content": "# Copyright (C) 2005, 2007 Douglas Gregor \n# Distributed under the Boost Software License, Version 1.0. \n# See www.boost.org/LICENSE_1_0.txt\n#\n# This file lists the names and e-mail addresses of the maintainers\n# of each Boost testing platform , and is used by the regression-\n# reporting scripts to direct e-mail related to those platforms to the \n# maintainers. When making changes to this file, please be careful\n# to closely follow the format of the library.\n#\n# The format of each line is:\n#\n# Runner Platform Email addresses\n\nSandia-darwin-intel darwin-4.0.1\t Noel Belcourt \nSandia-darwin-ppc darwin-4.0.1\t Noel Belcourt \nSandia-intel intel-linux-8.1 Noel Belcourt \nSandia-intel intel-linux-9.0 Noel Belcourt \nSandia-intel intel-linux-9.1 Noel Belcourt \nSandia-gcc gcc-4.2.1 Noel Belcourt \nSandia-gcc gcc-3.4.3 Noel Belcourt \nSandia-gcc gcc-4.0.1 Noel Belcourt \nSandia-gcc-64 gcc-4.2.1 Noel Belcourt \nSandia-gcc-64 gcc-4.1.1 Noel Belcourt \nSandia-sun gcc-3.4.6 Noel Belcourt \nSandia-sun sun-5.7 Noel Belcourt \nSandia-sun sun-5.8 Noel Belcourt \nSandia-sun sun-5.9 Noel Belcourt \n\"Martin Wille x86_64\" gcc-4.2.1_linux_x86_64 Martin Wille \n\"Martin Wille x86_64\" gcc-3.4.6_linux_x86_64 Martin Wille \nHuang-WinXP-x86_32 intel-vc8-win-10.0 Sean Huang \nHuang-WinXP-x86_32 msvc-8.0 Sean Huang \nHuang-Vista-x64 msvc-8.0_64 Sean Huang \nHuang-Vista-x64 intel-vc8-win-10.0_x86_64 Sean Huang \nHuang-Vista-x64 msvc-8.0_x86_64 Sean Huang \nIBM_Canada_Ltd vacpp Chris Cambly \nRW_WinXP_VC msvc-7.1 Richard Webb \nRW_WinXP_VC msvc-9.0 Richard Webb \n" }, { "path": "rst.css", "content": "@import url(\"doc/src/boostbook.css\");\n@import url(\"doc/src/docutils.css\");\n/* Copyright David Abrahams 2006. Distributed under the Boost\n Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n */\n\ndl.docutils dt {\n font-weight: bold }\n\nimg.boost-logo {\n border: none;\n vertical-align: middle\n}\n\npre.literal-block span.concept {\n font-style: italic;\n}\n\n.nav { \ndisplay: inline;\nlist-style-type: none;\n}\n\n.prevpage {\npadding-top: -5px;\ntext-align: left;\nfloat: left;\n}\n\n.nextpage {\npadding-top: -20px;\ntext-align: right;\nfloat: right;\n}\n\ndiv.small {\n font-size: smaller }\n\nh2 a { \n font-size: 90%; \n}\nh3 a { \n font-size: 80%; \n}\nh4 a { \n font-size: 70%; \n}\nh5 a { \n font-size: 60%; \n}\n\ndl,table\n{\n text-align: left;\n font-size: 10pt; \n line-height: 1.15;\n}\n\n\n/*=============================================================================\n Tables\n=============================================================================*/\n\n/* The only clue docutils gives us that tables are logically tables,\n and not, e.g., footnotes, is that they have border=\"1\". Therefore\n we're keying off of that. We used to manually patch docutils to\n add a \"table\" class to all logical tables, but that proved much too\n fragile.\n*/\n\n table[border=\"1\"]\n {\n width: 92%;\n margin-left: 4%;\n margin-right: 4%;\n }\n \n table[border=\"1\"]\n {\n padding: 4px;\n }\n \n /* Table Cells */\n table[border=\"1\"] tr td\n {\n padding: 0.5em;\n text-align: left;\n font-size: 9pt;\n }\n\n table[border=\"1\"] tr th\n {\n padding: 0.5em 0.5em 0.5em 0.5em;\n border: 1pt solid white;\n font-size: 80%;\n }\n\n @media screen\n {\n \n /* Tables */\n table[border=\"1\"] tr td\n {\n border: 1px solid #DCDCDC;\n }\n \n table[border=\"1\"] tr th\n {\n background-color: #F0F0F0;\n border: 1px solid #DCDCDC;\n }\n\n pre, \n .screen\n {\n border: 1px solid #DCDCDC;\n }\n \n td pre\n td .screen\n {\n border: 0px\n }\n \n .sidebar pre\n {\n border: 0px\n }\n \n }\n\n pre, \n .screen\n {\n font-size: 9pt;\n display: block;\n margin: 1pc 4% 0pc 4%;\n padding: 0.5pc 0.5pc 0.5pc 0.5pc;\n }\n\n /* Program listings in tables don't get borders */\n td pre, \n td .screen\n {\n margin: 0pc 0pc 0pc 0pc;\n padding: 0pc 0pc 0pc 0pc;\n }\n\n" }, { "path": "status/Jamfile.v2", "content": "# Copyright 2002. Dave Abrahams\n# Copyright 2016-2018. Rene Rivera\n# Distributed under the Boost Software License, Version 1.0.\n# (See accompanying file LICENSE_1_0.txt or copy at\n# http://www.boost.org/LICENSE_1_0.txt)\n\n# This build project manages running the tests for all of Boost.\n# The tests to run are discovered from the structure of the libs tree.\n#\n# Usage:\n#\n# > cd boost-root/status\n# > b2 [--check-libs-only] [--limit-tests=/lib-name-regex../]* [--exclude-tests=/lib-name-regex../]*\n#\n# --check-libs-only\n# Only runs the library conformance tests.\n#\n# --no-check-libs\n# Do not run the library conformance tests.\n#\n# --limit-tests, or --include-tests\n# Only runs the tests for whom the name matches the regex.\n# The value for the argument is a comma separated list of simple\n# regular expressions to check against the names of all the libraries.\n# If any one regex matches the matching library is tested.\n#\n# --exclude-tests\n# Only runs the tests for whom the names does not match the regex.\n# The argument is the same as for the limit-tests option except\n# that the result is that libraries for whom the name matches\n# are not tested.\n#\n# The test filters are evaluated in the order given in the command\n# and can be used to selectively narrow or widen the set of libraries\n# tested.\n#\n# Examples:\n#\n# > b2 --check-libs-only --include-tests=predef,config\n# \n# Runs the library conformance tests for the predef and config\n# libraries only.\n#\n# > b2 --include-tests=[n-t] --exclude-tests=rat --limit-tests=[v-w]\n#\n# Runs all the tests for library names that begin with \"n\" through \"t\",\n# or \"v\" through \"w\", but not libraries that start with \"rat\".\n\nproject status\n : source-location $(BOOST_ROOT)\n : requirements true\n ;\n\nimport testing ;\nimport modules ;\nimport project ;\nimport regex ;\nimport modules ;\nimport path ;\nimport feature ;\nimport numbers ;\nimport python ;\n\nlocal check-libs-only = [ MATCH \"^--(check-libs-only)\" : [ modules.peek : ARGV ] ] ;\nlocal no-check-libs = [ MATCH \"^--(no-check-libs)$\" : [ modules.peek : ARGV ] ] ;\nlocal check-libs-only-targets = ;\nlocal libraries = ;\n\nlocal rule run-tests ( root : tests * )\n{\n local filter-args = [ MATCH \"^--(limit|exclude|include)-tests=(.*)\" : [ modules.peek : ARGV ] ] ;\n local filter-tests ;\n while $(filter-args)\n {\n local type = $(filter-args[1]) ;\n for local test in [ regex.split-list $(filter-args[2]) : \"[,]\" ]\n {\n filter-tests += $(type) $(test) ;\n }\n filter-args = $(filter-args[3-]) ;\n }\n # If any filter is given we make the initial set of tested libraries we:\n # (a) make it empty if the first filter is an include.\n # (b) make it full otherwise.\n local include-default = y ;\n if $(filter-tests[1]) && ( $(filter-tests[1]) in limit include )\n {\n include-default = n ;\n }\n local location = [ project.attribute $(__name__) location ] ;\n # We only run the check library test when host-os == target-os.\n # Hence we need that information.\n local host-os-default = [ feature.defaults ] ;\n for local test in $(tests)\n {\n local library = [ path.parent $(test) ] ;\n if $(library) = \".\"\n {\n library = $(test) ;\n }\n local include-test = $(include-default) ;\n local t = 1 ;\n local f = 2 ;\n while $(filter-tests[$(f)])\n {\n if [ MATCH \"^($(filter-tests[$(f)]))\" : $(test) ]\n {\n if $(filter-tests[$(t)]) = exclude { include-test = n ; }\n else { include-test = y ; }\n }\n t = [ CALC $(t) + 2 ] ;\n f = [ CALC $(f) + 2 ] ;\n }\n if $(include-test) = y\n {\n if [ path.exists ../$(root)/$(test) ]\n {\n use-project /boost/$(test) : ../$(root)/$(test) ;\n }\n if $(root) = libs && ! $(no-check-libs) && ( ! ( $(library) in $(libraries) ) )\n {\n libraries += $(library) ;\n local test_module = [ project.find ../$(root)/$(test) : $(location) ] ;\n modules.poke $(test_module) : __LIBRARY__ : $(root)/$(library) ;\n modules.poke $(test_module) : __JAMFILE__ : [ modules.peek project : JAMFILE ] ;\n modules.poke $(test_module) : __REQUIRE__ : $(host-os-default:G=) ;\n project.push-current [ project.target $(test_module) ] ;\n module $(test_module)\n {\n import testing ;\n testing.make-test run-pyd :\n $(BOOST_ROOT)/status/boost_check_library.py\n :\n $(BOOST_ROOT)/status\n --boost-root=\\\"$(BOOST_ROOT)\\\"\n --library=$(__LIBRARY__)\n --jamfile=\\\"$(__JAMFILE__:J=;)\\\"\n organization\n $(__REQUIRE__)\n :\n __boost_check_library__ ;\n }\n project.pop-current ;\n check-libs-only-targets += ../$(root)/$(test)//__boost_check_library__ ;\n }\n if ! $(check-libs-only)\n {\n build-project ../$(root)/$(test) ;\n }\n }\n }\n}\n\nlocal rule find-targets ( target : libs * )\n{\n local result = ;\n\n for local lib in $(libs)\n {\n local path = $(lib)/test ;\n local project = [ project.load $(path) ] ;\n local pt = [ project.target $(project) ] ;\n local mt = [ $(pt).main-target $(target) ] ;\n\n if $(mt)\n {\n result += $(path)//$(target) ;\n }\n }\n\n return $(result) ;\n}\n\nlocal libs-to-test = ;\nfor local libdir in [ path.glob $(BOOST_ROOT) : libs/* ]\n{\n local jamfile = [ modules.peek project : JAMFILE ] ;\n local jamfiles = [ path.glob [ path.join $(libdir) test ] : $(jamfile) ] ;\n if $(jamfiles)\n {\n libs-to-test += $(libdir:B) ;\n }\n if [ path.glob $(libdir) : sublibs ]\n {\n jamfiles = [ path.glob $(libdir) : */test/$(jamfile) ] ;\n for local sublib_jamfile in $(jamfiles)\n {\n local sublibdir = [ path.parent [ path.parent $(sublib_jamfile) ] ] ;\n local sublib = $(libdir:B)/$(sublibdir:B) ;\n libs-to-test += $(sublib) ;\n }\n }\n}\n\nlibs-to-test = [ SORT $(libs-to-test) ] ;\n\nrun-tests libs : $(libs-to-test)/test ;\n\n# Tests from Jamfiles in tools/\n# Please keep these in alphabetical order\n\nlocal tools-to-test = ;\nfor local tooldir in bcp check_build quickbook\n{\n local jamfile = [ modules.peek project : JAMFILE ] ;\n local jamfiles = [ path.glob [ path.join $(BOOST_ROOT) tools $(tooldir) test ] : $(jamfile) ] ;\n if $(jamfiles)\n {\n tools-to-test += $(tooldir) ;\n }\n}\n\n#ECHO \"tools-to-test:\" $(tools-to-test) ;\n\nrun-tests tools : $(tools-to-test)/test ;\n\nif $(check-libs-only-targets)\n{\n alias check-libs-only : $(check-libs-only-targets) ;\n}\n\nalias minimal : [ find-targets minimal : ../libs/$(libs-to-test) ] ;\nexplicit minimal ;\n\nalias quick : [ find-targets quick : ../libs/$(libs-to-test) ../tools/$(tools-to-test) ] ;\nexplicit quick ;\n" }, { "path": "status/boost-no-inspect", "content": "This file tells boost inspect to ignore this directory and any sub-directories\n" }, { "path": "status/boost_check_library.py", "content": "#!/usr/bin/env python\n\n# Copyright Rene Rivera 2016\n#\n# Distributed under the Boost Software License, Version 1.0.\n# (See accompanying file LICENSE_1_0.txt or copy at\n# http://www.boost.org/LICENSE_1_0.txt)\n\nimport os\nimport inspect\nimport optparse\nimport sys\nimport glob\nimport fnmatch\nimport json\n\nclass check_library():\n '''\n This is a collection of checks for a library to test if a library\n follows the Boost C++ Libraries requirements and guidelines. It also\n checks for possible and likely errors in the library.\n '''\n \n def __init__(self):\n self.main()\n \n def check_organization(self):\n self.run_batch('check_organization_')\n \n def check_organization_build(self):\n if os.path.isdir(os.path.join(self.library_dir, 'build')):\n self.assert_file_exists(os.path.join(self.library_dir, 'build'), self.jamfile,\n '''\n Did not find a Boost Build file in the [project-root]/build directory.\n The library needs to provide a Boost Build project that the user,\n and the top level Boost project, can use to build the library if it\n has sources to build.\n ''',\n 'org-build-ok')\n if os.path.isdir(os.path.join(self.library_dir, 'src')):\n self.assert_dir_exists(os.path.join(self.library_dir,'build'),\n '''\n Missing [project-root]/build directory. The [project-root]/build directory\n is required for libraries that have a [project-root]/src directory.\n ''',\n 'org-build-src')\n \n def check_organization_doc(self):\n self.assert_file_exists(self.library_dir, ['index.html'],\n '''\n Did not find [project-root]/index.html file.\n \n The file is required for all libraries. Redirection to HTML documentation.\n ''',\n 'org-doc-redir')\n self.assert_dir_exists(os.path.join(self.library_dir,'doc'),\n '''\n Missing [project-root]/doc directory. The [project-root]/doc directory\n is required for all libraries.\n \n Sources to build with and built documentation for the library. If the\n library needs to build documentation from non-HTML files this location\n must be buildable with Boost Build.\n ''',\n 'org-doc-dir')\n \n def check_organization_include(self):\n if os.path.isdir(os.path.join(self.library_dir,'include','boost',self.library_name)):\n self.warn_file_exists(os.path.join(self.library_dir,'include','boost'), ['*.h*'],\n '''\n Found extra files in [project-root]/include/boost directory.\n ''',\n 'org-inc-extra',\n negate = True,\n globs_to_exclude = ['%s.h*'%(self.library_name)])\n else:\n self.warn_file_exists(os.path.join(self.library_dir,'include','boost'), ['%s.h*'%(self.library_name)],\n '''\n Did not find [project-root]/include/boost/[library].h* file.\n \n A single header for the library is suggested at [project-root]/include/boost/[library].h*\n if the library does not have a header directory at [project-root]/include/boost/[library].\n ''',\n 'org-inc-one')\n \n def check_organization_meta(self):\n parent_dir = os.path.dirname(self.library_dir)\n # If this is a sublibrary it's possible that the library information is the\n # parent library's meta/libraries.json. Otherwise it's a regular library\n # and structure.\n if not self.test_dir_exists(os.path.join(self.library_dir,'meta')) \\\n and self.test_file_exists(os.path.join(parent_dir,'meta'),['libraries.json']):\n if self.get_library_meta():\n return\n self.assert_file_exists(os.path.join(self.library_dir, 'meta'), ['libraries.json'],\n '''\n Did not find [project-root]/meta/libraries.json file, nor did\n [super-project]/meta/libraries.json contain an entry for the sublibrary.\n \n The file is required for all libraries. And contains information about\n the library used to generate website and documentation for the\n Boost C++ Libraries collection.\n ''',\n 'org-meta-libs')\n elif self.assert_dir_exists(os.path.join(self.library_dir,'meta'),\n '''\n Missing [project-root]/meta directory. The [project-root]/meta directory\n is required for all libraries.\n ''',\n 'org-meta-dir'):\n self.assert_file_exists(os.path.join(self.library_dir, 'meta'), ['libraries.json'],\n '''\n Did not find [project-root]/meta/libraries.json file.\n \n The file is required for all libraries. And contains information about\n the library used to generate website and documentation for the\n Boost C++ Libraries collection.\n ''',\n 'org-meta-libs')\n \n def check_organization_test(self):\n if self.assert_dir_exists(os.path.join(self.library_dir,'test'),\n '''\n Missing [project-root]/test directory. The [project-root]/test directory\n is required for all libraries.\n \n Regression or other test programs or scripts. This is the only location\n considered for automated testing. If you have additional locations that\n need to be part of automated testing it is required that this location\n refer to the additional test locations.\n ''',\n 'org-test-dir'):\n self.assert_file_exists(os.path.join(self.library_dir, 'test'), self.jamfile,\n '''\n Did not find a Boost Build file in the [project-root]/test directory.\n ''',\n 'org-test-ok')\n\n def main(self):\n commands = [];\n for method in inspect.getmembers(self, predicate=inspect.ismethod):\n if method[0].startswith('check_'):\n commands.append(method[0][6:].replace('_','-'))\n commands = \"commands: %s\" % ', '.join(commands)\n\n opt = optparse.OptionParser(\n usage=\"%prog [options] [commands]\",\n description=commands)\n opt.add_option('--boost-root')\n opt.add_option('--library')\n opt.add_option('--jamfile')\n opt.add_option('--debug', action='store_true')\n self.boost_root = None\n self.library = None\n self.jamfile = None\n self.debug = False\n ( _opt_, self.actions ) = opt.parse_args(None,self)\n \n self.library_dir = os.path.join(self.boost_root, self.library)\n self.error_count = 0;\n self.jamfile = self.jamfile.split(';')\n self.library_name = self.library.split('/',1)[1] #os.path.basename(self.library)\n self.library_key = self.library.split('/',1)[1]\n\n if self.debug:\n print(\">>> cwd: %s\"%(os.getcwd()))\n print(\">>> actions: %s\"%(self.actions))\n print(\">>> boost_root: %s\"%(self.boost_root))\n print(\">>> library: %s\"%(self.library))\n print(\">>> jamfile: %s\"%(self.jamfile))\n\n for action in self.actions:\n action_m = \"check_\"+action.replace('-','_')\n if hasattr(self,action_m):\n getattr(self,action_m)()\n \n def run_batch(self, action_base, *args, **kargs):\n for method in inspect.getmembers(self, predicate=inspect.ismethod):\n if method[0].startswith(action_base):\n getattr(self,method[0])(*args, **kargs)\n\n def get_library_meta(self):\n '''\n Fetches the meta data for the current library. The data could be in\n the superlib meta data file. If we can't find the data None is returned.\n '''\n parent_dir = os.path.dirname(self.library_dir)\n if self.test_file_exists(os.path.join(self.library_dir,'meta'),['libraries.json']):\n with open(os.path.join(self.library_dir,'meta','libraries.json'),'r') as f:\n meta_data = json.load(f)\n if isinstance(meta_data,list):\n for lib in meta_data:\n if lib['key'] == self.library_key:\n return lib\n elif 'key' in meta_data and meta_data['key'] == self.library_key:\n return meta_data\n if not self.test_dir_exists(os.path.join(self.library_dir,'meta')) \\\n and self.test_file_exists(os.path.join(parent_dir,'meta'),['libraries.json']):\n with open(os.path.join(parent_dir,'meta','libraries.json'),'r') as f:\n libraries_json = json.load(f)\n if isinstance(libraries_json,list):\n for lib in libraries_json:\n if lib['key'] == self.library_key:\n return lib\n return None\n\n def error(self, reason, message, key):\n self.error_count += 1\n print(\"%s: error: %s; %s <<%s>>\"%(\n self.library,\n self.clean_message(reason),\n self.clean_message(message),\n key,\n ))\n \n def warn(self, reason, message, key):\n print(\"%s: warning: %s; %s <<%s>>\"%(\n self.library,\n self.clean_message(reason),\n self.clean_message(message),\n key,\n ))\n \n def info(self, message):\n if self.debug:\n print(\"%s: info: %s\"%(self.library, self.clean_message(message)))\n \n def clean_message(self, message):\n return \" \".join(message.strip().split())\n \n def assert_dir_exists(self, dir, message, key, negate = False):\n self.info(\"check directory '%s', negate = %s\"%(dir,negate))\n if os.path.isdir(dir):\n if negate:\n self.error(\"directory found\", message, key)\n return False\n else:\n if not negate:\n self.error(\"directory not found\", message, key)\n return False\n return True\n \n def warn_dir_exists(self, dir, message, key, negate = False):\n self.info(\"check directory '%s', negate = %s\"%(dir,negate))\n if os.path.isdir(dir):\n if negate:\n self.warn(\"directory found\", message, key)\n return False\n else:\n if not negate:\n self.warn(\"directory not found\", message, key)\n return False\n return True\n \n def assert_file_exists(self, dir, globs_to_include, message, key, negate = False, globs_to_exclude = []):\n found = self.test_file_exists(dir, globs_to_include = globs_to_include, globs_to_exclude = globs_to_exclude)\n if negate:\n if found:\n self.error(\"file found\", message, key)\n return False\n else:\n if not found:\n self.error(\"file not found\", message, key)\n return False\n return True\n \n def warn_file_exists(self, dir, globs_to_include, message, key, negate = False, globs_to_exclude = []):\n found = self.test_file_exists(dir, globs_to_include = globs_to_include, globs_to_exclude = globs_to_exclude)\n if negate:\n if found:\n self.warn(\"file found\", message, key)\n return False\n else:\n if not found:\n self.warn(\"file not found\", message, key)\n return False\n return True\n \n def test_dir_exists(self, dir):\n return os.path.isdir(dir)\n \n def test_file_exists(self, dir, globs_to_include, globs_to_exclude = []):\n self.info(\"test file(s) in dir '%s', include = '%s', exclude = %s\"%(dir,globs_to_include,globs_to_exclude))\n found = False\n if os.path.isdir(dir):\n for g in globs_to_include:\n for f in glob.iglob(os.path.join(dir,g)):\n exclude = False\n for ge in globs_to_exclude:\n if fnmatch.fnmatch(os.path.basename(f),ge):\n exclude = True\n found = not exclude\n if found:\n break\n return found\n\nif check_library().error_count > 0:\n sys.exit(1)\n\n" }, { "path": "status/expected_results.xml", "content": "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n" }, { "path": "status/explicit-failures-markup.xml", "content": "\n\n\n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by a timeout when compiling the test. It\n passes when the timeout value is increased.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n These failures are caused by a lack of support/configuration for Boost.Tr1\n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n The compiler does not support features that are essential for the library.\n \n \n \n \n \n \n \n \n The toolset is not supported by Boost.Regex.\n \n \n \n \n\n \n \n \n \n \n \n The test fail with ICE, but the exact reason for ICE is not\n known. A minimal example of casting any to reference type\n seem to work. Anyone interested in using this functionality\n with msvc is suggested to do additional testing.\n \n \n \n \n\n\n \n \n \n \n \n \n \n \n Compilers need to support partial template specialization\n to work with zero length arrays.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n This compiler does not support enable_if, which is needed by the\n Boost.System library on which Boost.Asio depends.\n \n \n \n \n \n \n \n On HP-UX 11.23 platform, these tests must be compiled with\n _XOPEN_SOURCE_EXTENDED macro defined. It is likely related\n to CR JAGag28813.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n The test would (most likely) compile and run properly if the workaround\n syntax .to_container( c ) was applied to all list_of() expressions.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This test could probably be made to work if somebody with knowledge\n about the compilers would submit a patch.\n \n \n \n \n \n \n \n \n \n \n The test would (most likely) compile and run properly if the workaround\n syntax .to_container( c ) was applied to all list_of() expressions.\n \n \n\n \n \n \n \n The test could probably be made to work if somebody submitted a patch.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The test would (most likely) compile and run properly if the workaround\n syntax .to_container( c ) was applied to all list_of() expressions.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The test depends on Boost.Pointer Container which probably does not work for\n this compiler.\n \n \n \n \n \n \n \n \n \n \n The test depends on Boost.Pointer Container which probably does not work for\n this compiler.\n \n \n \n \n \n \n \n \n \n \n The test depends on Boost.Pointer Container which probably does not work for\n this compiler.\n \n \n \n \n \n \n The test does not work for\n this compiler.\n \n \n \n \n \n \n \n \n \n The test depends on Boost.Tuple which probably does not work for\n this compiler.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n C++11 is the minimum requirement.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The VC++ 6.0 backend runs out of internal resources while\n trying to process the Comeau output for this library;\n Comeau Computing has been asked about a solution.\n On the other hand, Comeau 4.3.3 with VC++ 7.0 backend works\n fine.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Compiler bug.\n \n \n \n \n Time out.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by Boost.Function.\n \n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by a bug in the compiler triggered by the\n use of the debug flag '-gall'. It has been reported to the\n compiler vendor.\n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is only present in release mode and is caused by /OPT:ICF.\n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n Temporarily enabled and always failing test used for collecting\n additional feedback from the testing site.\n \n \n \n\n \n \n \n \n \n \n The compiler does not support features that are essential for the library.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This version of the Rogue Wave library fails to provide all\n needed addition operators for the iterator type and the\n difference type of std::deque.\n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Long double NaN's are apparently handled incorrectly on this platform.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n This failure is due to NaNs trapping.\n \n \n \n \n \n \n \n This failure is due to the compiler not recognising the long double special values for infinity and quiet NaN\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The compiler does not support features that are essential for the library.\n \n \n \n\n \n \n \n \n \n \n hash_value is not overloaded for arrays for older versions\n of Visual C++. There is a work around so that\n boost::hash<T[N]>, boost::hash_combine and boost::hash_range\n work.\n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n On these compilers the wrong overload of hash_value is called\n when the argument is a hash function pointer. So calling\n hash_value doesn't work but boost::hash does work (and it's\n recommended that user never call hash_value directly so this\n shouldn't be a problem).\n \n \n\n \n \n \n \n \n This platform has poor support for long double so\n the hash function perform poorly for values out of the range\n of double or if they differ at a greater precision\n that double is capable of representing.\n \n \n\n \n \n \n \n \n \n These examples only work on compilers with support for ADL.\n It is possible to work around this, but I wanted to keep the\n example code as clean as possible.\n \n \n\n \n \n \n \n It appears that Borland doesn't find friend functions defined\n in a class by ADL. This is easily fixed but this example is\n meant to show the typical way of customising boost::hash, not\n the portable way.\n \n \n\n \n \n \n \n The test demonstrates a Borland bug - functions that aren't\n in a namespace don't appear to be found by ADL.\n \n \n\n \n \n \n \n Debug containers aren't supported on Apple's version of gcc 4.2.\n \n \n \n\n \n \n \n \n \n \n \n \n \n The relevant SFINAE support is broken in MSVC up to version 11.\n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler does not support the is_abstract type trait\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Conversion double-string-double may give a different \n value (or even throw) on many compilers\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Some compilers and STL realizations convert double and long \n double types with bigger precision loss than minimal (or \n even round to infinity). Such failures are not a \n lexical_cast, but a compiler fault. \n \n \n \n \n\n \n \n \n \n \n On this compiler, Boost.Function gives a run-time error when\n calling non-nullary lambdas as used by the tests of this library\n to program contract failure handlers.\n It might still be possible to use this library on this compiler\n using default contract failure handlers or programming custom\n contract failure handlers but without using non-nullary lambdas\n (however, the authors did not confirm that).\n \n \n \n \n \n \n Even tests that do not use C++11 lambda functions fail on this\n compiler because it incorrectly attempts an extra copy when\n objects are constructed using `boost::check c = ...`.\n This is fixed in MinGW GCC 4.3.\n \n \n \n \n \n Even tests that do not use C++11 lambda functions fail on this\n compiler because of a number of issues (Boost.Exception is not\n supported on this compiler but it is used by this library\n implementation, some aspects of `friend` and `volatile` are not\n properly implemented on this compiler, etc.).\n These specific issues are fixed in MSVC 9.0 (but only MSVC 11.0\n has adequate lambda function support that makes this library\n actually usable).\n \n \n \n \n \n \n \n \n \n This test fails on this compiler because of a bug with\n exceptions (see http://grokbase.com/t/gg/android-ndk/1656csqqtp/assertion-ttypeencoding-dw-eh-pe-absptr-unexpected-ttypeencoding-failed).\n \n \n \n \n \n \n \n \n \n This test fails on this compiler because of a bug in its STL\n implementation (undefined references to\n `std::ios_base::failure::failure`).\n \n \n \n \n \n \n \n \n \n \n \n \n \n This test fails because of a libcxxrt bug on Clang for FreeBSD\n which causes `std::uncaught_exception` to not work properly on\n re-throws (see https://github.com/pathscale/libcxxrt/issues/49).\n \n \n \n \n \n \n \n \n \n \n This test fails because this complier does not properly\n implement SFINAE giving incorrect errors on substitution\n failures for private members.\n This seems to be fixed in GCC 4.8 and MSVC 12.0.\n \n \n \n \n \n \n \n This test fails because SFINAE on this complier seems to not\n fail as it should when a derived class tries to call a\n protected member function on a base class object via a function\n pointer instead of via inheritance.\n This seems to be fixed in Clang 3.1, and to be specific to\n version 4.6 of GCC.\n \n \n \n \n \n \n \n This test fails because this compiler seems to incorrectly check\n access level of members in base classes in a context when only\n derived class members are used.\n This seems to be fixed in GCC 4.8 (possibly related to\n https://gcc.gnu.org/bugzilla/show_bug.cgi?id=57973).\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This test fails because `std::unchaught_exception` seems to\n always return zero on this compiler (even if the authors could\n not find a direct reference to this possible compiler issue\n online).\n \n \n \n \n \n \n \n \n This test fails because this complier seems to dispatch calls\n incorrectly when both `const` and `const volatile` overloads\n are present (even if the authors could not find a direct\n reference to this possible compiler issue online).\n This is fixed in MSVC 9.0 (but only MSVC 11.0 has adequate\n lambda function support).\n \n \n \n \n \n \n This test fails because MSVC 10.0 is not able to properly deduce\n a template specialization.\n This is fixed in MSVC 11.0.\n \n \n \n \n \n \n \n This test fails because of a MSVC 10.0 bug with lambdas within\n template class initialization list.\n This can be worked around using a functor bind instead of a\n lambda, but it is fixed in MSVC 11.0.\n \n \n \n \n \n \n This test fails because of a MSVC 10.0 bug for which lambdas\n cannot access typedefs declared within classes.\n This can be worked around declaring typedefs outside of\n classes, but it is fixed in MSVC 11.0.\n \n \n \n \n \n \n \n \n \n \n \n This test fails because of an internal MSVC 10.0 compiler bug.\n This is fixed in MSVC 11.0.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n The serialization library does not support this compiler.\n \n \n \n\n \n \n \n XML serialization is not supported on this compiler.\n \n \n \n\n \n \n \n \n The serialization library does not support this compiler.\n \n \n \n\n \n \n \n XML serialization is not supported on this compiler.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n \n \n \n \n These are strange runtime failures for\n which there is no obvious explanation. Later versions of the\n Intel compiler (eg:8.0) seem to have resolved the issue.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n For some reason Code Warrior has difficulty compiling some of the\n input code. This may be related to limitations of locale handling,\n but it's unclear at this time (2005-May-21).\n \n \n \n\n\n \n \n \n \n \n \n \n \n \n \n \n \n Some older compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n Some older compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n Some older compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n Some older compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n Some compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n Some older compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n Some older compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n Some older compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n Some older compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n Some compilers are confused by the template code here.\n These are new features to date-time in 1.33 and there is no\n plan to backport to these non-compliant compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n These compilers are unfortunately able to correctly compile the\n new format-based input-output code for date time. Suitable, but\n less flexible, alternatives are available on these compilers.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n These compilers are unfortunately able to correctly compile the\n new format-based input-output code for date time. Suitable, but\n less flexible, alternatives are available on these compilers.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n These compilers are unfortunately able to correctly compile the\n new format-based input-output code for date time. Suitable, but\n less flexible, alternatives are available on these compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n These compilers are unfortunately able to correctly compile the\n new format-based input-output code for date time. Suitable, but\n less flexible, alternatives are available on these compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n These compilers are unfortunately able to correctly compile the\n new format-based input-output code for date time. Suitable, but\n less flexible, alternatives are available on these compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n There is apparently a bug in Borland library\n such that std::local_time and std::gmtime are\n returning a time that's 1 hour ahead GetSystemTimeAsFileTime\n during DST. This is a rather serious problem in that\n some of the date-time clock interfaces will give the wrong\n current time.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n The sun 5.8 compiler and standard library have a problem with\n the classic facet which causes some of the io tests for date-time\n to fail. Overall this should not affect most uses of the library.\n \n \n\n \n \n \n \n \n The STLPort standard library has issues with some custom\n facet settings causing an unexplained failure in these\n facet tests.\n \n \n\n \n \n \n \n \n \n \n The STLPort standard library has issues with the handling\n of the classic facet which causes some fo the i/o tests\n for date-time to fail. Overall this should not affect\n most uses of the library.\n \n \n\n\n \n \n \n \n \n \n \n MSVC 7.1 with its standard library passes all date-time tests.\n For some reason when paired with stlport a few widestream\n io tests do not format output correctly. Overall this should\n not affect most uses of the library.\n \n \n\n \n \n \n \n \n \n Although these tests compile, the execution aborts for\n an unknown reason. Note that sometimes the execution is\n ok on cw-9_4. This may be fixable if someone\n can track down the source of the problem.\n \n \n\n \n \n \n \n \n \n These tests are failing with the beta2 version of VC_8. At least\n one of them is directly a result of the new VC_8 standard library\n restricting the year value in a tm struct to be positive (that is\n greater than year 1900). This is a change from VC7_1 and Microsoft\n is considering removing this restriction.\n \n \n\n \n \n \n \n \n These tests are for serialization which has been marked as unusable.\n The issue was specifically noted on\n AIX version : 5.2.0.41 using IBM XL Version 8.0.0.0.\n \n \n\n \n \n \n \n \n \n The failure is caused by a standard library bug. It doesn't\n support user defined facets which are not default\n constructible. This has been reported to the compiler vendor.\n \n \n\n \n \n \n \n \n \n \n These tests rely on the ability of an std::map to be\n instantiated on an incomplete type. The Rogue Wave\n version 2.2 and higher does not allow this.\n \n \n\n \n \n \n \n The failure is caused by a standard library bug. It doesn't\n support user defined facets which are not default\n constructible. This has been reported to the compiler vendor.\n \n \n\n \n \n \n \n \n \n The failure is caused by a standard library bug. The end-of-stream\n istream iterator can only be constructed when the istream iterator\n has been instantiated with char as the character type. This has\n been reported to the compiler vendor.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n\n \n \n \n \n \n \n \n \n \n \n \n This indicates that forward declarations could probably be used\n for these compilers but currently aren't. All these compilers use\n STLport, which is compatible with forward declarations in some\n circumstances, but not in others. I haven't looked into how to\n determine this, so I've just set container_fwd to never forward\n declare for STLport.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n GCC's libstdc++ has a versioned namespace feature which breaks\n container forwarding. I don't know how to detect it so I'm just\n always disabling it, which means that a lot of setups which\n means that it's disabled for a lot of setups where it could\n work - which is what these failures represent.\n \n \n\n \n \n \n \n \n \n Failing because these tests are run with warnings as errors,\n and the standard library is causing warnings.\n \n \n\n \n \n \n \n STLport debug mode seems to be broken here.\n \n \n\n \n \n \n \n \n \n Some old versions of GCC's libstdc++ don't work on clang with\n _GLIBCXX_DEBUG defined.\n http://lists.cs.uiuc.edu/pipermail/cfe-dev/2011-May/015178.html\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n The exact reason of this (linker related) bug is unresearched. The test passes\n on some environments. The test was found to fail on a platform whit a german\n version of the compiler.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n \n \n \n \n \n \n This compiler does not support enable_if, which is needed by the\n Boost.System library on which Boost.Filesystem depends.\n \n \n \n \n \n \n Due to standard library bugs this configuration is not supported by\n the most recent version of the library.\n \n \n \n \n \n Due to standard library bugs, this version is not supported.\n More recent version of the library should work OK.\n \n \n \n \n \n Due to lack of C library features, this toolset is not supported.\n \n \n \n \n \n \n \n The library works well with versions of this compiler 5.9 and later\n \n \n \n \n \n \n fstream for this compiler has serious problems and is not supported\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The library does not support wide paths on this compiler because\n it does not support SFINAE.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n These failures are reported to be fixed in Sun's\n next compiler release.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler does not support Boost.Interprocess,\n on which intermodule_holder depends.\n \n \n \n\n \n \n \n \n \n \n This compiler does not support the Boost.Range\n library, on which Boost.Foreach depends.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler does not support detection of\n const rvalues.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler does not support detection of\n const rvalues.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler does not support detection of\n rvalues.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler does not support detection of\n rvalues.\n \n \n \n \n \n \n \n These compilers cannot handle BOOST_FOREACH\n in a template, where the collection type\n depends on a template parameter.\n \n \n \n \n \n \n \n This failure is because the Boost.Range extension\n mechanism is broken on these compilers. It requires\n ADL which these compilers do not support.\n \n \n \n\n \n \n \n \n \n The failure is caused by a standard library bug: the\n iostream components fail to handle ios::internal\n flag.\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n Not all compilers/platforms implement nonstandard calling conventions.\n
\n With GCC/x86 this failure reflects\n http://gcc.gnu.org/bugzilla/show_bug.cgi?id=29328 .\n \n \n \n \n \n \n \n Not all compilers/platforms implement nonstandard calling conventions.\n \n \n \n \n \n \n Overload selection does not work in some assignment contexts with this compiler.\n \n \n \n\n \n \n \n \n \n \n Probably broken const conversion with that compiler.\n \n \n \n\n \n \n \n \n \n \n \n \n \n This compiler is currently not supported.\n \n \n \n\n \n \n \n \n \n \n \n \n This compiler is currently not supported.\n \n \n \n\n \n \n \n \n \n \n \n hash_value is not overloaded for arrays for older versions\n of Visual C++. There is a work around so that\n boost::hash<T[N]>, boost::hash_combine and boost::hash_range\n work.\n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n On these compilers the wrong overload of hash_value is called\n when the argument is a hash function pointer. So calling\n hash_value doesn't work but boost::hash does work (and it's\n recommended that user never call hash_value directly so this\n shouldn't be a problem).\n \n \n\n \n \n \n \n \n This platform has poor support for long double so\n the hash function perform poorly for values out of the range\n of double or if they differ at a greater precision\n that double is capable of representing.\n \n \n\n \n \n \n \n \n \n These examples only work on compilers with support for ADL.\n It is possible to work around this, but I wanted to keep the\n example code as clean as possible.\n \n \n\n \n \n \n \n It appears that Borland doesn't find friend functions defined\n in a class by ADL. This is easily fixed but this example is\n meant to show the typical way of customising boost::hash, not\n the portable way.\n \n \n\n \n \n \n \n The test demonstrates a Borland bug - functions that aren't\n in a namespace don't appear to be found by ADL.\n \n \n\n \n \n \n \n Debug containers aren't supported on Apple's version of gcc 4.2.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n The compiler doesn't generate defaulted move ctor/assgin thus\n perform copy construction/assginment. Even though such case,\n the `inline` versions don't force generating move ctor/assign\n to preserve trivial requirements. Since that is not documented\n behaviour, it might be changed in future release.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n These compilers do not support features that are essential for the library.\n \n \n \n \n \n \n \n Intel 11.1 and 12.0 on Darwin raises a SIGSEGV in almost all unit tests.\n \n \n \n \n \n Intel 13.1.3 does not support BOOST_TEST\n \n \n \n \n \n pgi 11.1 does not support BOOST_AUTO and is not configured for UBLAS\n \n \n \n \n \n This configuration is not well configured for UBLAS\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\t\n\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tThe compiler does not support features that are essential for the library.\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tCompiler error expected for msvc: A minimal example of a class template 'value' that\n\t\t\t\tresults in syntax error in a subsequent meta function.\n\t\t\t\tSee \n\t\t\t\t\tticket #5141\n\t\t\t\t for details.\n\t\t\t\n\t\t\n\t\n\n\t\n\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tWhen compiling with aC++, depending on system load, the compile time may exceed\n\t\t\t\tspecified timeout value. The test passes when the timeout value is increased.\n\t\t\t\tWhen compiling with GCC, linker takes segmentation fault.\n\t\t\t\tIn the HP bug tracking system, this issue is tracked as QuIX ID: QXCR1000836120.\n\t\t\t\n\t\t\n\t\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The compiler does not support features that are essential for the library.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The compiler does not support features that are essential for the library.\n \n \n \n \n \n \n \n \n The compiler is not supported by Interprocess.\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This is gcc bug 26526, and is fixed in later releases.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n No bzip2 support on the testing machine and no way to\n disable this test with BBv2 at present.\n \n \n \n \n \n \n \n \n compiler can't compile \"windows.h\" in strict mode\n \n \n \n \n \n \n This platform lacks the placement delete operator\n required by the C++ standard\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n These six tests pass individually but cause a compiler stack overflow\n when compiled as a group\n \n \n \n \n \n \n On this platform, linking this test takes longer than 10 minutes\n which is a time limit specified for bjam. When linked manually,\n the test succeeds.\n \n \n \n \n \n \n \n \n \n \n \n \n The test fails at runtime for unknown reasons.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n I'm not sure whether CodeWarrior is correct to report that the member\n in question is inaccessible; however, when the member is made public\n an internal error occur that I have not been able to fix, so for\n now the question is moot.\n \n \n \n \n \n \n \n The failure reflects a problem with the build system: the zlib\n object files are generated in the wrong directory.\n \n \n \n \n \n \n Memory mapped files are not supported in QNX Neutrino version 6.3.0.\n \n \n \n \n \n \n \"restrict\" is treated as a keyword on this platform (as in C99);\n use the alias \"slice\" instead, defined in\n \"boost/iostreams/slice.hpp.\"\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n In the Dinkumware standard library, streampos relies on fpos_t\n to store stream offsets, but fpos_t is defined as a 32-bit\n long by the Borland runtime library. In Borland's modified\n version of STLPort, streampos relies on streamoff to store\n stream offsets, but streamoff is defined to be a 32-bit long.\n \n \n \n \n \n \n In STLPort, streampos consists of a long together with a\n conversion state; on this platform, long is a 32-bit type\n \n \n \n \n \n \n On this platform, streampos is an alias for fpos, whose\n implementation stores stream offsets using streamsize and\n fpos_t; both of the latter types are 32-bit\n \n \n \n \n \n \n \n \n \n \n \n On this platform, streampos is an alias for ptrdiff_t, which\n is an alias for a 32-bit type\n \n \n \n \n \n \n The following applies only to gcc-4.2 using the stdcxx\n standard library: On this platform, streampos is an alias for\n ptrdiff_t, which is an alias for a 32-bit type\n \n \n \n \n \n \n Visual C++ 7.1's SFINAE implementation can't deal with multiple\n assignment functions with the same parameters (but disabled with\n SFINAE). So path's assignment from boost::filesystem2::path is\n disabled. Would be pretty easy to workaround, but probably not\n worth it since this is pretty obscure, and filesystem2 will be\n removed soon.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n C++11 is the minimum requirement.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This test does not allow C++11 auto-declaration support\n (because it uses the `auto` keyword as storage classifier).\n \n \n \n\n\t\n\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tThe compiler fails to compile Boost.Move and Boost.PropertyTree, which are used by this library.\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tBoost.Filesystem used by Boost.Log does not support Windows Mobile.\n\t\t\t\n\t\t\n\t\n\n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The compiler does not support features that are essential for the library.\n \n \n \n\n \n \n\n \n \n \n The compiler is not supported by the library due to an\n utterly broken templates support.\n \n \n\n \n \n \n \n \n \n \n \n This failure is caused by a deficient SFINAE implementation; the bug\n was fixed in the next major compiler version (CodeWarrior 9.x).\n \n \n\n \n \n \n \n \n \n \n \n \n This failure is caused by a deficient SFINAE implementation.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n\n \n This failure is caused by a problem with recursive templates and default template parameters, fixed in Update 2.\n \n \n\n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n This failure is caused by a lack of compiler support for template template\n parameters.\n \n \n\n \n \n \n \n \n \n \n \n \n \n This is an advanced functionality that hasn't been ported to the deficient\n compilers (yet). Patches are welcome!\n \n \n\n \n \n \n \n \n This is an advanced functionality that hasn't been ported to the deficient\n compilers (yet). Patches are welcome!\n \n \n\n \n \n \n \n This is a regression in the gcc 4.1 series that has been\n fixed in gcc 4.2.0. See bug\n #28088 for details.\n \n \n \n \n \n \n This is reported to be fixed in the next Sun\n compiler release.\n \n \n \n \n \n \n \n\n \n\n \n \n \n \n \n \n \n \n

\n This library has never worked [on Borland 5.5.1 and 5.6.4], and the only tests\n that 'pass' are compile-fail tests failing for the wrong reasons!\n

\n \n \n \n \n \n \n \n \n \n \n \n Known error in MSVC. see\n\nhttp://boost-consulting.com/boost/libs/multi_index/doc/compiler_specifics.html#msvc_60\nfor more information.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The VC++ 6.0 backend runs out of internal resources while\n trying to process the Comeau output for this library;\n Comeau Computing has been asked about a solution.\n On the other hand, Comeau 4.3.3 with VC++ 7.0 backend works\n fine.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This error shows when using the dynamic version of the STLport\n library. The problem is reportedly fixed in STLport 5.0 (in beta\n stage as of this writing.)\n \n \n \n \n \n \n \n This test fails due to limitations of the template\n instantiation model used in the testing environment\n (-timplicit_local) resulting in erroneous duplication of some\n function-static variables. The test passes with other template\n instantiation models.\n \n \n \n\n \n \n \n \n \n \n \n \n

\n These compilers are too antiquated for this library.\n

\n \n \n \n \n \n \n \n \n \n

\n These compilers don't quite have the necessary support for this library, it's possible\n that they could be made to work if someone cares enough.\n

\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by a test-runner timeout: unfortunately the Intel\n compiler is exceptionally slow at building some of these tests.\n \n \n \n \n \n \n \n \n This failure is caused by a test-runner timeout.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n

This is a compiler bug: it sometimes creates an illegal temporary object.\n\t\tThe following code illustrates the bug:

\n\t\t
\n\t\t#include <cassert>\n\t\tconst int global_i = 0;\n\t\t\n\t\tstruct TestingReferenceBinding\n\t\t{\n\t\t  TestingReferenceBinding(const int& ii)\n\t\t  {\n\t\t    assert(&ii == &global_i);\n  \t\t  }\n\t\t};\n\t\t\n\t\tint main()\n\t\t{\n\t\t  TestingReferenceBinding ttt = global_i;\n\t\t}\n
\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n

This failure is caused by a compiler bug, and as far as we can \n tell, can't be worked around in the library, although we think \n the library might be made safer with respect to this bug.

\n\n

Specifics: the following simple test fails when it should succeed.

\n 
\n                #include <cassert>\n\n                int const x = 0;\n                struct A\n                {\n                   A(int const& y)\n                   {\n                     assert(&x == &y);\n                   }\n                };\n\n                int main()\n                {\n                    A a(x);  // direct initialization works fine\n                    A b = x; // copy initialization causes x to be copied before it is bound\n                }\n
\n\n The possible safety enhancement would be to cause the constructor \n in question to be explicit for optional<T const&>; that \n would prevent copy initialization.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Complete C++14 support is the minimum requirement.\n \n \n \n \n \n libstdc++ 6 is the minimum version which works.\n \n \n \n Tests are unstable on GCC 6.\n \n \n \n \n \n \n Tests are unstable on VS2017 and VS2019.\n \n \n\n \n \n \n \n \n \n \n \n \n \n Wrokaround: define BOOST_RESULT_OF_USE_TR1\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \t\n \n \n \n \n \n \n \n Compiler's too old for working.\n \n \n \n \n \n C++11 or later required.\n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n The test is exposing the following known error of Sun Studio 11:\n overload resolution fails if\n a) some class has a conversion operator to a reference to\n a built-in type, and\n b) overload resolution involves a user-defined operator as well\n as a built-in operator, and\n c) the built-in operator takes the result of the conversion\n mentioned in a) as an operand.\n A fix will be reportedly included in patch no 6 of Sun Studio 11.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n This error shows when the code has become too complex for the\n compiler to handle. The problem has no relationship with the\n functionality being tested, which in fact does work for\n MSVC++ 7.0.\n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n \n msvc 6 compiler failure. The facility being tested conflicts the the\n compiler in a fundamental way and cannot be worked around.\n \n \n\n \n \n \n \n msvc 6 compiler failure. The facility being tested conflicts the the\n compiler in a fundamental way and cannot be worked around.\n \n \n\n \n \n \n \n \n This failure appears when STLPort is built and used as a DLL with msvc 6.\n STLPort suggests that the next version of STLPort(5.0) will include a workaround\n for this problem.\n \n \n\n \n \n \n \n The library is believed to work in this configuration if compiled against\n Spirit 1.6. The latter is not provided by the particular testing\n environment these tests have been run in.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n All tests that serialize derived pointers currently fail with Metrowerks compilers.\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n The CW compilers have problems with the static construction idiom used to\n implement the type registration in the Boost.Serialization library. In many\n cases CW specific workarounds are implemented in the library but this one\n is not immediately solvable. There is a user work around possible, please\n contact the library developers on the Boost list for information on the\n work around if needed.\n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n The variant library is not supported for this compiler version.\n Therefore serialization of variants doesn't work.\n \n \n\n \n \n \n \n \n\n \n \n \n \n \n The compiler fails with an error supposedly related to std::fpos<>::_Stz from the\n <iosfwd> header. It is not known what causes the compiler to instantiate this\n field and what causes the instantiation to fail.\n \n \n\n \n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n\n \n

\n Historically, Spirit supported a lot of compilers, including (to some\n extent) poorly conforming compilers such as VC6. Spirit v1.6.x will be\n the last release that will support older poorly conforming compilers.\n Starting from Spirit v1.8.0, ill conforming compilers will not be\n supported. If you are still using one of these older compilers, you can\n still use Spirit v1.6.x.\n

\n

\n The reason why Spirit v1.6.x worked on old non-conforming compilers is\n that the authors laboriously took the trouble of searching for\n workarounds to make these compilers happy. The process takes a lot of\n time and energy, especially when one encounters the dreaded ICE or\n \"Internal Compiler Error\". Sometimes searching for a single workaround\n takes days or even weeks. Sometimes, there are no known workarounds. This\n stifles progress a lot. And, as the library gets more progressive and\n takes on more advanced C++ techniques, the difficulty is escalated to\n even new heights.\n

\n

\n Spirit v1.6.x will still be supported. Maintenance and bug fixes will\n still be applied. There will still be active development for the back-\n porting of new features introduced in Spirit v1.8.0 (and Spirit 1.9.0)\n to lesser able compilers; hopefully, fueled by contributions from the\n community. For instance, there is already a working AST tree back-port\n for VC6 and VC7 by Peder Holt.\n

\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by a compiler bug that manifests itself in the\n particular environment/hardware configuration the test has been run in.\n You may or may not experience this issue in your local setup.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n With GCC 3.4.6 the test fails with ICE: internal compiler error.\n The footprint is similar to that in GCC Bugzilla Bug 34950\n except 34950 is a regression introduced in GCC 4.2.3. In any\n case, whatever the problem is, the GCC 4.x series does not seem\n to have it: the test compiles just fine with GCC 4.x compiler.\n \n \n \n\n \n \n \n \n \n \n \n This compiler is not supported.\n \n \n \n \n \n \n \n \n \n \n \n \n \n Native mode is not supported for this compiler.\n \n \n \n \n \n \n \n \n \n Emulation mode is not supported for this compiler.\n \n \n \n \n \n \n \n \n \n \n The feature is not supported by this compiler.\n \n \n \n \n \n \n The feature is not supported by this compiler.\n \n \n \n \n \n \n \n \n \n \n The feature is not supported by this compiler.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by a compiler bug. Templated operators\n that combine different iterators built with iterator_facade or\n iterator_adaptor may be present in an overload set even when those\n iterators are not interoperable. The usual result is that error\n messages generated by illegal use of these operators will be of\n lower quality.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n This failure is caused by a compiler bug.\n is_convertible<T,U>::value may be true for unrelated\n iterators T and U\n (including many of the Boost specialized adaptors) which use\n enable_if_convertible to restrict the applicability\n of converting constructors, even when T is not\n convertible to U because instantiating the\n conversion will cause a compilation failure.\n \n \n \n\n \n\n \n \n \n \n \n \n \n This failure is caused by a compiler bug. The\n compiler tends to drop const-ness and as a result\n some indirect_iterators will have pointer and\n reference members of T* and T& that should\n have been T const* and T const&.\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n For some currently unknown reason, with aCC, this test can be compiled\n only in strict ansi mode. Since on HP-UX/aCC boost testing is done in the\n default compilation mode, this test fails to compile on this platform.\n \n \n\n \n\n\n \n \n \n \n \n \n \n \n \n Sadly Borland-5.9.2 has an even harder time compiling this\n library than earlier versions did. There are currently too\n many issues to stand a chance of porting to this compiler.\n \n \n \n \n \n \n \n This test relies on external software being installed in order to pass.\n \n \n \n \n \n \n This compiler is not sufficiently conforming to correctly handle these tests.\n \n \n \n \n \n \n \n \n \n Some versions of the Darwin platform have insufficient long double support\n for us to be able to run this test.\n \n \n \n \n \n \n \n This test takes too long to build for this compiler and times out.\n \n \n \n \n \n \n \n This is a compiler bug: it is unable to use\n SFINAE to detect the presence of specific\n member functions.\n \n \n \n \n \n \n \n \n \n This is a compiler bug: it is unable to resolve the\n overloaded functions.\n \n \n \n \n \n \n \n \n \n This test takes too long to execute and times out.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n These tests fail with an internal compiler error: there is no\n known workaround at present, except to use Sun-5.9 which does\n build this code correctly.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler is not sufficiently conforming to correctly handle these tests.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler is not sufficiently conforming to correctly handle these tests.\n \n \n \n \n \n \n \n There appears to be a bug in gcc's std::exp (long\n double) on this platform.\n \n \n \n \n \n \n For some reason taking the address of std library math functions fails\n on this platform: this is a problem for our test code, not the library.\n \n \n \n \n \n \n \n \n \n This compiler is not sufficiently conforming to compile these tests.\n \n \n \n \n \n \n \n std::numeric_limits<long double>::infinity() is apparently\n broken in this compiler: it's filed as bug 6347520 with Sun.\n \n \n \n \n \n \n Incomplete std::complex support make these tests pointless\n (the complex trig functions are absent).\n \n \n \n \n \n \n \n \n \n These have yet to fully investigated, but the code is known\n to compile with more conforming compilers, probably workarounds\n are possible if someone is prepared to invest the time.\n \n \n \n \n \n \n Appears to be a bug in STLport's complex abs function, but needs more investigation.\n \n \n \n \n \n \n This appears to be a problem with STLPort's abs function: the issue only effects the\n test code. A workaround should be possible but users should be encouraged to use\n STLport 5 instead.\n \n \n \n \n \n \n \n No true long double standard lib support causes these tests to fail.\n \n \n \n \n \n \n \n \n This is Intel issue 409291, it should be fixed from\n compiler package l_cc_c_9.1.046 onwards.\n \n \n \n \n \n \n \n \n \n \n \n \n This failure appears to be caused by a compiler bug: please note\n that the issue only effects the test suite, not the library itself.\n A workaround is available but breaks other compilers.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n This test ensures the inclusion property of interval\n arithmetic is available for built-in floating-point types\n float and double. If the test\n fails, interval<float> and\n interval<double> should not be used\n on this compiler/platform since there will be no\n numerical guarantee.\n \n \n \n \n \n \n \n \n \n This compiler has some problems with name lookup / overload resolution.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is unresearched. Presumably, the problem\n is that the abs function is not available in the \"right\"\n namespace with this compiler/stdlib combination.\n \n \n\n \n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This old version of the stlport library causes the BOOST_NO_STDC_NAMESPACE\n macro to be set. But this conflicts with the requirements of the library.\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n\n \n \n \n \n The failure is caused by standard library deficiencies\n -- it lacks the basic_string class template and\n the <locale> header.\n \n \n\n \n \n \n \n \n\n \n \n \n \n\n \n \n \n \n\n \n\n \n \n \n \n \n The failures are caused by problems\n with std::locale implementation\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n The failures are caused by compiler bug: it's not possible to\n explicitly pass template arguments to member template function. The\n failure is serious and makes one of the primary interfaces\n unusable.\n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n\n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Several compiler bugs were worked around in order to get\n this test to pass, so it could be considered to be only\n partially working. However, the library's macro system,\n which is really being tested here, does work on this\n compiler, which is why we worked around the failures.\n Please see the test's\n source file for details.\n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n These compilers do not support SFINAE, so are expected to\n fail this test.\n \n \n\n \n \n \n \n \n \n Borland does not support this feature. A compatibility syntax\n might be developed later on.\n \n \n\n \n \n \n \n \n \n \n \n This feature generally requires advanced compiler\n features not supported by these compilers. It might\n be possible to work around the issue on VC6/7, but\n at this time no such workaround has been done.\n \n \n\n \n \n \n \n This is old and should not be tested any more.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n These test failure are reported to be under investigation\n at Sun's compiler labs.\n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n\n \n \n \n Inherited from MultiIndex\n \n \n \n \n Lots of test failures complaining about the ambiguity of a\n const and a non-const overload of the same function.\n \n \n \n \n \n This compiler seems to have very broken name lookup.\n \n \n \n \n \n \n \n \n Tend to crash the compiler (Intel 10) or simply take too long\n (Intel 11).\n \n \n \n \n \n \n This ancient GCC doesn't like local const ints as template\n parameters. Or something like that.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The error is due to problems in the standard library implementation.\n It should be fixed in newer versions of the compiler.\n \n \n \n \n \n \n The error is due to problems in the standard library implementation.\n It should be fixed in newer versions of the compiler.\n \n \n \n \n \n \n This error seems to be a bug the compiler. Please submit a\n patch.\n \n \n \n \n \n \n \n \n \n This error seems to be a bug the standard library. Please submit a\n patch.\n \n \n \n \n \n \n \n This test fails because the test ptr_vector fails. Please see the note\n for that test.\n \n \n \n \n \n \n \n For sun the problem is that insert(iterator,range)\n is not available due to partial ordering errors (the core library remains usable).\n For codewarrior the problem is at least std::auto_ptr overloads (the core library remains usable).\n \n \n \n \n \n \n \n For sun the problem is that insert(iterator,range)\n is not available due to partial ordering errors (the core library remains usable).\n For codewarrior the problem is at least std::auto_ptr overloads (the core library remains usable).\n \n \n \n \n \n \n \n For sun the problem is that insert(iterator,range)\n is not available due to partial ordering errors (the core library remains usable).\n For codewarrior the problem is at least std::auto_ptr overloads (the core library remains usable).\n \n \n \n \n \n \n \n \n For hp, this compiler bug is insignificant.\n For sun the problem is that transfer(range,ptr_map)\n is not available due to partial ordering errors (the core library remains usable).\n For codewarrior the problem is not known so please submit a patch.\n \n \n \n \n \n \n \n For sun the problem is that transfer(range,ptr_map) and\n insert(range)code>\n is not available due to partial ordering errors (the core library remains usable).\n For codewarrior the problem is at least std::auto_ptr overloads (the core library remains usable)..\n \n \n \n \n \n \n \n \n \n \n For codewarrior, the cause of this problem is unknown. Please\n submit a patch. Other failures are due to problems with\n the serialization library, or to a minor problem with the use of\n the library.\n \n \n \n \n \n \n For sun the problem is due to Boost.Test.\n \n \n \n \n \n \n Seem like a bug in the compiler. Please submit a patch.\n \n \n \n \n \n \n Seem like a bug in the compiler. Please submit a patch.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n The library fails to compile because of an error in the C++\n standard library implementation on this platform. It incorrectly\n assumes that fpos_t is of an integral type, which is not always\n the case. This is fixed in a later release.\n \n \n \n \n \n The old reasoning given for this markup, which applied\n to sun-5.8*, was as follows. However, tuple's tests\n seem to use the test library, which is apparently\n completely broken on Sun. Therefore, I've backed off\n the version number to sun-5.6 so I can see the actual\n state of the failures.\n\n
This compiler seems to be having trouble digesting\n Boost.Tuple. Until it can handle Boost.Tuple there's\n little chance it will handle Boost.Python
\n \n \n \n \n \n \n\n This compiler has a bug that causes silent misbehavior at runtime\n when each of an assignment expression follows one of the following patterns:\n expr.attr(name)\n or expr[item],\n where expr\n is-a boost::python::object. We've been\n unable to find a workaround.\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The problems with GCC 2.x only occur when C++ exceptions are thrown and\n the framework catches them, which happens quite often in the tests.\n So technically GCC 2.x is usable if you're careful.\n \n \n \n \n \n \n \n \n \n \n \n \n This test assumes standard-compliant dependent template name lookup which\n is performed by aCC6 only in strict ansi mode. Since on HP-UX/aCC6 boost\n testing is done in the default compilation mode, this test fails to\n compile on this platform (in strict ansi mode, it compiles and succeeds).\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Unsupported compiler\n \n \n \n \n \n \n \n C++11 mode (or later) required\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Reported to Intel as issue 409291, and confirmed\n as a problem. Probably this relates to a specific\n Linux-Kernel or GLibC version.\n \n \n \n \n \n Test fails with ranlux*_O1 RNGs when saving and recalling the state due to a bug in the\n double to string conversion. The problem has been reported to QNX as PR29252.\n \n \n \n \n \n This test fails because of limitations in the system assembler\n version used by GCC. It most probably would pass if the test\n were split into multiple source files.\n \n \n \n \n \n It looks like a compiler issue: the test fails with gcc 3.4.6\n and succeeds with gcc 4.2.1.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This test is designed to give users visibility of the ADL problems with their compilers.\n Lack of Argument Dependent Lookup changes how one can extend the library. The lack of\n ADL is worked-around internally so that most of the functionality is preserved.\n \n \n \n \n \n \n \n \n For most compilers this is due to problems\n with built-in arrays (notably char arrays) and operator==()\n and operator!=() for iterator_range. Thus, not using built-in arrays\n fixes the problem.\n\n For other compilers it is simply a bug in the standard library.\n \n \n \n \n \n \n push_front fails the unit test in this configuration. I do not have this\n configuration available to determine if a work-around is possible.\n \n \n \n \n \n \n This test probably fails because it uses built-in arrays. So do expect these\n functions to work in normal code.\n \n \n \n \n \n \n \n \n \n \n The string functionality is expected to work if\n the user employs std::string and stays away from built-in\n arrays.\n \n \n \n \n \n \n \n \n \n \n \n \n For most compilers this is due to problems\n with built-in arrays (notably char arrays) and operator==()\n and operator!=() for iterator_range. Thus, not using built-in arrays\n fixes the problem.\n \n \n \n \n \n \n At the time of release I couldn't figure out why this was failing.\n Anyway, the failure is not very important; also, the well-definedness of\n \"singularity\" of an iterator range is likely to change.\n \n \n \n \n \n \n \n The test requires support for Argument Dependent Lookup (ADL)\n which the compiler in question does not provide.\n \n \n \n\n \n \n \n \n \n The compiler does not support features that are essential for the library.\n \n \n \n \n \n \n \n \n \n internal error: assertion failed: copy_template_param_expr.\n It seems to be already an Intel internal bug database (tracker number #82149).\n I have no workaround yet.\n \n \n \n \n \n \n The compiler does not support features that are essential for this test .\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n No Wide character support on this platform.\n \n \n \n \n \n \n \n No Wide character support on this platform.\n \n \n \n \n \n \n \n This test requires features that are unsupported by Como:\n use and building of dll's mainly.\n \n \n \n \n \n \n \n \n This test requires features that are unsupported by Como:\n use and building of dll's mainly.\n \n \n \n \n \n \n This tests fails because a dependency (Boost.Test)\n fails to initialise correctly. The issue has been\n reported to the library's author.\n \n \n \n \n \n \n GCC on tru64 appears not to cope with C++ exceptions\n thrown from within threads.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This test fails because a dependency (Boost.Program Options) doesn't build with this compiler.\n \n \n \n \n \n \n \n This test fails because a dependency (Boost.Program Options) which currently doesn't build with this compiler.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n There appears to be a linker bug that prevents these\n projects from building, see http://qc.borland.com/wc/qcmain.aspx?d=32020.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n There appears to be a linker bug that prevents these\n projects from building, see http://qc.borland.com/wc/qcmain.aspx?d=32020.\n \n \n \n \n \n \n Test fails due to unresolved externals from STLport: appears to be\n an STLport bug. \n \n \n \n \n \n \n \n \n \n These tests pass when run directly from the command line,\n but fail when run under the regression test script.\n The issue has never been fully pinned down, but appears\n to be related to how long the tests take to run.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n The test does not compile in typeof emulation mode,\n most likely due to a compiler bug. Users are advised\n to use native typeof.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This compiler does not support native type-of (force type-of\n emulation mode defining the BOOST_TYPEOF_EMULATION macro).\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n A runtime failure of this test indicates that this platform\n dynamically links code in a manner such that under\n certain circumstances more than one instance of a\n header-defined static class member can exist at runtime. See\n FAQ\n for more information.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This test runs without problem on Borland compilers,\n which means the static assertion is not being caught.\n \n \n \n \n\n \n \n \n \n \n \n This compiler does not support enable_if, which is required\n by Boost.System.\n \n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n The test verifies that Boost.Test detects division by\n zero. It fails on PowerPC, PA-RISC and Linux ia64. On PowerPC\n processors, division has an undefined result. The compiler\n has to emit extra code to assert that the divisor isn't zero.\n\n Compiler options -fno-trapping-math and -fnon-call-exceptions\n might affect this. However, in default configuration\n no check is done, and division by zero is not detected.\n \n \n\n \n \n \n \n \n The test appears to test that failed assertion result\n in non-zero exit status. That seems to be not the\n case, for unknown reasons.\n \n \n\n \n \n \n \n \n On HP-UX platform, this test must be compiled/linked in multithread mode.\n When compiled/linked with aC++ with -mt, it succeeds. When compiled/linked\n with GCC with -pthread, it links cleanly but fails in run-time.\n \n \n\n \n\n\n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by a conflict between the compiler\n and the testing environment: the tests are run on a platform with\n too recent version of glibc, which is not currently\n supported by the compiler vendor (Intel).\n\n If you are having the same problem and really want to make\n things work, renaming strol symbol in the\n compiler's static runtime library (libcprts.a) to\n something else is known to resolve the issue.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n When a thread ends, tss data needs to be cleaned up. This process\n is mostly automatic. When threads are launched by the Boost.Thread API\n cleanup is handled by the library implementation. For threads, launched\n by the native operating system API it is not possible to get this cleanup\n on every compiler/platform. A warning (error) will be present in this case,\n which clearly states this fact. It is recommended to start threads only\n by means of the Boost.Thread API if you need to avoid the leaks that appear\n on the end of the thread. If this is not possible the cleanup can be invoked\n from user code before the process actually ends. For library implementors\n this means to call these functions during library initialization and\n finalization.\n \n \n \n \n \n \n \n \n \n \n \nThe Borland compiler and HP-UX aC++ compiler in default mode fail to bind rvalues to the thread move constructor,\nchoosing instead to bind them to the private (and unimplemented) copy constructor.\nWith aC++, the tests compile cleanly in strict ansi mode and succeed.\n \n \n \n \n \n \n \n \n \nThese tests will fail in most compilers that don't support rvalue references.\n \n \n \n \n \n \n \n \nThe implementation of native_handle() is not possible on this platform.\n \n \n \n \n \n \n \nThe implementation of native_handle() is not possible on this platform.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \nThis platform doesn't supports Boost.Chrono.\n \n \n \n \n \n \nThis platform doesn't supports Boost.Container.\n \n \n\n \n\n \n \n \n \n \n \n \n \n \n \n \n These are all failures with Boost.FunctionTypes which TTI uses.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n SFINAE for the constructors of param doesn't work correctly on this compiler.\n This affects free functions (including operators) with more than one\n any argument and overloaded member functions.\n \n \n \n \n \n This looks like an instance of MSVC substituting int in a template-id.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Classes with exactly the same names defined in different modules in anonymous namespaces collapse\n for this compiler even with RTTI on. This is a known compiler limitation that already fixed\n in newer versions or will be fixed soon.\n \n \n \n \n \n \n \n \n \n Classes with exactly the same names defined in different modules in anonymous namespaces collapse\n for this compiler with RTTI off. This is a known limitation of RTTI-off mode. Such behavior is\n reflected in docs.\n \n \n \n\n \n \n \n \n \n \n Type Traits tests are run with warnings-as-errors and GCC 3.x emits warnings with this test\n that I haven't been able to suppress.\n \n \n \n \n \n \n \n \n Apparently the compiler can't cope with these - later versions are fine though.\n Probably work-round-able if someone would care to look into these.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by the lack of compiler support for class template\n partial specialization. A limited subset of the tested functionality is\n available on the compiler through a user-side workaround (see\n \n http://www.boost.org/libs/type_traits/index.html#transformations for\n details).\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n See bug 99776 'enum UIntEnum { value = UINT_MAX } is promoted to int'\n http://lab.msdn.microsoft.com/ProductFeedback/viewfeedback.aspx?feedbackid=22b0a6b7-120f-4ca0-9136-fa1b25b26efe\n https://developercommunity.visualstudio.com/content/problem/490264/standard-violation-enum-underlying-type-cannot-rep.html\n\t \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This functionality is available only on compilers that implement C++ Core Language\n Defect Report 337.\n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n The Type Traits library is broken when used with Sunpro-5.3 and the\n argument to the template is an array or function type. Most other argument types\n do work as expected: in other words the functionality is limited\n with this compiler, but not so much as to render the library unuseable.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n The Type Traits library is broken when used with Sunpro-5.8 and the\n argument to the template is a function type. Most other argument types\n do work as expected: in other words the functionality is limited\n with this compiler, but not so much as to render the library unuseable.\n \n \n \n \n \n \n This fails with an internal compiler error,\n there is no workaround as yet.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Older versions of MWCW incorrectly align pointers to member functions\n (they use 12-byte boundaries, rather than a power-of-2 boundary),\n leading to alignment_of / aligned_storage\n to fail with these types on this compiler.\n \n \n \n\n \n \n \n \n \n \n VC6/7 has a buggy using declaration syntax which\n basically makes it impossible to implement the\n namespace forwarding that this library relies upon.\n See KB article 263630 here: http://support.microsoft.com/default.aspx?scid=kb;en-us;263630\n \n \n \n \n \n Metrowerks Codewarrior has partial TR1 support built in\n which conflicts with this implementation. Porting to this\n compiler is almost certainly possible, but will require some\n work by someone who has this compiler.\n \n \n \n \n \n \n \n Later versions of MSVC are required for these tests - the issues may\n be work-round-able if anyone cares enough to look into them.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n These tests test features that are not supported in the\n current Boost implementations of TR1 components, they will\n currently fail on all compilers, unless that compiler has\n native TR1 support.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n MSVC 9.0 with the optional feature pack installed includes\n a version of the TR1 libraries that is not as interface-conforming\n as the Boost version. Most of these failures are of the \"annoying\"\n rather than \"unusable\" kind.\n \n \n\n \n \n \n \n \n \n \n \n \n These tests fail on this platform due to a lack of\n wide character support.\n \n \n\n \n \n \n \n \n \n These tests fail due to a lack of adequate\n long double std math lib support.\n \n \n\n \n \n \n \n \n These tests fail on this platform due to incomplete\n wide character support.\n \n \n\n \n \n \n \n \n These tests fail on this platform due to incomplete\n wide character support.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Support for Borland C++ in the various TR1 libraries is pretty\n poor (due to numerous compiler bugs sadly). The TR1 concept\n checks are *very* strict, and are expected to fail with this\n compiler. In addition most of the type_traits tests fail\n whenever debugging support is turned on with an internal\n compiler error. More conservative uses are more likely to succeed\n with this compiler however.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Support for Borland C++ in the various TR1 libraries is pretty\n poor (due to numerous compiler bugs sadly). The TR1 concept\n checks are *very* strict, and are expected to fail with this\n compiler. More conservative uses are more likely to succeed\n with this compiler however.\n \n \n\n \n \n \n \n \n \n These tests fail on this platform due to a recurring GCC bug.\n \n \n\n \n \n \n \n \n \n \n \n These tests fail due to a known compiler bug\n that is fixed in more recent GNU compiler releases. Users are\n very unlikely to encounter this as a real problem\n in practice.\n \n \n\n \n \n \n \n \n \n \n \n \n These tests fail due to a known compiler bug\n that is fixed in more recent releases. Users are\n very unlikely to encounter this as a real problem\n in practice.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n These tests fail due to a known compiler bug\n that is fixed in more recent releases. This\n functionality may not be usable with this compiler.\n \n \n\n \n \n \n \n \n \n \n These tests fail due to a known stdlib bug\n that has been reported to the vendor.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This failure is caused by the lack of compiler support for class template\n partial specialization. A limited subset of the tested functionality is\n available on the compiler through a user-side workaround (see\n \n http://www.boost.org/libs/type_traits/index.html#transformations for\n details).\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This functionality is available only on compilers that implement C++ Core Language\n Defect Report 337.\n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n The Type Traits library is broken when used with Sunpro-5.3 and the\n argument to the template is an array or function type. Most other argument types\n do work as expected: in other words the functionality is limited\n with this compiler, but not so much as to render the library unuseable.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n The Type Traits library is broken when used with Sunpro-5.8 and the\n argument to the template is a function type. Most other argument types\n do work as expected: in other words the functionality is limited\n with this compiler, but not so much as to render the library unuseable.\n \n \n \n \n \n \n \n\n \n These failures appear to represent a genuine issue with the\n Boost.Random library that has yet to be addressed.\n \n \n \n \n \n \n\n \n These fail with an internal compiler error: there's no\n workaround as yet.\n \n \n \n \n \n \n This fails with an internal compiler error: there's no\n workaround as yet.\n \n \n \n \n \n \n \n \n\n \n These failures are completely spurious: they're caused by the tests\n being run with bjam -j2 and the post-processing not coping with the\n resulting output. These failures should clear if these tests\n are re-run at some point in the future.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This library is almost unusable with VC7 due to name lookup issues.\n \n \n \n \n \n \n Older versions of MWCW incorrectly align pointers to member functions\n (they use 12-byte boundaries, rather than a power-of-2 boundary),\n leading to alignment_of / aligned_storage\n to fail with these types on this compiler.\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n This tests whether inserting elements creates as few copies as I think\n is possible. If this fails it just means that the container might be\n a little inefficient.\n \n \n\n \n \n \n \n This test fail because it's using unordered's internal\n allocator traits, which doesn't work on Visual C++ 7.1.\n It normally uses the one from Boost.Container by default.\n \n \n\n \n \n \n \n boost::is_nothrow_move_constructible and\n boost::is_nothrow_move_assignable don't seem to work on this\n compiler. I'd hope that anyone wanting noexcept support would\n use a more recent compiler anyway.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n C++11 is the minimum requirement.\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n The definition of a custom template specialization of std::swap\n appears to trigger an internal compiler error (\"Fatal F1004\") on\n CodeGear 6.10.0 (formerly named Borland), as I reported,\n with help from Nicola Musatti and David Dean.\n Related Boost mailing list discussion:\n http://lists.boost.org/Archives/boost/2008/11/144465.php\n CodeGear bug reports on this issue:\n http://qc.codegear.com/wc/qcmain.aspx?d=68959\n http://qc.codegear.com/wc/qcmain.aspx?d=69196\n \n \n \n \n \n \n \n Borland 5.9.3 has an error (E2285) when trying to pass a\n multi-dimensional array by reference to a function template.\n A bug report by Christopher Yeleighton appears related:\n \"The compiler obligatorily converts member arrays to pointers\"\n http://qc.codegear.com/wc/qcmain.aspx?d=10267\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Compiler has a problem with BOOST_STATIC_CONSTANT in nested templates\n inside class template specializations.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n When I made the conversion from value_initialized<T> to T&\n const-correct, this specific compiler version gave compile errors.\n See also: Ticket #2548 - \"Let's fix the logical constness of value_initialized!\"\n \n \n \n \n \n \n \n \n This failure is caused by a compiler bug (default-constructed scalar\n types are not zero-initialized) that has been fixed in the latest\n versions of the compiler (VC 7.1 and greater).\n \n \n \n \n \n \n The test takes more that 30 minutes to compile and the\n compilation is automatically killed. It is likely caused\n by the compiler bug, but it unknown how much this\n bug affects regular use of the operators library. Is it\n also unknown if the test can be refactored so that\n not to trigger this bug.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n The test relies on Boost.Serialization which is not\n supported on this toolset.\n \n \n \n \n \n \n \n \n \n \n \n \n The test relies on Boost.Random which is not supported\n on this toolset.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The test relies on Boost.Iterator (iterator_facade)\n which is not supported on this toolset.\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n This toolset isn't supported because of the used Spirit V1.8.x, which in turn is\n not usable with this toolset.\n \n \n\n \n \n \n This toolset isn't supported because of the used multi_index library, which in turn is\n not usable with this toolset.\n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n\n \n\n \n \n\n \n \n \n \n \n These compilers do not support class template partial\n specialization.\n \n \n \n \n \n Boost.Proto doesn't work on this compiler.\n \n \n \n \n \n This compiler doesn't support SFINAE / enable_if\n \n \n \n \n \n Digital Mars cannot seem to handle dependent default template parameters,\n such as \"template < class T, bool B = is_foo < T > ::value >\"\n \n \n \n \n \n \n \n \n \n \n \n \n \n Boost.Proto doesn't work on the cray compiler.\n \n \n \n \n \n Boost.Proto doesn't work on the vacpp compiler.\n \n \n\n \n \n \n \n \n\n \n \n \n \n \n\n \n\n \n \n \n \n This library is unusable due to bug #5373 in Boost.Thread\n on this compiler.\n \n \n\n \n \n \n Windows Mobile lacks essential features of the standard C\n library like gmtime, mktime, localtime making it impossible\n to use Boost.Locale on this platform.\n \n \n\n \n \n \n \n Compiler does not support shared runtime linking\n thus is makes it problematic to use Boost.Locale as dll\n \n \n\n \n \n \n \n Problems with wide file stream I/O. \n Currently unresolved due to lack of access to the \n compiler.\n \n \n \n\n\n \n\n \n This test fails only intermittently.\n \n\n \n The failure is caused by a problem in Boost code. The Boost developers are aware of\n the problem and plan to fix it.\n \n\n \n The failure is caused by a compiler bug.\n \n\n \n The failure is caused by a compiler bug, which has been reported to the compiler\n supplier (or is already known to them).\n \n\n \n The failure is caused by a standard library bug.\n \n\n \n The failure is caused by a standard library bug, which has been reported to the\n standard library supplier (or is already known to them).\n \n\n \n The failure is probably caused by the test code, harness, or configuration. Thus,\n it may not affect users of the library.\n \n\n \n The failure is serious and likely to prevent all use of this Boost library with this compiler.\n \n\n \n The failure is serious and likely to prevent all use of this Boost library with this\n compiler. The failure is caused by a compiler bug, which has been reported to the compiler\n supplier (or is already known to them).\n \n\n \n The failure is caused by a platform API bug.\n \n\n \n The failure is caused by a platform API bug, which has been reported to the platform API\n supplier (or is already known to them).\n \n\n \n The failure is not serious and will not affect most users. The library degrades gracefully.\n \n\n \n This compiler's bugs are not supported by the library.\n \n\n \n Locales missing or adequately supported by this compiler.\n \n\n \n Missing or inadequate wchar/wstring/wstream support for this compiler.\n \n\n \n No std iterator traits for this compiler.\n \n\n \n Library has limited input/output support due to compiler inadequacies.\n \n\n \n No high precision clock for this platform.\n \n\n \n A bug in standard library prevents passing std::set from DLL to\n application. A fixed <tree> header is available from\n http://www.dinkumware.com/vc_fixes.html.\n \n\n \n Although the documentation from the Comeau website would make it appear\n that windows DLL's are supported using the --windows option, after some\n experimentation we have been unsuccessful in making dll configurations\n work correctly.\n \n\n \n The failure is caused by a runtime limitation. Locale support is only\n available with the static linked variant of the runtime. Generally\n the dynamic linked variant is required when building dynamic modules,\n DLL, so, etc.\n \n\n \n This failure is caused by a compiler bug with no known workaround.\n Patches are welcome!\n \n\n \n This failure is caused by bugs in the standard library implementation and/or\n bugs in the compiler.\n \n\n \n Unresearched failure -- please contact library developers for more\n information about possible causes.\n \n\n \n The test fails due to unresearched issues. The library\n developers are aware of this failure, but need help with\n investigating/addressing it for future releases.\n \n\n \n The support for this deficient compiler will be dropped starting\n from Boost 1.33.0 release. Please use one of the previous Boost\n releases if you need the library to work on this compiler.\n \n\n \n This failure is caused by compiler bugs or limitations. Some advanced\n or esoteric library features may be unavailable or only partially available.\n This does not impact most common uses of the library.\n \n\n \n This failure is caused by a compiler bug. Certain code constructs that should\n fail compilation are accepted by the compiler. This can mask some programming\n errors, but does not impact the usability of the library.\n \n\n \n The failures are caused by the wrong handling of the\n std::internal flag in the iostreams implementation of the\n standard library used on that compiler/platform combo. Apart from that,\n the format library works as expected.\n \n\n \n The failures are caused by the fact that the iword and pword arrays seem\n to share the same memory area in the iostreams implementation of the\n standard library used on that compiler/platform combo. As long as you\n stay clear of iword and pword, the library should work ok.\n \n\n \n This failure occurs only when using shared libraries for this\n compiler and platform, although the same programs should work\n properly when using static libraries. This problem has not\n been researched.\n \n\n \n Wide character support is disabled in the GNU Standard C++ library as\n supplied on the QNX Neutrino version 6.3.0 distribution.\n \n\n \n This problem is due to the non-conforming STLport\n implementation of vector's swap: it can be easily\n reproduced with the following code snippet:\n\n typedef std::vector<int> vector_type;\n typedef vector_type::reference reference_type;\n\n vector_type v1(4u, 1);\n vector_type v2(7u, 0);\n\n reference_type ref = v1[2];\n int x = ref;\n\n std::swap(v1, v2);\n BOOST_CHECK(v2[2] == x); // ok\n v2[2] = 1 - v2[2];\n BOOST_CHECK(ref != x); // oops\n \n\n \n When compiling this test, aCC6 runs out of memory. The HP\n compiler group is aware of this issue and is working on the fix.\n \n\n \n This test assumes native typeof support.\n \n\n \n This test assumes compiler support for rvalue references.\n \n\n \n These tests rely on the ability of an std::deque container to be\n constructed off two input iterators. Unfortunately, the Rogue Wave\n library version 2.2 and higher assumes iterator which has + and -\n operators which only random access iterator is required to provide.\n \n\n \n Internal compiler error: GCC Bugzilla Bug 33580.\n This is a regression in the gcc 4.2 series.\n \n\n \n These test failures are reported to be\n under investigation at HP's compiler lab.\n \n\n \n This compiler does not support gcc stdcall function attribute.\n \n\n \n The Rogue Wave standard library version used by this compiler provides\n a faulty vector<bool> iterator, which is not symmetric. There is an\n associated bug report in the Rogue Wave bug tracking system for this\n problem.\n \n\n \n The test does not compile, most likely because of new version of EDG Front End\n implementing Core Issue 574. In the HP bug tracking system, it is tracked as\n QuIX ID: QXCR1000804484.\n \n\n \n Depending on system load, the compile time may exceed specified timeout value.\n The test passes when the timeout value is increased.\n \n\n \n This test fails when BOOST_UBLAS_NO_NESTED_CLASS_RELATION is defined.\n \n\n \n This test fails because MinGW apparently does not always catch exceptions properly.\n \n\n \n This test requires variadic macro support.\n \n \n \n This test requires lambda function support.\n \n\n \n This test has not been updated to accomodate changes in Boost.Random.\n \n\n\n\n" }, { "path": "status/explicit-failures.xsd", "content": "\n\n\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n" }, { "path": "tools/Jamfile.v2", "content": "# Copyright 2005 Rene Rivera \n# Copyright 2005 Hartmut Kaiser \n# Copyright 2005 John Maddock \n# Copyright 2003 Vladimir Prus \n# Distributed under the Boost Software License, Version 1.0. \n# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) \n\n\n# Jamfile which builds all the tools.\n\nproject \n :\n requirements\n static\n /boost//headers \n : \n usage-requirements /boost//headers \n ;\n\nTOOLS =\n bcp//bcp\n inspect/build//inspect\n quickbook//quickbook\n /boost/libs/wave/tool//wave\n ;\n\ninstall dist-bin\n :\n $(TOOLS)\n :\n EXE\n ../dist/bin\n :\n release\n ;\n\ninstall dist-lib\n :\n $(TOOLS)\n :\n LIB\n ../dist/lib\n :\n release\n ;\n\nlocal patterns = *.dtd *.xml *.xsl LICENSE ;\nlocal dirs = boostbook/dtd boostbook/xsl ;\ninstall dist-share-boostbook\n :\n [ glob $(dirs)/$(patterns) $(dirs)/*/$(patterns) $(dirs)/*/*/$(patterns) ]\n :\n ../dist/share\n .\n ;\n" }, { "path": "tools/index.html", "content": "\n\n\n\n\n\n\n\n\n\n \n Boost Tools\n \n \n \n \n \n \n \n \n \n \n \n \n \n
\n \n \"boost.png\n Tools\n
\n\n \n \n \n \n
Getting Started   \n       \n Libraries   \n      Web Site   \n      News   \n     Community   \n     \n FAQ   \n      More Info 
\n \n

Boost developers, testers, and maintainers have developed various tools to \n help with the administration of the Boost Libraries. Like everything else about \n Boost, these tools are available in source form, and are part of the regular \n Boost distribution.

\n

Users may find these tools useful when porting Boost libraries to a new \n platform, or for use with their own applications.

\n
    \n
  • \n Boost.Build - The Boost build system, including \n the full Boost version of the jam sources.
    \n  \n
  • \n Inspect - The inspection tool used to detect \n errors in the Boost directory hierarchy.
    \n  \n
  • \n BoostBook - A Boost documentation \n system, based on DocBook and the \n Extensible Stylesheet Language (XSL), used by some Boost libraries.
    \n  \n
  • \n bcp - A utility to extract subsets of Boost; to \n determine which parts of Boost your code is using; and to print reports on \n Boost usage (including Licence information).
    \n  \n
  • \n QuickBook - QuickBook is a WikiWiki style\n documentation tool geared towards C++ documentation using simple rules and markup\n for simple formatting tasks. QuickBook generates \n BoostBook XML.
    \n  \n
  • \n Wave - A Standards conformant C/C++ \n preprocessor usable on top of any other compiler. Usable for instance for the debugging \n of the expansion of macros in your code or as a replacement for your built-in \n preprocessor.
    \n  \n
  • \n AutoIndex - A tool for indexing Boostbook/Docbook\n documents.
    \n  \n
    • \n
\n
\n

Revised \n13 Mar 2008

\n\n

Copyright Beman Dawes 2003
\n Copyright Douglas Gregor 2003
\n Copyright Aleksey Gurtovoy 2004
\n Copyright John Maddock 2004
\n Copyright Eric Niebler 2005
\n Copyright Hartmut Kaiser 2005
\n
\nDistributed under the Boost Software License, Version 1.0.\n(See file LICENSE_1_0.txt\nor www.boost.org/LICENSE_1_0.txt)

\n \n\n" }, { "path": "tools/make-cputime-page.pl", "content": "#!/usr/bin/perl -w\n\n# Copyright 2004 Aleksey Gurtovoy \n# Copyright 2001 Jens Maurer \n# Distributed under the Boost Software License, Version 1.0. \n# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) \n\nuse strict;\n\nmy $filename;\nmy $compiler;\nmy $time = 0;\nmy $ct = 0;\nmy $first = 2;\n\nprint \"\\n\\n\\nCompile Times\\n\\n\\n\";\nprint \"\\n\";\nprint \"\";\nprint \"

\\n\";\nprint \"Compile time for each successful regression test in seconds.\\n\";\nprint \"

\\n\";\n\nprint \"\\n\";\nprint \"\\n\";\n\nwhile(<>) {\n if(/^\\*\\*\\* (.*) \\*\\*\\*$/) {\n $filename = $1;\n $first = ($first == 0 ? 0 : $first-1);\n if($first == 0) {\n print \"\\n\\n\\n\\n\";\n }\n } elsif(/^\\*\\* (.*)/) {\n $compiler = $1;\n if($first) {\n print \"\\n\";\n } else {\n $ct = 1;\n }\n } elsif($ct && /^CPU time: ([.0-9]*) s user, ([.0-9]*) s system/) {\n $time = $1 + $2;\n } elsif($ct && /^Pass$/) {\n printf \"\\n\", $time;\n $ct = 0; \n } elsif($ct && /^Fail$/) {\n print \"\\n\";\n $ct = 0; \n } \n}\n\nprint \"\\n\";\nprint \"
Test
$filename$compiler%.02f-
\\n\";\nprint \"\\n\\n\";\n\n" } ]