Rework as esp-idf component

Fix for numeric overflow found during fuzzing.

.github/workflows/ci.yml

@@ -0,0 +1,424 @@
+# Copyright 2020 Evan Miller
+# Copyright 2020 Matt Borland
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at http://boost.org/LICENSE_1_0.txt)
+
+name: CI
+on:
+  push:
+    branches:
+      - master
+      - develop
+  pull_request:
+  release:
+    types: [published, created, edited]
+jobs:
+  ubuntu-focal:
+    runs-on: ubuntu-20.04
+    strategy:
+      fail-fast: false
+      matrix:
+        compiler: [ g++-9, g++-10, clang++-9, clang++-10 ]
+        standard: [ c++11, c++14, c++17, c++2a ]
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - uses: mstachniuk/ci-skip@v1
+        with:
+          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[windows];[Windows];[WINDOWS];[apple];[Apple];[APPLE]'
+          commit-filter-separator: ';'
+          fail-fast: true
+      - name: Set TOOLSET
+        run: echo ${{ matrix.compiler }} | awk '/^g/ { print "TOOLSET=gcc" } /^clang/ { print "TOOLSET=clang" }' >> $GITHUB_ENV
+      - name: Add repository
+        run: sudo apt-add-repository -y "ppa:ubuntu-toolchain-r/test"
+      - name: Install packages
+        run: sudo apt install g++-9 g++-10 clang-9 clang-10  libicu-dev
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: cp -r $GITHUB_WORKSPACE/* libs/regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: ./bootstrap.sh
+        working-directory: ../boost-root
+      - name: Generate headers
+        run: ./b2 headers
+        working-directory: ../boost-root
+      - name: Generate user config
+        run: 'echo "using $TOOLSET : : ${{ matrix.compiler }} : <cxxflags>-std=${{ matrix.standard }} ;" > ~/user-config.jam'
+        working-directory: ../boost-root
+      - name: Config info install
+        run: ../../../b2 config_info_travis_install toolset=$TOOLSET
+        working-directory: ../boost-root/libs/config/test
+      - name: Config info
+        run: ./config_info_travis
+        working-directory: ../boost-root/libs/config/test
+      - name: Test
+        run: ../../../b2 toolset=$TOOLSET
+        working-directory: ../boost-root/libs/regex/test
+  ubuntu-bionic:
+    runs-on: ubuntu-18.04
+    strategy:
+      fail-fast: false
+      matrix:
+        compiler: [ g++-7, g++-8, clang++-7, clang++-8 ]
+        standard: [ c++11, c++14, c++17 ]
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - uses: mstachniuk/ci-skip@v1
+        with:
+          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[windows];[Windows];[WINDOWS];[apple];[Apple];[APPLE]'
+          commit-filter-separator: ';'
+          fail-fast: true
+      - name: Set TOOLSET
+        run: echo ${{ matrix.compiler }} | awk '/^g/ { print "TOOLSET=gcc" } /^clang/ { print "TOOLSET=clang" }' >> $GITHUB_ENV
+      - name: Add repository
+        run: sudo apt-add-repository -y "ppa:ubuntu-toolchain-r/test"
+      - name: Install packages
+        run: sudo apt install g++-7 g++-8 clang-7 clang-8 libicu-dev
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: cp -r $GITHUB_WORKSPACE/* libs/regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: ./bootstrap.sh
+        working-directory: ../boost-root
+      - name: Generate headers
+        run: ./b2 headers
+        working-directory: ../boost-root
+      - name: Generate user config
+        run: 'echo "using $TOOLSET : : ${{ matrix.compiler }} : <cxxflags>-std=${{ matrix.standard }} ;" > ~/user-config.jam'
+        working-directory: ../boost-root
+      - name: Config info install
+        run: ../../../b2 config_info_travis_install toolset=$TOOLSET
+        working-directory: ../boost-root/libs/config/test
+      - name: Config info
+        run: ./config_info_travis
+        working-directory: ../boost-root/libs/config/test
+      - name: Test
+        run: ../../../b2 toolset=$TOOLSET define=CI_SUPPRESS_KNOWN_ISSUES define=SLOW_COMPILER
+        working-directory: ../boost-root/libs/regex/test
+  macos:
+    runs-on: macos-latest
+    strategy:
+      fail-fast: false
+      matrix:
+        toolset: [ clang ]
+        standard: [ 11, 14, 17, 2a ]
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - uses: mstachniuk/ci-skip@v1
+        with:
+          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[windows];[Windows];[WINDOWS];[linux];[Linux];[LINUX]'
+          commit-filter-separator: ';'
+          fail-fast: true
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: cp -r $GITHUB_WORKSPACE/* libs/regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: ./bootstrap.sh
+        working-directory: ../boost-root
+      - name: Generate headers
+        run: ./b2 headers
+        working-directory: ../boost-root
+      - name: Config info install
+        run: ../../../b2 config_info_travis_install toolset=${{ matrix.toolset }} cxxstd=${{ matrix.standard }}
+        working-directory: ../boost-root/libs/config/test
+      - name: Config info
+        run: ./config_info_travis
+        working-directory: ../boost-root/libs/config/test
+      - name: Test
+        run: ../../../b2 toolset=${{ matrix.toolset }} cxxstd=${{ matrix.standard }}
+        working-directory: ../boost-root/libs/regex/test
+  windows_gcc:
+    runs-on: windows-2019
+    defaults:
+      run:
+        shell: cmd
+    env:
+      ARGS: toolset=${{ matrix.toolset }} address-model=64 cxxstd=${{ matrix.standard }}
+    strategy:
+      fail-fast: false
+      matrix:
+        toolset: [ gcc ]
+        standard: [ 11, 14, 17, 2a ]
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - uses: mstachniuk/ci-skip@v1
+        with:
+          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[apple];[Apple];[APPLE];[linux];[Linux];[LINUX]'
+          commit-filter-separator: ';'
+          fail-fast: true
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: xcopy /s /e /q %GITHUB_WORKSPACE% libs\regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: bootstrap
+        working-directory: ../boost-root
+      - name: Generate headers
+        run: b2 headers
+        working-directory: ../boost-root
+      - name: Config info install
+        run: ..\..\..\b2 config_info_travis_install %ARGS%
+        working-directory: ../boost-root/libs/config/test
+      - name: Config info
+        run: config_info_travis
+        working-directory: ../boost-root/libs/config/test
+      - name: Test
+        run: ..\..\..\b2 --hash %ARGS%
+        working-directory: ../boost-root/libs/regex/test
+  windows_msvc_14_0:
+    runs-on: windows-2019
+    defaults:
+      run:
+        shell: cmd
+    env:
+      ARGS: toolset=${{ matrix.toolset }} address-model=64 cxxstd=${{ matrix.standard }}
+    strategy:
+      fail-fast: false
+      matrix:
+        toolset: [ msvc-14.0 ]
+        standard: [ 14, 17 ]
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - uses: mstachniuk/ci-skip@v1
+        with:
+          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[apple];[Apple];[APPLE];[linux];[Linux];[LINUX]'
+          commit-filter-separator: ';'
+          fail-fast: true
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: xcopy /s /e /q %GITHUB_WORKSPACE% libs\regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: bootstrap
+        working-directory: ../boost-root
+      - name: Generate headers
+        run: b2 headers
+        working-directory: ../boost-root
+      - name: Config info install
+        run: ..\..\..\b2 config_info_travis_install %ARGS%
+        working-directory: ../boost-root/libs/config/test
+      - name: Config info
+        run: config_info_travis
+        working-directory: ../boost-root/libs/config/test
+      - name: Test
+        run: ..\..\..\b2 --hash %ARGS%
+        working-directory: ../boost-root/libs/regex/test
+  windows_msvc_14_2:
+    runs-on: windows-2019
+    defaults:
+      run:
+        shell: cmd
+    env:
+      ARGS: toolset=${{ matrix.toolset }} address-model=64 cxxstd=${{ matrix.standard }}
+    strategy:
+      fail-fast: false
+      matrix:
+        toolset: [ msvc-14.2 ]
+        standard: [ 14, 17, latest ]
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - uses: mstachniuk/ci-skip@v1
+        with:
+          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[apple];[Apple];[APPLE];[linux];[Linux];[LINUX]'
+          commit-filter-separator: ';'
+          fail-fast: true
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: xcopy /s /e /q %GITHUB_WORKSPACE% libs\regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: bootstrap
+        working-directory: ../boost-root
+      - name: Generate headers
+        run: b2 headers
+        working-directory: ../boost-root
+      - name: Config info install
+        run: ..\..\..\b2 config_info_travis_install %ARGS%
+        working-directory: ../boost-root/libs/config/test
+      - name: Config info
+        run: config_info_travis
+        working-directory: ../boost-root/libs/config/test
+      - name: Test
+        run: ..\..\..\b2 --hash %ARGS%
+        working-directory: ../boost-root/libs/regex/test
+  windows_msvc_14_3:
+    runs-on: windows-2022
+    defaults:
+      run:
+        shell: cmd
+    env:
+      ARGS: toolset=${{ matrix.toolset }} address-model=64 cxxstd=${{ matrix.standard }}
+    strategy:
+      fail-fast: false
+      matrix:
+        toolset: [ msvc-14.3 ]
+        standard: [ 14, 17, 20, latest ]
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - uses: mstachniuk/ci-skip@v1
+        with:
+          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[apple];[Apple];[APPLE];[linux];[Linux];[LINUX]'
+          commit-filter-separator: ';'
+          fail-fast: true
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: xcopy /s /e /q %GITHUB_WORKSPACE% libs\regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: bootstrap
+        working-directory: ../boost-root
+      - name: Generate headers
+        run: b2 headers
+        working-directory: ../boost-root
+      - name: Config info install
+        run: ..\..\..\b2 config_info_travis_install %ARGS%
+        working-directory: ../boost-root/libs/config/test
+      - name: Config info
+        run: config_info_travis
+        working-directory: ../boost-root/libs/config/test
+      - name: Test
+        run: ..\..\..\b2 --hash %ARGS%
+        working-directory: ../boost-root/libs/regex/test
+  ubuntu-cmake-install:
+    runs-on: ubuntu-20.04
+    strategy:
+      fail-fast: false
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: cp -r $GITHUB_WORKSPACE/* libs/regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: ./bootstrap.sh
+        working-directory: ../boost-root
+      - name: CMake Test
+        working-directory: ../boost-root
+        run: | 
+         mkdir __build__ && cd __build__
+         cmake -DBOOST_ENABLE_CMAKE=1 -DBoost_VERBOSE=1 -DBOOST_INCLUDE_LIBRARIES="regex;core" -DBUILD_TESTING=OFF -DCMAKE_INSTALL_PREFIX=~/.local ..
+         cmake --build . --target install
+         cd ../libs/regex/test/cmake_install_test && mkdir __build__ && cd __build__
+         cmake -DCMAKE_INSTALL_PREFIX=~/.local ..
+         cmake --build .
+         cmake --build . --target check
+  ubuntu-cmake-check:
+    runs-on: ubuntu-20.04
+    strategy:
+      fail-fast: false
+    steps:
+      - uses: actions/checkout@v2
+        with:
+          fetch-depth: '0'
+      - name: Install packages
+        run: sudo apt install libicu-dev
+      - name: Checkout main boost
+        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
+      - name: Update tools/boostdep
+        run: git submodule update --init tools/boostdep
+        working-directory: ../boost-root
+      - name: Copy files
+        run: cp -r $GITHUB_WORKSPACE/* libs/regex
+        working-directory: ../boost-root
+      - name: Install deps
+        run: python tools/boostdep/depinst/depinst.py -I example -g "--jobs 3" regex
+        working-directory: ../boost-root
+      - name: Bootstrap
+        run: ./bootstrap.sh
+        working-directory: ../boost-root
+      - name: CMake Test
+        working-directory: ../boost-root/libs/regex/test
+        run: | 
+          cd cmake_subdir_test && mkdir __build__ && cd __build__
+          cmake ..
+          cmake --build .
+          cmake --build . --target check
+          rm -rf *
+          echo Standalone configuration
+          cmake -DBOOST_REGEX_STANDALONE=on ..
+          cmake --build .
+          cmake --build . --target check
+          cd ../../cmake_subdir_test_icu && mkdir __build__ && cd __build__
+          cmake ..
+          cmake --build .
+          cmake --build . --target check
+          rm -rf *
+          echo Standalone configuration
+          cmake -DBOOST_REGEX_STANDALONE=on ..
+          cmake --build .
+          cmake --build . --target check

CMakeLists.txt

@@ -0,0 +1,88 @@
+# Copyright 2018 Mike Dev
+# Copyright 2019 Peter Dimov
+# Distributed under the Boost Software License, Version 1.0.
+# See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt
+
+if(NOT DEFINED IDF_TARGET)
+
+# We support CMake 3.5, but prefer 3.16 policies and behavior
+cmake_minimum_required(VERSION 3.5...3.16)
+
+project(boost_regex VERSION "${BOOST_SUPERPROJECT_VERSION}" LANGUAGES CXX)
+
+add_library(boost_regex INTERFACE)
+add_library(Boost::regex ALIAS boost_regex)
+
+target_include_directories(boost_regex INTERFACE include)
+
+option(BOOST_REGEX_STANDALONE "Boost.Regex: Enable Standalone Mode (i.e. no Boost dependencies)")
+
+if(NOT BOOST_REGEX_STANDALONE)
+
+   target_link_libraries(boost_regex
+     INTERFACE
+       Boost::config
+       Boost::throw_exception
+       Boost::predef
+       Boost::assert
+   )
+
+else()
+
+   target_compile_definitions(boost_regex
+     INTERFACE BOOST_REGEX_STANDALONE
+   )
+
+endif()
+
+find_package(ICU COMPONENTS data i18n uc QUIET)
+#option(BOOST_REGEX_ENABLE_ICU "Boost.Regex: enable ICU support" ${ICU_FOUND})
+
+if(ICU_FOUND)
+
+   add_library(boost_regex_icu INTERFACE)
+   add_library(Boost::regex_icu ALIAS boost_regex_icu)
+
+   target_include_directories(boost_regex_icu INTERFACE include)
+
+   if(NOT BOOST_REGEX_STANDALONE)
+
+      target_link_libraries(boost_regex_icu
+        INTERFACE
+          Boost::config
+          Boost::throw_exception
+          Boost::predef
+          Boost::assert
+      )
+
+   else()
+
+      target_compile_definitions(boost_regex_icu
+        INTERFACE BOOST_REGEX_STANDALONE
+      )
+
+   endif()
+
+   find_package(ICU COMPONENTS data i18n uc REQUIRED)
+
+   target_link_libraries(boost_regex_icu INTERFACE ICU::data ICU::i18n ICU::uc)
+
+endif()
+
+else()
+
+FILE(GLOB_RECURSE headers include/*.h include/*.hpp)
+
+idf_component_register(
+    SRCS
+        ${headers}
+    INCLUDE_DIRS
+        include
+    REQUIRES
+        boost_config
+        boost_throw_exception
+        boost_predef
+        boost_assert
+)
+
+endif()

README.md

@@ -0,0 +1,47 @@
+Boost Regex Library
+============================
+
+The Boost Regex library provides regular expression support for C++, this library is the ancestor to std::regex and still goes beyond
+and offers some advantages to, the standard version.
+
+The full documentation is available on [boost.org](http://www.boost.org/doc/libs/release/libs/regex/index.html).
+
+## Standalone Mode ##
+
+ This library may now be used in "standalone" mode without the rest of the Boost C++ libraries, in order to do this you must either:
+
+* Have a C++17 compiler that supports __has_include, in this case if <boost/config.hpp> is not present then the library will automoatically enter standalone mode. Or:
+* Define BOOST_REGEX_STANDALONE when building.
+
+The main difference between the 2 modes, is that when Boost.Config is present the library will automatically configure itself around various compiler defects. In particular in order to use the library with exception support turned off, you will either need a copy of Boost.Config in your include path, or else manually define BOOST_NO_EXCEPTIONS when building.
+
+In any event, to obtain a standalone version of this library, simply download a .zip of the "master" branch of this repository.
+
+## Support, bugs and feature requests ##
+
+Bugs and feature requests can be reported through the [Gitub issue tracker](https://github.com/boostorg/regex/issues)
+(see [open issues](https://github.com/boostorg/regex/issues) and
+[closed issues](https://github.com/boostorg/regex/issues?utf8=%E2%9C%93&q=is%3Aissue+is%3Aclosed)).
+
+You can submit your changes through a [pull request](https://github.com/boostorg/regex/pulls).
+
+There is no mailing-list specific to Boost Regex, although you can use the general-purpose Boost [mailing-list](http://lists.boost.org/mailman/listinfo.cgi/boost-users) using the tag [regex].
+
+
+## Development ##
+
+Clone the whole boost project, which includes the individual Boost projects as submodules ([see boost+git doc](https://github.com/boostorg/boost/wiki/Getting-Started)): 
+
+    git clone https://github.com/boostorg/boost
+    cd boost
+    git submodule update --init
+
+The Boost Regex Library is located in `libs/regex/`. 
+
+### Running tests ###
+First, make sure you are in `libs/regex/test`. 
+You can either run all the tests listed in `Jamfile.v2` or run a single test:
+
+    ../../../b2                        <- run all tests
+    ../../../b2 regex_regress          <- single test
+

build/Jamfile.v2

@@ -0,0 +1,165 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
+
+import modules ;
+import testing ;
+import errors ;
+
+project : requirements
+   # default to all warnings on:
+   <warnings>all
+   ;
+
+local disable-icu = [ MATCH (--disable-icu) : [ modules.peek : ARGV ] ] ;
+
+rule path_options ( properties * )
+{
+    local result ;
+    if <address-model>64 in $(properties) && <toolset>msvc in $(properties) 
+    {
+    	result = <search>$(ICU_PATH)/bin64 <search>$(ICU_PATH)/lib64 ;
+    }
+    else
+    {
+    	result = <search>$(ICU_PATH)/bin <search>$(ICU_PATH)/lib ;
+    }
+    return $(result) ;
+}
+
+#
+# ICU configuration:
+#
+if ! $(disable-icu)
+{
+   if [ modules.peek : ICU_LINK ]
+   {    
+       errors.user-error : "The ICU_LINK option is no longer supported by the Boost.Regex build - please refer to the documentation for equivalent options" ;
+   }
+
+   if [ modules.peek : ICU_PATH ]
+   {    
+       ICU_PATH =  [ modules.peek : ICU_PATH ] ;
+   }
+   if [ modules.peek : ICU_ICUUC_NAME ]
+   {    
+       ICU_ICUUC_NAME =  [ modules.peek : ICU_ICUUC_NAME ] ;
+   }
+   if [ modules.peek : ICU_ICUDT_NAME ]
+   {    
+       ICU_ICUDT_NAME =  [ modules.peek : ICU_ICUDT_NAME ] ;
+   }
+   if [ modules.peek : ICU_ICUIN_NAME ]
+   {    
+       ICU_ICUIN_NAME =  [ modules.peek : ICU_ICUIN_NAME ] ;
+   }
+
+   if $(ICU_ICUUC_NAME)
+   {
+      lib icuuc : : <name>$(ICU_ICUUC_NAME) <conditional>@path_options ;
+   }
+   else
+   {
+      lib icuuc : :                                                               <runtime-link>shared <conditional>@path_options ;
+      lib icuuc : : <toolset>msvc                     <variant>debug <name>icuucd <runtime-link>shared <conditional>@path_options ;
+      lib icuuc : : <toolset>intel <target-os>windows <variant>debug <name>icuucd <runtime-link>shared <conditional>@path_options ;
+      lib icuuc : :                                                  <name>sicuuc <runtime-link>static <conditional>@path_options ;
+      lib icuuc : : <toolset>msvc                     <variant>debug <name>sicuucd <runtime-link>static <conditional>@path_options ;
+      lib icuuc : : <toolset>intel <target-os>windows <variant>debug <name>sicuucd <runtime-link>static <conditional>@path_options ;
+      lib icuuc : : <name>this_is_an_invalid_library_name ;
+   }
+   if $(ICU_ICUDT_NAME)
+   {
+      lib icudt : : <name>$(ICU_ICUDT_NAME) <conditional>@path_options ;
+   }
+   else
+   {
+      lib icudt : : <name>icudata                                   <runtime-link>shared <conditional>@path_options ;
+      lib icudt : : <name>icudt   <toolset>msvc                     <runtime-link>shared <conditional>@path_options ;
+      lib icudt : : <name>icudt   <toolset>intel <target-os>windows <runtime-link>shared <conditional>@path_options ;
+      lib icudt : : <name>sicudata                                   <runtime-link>static <conditional>@path_options ;
+      lib icudt : : <name>sicudt   <toolset>msvc                     <runtime-link>static <conditional>@path_options ;
+      lib icudt : : <name>sicudt   <toolset>intel <target-os>windows <runtime-link>static <conditional>@path_options ;
+      lib icudt : : <name>this_is_an_invalid_library_name ;
+   }
+   if $(ICU_ICUIN_NAME)
+   {
+      lib icuin : : <name>$(ICU_ICUIN_NAME) <conditional>@path_options ;
+   }
+   else
+   {
+      lib icuin : :                                                    <name>icui18n <runtime-link>shared <conditional>@path_options ;
+      lib icuin : : <toolset>msvc                     <variant>debug   <name>icuind  <runtime-link>shared <conditional>@path_options ;
+      lib icuin : : <toolset>msvc                                      <name>icuin   <runtime-link>shared <conditional>@path_options ;
+      lib icuin : : <toolset>intel <target-os>windows <variant>debug   <name>icuind  <runtime-link>shared <conditional>@path_options ;
+      lib icuin : : <toolset>intel <target-os>windows                  <name>icuin   <runtime-link>shared <conditional>@path_options ;
+      lib icuin : :                                                    <name>sicui18n <runtime-link>static <conditional>@path_options ;
+      lib icuin : : <toolset>msvc                     <variant>debug   <name>sicuind  <runtime-link>static <conditional>@path_options ;
+      lib icuin : : <toolset>msvc                                      <name>sicuin   <runtime-link>static <conditional>@path_options ;
+      lib icuin : : <toolset>intel <target-os>windows <variant>debug   <name>sicuind  <runtime-link>static <conditional>@path_options ;
+      lib icuin : : <toolset>intel <target-os>windows                  <name>sicuin   <runtime-link>static <conditional>@path_options ;
+      lib icuin : : <name>this_is_an_invalid_library_name ;
+   }
+
+   ICU_OPTS = 
+      <include>$(ICU_PATH)/include 
+      <runtime-link>shared:<library>icuuc/<link>shared
+      <runtime-link>shared:<library>icudt/<link>shared
+      <runtime-link>shared:<library>icuin/<link>shared
+      <runtime-link>static:<library>icuuc
+      <runtime-link>static:<library>icudt
+      <runtime-link>static:<library>icuin
+      <target-os>windows,<toolset>clang:<linkflags>"advapi32.lib"
+      <define>BOOST_HAS_ICU=1 
+      <runtime-link>static:<define>U_STATIC_IMPLEMENTATION=1
+      ;
+
+   if [ modules.peek : ICU_DATA_DIR ]
+   {
+       rule data-dir-options ( properties * )
+       {
+          local result ;
+          local data_dir = [ modules.peek : ICU_DATA_DIR ] ;
+          if <toolset>emscripten in $(properties)
+          {
+             result = <define>ICU_DATA_DIR=\\\"/$(data_dir:BS)\\\"
+                      "<linkflags>--embed-file $(data_dir)@/$(data_dir:BS)"
+                      ;
+          }
+          else
+          {
+             result = <define>ICU_DATA_DIR=\\\"$(data_dir)\\\" ;
+          }
+          return $(result) ;
+       }
+
+       ICU_OPTS += <conditional>@data-dir-options ;
+   }
+
+}
+
+exe has_icu : has_icu_test.cpp : $(ICU_OPTS) ;
+explicit has_icu ;
+
+obj is_legacy_03 : is_legacy_03.cpp ;
+explicit is_legacy_03 ;
+
+alias icu_options : : : : [ check-target-builds has_icu : $(ICU_OPTS) : ] ;
+
+SOURCES = 
+   posix_api.cpp
+   regex.cpp
+   regex_debug.cpp
+   static_mutex.cpp
+   wide_posix_api.cpp
+;
+
+lib boost_regex : ../src/$(SOURCES) icu_options
+    :         
+	     <link>shared:<define>BOOST_REGEX_DYN_LINK=1
+	     <toolset>gcc-cygwin:<link>static
+    ;
+
+boost-install boost_regex ;
+

build/has_icu_test.cpp

@@ -0,0 +1,56 @@
+/*
+ *
+ * Copyright (c) 2010
+ * John Maddock
+ *
+ * Use, modification and distribution are subject to the 
+ * Boost Software License, Version 1.0. (See accompanying file 
+ * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ *
+ */
+
+#include <unicode/uversion.h>
+#include <unicode/utypes.h>
+#include <unicode/uchar.h>
+#include <unicode/coll.h>
+#include <boost/scoped_ptr.hpp>
+#include <iostream>
+#include <iomanip>
+
+#if defined(_MSC_VER) && !defined(_DLL)
+//#error "Mixing ICU with a static runtime doesn't work"
+#endif
+
+void print_error(UErrorCode err, const char* func)
+{
+   std::cerr << "Error from function " << func << " with error: " << ::u_errorName(err) << std::endl;
+}
+
+int main()
+{
+#ifdef ICU_DATA_DIR
+   ::u_setDataDirectory(ICU_DATA_DIR);
+#endif
+
+   // To detect possible binary mismatches between the installed ICU build, and whatever
+   // C++ std lib's we're using, we need to:
+   // * Make sure we call ICU C++ API's
+   // * Make sure we call std lib C++ API's as well (cout).
+   // * Be sure this program is run, not just built.
+   UErrorCode err = U_ZERO_ERROR;
+   UChar32 c = ::u_charFromName(U_UNICODE_CHAR_NAME, "GREEK SMALL LETTER ALPHA", &err);
+   std::cout << (int)c << std::endl;
+   if(err > 0)
+   {
+      print_error(err, "u_charFromName");
+      return err;
+   }
+   U_NAMESPACE_QUALIFIER Locale l;
+   boost::scoped_ptr<U_NAMESPACE_QUALIFIER Collator> p_col(U_NAMESPACE_QUALIFIER Collator::createInstance(l, err));
+   if(err > 0)
+   {
+      print_error(err, "Collator::createInstance");
+      return err;
+   }
+   return err > 0 ? err : 0;
+}

build/is_legacy_03.cpp

@@ -0,0 +1,16 @@
+/*
+ *
+ * Copyright (c) 2020
+ * John Maddock
+ *
+ * Use, modification and distribution are subject to the 
+ * Boost Software License, Version 1.0. (See accompanying file 
+ * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ *
+ */
+
+#include <boost/regex/config.hpp>
+
+#ifdef BOOST_REGEX_CXX03
+#error "Legacy mode"
+#endif

changes.txt

@@ -1,236 +0,0 @@
-FIXED:    Signed/unsigned conversions in regex_compile.hpp and regex_format.hpp
-ADDED:    Forwarder functions to match_results.
-FIXED:    More errors from Como in strict mode.
-
-Version 303:
-FIXED:    Code glitches for Como compiler in strict mode.
-FIXED:    Missing fixes for cstdio header.
-FIXED:    memory leak in underlying w32 traits classes
-FIXED:    vc6 clean option to remove *.pch files.
-CHANGED:  Build options for VC6 to avoid compiler optimisation bug.
-FIXED:    Missing BOOST_RE_NO_WCSTRING guard around using declaration in regex.h
-FIXED:    Pathological regular expressions in snip4.cpp and in docs.
-FIXED:    Missing std:: prefixes in some headers.
-
-Version 302:
-FIXED:    STLPort debug problems.
-FIXED:    Compatibility with updated Dinkum libraries and VC6.
-ADDED:    Tentative support for partial matches (not yet documented).
-
-Version 301:
-First boost release version,
-CHANGED:  reg_match to match_results
-CHANGED:  Documentation updated to reflect changes, provided links to sources from docs.
-CHANGED:  RegEx(const char*) constructor to explicit.
-CHANGED:  Return type of RegEx::Split to unsigned int.
-ADDED:    Exception documentation for OS errors.
-REMOVED:  BOOST_RE_NO_EXCEPTIONS macro.
-FIXED:    mapfile::open/close to check for OS errors.
-FIXED:    Non-exception safe code in cpp_regex_traits.
-FIXED:    Removed undefined symbol INFINITE from re_thrd.hpp
-FIXED:    Bug in configure script thread detection code.
-CHANGED:  "depreciated" to "deprecated"
-FIXED:    Documentation error for bad_expression.
-CHANGED:  regbase::flag_type to unsigned int
-ADDED:    explicit constructors to reg_expression/match_results
-ADDED:    extra signatures for regex_format/regex_merge for std::string arguments.
-REMOVED:  bad_pattern/bad_expression::what from regex.cpp
-REMOVED:  Implicit conversion operators from sub_match (except for conversion to basic_string).
-
-Version 300:
-Candidate release boost version,
-ADDED:    Support for non-greedy repeats.
-ADDED:    Support for non-marking grouping.
-ADDED:    Auto-detection of STLPort STL versions.
-CHANGED:  Re-written and re-organised traits classes.
-CHANGED:  Regression test make files for more rigorous testing of all build versions.
-
-Version 249:
-Pre-release boost version,
-CHANGED:  All macro prefixes to BOOST_RE_
-CHANGED:  namespaces to boost
-CHANGED:  Header file extentions to .hpp
-DEPRECIATED: Old style algorithms, replaced with more consistant naming style.
-DEPRECIATED: Standard library independant compiles no longer possible, bespoke
-             classes replaced with standard library/boost equivalents where available.
-
-Version 221:
-ADDED:    C++ Builder 3 workaround in boost/detail/jgrep.hpp
-
-Version 220:
-ADDED:    Merge functions to class RegEx
-
-
-Version 218:
-FIXED:    All known bugs prior to this version.
-FIXED:    Added workaround for gcc optimisation bug to jm/regmatch.h
-ADDED:    Cygwin mount point support.
-
-Version 217:
-BUG:      configure script did not correctly identify template 
-          friend support, or template function partial ordering support.
-          
-FIXED:    All known bugs prior to this version.
-
-Version 216:
-BUG:      Some RegEx::Grep variants buggy.
-BUG:      FileIterator leaked memory.
-BUG:      Memory alignment problems with gcc/sparc platform
-
-CHANGED:  RegEx callback declarations to cope with VC6 builds using 
-          non-default calling conventions.
-CHANGED:  Some configuration options to try and keep Mingwin32 port
-          of gcc 2.95 happy.
-FIXED:    Bug in RegEx::What introduced in version 214 fix :-(
-
-Version 215:
-CHANGED:  Added #pragma push/pop to fix C++ Builder 3 problems.
-CHANGED:  Wide to narrow character conversions, to be more conformant with standard.
-CHANGED:  Minor documentation updates.
-
-Version 214:
-FIXED     All known bugs rpior to this point.
-CHANGED:  Minor changes to keep VC5 and GCC 2.95 happy.
-
-Version 213:
-BUG:      Far eastern versions of Win32 could not compile
-          re_nlsw.cpp due to string literal - code page
-          interactions.
-          
-ADDED:    Convenience conversion operators to sub_match<>.
-CHANGED:  Removed REG_E_MEMORY as it duplicates REG_ESPACE.
-ADDED:    Additional tests to regress.
-CHANGED:  RegEx::GrepFiles and RegEx::FindFiles previously had undefined
-          behaviour if the callback returned false, changed to abort
-          the whole search if the callback returns false.
-
-FIXED:    All known bugs prior to this release.
-
-Version 212:
-BUG:      Use of catopen in re_mss.cpp causes problems on some systems.
-BUG:      Comparison operators for reg_expression and reg_match should be const.
-BUG:      Missing output iterator increment in regfmt.h.
-
-ADDED:    REG_NOCOLLATE, so that locale dependent collation can be turned off for
-          the POSIX C API's as well as the underlying templates.
-CHANGED:  Misc. documentation updates.
-FIXED:    Linking problem for some egcs ports.
-CHANGED:  Tightened up exception safety.
-ADDED:    Convenience interfaces to query_match, reg_search, reg_grep, reg_format and reg_merge.
-ADDED:    Convenience std::string overloads of reg_expression members.
-FIXED:    All bugs found prior to this release.
-
-
-Version 211:
-BUG:      RegEx::GrepFiles fails to log sub-expression matches correctly.
-BUG:      file_iterator/directory_iterator fail to find all files when using '*'.
-
-CHANGED:  Changes required to make the code compile with HP's aCC compiler.
-CHANGED:  Using declarations, to hide implimentation details.
-CHANGED:  Behavior of ^ and $ to follow Unicode newline guidelines and account
-          for \r\n sequences.
-
-Version 210:
-FIXED:    All known bugs prior to this point.
-ADDED:    configure shell script for porting to Unix style systems.
-CHANGED:  jm::reg_match_base::pair to jm::sub_match, for easier porting.
-
-Version 200:
-BUG:      RegEx::GrepFiles buggy
-BUG:      RegEx::FindFiles buggy
-BUG:      non-portable header file usage in fileiter.h
-BUG:      non-portable enum declarations in headers.
-BUG:      non-portable use of isspace in regfacet.cpp
-BUG:      Missing regfac.obj from bcb makefiles.
-BUG:      non-portable declaration of type jm::reg_match_base::reference.
-BUG:      missing <wchar.h> declaration required by some systems.
-BUG:      Use of JM_NO_WCSTRING incomplete.
-BUG:      Misspelled JM_NO_EXCEPTIONS in places.
-BUG:      regfmt.h has typo on line 538.
-BUG:      reg_format and reg_merge not portable to all output iterator types.
-BUG:      non-portable use of typedefs.
-BUG:      non-portable use of friend declarations.
-
-CHANGED:  Allocator usage, to improve efficiency with instance based allocators.
-CHANGED:  regress.h, various fixes for various Borland C++ versions, allocators cleaned up.
-ADDED:    Win32 specific localisation code.
-ADDED:    C and C++ specific localisation code.
-ADDED:    collating element and equivalence class support.
-CHANGED:  Character class declarations.
-CHANGED:  Behaviour of ranges to deal with locales.
-ADDED:    Support for some perl escape sequences (but not yet (?...) ).
-CHANGED:  regbase::icase flag now turns on case insensitivity,
-          traits class char_regex_traits_i is now deprecated.
-CHANGED:  reg_grep now takes a predicate not an output iterator,
-          allows user code to terminate search midway through,
-          and to use regular callback function with grep.
-CHANGED:  Modified search heuristics to improve certain expression
-          types, especially expressions which start with a literal
-          string, or a single character repeat.  The latter are much
-          less likely to become pathological now.
-ADDED:    High level C++ class RegEx.
-
-Version 111:
-BUG:      Wouldn't compile directly on C++ Builder 4 when it was released
-          (not really a bug - more an incompatability)
-          
-FIXED:    All bugs discovered prior to this version (below).
-
-Version 110:
-BUG:      reg_match::maybe_assign could lead to pointer 
-          overrun in certain (rare) circumstances.
-
-FIXED:    All bugs discovered prior to this version (below).
-FIXED:    Support for VC++, GCC, EGCS.
-CHANGED:  Regress.h to work around various compiler bugs.
-
-Version 100:
-BUG:      Literal "," not recognised as a literal.
-
-FIXED:    All bugs discovered prior to this version (below).
-ADDED:    Regress.exe, regression test application.
-
-Version 095
-BUG:      wide character sets that start with ^ not recognised,
-          for example [^[:space:]] will not find anything.
-BUG:      reg_grep fails if match occurs at first character.
-BUG:      If regcomp fails, internal data not freed.
-BUG:      reg_grep fails to reinitialise match after assignment
-          to output iterator.  Line start optimised search restarts
-          from the wrong location if the match is longer than one line.
-BUG:      POSIX API functions can propagate C++ exceptions if the
-          default allocator can throw exceptions.
-BUG:      character sets don't function correctly when regbase::char_classes
-          is not set.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/c_compiler_checks/posix_api_check.c

@@ -1,64 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.
- * It is provided "as is" without express or implied warranty.
- *
- */
-
- /*
-  *   LOCATION:    see http://www.boost.org for most recent version.
-  *   FILE         posix_api_compiler_check.c
-  *   VERSION      3.01
-  *   DESCRIPTION: Verify that POSIX API calls compile: note this is a compile
-  *                time check only.
-  */
-
-#include <stdio.h>
-#include <string.h>
-#include <assert.h>
-#include <boost/regex.h>
-
-const char* expression = "^";
-const char* text = "\n      ";
-regmatch_t matches[1];
-int flags = REG_EXTENDED | REG_BASIC | REG_NOSPEC | REG_ICASE | REG_NOSUB |
-            REG_NEWLINE | REG_PEND | REG_NOCOLLATE | REG_ESCAPE_IN_LISTS |
-            REG_NEWLINE_ALT | REG_PERL | REG_AWK | REG_GREP | REG_EGREP;
-
-
-int main()
-{
-   regex_t re;
-   int result;
-   result = regcomp(&re, expression, REG_AWK);
-   if(result > REG_NOERROR)
-   {
-      char buf[256];
-      regerror(result, &re, buf, sizeof(buf));
-      printf(buf);
-      return result;
-   }
-   assert(re.re_nsub == 0);
-   matches[0].rm_so = 0;
-   matches[0].rm_eo = strlen(text);
-   result = regexec(&re, text, 1, matches, REG_NOTBOL | REG_NOTEOL | REG_STARTEND);
-   if(result > REG_NOERROR)
-   {
-      char buf[256];
-      regerror(result, &re, buf, sizeof(buf));
-      printf(buf);
-      regfree(&re);
-      return result;
-   }
-   assert(matches[0].rm_so == matches[0].rm_eo == 1);
-   regfree(&re);
-   return 0;
-}

demo/c_compiler_checks/posix_api_check.cpp

@@ -1,64 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.
- * It is provided "as is" without express or implied warranty.
- *
- */
-
- /*
-  *   LOCATION:    see http://www.boost.org for most recent version.
-  *   FILE         posix_api_compiler_check.c
-  *   VERSION      3.01
-  *   DESCRIPTION: Verify that POSIX API calls compile: note this is a compile
-  *                time check only.
-  */
-
-#include <stdio.h>
-#include <string.h>
-#include <assert.h>
-#include <boost/regex.h>
-
-const char* expression = "^";
-const char* text = "\n      ";
-regmatch_t matches[1];
-int flags = REG_EXTENDED | REG_BASIC | REG_NOSPEC | REG_ICASE | REG_NOSUB |
-            REG_NEWLINE | REG_PEND | REG_NOCOLLATE | REG_ESCAPE_IN_LISTS |
-            REG_NEWLINE_ALT | REG_PERL | REG_AWK | REG_GREP | REG_EGREP;
-
-
-int main()
-{
-   regex_t re;
-   int result;
-   result = regcomp(&re, expression, REG_AWK);
-   if(result > REG_NOERROR)
-   {
-      char buf[256];
-      regerror(result, &re, buf, sizeof(buf));
-      printf(buf);
-      return result;
-   }
-   assert(re.re_nsub == 0);
-   matches[0].rm_so = 0;
-   matches[0].rm_eo = strlen(text);
-   result = regexec(&re, text, 1, matches, REG_NOTBOL | REG_NOTEOL | REG_STARTEND);
-   if(result > REG_NOERROR)
-   {
-      char buf[256];
-      regerror(result, &re, buf, sizeof(buf));
-      printf(buf);
-      regfree(&re);
-      return result;
-   }
-   assert(matches[0].rm_so == matches[0].rm_eo == 1);
-   regfree(&re);
-   return 0;
-}

demo/jgrep/bc55.mak

@@ -1,49 +0,0 @@
-
-# very basic makefile for jgrep.exe
-#
-# Borland C++ tools
-#
-# BCROOT defines the root directory of your bc builder install
-#
-!ifndef BCROOT
-BCROOT=$(MAKEDIR)\..
-!endif
-
-BCC32   = $(BCROOT)\bin\Bcc32.exe
-LIBPATH=..\..\lib\bcb5
-
-IDE_LinkFLAGS32 =  -L$(BCROOT)\LIB
-LINKOPTS= -ap -Tpe -x
-COMPOPTS= -O2 -tWM- -DSTRICT; -I$(BCROOT)\include;../../../../; -D_NO_VCL
-
-
-
-jgrep.exe : jgrep.obj main.obj
-  $(BCC32) $(COMPOPTS) -e$@  -L$(LIBPATH) main.obj jgrep.obj
-
-jgrep.obj :  jgrep.cpp
-  $(BCC32) -c @&&|
- $(COMPOPTS) -o$@ jgrep.cpp
-|
-
-main.obj :  main.cpp
-  $(BCC32) -c @&&|
- $(COMPOPTS) -o$@ main.cpp
-|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/jgrep/bcb4.mak

@@ -1,49 +0,0 @@
-
-# very basic makefile for jgrep.exe
-#
-# Borland C++ tools
-#
-# BCROOT defines the root directory of your bc builder install
-#
-!ifndef BCROOT
-BCROOT=$(MAKEDIR)\..
-!endif
-
-BCC32   = $(BCROOT)\bin\Bcc32.exe
-LIBPATH="..\..\lib\bcb4"
-
-IDE_LinkFLAGS32 =  -L$(BCROOT)\LIB
-LINKOPTS= -ap -Tpe -x
-COMPOPTS= -O2 -tWM- -DSTRICT; -I$(BCROOT)\include;../../../../; -D_NO_VCL
-
-
-
-jgrep.exe : jgrep.obj main.obj
-  $(BCC32) @&&|
-$(COMPOPTS) -e$@  -L$(LIBPATH) main.obj jgrep.obj
-|
-
-jgrep.obj :  jgrep.cpp
-  $(BCC32) -c @&&|
- $(COMPOPTS) -o$@ jgrep.cpp
-|
-
-main.obj :  main.cpp
-  $(BCC32) -c @&&|
- $(COMPOPTS) -o$@ main.cpp
-|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/jgrep/bcb5.mak

@@ -1,47 +0,0 @@
-
-# very basic makefile for jgrep.exe
-#
-# Borland C++ tools
-#
-# BCROOT defines the root directory of your bc builder install
-#
-!ifndef BCROOT
-BCROOT=$(MAKEDIR)\..
-!endif
-
-BCC32   = $(BCROOT)\bin\Bcc32.exe
-LIBPATH=../../lib/bcb5
-
-IDE_LinkFLAGS32 =  -L$(BCROOT)\LIB
-LINKOPTS= -ap -Tpe -x
-COMPOPTS= -O2 -tWM- -DSTRICT; -I$(BCROOT)\include;../../../../; -D_NO_VCL
-
-
-
-jgrep.exe : jgrep.obj main.obj
-  $(BCC32) $(COMPOPTS) -e$@  -L..\..\lib\bcb5 main.obj jgrep.obj
-
-jgrep.obj :  jgrep.cpp
-  $(BCC32) -c @&&|
- $(COMPOPTS) -o$@ jgrep.cpp
-|
-
-main.obj :  main.cpp
-  $(BCC32) -c @&&|
- $(COMPOPTS) -o$@ main.cpp
-|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/jgrep/gcc.mak

@@ -1,30 +0,0 @@
-
-# very basic makefile for jgrep
-#
-# GNU compiler g++
-#
-CXX= -O2 -I../../../../ -I./
-
-jgrep : jgrep.cpp main.cpp
-	g++ -ojgrep $(CXX) jgrep.cpp main.cpp -L../../lib/gcc -lregex++
-
-debug : jgrep.cpp main.cpp
-	g++ -ojgrep -I../../../../ -I./ -g jgrep.cpp main.cpp -L../../lib/gcc -lregex++debug
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/jgrep/jgrep.cpp

@@ -1,126 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *   FILE     jgrep.cpp
-  *   VERSION  3.03
-  */
-
-#include <stdio.h>
-#include <boost/regex.hpp>
-#ifdef JM_OLD_IOSTREAM
-#include <iostream.h>
-#else
-#include <iostream>
-using std::cout;
-using std::cin;
-using std::cerr;
-using std::endl;
-#endif
-#pragma hrdstop
-
-#include <boost/re_detail/fileiter.hpp>
-
-#include "jgrep.h"
-
-
-//
-// class ogrep_predicate
-// outputs the results of regex_grep to screen:
-template <class iterator, class Allocator >
-class ogrep_predicate
-{
-   unsigned int& lines;
-   const char* filename;
-   unsigned int last_line;
-   iterator end_of_storage;
-public:
-   ogrep_predicate(unsigned int& i, const char* p, iterator e) : lines(i), filename(p), last_line(-1), end_of_storage(e) {}
-   ogrep_predicate(const ogrep_predicate& o) : lines(o.lines), filename(o.filename), last_line(o.last_line), end_of_storage(o.end_of_storage) {}
-   bool operator () (const boost::match_results<iterator, Allocator>& i);
-};
-
-// ideally we'd ignor the allocator type and use a template member function
-// to deel with the allocator type passed to regex_grep, unfortunately most
-// compilers don't support this feature yet, so we'll have to be sure that
-// the allocator passed to instances of this class match that used in our
-// regular expression classes.
-
-template <class iterator, class Allocator>
-bool ogrep_predicate<iterator, Allocator>::operator()(const boost::match_results<iterator, Allocator>& i)
-{
-   if(last_line == (unsigned int)-1)
-      cout << "File " << filename << ":" << endl;
-   if(last_line != i.line())
-   {
-      ++lines;
-      last_line = i.line();
-      if(count_only == 0)
-      {
-         if(show_lines)
-            cout << i.line() << "\t";
-         iterator ptr = i.line_start();
-         while((ptr != end_of_storage) && (*ptr != '\n'))++ptr;
-         iterator pos = i.line_start();
-         while(pos != ptr)
-         {
-            cout.put(*pos);
-            ++pos;
-         }
-         cout << endl;
-      }
-   }
-   return true;
-}
-
-
-void process_grep(const char* file)
-{
-   using namespace boost;
-   mapfile f(file);
-   unsigned int count = 0;
-   ogrep_predicate<mapfile::iterator, allocator_type> oi(count, file, f.end());
-   if(files_only)
-   {
-      bool ok;
-      boost::match_results<mapfile::iterator, allocator_type> m;
-         ok = regex_search(f.begin(), f.end(), m, e, match_not_dot_newline | match_not_dot_null);
-      if(ok)
-         cout << "File " << file << endl;
-   }
-   else
-   {
-      regex_grep(oi, f.begin(), f.end(), e, match_not_dot_newline | match_not_dot_null);
-      if(count)
-      {
-         if(verbose || count_only)
-         {
-            cout << count << " lines match" << endl;
-            return;
-         }
-      }
-      else if(verbose)
-      {
-         cout << "File " << file << "(" << f.size() << "bytes):" << endl << "0 lines match" << endl;
-      }
-   }
-}
-
-
-
-
-
-
-

demo/jgrep/jgrep.h

@@ -1,53 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *   FILE     jgrep.h
-  *   VERSION  3.03
-  */
-
-#ifndef _JGREP_H
-#define _JGREP_H
-
-#include <boost/regex.hpp>
-
-// case sensitive reg_expression determines our allocator type:
-typedef boost::reg_expression<char> re_type;
-typedef re_type::allocator_type allocator_type;
-
-// now declare static (global) data, including an allocator
-// instance which we'll pass to all instances that require an allocator.
-
-extern allocator_type a;
-
-extern re_type e;
-
-// flags for output:
-
-extern bool use_case;
-extern bool show_lines;
-extern bool count_only;
-extern bool files_only;
-extern bool recurse;
-extern bool regularexs;
-extern bool words_only;
-extern bool verbose;
-
-void process_grep(const char* file);
-
-#endif
-
-
-

demo/jgrep/main.cpp

@@ -1,284 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *   FILE     main.cpp
-  *   VERSION  3.03
-  */
-
-
-#include <stdio.h>
-#include <boost/regex.hpp>
-#ifdef JM_OLD_IOSTREAM
-#include <iostream.h>
-#else
-#include <iostream>
-using std::cout;
-using std::cin;
-using std::cerr;
-using std::endl;
-#endif
-#pragma hrdstop
-
-#include <boost/re_detail/fileiter.hpp>
-#include "jgrep.h"
-
-#ifndef JM_ALGO_INCLUDED
-// HP and SGI STL's use <algo.h> instead
-// this will have been pulled in by <jm_cfg.h>
-// for std::distance
-#include <algorithm>
-#endif
-
-allocator_type a;
-
-re_type e(a);
-//rei_type ei(a);
-
-// flags for output:
-
-bool use_case = true;
-bool show_lines = false;
-bool count_only = false;
-bool files_only = false;
-bool recurse = false;
-bool regularexs = true;
-bool words_only = false;
-bool verbose = false;
-
-
-void usage()
-{
-   cout <<
-"jgrep version 0.95\n"
-"usage: jgrep [-options] expression file [files...]\n"
-"\n"
-"options can be one of the following:\n"
-"\n"
-"-c   prints a count of the number of matching lines only\n"
-"-d   recurses through subdirectories for matching files\n"
-"-i   causes case to be ignored when matching\n"
-"-l   lists the files which contain a match only\n"
-"-n   displays the line numbers of matches\n"
-"-r-  causes the expression to be interpreted as a literal string and not\n"
-"     as a regular expression\n"
-"-w   searches for matches that are whole words only\n"
-"-z   verbose mode\n"
-"\n"
-"expression: a regular expression, or a literal string if -r- is specified\n"
-"\n"
-"files:  one or more files to search, the names can contain the wildcard\n"
-"        characters ? and *\n" << endl;
-
-}
-
-void parse_switch(const char* flag)
-{
-   ++flag;
-   while(*flag)
-   {
-      switch(*flag)
-      {
-         case '-':
-            switch(*(flag-1))
-            {
-               case 'c':
-                  count_only = false;
-                  break;
-               case 'd':
-                  recurse = false;
-                  break;
-               case 'i':
-                  use_case = false;
-                  break;
-               case 'l':
-                  files_only = false;
-                  break;
-               case 'n':
-                  show_lines = false;
-                  break;
-               case 'r':
-                  regularexs = false;
-                  break;
-               case 'w':
-                  words_only = false;
-                  break;
-               case 'z':
-                  verbose = false;
-                  break;
-               default:
-                  cout << "Undefined option -";
-                  cout.put(*flag);
-                  cout << endl;
-            }
-            // turn off prev character:
-            break;
-         case 'c':
-            count_only = true;
-            break;
-         case 'd':
-            recurse = true;
-            break;
-         case 'i':
-            use_case = false;
-            break;
-         case 'l':
-            files_only = true;
-            break;
-         case 'n':
-            show_lines = true;
-            break;
-         case 'r':
-            regularexs = true;
-            break;
-         case 'w':
-            words_only = true;
-            break;
-         case 'z':
-            verbose = true;
-            break;
-         case '?':
-            usage();
-            exit(0);
-         case '+':
-            break;
-         default:
-            cout << "Undefined option -";
-            cout.put(*flag);
-            cout << endl;
-      }
-      ++flag;
-   }
-}
-
-void HandleFile(const char* wild)
-{
-   using namespace boost;
-   jm_trace("Handling file " << wild);
-   file_iterator end;
-   file_iterator start(wild);
-
-   if(recurse)
-   {
-      // go through sub directories:
-      char buf[MAX_PATH];
-      std::strcpy(buf, start.root());
-      int rootlen = strlen(buf);
-      if(*buf == 0)
-      {
-         std::strcpy(buf, ".");
-         std::strcat(buf, directory_iterator::separator());
-         std::strcat(buf, "*");
-      }
-      else
-      {
-         std::strcat(buf, directory_iterator::separator());
-         std::strcat(buf, "*");
-      }
-      jm_trace("Enumerating directories: " << buf);
-      directory_iterator dstart(buf);
-      directory_iterator dend;
-
-      // now get the file mask bit of "wild":
-      const char* ptr = wild + rootlen;
-      if(*ptr) ++ptr;
-      jm_trace("File mask part is: " << ptr);
-
-      while(dstart != dend)
-      {
-         std::sprintf(buf, "%s%s%s", dstart.path(), directory_iterator::separator(), ptr);
-         HandleFile(buf);
-         ++dstart;
-      }
-   }
-   std::for_each(start, end, process_grep);
-}
-
-int done = 0;
-
-void HandleArg(const char* arg)
-{
-   using namespace boost;
-   jm_trace("Handling argument: " << arg);
-   if(*arg == '-')
-   {
-      parse_switch(arg);
-      return;
-   }
-   if(done == 0)
-   {
-      // parse regular expression
-      if(regularexs)
-      {
-         if(words_only == 0)
-         {
-            e.set_expression(arg, use_case ? regbase::normal : regbase::normal | regbase::icase);
-            //ei.set_expression(arg);
-         }
-         else
-         {
-            char* buf = new char[std::strlen(arg) + 8];
-            std::sprintf(buf, "\\<%s\\>", arg);
-            e.set_expression(buf, use_case ? regbase::normal : regbase::normal | regbase::icase);
-            //ei.set_expression(buf);
-            delete[] buf;
-         }
-      }
-      else
-      {
-         // we need to convert text to literal:
-         int len2 = std::strlen(arg);
-         int len = len2 * 5 + 6;
-         char buf[8];
-         char* buf2 = new char[len];
-         *buf2 = 0;
-         if(words_only)
-            std::strcpy(buf2, "\\<");
-         for(int j = 0; j < len2; ++j)
-         {
-            std::sprintf(buf, "\\0%o", int(arg[j]));
-            std::strcat(buf2, buf);
-         }
-         if(words_only)
-            std::strcat(buf2, "\\>");
-         e.set_expression(buf2, use_case ? regbase::normal : regbase::normal | regbase::icase);
-         //ei.set_expression(buf2);
-         delete[] buf2;
-      }
-      done = 1;
-      return;
-   }
-   // if we get to here we have one or more file names to process:
-   ++done;
-   HandleFile(arg);
-}
-
-int main(int argc, char * argv[])
-{
-   for(int i = 1; i < argc; ++i)
-      HandleArg(argv[i]);
-   if(done < 2)
-      usage();
-   return 0;
-}
-
-
-
-
-
-
-
-
-

demo/jgrep/makefile.in

@@ -1,41 +0,0 @@
-
-# very basic makefile for jgrep
-#
-
-CXX=@CXX@
-CXXFLAGS=@CXXFLAGS@
-LIBS=@LIBS@
-EXE=@ac_exe_ext@
-OBJ=@ac_obj_ext@
-
-LIBDEP=../../lib/libregex++.a ../../../../boost/re_detail/regex_options.hpp ../../../../boost/re_detail/regex_config.hpp
-
-jgrep$(EXE) : jgrep$(OBJ) main$(OBJ)
-	$(CXX) -o jgrep$(EXE) jgrep$(OBJ) main$(OBJ) -L../../lib -lregex++ $(LIBS)
-
-jgrep$(OBJ) : jgrep.cpp jgrep.h $(LIBDEP)
-	$(CXX) -c $(CXXFLAGS) -I../../../../ -I./ jgrep.cpp
-
-main$(OBJ) : main.cpp jgrep.h $(LIBDEP)
-	$(CXX) -c $(CXXFLAGS) -I../../../../ -I./ main.cpp
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/jgrep/sunpro.mak

@@ -1,20 +0,0 @@
-# Makefile for timer application
-#
-# for SUN workshop 5.0 C++ compiler
-#
-
-CXX=CC
-CPP_FLAGS = -O -I../../../../ -I./
-
-%.o : %.cpp 
-	$(CXX) -c -o $@ $(CPP_FLAGS) $<
-
-jgrep : jgrep.o main.o
-	$(CXX) -o $@  $(CPP_FLAGS) jgrep.o main.o -L../../lib -lregex++
-
-clean:
-	rm -rf SunWS_cache
-	rm -f jgrep.o jgrep main.o
-
-
-

demo/jgrep/vc6-stlport.mak

@@ -1,17 +0,0 @@
-
-#
-# very simple makefile for Visual C++ 6 + STLPort 4
-#
-
-jgrep.exe: main.cpp jgrep.cpp jgrep.h
-	cl -GX -GR /Oityb1 /GF /Gy -MT -I..\..\..\..\ jgrep.cpp main.cpp /link /LIBPATH:..\..\lib\vc6-stlport user32.lib
-
-
-
-
-
-
-
-
-
-

demo/jgrep/vc6.mak

@@ -1,16 +0,0 @@
-
-#
-# very simple makefile for Visual C++ 6
-#
-
-jgrep.exe: main.cpp jgrep.cpp jgrep.h
-	cl -GX -GR /Oityb1 /GF /Gy -I..\..\..\..\ jgrep.cpp main.cpp /link /LIBPATH:..\..\lib\vc6 user32.lib
-
-
-
-
-
-
-
-
-

demo/regress/bc55.mak

@@ -1,134 +0,0 @@
-
-# very basic makefile for regress
-#
-# Borland C++ tools
-#
-# BCROOT defines the root directory of your bcb install
-#
-!ifndef BCROOT
-BCROOT=$(MAKEDIR)\..
-!endif
-
-BCC32   = $(BCROOT)\bin\Bcc32.exe 
-TLINK32 = $(BCROOT)\bin\ILink32.exe
-
-IDE_LinkFLAGS32 =  -L$(BCROOT)\LIB
-LINKOPTS= -ap -Tpe -x
-CFLAGS= -O2 -tWC -DSTRICT; -w-inl -w-aus -w-csu -w-eff -w-rch -I$(BCROOT)\include;..\..\..\..\; -L..\..\lib\bcb5
-
-all :: r1.exe r2.exe r3.exe r4.exe r5.exe r6.exe r1m.exe r2m.exe r3m.exe r4m.exe r5m.exe r6m.exe r1l.exe r2l.exe r3l.exe r4l.exe r5l.exe r6l.exe r1lm.exe r2lm.exe r3lm.exe r4lm.exe r5lm.exe r6lm.exe
-	echo testing static single threaded version....
-	r1 tests.txt test1252.txt
-	r2 tests.txt
-	r3 tests.txt
-	r4 tests.txt test1252.txt
-	r5 tests.txt
-	r6 tests.txt
-	echo testing static multi-threaded version....
-	r1m tests.txt test1252.txt
-	r2m tests.txt
-	r3m tests.txt
-	r4m tests.txt test1252.txt
-	r5m tests.txt
-	r6m tests.txt
-	echo testing dll single threaded version....
-	r1l tests.txt test1252.txt
-	r2l tests.txt
-	r3l tests.txt
-	r4l tests.txt test1252.txt
-	r5l tests.txt
-	r6l tests.txt
-	echo testing dll multi-threaded version....
-	r1lm tests.txt test1252.txt
-	r2lm tests.txt
-	r3lm tests.txt
-	r4lm tests.txt test1252.txt
-	r5lm tests.txt
-	r6lm tests.txt
-
-
-r1.exe : tests.cpp regress.cpp parse.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er1.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp regress.cpp parse.cpp
-
-r2.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er2.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er3.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er4.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er5.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er6.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-	
-
-r1m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er1m.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp
-
-r2m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er2m.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er3m.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er4m.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er5m.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er6m.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er1l.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp
-
-r2l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er2l.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er3l.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er4l.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er5l.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er6l.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er1lm.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp
-
-r2lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er2lm.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er3lm.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er4lm.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er5lm.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er6lm.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-
-
-
-
-
-
-
-
-

demo/regress/bcb4.mak

@@ -1,186 +0,0 @@
-
-# very basic makefile for regress
-#
-# Borland C++ tools
-#
-# BCROOT defines the root directory of your bcb install
-#
-!ifndef BCROOT
-BCROOT=$(MAKEDIR)\..
-!endif
-
-BCC32   = $(BCROOT)\bin\Bcc32.exe 
-TLINK32 = $(BCROOT)\bin\ILink32.exe
-
-IDE_LinkFLAGS32 =  -L$(BCROOT)\LIB
-LINKOPTS= -ap -Tpe -x
-CFLAGS= -O2 -tWC -DSTRICT; -w-inl -w-aus -w-csu -w-eff -w-rch -I$(BCROOT)\include;..\..\..\..\; -L..\..\lib\bcb4
-
-all :: r1.exe r2.exe r3.exe r4.exe r5.exe r6.exe r1m.exe r2m.exe r3m.exe r4m.exe r5m.exe r6m.exe r1v.exe r2v.exe r3v.exe r4v.exe r5v.exe r6v.exe r1l.exe r2l.exe r3l.exe r4l.exe r5l.exe r6l.exe r1lm.exe r2lm.exe r3lm.exe r4lm.exe r5lm.exe r6lm.exe r1lv.exe r2lv.exe r3lv.exe r4lv.exe r5lv.exe r6lv.exe
-	echo testing static single threaded version....
-	r1 tests.txt test1252.txt
-	r2 tests.txt
-	r3 tests.txt
-	r4 tests.txt test1252.txt
-	r5 tests.txt
-	r6 tests.txt
-	echo testing static multi-threaded version....
-	r1m tests.txt test1252.txt
-	r2m tests.txt
-	r3m tests.txt
-	r4m tests.txt test1252.txt
-	r5m tests.txt
-	r6m tests.txt
-	echo testing static VCL version....
-	r1v tests.txt test1252.txt
-	r2v tests.txt
-	r3v tests.txt
-	r4v tests.txt test1252.txt
-	r5v tests.txt
-	r6v tests.txt
-	echo testing dll single threaded version....
-	r1l tests.txt test1252.txt
-	r2l tests.txt
-	r3l tests.txt
-	r4l tests.txt test1252.txt
-	r5l tests.txt
-	r6l tests.txt
-	echo testing dll multi-threaded version....
-	r1lm tests.txt test1252.txt
-	r2lm tests.txt
-	r3lm tests.txt
-	r4lm tests.txt test1252.txt
-	r5lm tests.txt
-	r6lm tests.txt
-	echo testing dll VCL version....
-	r1lv tests.txt test1252.txt
-	r2lv tests.txt
-	r3lv tests.txt
-	r4lv tests.txt test1252.txt
-	r5lv tests.txt
-	r6lv tests.txt
-
-
-r1.exe : tests.cpp regress.cpp parse.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er1.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp regress.cpp parse.cpp
-
-r2.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er2.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er3.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er4.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er5.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er6.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-	
-
-r1m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er1m.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp
-
-r2m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er2m.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er3m.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er4m.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er5m.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er6m.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er1v.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp
-
-r2v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er2v.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er3v.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er4v.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er5v.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er6v.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er1l.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp
-
-r2l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er2l.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er3l.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er4l.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er5l.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er6l.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er1lm.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp
-
-r2lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er2lm.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er3lm.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er4lm.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er5lm.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er6lm.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er1lv.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp
-
-r2lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er2lv.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er3lv.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er4lv.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er5lv.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er6lv.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-
-
-
-
-
-
-
-
-

demo/regress/bcb5.mak

@@ -1,186 +0,0 @@
-
-# very basic makefile for regress
-#
-# Borland C++ tools
-#
-# BCROOT defines the root directory of your bcb install
-#
-!ifndef BCROOT
-BCROOT=$(MAKEDIR)\..
-!endif
-
-BCC32   = $(BCROOT)\bin\Bcc32.exe 
-TLINK32 = $(BCROOT)\bin\ILink32.exe
-
-IDE_LinkFLAGS32 =  -L$(BCROOT)\LIB
-LINKOPTS= -ap -Tpe -x
-CFLAGS= -O2 -tWC -DSTRICT; -w-inl -w-aus -w-csu -w-eff -w-rch -I$(BCROOT)\include;..\..\..\..\; -L..\..\lib\bcb5
-
-all :: r1.exe r2.exe r3.exe r4.exe r5.exe r6.exe r1m.exe r2m.exe r3m.exe r4m.exe r5m.exe r6m.exe r1v.exe r2v.exe r3v.exe r4v.exe r5v.exe r6v.exe r1l.exe r2l.exe r3l.exe r4l.exe r5l.exe r6l.exe r1lm.exe r2lm.exe r3lm.exe r4lm.exe r5lm.exe r6lm.exe r1lv.exe r2lv.exe r3lv.exe r4lv.exe r5lv.exe r6lv.exe
-	echo testing static single threaded version....
-	r1 tests.txt test1252.txt
-	r2 tests.txt
-	r3 tests.txt
-	r4 tests.txt test1252.txt
-	r5 tests.txt
-	r6 tests.txt
-	echo testing static multi-threaded version....
-	r1m tests.txt test1252.txt
-	r2m tests.txt
-	r3m tests.txt
-	r4m tests.txt test1252.txt
-	r5m tests.txt
-	r6m tests.txt
-	echo testing static VCL version....
-	r1v tests.txt test1252.txt
-	r2v tests.txt
-	r3v tests.txt
-	r4v tests.txt test1252.txt
-	r5v tests.txt
-	r6v tests.txt
-	echo testing dll single threaded version....
-	r1l tests.txt test1252.txt
-	r2l tests.txt
-	r3l tests.txt
-	r4l tests.txt test1252.txt
-	r5l tests.txt
-	r6l tests.txt
-	echo testing dll multi-threaded version....
-	r1lm tests.txt test1252.txt
-	r2lm tests.txt
-	r3lm tests.txt
-	r4lm tests.txt test1252.txt
-	r5lm tests.txt
-	r6lm tests.txt
-	echo testing dll VCL version....
-	r1lv tests.txt test1252.txt
-	r2lv tests.txt
-	r3lv tests.txt
-	r4lv tests.txt test1252.txt
-	r5lv tests.txt
-	r6lv tests.txt
-
-
-r1.exe : tests.cpp regress.cpp parse.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er1.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp regress.cpp parse.cpp
-
-r2.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er2.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er3.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er4.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er5.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -D_NO_VCL $(CFLAGS) -er6.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-	
-
-r1m.exe : tests.cpp regress.cpp parse.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er1m.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp regress.cpp parse.cpp
-
-r2m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er2m.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er3m.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er4m.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er5m.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6m.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -D_NO_VCL $(CFLAGS) -er6m.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1v.exe : tests.cpp regress.cpp parse.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er1v.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp regress.cpp parse.cpp
-
-r2v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er2v.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er3v.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er4v.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er5v.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6v.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWV $(CFLAGS) -er6v.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1l.exe : tests.cpp regress.cpp parse.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er1l.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp regress.cpp parse.cpp
-
-r2l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er2l.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er3l.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er4l.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er5l.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6l.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM- -tWR -D_NO_VCL $(CFLAGS) -er6l.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1lm.exe : tests.cpp regress.cpp parse.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er1lm.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp regress.cpp parse.cpp
-
-r2lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er2lm.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er3lm.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er4lm.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er5lm.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6lm.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -D_NO_VCL $(CFLAGS) -er6lm.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-r1lv.exe : tests.cpp regress.cpp parse.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er1lv.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp regress.cpp parse.cpp
-
-r2lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er2lv.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp
-
-r3lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er3lv.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp
-
-r4lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er4lv.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r5lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er5lv.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-r6lv.exe : tests.cpp parse.cpp regress.cpp
-	$(BCC32) -tWM -tWR -tWV -tWC $(CFLAGS) -er6lv.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp
-
-
-
-
-
-
-
-
-
-
-

demo/regress/gcc.mak

@@ -1,54 +0,0 @@
-
-# very basic makefile for regression tests
-#
-# g++ 2.95 and greater
-#
-CXX= g++ -pedantic -Wall -I../../../../ -I./ -L../../lib/gcc
-
-total : r2
-	./r2 tests.txt
-
-r2 : tests.cpp parse.cpp regress.cpp
-	$(CXX) -O2 -o r2 tests.cpp parse.cpp regress.cpp -lregex++
-
-debug : tests.cpp parse.cpp regress.cpp
-	$(CXX) -g -o r2 tests.cpp parse.cpp regress.cpp -lregex++debug
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/regress/makefile.in

@@ -1,46 +0,0 @@
-
-# very basic makefile for regression tests
-#
-CXX=@CXX@
-CXXFLAGS=@CXXFLAGS@ -I../../../../
-LIBS=@LIBS@ -L../../lib -lregex++
-EXE=@ac_exe_ext@
-OBJ=@ac_obj_ext@
-
-total : @ac_regress@
-
-LIBDEP=../../lib/libregex++.a ../../../../boost/re_detail/regex_options.hpp ../../../../boost/re_detail/regex_config.hpp
-
-r1$(EXE) :: tests.cpp parse.cpp regress.cpp
-	$(CXX) -o r1$(EXE) $(CXXFLAGS) tests.cpp parse.cpp regress.cpp $(LIBS)
-	./r1 tests.txt
-
-r2$(EXE) ::  tests.cpp parse.cpp regress.cpp
-	$(CXX) -o r2$(EXE) $(CXXFLAGS) -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LIBS)
-	./r2 tests.txt
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/regress/parse.cpp

@@ -1,327 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *
-  *   FILE     parse.cpp
-  *   VERSION  3.03
-  *
-  * Input parsing functions for regress.
-  *
-  */
-
-#include <boost/regex.hpp>
-#include "regress.h"
-
-#ifndef BOOST_RE_ALGO_INCLUDED
-#include <algorithm>
-#endif
-
-using namespace boost;
-
-//
-// start by defining all our flag types:
-
-flag_info flag_data[] = {
-                          { BOOST_RE_STR("REG_BASIC"), 9, REG_BASIC, 0 },
-                          { BOOST_RE_STR("REG_EXTENDED"), 12, REG_EXTENDED, 0 },
-                          { BOOST_RE_STR("REG_ICASE"), 9, REG_ICASE, 0 },
-                          { BOOST_RE_STR("REG_NOSUB"), 9, REG_NOSUB, 0 },
-                          { BOOST_RE_STR("REG_NEWLINE"), 11, REG_NEWLINE, 0 },
-                          { BOOST_RE_STR("REG_NEWLINE"), 11, REG_NEWLINE, 0 },
-                          { BOOST_RE_STR("REG_NOSPEC"), 10, REG_NOSPEC, 0 },
-
-                          { BOOST_RE_STR("REG_NOTBOL"), 10, REG_NOTBOL, 1 },
-                          { BOOST_RE_STR("REG_NOTEOL"), 10, REG_NOTEOL, 1 },
-                          { BOOST_RE_STR("REG_STARTEND"), 12, REG_STARTEND, 1 },
-
-                          { BOOST_RE_STR("basic"), 5, regbase::basic, 2 },
-                          { BOOST_RE_STR("escape_in_lists"), 15, regbase::escape_in_lists, 2 },
-                          { BOOST_RE_STR("char_classes"), 12, regbase::char_classes, 2 },
-                          { BOOST_RE_STR("intervals"), 9, regbase::intervals, 2 },
-                          { BOOST_RE_STR("limited_ops"), 11, regbase::limited_ops, 2 },
-                          { BOOST_RE_STR("newline_alt"), 11, regbase::newline_alt, 2 },
-                          { BOOST_RE_STR("bk_plus_qm"), 10, regbase::bk_plus_qm, 2 },
-                          { BOOST_RE_STR("bk_braces"), 9, regbase::bk_braces, 2 },
-                          { BOOST_RE_STR("bk_parens"), 9, regbase::bk_parens, 2 },
-                          { BOOST_RE_STR("bk_refs"), 7, regbase::bk_refs, 2 },
-                          { BOOST_RE_STR("bk_vbar"), 7, regbase::bk_vbar, 2 },
-                          { BOOST_RE_STR("use_except"), 10, regbase::use_except, 2 },
-                          { BOOST_RE_STR("literal"), 7, regbase::literal, 2 },
-                          { BOOST_RE_STR("normal"), 6, regbase::normal, 2 },
-                          { BOOST_RE_STR("basic"), 5, regbase::basic, 2 },
-                          { BOOST_RE_STR("extended"), 8, regbase::extended, 2 },
-
-                          { BOOST_RE_STR("match_default"), 13, match_default, 3 },
-                          { BOOST_RE_STR("match_not_bol"), 13, match_not_bol, 3 },
-                          { BOOST_RE_STR("match_not_eol"), 13, match_not_eol, 3 },
-                          { BOOST_RE_STR("match_not_bob"), 13, match_not_bob, 3 },
-                          { BOOST_RE_STR("match_not_eob"), 13, match_not_eob, 3 },
-                          { BOOST_RE_STR("match_not_bow"), 13, match_not_bow, 3 },
-                          { BOOST_RE_STR("match_not_eow"), 13, match_not_eow, 3 },
-                          { BOOST_RE_STR("match_not_dot_newline"), 21, match_not_dot_newline, 3 },
-                          { BOOST_RE_STR("match_not_dot_null"), 18, match_not_dot_null, 3 },
-                          { BOOST_RE_STR("match_prev_avail"), 16, match_prev_avail, 3 },
-                          { BOOST_RE_STR("match_any"), 9, match_any, 3 },
-                          { BOOST_RE_STR("match_not_null"), 14, match_not_null, 3 },
-                          { BOOST_RE_STR("match_continuous"), 16, match_continuous, 3 },
-                          { BOOST_RE_STR("match_partial"), 13, match_partial, 3 },
-
-                          { BOOST_RE_STR("format_sed"), 10, format_sed, 3 },
-                          { BOOST_RE_STR("format_perl"), 11, format_perl, 3 },
-                          { BOOST_RE_STR("format_no_copy"), 14, format_no_copy, 3 },
-
-                          { BOOST_RE_STR("REG_NO_POSIX_TEST"), 17, REG_NO_POSIX_TEST, 4 },
-                          { BOOST_RE_STR("REG_UNICODE_ONLY"), 16, REG_UNICODE_ONLY, 4 },
-                          { BOOST_RE_STR("REG_GREP"), 8, REG_GREP, 4 },
-                          { BOOST_RE_STR("REG_MERGE"), 9, REG_MERGE, 4 },
-                          { BOOST_RE_STR("REG_MERGE_COPY"), 14, REG_MERGE_COPY, 4 },
-
-                          { BOOST_RE_STR(""), 0, 0, 0 },
-                        };
-
-// basically we create a simple token parser
-// using regular expressions
-
-const char_t* expression_text =        BOOST_RE_STR("(;.*)|")                            // comment
-                                       BOOST_RE_STR("(^[[:blank:]]*-)|")                 // -
-                                       BOOST_RE_STR("([^\"[:space:]][^[:space:]]*)|")    // token
-                                       BOOST_RE_STR("(\"(([^\"]|\\\\\")*)\")")             // "token"   
-                                      ;
-
-typedef reg_expression<char_t> re_parse_t;
-typedef re_parse_t::allocator_type parse_alloc;
-typedef match_results<string_type::const_iterator, parse_alloc>  parse_grep;
-typedef string_type::const_iterator parse_iterator;
-
-re_parse_t parse_expression(expression_text, regbase::normal);
-
-//
-// now define our grep predicate function object:
-class parse_function
-{
-   int mode;
-public:
-   parse_function() : mode(0) {}
-   parse_function(const parse_function& o) : mode(o.mode) {}
-   bool operator()(const parse_grep& i);
-};
-
-bool parse_function::operator()(const parse_grep& g)
-{
-   parse_iterator i, j;
-   // determine what caused the match:
-   if(g[1].matched)
-   {
-      // we have a comment:
-      return true;
-   }
-   else if(g[2].matched)
-   {
-      // we have the start of a line of flags
-      mode = -1;
-      for(int i = 0; i < 5; ++i)
-         flags[i] = 0;
-      return true;
-   }
-   else if(g[3].matched)
-   {
-      // token:
-      i = g[3].first;
-      j = g[3].second;
-   }
-   else
-   {
-      // token delimited by ""
-      i = g[5].first;
-      j = g[5].second;
-   }
-   
-   // now we need to switch depending upon what mode we are in:
-   switch(mode)
-   {
-   case -1:
-   {
-      // parse the flag:
-      unsigned int id = 0;
-      while(flag_data[id].len != 0)
-      {
-         if(static_cast<unsigned int>(j - i) != flag_data[id].len)
-         {
-            ++id;
-            continue;
-         }
-         if(std::equal(i, j, flag_data[id].name) == true)
-         {
-            flags[flag_data[id].id] |= flag_data[id].value;
-            return true;
-         }
-         ++id;
-      }
-      cout << "Warning: Unknown flag: ";
-      string_type t(i, j);
-      cout << t.c_str();
-      cout << endl;
-      return true;
-   }
-   case 0:
-      // set the expression text:
-      expression = string_type(i, j);
-      do_test = true;
-      break;
-   case 1:
-      // set the text to match:
-      search_text = string_type(i, j);
-      jm_trace("Initial search text: " << search_text);
-      expand_escapes(search_text);
-      jm_trace("Search text after escapes expanded: " << search_text);
-      break;
-   case 2:
-      // maybe set format string:
-      if(flags[4] & REG_MERGE)
-      {
-         format_string = string_type(i, j);
-         break;
-      }
-      else
-      {
-         matches[mode - 2] = to_int(i, j);
-         break;
-      }
-   case 3:
-      // maybe set format result:
-      if(flags[4] & REG_MERGE)
-      {
-         merge_string = string_type(i, j);
-         expand_escapes(merge_string);
-         break;
-      }
-      else
-      {
-         matches[mode - 2] = to_int(i, j);
-         break;
-      }
-   default:
-      jm_assert(mode >= 2);
-      // set the relevent int value:
-      matches[mode - 2] = to_int(i, j);
-   }
-   ++mode;
-   return true;
-}
-
-void parse_input_line(const string_type& s)
-{
-   // set matches back to starting values:
-   for(int i = 0; i < MAX_MATCHES; ++i)
-   {
-      matches[i] = -2;
-   }
-   parse_function op;
-   do_test = false;
-   regex_grep(op, s.begin(), s.end(), parse_expression);
-   jm_trace("expression: " << expression);
-   jm_trace("search string: " << search_text);
-}
-
-int to_int(string_type::const_iterator i, string_type::const_iterator j)
-{
-   int val = 0;
-   bool neg = false;
-   if((i != j) && (*i == BOOST_RE_STR('-')))
-   {
-      neg = true;
-      ++i;
-   }
-   while (i != j)
-   {
-      val *= 10;
-      val += *i - BOOST_RE_STR('0');
-      ++i;
-   }
-   if(neg)
-      val *= -1;
-   return val;
-}
-
-void expand_escapes(string_type& s)
-{
-   for(unsigned int i = 0; i < s.size(); ++i)
-   {
-      if(s[i] == BOOST_RE_STR('\\'))
-      {
-         switch(s[i+1])
-         {
-         case BOOST_RE_STR('a'):
-            s.erase(s.begin() + i);
-            s[i] = BOOST_RE_STR('\a');
-            break;
-         case BOOST_RE_STR('b'):
-            s.erase(s.begin() + i);
-            s[i] = BOOST_RE_STR('\b');
-            break;
-         case BOOST_RE_STR('f'):
-            s.erase(s.begin() + i);
-            s[i] = BOOST_RE_STR('\f');
-            break;
-         case BOOST_RE_STR('n'):
-            s.erase(s.begin() + i);
-            s[i] = BOOST_RE_STR('\n');
-            break;
-         case BOOST_RE_STR('r'):
-            s.erase(s.begin() + i);
-            s[i] = BOOST_RE_STR('\r');
-            break;
-         case BOOST_RE_STR('t'):
-            s.erase(s.begin() + i);
-            s[i] = BOOST_RE_STR('\t');
-            break;
-         case BOOST_RE_STR('v'):
-            s.erase(s.begin() + i);
-            s[i] = BOOST_RE_STR('\v');
-            break;
-         default:
-            if( (s[i + 1] >= BOOST_RE_STR('0')) && (s[i + 1] <= BOOST_RE_STR('9')) )
-            {
-               int val = 0;
-               unsigned int pos = i;
-               ++i;
-               while((i < s.size()) && (s[i] >= BOOST_RE_STR('0')) && (s[i] <= BOOST_RE_STR('9')))
-               {
-                  val *= 10;
-                  val += s[i] - BOOST_RE_STR('0');
-                  ++i;
-               }
-               s.erase(s.begin() + pos, s.begin() + i);
-               if(0 == val)
-               {
-                  s.insert(s.begin()+pos, ' ');
-                  s[pos] = 0;
-               }
-               else
-                  s.insert(s.begin() + pos, (string_type::value_type)val);
-               i = pos;
-            }
-            else
-            {
-               s.erase(s.begin() + i);
-            }
-         }
-      }
-   }
-}
-
-
-

demo/regress/regex_test.cpp

@@ -1,200 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *   LOCATION:    see http://www.boost.org for most recent version.
-  *   FILE         regex_test.cpp
-  *   VERSION      3.03
-  *   DESCRIPTION: Builds regression test program with default
-  *                locale and narrow character tests.  Also
-  *                instantiates all the templates in the library
-  *                as a sanity check.
-  */
-
-// disable automatic selection of support library:
-#define BOOST_RE_NO_LIB
-
-#include <boost/regex.hpp>
-
-//
-// instantiate templates used:
-//
-namespace boost{
-
-#if defined(__GNUC__) && defined(__BEOS__)
-#define ra_it const char*
-#define test_char_type char
-#else
-typedef const char* ra_it;
-typedef char test_char_type;
-#endif
-typedef std::basic_string<test_char_type> test_string_type;
-
-bool pred1(const match_results<ra_it>&)
-{ return true; }
-
-typedef bool (*pred1_type)(const match_results<ra_it>&);
-typedef bool (*pred2_type)(const match_results<test_string_type::const_iterator>&);
-
-//check that all the defined flags are available:
-regbase::flag_type f = regbase::escape_in_lists | regbase::char_classes | regbase::intervals | regbase::limited_ops
-                       | regbase::newline_alt | regbase::bk_plus_qm | regbase::bk_braces
-                       | regbase::bk_parens | regbase::bk_refs | regbase::bk_vbar | regbase::use_except
-                       | regbase::failbit | regbase::literal | regbase::icase | regbase::nocollate | regbase::basic
-                       | regbase::extended | regbase::normal | regbase::emacs | regbase::awk | regbase::grep | regbase::egrep | regbase::sed;
-
-template class reg_expression<test_char_type>;
-template struct sub_match<ra_it>;
-template class match_results<ra_it>;
-
-template bool regex_match(ra_it,
-                 ra_it,
-                 match_results<ra_it>& m,
-                 const reg_expression<test_char_type>& e,
-                 unsigned flags);
-template bool regex_match(ra_it,
-                 ra_it,
-                 const reg_expression<test_char_type>& e,
-                 unsigned flags);
-template bool regex_search(ra_it,
-                ra_it,
-                match_results<ra_it>& m,
-                const reg_expression<test_char_type>& e,
-                unsigned flags);
-template unsigned int regex_grep(pred1_type,
-                        ra_it,
-                        ra_it,
-                        const reg_expression<test_char_type>& e,
-                        unsigned flags);
-template test_char_type* regex_format(test_char_type*,
-                            const match_results<ra_it>& m,
-                            const test_char_type* fmt,
-                            unsigned flags);
-template test_char_type* regex_format(test_char_type*,
-                            const match_results<ra_it>& m,
-                            const test_string_type& fmt,
-                            unsigned flags);
-template test_char_type* regex_merge(test_char_type*,
-                          ra_it,
-                          ra_it,
-                          const reg_expression<test_char_type>&,
-                          const test_char_type*,
-                          unsigned int flags);
-template test_char_type* regex_merge(test_char_type*,
-                           ra_it,
-                           ra_it,
-                           const reg_expression<test_char_type>& e,
-                           const test_string_type&,
-                           unsigned int flags);
-template std::size_t regex_split(test_string_type*,
-                        test_string_type&,
-                        const reg_expression<test_char_type>&,
-                        unsigned flags,
-                        std::size_t);
-template std::size_t regex_split(test_string_type*,
-                        test_string_type& s,
-                        const reg_expression<test_char_type>& e,
-                        unsigned flags);
-
-template std::size_t regex_split(test_string_type*, test_string_type&);
-
-#ifndef BOOST_RE_NO_PARTIAL_FUNC_SPEC
-//
-// the following prototypes are only available if partial ordering
-// of template functions is supported:
-//
-template bool regex_match(const test_char_type*,
-                 match_results<const test_char_type*>& m,
-                 const reg_expression<test_char_type>& e,
-                 unsigned flags);
-template bool regex_match(const test_string_type&,
-                 match_results<test_string_type::const_iterator>&,
-                 const reg_expression<test_char_type>&,
-                 unsigned flags);
-template bool regex_match(const test_char_type*,
-                 const reg_expression<test_char_type>&,
-                 unsigned flags);
-template bool regex_match(const test_string_type&,
-                 const reg_expression<test_char_type>&,
-                 unsigned flags);
-template bool regex_search(const test_char_type*,
-                match_results<const test_char_type*>&,
-                const reg_expression<test_char_type>&,
-                unsigned flags);
-template bool regex_search(const test_string_type&,
-                match_results<test_string_type::const_iterator>&,
-                const reg_expression<test_char_type>&,
-                unsigned flags);
-template unsigned int regex_grep(pred1_type,
-              const test_char_type*,
-              const reg_expression<test_char_type>&,
-              unsigned flags);
-template unsigned int regex_grep(pred2_type,
-              const test_string_type&,
-              const reg_expression<test_char_type>&,
-              unsigned flags);
-template test_string_type regex_format
-                                 (const match_results<test_string_type::const_iterator>& m,
-                                  const test_char_type*,
-                                  unsigned flags);
-template test_string_type regex_format
-                                 (const match_results<test_string_type::const_iterator>&,
-                                  const test_string_type&,
-                                  unsigned flags);
-template test_string_type regex_merge(const test_string_type&,
-                                     const reg_expression<test_char_type>&,
-                                     const test_char_type*,
-                                     unsigned int flags);
-template test_string_type regex_merge(const test_string_type&,
-                                     const reg_expression<test_char_type>&,
-                                     const test_string_type&,
-                                     unsigned int flags);
-
-#endif
-
-} // namespace boost
-
-//
-// include regression test source files:
-//
-#ifdef BOOST_RE_LOCALE_W32
-#define BOOST_RE_TEST_LOCALE_W32
-#elif !defined(BOOST_RE_LOCALE_C)
-#define BOOST_RE_TEST_LOCALE_CPP
-#endif
-
-#include "tests.cpp"
-#include "parse.cpp"
-#include "regress.cpp"
-
-//
-// include library source files:
-//
-#ifdef BOOST_RE_LOCALE_W32
-#include "libs/regex/src/w32_regex_traits.cpp"
-#elif defined(BOOST_RE_LOCALE_C)
-#include "libs/regex/src/c_regex_traits.cpp"
-#else
-#include "libs/regex/src/cpp_regex_traits.cpp"
-#endif
-#include "libs/regex/src/c_regex_traits_common.cpp"
-#include "libs/regex/src/cregex.cpp"
-#include "libs/regex/src/fileiter.cpp"
-#include "libs/regex/src/posix_api.cpp"
-#include "libs/regex/src/regex.cpp"
-#include "libs/regex/src/regex_debug.cpp"
-#include "libs/regex/src/regex_synch.cpp"
-
-

demo/regress/regress.cpp

@@ -1,259 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *
-  *   FILE     regress.cpp
-  *   VERSION  3.03
-  *
-  * main() and associated code for regress.
-  *
-  */
-
-#include <cstdlib>
-#include <boost/regex.hpp>
-#ifdef BOOST_RE_OLD_IOSTREAM
-#include <fstream.h>
-#else
-#include <fstream>
-using std::ifstream;
-using std::ofstream;
-//using std::cin;
-//using std::cout;
-using std::endl;
-#endif
-
-#ifdef __BORLANDC__
-#pragma hrdstop
-#endif
-
-#include "regress.h"
-
-#if defined(BOOST_MSVC) && defined(_DEBUG)
-#include <CRTDBG.H>
-#endif
-
-
-//
-// declare all our globals here:
-//
-
-string_type expression;
-string_type search_text;
-string_type format_string;
-string_type merge_string;
-int matches[MAX_MATCHES];
-
-char file[MAX_PATH];
-int line;
-bool do_test = false;
-unsigned int flags[5];
-unsigned error_count = 0;
-
-void usage()
-{
-   cout <<
-
-"Usage: regress filename [filename2...]\n"
-"see tests.txt for an example test script\n"
-"and the script format.\n";
-
-}
-
-int main(int argc, char * argv[])
-{
-#if defined(BOOST_MSVC) && defined(_DEBUG)
-   // turn on heap reporting at program exit:
-   int tmpFlag = _CrtSetDbgFlag( _CRTDBG_REPORT_FLAG );
-   tmpFlag |= _CRTDBG_LEAK_CHECK_DF;
-   tmpFlag &= ~_CRTDBG_CHECK_CRT_DF;
-   _CrtSetDbgFlag( tmpFlag );
-#endif
-   if(argc < 2)
-       usage();
-   int i;
-   for(i = 1; i < argc; ++i)
-   {
-      reset_error();
-      ifstream is(argv[i]);
-      if(is.good() == false)
-      {
-         cout << "Error unable to open file: " << argv[i] << endl << endl;
-         return -1;
-      }
-      std::strcpy(file, argv[i]);
-      line = 0;
-      unsigned int tests = 0;
-      while(is.good())
-      {
-         string_type s;
-         get_line(is, s);
-         ++line;
-         jm_trace("Reading test script line " << line << " " << s);
-         parse_input_line(s);
-         if(do_test)
-         {
-            run_tests();
-            ++tests;
-         }
-      }
-      cout << line << " lines, " << tests << " tests completed in file " << argv[i] << endl;
-   }
-
-   return error_count;
-}
-
-#ifdef TEST_UNICODE
-
-ostream& operator << (ostream& os, const wchar_t* s)
-{
-   while(*s)
-   {
-      os.put((char)*s);
-      ++s;
-   }
-   return os;
-}
-
-ostream& operator << (ostream& os, const std::wstring& s)
-{
-   os << s.c_str();
-   return os;
-}
-
-istream& get_line(istream& is, nstring_type& s, char delim)
-{
-   char c = (char)is.get();
-   s.erase(s.begin(), s.end());
-   while((c != delim) && is.good())
-   {
-      s.append(1, c);
-      c = (char)is.get();
-   }
-   return is;
-}
-
-istream& get_line(istream& is, string_type& s, char delim)
-{
-   nstring_type t;
-   get_line(is, t, delim);
-   s.erase(s.begin(), s.end());
-   const char* i, *j;
-   i = t.c_str();
-   j = t.c_str() + t.size();
-   wchar_t* buf = new wchar_t[MB_CUR_MAX + 1];
-   int cchars;
-   while(i != j)
-   {
-      cchars = mbtowc(buf, i, j - i);
-      if(cchars == -1)
-         break;
-      if(cchars == 0)
-         break;
-      s.insert(s.end(), buf, buf + cchars);
-      i += cchars;
-   }
-   delete[] buf;
-   return is;
-}
-
-
-#else
-
-istream& get_line(istream& is, string_type& s, char delim)
-{
-   char c = (char)is.get();
-   s.erase(s.begin(), s.end());
-   while((c != delim) && is.good())
-   {
-      s.append(1, c);
-      c = (char)is.get();
-   }
-   return is;
-}
-
-#endif
-
-jm_debug_alloc::jm_debug_alloc()
-{
-   blocks = new int;
-   count = new int;
-   *blocks = 0;
-   *count = 1;
-   guard = this;
-}
-
-jm_debug_alloc::jm_debug_alloc(const jm_debug_alloc& d)
-{
-   blocks = d.blocks;
-   count = d.count;
-   ++(*count);
-   guard = this;
-}
-jm_debug_alloc& jm_debug_alloc::operator=(const jm_debug_alloc& d)
-{
-   free_();
-   blocks = d.blocks;
-   count = d.count;
-   ++(*count);
-   return *this;
-}
-
-jm_debug_alloc::~jm_debug_alloc()
-{
-   if(guard != this)
-   {
-      cout << "Error: attempt to destroy object already destroyed" << endl;
-   }
-   else
-   {
-      free_();
-      guard = 0;
-   }
-}
-void jm_debug_alloc::free_()
-{
-    if(--(*count) == 0)
-    {
-       if(*blocks)
-       {
-          begin_error();
-          cout << "Error: " << *blocks << " blocks not freed by allocator" << endl;
-       }
-       delete count;
-       delete blocks;
-    }
-}
-
-jm_debug_alloc::pointer jm_debug_alloc::allocate(size_type n, void*)
-{
-   pointer p = new char[n + maxi(sizeof(size_type), boost::re_detail::padding_size)];
-   *(size_type*)p = n;
-   ++(*blocks);
-   return p + maxi(sizeof(size_type), boost::re_detail::padding_size);
-}
-void jm_debug_alloc::deallocate(pointer p, size_type n)
-{
-   p -= maxi(sizeof(size_type), boost::re_detail::padding_size);
-   if(*(size_type*)p != n)
-   {
-      begin_error();
-      cout << "Error: size mismatch in allocate/deallocate calls" << endl;
-   }
-   --(*blocks);
-   delete[] p;
-}
-
-

demo/regress/regress.h

@@ -1,336 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *
-  *   FILE     regress.h
-  *   VERSION  3.03
-  *
-  * Function and data declarations for regress.
-  *
-  */
-
-#ifndef _REGRESS_H
-#define _REGRESS_H
-
-#include <boost/re_detail/regex_config.hpp>
-
-#ifdef BOOST_RE_OLD_IOSTREAM
-#include <iostream.h>
-#else
-#include <iostream>
-using std::cout;
-using std::cerr;
-using std::cin;
-using std::istream;
-using std::ostream;
-using std::endl;
-#endif
-
-#include <string>
-#include <iostream>
-#include <boost/regex.hpp>
-
-#if defined(TEST_UNICODE)
-#ifdef __GNUC__
-#define char_t wchar_t
-#else
-typedef wchar_t char_t;
-#endif
-#define NO_POSIX_TEST
-typedef std::basic_string<char_t> string_type;
-typedef std::basic_string<char> nstring_type;
-inline istream& get_line(istream& is, nstring_type& s, char delim = '\n');
-istream& get_line(istream& is, string_type& s, char delim = L'\n');
-#define BOOST_RE_STR(x) L##x
-ostream& operator << (ostream& os, const string_type& s);
-
-#else
-#ifdef __GNUC__
-#define char_t char
-#else
-typedef char char_t;
-#endif
-typedef std::basic_string<char_t> string_type;
-inline istream& get_line(istream& is, string_type& s, char delim = '\n');
-#define BOOST_RE_STR(x) x
-
-#endif
-
-ostream& operator << (ostream& os, const wchar_t* s);
-void parse_input_line(const string_type& s);
-void expand_escapes(string_type& s);
-void run_tests();
-void begin_error();
-void reset_error();
-int to_int(string_type::const_iterator i, string_type::const_iterator j);
-
-#define MAX_MATCHES 30
-extern string_type expression;
-extern string_type search_text;
-extern string_type format_string;
-extern string_type merge_string;
-extern int matches[MAX_MATCHES];
-
-#ifndef MAX_PATH
-#define MAX_PATH 260
-#endif
-
-extern char file[MAX_PATH];
-extern int line;
-extern bool do_test;
-extern unsigned int flags[5];
-extern unsigned error_count;
-
-struct flag_info
-{
-   const char_t* name; // printable flag name
-   unsigned int len;   // length of name
-   unsigned int value; // value of the flag
-   unsigned int id;    // index to assign value to
-};
-
-extern flag_info flag_data[];
-
-//
-// class jm_debug_alloc
-// NB this is a byte based allocator
-//
-class jm_debug_alloc
-{
-private:
-   int* blocks, *count;
-   jm_debug_alloc* guard;
-public:
-   typedef std::size_t    size_type;
-   typedef std::ptrdiff_t difference_type;
-   typedef char*        pointer;
-   typedef const char*  const_pointer;
-   typedef char&        reference;
-   typedef const char&  const_reference;
-   typedef char         value_type;
-
-
-   #ifndef BOOST_RE_NO_MEMBER_TEMPLATES
-   template <class U>
-   struct rebind
-   {
-      typedef boost::re_detail::re_alloc_binder<U, jm_debug_alloc> other;
-   };
-   #endif
-
-   jm_debug_alloc();
-
-   jm_debug_alloc(const jm_debug_alloc& d);
-   jm_debug_alloc& operator=(const jm_debug_alloc& d);
-
-   ~jm_debug_alloc();
-   void free_();
-   static pointer address(reference x)
-   {
-      return &x;
-   }
-   static const_pointer address(const_reference x)
-   {
-      return &x;
-   }
-   unsigned maxi(unsigned i, unsigned j)
-   {
-      return i < j ? j : i;
-   }
-   pointer allocate(size_type n, void* hint = 0);
-   void deallocate(pointer p, size_type n);
-
-   static size_type max_size()
-   {
-      return UINT_MAX;
-   }
-
-   static void construct(pointer , const char& )
-   {
-   }
-
-   static void destroy(pointer )
-   {
-   }
-};
-
-#ifdef __BORLANDC__
-#if __BORLANDC__ < 0x520
-
-#define BOOST_RE_BORLAND_FIX
-
-#endif
-#endif
-
-
-
-//
-// class debug_iterator
-//
-template <class T>
-struct debug_iterator : public BOOST_RE_RA_ITERATOR(T, std::ptrdiff_t)
-{
-   typedef std::ptrdiff_t                    difference_type;
-   typedef char_t                            value_type;
-   typedef char_t*                           pointer;
-   typedef char_t&                           reference;
-   typedef std::random_access_iterator_tag   iterator_category;
-   typedef debug_iterator                    self;
-   typedef std::size_t                       size_type;
-
-  T cur;
-  T first;
-  T last;
-
-  debug_iterator(T c, T f, T l)
-    : cur(c), first(f), last(l) {}
-  debug_iterator() : cur(), first(), last() {}
-  debug_iterator(const debug_iterator& x)
-    : cur(x.cur), first(x.first), last(x.last) {}
-  debug_iterator& operator=(const debug_iterator& x)
-  {
-     cur = x.cur;
-     first = x.first;
-     last = x.last;
-     return *this;
-  }
-
-  reference operator*() const
-  {
-      if(cur == last)
-      {
-         begin_error();
-         cout << "Error: attempt to dereference iterator past range" << endl;
-      }
-      return *cur;
-  }
-
-  operator T()const { return cur; }
-
-  difference_type operator-(const self& x) const {
-    return (difference_type)(cur - x.cur);
-  }
-
-  self& operator++()
-  {
-      if(cur == last)
-      {
-         begin_error();
-         cout << "Error: attempt to increment iterator past range" << endl;
-         return *this;
-      }
-    ++cur;
-    return *this;
-  }
-  self operator++(int)
-  {
-    self tmp = *this;
-    ++*this;
-    return tmp;
-  }
-
-  self& operator--()
-  {
-      if(cur == first)
-      {
-         begin_error();
-         cout << "Error: attempt to decrement iterator past range" << endl;
-         return *this;
-      }
-    --cur;
-    return *this;
-  }
-  self operator--(int)
-  {
-    self tmp = *this;
-    --*this;
-    return tmp;
-  }
-
-  self& operator+=(difference_type n)
-  {
-      if((last - cur) < n)
-      {
-         begin_error();
-         cout << "Error: attempt to increment iterator past range" << endl;
-         return *this;
-      }
-    cur += n;
-    return *this;
-  }
-
-  self operator+(difference_type n) const
-  {
-    self tmp = *this;
-    return tmp += n;
-  }
-
-  self& operator-=(difference_type n) { return *this += -n; }
- 
-  self operator-(difference_type n) const
-  {
-    self tmp = *this;
-    return tmp -= n;
-  }
-
-  reference operator[](difference_type n) const { return *(cur + n); }
-
-  bool operator==(const self& x) const { return cur == x.cur; }
-  bool operator!=(const self& x) const { return !(*this == x); }
-  bool operator<(const self& x) const {
-    return (cur < x.cur);
-  }
-  friend self operator+(difference_type n, const self& i)
-  {
-    self tmp = i;
-    return tmp += n;
-  }
-};
-
-#if defined(__SGI_STL_PORT) && (__SGI_STL_PORT >= 0x400)
-namespace std{
-template <class T>
-inline random_access_iterator_tag __STL_CALL
-__iterator_category(const debug_iterator<T>&) {
-  return random_access_iterator_tag();
-}
-}
-#endif
-
-#ifdef BOOST_RE_TEST_LOCALE_W32
-typedef boost::reg_expression<char_t, boost::w32_regex_traits<char_t>, jm_debug_alloc> re_type;
-#elif defined(BOOST_RE_TEST_LOCALE_CPP)
-typedef boost::reg_expression<char_t, boost::cpp_regex_traits<char_t>, jm_debug_alloc> re_type;
-#else
-typedef boost::reg_expression<char_t, boost::c_regex_traits<char_t>, jm_debug_alloc> re_type;
-#endif
-
-#define REG_NO_POSIX_TEST 1
-#define REG_UNICODE_ONLY 2
-#define REG_GREP 4
-#define REG_MERGE 8
-#define REG_MERGE_COPY 16
-
-#endif
-
-
-
-
-
-
-
-
-

demo/regress/sunpro.mak

@@ -1,29 +0,0 @@
-# Makefile for timer application
-#
-# for SUN workshop 5.0 C++ compiler
-#
-
-CXX=CC
-CPP_FLAGS = -O -I../../../../ -I./
-
-all: r2 r5
-	r2 tests.txt
-	r5 tests.txt
-
-%.o : %.cpp 
-	$(CXX) -c -o $@ $(CPP_FLAGS) $<
-
-r2 : tests.cpp parse.cpp regress.cpp
-	$(CXX) -o $@  $(CPP_FLAGS) tests.cpp parse.cpp regress.cpp -L../../lib -lregex++
-
-r5 : tests.cpp parse.cpp regress.cpp
-	$(CXX) -o $@  $(CPP_FLAGS) -DTEST_UNICODE tests.cpp parse.cpp regress.cpp -L../../lib -lregex++
-
-clean:
-	rm -rf SunWS_cache
-	rm -f r2.o r2 r5 r5.o
-
-
-
-
-

demo/regress/test1252.txt

@@ -1,34 +0,0 @@
-;
-; This file tests code page 1252 - US / Western European code page.
-;
-; See tests.txt for a desciption of the scipt format.
-;
-
-- match_default extended REG_EXTENDED
-
-; start by testing character classes:
-[[:lower:]]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1 32
-[[:upper:]]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1 31
-[[:punct:]]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 31
-[[:print:]]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 94
-[[:graph:]]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 94
-[a-z]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 31
-[a-z]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1 31
-[[:word:]]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 61
-;and equivalence classes:
-[[=a=]]+ aA<61><41><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 14
-
-; and then test case mapping:
-- match_default extended REG_EXTENDED REG_ICASE
-;[A-Z]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 31
-;[a-z]+ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1 31
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1 30
-
-
-
-
-
-
-
-
-

demo/regress/tests.cpp

@@ -1,750 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *
-  *   FILE     tests.cpp
-  *   VERSION  3.03
-  *
-  * the actual tests conducted by regress.
-  *
-  */
-
-
-#include <boost/regex.hpp>
-#include "regress.h"
-
-using namespace boost;
-
-template <class M1, class M2>
-bool compare_result(const M1& sm, const M2& m)
-{
-   if(sm.size() != m.size())
-      return false;
-   if(sm.line() != m.line())
-      return false;
-   for(unsigned int i = 0; i < sm.size(); ++i)
-   {
-      if(sm.position(i) != m.position(i))
-         return false;
-      if(sm.length(i) != m.length(i))
-         return false;
-   }
-   return true;
-}
-
-template <class M1>
-bool compare_result(const M1& sm, const M1& m)
-{
-   return sm == m;
-}
-
-
-template <class C, class T, class A>
-void cpp_eh_tests(const reg_expression<C, T, A>& )
-{
-#ifndef __GNUC__
-   bool thrown = false;
-   // try set_expression form first:
-   try
-   {
-      A a;
-      reg_expression<C, T, A> e(a);
-      e.set_expression(expression.c_str(), flags[2] | regbase::use_except);
-   }
-   catch(const boost::bad_expression&)
-   {
-      thrown = true;
-   }
-   catch(...){}
-   if(!thrown)
-   {
-      begin_error();
-      cout << "Error: expected exception not thrown" << endl;
-   }
-
-   // now try constructor form:
-   thrown = false;
-   try
-   {
-      A a;
-      reg_expression<C, T, A> e(expression.c_str(), flags[2] | regbase::use_except, a);
-   }
-   catch(const boost::bad_expression&)
-   {
-      thrown = true;
-   }
-   catch(...){}
-   if(!thrown)
-   {
-      begin_error();
-      cout << "Error: expected exception not thrown" << endl;
-   }
-#endif
-}
-
-template <class iterator>
-iterator find_last_line(iterator start, iterator end)
-{
-   iterator result = start;
-   while(start != end)
-   {
-      if(*start == '\n')
-      {
-         ++start;
-         result = start;
-      }
-      else
-         ++start;
-   }
-   return result;
-}
-
-template <class iterator>
-unsigned int count_lines(iterator start, iterator end)
-{
-   unsigned int result = 0;
-   while(start != end)
-   {
-      if(*start == '\n')
-         ++result;
-      ++start;
-   }
-   return result;
-}
-
-template <class iterator, class Alloc>
-class grep_test_predicate
-{
-   int match_id;
-   iterator base, term;
-public:
-   grep_test_predicate(iterator i, iterator j) : base(i), term(j) { match_id = 0; }
-   ~grep_test_predicate(){}
-   bool operator()(const boost::match_results< iterator, Alloc >& m);
-};
-
-template <class iterator, class Alloc>
-bool grep_test_predicate<iterator, Alloc>::operator()(const boost::match_results< iterator, Alloc >& m)
-{
-   int start, end;
-   start = m[0].first - base;
-   end = m[0].second - base;
-   if((matches[match_id] != start) || (matches[match_id + 1] != end))
-   {
-      begin_error();
-      cout << "regex++ grep match error: found [" << start << "," << end << "] expected [" << matches[match_id] << "," << matches[match_id+1] << "]" << endl;
-   }
-
-   //
-   // check $`:
-   start = m[-1].first - base;
-   end = m[-1].second - base;
-   if(match_id && 
-      ( (end != matches[match_id]) || (start != matches[match_id - 1]) )
-   )
-   {
-      begin_error();
-      cout << "regex++ grep error in $`: found [" << start << "," << end << "] expected [" << matches[match_id-1] << "," << matches[match_id] << "]" << endl;
-   }
-   else if((!match_id) && ((start != 0) || (end != matches[0])))
-   {
-      begin_error();
-      cout << "regex++ grep error in $`: found [" << start << "," << end << "] expected [" << 0 << "," << matches[0] << "]" << endl;
-   }
-
-   //
-   // check $':
-   start = m[-2].first - base;
-   end = m[-2].second - base;
-   if((start != matches[match_id + 1]) || (end != (term-base)))
-   {
-      begin_error();
-      cout << "regex++ grep error in $': found [" << start << "," << end << "] expected [" << matches[match_id + 1] << "," << (term-base) << "]" << endl;
-   }
-
-   //
-   // now check line()
-   start = m.line();
-   end = count_lines(base, iterator(m[0].first)) + 1;
-   if(start != end)
-   {
-      begin_error();
-      cout << "regex++ grep error in line(): found " << start << " expected " << end << endl;
-   }
-
-   // 
-   // now check line_start()
-   start = m.line_start() - base;
-   end = find_last_line(base, iterator(m[0].first)) - base;
-   if(start != end)
-   {
-      begin_error();
-      cout << "regex++ grep error in line_start(): found " << start << " expected " << end << endl;
-   }
-
-   match_id += 2;
-   return true;
-}
-
-template <class C, class T, class A>
-void cpp_tests(const reg_expression<C, T, A>& e, bool recurse = true)
-{
-   typedef typename reg_expression<C, T, A>::allocator_type allocator_type;
-   if(flags[4] & REG_MERGE)
-   {
-      //
-      // test merge code:
-      //
-      string_type s;
-      s = regex_merge(search_text, e, format_string.c_str(), flags[3]);
-      if(s != merge_string)
-      {
-         begin_error();
-         cout << "merge result mismatch: found \"" << s.c_str() << "\" expected \"" << merge_string.c_str() << "\"" << endl;
-      }
-      return;
-   }
-   
-   
-   if(recurse)
-   {
-      // copy and assign test:
-      reg_expression<C, T, A> e2(e);
-      cpp_tests(e2, false);
-      e2 = e;
-      cpp_tests(e2, false);
-   }
-   
-   if(e.error_code())
-   {
-      // verify that we don't expect expression to compile
-      if(search_text != BOOST_RE_STR("!"))
-      {
-         begin_error();
-         cout << "Expression did not compile using regex++ API" << endl;
-      }
-      else if((recurse) && ((flags[3] & match_partial) == 0))
-         cpp_eh_tests(e);
-   }
-   else if(flags[4] & REG_GREP)
-   {
-      // try to do grep:
-      debug_iterator<string_type::iterator> x(search_text.begin(), search_text.begin(), search_text.end());
-      debug_iterator<string_type::iterator> y(search_text.end(), search_text.begin(), search_text.end());
-      grep_test_predicate<debug_iterator<string_type::iterator>, allocator_type> oi(x, y);
-      regex_grep(oi, x, y, e, flags[3]);
-#if !defined(BOOST_RE_NO_PARTIAL_FUNC_SPEC) && !defined(BOOST_RE_NO_STRING_H) && !defined(BOOST_RE_NO_STRING_DEF_ARGS)
-      if(!recurse)
-      {
-         std::basic_string<char_t> s(search_text.begin(), search_text.end());
-         grep_test_predicate<std::basic_string<char_t>::const_iterator, allocator_type> oi2(s.begin(), s.end());
-         regex_grep(oi2, s, e, flags[3]);
-         grep_test_predicate<const char_t*, allocator_type> oi3(s.c_str(), s.c_str()+s.size());
-         regex_grep(oi3, s.c_str(), e, flags[3]);
-      }
-#endif
-   }
-   else
-   {
-      // try to find match
-      match_results< debug_iterator<string_type::iterator>, allocator_type> m;
-      debug_iterator<string_type::iterator> x(search_text.begin(), search_text.begin(), search_text.end());
-      debug_iterator<string_type::iterator> y(search_text.end(), search_text.begin(), search_text.end());
-      if(regex_search(x, y, m, e, flags[3]))
-      {
-         // match found compare what matched with what we expect:
-         int j = 0;
-         for(unsigned int i = 0; i < m.size(); ++i, j += 2)
-         {
-            if(m[i].matched == false)
-            {
-               if(matches[j] != -1)
-               {
-                  begin_error();
-                  cout << "regex++ API result mismatch in sub-expression " << i <<
-                          ", found (" << (m[i].first - x) << "," <<
-                          (m[i].second - x) << ") expected (" <<
-                          matches[j] << "," << matches[j+1] << ")" << endl;
-               }
-            }
-            else if(((m[i].first - x) != matches[j]) || ((m[i].second - x) != matches[j+1]))
-            {
-               begin_error();
-               cout << "regex++ API result mismatch in sub-expression " << i <<
-                       ", found (" << (m[i].first - x) << "," <<
-                       (m[i].second - x) << ") expected (" <<
-                       matches[j] << "," << matches[j+1] << ")" << endl;
-            }
-         }
-         //
-         // now check $` and $':
-         //
-         if((m[-1].first != x) || (m[-1].second != m[0].first))
-         {
-            begin_error();
-            cout << "regex++ API result mismatch in $` (match -1), found (" <<
-               (m[-1].first - x) << "," << (m[-1].second - x) << ") expected (0" <<
-               "," << matches[0] << ")" << endl;
-         }
-         if(((flags[3] & match_partial) == 0) && ((m[-2].first != m[0].second) || (m[-2].second != y)))
-         {
-            begin_error();
-            cout << "regex++ API result mismatch in $' (match -2), found (" <<
-               (m[-2].first - x) << "," << (m[-2].second - x) << ") expected (" <<
-               matches[1] << "," << (y-x) << ")" << endl;
-         }
-
-         //
-         // now try alternative forms of regex_search if available:
-#if !defined(BOOST_RE_NO_PARTIAL_FUNC_SPEC) && !defined(BOOST_RE_NO_STRING_H) && !defined(BOOST_RE_NO_STRING_DEF_ARGS)
-         if(!recurse)
-         {
-            std::basic_string<char_t> s(search_text.begin(), search_text.end());
-            match_results<std::basic_string<char_t>::const_iterator> sm;
-            if(regex_search(s, sm, e, flags[3]))
-            {
-               if(compare_result(sm, m) == false)
-               {
-                  begin_error();
-                  cout << "regex++ API result mismatch in regex_search(const std::string&, match_results&, const reg_expression&, int)" << endl;
-               }
-            }
-            else
-            {
-               begin_error();
-               cout << "regex++ API result mismatch in regex_search(const std::string&, match_results&, const reg_expression&, int)" << endl;
-            }
-            //
-            // partial match should give same result as full match
-            // provided a full match is expected:
-            //
-            if(matches[0] > 0)
-            {
-               if(regex_search(x, y, m, e, flags[3] | boost::match_partial))
-               {
-                  if(compare_result(sm, m) == false)
-                  {
-                     begin_error();
-                     cout << "regex++ API result mismatch in regex_search when enabling match_partial" << endl;
-                  }
-               }
-               else
-               {
-                  begin_error();
-                  cout << "regex++ API result: match not found when match_partial specified" << endl;
-               }
-            }
-            if(s.find(char_t(0)) == std::basic_string<char_t>::npos)
-            {
-               match_results<const char_t*> ssm;
-               if(regex_search(search_text.c_str(), ssm, e, flags[3]))
-               {
-                  if(compare_result(ssm, m) == false)
-                  {
-                     begin_error();
-                     cout << "regex++ API result mismatch in regex_search(const char_t*, match_results&, const reg_expression&, int)" << endl;
-                  }
-               }
-               else
-               {
-                  begin_error();
-                  cout << "regex++ API result mismatch in regex_search(const char_t*, match_results&, const reg_expression&, int)" << endl;
-               }
-            }
-         }
-         if((false == recurse) && (matches[0] == 0) && (matches[1] == search_text.size()))
-         {
-            //
-            // match expected on whole string, so all versions
-            // of regex_match should also succeed:
-            //
-            match_results< debug_iterator<string_type::iterator>, allocator_type> m1;
-            debug_iterator<string_type::iterator> x1(search_text.begin(), search_text.begin(), search_text.end());
-            debug_iterator<string_type::iterator> y1(search_text.end(), search_text.begin(), search_text.end());
-            if(regex_match(x1, y1, m1, e, flags[3]))
-            {
-               if(compare_result(m1, m) == false)
-               {
-                  begin_error();
-                  cout << "regex++ API result mismatch in regex_match(iterator, iterator, match_results&, const reg_expression&, int)" << endl;
-               }
-            }
-            else
-            {
-               begin_error();
-               cout << "regex++ API result mismatch in regex_match(iterator, iterator, match_results&, const reg_expression&, int)" << endl;
-            }
-            std::basic_string<char_t> s(search_text.begin(), search_text.end());
-            match_results<std::basic_string<char_t>::const_iterator> sm;
-            if(regex_match(s, sm, e, flags[3]))
-            {
-               if(compare_result(sm, m) == false)
-               {
-                  begin_error();
-                  cout << "regex++ API result mismatch in regex_match(const std::string&, match_results&, const reg_expression&, int)" << endl;
-               }
-            }
-            else
-            {
-               begin_error();
-               cout << "regex++ API result mismatch in regex_match(const std::string&, match_results&, const reg_expression&, int)" << endl;
-            }
-            if(s.find(char_t(0)) == std::basic_string<char_t>::npos)
-            {
-               match_results<const char_t*> ssm;
-               if(regex_match(search_text.c_str(), ssm, e, flags[3]))
-               {
-                  if(compare_result(ssm, m) == false)
-                  {
-                     begin_error();
-                     cout << "regex++ API result mismatch in regex_match(const char_t*, match_results&, const reg_expression&, int)" << endl;
-                  }
-               }
-               else
-               {
-                  begin_error();
-                  cout << "regex++ API result mismatch in regex_match(const char_t*, match_results&, const reg_expression&, int)" << endl;
-               }
-            }
-         }
-#endif
-      }
-      else
-      {
-         // match not found
-         if(matches[0] != -1)
-         {
-            begin_error();
-            cout << "Match expected but not found using regex++ API" << endl;
-         }
-      }
-   }
-}
-
-#if !defined(TEST_UNICODE)
-
-unsigned int hl_match_id;
-
-bool hl_grep_test_proc(const RegEx& e)
-{
-   int start, end;
-   start = e.Position(0);
-   end = start + e.Length();
-   if((matches[hl_match_id] != start) || (matches[hl_match_id + 1] != end))
-   {
-      begin_error();
-      cout << "class RegEx grep match error: found [" << start << "," << end << "] expected [" << matches[hl_match_id] << "," << matches[hl_match_id+1] << "]" << endl;
-   }
-
-   //
-   // check $`:
-   start = e.Position(-1);
-   end = start + e.Length(-1);
-   if(start == -1)
-   {
-      if(hl_match_id && 
-         ( matches[hl_match_id] != matches[hl_match_id - 1] )
-      )
-      {
-         begin_error();
-         cout << "class RegEx grep error in $`: found [" << start << "," << end << "] expected [" << matches[hl_match_id-1] << "," << matches[hl_match_id] << "]" << endl;
-      }
-      else if((!hl_match_id) && (0 != matches[0]))
-      {
-         begin_error();
-         cout << "class RegEx grep error in $`: found [" << start << "," << end << "] expected [" << 0 << "," << matches[0] << "]" << endl;
-      }
-   }
-   else
-   {
-      if(hl_match_id && 
-         ( (end != matches[hl_match_id]) || (start != matches[hl_match_id - 1]) )
-      )
-      {
-         begin_error();
-         cout << "class RegEx grep error in $`: found [" << start << "," << end << "] expected [" << matches[hl_match_id-1] << "," << matches[hl_match_id] << "]" << endl;
-      }
-      else if((!hl_match_id) && ((start != 0) || (end != matches[0])))
-      {
-         begin_error();
-         cout << "class RegEx grep error in $`: found [" << start << "," << end << "] expected [" << 0 << "," << matches[0] << "]" << endl;
-      }
-   }
-
-   //
-   // check $':
-   start = e.Position(-2);
-   end = start + e.Length(-2);
-   if(start == -1)
-   {
-      if(matches[hl_match_id + 1] != (int)search_text.size())
-      {
-         begin_error();
-         cout << "class RegEx grep error in $': found [" << start << "," << end << "] expected [" << matches[hl_match_id + 1] << "," << (search_text.size()) << "]" << endl;
-      }
-   }
-   else if((start != matches[hl_match_id + 1]) || (end != (int)search_text.size()))
-   {
-      begin_error();
-      cout << "class RegEx grep error in $': found [" << start << "," << end << "] expected [" << matches[hl_match_id + 1] << "," << (search_text.size()) << "]" << endl;
-   }
-
-   hl_match_id += 2;
-   return true;
-}
-
-void cpp_hl_tests(RegEx& e, bool recurse = true)
-{
-   if(flags[4] & REG_MERGE)
-      return;
-
-   if(recurse)
-   {
-      // copy and assign test:
-      RegEx e2(e);
-      cpp_hl_tests(e2, false);
-      e2 = e;
-      cpp_hl_tests(e2, false);
-   }
-
-   if(flags[4] & REG_GREP)
-   {
-      // try to do grep:
-      hl_match_id = 0;
-      GrepCallback cb = hl_grep_test_proc;
-      e.Grep(cb, search_text.c_str(), flags[3]);
-   }
-   else
-   {
-      if(e.Search(search_text.c_str(), flags[3]))
-      {
-         unsigned int i = 0;
-         unsigned int j = 0;
-         while(matches[j] != -2)
-         {
-            if( (matches[j] != (int)e.Position(i)) || (matches[j+1] - matches[j] != (int)e.Length(i)) )
-            {
-               begin_error();
-               cout << "RegEx::Search error in subexpression " << i << ": found [" << e.Position(i) << "," << (e.Position(i) + e.Length(i)) << "] expected [" << matches[j] << "," << matches[j+1] << "]" << endl;
-            }
-            ++i;
-            j += 2;
-         }
-      }
-      else
-      {
-         if(matches[0] != -1)
-         {
-            begin_error();
-            cout << "match expected but not found with RexEx::Search" << endl;
-         }
-      }
-
-      if((matches[0] == 0) && (e.Match(search_text.c_str(), flags[3])))
-      {
-         unsigned int i = 0;
-         unsigned int j = 0;
-         while(matches[j] != -2)
-         {
-            if( (matches[j] != (int)e.Position(i)) || (matches[j+1] - matches[j] != (int)e.Length(i)) )
-            {
-               begin_error();
-               cout << "RegEx::Match error in subexpression " << i << ": found [" << e.Position(i) << "," << (e.Position(i) + e.Length(i)) << "] expected [" << matches[j] << "," << matches[j+1] << "]" << endl;
-            }
-            ++i;
-            j += 2;
-         }
-      }
-   }
-}
-#endif
-
-template <class iterator>
-bool has_nulls(iterator i, iterator j)
-{
-   while(i != j)
-   {
-      if(*i == 0)
-         return true;
-      ++i;
-   }
-   return false;
-}
-
-#ifdef TEST_UNICODE
-#undef regcomp
-#undef regerror
-#undef regexec
-#undef regfree
-#undef regex_t
-#define regcomp regcompW
-#define regerror regerrorW
-#define regexec regexecW
-#define regfree regfreeW
-#define regex_t regex_tW
-#endif
-
-
-void run_tests()
-{
-#ifndef TEST_UNICODE
-   if(flags[4] & REG_UNICODE_ONLY)
-      return;
-#endif
-#ifndef NO_CPP_TEST
-   try
-   {
-      unsigned int f = flags[2] & ~regbase::use_except;
-      if(flags[0] & REG_ICASE)
-         f |= regbase::icase;
-      re_type e(expression.c_str(), f);
-      cpp_tests(e, true);
-   }
-   #ifndef BOOST_RE_NO_EXCEPTION_H
-   catch(const std::exception& e)
-   {
-      //
-      // this is only an error if the expression is expected to be valid:
-      if(search_text != BOOST_RE_STR("!"))
-      {
-         begin_error();
-         cout << "Unexpected exception thrown from C++ library: " << e.what() << endl;
-      }
-   }
-   #endif
-   catch(...)
-   {
-      begin_error();
-      cout << "Unexpected exception thrown from C++ library" << endl;
-   }
-#endif
-
-#if !defined(TEST_UNICODE)
-   try
-   {
-      if(((flags[3] & match_partial) == 0) && (flags[2] == regbase::normal) && (has_nulls(search_text.begin(), search_text.end()) == false))
-      {
-         RegEx e;
-         e.SetExpression(expression.c_str(), flags[0] & REG_ICASE);
-         cpp_hl_tests(e, true);
-      }
-   }
-   catch(const std::exception& )
-   {
-      if(search_text != BOOST_RE_STR("!"))
-      {
-         begin_error();
-         cout << "Expression did not compile with class RegEx" << endl;
-      }
-   }
-   catch(...)
-   {
-      begin_error();
-      cout << "Unexpected exception thrown from RegEx::SetExpression" << endl;
-   }
-#endif
-
-   if(flags[4] & (REG_NO_POSIX_TEST | REG_GREP | REG_MERGE | REG_MERGE_COPY))
-      return;
-   regex_t posix_expression;
-   regmatch_t m[MAX_MATCHES];
-   if(regcomp(&posix_expression, expression.c_str(), flags[0]) == 0)
-   {
-      if(flags[1] & REG_STARTEND)
-      {
-         m[0].rm_so = 0;
-         m[0].rm_eo = search_text.size();
-      }
-      if(regexec(&posix_expression, search_text.c_str(), MAX_MATCHES, m, flags[1]))
-      {
-         // match not found
-         if(matches[0] != -1)
-         {
-            begin_error();
-            cout << "Match expected but not found using POSIX API" << endl;
-         }
-      }
-      else
-      {
-         // match found compare what matched with what we expect:
-         int j = 0;
-         for(unsigned int i = 0; i <= posix_expression.re_nsub; ++i, j += 2)
-         {
-            if((m[i].rm_so != matches[j]) || (m[i].rm_eo != matches[j+1]))
-            {
-               begin_error();
-               cout << "POSIX API result mismatch in sub-expression " << i << ", found (" << m[i].rm_so << "," << m[i].rm_eo <<
-                        ") expected (" << matches[j] << "," << matches[j+1] << ")" << endl;
-            }
-         }
-      }
-      regfree(&posix_expression);
-   }
-   else
-   {
-      // expression did not compile
-      if(search_text != BOOST_RE_STR("!"))
-      {
-         begin_error();
-         cout << "Expression did not compile using POSIX API" << endl;
-      }
-   }
-}
-
-
-
-//
-// error reporting:
-int last_line = 0;
-
-void begin_error()
-{
-   if(line != last_line)
-   {
-      cout << "Error in line " << line << " of file " << file << endl;
-      cout << "Expression: " << expression.c_str() << endl;
-      cout << "Search text: " << search_text.c_str() << endl;
-      cout << "Flags: ";
-      bool started = false;
-      unsigned int id = 0;
-      while(flag_data[id].len != 0)
-      {
-         if(flags[flag_data[id].id] & flag_data[id].value)
-         {
-            if(started)
-               cout << " | ";
-            cout << flag_data[id].name;
-            started = true;
-         }
-         ++id;
-      }
-      cout << endl;
-      last_line = line;
-      ++error_count;
-   }
-}
-
-void reset_error()
-{
-   last_line = 0;
-}
-
-
-
-
-
-
-

demo/regress/tests.txt

@@ -1,870 +0,0 @@
-; 
-; 
-; this file contains a script of tests to run through regress.exe
-;
-; comments start with a semicolon and proceed to the end of the line
-;
-; changes to regular expression compile flags start with a "-" as the first
-; non-whitespace character and consist of a list of the printable names
-; of the flags, for example "match_default"
-;
-; Other lines contain a test to perform using the current flag status
-; the first token contains the expression to compile, the second the string
-; to match it against. If the second string is "!" then the expression should
-; not compile, that is the first string is an invalid regular expression.
-; This is then followed by a list of integers that specify what should match,
-; each pair represents the starting and ending positions of a subexpression
-; starting with the zeroth subexpression (the whole match).
-; A value of -1 indicates that the subexpression should not take part in the
-; match at all, if the first value is -1 then no part of the expression should
-; match the string.
-;
-
-- match_default normal REG_EXTENDED
-
-;
-; try some really simple literals:
-a a 0 1
-Z Z 0 1
-Z aaa -1 -1
-Z xxxxZZxxx 4 5
-
-; and some simple brackets:
-(a) zzzaazz 3 4 3 4
-() zzz 0 0 0 0
-() "" 0 0 0 0
-( !
-) !
-(aa !
-aa) !
-a b -1 -1
-\(\) () 0 2
-\(a\) (a) 0 3
-\() !
-(\) !
-p(a)rameter ABCparameterXYZ 3 12 4 5
-[pq](a)rameter ABCparameterXYZ 3 12 4 5
-
-; now try escaped brackets:
-- match_default bk_parens REG_BASIC
-\(a\) zzzaazz 3 4 3 4
-\(\) zzz 0 0 0 0
-\(\) "" 0 0 0 0
-\( !
-\) !
-\(aa !
-aa\) !
-() () 0 2
-(a) (a) 0 3
-(\) !
-\() !
-
-; now move on to "." wildcards
-- match_default normal REG_EXTENDED REG_STARTEND
-. a 0 1
-. \n 0 1
-. \r 0 1
-. \0 0 1
-- match_default normal match_not_dot_newline REG_EXTENDED REG_STARTEND REG_NEWLINE
-. a 0 1
-. \n -1 -1
-. \r -1 -1
-. \0 0 1
-- match_default normal match_not_dot_null match_not_dot_newline REG_EXTENDED REG_STARTEND REG_NEWLINE
-. \n -1 -1
-. \r -1 -1
-; this *WILL* produce an error from the POSIX API functions:
-- match_default normal match_not_dot_null match_not_dot_newline REG_EXTENDED REG_STARTEND REG_NEWLINE REG_NO_POSIX_TEST
-. \0 -1 -1
-
-
-;
-; now move on to the repetion ops,
-; starting with operator *
-- match_default normal REG_EXTENDED
-a* b 0 0
-ab* a 0 1
-ab* ab 0 2
-ab* sssabbbbbbsss 3 10
-ab*c* a 0 1
-ab*c* abbb 0 4
-ab*c* accc 0 4
-ab*c* abbcc 0 5
-*a !
-\<* !
-\>* !
-\n* \n\n 0 2
-\** ** 0 2
-\* * 0 1
-
-; now try operator +
-ab+ a -1 -1
-ab+ ab 0 2
-ab+ sssabbbbbbsss 3 10
-ab+c+ a -1 -1
-ab+c+ abbb -1 -1
-ab+c+ accc -1 -1
-ab+c+ abbcc 0 5
-+a !
-\<+ !
-\>+ !
-\n+ \n\n 0 2
-\+ + 0 1
-\+ ++ 0 1
-\++ ++ 0 2
-- match_default normal bk_plus_qm REG_EXTENDED REG_NO_POSIX_TEST
-+ + 0 1
-\+ !
-a\+ aa 0 2
-
-; now try operator ?
-- match_default normal REG_EXTENDED
-a? b 0 0
-ab? a 0 1
-ab? ab 0 2
-ab? sssabbbbbbsss 3 5
-ab?c? a 0 1
-ab?c? abbb 0 2
-ab?c? accc 0 2
-ab?c? abcc 0 3
-?a !
-\<? !
-\>? !
-\n? \n\n 0 1
-\? ? 0 1
-\? ?? 0 1
-\?? ?? 0 1
-- match_default normal bk_plus_qm REG_EXTENDED REG_NO_POSIX_TEST
-? ? 0 1
-\? !
-a\? aa 0 1
-a\? b 0 0
-
-- match_default normal limited_ops
-a? a? 0 2
-a+ a+ 0 2
-a\? a? 0 2
-a\+ a+ 0 2
-
-; now try operator {}
-- match_default normal REG_EXTENDED
-a{2} a -1 -1
-a{2} aa 0 2
-a{2} aaa 0 2
-a{2,} a -1 -1
-a{2,} aa 0 2
-a{2,} aaaaa 0 5
-a{2,4} a -1 -1
-a{2,4} aa 0 2
-a{2,4} aaa 0 3
-a{2,4} aaaa 0 4
-a{2,4} aaaaa 0 4
-; spaces are now allowed inside {}
-"a{ 2 , 4 }" aaaaa 0 4
-a{} !
-"a{ }" !
-a{2 !
-a} !
-\{\} {} 0 2
-
-- match_default normal bk_braces
-a\{2\} a -1 -1
-a\{2\} aa 0 2
-a\{2\} aaa 0 2
-a\{2,\} a -1 -1
-a\{2,\} aa 0 2
-a\{2,\} aaaaa 0 5
-a\{2,4\} a -1 -1
-a\{2,4\} aa 0 2
-a\{2,4\} aaa 0 3
-a\{2,4\} aaaa 0 4
-a\{2,4\} aaaaa 0 4
-"a\{ 2 , 4 \}" aaaaa 0 4
-{} {} 0 2
-
-; now test the alternation operator |
-- match_default normal REG_EXTENDED
-a|b a 0 1
-a|b b 0 1
-a(b|c) ab 0 2 1 2
-a(b|c) ac 0 2 1 2
-a(b|c) ad -1 -1 -1 -1
-|c !
-c| !
-(|) !
-(a|) !
-(|a) !
-a\| a| 0 2
-- match_default normal limited_ops
-a| a| 0 2
-a\| a| 0 2
-| | 0 1
-- match_default normal bk_vbar REG_NO_POSIX_TEST
-a| a| 0 2
-a\|b a 0 1
-a\|b b 0 1
-
-; now test the set operator []
-- match_default normal REG_EXTENDED
-; try some literals first
-[abc] a 0 1
-[abc] b 0 1
-[abc] c 0 1
-[abc] d -1 -1
-[^bcd] a 0 1
-[^bcd] b -1 -1
-[^bcd] d -1 -1
-[^bcd] e 0 1
-a[b]c abc 0 3
-a[ab]c abc 0 3
-a[^ab]c adc 0 3
-a[]b]c a]c 0 3
-a[[b]c a[c 0 3
-a[-b]c a-c 0 3
-a[^]b]c adc 0 3
-a[^-b]c adc 0 3
-a[b-]c a-c 0 3
-a[b !
-a[] !
-
-; then some ranges
-[b-e] a -1 -1
-[b-e] b 0 1
-[b-e] e 0 1
-[b-e] f -1 -1
-[^b-e] a 0 1
-[^b-e] b -1 -1
-[^b-e] e -1 -1
-[^b-e] f 0 1
-a[1-3]c a2c 0 3
-a[3-1]c !
-a[1-3-5]c !
-a[1- !
-
-; and some classes
-a[[:alpha:]]c abc 0 3
-a[[:unknown:]]c !
-a[[: !
-a[[:alpha !
-a[[:alpha:] !
-a[[:alpha,:] !
-a[[:]:]]b !
-a[[:-:]]b !
-a[[:alph:]] !
-a[[:alphabet:]] !
-[[:alnum:]]+ -%@a0X- 3 6
-[[:alpha:]]+ -%@aX0- 3 5
-[[:blank:]]+ "a  \tb" 1 4
-[[:cntrl:]]+ a\n\tb 1 3
-[[:digit:]]+ a019b 1 4
-[[:graph:]]+ " a%b " 1 4
-[[:lower:]]+ AabC 1 3
-; This test fails with STLPort, disable for now as this is a corner case anyway...
-;[[:print:]]+ "\na b\n" 1 4
-[[:punct:]]+ " %-&\t" 1 4
-[[:space:]]+ "a \n\t\rb" 1 5
-[[:upper:]]+ aBCd 1 3
-[[:xdigit:]]+ p0f3Cx 1 5
-
-; now test flag settings:
-- escape_in_lists REG_NO_POSIX_TEST
-[\n] \n 0 1
-- REG_NO_POSIX_TEST
-[\n] \n -1 -1
-[\n] \\ 0 1
-[[:class:] : 0 1
-[[:class:] [ 0 1
-[[:class:] c 0 1
-
-; line anchors
-- match_default normal REG_EXTENDED
-^ab ab 0 2
-^ab xxabxx -1 -1
-^ab xx\nabzz 3 5
-ab$ ab 0 2
-ab$ abxx -1 -1
-ab$ ab\nzz 0 2
-- match_default match_not_bol match_not_eol normal REG_EXTENDED REG_NOTBOL REG_NOTEOL
-^ab ab -1 -1
-^ab xxabxx -1 -1
-^ab xx\nabzz 3 5
-ab$ ab -1 -1
-ab$ abxx -1 -1
-ab$ ab\nzz 0 2
-
-; back references
-- match_default normal REG_EXTENDED
-a(b)\2c	!
-a(b\1)c	!
-a(b*)c\1d abbcbbd 0 7 1 3
-a(b*)c\1d abbcbd -1 -1
-a(b*)c\1d abbcbbbd -1 -1
-^(.)\1 abc -1 -1
-a([bc])\1d abcdabbd	4 8 5 6
-; strictly speaking this is at best ambiguous, at worst wrong, this is what most
-; re implimentations will match though.
-a(([bc])\2)*d abbccd 0 6 3 5 3 4
-
-a(([bc])\2)*d abbcbd -1 -1
-a((b)*\2)*d abbbd 0 5 1 4 2 3
-(ab*)[ab]*\1 ababaaa 0 7 0 1
-(a)\1bcd aabcd 0 5 0 1
-(a)\1bc*d aabcd 0 5 0 1
-(a)\1bc*d aabd 0 4 0 1
-(a)\1bc*d aabcccd 0 7 0 1
-(a)\1bc*[ce]d aabcccd 0 7 0 1
-^(a)\1b(c)*cd$ aabcccd 0 7 0 1 4 5
-
-;
-; characters by code:
-- match_default normal REG_EXTENDED REG_STARTEND
-\0101 A 0 1
-\00 \0 0 1
-\0 \0 0 1
-\0172 z 0 1
-
-;
-; word operators:
-\w a 0 1
-\w z 0 1
-\w A 0 1
-\w Z 0 1
-\w _ 0 1
-\w } -1 -1
-\w ` -1 -1
-\w [ -1 -1
-\w @ -1 -1
-; non-word:
-\W a -1 -1
-\W z -1 -1
-\W A -1 -1
-\W Z -1 -1
-\W _ -1 -1
-\W } 0 1
-\W ` 0 1
-\W [ 0 1
-\W @ 0 1
-; word start:
-\<abcd "  abcd" 2 6
-\<ab cab -1 -1
-\<ab "\nab" 1 3
-\<tag ::tag 2 5
-;word end:
-abc\> abc 0 3
-abc\> abcd -1 -1
-abc\> abc\n 0 3
-abc\> abc:: 0 3
-; word boundary:
-\babcd "  abcd" 2 6
-\bab cab -1 -1
-\bab "\nab" 1 3
-\btag ::tag 2 5
-abc\b abc 0 3
-abc\b abcd -1 -1
-abc\b abc\n 0 3
-abc\b abc:: 0 3
-; within word:
-\B ab 1 1
-a\Bb ab 0 2
-a\B ab 0 1
-a\B a -1 -1
-a\B "a " -1 -1
-
-;
-; buffer operators:
-\`abc abc 0 3
-\`abc \nabc -1 -1
-\`abc " abc" -1 -1
-abc\' abc 0 3
-abc\' abc\n -1 -1
-abc\' "abc " -1 -1
-
-;
-; extra escape sequences:
-\a \a 0 1
-\f \f 0 1
-\n \n 0 1
-\r \r 0 1
-\t \t 0 1
-\v \v 0 1
-
-
-;
-; now follows various complex expressions designed to try and bust the matcher:
-a(((b)))c abc 0 3 1 2 1 2 1 2
-a(b|(c))d abd 0 3 1 2 -1 -1
-a(b|(c))d acd 0 3 1 2 1 2
-a(b*|c)d abbd 0 4 1 3
-; just gotta have one DFA-buster, of course
-a[ab]{20} aaaaabaaaabaaaabaaaab 0 21
-; and an inline expansion in case somebody gets tricky
-a[ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab] aaaaabaaaabaaaabaaaab 0 21
-; and in case somebody just slips in an NFA...
-a[ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab](wee|week)(knights|night) aaaaabaaaabaaaabaaaabweeknights 0 31 21 24 24 31
-; one really big one
-1234567890123456789012345678901234567890123456789012345678901234567890 a1234567890123456789012345678901234567890123456789012345678901234567890b 1 71
-; fish for problems as brackets go past 8
-[ab][cd][ef][gh][ij][kl][mn] xacegikmoq 1 8
-[ab][cd][ef][gh][ij][kl][mn][op] xacegikmoq 1 9
-[ab][cd][ef][gh][ij][kl][mn][op][qr] xacegikmoqy 1 10
-[ab][cd][ef][gh][ij][kl][mn][op][q] xacegikmoqy 1 10
-; and as parenthesis go past 9:
-(a)(b)(c)(d)(e)(f)(g)(h) zabcdefghi 1 9 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9
-(a)(b)(c)(d)(e)(f)(g)(h)(i) zabcdefghij 1 10 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10
-(a)(b)(c)(d)(e)(f)(g)(h)(i)(j) zabcdefghijk 1 11 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11
-(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k) zabcdefghijkl 1 12 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12
-(a)d|(b)c abc 1 3 -1 -1 1 2
-"_+((www)|(ftp)|(mailto)):_*" "_wwwnocolon _mailto:" 12 20 13 19 -1 -1 -1 -1 13 19
-
-; subtleties of matching
-a(b)?c\1d acd 0 3 -1 -1
-a(b?c)+d accd 0 4 2 3
-(wee|week)(knights|night) weeknights 0 10 0 3 3 10
-.* abc 0 3
-a(b|(c))d abd 0 3 1 2 -1 -1
-a(b|(c))d acd 0 3 1 2 1 2
-a(b*|c|e)d abbd 0 4 1 3
-a(b*|c|e)d acd 0 3 1 2
-a(b*|c|e)d ad 0 2 1 1
-a(b?)c abc 0 3 1 2
-a(b?)c ac 0 2 1 1
-a(b+)c abc 0 3 1 2
-a(b+)c abbbc 0 5 1 4 
-a(b*)c ac 0 2 1 1 
-(a|ab)(bc([de]+)f|cde) abcdef 0 6 0 1 1 6 3 5
-a([bc]?)c abc 0 3 1 2
-a([bc]?)c ac 0 2 1 1 
-a([bc]+)c abc 0 3 1 2
-a([bc]+)c abcc 0 4 1 3
-a([bc]+)bc abcbc 0 5 1 3
-a(bb+|b)b abb 0 3 1 2
-a(bbb+|bb+|b)b abb 0 3 1 2
-a(bbb+|bb+|b)b abbb 0 4 1 3
-a(bbb+|bb+|b)bb abbb 0 4 1 2
-(.*).* abcdef 0 6 0 6
-(a*)* bc 0 0 0 0
-
-; do we get the right subexpression when it is used more than once?
-a(b|c)*d ad 0 2 -1 -1
-a(b|c)*d abcd 0 4 2 3
-a(b|c)+d abd 0 3 1 2
-a(b|c)+d abcd 0 4 2 3
-a(b|c?)+d ad 0 2 1 1
-a(b|c?)+d abcd 0 4 2 3
-a(b|c){0,0}d ad 0 2 -1 -1
-a(b|c){0,1}d ad 0 2 -1 -1
-a(b|c){0,1}d abd 0 3 1 2
-a(b|c){0,2}d ad 0 2 -1 -1
-a(b|c){0,2}d abcd 0 4 2 3
-a(b|c){0,}d ad 0 2 -1 -1
-a(b|c){0,}d abcd 0 4 2 3
-a(b|c){1,1}d abd 0 3 1 2
-a(b|c){1,2}d abd 0 3 1 2
-a(b|c){1,2}d abcd 0 4 2 3
-a(b|c){1,}d abd 0 3 1 2
-a(b|c){1,}d abcd 0 4 2 3
-a(b|c){2,2}d acbd 0 4 2 3
-a(b|c){2,2}d abcd 0 4 2 3
-a(b|c){2,4}d abcd 0 4 2 3
-a(b|c){2,4}d abcbd 0 5 3 4
-a(b|c){2,4}d abcbcd 0 6 4 5
-a(b|c){2,}d abcd 0 4 2 3
-a(b|c){2,}d abcbd 0 5 3 4
-a(b+|((c)*))+d abd 0 3 1 2 -1 -1 -1 -1
-a(b+|((c)*))+d abcd 0 4 2 3 2 3 2 3
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_NOSPEC literal
-\**?/{} \\**?/{} 0 7
-
-- match_default normal REG_EXTENDED REG_NO_POSIX_TEST ; we disable POSIX testing because it can't handle escapes in sets
-; try to match C++ syntax elements:
-; line comment:
-//[^\n]* "++i //here is a line comment\n" 4 28
-; block comment:
-/\*([^*]|\*+[^*/])*\*+/ "/* here is a block comment */" 0 29 26 27
-/\*([^*]|\*+[^*/])*\*+/ "/**/" 0 4 -1 -1
-/\*([^*]|\*+[^*/])*\*+/ "/***/" 0 5 -1 -1
-/\*([^*]|\*+[^*/])*\*+/ "/****/" 0 6 -1 -1
-/\*([^*]|\*+[^*/])*\*+/ "/*****/" 0 7 -1 -1
-/\*([^*]|\*+[^*/])*\*+/ "/*****/*/" 0 7 -1 -1
-; preprossor directives:
-^[[:blank:]]*#([^\n]*\\[[:space:]]+)*[^\n]* "#define some_symbol" 0 19 -1 -1
-^[[:blank:]]*#([^\n]*\\[[:space:]]+)*[^\n]* "#define some_symbol(x) #x" 0 25 -1 -1
-^[[:blank:]]*#([^\n]*\\[[:space:]]+)*[^\n]* "#define some_symbol(x) \\  \r\n  foo();\\\r\n   printf(#x);" 0 53 28 42
-; literals:
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 0xFF         						0 4		0 4		0 4 	-1 -1 	-1 -1 	-1 -1 	-1 -1
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 35 									0 2 	0 2		-1 -1 	0 2 	-1 -1 	-1 -1 	-1 -1
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 0xFFu 								0 5		0 4		0 4 	-1 -1 	-1 -1 	-1 -1 	-1 -1
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 0xFFL 								0 5		0 4		0 4 	-1 -1 	4 5 	-1 -1 	-1 -1
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 0xFFFFFFFFFFFFFFFFuint64 			0 24	0 18	0 18 	-1 -1 	19 24 	19 24 	22 24
-; strings:
-'([^\\']|\\.)*' '\\x3A' 0 6 4 5
-'([^\\']|\\.)*' '\\'' 0 4 1 3
-'([^\\']|\\.)*' '\\n' 0 4 1 3
-
-; now try and test some unicode specific characters:
-- match_default normal REG_EXTENDED REG_UNICODE_ONLY
-[[:unicode:]]+  a\0300\0400z 1 3
-
-; finally try some case insensitive matches:
-- match_default normal REG_EXTENDED REG_ICASE
-; upper and lower have no meaning here so they fail, however these
-; may compile with other libraries...
-;[[:lower:]] !
-;[[:upper:]] !
-0123456789@abcdefghijklmnopqrstuvwxyz\[\\\]\^_`ABCDEFGHIJKLMNOPQRSTUVWXYZ\{\|\} 0123456789@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]\^_`abcdefghijklmnopqrstuvwxyz\{\|\} 0 72
-
-; known and suspected bugs:
-- match_default normal REG_EXTENDED
-\( ( 0 1
-\) ) 0 1
-\$ $ 0 1
-\^ ^ 0 1
-\. . 0 1
-\* * 0 1
-\+ + 0 1
-\? ? 0 1
-\[ [ 0 1
-\] ] 0 1
-\| | 0 1
-\\ \\ 0 1
-# # 0 1
-\# # 0 1
-a- a- 0 2
-\- - 0 1
-\{ { 0 1
-\} } 0 1
-0 0 0 1
-1 1 0 1
-9 9 0 1
-b b 0 1
-B B 0 1
-< < 0 1
-> > 0 1
-w w 0 1
-W W 0 1
-` ` 0 1
-' ' 0 1
-\n \n 0 1
-, , 0 1
-a a 0 1
-f f 0 1
-n n 0 1
-r r 0 1
-t t 0 1
-v v 0 1
-c c 0 1
-x x 0 1
-: : 0 1
-(\.[[:alnum:]]+){2} "w.a.b " 1 5 3 5
-
-- match_default normal REG_EXTENDED REG_ICASE
-a A 0 1
-A a 0 1
-[abc]+ abcABC 0 6
-[ABC]+ abcABC 0 6
-[a-z]+ abcABC 0 6
-[A-Z]+ abzANZ 0 6
-[a-Z]+ abzABZ 0 6
-[A-z]+ abzABZ 0 6
-[[:lower:]]+ abyzABYZ 0 8
-[[:upper:]]+ abzABZ 0 6
-[[:word:]]+ abcZZZ 0 6
-[[:alpha:]]+ abyzABYZ 0 8
-[[:alnum:]]+ 09abyzABYZ 0 10
-
-; updated tests for version 2:
-- match_default normal REG_EXTENDED
-\x41 A 0 1
-\xff \255 0 1
-\xFF \255 0 1
-- match_default normal REG_EXTENDED REG_NO_POSIX_TEST
-\c@ \0 0 1
-- match_default normal REG_EXTENDED
-\cA \1 0 1
-\cz \58 0 1
-\c= !
-\c? !
-=: =: 0 2
-
-; word start:
-[[:<:]]abcd "  abcd" 2 6
-[[:<:]]ab cab -1 -1
-[[:<:]]ab "\nab" 1 3
-[[:<:]]tag ::tag 2 5
-;word end:
-abc[[:>:]] abc 0 3
-abc[[:>:]] abcd -1 -1
-abc[[:>:]] abc\n 0 3
-abc[[:>:]] abc:: 0 3
-
-; collating elements and rewritten set code:
-- match_default normal REG_EXTENDED REG_STARTEND
-[[.zero.]] 0 0 1
-[[.one.]] 1 0 1
-[[.two.]] 2 0 1
-[[.three.]] 3 0 1
-[[.a.]] baa 1 2
-[[.right-curly-bracket.]] } 0 1
-[[.NUL.]] \0 0 1
-[[:<:]z] !
-[a[:>:]] !
-[[=a=]] a 0 1
-[[=right-curly-bracket=]] } 0 1
-- match_default normal REG_EXTENDED REG_STARTEND REG_ICASE
-[[.A.]] A 0 1
-[[.A.]] a 0 1
-[[.A.]-b]+ AaBb 0 4
-[A-[.b.]]+ AaBb 0 4
-[[.a.]-B]+ AaBb 0 4
-[a-[.B.]]+ AaBb 0 4
-- match_default normal REG_EXTENDED REG_NO_POSIX_TEST
-[\x61] a 0 1
-[\x61-c]+ abcd 0 3
-[a-\x63]+ abcd 0 3
-- match_default normal REG_EXTENDED REG_STARTEND
-[[.a.]-c]+ abcd 0 3
-[a-[.c.]]+ abcd 0 3
-[[:alpha:]-a] !
-[a-[:alpha:]] !
-
-; try mutli-character ligatures:
-[[.ae.]] ae 0 2
-[[.ae.]] aE -1 -1
-[[.AE.]] AE 0 2
-[[.Ae.]] Ae 0 2
-[[.ae.]-b] a -1 -1
-[[.ae.]-b] b 0 1
-[[.ae.]-b] ae 0 2
-[a-[.ae.]] a 0 1
-[a-[.ae.]] b -1 -1
-[a-[.ae.]] ae 0 2
-- match_default normal REG_EXTENDED REG_STARTEND REG_ICASE
-[[.ae.]] AE 0 2
-[[.ae.]] Ae 0 2
-[[.AE.]] Ae 0 2
-[[.Ae.]] aE 0 2
-[[.AE.]-B] a -1 -1
-[[.Ae.]-b] b 0 1
-[[.Ae.]-b] B 0 1
-[[.ae.]-b] AE 0 2
-
-- match_default normal REG_EXTENDED REG_STARTEND
-;extended perl style escape sequences:
-\e \27 0 1
-\x1b \27 0 1
-\x{1b} \27 0 1
-\x{} !
-\x{ !
-\x} !
-\x !
-\x{yy !
-\x{1b !
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_NO_POSIX_TEST
-\l+ ABabcAB 2 5
-[\l]+ ABabcAB 2 5
-[a-\l] !
-[\l-a] !
-[\L] !
-\L+ abABCab 2 5
-\u+ abABCab 2 5
-[\u]+ abABCab 2 5
-[\U] !
-\U+ ABabcAB 2 5
-\d+ ab012ab 2 5
-[\d]+ ab012ab 2 5
-[\D] !
-\D+ 01abc01 2 5
-\s+ "ab   ab" 2 5
-[\s]+ "ab   ab" 2 5
-[\S] !
-\S+ "  abc  " 2 5
-- match_default normal REG_EXTENDED REG_STARTEND
-\Qabc !
-\Qabc\E abcd 0 3
-\Qabc\Ed abcde 0 4
-\Q+*?\\E +*?\\ 0 4
-
-\C+ abcde 0 5
-\X+ abcde 0 5
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_UNICODE_ONLY
-\X+ a\768\769 0 3
-\X+ \2309\2307 0 2   ;DEVANAGARI script
-\X+ \2489\2494 0 2   ;BENGALI script
-
-- match_default normal REG_EXTENDED REG_STARTEND
-\Aabc abc 0 3
-\Aabc aabc -1 -1
-abc\z abc 0 3
-abc\z abcd -1 -1
-abc\Z abc\n\n 0 3
-abc\Z abc 0 3
-
-
-\Gabc abc 0 3
-\Gabc dabcd -1 -1
-a\Gbc abc -1 -1
-a\Aab abc -1 -1
-
-;
-; now test grep,
-; basically check all our restart types - line, word, etc
-; checking each one for null and non-null matches.
-;
-- match_default normal REG_EXTENDED REG_STARTEND REG_GREP
-a " a a a aa" 1 2 3 4 5 6 7 8 8 9
-a+b+ "aabaabbb ab" 0 3 3 8 9 11
-a(b*|c|e)d adabbdacd 0 2 2 6 6 9
-a "\na\na\na\naa" 1 2 3 4 5 6 7 8 8 9
-
-^ "   \n\n  \n\n\n" 0 0 4 4 5 5 8 8 9 9 10 10
-^ab  "ab  \nab  ab\n" 0 2 5 7
-^[^\n]*\n "   \n  \n\n  \n" 0 4 4 7 7 8 8 11
-\<abc "abcabc abc\n\nabc" 0 3 7 10 12 15
-\< "  ab a aaa  "  2 2 5 5 7 7
-\<\w+\W+ " aa  aa  a " 1 5 5 9 9 11
-
-\Aabc "abc   abc"  0 3
-\G\w+\W+ "abc  abc a cbbb   " 0 5 5 9 9 11 11 18
-\Ga+b+ "aaababb  abb" 0 4 4 7
-
-abc abc 0 3
-abc " abc abcabc " 1 4 5 8 8 11
-\n\n " \n\n\n       \n      \n\n\n\n  " 1 3 18 20 20 22
-
-$ "   \n\n  \n\n\n" 3 3 4 4 7 7 8 8 9 9 10 10
-\b "  abb a abbb " 2 2 5 5 6 6 7 7 8 8 12 12
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_GREP REG_ICASE
-A " a a a aa" 1 2 3 4 5 6 7 8 8 9
-A+B+ "aabaabbb ab" 0 3 3 8 9 11
-A(B*|c|e)D adabbdacd 0 2 2 6 6 9
-A "\na\na\na\naa" 1 2 3 4 5 6 7 8 8 9
-
-^aB  "Ab  \nab  Ab\n" 0 2 5 7
-\<abc "Abcabc aBc\n\nabc" 0 3 7 10 12 15
-
-ABC abc 0 3
-abc " ABC ABCABC " 1 4 5 8 8 11
-
-
-;
-; now test merge,
-;
-- match_default normal REG_EXTENDED REG_STARTEND REG_MERGE format_no_copy
-; start by testing subs:
-a+ "...aaa,,," $` "..." 
-a+ "...aaa,,," $' ",,," 
-a+ "...aaa,,," $& "aaa" 
-a+ "...aaa,,," $0 aaa
-a+ "...aaa,,," $1 ""
-a+ "...aaa,,," $15 ""
-(a+)b+ "...aaabbb,,," $1 aaa
-
-; and now escapes:
-a+ "...aaa,,," $x "$x" 
-a+ "...aaa,,," \a "\a" 
-a+ "...aaa,,," \f "\f" 
-a+ "...aaa,,," \n "\n" 
-a+ "...aaa,,," \r "\r" 
-a+ "...aaa,,," \t "\t" 
-a+ "...aaa,,," \v "\v" 
-
-a+ "...aaa,,," \x21 "!" 
-a+ "...aaa,,," \x{21} "!" 
-a+ "...aaa,,," \c@ \0
-a+ "...aaa,,," \e \27
-a+ "...aaa,,," \0101 A
-a+ "...aaa,,," (\0101) A
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_MERGE format_sed format_no_copy
-(a+)(b+) ...aabb,, \0 aabb
-(a+)(b+) ...aabb,, \1 aa
-(a+)(b+) ...aabb,, \2 bb
-(a+)(b+) ...aabb,, & aabb
-(a+)(b+) ...aabb,, $ $
-(a+)(b+) ...aabb,, $1 $1
-(a+)(b+) ...aabb,, ()?: ()?:
-(a+)(b+) ...aabb,, \\ \\
-(a+)(b+) ...aabb,, \& &
-
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_MERGE format_perl format_no_copy
-(a+)(b+) ...aabb,, $0 aabb
-(a+)(b+) ...aabb,, $1 aa
-(a+)(b+) ...aabb,, $2 bb
-(a+)(b+) ...aabb,, $& aabb
-(a+)(b+) ...aabb,, & &
-(a+)(b+) ...aabb,, \0 \0
-(a+)(b+) ...aabb,, ()?: ()?:
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_MERGE
-; move to copying unmatched data:
-a+ "...aaa,,," bbb "...bbb,,," 
-a+(b+) "...aaabb,,," $1 "...bb,,," 
-a+(b+) "...aaabb,,,ab*abbb?" $1 "...bb,,,b*bbb?" 
-
-(a+)|(b+) "...aaabb,,,ab*abbb?" (?1A)(?2B) "...AB,,,AB*AB?" 
-(a+)|(b+) "...aaabb,,,ab*abbb?" ?1A:B "...AB,,,AB*AB?" 
-(a+)|(b+) "...aaabb,,,ab*abbb?" (?1A:B)C "...ACBC,,,ACBC*ACBC?" 
-(a+)|(b+) "...aaabb,,,ab*abbb?" ?1:B "...B,,,B*B?" 
-
-;
-; changes to newline handling with 2.11:
-;
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_GREP
-
-^. "  \n  \r\n  " 0 1 3 4 7 8
-.$ "  \n  \r\n  " 1 2 4 5 8 9
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_GREP REG_UNICODE_ONLY
-^. "  \8232 \8233  " 0 1 3 4 5 6
-.$ "  \8232 \8233  " 1 2 3 4 6 7
-
-;
-; non-greedy repeats added 21/04/00
-- match_default normal REG_EXTENDED
-a** !
-a*? aa 0 0
-a?? aa 0 0
-a++ !
-a+? aa 0 1
-a{1,3}{1} !
-a{1,3}? aaa 0 1
-\w+?w ...ccccccwcccccw 3 10
-\W+\w+?w ...ccccccwcccccw 0 10
-abc|\w+? abd 0 1
-abc|\w+? abcd 0 3
-<\s*tag[^>]*>(.*?)<\s*/tag\s*> " <tag>here is some text</tag> <tag></tag>" 1 29 6 23
-<\s*tag[^>]*>(.*?)<\s*/tag\s*> " < tag attr=\"something\">here is some text< /tag > <tag></tag>" 1 49 24 41
-
-;
-; non-marking parenthesis added 25/04/00
-- match_default normal REG_EXTENDED
-(?:abc)+ xxabcabcxx 2 8
-(?:a+)(b+) xaaabbbx 1 7 4 7
-(a+)(?:b+) xaaabbba 1 7 1 4
-(?:(a+)b+) xaaabbba 1 7 1 4
-(?:a+(b+)) xaaabbba 1 7 4 7
-a+(?#b+)b+ xaaabbba 1 7
-
-;
-; try some partial matches:
-- match_partial match_default normal REG_EXTENDED REG_NO_POSIX_TEST
-(xyz)(.*)abc xyzaaab -1 -1 0 3 3 7
-(xyz)(.*)abc xyz -1 -1 0 3 3 3
-(xyz)(.*)abc xy -1 -1 -1 -1 -1 -1
-
-
-
-
-
-
-
-
-
-
-

demo/regress/vc6-stlport.mak

@@ -1,166 +0,0 @@
-
-# very basic makefile for regression tests
-#
-# Visual C++ 6 + full stlport 4.x
-#
-# we don't test single threaded builds as stlport doesn't support these...
-#
-CFLAGS= /Oityb1 /GF /Gy -GX -GR -I..\..\..\..\
-
-LFLAGS= -link /LIBPATH:..\..\lib\vc6-stlport user32.lib
-
-all :: r1m.exe r2m.exe r3m.exe r4m.exe r5m.exe r6m.exe r1l.exe r2l.exe r3l.exe r4l.exe r5l.exe r6l.exe r1md.exe r2md.exe r3md.exe r4md.exe r5md.exe r6md.exe r1lmd.exe r2lmd.exe r3lmd.exe r4lmd.exe r5lmd.exe r6lmd.exe r1mdd.exe r2mdd.exe r3mdd.exe r4mdd.exe r5mdd.exe r6mdd.exe r1lmdd.exe r2lmdd.exe r3lmdd.exe
-	echo testing static multi-threaded version....
-	r1m tests.txt test1252.txt
-	r2m tests.txt
-	r3m tests.txt
-	r4m tests.txt test1252.txt
-	r5m tests.txt
-	r6m tests.txt
-	echo testing DLL version....
-	r1l tests.txt test1252.txt
-	r2l tests.txt
-	r3l tests.txt
-	r4l tests.txt test1252.txt
-	r5l tests.txt
-	r6l tests.txt
-	echo testing static multi-threaded debug version....
-	r1md tests.txt test1252.txt
-	r2md tests.txt
-	r3md tests.txt
-	r4md tests.txt test1252.txt
-	r5md tests.txt
-	r6md tests.txt
-	echo testing dll debug version....
-	r1lmd tests.txt test1252.txt
-	r2lmd tests.txt
-	r3lmd tests.txt
-	r4lmd tests.txt test1252.txt
-	r5lmd tests.txt
-	r6lmd tests.txt
-	echo testing static multi-threaded stl-debug version....
-	r1mdd tests.txt test1252.txt
-	r2mdd tests.txt
-	r3mdd tests.txt
-	r4mdd tests.txt test1252.txt
-	r5mdd tests.txt
-	r6mdd tests.txt
-	echo testing dll stl-debug version....
-	r1lmdd tests.txt test1252.txt
-	r2lmdd tests.txt
-	r3lmdd tests.txt
-
-
-r1m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT -o r1m.exe $(CFLAGS) -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r2m.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r3m.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r4m.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r5m.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r6m.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-r1l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r1l.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r2l.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r3l.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r4l.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r5l.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r6l.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-r1md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r1md.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r2md.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r3md.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r4md.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r5md.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r6md.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-r1lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r1lmd.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r2lmd.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r3lmd.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r4lmd.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r5lmd.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r6lmd.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r1lmdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r1lmdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2lmdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r2lmdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3lmdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r3lmdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4lmdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r4lmdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5lmdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r5lmdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6lmdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r6lmdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r1mdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r1mdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2mdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r2mdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3mdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r3mdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4mdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r4mdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5mdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r5mdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6mdd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r6mdd.exe -D__STL_DEBUG -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-

demo/regress/vc6.mak

@@ -1,181 +0,0 @@
-
-# very basic makefile for regression tests
-#
-# Visual C++ 6
-#
-CFLAGS= /Oityb1 /GF /Gy -GX -GR -I..\..\..\..\
-
-LFLAGS= -link /LIBPATH:..\..\lib\vc6 user32.lib
-
-all :: r1.exe r2.exe r3.exe r4.exe r5.exe r6.exe r1m.exe r2m.exe r3m.exe r4m.exe r5m.exe r6m.exe r1l.exe r2l.exe r3l.exe r4l.exe r5l.exe r6l.exe r1d.exe r2d.exe r3d.exe r4d.exe r5d.exe r6d.exe r1md.exe r2md.exe r3md.exe r4md.exe r5md.exe r6md.exe r1lmd.exe r2lmd.exe r3lmd.exe r4lmd.exe r5lmd.exe r6lmd.exe
-	echo testing static single threaded version....
-	r1 tests.txt test1252.txt
-	r2 tests.txt
-	r3 tests.txt
-	r4 tests.txt test1252.txt
-	r5 tests.txt
-	r6 tests.txt
-	echo testing static multi-threaded version....
-	r1m tests.txt test1252.txt
-	r2m tests.txt
-	r3m tests.txt
-	r4m tests.txt test1252.txt
-	r5m tests.txt
-	r6m tests.txt
-	echo testing DLL version....
-	r1l tests.txt test1252.txt
-	r2l tests.txt
-	r3l tests.txt
-	r4l tests.txt test1252.txt
-	r5l tests.txt
-	r6l tests.txt
-	echo testing static single threaded debug version....
-	r1d tests.txt test1252.txt
-	r2d tests.txt
-	r3d tests.txt
-	r4d tests.txt test1252.txt
-	r5d tests.txt
-	r6d tests.txt
-	echo testing static multi-threaded debug version....
-	r1md tests.txt test1252.txt
-	r2md tests.txt
-	r3md tests.txt
-	r4md tests.txt test1252.txt
-	r5md tests.txt
-	r6md tests.txt
-	echo testing dll debug version....
-	r1lmd tests.txt test1252.txt
-	r2lmd tests.txt
-	r3lmd tests.txt
-	r4lmd tests.txt test1252.txt
-	r5lmd tests.txt
-	r6lmd tests.txt
-
-
-r1.exe : tests.cpp parse.cpp regress.cpp
-	cl /ML $(CFLAGS) -o r1.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2.exe : tests.cpp parse.cpp regress.cpp
-	cl /ML $(CFLAGS) -o r2.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3.exe : tests.cpp parse.cpp regress.cpp
-	cl /ML $(CFLAGS) -o r3.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4.exe : tests.cpp parse.cpp regress.cpp
-	cl /ML $(CFLAGS) -o r4.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5.exe : tests.cpp parse.cpp regress.cpp
-	cl /ML $(CFLAGS) -o r5.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6.exe : tests.cpp parse.cpp regress.cpp
-	cl /ML $(CFLAGS) -o r6.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-	
-
-r1m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT -o r1m.exe $(CFLAGS) -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r2m.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r3m.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r4m.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r5m.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6m.exe : tests.cpp parse.cpp regress.cpp
-	cl /MT /D_MT $(CFLAGS) -o r6m.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-r1l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r1l.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r2l.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r3l.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r4l.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r5l.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6l.exe : tests.cpp parse.cpp regress.cpp
-	cl /MD /D_MT /D_DLL $(CFLAGS) -o r6l.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-r1d.exe : tests.cpp parse.cpp regress.cpp
-	cl /MLd $(CFLAGS) -o r1d.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2d.exe : tests.cpp parse.cpp regress.cpp
-	cl /MLd $(CFLAGS) -o r2d.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3d.exe : tests.cpp parse.cpp regress.cpp
-	cl /MLd $(CFLAGS) -o r3d.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4d.exe : tests.cpp parse.cpp regress.cpp
-	cl /MLd $(CFLAGS) -o r4d.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5d.exe : tests.cpp parse.cpp regress.cpp
-	cl /MLd $(CFLAGS) -o r5d.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6d.exe : tests.cpp parse.cpp regress.cpp
-	cl /MLd $(CFLAGS) -o r6d.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-r1md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r1md.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r2md.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r3md.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r4md.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r5md.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6md.exe : tests.cpp parse.cpp regress.cpp
-	cl /MTd /D_MT $(CFLAGS) -o r6md.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-r1lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r1lmd.exe -DBOOST_RE_TEST_LOCALE_W32 tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r2lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r2lmd.exe -DBOOST_RE_TEST_LOCALE_C tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r3lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r3lmd.exe -DBOOST_RE_TEST_LOCALE_CPP tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r4lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r4lmd.exe -DBOOST_RE_TEST_LOCALE_W32 -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r5lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r5lmd.exe -DBOOST_RE_TEST_LOCALE_C -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-r6lmd.exe : tests.cpp parse.cpp regress.cpp
-	cl /MDd /D_MT /D_DLL $(CFLAGS) -o r6lmd.exe -DBOOST_RE_TEST_LOCALE_CPP -DTEST_UNICODE tests.cpp parse.cpp regress.cpp $(LFLAGS)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/regress/wregex_test.cpp

@@ -1,196 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.  
- * It is provided "as is" without express or implied warranty.
- *
- */
- 
- /*
-  *   LOCATION:    see http://www.boost.org for most recent version.
-  *   FILE         regex_test.cpp
-  *   VERSION      3.03
-  *   DESCRIPTION: Builds regression test program with default
-  *                locale and wide character tests.  Also
-  *                instantiates all the templates in the library
-  *                as a sanity check.
-  */
-
-// disable automatic selection of support library:
-#define BOOST_RE_NO_LIB
-
-#include <boost/regex.hpp>
-
-//
-// instantiate templates used:
-//
-namespace boost{
-
-typedef const wchar_t* ra_it;
-typedef wchar_t char_type;
-typedef std::basic_string<char_type> test_string_type;
-
-bool pred1(const match_results<ra_it>&)
-{ return true; }
-
-typedef bool (*pred1_type)(const match_results<ra_it>&);
-typedef bool (*pred2_type)(const match_results<test_string_type::const_iterator>&);
-
-//check that all the defined flags are available:
-regbase::flag_type f = regbase::escape_in_lists | regbase::char_classes | regbase::intervals | regbase::limited_ops
-                       | regbase::newline_alt | regbase::bk_plus_qm | regbase::bk_braces
-                       | regbase::bk_parens | regbase::bk_refs | regbase::bk_vbar | regbase::use_except
-                       | regbase::failbit | regbase::literal | regbase::icase | regbase::nocollate | regbase::basic
-                       | regbase::extended | regbase::normal | regbase::emacs | regbase::awk | regbase::grep | regbase::egrep | regbase::sed;
-
-template class reg_expression<char_type>;
-template struct sub_match<ra_it>;
-template class match_results<ra_it>;
-
-template bool regex_match(ra_it,
-                 ra_it,
-                 match_results<ra_it>& m,
-                 const reg_expression<char_type>& e,
-                 unsigned flags);
-template bool regex_match(ra_it,
-                 ra_it,
-                 const reg_expression<char_type>& e,
-                 unsigned flags);
-template bool regex_search(ra_it,
-                ra_it,
-                match_results<ra_it>& m,
-                const reg_expression<char_type>& e,
-                unsigned flags);
-template unsigned int regex_grep(pred1_type,
-                        ra_it,
-                        ra_it,
-                        const reg_expression<char_type>& e,
-                        unsigned flags);
-template char_type* regex_format(char_type*,
-                            const match_results<ra_it>& m,
-                            const char_type* fmt,
-                            unsigned flags);
-template char_type* regex_format(char_type*,
-                            const match_results<ra_it>& m,
-                            const test_string_type& fmt,
-                            unsigned flags);
-template char_type* regex_merge(char_type*,
-                          ra_it,
-                          ra_it,
-                          const reg_expression<char_type>&,
-                          const char_type*,
-                          unsigned int flags);
-template char_type* regex_merge(char_type*,
-                           ra_it,
-                           ra_it,
-                           const reg_expression<char_type>& e,
-                           const test_string_type&,
-                           unsigned int flags);
-template std::size_t regex_split(test_string_type*,
-                        test_string_type&,
-                        const reg_expression<char_type>&,
-                        unsigned flags,
-                        std::size_t);
-template std::size_t regex_split(test_string_type*,
-                        test_string_type& s,
-                        const reg_expression<char_type>& e,
-                        unsigned flags);
-
-template std::size_t regex_split(test_string_type*, test_string_type&);
-
-#ifndef BOOST_RE_NO_PARTIAL_FUNC_SPEC
-//
-// the following prototypes are only available if partial ordering
-// of template functions is supported:
-//
-template bool regex_match(const char_type*,
-                 match_results<const char_type*>& m,
-                 const reg_expression<char_type>& e,
-                 unsigned flags);
-template bool regex_match(const test_string_type&,
-                 match_results<test_string_type::const_iterator>&,
-                 const reg_expression<char_type>&,
-                 unsigned flags);
-template bool regex_match(const char_type*,
-                 const reg_expression<char_type>&,
-                 unsigned flags);
-template bool regex_match(const test_string_type&,
-                 const reg_expression<char_type>&,
-                 unsigned flags);
-template bool regex_search(const char_type*,
-                match_results<const char_type*>&,
-                const reg_expression<char_type>&,
-                unsigned flags);
-template bool regex_search(const test_string_type&,
-                match_results<test_string_type::const_iterator>&,
-                const reg_expression<char_type>&,
-                unsigned flags);
-template unsigned int regex_grep(pred1_type,
-              const char_type*,
-              const reg_expression<char_type>&,
-              unsigned flags);
-template unsigned int regex_grep(pred2_type,
-              const test_string_type&,
-              const reg_expression<char_type>&,
-              unsigned flags);
-template test_string_type regex_format
-                                 (const match_results<test_string_type::const_iterator>& m,
-                                  const char_type*,
-                                  unsigned flags);
-template test_string_type regex_format
-                                 (const match_results<test_string_type::const_iterator>&,
-                                  const test_string_type&,
-                                  unsigned flags);
-template test_string_type regex_merge(const test_string_type&,
-                                     const reg_expression<char_type>&,
-                                     const char_type*,
-                                     unsigned int flags);
-template test_string_type regex_merge(const test_string_type&,
-                                     const reg_expression<char_type>&,
-                                     const test_string_type&,
-                                     unsigned int flags);
-
-#endif
-
-
-} // namespace boost
-
-//
-// include regression test source files:
-//
-#ifdef BOOST_RE_LOCALE_W32
-#define BOOST_RE_TEST_LOCALE_W32
-#elif !defined(BOOST_RE_LOCALE_C)
-#define BOOST_RE_TEST_LOCALE_CPP
-#endif
-#define TEST_UNICODE
-#include "tests.cpp"
-#include "parse.cpp"
-#include "regress.cpp"
-
-//
-// include library source files:
-//
-#ifdef BOOST_RE_LOCALE_W32
-#include "libs/regex/src/w32_regex_traits.cpp"
-#elif defined(BOOST_RE_LOCALE_C)
-#include "libs/regex/src/c_regex_traits.cpp"
-#else
-#include "libs/regex/src/cpp_regex_traits.cpp"
-#endif
-#include "libs/regex/src/c_regex_traits_common.cpp"
-#include "libs/regex/src/cregex.cpp"
-#include "libs/regex/src/fileiter.cpp"
-#include "libs/regex/src/regex.cpp"
-#include "libs/regex/src/regex_debug.cpp"
-#include "libs/regex/src/regex_synch.cpp"
-#include "libs/regex/src/wide_posix_api.cpp"
-
-

demo/snippets/snip1.cpp

@@ -1,100 +0,0 @@
-/*
- *
- * Copyright (c) 1998-2000
- * Dr John Maddock
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Dr John Maddock makes no representations
- * about the suitability of this software for any purpose.
- * It is provided "as is" without express or implied warranty.
- *
- */
-
- /*
-  *   LOCATION:    see http://www.boost.org for most recent version.
-  *   FILE         snip1.cpp
-  *   VERSION      3.00
-  *   DESCRIPTION: ftp based regex_match example.
-  */
-  
-#include <cstdlib>
-#include <boost/regex.hpp>
-#include <string>
-#include <iostream>
-
-using namespace std;
-using namespace boost;
-
-regex expression("^([0-9]+)(\\-| |$)(.*)$");
-
-// process_ftp:
-// on success returns the ftp response code, and fills
-// msg with the ftp response message.
-int process_ftp(const char* response, std::string* msg)
-{
-   cmatch what;
-   if(regex_match(response, what, expression))
-   {
-      // what[0] contains the whole string
-      // what[1] contains the response code
-      // what[2] contains the separator character
-      // what[3] contains the text message.
-      if(msg)
-         msg->assign(what[3].first, what[3].second);
-      return atoi(what[1].first);
-   }
-   // failure did not match
-   if(msg)
-      msg->erase();
-   return -1;
-}
-
-#if defined(BOOST_MSVC) || (defined(__BORLANDC__) && (__BORLANDC__ == 0x550))
-//
-// problem with std::getline under MSVC6sp3
-istream& getline(istream& is, std::string& s)
-{
-   s.erase();
-   char c = is.get();
-   while(c != '\n')
-   {
-      s.append(1, c);
-      c = is.get();
-   }
-   return is;
-}
-#endif
-
-int main()
-{
-  std::string in, out;
-  while(true)
-  {
-  cout << "enter test string" << endl;
-  getline(cin, in);
-  if(in == "quit")
-     break;
-  int result;
-  result = process_ftp(in.c_str(), &out);
-  if(result != -1)
-  {
-     cout << "Match found:" << endl;
-     cout << "Response code: " << result << endl;
-     cout << "Message text: " << out << endl;
-  }
-  else
-  {
-     cout << "Match not found" << endl;
-  }
-  cout << endl;
-  }
-  return 0;
-}
-
-
-
-
-

demo/timer/gcc.mak

@@ -1,31 +0,0 @@
-
-# very basic makefile for timer.exe
-#
-# GNU compiler GCC
-#
-CXX=-I../../../../ -I./
-
-timer : regex_timer.cpp
-	g++ $(CXX) -O2 -o timer regex_timer.cpp -L../../lib/gcc -lregex++
-
-debug : regex_timer.cpp timer.cpp 
-	g++ $(CXX) -g -o timer regex_timer.cpp -L../../lib/gcc -lregex++debug
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/timer/makefile.in

@@ -1,38 +0,0 @@
-
-# very basic makefile for timer
-#
-CXX=@CXX@
-CXXFLAGS=@CXXFLAGS@
-LIBS=@LIBS@
-EXE=@ac_exe_ext@
-OBJ=@ac_obj_ext@
-
-LIBDEP=../../lib/libregex++.a ../../../../boost/re_detail/regex_options.hpp ../../../../boost/re_detail/regex_config.hpp
-
-regex_timer$(EXE) : regex_timer$(OBJ)
-	$(CXX) -o timer$(EXE) regex_timer$(OBJ) -L../../lib -lregex++ $(LIBS)
-
-regex_timer$(OBJ) : regex_timer.cpp $(LIBDEP)
-	$(CXX) -c $(CXXFLAGS) -DSTRICT -I../../../../ -I./ regex_timer.cpp
-
-timer$(OBJ) : ../../../timer/timer.cpp $(LIBDEP)
-	$(CXX) -c $(CXXFLAGS) -DSTRICT -I../../../../ -I./ ../../../timer/timer.cpp
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

demo/timer/sunpro.mak

@@ -1,24 +0,0 @@
-# Makefile for timer application
-#
-# for SUN workshop 5.0 C++ compiler
-#
-
-CXX=CC
-CPP_FLAGS = -O -I../../../../ -I./
-
-%.o : %.cpp 
-	$(CXX) -c -o $@ $(CPP_FLAGS) $<
-
-timer : regex_timer.o 
-	$(CXX) -o $@  $(CPP_FLAGS) regex_timer.o -L../../lib -lregex++
-
-timer.o : ../../../timer/timer.cpp
-	$(CXX) -c $(CPPFLAGS) ../../../timer/timer.cpp
-
-clean:
-	rm -rf SunWS_cache
-	rm -f timer.o timer
-
-
-
-

dmi.sh

@@ -1,14 +0,0 @@
-#! /bin/sh
-
-if test "$#" != "1"; then
-exit 1
-fi
-
-cd "$1"
-
-if eval make; then
-exit 0
-fi
-
-exit 1
-

doc/Jamfile.v2

@@ -0,0 +1,58 @@
+
+# Copyright John Maddock 2005. Use, modification, and distribution are
+# subject to the Boost Software License, Version 1.0. (See accompanying
+# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
+using quickbook ;
+
+path-constant boost-images : ../../../doc/src/images ;
+
+xml regex : regex.qbk ;
+boostbook standalone
+    :
+        regex
+    :
+        # HTML options first:
+        # Use graphics not text for navigation:
+        <xsl:param>navig.graphics=1
+        # How far down we chunk nested sections, basically all of them:
+        <xsl:param>chunk.section.depth=10
+        # Don't put the first section on the same page as the TOC:
+        <xsl:param>chunk.first.sections=1
+        # How far down sections get TOC's
+        <xsl:param>toc.section.depth=10
+        # Max depth in each TOC:
+        <xsl:param>toc.max.depth=4
+        # How far down we go with TOC's
+        <xsl:param>generate.section.toc.level=10
+        # Path for links to Boost:
+        <xsl:param>boost.root=../../../..
+        
+        # PDF Options:
+        # TOC Generation: this is needed for FOP-0.9 and later:
+        <xsl:param>fop1.extensions=0
+        # Or enable this if you're using XEP:
+        <xsl:param>xep.extensions=1
+        # TOC generation: this is needed for FOP 0.2, but must not be set to zero for FOP-0.9!
+        <xsl:param>fop.extensions=0
+        # No indent on body text:
+        <xsl:param>body.start.indent=0pt
+        # Margin size:
+        <xsl:param>page.margin.inner=0.5in
+        # Margin size:
+        <xsl:param>page.margin.outer=0.5in
+        # Yes, we want graphics for admonishments:
+        <xsl:param>admon.graphics=1
+        # Set this one for PDF generation *only*:
+        # default pnd graphics are awful in PDF form,
+        # better use SVG's instead:
+        <format>pdf:<xsl:param>admon.graphics.extension=".svg"
+        <format>pdf:<xsl:param>admon.graphics.path=$(boost-images)/
+        <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/libs/regex/doc/html
+    ;
+
+###############################################################################
+alias boostdoc ;
+explicit boostdoc ;
+alias boostrelease : standalone ;
+explicit boostrelease ;

doc/acknowledgements.qbk

@@ -0,0 +1,49 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:acknowledgements Acknowledgements]
+
+The author can be contacted at john - at - johnmaddock.co.uk; the home page for this 
+library is at [@http://www.boost.org www.boost.org].
+
+I am indebted to [@http://www.cs.princeton.edu/~rs/ 
+Robert Sedgewick's "Algorithms in C++"] for forcing me to think 
+about algorithms and their performance, and to the folks at boost for forcing me 
+to think, period.
+
+[@http://www.boost-consulting.com/ Eric Niebler], author of Boost.Expressive and 
+the [@http://research.microsoft.com/projects/greta GRETA regular expression component], 
+has shared several important ideas, in a series of long discussions.
+
+Pete Becker, of [@http://www.versatilecoding.com Roundhouse Consulting, Ltd.], 
+has helped enormously with the standardisation 
+proposal language.
+
+The following people have all contributed useful comments or fixes: Dave Abrahams, 
+Mike Allison, Edan Ayal, Jayashree Balasubramanian, Jan B'''ö'''lsche, Beman Dawes, 
+Paul Baxter, David Bergman, David Dennerline, Edward Diener, Peter Dimov, 
+Robert Dunn, Fabio Forno, Tobias Gabrielsson, Rob Gillen, Marc Gregoire, Chris Hecker, 
+Nick Hodapp, Jesse Jones, Martin Jost, Boris Krasnovskiy, Jan Hermelink, Max Leung, 
+Wei-hao Lin, Jens Maurer, Richard Peters, Heiko Schmidt, Jason Shirk, Gerald Slacik, 
+Scobie Smith, Mike Smyth, Alexander Sokolovsky, Herv'''é''' Poirier, Michael Raykh, 
+Marc Recht, Scott VanCamp, Bruno Voigt, Alexey Voinov, Jerry Waldorf, Rob Ward, 
+Lealon Watts, John Wismar, Thomas Witt and Yuval Yosef. 
+
+If I've missed your name off (I'm sure there are a few, just not who they are...) then 
+please do get in touch.
+
+I am also grateful to the manuals supplied with the Henry Spencer, PCRE, Perl 
+and GNU regular expression libraries - wherever possible I have tried to 
+maintain compatibility with these libraries and with the POSIX standard - 
+the code however is entirely my own, including any bugs! I can absolutely guarantee 
+that I will not fix any bugs I don't know about, so if you have any comments or 
+spot any bugs, please get in touch.
+
+[endsect]
+
+

doc/bad_expression.qbk

@@ -0,0 +1,58 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:bad_expression bad_expression]
+
+[h4 Synopsis]
+
+   #include <boost/pattern_except.hpp>
+
+The class `regex_error` defines the type of objects thrown as exceptions to 
+report errors during the conversion from a string representing a regular 
+expression to a finite state machine.  
+
+   namespace boost{
+
+   class regex_error : public std::runtime_error
+   {
+   public:
+      explicit regex_error(const std::string& s, regex_constants::error_type err, std::ptrdiff_t pos);
+      explicit regex_error(boost::regex_constants::error_type err);
+      boost::regex_constants::error_type code()const;
+      std::ptrdiff_t position()const;
+   };
+
+   typedef regex_error bad_pattern; // for backwards compatibility
+   typedef regex_error bad_expression; // for backwards compatibility
+   
+   } // namespace boost
+
+[h4 Description]
+
+   regex_error(const std::string& s, regex_constants::error_type err, std::ptrdiff_t pos);
+   regex_error(boost::regex_constants::error_type err);
+
+[*Effects:] Constructs an object of class regex_error.
+
+   boost::regex_constants::error_type code()const;
+
+[*Effects:] returns the error code that represents parsing error that occurred.
+
+   std::ptrdiff_t position()const; 
+
+[*Effects:] returns the location in the expression where parsing stopped.
+
+Footnotes: the choice of `std::runtime_error` as the base class for `regex_error` 
+is moot; depending upon how the library is used exceptions may be either 
+logic errors (programmer supplied expressions) or run time errors 
+(user supplied expressions).  The library previously used `bad_pattern` 
+and `bad_expression` for errors, these have been replaced by the single 
+class `regex_error` to keep the library in synchronization with the 
+[tr1].
+
+[endsect]

doc/basic_regex.qbk

@@ -0,0 +1,680 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+[section:basic_regex basic_regex]
+
+[h4 Synopsis]
+
+   #include <boost/regex.hpp>
+
+The template class `basic_regex` encapsulates regular expression 
+parsing and compilation. The class takes two template parameters:
+
+* `charT`: determines the character type, i.e. either `char` or `wchar_t`; 
+see [link boost_regex.ref.concepts.charT_concept charT concept].
+* `traits`: determines the behavior of the character type, for example which 
+character class names are recognized. A default traits class is provided: 
+`regex_traits<charT>`.  See also 
+[link boost_regex.ref.concepts.traits_concept traits concept].
+
+For ease of use there are two typedefs that define the two standard 
+`basic_regex` instances, unless you want to use custom traits classes or 
+non-standard character types (for example see 
+[link boost_regex.ref.non_std_strings.icu unicode support]), 
+you won't need to use anything other than these:
+
+   namespace boost{
+
+   template <class charT, class traits = regex_traits<charT>  >
+   class basic_regex;
+   
+   typedef basic_regex<char>      regex;
+   typedef basic_regex<wchar_t>   wregex;
+
+   }
+
+The definition of `basic_regex` follows: it is based very closely on class 
+`basic_string`, and fulfils the requirements for a constant-container of `charT`.
+
+   namespace boost{
+
+   template <class  charT, class traits = regex_traits<charT> >
+   class basic_regex {
+      public:          
+      // types:
+      typedef          charT                                value_type;
+      typedef          implementation-specific              const_iterator;
+      typedef          const_iterator                       iterator;                 
+      typedef          charT&                               reference;           
+      typedef          const charT&                         const_reference;           
+      typedef          std::ptrdiff_t                       difference_type;                 
+      typedef          std::size_t                          size_type;
+      typedef          regex_constants::``[syntax_option_type]``  flag_type;
+      typedef typename traits::locale_type                  locale_type;
+
+      // constants:
+      // main option selection:
+      static const regex_constants::``[syntax_option_type]`` normal          
+                                                   = regex_constants::normal;
+      static const regex_constants::``[syntax_option_type]`` ECMAScript      
+                                                   = normal;
+      static const regex_constants::``[syntax_option_type]`` JavaScript      
+                                                   = normal;
+      static const regex_constants::``[syntax_option_type]`` JScript         
+                                                   = normal;
+      static const regex_constants::``[syntax_option_type]`` basic           
+                                                   = regex_constants::basic;
+      static const regex_constants::``[syntax_option_type]`` extended        
+                                                   = regex_constants::extended;
+      static const regex_constants::``[syntax_option_type]`` awk             
+                                                   = regex_constants::awk;
+      static const regex_constants::``[syntax_option_type]`` grep            
+                                                   = regex_constants::grep;
+      static const regex_constants::``[syntax_option_type]`` egrep           
+                                                   = regex_constants::egrep;
+      static const regex_constants::``[syntax_option_type]`` sed             
+                                                   = basic = regex_constants::sed;
+      static const regex_constants::``[syntax_option_type]`` perl            
+                                                   = regex_constants::perl;
+      static const regex_constants::``[syntax_option_type]`` literal         
+                                                   = regex_constants::literal;
+
+      // modifiers specific to perl expressions:
+      static const regex_constants::``[syntax_option_type]`` no_mod_m        
+                                                   = regex_constants::no_mod_m;
+      static const regex_constants::``[syntax_option_type]`` no_mod_s        
+                                                   = regex_constants::no_mod_s;
+      static const regex_constants::``[syntax_option_type]`` mod_s           
+                                                   = regex_constants::mod_s;
+      static const regex_constants::``[syntax_option_type]`` mod_x           
+                                                   = regex_constants::mod_x;
+
+      // modifiers specific to POSIX basic expressions:
+      static const regex_constants::``[syntax_option_type]`` bk_plus_qm      
+                                                   = regex_constants::bk_plus_qm;
+      static const regex_constants::``[syntax_option_type]`` bk_vbar         
+                                                   = regex_constants::bk_vbar
+      static const regex_constants::``[syntax_option_type]`` no_char_classes 
+                                                   = regex_constants::no_char_classes
+      static const regex_constants::``[syntax_option_type]`` no_intervals    
+                                                   = regex_constants::no_intervals
+
+      // common modifiers:
+      static const regex_constants::``[syntax_option_type]`` nosubs          
+                                                   = regex_constants::nosubs;
+      static const regex_constants::``[syntax_option_type]`` optimize        
+                                                   = regex_constants::optimize;
+      static const regex_constants::``[syntax_option_type]`` collate         
+                                                   = regex_constants::collate;
+      static const regex_constants::``[syntax_option_type]`` newline_alt     
+                                                   = regex_constants::newline_alt;
+      static const regex_constants::``[syntax_option_type]`` no_except       
+                                                   = regex_constants::newline_alt;
+
+      // construct/copy/destroy:
+      explicit ``[link boost_regex.basic_regex.construct1 basic_regex]`` ();
+      explicit ``[link boost_regex.basic_regex.construct2 basic_regex]``(const  charT* p, flag_type f = regex_constants::normal);
+      ``[link boost_regex.basic_regex.construct3 basic_regex]``(const charT* p1, const  charT* p2, 
+                  flag_type f = regex_constants::normal);
+      ``[link boost_regex.basic_regex.construct4 basic_regex]``(const charT* p, size_type len, flag_type  f);
+      ``[link boost_regex.basic_regex.construct5 basic_regex]``(const basic_regex&);
+
+      template <class ST, class SA>
+      explicit ``[link boost_regex.basic_regex.construct6 basic_regex]``(const basic_string<charT, ST,  SA>& p, 
+                           flag_type f = regex_constants::normal);
+
+      template <class InputIterator>
+      ``[link boost_regex.basic_regex.construct7 basic_regex]``(InputIterator first,  InputIterator last, 
+                  flag_type f = regex_constants::normal);
+
+      ~basic_regex();
+      ``[link boost_regex.basic_regex.opeq1 basic_regex& operator=]``(const basic_regex&);
+      ``[link boost_regex.basic_regex.opeq2 basic_regex& operator=]`` (const charT* ptr); 
+
+      template <class ST, class SA> 
+      ``[link boost_regex.basic_regex.opeq3 basic_regex& operator=]`` (const basic_string<charT, ST, SA>& p);
+      // iterators: 
+      ``[link boost_regex.basic_regex.subexpression std::pair<const_iterator, const_iterator> subexpression]``(size_type n) const; 
+      ``[link boost_regex.basic_regex.begin const_iterator begin]``() const; 
+      ``[link boost_regex.basic_regex.end const_iterator end]``() const;
+      // capacity: 
+      ``[link boost_regex.basic_regex.size size_type size]``() const; 
+      ``[link boost_regex.basic_regex.max_size size_type max_size]``() const; 
+      ``[link boost_regex.basic_regex.empty bool empty]``() const; 
+      ``[link boost_regex.basic_regex.mark_count size_type mark_count]``()const; 
+      //
+      // modifiers: 
+      ``[link boost_regex.basic_regex.assign1 basic_regex& assign]``(const basic_regex& that); 
+      ``[link boost_regex.basic_regex.assign2 basic_regex& assign]``(const charT* ptr, 
+                          flag_type f = regex_constants::normal);
+      ``[link boost_regex.basic_regex.assign3 basic_regex& assign]``(const charT* ptr, unsigned int len, flag_type f);
+
+      template <class string_traits, class A>
+      ``[link boost_regex.basic_regex.assign4 basic_regex& assign]``(const basic_string<charT, string_traits, A>& s,
+                          flag_type f = regex_constants::normal);
+
+      template <class InputIterator>
+      ``[link boost_regex.basic_regex.assign5 basic_regex& assign]``(InputIterator first, InputIterator last,
+                          flag_type f = regex_constants::normal);
+
+      // const operations:
+      ``[link boost_regex.basic_regex.flags flag_type flags]``() const;
+      ``[link boost_regex.basic_regex.status int status]``()const;
+      ``[link boost_regex.basic_regex.str basic_string<charT> str]``() const;
+      ``[link boost_regex.basic_regex.compare int compare]``(basic_regex&) const;
+      // locale:
+      ``[link boost_regex.basic_regex.imbue locale_type imbue]``(locale_type loc);
+      ``[link boost_regex.basic_regex.getloc locale_type getloc]``() const;
+      // swap
+      ``[link boost_regex.basic_regex.swap void swap]``(basic_regex&) throw();
+   };
+
+   template <class charT, class traits>
+   ``[link boost_regex.basic_regex.op_eq bool operator ==]`` (const basic_regex<charT, traits>& lhs,
+                     const basic_regex<charT, traits>& rhs);
+
+   template <class charT, class traits>
+   ``[link boost_regex.basic_regex.op_ne bool operator !=]`` (const basic_regex<charT, traits>& lhs,
+                     const basic_regex<charT, traits>& rhs);
+
+   template <class charT, class traits>
+   ``[link boost_regex.basic_regex.op_lt bool operator <]`` (const basic_regex<charT, traits>& lhs,
+                  const basic_regex<charT, traits>& rhs);
+
+   template <class charT, class traits>
+   ``[link boost_regex.basic_regex.op_le bool operator <=]`` (const basic_regex<charT, traits>& lhs,
+                     const basic_regex<charT, traits>& rhs);
+
+   template <class charT, class traits>
+   ``[link boost_regex.basic_regex.op_ge bool operator >=]`` (const basic_regex<charT, traits>& lhs,
+                     const basic_regex<charT, traits>& rhs);
+
+   template <class charT, class traits>
+   ``[link boost_regex.basic_regex.op_gt bool operator >]`` (const basic_regex<charT, traits>& lhs,
+                  const basic_regex<charT, traits>& rhs);
+
+   template <class charT, class io_traits, class re_traits>
+   basic_ostream<charT, io_traits>&
+      ``[link boost_regex.basic_regex.op_stream operator <<]`` (basic_ostream<charT, io_traits>& os,
+                  const basic_regex<charT, re_traits>& e);
+
+   template <class charT, class traits>
+   ``[link boost_regex.basic_regex.op_swap void swap]``(basic_regex<charT, traits>& e1,
+            basic_regex<charT, traits>& e2);
+
+   typedef basic_regex<char> regex;
+   typedef basic_regex<wchar_t> wregex;
+
+   } // namespace boost
+
+[h4 Description]
+
+Class `basic_regex` has the following public members:
+
+   // main option selection:
+   static const regex_constants::``[syntax_option_type]`` normal           
+                                             = regex_constants::normal;
+   static const regex_constants::``[syntax_option_type]`` ECMAScript       
+                                             = normal;
+   static const regex_constants::``[syntax_option_type]`` JavaScript       
+                                             = normal;
+   static const regex_constants::``[syntax_option_type]`` JScript          
+                                             = normal;
+   static const regex_constants::``[syntax_option_type]`` basic            
+                                             = regex_constants::basic;
+   static const regex_constants::``[syntax_option_type]`` extended         
+                                             = regex_constants::extended;
+   static const regex_constants::``[syntax_option_type]`` awk              
+                                             = regex_constants::awk;
+   static const regex_constants::``[syntax_option_type]`` grep             
+                                             = regex_constants::grep;
+   static const regex_constants::``[syntax_option_type]`` egrep            
+                                             = regex_constants::egrep;
+   static const regex_constants::``[syntax_option_type]`` sed              
+                                             = regex_constants::sed;
+   static const regex_constants::``[syntax_option_type]`` perl             
+                                             = regex_constants::perl;
+   static const regex_constants::``[syntax_option_type]`` literal          
+                                             = regex_constants::literal;
+
+   // modifiers specific to perl expressions:
+   static const regex_constants::``[syntax_option_type]`` no_mod_m         
+                                             = regex_constants::no_mod_m;
+   static const regex_constants::``[syntax_option_type]`` no_mod_s         
+                                             = regex_constants::no_mod_s;
+   static const regex_constants::``[syntax_option_type]`` mod_s            
+                                             = regex_constants::mod_s;
+   static const regex_constants::``[syntax_option_type]`` mod_x            
+                                             = regex_constants::mod_x;
+
+   // modifiers specific to POSIX basic expressions:
+   static const regex_constants::``[syntax_option_type]`` bk_plus_qm       
+                                             = regex_constants::bk_plus_qm;
+   static const regex_constants::``[syntax_option_type]`` bk_vbar          
+                                             = regex_constants::bk_vbar
+   static const regex_constants::``[syntax_option_type]`` no_char_classes  
+                                             = regex_constants::no_char_classes
+   static const regex_constants::``[syntax_option_type]`` no_intervals     
+                                             = regex_constants::no_intervals
+
+   // common modifiers:
+   static const regex_constants::``[syntax_option_type]`` nosubs           
+                                             = regex_constants::nosubs;
+   static const regex_constants::``[syntax_option_type]`` optimize         
+                                             = regex_constants::optimize;
+   static const regex_constants::``[syntax_option_type]`` collate          
+                                             = regex_constants::collate;
+   static const regex_constants::``[syntax_option_type]`` newline_alt      
+                                             = regex_constants::newline_alt;
+
+The meaning of these options is documented in the [syntax_option_type]
+section.
+
+The static constant members are provided as synonyms for the constants declared 
+in namespace `boost::regex_constants`; for each constant of type [syntax_option_type] 
+declared in namespace `boost::regex_constants` then a constant with the same name, 
+type and value is declared within the scope of basic_regex.
+
+[#boost_regex.basic_regex.construct1]
+
+   basic_regex();
+
+[*Effects]: Constructs an object of class `basic_regex`. 
+
+[table basic_regex default construction postconditions
+[[Element][Value]]
+[[`empty()`][`true`]]
+[[`size()`][`0`]]
+[[`str()`][`basic_string<charT>()`]]
+]
+
+[#boost_regex.basic_regex.construct2]
+
+   basic_regex(const charT* p, flag_type f = regex_constants::normal);
+
+[*Requires]: /p/ shall not be a null pointer.
+
+[*Throws]: [bad_expression] if /p/ is not a valid regular expression, 
+unless the flag `no_except` is set in /f/.
+
+[*Effects]: Constructs an object of class [basic_regex]; the object's internal 
+finite state machine is constructed from the regular expression contained 
+in the null-terminated string /p/, and interpreted according to the 
+[link boost_regex.ref.syntax_option_type option 
+flags] specified in /f/. 
+
+[table Postconditions for basic_regex construction
+[[Element][Value]]
+[[`empty()`][`false`]]
+[[`size()`][`char_traits<charT>::length(p)`]]
+[[`str()`][`basic_string<charT>(p)`]]
+[[`flags()`][['f]]]
+[[`mark_count()`][The number of marked sub-expressions within the expression.]]
+]
+
+[#boost_regex.basic_regex.construct3]
+
+   basic_regex(const charT* p1, const charT* p2, 
+               flag_type f = regex_constants::normal);
+
+[*Requires]: /p1/ and /p2/ are not null pointers, `p1 < p2`.
+
+[*Throws]: bad_expression if \[p1,p2) is not a valid regular expression, unless 
+the flag `no_except` is set in /f/.
+
+[*Effects]: Constructs an object of class [basic_regex]; the object's 
+internal finite state machine is constructed from the regular expression 
+contained in the sequence of characters \[p1,p2), and interpreted according the 
+[link boost_regex.ref.syntax_option_type option flags] specified in /f/. 
+
+[table Postconditions for basic_regex construction
+[[Element][Value]]
+[[`empty()`][`false`]]
+[[`size()`][`std::distance(p1,p2)`]]
+[[`str()`][`basic_string<charT>(p1,p2)`]]
+[[`flags()`][['f]]]
+[[`mark_count()`][The number of marked sub-expressions within the expression.]]
+]
+
+[#boost_regex.basic_regex.construct4]
+
+   basic_regex(const charT* p, size_type len, flag_type f);
+
+[*Requires]: /p/ shall not be a null pointer, `len < max_size()`.
+
+[*Throws]: [bad_expression] if /p/ is not a valid regular expression, unless 
+the flag `no_except` is set in /f/.
+
+[*Effects]: Constructs an object of class [basic_regex]; the object's 
+internal finite state machine is constructed from the regular expression 
+contained in the sequence of characters \[p, p+len), and interpreted 
+according the option flags specified in /f/. 
+
+[table Postconditions for basic_regex construction
+[[Element][Value]]
+[[`empty()`][`false`]]
+[[`size()`][['len]]]
+[[`str()`][`basic_string<charT>(p, len)`]]
+[[`flags()`][['f]]]
+[[`mark_count()`][The number of marked sub-expressions within the expression.]]
+]
+
+[#boost_regex.basic_regex.construct5]
+
+   basic_regex(const basic_regex& e);
+
+[*Effects]: Constructs an object of class [basic_regex] as a copy of the object 
+/e/. 
+
+[#boost_regex.basic_regex.construct6]
+
+   template <class ST, class SA>
+   basic_regex(const basic_string<charT, ST, SA>& s, 
+               flag_type f = regex_constants::normal);
+
+[*Throws]: [bad_expression] if /s/ is not a valid regular expression, 
+unless the flag `no_except` is set in /f/.
+
+[*Effects]: Constructs an object of class [basic_regex]; the object's 
+internal finite state machine is constructed from the regular expression 
+contained in the string /s/, and interpreted according to the [link boost_regex.ref.syntax_option_type option 
+flags] specified in /f/. 
+
+[table Postconditions for basic_regex construction
+[[Element][Value]]
+[[`empty()`][`false`]]
+[[`size()`][`s.size()`]]
+[[`str()`][['s]]]
+[[`flags()`][['f]]]
+[[`mark_count()`][The number of marked sub-expressions within the expression.]]
+]
+
+[#boost_regex.basic_regex.construct7]
+
+   template <class ForwardIterator>
+   basic_regex(ForwardIterator first, ForwardIterator last, 
+               flag_type f = regex_constants::normal);
+
+[*Throws]: [bad_expression] if the sequence \[first, last) is not a valid 
+regular expression, unless the flag `no_except` is set in /f/.
+
+[*Effects]: Constructs an object of class [basic_regex]; the object's 
+internal finite state machine is constructed from the regular expression 
+contained in the sequence of characters \[first, last), and interpreted 
+according to the [link boost_regex.ref.syntax_option_type option flags] specified in /f/. 
+
+[table Postconditions for basic_regex construction
+[[Element][Value]]
+[[`empty()`][`false`]]
+[[`size()`][`distance(first,last)`]]
+[[`str()`][`basic_string<charT>(first,last)`]]
+[[`flags()`][['f]]]
+[[`mark_count()`][The number of marked sub-expressions within the expression.]]
+]
+
+[#boost_regex.basic_regex.opeq1]
+
+   basic_regex& operator=(const basic_regex& e);
+
+[*Effects]: Returns the result of `assign(e.str(), e.flags())`.
+
+[#boost_regex.basic_regex.opeq2]
+
+   basic_regex& operator=(const charT* ptr);
+
+[*Requires]: /p/ shall not be a null pointer.
+
+[*Effects]: Returns the result of `assign(ptr)`.
+
+[#boost_regex.basic_regex.opeq3]
+
+   template <class ST, class SA>
+   basic_regex& operator=(const basic_string<charT, ST, SA>& p);
+
+[*Effects]: Returns the result of `assign(p)`.
+
+[#boost_regex.basic_regex.subexpression]
+
+   std::pair<const_iterator, const_iterator> subexpression(size_type n) const;
+
+[*Effects]: Returns a pair of iterators denoting the location of 
+marked subexpression /n/ within the original regular expression string.
+The returned iterators are relative to `begin()` and `end()`.
+
+[*Requires]: The expression must have been compiled with the
+[syntax_option_type] save_subexpression_location set.  Argument
+/n/ must be in within the range `0 <= n < mark_count()`.
+
+[#boost_regex.basic_regex.begin]
+
+   const_iterator begin() const;
+
+[*Effects]: Returns a starting iterator to a sequence of characters representing 
+the regular expression.
+
+[#boost_regex.basic_regex.end]
+
+   const_iterator end() const;
+
+[*Effects]: Returns termination iterator to a sequence of characters representing 
+the regular expression.
+
+[#boost_regex.basic_regex.size]
+
+   size_type size() const;
+
+[*Effects]: Returns the length of the sequence of characters representing the regular expression.
+
+[#boost_regex.basic_regex.max_size]
+
+   size_type max_size() const;
+
+[*Effects]: Returns the maximum length of the sequence of characters representing 
+the regular expression.
+
+[#boost_regex.basic_regex.empty]
+
+   bool empty() const;
+
+[*Effects]: Returns true if the object does not contain a valid regular expression, 
+otherwise false.
+
+[#boost_regex.basic_regex.mark_count]
+
+   size_type mark_count() const;
+
+[*Effects]: Returns the number of marked sub-expressions within the regular expression.
+
+[#boost_regex.basic_regex.assign1]
+
+   basic_regex& assign(const basic_regex& that);
+
+[*Effects]: Returns [link boost_regex.basic_regex.assign4 `assign(that.str(), that.flags())`].
+
+[#boost_regex.basic_regex.assign2]
+
+   basic_regex& assign(const charT* ptr, flag_type f = regex_constants::normal);
+
+[*Effects]: Returns [link boost_regex.basic_regex.assign4 `assign(string_type(ptr), f)`].
+
+[#boost_regex.basic_regex.assign3]
+
+   basic_regex& assign(const charT* ptr, unsigned int len, flag_type f);
+
+[*Effects]: Returns [link boost_regex.basic_regex.assign4 `assign(string_type(ptr, len), f)`].
+
+[#boost_regex.basic_regex.assign4]
+
+   template <class string_traits, class A>
+   basic_regex& assign(const basic_string<charT, string_traits, A>& s,
+                     flag_type f = regex_constants::normal);
+
+[*Throws]: [bad_expression] if /s/ is not a valid regular expression, 
+unless the flag `no_except` is set in /f/.
+
+[*Returns]: *this.
+
+[*Effects]: Assigns the regular expression contained in the string /s/, 
+interpreted according the [link boost_regex.ref.syntax_option_type option flags] 
+specified in /f/. 
+
+[table Postconditions for basic_regex::assign
+[[Element][Value]]
+[[`empty()`][`false`]]
+[[`size()`][`s.size()`]]
+[[`str()`][['s]]]
+[[`flags()`][['f]]]
+[[`mark_count()`][The number of marked sub-expressions within the expression.]]
+]
+
+[#boost_regex.basic_regex.assign5]
+
+   template <class InputIterator>
+   basic_regex& assign(InputIterator first, InputIterator last,
+                       flag_type f = regex_constants::normal);
+
+[*Requires]: The type `InputIterator` corresponds to the 
+[@http://input_iterator Input Iterator requirements 
+(24.1.1)].
+
+[*Effects]: Returns [link boost_regex.basic_regex.assign4 `assign(string_type(first, last), f)`].
+
+[#boost_regex.basic_regex.flags]
+
+   flag_type flags() const;
+
+[*Effects]: Returns a copy of the [link boost_regex.ref.syntax_option_type 
+regular expression syntax flags] that were passed to the object's constructor, 
+or the last call to `assign`.
+
+[#boost_regex.basic_regex.status]
+
+   int status() const;
+
+[*Effects]: Returns zero if the expression contains a valid regular expression, 
+otherwise an error code.  This member function is retained for use in 
+environments that cannot use exception handling.
+
+[#boost_regex.basic_regex.str]
+
+   basic_string<charT> str() const;
+
+[*Effects]: Returns a copy of the character sequence passed to the object's constructor, 
+or the last call to assign.
+
+[#boost_regex.basic_regex.compare]
+
+   int compare(basic_regex& e)const;
+
+[*Effects]: If `flags() == e.flags()` then returns `str().compare(e.str())`, 
+otherwise returns `flags() - e.flags()`.
+
+[#boost_regex.basic_regex.imbue]
+
+   locale_type imbue(locale_type l);
+
+[*Effects]: Returns the result of `traits_inst.imbue(l)` where `traits_inst` is 
+a (default initialized) instance of the template parameter `traits` stored 
+within the object. Calls to `imbue` invalidate any currently contained 
+regular expression.
+
+[*Postcondition]: `empty() == true`.
+
+[#boost_regex.basic_regex.getloc]
+
+   locale_type getloc() const;
+
+[*Effects]: Returns the result of `traits_inst.getloc()` where `traits_inst` is 
+a (default initialized) instance of the template parameter traits stored 
+within the object.
+
+[#boost_regex.basic_regex.swap]
+
+   void swap(basic_regex& e) throw();
+
+[*Effects]: Swaps the contents of the two regular expressions.
+
+[*Postcondition]: `*this` contains the regular expression that was in /e/, /e/ contains 
+the regular expression that was in `*this`.
+
+[*Complexity]: constant time.
+
+[note Comparisons between [basic_regex] objects are provided on an 
+experimental basis: please note that these are not present in the [tr1], 
+so use with care if you are writing code that may need to be ported
+to other implementations of [basic_regex].]
+
+[#boost_regex.basic_regex.op_eq]
+
+   template <class charT, class traits>
+   bool operator == (const basic_regex<charT, traits>& lhs,
+                     const basic_regex<charT, traits>& rhs);
+
+[*Effects]: Returns `lhs.compare(rhs) == 0`.
+
+[#boost_regex.basic_regex.op_ne]
+
+   template <class charT, class traits>
+   bool operator != (const basic_regex<charT, traits>& lhs,
+                     const basic_regex<charT, traits>& rhs);
+
+[*Effects]: Returns `lhs.compare(rhs) != 0`.
+
+[#boost_regex.basic_regex.op_lt]
+
+   template <class charT, class traits>
+   bool operator < (const basic_regex<charT, traits>& lhs,
+                  const basic_regex<charT, traits>& rhs);
+
+[*Effects]: Returns `lhs.compare(rhs) < 0`.
+
+[#boost_regex.basic_regex.op_le]
+
+   template <class charT, class traits>
+   bool operator <= (const basic_regex<charT, traits>& lhs,
+                     const basic_regex<charT, traits>& rhs);
+
+[*Effects]: Returns `lhs.compare(rhs) <= 0`.
+
+[#boost_regex.basic_regex.op_ge]
+
+   template <class charT, class traits>
+   bool operator >= (const basic_regex<charT, traits>& lhs,
+                     const basic_regex<charT, traits>& rhs);
+
+[*Effects]: Returns `lhs.compare(rhs) >= 0`.
+
+[#boost_regex.basic_regex.op_gt]
+
+   template <class charT, class traits>
+   bool operator > (const basic_regex<charT, traits>& lhs,
+                  const basic_regex<charT, traits>& rhs);
+
+[*Effects]: Returns `lhs.compare(rhs) > 0`.
+
+[note The basic_regex stream inserter is provided on an experimental basis, 
+and outputs the textual representation of the expression to the stream.]
+
+[#boost_regex.basic_regex.op_stream]
+
+   template <class charT, class io_traits, class re_traits>
+   basic_ostream<charT, io_traits>&
+      operator << (basic_ostream<charT, io_traits>& os
+                  const basic_regex<charT, re_traits>& e);
+
+[*Effects]: Returns `(os << e.str())`.
+
+[#boost_regex.basic_regex.op_swap]
+
+   template <class charT, class traits>
+   void swap(basic_regex<charT, traits>& lhs,
+            basic_regex<charT, traits>& rhs);
+
+[*Effects]: calls `lhs.swap(rhs)`.
+
+[endsect]
+

doc/captures.qbk

@@ -0,0 +1,200 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:captures Understanding Marked Sub-Expressions and Captures]
+
+Captures are the iterator ranges that are "captured" by marked 
+sub-expressions as a regular expression gets matched.  Each marked 
+sub-expression can result in more than one capture, if it is matched 
+more than once.  This document explains how captures and marked 
+sub-expressions in Boost.Regex are represented and accessed.
+
+[h4 Marked sub-expressions]
+
+Every time a Perl regular expression contains a parenthesis group `()`, it 
+spits out an extra field, known as a marked sub-expression, 
+for example the expression:
+
+[pre (\w+)\W+(\w+)]
+
+Has two marked sub-expressions (known as $1 and $2 respectively), in 
+addition the complete match is known as $&, everything before the 
+first match as $\`, and everything after the match as $'.  So 
+if the above expression is searched for within `"@abc def--"`, then we obtain:
+
+[table
+[[Sub-expression][Text found]]
+[[$\`]["@"]]
+[[$&]["abc def"]]
+[[$1]["abc"]]
+[[$2]["def"]]
+[[$']["--"]]
+]
+
+In Boost.Regex all these are accessible via the [match_results] class that 
+gets filled in when calling one of the regular expression matching algorithms 
+([regex_search], [regex_match], or [regex_iterator]).  So given:
+
+   boost::match_results<IteratorType> m;
+
+The Perl and Boost.Regex equivalents are as follows:
+
+[table 
+[[Perl][Boost.Regex]]
+[[$\`][`m.prefix()`]]
+[[$&][`m[0]`]]
+[[$n][`m[n]`]]
+[[$\'][`m.suffix()`]]
+]
+
+In Boost.Regex each sub-expression match is represented by a [sub_match] object, 
+this is basically just a pair of iterators denoting the start and end 
+position of the sub-expression match, but there are some additional 
+operators provided so that objects of type [sub_match] behave a lot like a 
+`std::basic_string`: for example they are implicitly convertible to a 
+`basic_string`, they can be compared to a string, added to a string, or 
+streamed out to an output stream.
+
+[h4 Unmatched Sub-Expressions]
+
+When a regular expression match is found there is no need for all of the 
+marked sub-expressions to have participated in the match, for example the expression:
+
+[pre (abc)|(def)]
+
+can match either $1 or $2, but never both at the same time.  In Boost.Regex 
+you can determine which sub-expressions matched by accessing the 
+`sub_match::matched` data member.
+
+[h4 Repeated Captures]
+
+When a marked sub-expression is repeated, then the sub-expression gets 
+"captured" multiple times, however normally only the final capture is available, 
+for example if
+
+[pre (?:(\w+)\W+)+]
+
+is matched against
+
+[pre one fine day]
+
+Then $1 will contain the string "day", and all the previous captures will have 
+been forgotten.
+
+However, Boost.Regex has an experimental feature that allows all the capture 
+information to be retained - this is accessed either via the 
+`match_results::captures` member function or the `sub_match::captures` member 
+function.  These functions return a container that contains a sequence of all 
+the captures obtained during the regular expression matching.  The following 
+example program shows how this information may be used:
+
+   #include <boost/regex.hpp>
+   #include <iostream>
+
+   void print_captures(const std::string& regx, const std::string& text)
+   {
+      boost::regex e(regx);
+      boost::smatch what;
+      std::cout << "Expression:  \"" << regx << "\"\n";
+      std::cout << "Text:        \"" << text << "\"\n";
+      if(boost::regex_match(text, what, e, boost::match_extra))
+      {
+         unsigned i, j;
+         std::cout << "** Match found **\n   Sub-Expressions:\n";
+         for(i = 0; i < what.size(); ++i)
+            std::cout << "      $" << i << " = \"" << what[i] << "\"\n";
+         std::cout << "   Captures:\n";
+         for(i = 0; i < what.size(); ++i)
+         {
+            std::cout << "      $" << i << " = {";
+            for(j = 0; j < what.captures(i).size(); ++j)
+            {
+               if(j)
+                  std::cout << ", ";
+               else
+                  std::cout << " ";
+               std::cout << "\"" << what.captures(i)[j] << "\"";
+            }
+            std::cout << " }\n";
+         }
+      }
+      else
+      {
+         std::cout << "** No Match found **\n";
+      }
+   }
+
+   int main(int , char* [])
+   {
+      print_captures("(([[:lower:]]+)|([[:upper:]]+))+", "aBBcccDDDDDeeeeeeee");
+      print_captures("(.*)bar|(.*)bah", "abcbar");
+      print_captures("(.*)bar|(.*)bah", "abcbah");
+      print_captures("^(?:(\\w+)|(?>\\W+))*$", 
+         "now is the time for all good men to come to the aid of the party");
+      return 0;
+   }
+
+Which produces the following output:
+
+[pre 
+Expression:  "((\[\[:lower:\]\]+)|(\[\[:upper:\]\]+))+"
+Text:        "aBBcccDDDDDeeeeeeee"
+'''**''' Match found '''**'''
+   Sub-Expressions:
+      $0 = "aBBcccDDDDDeeeeeeee"
+      $1 = "eeeeeeee"
+      $2 = "eeeeeeee"
+      $3 = "DDDDD"
+   Captures:
+      $0 = { "aBBcccDDDDDeeeeeeee" }
+      $1 = { "a", "BB", "ccc", "DDDDD", "eeeeeeee" }
+      $2 = { "a", "ccc", "eeeeeeee" }
+      $3 = { "BB", "DDDDD" }
+Expression:  "(.'''*''')bar|(.'''*''')bah"
+Text:        "abcbar"
+'''**''' Match found '''**'''
+   Sub-Expressions:
+      $0 = "abcbar"
+      $1 = "abc"
+      $2 = ""
+   Captures:
+      $0 = { "abcbar" }
+      $1 = { "abc" }
+      $2 = { }
+Expression:  "(.'''*''')bar|(.'''*''')bah"
+Text:        "abcbah"
+'''**''' Match found '''**'''
+   Sub-Expressions:
+      $0 = "abcbah"
+      $1 = ""
+      $2 = "abc"
+   Captures:
+      $0 = { "abcbah" }
+      $1 = { }
+      $2 = { "abc" }
+Expression:  "^(?:(\w+)|(?>\W+))'''*$'''"
+Text:        "now is the time for all good men to come to the aid of the party"
+'''**''' Match found '''**'''
+   Sub-Expressions:
+      $0 = "now is the time for all good men to come to the aid of the party"
+      $1 = "party"
+   Captures:
+      $0 = { "now is the time for all good men to come to the aid of the party" }
+      $1 = { "now", "is", "the", "time", "for", "all", "good", "men", "to", 
+         "come", "to", "the", "aid", "of", "the", "party" }
+]
+
+Unfortunately enabling this feature has an impact on performance 
+(even if you don't use it), and a much bigger impact if you do use it, 
+therefore to use this feature you need to:
+
+* Define BOOST_REGEX_MATCH_EXTRA for all translation units including the library source (the best way to do this is to uncomment this define in boost/regex/user.hpp and then rebuild everything.
+* Pass the match_extra flag to the particular algorithms where you actually need the captures information (regex_search, regex_match, or regex_iterator).
+    
+[endsect]
+

doc/character_class_names.qbk

@@ -0,0 +1,92 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:character_classes Character Class Names]
+
+[section:std_char_classes Character Classes that are Always Supported]
+
+The following character class names are always supported by Boost.Regex:
+
+[table
+[[Name] 	[POSIX-standard name] 	[Description]]
+[[alnum] 	[Yes] 	[Any alpha-numeric character.]]
+[[alpha] 	[Yes] 	[Any alphabetic character.]]
+[[blank] 	[Yes] 	[Any whitespace character that is not a line separator.]]
+[[cntrl] 	[Yes] 	[Any control character.]]
+[[d] 	      [No] 	[Any decimal digit]]
+[[digit] 	[Yes] 	[Any decimal digit.]]
+[[graph] 	[Yes] 	[Any graphical character.]]
+[[l] 	      [No] 	[Any lower case character.]]
+[[lower] 	[Yes] 	[Any lower case character.]]
+[[print] 	[Yes] 	[Any printable character.]]
+[[punct] 	[Yes] 	[Any punctuation character.]]
+[[s] 	      [No] 	[Any whitespace character.]]
+[[space] 	[Yes] 	[Any whitespace character.]]
+[[unicode] 	[No] 	[Any extended character whose code point is above 255 in value.]]
+[[u] 	      [No] 	[Any upper case character.]]
+[[upper] 	[Yes] 	[Any upper case character.]]
+[[w] 	      [No] 	[Any word character (alphanumeric characters plus the underscore).]]
+[[word] 	   [No] 	[Any word character (alphanumeric characters plus the underscore).]]
+[[xdigit] 	[Yes] 	[Any hexadecimal digit character.]]
+]
+
+[endsect]
+
+[section:optional_char_class_names Character classes that are supported by Unicode Regular Expressions]
+
+The following character classes are only supported by Unicode Regular Expressions: 
+that is those that use the `u32regex` type.  The names used are the same as 
+those from Chapter 4 of the Unicode standard.
+
+[table
+[[Short Name] 	[Long Name]]
+[[ ]	[ASCII]]
+[[ ]	[Any]]
+[[ ]	[Assigned]]
+[[C*] 	[Other]]
+[[Cc] 	[Control]]
+[[Cf] 	[Format]]
+[[Cn] 	[Not Assigned]]
+[[Co] 	[Private Use]]
+[[Cs] 	[Surrogate]]
+[[L*] 	[Letter]]
+[[Ll] 	[Lowercase Letter]]
+[[Lm] 	[Modifier Letter]]
+[[Lo] 	[Other Letter]]
+[[Lt] 	[Titlecase]]
+[[Lu] 	[Uppercase Letter]]
+[[M*] 	[Mark]]
+[[Mc] 	[Spacing Combining Mark]]
+[[Me] 	[Enclosing Mark]]
+[[Mn] 	[Non-Spacing Mark]]
+[[N*] 	[Number]]
+[[Nd] 	[Decimal Digit Number]]
+[[Nl] 	[Letter Number]]
+[[No] 	[Other Number]]
+[[P*] 	[Punctuation]]
+[[Pc] 	[Connector Punctuation]]
+[[Pd] 	[Dash Punctuation]]
+[[Pe] 	[Close Punctuation]]
+[[Pf] 	[Final Punctuation]]
+[[Pi] 	[Initial Punctuation]]
+[[Po] 	[Other Punctuation]]
+[[Ps] 	[Open Punctuation]]
+[[S*] 	[Symbol]]
+[[Sc] 	[Currency Symbol]]
+[[Sk] 	[Modifier Symbol]]
+[[Sm] 	[Math Symbol]]
+[[So] 	[Other Symbol]]
+[[Z*] 	[Separator]]
+[[Zl] 	[Line Separator]]
+[[Zp] 	[Paragraph Separator]]
+[[Zs] 	[Space Separator]]
+]
+
+[endsect]
+[endsect]
+

doc/collating_names.qbk

@@ -0,0 +1,128 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:collating_names Collating Names]
+
+[section:digraphs Digraphs]
+
+The following are treated as valid digraphs when used as a collating name:
+
+"ae", "Ae", "AE", "ch", "Ch", "CH", "ll", "Ll", "LL", "ss", "Ss", "SS", "nj", "Nj", "NJ", "dz", "Dz", "DZ", "lj", "Lj", "LJ".
+
+So for example the expression:
+
+[pre \[\[.ae.\]-c\] ]
+
+will match any character that collates between the digraph "ae" and the character "c".
+
+[endsect]
+
+[section:posix_symbolic_names POSIX Symbolic Names]
+
+The following symbolic names are recognised as valid collating element names, 
+in addition to any single character, this allows you to write for example:
+
+[pre \[\[.left-square-bracket.\]\[.right-square-bracket.\]\]]
+
+if you wanted to match either "\[" or "\]".
+
+[table
+[[Name][Character]]
+[[NUL] 	[\\x00]]
+[[SOH] 	[\\x01]]
+[[STX] 	[\\x02]]
+[[ETX] 	[\\x03]]
+[[EOT] 	[\\x04]]
+[[ENQ] 	[\\x05]]
+[[ACK] 	[\\x06]]
+[[alert] 	[\\x07]]
+[[backspace] 	[\\x08]]
+[[tab] 	[\\t]]
+[[newline] 	[\\n]]
+[[vertical-tab] 	[\\v]]
+[[form-feed] 	[\\f]]
+[[carriage-return] 	[\\r]]
+[[SO] 	[\\xE]]
+[[SI] 	[\\xF]]
+[[DLE] 	[\\x10]]
+[[DC1] 	[\\x11]]
+[[DC2] 	[\\x12]]
+[[DC3] 	[\\x13]]
+[[DC4] 	[\\x14]]
+[[NAK] 	[\\x15]]
+[[SYN] 	[\\x16]]
+[[ETB] 	[\\x17]]
+[[CAN] 	[\\x18]]
+[[EM] 	[\\x19]]
+[[SUB] 	[\\x1A]]
+[[ESC] 	[\\x1B]]
+[[IS4] 	[\\x1C]]
+[[IS3] 	[\\x1D]]
+[[IS2] 	[\\x1E]]
+[[IS1] 	[\\x1F]]
+[[space] 	[\\x20]]
+[[exclamation-mark] 	[!]]
+[[quotation-mark] 	["]]
+[[number-sign] 	[#]]
+[[dollar-sign] 	[$]]
+[[percent-sign] 	[%]]
+[[ampersand] 	[&]]
+[[apostrophe] 	[\']]
+[[left-parenthesis] 	[(]]
+[[right-parenthesis] 	[)]]
+[[asterisk] 	[\*]]
+[[plus-sign] 	[+]]
+[[comma] 	[,]]
+[[hyphen] 	[-]]
+[[period] 	[.]]
+[[slash] 	[ / ]]
+[[zero] 	[0]]
+[[one] 	[1]]
+[[two] 	[2]]
+[[three] 	[3]]
+[[four] 	[4]]
+[[five] 	[5]]
+[[six] 	[6]]
+[[seven] 	[7]]
+[[eight] 	[8]]
+[[nine] 	[9]]
+[[colon] 	[\:]]
+[[semicolon] 	[;]]
+[[less-than-sign] 	[<]]
+[[equals-sign] 	[=]]
+[[greater-than-sign] 	[>]]
+[[question-mark] 	[?]]
+[[commercial-at] 	[@]]
+[[left-square-bracket] 	[\[]]
+[[backslash][\\]]
+[[right-square-bracket][\]]]
+[[circumflex][~]]
+[[underscore][_]]
+[[grave-accent][`]]
+[[left-curly-bracket][{]]
+[[vertical-line][|]]
+[[right-curly-bracket][}]]
+[[tilde][~]]
+[[DEL][\\x7F]]
+]
+
+[endsect]
+
+[section:named_unicode Named Unicode Characters]
+
+When using [link boost_regex.unicode Unicode aware regular expressions] (with the `u32regex` type), all 
+the normal symbolic names for Unicode characters (those given in Unidata.txt) 
+are recognised.  So for example:
+
+[pre \[\[.CYRILLIC CAPITAL LETTER I.\]\] ]
+
+would match the Unicode character 0x0418.
+
+[endsect]
+[endsect]
+

doc/concepts.qbk

@@ -0,0 +1,131 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:concepts Concepts]
+
+[section:charT_concept charT Requirements]
+
+Type `charT` used a template argument to class template [basic_regex], 
+must have a trivial default constructor, copy constructor, 
+assignment operator, and destructor.  In addition the following requirements 
+must be met for objects; /c/ of type `charT`, /c1/ and /c2/ of type `charT const`, 
+and /i/ of type `int`:
+
+[table
+[[Expression] 	[Return type] 	[Assertion / Note / Pre- / Post-condition]]
+[[charT c] 	[charT] 	[Default constructor (must be trivial).]]
+[[charT c(c1)] 	[charT] 	[Copy constructor (must be trivial).]]
+[[c1 = c2] 	[charT] 	[Assignment operator (must be trivial).]]
+[[c1 == c2] 	[bool] 	[true if c1 has the same value as c2.]]
+[[c1 != c2] 	[bool] 	[true if c1 and c2 are not equal.]]
+[[c1 < c2]     [bool] 	[true if the value of c1 is less than c2.]]
+[[c1 > c2] 	[bool] 	[true if the value of c1 is greater than c2.]]
+[[c1 <= c2] 	[bool] 	[true if c1 is less than or equal to c2.]]
+[[c1 >= c2] 	[bool] 	[true if c1 is greater than or equal to c2.]]
+[[intmax_t i = c1] 	[int 	] [charT must be convertible to an integral type.
+
+Note: type charT is not required to support this operation, if the traits class used supports the full Boost-specific interface, rather than the minimal standardised-interface (see traits class requirements below).]]
+[[charT c(i);] 	[charT] 	[charT must be constructable from an integral type.]]
+]
+
+[endsect]
+
+[section:traits_concept Traits Class Requirements]
+
+There are two sets of requirements for the `traits` template argument to 
+[basic_regex]: a minimal interface (which is part of the regex standardization proposal), 
+and an optional Boost-specific enhanced interface.
+
+[h4 Minimal requirements.]
+
+In the following table `X` denotes a traits class defining types and functions for 
+the character container type `charT`; /u/ is an object of type `X`; /v/ is 
+an object of type `const X`; /p/ is a value of type `const charT*`; 
+/I1/ and /I2/ are Input Iterators; /c/ is a value of type `const charT`; 
+/s/ is an object of type `X::string_type`; /cs/ is an object of type 
+`const X::string_type`; /b/ is a value of type `bool`; /I/ is a value of 
+type `int`; /F1/ and /F2/ are values of type `const charT*`; and /loc/ is 
+an object of type `X::locale_type`.
+
+[table
+[[Expression][Return type][Assertion / Note Pre / Post condition]]
+[[X::char_type][charT][The character container type used in the implementation of class template basic_regex.]]
+[[X::size_type][][An unsigned integer type, capable of holding the length of a null-terminated string of charT's.]]
+[[X::string_type][std::basic_string<charT> or std::vector<charT>][]]
+[[X::locale_type][Implementation defined][A copy constructible type that represents the locale used by the traits class.]]
+[[X::char_class_type]
+   [Implementation defined]
+   [A bitmask type representing a particular character classification. Multiple values of this type can be bitwise-or'ed together to obtain a new valid value.]]
+[[X::length(p)][X::size_type][Yields the smallest i such that p\[i\] == 0. Complexity is linear in i.]]
+[[v.translate(c)]
+   [X::char_type]
+   [Returns a character such that for any character d that is to be considered equivalent to c then v.translate(c) == v.translate(d).]]
+[[v.translate_nocase(c)]
+   [X::char_type]
+   [For all characters C that are to be considered equivalent to c when comparisons are to be performed without regard to case, then v.translate_nocase(c) == v.translate_nocase(C).]]
+[[v.transform(F1, F2)]
+   [X::string_type]
+   [Returns a sort key for the character sequence designated by the iterator range \[F1, F2) such that if 
+   the character sequence \[G1, G2) sorts before the character sequence \[H1, H2) then 
+   v.transform(G1, G2) < v.transform(H1, H2). ]]
+[[v.transform_primary(F1, F2)]
+   [X::string_type]
+   [Returns a sort key for the character sequence designated by the iterator range \[F1, F2) such that if the 
+   character sequence \[G1, G2) sorts before the character sequence \[H1, H2) when character case is not considered 
+   then v.transform_primary(G1, G2) < v.transform_primary(H1, H2).]]
+[[v.lookup_classname(F1, F2)]
+   [X::char_class_type]
+   [Converts the character sequence designated by the iterator range \[F1,F2) into a bitmask type that can subsequently 
+   be passed to isctype. Values returned from lookup_classname can be safely bitwise or'ed together. Returns 0 if the 
+   character sequence is not the name of a character class recognized by X. The value returned shall be independent 
+   of the case of the characters in the sequence.]]
+[[v.lookup_collatename(F1, F2)]
+   [X::string_type]
+   [Returns a sequence of characters that represents the collating element consisting of the character sequence designated 
+   by the iterator range \[F1, F2). Returns an empty string if the character sequence is not a valid collating element.]]
+[[v.isctype(c, v.lookup_classname (F1, F2))][bool][Returns true if character c is a member of the character class designated by the iterator range \[F1, F2), false otherwise.]]
+[[v.value(c, I)]
+   [int]
+   [Returns the value represented by the digit c in base I if the character c is a valid digit in base I; otherwise returns -1. \[Note: the value of I will only be 8, 10, or 16. -end note\]]]
+[[u.imbue(loc)][X::locale_type][Imbues u with the locale loc, returns the previous locale used by u if any. ]]
+[[v.getloc()][X::locale_type][Returns the current locale used by v if any. ]]
+]
+
+[h4 Additional Optional Requirements]
+
+The following additional requirements are strictly optional, 
+however in order for [basic_regex] to take advantage of these additional 
+interfaces, all of the following requirements must be met; [basic_regex] 
+will detect the presence or absence of the member `boost_extensions_tag` and 
+configure itself appropriately.
+
+
+[table 
+[[Expression][Result][Assertion / Note Pre / Post condition]]
+[[X::boost_extensions_tag][An unspecified type.][When present, all of the extensions listed in this table must be present.]]
+[[v.syntax_type(c)][regex_constants::syntax_type][Returns a symbolic value of type regex_constants::syntax_type that signifies the meaning of character c within the regular expression grammar.]]
+[[v.escape_syntax_type(c)][regex_constants::escape_syntax_type][Returns a symbolic value of type regex_constants::escape_syntax_type, that signifies the meaning of character c within the regular expression grammar, when c has been preceded by an escape character. Precondition: if b is the character preceding c in the expression being parsed then: `v.syntax_type(b) == syntax_escape`]]
+[[v.translate(c, b)][X::char_type][Returns a character d such that: for any character d that is to be considered equivalent to c then `v.translate(c,false)==v.translate(d,false)`. Likewise for all characters C that are to be considered equivalent to c when comparisons are to be performed without regard to case, then `v.translate(c,true)==v.translate(C,true)`.]]
+[[v.toi(I1, I2, i)][An integer type capable of holding either a charT or an int.][Behaves as follows: if `p == q` or if `*p` is not a digit character then returns -1. Otherwise performs formatted numeric input on the sequence \[p,q) and returns the result as an int. Postcondition: either p == q or *p is a non-digit character.]]
+[[v.error_string(I)][std::string][Returns a human readable error string for the error condition i, where i is one of the values enumerated by type regex_constants::error_type.  If the value /I/ is not recognized then returns the string "Unknown error" or a localized equivalent.]]
+[[v.tolower(c)][X::char_type][Converts c to lower case, used for Perl-style \l and \L formatting operations.]]
+[[v.toupper(c)][X::char_type][Converts c to upper case, used for Perl-style \u and \U formatting operations.]]
+]
+
+[endsect]
+
+[section:iterator_concepts Iterator Requirements]
+
+The regular expression algorithms (and iterators) take all require a 
+Bidirectional-Iterator.
+
+[endsect]
+
+[endsect]
+
+

doc/configuration.qbk

@@ -0,0 +1,71 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:configuration Configuration]
+
+[section:compiler Compiler Setup]
+
+You shouldn't need to do anything special to configure Boost.Regex for use 
+with your compiler - the [@../../../config/index.html Boost.Config subsystem] should already take care of it, 
+if you do have problems (or you are using a particularly obscure compiler 
+or platform) then [@../../../config/index.html Boost.Config] has a configure script that you can run.
+
+[endsect]
+
+[section:standalone Use in Standalone Mode (without the rest of Boost)]
+
+This library may now be used in "standalone" mode without the rest of the Boost C++ libraries,
+in order to do this you must either:
+
+* Have a C++17 compiler that supports `__has_include`, in this case if `<boost/config.hpp>` is *not* present
+then the library will automoatically enter standalone mode.  Or:
+* Define BOOST_REGEX_STANDALONE when building.
+
+The main difference between the 2 modes, is that when Boost.Config is present the library will automatically
+configure itself around various compiler defects.  In particular in order to use the library with exception support
+turned off, you will either need a copy of Boost.Config in your include path, or else manually define BOOST_NO_EXCEPTIONS
+when building.
+
+[endsect]
+
+[section:locale Locale and traits class selection]
+
+The following macros (see [@../../../../boost/regex/user.hpp user.hpp]) control how Boost.Regex interacts with 
+the user's locale:
+
+[table
+[[macro][description]]
+[[BOOST_REGEX_USE_C_LOCALE][Forces Boost.Regex to use the global C locale in its traits class support: this is now deprecated in favour of the C++ locale.]]
+[[BOOST_REGEX_USE_CPP_LOCALE][Forces Boost.Regex to use std::locale in it's default traits class, regular expressions can then be imbued with an instance specific locale.  This is the default behaviour on non-Windows platforms.]]
+[[BOOST_REGEX_NO_W32][Tells Boost.Regex not to use any Win32 API's even when available (implies BOOST_REGEX_USE_CPP_LOCALE unless BOOST_REGEX_USE_C_LOCALE is set).]]
+]
+
+[endsect]
+
+[section:tuning Algorithm Tuning]
+
+[table
+[[macro][description]]
+[[BOOST_REGEX_BLOCKSIZE][Boost.Regex uses largish blocks of memory to act as a stack for the state machine, the larger the block size then the fewer allocations that will take place.  This defaults to 4096 bytes, which is large enough to match the vast majority of regular expressions without further allocations, however, you can choose smaller or larger values depending upon your platforms characteristics.]]
+[[BOOST_REGEX_MAX_BLOCKS][Tells Boost.Regex how many blocks of size BOOST_REGEX_BLOCKSIZE it is permitted to use.  If this value is exceeded then Boost.Regex will stop trying to find a match and throw a std::runtime_error.  Defaults to 1024, don't forget to tweak this value if you alter BOOST_REGEX_BLOCKSIZE by much.]]
+[[BOOST_REGEX_MAX_CACHE_BLOCKS][Tells Boost.Regex how many memory blocks to store in 
+         it's internal cache - memory blocks are taken from this cache rather than by calling 
+         ::operator new.  Generally speaking this can be an order of magnitude faster than 
+         calling ::opertator new each time a memory block is required, but has the 
+         downside that Boost.Regex can end up caching a large chunk of memory (by default 
+         up to 16 blocks each of BOOST_REGEX_BLOCKSIZE size).  If memory is tight then try 
+         defining this to 0 (disables all caching), or if that is too slow, then a value of 
+         1 or 2, may be sufficient.  On the other hand, on large multi-processor, 
+multi-threaded systems, you may find that a higher value is in order.]]
+]
+
+[endsect]
+
+[endsect]
+
+

doc/error_type.qbk

@@ -0,0 +1,63 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:error_type error_type]
+
+[h4 Synopsis]
+
+Type error type represents the different types of errors that can be raised 
+by the library when parsing a regular expression.
+
+   namespace boost{ namespace regex_constants{
+
+   typedef implementation-specific-type error_type;
+
+   static const error_type error_collate;
+   static const error_type error_ctype;
+   static const error_type error_escape;
+   static const error_type error_backref;
+   static const error_type error_brack;
+   static const error_type error_paren;
+   static const error_type error_brace;
+   static const error_type error_badbrace;
+   static const error_type error_range;
+   static const error_type error_space;
+   static const error_type error_badrepeat;
+   static const error_type error_complexity;
+   static const error_type error_stack;
+   static const error_type error_bad_pattern;
+
+   } // namespace regex_constants
+   } // namespace boost
+
+ 
+[h4 Description]
+
+The type `error_type` is an implementation-specific enumeration type that may 
+take one of the following values:
+
+[table
+[[Constant][Meaning]]
+[[error_collate][An invalid collating element was specified in a \[\[.name.\]\] block.]]
+[[error_ctype][An invalid character class name was specified in a \[\[:name:\]\] block.]]
+[[error_escape][An invalid or trailing escape was encountered.]]
+[[error_backref][A back-reference to a non-existant marked sub-expression was encountered.]]
+[[error_brack][An invalid character set \[...\] was encountered.]]
+[[error_paren][Mismatched '(' and ')'.]]
+[[error_brace][Mismatched '{' and '}'.]]
+[[error_badbrace][Invalid contents of a {...} block.]]
+[[error_range][A character range was invalid, for example \[d-a\].]]
+[[error_space][Out of memory.]]
+[[error_badrepeat][An attempt to repeat something that can not be repeated - for example a*+]]
+[[error_complexity][The expression became too complex to handle.]]
+[[error_stack][Out of program stack space.]]
+[[error_bad_pattern][Other unspecified errors.]]
+]
+
+[endsect]
+

doc/examples.qbk

@@ -0,0 +1,128 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:examples Test and Example Programs]
+
+[h4 Test Programs]
+
+[*regress:]
+
+A regression test application that gives the matching/searching algorithms a 
+full workout. The presence of this program is your guarantee that the 
+library will behave as claimed - at least as far as those items tested 
+are concerned - if anyone spots anything that isn't being tested I'd be 
+glad to hear about it.
+
+Files:
+
+* [@../../test/regress/main.cpp main.cpp]
+* [@../../test/regress/basic_tests.cpp basic_tests.cpp]
+* [@../../test/regress/test_alt.cpp test_alt.cpp]
+* [@../../test/regress/test_anchors.cpp test_anchors.cpp]
+* [@../../test/regress/test_asserts.cpp test_asserts.cpp]
+* [@../../test/regress/test_backrefs.cpp test_backrefs.cpp]
+* [@../../test/regress/test_deprecated.cpp test_deprecated.cpp]
+* [@../../test/regress/test_emacs.cpp test_emacs.cpp]
+* [@../../test/regress/test_escapes.cpp test_escapes.cpp]
+* [@../../test/regress/test_grep.cpp test_grep.cpp]
+* [@../../test/regress/test_icu.cpp test_icu.cpp]
+* [@../../test/regress/test_locale.cpp test_locale.cpp]
+* [@../../test/regress/test_mfc.cpp test_mfc.cpp]
+* [@../../test/regress/test_non_greedy_repeats.cpp test_non_greedy_repeats.cpp]
+* [@../../test/regress/test_operators.cpp test_operators.cpp]
+* [@../../test/regress/test_overloads.cpp test_overloads.cpp]
+* [@../../test/regress/test_perl_ex.cpp test_perl_ex.cpp]
+* [@../../test/regress/test_replace.cpp test_replace.cpp]
+* [@../../test/regress/test_sets.cpp test_sets.cpp]
+* [@../../test/regress/test_simple_repeats.cpp test_simple_repeats.cpp]
+* [@../../test/regress/test_tricky_cases.cpp test_tricky_cases.cpp]
+* [@../../test/regress/test_unicode.cpp test_unicode.cpp]
+
+[*bad_expression_test:]
+
+Verifies that "bad" regular expressions don't cause the matcher to go into 
+infinite loops, but to throw an exception instead.
+
+Files: [@../../test/pathology/bad_expression_test.cpp bad_expression_test.cpp].
+
+[*recursion_test:]
+
+Verifies that the matcher can't overrun the stack (no matter what the expression).
+
+Files: [@../../test/pathology/recursion_test.cpp recursion_test.cpp].
+
+[*concepts:]
+
+Verifies that the library meets all documented concepts (a compile only test).
+
+Files: [@../../test/concepts/concept_check.cpp concept_check.cpp].
+
+[*captures_test:]
+
+Test code for captures.
+
+Files: [@../../test/captures/captures_test.cpp captures_test.cpp].
+
+[h4 Example programs]
+
+[*grep]
+
+A simple grep implementation, run with the -h command line option to find out its usage.
+
+Files: [@../../example/grep/grep.cpp grep.cpp]
+
+[*timer.exe]
+
+A simple interactive expression matching application, the results of all 
+matches are timed, allowing the programmer to optimize their regular expressions 
+where performance is critical.
+
+Files: [@../../example/timer/regex_timer.cpp regex_timer.cpp].
+
+[h4 Code snippets]
+
+The snippets examples contain the code examples used in the documentation:
+
+[@../../example/snippets/captures_example.cpp captures_example.cpp]: Demonstrates the use of captures.
+
+[@../../example/snippets/credit_card_example.cpp credit_card_example.cpp]: Credit card number formatting code.
+
+[@../../example/snippets/partial_regex_grep.cpp partial_regex_grep.cpp]: Search example using partial matches.
+
+[@../../example/snippets/partial_regex_match.cpp partial_regex_match.cpp]: regex_match example using partial matches.
+
+[@../../example/snippets/regex_iterator_example.cpp regex_iterator_example.cpp]: Iterating through a series of matches.
+
+[@../../example/snippets/regex_match_example.cpp regex_match_example.cpp]: ftp based regex_match example.
+
+[@../../example/snippets/regex_merge_example.cpp regex_merge_example.cpp]: regex_merge example: converts a C++ file to syntax highlighted HTML.
+
+[@../../example/snippets/regex_replace_example.cpp regex_replace_example.cpp]: regex_replace example: converts a C++ file to syntax highlighted HTML
+
+[@../../example/snippets/regex_search_example.cpp regex_search_example.cpp]: regex_search example: searches a cpp file for class definitions.
+
+[@../../example/snippets/regex_token_iterator_eg_1.cpp regex_token_iterator_eg_1.cpp]: split a string into a series of tokens.
+
+[@../../example/snippets/regex_token_iterator_eg_2.cpp regex_token_iterator_eg_2.cpp]: enumerate the linked URL's in a HTML file.
+
+The following are deprecated:
+
+[@../../example/snippets/regex_grep_example_1.cpp regex_grep_example_1.cpp]: regex_grep example 1: searches a cpp file for class definitions.
+
+[@../../example/snippets/regex_grep_example_2.cpp regex_grep_example_2.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a global callback function.
+
+[@../../example/snippets/regex_grep_example_3.cpp regex_grep_example_3.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a bound member function callback.
+
+[@../../example/snippets/regex_grep_example_4.cpp regex_grep_example_4.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a C++ Builder closure as a callback.
+
+[@../../example/snippets/regex_split_example_1.cpp regex_split_example_1.cpp]: regex_split example: split a string into tokens.
+
+[@../../example/snippets/regex_split_example_2.cpp regex_split_example_2.cpp] : regex_split example: spit out linked URL's.
+
+[endsect]
+

doc/faq.qbk

@@ -0,0 +1,98 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+[section:faq FAQ]
+
+[*Q.] I can't get regex++ to work with escape characters, what's going on?
+
+[*A.] If you embed regular expressions in C++ code, then remember that escape 
+characters are processed twice: once by the C++ compiler, and once by the 
+Boost.Regex expression compiler, so to pass the regular expression \d+ 
+to Boost.Regex, you need to embed "\\d+" in your code. Likewise to match a 
+literal backslash you will need to embed "\\\\" in your code.
+
+[*Q.] No matter what I do regex_match always returns false, what's going on?
+
+[*A.] The algorithm regex_match only succeeds if the expression matches *all*
+of the text, if you want to *find* a sub-string within the text that matches
+the expression then use regex_search instead.
+
+[*Q.] Why does using parenthesis in a POSIX regular expression change the 
+result of a match?
+
+[*A.] For POSIX (extended and basic) regular expressions, but not for perl regexes, 
+parentheses don't only mark; they determine what the best match is as well. 
+When the expression is compiled as a POSIX basic or extended regex then Boost.Regex 
+follows the POSIX standard leftmost longest rule for determining what matched. 
+So if there is more than one possible match after considering the whole expression, 
+it looks next at the first sub-expression and then the second sub-expression 
+and so on. So...
+
+"'''(0*)([0-9]*)'''" against "00123" would produce
+$1 = "00"
+$2 = "123"
+
+where as
+
+"0*([0-9])*" against "00123" would produce
+$1 = "00123"
+
+If you think about it, had $1 only matched the "123", this would be "less good" 
+than the match "00123" which is both further to the left and longer. If you 
+want $1 to match only the "123" part, then you need to use something like:
+
+"0*([1-9][0-9]*)"
+
+as the expression.
+
+[*Q.] Why don't character ranges work properly (POSIX mode only)?
+
+[*A.] The POSIX standard specifies that character range expressions are 
+locale sensitive - so for example the expression [A-Z] will match any 
+collating element that collates between 'A' and 'Z'. That means that for 
+most locales other than "C" or "POSIX", [A-Z] would match the single 
+character 't' for example, which is not what most people expect - or 
+at least not what most people have come to expect from regular 
+expression engines. For this reason, the default behaviour of Boost.Regex 
+(perl mode) is to turn locale sensitive collation off by not setting the 
+`regex_constants::collate` compile time flag. However if you set a non-default 
+compile time flag - for example `regex_constants::extended` or 
+`regex_constants::basic`, then locale dependent collation will be enabled, 
+this also applies to the POSIX API functions which use either 
+`regex_constants::extended` or `regex_constants::basic` internally. 
+[Note - when `regex_constants::nocollate` in effect, the library behaves 
+"as if" the LC_COLLATE locale category were always "C", regardless of what 
+its actually set to - end note].
+
+[*Q.] Why are there no throw specifications on any of the functions? 
+What exceptions can the library throw?
+
+[*A.] Not all compilers support (or honor) throw specifications, others 
+support them but with reduced efficiency. Throw specifications may be added 
+at a later date as compilers begin to handle this better. The library 
+should throw only three types of exception: [boost::regex_error] can be 
+thrown by [basic_regex] when compiling a regular expression, `std::runtime_error` 
+can be thrown when a call to `basic_regex::imbue` tries to open a message 
+catalogue that doesn't exist, or when a call to [regex_search] or [regex_match] 
+results in an "everlasting" search, or when a call to `RegEx::GrepFiles` or 
+`RegEx::FindFiles` tries to open a file that cannot be opened, finally 
+`std::bad_alloc` can be thrown by just about any of the functions in this library.
+
+[*Q.] Why can't I use the "convenience" versions of regex_match / 
+regex_search / regex_grep / regex_format / regex_merge?
+
+[*A.] These versions may or may not be available depending upon the 
+capabilities of your compiler, the rules determining the format of 
+these functions are quite complex - and only the versions visible to 
+a standard compliant compiler are given in the help. To find out 
+what your compiler supports, run <boost/regex.hpp> through your 
+C++ pre-processor, and search the output file for the function 
+that you are interested in.  Note however, that very few current
+compilers still have problems with these overloaded functions.
+
+[endsect]
+

doc/format_boost_syntax.qbk

@@ -0,0 +1,102 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:boost_format_syntax Boost-Extended Format String Syntax]
+
+Boost-Extended format strings treat all characters as literals except for 
+'$', '\\', '(', ')', '?', and ':'.
+
+[h4 Grouping]
+
+The characters '(' and ')' perform lexical grouping, so use \\( and \\) if you 
+want a to output literal parenthesis.
+
+[h4 Conditionals]
+
+The character '?' begins a conditional expression, the general form is:
+
+?Ntrue-expression:false-expression
+
+where N is decimal digit.
+
+If sub-expression N was matched, then true-expression is evaluated and sent to 
+output, otherwise false-expression is evaluated and sent to output.
+
+You will normally need to surround a conditional-expression with parenthesis in 
+order to prevent ambiguities.
+
+For example, the format string "(?1foo:bar)" will replace each match found with "foo" if
+the sub-expression $1 was matched, and with "bar" otherwise.
+
+For sub-expressions with an index greater than 9, or for access to named sub-expressions use:
+
+?{INDEX}true-expression:false-expression
+
+or
+
+?{NAME}true-expression:false-expression
+
+
+[h4 Placeholder Sequences]
+
+Placeholder sequences specify that some part of what matched the regular expression 
+should be sent to output as follows:
+
+[table
+[[Placeholder][Meaning]]
+[[$&][Outputs what matched the whole expression.]]
+[[$MATCH][As $&]]
+[[${^MATCH}][As $&]]
+[[$\`][Outputs the text between the end of the last match found (or the 
+      start of the text if no previous match was found), and the start 
+      of the current match.]]
+[[$PREMATCH][As $\`]]
+[[${^PREMATCH}][As $\`]]
+[[$'][Outputs all the text following the end of the current match.]]
+[[$POSTMATCH][As $']]
+[[${^POSTMATCH}][As $']]
+[[$+][Outputs what matched the last marked sub-expression in the regular expression.]]
+[[$LAST_PAREN_MATCH][As $+]]
+[[$LAST_SUBMATCH_RESULT][Outputs what matched the last sub-expression to be actually matched.]]
+[[$^N][As $LAST_SUBMATCH_RESULT]]
+[[$$][Outputs a literal '$']]
+[[$n][Outputs what matched the n'th sub-expression.]]
+[[${n}][Outputs what matched the n'th sub-expression.]]
+[[$+{NAME}][Outputs whatever matched the sub-expression named "NAME".]]
+]
+
+Any $-placeholder sequence not listed above, results in '$' being treated as a literal.
+
+[h4 Escape Sequences]
+
+An escape character followed by any character x, outputs that character unless 
+x is one of the escape sequences shown below.
+
+[table
+[[Escape][Meaning]]
+[[\\a][Outputs the bell character: '\\a'.]]
+[[\\e][Outputs the ANSI escape character (code point 27).]]
+[[\\f][Outputs a form feed character: '\\f']]
+[[\\n][Outputs a newline character: '\\n'.]]
+[[\\r][Outputs a carriage return character: '\\r'.]]
+[[\\t][Outputs a tab character: '\\t'.]]
+[[\\v][Outputs a vertical tab character: '\\v'.]]
+[[\\xDD][Outputs the character whose hexadecimal code point is 0xDD]]
+[[\\x{DDDD}][Outputs the character whose hexadecimal code point is 0xDDDDD]]
+[[\\cX][Outputs the ANSI escape sequence "escape-X".]]
+[[\\D][If D is a decimal digit in the range 1-9, then outputs the text that matched sub-expression D.]]
+[[\\l][Causes the next character to be outputted, to be output in lower case.]]
+[[\\u][Causes the next character to be outputted, to be output in upper case.]]
+[[\\L][Causes all subsequent characters to be output in lower case, until a \\E is found.]]
+[[\\U][Causes all subsequent characters to be output in upper case, until a \\E is found.]]
+[[\\E][Terminates a \\L or \\U sequence.]]
+]
+
+[endsect]
+
+

doc/format_perl_syntax.qbk

@@ -0,0 +1,69 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:perl_format Perl Format String Syntax]
+
+Perl-style format strings treat all characters as literals except 
+'$' and '\\' which start placeholder and escape sequences respectively.
+
+Placeholder sequences specify that some part of what matched the regular expression 
+should be sent to output as follows:
+
+[table
+[[Placeholder][Meaning]]
+[[$&][Outputs what matched the whole expression.]]
+[[$MATCH][As $&]]
+[[${^MATCH}][As $&]]
+[[$\`][Outputs the text between the end of the last match found (or the 
+      start of the text if no previous match was found), and the start 
+      of the current match.]]
+[[$PREMATCH][As $\`]]
+[[${^PREMATCH}][As $\`]]
+[[$'][Outputs all the text following the end of the current match.]]
+[[$POSTMATCH][As $']]
+[[${^POSTMATCH}][As $']]
+[[$+][Outputs what matched the last marked sub-expression in the regular expression.]]
+[[$LAST_PAREN_MATCH][As $+]]
+[[$LAST_SUBMATCH_RESULT][Outputs what matched the last sub-expression to be actually matched.]]
+[[$^N][As $LAST_SUBMATCH_RESULT]]
+[[$$][Outputs a literal '$']]
+[[$n][Outputs what matched the n'th sub-expression.]]
+[[${n}][Outputs what matched the n'th sub-expression.]]
+[[$+{NAME}][Outputs whatever matched the sub-expression named "NAME".]]
+]
+
+Any $-placeholder sequence not listed above, results in '$' being treated 
+as a literal.
+
+An escape character followed by any character x, outputs that character unless 
+x is one of the escape sequences shown below.
+
+
+[table
+[[Escape][Meaning]]
+[[\\a][Outputs the bell character: '\\a'.]]
+[[\\e][Outputs the ANSI escape character (code point 27).]]
+[[\\f][Outputs a form feed character: '\\f']]
+[[\\n][Outputs a newline character: '\\n'.]]
+[[\\r][Outputs a carriage return character: '\\r'.]]
+[[\\t][Outputs a tab character: '\\t'.]]
+[[\\v][Outputs a vertical tab character: '\\v'.]]
+[[\\xDD][Outputs the character whose hexadecimal code point is 0xDD]]
+[[\\x{DDDD}][Outputs the character whose hexadecimal code point is 0xDDDDD]]
+[[\\cX][Outputs the ANSI escape sequence "escape-X".]]
+[[\\D][If D is a decimal digit in the range 1-9, then outputs the text that matched sub-expression D.]]
+[[\\l][Causes the next character to be outputted, to be output in lower case.]]
+[[\\u][Causes the next character to be outputted, to be output in upper case.]]
+[[\\L][Causes all subsequent characters to be output in lower case, until a \\E is found.]]
+[[\\U][Causes all subsequent characters to be output in upper case, until a \\E is found.]]
+[[\\E][Terminates a \\L or \\U sequence.]]
+]
+
+[endsect]
+
+

doc/format_sed_syntax.qbk

@@ -0,0 +1,41 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:sed_format Sed Format String Syntax]
+
+Sed-style format strings treat all characters as literals except:
+
+[table
+[[character][description]]
+[[&][The ampersand character is replaced in the output stream by 
+   the whole of what matched the regular expression.  Use
+   \\& to output a literal '&' character.]]
+[[\\][Specifies an escape sequence.]]
+]
+
+An escape character followed by any character x, outputs that character unless x 
+is one of the escape sequences shown below.
+
+[table
+[[Escape][Meaning]]
+[[\\a][Outputs the bell character: '\\a'.]]
+[[\\e][Outputs the ANSI escape character (code point 27).]]
+[[\\f][Outputs a form feed character: '\\f']]
+[[\\n][Outputs a newline character: '\\n'.]]
+[[\\r][Outputs a carriage return character: '\\r'.]]
+[[\\t][Outputs a tab character: '\\t'.]]
+[[\\v][Outputs a vertical tab character: '\\v'.]]
+[[\\xDD][Outputs the character whose hexadecimal code point is 0xDD]]
+[[\\x{DDDD}][Outputs the character whose hexadecimal code point is 0xDDDDD]]
+[[\\cX][Outputs the ANSI escape sequence "escape-X".]]
+[[\\D][If D is a decimal digit in the range 1-9, then outputs the text that matched sub-expression D.]]
+]
+
+[endsect]
+
+

doc/format_syntax.qbk

@@ -0,0 +1,26 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:format Search and Replace Format String Syntax]
+
+Format strings are used by the algorithm [regex_replace] and by 
+[match_results_format], and are used to transform one string into another.
+
+There are three kind of format string: [sed_format], [perl_format] and [boost_extended_format].
+
+Alternatively, when the flag `format_literal` is passed to one of these functions, 
+then the format string is treated as a string literal, and is copied unchanged 
+to the output.
+
+[include format_sed_syntax.qbk]
+[include format_perl_syntax.qbk]
+[include format_boost_syntax.qbk]
+
+[endsect]
+
+

doc/further_info.qbk

@@ -0,0 +1,35 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:futher References and Further Information]
+
+The main Perl regular expression tutorial can be found [@http://perldoc.perl.org/perlretut.html here], 
+there's a much shorter summary of the main features [@https://www.cs.tut.fi/~jkorpela/perl/regexp.html here].
+
+The main book on regular expressions is 
+[@http://www.oreilly.com/catalog/regex/ Mastering Regular Expressions, published by O'Reilly].
+
+Boost.Regex forms the basis for the regular expression chapter of the [tr1].
+
+The [@http://www.opengroup.org/onlinepubs/7908799/toc.htm Open Unix Specification] 
+contains a wealth of useful material, 
+including the POSIX regular expression syntax.
+
+The [@http://www.cs.ucr.edu/~stelo/pattern.html Pattern Matching Pointers] 
+site is a "must visit" resource for anyone interested in pattern matching.
+
+[@http://glimpse.cs.arizona.edu/ Glimpse and Agrep], use a simplified 
+regular expression syntax to achieve faster search times.
+
+[@http://glimpse.cs.arizona.edu/udi.html Udi Manber] 
+and [@http://www.dcc.uchile.cl/~rbaeza/ Ricardo Baeza-Yates] both have a 
+selection of useful pattern matching papers available from their respective web sites.
+
+[endsect]
+
+

doc/headers.qbk

@@ -0,0 +1,22 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:headers Headers]
+
+There are two main headers used by this library: `<boost/regex.hpp>` 
+provides full access to the main template library, while `<boost/cregex.hpp>` 
+provides access to the (deprecated) high level class RegEx, and the 
+POSIX API functions.
+
+There is also a header containing only forward declarations 
+`<boost/regex_fwd.hpp>` for use when an interface is dependent upon 
+[basic_regex], but otherwise does not need the full definitions.
+
+[endsect]
+
+

doc/history.qbk

@@ -0,0 +1,236 @@
+[/ 
+  Copyright 2006-2007 John Maddock.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt).
+]
+
+
+[section:history History]
+
+New issues should be submitted at [@https://github.com/boostorg/regex/issues https://github.com/boostorg/regex/issues]
+
+Currently open issues can be viewed [@https://github.com/boostorg/regex/issues?q=is%3Aopen+is%3Aissue here].
+
+All issues including closed ones can be viewed [@https://github.com/boostorg/regex/issues?q=is%3Aissue+is%3Aclosed here].
+
+[h4 Boost.Regex-7.0.1 (boost-1.79.0)]
+
+* Minor fix for setting building with -DBOOST_REGEX_MAX_CACHE_BLOCKS=0 and `<atomic>` present.
+
+[h4 Boost.Regex-7.0.0 (Boost-1.78.0)]
+
+* [*Breaking Change:] Change \B to be the opposite of \b as per Perl behaviour.
+* Change w32_regex_traits.hpp so that windows.h is no longer included. 
+* Fxed fuzzing related issues [@https://github.com/boostorg/regex/issues/156 #151], [@https://github.com/boostorg/regex/issues/156 #152], [@https://github.com/boostorg/regex/issues/156 #153], [@https://github.com/boostorg/regex/issues/156 #156].
+
+[h4 Boost.Regex-6.0.0 (Boost-1.77.0)]
+
+* Big change to header only library.
+* Deprecate C++03 support.
+
+[h4 Boost.Regex-5.1.4 (Boost-172.0)]
+
+* Minor build fixes, see [@https://github.com/boostorg/regex/issues/89 #89].
+
+[h4 Boost.Regex-5.1.3 (Boost-1.64.0)]
+
+* Compiling with Oracle C++ toolset is no longer restricted to static linking.
+* Big effort to de-fuzz the library using libFuzzer and fix identified issues, see:  [@https://svn.boost.org/trac/boost/ticket/12818 #12818].
+
+[h4 Boost.Regex-5.1.2 (Boost-1.62.0)]
+
+
+* Fix buffer over-run error when parsing certain invalid regexes, see [@https://svn.boost.org/trac/boost/ticket/12222 #12222].
+* Fix detection of ICU in library build, see [@https://svn.boost.org/trac/boost/ticket/12152 #12152].
+* Fix bug in case sensitivity change, see [@https://svn.boost.org/trac/boost/ticket/11940 #11940].
+* Allow types wider than int in `\x{}` expressions (for char32_t etc), see [@https://svn.boost.org/trac/boost/ticket/11988 #11988].
+
+[h4 Boost.Regex-5.1.1 (Boost-1.61.0)]
+
+* Change to lockfree implementation of memory cache, see [@https://github.com/boostorg/regex/pull/23 PR#23].
+
+[h4 Boost.Regex-5.1.0 (Boost-1.60.0)]
+
+* Add support for Perl's backtracking control verbs, see [@https://svn.boost.org/trac/boost/ticket/11205 #11205].  Note however, that
+(*MARK) and operations on marks are not currently supported.
+* Fix incorrect range end when matching \[\[:unicode:\]\], see [@https://svn.boost.org/trac/boost/ticket/11524 #11524].
+* Change POSIX reg_comp API to not check potentially uninitialized memory, note that code which was previously free from memory
+leaks (but none the less buggy, as it didn't call reg_free) will now leak.  See [@https://svn.boost.org/trac/boost/ticket/11472 #11472].
+* Make sub_match a valid C++ range type, see [@https://svn.boost.org/trac/boost/ticket/11036 #11036].
+
+[h4 Boost.Regex-5.0.1 (Boost-1.58.0)]
+
+* Fixed some typos as in [@https://svn.boost.org/trac/boost/ticket/10682 #10682].
+* Merged [@https://github.com/boostorg/regex/pull/6 pull-request #6] for Coverity warnings.
+* Merged [@https://github.com/boostorg/regex/pull/7 pull-request #7] for Coverity warnings.
+* Merged [@https://github.com/boostorg/regex/pull/8 pull-request #8] for Coverity warnings.
+* Merged [@https://github.com/boostorg/regex/pull/10 pull-request #10] to enable more build variants when linking to ICU.
+* Fix issue with ICU and partial matches, see [@https://svn.boost.org/trac/boost/ticket/10114 #10114].
+* Removed delayload support for the ICU libraries: this doesn't work with the latest ICU releases (linker errors).
+
+
+[h4 Boost.Regex-5.0.0 (Boost-1.56.0)]
+
+* Moved to library-specific version number post the move to Git.  And since we have one (minor) breaking change
+this gets bumped up from v4 to v5.
+* [*Breaking change:] corrected behavior of `basic_regex<>::mark_count()` to match existing documentation,
+`basic_regex<>::subexpression(n)` changed to match, see [@https://svn.boost.org/trac/boost/ticket/9227 #9227]
+* Fixed issue [@https://svn.boost.org/trac/boost/ticket/8903 #8903].
+* Fixed documentation typos from [@https://svn.boost.org/trac/boost/ticket/9283 #9283].
+* Fixed bug in collation code that failed if the locale generated collation strings with embedded nul's,
+see [@https://svn.boost.org/trac/boost/ticket/9451 #9451].
+* Apply patch for unusual thread usage (no statically initialized mutexes), see [@https://svn.boost.org/trac/boost/ticket/9461 #9461].
+* Added better checks for invalid UTF-8 sequences, see [@https://svn.boost.org/trac/boost/ticket/9473 #9473].
+
+[h4 Boost-1.54]
+
+Fixed issue [@https://svn.boost.org/trac/boost/ticket/8569 #8569].
+
+[h4 Boost-1.53]
+
+Fixed Issues:
+[@https://svn.boost.org/trac/boost/ticket/7744 #7744], [@https://svn.boost.org/trac/boost/ticket/7644 #7644].
+
+[h4 Boost-1.51]
+
+Fixed issues:
+[@https://svn.boost.org/trac/boost/ticket/589 #589], [@https://svn.boost.org/trac/boost/ticket/7084 #7084],
+[@https://svn.boost.org/trac/boost/ticket/7032 #7032], [@https://svn.boost.org/trac/boost/ticket/6346 #6346].
+
+[h4 Boost-1.50]
+
+Fixed issue with `(?!)` not being a valid expression, and updated docs on what constitutes a valid conditional expression.
+
+[h4 Boost-1.48]
+
+Fixed issues:
+[@https://svn.boost.org/trac/boost/ticket/688 #698], [@https://svn.boost.org/trac/boost/ticket/5835 #5835],
+[@https://svn.boost.org/trac/boost/ticket/5958 #5958], [@https://svn.boost.org/trac/boost/ticket/5736 #5736].
+
+
+[h4 Boost 1.47]
+
+Fixed issues:
+[@https://svn.boost.org/trac/boost/ticket/5223 #5223], [@https://svn.boost.org/trac/boost/ticket/5353 #5353],
+[@https://svn.boost.org/trac/boost/ticket/5363 #5363], [@https://svn.boost.org/trac/boost/ticket/5462 #5462],
+[@https://svn.boost.org/trac/boost/ticket/5472 #5472], [@https://svn.boost.org/trac/boost/ticket/5504 #5504].
+
+[h4 Boost 1.44]
+
+Fixed issues: 
+[@https://svn.boost.org/trac/boost/ticket/4309 #4309],
+[@https://svn.boost.org/trac/boost/ticket/4215 #4215],
+[@https://svn.boost.org/trac/boost/ticket/4212 #4212],
+[@https://svn.boost.org/trac/boost/ticket/4191 #4191],
+[@https://svn.boost.org/trac/boost/ticket/4132 #4132],
+[@https://svn.boost.org/trac/boost/ticket/4123 #4123],
+[@https://svn.boost.org/trac/boost/ticket/4114 #4114],
+[@https://svn.boost.org/trac/boost/ticket/4036 #4036],
+[@https://svn.boost.org/trac/boost/ticket/4020 #4020],
+[@https://svn.boost.org/trac/boost/ticket/3941 #3941],
+[@https://svn.boost.org/trac/boost/ticket/3902 #3902],
+[@https://svn.boost.org/trac/boost/ticket/3890 #3890]
+
+[h4 Boost 1.42]
+
+* Added support for Functors rather than strings as format expressions.
+* Improved error reporting when throwing exceptions to include better more relevant information.
+* Improved performance and reduced stack usage of recursive expressions.
+* Fixed tickets
+[@https://svn.boost.org/trac/boost/ticket/2802 #2802],
+[@https://svn.boost.org/trac/boost/ticket/3425 #3425],
+[@https://svn.boost.org/trac/boost/ticket/3507 #3507],
+[@https://svn.boost.org/trac/boost/ticket/3546 #3546],
+[@https://svn.boost.org/trac/boost/ticket/3631 #3631],
+[@https://svn.boost.org/trac/boost/ticket/3632 #3632],
+[@https://svn.boost.org/trac/boost/ticket/3715 #3715],
+[@https://svn.boost.org/trac/boost/ticket/3718 #3718],
+[@https://svn.boost.org/trac/boost/ticket/3763 #3763],
+[@https://svn.boost.org/trac/boost/ticket/3764 #3764]
+
+[h4 Boost 1.40]
+
+* Added support for many Perl 5.10 syntax elements including named
+sub-expressions, branch resets and recursive regular expressions.
+
+[h4 Boost 1.38]
+
+* [*Breaking change]: empty expressions, and empty alternatives are now
+allowed when using the Perl regular expression syntax.  This change has
+been added for Perl compatibility, when the new [syntax_option_type]
+['no_empty_expressions] is set then the old behaviour is preserved and
+empty expressions are prohibited.  This is issue
+[@https://svn.boost.org/trac/boost/ticket/1081 #1081].
+* Added support for Perl style ${n} expressions in format strings
+(issue [@https://svn.boost.org/trac/boost/ticket/2556 #2556]).
+* Added support for accessing the location of sub-expressions within the
+regular expression string 
+(issue [@https://svn.boost.org/trac/boost/ticket/2269 #2269]).
+* Fixed compiler compatibility issues 
+[@https://svn.boost.org/trac/boost/ticket/2244 #2244],
+[@https://svn.boost.org/trac/boost/ticket/2514 #2514],
+and
+[@https://svn.boost.org/trac/boost/ticket/2244 #2458].
+
+
+[h4 Boost 1.34]
+
+* Fix for non-greedy repeats and partial matches not working correctly in some cases.
+* Fix for non-greedy repeats on VC++ not working in some cases (bug report 1515830).
+* Changed match_results::position() to return a valid result when *this represents a partial match.
+* Fixed the grep and egrep options so that the newline character gets treated the same as |.
+
+[h4 Boost 1.33.1]
+
+* Fixed broken makefiles.
+* Fixed configuration setup to allow building with VC7.1 - STLport-4.6.2 when using /Zc:wchar_t.
+* Moved declarations class-inline in static_mutex.hpp so that SGI Irix compiler can cope.
+* Added needed standard library #includes to fileiter.hpp, regex_workaround.hpp and cpp_regex_traits.hpp.
+* Fixed a bug where non-greedy repeats could in certain strange circumstances repeat more times than their maximum value.
+* Fixed the value returned by basic_regex<>::empty() from a default constructed object.
+* Changed the definition of regex_error to make it backwards compatible with Boost-1.32.0.
+* Disabled external templates for Intel C++ 8.0 and earlier - otherwise unresolved references can occur.
+* Rewritten extern template code for gcc so that only specific member functions are exported: otherwise strange unresolved references can occur when linking and mixing debug and non-debug code.
+* Initialise all the data members of the unicode_iterators: this keeps gcc from issuing needless warnings.
+* Ported the ICU integration code to VC6 and VC7.
+* Ensured code is STLport debug mode clean.
+* Fixed lookbehind assertions so that fixed length repeats are permitted, and so that regex iteration allows lookbehind to look back before the current search range (into the last match).
+* Fixed strange bug with non-greedy repeats inside forward lookahead assertions.
+* Enabled negated character classes inside character sets.
+* Fixed regression so that [a-z-] is a valid expression again.
+* Fixed bug that allowed some invalid expressions to be accepted.
+
+[h4 Boost 1.33.0]
+
+* Completely rewritten expression parsing code, and traits class support; now conforms to the standardization proposal.
+* Breaking Change: The syntax options that can be passed to basic_regex constructors have been rationalized.  The default option (perl) now has a value of zero, and it is now clearly documented which options apply to which regular expression syntax styles (perl, POSIX-extended, POSIX-basic etc).  Some of the more esoteric options have now been removed, so there is the possibility that existing code may fail to compile: however equivalent functionality should still be available.
+* Breaking Change: POSIX-extended and POSIX-basic regular expressions now enforce the letter of the POSIX standard much more closely than before.
+* Added support for (?imsx-imsx) constructs.
+* Added support for lookbehind expressions (?<=positive-lookbehind) and (?<!negative-lookbehind).
+* Added support for conditional expressions (?(assertion)true-expression|false-expression).
+* Added MFC/ATL string wrappers.
+* Added Unicode support; based on ICU.
+* Changed newline support to recognise \\f as a line separator (all character types), and \\x85 as a line separator for wide characters / Unicode only.
+* Added a new format flag format_literal that treats the replace string as a literal, rather than a Perl or Sed style format string.
+* Errors are now reported by throwing exceptions of type regex_error. The types used previously - bad_expression and bad_pattern - are now just typedefs for regex_error. Type regex_error has a couple of new members: code() to report an error code rather than a string, and position() to report where in the expression the error occurred.
+
+[h4 Boost 1.32.1]
+
+* Fixed bug in partial matches of bounded repeats of '.'.
+
+[h4 Boost 1.31.0]
+
+* Completely rewritten pattern matching code - it is now up to 10 times faster than before.
+* Reorganized documentation.
+* Deprecated all interfaces that are not part of the regular expression standardization proposal.
+* Added regex_iterator and regex_token_iterator .
+* Added support for Perl style independent sub-expressions.
+* Added non-member operators to the sub_match class, so that you can compare sub_match's with strings, or add them to a string to produce a new string.
+* Added experimental support for extended capture information.
+* Changed the match flags so that they are a distinct type (not an integer), if you try to pass the match flags as an integer rather than match_flag_type to the regex algorithms then you will now get a compiler error.
+    
+[endsect]
+
+
+

doc/html/boost_regex/background.html

@@ -0,0 +1,80 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Background Information</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="prev" href="ref/internals/uni_iter.html" title="Unicode Iterators">
+<link rel="next" href="background/headers.html" title="Headers">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ref/internals/uni_iter.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="background/headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_regex.background"></a><a class="link" href="background.html" title="Background Information">Background Information</a>
+</h2></div></div></div>
+<div class="toc"><dl class="toc">
+<dt><span class="section"><a href="background/headers.html">Headers</a></span></dt>
+<dt><span class="section"><a href="background/locale.html">Localization</a></span></dt>
+<dt><span class="section"><a href="background/thread_safety.html">Thread Safety</a></span></dt>
+<dt><span class="section"><a href="background/examples.html">Test and Example Programs</a></span></dt>
+<dt><span class="section"><a href="background/futher.html">References and Further
+      Information</a></span></dt>
+<dt><span class="section"><a href="background/faq.html">FAQ</a></span></dt>
+<dt><span class="section"><a href="background/performance.html">Performance</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="background/performance/section_id1378460593.html">Testing
+        simple leftmost-longest matches (platform = linux, compiler = GNU C++ version
+        6.3.0)</a></span></dt>
+<dt><span class="section"><a href="background/performance/section_id1675827111.html">Testing
+        Perl searches (platform = linux, compiler = GNU C++ version 6.3.0)</a></span></dt>
+<dt><span class="section"><a href="background/performance/section_id3141719723.html">Testing
+        simple leftmost-longest matches (platform = Windows x64, compiler = Microsoft
+        Visual C++ version 14.1)</a></span></dt>
+<dt><span class="section"><a href="background/performance/section_id3258595385.html">Testing
+        leftmost-longest searches (platform = Windows x64, compiler = Microsoft Visual
+        C++ version 14.1)</a></span></dt>
+<dt><span class="section"><a href="background/performance/section_id3261825021.html">Testing
+        simple Perl matches (platform = linux, compiler = GNU C++ version 6.3.0)</a></span></dt>
+<dt><span class="section"><a href="background/performance/section_id3752650613.html">Testing
+        Perl searches (platform = Windows x64, compiler = Microsoft Visual C++ version
+        14.1)</a></span></dt>
+<dt><span class="section"><a href="background/performance/section_id4128344975.html">Testing
+        simple Perl matches (platform = Windows x64, compiler = Microsoft Visual
+        C++ version 14.1)</a></span></dt>
+<dt><span class="section"><a href="background/performance/section_id4148872883.html">Testing
+        leftmost-longest searches (platform = linux, compiler = GNU C++ version 6.3.0)</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="background/standards.html">Standards Conformance</a></span></dt>
+<dt><span class="section"><a href="background/redist.html">Redistributables</a></span></dt>
+<dt><span class="section"><a href="background/acknowledgements.html">Acknowledgements</a></span></dt>
+<dt><span class="section"><a href="background/history.html">History</a></span></dt>
+</dl></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ref/internals/uni_iter.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="background/headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/acknowledgements.html

@@ -0,0 +1,87 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Acknowledgements</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="redist.html" title="Redistributables">
+<link rel="next" href="history.html" title="History">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="redist.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.acknowledgements"></a><a class="link" href="acknowledgements.html" title="Acknowledgements">Acknowledgements</a>
+</h3></div></div></div>
+<p>
+        The author can be contacted at john - at - johnmaddock.co.uk; the home page
+        for this library is at <a href="http://www.boost.org" target="_top">www.boost.org</a>.
+      </p>
+<p>
+        I am indebted to <a href="http://www.cs.princeton.edu/~rs/" target="_top">Robert Sedgewick's
+        "Algorithms in C++"</a> for forcing me to think about algorithms
+        and their performance, and to the folks at boost for forcing me to think,
+        period.
+      </p>
+<p>
+        <a href="http://www.boost-consulting.com/" target="_top">Eric Niebler</a>, author
+        of Boost.Expressive and the <a href="http://research.microsoft.com/projects/greta" target="_top">GRETA
+        regular expression component</a>, has shared several important ideas,
+        in a series of long discussions.
+      </p>
+<p>
+        Pete Becker, of <a href="http://www.versatilecoding.com" target="_top">Roundhouse Consulting,
+        Ltd.</a>, has helped enormously with the standardisation proposal language.
+      </p>
+<p>
+        The following people have all contributed useful comments or fixes: Dave
+        Abrahams, Mike Allison, Edan Ayal, Jayashree Balasubramanian, Jan Bölsche,
+        Beman Dawes, Paul Baxter, David Bergman, David Dennerline, Edward Diener,
+        Peter Dimov, Robert Dunn, Fabio Forno, Tobias Gabrielsson, Rob Gillen, Marc
+        Gregoire, Chris Hecker, Nick Hodapp, Jesse Jones, Martin Jost, Boris Krasnovskiy,
+        Jan Hermelink, Max Leung, Wei-hao Lin, Jens Maurer, Richard Peters, Heiko
+        Schmidt, Jason Shirk, Gerald Slacik, Scobie Smith, Mike Smyth, Alexander
+        Sokolovsky, Hervé Poirier, Michael Raykh, Marc Recht, Scott VanCamp, Bruno
+        Voigt, Alexey Voinov, Jerry Waldorf, Rob Ward, Lealon Watts, John Wismar,
+        Thomas Witt and Yuval Yosef.
+      </p>
+<p>
+        If I've missed your name off (I'm sure there are a few, just not who they
+        are...) then please do get in touch.
+      </p>
+<p>
+        I am also grateful to the manuals supplied with the Henry Spencer, PCRE,
+        Perl and GNU regular expression libraries - wherever possible I have tried
+        to maintain compatibility with these libraries and with the POSIX standard
+        - the code however is entirely my own, including any bugs! I can absolutely
+        guarantee that I will not fix any bugs I don't know about, so if you have
+        any comments or spot any bugs, please get in touch.
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="redist.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/examples.html

@@ -0,0 +1,274 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Test and Example Programs</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="thread_safety.html" title="Thread Safety">
+<link rel="next" href="futher.html" title="References and Further Information">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="thread_safety.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="futher.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.examples"></a><a class="link" href="examples.html" title="Test and Example Programs">Test and Example Programs</a>
+</h3></div></div></div>
+<h5>
+<a name="boost_regex.background.examples.h0"></a>
+        <span class="phrase"><a name="boost_regex.background.examples.test_programs"></a></span><a class="link" href="examples.html#boost_regex.background.examples.test_programs">Test
+        Programs</a>
+      </h5>
+<p>
+        <span class="bold"><strong>regress:</strong></span>
+      </p>
+<p>
+        A regression test application that gives the matching/searching algorithms
+        a full workout. The presence of this program is your guarantee that the library
+        will behave as claimed - at least as far as those items tested are concerned
+        - if anyone spots anything that isn't being tested I'd be glad to hear about
+        it.
+      </p>
+<p>
+        Files:
+      </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            <a href="../../../../test/regress/main.cpp" target="_top">main.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/basic_tests.cpp" target="_top">basic_tests.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_alt.cpp" target="_top">test_alt.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_anchors.cpp" target="_top">test_anchors.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_asserts.cpp" target="_top">test_asserts.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_backrefs.cpp" target="_top">test_backrefs.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_deprecated.cpp" target="_top">test_deprecated.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_emacs.cpp" target="_top">test_emacs.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_escapes.cpp" target="_top">test_escapes.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_grep.cpp" target="_top">test_grep.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_icu.cpp" target="_top">test_icu.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_locale.cpp" target="_top">test_locale.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_mfc.cpp" target="_top">test_mfc.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_non_greedy_repeats.cpp" target="_top">test_non_greedy_repeats.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_operators.cpp" target="_top">test_operators.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_overloads.cpp" target="_top">test_overloads.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_perl_ex.cpp" target="_top">test_perl_ex.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_replace.cpp" target="_top">test_replace.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_sets.cpp" target="_top">test_sets.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_simple_repeats.cpp" target="_top">test_simple_repeats.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_tricky_cases.cpp" target="_top">test_tricky_cases.cpp</a>
+          </li>
+<li class="listitem">
+            <a href="../../../../test/regress/test_unicode.cpp" target="_top">test_unicode.cpp</a>
+          </li>
+</ul></div>
+<p>
+        <span class="bold"><strong>bad_expression_test:</strong></span>
+      </p>
+<p>
+        Verifies that "bad" regular expressions don't cause the matcher
+        to go into infinite loops, but to throw an exception instead.
+      </p>
+<p>
+        Files: <a href="../../../../test/pathology/bad_expression_test.cpp" target="_top">bad_expression_test.cpp</a>.
+      </p>
+<p>
+        <span class="bold"><strong>recursion_test:</strong></span>
+      </p>
+<p>
+        Verifies that the matcher can't overrun the stack (no matter what the expression).
+      </p>
+<p>
+        Files: <a href="../../../../test/pathology/recursion_test.cpp" target="_top">recursion_test.cpp</a>.
+      </p>
+<p>
+        <span class="bold"><strong>concepts:</strong></span>
+      </p>
+<p>
+        Verifies that the library meets all documented concepts (a compile only test).
+      </p>
+<p>
+        Files: <a href="../../../../test/concepts/concept_check.cpp" target="_top">concept_check.cpp</a>.
+      </p>
+<p>
+        <span class="bold"><strong>captures_test:</strong></span>
+      </p>
+<p>
+        Test code for captures.
+      </p>
+<p>
+        Files: <a href="../../../../test/captures/captures_test.cpp" target="_top">captures_test.cpp</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.examples.h1"></a>
+        <span class="phrase"><a name="boost_regex.background.examples.example_programs"></a></span><a class="link" href="examples.html#boost_regex.background.examples.example_programs">Example
+        programs</a>
+      </h5>
+<p>
+        <span class="bold"><strong>grep</strong></span>
+      </p>
+<p>
+        A simple grep implementation, run with the -h command line option to find
+        out its usage.
+      </p>
+<p>
+        Files: <a href="../../../../example/grep/grep.cpp" target="_top">grep.cpp</a>
+      </p>
+<p>
+        <span class="bold"><strong>timer.exe</strong></span>
+      </p>
+<p>
+        A simple interactive expression matching application, the results of all
+        matches are timed, allowing the programmer to optimize their regular expressions
+        where performance is critical.
+      </p>
+<p>
+        Files: <a href="../../../../example/timer/regex_timer.cpp" target="_top">regex_timer.cpp</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.examples.h2"></a>
+        <span class="phrase"><a name="boost_regex.background.examples.code_snippets"></a></span><a class="link" href="examples.html#boost_regex.background.examples.code_snippets">Code
+        snippets</a>
+      </h5>
+<p>
+        The snippets examples contain the code examples used in the documentation:
+      </p>
+<p>
+        <a href="../../../../example/snippets/captures_example.cpp" target="_top">captures_example.cpp</a>:
+        Demonstrates the use of captures.
+      </p>
+<p>
+        <a href="../../../../example/snippets/credit_card_example.cpp" target="_top">credit_card_example.cpp</a>:
+        Credit card number formatting code.
+      </p>
+<p>
+        <a href="../../../../example/snippets/partial_regex_grep.cpp" target="_top">partial_regex_grep.cpp</a>:
+        Search example using partial matches.
+      </p>
+<p>
+        <a href="../../../../example/snippets/partial_regex_match.cpp" target="_top">partial_regex_match.cpp</a>:
+        regex_match example using partial matches.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_iterator_example.cpp" target="_top">regex_iterator_example.cpp</a>:
+        Iterating through a series of matches.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_match_example.cpp" target="_top">regex_match_example.cpp</a>:
+        ftp based regex_match example.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_merge_example.cpp" target="_top">regex_merge_example.cpp</a>:
+        regex_merge example: converts a C++ file to syntax highlighted HTML.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_replace_example.cpp" target="_top">regex_replace_example.cpp</a>:
+        regex_replace example: converts a C++ file to syntax highlighted HTML
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_search_example.cpp" target="_top">regex_search_example.cpp</a>:
+        regex_search example: searches a cpp file for class definitions.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_token_iterator_eg_1.cpp" target="_top">regex_token_iterator_eg_1.cpp</a>:
+        split a string into a series of tokens.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_token_iterator_eg_2.cpp" target="_top">regex_token_iterator_eg_2.cpp</a>:
+        enumerate the linked URL's in a HTML file.
+      </p>
+<p>
+        The following are deprecated:
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_grep_example_1.cpp" target="_top">regex_grep_example_1.cpp</a>:
+        regex_grep example 1: searches a cpp file for class definitions.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_grep_example_2.cpp" target="_top">regex_grep_example_2.cpp</a>:
+        regex_grep example 2: searches a cpp file for class definitions, using a
+        global callback function.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_grep_example_3.cpp" target="_top">regex_grep_example_3.cpp</a>:
+        regex_grep example 2: searches a cpp file for class definitions, using a
+        bound member function callback.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_grep_example_4.cpp" target="_top">regex_grep_example_4.cpp</a>:
+        regex_grep example 2: searches a cpp file for class definitions, using a
+        C++ Builder closure as a callback.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_split_example_1.cpp" target="_top">regex_split_example_1.cpp</a>:
+        regex_split example: split a string into tokens.
+      </p>
+<p>
+        <a href="../../../../example/snippets/regex_split_example_2.cpp" target="_top">regex_split_example_2.cpp</a>
+        : regex_split example: spit out linked URL's.
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="thread_safety.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="futher.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/faq.html

@@ -0,0 +1,155 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>FAQ</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="futher.html" title="References and Further Information">
+<link rel="next" href="performance.html" title="Performance">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="futher.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.faq"></a><a class="link" href="faq.html" title="FAQ">FAQ</a>
+</h3></div></div></div>
+<p>
+        <span class="bold"><strong>Q.</strong></span> I can't get regex++ to work with escape
+        characters, what's going on?
+      </p>
+<p>
+        <span class="bold"><strong>A.</strong></span> If you embed regular expressions in C++
+        code, then remember that escape characters are processed twice: once by the
+        C++ compiler, and once by the Boost.Regex expression compiler, so to pass
+        the regular expression \d+ to Boost.Regex, you need to embed "\d+"
+        in your code. Likewise to match a literal backslash you will need to embed
+        "\\" in your code.
+      </p>
+<p>
+        <span class="bold"><strong>Q.</strong></span> No matter what I do regex_match always
+        returns false, what's going on?
+      </p>
+<p>
+        <span class="bold"><strong>A.</strong></span> The algorithm regex_match only succeeds
+        if the expression matches <span class="bold"><strong>all</strong></span> of the text,
+        if you want to <span class="bold"><strong>find</strong></span> a sub-string within
+        the text that matches the expression then use regex_search instead.
+      </p>
+<p>
+        <span class="bold"><strong>Q.</strong></span> Why does using parenthesis in a POSIX
+        regular expression change the result of a match?
+      </p>
+<p>
+        <span class="bold"><strong>A.</strong></span> For POSIX (extended and basic) regular
+        expressions, but not for perl regexes, parentheses don't only mark; they
+        determine what the best match is as well. When the expression is compiled
+        as a POSIX basic or extended regex then Boost.Regex follows the POSIX standard
+        leftmost longest rule for determining what matched. So if there is more than
+        one possible match after considering the whole expression, it looks next
+        at the first sub-expression and then the second sub-expression and so on.
+        So...
+      </p>
+<p>
+        "(0*)([0-9]*)" against "00123" would produce $1 = "00"
+        $2 = "123"
+      </p>
+<p>
+        where as
+      </p>
+<p>
+        "0*([0-9])*" against "00123" would produce $1 = "00123"
+      </p>
+<p>
+        If you think about it, had $1 only matched the "123", this would
+        be "less good" than the match "00123" which is both further
+        to the left and longer. If you want $1 to match only the "123"
+        part, then you need to use something like:
+      </p>
+<p>
+        "0*([1-9][0-9]*)"
+      </p>
+<p>
+        as the expression.
+      </p>
+<p>
+        <span class="bold"><strong>Q.</strong></span> Why don't character ranges work properly
+        (POSIX mode only)?
+      </p>
+<p>
+        <span class="bold"><strong>A.</strong></span> The POSIX standard specifies that character
+        range expressions are locale sensitive - so for example the expression [A-Z]
+        will match any collating element that collates between 'A' and 'Z'. That
+        means that for most locales other than "C" or "POSIX",
+        [A-Z] would match the single character 't' for example, which is not what
+        most people expect - or at least not what most people have come to expect
+        from regular expression engines. For this reason, the default behaviour of
+        Boost.Regex (perl mode) is to turn locale sensitive collation off by not
+        setting the <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">collate</span></code>
+        compile time flag. However if you set a non-default compile time flag - for
+        example <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">extended</span></code> or <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">basic</span></code>,
+        then locale dependent collation will be enabled, this also applies to the
+        POSIX API functions which use either <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">extended</span></code>
+        or <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">basic</span></code> internally. [Note - when <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">nocollate</span></code> in effect, the library behaves
+        "as if" the LC_COLLATE locale category were always "C",
+        regardless of what its actually set to - end note].
+      </p>
+<p>
+        <span class="bold"><strong>Q.</strong></span> Why are there no throw specifications
+        on any of the functions? What exceptions can the library throw?
+      </p>
+<p>
+        <span class="bold"><strong>A.</strong></span> Not all compilers support (or honor)
+        throw specifications, others support them but with reduced efficiency. Throw
+        specifications may be added at a later date as compilers begin to handle
+        this better. The library should throw only three types of exception: [boost::regex_error]
+        can be thrown by <a class="link" href="../ref/basic_regex.html" title="basic_regex"><code class="computeroutput"><span class="identifier">basic_regex</span></code></a> when compiling a regular
+        expression, <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">runtime_error</span></code> can be thrown when a call
+        to <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special">::</span><span class="identifier">imbue</span></code> tries to open a message catalogue
+        that doesn't exist, or when a call to <a class="link" href="../ref/regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a> or <a class="link" href="../ref/regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a> results in an "everlasting"
+        search, or when a call to <code class="computeroutput"><span class="identifier">RegEx</span><span class="special">::</span><span class="identifier">GrepFiles</span></code>
+        or <code class="computeroutput"><span class="identifier">RegEx</span><span class="special">::</span><span class="identifier">FindFiles</span></code> tries to open a file that cannot
+        be opened, finally <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">bad_alloc</span></code> can be thrown by just about any
+        of the functions in this library.
+      </p>
+<p>
+        <span class="bold"><strong>Q.</strong></span> Why can't I use the "convenience"
+        versions of regex_match / regex_search / regex_grep / regex_format / regex_merge?
+      </p>
+<p>
+        <span class="bold"><strong>A.</strong></span> These versions may or may not be available
+        depending upon the capabilities of your compiler, the rules determining the
+        format of these functions are quite complex - and only the versions visible
+        to a standard compliant compiler are given in the help. To find out what
+        your compiler supports, run &lt;boost/regex.hpp&gt; through your C++ pre-processor,
+        and search the output file for the function that you are interested in. Note
+        however, that very few current compilers still have problems with these overloaded
+        functions.
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="futher.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/futher.html

@@ -0,0 +1,76 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>References and Further Information</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="examples.html" title="Test and Example Programs">
+<link rel="next" href="faq.html" title="FAQ">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="examples.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.futher"></a><a class="link" href="futher.html" title="References and Further Information">References and Further
+      Information</a>
+</h3></div></div></div>
+<p>
+        The main Perl regular expression tutorial can be found <a href="http://perldoc.perl.org/perlretut.html" target="_top">here</a>,
+        there's a much shorter summary of the main features <a href="https://www.cs.tut.fi/~jkorpela/perl/regexp.html" target="_top">here</a>.
+      </p>
+<p>
+        The main book on regular expressions is <a href="http://www.oreilly.com/catalog/regex/" target="_top">Mastering
+        Regular Expressions, published by O'Reilly</a>.
+      </p>
+<p>
+        Boost.Regex forms the basis for the regular expression chapter of the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
+        Report on C++ Library Extensions</a>.
+      </p>
+<p>
+        The <a href="http://www.opengroup.org/onlinepubs/7908799/toc.htm" target="_top">Open
+        Unix Specification</a> contains a wealth of useful material, including
+        the POSIX regular expression syntax.
+      </p>
+<p>
+        The <a href="http://www.cs.ucr.edu/~stelo/pattern.html" target="_top">Pattern Matching
+        Pointers</a> site is a "must visit" resource for anyone interested
+        in pattern matching.
+      </p>
+<p>
+        <a href="http://glimpse.cs.arizona.edu/" target="_top">Glimpse and Agrep</a>, use
+        a simplified regular expression syntax to achieve faster search times.
+      </p>
+<p>
+        <a href="http://glimpse.cs.arizona.edu/udi.html" target="_top">Udi Manber</a> and
+        <a href="http://www.dcc.uchile.cl/~rbaeza/" target="_top">Ricardo Baeza-Yates</a>
+        both have a selection of useful pattern matching papers available from their
+        respective web sites.
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="examples.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/headers.html

@@ -0,0 +1,54 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Headers</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="../background.html" title="Background Information">
+<link rel="next" href="locale.html" title="Localization">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../background.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="locale.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.headers"></a><a class="link" href="headers.html" title="Headers">Headers</a>
+</h3></div></div></div>
+<p>
+        There are two main headers used by this library: <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
+        provides full access to the main template library, while <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">cregex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
+        provides access to the (deprecated) high level class RegEx, and the POSIX
+        API functions.
+      </p>
+<p>
+        There is also a header containing only forward declarations <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex_fwd</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
+        for use when an interface is dependent upon <a class="link" href="../ref/basic_regex.html" title="basic_regex"><code class="computeroutput"><span class="identifier">basic_regex</span></code></a>, but otherwise does
+        not need the full definitions.
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../background.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="locale.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/history.html

@@ -0,0 +1,567 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>History</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="acknowledgements.html" title="Acknowledgements">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="acknowledgements.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.history"></a><a class="link" href="history.html" title="History">History</a>
+</h3></div></div></div>
+<p>
+        New issues should be submitted at <a href="https://github.com/boostorg/regex/issues" target="_top">https://github.com/boostorg/regex/issues</a>
+      </p>
+<p>
+        Currently open issues can be viewed <a href="https://github.com/boostorg/regex/issues?q=is%3Aopen+is%3Aissue" target="_top">here</a>.
+      </p>
+<p>
+        All issues including closed ones can be viewed <a href="https://github.com/boostorg/regex/issues?q=is%3Aissue+is%3Aclosed" target="_top">here</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.history.h0"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_7_0_1_boost_1_79_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_7_0_1_boost_1_79_0">Boost.Regex-7.0.1
+        (boost-1.79.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+            Minor fix for setting building with -DBOOST_REGEX_MAX_CACHE_BLOCKS=0
+            and <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">atomic</span><span class="special">&gt;</span></code> present.
+          </li></ul></div>
+<h5>
+<a name="boost_regex.background.history.h1"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_7_0_0_boost_1_78_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_7_0_0_boost_1_78_0">Boost.Regex-7.0.0
+        (Boost-1.78.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            <span class="bold"><strong>Breaking Change:</strong></span> Change \B to be the
+            opposite of \b as per Perl behaviour.
+          </li>
+<li class="listitem">
+            Change w32_regex_traits.hpp so that windows.h is no longer included.
+          </li>
+<li class="listitem">
+            Fxed fuzzing related issues <a href="https://github.com/boostorg/regex/issues/156" target="_top">#151</a>,
+            <a href="https://github.com/boostorg/regex/issues/156" target="_top">#152</a>,
+            <a href="https://github.com/boostorg/regex/issues/156" target="_top">#153</a>,
+            <a href="https://github.com/boostorg/regex/issues/156" target="_top">#156</a>.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h2"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_6_0_0_boost_1_77_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_6_0_0_boost_1_77_0">Boost.Regex-6.0.0
+        (Boost-1.77.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Big change to header only library.
+          </li>
+<li class="listitem">
+            Deprecate C++03 support.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h3"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_5_1_4_boost_172_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_5_1_4_boost_172_0">Boost.Regex-5.1.4
+        (Boost-172.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+            Minor build fixes, see <a href="https://github.com/boostorg/regex/issues/89" target="_top">#89</a>.
+          </li></ul></div>
+<h5>
+<a name="boost_regex.background.history.h4"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_5_1_3_boost_1_64_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_5_1_3_boost_1_64_0">Boost.Regex-5.1.3
+        (Boost-1.64.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Compiling with Oracle C++ toolset is no longer restricted to static linking.
+          </li>
+<li class="listitem">
+            Big effort to de-fuzz the library using libFuzzer and fix identified
+            issues, see: <a href="https://svn.boost.org/trac/boost/ticket/12818" target="_top">#12818</a>.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h5"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_5_1_2_boost_1_62_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_5_1_2_boost_1_62_0">Boost.Regex-5.1.2
+        (Boost-1.62.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Fix buffer over-run error when parsing certain invalid regexes, see
+            <a href="https://svn.boost.org/trac/boost/ticket/12222" target="_top">#12222</a>.
+          </li>
+<li class="listitem">
+            Fix detection of ICU in library build, see <a href="https://svn.boost.org/trac/boost/ticket/12152" target="_top">#12152</a>.
+          </li>
+<li class="listitem">
+            Fix bug in case sensitivity change, see <a href="https://svn.boost.org/trac/boost/ticket/11940" target="_top">#11940</a>.
+          </li>
+<li class="listitem">
+            Allow types wider than int in <code class="computeroutput"><span class="special">\</span><span class="identifier">x</span><span class="special">{}</span></code>
+            expressions (for char32_t etc), see <a href="https://svn.boost.org/trac/boost/ticket/11988" target="_top">#11988</a>.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h6"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_5_1_1_boost_1_61_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_5_1_1_boost_1_61_0">Boost.Regex-5.1.1
+        (Boost-1.61.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+            Change to lockfree implementation of memory cache, see <a href="https://github.com/boostorg/regex/pull/23" target="_top">PR#23</a>.
+          </li></ul></div>
+<h5>
+<a name="boost_regex.background.history.h7"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_5_1_0_boost_1_60_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_5_1_0_boost_1_60_0">Boost.Regex-5.1.0
+        (Boost-1.60.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Add support for Perl's backtracking control verbs, see <a href="https://svn.boost.org/trac/boost/ticket/11205" target="_top">#11205</a>.
+            Note however, that (*MARK) and operations on marks are not currently
+            supported.
+          </li>
+<li class="listitem">
+            Fix incorrect range end when matching [[:unicode:]], see <a href="https://svn.boost.org/trac/boost/ticket/11524" target="_top">#11524</a>.
+          </li>
+<li class="listitem">
+            Change POSIX reg_comp API to not check potentially uninitialized memory,
+            note that code which was previously free from memory leaks (but none
+            the less buggy, as it didn't call reg_free) will now leak. See <a href="https://svn.boost.org/trac/boost/ticket/11472" target="_top">#11472</a>.
+          </li>
+<li class="listitem">
+            Make sub_match a valid C++ range type, see <a href="https://svn.boost.org/trac/boost/ticket/11036" target="_top">#11036</a>.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h8"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_5_0_1_boost_1_58_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_5_0_1_boost_1_58_0">Boost.Regex-5.0.1
+        (Boost-1.58.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Fixed some typos as in <a href="https://svn.boost.org/trac/boost/ticket/10682" target="_top">#10682</a>.
+          </li>
+<li class="listitem">
+            Merged <a href="https://github.com/boostorg/regex/pull/6" target="_top">pull-request
+            #6</a> for Coverity warnings.
+          </li>
+<li class="listitem">
+            Merged <a href="https://github.com/boostorg/regex/pull/7" target="_top">pull-request
+            #7</a> for Coverity warnings.
+          </li>
+<li class="listitem">
+            Merged <a href="https://github.com/boostorg/regex/pull/8" target="_top">pull-request
+            #8</a> for Coverity warnings.
+          </li>
+<li class="listitem">
+            Merged <a href="https://github.com/boostorg/regex/pull/10" target="_top">pull-request
+            #10</a> to enable more build variants when linking to ICU.
+          </li>
+<li class="listitem">
+            Fix issue with ICU and partial matches, see <a href="https://svn.boost.org/trac/boost/ticket/10114" target="_top">#10114</a>.
+          </li>
+<li class="listitem">
+            Removed delayload support for the ICU libraries: this doesn't work with
+            the latest ICU releases (linker errors).
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h9"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_regex_5_0_0_boost_1_56_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_regex_5_0_0_boost_1_56_0">Boost.Regex-5.0.0
+        (Boost-1.56.0)</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Moved to library-specific version number post the move to Git. And since
+            we have one (minor) breaking change this gets bumped up from v4 to v5.
+          </li>
+<li class="listitem">
+            <span class="bold"><strong>Breaking change:</strong></span> corrected behavior
+            of <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special">&lt;&gt;::</span><span class="identifier">mark_count</span><span class="special">()</span></code>
+            to match existing documentation, <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special">&lt;&gt;::</span><span class="identifier">subexpression</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code> changed to match, see <a href="https://svn.boost.org/trac/boost/ticket/9227" target="_top">#9227</a>
+          </li>
+<li class="listitem">
+            Fixed issue <a href="https://svn.boost.org/trac/boost/ticket/8903" target="_top">#8903</a>.
+          </li>
+<li class="listitem">
+            Fixed documentation typos from <a href="https://svn.boost.org/trac/boost/ticket/9283" target="_top">#9283</a>.
+          </li>
+<li class="listitem">
+            Fixed bug in collation code that failed if the locale generated collation
+            strings with embedded nul's, see <a href="https://svn.boost.org/trac/boost/ticket/9451" target="_top">#9451</a>.
+          </li>
+<li class="listitem">
+            Apply patch for unusual thread usage (no statically initialized mutexes),
+            see <a href="https://svn.boost.org/trac/boost/ticket/9461" target="_top">#9461</a>.
+          </li>
+<li class="listitem">
+            Added better checks for invalid UTF-8 sequences, see <a href="https://svn.boost.org/trac/boost/ticket/9473" target="_top">#9473</a>.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h10"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_54"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_54">Boost-1.54</a>
+      </h5>
+<p>
+        Fixed issue <a href="https://svn.boost.org/trac/boost/ticket/8569" target="_top">#8569</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.history.h11"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_53"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_53">Boost-1.53</a>
+      </h5>
+<p>
+        Fixed Issues: <a href="https://svn.boost.org/trac/boost/ticket/7744" target="_top">#7744</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/7644" target="_top">#7644</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.history.h12"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_51"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_51">Boost-1.51</a>
+      </h5>
+<p>
+        Fixed issues: <a href="https://svn.boost.org/trac/boost/ticket/589" target="_top">#589</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/7084" target="_top">#7084</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/7032" target="_top">#7032</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/6346" target="_top">#6346</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.history.h13"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_50"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_50">Boost-1.50</a>
+      </h5>
+<p>
+        Fixed issue with <code class="computeroutput"><span class="special">(?!)</span></code> not being
+        a valid expression, and updated docs on what constitutes a valid conditional
+        expression.
+      </p>
+<h5>
+<a name="boost_regex.background.history.h14"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_48"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_48">Boost-1.48</a>
+      </h5>
+<p>
+        Fixed issues: <a href="https://svn.boost.org/trac/boost/ticket/688" target="_top">#698</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/5835" target="_top">#5835</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/5958" target="_top">#5958</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/5736" target="_top">#5736</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.history.h15"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_47"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_47">Boost
+        1.47</a>
+      </h5>
+<p>
+        Fixed issues: <a href="https://svn.boost.org/trac/boost/ticket/5223" target="_top">#5223</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/5353" target="_top">#5353</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/5363" target="_top">#5363</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/5462" target="_top">#5462</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/5472" target="_top">#5472</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/5504" target="_top">#5504</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.history.h16"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_44"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_44">Boost
+        1.44</a>
+      </h5>
+<p>
+        Fixed issues: <a href="https://svn.boost.org/trac/boost/ticket/4309" target="_top">#4309</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/4215" target="_top">#4215</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/4212" target="_top">#4212</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/4191" target="_top">#4191</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/4132" target="_top">#4132</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/4123" target="_top">#4123</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/4114" target="_top">#4114</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/4036" target="_top">#4036</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/4020" target="_top">#4020</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/3941" target="_top">#3941</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/3902" target="_top">#3902</a>,
+        <a href="https://svn.boost.org/trac/boost/ticket/3890" target="_top">#3890</a>
+      </p>
+<h5>
+<a name="boost_regex.background.history.h17"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_42"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_42">Boost
+        1.42</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Added support for Functors rather than strings as format expressions.
+          </li>
+<li class="listitem">
+            Improved error reporting when throwing exceptions to include better more
+            relevant information.
+          </li>
+<li class="listitem">
+            Improved performance and reduced stack usage of recursive expressions.
+          </li>
+<li class="listitem">
+            Fixed tickets <a href="https://svn.boost.org/trac/boost/ticket/2802" target="_top">#2802</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3425" target="_top">#3425</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3507" target="_top">#3507</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3546" target="_top">#3546</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3631" target="_top">#3631</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3632" target="_top">#3632</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3715" target="_top">#3715</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3718" target="_top">#3718</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3763" target="_top">#3763</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/3764" target="_top">#3764</a>
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h18"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_40"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_40">Boost
+        1.40</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+            Added support for many Perl 5.10 syntax elements including named sub-expressions,
+            branch resets and recursive regular expressions.
+          </li></ul></div>
+<h5>
+<a name="boost_regex.background.history.h19"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_38"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_38">Boost
+        1.38</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            <span class="bold"><strong>Breaking change</strong></span>: empty expressions,
+            and empty alternatives are now allowed when using the Perl regular expression
+            syntax. This change has been added for Perl compatibility, when the new
+            <a class="link" href="../ref/syntax_option_type.html" title="syntax_option_type"><code class="computeroutput"><span class="identifier">syntax_option_type</span></code></a>
+            <span class="emphasis"><em>no_empty_expressions</em></span> is set then the old behaviour
+            is preserved and empty expressions are prohibited. This is issue <a href="https://svn.boost.org/trac/boost/ticket/1081" target="_top">#1081</a>.
+          </li>
+<li class="listitem">
+            Added support for Perl style ${n} expressions in format strings (issue
+            <a href="https://svn.boost.org/trac/boost/ticket/2556" target="_top">#2556</a>).
+          </li>
+<li class="listitem">
+            Added support for accessing the location of sub-expressions within the
+            regular expression string (issue <a href="https://svn.boost.org/trac/boost/ticket/2269" target="_top">#2269</a>).
+          </li>
+<li class="listitem">
+            Fixed compiler compatibility issues <a href="https://svn.boost.org/trac/boost/ticket/2244" target="_top">#2244</a>,
+            <a href="https://svn.boost.org/trac/boost/ticket/2514" target="_top">#2514</a>,
+            and <a href="https://svn.boost.org/trac/boost/ticket/2244" target="_top">#2458</a>.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h20"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_34"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_34">Boost
+        1.34</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Fix for non-greedy repeats and partial matches not working correctly
+            in some cases.
+          </li>
+<li class="listitem">
+            Fix for non-greedy repeats on VC++ not working in some cases (bug report
+            1515830).
+          </li>
+<li class="listitem">
+            Changed match_results::position() to return a valid result when *this
+            represents a partial match.
+          </li>
+<li class="listitem">
+            Fixed the grep and egrep options so that the newline character gets treated
+            the same as |.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h21"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_33_1"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_33_1">Boost
+        1.33.1</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Fixed broken makefiles.
+          </li>
+<li class="listitem">
+            Fixed configuration setup to allow building with VC7.1 - STLport-4.6.2
+            when using /Zc:wchar_t.
+          </li>
+<li class="listitem">
+            Moved declarations class-inline in static_mutex.hpp so that SGI Irix
+            compiler can cope.
+          </li>
+<li class="listitem">
+            Added needed standard library #includes to fileiter.hpp, regex_workaround.hpp
+            and cpp_regex_traits.hpp.
+          </li>
+<li class="listitem">
+            Fixed a bug where non-greedy repeats could in certain strange circumstances
+            repeat more times than their maximum value.
+          </li>
+<li class="listitem">
+            Fixed the value returned by basic_regex&lt;&gt;::empty() from a default
+            constructed object.
+          </li>
+<li class="listitem">
+            Changed the definition of regex_error to make it backwards compatible
+            with Boost-1.32.0.
+          </li>
+<li class="listitem">
+            Disabled external templates for Intel C++ 8.0 and earlier - otherwise
+            unresolved references can occur.
+          </li>
+<li class="listitem">
+            Rewritten extern template code for gcc so that only specific member functions
+            are exported: otherwise strange unresolved references can occur when
+            linking and mixing debug and non-debug code.
+          </li>
+<li class="listitem">
+            Initialise all the data members of the unicode_iterators: this keeps
+            gcc from issuing needless warnings.
+          </li>
+<li class="listitem">
+            Ported the ICU integration code to VC6 and VC7.
+          </li>
+<li class="listitem">
+            Ensured code is STLport debug mode clean.
+          </li>
+<li class="listitem">
+            Fixed lookbehind assertions so that fixed length repeats are permitted,
+            and so that regex iteration allows lookbehind to look back before the
+            current search range (into the last match).
+          </li>
+<li class="listitem">
+            Fixed strange bug with non-greedy repeats inside forward lookahead assertions.
+          </li>
+<li class="listitem">
+            Enabled negated character classes inside character sets.
+          </li>
+<li class="listitem">
+            Fixed regression so that [a-z-] is a valid expression again.
+          </li>
+<li class="listitem">
+            Fixed bug that allowed some invalid expressions to be accepted.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h22"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_33_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_33_0">Boost
+        1.33.0</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Completely rewritten expression parsing code, and traits class support;
+            now conforms to the standardization proposal.
+          </li>
+<li class="listitem">
+            Breaking Change: The syntax options that can be passed to basic_regex
+            constructors have been rationalized. The default option (perl) now has
+            a value of zero, and it is now clearly documented which options apply
+            to which regular expression syntax styles (perl, POSIX-extended, POSIX-basic
+            etc). Some of the more esoteric options have now been removed, so there
+            is the possibility that existing code may fail to compile: however equivalent
+            functionality should still be available.
+          </li>
+<li class="listitem">
+            Breaking Change: POSIX-extended and POSIX-basic regular expressions now
+            enforce the letter of the POSIX standard much more closely than before.
+          </li>
+<li class="listitem">
+            Added support for (?imsx-imsx) constructs.
+          </li>
+<li class="listitem">
+            Added support for lookbehind expressions (?&lt;=positive-lookbehind)
+            and (?&lt;!negative-lookbehind).
+          </li>
+<li class="listitem">
+            Added support for conditional expressions (?(assertion)true-expression|false-expression).
+          </li>
+<li class="listitem">
+            Added MFC/ATL string wrappers.
+          </li>
+<li class="listitem">
+            Added Unicode support; based on ICU.
+          </li>
+<li class="listitem">
+            Changed newline support to recognise \f as a line separator (all character
+            types), and \x85 as a line separator for wide characters / Unicode only.
+          </li>
+<li class="listitem">
+            Added a new format flag format_literal that treats the replace string
+            as a literal, rather than a Perl or Sed style format string.
+          </li>
+<li class="listitem">
+            Errors are now reported by throwing exceptions of type regex_error. The
+            types used previously - bad_expression and bad_pattern - are now just
+            typedefs for regex_error. Type regex_error has a couple of new members:
+            code() to report an error code rather than a string, and position() to
+            report where in the expression the error occurred.
+          </li>
+</ul></div>
+<h5>
+<a name="boost_regex.background.history.h23"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_32_1"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_32_1">Boost
+        1.32.1</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+            Fixed bug in partial matches of bounded repeats of '.'.
+          </li></ul></div>
+<h5>
+<a name="boost_regex.background.history.h24"></a>
+        <span class="phrase"><a name="boost_regex.background.history.boost_1_31_0"></a></span><a class="link" href="history.html#boost_regex.background.history.boost_1_31_0">Boost
+        1.31.0</a>
+      </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+            Completely rewritten pattern matching code - it is now up to 10 times
+            faster than before.
+          </li>
+<li class="listitem">
+            Reorganized documentation.
+          </li>
+<li class="listitem">
+            Deprecated all interfaces that are not part of the regular expression
+            standardization proposal.
+          </li>
+<li class="listitem">
+            Added regex_iterator and regex_token_iterator .
+          </li>
+<li class="listitem">
+            Added support for Perl style independent sub-expressions.
+          </li>
+<li class="listitem">
+            Added non-member operators to the sub_match class, so that you can compare
+            sub_match's with strings, or add them to a string to produce a new string.
+          </li>
+<li class="listitem">
+            Added experimental support for extended capture information.
+          </li>
+<li class="listitem">
+            Changed the match flags so that they are a distinct type (not an integer),
+            if you try to pass the match flags as an integer rather than match_flag_type
+            to the regex algorithms then you will now get a compiler error.
+          </li>
+</ul></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="acknowledgements.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance.html

@@ -0,0 +1,73 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Performance</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="faq.html" title="FAQ">
+<link rel="next" href="performance/section_id1378460593.html" title="Testing simple leftmost-longest matches (platform = linux, compiler = GNU C++ version 6.3.0)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="faq.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="performance/section_id1378460593.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.performance"></a><a class="link" href="performance.html" title="Performance">Performance</a>
+</h3></div></div></div>
+<div class="toc"><dl class="toc">
+<dt><span class="section"><a href="performance/section_id1378460593.html">Testing
+        simple leftmost-longest matches (platform = linux, compiler = GNU C++ version
+        6.3.0)</a></span></dt>
+<dt><span class="section"><a href="performance/section_id1675827111.html">Testing
+        Perl searches (platform = linux, compiler = GNU C++ version 6.3.0)</a></span></dt>
+<dt><span class="section"><a href="performance/section_id3141719723.html">Testing
+        simple leftmost-longest matches (platform = Windows x64, compiler = Microsoft
+        Visual C++ version 14.1)</a></span></dt>
+<dt><span class="section"><a href="performance/section_id3258595385.html">Testing
+        leftmost-longest searches (platform = Windows x64, compiler = Microsoft Visual
+        C++ version 14.1)</a></span></dt>
+<dt><span class="section"><a href="performance/section_id3261825021.html">Testing
+        simple Perl matches (platform = linux, compiler = GNU C++ version 6.3.0)</a></span></dt>
+<dt><span class="section"><a href="performance/section_id3752650613.html">Testing
+        Perl searches (platform = Windows x64, compiler = Microsoft Visual C++ version
+        14.1)</a></span></dt>
+<dt><span class="section"><a href="performance/section_id4128344975.html">Testing
+        simple Perl matches (platform = Windows x64, compiler = Microsoft Visual
+        C++ version 14.1)</a></span></dt>
+<dt><span class="section"><a href="performance/section_id4148872883.html">Testing
+        leftmost-longest searches (platform = linux, compiler = GNU C++ version 6.3.0)</a></span></dt>
+</dl></div>
+<p>
+        The performance of Boost.Regex in both recursive and non-recursive modes
+        should be broadly comparable to other regular expression libraries: recursive
+        mode is slightly faster (especially where memory allocation requires thread
+        synchronisation), but not by much. The following pages compare Boost.Regex
+        with various other regular expression libraries for the following compilers:
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="faq.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="performance/section_id1378460593.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance/section_id1378460593.html

@@ -0,0 +1,404 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Testing simple leftmost-longest matches (platform = linux, compiler = GNU C++ version 6.3.0)</title>
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../performance.html" title="Performance">
+<link rel="prev" href="../performance.html" title="Performance">
+<link rel="next" href="section_id1675827111.html" title="Testing Perl searches (platform = linux, compiler = GNU C++ version 6.3.0)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../performance.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id1675827111.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_regex.background.performance.section_id1378460593"></a><a class="link" href="section_id1378460593.html" title="Testing simple leftmost-longest matches (platform = linux, compiler = GNU C++ version 6.3.0)">Testing
+        simple leftmost-longest matches (platform = linux, compiler = GNU C++ version
+        6.3.0)</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_regex.background.performance.section_id1378460593.table_Testing_simple_leftmost_longest_matches_platform_linux_compiler_GNU_C_version_6_3_0_"></a><p class="title"><b>Table 8. Testing simple leftmost-longest matches (platform = linux, compiler
+          = GNU C++ version 6.3.0)</b></p>
+<div class="table-contents"><table class="table" summary="Testing simple leftmost-longest matches (platform = linux, compiler
+          = GNU C++ version 6.3.0)">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression<br> Text
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost 1.65
+                  </p>
+                </th>
+<th>
+                  <p>
+                    std::regex
+                  </p>
+                </th>
+<th>
+                  <p>
+                    POSIX
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">([[:digit:]]{4}[- ]){3}[[:digit:]]{3,4}</code><br>
+                    <code class="literal">1234-5678-1234-456</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.11<br> (669ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (603ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.70<br> (2234ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([0-9]+)(\-| |$)(.*)$</code><br> <code class="literal">100-
+                    this is a line of ftp response which contains a message string</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (781ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">4.52<br> (3530ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">12.72<br> (9933ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">bob.smith@foo.tv</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (937ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.26<br> (1184ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.06<br> (2864ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">foo12@foo.edu</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (892ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.29<br> (1150ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.95<br> (2628ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">john@johnmaddock.co.uk</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1160ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.31<br> (1517ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.29<br> (3818ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">+3.14159</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.58<br> (485ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.48<br> (455ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (307ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">-3.14159</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.50<br> (466ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.50<br> (464ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (310ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">123</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.10<br> (666ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.57<br> (338ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (215ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code><br>
+                    <code class="literal">12/12/2001</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.18<br> (373ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.10<br> (359ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (171ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code><br>
+                    <code class="literal">4/1/2001</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.27<br> (363ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.93<br> (309ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (160ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">EH10 2QQ</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.90<br> (473ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.19<br> (357ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (163ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">G1 1AA</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.56<br> (386ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.83<br> (277ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (151ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">SW1 1ZZ</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.46<br> (381ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.14<br> (331ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (155ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">abc</code><br> <code class="literal">abc</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.35<br> (324ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.11<br> (153ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (138ns)</span>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<br class="table-break">
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../performance.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id1675827111.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance/section_id1675827111.html

@@ -0,0 +1,451 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Testing Perl searches (platform = linux, compiler = GNU C++ version 6.3.0)</title>
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../performance.html" title="Performance">
+<link rel="prev" href="section_id1378460593.html" title="Testing simple leftmost-longest matches (platform = linux, compiler = GNU C++ version 6.3.0)">
+<link rel="next" href="section_id3141719723.html" title="Testing simple leftmost-longest matches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id1378460593.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id3141719723.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_regex.background.performance.section_id1675827111"></a><a class="link" href="section_id1675827111.html" title="Testing Perl searches (platform = linux, compiler = GNU C++ version 6.3.0)">Testing
+        Perl searches (platform = linux, compiler = GNU C++ version 6.3.0)</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_regex.background.performance.section_id1675827111.table_Testing_Perl_searches_platform_linux_compiler_GNU_C_version_6_3_0_"></a><p class="title"><b>Table 9. Testing Perl searches (platform = linux, compiler = GNU C++ version
+          6.3.0)</b></p>
+<div class="table-contents"><table class="table" summary="Testing Perl searches (platform = linux, compiler = GNU C++ version
+          6.3.0)">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression<br> Text
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost 1.65
+                  </p>
+                </th>
+<th>
+                  <p>
+                    std::regex
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost::xpressive::cregex
+                  </p>
+                </th>
+<th>
+                  <p>
+                    PCRE-10.21
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;a[^&gt;]+href=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.63<br> (28838ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.67<br> (29436ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (17678ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;font[^&gt;]+face=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;.*?&lt;/font&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.78<br> (19366ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.50<br> (10471ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (6963ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;h[12345678][^&gt;]*&gt;.*?&lt;/h[12345678]&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.95<br> (17081ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.18<br> (19086ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (8745ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;img[^&gt;]+src=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.61<br> (18132ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.61<br> (11211ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (6952ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;p&gt;.*?&lt;/p&gt;</code><br> In file:
+                    ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.69<br> (17517ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.51<br> (15645ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (10345ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(\w+)\s*(\([^()]++(?:(?2)[^()]++)*+[^)]*\))\s*(\{[^{}]++((?3)[^{}]++)*+[^}]*+\})</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1500580ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.84<br> (4260530ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(^[ \t]*#(?:(?&gt;[^\\\n]+)|\\(?&gt;\s*\n|.))*)|</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.64<br> (14163004ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (8632111ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.03<br> (8907897ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(template[[:space:]]*&lt;[^;:{]+&gt;[[:space:]]*)?(class|struct)[[:space:]]*(\w+([
+                    ]*\([^)]*\))?[\u0 ...</code><br> In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.72<br> (13046296ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.61<br> (27370747ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (7585304ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.98<br> (14992880ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">Beman|John|Dave</code><br> In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (5021ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">36.75<br> (184532ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.40<br> (7046ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.19<br> (5966ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">\w+\s*(\([^()]++(?:(?1)[^()]++)*+[^)]*\))</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1551419ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.58<br> (2444759ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">\{[^{}]++((?0)[^{}]++)*+[^}]*+\}</code><br> In
+                    file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.31<br> (200846ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (153117ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[ ]*#[ ]*include[ ]+("[^"]+"|&lt;[^&gt;]+&gt;)</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.46<br> (234901ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">11.35<br> (1821532ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (160446ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.35<br> (215802ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[ ]*#[ ]*include[ ]+("boost/[^"]+"|&lt;boost/[^&gt;]+&gt;)</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.41<br> (234377ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">11.47<br> (1903901ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (165921ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.31<br> (217806ns)</span>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<br class="table-break">
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id1378460593.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id3141719723.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance/section_id3141719723.html

@@ -0,0 +1,328 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Testing simple leftmost-longest matches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)</title>
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../performance.html" title="Performance">
+<link rel="prev" href="section_id1675827111.html" title="Testing Perl searches (platform = linux, compiler = GNU C++ version 6.3.0)">
+<link rel="next" href="section_id3258595385.html" title="Testing leftmost-longest searches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id1675827111.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id3258595385.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_regex.background.performance.section_id3141719723"></a><a class="link" href="section_id3141719723.html" title="Testing simple leftmost-longest matches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">Testing
+        simple leftmost-longest matches (platform = Windows x64, compiler = Microsoft
+        Visual C++ version 14.1)</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_regex.background.performance.section_id3141719723.table_Testing_simple_leftmost_longest_matches_platform_Windows_x64_compiler_Microsoft_Visual_C_version_14_1_"></a><p class="title"><b>Table 10. Testing simple leftmost-longest matches (platform = Windows x64,
+          compiler = Microsoft Visual C++ version 14.1)</b></p>
+<div class="table-contents"><table class="table" summary="Testing simple leftmost-longest matches (platform = Windows x64,
+          compiler = Microsoft Visual C++ version 14.1)">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression<br> Text
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost 1.65
+                  </p>
+                </th>
+<th>
+                  <p>
+                    std::regex
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">([[:digit:]]{4}[- ]){3}[[:digit:]]{3,4}</code><br>
+                    <code class="literal">1234-5678-1234-456</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (554ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">11.06<br> (6127ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([0-9]+)(\-| |$)(.*)$</code><br> <code class="literal">100-
+                    this is a line of ftp response which contains a message string</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (679ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">bob.smith@foo.tv</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1444ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">foo12@foo.edu</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1397ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">john@johnmaddock.co.uk</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1588ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">+3.14159</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (466ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">11.18<br> (5208ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">-3.14159</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (519ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">9.79<br> (5083ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">123</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (619ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">7.64<br> (4730ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code><br>
+                    <code class="literal">12/12/2001</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (449ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">5.23<br> (2347ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code><br>
+                    <code class="literal">4/1/2001</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (362ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">6.48<br> (2344ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">EH10 2QQ</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1090ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.48<br> (2699ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">G1 1AA</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (348ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">6.57<br> (2288ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">SW1 1ZZ</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (358ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">6.41<br> (2296ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">abc</code><br> <code class="literal">abc</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (375ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.30<br> (864ns)</span>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<br class="table-break">
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id1675827111.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id3258595385.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance/section_id3258595385.html

@@ -0,0 +1,130 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Testing leftmost-longest searches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)</title>
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../performance.html" title="Performance">
+<link rel="prev" href="section_id3141719723.html" title="Testing simple leftmost-longest matches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">
+<link rel="next" href="section_id3261825021.html" title="Testing simple Perl matches (platform = linux, compiler = GNU C++ version 6.3.0)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id3141719723.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id3261825021.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_regex.background.performance.section_id3258595385"></a><a class="link" href="section_id3258595385.html" title="Testing leftmost-longest searches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">Testing
+        leftmost-longest searches (platform = Windows x64, compiler = Microsoft Visual
+        C++ version 14.1)</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_regex.background.performance.section_id3258595385.table_Testing_leftmost_longest_searches_platform_Windows_x64_compiler_Microsoft_Visual_C_version_14_1_"></a><p class="title"><b>Table 11. Testing leftmost-longest searches (platform = Windows x64, compiler
+          = Microsoft Visual C++ version 14.1)</b></p>
+<div class="table-contents"><table class="table" summary="Testing leftmost-longest searches (platform = Windows x64, compiler
+          = Microsoft Visual C++ version 14.1)">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression<br> Text
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost 1.65
+                  </p>
+                </th>
+<th>
+                  <p>
+                    std::regex
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">&lt;a[^&gt;]+href=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (80801ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">6.82<br> (551022ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">&lt;img[^&gt;]+src=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (19868ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">4.23<br> (84068ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">Beman|John|Dave</code><br> In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (10508ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.37<br> (35378ns)</span>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<br class="table-break">
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id3141719723.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id3261825021.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance/section_id3261825021.html

@@ -0,0 +1,479 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Testing simple Perl matches (platform = linux, compiler = GNU C++ version 6.3.0)</title>
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../performance.html" title="Performance">
+<link rel="prev" href="section_id3258595385.html" title="Testing leftmost-longest searches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">
+<link rel="next" href="section_id3752650613.html" title="Testing Perl searches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id3258595385.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id3752650613.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_regex.background.performance.section_id3261825021"></a><a class="link" href="section_id3261825021.html" title="Testing simple Perl matches (platform = linux, compiler = GNU C++ version 6.3.0)">Testing
+        simple Perl matches (platform = linux, compiler = GNU C++ version 6.3.0)</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_regex.background.performance.section_id3261825021.table_Testing_simple_Perl_matches_platform_linux_compiler_GNU_C_version_6_3_0_"></a><p class="title"><b>Table 12. Testing simple Perl matches (platform = linux, compiler = GNU C++
+          version 6.3.0)</b></p>
+<div class="table-contents"><table class="table" summary="Testing simple Perl matches (platform = linux, compiler = GNU C++
+          version 6.3.0)">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression<br> Text
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost 1.65
+                  </p>
+                </th>
+<th>
+                  <p>
+                    std::regex
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost::xpressive::cregex
+                  </p>
+                </th>
+<th>
+                  <p>
+                    PCRE-10.21
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">([[:digit:]]{4}[- ]){3}[[:digit:]]{3,4}</code><br>
+                    <code class="literal">1234-5678-1234-456</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.65<br> (506ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.86<br> (546ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (191ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.37<br> (262ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([0-9]+)(\-| |$)(.*)$</code><br> <code class="literal">100-
+                    this is a line of ftp response which contains a message string</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.52<br> (353ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">20.99<br> (2939ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (140ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.50<br> (490ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">bob.smith@foo.tv</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.98<br> (681ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (344ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.32<br> (454ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">foo12@foo.edu</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.06<br> (695ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (337ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.34<br> (451ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">john@johnmaddock.co.uk</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.93<br> (821ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (425ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.24<br> (526ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">+3.14159</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.34<br> (243ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">4.45<br> (463ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (104ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.62<br> (168ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">-3.14159</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.33<br> (245ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">4.39<br> (461ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (105ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.60<br> (168ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">123</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.08<br> (208ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.31<br> (331ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (100ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.52<br> (152ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code><br>
+                    <code class="literal">12/12/2001</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.28<br> (237ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.39<br> (353ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (104ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.18<br> (123ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code><br>
+                    <code class="literal">4/1/2001</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.12<br> (216ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.02<br> (308ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (102ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.19<br> (121ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">EH10 2QQ</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.12<br> (257ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.66<br> (322ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (121ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.17<br> (142ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">G1 1AA</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.00<br> (230ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.65<br> (305ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (115ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.22<br> (140ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">SW1 1ZZ</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.05<br> (244ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.81<br> (334ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (119ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.22<br> (145ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">abc</code><br> <code class="literal">abc</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.65<br> (135ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.83<br> (150ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (82ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.02<br> (84ns)</span>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<br class="table-break">
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id3258595385.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id3752650613.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance/section_id3752650613.html

@@ -0,0 +1,523 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Testing Perl searches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)</title>
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../performance.html" title="Performance">
+<link rel="prev" href="section_id3261825021.html" title="Testing simple Perl matches (platform = linux, compiler = GNU C++ version 6.3.0)">
+<link rel="next" href="section_id4128344975.html" title="Testing simple Perl matches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id3261825021.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id4128344975.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_regex.background.performance.section_id3752650613"></a><a class="link" href="section_id3752650613.html" title="Testing Perl searches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">Testing
+        Perl searches (platform = Windows x64, compiler = Microsoft Visual C++ version
+        14.1)</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_regex.background.performance.section_id3752650613.table_Testing_Perl_searches_platform_Windows_x64_compiler_Microsoft_Visual_C_version_14_1_"></a><p class="title"><b>Table 13. Testing Perl searches (platform = Windows x64, compiler = Microsoft
+          Visual C++ version 14.1)</b></p>
+<div class="table-contents"><table class="table" summary="Testing Perl searches (platform = Windows x64, compiler = Microsoft
+          Visual C++ version 14.1)">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression<br> Text
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost 1.65
+                  </p>
+                </th>
+<th>
+                  <p>
+                    PCRE-10.10
+                  </p>
+                </th>
+<th>
+                  <p>
+                    RE2
+                  </p>
+                </th>
+<th>
+                  <p>
+                    std::regex
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost::xpressive::cregex
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;a[^&gt;]+href=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.36<br> (21565ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (15821ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.08<br> (17111ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.89<br> (45731ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;font[^&gt;]+face=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;.*?&lt;/font&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.05<br> (16442ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.58<br> (8492ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (5385ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.31<br> (17804ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;h[12345678][^&gt;]*&gt;.*?&lt;/h[12345678]&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.11<br> (15434ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.31<br> (9615ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (7315ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">4.28<br> (31331ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;img[^&gt;]+src=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.73<br> (16457ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.41<br> (8503ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (6023ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.14<br> (18913ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(?i)&lt;p&gt;.*?&lt;/p&gt;</code><br> In file:
+                    ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.32<br> (15717ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.57<br> (10652ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (6789ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">3.76<br> (25542ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(\w+)\s*(\([^()]++(?:(?2)[^()]++)*+[^)]*\))\s*(\{[^{}]++((?3)[^{}]++)*+[^}]*+\})</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1125008ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.90<br> (3265708ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(^[ \t]*#(?:(?&gt;[^\\\n]+)|\\(?&gt;\s*\n|.))*)|</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.55<br> (11035845ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (7123895ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.46<br> (10415180ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">(template[[:space:]]*&lt;[^;:{]+&gt;[[:space:]]*)?(class|struct)[[:space:]]*(\w+([
+                    ]*\([^)]*\))?[\u0 ...</code><br> In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">26.17<br> (8436744ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">32.97<br> (10629852ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (322399ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">811.84<br> (261737971ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">23.34<br> (7526351ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">Beman|John|Dave</code><br> In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.58<br> (10246ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (6487ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.48<br> (16109ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">5.39<br> (34994ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.09<br> (7046ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">\w+\s*(\([^()]++(?:(?1)[^()]++)*+[^)]*\))</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (1152646ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.70<br> (1962067ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">\{[^{}]++((?0)[^{}]++)*+[^}]*+\}</code><br> In
+                    file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.62<br> (255439ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (158034ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="grey">-</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[ ]*#[ ]*include[ ]+("[^"]+"|&lt;[^&gt;]+&gt;)</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.48<br> (268270ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.08<br> (195553ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.78<br> (323879ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">7.75<br> (1406976ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (181554ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[ ]*#[ ]*include[ ]+("boost/[^"]+"|&lt;boost/[^&gt;]+&gt;)</code><br>
+                    In file: boost/multiprecision/number.hpp
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.48<br> (268560ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.08<br> (195915ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.76<br> (319886ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">7.72<br> (1398962ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (181328ns)</span>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<br class="table-break">
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id3261825021.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id4128344975.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance/section_id4128344975.html

@@ -0,0 +1,556 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Testing simple Perl matches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)</title>
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../performance.html" title="Performance">
+<link rel="prev" href="section_id3752650613.html" title="Testing Perl searches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">
+<link rel="next" href="section_id4148872883.html" title="Testing leftmost-longest searches (platform = linux, compiler = GNU C++ version 6.3.0)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id3752650613.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id4148872883.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_regex.background.performance.section_id4128344975"></a><a class="link" href="section_id4128344975.html" title="Testing simple Perl matches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">Testing
+        simple Perl matches (platform = Windows x64, compiler = Microsoft Visual
+        C++ version 14.1)</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_regex.background.performance.section_id4128344975.table_Testing_simple_Perl_matches_platform_Windows_x64_compiler_Microsoft_Visual_C_version_14_1_"></a><p class="title"><b>Table 14. Testing simple Perl matches (platform = Windows x64, compiler =
+          Microsoft Visual C++ version 14.1)</b></p>
+<div class="table-contents"><table class="table" summary="Testing simple Perl matches (platform = Windows x64, compiler =
+          Microsoft Visual C++ version 14.1)">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression<br> Text
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost 1.65
+                  </p>
+                </th>
+<th>
+                  <p>
+                    PCRE-10.10
+                  </p>
+                </th>
+<th>
+                  <p>
+                    RE2
+                  </p>
+                </th>
+<th>
+                  <p>
+                    std::regex
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost::xpressive::cregex
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">([[:digit:]]{4}[- ]){3}[[:digit:]]{3,4}</code><br>
+                    <code class="literal">1234-5678-1234-456</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.90<br> (328ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.18<br> (205ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (173ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">27.81<br> (4811ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.32<br> (228ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([0-9]+)(\-| |$)(.*)$</code><br> <code class="literal">100-
+                    this is a line of ftp response which contains a message string</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.45<br> (251ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.73<br> (300ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.14<br> (371ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">24.75<br> (4281ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (173ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">bob.smith@foo.tv</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.53<br> (403ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.13<br> (338ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (159ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">34.16<br> (5432ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.86<br> (295ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">foo12@foo.edu</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.75<br> (402ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.34<br> (342ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (146ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">40.78<br> (5954ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.01<br> (294ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\
+                    ...</code><br> <code class="literal">john@johnmaddock.co.uk</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.54<br> (469ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.16<br> (399ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (185ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">44.27<br> (8190ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.04<br> (377ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">+3.14159</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.53<br> (171ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.14<br> (128ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.11<br> (124ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">21.63<br> (2422ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (112ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">-3.14159</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.50<br> (167ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.15<br> (128ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.13<br> (125ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">21.92<br> (2433ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (111ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code><br>
+                    <code class="literal">123</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.40<br> (143ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.15<br> (117ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.03<br> (105ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">35.65<br> (3636ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (102ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code><br>
+                    <code class="literal">12/12/2001</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.47<br> (157ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (107ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.27<br> (136ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">16.75<br> (1792ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.03<br> (110ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code><br>
+                    <code class="literal">4/1/2001</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.39<br> (145ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (104ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.13<br> (117ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">16.90<br> (1758ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.07<br> (111ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">EH10 2QQ</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.44<br> (164ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (114ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.10<br> (125ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">15.61<br> (1779ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.06<br> (121ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">G1 1AA</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.36<br> (152ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (112ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.04<br> (117ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">15.86<br> (1776ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.05<br> (118ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code><br>
+                    <code class="literal">SW1 1ZZ</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.40<br> (158ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (113ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.10<br> (124ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">15.86<br> (1792ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.07<br> (121ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">abc</code><br> <code class="literal">abc</code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">2.01<br> (141ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (70ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.17<br> (82ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">8.24<br> (577ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.19<br> (83ns)</span>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<br class="table-break">
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id3752650613.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="section_id4148872883.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/performance/section_id4148872883.html

@@ -0,0 +1,150 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Testing leftmost-longest searches (platform = linux, compiler = GNU C++ version 6.3.0)</title>
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../performance.html" title="Performance">
+<link rel="prev" href="section_id4128344975.html" title="Testing simple Perl matches (platform = Windows x64, compiler = Microsoft Visual C++ version 14.1)">
+<link rel="next" href="../standards.html" title="Standards Conformance">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id4128344975.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../standards.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_regex.background.performance.section_id4148872883"></a><a class="link" href="section_id4148872883.html" title="Testing leftmost-longest searches (platform = linux, compiler = GNU C++ version 6.3.0)">Testing
+        leftmost-longest searches (platform = linux, compiler = GNU C++ version 6.3.0)</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_regex.background.performance.section_id4148872883.table_Testing_leftmost_longest_searches_platform_linux_compiler_GNU_C_version_6_3_0_"></a><p class="title"><b>Table 15. Testing leftmost-longest searches (platform = linux, compiler =
+          GNU C++ version 6.3.0)</b></p>
+<div class="table-contents"><table class="table" summary="Testing leftmost-longest searches (platform = linux, compiler =
+          GNU C++ version 6.3.0)">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression<br> Text
+                  </p>
+                </th>
+<th>
+                  <p>
+                    boost 1.65
+                  </p>
+                </th>
+<th>
+                  <p>
+                    std::regex
+                  </p>
+                </th>
+<th>
+                  <p>
+                    POSIX
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">&lt;a[^&gt;]+href=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (107026ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.44<br> (154551ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.64<br> (175184ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">&lt;img[^&gt;]+src=("[^"]*"|[^[:space:]]+)[^&gt;]*&gt;</code><br>
+                    In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (15420ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">6.89<br> (106275ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="blue">1.59<br> (24567ns)</span>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="literal">Beman|John|Dave</code><br> In file: ..<span class="emphasis"><em>..</em></span>../libs/libraries.htm
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.03<br> (5399ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="red">36.27<br> (190577ns)</span>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <span class="green">1.00<br> (5254ns)</span>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<br class="table-break">
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="section_id4128344975.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../performance.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../standards.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/redist.html

@@ -0,0 +1,61 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Redistributables</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="standards.html" title="Standards Conformance">
+<link rel="next" href="acknowledgements.html" title="Acknowledgements">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="standards.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.redist"></a><a class="link" href="redist.html" title="Redistributables">Redistributables</a>
+</h3></div></div></div>
+<p>
+        If you are using Microsoft or Borland C++ and link to a dll version of the
+        run time library, then you can choose to also link to a dll version of Boost.Regex
+        by defining the symbol BOOST_REGEX_DYN_LINK when you compile your code. While
+        these dll's are redistributable, there are no "standard" versions,
+        so when installing on the users PC, you should place these in a directory
+        private to your application, and not in the PC's directory path. Note that
+        if you link to a static version of your run time library, then you will also
+        link to a static version of Boost.Regex and no dll's will need to be distributed.
+        The possible Boost.Regex dll and library names are computed according to
+        the formula given in <a href="../../../../../../more/getting_started.html" target="_top">the
+        getting started guide</a>.
+      </p>
+<p>
+        Note: you can disable automatic library selection by defining the symbol
+        BOOST_REGEX_NO_LIB when compiling, this is useful if you want to build Boost.Regex
+        yourself in your IDE, or if you need to debug Boost.Regex.
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="standards.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/standards.html

@@ -0,0 +1,573 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Standards Conformance</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="performance/section_id4148872883.html" title="Testing leftmost-longest searches (platform = linux, compiler = GNU C++ version 6.3.0)">
+<link rel="next" href="redist.html" title="Redistributables">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="performance/section_id4148872883.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="redist.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.standards"></a><a class="link" href="standards.html" title="Standards Conformance">Standards Conformance</a>
+</h3></div></div></div>
+<h5>
+<a name="boost_regex.background.standards.h0"></a>
+        <span class="phrase"><a name="boost_regex.background.standards.c"></a></span><a class="link" href="standards.html#boost_regex.background.standards.c">C++</a>
+      </h5>
+<p>
+        Boost.Regex is intended to conform to the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
+        Report on C++ Library Extensions</a>.
+      </p>
+<h5>
+<a name="boost_regex.background.standards.h1"></a>
+        <span class="phrase"><a name="boost_regex.background.standards.ecmascript_javascript"></a></span><a class="link" href="standards.html#boost_regex.background.standards.ecmascript_javascript">ECMAScript
+        / JavaScript</a>
+      </h5>
+<p>
+        All of the ECMAScript regular expression syntax features are supported, except
+        that:
+      </p>
+<p>
+        The escape sequence \u matches any upper case character (the same as [[:upper:]])
+        rather than a Unicode escape sequence; use \x{DDDD} for Unicode escape sequences.
+      </p>
+<h5>
+<a name="boost_regex.background.standards.h2"></a>
+        <span class="phrase"><a name="boost_regex.background.standards.perl"></a></span><a class="link" href="standards.html#boost_regex.background.standards.perl">Perl</a>
+      </h5>
+<p>
+        Almost all Perl features are supported, except for:
+      </p>
+<p>
+        (?{code}) Not implementable in a compiled strongly typed language.
+      </p>
+<p>
+        (??{code}) Not implementable in a compiled strongly typed language.
+      </p>
+<p>
+        (*VERB) The <a href="http://perldoc.perl.org/perlre.html#Special-Backtracking-Control-Verbs" target="_top">backtracking
+        control verbs</a> are not recognised or implemented at this time.
+      </p>
+<p>
+        In addition the following features behave slightly differently from Perl:
+      </p>
+<p>
+        ^ $ \Z These recognise any line termination sequence, and not just \n: see
+        the Unicode requirements below.
+      </p>
+<h5>
+<a name="boost_regex.background.standards.h3"></a>
+        <span class="phrase"><a name="boost_regex.background.standards.posix"></a></span><a class="link" href="standards.html#boost_regex.background.standards.posix">POSIX</a>
+      </h5>
+<p>
+        All the POSIX basic and extended regular expression features are supported,
+        except that:
+      </p>
+<p>
+        No character collating names are recognized except those specified in the
+        POSIX standard for the C locale, unless they are explicitly registered with
+        the traits class.
+      </p>
+<p>
+        Character equivalence classes ( [[=a=]] etc) are probably buggy except on
+        Win32. Implementing this feature requires knowledge of the format of the
+        string sort keys produced by the system; if you need this, and the default
+        implementation doesn't work on your platform, then you will need to supply
+        a custom traits class.
+      </p>
+<h5>
+<a name="boost_regex.background.standards.h4"></a>
+        <span class="phrase"><a name="boost_regex.background.standards.unicode"></a></span><a class="link" href="standards.html#boost_regex.background.standards.unicode">Unicode</a>
+      </h5>
+<p>
+        The following comments refer to <a href="http://unicode.org/reports/tr18/" target="_top">Unicode
+        Technical Standard #18: Unicode Regular Expressions version 11</a>.
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Item
+                </p>
+              </th>
+<th>
+                <p>
+                  Feature
+                </p>
+              </th>
+<th>
+                <p>
+                  Support
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  1.1
+                </p>
+              </td>
+<td>
+                <p>
+                  Hex Notation
+                </p>
+              </td>
+<td>
+                <p>
+                  Yes: use \x{DDDD} to refer to code point UDDDD.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  1.2
+                </p>
+              </td>
+<td>
+                <p>
+                  Character Properties
+                </p>
+              </td>
+<td>
+                <p>
+                  All the names listed under the General Category Property are supported.
+                  Script names and Other Names are not currently supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  1.3
+                </p>
+              </td>
+<td>
+                <p>
+                  Subtraction and Intersection
+                </p>
+              </td>
+<td>
+                <p>
+                  Indirectly support by forward-lookahead:
+                </p>
+                <p>
+                  <code class="computeroutput"><span class="special">(?=[[:</span><span class="identifier">X</span><span class="special">:]])[[:</span><span class="identifier">Y</span><span class="special">:]]</span></code>
+                </p>
+                <p>
+                  Gives the intersection of character properties X and Y.
+                </p>
+                <p>
+                  <code class="computeroutput"><span class="special">(?![[:</span><span class="identifier">X</span><span class="special">:]])[[:</span><span class="identifier">Y</span><span class="special">:]]</span></code>
+                </p>
+                <p>
+                  Gives everything in Y that is not in X (subtraction).
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  1.4
+                </p>
+              </td>
+<td>
+                <p>
+                  Simple Word Boundaries
+                </p>
+              </td>
+<td>
+                <p>
+                  Conforming: non-spacing marks are included in the set of word characters.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  1.5
+                </p>
+              </td>
+<td>
+                <p>
+                  Caseless Matching
+                </p>
+              </td>
+<td>
+                <p>
+                  Supported, note that at this level, case transformations are 1:1,
+                  many to many case folding operations are not supported (for example
+                  "ß" to "SS").
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  1.6
+                </p>
+              </td>
+<td>
+                <p>
+                  Line Boundaries
+                </p>
+              </td>
+<td>
+                <p>
+                  Supported, except that "." matches only one character
+                  of "\r\n". Other than that word boundaries match correctly;
+                  including not matching in the middle of a "\r\n" sequence.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  1.7
+                </p>
+              </td>
+<td>
+                <p>
+                  Code Points
+                </p>
+              </td>
+<td>
+                <p>
+                  Supported: provided you use the u32* algorithms, then UTF-8, UTF-16
+                  and UTF-32 are all treated as sequences of 32-bit code points.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  2.1
+                </p>
+              </td>
+<td>
+                <p>
+                  Canonical Equivalence
+                </p>
+              </td>
+<td>
+                <p>
+                  Not supported: it is up to the user of the library to convert all
+                  text into the same canonical form as the regular expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  2.2
+                </p>
+              </td>
+<td>
+                <p>
+                  Default Grapheme Clusters
+                </p>
+              </td>
+<td>
+                <p>
+                  Not supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  2.3Default Word Boundaries
+                </p>
+              </td>
+<td>
+                <p>
+                  Not supported.
+                </p>
+              </td>
+<td class="auto-generated"> </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  2.4
+                </p>
+              </td>
+<td>
+                <p>
+                  Default Loose Matches
+                </p>
+              </td>
+<td>
+                <p>
+                  Not Supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  2.5
+                </p>
+              </td>
+<td>
+                <p>
+                  Named Properties
+                </p>
+              </td>
+<td>
+                <p>
+                  Supported: the expression "[[:name:]]" or \N{name} matches
+                  the named character "name".
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  2.6
+                </p>
+              </td>
+<td>
+                <p>
+                  Wildcard properties
+                </p>
+              </td>
+<td>
+                <p>
+                  Not Supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.1
+                </p>
+              </td>
+<td>
+                <p>
+                  Tailored Punctuation.
+                </p>
+              </td>
+<td>
+                <p>
+                  Not Supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.2
+                </p>
+              </td>
+<td>
+                <p>
+                  Tailored Grapheme Clusters
+                </p>
+              </td>
+<td>
+                <p>
+                  Not Supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.3
+                </p>
+              </td>
+<td>
+                <p>
+                  Tailored Word Boundaries.
+                </p>
+              </td>
+<td>
+                <p>
+                  Not Supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.4
+                </p>
+              </td>
+<td>
+                <p>
+                  Tailored Loose Matches
+                </p>
+              </td>
+<td>
+                <p>
+                  Partial support: [[=c=]] matches characters with the same primary
+                  equivalence class as "c".
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.5
+                </p>
+              </td>
+<td>
+                <p>
+                  Tailored Ranges
+                </p>
+              </td>
+<td>
+                <p>
+                  Supported: [a-b] matches any character that collates in the range
+                  a to b, when the expression is constructed with the collate flag
+                  set.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.6
+                </p>
+              </td>
+<td>
+                <p>
+                  Context Matches
+                </p>
+              </td>
+<td>
+                <p>
+                  Not Supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.7
+                </p>
+              </td>
+<td>
+                <p>
+                  Incremental Matches
+                </p>
+              </td>
+<td>
+                <p>
+                  Supported: pass the flag <code class="computeroutput"><span class="identifier">match_partial</span></code>
+                  to the regex algorithms.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.8
+                </p>
+              </td>
+<td>
+                <p>
+                  Unicode Set Sharing
+                </p>
+              </td>
+<td>
+                <p>
+                  Not Supported.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.9
+                </p>
+              </td>
+<td>
+                <p>
+                  Possible Match Sets
+                </p>
+              </td>
+<td>
+                <p>
+                  Not supported, however this information is used internally to optimise
+                  the matching of regular expressions, and return quickly if no match
+                  is possible.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.10
+                </p>
+              </td>
+<td>
+                <p>
+                  Folded Matching
+                </p>
+              </td>
+<td>
+                <p>
+                  Partial Support: It is possible to achieve a similar effect by
+                  using a custom regular expression traits class.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  3.11
+                </p>
+              </td>
+<td>
+                <p>
+                  Custom Submatch Evaluation
+                </p>
+              </td>
+<td>
+                <p>
+                  Not Supported.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="performance/section_id4148872883.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="redist.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/background/thread_safety.html

@@ -0,0 +1,84 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Thread Safety</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../background.html" title="Background Information">
+<link rel="prev" href="locale.html" title="Localization">
+<link rel="next" href="examples.html" title="Test and Example Programs">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="locale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.background.thread_safety"></a><a class="link" href="thread_safety.html" title="Thread Safety">Thread Safety</a>
+</h3></div></div></div>
+<p>
+        The Boost.Regex library is thread safe when Boost is: you can verify that
+        Boost is in thread safe mode by checking to see if <code class="computeroutput"><span class="identifier">BOOST_HAS_THREADS</span></code>
+        is defined: this macro is set automatically by the config system when threading
+        support is turned on in your compiler.
+      </p>
+<p>
+        Class <a class="link" href="../ref/basic_regex.html" title="basic_regex"><code class="computeroutput"><span class="identifier">basic_regex</span></code></a>
+        and its typedefs regex and wregex are thread safe, in that compiled regular
+        expressions can safely be shared between threads. The matching algorithms
+        <a class="link" href="../ref/regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a>,
+        <a class="link" href="../ref/regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a>,
+        and <a class="link" href="../ref/regex_replace.html" title="regex_replace"><code class="computeroutput"><span class="identifier">regex_replace</span></code></a>
+        are all re-entrant and thread safe. Class <a class="link" href="../ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a> is now thread safe,
+        in that the results of a match can be safely copied from one thread to another
+        (for example one thread may find matches and push <a class="link" href="../ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a> instances onto a queue,
+        while another thread pops them off the other end), otherwise use a separate
+        instance of <a class="link" href="../ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a>
+        per thread.
+      </p>
+<p>
+        The <a class="link" href="../ref/posix.html" title="POSIX Compatible C API's">POSIX API functions</a> are
+        all re-entrant and thread safe, regular expressions compiled with regcomp
+        can also be shared between threads.
+      </p>
+<p>
+        The <a class="link" href="../ref/deprecated/old_regex.html" title="High Level Class RegEx (Deprecated)">class RegEx</a>
+        is only thread safe if each thread gets its own RegEx instance (apartment
+        threading) - this is a consequence of RegEx handling both compiling and matching
+        regular expressions.
+      </p>
+<p>
+        Finally note that changing the global locale invalidates all compiled regular
+        expressions, therefore calling <code class="computeroutput"><span class="identifier">set_locale</span></code>
+        from one thread while another uses regular expressions will produce unpredictable
+        results.
+      </p>
+<p>
+        There is also a requirement that there is only one thread executing prior
+        to the start of main().
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="locale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../background.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/captures.html

@@ -0,0 +1,386 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Understanding Marked Sub-Expressions and Captures</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="prev" href="unicode.html" title="Unicode and Boost.Regex">
+<link rel="next" href="partial_matches.html" title="Partial Matches">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="unicode.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partial_matches.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_regex.captures"></a><a class="link" href="captures.html" title="Understanding Marked Sub-Expressions and Captures">Understanding Marked Sub-Expressions
+    and Captures</a>
+</h2></div></div></div>
+<p>
+      Captures are the iterator ranges that are "captured" by marked sub-expressions
+      as a regular expression gets matched. Each marked sub-expression can result
+      in more than one capture, if it is matched more than once. This document explains
+      how captures and marked sub-expressions in Boost.Regex are represented and
+      accessed.
+    </p>
+<h5>
+<a name="boost_regex.captures.h0"></a>
+      <span class="phrase"><a name="boost_regex.captures.marked_sub_expressions"></a></span><a class="link" href="captures.html#boost_regex.captures.marked_sub_expressions">Marked
+      sub-expressions</a>
+    </h5>
+<p>
+      Every time a Perl regular expression contains a parenthesis group <code class="computeroutput"><span class="special">()</span></code>, it spits out an extra field, known as a
+      marked sub-expression, for example the expression:
+    </p>
+<pre class="programlisting">(\w+)\W+(\w+)</pre>
+<p>
+      Has two marked sub-expressions (known as $1 and $2 respectively), in addition
+      the complete match is known as $&amp;, everything before the first match as
+      $`, and everything after the match as $'. So if the above expression is searched
+      for within <code class="computeroutput"><span class="string">"@abc def--"</span></code>,
+      then we obtain:
+    </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+              <p>
+                Sub-expression
+              </p>
+            </th>
+<th>
+              <p>
+                Text found
+              </p>
+            </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+              <p>
+                $`
+              </p>
+            </td>
+<td>
+              <p>
+                "@"
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                $&amp;
+              </p>
+            </td>
+<td>
+              <p>
+                "abc def"
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                $1
+              </p>
+            </td>
+<td>
+              <p>
+                "abc"
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                $2
+              </p>
+            </td>
+<td>
+              <p>
+                "def"
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                $'
+              </p>
+            </td>
+<td>
+              <p>
+                "--"
+              </p>
+            </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+      In Boost.Regex all these are accessible via the <a class="link" href="ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a> class that gets filled
+      in when calling one of the regular expression matching algorithms ( <a class="link" href="ref/regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a>, <a class="link" href="ref/regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a>, or <a class="link" href="ref/regex_iterator.html" title="regex_iterator"><code class="computeroutput"><span class="identifier">regex_iterator</span></code></a>). So given:
+    </p>
+<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_results</span><span class="special">&lt;</span><span class="identifier">IteratorType</span><span class="special">&gt;</span> <span class="identifier">m</span><span class="special">;</span>
+</pre>
+<p>
+      The Perl and Boost.Regex equivalents are as follows:
+    </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+              <p>
+                Perl
+              </p>
+            </th>
+<th>
+              <p>
+                Boost.Regex
+              </p>
+            </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+              <p>
+                $`
+              </p>
+            </td>
+<td>
+              <p>
+                <code class="computeroutput"><span class="identifier">m</span><span class="special">.</span><span class="identifier">prefix</span><span class="special">()</span></code>
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                $&amp;
+              </p>
+            </td>
+<td>
+              <p>
+                <code class="computeroutput"><span class="identifier">m</span><span class="special">[</span><span class="number">0</span><span class="special">]</span></code>
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                $n
+              </p>
+            </td>
+<td>
+              <p>
+                <code class="computeroutput"><span class="identifier">m</span><span class="special">[</span><span class="identifier">n</span><span class="special">]</span></code>
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                $'
+              </p>
+            </td>
+<td>
+              <p>
+                <code class="computeroutput"><span class="identifier">m</span><span class="special">.</span><span class="identifier">suffix</span><span class="special">()</span></code>
+              </p>
+            </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+      In Boost.Regex each sub-expression match is represented by a <a class="link" href="ref/sub_match.html" title="sub_match"><code class="computeroutput"><span class="identifier">sub_match</span></code></a> object, this is basically
+      just a pair of iterators denoting the start and end position of the sub-expression
+      match, but there are some additional operators provided so that objects of
+      type <a class="link" href="ref/sub_match.html" title="sub_match"><code class="computeroutput"><span class="identifier">sub_match</span></code></a>
+      behave a lot like a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_string</span></code>: for example they are implicitly
+      convertible to a <code class="computeroutput"><span class="identifier">basic_string</span></code>,
+      they can be compared to a string, added to a string, or streamed out to an
+      output stream.
+    </p>
+<h5>
+<a name="boost_regex.captures.h1"></a>
+      <span class="phrase"><a name="boost_regex.captures.unmatched_sub_expressions"></a></span><a class="link" href="captures.html#boost_regex.captures.unmatched_sub_expressions">Unmatched
+      Sub-Expressions</a>
+    </h5>
+<p>
+      When a regular expression match is found there is no need for all of the marked
+      sub-expressions to have participated in the match, for example the expression:
+    </p>
+<pre class="programlisting">(abc)|(def)</pre>
+<p>
+      can match either $1 or $2, but never both at the same time. In Boost.Regex
+      you can determine which sub-expressions matched by accessing the <code class="computeroutput"><span class="identifier">sub_match</span><span class="special">::</span><span class="identifier">matched</span></code> data member.
+    </p>
+<h5>
+<a name="boost_regex.captures.h2"></a>
+      <span class="phrase"><a name="boost_regex.captures.repeated_captures"></a></span><a class="link" href="captures.html#boost_regex.captures.repeated_captures">Repeated
+      Captures</a>
+    </h5>
+<p>
+      When a marked sub-expression is repeated, then the sub-expression gets "captured"
+      multiple times, however normally only the final capture is available, for example
+      if
+    </p>
+<pre class="programlisting">(?:(\w+)\W+)+</pre>
+<p>
+      is matched against
+    </p>
+<pre class="programlisting">one fine day</pre>
+<p>
+      Then $1 will contain the string "day", and all the previous captures
+      will have been forgotten.
+    </p>
+<p>
+      However, Boost.Regex has an experimental feature that allows all the capture
+      information to be retained - this is accessed either via the <code class="computeroutput"><span class="identifier">match_results</span><span class="special">::</span><span class="identifier">captures</span></code> member function or the <code class="computeroutput"><span class="identifier">sub_match</span><span class="special">::</span><span class="identifier">captures</span></code> member function. These functions
+      return a container that contains a sequence of all the captures obtained during
+      the regular expression matching. The following example program shows how this
+      information may be used:
+    </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
+
+<span class="keyword">void</span> <span class="identifier">print_captures</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&amp;</span> <span class="identifier">regx</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&amp;</span> <span class="identifier">text</span><span class="special">)</span>
+<span class="special">{</span>
+   <span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex</span> <span class="identifier">e</span><span class="special">(</span><span class="identifier">regx</span><span class="special">);</span>
+   <span class="identifier">boost</span><span class="special">::</span><span class="identifier">smatch</span> <span class="identifier">what</span><span class="special">;</span>
+   <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"Expression:  \""</span> <span class="special">&lt;&lt;</span> <span class="identifier">regx</span> <span class="special">&lt;&lt;</span> <span class="string">"\"\n"</span><span class="special">;</span>
+   <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"Text:        \""</span> <span class="special">&lt;&lt;</span> <span class="identifier">text</span> <span class="special">&lt;&lt;</span> <span class="string">"\"\n"</span><span class="special">;</span>
+   <span class="keyword">if</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex_match</span><span class="special">(</span><span class="identifier">text</span><span class="special">,</span> <span class="identifier">what</span><span class="special">,</span> <span class="identifier">e</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_extra</span><span class="special">))</span>
+   <span class="special">{</span>
+      <span class="keyword">unsigned</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">j</span><span class="special">;</span>
+      <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"** Match found **\n   Sub-Expressions:\n"</span><span class="special">;</span>
+      <span class="keyword">for</span><span class="special">(</span><span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="identifier">what</span><span class="special">.</span><span class="identifier">size</span><span class="special">();</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
+         <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"      $"</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span> <span class="special">&lt;&lt;</span> <span class="string">" = \""</span> <span class="special">&lt;&lt;</span> <span class="identifier">what</span><span class="special">[</span><span class="identifier">i</span><span class="special">]</span> <span class="special">&lt;&lt;</span> <span class="string">"\"\n"</span><span class="special">;</span>
+      <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"   Captures:\n"</span><span class="special">;</span>
+      <span class="keyword">for</span><span class="special">(</span><span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="identifier">what</span><span class="special">.</span><span class="identifier">size</span><span class="special">();</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
+      <span class="special">{</span>
+         <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"      $"</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span> <span class="special">&lt;&lt;</span> <span class="string">" = {"</span><span class="special">;</span>
+         <span class="keyword">for</span><span class="special">(</span><span class="identifier">j</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">j</span> <span class="special">&lt;</span> <span class="identifier">what</span><span class="special">.</span><span class="identifier">captures</span><span class="special">(</span><span class="identifier">i</span><span class="special">).</span><span class="identifier">size</span><span class="special">();</span> <span class="special">++</span><span class="identifier">j</span><span class="special">)</span>
+         <span class="special">{</span>
+            <span class="keyword">if</span><span class="special">(</span><span class="identifier">j</span><span class="special">)</span>
+               <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span><span class="special">;</span>
+            <span class="keyword">else</span>
+               <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">" "</span><span class="special">;</span>
+            <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"\""</span> <span class="special">&lt;&lt;</span> <span class="identifier">what</span><span class="special">.</span><span class="identifier">captures</span><span class="special">(</span><span class="identifier">i</span><span class="special">)[</span><span class="identifier">j</span><span class="special">]</span> <span class="special">&lt;&lt;</span> <span class="string">"\""</span><span class="special">;</span>
+         <span class="special">}</span>
+         <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">" }\n"</span><span class="special">;</span>
+      <span class="special">}</span>
+   <span class="special">}</span>
+   <span class="keyword">else</span>
+   <span class="special">{</span>
+      <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"** No Match found **\n"</span><span class="special">;</span>
+   <span class="special">}</span>
+<span class="special">}</span>
+
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="special">,</span> <span class="keyword">char</span><span class="special">*</span> <span class="special">[])</span>
+<span class="special">{</span>
+   <span class="identifier">print_captures</span><span class="special">(</span><span class="string">"(([[:lower:]]+)|([[:upper:]]+))+"</span><span class="special">,</span> <span class="string">"aBBcccDDDDDeeeeeeee"</span><span class="special">);</span>
+   <span class="identifier">print_captures</span><span class="special">(</span><span class="string">"(.*)bar|(.*)bah"</span><span class="special">,</span> <span class="string">"abcbar"</span><span class="special">);</span>
+   <span class="identifier">print_captures</span><span class="special">(</span><span class="string">"(.*)bar|(.*)bah"</span><span class="special">,</span> <span class="string">"abcbah"</span><span class="special">);</span>
+   <span class="identifier">print_captures</span><span class="special">(</span><span class="string">"^(?:(\\w+)|(?&gt;\\W+))*$"</span><span class="special">,</span>
+      <span class="string">"now is the time for all good men to come to the aid of the party"</span><span class="special">);</span>
+   <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+      Which produces the following output:
+    </p>
+<pre class="programlisting">Expression:  "(([[:lower:]]+)|([[:upper:]]+))+"
+Text:        "aBBcccDDDDDeeeeeeee"
+** Match found **
+   Sub-Expressions:
+      $0 = "aBBcccDDDDDeeeeeeee"
+      $1 = "eeeeeeee"
+      $2 = "eeeeeeee"
+      $3 = "DDDDD"
+   Captures:
+      $0 = { "aBBcccDDDDDeeeeeeee" }
+      $1 = { "a", "BB", "ccc", "DDDDD", "eeeeeeee" }
+      $2 = { "a", "ccc", "eeeeeeee" }
+      $3 = { "BB", "DDDDD" }
+Expression:  "(.*)bar|(.*)bah"
+Text:        "abcbar"
+** Match found **
+   Sub-Expressions:
+      $0 = "abcbar"
+      $1 = "abc"
+      $2 = ""
+   Captures:
+      $0 = { "abcbar" }
+      $1 = { "abc" }
+      $2 = { }
+Expression:  "(.*)bar|(.*)bah"
+Text:        "abcbah"
+** Match found **
+   Sub-Expressions:
+      $0 = "abcbah"
+      $1 = ""
+      $2 = "abc"
+   Captures:
+      $0 = { "abcbah" }
+      $1 = { }
+      $2 = { "abc" }
+Expression:  "^(?:(\w+)|(?&gt;\W+))*$"
+Text:        "now is the time for all good men to come to the aid of the party"
+** Match found **
+   Sub-Expressions:
+      $0 = "now is the time for all good men to come to the aid of the party"
+      $1 = "party"
+   Captures:
+      $0 = { "now is the time for all good men to come to the aid of the party" }
+      $1 = { "now", "is", "the", "time", "for", "all", "good", "men", "to",
+         "come", "to", "the", "aid", "of", "the", "party" }
+</pre>
+<p>
+      Unfortunately enabling this feature has an impact on performance (even if you
+      don't use it), and a much bigger impact if you do use it, therefore to use
+      this feature you need to:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+          Define BOOST_REGEX_MATCH_EXTRA for all translation units including the
+          library source (the best way to do this is to uncomment this define in
+          boost/regex/user.hpp and then rebuild everything.
+        </li>
+<li class="listitem">
+          Pass the match_extra flag to the particular algorithms where you actually
+          need the captures information (regex_search, regex_match, or regex_iterator).
+        </li>
+</ul></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="unicode.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partial_matches.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/configuration.html

@@ -0,0 +1,51 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Configuration</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="prev" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="next" href="configuration/compiler.html" title="Compiler Setup">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="configuration/compiler.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_regex.configuration"></a><a class="link" href="configuration.html" title="Configuration">Configuration</a>
+</h2></div></div></div>
+<div class="toc"><dl class="toc">
+<dt><span class="section"><a href="configuration/compiler.html">Compiler Setup</a></span></dt>
+<dt><span class="section"><a href="configuration/standalone.html">Use in Standalone
+      Mode (without the rest of Boost)</a></span></dt>
+<dt><span class="section"><a href="configuration/locale.html">Locale and traits class
+      selection</a></span></dt>
+<dt><span class="section"><a href="configuration/tuning.html">Algorithm Tuning</a></span></dt>
+</dl></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="configuration/compiler.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/configuration/algorithm.html

@@ -0,0 +1,93 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Algorithm Selection</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 5.1.4">
+<link rel="up" href="../configuration.html" title="Configuration">
+<link rel="prev" href="linkage.html" title="Linkage Options">
+<link rel="next" href="tuning.html" title="Algorithm Tuning">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="linkage.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tuning.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.configuration.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm Selection">Algorithm Selection</a>
+</h3></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  macro
+                </p>
+              </th>
+<th>
+                <p>
+                  description
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_RECURSIVE
+                </p>
+              </td>
+<td>
+                <p>
+                  Tells Boost.Regex to use a stack-recursive matching algorithm.
+                  This is generally the fastest option (although there is very little
+                  in it), but can cause stack overflow in extreme cases, on Win32
+                  this can be handled safely, but this is not the case on other platforms.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_NON_RECURSIVE
+                </p>
+              </td>
+<td>
+                <p>
+                  Tells Boost.Regex to use a non-stack recursive matching algorithm,
+                  this can be slightly slower than the alternative, but is always
+                  safe no matter how pathological the regular expression. This is
+                  the default on non-Win32 platforms.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="linkage.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tuning.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/configuration/compiler.html

@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Compiler Setup</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../configuration.html" title="Configuration">
+<link rel="prev" href="../configuration.html" title="Configuration">
+<link rel="next" href="standalone.html" title="Use in Standalone Mode (without the rest of Boost)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../configuration.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="standalone.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.configuration.compiler"></a><a class="link" href="compiler.html" title="Compiler Setup">Compiler Setup</a>
+</h3></div></div></div>
+<p>
+        You shouldn't need to do anything special to configure Boost.Regex for use
+        with your compiler - the <a href="../../../../../config/index.html" target="_top">Boost.Config
+        subsystem</a> should already take care of it, if you do have problems
+        (or you are using a particularly obscure compiler or platform) then <a href="../../../../../config/index.html" target="_top">Boost.Config</a> has a configure script
+        that you can run.
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../configuration.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="standalone.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/configuration/linkage.html

@@ -0,0 +1,106 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Linkage Options</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 5.1.4">
+<link rel="up" href="../configuration.html" title="Configuration">
+<link rel="prev" href="locale.html" title="Locale and traits class selection">
+<link rel="next" href="algorithm.html" title="Algorithm Selection">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="locale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.configuration.linkage"></a><a class="link" href="linkage.html" title="Linkage Options">Linkage Options</a>
+</h3></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  macro
+                </p>
+              </th>
+<th>
+                <p>
+                  description
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_DYN_LINK
+                </p>
+              </td>
+<td>
+                <p>
+                  For Microsoft and Borland C++ builds, this tells Boost.Regex that
+                  it should link to the dll build of the Boost.Regex. By default
+                  boost.regex will link to its static library build, even if the
+                  dynamic C runtime library is in use.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_NO_LIB
+                </p>
+              </td>
+<td>
+                <p>
+                  For Microsoft and Borland C++ builds, this tells Boost.Regex that
+                  it should not automatically select the library to link to.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_NO_FASTCALL
+                </p>
+              </td>
+<td>
+                <p>
+                  For Microsoft builds, this tells Boost.Regex to use the <code class="computeroutput"><span class="identifier">__cdecl</span></code> calling convention rather
+                  than <code class="computeroutput"><span class="identifier">__fastcall</span></code>.
+                  Useful if you want to use the same library from both managed and
+                  unmanaged code.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="locale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/configuration/locale.html

@@ -0,0 +1,109 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Locale and traits class selection</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../configuration.html" title="Configuration">
+<link rel="prev" href="standalone.html" title="Use in Standalone Mode (without the rest of Boost)">
+<link rel="next" href="tuning.html" title="Algorithm Tuning">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="standalone.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tuning.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.configuration.locale"></a><a class="link" href="locale.html" title="Locale and traits class selection">Locale and traits class
+      selection</a>
+</h3></div></div></div>
+<p>
+        The following macros (see <a href="../../../../../../boost/regex/user.hpp" target="_top">user.hpp</a>)
+        control how Boost.Regex interacts with the user's locale:
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  macro
+                </p>
+              </th>
+<th>
+                <p>
+                  description
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_USE_C_LOCALE
+                </p>
+              </td>
+<td>
+                <p>
+                  Forces Boost.Regex to use the global C locale in its traits class
+                  support: this is now deprecated in favour of the C++ locale.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_USE_CPP_LOCALE
+                </p>
+              </td>
+<td>
+                <p>
+                  Forces Boost.Regex to use std::locale in it's default traits class,
+                  regular expressions can then be imbued with an instance specific
+                  locale. This is the default behaviour on non-Windows platforms.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_NO_W32
+                </p>
+              </td>
+<td>
+                <p>
+                  Tells Boost.Regex not to use any Win32 API's even when available
+                  (implies BOOST_REGEX_USE_CPP_LOCALE unless BOOST_REGEX_USE_C_LOCALE
+                  is set).
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="standalone.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tuning.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/configuration/tuning.html

@@ -0,0 +1,118 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Algorithm Tuning</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../configuration.html" title="Configuration">
+<link rel="prev" href="locale.html" title="Locale and traits class selection">
+<link rel="next" href="../install.html" title="Building and Installing the Library">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="locale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../install.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.configuration.tuning"></a><a class="link" href="tuning.html" title="Algorithm Tuning">Algorithm Tuning</a>
+</h3></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  macro
+                </p>
+              </th>
+<th>
+                <p>
+                  description
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_BLOCKSIZE
+                </p>
+              </td>
+<td>
+                <p>
+                  Boost.Regex uses largish blocks of memory to act as a stack for
+                  the state machine, the larger the block size then the fewer allocations
+                  that will take place. This defaults to 4096 bytes, which is large
+                  enough to match the vast majority of regular expressions without
+                  further allocations, however, you can choose smaller or larger
+                  values depending upon your platforms characteristics.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_MAX_BLOCKS
+                </p>
+              </td>
+<td>
+                <p>
+                  Tells Boost.Regex how many blocks of size BOOST_REGEX_BLOCKSIZE
+                  it is permitted to use. If this value is exceeded then Boost.Regex
+                  will stop trying to find a match and throw a std::runtime_error.
+                  Defaults to 1024, don't forget to tweak this value if you alter
+                  BOOST_REGEX_BLOCKSIZE by much.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  BOOST_REGEX_MAX_CACHE_BLOCKS
+                </p>
+              </td>
+<td>
+                <p>
+                  Tells Boost.Regex how many memory blocks to store in it's internal
+                  cache - memory blocks are taken from this cache rather than by
+                  calling ::operator new. Generally speaking this can be an order
+                  of magnitude faster than calling ::opertator new each time a memory
+                  block is required, but has the downside that Boost.Regex can end
+                  up caching a large chunk of memory (by default up to 16 blocks
+                  each of BOOST_REGEX_BLOCKSIZE size). If memory is tight then try
+                  defining this to 0 (disables all caching), or if that is too slow,
+                  then a value of 1 or 2, may be sufficient. On the other hand, on
+                  large multi-processor, multi-threaded systems, you may find that
+                  a higher value is in order.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="locale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../configuration.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../install.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/format.html

@@ -0,0 +1,62 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Search and Replace Format String Syntax</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="prev" href="syntax/leftmost_longest_rule.html" title="The Leftmost Longest Rule">
+<link rel="next" href="format/sed_format.html" title="Sed Format String Syntax">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="syntax/leftmost_longest_rule.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="format/sed_format.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_regex.format"></a><a class="link" href="format.html" title="Search and Replace Format String Syntax">Search and Replace Format String Syntax</a>
+</h2></div></div></div>
+<div class="toc"><dl class="toc">
+<dt><span class="section"><a href="format/sed_format.html">Sed Format String Syntax</a></span></dt>
+<dt><span class="section"><a href="format/perl_format.html">Perl Format String Syntax</a></span></dt>
+<dt><span class="section"><a href="format/boost_format_syntax.html">Boost-Extended
+      Format String Syntax</a></span></dt>
+</dl></div>
+<p>
+      Format strings are used by the algorithm <a class="link" href="ref/regex_replace.html" title="regex_replace"><code class="computeroutput"><span class="identifier">regex_replace</span></code></a> and by <a class="link" href="ref/match_results.html#boost_regex.match_results_format"><code class="computeroutput"><span class="identifier">match_results</span><span class="special">&lt;&gt;::</span><span class="identifier">format</span></code></a>, and are used to transform
+      one string into another.
+    </p>
+<p>
+      There are three kind of format string: <a class="link" href="format/sed_format.html" title="Sed Format String Syntax">Sed</a>,
+      <a class="link" href="format/perl_format.html" title="Perl Format String Syntax">Perl</a> and <a class="link" href="format/boost_format_syntax.html" title="Boost-Extended Format String Syntax">Boost-Extended</a>.
+    </p>
+<p>
+      Alternatively, when the flag <code class="computeroutput"><span class="identifier">format_literal</span></code>
+      is passed to one of these functions, then the format string is treated as a
+      string literal, and is copied unchanged to the output.
+    </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="syntax/leftmost_longest_rule.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="format/sed_format.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/format/boost_format_syntax.html

@@ -0,0 +1,561 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Boost-Extended Format String Syntax</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../format.html" title="Search and Replace Format String Syntax">
+<link rel="prev" href="perl_format.html" title="Perl Format String Syntax">
+<link rel="next" href="../ref.html" title="Reference">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="perl_format.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../format.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../ref.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.format.boost_format_syntax"></a><a class="link" href="boost_format_syntax.html" title="Boost-Extended Format String Syntax">Boost-Extended
+      Format String Syntax</a>
+</h3></div></div></div>
+<p>
+        Boost-Extended format strings treat all characters as literals except for
+        '$', '\', '(', ')', '?', and ':'.
+      </p>
+<h5>
+<a name="boost_regex.format.boost_format_syntax.h0"></a>
+        <span class="phrase"><a name="boost_regex.format.boost_format_syntax.grouping"></a></span><a class="link" href="boost_format_syntax.html#boost_regex.format.boost_format_syntax.grouping">Grouping</a>
+      </h5>
+<p>
+        The characters '(' and ')' perform lexical grouping, so use \( and \) if
+        you want a to output literal parenthesis.
+      </p>
+<h5>
+<a name="boost_regex.format.boost_format_syntax.h1"></a>
+        <span class="phrase"><a name="boost_regex.format.boost_format_syntax.conditionals"></a></span><a class="link" href="boost_format_syntax.html#boost_regex.format.boost_format_syntax.conditionals">Conditionals</a>
+      </h5>
+<p>
+        The character '?' begins a conditional expression, the general form is:
+      </p>
+<p>
+        ?Ntrue-expression:false-expression
+      </p>
+<p>
+        where N is decimal digit.
+      </p>
+<p>
+        If sub-expression N was matched, then true-expression is evaluated and sent
+        to output, otherwise false-expression is evaluated and sent to output.
+      </p>
+<p>
+        You will normally need to surround a conditional-expression with parenthesis
+        in order to prevent ambiguities.
+      </p>
+<p>
+        For example, the format string "(?1foo:bar)" will replace each
+        match found with "foo" if the sub-expression $1 was matched, and
+        with "bar" otherwise.
+      </p>
+<p>
+        For sub-expressions with an index greater than 9, or for access to named
+        sub-expressions use:
+      </p>
+<p>
+        ?{INDEX}true-expression:false-expression
+      </p>
+<p>
+        or
+      </p>
+<p>
+        ?{NAME}true-expression:false-expression
+      </p>
+<h5>
+<a name="boost_regex.format.boost_format_syntax.h2"></a>
+        <span class="phrase"><a name="boost_regex.format.boost_format_syntax.placeholder_sequences"></a></span><a class="link" href="boost_format_syntax.html#boost_regex.format.boost_format_syntax.placeholder_sequences">Placeholder
+        Sequences</a>
+      </h5>
+<p>
+        Placeholder sequences specify that some part of what matched the regular
+        expression should be sent to output as follows:
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Placeholder
+                </p>
+              </th>
+<th>
+                <p>
+                  Meaning
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  $&amp;
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the whole expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $MATCH
+                </p>
+              </td>
+<td>
+                <p>
+                  As $&amp;
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  ${^MATCH}
+                </p>
+              </td>
+<td>
+                <p>
+                  As $&amp;
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $`
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the text between the end of the last match found (or the
+                  start of the text if no previous match was found), and the start
+                  of the current match.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $PREMATCH
+                </p>
+              </td>
+<td>
+                <p>
+                  As $`
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  ${^PREMATCH}
+                </p>
+              </td>
+<td>
+                <p>
+                  As $`
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $'
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs all the text following the end of the current match.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $POSTMATCH
+                </p>
+              </td>
+<td>
+                <p>
+                  As $'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  ${^POSTMATCH}
+                </p>
+              </td>
+<td>
+                <p>
+                  As $'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $+
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the last marked sub-expression in the regular
+                  expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $LAST_PAREN_MATCH
+                </p>
+              </td>
+<td>
+                <p>
+                  As $+
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $LAST_SUBMATCH_RESULT
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the last sub-expression to be actually matched.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $^N
+                </p>
+              </td>
+<td>
+                <p>
+                  As $LAST_SUBMATCH_RESULT
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $$
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a literal '$'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $n
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the n'th sub-expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  ${n}
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the n'th sub-expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $+{NAME}
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs whatever matched the sub-expression named "NAME".
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+        Any $-placeholder sequence not listed above, results in '$' being treated
+        as a literal.
+      </p>
+<h5>
+<a name="boost_regex.format.boost_format_syntax.h3"></a>
+        <span class="phrase"><a name="boost_regex.format.boost_format_syntax.escape_sequences"></a></span><a class="link" href="boost_format_syntax.html#boost_regex.format.boost_format_syntax.escape_sequences">Escape
+        Sequences</a>
+      </h5>
+<p>
+        An escape character followed by any character x, outputs that character unless
+        x is one of the escape sequences shown below.
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Escape
+                </p>
+              </th>
+<th>
+                <p>
+                  Meaning
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  \a
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the bell character: '\a'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \e
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the ANSI escape character (code point 27).
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \f
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a form feed character: '\f'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \n
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a newline character: '\n'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \r
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a carriage return character: '\r'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \t
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a tab character: '\t'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \v
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a vertical tab character: '\v'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \xDD
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the character whose hexadecimal code point is 0xDD
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \x{DDDD}
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the character whose hexadecimal code point is 0xDDDDD
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \cX
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the ANSI escape sequence "escape-X".
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \D
+                </p>
+              </td>
+<td>
+                <p>
+                  If D is a decimal digit in the range 1-9, then outputs the text
+                  that matched sub-expression D.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \l
+                </p>
+              </td>
+<td>
+                <p>
+                  Causes the next character to be outputted, to be output in lower
+                  case.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \u
+                </p>
+              </td>
+<td>
+                <p>
+                  Causes the next character to be outputted, to be output in upper
+                  case.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \L
+                </p>
+              </td>
+<td>
+                <p>
+                  Causes all subsequent characters to be output in lower case, until
+                  a \E is found.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \U
+                </p>
+              </td>
+<td>
+                <p>
+                  Causes all subsequent characters to be output in upper case, until
+                  a \E is found.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \E
+                </p>
+              </td>
+<td>
+                <p>
+                  Terminates a \L or \U sequence.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="perl_format.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../format.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../ref.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/format/perl_format.html

@@ -0,0 +1,503 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Perl Format String Syntax</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../format.html" title="Search and Replace Format String Syntax">
+<link rel="prev" href="sed_format.html" title="Sed Format String Syntax">
+<link rel="next" href="boost_format_syntax.html" title="Boost-Extended Format String Syntax">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="sed_format.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../format.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boost_format_syntax.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.format.perl_format"></a><a class="link" href="perl_format.html" title="Perl Format String Syntax">Perl Format String Syntax</a>
+</h3></div></div></div>
+<p>
+        Perl-style format strings treat all characters as literals except '$' and
+        '\' which start placeholder and escape sequences respectively.
+      </p>
+<p>
+        Placeholder sequences specify that some part of what matched the regular
+        expression should be sent to output as follows:
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Placeholder
+                </p>
+              </th>
+<th>
+                <p>
+                  Meaning
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  $&amp;
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the whole expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $MATCH
+                </p>
+              </td>
+<td>
+                <p>
+                  As $&amp;
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  ${^MATCH}
+                </p>
+              </td>
+<td>
+                <p>
+                  As $&amp;
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $`
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the text between the end of the last match found (or the
+                  start of the text if no previous match was found), and the start
+                  of the current match.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $PREMATCH
+                </p>
+              </td>
+<td>
+                <p>
+                  As $`
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  ${^PREMATCH}
+                </p>
+              </td>
+<td>
+                <p>
+                  As $`
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $'
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs all the text following the end of the current match.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $POSTMATCH
+                </p>
+              </td>
+<td>
+                <p>
+                  As $'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  ${^POSTMATCH}
+                </p>
+              </td>
+<td>
+                <p>
+                  As $'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $+
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the last marked sub-expression in the regular
+                  expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $LAST_PAREN_MATCH
+                </p>
+              </td>
+<td>
+                <p>
+                  As $+
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $LAST_SUBMATCH_RESULT
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the last sub-expression to be actually matched.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $^N
+                </p>
+              </td>
+<td>
+                <p>
+                  As $LAST_SUBMATCH_RESULT
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $$
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a literal '$'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $n
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the n'th sub-expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  ${n}
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs what matched the n'th sub-expression.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  $+{NAME}
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs whatever matched the sub-expression named "NAME".
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+        Any $-placeholder sequence not listed above, results in '$' being treated
+        as a literal.
+      </p>
+<p>
+        An escape character followed by any character x, outputs that character unless
+        x is one of the escape sequences shown below.
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Escape
+                </p>
+              </th>
+<th>
+                <p>
+                  Meaning
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  \a
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the bell character: '\a'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \e
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the ANSI escape character (code point 27).
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \f
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a form feed character: '\f'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \n
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a newline character: '\n'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \r
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a carriage return character: '\r'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \t
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a tab character: '\t'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \v
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a vertical tab character: '\v'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \xDD
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the character whose hexadecimal code point is 0xDD
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \x{DDDD}
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the character whose hexadecimal code point is 0xDDDDD
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \cX
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the ANSI escape sequence "escape-X".
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \D
+                </p>
+              </td>
+<td>
+                <p>
+                  If D is a decimal digit in the range 1-9, then outputs the text
+                  that matched sub-expression D.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \l
+                </p>
+              </td>
+<td>
+                <p>
+                  Causes the next character to be outputted, to be output in lower
+                  case.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \u
+                </p>
+              </td>
+<td>
+                <p>
+                  Causes the next character to be outputted, to be output in upper
+                  case.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \L
+                </p>
+              </td>
+<td>
+                <p>
+                  Causes all subsequent characters to be output in lower case, until
+                  a \E is found.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \U
+                </p>
+              </td>
+<td>
+                <p>
+                  Causes all subsequent characters to be output in upper case, until
+                  a \E is found.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \E
+                </p>
+              </td>
+<td>
+                <p>
+                  Terminates a \L or \U sequence.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="sed_format.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../format.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boost_format_syntax.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/format/sed_format.html

@@ -0,0 +1,249 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Sed Format String Syntax</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../format.html" title="Search and Replace Format String Syntax">
+<link rel="prev" href="../format.html" title="Search and Replace Format String Syntax">
+<link rel="next" href="perl_format.html" title="Perl Format String Syntax">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../format.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../format.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="perl_format.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.format.sed_format"></a><a class="link" href="sed_format.html" title="Sed Format String Syntax">Sed Format String Syntax</a>
+</h3></div></div></div>
+<p>
+        Sed-style format strings treat all characters as literals except:
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  character
+                </p>
+              </th>
+<th>
+                <p>
+                  description
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  &amp;
+                </p>
+              </td>
+<td>
+                <p>
+                  The ampersand character is replaced in the output stream by the
+                  whole of what matched the regular expression. Use \&amp; to output
+                  a literal '&amp;' character.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \
+                </p>
+              </td>
+<td>
+                <p>
+                  Specifies an escape sequence.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+        An escape character followed by any character x, outputs that character unless
+        x is one of the escape sequences shown below.
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Escape
+                </p>
+              </th>
+<th>
+                <p>
+                  Meaning
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  \a
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the bell character: '\a'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \e
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the ANSI escape character (code point 27).
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \f
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a form feed character: '\f'
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \n
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a newline character: '\n'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \r
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a carriage return character: '\r'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \t
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a tab character: '\t'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \v
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs a vertical tab character: '\v'.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \xDD
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the character whose hexadecimal code point is 0xDD
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \x{DDDD}
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the character whose hexadecimal code point is 0xDDDDD
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \cX
+                </p>
+              </td>
+<td>
+                <p>
+                  Outputs the ANSI escape sequence "escape-X".
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  \D
+                </p>
+              </td>
+<td>
+                <p>
+                  If D is a decimal digit in the range 1-9, then outputs the text
+                  that matched sub-expression D.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../format.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../format.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="perl_format.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/install.html

@@ -0,0 +1,370 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Building and Installing the Library</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="prev" href="configuration/tuning.html" title="Algorithm Tuning">
+<link rel="next" href="intro.html" title="Introduction and Overview">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="configuration/tuning.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="intro.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_regex.install"></a><a class="link" href="install.html" title="Building and Installing the Library">Building and Installing the Library</a>
+</h2></div></div></div>
+<p>
+      When you extract the library from its zip file, you must preserve its internal
+      directory structure (for example by using the -d option when extracting). If
+      you didn't do that when extracting, then you'd better stop reading this, delete
+      the files you just extracted, and try again!
+    </p>
+<p>
+      This library should not need configuring before use; most popular compilers/standard
+      libraries/platforms are already supported "as is". If you do experience
+      configuration problems, or just want to test the configuration with your compiler,
+      then the process is the same as for all of boost; see the <a href="../../../../config/index.html" target="_top">configuration
+      library documentation</a>.
+    </p>
+<p>
+      The library will encase all code inside namespace boost.
+    </p>
+<p>
+      This is a header only library provided your compiler supports C++11 or later.
+      Support for C++03 compilers is still present, but is now deprecated and may
+      be removed without further notice!
+    </p>
+<p>
+      The only people that still need to build the external libboost_regex library
+      are those that are either:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+          Using the library in C++03 mode, or,
+        </li>
+<li class="listitem">
+          Using the deprecated POSIX C API's
+        </li>
+</ul></div>
+<p>
+      Further, this library may now be used in "standalone" mode without
+      the rest of the Boost C++ libraries, in order to do this you must either:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+          Have a C++17 compiler that supports <code class="computeroutput"><span class="identifier">__has_include</span></code>,
+          in this case if <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">config</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code> is not present then the library will
+          automoatically enter standalone mode. Or:
+        </li>
+<li class="listitem">
+          Define BOOST_REGEX_STANDALONE when building.
+        </li>
+</ul></div>
+<p>
+      If you are using this library with ICU, note that since it is now header only,
+      it will be up to you to link to the ICU libraries if you use <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">/</span><span class="identifier">icu</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code> unless you are using the supplied CMake
+      script.
+    </p>
+<h5>
+<a name="boost_regex.install.h0"></a>
+      <span class="phrase"><a name="boost_regex.install.usage_with_cmake"></a></span><a class="link" href="install.html#boost_regex.install.usage_with_cmake">Usage
+      with CMake</a>
+    </h5>
+<p>
+      The library comes with a very basic CMakeLists.txt that allows this library
+      to be used from other CMake scripts.
+    </p>
+<p>
+      CMakeLists.txt defines two targets:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+          <code class="computeroutput"><span class="identifier">Boost</span><span class="special">::</span><span class="identifier">regex</span></code> This is the target to use for normal
+          header only builds.
+        </li>
+<li class="listitem">
+          <code class="computeroutput"><span class="identifier">Boost</span><span class="special">::</span><span class="identifier">regex_icu</span></code> This is the target to use if
+          you are using <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">/</span><span class="identifier">icu</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code> in your code, and wish to have the
+          ICU dependencies taken care of for you.
+        </li>
+</ul></div>
+<p>
+      There is also one configuration option:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+          BOOST_REGEX_STANDALONE when set then no other Boost libraries are targeted
+          as dependencies, and Boost.Regex is placed in standalone mode. Invoke CMake
+          with -DBOOST_REGEX_STANDALONE=on to enable standalone mode.
+        </li></ul></div>
+<h5>
+<a name="boost_regex.install.h1"></a>
+      <span class="phrase"><a name="boost_regex.install.c_03_users_only_deprecated_build"></a></span><a class="link" href="install.html#boost_regex.install.c_03_users_only_deprecated_build"><span class="bold"><strong>C++03 users only (DEPRECATED)</strong></span> Building with bjam</a>
+    </h5>
+<p>
+      This is now the preferred method for building and installing legacy versions
+      this library, please refer to the <a href="../../../../../more/getting_started.html" target="_top">getting
+      started guide</a> for more information.
+    </p>
+<h5>
+<a name="boost_regex.install.h2"></a>
+      <span class="phrase"><a name="boost_regex.install.building_with_unicode_and_icu_su"></a></span><a class="link" href="install.html#boost_regex.install.building_with_unicode_and_icu_su">Building
+      With Unicode and ICU Support</a>
+    </h5>
+<p>
+      Boost.Regex is now capable of performing a configuration check to test whether
+      ICU is already installed in your compiler's search paths. When you build you
+      should see a message like this:
+    </p>
+<pre class="programlisting"><span class="identifier">Performing</span> <span class="identifier">configuration</span> <span class="identifier">checks</span>
+
+    <span class="special">-</span> <span class="identifier">has_icu</span> <span class="identifier">builds</span>           <span class="special">:</span> <span class="identifier">yes</span>
+</pre>
+<p>
+      Which means that ICU has been found, and support for it will be enabled in
+      the library build.
+    </p>
+<div class="tip"><table border="0" summary="Tip">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../doc/src/images/tip.png"></td>
+<th align="left">Tip</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+        If you don't want the regex library to use ICU then build with the "--disable-icu"
+        command line option.
+      </p></td></tr>
+</table></div>
+<p>
+      If instead you see:
+    </p>
+<pre class="programlisting"><span class="identifier">Performing</span> <span class="identifier">configuration</span> <span class="identifier">checks</span>
+
+    <span class="special">-</span> <span class="identifier">has_icu</span> <span class="identifier">builds</span>           <span class="special">:</span> <span class="identifier">no</span>
+</pre>
+<p>
+      Then ICU was not found and support for it will not be compiled into the library.
+      If you think that it should have been found, then you will need to take a look
+      at the contents of the file <span class="emphasis"><em>boost-root/bin.v2/config.log</em></span>
+      for the actual error messages obtained when the build carried out the configuration
+      check. You will then need to fix these errors by ensuring your compiler gets
+      invoked with the correct options. The main options that you're likely to pass
+      to <code class="computeroutput"><span class="identifier">b2</span></code> are:
+    </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+              <p>
+                Option
+              </p>
+            </th>
+<th>
+              <p>
+                Description
+              </p>
+            </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+              <p>
+                include=/some/path
+              </p>
+            </td>
+<td>
+              <p>
+                Adds "/some/path" to the list of paths seached for include
+                files, normally equivalent to <code class="computeroutput"><span class="special">-</span><span class="identifier">I</span><span class="special">/</span><span class="identifier">some</span><span class="special">/</span><span class="identifier">path</span></code> on most compilers.
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                library-path=/some/path
+              </p>
+            </td>
+<td>
+              <p>
+                Adds "/some/path" to the list of paths searched for external
+                libraries, set this to the location of the ICU binaries if they're
+                in a non-standard location.
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                -sICU_ICUUC_NAME=NAME
+              </p>
+            </td>
+<td>
+              <p>
+                If <code class="computeroutput"><span class="identifier">libicuuc</span></code> has a
+                non-standard name then this sets the name of the library linked against,
+                defaults to either <code class="computeroutput"><span class="identifier">icuuc</span></code>,
+                <code class="computeroutput"><span class="identifier">icuucd</span></code>, <code class="computeroutput"><span class="identifier">sicuuc</span></code> or <code class="computeroutput"><span class="identifier">sicuucd</span></code>
+                depending on build options.
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                -sICU_ICUDT_NAME=NAME
+              </p>
+            </td>
+<td>
+              <p>
+                If <code class="computeroutput"><span class="identifier">libicudata</span></code> has
+                a non-standard name then this sets the name of the library linked
+                against, defaults to either <code class="computeroutput"><span class="identifier">icudt</span></code>,
+                <code class="computeroutput"><span class="identifier">icudata</span></code>, <code class="computeroutput"><span class="identifier">sicudt</span></code> or <code class="computeroutput"><span class="identifier">sicudata</span></code>
+                depending on build options and platform.
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                -sICU_ICUIN_NAME=NAME
+              </p>
+            </td>
+<td>
+              <p>
+                If <code class="computeroutput"><span class="identifier">libicui18n</span></code> has
+                a non-standatd name then this sets the name of the library linked
+                against, defaults to either <code class="computeroutput"><span class="identifier">icui18n</span></code>,
+                <code class="computeroutput"><span class="identifier">icuin</span></code>, <code class="computeroutput"><span class="identifier">icuind</span></code>, sicuin<code class="computeroutput"> <span class="keyword">or</span>
+                </code>sicuins` depending on build options and platform.
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                cxxstd=XX
+              </p>
+            </td>
+<td>
+              <p>
+                Sets the C++ standard supported: XX should be either 03, 11, 14,
+                17 or 2a.
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                cxxflags="FLAGS"
+              </p>
+            </td>
+<td>
+              <p>
+                Passes "FLAGS" directly to the compiler, an option of last
+                resort!
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                linflags="FLAGS"
+              </p>
+            </td>
+<td>
+              <p>
+                Passes "FLAGS" directly to the compiler on the link step,
+                an option of last resort!
+              </p>
+            </td>
+</tr>
+</tbody>
+</table></div>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/src/images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+        Configuration results are cached - if you try rebuilding with different compiler
+        options then add an "-a" to the bjam command line to force all
+        targets to be rebuilt.
+      </p></td></tr>
+</table></div>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/src/images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+        ICU is a C++ library just like Boost is, as such your copy of ICU must have
+        been built with the same C++ compiler (and compiler version) that you are
+        using to build Boost. Boost.Regex will not work correctly unless you ensure
+        that this is the case: it is up to you to ensure that the version of ICU
+        you are using is binary compatible with the toolset you use to build Boost.
+      </p></td></tr>
+</table></div>
+<p>
+      And finally, if you want to build/test with multiple compiler versions, all
+      with different ICU builds, then the only way to achieve that currently is to
+      modify your user-config.jam so that each toolset has the necessary compiler/linker
+      options set so that ICU is found automatically by the configuration step (providing
+      the ICU binaries use the standard names, all you have to add is the appropriate
+      header-include and linker-search paths).
+    </p>
+<h5>
+<a name="boost_regex.install.h3"></a>
+      <span class="phrase"><a name="boost_regex.install.building_from_source"></a></span><a class="link" href="install.html#boost_regex.install.building_from_source">Building
+      from Source</a>
+    </h5>
+<p>
+      The Regex library is "just a bunch of source files": nothing special
+      is required to build them.
+    </p>
+<p>
+      You can either build the files under boost-path/libs/regex/src/*.cpp as a library,
+      or add them directly to your project. This is particularly useful if you need
+      to use specific compiler options not supported by the default Boost build.
+    </p>
+<p>
+      There are two #defines you should be aware of:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+          BOOST_HAS_ICU should be defined if you want ICU support compiled in.
+        </li>
+<li class="listitem">
+          BOOST_REGEX_DYN_LINK should be defined if you are building a DLL on Windows.
+        </li>
+</ul></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="configuration/tuning.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="intro.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/intro.html

@@ -0,0 +1,214 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Introduction and Overview</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="prev" href="install.html" title="Building and Installing the Library">
+<link rel="next" href="unicode.html" title="Unicode and Boost.Regex">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="install.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unicode.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_regex.intro"></a><a class="link" href="intro.html" title="Introduction and Overview">Introduction and Overview</a>
+</h2></div></div></div>
+<p>
+      Regular expressions are a form of pattern-matching that are often used in text
+      processing; many users will be familiar with the Unix utilities grep, sed and
+      awk, and the programming language Perl, each of which make extensive use of
+      regular expressions. Traditionally C++ users have been limited to the POSIX
+      C API's for manipulating regular expressions, and while Boost.Regex does provide
+      these API's, they do not represent the best way to use the library. For example
+      Boost.Regex can cope with wide character strings, or search and replace operations
+      (in a manner analogous to either sed or Perl), something that traditional C
+      libraries can not do.
+    </p>
+<p>
+      The class <a class="link" href="ref/basic_regex.html" title="basic_regex"><code class="computeroutput"><span class="identifier">basic_regex</span></code></a>
+      is the key class in this library; it represents a "machine readable"
+      regular expression, and is very closely modeled on <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_string</span></code>,
+      think of it as a string plus the actual state-machine required by the regular
+      expression algorithms. Like <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_string</span></code>
+      there are two typedefs that are almost always the means by which this class
+      is referenced:
+    </p>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span>
+
+<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">charT</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">traits</span> <span class="special">=</span> <span class="identifier">regex_traits</span><span class="special">&lt;</span><span class="identifier">charT</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+<span class="keyword">class</span> <span class="identifier">basic_regex</span><span class="special">;</span>
+
+<span class="keyword">typedef</span> <span class="identifier">basic_regex</span><span class="special">&lt;</span><span class="keyword">char</span><span class="special">&gt;</span> <span class="identifier">regex</span><span class="special">;</span>
+<span class="keyword">typedef</span> <span class="identifier">basic_regex</span><span class="special">&lt;</span><span class="keyword">wchar_t</span><span class="special">&gt;</span> <span class="identifier">wregex</span><span class="special">;</span>
+
+<span class="special">}</span>
+</pre>
+<p>
+      To see how this library can be used, imagine that we are writing a credit card
+      processing application. Credit card numbers generally come as a string of 16-digits,
+      separated into groups of 4-digits, and separated by either a space or a hyphen.
+      Before storing a credit card number in a database (not necessarily something
+      your customers will appreciate!), we may want to verify that the number is
+      in the correct format. To match any digit we could use the regular expression
+      [0-9], however ranges of characters like this are actually locale dependent.
+      Instead we should use the POSIX standard form [[:digit:]], or the Boost.Regex
+      and Perl shorthand for this \d (note that many older libraries tended to be
+      hard-coded to the C-locale, consequently this was not an issue for them). That
+      leaves us with the following regular expression to validate credit card number
+      formats:
+    </p>
+<pre class="programlisting">(\d{4}[- ]){3}\d{4}</pre>
+<p>
+      Here the parenthesis act to group (and mark for future reference) sub-expressions,
+      and the {4} means "repeat exactly 4 times". This is an example of
+      the extended regular expression syntax used by Perl, awk and egrep. Boost.Regex
+      also supports the older "basic" syntax used by sed and grep, but
+      this is generally less useful, unless you already have some basic regular expressions
+      that you need to reuse.
+    </p>
+<p>
+      Now let's take that expression and place it in some C++ code to validate the
+      format of a credit card number:
+    </p>
+<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">validate_card_format</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&amp;</span> <span class="identifier">s</span><span class="special">)</span>
+<span class="special">{</span>
+   <span class="keyword">static</span> <span class="keyword">const</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex</span> <span class="identifier">e</span><span class="special">(</span><span class="string">"(\\d{4}[- ]){3}\\d{4}"</span><span class="special">);</span>
+   <span class="keyword">return</span> <span class="identifier">regex_match</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="identifier">e</span><span class="special">);</span>
+<span class="special">}</span>
+</pre>
+<p>
+      Note how we had to add some extra escapes to the expression: remember that
+      the escape is seen once by the C++ compiler, before it gets to be seen by the
+      regular expression engine, consequently escapes in regular expressions have
+      to be doubled up when embedding them in C/C++ code. Also note that all the
+      examples assume that your compiler supports argument-dependent lookup, if yours
+      doesn't (for example VC6), then you will have to add some <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span></code> prefixes to some of the function calls in
+      the examples.
+    </p>
+<p>
+      Those of you who are familiar with credit card processing, will have realized
+      that while the format used above is suitable for human readable card numbers,
+      it does not represent the format required by online credit card systems; these
+      require the number as a string of 16 (or possibly 15) digits, without any intervening
+      spaces. What we need is a means to convert easily between the two formats,
+      and this is where search and replace comes in. Those who are familiar with
+      the utilities sed and Perl will already be ahead here; we need two strings
+      - one a regular expression - the other a "format string" that provides
+      a description of the text to replace the match with. In Boost.Regex this search
+      and replace operation is performed with the algorithm <a class="link" href="ref/regex_replace.html" title="regex_replace"><code class="computeroutput"><span class="identifier">regex_replace</span></code></a>, for our credit card
+      example we can write two algorithms like this to provide the format conversions:
+    </p>
+<pre class="programlisting"><span class="comment">// match any format with the regular expression:</span>
+<span class="keyword">const</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex</span> <span class="identifier">e</span><span class="special">(</span><span class="string">"\\A(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})\\z"</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">machine_format</span><span class="special">(</span><span class="string">"\\1\\2\\3\\4"</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">human_format</span><span class="special">(</span><span class="string">"\\1-\\2-\\3-\\4"</span><span class="special">);</span>
+
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">machine_readable_card_number</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">s</span><span class="special">)</span>
+<span class="special">{</span>
+   <span class="keyword">return</span> <span class="identifier">regex_replace</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="identifier">e</span><span class="special">,</span> <span class="identifier">machine_format</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_default</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">format_sed</span><span class="special">);</span>
+<span class="special">}</span>
+
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">human_readable_card_number</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">s</span><span class="special">)</span>
+<span class="special">{</span>
+   <span class="keyword">return</span> <span class="identifier">regex_replace</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="identifier">e</span><span class="special">,</span> <span class="identifier">human_format</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_default</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">format_sed</span><span class="special">);</span>
+<span class="special">}</span>
+</pre>
+<p>
+      Here we've used marked sub-expressions in the regular expression to split out
+      the four parts of the card number as separate fields, the format string then
+      uses the sed-like syntax to replace the matched text with the reformatted version.
+    </p>
+<p>
+      In the examples above, we haven't directly manipulated the results of a regular
+      expression match, however in general the result of a match contains a number
+      of sub-expression matches in addition to the overall match. When the library
+      needs to report a regular expression match it does so using an instance of
+      the class <a class="link" href="ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a>,
+      as before there are typedefs of this class for the most common cases:
+    </p>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span>
+
+<span class="keyword">typedef</span> <span class="identifier">match_results</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*&gt;</span>                  <span class="identifier">cmatch</span><span class="special">;</span>
+<span class="keyword">typedef</span> <span class="identifier">match_results</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="keyword">wchar_t</span><span class="special">*&gt;</span>               <span class="identifier">wcmatch</span><span class="special">;</span>
+<span class="keyword">typedef</span> <span class="identifier">match_results</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">const_iterator</span><span class="special">&gt;</span>  <span class="identifier">smatch</span><span class="special">;</span>
+<span class="keyword">typedef</span> <span class="identifier">match_results</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">wstring</span><span class="special">::</span><span class="identifier">const_iterator</span><span class="special">&gt;</span> <span class="identifier">wsmatch</span><span class="special">;</span>
+
+<span class="special">}</span>
+</pre>
+<p>
+      The algorithms <a class="link" href="ref/regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a>
+      and <a class="link" href="ref/regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a>
+      make use of <a class="link" href="ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a>
+      to report what matched; the difference between these algorithms is that <a class="link" href="ref/regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a>
+      will only find matches that consume <span class="emphasis"><em>all</em></span> of the input text,
+      where as <a class="link" href="ref/regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a>
+      will search for a match anywhere within the text being matched.
+    </p>
+<p>
+      Note that these algorithms are not restricted to searching regular C-strings,
+      any bidirectional iterator type can be searched, allowing for the possibility
+      of seamlessly searching almost any kind of data.
+    </p>
+<p>
+      For search and replace operations, in addition to the algorithm <a class="link" href="ref/regex_replace.html" title="regex_replace"><code class="computeroutput"><span class="identifier">regex_replace</span></code></a> that we have already
+      seen, the <a class="link" href="ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a>
+      class has a <code class="computeroutput"><span class="identifier">format</span></code> member that
+      takes the result of a match and a format string, and produces a new string
+      by merging the two.
+    </p>
+<p>
+      For iterating through all occurrences of an expression within a text, there
+      are two iterator types: <a class="link" href="ref/regex_iterator.html" title="regex_iterator"><code class="computeroutput"><span class="identifier">regex_iterator</span></code></a> will enumerate over
+      the <a class="link" href="ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a>
+      objects found, while <a class="link" href="ref/regex_token_iterator.html" title="regex_token_iterator"><code class="computeroutput"><span class="identifier">regex_token_iterator</span></code></a> will enumerate
+      a series of strings (similar to perl style split operations).
+    </p>
+<p>
+      For those that dislike templates, there is a high level wrapper class <a class="link" href="ref/deprecated/old_regex.html" title="High Level Class RegEx (Deprecated)"><code class="computeroutput"><span class="identifier">RegEx</span></code></a>
+      that is an encapsulation of the lower level template code - it provides a simplified
+      interface for those that don't need the full power of the library, and supports
+      only narrow characters, and the "extended" regular expression syntax.
+      This class is now deprecated as it does not form part of the regular expressions
+      C++ standard library proposal.
+    </p>
+<p>
+      The POSIX API functions: <a class="link" href="ref/posix.html#boost_regex.ref.posix.regcomp"><code class="computeroutput"><span class="identifier">regcomp</span></code></a>, <a class="link" href="ref/posix.html#boost_regex.ref.posix.regexec"><code class="computeroutput"><span class="identifier">regexec</span></code></a>, <a class="link" href="ref/posix.html#boost_regex.ref.posix.regfree"><code class="computeroutput"><span class="identifier">regfree</span></code></a> and [regerr], are available
+      in both narrow character and Unicode versions, and are provided for those who
+      need compatibility with these API's.
+    </p>
+<p>
+      Finally, note that the library now has <a class="link" href="background/locale.html" title="Localization">run-time
+      localization support</a>, and recognizes the full POSIX regular expression
+      syntax - including advanced features like multi-character collating elements
+      and equivalence classes - as well as providing compatibility with other regular
+      expression libraries including GNU and BSD4 regex packages, PCRE and Perl 5.
+    </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="install.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unicode.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/partial_matches.html

@@ -0,0 +1,316 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Partial Matches</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="prev" href="captures.html" title="Understanding Marked Sub-Expressions and Captures">
+<link rel="next" href="syntax.html" title="Regular Expression Syntax">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="captures.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="syntax.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_regex.partial_matches"></a><a class="link" href="partial_matches.html" title="Partial Matches">Partial Matches</a>
+</h2></div></div></div>
+<p>
+      The <a class="link" href="ref/match_flag_type.html" title="match_flag_type"><code class="computeroutput"><span class="identifier">match_flag_type</span></code></a>
+      <code class="computeroutput"><span class="identifier">match_partial</span></code> can be passed
+      to the following algorithms: <a class="link" href="ref/regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a>, <a class="link" href="ref/regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a>, and <a class="link" href="ref/deprecated/regex_grep.html" title="regex_grep (Deprecated)"><code class="computeroutput"><span class="identifier">regex_grep</span></code></a>, and used with the iterator
+      <a class="link" href="ref/regex_iterator.html" title="regex_iterator"><code class="computeroutput"><span class="identifier">regex_iterator</span></code></a>.
+      When used it indicates that partial as well as full matches should be found.
+      A partial match is one that matched one or more characters at the end of the
+      text input, but did not match all of the regular expression (although it may
+      have done so had more input been available). Partial matches are typically
+      used when either validating data input (checking each character as it is entered
+      on the keyboard), or when searching texts that are either too long to load
+      into memory (or even into a memory mapped file), or are of indeterminate length
+      (for example the source may be a socket or similar). Partial and full matches
+      can be differentiated as shown in the following table (the variable M represents
+      an instance of <a class="link" href="ref/match_results.html" title="match_results"><code class="computeroutput"><span class="identifier">match_results</span></code></a> as filled in by <a class="link" href="ref/regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a>,
+      <a class="link" href="ref/regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a>
+      or <a class="link" href="ref/deprecated/regex_grep.html" title="regex_grep (Deprecated)"><code class="computeroutput"><span class="identifier">regex_grep</span></code></a>):
+    </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+            </th>
+<th>
+              <p>
+                Result
+              </p>
+            </th>
+<th>
+              <p>
+                M[0].matched
+              </p>
+            </th>
+<th>
+              <p>
+                M[0].first
+              </p>
+            </th>
+<th>
+              <p>
+                M[0].second
+              </p>
+            </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+              <p>
+                No match
+              </p>
+            </td>
+<td>
+              <p>
+                False
+              </p>
+            </td>
+<td>
+              <p>
+                Undefined
+              </p>
+            </td>
+<td>
+              <p>
+                Undefined
+              </p>
+            </td>
+<td>
+              <p>
+                Undefined
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                Partial match
+              </p>
+            </td>
+<td>
+              <p>
+                True
+              </p>
+            </td>
+<td>
+              <p>
+                False
+              </p>
+            </td>
+<td>
+              <p>
+                Start of partial match.
+              </p>
+            </td>
+<td>
+              <p>
+                End of partial match (end of text).
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                Full match
+              </p>
+            </td>
+<td>
+              <p>
+                True
+              </p>
+            </td>
+<td>
+              <p>
+                True
+              </p>
+            </td>
+<td>
+              <p>
+                Start of full match.
+              </p>
+            </td>
+<td>
+              <p>
+                End of full match.
+              </p>
+            </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+      Be aware that using partial matches can sometimes result in somewhat imperfect
+      behavior:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+          There are some expressions, such as ".*abc" that will always
+          produce a partial match. This problem can be reduced by careful construction
+          of the regular expressions used, or by setting flags like match_not_dot_newline
+          so that expressions like .* can't match past line boundaries.
+        </li>
+<li class="listitem">
+          Boost.Regex currently prefers leftmost matches to full matches, so for
+          example matching "abc|b" against "ab" produces a partial
+          match against the "ab" rather than a full match against "b".
+          It's more efficient to work this way, but may not be the behavior you want
+          in all situations.
+        </li>
+<li class="listitem">
+          There are situations where full matches are found even though partial matches
+          are also possible: for example if the partial string terminates with "abc"
+          and the regular expression is "\w+", then a full match is found
+          even though there may be more alphabetical characters to come. This particular
+          case can be detected by checking if the match found terminates at the end
+          of current input string. However, there are situations where that is not
+          possible: for example an expression such as "abc.*123" may always
+          have longer matches available since it could conceivably match the entire
+          input string (no matter how long it may be).
+        </li>
+</ul></div>
+<p>
+      The following example tests to see whether the text could be a valid credit
+      card number, as the user presses a key, the character entered would be added
+      to the string being built up, and passed to <code class="computeroutput"><span class="identifier">is_possible_card_number</span></code>.
+      If this returns true then the text could be a valid card number, so the user
+      interface's OK button would be enabled. If it returns false, then this is not
+      yet a valid card number, but could be with more input, so the user interface
+      would disable the OK button. Finally, if the procedure throws an exception
+      the input could never become a valid number, and the inputted character must
+      be discarded, and a suitable error indication displayed to the user.
+    </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">string</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+
+<span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex</span> <span class="identifier">e</span><span class="special">(</span><span class="string">"(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})"</span><span class="special">);</span>
+
+<span class="keyword">bool</span> <span class="identifier">is_possible_card_number</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&amp;</span> <span class="identifier">input</span><span class="special">)</span>
+<span class="special">{</span>
+   <span class="comment">//</span>
+   <span class="comment">// return false for partial match, true for full match, or throw for</span>
+   <span class="comment">// impossible match based on what we have so far...</span>
+   <span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_results</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">const_iterator</span><span class="special">&gt;</span> <span class="identifier">what</span><span class="special">;</span>
+   <span class="keyword">if</span><span class="special">(</span><span class="number">0</span> <span class="special">==</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex_match</span><span class="special">(</span><span class="identifier">input</span><span class="special">,</span> <span class="identifier">what</span><span class="special">,</span> <span class="identifier">e</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_default</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_partial</span><span class="special">))</span>
+   <span class="special">{</span>
+      <span class="comment">// the input so far could not possibly be valid so reject it:</span>
+      <span class="keyword">throw</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">runtime_error</span><span class="special">(</span>
+         <span class="string">"Invalid data entered - this could not possibly be a valid card number"</span><span class="special">);</span>
+   <span class="special">}</span>
+   <span class="comment">// OK so far so good, but have we finished?</span>
+   <span class="keyword">if</span><span class="special">(</span><span class="identifier">what</span><span class="special">[</span><span class="number">0</span><span class="special">].</span><span class="identifier">matched</span><span class="special">)</span>
+   <span class="special">{</span>
+      <span class="comment">// excellent, we have a result:</span>
+      <span class="keyword">return</span> <span class="keyword">true</span><span class="special">;</span>
+   <span class="special">}</span>
+   <span class="comment">// what we have so far is only a partial match...</span>
+   <span class="keyword">return</span> <span class="keyword">false</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+      In the following example, text input is taken from a stream containing an unknown
+      amount of text; this example simply counts the number of html tags encountered
+      in the stream. The text is loaded into a buffer and searched a part at a time,
+      if a partial match was encountered, then the partial match gets searched a
+      second time as the start of the next batch of text:
+    </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">fstream</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">sstream</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">string</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+
+<span class="comment">// match some kind of html tag:</span>
+<span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex</span> <span class="identifier">e</span><span class="special">(</span><span class="string">"&lt;[^&gt;]*&gt;"</span><span class="special">);</span>
+<span class="comment">// count how many:</span>
+<span class="keyword">unsigned</span> <span class="keyword">int</span> <span class="identifier">tags</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span>
+
+<span class="keyword">void</span> <span class="identifier">search</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">istream</span><span class="special">&amp;</span> <span class="identifier">is</span><span class="special">)</span>
+<span class="special">{</span>
+   <span class="comment">// buffer we'll be searching in:</span>
+   <span class="keyword">char</span> <span class="identifier">buf</span><span class="special">[</span><span class="number">4096</span><span class="special">];</span>
+   <span class="comment">// saved position of end of partial match:</span>
+   <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">next_pos</span> <span class="special">=</span> <span class="identifier">buf</span> <span class="special">+</span> <span class="keyword">sizeof</span><span class="special">(</span><span class="identifier">buf</span><span class="special">);</span>
+   <span class="comment">// flag to indicate whether there is more input to come:</span>
+   <span class="keyword">bool</span> <span class="identifier">have_more</span> <span class="special">=</span> <span class="keyword">true</span><span class="special">;</span>
+
+   <span class="keyword">while</span><span class="special">(</span><span class="identifier">have_more</span><span class="special">)</span>
+   <span class="special">{</span>
+      <span class="comment">// how much do we copy forward from last try:</span>
+      <span class="keyword">unsigned</span> <span class="identifier">leftover</span> <span class="special">=</span> <span class="special">(</span><span class="identifier">buf</span> <span class="special">+</span> <span class="keyword">sizeof</span><span class="special">(</span><span class="identifier">buf</span><span class="special">))</span> <span class="special">-</span> <span class="identifier">next_pos</span><span class="special">;</span>
+      <span class="comment">// and how much is left to fill:</span>
+      <span class="keyword">unsigned</span> <span class="identifier">size</span> <span class="special">=</span> <span class="identifier">next_pos</span> <span class="special">-</span> <span class="identifier">buf</span><span class="special">;</span>
+      <span class="comment">// copy forward whatever we have left:</span>
+      <span class="identifier">std</span><span class="special">::</span><span class="identifier">memmove</span><span class="special">(</span><span class="identifier">buf</span><span class="special">,</span> <span class="identifier">next_pos</span><span class="special">,</span> <span class="identifier">leftover</span><span class="special">);</span>
+      <span class="comment">// fill the rest from the stream:</span>
+      <span class="identifier">is</span><span class="special">.</span><span class="identifier">read</span><span class="special">(</span><span class="identifier">buf</span> <span class="special">+</span> <span class="identifier">leftover</span><span class="special">,</span> <span class="identifier">size</span><span class="special">);</span>
+      <span class="keyword">unsigned</span> <span class="identifier">read</span> <span class="special">=</span> <span class="identifier">is</span><span class="special">.</span><span class="identifier">gcount</span><span class="special">();</span>
+      <span class="comment">// check to see if we've run out of text:</span>
+      <span class="identifier">have_more</span> <span class="special">=</span> <span class="identifier">read</span> <span class="special">==</span> <span class="identifier">size</span><span class="special">;</span>
+      <span class="comment">// reset next_pos:</span>
+      <span class="identifier">next_pos</span> <span class="special">=</span> <span class="identifier">buf</span> <span class="special">+</span> <span class="keyword">sizeof</span><span class="special">(</span><span class="identifier">buf</span><span class="special">);</span>
+      <span class="comment">// and then iterate:</span>
+      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">cregex_iterator</span> <span class="identifier">a</span><span class="special">(</span>
+         <span class="identifier">buf</span><span class="special">,</span>
+         <span class="identifier">buf</span> <span class="special">+</span> <span class="identifier">read</span> <span class="special">+</span> <span class="identifier">leftover</span><span class="special">,</span>
+         <span class="identifier">e</span><span class="special">,</span>
+         <span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_default</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">match_partial</span><span class="special">);</span>
+      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">cregex_iterator</span> <span class="identifier">b</span><span class="special">;</span>
+
+      <span class="keyword">while</span><span class="special">(</span><span class="identifier">a</span> <span class="special">!=</span> <span class="identifier">b</span><span class="special">)</span>
+      <span class="special">{</span>
+         <span class="keyword">if</span><span class="special">((*</span><span class="identifier">a</span><span class="special">)[</span><span class="number">0</span><span class="special">].</span><span class="identifier">matched</span> <span class="special">==</span> <span class="keyword">false</span><span class="special">)</span>
+         <span class="special">{</span>
+            <span class="comment">// Partial match, save position and break:</span>
+            <span class="identifier">next_pos</span> <span class="special">=</span> <span class="special">(*</span><span class="identifier">a</span><span class="special">)[</span><span class="number">0</span><span class="special">].</span><span class="identifier">first</span><span class="special">;</span>
+            <span class="keyword">break</span><span class="special">;</span>
+         <span class="special">}</span>
+         <span class="keyword">else</span>
+         <span class="special">{</span>
+            <span class="comment">// full match:</span>
+            <span class="special">++</span><span class="identifier">tags</span><span class="special">;</span>
+         <span class="special">}</span>
+
+         <span class="comment">// move to next match:</span>
+         <span class="special">++</span><span class="identifier">a</span><span class="special">;</span>
+      <span class="special">}</span>
+   <span class="special">}</span>
+<span class="special">}</span>
+</pre>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="captures.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="syntax.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/ref.html

@@ -0,0 +1,123 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>Reference</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../index.html" title="Boost.Regex 7.0.1">
+<link rel="prev" href="format/boost_format_syntax.html" title="Boost-Extended Format String Syntax">
+<link rel="next" href="ref/basic_regex.html" title="basic_regex">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="format/boost_format_syntax.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ref/basic_regex.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_regex.ref"></a><a class="link" href="ref.html" title="Reference">Reference</a>
+</h2></div></div></div>
+<div class="toc"><dl class="toc">
+<dt><span class="section"><a href="ref/basic_regex.html">basic_regex</a></span></dt>
+<dt><span class="section"><a href="ref/match_results.html">match_results</a></span></dt>
+<dt><span class="section"><a href="ref/sub_match.html">sub_match</a></span></dt>
+<dt><span class="section"><a href="ref/regex_match.html">regex_match</a></span></dt>
+<dt><span class="section"><a href="ref/regex_search.html">regex_search</a></span></dt>
+<dt><span class="section"><a href="ref/regex_replace.html">regex_replace</a></span></dt>
+<dt><span class="section"><a href="ref/regex_iterator.html">regex_iterator</a></span></dt>
+<dt><span class="section"><a href="ref/regex_token_iterator.html">regex_token_iterator</a></span></dt>
+<dt><span class="section"><a href="ref/bad_expression.html">bad_expression</a></span></dt>
+<dt><span class="section"><a href="ref/syntax_option_type.html">syntax_option_type</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="ref/syntax_option_type/syntax_option_type_synopsis.html">syntax_option_type
+        Synopsis</a></span></dt>
+<dt><span class="section"><a href="ref/syntax_option_type/syntax_option_type_overview.html">Overview
+        of syntax_option_type</a></span></dt>
+<dt><span class="section"><a href="ref/syntax_option_type/syntax_option_type_perl.html">Options
+        for Perl Regular Expressions</a></span></dt>
+<dt><span class="section"><a href="ref/syntax_option_type/syntax_option_type_extended.html">Options
+        for POSIX Extended Regular Expressions</a></span></dt>
+<dt><span class="section"><a href="ref/syntax_option_type/syntax_option_type_basic.html">Options
+        for POSIX Basic Regular Expressions</a></span></dt>
+<dt><span class="section"><a href="ref/syntax_option_type/syntax_option_type_literal.html">Options
+        for Literal Strings</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="ref/match_flag_type.html">match_flag_type</a></span></dt>
+<dt><span class="section"><a href="ref/error_type.html">error_type</a></span></dt>
+<dt><span class="section"><a href="ref/regex_traits.html">regex_traits</a></span></dt>
+<dt><span class="section"><a href="ref/non_std_strings.html">Interfacing With Non-Standard
+      String Types</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="ref/non_std_strings/icu.html">Working With Unicode
+        and ICU String Types</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="ref/non_std_strings/icu/intro.html">Introduction
+          to using Regex with ICU</a></span></dt>
+<dt><span class="section"><a href="ref/non_std_strings/icu/unicode_types.html">Unicode
+          regular expression types</a></span></dt>
+<dt><span class="section"><a href="ref/non_std_strings/icu/unicode_algo.html">Unicode
+          Regular Expression Algorithms</a></span></dt>
+<dt><span class="section"><a href="ref/non_std_strings/icu/unicode_iter.html">Unicode
+          Aware Regex Iterators</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="ref/non_std_strings/mfc_strings.html">Using
+        Boost Regex With MFC Strings</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="ref/non_std_strings/mfc_strings/mfc_intro.html">Introduction
+          to Boost.Regex and MFC Strings</a></span></dt>
+<dt><span class="section"><a href="ref/non_std_strings/mfc_strings/mfc_regex_types.html">Regex
+          Types Used With MFC Strings</a></span></dt>
+<dt><span class="section"><a href="ref/non_std_strings/mfc_strings/mfc_regex_create.html">Regular
+          Expression Creation From an MFC String</a></span></dt>
+<dt><span class="section"><a href="ref/non_std_strings/mfc_strings/mfc_algo.html">Overloaded
+          Algorithms For MFC String Types</a></span></dt>
+<dt><span class="section"><a href="ref/non_std_strings/mfc_strings/mfc_iter.html">Iterating
+          Over the Matches Within An MFC String</a></span></dt>
+</dl></dd>
+</dl></dd>
+<dt><span class="section"><a href="ref/posix.html">POSIX Compatible C API's</a></span></dt>
+<dt><span class="section"><a href="ref/concepts.html">Concepts</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="ref/concepts/charT_concept.html">charT Requirements</a></span></dt>
+<dt><span class="section"><a href="ref/concepts/traits_concept.html">Traits Class
+        Requirements</a></span></dt>
+<dt><span class="section"><a href="ref/concepts/iterator_concepts.html">Iterator
+        Requirements</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="ref/deprecated.html">Deprecated Interfaces</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="ref/deprecated/regex_format.html">regex_format
+        (Deprecated)</a></span></dt>
+<dt><span class="section"><a href="ref/deprecated/regex_grep.html">regex_grep (Deprecated)</a></span></dt>
+<dt><span class="section"><a href="ref/deprecated/regex_split.html">regex_split
+        (deprecated)</a></span></dt>
+<dt><span class="section"><a href="ref/deprecated/old_regex.html">High Level Class
+        RegEx (Deprecated)</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="ref/internals.html">Internal Details</a></span></dt>
+<dd><dl><dt><span class="section"><a href="ref/internals/uni_iter.html">Unicode Iterators</a></span></dt></dl></dd>
+</dl></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="format/boost_format_syntax.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ref/basic_regex.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

doc/html/boost_regex/ref/bad_expression.html

@@ -0,0 +1,103 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<title>bad_expression</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
+<link rel="home" href="../../index.html" title="Boost.Regex 7.0.1">
+<link rel="up" href="../ref.html" title="Reference">
+<link rel="prev" href="regex_token_iterator.html" title="regex_token_iterator">
+<link rel="next" href="syntax_option_type.html" title="syntax_option_type">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="regex_token_iterator.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ref.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="syntax_option_type.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_regex.ref.bad_expression"></a><a class="link" href="bad_expression.html" title="bad_expression">bad_expression</a>
+</h3></div></div></div>
+<h5>
+<a name="boost_regex.ref.bad_expression.h0"></a>
+        <span class="phrase"><a name="boost_regex.ref.bad_expression.synopsis"></a></span><a class="link" href="bad_expression.html#boost_regex.ref.bad_expression.synopsis">Synopsis</a>
+      </h5>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">pattern_except</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+</pre>
+<p>
+        The class <code class="computeroutput"><span class="identifier">regex_error</span></code> defines
+        the type of objects thrown as exceptions to report errors during the conversion
+        from a string representing a regular expression to a finite state machine.
+      </p>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span>
+
+<span class="keyword">class</span> <span class="identifier">regex_error</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">runtime_error</span>
+<span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+   <span class="keyword">explicit</span> <span class="identifier">regex_error</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&amp;</span> <span class="identifier">s</span><span class="special">,</span> <span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">error_type</span> <span class="identifier">err</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span> <span class="identifier">pos</span><span class="special">);</span>
+   <span class="keyword">explicit</span> <span class="identifier">regex_error</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">error_type</span> <span class="identifier">err</span><span class="special">);</span>
+   <span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">error_type</span> <span class="identifier">code</span><span class="special">()</span><span class="keyword">const</span><span class="special">;</span>
+   <span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span> <span class="identifier">position</span><span class="special">()</span><span class="keyword">const</span><span class="special">;</span>
+<span class="special">};</span>
+
+<span class="keyword">typedef</span> <span class="identifier">regex_error</span> <span class="identifier">bad_pattern</span><span class="special">;</span> <span class="comment">// for backwards compatibility</span>
+<span class="keyword">typedef</span> <span class="identifier">regex_error</span> <span class="identifier">bad_expression</span><span class="special">;</span> <span class="comment">// for backwards compatibility</span>
+
+<span class="special">}</span> <span class="comment">// namespace boost</span>
+</pre>
+<h5>
+<a name="boost_regex.ref.bad_expression.h1"></a>
+        <span class="phrase"><a name="boost_regex.ref.bad_expression.description"></a></span><a class="link" href="bad_expression.html#boost_regex.ref.bad_expression.description">Description</a>
+      </h5>
+<pre class="programlisting"><span class="identifier">regex_error</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&amp;</span> <span class="identifier">s</span><span class="special">,</span> <span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">error_type</span> <span class="identifier">err</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span> <span class="identifier">pos</span><span class="special">);</span>
+<span class="identifier">regex_error</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">error_type</span> <span class="identifier">err</span><span class="special">);</span>
+</pre>
+<p>
+        <span class="bold"><strong>Effects:</strong></span> Constructs an object of class regex_error.
+      </p>
+<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">error_type</span> <span class="identifier">code</span><span class="special">()</span><span class="keyword">const</span><span class="special">;</span>
+</pre>
+<p>
+        <span class="bold"><strong>Effects:</strong></span> returns the error code that represents
+        parsing error that occurred.
+      </p>
+<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span> <span class="identifier">position</span><span class="special">()</span><span class="keyword">const</span><span class="special">;</span>
+</pre>
+<p>
+        <span class="bold"><strong>Effects:</strong></span> returns the location in the expression
+        where parsing stopped.
+      </p>
+<p>
+        Footnotes: the choice of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">runtime_error</span></code>
+        as the base class for <code class="computeroutput"><span class="identifier">regex_error</span></code>
+        is moot; depending upon how the library is used exceptions may be either
+        logic errors (programmer supplied expressions) or run time errors (user supplied
+        expressions). The library previously used <code class="computeroutput"><span class="identifier">bad_pattern</span></code>
+        and <code class="computeroutput"><span class="identifier">bad_expression</span></code> for errors,
+        these have been replaced by the single class <code class="computeroutput"><span class="identifier">regex_error</span></code>
+        to keep the library in synchronization with the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
+        Report on C++ Library Extensions</a>.
+      </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 1998-2013 John Maddock<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="regex_token_iterator.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ref.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="syntax_option_type.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>