boostorg/regex
1
0
Fork 1
mirror of https://github.com/boostorg/regex.git synced 2026-06-12 04:01:21 +02:00
Code Issues Packages Projects Releases Wiki Activity

Compare commits

base: boostorg/regex:code-coverage
Branches Tags
boostorg/regex:develop boostorg/regex:code-coverage boostorg/regex:master boostorg/regex:feature/gha boostorg/regex:build_adjust boostorg/regex:202507 boostorg/regex:master-merge-2025-01-27 boostorg/regex:modules boostorg/regex:backstep_recursion boostorg/regex:issue227 boostorg/regex:correct_example_jamfile boostorg/regex:pr/default-build-warnings boostorg/regex:pr/add-verbatim boostorg/regex:pr/fix-clang-cl-2 boostorg/regex:pr/fix-clang-cl-1 boostorg/regex:issue197 boostorg/regex:update_concepts boostorg/regex:remove_nothrow boostorg/regex:remove_03 boostorg/regex:recusion_stopper boostorg/regex:use_core_snprintf boostorg/regex:test_standalone boostorg/regex:issue184 boostorg/regex:issue183 boostorg/regex:overflow_fix boostorg/regex:feature/update-cmake boostorg/regex:icu_fix boostorg/regex:feature/icu-install-opts boostorg/regex:pr/fix-uchar boostorg/regex:de_fuzz boostorg/regex:svn-branches/maintenance/1_55_0 boostorg/regex:svn-branches/modular-build boostorg/regex:svn-branches/maintenance/1_54_0 boostorg/regex:svn-branches/maintenance/1_50_0 boostorg/regex:svn-branches/filesystem-v3a boostorg/regex:sandbox-branches/birbacher/propertymap-functormap boostorg/regex:svn-branches/filesystem-v3 boostorg/regex:svn-branches/quickbook-dev boostorg/regex:sandbox-branches/optional_optimization boostorg/regex:svn-branches/doc-tools-docs boostorg/regex:svn-branches/quickbook-filenames boostorg/regex:svn-branches/filesystem3 boostorg/regex:svn-branches/inspect boostorg/regex:sandbox-branches/birbacher/fix_documentation boostorg/regex:svn-branches/units/autoprefix boostorg/regex:svn-branches/b2 boostorg/regex:svn-branches/maintenance/1_41 boostorg/regex:sandbox-branches/intrusive_fix_SunCC boostorg/regex:svn-branches/phoenix_v3 boostorg/regex:sandbox-branches/straszheim/merge_me_into_trunk boostorg/regex:svn-branches/sredl_2009_05_proptree_update boostorg/regex:sandbox-branches/bhy/py3k boostorg/regex:svn-branches/proto/v4 boostorg/regex:svn-branches/bcbboost boostorg/regex:svn-branches/initializer-list boostorg/regex:svn-branches/pdimov_pre_136 boostorg/regex:svn-branches/cpp0x boostorg/regex:svn-tags/RC_1_34_0_freeze boostorg/regex:svn-branches/RC_1_33_0 boostorg/regex:svn-tags/merged_to_RC_1_33_0 boostorg/regex:svn-branches/thread_rewrite boostorg/regex:svn-branches/regex5 boostorg/regex:svn-branches/RC_1_32_0 boostorg/regex:svn-branches/SPIRIT_MINIBOOST boostorg/regex:svn-tags/merged_to_RC_ boostorg/regex:svn-branches/SPIRIT_1_6 boostorg/regex:svn-branches/RC_1_31_0 boostorg/regex:svn-branches/function_signature_patches_1_31 boostorg/regex:svn-tags/minmax boostorg/regex:svn-tags/merged_to_RC_1_31_0 boostorg/regex:svn-branches/RC_1_30_0 boostorg/regex:svn-tags/merged_to_RC_1_30_0 boostorg/regex:svn-branches/regex-4-1 boostorg/regex:svn-branches/mpl_v2_2 boostorg/regex:svn-branches/regex-4 boostorg/regex:svn-tags/boost_python_llnl_ boostorg/regex:svn-branches/RC_1_29_0
boostorg/regex:boost-1.91.0 boostorg/regex:boost-1.91.0.beta1 boostorg/regex:boost-1.90.0 boostorg/regex:boost-1.90.0.beta1 boostorg/regex:boost-1.89.0 boostorg/regex:boost-1.82.0.beta1 boostorg/regex:boost-1.83.0 boostorg/regex:boost-1.83.0.beta1 boostorg/regex:boost-1.84.0 boostorg/regex:boost-1.84.0.beta1 boostorg/regex:boost-1.85.0 boostorg/regex:boost-1.85.0.beta1 boostorg/regex:boost-1.86.0 boostorg/regex:boost-1.86.0.beta1 boostorg/regex:boost-1.87.0 boostorg/regex:boost-1.87.0.beta1 boostorg/regex:boost-1.88.0 boostorg/regex:boost-1.88.0.beta1 boostorg/regex:boost-1.82.0 boostorg/regex:boost-1.81.0.beta1 boostorg/regex:boost-1.80.0 boostorg/regex:boost-1.80.0.beta1 boostorg/regex:boost-1.81.0 boostorg/regex:boost-1.79.0.beta1 boostorg/regex:boost-1.79.0 boostorg/regex:boost-1.78.0 boostorg/regex:boost-1.78.0.beta1 boostorg/regex:boost-1.77.0 boostorg/regex:boost-1.77.0.beta1 boostorg/regex:boost-1.76.0 boostorg/regex:boost-1.76.0.beta1 boostorg/regex:boost-1.75.0 boostorg/regex:boost-1.74.0.beta1 boostorg/regex:boost-1.75.0.beta1 boostorg/regex:boost-1.74.0 boostorg/regex:boost-1.72.0 boostorg/regex:boost-1.72.0.beta1 boostorg/regex:boost-1.73.0.beta1 boostorg/regex:boost-1.73.0 boostorg/regex:boost-1.70.0 boostorg/regex:boost-1.70.0.beta1 boostorg/regex:boost-1.71.0 boostorg/regex:boost-1.71.0.beta1 boostorg/regex:boost-1.69.0 boostorg/regex:boost-1.69.0-beta1 boostorg/regex:boost-1.67.0 boostorg/regex:boost-1.68.0 boostorg/regex:boost-1.66.0 boostorg/regex:boost-1.64.0 boostorg/regex:boost-1.65.1 boostorg/regex:boost-1.64.0-beta2 boostorg/regex:boost-1.65.0 boostorg/regex:boost-1.64.0-beta1 boostorg/regex:boost-1.63.0 boostorg/regex:boost-1.62.0 boostorg/regex:boost-1.61.0 boostorg/regex:boost-1.60.0 boostorg/regex:boost-1.59.0 boostorg/regex:boost-1.58.0 boostorg/regex:boost-1.57.0 boostorg/regex:boost-1.56.0 boostorg/regex:boost-1.55.0 boostorg/regex:boost-1.54.0 boostorg/regex:boost-1.54.0-beta1 boostorg/regex:boost-1.53.0 boostorg/regex:boost-1.52.0 boostorg/regex:boost-1.51.0 boostorg/regex:boost-1.50.0 boostorg/regex:boost-1.50.0-beta1 boostorg/regex:boost-1.49.0 boostorg/regex:boost-1.49.0-beta1 boostorg/regex:boost-1.48.0 boostorg/regex:boost-1.48.0-beta1 boostorg/regex:boost-1.47.0 boostorg/regex:boost-1.47.0-beta1 boostorg/regex:boost-1.46.1 boostorg/regex:boost-1.46.0 boostorg/regex:boost-1.46.0-beta1 boostorg/regex:boost-1.45.0 boostorg/regex:boost-1.45.0-beta1 boostorg/regex:boost-1.44.0 boostorg/regex:boost-1.44.0-beta1 boostorg/regex:boost-1.43.0 boostorg/regex:boost-1.43.0-beta1 boostorg/regex:boost-1.42.0 boostorg/regex:boost-1.41.0 boostorg/regex:boost-1.41.0-beta1 boostorg/regex:boost-1.40.0 boostorg/regex:boost-1.39.0 boostorg/regex:boost-1.39.0-beta1 boostorg/regex:boost-1.38.0 boostorg/regex:boost-1.37.0 boostorg/regex:boost-1.37.0-beta1 boostorg/regex:boost-1.36.0 boostorg/regex:boost-1.36.0-beta1 boostorg/regex:boost-1.35.0 boostorg/regex:boost-1.35.0-rc3 boostorg/regex:boost-1.35.0-rc1 boostorg/regex:boost-1.34.1 boostorg/regex:boost-1.34.1-rc3 boostorg/regex:boost-1.34.1-rc2 boostorg/regex:boost-1.34.1-rc1 boostorg/regex:boost-1.34.0 boostorg/regex:boost-1.34.0-rc3 boostorg/regex:boost-1.34.0-rc2 boostorg/regex:boost-1.34.0-rc1 boostorg/regex:boost-1.34.0-beta1 boostorg/regex:boost-1.33.1 boostorg/regex:boost-1.33.1-beta1 boostorg/regex:boost-1.33.0 boostorg/regex:boost-1.32.0 boostorg/regex:boost-1.31.0 boostorg/regex:boost-1.30.2 boostorg/regex:boost-1.30.1 boostorg/regex:boost-1.30.2-rc1 boostorg/regex:boost-1.30.0 boostorg/regex:boost-1.29.0 boostorg/regex:boost-1.28.0 boostorg/regex:boost-1.27.0 boostorg/regex:boost-1.26.0 boostorg/regex:boost-1.25.1-bgl boostorg/regex:boost-1.25.1 boostorg/regex:boost-1.25.0 boostorg/regex:boost-1.24.0 boostorg/regex:boost-1.23.0 boostorg/regex:boost-1.22.0 boostorg/regex:boost-1.21.2 boostorg/regex:boost-1.21.1 boostorg/regex:boost-1.21.0 boostorg/regex:boost-1.20.2 boostorg/regex:boost-1.20.1 boostorg/regex:boost-1.20.0 boostorg/regex:boost-1.19.0 boostorg/regex:boost-1.18.3 boostorg/regex:boost-1.18.2 boostorg/regex:boost-1.18.0
..
compare: boostorg/regex:svn-branches/thread_rewrite
Branches Tags
boostorg/regex:code-coverage boostorg/regex:develop boostorg/regex:master boostorg/regex:feature/gha boostorg/regex:build_adjust boostorg/regex:202507 boostorg/regex:master-merge-2025-01-27 boostorg/regex:modules boostorg/regex:backstep_recursion boostorg/regex:issue227 boostorg/regex:correct_example_jamfile boostorg/regex:pr/default-build-warnings boostorg/regex:pr/add-verbatim boostorg/regex:pr/fix-clang-cl-2 boostorg/regex:pr/fix-clang-cl-1 boostorg/regex:issue197 boostorg/regex:update_concepts boostorg/regex:remove_nothrow boostorg/regex:remove_03 boostorg/regex:recusion_stopper boostorg/regex:use_core_snprintf boostorg/regex:test_standalone boostorg/regex:issue184 boostorg/regex:issue183 boostorg/regex:overflow_fix boostorg/regex:feature/update-cmake boostorg/regex:icu_fix boostorg/regex:feature/icu-install-opts boostorg/regex:pr/fix-uchar boostorg/regex:de_fuzz boostorg/regex:svn-branches/maintenance/1_55_0 boostorg/regex:svn-branches/modular-build boostorg/regex:svn-branches/maintenance/1_54_0 boostorg/regex:svn-branches/maintenance/1_50_0 boostorg/regex:svn-branches/filesystem-v3a boostorg/regex:sandbox-branches/birbacher/propertymap-functormap boostorg/regex:svn-branches/filesystem-v3 boostorg/regex:svn-branches/quickbook-dev boostorg/regex:sandbox-branches/optional_optimization boostorg/regex:svn-branches/doc-tools-docs boostorg/regex:svn-branches/quickbook-filenames boostorg/regex:svn-branches/filesystem3 boostorg/regex:svn-branches/inspect boostorg/regex:sandbox-branches/birbacher/fix_documentation boostorg/regex:svn-branches/units/autoprefix boostorg/regex:svn-branches/b2 boostorg/regex:svn-branches/maintenance/1_41 boostorg/regex:sandbox-branches/intrusive_fix_SunCC boostorg/regex:svn-branches/phoenix_v3 boostorg/regex:sandbox-branches/straszheim/merge_me_into_trunk boostorg/regex:svn-branches/sredl_2009_05_proptree_update boostorg/regex:sandbox-branches/bhy/py3k boostorg/regex:svn-branches/proto/v4 boostorg/regex:svn-branches/bcbboost boostorg/regex:svn-branches/initializer-list boostorg/regex:svn-branches/pdimov_pre_136 boostorg/regex:svn-branches/cpp0x boostorg/regex:svn-tags/RC_1_34_0_freeze boostorg/regex:svn-branches/RC_1_33_0 boostorg/regex:svn-tags/merged_to_RC_1_33_0 boostorg/regex:svn-branches/thread_rewrite boostorg/regex:svn-branches/regex5 boostorg/regex:svn-branches/RC_1_32_0 boostorg/regex:svn-branches/SPIRIT_MINIBOOST boostorg/regex:svn-tags/merged_to_RC_ boostorg/regex:svn-branches/SPIRIT_1_6 boostorg/regex:svn-branches/RC_1_31_0 boostorg/regex:svn-branches/function_signature_patches_1_31 boostorg/regex:svn-tags/minmax boostorg/regex:svn-tags/merged_to_RC_1_31_0 boostorg/regex:svn-branches/RC_1_30_0 boostorg/regex:svn-tags/merged_to_RC_1_30_0 boostorg/regex:svn-branches/regex-4-1 boostorg/regex:svn-branches/mpl_v2_2 boostorg/regex:svn-branches/regex-4 boostorg/regex:svn-tags/boost_python_llnl_ boostorg/regex:svn-branches/RC_1_29_0
boostorg/regex:boost-1.91.0 boostorg/regex:boost-1.91.0.beta1 boostorg/regex:boost-1.90.0 boostorg/regex:boost-1.90.0.beta1 boostorg/regex:boost-1.89.0 boostorg/regex:boost-1.82.0.beta1 boostorg/regex:boost-1.83.0 boostorg/regex:boost-1.83.0.beta1 boostorg/regex:boost-1.84.0 boostorg/regex:boost-1.84.0.beta1 boostorg/regex:boost-1.85.0 boostorg/regex:boost-1.85.0.beta1 boostorg/regex:boost-1.86.0 boostorg/regex:boost-1.86.0.beta1 boostorg/regex:boost-1.87.0 boostorg/regex:boost-1.87.0.beta1 boostorg/regex:boost-1.88.0 boostorg/regex:boost-1.88.0.beta1 boostorg/regex:boost-1.82.0 boostorg/regex:boost-1.81.0.beta1 boostorg/regex:boost-1.80.0 boostorg/regex:boost-1.80.0.beta1 boostorg/regex:boost-1.81.0 boostorg/regex:boost-1.79.0.beta1 boostorg/regex:boost-1.79.0 boostorg/regex:boost-1.78.0 boostorg/regex:boost-1.78.0.beta1 boostorg/regex:boost-1.77.0 boostorg/regex:boost-1.77.0.beta1 boostorg/regex:boost-1.76.0 boostorg/regex:boost-1.76.0.beta1 boostorg/regex:boost-1.75.0 boostorg/regex:boost-1.74.0.beta1 boostorg/regex:boost-1.75.0.beta1 boostorg/regex:boost-1.74.0 boostorg/regex:boost-1.72.0 boostorg/regex:boost-1.72.0.beta1 boostorg/regex:boost-1.73.0.beta1 boostorg/regex:boost-1.73.0 boostorg/regex:boost-1.70.0 boostorg/regex:boost-1.70.0.beta1 boostorg/regex:boost-1.71.0 boostorg/regex:boost-1.71.0.beta1 boostorg/regex:boost-1.69.0 boostorg/regex:boost-1.69.0-beta1 boostorg/regex:boost-1.67.0 boostorg/regex:boost-1.68.0 boostorg/regex:boost-1.66.0 boostorg/regex:boost-1.64.0 boostorg/regex:boost-1.65.1 boostorg/regex:boost-1.64.0-beta2 boostorg/regex:boost-1.65.0 boostorg/regex:boost-1.64.0-beta1 boostorg/regex:boost-1.63.0 boostorg/regex:boost-1.62.0 boostorg/regex:boost-1.61.0 boostorg/regex:boost-1.60.0 boostorg/regex:boost-1.59.0 boostorg/regex:boost-1.58.0 boostorg/regex:boost-1.57.0 boostorg/regex:boost-1.56.0 boostorg/regex:boost-1.55.0 boostorg/regex:boost-1.54.0 boostorg/regex:boost-1.54.0-beta1 boostorg/regex:boost-1.53.0 boostorg/regex:boost-1.52.0 boostorg/regex:boost-1.51.0 boostorg/regex:boost-1.50.0 boostorg/regex:boost-1.50.0-beta1 boostorg/regex:boost-1.49.0 boostorg/regex:boost-1.49.0-beta1 boostorg/regex:boost-1.48.0 boostorg/regex:boost-1.48.0-beta1 boostorg/regex:boost-1.47.0 boostorg/regex:boost-1.47.0-beta1 boostorg/regex:boost-1.46.1 boostorg/regex:boost-1.46.0 boostorg/regex:boost-1.46.0-beta1 boostorg/regex:boost-1.45.0 boostorg/regex:boost-1.45.0-beta1 boostorg/regex:boost-1.44.0 boostorg/regex:boost-1.44.0-beta1 boostorg/regex:boost-1.43.0 boostorg/regex:boost-1.43.0-beta1 boostorg/regex:boost-1.42.0 boostorg/regex:boost-1.41.0 boostorg/regex:boost-1.41.0-beta1 boostorg/regex:boost-1.40.0 boostorg/regex:boost-1.39.0 boostorg/regex:boost-1.39.0-beta1 boostorg/regex:boost-1.38.0 boostorg/regex:boost-1.37.0 boostorg/regex:boost-1.37.0-beta1 boostorg/regex:boost-1.36.0 boostorg/regex:boost-1.36.0-beta1 boostorg/regex:boost-1.35.0 boostorg/regex:boost-1.35.0-rc3 boostorg/regex:boost-1.35.0-rc1 boostorg/regex:boost-1.34.1 boostorg/regex:boost-1.34.1-rc3 boostorg/regex:boost-1.34.1-rc2 boostorg/regex:boost-1.34.1-rc1 boostorg/regex:boost-1.34.0 boostorg/regex:boost-1.34.0-rc3 boostorg/regex:boost-1.34.0-rc2 boostorg/regex:boost-1.34.0-rc1 boostorg/regex:boost-1.34.0-beta1 boostorg/regex:boost-1.33.1 boostorg/regex:boost-1.33.1-beta1 boostorg/regex:boost-1.33.0 boostorg/regex:boost-1.32.0 boostorg/regex:boost-1.31.0 boostorg/regex:boost-1.30.2 boostorg/regex:boost-1.30.1 boostorg/regex:boost-1.30.2-rc1 boostorg/regex:boost-1.30.0 boostorg/regex:boost-1.29.0 boostorg/regex:boost-1.28.0 boostorg/regex:boost-1.27.0 boostorg/regex:boost-1.26.0 boostorg/regex:boost-1.25.1-bgl boostorg/regex:boost-1.25.1 boostorg/regex:boost-1.25.0 boostorg/regex:boost-1.24.0 boostorg/regex:boost-1.23.0 boostorg/regex:boost-1.22.0 boostorg/regex:boost-1.21.2 boostorg/regex:boost-1.21.1 boostorg/regex:boost-1.21.0 boostorg/regex:boost-1.20.2 boostorg/regex:boost-1.20.1 boostorg/regex:boost-1.20.0 boostorg/regex:boost-1.19.0 boostorg/regex:boost-1.18.3 boostorg/regex:boost-1.18.2 boostorg/regex:boost-1.18.0

597 Commits
code-coverage .. svn-branches/thread_rewrite

Author SHA1 Message Date
nobody 755ea5b2ad This commit was manufactured by cvs2svn to create branch 
'thread_rewrite'.

[SVN r30953]
 2005-09-13 14:20:32 +00:00
John Maddock 90f4367b8d Ported ICU integration code to VC6/7. 
Added some needed std lib #includes.
Reworked gcc separate file template instantiation code.


[SVN r30791]
 2005-09-03 11:13:28 +00:00
John Maddock db5748ae7e Added config and header include changes needed to support MSVC + STLport 5.0. 
[SVN r30701]
 2005-08-27 10:25:15 +00:00
John Maddock 46b7d89fff Gcc warning suppression. 
[SVN r30673]
 2005-08-25 17:26:08 +00:00
John Maddock 7ee1a58a84 Large patch from Ulrich Eckhardt to fix support for EVC++ 4. 
[SVN r30670]
 2005-08-25 16:27:28 +00:00
John Maddock bfa2168237 gcc+stlport fix. 
[SVN r30668]
 2005-08-25 12:57:20 +00:00
John Maddock 2f3b212a22 Disabled support for external templates with Intel 8.0 and earlier (it leads to unresolved externals). 
[SVN r30643]
 2005-08-24 09:59:14 +00:00
John Maddock d3a9bbfabd Made regex_error backwards compatible with Boost-1.32. 
[SVN r30623]
 2005-08-22 10:56:15 +00:00
John Maddock 233f083720 Updated History. 
Added additional tests for regexes that are supposed to be empty.
Added additional test cases for non-greedy repeats.


[SVN r30605]
 2005-08-19 16:12:45 +00:00
John Maddock c39176085b Fixed VC7.1-STLport config setup so it works with /Zc:wchar_t 
Re-ordered code in static_mutex.hpp to satisfy SGI IRIX.
Added some additional #includes to satisfy SGI Irix.
Fixed strange bug where some non-greedy repeats could repeat more times than permitted.
Fixed return value from basic_regex<>::empty().
Fixed return value from basic_regex<>::expression() and basic_regex<>::size() when the expression is invalid.


[SVN r30604]
 2005-08-19 16:10:11 +00:00
John Maddock bf96863756 Updated makefiles: some dependencies have been removed, VC71 and VC8 path setup has been fixed. 
[SVN r30546]
 2005-08-12 16:05:15 +00:00
Douglas Gregor bb27376db2 Merged from 1.33.0 release 
[SVN r30540]
 2005-08-12 13:02:37 +00:00
John Maddock cbc098536e Merged fixes to broken links from release branch. 
[SVN r30458]
 2005-08-04 16:06:27 +00:00
John Maddock 9ce6ff7205 Updated history. 
[SVN r30113]
 2005-07-15 16:32:50 +00:00
John Maddock bb0ae0940e min/max usage. 
[SVN r30036]
 2005-07-13 09:38:57 +00:00
John Maddock 6581468288 Fixed broken links. 
Fixed min/max references.


[SVN r30005]
 2005-07-12 12:39:56 +00:00
John Maddock dd5e27addb Remove dead files. 
Strip tabs from files.


[SVN r30003]
 2005-07-12 10:08:11 +00:00
John Maddock 1991c202ed Remove dead files. 
Strip tabs from files.
Fix MSVC-specific workaround that doesn't work on Win64.


[SVN r30002]
 2005-07-12 09:49:21 +00:00
Markus Schöpflin 4781768515 Workaround for Tru64/CXX to avoid multiple definitions of static variables. 
[SVN r29907]
 2005-07-06 13:08:39 +00:00
Markus Schöpflin 6025be01c1 Disable three specific unicode tests for Tru64 which are failing badly. 
[SVN r29905]
 2005-07-06 13:00:01 +00:00
John Maddock f353225685 Fix gcc warnings, and use the correct facet! 
[SVN r29831]
 2005-06-28 15:31:33 +00:00
John Maddock b2e8ee918f Change constant values to avoid clash with gcc-4 on Darwin. 
[SVN r29727]
 2005-06-22 09:50:29 +00:00
John Maddock 6064aa15cb Made some member public to keep early EDG compilers happy. 
[SVN r29704]
 2005-06-20 11:48:37 +00:00
Markus Schöpflin bc6504eda9 Fix for compilers not implementing the resolution to DR45. 
[SVN r29699]
 2005-06-20 09:22:49 +00:00
John Maddock 8a01dedb52 New vc8 makefile needs to use correct lib name mangling. 
Update installation docs for makefiles.
Update regression test makefiles.


[SVN r29678]
 2005-06-18 16:55:01 +00:00
John Maddock 35bf922e17 Improve ICU configuration. 
Update makefiles.
Add VC8 makefile.


[SVN r29658]
 2005-06-17 16:37:41 +00:00
John Maddock ec74461c36 Undo previous Borland fix, it turns out not to be standards conforming! 
[SVN r29657]
 2005-06-17 16:35:38 +00:00
John Maddock 799901aafc Fixes to suppress VC7.1 warnings: just rename a few variables to work around the issue. 
[SVN r29652]
 2005-06-17 11:18:05 +00:00
John Maddock c18e751bfc Fix for compilers that define BOOST_NO_STD_MESSAGES. 
[SVN r29651]
 2005-06-17 11:16:56 +00:00
John Maddock a87dad5cc8 Improved ICU handling. 
Brought auto-link test Jamfile up to date.


[SVN r29526]
 2005-06-11 14:21:21 +00:00
John Maddock bbd5296b4e Allow for NUL's. 
[SVN r29513]
 2005-06-10 10:08:40 +00:00
John Maddock 9e9fc27dc6 Apply patches to regex_iteraor/regex_token_iterator to the unicode iterators as well. 
[SVN r29512]
 2005-06-10 10:07:49 +00:00
Rene Rivera a97324c1c4 Some slight cleanup of vc7 vs. vc-7_0, and msvc vs. vc-6_5. 
[SVN r29487]
 2005-06-09 00:52:17 +00:00
John Maddock 90b647cdd7 Fix gcc-2.95 compatibility, and supress new warnings from gc-4.0 in protected_call. 
[SVN r29407]
 2005-06-03 16:10:54 +00:00
John Maddock 80eb2c2bee Updated history, and added format_literal documentation. 
[SVN r29378]
 2005-06-02 15:55:55 +00:00
John Maddock ab8f05f2a1 Updated list of macros to print. 
[SVN r29317]
 2005-05-31 09:46:18 +00:00
John Maddock 7a525369cc Removed unsupported file. 
Updated macro list in user.hpp.


[SVN r29316]
 2005-05-31 09:45:35 +00:00
John Maddock 69723060e5 Updated build information to make it clear that ICU support is optional. 
[SVN r29253]
 2005-05-28 11:50:09 +00:00
John Maddock a56990d55a Internalise Boost.Test dependency. 
[SVN r29100]
 2005-05-20 15:35:44 +00:00
John Maddock 8aad9e15af Removed VC8 workaround: it's been fixed in Beta 2. 
[SVN r29068]
 2005-05-19 17:03:09 +00:00
John Maddock c2de12f113 Disable features that HP aCC can't cope with (gets basic regression tests passing with aCC). 
[SVN r29032]
 2005-05-18 11:44:12 +00:00
John Maddock 3022a819e6 Don't try and parse thousands separators in number strings (VC8 bug). 
[SVN r29031]
 2005-05-18 11:43:02 +00:00
John Maddock 9b75e91909 Better spell BOOST_MSVC correctly! 
[SVN r28985]
 2005-05-17 10:31:53 +00:00
John Maddock df966c1410 Fix for Borland C++. 
[SVN r28984]
 2005-05-17 10:24:49 +00:00
John Maddock 9ca851d01f Fix function calling conventions (Borland C++ fix). 
[SVN r28949]
 2005-05-16 09:57:26 +00:00
John Maddock 28285007cc Fixes for compaq C++ 
[SVN r28931]
 2005-05-15 16:14:47 +00:00
John Maddock 0ae6fb5796 Changed checks to avoid "pointless comparison" warnings. 
Change preprocessor code to not use WCHAR_MAX on OSL (Tru64) systems (it's definition is not preprocessor friendly on gcc).


[SVN r28892]
 2005-05-14 11:49:50 +00:00
John Maddock a48a6de286 Fix ICU lib name 
[SVN r28862]
 2005-05-13 12:31:44 +00:00
John Maddock e9596db92b Fix como build options to disable thread support. 
[SVN r28861]
 2005-05-13 12:31:07 +00:00
John Maddock b912fb5b64 Improve partial match docs. 
Fix license on new file.


[SVN r28823]
 2005-05-11 14:31:10 +00:00
John Maddock 9a3fee10dd Suppress warnings when exceptions are turned off on gcc. 
[SVN r28822]
 2005-05-11 14:29:53 +00:00
Rene Rivera 0d5dcf41d9 Add std::locale-support to grep test as it uses codecvt. 
[SVN r28723]
 2005-05-07 21:33:22 +00:00
John Maddock c9f906eb14 Don't need the toupper/tolower code any more - problem solved. 
[SVN r28542]
 2005-04-30 10:13:55 +00:00
John Maddock 7775706a95 Spell "boost_program_options" correctly. 
[SVN r28528]
 2005-04-29 15:16:14 +00:00
John Maddock 774981bb52 Must check numeric_limits<charT>::is_specialized before using other members! 
[SVN r28527]
 2005-04-29 15:04:06 +00:00
John Maddock 90560a3278 Added workaround for old EDG based compilers (SGI cxx compiler). 
[SVN r28518]
 2005-04-28 16:31:39 +00:00
John Maddock 2e0466d662 Updated/corrected references to Perl. 
[SVN r28516]
 2005-04-28 16:16:10 +00:00
John Maddock a694bc1ebb Added some extra tests to try and figure out what the problem with Tru64 is. 
[SVN r28505]
 2005-04-27 15:50:16 +00:00
John Maddock b04bc5b5b0 Calls to std::tolower/toupper should cast their argument to an unsigned char. 
[SVN r28504]
 2005-04-27 15:49:30 +00:00
John Maddock ed93c55832 Added additional tests for newly discovered regex_iterator bug. 
[SVN r28385]
 2005-04-21 15:54:54 +00:00
John Maddock d3a8abb5ef Fix to stop \A from matching successive matches. 
[SVN r28384]
 2005-04-21 15:54:07 +00:00
Markus Schöpflin 5473345609 Added workaround for Tru64/CXX-6.5. 
[SVN r28323]
 2005-04-19 15:05:23 +00:00
John Maddock 112422adc9 Reworked separate file template instantiation code, to use non-template forwarding functions instead - it works on more compilers that way. 
[SVN r28295]
 2005-04-17 14:44:37 +00:00
John Maddock 1d1fadeb5a Disabled reverse_iterator tests for broken Rogue Wave library versions (workaround for old sunpro compilers). 
[SVN r28294]
 2005-04-17 14:43:28 +00:00
John Maddock c81ebebd32 Added needed include (really only applies to gcc-2.95). 
[SVN r28293]
 2005-04-17 14:41:56 +00:00
John Maddock 3e5efe81d2 Made this header C compatible. 
[SVN r28292]
 2005-04-17 14:38:24 +00:00
John Maddock 91b21e78ff Added better documentation on POSIX-conformance. 
[SVN r28278]
 2005-04-16 16:06:45 +00:00
John Maddock 5d1f265345 Moved new #include to central location with the rest of the includes. 
[SVN r28273]
 2005-04-15 15:39:26 +00:00
Jens Maurer 506cd316b2 add #include <algorithm> because we use std::swap() 
[SVN r28249]
 2005-04-14 15:50:22 +00:00
Vladimir Prus c2c5b3f726 Don't link posix_api_check to program_execution_monitor. It's unused and 
causes link errors for shared linking, due to unresolved reference to cpp_main.


[SVN r28209]
 2005-04-13 09:38:09 +00:00
John Maddock 21c368964f Removed dead file (it's been moved to boost/regex/pending). 
[SVN r27949]
 2005-04-04 10:13:30 +00:00
John Maddock de28eb9b18 1) Disabled recursive implementation for VC8: stack overflows can't be reliably detected unless the whole program is compiled with asynchronous exceptions. 
2) Changed std::copy calls on VC8 to avoid "dangerous code" warnings.
3) Moved backreference and octal escape code into line with POSIX-extended requirements.
4) Changed match_results leftmost-longest rules to stop unnecessary std::distance computations (an optimisation for non-random access iterators).
5) Changed C lib calls to use "safe" versions of string API's where available.
6) Added many new POSIX-extended leftmost-longest tests, to verify the above.


[SVN r27880]
 2005-03-30 11:38:51 +00:00
John Maddock ca144bb2b3 Make it sure this compiles when there's no exception handling support. 
[SVN r27578]
 2005-03-08 17:28:45 +00:00
John Maddock a2f958b60c Anything that shares VC6's runtime has the same issues with setlocale that VC6 does. 
[SVN r27516]
 2005-02-28 10:55:15 +00:00
John Maddock 7c5e1f05c4 Added fix for compilers without <locale>. 
[SVN r27515]
 2005-02-28 10:54:12 +00:00
John Maddock ef25339d94 Don't test locales with MSVC: setlocale sometimes bombs out. 
[SVN r27503]
 2005-02-25 11:04:11 +00:00
John Maddock 31370cd498 Updated concepts to match the TR. 
[SVN r27472]
 2005-02-21 12:27:23 +00:00
John Maddock ea94315d6b Fix mutex linking problems. 
[SVN r27421]
 2005-02-19 11:42:04 +00:00
John Maddock f736d985fb Update docs on empty alternatives. 
[SVN r27419]
 2005-02-18 17:15:24 +00:00
John Maddock ecd5dd5ff3 Allow sort keys to contain nothing but a single NUL character (characters may be ignorable). 
[SVN r27408]
 2005-02-17 12:44:16 +00:00
John Maddock 077f211f2f Compiler specific fixes and workarounds. 
[SVN r27273]
 2005-02-09 13:16:39 +00:00
John Maddock 2ee7ef601c include needed <iostream> 
[SVN r27272]
 2005-02-09 13:15:27 +00:00
John Maddock eff6f06792 Made min/max usage conform to our guidelines. 
Changed Boost.test usage to conform to new interface.


[SVN r27271]
 2005-02-09 12:33:18 +00:00
John Maddock 1df0b9cacd Added more info about sort keys from traits classes. 
[SVN r27246]
 2005-02-08 16:54:36 +00:00
John Maddock c3f16e3834 SunPro test program fix. 
[SVN r27147]
 2005-02-05 13:12:23 +00:00
Stefan Slapeta 012fe3a99d replaced BOOST_TEST 
[SVN r27053]
 2005-02-03 13:24:55 +00:00
John Maddock dbb39f3589 Changed assert code to try and clear up a mysterious sunpro problem. 
[SVN r26958]
 2005-01-31 11:06:54 +00:00
John Maddock 40735d5630 Added another check to try and diagnode sunpro issue. 
[SVN r26898]
 2005-01-28 13:37:41 +00:00
John Maddock d28ac18da2 Need some more tests to track down remaining issues. 
[SVN r26845]
 2005-01-25 17:22:50 +00:00
John Maddock 29df3606a1 Some fixes for MWCW, broken compilers etc. 
[SVN r26834]
 2005-01-24 11:05:45 +00:00
John Maddock 3bedef8c4e Updated more license terms. 
Added new informational program to try and track down issues with std::collate, and std::ctype.


[SVN r26803]
 2005-01-22 16:32:01 +00:00
John Maddock c04cb21103 Added BOOST_REGEX_BUGGY_CTYPE_FACET to list of macros to print. 
[SVN r26800]
 2005-01-22 13:14:11 +00:00
John Maddock 56fadadba8 More Sunpro std::distance fixes. 
Changed Dr John Maddock to John Maddock


[SVN r26793]
 2005-01-21 17:28:42 +00:00
John Maddock d7e194585d More std::distance fixes for Sunpro. 
Changed Dr John Maddock to John Maddock.


[SVN r26791]
 2005-01-21 17:22:39 +00:00
John Maddock e874d7710b Rewritten format method, to avoid ambiguous function call. 
[SVN r26760]
 2005-01-20 11:10:44 +00:00
John Maddock ca338db5ae Removed erroneous charT references. 
[SVN r26759]
 2005-01-20 11:10:28 +00:00
John Maddock 018fbfec05 Changed legacy referernces to reg_expression to basic_regex 
[SVN r26740]
 2005-01-19 13:29:43 +00:00
John Maddock b7cb69bae3 Removed one dead file. 
Changed legacy referernces to reg_expression to basic_regex


[SVN r26739]
 2005-01-19 13:28:57 +00:00
John Maddock 8545aeb1f3 Fixed primary equivalence classes, so that delimiter based sort keys with a delim in position 0 still work. 
[SVN r26738]
 2005-01-19 11:13:53 +00:00
John Maddock 2a248d1f87 Changed assert's to BOOST_ASSERT's. 
Made array sizes explicit to fix MWCW problems.


[SVN r26723]
 2005-01-18 12:52:40 +00:00
John Maddock 9781fe3150 Removed dead files. 
Changed some asserts to BOOST_ASSERT.
Disabled collation in one test (locale dependent behaviour fails on some platforms).


[SVN r26722]
 2005-01-18 12:51:26 +00:00
John Maddock c8c4c1c289 Fix for libstdc++ debug mode assertions: singular iterators can not be copied, so insertion into a container requires extra special care. 
[SVN r26718]
 2005-01-17 16:56:14 +00:00
John Maddock 5ef242d146 Disable some tests for MWCW 
[SVN r26717]
 2005-01-17 12:11:47 +00:00
John Maddock c2db73aec7 Cleaned up non-standard behaviour in traits classes. 
Suppressed explicit instantiations for older Intel versions.
Added std::distance workaround for Sunpro.


[SVN r26716]
 2005-01-17 12:10:48 +00:00
John Maddock 30acb7d2f8 Rewritten grep example program. 
"touched" some of the sources to force regression tests to rebuild.
Split test code up some more to help msvc-stlport.


[SVN r26705]
 2005-01-15 12:29:59 +00:00
John Maddock 1e48609cfd Patches for MWCW and gcc-4.0. 
[SVN r26704]
 2005-01-15 11:23:46 +00:00
John Maddock 34355d3e79 Added fix for msvc+STLport. 
[SVN r26696]
 2005-01-14 11:19:46 +00:00
John Maddock 434f3589a5 Added MWCW fix. 
[SVN r26695]
 2005-01-14 11:10:22 +00:00
John Maddock 71a0e020e2 merged changes in regex5 branch 
[SVN r26692]
 2005-01-13 17:06:21 +00:00
John Maddock de0ab9092a Fix for .{n,} failing in partial matches. 
Fix for [\x0-\xff] failing in wide character expressions.


[SVN r26566]
 2004-12-21 17:07:46 +00:00
John Maddock ab6f20486b Fix problem with match_any and POSIX-style matches (match results structure wasn't getting filled in). 
Fixed problem with gcc in -pedantic mode.


[SVN r26348]
 2004-11-29 13:50:17 +00:00
Aleksey Gurtovoy 916dbeadbf merge RC_1_32_0 fixes 
[SVN r26333]
 2004-11-28 04:44:21 +00:00
John Maddock 9079cc8201 Updated installation notes. 
[SVN r26323]
 2004-11-27 11:20:37 +00:00
John Maddock e2c97fbb13 Enable auto-linking for compilers other than MSVC. 
[SVN r26147]
 2004-11-08 12:24:18 +00:00
John Maddock bc140f1948 Added fix to ensure that expressions prefixed with \` do not scan through the text unnecessarily. 
[SVN r25625]
 2004-10-08 12:45:31 +00:00
Aleksey Gurtovoy 24fec31d2c c++boost.gif -> boost.png replacement 
[SVN r25573]
 2004-10-05 15:45:52 +00:00
John Maddock ad21d2cb2f Stamped on more C++ style comments in C compatible code. 
[SVN r25472]
 2004-09-29 10:22:04 +00:00
John Maddock 50dccbe6e0 Removed mingw workaround, and added to mingw toolset instead. 
[SVN r25457]
 2004-09-28 14:56:13 +00:00
John Maddock 396136146f Cleaned up comments to make regex.h C compatible. 
[SVN r25414]
 2004-09-26 10:25:31 +00:00
John Maddock c0e6b1f5a2 mingw dll specific fixes. 
Disable one SGI test - compiler deduces template arguments strangely.


[SVN r25270]
 2004-09-20 12:31:08 +00:00
John Maddock 138d526839 Made config header C compatible. 
Added mingw dll specific fix.


[SVN r25269]
 2004-09-20 12:28:37 +00:00
John Maddock 8e60fd2cb7 Added needed include (fix for RW STL on Linux) 
[SVN r25192]
 2004-09-18 10:32:45 +00:00
John Maddock 5dfe10a136 Fix for RW STL: undef wchar symbols before use 
[SVN r25191]
 2004-09-18 10:32:05 +00:00
Douglas Gregor c2b82eae1f License update 
[SVN r24990]
 2004-09-09 13:59:01 +00:00
John Maddock b0a325cf65 Fix: re-used match_results structure didn't set size correctly. 
[SVN r24744]
 2004-08-26 10:41:49 +00:00
John Maddock 54be0eaa9d VC6-specific fixes for wide character convenience functions. 
[SVN r24600]
 2004-08-19 15:29:21 +00:00
John Maddock 276fa31266 Fix signature to operator!= 
[SVN r24499]
 2004-08-16 11:22:52 +00:00
John Maddock 2e968dea9c Minor workarounds for SGI and Darwin platforms. 
[SVN r24340]
 2004-08-08 09:48:10 +00:00
John Maddock 97d3cdad83 Makefiles updated with 1.32 version number. 
[SVN r23982]
 2004-07-23 11:35:03 +00:00
Douglas Gregor 99f8d02805 Documentation update from Jon T. Pedant 
[SVN r23847]
 2004-07-20 17:03:55 +00:00
John Maddock 7043e5585f Ooops, last fix had a misplaced "typename" in it, and therefore was not legal code, strangely some compilers just didn't care. 
[SVN r23831]
 2004-07-20 10:38:44 +00:00
John Maddock 048d5b788c Added missing copyright declarations. 
[SVN r23723]
 2004-07-18 10:21:47 +00:00
John Maddock ee631c02eb Need to make string_out_iterator a "real" iterator type to keep commeau compiler happy. 
[SVN r23722]
 2004-07-18 10:20:56 +00:00
John Maddock 4600a25228 Updated makefiles. 
[SVN r23625]
 2004-07-16 10:56:15 +00:00
John Maddock aebb44e507 Don't include integer_traits.hpp unless it's actually used: IBM C++ trips up otherwise. 
[SVN r23317]
 2004-07-02 10:40:53 +00:00
Eric Niebler 8d994b14b2 remove std_min and std_max, update minmax coding guidelines 
[SVN r23162]
 2004-06-23 04:49:48 +00:00
John Maddock d310bc9835 HP aCC patches. 
[SVN r23147]
 2004-06-22 12:42:16 +00:00
John Maddock 6c02074270 More aCC portability fixes. 
[SVN r23145]
 2004-06-22 12:34:04 +00:00
John Maddock ca44c8182c Fixed bug with grepping for literals. 
Added Sunpro workaround.


[SVN r23093]
 2004-06-12 10:10:07 +00:00
Vladimir Prus 2e10c5ec17 Update 
[SVN r23089]
 2004-06-11 11:54:08 +00:00
John Maddock ba148bae42 64-bit portability fix 
[SVN r23065]
 2004-06-09 12:12:42 +00:00
John Maddock 7c74a98ae5 64-bit portability fix 
[SVN r23063]
 2004-06-09 11:23:52 +00:00
John Maddock 9424952e8f Added workarounds for Sunpro and HP aCC 
[SVN r23032]
 2004-06-05 11:46:45 +00:00
John Maddock c3f14400b0 Moved detail/allocator.hpp into regex directory. 
[SVN r22967]
 2004-05-28 12:21:44 +00:00
John Maddock 55a6787950 Altered initialiser order to stop gcc from complaining. 
[SVN r22876]
 2004-05-20 10:16:09 +00:00
Vladimir Prus 4c0572d98f Attempt to sync V2 Jamfiles with V1 ones, again... 
[SVN r22846]
 2004-05-17 07:45:33 +00:00
John Maddock 25e51d3984 Patch for nosubs flag bug. 
[SVN r22821]
 2004-05-14 10:27:13 +00:00
John Maddock c9b37542c5 Added additional tests for new bugs 
[SVN r22813]
 2004-05-13 12:33:22 +00:00
John Maddock 6382470ac1 Fixed \l and \u so that they work correctly in case insensitive mode. 
[SVN r22804]
 2004-05-12 11:39:28 +00:00
John Maddock 1dc081e1c2 Fixed problem with wide character optimisations, changed asserts on pointers (HP-specific workaround). 
[SVN r22721]
 2004-05-03 11:24:58 +00:00
John Maddock b3e28896b7 Changed ar to $(AR) to allow for override. 
[SVN r22713]
 2004-05-01 10:33:47 +00:00
John Maddock 76176b302b Don't optimise leading repeats when there are backreferences involved. 
[SVN r22705]
 2004-04-25 10:32:09 +00:00
John Maddock a262f28327 Added introductory comment 
[SVN r22641]
 2004-04-17 10:56:46 +00:00
John Maddock e3aacc5c55 Fixes for POSIX regexes not grepping correctly. 
[SVN r22623]
 2004-04-09 15:55:32 +00:00
John Maddock dc90d07749 Added fix for grepping for POSIX style matches. 
[SVN r22621]
 2004-04-07 11:04:06 +00:00
John Maddock 300ca31723 Added missing hyperlink 
[SVN r22620]
 2004-04-07 10:49:50 +00:00
John Maddock c65dd3be41 Added link to old docs. 
[SVN r22530]
 2004-03-20 12:12:03 +00:00
John Maddock 5a29047906 Added missing preconditions, and fixed minor typos. 
[SVN r22529]
 2004-03-20 11:53:56 +00:00
John Maddock cdd130ae2d Added typedefs to index 
[SVN r22511]
 2004-03-17 12:53:57 +00:00
John Maddock 9f47972bcf Removed unneeded export specifiers 
[SVN r22506]
 2004-03-16 17:37:54 +00:00
John Maddock 0633ba70f2 Added missing typedefs 
[SVN r22505]
 2004-03-16 17:36:15 +00:00
John Maddock 8330b19cec Added tests to check new format specifiers. 
[SVN r22487]
 2004-03-12 13:13:14 +00:00
John Maddock b8eab985e5 Added support for perl style \u \U \l \L etc in formatting. 
[SVN r22486]
 2004-03-12 13:12:33 +00:00
John Maddock f90d8c667e Fixed typo 
[SVN r22438]
 2004-03-05 11:32:34 +00:00
John Maddock 4b7f14e72d Added extra non-greedy repeat tests, 
fixed concept checks for vc6 (they don't work, and won't work).


[SVN r22423]
 2004-03-02 17:00:15 +00:00
John Maddock 89515b9a8e Fixed nasty non-greedy repeat bug, 
tidied up min/max workarounds,
removed unneeded #if


[SVN r22422]
 2004-03-02 16:58:50 +00:00
Eric Niebler 3075aaba4a remove minmax hack from win32.hpp and fix all places that could be affected by the minmax macros 
[SVN r22394]
 2004-02-26 18:27:02 +00:00
John Maddock 50b8204753 Updated iterator defs. 
[SVN r22387]
 2004-02-25 12:36:45 +00:00
John Maddock 02c652c01e Added extra iterator based tests 
[SVN r22385]
 2004-02-25 12:35:08 +00:00
John Maddock b3f7d35f68 Added extra acknowledgements 
[SVN r22384]
 2004-02-25 12:34:42 +00:00
John Maddock f1312f16c4 Cleared up references to implementation specific types. 
[SVN r22190]
 2004-02-07 13:11:54 +00:00
John Maddock 9ebe515adf Fixed errors in docs: 
unsigned int changed to match_flag_type in several places,
plus occurance of std rather than boost.


[SVN r22160]
 2004-02-04 11:57:35 +00:00
John Maddock c9efbea4a7 Added more tests to catch some additional regressions. 
[SVN r21526]
 2004-01-07 12:02:58 +00:00
John Maddock 6cbda47155 Added last minute patch for .*?$ failing in the non-recursive algorithm. 
[SVN r21525]
 2004-01-07 12:00:51 +00:00
John Maddock 3e60ca3481 Added tentative fix for AIX shared lib. 
[SVN r21425]
 2003-12-30 12:09:03 +00:00
John Maddock 3026d5e6c6 Added missing std:: prefix. 
[SVN r21413]
 2003-12-29 11:38:03 +00:00
Rene Rivera f3088d1c77 Fix broken links. 
[SVN r21404]
 2003-12-27 02:37:02 +00:00
Rene Rivera f82771be8c Fix tabs in file. 
[SVN r21399]
 2003-12-26 23:26:49 +00:00
John Maddock 02f6fd45b8 Updated history. 
[SVN r21370]
 2003-12-22 12:35:09 +00:00
John Maddock 9058b985a9 Fixed mis-spelling of __MWERKS__, hopefully fixed regex_token_iterator failure on MWCW as well. 
[SVN r21363]
 2003-12-21 16:32:02 +00:00
John Maddock 65f6604b24 Only disable cpp_regex_traits<wchar_t> if we are in weird dual-wchar_t mode. 
[SVN r21359]
 2003-12-20 13:34:34 +00:00
John Maddock 16d6b87b1b Removed <native-wchar_t>on requirement (it's on by default for vc7 anyway, and vc7+stlport is better without it) 
[SVN r21354]
 2003-12-20 12:55:02 +00:00
John Maddock 82572db442 Disabled dual wchar_t mode with vc7 + STLPort, as it doesn't work. 
[SVN r21352]
 2003-12-20 12:52:27 +00:00
John Maddock 80104e292d Added needed C header includes 
[SVN r21334]
 2003-12-19 11:40:31 +00:00
John Maddock be01708af3 Added checks for bad input files 
[SVN r21321]
 2003-12-18 11:53:47 +00:00
John Maddock 39f1fb4d17 Changed name of a local variable to hopefully suppress gcc3.4 error 
[SVN r21300]
 2003-12-17 12:05:59 +00:00
John Maddock b84b17b3c4 Added BOOST_REGEX_V3 compatibilty workarounds. 
[SVN r21288]
 2003-12-16 13:06:01 +00:00
John Maddock 2c3ff62e1b Added explicit calls to fstream::close rather than relying on destructors as a tentative gcc-cygwin fix. 
[SVN r21287]
 2003-12-16 13:05:22 +00:00
John Maddock 7858e47a26 Refactored code so that __try statements only call bool (void) functions. 
[SVN r21286]
 2003-12-16 13:04:01 +00:00
John Maddock cd0072b3e7 Added patch for BOOST_REGEX_V3 compatibility 
[SVN r21285]
 2003-12-16 13:02:57 +00:00
John Maddock bf9350aa16 Added new experimental captures support. 
[SVN r21243]
 2003-12-13 12:28:48 +00:00
John Maddock 6b95ac002e Suppressed __try blocks in MWCW. 
[SVN r21221]
 2003-12-11 11:50:57 +00:00
John Maddock 7f93cee9af fixed msvc-stlport builds. 
[SVN r21168]
 2003-12-07 13:09:44 +00:00
John Maddock e79458b0e3 Added ugly workaround for linker errors from bcb5 
[SVN r21167]
 2003-12-07 12:52:18 +00:00
John Maddock 207b0c63cd Changed to use new iterator typedefs. 
[SVN r21161]
 2003-12-06 12:11:49 +00:00
John Maddock f6b9c3d809 Added como specific fix for C builds. 
[SVN r21160]
 2003-12-06 12:10:27 +00:00
John Maddock a008c722a4 Added new iterator typedefs 
[SVN r21148]
 2003-12-05 13:01:54 +00:00
John Maddock dddfc1a63a Refined building without /Zc:wchar_t on msvc 7 and above 
[SVN r21147]
 2003-12-05 13:01:29 +00:00
John Maddock a247f4d7f8 Added new typedefs for iterator types 
[SVN r21146]
 2003-12-05 13:00:59 +00:00
John Maddock 84c2228b3f Added support for BOOST_ALL_NO_LIB 
[SVN r21119]
 2003-12-03 13:32:05 +00:00
John Maddock ebc12d24c9 Patched up support for the new Borland 6.0 compiler in strict mode. 
[SVN r21035]
 2003-12-01 11:52:28 +00:00
John Maddock 1a50827c46 stripped tabs from files 
[SVN r21011]
 2003-11-30 13:06:58 +00:00
John Maddock d19f04af7b Fix broken link 
[SVN r20986]
 2003-11-28 15:17:45 +00:00
John Maddock 2e9fa8c8f8 Updated build system. 
Fixes for vc7+stlport


[SVN r20952]
 2003-11-26 11:46:19 +00:00
John Maddock c642977acd Patches for vc7+stlport 
[SVN r20951]
 2003-11-26 11:44:53 +00:00
John Maddock 27875c1e55 Fix gcc -Wshadow warnings 
[SVN r20857]
 2003-11-19 12:57:50 +00:00
John Maddock 42337410fc Added tests for Windows compiler auto-linking 
[SVN r20804]
 2003-11-13 12:46:27 +00:00
John Maddock aa132bec5d removed unneeded version calculation 
[SVN r20803]
 2003-11-13 12:44:18 +00:00
John Maddock d0258375ae Added support for BOOST_ALL_DYN_LINK 
[SVN r20802]
 2003-11-13 12:17:49 +00:00
John Maddock 7ba011232c Removed define that disables auto-linking for bjam builds since it is no longer required. 
[SVN r20774]
 2003-11-10 11:26:39 +00:00
John Maddock 6bb6cddad6 Added [common-names] tags to dll and lib builds. 
Added <native-wchar_t>on build requirement


[SVN r20765]
 2003-11-08 13:16:53 +00:00
John Maddock f9d0907868 Fixed up traits classes so that no matter whether /Zc:wchar_t is specified for vc builds or not, then we can still link to the same lib build. 
[SVN r20764]
 2003-11-08 13:02:55 +00:00
John Maddock 8324fad77c Tidies up new code, fixed one bug. 
[SVN r20635]
 2003-11-04 11:30:44 +00:00
John Maddock 23f71d7727 Changed regex_token_iterator to return a sub_match rather than a std::string (it's more efficient). 
[SVN r20613]
 2003-11-03 11:25:30 +00:00
John Maddock de9338cedf Updated regex build system and tests to match the new Boost.Install code. 
[SVN r20604]
 2003-11-02 12:13:16 +00:00
John Maddock dc3878df84 Added new macro BOOST_LIB_VERSION to version.hpp so that auto-linking code knows what version suffix to append to library file names. 
Updated auto-linking headers to match new Boost.Install code.


[SVN r20602]
 2003-11-02 11:43:56 +00:00
John Maddock aa68609a60 New warning supression code doesn't work for VC6 :-( So work around the workaround... 
[SVN r20493]
 2003-10-25 11:20:35 +00:00
John Maddock a804285fb6 Changed email address to john@johnmaddock.co.uk 
[SVN r20472]
 2003-10-24 11:13:42 +00:00
John Maddock 8b4da77f83 Undone unintended commit on this file. 
[SVN r20471]
 2003-10-24 11:00:29 +00:00
John Maddock 2606d1bdd1 Updated copyrights 
[SVN r20470]
 2003-10-24 10:51:38 +00:00
John Maddock 9215a04042 Mostly cgg warning suppression, plus some gcc 2.95 workarounds. 
[SVN r20462]
 2003-10-23 12:40:47 +00:00
John Maddock f7eb12d9c7 Updated tests to check new sub_match non-member operators. 
[SVN r20444]
 2003-10-21 11:19:42 +00:00
John Maddock 515044821c Updated docs to include recent changes, and improve general quality. 
[SVN r20443]
 2003-10-21 11:18:40 +00:00
John Maddock 72a7a13565 Added new sub_match operators. 
Made member operators const.


[SVN r20442]
 2003-10-21 11:14:13 +00:00
Rene Rivera 63778bea05 Add install definitions for new common install configuration. 
[SVN r20409]
 2003-10-19 19:52:56 +00:00
John Maddock 54e9a2fbcb Changed no-exception behaviour to call throw_exception directly so that the handler sees the actual error message. 
[SVN r20361]
 2003-10-13 11:45:11 +00:00
John Maddock ff1c0a0bb5 Moved common build options into build/Jamfile 
[SVN r20355]
 2003-10-12 11:19:15 +00:00
John Maddock c23a7a8cfe Fixed no exception handling builds 
[SVN r20330]
 2003-10-10 12:13:23 +00:00
Vladimir Prus 651256800f Add V2 Jamfile 
[SVN r20273]
 2003-10-07 10:45:15 +00:00
Vladimir Prus 696fa47670 Add V2 Jamfile 
[SVN r20272]
 2003-10-07 10:34:27 +00:00
John Maddock ab5a7a768d Added new licence info. 
[SVN r20254]
 2003-10-04 11:29:20 +00:00
John Maddock a669854a84 renamed null re_null in case the compiler #defines null. 
[SVN r20240]
 2003-10-02 11:06:06 +00:00
John Maddock 11ea8aab76 switched over to new Boost Licence 
[SVN r20232]
 2003-09-30 13:02:51 +00:00
John Maddock ee85ed89a1 Added checks on constructor and assign member function usage. 
[SVN r20230]
 2003-09-30 11:41:40 +00:00
John Maddock 13dfa17e63 Changed to make use of iterators and not strings where possible. 
[SVN r20229]
 2003-09-30 11:40:47 +00:00
John Maddock 182616ea25 Changed char_type to be the type used by the regex object not the iterator - allows code to compile where the iterator enumerates types that are different to the regex type. 
[SVN r20228]
 2003-09-30 11:39:41 +00:00
John Maddock 83306608a7 Fixed template constructor and assign member function iterator usage. 
[SVN r20227]
 2003-09-30 11:38:30 +00:00
John Maddock f3c1b8d784 Added fix for broken VC++ preprocessor 
[SVN r20226]
 2003-09-30 11:37:04 +00:00
Dave Abrahams 3b27d5a38e Use the import rule 
[SVN r19968]
 2003-09-08 17:38:49 +00:00
John Maddock 567d76e8e4 Fixed Borland compiles, so that regex can be mixed with vcl.h. 
[SVN r19880]
 2003-08-30 10:14:56 +00:00
John Maddock 51ef8177d3 Fixed Borland warning suppression. 
Changed config to use BOOST_HAS_DECLSPEC


[SVN r19781]
 2003-08-26 10:49:41 +00:00
John Maddock 2e1ed31f34 Fixed spelling of "BOOST" - basically a enormous cut and paste error! 
[SVN r19581]
 2003-08-14 10:22:05 +00:00
John Maddock ccc9c16e93 Added fixes for tests which are unsupported on some platforms. 
[SVN r19548]
 2003-08-12 12:03:25 +00:00
John Maddock 4e412a1774 Various minor warning suppressions. 
[SVN r19547]
 2003-08-12 11:24:09 +00:00
John Maddock e4248fcb19 Moved some config code into boost.config (ABI and lib selection code). 
[SVN r19546]
 2003-08-12 11:23:02 +00:00
John Maddock ae95ac6ad0 Fixed STLPort detection 
[SVN r19413]
 2003-08-03 11:44:41 +00:00
Beman Dawes feb3f7bc40 name required for wide_posix_api_check_c 
[SVN r19368]
 2003-07-30 20:43:35 +00:00
John Maddock b66ac65061 Disabled tests that are causing problems for the regression testers 
[SVN r19361]
 2003-07-30 12:16:32 +00:00
John Maddock d695b70ee9 Added check to prevent macro redeffinition 
[SVN r19360]
 2003-07-30 12:15:45 +00:00
John Maddock 222b16693c Added tentative como fix 
[SVN r19320]
 2003-07-27 10:55:35 +00:00
John Maddock 6750cf4892 Modified wide character tests to warn not fail when no wide character support is available in the platform. 
Modified Jamfiles to use centralised options.
Added wide character concept check.


[SVN r19318]
 2003-07-26 11:22:17 +00:00
John Maddock 9d565f63ed Added Como dll export options. 
[SVN r19317]
 2003-07-26 11:12:32 +00:00
John Maddock 8a5b00c128 Added needed const qualifier on out of line deffinition. 
[SVN r19306]
 2003-07-25 11:57:19 +00:00
John Maddock 11f535596b Added fix for SGI64 (std::messages::open appears to require a non-const reference on that platform :-( ) 
[SVN r19305]
 2003-07-25 11:27:17 +00:00
John Maddock bba214f904 Added out of line deffinition for integral constant. 
[SVN r19304]
 2003-07-25 11:20:39 +00:00
John Maddock 8be91f0568 Added SGI-Irix tentative fix. 
[SVN r19228]
 2003-07-20 11:17:15 +00:00
John Maddock cddfd077a8 Added tentative fix for Metrowerks problem. 
Removed Intel test code.


[SVN r19227]
 2003-07-20 11:16:26 +00:00
John Maddock 41e54c1cf2 Added temporary Intel diagnostic code 
[SVN r19211]
 2003-07-19 12:12:50 +00:00
John Maddock 0f2f6b6dfc changed MSVC calling convention setup - can't use __fastcall in debug mode especially with /RTC 
[SVN r19190]
 2003-07-18 11:25:34 +00:00
Jens Maurer ff80be2019 avoid gcc "signed/unsigned" warning 
[SVN r19128]
 2003-07-15 15:55:59 +00:00
John Maddock 8e03097d9d Added explicit bounds to the array variables to work around Mtrowerks problems. 
Added extra check before setting dllexport options.


[SVN r19095]
 2003-07-13 11:27:05 +00:00
John Maddock e12105e591 Added casts to (unsigned char) to suppress warnings from picky compilers. 
Changed array initialisation to take account of it's true size (bug fix).


[SVN r19087]
 2003-07-12 11:51:36 +00:00
John Maddock 1c915e3fda Disabled workarounds for SGI compiler - they don't work and shouldn't be needed. 
Removed local declaration of icase, when class member should do.


[SVN r19085]
 2003-07-12 10:33:10 +00:00
John Maddock cb9409160a Moved static stables into the function bodies to fix a gcc on MacOS X and IMB compiler bug. 
Fixed config system for dll builds - the default linkage option is now static linking.
Fixed makefiles - dll builds now work.
Added Misc fixes for the example programs.


[SVN r19044]
 2003-07-11 11:51:35 +00:00
John Maddock c32c644a38 Added fixes for: 
Compilers that pretend to be Visual C++
export of memory management code


[SVN r18955]
 2003-07-07 11:44:00 +00:00
John Maddock 5c0a6398ab Updated link in docs 
[SVN r18948]
 2003-07-06 10:51:00 +00:00
John Maddock 4a851cf958 Fixed C++ Builder 5 support, 
Fixed support for bidirectional iterators,
Fixed enum declaration in states.hpp.


[SVN r18874]
 2003-06-27 11:12:47 +00:00
John Maddock 6f9ba7a289 Added new concept check, 
removed assertion in degug allocator that was being triggered by std lib code !


[SVN r18873]
 2003-06-27 11:11:21 +00:00
John Maddock 4a06f15183 Added missing needed include 
[SVN r18863]
 2003-06-24 10:52:51 +00:00
John Maddock 01a3b56f8a removed some previous attempted workarounds - they don't work. 
[SVN r18855]
 2003-06-23 11:02:00 +00:00
John Maddock 3fc6433d44 Updated performance figures for GRETA. 
[SVN r18822]
 2003-06-17 10:30:08 +00:00
John Maddock 5255c45b0a Fixed bug in token_iterator that caused it to miss items when field splitting. 
[SVN r18821]
 2003-06-17 10:28:51 +00:00
John Maddock ed48905c5e Added check for invalid regular expression in matching code. 
[SVN r18777]
 2003-06-11 12:11:17 +00:00
John Maddock 13769e4fff Fixed array bounds so that gcc3 will actually compile the code, it's now seriously unmainable though, still it's the only thing that seems to work... 
[SVN r18761]
 2003-06-10 11:59:44 +00:00
John Maddock 6dfa7ef86c Added explicit bounds to arrays, as patch for broken compilers that can't otherwise cope. 
[SVN r18743]
 2003-06-09 11:56:15 +00:00
John Maddock eb91bf612a Fixed allocator type. 
[SVN r18680]
 2003-06-05 11:56:59 +00:00
John Maddock e016ef8e21 Added minor bug fixes (some expressions starting with ^ were not being found), plus a few warning suppressions. 
[SVN r18679]
 2003-06-05 10:46:03 +00:00
Beman Dawes ca984697f0 Add <no-warn> so como can compile winnt.h 
[SVN r18656]
 2003-06-03 20:07:02 +00:00
John Maddock 2f9da388c1 Added fix for IBM C++ 
[SVN r18586]
 2003-05-28 11:38:00 +00:00
John Maddock f50f35d1fc Added <ios> include for KCC 
[SVN r18536]
 2003-05-25 11:16:14 +00:00
John Maddock df4b8e696f Added patch for gcc 2.95 and get_line under cygwin 
[SVN r18535]
 2003-05-25 10:58:24 +00:00
John Maddock 3673a0a888 Added support for BOOST_DEDUCED_TYPENAME 
[SVN r18534]
 2003-05-25 10:54:03 +00:00
John Maddock a69678c3c6 stripped tabs from files 
[SVN r18526]
 2003-05-24 11:14:53 +00:00
John Maddock 8fb69853fc Fixed broken links, added copyright declarations, renamed some long file names 
[SVN r18525]
 2003-05-24 11:13:26 +00:00
Guillaume Melquiond 70199360d3 Use the recently added BOOST_INTEL macro 
[SVN r18511]
 2003-05-23 11:53:49 +00:00
John Maddock 9aa18a159d Added como warning suppression. 
[SVN r18508]
 2003-05-23 11:31:00 +00:00
John Maddock 4122e8f08d Fixed VC warning 
[SVN r18506]
 2003-05-23 10:57:04 +00:00
John Maddock 922322b644 Updated install docs. 
[SVN r18494]
 2003-05-22 11:20:26 +00:00
John Maddock 89d445c1b6 Tweaked dll selection code, 
Fixed various errors detected by MWCW and Como


[SVN r18493]
 2003-05-22 11:19:58 +00:00
John Maddock 31d1dc1182 Removed external templates for unknown compilers. 
Fixed std conformance bugs in v4 code (shown up by metrowerks compiler).


[SVN r18467]
 2003-05-20 11:28:47 +00:00
John Maddock 8bb6861595 Updated Jamfile to use simplified naming scheme on Unix platforms. 
Updated build docs.


[SVN r18466]
 2003-05-20 11:27:29 +00:00
John Maddock 11ddff601b Added new makefile 
[SVN r18444]
 2003-05-19 11:57:32 +00:00
John Maddock 088b492987 changed lib names, minor gcc3.3 warning patches 
[SVN r18443]
 2003-05-19 11:56:17 +00:00
John Maddock 535e1b05cc Updated library names, minor fixes for gcc2.95 
[SVN r18442]
 2003-05-19 11:55:23 +00:00
John Maddock 1f15026060 Merged regex-4 branch. 
[SVN r18431]
 2003-05-17 11:55:51 +00:00
John Maddock f0f32bdda1 Merged regex-4 branch. 
[SVN r18430]
 2003-05-17 11:45:48 +00:00
Dave Abrahams a81a1ea30f restore from disk crash 
[SVN r18353]
 2003-05-08 02:19:10 +00:00
Dave Abrahams 640f633395 Patched boost-base.jam to allow rules in stage target requirements 
Fixed grammar in build_system.htm
Added vc7.1-tools.jam/.html for msvc 7.1
Updated the regex lib Jamfile to build correctly-named libraries


[SVN r18319]
 2003-04-27 14:10:52 +00:00
John Maddock 0ed72c37e4 Fixed nasty typo 
[SVN r18133]
 2003-03-30 10:30:16 +00:00
John Maddock 5cf85df857 Changed name of getlocale proc to avoid HP OS clash. 
[SVN r18079]
 2003-03-25 11:43:57 +00:00
John Maddock 3819294ac1 Added check to verify that we have something to clean up before calling do_free 
[SVN r18075]
 2003-03-24 12:36:55 +00:00
John Maddock ea96eafacc Fixed bug that effect some searches 
[SVN r18003]
 2003-03-19 12:19:14 +00:00
John Maddock a31ae14cf8 added extra tests to test new fixes 
[SVN r17891]
 2003-03-13 13:45:44 +00:00
John Maddock 158c26d85c Misc. new fixes: 
Better support for BOOST_NO_WREGEX
Fixed bug in trailing null backrefs
Fixed bug in null repeat code
Fixed bug in negative forward lookahead assert when used as a prefix.


[SVN r17889]
 2003-03-13 12:50:54 +00:00
John Maddock 86e5251979 Fix for broken std::setlocale implementations (MacOS X ?) 
[SVN r17575]
 2003-02-21 12:43:49 +00:00
Dave Abrahams cebaf09b5d cleanup 
[SVN r17531]
 2003-02-19 13:56:27 +00:00
John Maddock d0ba00a2e7 Fixed bug in match_continuous code 
[SVN r17276]
 2003-02-08 12:30:57 +00:00
John Maddock 75293e9854 Fixed by adding BOOST_REGEX_NO_EXTERNAL_TEMPLATES define and extra error checks. 
[SVN r17264]
 2003-02-07 12:16:40 +00:00
Björn Karlsson 45e593c4fe Added copyright statement 
[SVN r17196]
 2003-02-04 12:24:06 +00:00
John Maddock 251099c828 OpenBSD fixes 
[SVN r16990]
 2003-01-22 12:38:54 +00:00
John Maddock 5705d52e84 Added threading build options. 
[SVN r16972]
 2003-01-21 12:21:35 +00:00
John Maddock 88a0f9d75a Added multithreaded build options. 
[SVN r16971]
 2003-01-21 12:20:20 +00:00
Beman Dawes fbb087dec9 fix misspelled dir name 
[SVN r16948]
 2003-01-19 20:21:36 +00:00
Vladimir Prus c84ebf1c5b Update V2 Jamfile for Boost. 
[SVN r16882]
 2003-01-13 10:05:01 +00:00
John Maddock 1eec12f177 Modified regression program arguments, so they work when called from some other path. 
[SVN r16877]
 2003-01-12 12:29:49 +00:00
John Maddock 82ad27c468 Modified Jamfile to use testing.jam 
[SVN r16868]
 2003-01-11 11:52:19 +00:00
John Maddock 897c33be2a Updated test lib names 
[SVN r16714]
 2002-12-28 12:51:48 +00:00
Beman Dawes 2ecd905fb2 add or update See www.boost.org comments 
[SVN r16708]
 2002-12-27 16:51:53 +00:00
John Maddock abef9c7249 removed calls to wprintf: Linux doesn't have that API. 
removed calls to assert: MWCW can't cope with it when UNICODE is defined.


[SVN r16392]
 2002-11-24 11:48:36 +00:00
John Maddock 0e37a76df0 Fix for MWCW which doesn't like incomplete array type. 
[SVN r16375]
 2002-11-23 11:30:36 +00:00
John Maddock adc4ee41e3 Fixed using declarations (some types are no longer in the library). 
[SVN r16340]
 2002-11-20 12:08:43 +00:00
John Maddock 9a4e5d29c1 tentative fix for VC7 
[SVN r16252]
 2002-11-15 11:50:41 +00:00
John Maddock ff4890b2e2 Changed detail/ to v3/ in dependency list. 
[SVN r16194]
 2002-11-11 12:15:04 +00:00
John Maddock 3a5f4775f7 changed boost/regex/detail to boost/regex/v3 
[SVN r16185]
 2002-11-10 11:37:08 +00:00
John Maddock 5a65397974 Changed boost/regex/detail to boost/regex/v3 
[SVN r16184]
 2002-11-10 11:35:53 +00:00
John Maddock e5d9c95456 Fixed header include after recent changes 
[SVN r16159]
 2002-11-08 11:55:49 +00:00
John Maddock b6a13dd215 Added check for BOOST_NO_STD_DISTANCE 
[SVN r16144]
 2002-11-07 12:59:57 +00:00
John Maddock cf285ed3e5 Changes made in preparation for new regex version. 
[SVN r16141]
 2002-11-07 12:50:29 +00:00
John Maddock 66ddab7fae Fixes for Intel C++ 
[SVN r16029]
 2002-10-31 12:13:56 +00:00
John Maddock 09bfc7f853 Merged changes from the RC_1_29_0 branch. 
[SVN r15959]
 2002-10-21 11:03:05 +00:00
Dave Abrahams 13df8a293b Add missing typename 
[SVN r15905]
 2002-10-11 20:46:12 +00:00
Vladimir Prus 40ab965ee9 Added V2 Jamfile. 
[SVN r15778]
 2002-10-07 16:45:38 +00:00
John Maddock 0fec291b28 changes to use boost test system 
[SVN r15403]
 2002-09-17 10:58:25 +00:00
John Maddock 6ee955be5f Tweeked number of states that cause a throw to occur during search. 
[SVN r15402]
 2002-09-17 10:57:26 +00:00
John Maddock eeae9a0762 Added try catch block to catch runtime errors thrown from matching algorithms 
[SVN r15374]
 2002-09-16 11:55:23 +00:00
John Maddock c7c8400efa VACPP fix 
[SVN r15373]
 2002-09-16 11:54:41 +00:00
John Maddock a7f8f56d92 Added throw if the number of searched states grows too large. 
[SVN r15372]
 2002-09-16 11:54:00 +00:00
John Maddock 66ac67533c VACPP fixes (second try) 
[SVN r15371]
 2002-09-16 11:53:07 +00:00
John Maddock d9694bbc1f Fixed regex makefiles to work nice with the new boost.test lib. 
Added tentative VACPP fix.


[SVN r15300]
 2002-09-13 11:52:11 +00:00
John Maddock f81bdae7f1 Fixed forward declarations, added tentative IBM C++ fix 
[SVN r15298]
 2002-09-13 11:41:21 +00:00
John Maddock aebf86bbe5 removed MSVC warning suppression - it causes the compiler to ICE under some conditions 
[SVN r15195]
 2002-09-07 10:47:06 +00:00
John Maddock de9ecb7407 Fixed MSVC warnings 
[SVN r15140]
 2002-09-03 10:14:30 +00:00
John Maddock fa43c7ab1d Misc Kylix fixes 
[SVN r15086]
 2002-08-25 11:57:37 +00:00
John Maddock 5f0f6fa8f1 Updated Jamfile to use new test suite. 
Updated docs to reflect recent changes.


[SVN r15081]
 2002-08-24 11:57:10 +00:00
John Maddock 81f404ec69 Disabled automatic lib selection on non-windows platforms for Borland 
[SVN r15080]
 2002-08-24 11:56:11 +00:00
John Maddock 38b55d0db8 Added missing break statements 
[SVN r15078]
 2002-08-24 11:25:01 +00:00
John Maddock bed785ad19 Added GCC warning suppression 
[SVN r15022]
 2002-08-21 11:05:30 +00:00
John Maddock bb711db956 Added new state information for forthcomming new algorithms 
[SVN r14889]
 2002-08-15 11:30:08 +00:00
John Maddock 13f9af564d Added some new state information for forthcomming new algorithms. 
[SVN r14808]
 2002-08-13 11:47:41 +00:00
Beman Dawes 43cf48f61e Boost.Test V2 fix 
[SVN r14787]
 2002-08-12 14:23:28 +00:00
John Maddock 2767f7f6ba Tentative MWCW fixes 
[SVN r14662]
 2002-08-02 11:59:22 +00:00
John Maddock 035e752ed2 Added minor doc fixes 
[SVN r14653]
 2002-07-31 11:24:41 +00:00
John Maddock 753a3d6584 Removed duplicate declaration. 
[SVN r14635]
 2002-07-29 11:04:14 +00:00
John Maddock ab0051399e Added como and metrowerks to list of compilers that can't handle the template specialisations used in instances.hpp. 
[SVN r14624]
 2002-07-27 11:42:04 +00:00
John Maddock 61ea1b566a Added workaround for gcc2.91 bug 
[SVN r14513]
 2002-07-18 11:07:46 +00:00
John Maddock 1ad6328d33 Added BOOST_NO_STD_WSTREAMBUF guard 
[SVN r14491]
 2002-07-17 11:39:15 +00:00
John Maddock e6a371c6d6 Added MSVC version check. 
[SVN r14475]
 2002-07-16 11:15:30 +00:00
John Maddock ee59983ea9 Oops, messed up previous commit. 
[SVN r14445]
 2002-07-14 10:56:58 +00:00
John Maddock ad769fcfdb Added needed Como options 
[SVN r14432]
 2002-07-13 10:58:11 +00:00
John Maddock 2468d450f2 Added -Ve and -Vx options to bcb makefiles. 
[SVN r14319]
 2002-07-07 10:28:32 +00:00
John Maddock d47f20f147 Added | to the list of characters that are not literals. 
[SVN r14139]
 2002-06-13 11:27:56 +00:00
John Maddock 0575e50ddb Changed template function overload to wchar_t overload. 
[SVN r14138]
 2002-06-13 10:30:46 +00:00
John Maddock de40dac5d1 Fixed test program after changes to regex_match code. 
[SVN r14111]
 2002-06-08 10:37:47 +00:00
John Maddock b2c4abc9cf Fixed partial match bug: 
The following program demonstrates what we believe is a bug in regex partial
match algorithm:

    int main()
    {
    //  boost::regex const re("(ab)?c"); // ok
        boost::regex const re("(ab)?"); // fails in the assert below

        boost::cmatch what;
        assert(boost::regex_match( "a", what, re, boost::match_default |
boost::match_partial ));
    }


[SVN r14110]
 2002-06-08 10:36:54 +00:00
John Maddock b856079e74 Added C++ Builder 6 binary compatibilty fixes, 
Updated gcc makefiles to build archive index.


[SVN r14088]
 2002-06-06 11:33:46 +00:00
John Maddock 293b945785 Added fixes for C++ Builder 6 alignment (binary compatibility) issues. 
[SVN r14087]
 2002-06-06 11:32:45 +00:00
John Maddock 998f94ffe9 vc7 warning suppression. 
[SVN r14064]
 2002-05-30 11:07:55 +00:00
John Maddock 53de3c4ae6 Fixed more warnings, rolled back some regex changes that seem to be causing problems on 64-bit platforms. 
[SVN r14063]
 2002-05-30 11:07:05 +00:00
John Maddock bbbd65c2e4 Hopefully fixed some minor bugs: 
added missing typesnames.
	Changed iterator to Iterator to hopefully keep aCC happy.


[SVN r14020]
 2002-05-23 11:43:27 +00:00
Dave Abrahams 129cf61f65 respect <sysinclude> 
[SVN r13995]
 2002-05-21 16:24:07 +00:00
John Maddock 992eb043af Config updates/patches 
[SVN r13973]
 2002-05-18 11:33:30 +00:00
John Maddock 084af757b4 Misc. fixes and new config options. 
[SVN r13971]
 2002-05-18 11:30:49 +00:00
John Maddock 1035f25b65 Disabled template specialisations on AIX with IBM Visual Age 
[SVN r13850]
 2002-05-14 10:44:21 +00:00
John Maddock eacf31772b Fixed Mingw32 build 
[SVN r13804]
 2002-05-10 11:37:32 +00:00
John Maddock 8d8a209d8b Added user-config macro BOOST_DISABLE_WIN32 
(also set in the compiler 's strict mode).
Modified Boost source not to use Win32 specific
extentions in the presence of BOOST_DISABLE_WIN32.


[SVN r13771]
 2002-05-09 11:40:52 +00:00
John Maddock 6b75e3962d Fixed test programs (disabled separate file template instantiation for single file builds). 
[SVN r13661]
 2002-05-04 11:00:48 +00:00
John Maddock 1826080071 Fixed erroneous functio signature 
[SVN r13660]
 2002-05-04 10:55:51 +00:00
John Maddock 2ee6dec715 Fixed broken links. 
[SVN r13574]
 2002-04-27 11:05:49 +00:00
John Maddock 298651b2f6 Turned off external templates for MWCW 
[SVN r13573]
 2002-04-27 10:45:12 +00:00
John Maddock 752c43f9d4 Bug fix: changed int to std::ptrdiff_t 
[SVN r13572]
 2002-04-27 10:38:47 +00:00
John Maddock 976fb02a1b Moved some key template instances into the lib and out of user code. 
Updated makefiles:
	renamed lib files with new more systematic naming convention.
	Added bcb6 support.
	Rewritten automatic lib selection.
Updated copyright declarations.


[SVN r13557]
 2002-04-24 10:50:23 +00:00
Jens Maurer d67a843d5a add newline at end of file 
[SVN r13553]
 2002-04-23 19:51:36 +00:00
John Maddock 3e3752e992 Added BOOST_NO_WREGEX guard. 
[SVN r13357]
 2002-04-03 11:04:46 +00:00
John Maddock 7c42b3aca6 Moved is_combining inside BOOST_NO_WREGEX guard. 
[SVN r13356]
 2002-04-03 11:03:13 +00:00
John Maddock bb89bbb29a Added regex_fwd.hpp support. 
[SVN r13334]
 2002-04-01 11:47:30 +00:00
John Maddock 2035a49533 Added support for regex_fwd.hpp 
[SVN r13333]
 2002-04-01 11:46:04 +00:00
John Maddock 6e82619133 Added needed #ifdef 
[SVN r13295]
 2002-03-28 12:47:47 +00:00
John Maddock 1d560fae85 Minor doc typo fixes. 
Fixed IA64 portability warnings from VC7


[SVN r13225]
 2002-03-19 11:31:52 +00:00
John Maddock b4cf815f7d Fixed IA64 compatibility warnings from VC7, mainly changed unsigned int's to size_t and int's to ptrdiff_t. 
[SVN r13223]
 2002-03-19 11:29:50 +00:00
John Maddock 1d3653812a Fixed broken link. 
[SVN r12993]
 2002-03-01 12:26:01 +00:00
John Maddock 9ef4719dff Modified jamfiles to work with new updated build system 
[SVN r12952]
 2002-02-27 12:37:28 +00:00
John Maddock e18c474222 Updated regression tests with more non-marking parenthesis examples 
[SVN r12912]
 2002-02-23 12:58:45 +00:00
John Maddock 7f6be58d92 Fixed Borland C++ config workarounds - so that _RWSTD_COMPILE_INSTANTIATE gets defined before any std lib includes 
[SVN r12871]
 2002-02-21 11:31:48 +00:00
John Maddock 11accf4a8b Added more error checking for no-eh builds. 
[SVN r12870]
 2002-02-21 11:30:41 +00:00
John Maddock b55cce9a42 Fixed behaviour on Embedded VC++ 
[SVN r12868]
 2002-02-20 11:20:17 +00:00
John Maddock 6f9658fa6c Fixed VCL setup to come before lib selection 
[SVN r12847]
 2002-02-17 12:05:59 +00:00
John Maddock 936e0cfd99 Added note about Koenig Lookup required for examples to compile 
[SVN r12802]
 2002-02-14 12:56:37 +00:00
Rene Rivera 290270440e Updated the basic Jamfiles for the new Boost.Build changes. 
[SVN r12798]
 2002-02-14 04:08:20 +00:00
John Maddock 76c85c7c34 Fixed regex example expression typo. 
[SVN r12792]
 2002-02-13 12:30:22 +00:00
Douglas Gregor 44d33b20d5 Can't declare a variable in a for-loop with the same name as a variable declared in the for loop initialization 
[SVN r12775]
 2002-02-09 16:37:56 +00:00
Douglas Gregor 98377b57aa Strange workaround for Comeau 4.2.45.2 so that it does get into an 
instantiation loop


[SVN r12773]
 2002-02-09 15:49:04 +00:00
John Maddock 43df21bca1 Fixed incorrect iterator use - assumed random access iterator in one place rather than bidirectional. 
[SVN r12768]
 2002-02-09 12:07:53 +00:00
John Maddock c8e9df8fa2 Added support for compilers with no exception handling support. 
[SVN r12758]
 2002-02-08 12:44:43 +00:00
John Maddock a5d1526fbb Added docs for forward lookahead asserts. 
[SVN r12757]
 2002-02-08 12:43:59 +00:00
Douglas Gregor f79497c625 Handle standard libraries that do not support std::iterator 
[SVN r12686]
 2002-02-04 12:54:17 +00:00
Douglas Gregor a108657449 Make string_out_iterator a full-fledged output iterator 
[SVN r12671]
 2002-02-03 17:30:13 +00:00
John Maddock 9225fa8531 Removed unnecessary template parameter from ostream_iterator so that it works with gcc2.9x now. 
[SVN r12666]
 2002-02-03 11:44:37 +00:00
John Maddock 07c20c1926 Modified code that determines how long to loop for, with upper limit of 1s. 
[SVN r12665]
 2002-02-03 11:43:23 +00:00
Darin Adler d227059666 New smart pointer documentation. Related clean-up of the smart pointer 
library. Changing includes to include the new individual smart pointer
headers. Replacing old smart pointer library with an include of the new
smart pointer headers. Simplify ifdefs that involve the member templates
macros now that BOOST_MSVC6_MEMBER_TEMPLATES is also guaranteed to bet
set for platforms that have full member templates.


[SVN r12647]
 2002-02-02 18:36:12 +00:00
John Maddock f5082341c0 changed all pointer casts to explicit static_cast or reinterpret_cast. 
Added more tests for forward lookahead asserts.


[SVN r12575]
 2002-01-30 12:17:51 +00:00
John Maddock 5613d77433 Changed all pointer casts to either static_cast or reinterpret_cast as appropriate. 
[SVN r12574]
 2002-01-30 12:16:28 +00:00
Douglas Gregor 6463dcfb07 regex_timer.cpp: 
- Head off some infinite looping on some platforms


[SVN r12550]
 2002-01-29 13:38:30 +00:00
John Maddock c07c4e0a11 Added support for forward lookahead asserts. 
[SVN r12455]
 2002-01-23 12:42:31 +00:00
John Maddock e993619390 Stripped tabs from source 
[SVN r12351]
 2002-01-19 12:38:14 +00:00
John Maddock e22aaa9d20 Fixed copy self assignment bug 
[SVN r12248]
 2002-01-08 13:00:08 +00:00
John Maddock 52dbd281ca Added checks to message loading code. 
Added extra members to RegEx class.
Updated docs accordingly.


[SVN r12244]
 2002-01-07 13:03:50 +00:00
John Maddock e4138b5bdc Added members RegEx::Match and RegEx::npos. 
[SVN r12243]
 2002-01-07 13:02:37 +00:00
John Maddock 534f6273c0 No longer throws on copy-construct 
asserts when applying fixups (invariant checks) added


[SVN r12242]
 2002-01-07 13:01:31 +00:00
John Maddock b2dd7877da Updated regex examples and Jamfiles so that they are run as tests. 
[SVN r12149]
 2001-12-26 11:21:24 +00:00
John Maddock 0cda8c8a2e Initial checkin 
[SVN r12122]
 2001-12-19 11:57:20 +00:00
John Maddock 04282b5d0a Updated version numbers in docs. 
[SVN r12081]
 2001-12-17 12:44:26 +00:00
John Maddock 554832217c Updated regex examples and Jamfiles so that most now run as tests. 
[SVN r12067]
 2001-12-16 11:33:27 +00:00
John Maddock 63130c1ef5 Updated Jamfiles and tests so that they actually work now! 
[SVN r11985]
 2001-12-09 12:50:46 +00:00
John Maddock edbc68df6c Updated to reflect changes in STLport-4.5 
[SVN r11970]
 2001-12-07 12:14:56 +00:00
John Maddock 372a07902e Made string_compare functions inline (they should have been all along). 
[SVN r11952]
 2001-12-06 12:39:31 +00:00
John Maddock 4ae95dae74 removed unneeded #if block 
[SVN r11906]
 2001-12-04 12:23:28 +00:00
Dave Abrahams 277ca851c8 Metrowerks needs BOOST_NO_STD_LOCALE in config to be able to compile regex 
regex test Jamfile updates so that some tests will actually run
warning suppression for condition.cpp

unit-test rule now accepts input files
updated metrowerks and borland to properly set up path for running tests

----------------------------------------------------------------------
Modified Files:
	boost/config/compiler/metrowerks.hpp
	libs/python/src/gen_function.py libs/regex/test/Jamfile
 Tag: thread-initial
	libs/thread/src/condition.cpp
 No tag
	tools/build/boost-base.jam tools/build/borland-tools.jam
	tools/build/metrowerks-tools.jam
----------------------------------------------------------------------


[SVN r11853]
 2001-12-02 17:43:45 +00:00
John Maddock f0d62fb2c0 Updated changes log 
[SVN r11830]
 2001-11-30 12:00:31 +00:00
John Maddock 7104418bd5 * Changed BOOST_RE_THREADS to BOOST_HAS_THREADS, 
* Updated allocator code to use SGI node based allocator when available.


[SVN r11829]
 2001-11-30 11:58:04 +00:00
John Maddock 0bd54d3821 Added optional code to time how long the test takes. 
[SVN r11828]
 2001-11-30 11:56:35 +00:00
John Maddock c167b1f183 changed BOOST_RE_THREADS to BOOST_HAS_THREADS 
[SVN r11827]
 2001-11-30 11:56:02 +00:00
John Maddock 52920ff98f Added \ as a non-literal character (oversight). 
[SVN r11717]
 2001-11-16 12:25:17 +00:00
John Maddock 72c3b4ed13 Fix for broken split (doesn't spit out all sub expressions). 
[SVN r11716]
 2001-11-16 12:24:40 +00:00
John Maddock 6cc5cf41d5 Trivial fix for signed/unsigned comparison 
[SVN r11715]
 2001-11-16 12:24:01 +00:00
John Maddock a7984bb149 Updated Jamfiles with forced dynamic linking removed. 
[SVN r11647]
 2001-11-10 12:12:38 +00:00
Dave Abrahams 876ff39307 remove redundant <runtime-link>dynamic from default-BUILD section 
[SVN r11644]
 2001-11-09 15:30:45 +00:00
John Maddock 79f80ad09d Updated list of helpers 
[SVN r11449]
 2001-10-26 11:58:59 +00:00
John Maddock 19d8e96cf5 Added workaround for Rogue Wave lib bug. 
[SVN r11391]
 2001-10-16 11:36:47 +00:00
John Maddock e047b2b509 Updated examples with better comment on expressions. Updated test program to test for apparent Rogur Wave bug (and it's workaround). 
[SVN r11390]
 2001-10-16 11:36:00 +00:00
John Maddock 28968bd2b6 renamed "free" member functions to avoid conflicts with system macros. 
[SVN r11384]
 2001-10-13 10:26:34 +00:00
John Maddock c4b295684b Added docs for smatch and wsmatch typedefs, added warnings about using temporaries with regex_search/regex_match. 
[SVN r11383]
 2001-10-13 10:24:55 +00:00
John Maddock 33b6eb0637 Renamed member functions "free" to prevent conflict with system macro. 
[SVN r11380]
 2001-10-13 10:19:01 +00:00
Darin Adler de9ad8df74 Fix spelling error: "occurances" -> "occurrences". 
[SVN r11376]
 2001-10-11 17:26:04 +00:00
John Maddock a042a0b6de Removed spurious MSVC pragma 
[SVN r11369]
 2001-10-09 11:25:43 +00:00
John Maddock f16f300347 Fixed inclusion of windows.h 
[SVN r11356]
 2001-10-08 11:32:22 +00:00
Dave Abrahams a543dce5e3 regex, threads, and python will all build from the top level. If you build the 'test' target from the top level, it will run all regressions. 
Jamfile:
  subincludes for thread, python libs, and status for regression tests

Jamrules:
  Use the new path-global rule to establish BOOST_ROOT correctly for all subprojects

libs/regex/build/Jamfile
  Take advantage of correct BOOST_ROOT setting

libs/python/build/Jamfile
  Search for python executable; don't try to build anything if it can't be found.
  don't build tests by default
  improved comments, organization, and naming.

status/Jamfile
  Fixed references to config test files
  Failed tests now leave their stdout results in <testname>.error instead of removing it
  No test targets are dependencies of 'all' anymore
  Added comments
  Reorganized

tools/build/Jambase
  Meant to check this in long ago.

tools/build/allyourbase.jam
  Fixed SHELL_EXPORT setting, added SHELL_SET
  removed 'test' from the dependencies of 'all'; tests no longer run by default.
  Fixed the direction of slashes for Windows when ALL_LOCATE_TARGET is used.
  Added path-global rule for declaring path variables which may be relative
  rule in-invocation-subdir returns true if the current subproject is the one
     from which Jam was invoked
  rule protect-subdir is now used to protect subproject variables
  rule tokens-to-simple-path converts path tokens to a simplified path.

tools/build/boost-base.jam
  Fixed bugs

tools/build/jam_src/makedebugjam.bat
  Fixed a bug which prevented a final debug build

tools/build/jam_src/search.c
  Fixed a bug of mine which caused LOCATE to be ignored (!).


[SVN r11348]
 2001-10-06 18:19:15 +00:00
John Maddock fe45d5bf4a Tweeked regex version number to reference <boost/version.hpp> 
[SVN r11309]
 2001-09-30 10:30:14 +00:00
John Maddock 4dd87c299f Fixed iterator definition 
[SVN r11299]
 2001-09-28 11:33:25 +00:00
John Maddock 3d3f591516 Fixed partial ordering macro names 
[SVN r11298]
 2001-09-28 11:08:33 +00:00
John Maddock 5b5d4c3145 Fixed typo - \f is \x0C not \x08 
[SVN r11297]
 2001-09-28 11:07:41 +00:00
John Maddock 1c45c7a48d updated makefiles to generate error if MSVCDIR not set 
[SVN r11296]
 2001-09-28 11:06:57 +00:00
John Maddock 4922ae784f Fixed messed up c_regex_traits from previous commit, fixed Koenig lookup bug caused by presence of boost::re_detail::destroy 
[SVN r11249]
 2001-09-25 11:48:21 +00:00
Darin Adler 007c0da3b2 Add a workaround for platforms where <ctype.h> has macros only. 
[SVN r11235]
 2001-09-24 19:34:15 +00:00
John Maddock 3fb0375da4 Another attempt to fix the WinXP character class problems 
[SVN r11216]
 2001-09-23 12:02:28 +00:00
Jens Maurer 0cef054b31 change missed occasion of BOOST_RE_NO_SWPRINTF -> BOOST_NO_SWPRINTF 
[SVN r11205]
 2001-09-22 15:24:10 +00:00
Jens Maurer 7218f9847a fix typo: omission of parameter names 
[SVN r11203]
 2001-09-22 14:53:00 +00:00
John Maddock 2bc1f9c998 More fixes resulting from the new config 
[SVN r11182]
 2001-09-21 11:35:54 +00:00
John Maddock 9edaddab6f Updated docs to match new config 
[SVN r11181]
 2001-09-21 10:35:16 +00:00
John Maddock 1647dd908e Added missing typename qualifier 
[SVN r11165]
 2001-09-20 11:45:48 +00:00
John Maddock 187208adf5 First round of config fixes 
[SVN r11146]
 2001-09-19 11:48:51 +00:00
Jens Maurer 30e9920147 remove stray \r 
[SVN r11143]
 2001-09-18 21:53:41 +00:00
John Maddock 1d473147fd commit of split-config, including any changes required to existing libraries (mainly regex). 
[SVN r11138]
 2001-09-18 11:13:39 +00:00
John Maddock 1be8e9241b Previous update broke non-win32 support, now fixed. 
[SVN r11094]
 2001-09-11 11:06:44 +00:00
John Maddock e60414a5e7 Added regression tests 
[SVN r11072]
 2001-09-08 12:04:25 +00:00
John Maddock 7bd8e2a14d Fixed to work with _UNICODE on Win32 
[SVN r11071]
 2001-09-08 12:03:55 +00:00
John Maddock b2396011f9 Fixed path to work from root directory 
[SVN r11070]
 2001-09-08 12:02:47 +00:00
John Maddock b9628e449d Fixed do that code compiles on Win32 with _UNICODE defined 
[SVN r11069]
 2001-09-08 12:01:30 +00:00
John Maddock 139a2f60fb Updated build system (more or less works now) 
[SVN r10890]
 2001-08-18 11:50:48 +00:00
John Maddock a4912a834e Fixed initialisation order warnings (gcc) 
[SVN r10887]
 2001-08-18 10:22:53 +00:00
John Maddock 014b66b2f4 Removed non-functioning msvc link command from Jamfile, added user32.lib forced link to w32_regex_traits.cpp 
[SVN r10886]
 2001-08-18 10:22:10 +00:00
John Maddock b2ea26705d Added (as yet non-functional msvc library support) 
[SVN r10876]
 2001-08-16 11:43:22 +00:00
John Maddock 432f59cde7 Updated Jamfile (it works now!) 
[SVN r10850]
 2001-08-13 11:34:37 +00:00
John Maddock 846da064e0 Added Jamfile 
[SVN r10843]
 2001-08-12 11:55:51 +00:00
John Maddock 88a6779e8b Fixed WinXP problems 
[SVN r10842]
 2001-08-11 11:50:34 +00:00
John Maddock 5749937f26 Fixed some WinXP problems 
[SVN r10841]
 2001-08-11 11:49:19 +00:00
John Maddock e1492c79ce updated jamfile, fixed Windows XP problems 
[SVN r10840]
 2001-08-11 11:47:12 +00:00
Darin Adler a06c964cab Spell things consistently. Add some bits of Mac stuff to the tests. 
Use std::size_t where needed.


[SVN r10800]
 2001-08-07 17:22:02 +00:00
John Maddock 77f76889f8 Minor purify error fixes 
[SVN r10713]
 2001-07-28 11:23:09 +00:00
John Maddock 50c4d1e6ca Fixed some purify errors (unitialised reads) 
[SVN r10712]
 2001-07-28 11:22:28 +00:00
John Maddock 7079ba0424 tweeked docs - added credits + iterator categories. 
[SVN r10701]
 2001-07-25 10:20:47 +00:00
John Maddock e7b8b5712d Fixed nasty bug, where some invalid expressions caused access violations. 
[SVN r10688]
 2001-07-22 10:26:54 +00:00
Dave Abrahams f5f309be54 Initial checkin. Needs tweaks for various compilers. 
[SVN r10683]
 2001-07-21 13:06:09 +00:00
John Maddock 890dc95e0d fixed relative link 
[SVN r10610]
 2001-07-14 10:54:55 +00:00
Beman Dawes 517d3e9256 Change absolute URL's to relative 
[SVN r10594]
 2001-07-12 15:31:15 +00:00
Darin Adler 9bbca4613c Fix bad patch I sent to John that makes Metrowerks compiles fail. 
[SVN r10521]
 2001-07-03 21:43:51 +00:00
John Maddock 01575dccbd Added some missing std:: prefixes and fixed Metroworks 7 support 
[SVN r10464]
 2001-06-28 11:45:22 +00:00
John Maddock 3045723a54 Added std:: prefix to some size_t's 
[SVN r10463]
 2001-06-28 11:44:36 +00:00
John Maddock 2fd9ef66cc Fixed non-standard usage of mbtowcs (added std:: prefix). 
[SVN r10421]
 2001-06-25 11:29:47 +00:00
John Maddock 56447e1443 Added LC_MESSAGES workaround 
[SVN r10420]
 2001-06-25 11:29:00 +00:00
John Maddock d36070e4cd Added dec alpha fix for missing LC_MESSAGES category 
[SVN r10418]
 2001-06-25 11:26:20 +00:00
John Maddock 4f1b0d09b3 Fixed minor typos 
[SVN r10312]
 2001-06-12 11:26:48 +00:00
John Maddock 1acfee5702 Updated for intel compiler support 
[SVN r10304]
 2001-06-10 11:06:12 +00:00
John Maddock 330d46f306 regex point release (minor compatiblity fixes) 
[SVN r10245]
 2001-05-30 11:36:49 +00:00
John Maddock 60659c5d84 Added BeOS threading support, tweeked STLPort detection. 
[SVN r10235]
 2001-05-28 11:48:06 +00:00
John Maddock 1444ac208f minor cygwin config fix 
[SVN r10234]
 2001-05-27 11:08:48 +00:00
John Maddock c0a8361373 Fixed purify warings about access to unitialised memory 
[SVN r10232]
 2001-05-26 11:58:19 +00:00
John Maddock 0ef48255a7 Fixed problems that occur when regex has invalid or unititalised expression. 
[SVN r10231]
 2001-05-26 11:57:25 +00:00
John Maddock bfb3ccc907 regex: fixed iterator definition so that it passes the SGI/boost concept checks. 
[SVN r10214]
 2001-05-24 10:35:34 +00:00
John Maddock 04b11fdd1c Added support for "format_first_only" new format flag 
[SVN r10119]
 2001-05-17 11:55:55 +00:00
John Maddock f466b2ad2a Minor regex config changes, fixed KMP search code. 
[SVN r10115]
 2001-05-15 12:00:33 +00:00
John Maddock f913683002 Fixed some issues with calling conventions for Borland/Microsoft compilers 
[SVN r10114]
 2001-05-15 11:00:01 +00:00
John Maddock a58bf0705d Added missing BOOST_RE_CALL declarators to c_regex_traits 
tweeked BOOST_RE_CALL definition


[SVN r10100]
 2001-05-12 10:41:19 +00:00
John Maddock f6fd177e2a Added missing BOOST_RE_CALL modifier 
[SVN r10091]
 2001-05-11 11:30:32 +00:00
John Maddock 9f051ee667 Added some missing BOOST_RE_CALL macros 
[SVN r10090]
 2001-05-11 11:28:11 +00:00
John Maddock 08cee9a2a6 Fixes for STLPort 4.1b6, 
and for gcc on platforms with <sys/type.h>


[SVN r10089]
 2001-05-11 10:50:06 +00:00
John Maddock efd0ce56bc reorganised regex config setup 
[SVN r10064]
 2001-05-08 11:24:35 +00:00
John Maddock fb81ff65fc Updated Faq and acknowledgements 
[SVN r10006]
 2001-05-03 10:53:58 +00:00
John Maddock 774c7ec4d5 Fixed RegEx::Length, Fixed Borland config 
[SVN r9991]
 2001-04-28 12:03:05 +00:00
John Maddock 19dab6c60a tweeked borland makefiles for case sensitive linking, changed memcpy to memmove in partial grep example 
[SVN r9990]
 2001-04-28 10:12:52 +00:00
John Maddock a719c77f63 Fixes resulting from changed directory structure 
[SVN r9987]
 2001-04-27 11:06:28 +00:00
John Maddock 33a84ba374 Updated docs on match_results::size() 
[SVN r9838]
 2001-04-19 11:27:23 +00:00
John Maddock 8d9bce7c33 Fixed Codeguard warnings 
[SVN r9837]
 2001-04-19 10:54:01 +00:00
John Maddock a92faf9d3d regex point release 
[SVN r9834]
 2001-04-18 11:35:32 +00:00
John Maddock ab16e6c6c0 updated regex directory structure 
[SVN r9765]
 2001-04-12 11:14:59 +00:00
John Maddock ed21a5183b reworked regex directory structure to match boost requirements. 
[SVN r9752]
 2001-04-10 11:44:47 +00:00
John Maddock dcb64d5db7 Fixed VC6.sp5 support, added support for mixed static/dynamic linking with VC6 
[SVN r9744]
 2001-04-09 11:19:12 +00:00
John Maddock 42ba37691e Updated makefiles, added sunpro makefile support 
[SVN r9743]
 2001-04-09 11:17:40 +00:00
John Maddock 020cbe902e regex: Fixed spurious matches when grepping with .* 
[SVN r9686]
 2001-03-31 11:24:27 +00:00
John Maddock fac0fa6653 Minor config tweek for gcc libstdc++3 
[SVN r9643]
 2001-03-27 10:51:14 +00:00
John Maddock b8adb4df00 regex updates: compatability fixes for Como and sunpro compilers 
[SVN r9642]
 2001-03-26 11:09:49 +00:00
John Maddock 1758679bd6 regex: minor changes to make the test code more conservative in C++ usage 
[SVN r9563]
 2001-03-16 12:41:36 +00:00
John Maddock 98fd29d60c updating regex configure (should have been in previous fix) 
[SVN r9556]
 2001-03-14 12:54:48 +00:00
John Maddock 26ccffe3d0 Misc regex fixes: removed BOOST_RE_NO_EXCEPTION_H macro (no longer needed), added hack for VC6+STLPort regression test (missing wstring exports in STLPort dll). 
[SVN r9555]
 2001-03-14 12:52:06 +00:00
John Maddock f5368b7666 Fixed header include: should have included <boost/type_traits/cv_traits.hpp> 
[SVN r9537]
 2001-03-10 11:24:11 +00:00
John Maddock c126ed4b87 regex: tweeked type_traits usage to reduce header dependencies 
[SVN r9519]
 2001-03-09 11:51:44 +00:00
John Maddock 9e6a7d8e5f More regex makefile updates (changed name to libboost_regex) 
[SVN r9486]
 2001-03-08 12:29:07 +00:00
John Maddock 15142ddf9d Misc fixes that missed the last commit.. 
[SVN r9402]
 2001-03-04 11:08:29 +00:00
John Maddock 831160baa2 makefile adjustments 
[SVN r9396]
 2001-03-03 11:37:50 +00:00
John Maddock db6b4db44d updated makefile responds to environment 
[SVN r9395]
 2001-03-03 11:35:37 +00:00
John Maddock f414a067b8 regex doc updates for partial matches and revised makefiles 
[SVN r9394]
 2001-03-03 11:32:04 +00:00
John Maddock 833740c25b regex makefile updates: better responce to environment variables, and correct linker options for gcc-shared.mak 
[SVN r9393]
 2001-03-03 11:31:04 +00:00
John Maddock ee8c9873bc Updates for better partial match support, and to ensure that that the POSIX API functions are able to return the correct error code. 
[SVN r9392]
 2001-03-03 11:28:50 +00:00
John Maddock efdf9e57a4 More type_traits tweeks. 
[SVN r9287]
 2001-02-20 12:17:55 +00:00
Jeremy Siek 2609a56230 fixed some typo's 
[SVN r9284]
 2001-02-20 02:28:15 +00:00
John Maddock 24dd51c869 Added RegExData constructor to keep ICL compiler happy 
[SVN r9272]
 2001-02-19 12:57:35 +00:00
John Maddock 8872307cb1 regex Intel C++ fix... 
[SVN r9251]
 2001-02-18 12:03:08 +00:00
John Maddock 50610bf111 regex: added explicit #error clause to reduce error messages when wide character support is not available. 
[SVN r9227]
 2001-02-16 12:47:30 +00:00
John Maddock 25d57dbe3e Fixed minor typedef typo 
[SVN r9226]
 2001-02-16 12:03:48 +00:00
John Maddock d754f23bcf regex configuration tweeks, and point release. 
[SVN r9225]
 2001-02-16 11:26:21 +00:00
John Maddock 973b12c5c8 regex: tentatively fixed regression on Win2000, suppressed some more warnings, and tweeked Rogue Wave library detection and configuration. 
[SVN r9157]
 2001-02-12 12:45:25 +00:00
John Maddock ff022f31cf Tweeked config options for Kai and Irix+STLPort 
[SVN r9000]
 2001-02-07 11:56:13 +00:00
John Maddock bc4755e14f regex: fix for previous slip up when fixing warning messages 
[SVN r8972]
 2001-02-06 12:52:32 +00:00
John Maddock 9f9f46f34b regex: some fixes for level 4 warnings under VC6 
[SVN r8942]
 2001-02-05 12:48:09 +00:00
John Maddock dd2dbfacbb regex: tentative fixes for Irix + STLPort configuration. 
[SVN r8940]
 2001-02-05 12:09:10 +00:00
Jens Maurer 2f8875124b comparing the result of is.get() with EOF is non-portable (fails on IRIX) 
[SVN r8924]
 2001-02-04 18:39:39 +00:00
John Maddock 603337af8f regex: added VC6 debugging/memory tracking support to regression test program 
[SVN r8913]
 2001-02-04 12:16:07 +00:00
John Maddock 47f5cc6fa1 Fixed range error 
[SVN r8827]
 2001-01-31 12:00:34 +00:00
John Maddock 31c5b449bb 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.


[SVN r8826]
 2001-01-31 11:39:04 +00:00
John Maddock 1afe49fdbf regex: Fixes for Como compiler in strict mode, plus some signed/unsigned conversions 
[SVN r8780]
 2001-01-27 11:34:53 +00:00
John Maddock b5dcded581 regex: updated change log 
[SVN r8752]
 2001-01-24 12:16:52 +00:00
John Maddock 36c217882a regex: fixed makefiles to clean *.pch files. 
[SVN r8728]
 2001-01-23 12:28:36 +00:00
Jens Maurer 49d23c0323 avoid gcc mis-interpreting direct-initialization as a function declaration 
[SVN r8684]
 2001-01-21 20:10:36 +00:00
John Maddock ec8aac99c5 regex: regression test fixes 
[SVN r8679]
 2001-01-21 12:58:24 +00:00
John Maddock 328e0b5561 regex: fixes for Como in strict mode 
[SVN r8655]
 2001-01-20 12:57:47 +00:00
John Maddock e927090ba0 regex: Irix fixes and point release 
[SVN r8653]
 2001-01-20 12:23:51 +00:00
John Maddock 1d0dabd892 regex: minor fixes 
[SVN r8638]
 2001-01-18 12:13:00 +00:00
John Maddock 2c52692f8d regex file names fixed to bring them under 32 characters (for Mac compatibility) 
[SVN r8536]
 2001-01-09 12:42:39 +00:00
Dave Abrahams 0b582e974f Kill some warnings about converting negative numbers to unsigned types 
[SVN r8486]
 2000-12-21 17:17:45 +00:00
John Maddock 72caa3f9ca regex: tweeks for linux. + Beos: compiler status 
[SVN r8445]
 2000-12-10 11:52:26 +00:00
John Maddock 6281799115 regex configure tweeks. 
[SVN r8409]
 2000-12-09 11:44:27 +00:00
John Maddock 6221e7f953 regex: minor VC6 optimisation changes. 
[SVN r8380]
 2000-12-03 12:16:18 +00:00
John Maddock 2b0fc3c3a8 regex: updated snip4.cpp (fixed patholgical expressions). 
[SVN r8366]
 2000-11-30 12:05:15 +00:00
John Maddock 91953b9cf2 regex: added some missing std:: prefixes, updated Be compiler status page. 
[SVN r8354]
 2000-11-29 12:48:20 +00:00
John Maddock 2c085b3dc4 Fixed regex memory leak, and type_traits bad test case 
[SVN r8273]
 2000-11-21 12:39:09 +00:00
John Maddock 19ac3b9eba Regex: added gcc-shared.mak for shared library builds with gcc. 
[SVN r8271]
 2000-11-21 11:12:55 +00:00
John Maddock c0399a3a57 Minor regex fixes for VC6 (Added some boost:: qualifies to work around lack or Koenig lookup). 
[SVN r8238]
 2000-11-17 11:35:02 +00:00
John Maddock 36e4289aaa Regex point release 3.02 
[SVN r8226]
 2000-11-16 11:29:03 +00:00
John Maddock 680e5b9e13 regex: retry due to broken connection 
[SVN r8171]
 2000-11-11 12:10:38 +00:00
John Maddock 31c9a1f9c6 regex: fixes for STLPort in debug mode. 
[SVN r8170]
 2000-11-11 12:08:55 +00:00
John Maddock 8700307cf5 regex fixes for updated Dinkum library 
[SVN r8161]
 2000-11-09 13:03:41 +00:00
John Maddock 4378b06e43 Updated regex code with tentative support for partial matches 
[SVN r8160]
 2000-11-09 11:24:58 +00:00
John Maddock dc38a40569 Misc. minor regex fixes 
[SVN r8134]
 2000-11-04 12:38:38 +00:00
John Maddock fcdbbcff08 BeOS5 (intel) fixes 
[SVN r8133]
 2000-11-04 11:16:12 +00:00
John Maddock 209636b869 compiler specific fixes (mostly MWCW) 
[SVN r8032]
 2000-10-24 11:53:07 +00:00
Dave Abrahams 13df83ab96 A partial Pro6 fix (Pro6 is missing the message facet - what do we do about /that/?) 
[SVN r8031]
 2000-10-21 13:14:45 +00:00
John Maddock 74ca42eb88 regex regression test fixes 
[SVN r8030]
 2000-10-21 11:18:50 +00:00
John Maddock 5efb356b84 more regex regression tests 
[SVN r7997]
 2000-10-18 10:56:28 +00:00
John Maddock bd184b7ade regex regression test update 
[SVN r7996]
 2000-10-18 10:43:07 +00:00
John Maddock f59c88d0bb regex fixes: retry due to lost connection 
[SVN r7968]
 2000-10-17 11:29:59 +00:00
John Maddock df6fa4ba79 regex fixes 
[SVN r7967]
 2000-10-17 11:28:05 +00:00
Jens Maurer 9148159b98 add empty throw specification to destructors for classes derived from 
std::exception


[SVN r7940]
 2000-10-14 22:56:18 +00:00
John Maddock fe33e5ebb9 misc minor fixes 
[SVN r7938]
 2000-10-14 12:03:10 +00:00
John Maddock 65b6a3ba3e fixes resulting from non-standard usage of swprintf 
[SVN r7927]
 2000-10-12 11:25:16 +00:00
John Maddock 224cb764cf minor typo fixes 
[SVN r7922]
 2000-10-10 10:40:58 +00:00
John Maddock 8685c139ee more VC6 type-traits and compressed pair fixes 
[SVN r7921]
 2000-10-07 10:53:47 +00:00
Dave Abrahams d7ab782289 Some fixes for Metrowerks compatibility 
[SVN r7919]
 2000-10-06 07:46:12 +00:00
Dave Abrahams a3cc73508f friend declarations to work around a Metrowerks bug 
[SVN r7914]
 2000-10-06 07:32:54 +00:00
John Maddock 17b1472aa2 minor fix for purify errors (not a bug as such - more of a warning suppression) 
[SVN r7879]
 2000-09-30 11:07:25 +00:00
John Maddock e345f05fa9 minor regex fixes 
[SVN r7878]
 2000-09-30 10:36:58 +00:00
Beman Dawes 8a5e8b8c62 Fix conflict and correct boost libraries hyperlink 
[SVN r7857]
 2000-09-27 19:31:09 +00:00
John Maddock c9cfe5a906 more post submission fixes for regex 
[SVN r7855]
 2000-09-27 12:06:41 +00:00
John Maddock a47bcdb944 regex post submission patches/tidy up. 
[SVN r7854]
 2000-09-27 12:04:20 +00:00
Dave Abrahams fc0bf318a2 fix grievious missing std:: qualification 
[SVN r7852]
 2000-09-27 01:47:03 +00:00
Beman Dawes 61696218da Initial Graph and Regex HTML integration 
[SVN r7849]
 2000-09-26 19:02:50 +00:00
Dave Abrahams 4dbf30d14e add streaming of syntax_element_type to suppress warnings 
[SVN r7847]
 2000-09-26 15:49:21 +00:00
Dave Abrahams 116efaa69a add streaming for syntax_element_type to suppress warnings 
[SVN r7846]
 2000-09-26 15:47:45 +00:00
John Maddock 58a5836642 Initial boost-regex++ release 
[SVN r7845]
 2000-09-26 11:48:28 +00:00
167 changed files with 21183 additions and 4093486 deletions
Expand all files Collapse all files
.gitattributes
+96
View File
@@ -0,0 +1,96 @@
* text=auto !eol svneol=native#text/plain
*.gitattributes text svneol=native#text/plain
# Scriptish formats
*.bat text svneol=native#text/plain
*.bsh text svneol=native#text/x-beanshell
*.cgi text svneol=native#text/plain
*.cmd text svneol=native#text/plain
*.js text svneol=native#text/javascript
*.php text svneol=native#text/x-php
*.pl text svneol=native#text/x-perl
*.pm text svneol=native#text/x-perl
*.py text svneol=native#text/x-python
*.sh eol=lf svneol=LF#text/x-sh
configure eol=lf svneol=LF#text/x-sh
# Image formats
*.bmp binary svneol=unset#image/bmp
*.gif binary svneol=unset#image/gif
*.ico binary svneol=unset#image/ico
*.jpeg binary svneol=unset#image/jpeg
*.jpg binary svneol=unset#image/jpeg
*.png binary svneol=unset#image/png
*.tif binary svneol=unset#image/tiff
*.tiff binary svneol=unset#image/tiff
*.svg text svneol=native#image/svg%2Bxml
# Data formats
*.pdf binary svneol=unset#application/pdf
*.avi binary svneol=unset#video/avi
*.doc binary svneol=unset#application/msword
*.dsp text svneol=crlf#text/plain
*.dsw text svneol=crlf#text/plain
*.eps binary svneol=unset#application/postscript
*.gz binary svneol=unset#application/gzip
*.mov binary svneol=unset#video/quicktime
*.mp3 binary svneol=unset#audio/mpeg
*.ppt binary svneol=unset#application/vnd.ms-powerpoint
*.ps binary svneol=unset#application/postscript
*.psd binary svneol=unset#application/photoshop
*.rdf binary svneol=unset#text/rdf
*.rss text svneol=unset#text/xml
*.rtf binary svneol=unset#text/rtf
*.sln text svneol=native#text/plain
*.swf binary svneol=unset#application/x-shockwave-flash
*.tgz binary svneol=unset#application/gzip
*.vcproj text svneol=native#text/xml
*.vcxproj text svneol=native#text/xml
*.vsprops text svneol=native#text/xml
*.wav binary svneol=unset#audio/wav
*.xls binary svneol=unset#application/vnd.ms-excel
*.zip binary svneol=unset#application/zip
# Text formats
.htaccess text svneol=native#text/plain
*.bbk text svneol=native#text/xml
*.cmake text svneol=native#text/plain
*.css text svneol=native#text/css
*.dtd text svneol=native#text/xml
*.htm text svneol=native#text/html
*.html text svneol=native#text/html
*.ini text svneol=native#text/plain
*.log text svneol=native#text/plain
*.mak text svneol=native#text/plain
*.qbk text svneol=native#text/plain
*.rst text svneol=native#text/plain
*.sql text svneol=native#text/x-sql
*.txt text svneol=native#text/plain
*.xhtml text svneol=native#text/xhtml%2Bxml
*.xml text svneol=native#text/xml
*.xsd text svneol=native#text/xml
*.xsl text svneol=native#text/xml
*.xslt text svneol=native#text/xml
*.xul text svneol=native#text/xul
*.yml text svneol=native#text/plain
boost-no-inspect text svneol=native#text/plain
CHANGES text svneol=native#text/plain
COPYING text svneol=native#text/plain
INSTALL text svneol=native#text/plain
Jamfile text svneol=native#text/plain
Jamroot text svneol=native#text/plain
Jamfile.v2 text svneol=native#text/plain
Jamrules text svneol=native#text/plain
Makefile* text svneol=native#text/plain
README text svneol=native#text/plain
TODO text svneol=native#text/plain
# Code formats
*.c text svneol=native#text/plain
*.cpp text svneol=native#text/plain
*.h text svneol=native#text/plain
*.hpp text svneol=native#text/plain
*.ipp text svneol=native#text/plain
*.tpp text svneol=native#text/plain
*.jam text svneol=native#text/plain
*.java text svneol=native#text/plain
.nojekyll
View File
develop/gcovr/MonaspaceNeon-Var.woff2
BIN
View File
Binary file not shown.
develop/gcovr/MonaspaceXenon-Var.woff2
BIN
View File
Binary file not shown.
develop/gcovr/badges/coverage-branches.svg
-22
View File
File diff suppressed because one or more lines are too long
Side by Side

Before

Width:  |  Height:  |  Size: 12 KiB

develop/gcovr/badges/coverage-functions.svg
-22
View File
File diff suppressed because one or more lines are too long
Side by Side

Before

Width:  |  Height:  |  Size: 12 KiB

develop/gcovr/badges/coverage-lines.svg
-22
View File
File diff suppressed because one or more lines are too long
Side by Side

Before

Width:  |  Height:  |  Size: 12 KiB

develop/gcovr/badges/coverage.json
-5
View File
@@ -1,5 +0,0 @@
{
"lines": 89.4,
"functions": 59.3,
"branches": 0.0
}
develop/gcovr/coverage-fixed.json
-1706530
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/coverage-raw.json
-1
View File
File diff suppressed because one or more lines are too long
develop/gcovr/index.basic_regex.hpp.fc7ae442ee1c3ba72f0c8efe27e0d4a0.html
-10758
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.basic_regex_creator.hpp.ddc38b9ace9f1fce2474b7a8aa072758.html
-18617
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.basic_regex_parser.hpp.3d312756fa15eb91f18ce74346527498.html
-30967
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.c_regex_traits.hpp.4a312148ed0fde78796e7f563ab76c8c.html
-4767
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.cpp_regex_traits.hpp.065ad3525ef9ac006d863057e1e02b79.html
-10415
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.css
-2850
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.functions.html
-78429
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.html
-295
View File
@@ -1,295 +0,0 @@
<!DOCTYPE html>
<html class="theme-green">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"/>
<title>regex</title>
<meta name="viewport" content="width=device-width, initial-scale=1.0"/>
<script>
// Apply theme and font size immediately to prevent flash
(function() {
document.documentElement.classList.add('no-transitions');
var saved = localStorage.getItem('gcovr-theme');
var theme = (saved === 'light' || saved === 'dark') ? saved
: window.matchMedia('(prefers-color-scheme: light)').matches ? 'light' : 'dark';
document.documentElement.setAttribute('data-theme', theme);
document.documentElement.style.backgroundColor = theme === 'light' ? '#ffffff' : '#0d1117';
// Apply flat mode immediately to prevent sidebar flash
if (localStorage.getItem('gcovr-view-mode') === 'flat') {
document.documentElement.classList.add('early-flat-mode');
}
})();
</script>
<link rel="stylesheet" href="index.css"/>
<script src="index.js" charset="UTF-8"></script>
</head>
<body>
<div class="app-container">
<!-- Sidebar -->
<aside class="sidebar" id="sidebar"><script>if(localStorage.getItem('sidebar-collapsed')==='true'){document.currentScript.parentElement.classList.add('collapsed');}else{var sw=localStorage.getItem('gcovr-sidebar-width');if(sw)document.documentElement.style.setProperty('--sidebar-width',sw+'px');}</script>
<div class="sidebar-header">
<div class="sidebar-header-row">
<a href="index.html" class="sidebar-logo" title="Back to index">
<svg viewBox="150 150 700 160" class="boost-wordmark"><path fill="#ffa000" d="M292.45,152.89h-93.18l-46.59,80,12.63,21.69,46.57-79.99h47.07c20.07,0,36.38,16.18,36.38,36.07,0,8.46-3.54,18.29-10.84,22.4,7.11,5.3,10.54,13.73,10.54,22.01,0,19.88-16.32,36.06-36.38,36.06h-61.71l16.12-27.7h45.59c4.66,0,8.45-3.75,8.45-8.36s-3.57-8.16-8.05-8.35c-.13-.02-36.25,0-36.25,0l16.14-27.71s20.22.02,20.31,0c1.9-.06,3.63-.74,5-1.85,1.93-1.53,3.15-3.87,3.15-6.5,0-4.62-3.79-8.37-8.45-8.37h-30.03l-47.04,80.75,17.39,29.85h93.18l46.59-80-46.59-80h0Z"/><path fill="currentColor" d="M550.81,291.93c-9.23,0-17.31-2.01-24.23-6.04s-12.29-9.63-16.1-16.83c-3.81-7.19-5.72-15.4-5.72-24.63s1.9-17.6,5.72-24.79c3.81-7.19,9.18-12.82,16.1-16.91,6.92-4.08,15-6.12,24.23-6.12s17.44,2.04,24.31,6.12,12.21,9.72,16.02,16.91,5.72,15.46,5.72,24.79-1.91,17.44-5.72,24.63-9.15,12.8-16.02,16.83c-6.87,4.02-14.97,6.04-24.31,6.04ZM550.81,272.45c5.37,0,9.79-1.23,13.28-3.7,3.49-2.47,6.12-5.82,7.89-10.06s2.66-8.99,2.66-14.25-.89-10.2-2.66-14.49c-1.77-4.29-4.4-7.7-7.89-10.22-3.49-2.52-7.92-3.78-13.28-3.78s-9.82,1.26-13.36,3.78c-3.54,2.52-6.2,5.93-7.97,10.22-1.77,4.29-2.66,9.12-2.66,14.49s.89,10.01,2.66,14.25c1.77,4.24,4.43,7.59,7.97,10.06s7.99,3.7,13.36,3.7Z"/><path fill="currentColor" d="M648.53,291.93c-9.23,0-17.31-2.01-24.23-6.04s-12.29-9.63-16.1-16.83c-3.81-7.19-5.72-15.4-5.72-24.63s1.9-17.6,5.72-24.79c3.81-7.19,9.18-12.82,16.1-16.91,6.92-4.08,15-6.12,24.23-6.12s17.44,2.04,24.31,6.12,12.21,9.72,16.02,16.91,5.72,15.46,5.72,24.79-1.91,17.44-5.72,24.63-9.15,12.8-16.02,16.83c-6.87,4.02-14.97,6.04-24.31,6.04ZM648.53,272.45c5.37,0,9.79-1.23,13.28-3.7,3.49-2.47,6.12-5.82,7.89-10.06s2.66-8.99,2.66-14.25-.89-10.2-2.66-14.49c-1.77-4.29-4.4-7.7-7.89-10.22-3.49-2.52-7.92-3.78-13.28-3.78s-9.82,1.26-13.36,3.78c-3.54,2.52-6.2,5.93-7.97,10.22-1.77,4.29-2.66,9.12-2.66,14.49s.89,10.01,2.66,14.25c1.77,4.24,4.43,7.59,7.97,10.06s7.99,3.7,13.36,3.7Z"/><path fill="currentColor" d="M722.75,260.85c.54,4.62,2.55,7.86,6.04,9.74s7.49,2.82,11.99,2.82,8.21-.8,11.11-2.41c2.9-1.61,4.35-4.24,4.35-7.89,0-2.25-.99-4-2.98-5.23s-4.56-2.2-7.73-2.9c-3.17-.7-6.66-1.37-10.46-2.01-3.81-.64-7.65-1.5-11.51-2.58-3.86-1.07-7.41-2.58-10.63-4.51-3.22-1.93-5.8-4.53-7.73-7.81-1.93-3.27-2.9-7.49-2.9-12.64,0-4.83,1.55-9.47,4.67-13.93,3.11-4.45,7.49-8.05,13.12-10.79,5.63-2.74,12.1-4.11,19.4-4.11,6.55,0,12.61,1.32,18.19,3.95,5.58,2.63,10.06,6.25,13.44,10.87s5.07,9.98,5.07,16.1h-21.41c-.43-4.61-2.15-7.86-5.15-9.74-3.01-1.88-6.6-2.82-10.79-2.82-4.94,0-8.69.99-11.27,2.98s-3.86,4.48-3.86,7.49c0,2.47.99,4.4,2.98,5.8,1.98,1.4,4.56,2.47,7.73,3.22,3.16.75,6.68,1.42,10.55,2.01,3.86.59,7.7,1.4,11.51,2.42,3.81,1.02,7.33,2.47,10.55,4.35s5.8,4.4,7.73,7.57,2.9,7.27,2.9,12.32c0,5.69-1.56,10.71-4.67,15.05-3.11,4.35-7.49,7.73-13.12,10.14-5.64,2.42-12.26,3.62-19.88,3.62-7.08,0-13.52-1.37-19.32-4.11s-10.44-6.44-13.93-11.11c-3.49-4.67-5.34-9.95-5.55-15.86h21.57,0Z"/><path fill="currentColor" d="M815.48,264.84v-47.29h17.55v-18.35h-17.55v-21.78l-34.42,40.14h12.84v51.81c0,11.05,8.95,20,20,20h21.7v-18.52h-14.12c-3.31,0-6-2.69-6-6h0Z"/><path fill="currentColor" d="M494.62,242.26c-2.36-3.92-5.58-7.03-9.66-9.34-1.08-.61-2.19-1.14-3.33-1.61.7-.44,1.36-.91,1.96-1.45,2.95-2.63,5.1-5.82,6.44-9.58,1.34-3.76,2.01-7.35,2.01-10.79,0-8.69-1.99-15.4-5.96-20.12s-9.31-8.02-16.02-9.9c-6.71-1.88-14.14-2.82-22.3-2.82h-34.29v112.7h40.41c8.16,0,15.59-.99,22.3-2.98,6.71-1.98,12.05-5.45,16.02-10.38,3.97-4.94,5.96-11.7,5.96-20.29,0-5.04-1.18-9.53-3.54-13.44ZM472.48,264.8c-1.88,2.09-4.46,3.52-7.73,4.27-3.28.75-6.9,1.13-10.87,1.13h-18.51v-74.54h12.4c4.08,0,7.73.32,10.95.97,3.22.64,5.77,1.96,7.65,3.95,1.88,1.99,2.82,4.91,2.82,8.77s-.94,6.79-2.82,8.78c-1.88,1.99-4.46,3.3-7.73,3.94-1.87.37-3.86.62-5.96.78l-11.25,19.19h12.46c4.08,0,7.73.35,10.95,1.05,3.22.7,5.77,2.01,7.65,3.94s2.82,4.83,2.82,8.69-.94,7-2.82,9.1v-.02Z"/></svg>
</a>
<button class="sidebar-toggle" id="sidebar-toggle" title="Toggle sidebar">
<svg class="icon-collapse" viewBox="0 0 16 16" fill="currentColor"><path fill-rule="evenodd" d="M11.354 1.646a.5.5 0 0 1 0 .708L5.707 8l5.647 5.646a.5.5 0 0 1-.708.708l-6-6a.5.5 0 0 1 0-.708l6-6a.5.5 0 0 1 .708 0z"/></svg>
<svg class="icon-expand" viewBox="0 0 16 16" fill="currentColor"><path fill-rule="evenodd" d="M4.646 1.646a.5.5 0 0 1 .708 0l6 6a.5.5 0 0 1 0 .708l-6 6a.5.5 0 0 1-.708-.708L10.293 8 4.646 2.354a.5.5 0 0 1 0-.708z"/></svg>
</button>
</div>
<div class="sidebar-title-group">
<span class="sidebar-library">regex</span>
</div>
</div>
<div class="sidebar-search">
<input type="text" id="file-search" placeholder="Search files..." autocomplete="off">
<button class="search-clear" id="search-clear" type="button" aria-label="Clear search">&times;</button>
</div>
<div class="tree-controls">
<button class="tree-control-btn" id="expand-all" title="Expand all">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M8 1a.5.5 0 01.5.5v5h5a.5.5 0 010 1h-5v5a.5.5 0 01-1 0v-5h-5a.5.5 0 010-1h5v-5A.5.5 0 018 1z"/></svg>
Expand
</button>
<button class="tree-control-btn" id="collapse-all" title="Collapse all">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M2 8a.5.5 0 01.5-.5h11a.5.5 0 010 1h-11A.5.5 0 012 8z"/></svg>
Collapse
</button>
</div>
<nav class="sidebar-nav" id="file-tree">
<div class="tree-item is-folder">
<div class="tree-item-header">
<a href="index.include.d436eb0fd9de10b54a828ce6435f7e81.html" class="tree-folder-toggle" title="Open include">+</a>
<svg class="tree-icon tree-icon-folder" viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M1.75 1A1.75 1.75 0 000 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0016 13.25v-8.5A1.75 1.75 0 0014.25 3H7.5a.25.25 0 01-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75z"></path></svg>
<a class="tree-label" href="index.include.d436eb0fd9de10b54a828ce6435f7e81.html" title="include">include</a>
</div>
</div>
<div class="tree-item is-folder">
<div class="tree-item-header">
<a href="index.src.25d902c24283ab8cfbac54dfa101ad31.html" class="tree-folder-toggle" title="Open src">+</a>
<svg class="tree-icon tree-icon-folder" viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M1.75 1A1.75 1.75 0 000 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0016 13.25v-8.5A1.75 1.75 0 0014.25 3H7.5a.25.25 0 01-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75z"></path></svg>
<a class="tree-label" href="index.src.25d902c24283ab8cfbac54dfa101ad31.html" title="src">src</a>
</div>
</div>
</nav>
<div class="sidebar-resize-handle" id="sidebar-resize-handle"></div>
</aside>
<!-- Mobile sidebar backdrop -->
<div class="sidebar-backdrop" id="sidebar-backdrop"></div>
<!-- Main Content -->
<main class="main-content">
<header class="main-header">
<button class="mobile-menu-btn" id="mobile-menu-btn" title="Open menu">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M2.5 12a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5zm0-4a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5zm0-4a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5z"/></svg>
</button>
<div class="breadcrumb">
<span class="breadcrumb-title">regex</span><span class="breadcrumb-label">GCC Code Coverage</span> </div>
<div class="header-actions">
</div>
<div class="view-toggle" id="view-toggle" style="display:none">
<button class="view-btn active" data-view="nested">Nested</button>
<button class="view-btn" data-view="flat">Flat</button>
</div>
<button class="theme-toggle" id="theme-toggle" title="Toggle theme">
<svg class="icon-moon" viewBox="0 0 16 16" fill="currentColor"><path d="M6 .278a.768.768 0 0 1 .08.858 7.208 7.208 0 0 0-.878 3.46c0 4.021 3.278 7.277 7.318 7.277.527 0 1.04-.055 1.533-.16a.787.787 0 0 1 .81.316.733.733 0 0 1-.031.893A8.349 8.349 0 0 1 8.344 16C3.734 16 0 12.286 0 7.71 0 4.266 2.114 1.312 5.124.06A.752.752 0 0 1 6 .278z"/></svg>
<svg class="icon-sun" viewBox="0 0 16 16" fill="currentColor"><path d="M8 12a4 4 0 1 0 0-8 4 4 0 0 0 0 8zM8 0a.5.5 0 0 1 .5.5v2a.5.5 0 0 1-1 0v-2A.5.5 0 0 1 8 0zm0 13a.5.5 0 0 1 .5.5v2a.5.5 0 0 1-1 0v-2A.5.5 0 0 1 8 13zm8-5a.5.5 0 0 1-.5.5h-2a.5.5 0 0 1 0-1h2a.5.5 0 0 1 .5.5zM3 8a.5.5 0 0 1-.5.5h-2a.5.5 0 0 1 0-1h2A.5.5 0 0 1 3 8zm10.657-5.657a.5.5 0 0 1 0 .707l-1.414 1.415a.5.5 0 1 1-.707-.708l1.414-1.414a.5.5 0 0 1 .707 0zm-9.193 9.193a.5.5 0 0 1 0 .707L3.05 13.657a.5.5 0 0 1-.707-.707l1.414-1.414a.5.5 0 0 1 .707 0zm9.193 2.121a.5.5 0 0 1-.707 0l-1.414-1.414a.5.5 0 0 1 .707-.707l1.414 1.414a.5.5 0 0 1 0 .707zM4.464 4.465a.5.5 0 0 1-.707 0L2.343 3.05a.5.5 0 1 1 .707-.707l1.414 1.414a.5.5 0 0 1 0 .708z"/></svg>
</button>
<button class="settings-btn" id="settings-btn" title="Settings">
<svg viewBox="0 0 16 16" width="18" height="18" fill="currentColor"><path d="M8 4.754a3.246 3.246 0 100 6.492 3.246 3.246 0 000-6.492zM5.754 8a2.246 2.246 0 114.492 0 2.246 2.246 0 01-4.492 0z"/><path d="M9.796 1.343c-.527-1.79-3.065-1.79-3.592 0l-.094.319a.873.873 0 01-1.255.52l-.292-.16c-1.64-.892-3.433.902-2.54 2.541l.159.292a.873.873 0 01-.52 1.255l-.319.094c-1.79.527-1.79 3.065 0 3.592l.319.094a.873.873 0 01.52 1.255l-.16.292c-.892 1.64.901 3.434 2.541 2.54l.292-.159a.873.873 0 011.255.52l.094.319c.527 1.79 3.065 1.79 3.592 0l.094-.319a.873.873 0 011.255-.52l.292.16c1.64.893 3.434-.902 2.54-2.541l-.159-.292a.873.873 0 01.52-1.255l.319-.094c1.79-.527 1.79-3.065 0-3.592l-.319-.094a.873.873 0 01-.52-1.255l.16-.292c.893-1.64-.902-3.433-2.541-2.54l-.292.159a.873.873 0 01-1.255-.52l-.094-.319zm-2.633.283c.246-.835 1.428-.835 1.674 0l.094.319a1.873 1.873 0 002.693 1.115l.291-.16c.764-.415 1.6.42 1.184 1.185l-.159.292a1.873 1.873 0 001.116 2.692l.318.094c.835.246.835 1.428 0 1.674l-.319.094a1.873 1.873 0 00-1.115 2.693l.16.291c.415.764-.421 1.6-1.185 1.184l-.291-.159a1.873 1.873 0 00-2.693 1.116l-.094.318c-.246.835-1.428.835-1.674 0l-.094-.319a1.873 1.873 0 00-2.692-1.115l-.292.16c-.764.415-1.6-.421-1.184-1.185l.159-.291A1.873 1.873 0 001.945 8.93l-.319-.094c-.835-.246-.835-1.428 0-1.674l.319-.094A1.873 1.873 0 003.06 4.377l-.16-.292c-.415-.764.42-1.6 1.185-1.184l.292.159a1.873 1.873 0 002.692-1.115l.094-.319z"/></svg>
</button>
<div class="settings-dropdown" id="settings-dropdown"></div>
</header>
<div class="content-wrapper">
<section class="summary-section">
<div class="summary-cards">
<div class="summary-card">
<div class="summary-card-header">
<h3>Lines</h3>
</div>
<div class="summary-card-body">
<div class="coverage-ring coverage-medium">
<svg viewBox="0 0 36 36">
<path class="ring-bg" d="M18 2.0845 a 15.9155 15.9155 0 0 1 0 31.831 a 15.9155 15.9155 0 0 1 0 -31.831"/>
<path class="ring-fill" stroke-dasharray="89.4, 100" d="M18 2.0845 a 15.9155 15.9155 0 0 1 0 31.831 a 15.9155 15.9155 0 0 1 0 -31.831"/>
</svg>
<span class="ring-text">89.4%</span>
</div>
<div class="summary-stats">
<div class="stat-row">
<span class="stat-label">Hit</span>
<span class="stat-value">6554</span>
</div>
<div class="stat-row">
<span class="stat-label">Total</span>
<span class="stat-value">7330</span>
</div>
</div>
</div>
</div>
<div class="summary-card">
<div class="summary-card-header">
<h3>Functions</h3>
</div>
<div class="summary-card-body">
<div class="coverage-ring coverage-low">
<svg viewBox="0 0 36 36">
<path class="ring-bg" d="M18 2.0845 a 15.9155 15.9155 0 0 1 0 31.831 a 15.9155 15.9155 0 0 1 0 -31.831"/>
<path class="ring-fill" stroke-dasharray="59.3, 100" d="M18 2.0845 a 15.9155 15.9155 0 0 1 0 31.831 a 15.9155 15.9155 0 0 1 0 -31.831"/>
</svg>
<span class="ring-text">59.3%</span>
</div>
<div class="summary-stats">
<div class="stat-row">
<span class="stat-label">Hit</span>
<span class="stat-value">4210</span>
</div>
<div class="stat-row">
<span class="stat-label">Total</span>
<span class="stat-value">7115</span>
</div>
</div>
</div>
</div>
</div>
<div class="coverage-legend">
<span class="legend-item coverage-high">High: &ge; 90.0%</span>
<span class="legend-item coverage-medium">Medium: &ge; 75.0%</span>
<span class="legend-item coverage-low">Low: &lt; 75.0%</span>
<span class="legend-separator"></span>
<a href="index.functions.html" class="legend-item legend-functions-link" title="List of all functions">
<span class="fx-icon" aria-hidden="true"><i>f</i>(x)</span>
List of functions
</a>
</div> </section>
<section class="main-section">
<div class="file-list-container no-branches no-conditions no-decisions no-calls">
<div class="file-list-header">
<div class="col-name sortable sorted-ascending" data-sort="filename">
Name
</div>
<div class="col-coverage sortable" data-sort="coverage">
Coverage
</div>
<div class="col-lines sortable" data-sort="lines">
Lines
</div>
<div class="col-functions sortable" data-sort="functions">
Functions
</div>
</div>
<div class="file-list-body" id="file-list">
<div class="file-row directory"
data-filename="include"
data-coverage="89.9"
data-lines="7108"
data-lines-exec="6391"
data-lines-coverage="89.9"
data-lines-class="coverage-medium"
data-functions="59.2"
data-functions-coverage="59.2"
data-functions-class="coverage-low"
data-branches="-"
data-branches-coverage="-"
data-branches-class="coverage-unknown"
data-conditions="-"
data-conditions-coverage="-"
data-conditions-class="coverage-unknown"
data-decisions="-"
data-decisions-coverage="-"
data-decisions-class="coverage-unknown"
data-calls="69.5"
data-calls-coverage="69.5"
data-calls-class="coverage-low"
data-diff="None">
<div class="col-name">
<span class="file-icon">
<svg viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M1.75 1A1.75 1.75 0 000 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0016 13.25v-8.5A1.75 1.75 0 0014.25 3H7.5a.25.25 0 01-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75z"></path></svg>
</span>
<a href="index.include.d436eb0fd9de10b54a828ce6435f7e81.html" title="include">include</a>
</div>
<div class="col-coverage">
<div class="coverage-bar-container">
<div class="coverage-bar coverage-medium" style="width: 89.9%"></div>
</div>
<span class="coverage-percent coverage-medium">89.9%</span>
</div>
<div class="col-lines">
<span class="stat-value">6391</span>
<span class="stat-separator">/</span>
<span class="stat-total">7108</span>
</div>
<div class="col-functions">
<span class="stat-value coverage-low">59.2%</span>
</div>
</div>
<div class="file-row directory"
data-filename="src"
data-coverage="73.4"
data-lines="222"
data-lines-exec="163"
data-lines-coverage="73.4"
data-lines-class="coverage-low"
data-functions="100.0"
data-functions-coverage="100.0"
data-functions-class="coverage-high"
data-branches="-"
data-branches-coverage="-"
data-branches-class="coverage-unknown"
data-conditions="-"
data-conditions-coverage="-"
data-conditions-class="coverage-unknown"
data-decisions="-"
data-decisions-coverage="-"
data-decisions-class="coverage-unknown"
data-calls="58.3"
data-calls-coverage="58.3"
data-calls-class="coverage-low"
data-diff="None">
<div class="col-name">
<span class="file-icon">
<svg viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M1.75 1A1.75 1.75 0 000 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0016 13.25v-8.5A1.75 1.75 0 0014.25 3H7.5a.25.25 0 01-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75z"></path></svg>
</span>
<a href="index.src.25d902c24283ab8cfbac54dfa101ad31.html" title="src">src</a>
</div>
<div class="col-coverage">
<div class="coverage-bar-container">
<div class="coverage-bar coverage-low" style="width: 73.4%"></div>
</div>
<span class="coverage-percent coverage-low">73.4%</span>
</div>
<div class="col-lines">
<span class="stat-value">163</span>
<span class="stat-separator">/</span>
<span class="stat-total">222</span>
</div>
<div class="col-functions">
<span class="stat-value coverage-high">100.0%</span>
</div>
</div>
</div>
</div> </section>
</div>
<footer class="main-footer">
Created using <a href="http://gcovr.com/en/main">GCOVR (Version 8.6+main)</a>
at 2026-05-22 16:53:31
</footer>
</main>
</div>
</body>
</html>
develop/gcovr/index.icu.hpp.85a0eeb0fabef296bfc4997ff2ba1c10.html
-14774
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.include.d436eb0fd9de10b54a828ce6435f7e81.html
-1885
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.js
-2123
View File
File diff suppressed because one or more lines are too long
develop/gcovr/index.match_flags.hpp.1af065f3f48dd91d0fe78746fcc481f7.html
-1690
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.match_results.hpp.6f836c49889c34cb37b399542baf9aad.html
-14274
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.mem_block_cache.hpp.774760178b61a39a431f88e157dbeb00.html
-1881
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.object_cache.hpp.4205d672d499c4d505efbd5c4c18a6d7.html
-1736
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.pattern_except.hpp.b02995306146a84a816c726ffb2330d1.html
-1340
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.perl_matcher.hpp.06d9b87b6156807b3cf2c759c3470f4c.html
-9403
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.perl_matcher_common.hpp.a80be6e3c2e730ca65c745979c0f2c25.html
-19192
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.perl_matcher_non_recursive.hpp.dab741f714b85b31fb79aec3a5169121.html
-36329
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.posix_api.cpp.cfc7145cfaa87ceb158ee21e8fa5193a.html
-2868
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.primary_transform.hpp.f5a3fa617cbe44ea611e82cf685be5de.html
-1388
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_format.hpp.cbfb4d559693198023d36b54c0718da8.html
-14959
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_grep.hpp.136157ec6043ed61e9e3c53cbca56207.html
-1236
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_iterator.hpp.ec4c2b3efdca8342ebcbd87d33ac2551.html
-4221
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_match.hpp.52d49d2882a598bc100172b30fdc9d28.html
-1343
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_merge.hpp.33d760b7953f0b4898c72299d831fc8c.html
-857
View File
@@ -1,857 +0,0 @@
<!DOCTYPE html>
<html class="theme-green">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"/>
<title>include/boost/regex/v5/regex_merge.hpp - regex</title>
<meta name="viewport" content="width=device-width, initial-scale=1.0"/>
<script>
// Apply theme and font size immediately to prevent flash
(function() {
document.documentElement.classList.add('no-transitions');
var saved = localStorage.getItem('gcovr-theme');
var theme = (saved === 'light' || saved === 'dark') ? saved
: window.matchMedia('(prefers-color-scheme: light)').matches ? 'light' : 'dark';
document.documentElement.setAttribute('data-theme', theme);
document.documentElement.style.backgroundColor = theme === 'light' ? '#ffffff' : '#0d1117';
// Apply flat mode immediately to prevent sidebar flash
if (localStorage.getItem('gcovr-view-mode') === 'flat') {
document.documentElement.classList.add('early-flat-mode');
}
})();
</script>
<link rel="stylesheet" href="index.css"/>
<script src="index.js" charset="UTF-8"></script>
</head>
<body>
<div class="app-container">
<!-- Sidebar -->
<aside class="sidebar" id="sidebar"><script>if(localStorage.getItem('sidebar-collapsed')==='true'){document.currentScript.parentElement.classList.add('collapsed');}else{var sw=localStorage.getItem('gcovr-sidebar-width');if(sw)document.documentElement.style.setProperty('--sidebar-width',sw+'px');}</script>
<div class="sidebar-header">
<div class="sidebar-header-row">
<a href="index.html" class="sidebar-logo" title="Back to index">
<svg viewBox="150 150 700 160" class="boost-wordmark"><path fill="#ffa000" d="M292.45,152.89h-93.18l-46.59,80,12.63,21.69,46.57-79.99h47.07c20.07,0,36.38,16.18,36.38,36.07,0,8.46-3.54,18.29-10.84,22.4,7.11,5.3,10.54,13.73,10.54,22.01,0,19.88-16.32,36.06-36.38,36.06h-61.71l16.12-27.7h45.59c4.66,0,8.45-3.75,8.45-8.36s-3.57-8.16-8.05-8.35c-.13-.02-36.25,0-36.25,0l16.14-27.71s20.22.02,20.31,0c1.9-.06,3.63-.74,5-1.85,1.93-1.53,3.15-3.87,3.15-6.5,0-4.62-3.79-8.37-8.45-8.37h-30.03l-47.04,80.75,17.39,29.85h93.18l46.59-80-46.59-80h0Z"/><path fill="currentColor" d="M550.81,291.93c-9.23,0-17.31-2.01-24.23-6.04s-12.29-9.63-16.1-16.83c-3.81-7.19-5.72-15.4-5.72-24.63s1.9-17.6,5.72-24.79c3.81-7.19,9.18-12.82,16.1-16.91,6.92-4.08,15-6.12,24.23-6.12s17.44,2.04,24.31,6.12,12.21,9.72,16.02,16.91,5.72,15.46,5.72,24.79-1.91,17.44-5.72,24.63-9.15,12.8-16.02,16.83c-6.87,4.02-14.97,6.04-24.31,6.04ZM550.81,272.45c5.37,0,9.79-1.23,13.28-3.7,3.49-2.47,6.12-5.82,7.89-10.06s2.66-8.99,2.66-14.25-.89-10.2-2.66-14.49c-1.77-4.29-4.4-7.7-7.89-10.22-3.49-2.52-7.92-3.78-13.28-3.78s-9.82,1.26-13.36,3.78c-3.54,2.52-6.2,5.93-7.97,10.22-1.77,4.29-2.66,9.12-2.66,14.49s.89,10.01,2.66,14.25c1.77,4.24,4.43,7.59,7.97,10.06s7.99,3.7,13.36,3.7Z"/><path fill="currentColor" d="M648.53,291.93c-9.23,0-17.31-2.01-24.23-6.04s-12.29-9.63-16.1-16.83c-3.81-7.19-5.72-15.4-5.72-24.63s1.9-17.6,5.72-24.79c3.81-7.19,9.18-12.82,16.1-16.91,6.92-4.08,15-6.12,24.23-6.12s17.44,2.04,24.31,6.12,12.21,9.72,16.02,16.91,5.72,15.46,5.72,24.79-1.91,17.44-5.72,24.63-9.15,12.8-16.02,16.83c-6.87,4.02-14.97,6.04-24.31,6.04ZM648.53,272.45c5.37,0,9.79-1.23,13.28-3.7,3.49-2.47,6.12-5.82,7.89-10.06s2.66-8.99,2.66-14.25-.89-10.2-2.66-14.49c-1.77-4.29-4.4-7.7-7.89-10.22-3.49-2.52-7.92-3.78-13.28-3.78s-9.82,1.26-13.36,3.78c-3.54,2.52-6.2,5.93-7.97,10.22-1.77,4.29-2.66,9.12-2.66,14.49s.89,10.01,2.66,14.25c1.77,4.24,4.43,7.59,7.97,10.06s7.99,3.7,13.36,3.7Z"/><path fill="currentColor" d="M722.75,260.85c.54,4.62,2.55,7.86,6.04,9.74s7.49,2.82,11.99,2.82,8.21-.8,11.11-2.41c2.9-1.61,4.35-4.24,4.35-7.89,0-2.25-.99-4-2.98-5.23s-4.56-2.2-7.73-2.9c-3.17-.7-6.66-1.37-10.46-2.01-3.81-.64-7.65-1.5-11.51-2.58-3.86-1.07-7.41-2.58-10.63-4.51-3.22-1.93-5.8-4.53-7.73-7.81-1.93-3.27-2.9-7.49-2.9-12.64,0-4.83,1.55-9.47,4.67-13.93,3.11-4.45,7.49-8.05,13.12-10.79,5.63-2.74,12.1-4.11,19.4-4.11,6.55,0,12.61,1.32,18.19,3.95,5.58,2.63,10.06,6.25,13.44,10.87s5.07,9.98,5.07,16.1h-21.41c-.43-4.61-2.15-7.86-5.15-9.74-3.01-1.88-6.6-2.82-10.79-2.82-4.94,0-8.69.99-11.27,2.98s-3.86,4.48-3.86,7.49c0,2.47.99,4.4,2.98,5.8,1.98,1.4,4.56,2.47,7.73,3.22,3.16.75,6.68,1.42,10.55,2.01,3.86.59,7.7,1.4,11.51,2.42,3.81,1.02,7.33,2.47,10.55,4.35s5.8,4.4,7.73,7.57,2.9,7.27,2.9,12.32c0,5.69-1.56,10.71-4.67,15.05-3.11,4.35-7.49,7.73-13.12,10.14-5.64,2.42-12.26,3.62-19.88,3.62-7.08,0-13.52-1.37-19.32-4.11s-10.44-6.44-13.93-11.11c-3.49-4.67-5.34-9.95-5.55-15.86h21.57,0Z"/><path fill="currentColor" d="M815.48,264.84v-47.29h17.55v-18.35h-17.55v-21.78l-34.42,40.14h12.84v51.81c0,11.05,8.95,20,20,20h21.7v-18.52h-14.12c-3.31,0-6-2.69-6-6h0Z"/><path fill="currentColor" d="M494.62,242.26c-2.36-3.92-5.58-7.03-9.66-9.34-1.08-.61-2.19-1.14-3.33-1.61.7-.44,1.36-.91,1.96-1.45,2.95-2.63,5.1-5.82,6.44-9.58,1.34-3.76,2.01-7.35,2.01-10.79,0-8.69-1.99-15.4-5.96-20.12s-9.31-8.02-16.02-9.9c-6.71-1.88-14.14-2.82-22.3-2.82h-34.29v112.7h40.41c8.16,0,15.59-.99,22.3-2.98,6.71-1.98,12.05-5.45,16.02-10.38,3.97-4.94,5.96-11.7,5.96-20.29,0-5.04-1.18-9.53-3.54-13.44ZM472.48,264.8c-1.88,2.09-4.46,3.52-7.73,4.27-3.28.75-6.9,1.13-10.87,1.13h-18.51v-74.54h12.4c4.08,0,7.73.32,10.95.97,3.22.64,5.77,1.96,7.65,3.95,1.88,1.99,2.82,4.91,2.82,8.77s-.94,6.79-2.82,8.78c-1.88,1.99-4.46,3.3-7.73,3.94-1.87.37-3.86.62-5.96.78l-11.25,19.19h12.46c4.08,0,7.73.35,10.95,1.05,3.22.7,5.77,2.01,7.65,3.94s2.82,4.83,2.82,8.69-.94,7-2.82,9.1v-.02Z"/></svg>
</a>
<button class="sidebar-toggle" id="sidebar-toggle" title="Toggle sidebar">
<svg class="icon-collapse" viewBox="0 0 16 16" fill="currentColor"><path fill-rule="evenodd" d="M11.354 1.646a.5.5 0 0 1 0 .708L5.707 8l5.647 5.646a.5.5 0 0 1-.708.708l-6-6a.5.5 0 0 1 0-.708l6-6a.5.5 0 0 1 .708 0z"/></svg>
<svg class="icon-expand" viewBox="0 0 16 16" fill="currentColor"><path fill-rule="evenodd" d="M4.646 1.646a.5.5 0 0 1 .708 0l6 6a.5.5 0 0 1 0 .708l-6 6a.5.5 0 0 1-.708-.708L10.293 8 4.646 2.354a.5.5 0 0 1 0-.708z"/></svg>
</button>
</div>
<div class="sidebar-title-group">
<span class="sidebar-library">regex</span>
</div>
</div>
<div class="sidebar-search">
<input type="text" id="file-search" placeholder="Search files..." autocomplete="off">
<button class="search-clear" id="search-clear" type="button" aria-label="Clear search">&times;</button>
</div>
<div class="tree-controls">
<button class="tree-control-btn" id="expand-all" title="Expand all">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M8 1a.5.5 0 01.5.5v5h5a.5.5 0 010 1h-5v5a.5.5 0 01-1 0v-5h-5a.5.5 0 010-1h5v-5A.5.5 0 018 1z"/></svg>
Expand
</button>
<button class="tree-control-btn" id="collapse-all" title="Collapse all">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M2 8a.5.5 0 01.5-.5h11a.5.5 0 010 1h-11A.5.5 0 012 8z"/></svg>
Collapse
</button>
</div>
<nav class="sidebar-nav" id="file-tree">
<div class="tree-item">
<div class="tree-item-header">
<a href="index.html" class="tree-toggle" title="Back to directory">
<span class="toggle-icon">&larr;</span>
</a>
<span class="tree-icon folder">
<svg viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M1.75 1A1.75 1.75 0 000 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0016 13.25v-8.5A1.75 1.75 0 0014.25 3H7.5a.25.25 0 01-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75z"></path></svg>
</span>
<a class="tree-label" href="index.html">Back to Index</a>
</div>
</div>
<div class="tree-item active">
<div class="tree-item-header">
<span class="tree-toggle-spacer"></span>
<span class="tree-icon file">
<svg viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M3.75 1.5a.25.25 0 00-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 00.25-.25V6h-2.75A1.75 1.75 0 019 4.25V1.5H3.75zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-2.938-2.938zM2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0113.25 16h-9.5A1.75 1.75 0 012 14.25V1.75z"></path></svg>
</span>
<span class="tree-label">include/boost/regex/v5/regex_merge.hpp</span>
</div>
</div>
</nav>
<div class="sidebar-resize-handle" id="sidebar-resize-handle"></div>
</aside>
<!-- Mobile sidebar backdrop -->
<div class="sidebar-backdrop" id="sidebar-backdrop"></div>
<!-- Main Content -->
<main class="main-content">
<header class="main-header">
<button class="mobile-menu-btn" id="mobile-menu-btn" title="Open menu">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M2.5 12a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5zm0-4a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5zm0-4a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5z"/></svg>
</button>
<div class="breadcrumb">
<a href="index.html" class="breadcrumb-home">Index</a><span class="separator">/</span><span class="current" title="include/boost/regex/v5/regex_merge.hpp">include / boost / regex / v5 / regex_merge.hpp</span> </div>
<div class="header-actions">
</div>
<div class="view-toggle" id="view-toggle" style="display:none">
<button class="view-btn active" data-view="nested">Nested</button>
<button class="view-btn" data-view="flat">Flat</button>
</div>
<button class="theme-toggle" id="theme-toggle" title="Toggle theme">
<svg class="icon-moon" viewBox="0 0 16 16" fill="currentColor"><path d="M6 .278a.768.768 0 0 1 .08.858 7.208 7.208 0 0 0-.878 3.46c0 4.021 3.278 7.277 7.318 7.277.527 0 1.04-.055 1.533-.16a.787.787 0 0 1 .81.316.733.733 0 0 1-.031.893A8.349 8.349 0 0 1 8.344 16C3.734 16 0 12.286 0 7.71 0 4.266 2.114 1.312 5.124.06A.752.752 0 0 1 6 .278z"/></svg>
<svg class="icon-sun" viewBox="0 0 16 16" fill="currentColor"><path d="M8 12a4 4 0 1 0 0-8 4 4 0 0 0 0 8zM8 0a.5.5 0 0 1 .5.5v2a.5.5 0 0 1-1 0v-2A.5.5 0 0 1 8 0zm0 13a.5.5 0 0 1 .5.5v2a.5.5 0 0 1-1 0v-2A.5.5 0 0 1 8 13zm8-5a.5.5 0 0 1-.5.5h-2a.5.5 0 0 1 0-1h2a.5.5 0 0 1 .5.5zM3 8a.5.5 0 0 1-.5.5h-2a.5.5 0 0 1 0-1h2A.5.5 0 0 1 3 8zm10.657-5.657a.5.5 0 0 1 0 .707l-1.414 1.415a.5.5 0 1 1-.707-.708l1.414-1.414a.5.5 0 0 1 .707 0zm-9.193 9.193a.5.5 0 0 1 0 .707L3.05 13.657a.5.5 0 0 1-.707-.707l1.414-1.414a.5.5 0 0 1 .707 0zm9.193 2.121a.5.5 0 0 1-.707 0l-1.414-1.414a.5.5 0 0 1 .707-.707l1.414 1.414a.5.5 0 0 1 0 .707zM4.464 4.465a.5.5 0 0 1-.707 0L2.343 3.05a.5.5 0 1 1 .707-.707l1.414 1.414a.5.5 0 0 1 0 .708z"/></svg>
</button>
<button class="settings-btn" id="settings-btn" title="Settings">
<svg viewBox="0 0 16 16" width="18" height="18" fill="currentColor"><path d="M8 4.754a3.246 3.246 0 100 6.492 3.246 3.246 0 000-6.492zM5.754 8a2.246 2.246 0 114.492 0 2.246 2.246 0 01-4.492 0z"/><path d="M9.796 1.343c-.527-1.79-3.065-1.79-3.592 0l-.094.319a.873.873 0 01-1.255.52l-.292-.16c-1.64-.892-3.433.902-2.54 2.541l.159.292a.873.873 0 01-.52 1.255l-.319.094c-1.79.527-1.79 3.065 0 3.592l.319.094a.873.873 0 01.52 1.255l-.16.292c-.892 1.64.901 3.434 2.541 2.54l.292-.159a.873.873 0 011.255.52l.094.319c.527 1.79 3.065 1.79 3.592 0l.094-.319a.873.873 0 011.255-.52l.292.16c1.64.893 3.434-.902 2.54-2.541l-.159-.292a.873.873 0 01.52-1.255l.319-.094c1.79-.527 1.79-3.065 0-3.592l-.319-.094a.873.873 0 01-.52-1.255l.16-.292c.893-1.64-.902-3.433-2.541-2.54l-.292.159a.873.873 0 01-1.255-.52l-.094-.319zm-2.633.283c.246-.835 1.428-.835 1.674 0l.094.319a1.873 1.873 0 002.693 1.115l.291-.16c.764-.415 1.6.42 1.184 1.185l-.159.292a1.873 1.873 0 001.116 2.692l.318.094c.835.246.835 1.428 0 1.674l-.319.094a1.873 1.873 0 00-1.115 2.693l.16.291c.415.764-.421 1.6-1.185 1.184l-.291-.159a1.873 1.873 0 00-2.693 1.116l-.094.318c-.246.835-1.428.835-1.674 0l-.094-.319a1.873 1.873 0 00-2.692-1.115l-.292.16c-.764.415-1.6-.421-1.184-1.185l.159-.291A1.873 1.873 0 001.945 8.93l-.319-.094c-.835-.246-.835-1.428 0-1.674l.319-.094A1.873 1.873 0 003.06 4.377l-.16-.292c-.415-.764.42-1.6 1.185-1.184l.292.159a1.873 1.873 0 002.692-1.115l.094-.319z"/></svg>
</button>
<div class="settings-dropdown" id="settings-dropdown"></div>
</header>
<div class="content-wrapper">
<section class="summary-section">
<div class="source-summary">
<div class="source-info">
<h2 class="source-filename">include/boost/regex/v5/regex_merge.hpp</h2>
<div class="source-stats">
<span class="stat coverage-high">
<strong>100.0%</strong> Lines (2/2)
</span>
<span class="stat coverage-high">
<strong>100.0%</strong> List of functions (1/1)
</span>
</div>
</div>
<div class="nav-hint">
<span><kbd>[</kbd> <kbd>]</kbd> prev/next file</span>
</div>
</div> </section>
<section class="main-section">
<div class="source-container no-branches">
<div class="source-header">
<span class="source-header-filename">regex_merge.hpp</span>
<div class="source-line-filters">
<button type="button" class="btn btn-sm button_toggle_coveredLine show_coveredLine" value="coveredLine" title="Toggle covered lines">
covered
</button>
<button type="button" class="btn btn-sm button_toggle_uncoveredLine show_uncoveredLine" value="uncoveredLine" title="Toggle uncovered lines">
uncovered
</button>
</div>
<div class="source-column-filters">
<button type="button" class="btn btn-sm col-toggle show-col" data-col="tla" title="Toggle TLA column">TLA</button>
<button type="button" class="btn btn-sm col-toggle show-col" data-col="count" title="Toggle Hits column">Hits</button>
</div>
<div class="source-nav-links">
<a class="nav-link nav-prev" href="index.regex_match.hpp.52d49d2882a598bc100172b30fdc9d28.html" title="Previous file">
<svg viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M8 2a.75.75 0 01.75.75v8.69l3.22-3.22a.75.75 0 111.06 1.06l-4.5 4.5a.75.75 0 01-1.06 0l-4.5-4.5a.75.75 0 011.06-1.06l3.22 3.22V2.75A.75.75 0 018 2z" transform="rotate(180 8 8)"/></svg>
</a>
<a class="nav-link nav-next" href="index.regex_raw_buffer.hpp.77701f68cbde88eced9e7f01d308832b.html" title="Next file">
<svg viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M8 2a.75.75 0 01.75.75v8.69l3.22-3.22a.75.75 0 111.06 1.06l-4.5 4.5a.75.75 0 01-1.06 0l-4.5-4.5a.75.75 0 011.06-1.06l3.22 3.22V2.75A.75.75 0 018 2z"/></svg>
</a>
</div>
</div>
<details class="source-functions">
<summary class="source-functions-toggle">
<span class="fx-icon"><i>f</i>(x)</span>
Functions (1)
</summary>
<div class="source-functions-list">
<div class="source-function-header">
<span class="source-function-col-name" data-sort="name">Function</span>
<span class="source-function-col-stat" data-sort="calls">Calls</span>
<span class="source-function-col-stat" data-sort="lines">Lines</span>
<span class="source-function-col-stat" data-sort="blocks">Blocks</span>
</div>
<a href="#l28" class="source-function-item"
data-name="std::ostream_iterator&lt;char, char, std::char_traits&lt;char&gt; &gt; boost::regex_merge&lt;std::ostream_iterator&lt;char, char, std::char_traits&lt;char&gt; &gt;, __gnu_cxx::__normal_iterator&lt;char*, std::__cxx11::basic_string&lt;char, std::char_traits&lt;char&gt;, std::allocator&lt;char&gt; &gt; &gt;, boost::regex_traits&lt;char, boost::cpp_regex_traits&lt;char&gt; &gt;, char&gt;(std::ostream_iterator&lt;char, char, std::char_traits&lt;char&gt; &gt;, __gnu_cxx::__normal_iterator&lt;char*, std::__cxx11::basic_string&lt;char, std::char_traits&lt;char&gt;, std::allocator&lt;char&gt; &gt; &gt;, __gnu_cxx::__normal_iterator&lt;char*, std::__cxx11::basic_string&lt;char, std::char_traits&lt;char&gt;, std::allocator&lt;char&gt; &gt; &gt;, boost::basic_regex&lt;char, boost::regex_traits&lt;char, boost::cpp_regex_traits&lt;char&gt; &gt; &gt; const&amp;, char const*, boost::regex_constants::_match_flags)" data-calls="2" data-lines="100.0" data-branches="-1" data-blocks="100.0">
<span class="source-function-col-name">
<span class="source-function-name">std::ostream_iterator&lt;char, char, std::char_traits&lt;char&gt; &gt; boost::regex_merge&lt;std::ostream_iterator&lt;char, char, std::char_traits&lt;char&gt; &gt;, __gnu_cxx::__normal_iterator&lt;char*, std::__cxx11::basic_string&lt;char, std::char_traits&lt;char&gt;, std::allocator&lt;char&gt; &gt; &gt;, boost::regex_traits&lt;char, boost::cpp_regex_traits&lt;char&gt; &gt;, char&gt;(std::ostream_iterator&lt;char, char, std::char_traits&lt;char&gt; &gt;, __gnu_cxx::__normal_iterator&lt;char*, std::__cxx11::basic_string&lt;char, std::char_traits&lt;char&gt;, std::allocator&lt;char&gt; &gt; &gt;, __gnu_cxx::__normal_iterator&lt;char*, std::__cxx11::basic_string&lt;char, std::char_traits&lt;char&gt;, std::allocator&lt;char&gt; &gt; &gt;, boost::basic_regex&lt;char, boost::regex_traits&lt;char, boost::cpp_regex_traits&lt;char&gt; &gt; &gt; const&amp;, char const*, boost::regex_constants::_match_flags)</span>
<span class="source-function-line">:28</span>
</span>
<span class="source-function-col-stat">2x</span>
<span class="source-function-col-stat cov-high">100.0%</span>
<span class="source-function-col-stat cov-high">100.0%</span>
</a>
</div>
</details>
<div class="source-table-container">
<table class="source-table">
<thead>
<tr>
<th class="col-lineno">Line</th>
<th class="col-tla">TLA</th>
<th class="col-count">Hits</th>
<th class="col-source">Source Code</th>
</tr>
</thead>
<tbody>
<tr class="source-line">
<td class="col-lineno">
<a id="l1">1</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm">/*</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l2">2</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> *</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l3">3</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * Copyright (c) 1998-2002</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l4">4</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * John Maddock</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l5">5</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> *</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l6">6</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * Use, modification and distribution are subject to the </span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l7">7</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * Boost Software License, Version 1.0. (See accompanying file </span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l8">8</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l9">9</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> *</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l10">10</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> */</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l11">11</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l12">12</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="cm">/*</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l13">13</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * LOCATION: see http://www.boost.org for most recent version.</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l14">14</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * FILE regex_format.hpp</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l15">15</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * VERSION see &lt;boost/version.hpp&gt;</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l16">16</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * DESCRIPTION: Provides formatting output routines for search and replace</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l17">17</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * operations. Note this is an internal header file included</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l18">18</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> * by regex.hpp, do not include on its own.</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l19">19</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cm"> */</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l20">20</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l21">21</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cp">#ifndef BOOST_REGEX_V5_REGEX_MERGE_HPP</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l22">22</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cp">#define BOOST_REGEX_V5_REGEX_MERGE_HPP</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l23">23</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l24">24</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l25">25</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="k">namespace</span><span class="w"> </span><span class="nn">boost</span><span class="p">{</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l26">26</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l27">27</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="n">BOOST_REGEX_MODULE_EXPORT</span><span class="w"> </span><span class="k">template</span><span class="w"> </span><span class="o">&lt;</span><span class="k">class</span><span class="w"> </span><span class="nc">OutputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Iterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">traits</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">charT</span><span class="o">&gt;</span></td>
</tr>
<tr class="source-line coveredLine show_coveredLine">
<td class="col-lineno">
<a id="l28">28</a>
</td>
<td class="col-tla"></td>
<td class="col-count coveredLine">
2x </td>
<td class="col-source"><span class="kr">inline</span><span class="w"> </span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">regex_merge</span><span class="p">(</span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">out</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l29">29</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="n">Iterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l30">30</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="n">Iterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l31">31</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">basic_regex</span><span class="o">&lt;</span><span class="n">charT</span><span class="p">,</span><span class="w"> </span><span class="n">traits</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l32">32</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">charT</span><span class="o">*</span><span class="w"> </span><span class="n">fmt</span><span class="p">,</span><span class="w"> </span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l33">33</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="n">match_flag_type</span><span class="w"> </span><span class="n">flags</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">match_default</span><span class="p">)</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l34">34</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">{</span></td>
</tr>
<tr class="source-line coveredLine show_coveredLine">
<td class="col-lineno">
<a id="l35">35</a>
</td>
<td class="col-tla"></td>
<td class="col-count coveredLine">
2x </td>
<td class="col-source"><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">regex_replace</span><span class="p">(</span><span class="n">out</span><span class="p">,</span><span class="w"> </span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="n">last</span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">fmt</span><span class="p">,</span><span class="w"> </span><span class="n">flags</span><span class="p">);</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l36">36</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">}</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l37">37</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l38">38</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="n">BOOST_REGEX_MODULE_EXPORT</span><span class="w"> </span><span class="k">template</span><span class="w"> </span><span class="o">&lt;</span><span class="k">class</span><span class="w"> </span><span class="nc">OutputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Iterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">traits</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">charT</span><span class="o">&gt;</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l39">39</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="kr">inline</span><span class="w"> </span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">regex_merge</span><span class="p">(</span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">out</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l40">40</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="n">Iterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l41">41</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="n">Iterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l42">42</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">basic_regex</span><span class="o">&lt;</span><span class="n">charT</span><span class="p">,</span><span class="w"> </span><span class="n">traits</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l43">43</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">basic_string</span><span class="o">&lt;</span><span class="n">charT</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">fmt</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l44">44</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="n">match_flag_type</span><span class="w"> </span><span class="n">flags</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">match_default</span><span class="p">)</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l45">45</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">{</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l46">46</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">regex_merge</span><span class="p">(</span><span class="n">out</span><span class="p">,</span><span class="w"> </span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="n">last</span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">fmt</span><span class="p">.</span><span class="n">c_str</span><span class="p">(),</span><span class="w"> </span><span class="n">flags</span><span class="p">);</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l47">47</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">}</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l48">48</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l49">49</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="n">BOOST_REGEX_MODULE_EXPORT</span><span class="w"> </span><span class="k">template</span><span class="w"> </span><span class="o">&lt;</span><span class="k">class</span><span class="w"> </span><span class="nc">traits</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">charT</span><span class="o">&gt;</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l50">50</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="kr">inline</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">basic_string</span><span class="o">&lt;</span><span class="n">charT</span><span class="o">&gt;</span><span class="w"> </span><span class="n">regex_merge</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">basic_string</span><span class="o">&lt;</span><span class="n">charT</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">s</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l51">51</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">basic_regex</span><span class="o">&lt;</span><span class="n">charT</span><span class="p">,</span><span class="w"> </span><span class="n">traits</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l52">52</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">charT</span><span class="o">*</span><span class="w"> </span><span class="n">fmt</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l53">53</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="n">match_flag_type</span><span class="w"> </span><span class="n">flags</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">match_default</span><span class="p">)</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l54">54</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">{</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l55">55</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">regex_replace</span><span class="p">(</span><span class="n">s</span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">fmt</span><span class="p">,</span><span class="w"> </span><span class="n">flags</span><span class="p">);</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l56">56</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">}</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l57">57</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l58">58</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="n">BOOST_REGEX_MODULE_EXPORT</span><span class="w"> </span><span class="k">template</span><span class="w"> </span><span class="o">&lt;</span><span class="k">class</span><span class="w"> </span><span class="nc">traits</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">charT</span><span class="o">&gt;</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l59">59</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="kr">inline</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">basic_string</span><span class="o">&lt;</span><span class="n">charT</span><span class="o">&gt;</span><span class="w"> </span><span class="n">regex_merge</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">basic_string</span><span class="o">&lt;</span><span class="n">charT</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">s</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l60">60</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">basic_regex</span><span class="o">&lt;</span><span class="n">charT</span><span class="p">,</span><span class="w"> </span><span class="n">traits</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l61">61</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">basic_string</span><span class="o">&lt;</span><span class="n">charT</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">fmt</span><span class="p">,</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l62">62</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="n">match_flag_type</span><span class="w"> </span><span class="n">flags</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">match_default</span><span class="p">)</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l63">63</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">{</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l64">64</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">regex_replace</span><span class="p">(</span><span class="n">s</span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">fmt</span><span class="p">,</span><span class="w"> </span><span class="n">flags</span><span class="p">);</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l65">65</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">}</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l66">66</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l67">67</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="p">}</span><span class="w"> </span><span class="c1">// namespace boost</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l68">68</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l69">69</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"><span class="cp">#endif </span><span class="c1">// BOOST_REGEX_V5_REGEX_MERGE_HPP</span></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l70">70</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l71">71</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
<tr class="source-line">
<td class="col-lineno">
<a id="l72">72</a>
</td>
<td class="col-tla"></td>
<td class="col-count">
</td>
<td class="col-source"></td>
</tr>
</tbody>
</table>
</div>
</div> </section>
</div>
<footer class="main-footer">
Created using <a href="http://gcovr.com/en/main">GCOVR (Version 8.6+main)</a>
at 2026-05-22 16:53:31
</footer>
</main>
</div>
</body>
</html>
develop/gcovr/index.regex_raw_buffer.hpp.77701f68cbde88eced9e7f01d308832b.html
-2242
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_replace.hpp.c4b3d6cdac5c516e993e1b9cc67f4537.html
-1067
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_search.hpp.f27bcdbf1ed1b869adf859f2f255321f.html
-1832
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_split.hpp.79301dd57396b64d102f9beeef6f66e1.html
-1703
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_token_iterator.hpp.a853c95168815fb1dc822438deee2041.html
-3448
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_traits.hpp.d789ddd33a94513158258f47f9458fa9.html
-1708
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_traits_defaults.hpp.0e98adc4b3e9dddef47398f3d8191f7e.html
-9630
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.regex_workaround.hpp.4f4c12e5cddef399d459e91c0f0af974.html
-1677
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.src.25d902c24283ab8cfbac54dfa101ad31.html
-295
View File
@@ -1,295 +0,0 @@
<!DOCTYPE html>
<html class="theme-green">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"/>
<title>src/ - regex</title>
<meta name="viewport" content="width=device-width, initial-scale=1.0"/>
<script>
// Apply theme and font size immediately to prevent flash
(function() {
document.documentElement.classList.add('no-transitions');
var saved = localStorage.getItem('gcovr-theme');
var theme = (saved === 'light' || saved === 'dark') ? saved
: window.matchMedia('(prefers-color-scheme: light)').matches ? 'light' : 'dark';
document.documentElement.setAttribute('data-theme', theme);
document.documentElement.style.backgroundColor = theme === 'light' ? '#ffffff' : '#0d1117';
// Apply flat mode immediately to prevent sidebar flash
if (localStorage.getItem('gcovr-view-mode') === 'flat') {
document.documentElement.classList.add('early-flat-mode');
}
})();
</script>
<link rel="stylesheet" href="index.css"/>
<script src="index.js" charset="UTF-8"></script>
</head>
<body>
<div class="app-container">
<!-- Sidebar -->
<aside class="sidebar" id="sidebar"><script>if(localStorage.getItem('sidebar-collapsed')==='true'){document.currentScript.parentElement.classList.add('collapsed');}else{var sw=localStorage.getItem('gcovr-sidebar-width');if(sw)document.documentElement.style.setProperty('--sidebar-width',sw+'px');}</script>
<div class="sidebar-header">
<div class="sidebar-header-row">
<a href="index.html" class="sidebar-logo" title="Back to index">
<svg viewBox="150 150 700 160" class="boost-wordmark"><path fill="#ffa000" d="M292.45,152.89h-93.18l-46.59,80,12.63,21.69,46.57-79.99h47.07c20.07,0,36.38,16.18,36.38,36.07,0,8.46-3.54,18.29-10.84,22.4,7.11,5.3,10.54,13.73,10.54,22.01,0,19.88-16.32,36.06-36.38,36.06h-61.71l16.12-27.7h45.59c4.66,0,8.45-3.75,8.45-8.36s-3.57-8.16-8.05-8.35c-.13-.02-36.25,0-36.25,0l16.14-27.71s20.22.02,20.31,0c1.9-.06,3.63-.74,5-1.85,1.93-1.53,3.15-3.87,3.15-6.5,0-4.62-3.79-8.37-8.45-8.37h-30.03l-47.04,80.75,17.39,29.85h93.18l46.59-80-46.59-80h0Z"/><path fill="currentColor" d="M550.81,291.93c-9.23,0-17.31-2.01-24.23-6.04s-12.29-9.63-16.1-16.83c-3.81-7.19-5.72-15.4-5.72-24.63s1.9-17.6,5.72-24.79c3.81-7.19,9.18-12.82,16.1-16.91,6.92-4.08,15-6.12,24.23-6.12s17.44,2.04,24.31,6.12,12.21,9.72,16.02,16.91,5.72,15.46,5.72,24.79-1.91,17.44-5.72,24.63-9.15,12.8-16.02,16.83c-6.87,4.02-14.97,6.04-24.31,6.04ZM550.81,272.45c5.37,0,9.79-1.23,13.28-3.7,3.49-2.47,6.12-5.82,7.89-10.06s2.66-8.99,2.66-14.25-.89-10.2-2.66-14.49c-1.77-4.29-4.4-7.7-7.89-10.22-3.49-2.52-7.92-3.78-13.28-3.78s-9.82,1.26-13.36,3.78c-3.54,2.52-6.2,5.93-7.97,10.22-1.77,4.29-2.66,9.12-2.66,14.49s.89,10.01,2.66,14.25c1.77,4.24,4.43,7.59,7.97,10.06s7.99,3.7,13.36,3.7Z"/><path fill="currentColor" d="M648.53,291.93c-9.23,0-17.31-2.01-24.23-6.04s-12.29-9.63-16.1-16.83c-3.81-7.19-5.72-15.4-5.72-24.63s1.9-17.6,5.72-24.79c3.81-7.19,9.18-12.82,16.1-16.91,6.92-4.08,15-6.12,24.23-6.12s17.44,2.04,24.31,6.12,12.21,9.72,16.02,16.91,5.72,15.46,5.72,24.79-1.91,17.44-5.72,24.63-9.15,12.8-16.02,16.83c-6.87,4.02-14.97,6.04-24.31,6.04ZM648.53,272.45c5.37,0,9.79-1.23,13.28-3.7,3.49-2.47,6.12-5.82,7.89-10.06s2.66-8.99,2.66-14.25-.89-10.2-2.66-14.49c-1.77-4.29-4.4-7.7-7.89-10.22-3.49-2.52-7.92-3.78-13.28-3.78s-9.82,1.26-13.36,3.78c-3.54,2.52-6.2,5.93-7.97,10.22-1.77,4.29-2.66,9.12-2.66,14.49s.89,10.01,2.66,14.25c1.77,4.24,4.43,7.59,7.97,10.06s7.99,3.7,13.36,3.7Z"/><path fill="currentColor" d="M722.75,260.85c.54,4.62,2.55,7.86,6.04,9.74s7.49,2.82,11.99,2.82,8.21-.8,11.11-2.41c2.9-1.61,4.35-4.24,4.35-7.89,0-2.25-.99-4-2.98-5.23s-4.56-2.2-7.73-2.9c-3.17-.7-6.66-1.37-10.46-2.01-3.81-.64-7.65-1.5-11.51-2.58-3.86-1.07-7.41-2.58-10.63-4.51-3.22-1.93-5.8-4.53-7.73-7.81-1.93-3.27-2.9-7.49-2.9-12.64,0-4.83,1.55-9.47,4.67-13.93,3.11-4.45,7.49-8.05,13.12-10.79,5.63-2.74,12.1-4.11,19.4-4.11,6.55,0,12.61,1.32,18.19,3.95,5.58,2.63,10.06,6.25,13.44,10.87s5.07,9.98,5.07,16.1h-21.41c-.43-4.61-2.15-7.86-5.15-9.74-3.01-1.88-6.6-2.82-10.79-2.82-4.94,0-8.69.99-11.27,2.98s-3.86,4.48-3.86,7.49c0,2.47.99,4.4,2.98,5.8,1.98,1.4,4.56,2.47,7.73,3.22,3.16.75,6.68,1.42,10.55,2.01,3.86.59,7.7,1.4,11.51,2.42,3.81,1.02,7.33,2.47,10.55,4.35s5.8,4.4,7.73,7.57,2.9,7.27,2.9,12.32c0,5.69-1.56,10.71-4.67,15.05-3.11,4.35-7.49,7.73-13.12,10.14-5.64,2.42-12.26,3.62-19.88,3.62-7.08,0-13.52-1.37-19.32-4.11s-10.44-6.44-13.93-11.11c-3.49-4.67-5.34-9.95-5.55-15.86h21.57,0Z"/><path fill="currentColor" d="M815.48,264.84v-47.29h17.55v-18.35h-17.55v-21.78l-34.42,40.14h12.84v51.81c0,11.05,8.95,20,20,20h21.7v-18.52h-14.12c-3.31,0-6-2.69-6-6h0Z"/><path fill="currentColor" d="M494.62,242.26c-2.36-3.92-5.58-7.03-9.66-9.34-1.08-.61-2.19-1.14-3.33-1.61.7-.44,1.36-.91,1.96-1.45,2.95-2.63,5.1-5.82,6.44-9.58,1.34-3.76,2.01-7.35,2.01-10.79,0-8.69-1.99-15.4-5.96-20.12s-9.31-8.02-16.02-9.9c-6.71-1.88-14.14-2.82-22.3-2.82h-34.29v112.7h40.41c8.16,0,15.59-.99,22.3-2.98,6.71-1.98,12.05-5.45,16.02-10.38,3.97-4.94,5.96-11.7,5.96-20.29,0-5.04-1.18-9.53-3.54-13.44ZM472.48,264.8c-1.88,2.09-4.46,3.52-7.73,4.27-3.28.75-6.9,1.13-10.87,1.13h-18.51v-74.54h12.4c4.08,0,7.73.32,10.95.97,3.22.64,5.77,1.96,7.65,3.95,1.88,1.99,2.82,4.91,2.82,8.77s-.94,6.79-2.82,8.78c-1.88,1.99-4.46,3.3-7.73,3.94-1.87.37-3.86.62-5.96.78l-11.25,19.19h12.46c4.08,0,7.73.35,10.95,1.05,3.22.7,5.77,2.01,7.65,3.94s2.82,4.83,2.82,8.69-.94,7-2.82,9.1v-.02Z"/></svg>
</a>
<button class="sidebar-toggle" id="sidebar-toggle" title="Toggle sidebar">
<svg class="icon-collapse" viewBox="0 0 16 16" fill="currentColor"><path fill-rule="evenodd" d="M11.354 1.646a.5.5 0 0 1 0 .708L5.707 8l5.647 5.646a.5.5 0 0 1-.708.708l-6-6a.5.5 0 0 1 0-.708l6-6a.5.5 0 0 1 .708 0z"/></svg>
<svg class="icon-expand" viewBox="0 0 16 16" fill="currentColor"><path fill-rule="evenodd" d="M4.646 1.646a.5.5 0 0 1 .708 0l6 6a.5.5 0 0 1 0 .708l-6 6a.5.5 0 0 1-.708-.708L10.293 8 4.646 2.354a.5.5 0 0 1 0-.708z"/></svg>
</button>
</div>
<div class="sidebar-title-group">
<span class="sidebar-library">regex</span>
</div>
</div>
<div class="sidebar-search">
<input type="text" id="file-search" placeholder="Search files..." autocomplete="off">
<button class="search-clear" id="search-clear" type="button" aria-label="Clear search">&times;</button>
</div>
<div class="tree-controls">
<button class="tree-control-btn" id="expand-all" title="Expand all">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M8 1a.5.5 0 01.5.5v5h5a.5.5 0 010 1h-5v5a.5.5 0 01-1 0v-5h-5a.5.5 0 010-1h5v-5A.5.5 0 018 1z"/></svg>
Expand
</button>
<button class="tree-control-btn" id="collapse-all" title="Collapse all">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M2 8a.5.5 0 01.5-.5h11a.5.5 0 010 1h-11A.5.5 0 012 8z"/></svg>
Collapse
</button>
</div>
<nav class="sidebar-nav" id="file-tree">
<div class="tree-item ">
<div class="tree-item-header">
<span class="tree-spacer"></span>
<svg class="tree-icon tree-icon-file" viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M3.75 1.5a.25.25 0 00-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 00.25-.25V6h-2.75A1.75 1.75 0 019 4.25V1.5H3.75zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-2.938-2.938zM2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0113.25 16h-9.5A1.75 1.75 0 012 14.25V1.75z"></path></svg>
<a class="tree-label" href="index.posix_api.cpp.cfc7145cfaa87ceb158ee21e8fa5193a.html" title="posix_api.cpp">posix_api.cpp</a>
</div>
</div>
<div class="tree-item ">
<div class="tree-item-header">
<span class="tree-spacer"></span>
<svg class="tree-icon tree-icon-file" viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M3.75 1.5a.25.25 0 00-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 00.25-.25V6h-2.75A1.75 1.75 0 019 4.25V1.5H3.75zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-2.938-2.938zM2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0113.25 16h-9.5A1.75 1.75 0 012 14.25V1.75z"></path></svg>
<a class="tree-label" href="index.wide_posix_api.cpp.5d708c8c14b8fa1710211bdab41e2b13.html" title="wide_posix_api.cpp">wide_posix_api.cpp</a>
</div>
</div>
</nav>
<div class="sidebar-resize-handle" id="sidebar-resize-handle"></div>
</aside>
<!-- Mobile sidebar backdrop -->
<div class="sidebar-backdrop" id="sidebar-backdrop"></div>
<!-- Main Content -->
<main class="main-content">
<header class="main-header">
<button class="mobile-menu-btn" id="mobile-menu-btn" title="Open menu">
<svg viewBox="0 0 16 16" fill="currentColor"><path d="M2.5 12a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5zm0-4a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5zm0-4a.5.5 0 0 1 .5-.5h10a.5.5 0 0 1 0 1H3a.5.5 0 0 1-.5-.5z"/></svg>
</button>
<div class="breadcrumb">
<a href="index.html" class="breadcrumb-home">regex</a><span class="separator">/</span><span class="current" title="src/">src / </span> </div>
<div class="header-actions">
</div>
<div class="view-toggle" id="view-toggle" style="display:none">
<button class="view-btn active" data-view="nested">Nested</button>
<button class="view-btn" data-view="flat">Flat</button>
</div>
<button class="theme-toggle" id="theme-toggle" title="Toggle theme">
<svg class="icon-moon" viewBox="0 0 16 16" fill="currentColor"><path d="M6 .278a.768.768 0 0 1 .08.858 7.208 7.208 0 0 0-.878 3.46c0 4.021 3.278 7.277 7.318 7.277.527 0 1.04-.055 1.533-.16a.787.787 0 0 1 .81.316.733.733 0 0 1-.031.893A8.349 8.349 0 0 1 8.344 16C3.734 16 0 12.286 0 7.71 0 4.266 2.114 1.312 5.124.06A.752.752 0 0 1 6 .278z"/></svg>
<svg class="icon-sun" viewBox="0 0 16 16" fill="currentColor"><path d="M8 12a4 4 0 1 0 0-8 4 4 0 0 0 0 8zM8 0a.5.5 0 0 1 .5.5v2a.5.5 0 0 1-1 0v-2A.5.5 0 0 1 8 0zm0 13a.5.5 0 0 1 .5.5v2a.5.5 0 0 1-1 0v-2A.5.5 0 0 1 8 13zm8-5a.5.5 0 0 1-.5.5h-2a.5.5 0 0 1 0-1h2a.5.5 0 0 1 .5.5zM3 8a.5.5 0 0 1-.5.5h-2a.5.5 0 0 1 0-1h2A.5.5 0 0 1 3 8zm10.657-5.657a.5.5 0 0 1 0 .707l-1.414 1.415a.5.5 0 1 1-.707-.708l1.414-1.414a.5.5 0 0 1 .707 0zm-9.193 9.193a.5.5 0 0 1 0 .707L3.05 13.657a.5.5 0 0 1-.707-.707l1.414-1.414a.5.5 0 0 1 .707 0zm9.193 2.121a.5.5 0 0 1-.707 0l-1.414-1.414a.5.5 0 0 1 .707-.707l1.414 1.414a.5.5 0 0 1 0 .707zM4.464 4.465a.5.5 0 0 1-.707 0L2.343 3.05a.5.5 0 1 1 .707-.707l1.414 1.414a.5.5 0 0 1 0 .708z"/></svg>
</button>
<button class="settings-btn" id="settings-btn" title="Settings">
<svg viewBox="0 0 16 16" width="18" height="18" fill="currentColor"><path d="M8 4.754a3.246 3.246 0 100 6.492 3.246 3.246 0 000-6.492zM5.754 8a2.246 2.246 0 114.492 0 2.246 2.246 0 01-4.492 0z"/><path d="M9.796 1.343c-.527-1.79-3.065-1.79-3.592 0l-.094.319a.873.873 0 01-1.255.52l-.292-.16c-1.64-.892-3.433.902-2.54 2.541l.159.292a.873.873 0 01-.52 1.255l-.319.094c-1.79.527-1.79 3.065 0 3.592l.319.094a.873.873 0 01.52 1.255l-.16.292c-.892 1.64.901 3.434 2.541 2.54l.292-.159a.873.873 0 011.255.52l.094.319c.527 1.79 3.065 1.79 3.592 0l.094-.319a.873.873 0 011.255-.52l.292.16c1.64.893 3.434-.902 2.54-2.541l-.159-.292a.873.873 0 01.52-1.255l.319-.094c1.79-.527 1.79-3.065 0-3.592l-.319-.094a.873.873 0 01-.52-1.255l.16-.292c.893-1.64-.902-3.433-2.541-2.54l-.292.159a.873.873 0 01-1.255-.52l-.094-.319zm-2.633.283c.246-.835 1.428-.835 1.674 0l.094.319a1.873 1.873 0 002.693 1.115l.291-.16c.764-.415 1.6.42 1.184 1.185l-.159.292a1.873 1.873 0 001.116 2.692l.318.094c.835.246.835 1.428 0 1.674l-.319.094a1.873 1.873 0 00-1.115 2.693l.16.291c.415.764-.421 1.6-1.185 1.184l-.291-.159a1.873 1.873 0 00-2.693 1.116l-.094.318c-.246.835-1.428.835-1.674 0l-.094-.319a1.873 1.873 0 00-2.692-1.115l-.292.16c-.764.415-1.6-.421-1.184-1.185l.159-.291A1.873 1.873 0 001.945 8.93l-.319-.094c-.835-.246-.835-1.428 0-1.674l.319-.094A1.873 1.873 0 003.06 4.377l-.16-.292c-.415-.764.42-1.6 1.185-1.184l.292.159a1.873 1.873 0 002.692-1.115l.094-.319z"/></svg>
</button>
<div class="settings-dropdown" id="settings-dropdown"></div>
</header>
<div class="content-wrapper">
<section class="summary-section">
<div class="summary-cards">
<div class="summary-card">
<div class="summary-card-header">
<h3>Lines</h3>
</div>
<div class="summary-card-body">
<div class="coverage-ring coverage-medium">
<svg viewBox="0 0 36 36">
<path class="ring-bg" d="M18 2.0845 a 15.9155 15.9155 0 0 1 0 31.831 a 15.9155 15.9155 0 0 1 0 -31.831"/>
<path class="ring-fill" stroke-dasharray="89.4, 100" d="M18 2.0845 a 15.9155 15.9155 0 0 1 0 31.831 a 15.9155 15.9155 0 0 1 0 -31.831"/>
</svg>
<span class="ring-text">89.4%</span>
</div>
<div class="summary-stats">
<div class="stat-row">
<span class="stat-label">Hit</span>
<span class="stat-value">6554</span>
</div>
<div class="stat-row">
<span class="stat-label">Total</span>
<span class="stat-value">7330</span>
</div>
</div>
</div>
</div>
<div class="summary-card">
<div class="summary-card-header">
<h3>Functions</h3>
</div>
<div class="summary-card-body">
<div class="coverage-ring coverage-low">
<svg viewBox="0 0 36 36">
<path class="ring-bg" d="M18 2.0845 a 15.9155 15.9155 0 0 1 0 31.831 a 15.9155 15.9155 0 0 1 0 -31.831"/>
<path class="ring-fill" stroke-dasharray="59.3, 100" d="M18 2.0845 a 15.9155 15.9155 0 0 1 0 31.831 a 15.9155 15.9155 0 0 1 0 -31.831"/>
</svg>
<span class="ring-text">59.3%</span>
</div>
<div class="summary-stats">
<div class="stat-row">
<span class="stat-label">Hit</span>
<span class="stat-value">4210</span>
</div>
<div class="stat-row">
<span class="stat-label">Total</span>
<span class="stat-value">7115</span>
</div>
</div>
</div>
</div>
</div>
<div class="coverage-legend">
<span class="legend-item coverage-high">High: &ge; 90.0%</span>
<span class="legend-item coverage-medium">Medium: &ge; 75.0%</span>
<span class="legend-item coverage-low">Low: &lt; 75.0%</span>
<span class="legend-separator"></span>
<a href="index.functions.html" class="legend-item legend-functions-link" title="List of all functions">
<span class="fx-icon" aria-hidden="true"><i>f</i>(x)</span>
List of functions
</a>
</div> </section>
<section class="main-section">
<div class="file-list-container no-branches no-conditions no-decisions no-calls">
<div class="file-list-header">
<div class="col-name sortable sorted-ascending" data-sort="filename">
Name
</div>
<div class="col-coverage sortable" data-sort="coverage">
Coverage
</div>
<div class="col-lines sortable" data-sort="lines">
Lines
</div>
<div class="col-functions sortable" data-sort="functions">
Functions
</div>
</div>
<div class="file-list-body" id="file-list">
<div class="file-row file"
data-filename="posix_api.cpp"
data-coverage="72.6"
data-lines="113"
data-lines-exec="82"
data-lines-coverage="72.6"
data-lines-class="coverage-low"
data-functions="100.0"
data-functions-coverage="100.0"
data-functions-class="coverage-high"
data-branches="-"
data-branches-coverage="-"
data-branches-class="coverage-unknown"
data-conditions="-"
data-conditions-coverage="-"
data-conditions-class="coverage-unknown"
data-decisions="-"
data-decisions-coverage="-"
data-decisions-class="coverage-unknown"
data-calls="57.7"
data-calls-coverage="57.7"
data-calls-class="coverage-low"
data-diff="UNDEFINED">
<div class="col-name">
<span class="file-icon">
<svg viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M3.75 1.5a.25.25 0 00-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 00.25-.25V6h-2.75A1.75 1.75 0 019 4.25V1.5H3.75zm6.75.062V4.25c0 .138.112.25.25.25h2.688a.252.252 0 00-.011-.013l-2.914-2.914a.272.272 0 00-.013-.011zM2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0113.25 16h-9.5A1.75 1.75 0 012 14.25V1.75z"></path></svg>
</span>
<a href="index.posix_api.cpp.cfc7145cfaa87ceb158ee21e8fa5193a.html" title="posix_api.cpp">posix_api.cpp</a>
</div>
<div class="col-coverage">
<div class="coverage-bar-container">
<div class="coverage-bar coverage-low" style="width: 72.6%"></div>
</div>
<span class="coverage-percent coverage-low">72.6%</span>
</div>
<div class="col-lines">
<span class="stat-value">82</span>
<span class="stat-separator">/</span>
<span class="stat-total">113</span>
</div>
<div class="col-functions">
<span class="stat-value coverage-high">100.0%</span>
</div>
</div>
<div class="file-row file"
data-filename="wide_posix_api.cpp"
data-coverage="74.3"
data-lines="109"
data-lines-exec="81"
data-lines-coverage="74.3"
data-lines-class="coverage-low"
data-functions="100.0"
data-functions-coverage="100.0"
data-functions-class="coverage-high"
data-branches="-"
data-branches-coverage="-"
data-branches-class="coverage-unknown"
data-conditions="-"
data-conditions-coverage="-"
data-conditions-class="coverage-unknown"
data-decisions="-"
data-decisions-coverage="-"
data-decisions-class="coverage-unknown"
data-calls="58.9"
data-calls-coverage="58.9"
data-calls-class="coverage-low"
data-diff="UNDEFINED">
<div class="col-name">
<span class="file-icon">
<svg viewBox="0 0 16 16" width="16" height="16"><path fill="currentColor" d="M3.75 1.5a.25.25 0 00-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 00.25-.25V6h-2.75A1.75 1.75 0 019 4.25V1.5H3.75zm6.75.062V4.25c0 .138.112.25.25.25h2.688a.252.252 0 00-.011-.013l-2.914-2.914a.272.272 0 00-.013-.011zM2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0113.25 16h-9.5A1.75 1.75 0 012 14.25V1.75z"></path></svg>
</span>
<a href="index.wide_posix_api.cpp.5d708c8c14b8fa1710211bdab41e2b13.html" title="wide_posix_api.cpp">wide_posix_api.cpp</a>
</div>
<div class="col-coverage">
<div class="coverage-bar-container">
<div class="coverage-bar coverage-low" style="width: 74.3%"></div>
</div>
<span class="coverage-percent coverage-low">74.3%</span>
</div>
<div class="col-lines">
<span class="stat-value">81</span>
<span class="stat-separator">/</span>
<span class="stat-total">109</span>
</div>
<div class="col-functions">
<span class="stat-value coverage-high">100.0%</span>
</div>
</div>
</div>
</div> </section>
</div>
<footer class="main-footer">
Created using <a href="http://gcovr.com/en/main">GCOVR (Version 8.6+main)</a>
at 2026-05-22 16:53:31
</footer>
</main>
</div>
</body>
</html>
develop/gcovr/index.sub_match.hpp.8759274a22f6d7afc27afd16b4ac0c35.html
-5781
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.u32regex_iterator.hpp.cad511ff9f518ed5712544f4e2df17c3.html
-2855
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.u32regex_token_iterator.hpp.b0c5226fc9ad02ba0b06216e9824edae.html
-4104
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.unicode_iterator.hpp.6391a069c7ef3c1dd9a38df9254be88f.html
-11144
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/index.wide_posix_api.cpp.5d708c8c14b8fa1710211bdab41e2b13.html
-2985
View File
File diff suppressed because it is too large Load Diff
develop/gcovr/summary.json
-423
View File
@@ -1,423 +0,0 @@
{
"root": "../../boost-root",
"gcovr/summary_format_version": "0.6",
"files": [
{
"filename": "include/boost/regex/v5/basic_regex.hpp",
"line_total": 205,
"line_covered": 200,
"line_percent": 97.6,
"function_total": 352,
"function_covered": 341,
"function_percent": 96.9,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/basic_regex_creator.hpp",
"line_total": 806,
"line_covered": 793,
"line_percent": 98.4,
"function_total": 371,
"function_covered": 331,
"function_percent": 89.2,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/basic_regex_parser.hpp",
"line_total": 1796,
"line_covered": 1582,
"line_percent": 88.1,
"function_total": 239,
"function_covered": 200,
"function_percent": 83.7,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/c_regex_traits.hpp",
"line_total": 167,
"line_covered": 134,
"line_percent": 80.2,
"function_total": 20,
"function_covered": 20,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/cpp_regex_traits.hpp",
"line_total": 342,
"line_covered": 211,
"line_percent": 61.7,
"function_total": 81,
"function_covered": 72,
"function_percent": 88.9,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/icu.hpp",
"line_total": 371,
"line_covered": 310,
"line_percent": 83.6,
"function_total": 192,
"function_covered": 97,
"function_percent": 50.5,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/match_flags.hpp",
"line_total": 10,
"line_covered": 10,
"line_percent": 100.0,
"function_total": 5,
"function_covered": 5,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/match_results.hpp",
"line_total": 307,
"line_covered": 273,
"line_percent": 88.9,
"function_total": 771,
"function_covered": 471,
"function_percent": 61.1,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/mem_block_cache.hpp",
"line_total": 29,
"line_covered": 29,
"line_percent": 100.0,
"function_total": 8,
"function_covered": 8,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/object_cache.hpp",
"line_total": 44,
"line_covered": 42,
"line_percent": 95.5,
"function_total": 6,
"function_covered": 6,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/pattern_except.hpp",
"line_total": 20,
"line_covered": 17,
"line_percent": 85.0,
"function_total": 14,
"function_covered": 6,
"function_percent": 42.9,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/perl_matcher.hpp",
"line_total": 137,
"line_covered": 134,
"line_percent": 97.8,
"function_total": 356,
"function_covered": 221,
"function_percent": 62.1,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/perl_matcher_common.hpp",
"line_total": 416,
"line_covered": 399,
"line_percent": 95.9,
"function_total": 1055,
"function_covered": 477,
"function_percent": 45.2,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/perl_matcher_non_recursive.hpp",
"line_total": 910,
"line_covered": 873,
"line_percent": 95.9,
"function_total": 1910,
"function_covered": 930,
"function_percent": 48.7,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/primary_transform.hpp",
"line_total": 31,
"line_covered": 17,
"line_percent": 54.8,
"function_total": 8,
"function_covered": 6,
"function_percent": 75.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_format.hpp",
"line_total": 420,
"line_covered": 403,
"line_percent": 96.0,
"function_total": 458,
"function_covered": 196,
"function_percent": 42.8,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_grep.hpp",
"line_total": 26,
"line_covered": 23,
"line_percent": 88.5,
"function_total": 10,
"function_covered": 10,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_iterator.hpp",
"line_total": 48,
"line_covered": 48,
"line_percent": 100.0,
"function_total": 242,
"function_covered": 152,
"function_percent": 62.8,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_match.hpp",
"line_total": 20,
"line_covered": 20,
"line_percent": 100.0,
"function_total": 28,
"function_covered": 20,
"function_percent": 71.4,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_merge.hpp",
"line_total": 2,
"line_covered": 2,
"line_percent": 100.0,
"function_total": 1,
"function_covered": 1,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_raw_buffer.hpp",
"line_total": 45,
"line_covered": 45,
"line_percent": 100.0,
"function_total": 9,
"function_covered": 9,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_replace.hpp",
"line_total": 25,
"line_covered": 24,
"line_percent": 96.0,
"function_total": 12,
"function_covered": 12,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_search.hpp",
"line_total": 23,
"line_covered": 21,
"line_percent": 91.3,
"function_total": 65,
"function_covered": 50,
"function_percent": 76.9,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_split.hpp",
"line_total": 38,
"line_covered": 37,
"line_percent": 97.4,
"function_total": 9,
"function_covered": 9,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_token_iterator.hpp",
"line_total": 98,
"line_covered": 96,
"line_percent": 98.0,
"function_total": 89,
"function_covered": 88,
"function_percent": 98.9,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_traits.hpp",
"line_total": 18,
"line_covered": 18,
"line_percent": 100.0,
"function_total": 32,
"function_covered": 31,
"function_percent": 96.9,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_traits_defaults.hpp",
"line_total": 86,
"line_covered": 83,
"line_percent": 96.5,
"function_total": 42,
"function_covered": 38,
"function_percent": 90.5,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/regex_workaround.hpp",
"line_total": 6,
"line_covered": 5,
"line_percent": 83.3,
"function_total": 1,
"function_covered": 1,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/sub_match.hpp",
"line_total": 166,
"line_covered": 162,
"line_percent": 97.6,
"function_total": 207,
"function_covered": 150,
"function_percent": 72.5,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/u32regex_iterator.hpp",
"line_total": 55,
"line_covered": 49,
"line_percent": 89.1,
"function_total": 90,
"function_covered": 27,
"function_percent": 30.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/u32regex_token_iterator.hpp",
"line_total": 113,
"line_covered": 43,
"line_percent": 38.1,
"function_total": 97,
"function_covered": 12,
"function_percent": 12.4,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "include/boost/regex/v5/unicode_iterator.hpp",
"line_total": 328,
"line_covered": 288,
"line_percent": 87.8,
"function_total": 314,
"function_covered": 205,
"function_percent": 65.3,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "src/posix_api.cpp",
"line_total": 113,
"line_covered": 82,
"line_percent": 72.6,
"function_total": 4,
"function_covered": 4,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
},
{
"filename": "src/wide_posix_api.cpp",
"line_total": 109,
"line_covered": 81,
"line_percent": 74.3,
"function_total": 4,
"function_covered": 4,
"function_percent": 100.0,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": null
}
],
"line_total": 7330,
"line_covered": 6554,
"line_percent": 89.4,
"function_total": 7102,
"function_covered": 4210,
"function_percent": 59.3,
"branch_total": 0,
"branch_covered": 0,
"branch_percent": 0.0
}
develop/gcovr/tree.json
-631
View File
@@ -1,631 +0,0 @@
[
{
"name": "include",
"coverage": "89.9",
"coverageClass": "coverage-medium",
"linesTotal": "7108",
"linesExec": "6391",
"linesCoverage": "89.9",
"linesClass": "coverage-medium",
"functionsCoverage": "59.2",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": true,
"link": "index.include.d436eb0fd9de10b54a828ce6435f7e81.html",
"children": [
{
"name": "boost",
"coverage": "",
"coverageClass": "coverage-unknown",
"linesTotal": "",
"linesExec": "",
"linesCoverage": "",
"linesClass": "",
"functionsCoverage": "",
"functionsClass": "",
"branchesCoverage": "",
"branchesClass": "",
"isDirectory": true,
"link": null,
"children": [
{
"name": "regex",
"coverage": "",
"coverageClass": "coverage-unknown",
"linesTotal": "",
"linesExec": "",
"linesCoverage": "",
"linesClass": "",
"functionsCoverage": "",
"functionsClass": "",
"branchesCoverage": "",
"branchesClass": "",
"isDirectory": true,
"link": null,
"children": [
{
"name": "v5",
"coverage": "",
"coverageClass": "coverage-unknown",
"linesTotal": "",
"linesExec": "",
"linesCoverage": "",
"linesClass": "",
"functionsCoverage": "",
"functionsClass": "",
"branchesCoverage": "",
"branchesClass": "",
"isDirectory": true,
"link": null,
"children": [
{
"name": "basic_regex.hpp",
"coverage": "97.6",
"coverageClass": "coverage-high",
"linesTotal": "205",
"linesExec": "200",
"linesCoverage": "97.6",
"linesClass": "coverage-high",
"functionsCoverage": "96.9",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.basic_regex.hpp.fc7ae442ee1c3ba72f0c8efe27e0d4a0.html",
"children": []
},
{
"name": "basic_regex_creator.hpp",
"coverage": "98.4",
"coverageClass": "coverage-high",
"linesTotal": "806",
"linesExec": "793",
"linesCoverage": "98.4",
"linesClass": "coverage-high",
"functionsCoverage": "89.2",
"functionsClass": "coverage-medium",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.basic_regex_creator.hpp.ddc38b9ace9f1fce2474b7a8aa072758.html",
"children": []
},
{
"name": "basic_regex_parser.hpp",
"coverage": "88.1",
"coverageClass": "coverage-medium",
"linesTotal": "1796",
"linesExec": "1582",
"linesCoverage": "88.1",
"linesClass": "coverage-medium",
"functionsCoverage": "83.7",
"functionsClass": "coverage-medium",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.basic_regex_parser.hpp.3d312756fa15eb91f18ce74346527498.html",
"children": []
},
{
"name": "c_regex_traits.hpp",
"coverage": "80.2",
"coverageClass": "coverage-medium",
"linesTotal": "167",
"linesExec": "134",
"linesCoverage": "80.2",
"linesClass": "coverage-medium",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.c_regex_traits.hpp.4a312148ed0fde78796e7f563ab76c8c.html",
"children": []
},
{
"name": "cpp_regex_traits.hpp",
"coverage": "61.7",
"coverageClass": "coverage-low",
"linesTotal": "342",
"linesExec": "211",
"linesCoverage": "61.7",
"linesClass": "coverage-low",
"functionsCoverage": "88.9",
"functionsClass": "coverage-medium",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.cpp_regex_traits.hpp.065ad3525ef9ac006d863057e1e02b79.html",
"children": []
},
{
"name": "icu.hpp",
"coverage": "83.6",
"coverageClass": "coverage-medium",
"linesTotal": "371",
"linesExec": "310",
"linesCoverage": "83.6",
"linesClass": "coverage-medium",
"functionsCoverage": "50.5",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.icu.hpp.85a0eeb0fabef296bfc4997ff2ba1c10.html",
"children": []
},
{
"name": "match_flags.hpp",
"coverage": "100.0",
"coverageClass": "coverage-high",
"linesTotal": "10",
"linesExec": "10",
"linesCoverage": "100.0",
"linesClass": "coverage-high",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.match_flags.hpp.1af065f3f48dd91d0fe78746fcc481f7.html",
"children": []
},
{
"name": "match_results.hpp",
"coverage": "88.9",
"coverageClass": "coverage-medium",
"linesTotal": "307",
"linesExec": "273",
"linesCoverage": "88.9",
"linesClass": "coverage-medium",
"functionsCoverage": "61.1",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.match_results.hpp.6f836c49889c34cb37b399542baf9aad.html",
"children": []
},
{
"name": "mem_block_cache.hpp",
"coverage": "100.0",
"coverageClass": "coverage-high",
"linesTotal": "29",
"linesExec": "29",
"linesCoverage": "100.0",
"linesClass": "coverage-high",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.mem_block_cache.hpp.774760178b61a39a431f88e157dbeb00.html",
"children": []
},
{
"name": "object_cache.hpp",
"coverage": "95.5",
"coverageClass": "coverage-high",
"linesTotal": "44",
"linesExec": "42",
"linesCoverage": "95.5",
"linesClass": "coverage-high",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.object_cache.hpp.4205d672d499c4d505efbd5c4c18a6d7.html",
"children": []
},
{
"name": "pattern_except.hpp",
"coverage": "85.0",
"coverageClass": "coverage-medium",
"linesTotal": "20",
"linesExec": "17",
"linesCoverage": "85.0",
"linesClass": "coverage-medium",
"functionsCoverage": "42.9",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.pattern_except.hpp.b02995306146a84a816c726ffb2330d1.html",
"children": []
},
{
"name": "perl_matcher.hpp",
"coverage": "97.8",
"coverageClass": "coverage-high",
"linesTotal": "137",
"linesExec": "134",
"linesCoverage": "97.8",
"linesClass": "coverage-high",
"functionsCoverage": "62.1",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.perl_matcher.hpp.06d9b87b6156807b3cf2c759c3470f4c.html",
"children": []
},
{
"name": "perl_matcher_common.hpp",
"coverage": "95.9",
"coverageClass": "coverage-high",
"linesTotal": "416",
"linesExec": "399",
"linesCoverage": "95.9",
"linesClass": "coverage-high",
"functionsCoverage": "45.2",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.perl_matcher_common.hpp.a80be6e3c2e730ca65c745979c0f2c25.html",
"children": []
},
{
"name": "perl_matcher_non_recursive.hpp",
"coverage": "95.9",
"coverageClass": "coverage-high",
"linesTotal": "910",
"linesExec": "873",
"linesCoverage": "95.9",
"linesClass": "coverage-high",
"functionsCoverage": "48.7",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.perl_matcher_non_recursive.hpp.dab741f714b85b31fb79aec3a5169121.html",
"children": []
},
{
"name": "primary_transform.hpp",
"coverage": "54.8",
"coverageClass": "coverage-low",
"linesTotal": "31",
"linesExec": "17",
"linesCoverage": "54.8",
"linesClass": "coverage-low",
"functionsCoverage": "75.0",
"functionsClass": "coverage-medium",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.primary_transform.hpp.f5a3fa617cbe44ea611e82cf685be5de.html",
"children": []
},
{
"name": "regex_format.hpp",
"coverage": "96.0",
"coverageClass": "coverage-high",
"linesTotal": "420",
"linesExec": "403",
"linesCoverage": "96.0",
"linesClass": "coverage-high",
"functionsCoverage": "42.8",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_format.hpp.cbfb4d559693198023d36b54c0718da8.html",
"children": []
},
{
"name": "regex_grep.hpp",
"coverage": "88.5",
"coverageClass": "coverage-medium",
"linesTotal": "26",
"linesExec": "23",
"linesCoverage": "88.5",
"linesClass": "coverage-medium",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_grep.hpp.136157ec6043ed61e9e3c53cbca56207.html",
"children": []
},
{
"name": "regex_iterator.hpp",
"coverage": "100.0",
"coverageClass": "coverage-high",
"linesTotal": "48",
"linesExec": "48",
"linesCoverage": "100.0",
"linesClass": "coverage-high",
"functionsCoverage": "62.8",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_iterator.hpp.ec4c2b3efdca8342ebcbd87d33ac2551.html",
"children": []
},
{
"name": "regex_match.hpp",
"coverage": "100.0",
"coverageClass": "coverage-high",
"linesTotal": "20",
"linesExec": "20",
"linesCoverage": "100.0",
"linesClass": "coverage-high",
"functionsCoverage": "71.4",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_match.hpp.52d49d2882a598bc100172b30fdc9d28.html",
"children": []
},
{
"name": "regex_merge.hpp",
"coverage": "100.0",
"coverageClass": "coverage-high",
"linesTotal": "2",
"linesExec": "2",
"linesCoverage": "100.0",
"linesClass": "coverage-high",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_merge.hpp.33d760b7953f0b4898c72299d831fc8c.html",
"children": []
},
{
"name": "regex_raw_buffer.hpp",
"coverage": "100.0",
"coverageClass": "coverage-high",
"linesTotal": "45",
"linesExec": "45",
"linesCoverage": "100.0",
"linesClass": "coverage-high",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_raw_buffer.hpp.77701f68cbde88eced9e7f01d308832b.html",
"children": []
},
{
"name": "regex_replace.hpp",
"coverage": "96.0",
"coverageClass": "coverage-high",
"linesTotal": "25",
"linesExec": "24",
"linesCoverage": "96.0",
"linesClass": "coverage-high",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_replace.hpp.c4b3d6cdac5c516e993e1b9cc67f4537.html",
"children": []
},
{
"name": "regex_search.hpp",
"coverage": "91.3",
"coverageClass": "coverage-high",
"linesTotal": "23",
"linesExec": "21",
"linesCoverage": "91.3",
"linesClass": "coverage-high",
"functionsCoverage": "76.9",
"functionsClass": "coverage-medium",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_search.hpp.f27bcdbf1ed1b869adf859f2f255321f.html",
"children": []
},
{
"name": "regex_split.hpp",
"coverage": "97.4",
"coverageClass": "coverage-high",
"linesTotal": "38",
"linesExec": "37",
"linesCoverage": "97.4",
"linesClass": "coverage-high",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_split.hpp.79301dd57396b64d102f9beeef6f66e1.html",
"children": []
},
{
"name": "regex_token_iterator.hpp",
"coverage": "98.0",
"coverageClass": "coverage-high",
"linesTotal": "98",
"linesExec": "96",
"linesCoverage": "98.0",
"linesClass": "coverage-high",
"functionsCoverage": "98.9",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_token_iterator.hpp.a853c95168815fb1dc822438deee2041.html",
"children": []
},
{
"name": "regex_traits.hpp",
"coverage": "100.0",
"coverageClass": "coverage-high",
"linesTotal": "18",
"linesExec": "18",
"linesCoverage": "100.0",
"linesClass": "coverage-high",
"functionsCoverage": "96.9",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_traits.hpp.d789ddd33a94513158258f47f9458fa9.html",
"children": []
},
{
"name": "regex_traits_defaults.hpp",
"coverage": "96.5",
"coverageClass": "coverage-high",
"linesTotal": "86",
"linesExec": "83",
"linesCoverage": "96.5",
"linesClass": "coverage-high",
"functionsCoverage": "90.5",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_traits_defaults.hpp.0e98adc4b3e9dddef47398f3d8191f7e.html",
"children": []
},
{
"name": "regex_workaround.hpp",
"coverage": "83.3",
"coverageClass": "coverage-medium",
"linesTotal": "6",
"linesExec": "5",
"linesCoverage": "83.3",
"linesClass": "coverage-medium",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.regex_workaround.hpp.4f4c12e5cddef399d459e91c0f0af974.html",
"children": []
},
{
"name": "sub_match.hpp",
"coverage": "97.6",
"coverageClass": "coverage-high",
"linesTotal": "166",
"linesExec": "162",
"linesCoverage": "97.6",
"linesClass": "coverage-high",
"functionsCoverage": "72.5",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.sub_match.hpp.8759274a22f6d7afc27afd16b4ac0c35.html",
"children": []
},
{
"name": "u32regex_iterator.hpp",
"coverage": "89.1",
"coverageClass": "coverage-medium",
"linesTotal": "55",
"linesExec": "49",
"linesCoverage": "89.1",
"linesClass": "coverage-medium",
"functionsCoverage": "30.0",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.u32regex_iterator.hpp.cad511ff9f518ed5712544f4e2df17c3.html",
"children": []
},
{
"name": "u32regex_token_iterator.hpp",
"coverage": "38.1",
"coverageClass": "coverage-low",
"linesTotal": "113",
"linesExec": "43",
"linesCoverage": "38.1",
"linesClass": "coverage-low",
"functionsCoverage": "12.4",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.u32regex_token_iterator.hpp.b0c5226fc9ad02ba0b06216e9824edae.html",
"children": []
},
{
"name": "unicode_iterator.hpp",
"coverage": "87.8",
"coverageClass": "coverage-medium",
"linesTotal": "328",
"linesExec": "288",
"linesCoverage": "87.8",
"linesClass": "coverage-medium",
"functionsCoverage": "65.3",
"functionsClass": "coverage-low",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.unicode_iterator.hpp.6391a069c7ef3c1dd9a38df9254be88f.html",
"children": []
}
]
}
]
}
]
}
]
},
{
"name": "src",
"coverage": "73.4",
"coverageClass": "coverage-low",
"linesTotal": "222",
"linesExec": "163",
"linesCoverage": "73.4",
"linesClass": "coverage-low",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": true,
"link": "index.src.25d902c24283ab8cfbac54dfa101ad31.html",
"children": [
{
"name": "posix_api.cpp",
"coverage": "72.6",
"coverageClass": "coverage-low",
"linesTotal": "113",
"linesExec": "82",
"linesCoverage": "72.6",
"linesClass": "coverage-low",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.posix_api.cpp.cfc7145cfaa87ceb158ee21e8fa5193a.html",
"children": []
},
{
"name": "wide_posix_api.cpp",
"coverage": "74.3",
"coverageClass": "coverage-low",
"linesTotal": "109",
"linesExec": "81",
"linesCoverage": "74.3",
"linesClass": "coverage-low",
"functionsCoverage": "100.0",
"functionsClass": "coverage-high",
"branchesCoverage": "-",
"branchesClass": "coverage-unknown",
"isDirectory": false,
"link": "index.wide_posix_api.cpp.5d708c8c14b8fa1710211bdab41e2b13.html",
"children": []
}
]
}
]
develop/index.html
-8
View File
@@ -1,8 +0,0 @@
<html>
<head>
<meta http-equiv="refresh" content="0; url=./gcovr/index.html">
</head>
<body>
</body>
</html>
include/boost/cregex.hpp
+39
View File
@@ -0,0 +1,39 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org/libs/regex for most recent version.
* FILE cregex.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares POSIX API functions
* + boost::RegEx high level wrapper.
*/
#ifndef BOOST_RE_CREGEX_HPP
#define BOOST_RE_CREGEX_HPP
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#include <boost/regex/v4/cregex.hpp>
#endif /* include guard */
include/boost/regex.h
+100
View File
@@ -0,0 +1,100 @@
/*
*
* Copyright (c) 1998-2000
* Dr 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)
*
*/
/*
* LOCATION: see http://www.boost.org/libs/regex for documentation.
* FILE regex.h
* VERSION 3.12
* DESCRIPTION: Declares POSIX API functions
*/
#ifndef BOOST_RE_REGEX_H
#define BOOST_RE_REGEX_H
#include <boost/cregex.hpp>
/*
* add using declarations to bring POSIX API functions into
* global scope, only if this is C++ (and not C).
*/
#ifdef __cplusplus
using boost::regoff_t;
using boost::regex_tA;
using boost::regmatch_t;
using boost::REG_BASIC;
using boost::REG_EXTENDED;
using boost::REG_ICASE;
using boost::REG_NOSUB;
using boost::REG_NEWLINE;
using boost::REG_NOSPEC;
using boost::REG_PEND;
using boost::REG_DUMP;
using boost::REG_NOCOLLATE;
using boost::REG_ESCAPE_IN_LISTS;
using boost::REG_NEWLINE_ALT;
using boost::REG_PERL;
using boost::REG_AWK;
using boost::REG_GREP;
using boost::REG_EGREP;
using boost::REG_ASSERT;
using boost::REG_INVARG;
using boost::REG_ATOI;
using boost::REG_ITOA;
using boost::REG_NOTBOL;
using boost::REG_NOTEOL;
using boost::REG_STARTEND;
using boost::reg_comp_flags;
using boost::reg_exec_flags;
using boost::regcompA;
using boost::regerrorA;
using boost::regexecA;
using boost::regfreeA;
#ifndef BOOST_NO_WREGEX
using boost::regcompW;
using boost::regerrorW;
using boost::regexecW;
using boost::regfreeW;
using boost::regex_tW;
#endif
using boost::REG_NOERROR;
using boost::REG_NOMATCH;
using boost::REG_BADPAT;
using boost::REG_ECOLLATE;
using boost::REG_ECTYPE;
using boost::REG_EESCAPE;
using boost::REG_ESUBREG;
using boost::REG_EBRACK;
using boost::REG_EPAREN;
using boost::REG_EBRACE;
using boost::REG_BADBR;
using boost::REG_ERANGE;
using boost::REG_ESPACE;
using boost::REG_BADRPT;
using boost::REG_EEND;
using boost::REG_ESIZE;
using boost::REG_ERPAREN;
using boost::REG_EMPTY;
using boost::REG_E_MEMORY;
using boost::REG_E_UNKNOWN;
using boost::reg_errcode_t;
#endif /* __cplusplus */
#endif /* BOOST_RE_REGEX_H */
include/boost/regex.hpp
+37
View File
@@ -0,0 +1,37 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org/libs/regex for documentation.
* FILE regex.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares boost::basic_regex<> and associated
* functions and classes. This header is the main
* entry point for the template regex code.
*/
/* start with C compatibility API */
#ifndef BOOST_RE_REGEX_HPP
#define BOOST_RE_REGEX_HPP
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#include <boost/regex/v4/regex.hpp>
#endif // include
include/boost/regex/concepts.hpp
+855
View File
@@ -0,0 +1,855 @@
/*
*
* Copyright (c) 2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE concepts.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares regular expression concepts.
*/
#ifndef BOOST_REGEX_CONCEPTS_HPP_INCLUDED
#define BOOST_REGEX_CONCEPTS_HPP_INCLUDED
#include <boost/concept_archetype.hpp>
#include <boost/concept_check.hpp>
#include <boost/type_traits/is_enum.hpp>
#include <boost/type_traits/is_base_and_derived.hpp>
#include <boost/static_assert.hpp>
#ifndef BOOST_TEST_TR1_REGEX
#include <boost/regex.hpp>
#endif
#include <bitset>
#include <vector>
#include <iostream>
namespace boost{
//
// bitmask_archetype:
// this can be either an integer type, an enum, or a std::bitset,
// we use the latter as the architype as it offers the "strictest"
// of the possible interfaces:
//
typedef std::bitset<512> bitmask_archetype;
//
// char_architype:
// A strict model for the character type interface.
//
struct char_architype
{
// default constructable:
char_architype();
// copy constructable / assignable:
char_architype(const char_architype&);
char_architype& operator=(const char_architype&);
// constructable from an integral value:
char_architype(unsigned long val);
// comparable:
bool operator==(const char_architype&)const;
bool operator!=(const char_architype&)const;
bool operator<(const char_architype&)const;
bool operator<=(const char_architype&)const;
bool operator>=(const char_architype&)const;
bool operator>(const char_architype&)const;
// conversion to integral type:
operator long()const;
};
//
// char_architype can not be used with basic_string:
//
} // namespace boost
namespace std{
template<> struct char_traits<boost::char_architype>{};
}
namespace boost{
//
// regex_traits_architype:
// A strict interpretation of the regular expression traits class requirements.
//
template <class charT>
struct regex_traits_architype
{
public:
regex_traits_architype();
typedef charT char_type;
typedef std::size_t size_type;
typedef std::vector<char_type> string_type;
typedef copy_constructible_archetype<assignable_archetype<> > locale_type;
typedef bitmask_archetype char_class_type;
static size_type length(const char_type* ) { return 0; }
charT translate(charT ) const { return charT(); }
charT translate_nocase(charT ) const { return static_object<charT>::get(); }
template <class ForwardIterator>
string_type transform(ForwardIterator , ForwardIterator ) const
{ return static_object<string_type>::get(); }
template <class ForwardIterator>
string_type transform_primary(ForwardIterator , ForwardIterator ) const
{ return static_object<string_type>::get(); }
template <class ForwardIterator>
char_class_type lookup_classname(ForwardIterator , ForwardIterator ) const
{ return static_object<char_class_type>::get(); }
template <class ForwardIterator>
string_type lookup_collatename(ForwardIterator , ForwardIterator ) const
{ return static_object<string_type>::get(); }
bool isctype(charT, char_class_type) const
{ return false; }
int value(charT, int) const
{ return 0; }
locale_type imbue(locale_type l)
{ return l; }
locale_type getloc()const
{ return static_object<locale_type>::get(); }
private:
// this type is not copyable:
regex_traits_architype(const regex_traits_architype&);
regex_traits_architype& operator=(const regex_traits_architype&);
};
//
// alter this to std::tr1, to test a std implementation:
//
#ifndef BOOST_TEST_TR1_REGEX
namespace global_regex_namespace = ::boost;
#else
namespace global_regex_namespace = ::std::tr1;
#endif
template <class Bitmask>
struct BitmaskConcept
{
void constraints()
{
function_requires<CopyConstructibleConcept<Bitmask> >();
function_requires<AssignableConcept<Bitmask> >();
m_mask1 = m_mask2 | m_mask3;
m_mask1 = m_mask2 & m_mask3;
m_mask1 = m_mask2 ^ m_mask3;
m_mask1 = ~m_mask2;
m_mask1 |= m_mask2;
m_mask1 &= m_mask2;
m_mask1 ^= m_mask2;
}
Bitmask m_mask1, m_mask2, m_mask3;
};
template <class traits>
struct RegexTraitsConcept
{
RegexTraitsConcept();
// required typedefs:
typedef typename traits::char_type char_type;
typedef typename traits::size_type size_type;
typedef typename traits::string_type string_type;
typedef typename traits::locale_type locale_type;
typedef typename traits::char_class_type char_class_type;
void constraints()
{
function_requires<UnsignedIntegerConcept<size_type> >();
function_requires<RandomAccessContainerConcept<string_type> >();
function_requires<DefaultConstructibleConcept<locale_type> >();
function_requires<CopyConstructibleConcept<locale_type> >();
function_requires<AssignableConcept<locale_type> >();
function_requires<BitmaskConcept<char_class_type> >();
size_type n = traits::length(m_pointer);
ignore_unused_variable_warning(n);
char_type c = m_ctraits.translate(m_char);
ignore_unused_variable_warning(c);
c = m_ctraits.translate_nocase(m_char);
//string_type::foobar bar;
string_type s1 = m_ctraits.transform(m_pointer, m_pointer);
ignore_unused_variable_warning(s1);
string_type s2 = m_ctraits.transform_primary(m_pointer, m_pointer);
ignore_unused_variable_warning(s2);
char_class_type cc = m_ctraits.lookup_classname(m_pointer, m_pointer);
ignore_unused_variable_warning(cc);
string_type s3 = m_ctraits.lookup_collatename(m_pointer, m_pointer);
ignore_unused_variable_warning(s3);
bool b = m_ctraits.isctype(m_char, cc);
ignore_unused_variable_warning(b);
int v = m_ctraits.value(m_char, 16);
ignore_unused_variable_warning(v);
locale_type l(m_ctraits.getloc());
m_traits.imbue(l);
ignore_unused_variable_warning(l);
}
traits m_traits;
const traits m_ctraits;
const char_type* m_pointer;
char_type m_char;
};
//
// helper class to compute what traits class a regular expression type is using:
//
template <class Regex>
struct regex_traits_computer;
template <class charT, class traits>
struct regex_traits_computer< global_regex_namespace::basic_regex<charT, traits> >
{
typedef traits type;
};
//
// BaseRegexConcept does not test anything dependent on basic_string,
// in case our charT does not have an associated char_traits:
//
template <class Regex>
struct BaseRegexConcept
{
typedef typename Regex::value_type value_type;
typedef typename Regex::size_type size_type;
typedef typename Regex::flag_type flag_type;
typedef typename Regex::locale_type locale_type;
typedef input_iterator_archetype<value_type> input_iterator_type;
// derived test types:
typedef const value_type* pointer_type;
typedef bidirectional_iterator_archetype<value_type> BidiIterator;
typedef global_regex_namespace::sub_match<BidiIterator> sub_match_type;
typedef global_regex_namespace::match_results<BidiIterator> match_results_type;
typedef output_iterator_archetype<value_type> OutIterator;
typedef typename regex_traits_computer<Regex>::type traits_type;
typedef global_regex_namespace::regex_iterator<BidiIterator, value_type, traits_type> regex_iterator_type;
typedef global_regex_namespace::regex_token_iterator<BidiIterator, value_type, traits_type> regex_token_iterator_type;
void global_constraints()
{
//
// test non-template components:
//
function_requires<BitmaskConcept<global_regex_namespace::regex_constants::syntax_option_type> >();
global_regex_namespace::regex_constants::syntax_option_type opts
= global_regex_namespace::regex_constants::icase
| global_regex_namespace::regex_constants::nosubs
| global_regex_namespace::regex_constants::optimize
| global_regex_namespace::regex_constants::collate
| global_regex_namespace::regex_constants::ECMAScript
| global_regex_namespace::regex_constants::basic
| global_regex_namespace::regex_constants::extended
| global_regex_namespace::regex_constants::awk
| global_regex_namespace::regex_constants::grep
| global_regex_namespace::regex_constants::egrep;
ignore_unused_variable_warning(opts);
function_requires<BitmaskConcept<global_regex_namespace::regex_constants::match_flag_type> >();
global_regex_namespace::regex_constants::match_flag_type mopts
= global_regex_namespace::regex_constants::match_default
| global_regex_namespace::regex_constants::match_not_bol
| global_regex_namespace::regex_constants::match_not_eol
| global_regex_namespace::regex_constants::match_not_bow
| global_regex_namespace::regex_constants::match_not_eow
| global_regex_namespace::regex_constants::match_any
| global_regex_namespace::regex_constants::match_not_null
| global_regex_namespace::regex_constants::match_continuous
| global_regex_namespace::regex_constants::match_prev_avail
| global_regex_namespace::regex_constants::format_default
| global_regex_namespace::regex_constants::format_sed
| global_regex_namespace::regex_constants::format_no_copy
| global_regex_namespace::regex_constants::format_first_only;
ignore_unused_variable_warning(mopts);
BOOST_STATIC_ASSERT((::boost::is_enum<global_regex_namespace::regex_constants::error_type>::value));
global_regex_namespace::regex_constants::error_type e1 = global_regex_namespace::regex_constants::error_collate;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_ctype;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_escape;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_backref;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_brack;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_paren;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_brace;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_badbrace;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_range;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_space;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_badrepeat;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_complexity;
ignore_unused_variable_warning(e1);
e1 = global_regex_namespace::regex_constants::error_stack;
ignore_unused_variable_warning(e1);
BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::runtime_error, global_regex_namespace::regex_error>::value ));
const global_regex_namespace::regex_error except(e1);
e1 = except.code();
typedef typename Regex::value_type value_type;
function_requires< RegexTraitsConcept<global_regex_namespace::regex_traits<char> > >();
function_requires< BaseRegexConcept<global_regex_namespace::basic_regex<char> > >();
}
void constraints()
{
global_constraints();
BOOST_STATIC_ASSERT((::boost::is_same< flag_type, global_regex_namespace::regex_constants::syntax_option_type>::value));
flag_type opts
= Regex::icase
| Regex::nosubs
| Regex::optimize
| Regex::collate
| Regex::ECMAScript
| Regex::basic
| Regex::extended
| Regex::awk
| Regex::grep
| Regex::egrep;
ignore_unused_variable_warning(opts);
function_requires<DefaultConstructibleConcept<Regex> >();
function_requires<CopyConstructibleConcept<Regex> >();
// Regex constructors:
Regex e1(m_pointer);
ignore_unused_variable_warning(e1);
Regex e2(m_pointer, m_flags);
ignore_unused_variable_warning(e2);
Regex e3(m_pointer, m_size, m_flags);
ignore_unused_variable_warning(e3);
Regex e4(in1, in2);
ignore_unused_variable_warning(e4);
Regex e5(in1, in2, m_flags);
ignore_unused_variable_warning(e5);
// assign etc:
Regex e;
e = m_pointer;
e = e1;
e.assign(e1);
e.assign(m_pointer);
e.assign(m_pointer, m_flags);
e.assign(m_pointer, m_size, m_flags);
e.assign(in1, in2);
e.assign(in1, in2, m_flags);
// access:
const Regex ce;
bool b = ce.empty();
ignore_unused_variable_warning(b);
size_type i = ce.mark_count();
ignore_unused_variable_warning(i);
m_flags = ce.flags();
e.imbue(ce.getloc());
e.swap(e1);
global_regex_namespace::swap(e, e1);
// sub_match:
BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::pair<BidiIterator, BidiIterator>, sub_match_type>::value));
typedef typename sub_match_type::value_type sub_value_type;
typedef typename sub_match_type::difference_type sub_diff_type;
typedef typename sub_match_type::iterator sub_iter_type;
BOOST_STATIC_ASSERT((::boost::is_same<sub_value_type, value_type>::value));
BOOST_STATIC_ASSERT((::boost::is_same<sub_iter_type, BidiIterator>::value));
b = m_sub.matched;
ignore_unused_variable_warning(b);
BidiIterator bi = m_sub.first;
ignore_unused_variable_warning(bi);
bi = m_sub.second;
ignore_unused_variable_warning(bi);
sub_diff_type diff = m_sub.length();
ignore_unused_variable_warning(diff);
// match_results tests:
typedef typename match_results_type::value_type mr_value_type;
typedef typename match_results_type::const_reference mr_const_reference;
typedef typename match_results_type::reference mr_reference;
typedef typename match_results_type::const_iterator mr_const_iterator;
typedef typename match_results_type::iterator mr_iterator;
typedef typename match_results_type::difference_type mr_difference_type;
typedef typename match_results_type::size_type mr_size_type;
typedef typename match_results_type::allocator_type mr_allocator_type;
typedef typename match_results_type::char_type mr_char_type;
typedef typename match_results_type::string_type mr_string_type;
match_results_type m1;
mr_allocator_type at;
match_results_type m2(at);
match_results_type m3(m1);
m1 = m2;
mr_size_type mrs = m_cresults.size();
ignore_unused_variable_warning(mrs);
mrs = m_cresults.max_size();
ignore_unused_variable_warning(mrs);
b = m_cresults.empty();
ignore_unused_variable_warning(b);
mr_difference_type mrd = m_cresults.length();
ignore_unused_variable_warning(mrd);
mrd = m_cresults.length(mrs);
ignore_unused_variable_warning(mrd);
mrd = m_cresults.position();
ignore_unused_variable_warning(mrd);
mrd = m_cresults.position(mrs);
ignore_unused_variable_warning(mrd);
mr_const_reference mrcr = m_cresults[m_size];
ignore_unused_variable_warning(mrcr);
mr_const_reference mrcr2 = m_cresults.prefix();
ignore_unused_variable_warning(mrcr2);
mr_const_reference mrcr3 = m_cresults.suffix();
ignore_unused_variable_warning(mrcr3);
mr_const_iterator mrci = m_cresults.begin();
ignore_unused_variable_warning(mrci);
mrci = m_cresults.end();
ignore_unused_variable_warning(mrci);
mr_allocator_type at2 = m_cresults.get_allocator();
m_results.swap(m_results);
global_regex_namespace::swap(m_results, m_results);
// regex_match:
b = global_regex_namespace::regex_match(m_in, m_in, m_results, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_in, m_in, m_results, e, m_mft);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_in, m_in, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_in, m_in, e, m_mft);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_pointer, m_pmatch, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_pointer, m_pmatch, e, m_mft);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_pointer, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_pointer, e, m_mft);
ignore_unused_variable_warning(b);
// regex_search:
b = global_regex_namespace::regex_search(m_in, m_in, m_results, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_in, m_in, m_results, e, m_mft);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_in, m_in, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_in, m_in, e, m_mft);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_pointer, m_pmatch, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_pointer, m_pmatch, e, m_mft);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_pointer, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_pointer, e, m_mft);
ignore_unused_variable_warning(b);
// regex_iterator:
typedef typename regex_iterator_type::regex_type rit_regex_type;
typedef typename regex_iterator_type::value_type rit_value_type;
typedef typename regex_iterator_type::difference_type rit_difference_type;
typedef typename regex_iterator_type::pointer rit_pointer;
typedef typename regex_iterator_type::reference rit_reference;
typedef typename regex_iterator_type::iterator_category rit_iterator_category;
BOOST_STATIC_ASSERT((::boost::is_same<rit_regex_type, Regex>::value));
BOOST_STATIC_ASSERT((::boost::is_same<rit_value_type, match_results_type>::value));
BOOST_STATIC_ASSERT((::boost::is_same<rit_difference_type, std::ptrdiff_t>::value));
BOOST_STATIC_ASSERT((::boost::is_same<rit_pointer, const match_results_type*>::value));
BOOST_STATIC_ASSERT((::boost::is_same<rit_reference, const match_results_type&>::value));
BOOST_STATIC_ASSERT((::boost::is_convertible<rit_iterator_category*, std::forward_iterator_tag*>::value));
// this takes care of most of the checks needed:
function_requires<ForwardIteratorConcept<regex_iterator_type> >();
regex_iterator_type iter1(m_in, m_in, e);
ignore_unused_variable_warning(iter1);
regex_iterator_type iter2(m_in, m_in, e, m_mft);
ignore_unused_variable_warning(iter2);
// regex_token_iterator:
typedef typename regex_token_iterator_type::regex_type rtit_regex_type;
typedef typename regex_token_iterator_type::value_type rtit_value_type;
typedef typename regex_token_iterator_type::difference_type rtit_difference_type;
typedef typename regex_token_iterator_type::pointer rtit_pointer;
typedef typename regex_token_iterator_type::reference rtit_reference;
typedef typename regex_token_iterator_type::iterator_category rtit_iterator_category;
BOOST_STATIC_ASSERT((::boost::is_same<rtit_regex_type, Regex>::value));
BOOST_STATIC_ASSERT((::boost::is_same<rtit_value_type, sub_match_type>::value));
BOOST_STATIC_ASSERT((::boost::is_same<rtit_difference_type, std::ptrdiff_t>::value));
BOOST_STATIC_ASSERT((::boost::is_same<rtit_pointer, const sub_match_type*>::value));
BOOST_STATIC_ASSERT((::boost::is_same<rtit_reference, const sub_match_type&>::value));
BOOST_STATIC_ASSERT((::boost::is_convertible<rtit_iterator_category*, std::forward_iterator_tag*>::value));
// this takes care of most of the checks needed:
function_requires<ForwardIteratorConcept<regex_token_iterator_type> >();
regex_token_iterator_type ti1(m_in, m_in, e);
ignore_unused_variable_warning(ti1);
regex_token_iterator_type ti2(m_in, m_in, e, 0);
ignore_unused_variable_warning(ti2);
regex_token_iterator_type ti3(m_in, m_in, e, 0, m_mft);
ignore_unused_variable_warning(ti3);
std::vector<int> subs;
regex_token_iterator_type ti4(m_in, m_in, e, subs);
ignore_unused_variable_warning(ti4);
regex_token_iterator_type ti5(m_in, m_in, e, subs, m_mft);
ignore_unused_variable_warning(ti5);
static const int i_array[3] = { 1, 2, 3, };
regex_token_iterator_type ti6(m_in, m_in, e, i_array);
ignore_unused_variable_warning(ti6);
regex_token_iterator_type ti7(m_in, m_in, e, i_array, m_mft);
ignore_unused_variable_warning(ti7);
}
pointer_type m_pointer;
flag_type m_flags;
size_type m_size;
input_iterator_type in1, in2;
const sub_match_type m_sub;
const value_type m_char;
match_results_type m_results;
const match_results_type m_cresults;
OutIterator m_out;
BidiIterator m_in;
global_regex_namespace::regex_constants::match_flag_type m_mft;
global_regex_namespace::match_results<pointer_type> m_pmatch;
BaseRegexConcept();
BaseRegexConcept(const BaseRegexConcept&);
BaseRegexConcept& operator=(const BaseRegexConcept&);
};
//
// RegexConcept:
// Test every interface in the std:
//
template <class Regex>
struct RegexConcept
{
typedef typename Regex::value_type value_type;
typedef typename Regex::size_type size_type;
typedef typename Regex::flag_type flag_type;
typedef typename Regex::locale_type locale_type;
// derived test types:
typedef const value_type* pointer_type;
typedef std::basic_string<value_type> string_type;
typedef boost::bidirectional_iterator_archetype<value_type> BidiIterator;
typedef global_regex_namespace::sub_match<BidiIterator> sub_match_type;
typedef global_regex_namespace::match_results<BidiIterator> match_results_type;
typedef output_iterator_archetype<value_type> OutIterator;
void constraints()
{
function_requires<BaseRegexConcept<Regex> >();
// string based construct:
Regex e1(m_string);
ignore_unused_variable_warning(e1);
Regex e2(m_string, m_flags);
ignore_unused_variable_warning(e2);
// assign etc:
Regex e;
e = m_string;
e.assign(m_string);
e.assign(m_string, m_flags);
// sub_match:
string_type s(m_sub);
ignore_unused_variable_warning(s);
s = m_sub.str();
ignore_unused_variable_warning(s);
int i = m_sub.compare(m_string);
ignore_unused_variable_warning(i);
int i2 = m_sub.compare(m_sub);
ignore_unused_variable_warning(i2);
i2 = m_sub.compare(m_pointer);
ignore_unused_variable_warning(i2);
bool b = m_sub == m_sub;
ignore_unused_variable_warning(b);
b = m_sub != m_sub;
ignore_unused_variable_warning(b);
b = m_sub <= m_sub;
ignore_unused_variable_warning(b);
b = m_sub <= m_sub;
ignore_unused_variable_warning(b);
b = m_sub > m_sub;
ignore_unused_variable_warning(b);
b = m_sub >= m_sub;
ignore_unused_variable_warning(b);
b = m_sub == m_pointer;
ignore_unused_variable_warning(b);
b = m_sub != m_pointer;
ignore_unused_variable_warning(b);
b = m_sub <= m_pointer;
ignore_unused_variable_warning(b);
b = m_sub <= m_pointer;
ignore_unused_variable_warning(b);
b = m_sub > m_pointer;
ignore_unused_variable_warning(b);
b = m_sub >= m_pointer;
ignore_unused_variable_warning(b);
b = m_pointer == m_sub;
ignore_unused_variable_warning(b);
b = m_pointer != m_sub;
ignore_unused_variable_warning(b);
b = m_pointer <= m_sub;
ignore_unused_variable_warning(b);
b = m_pointer <= m_sub;
ignore_unused_variable_warning(b);
b = m_pointer > m_sub;
ignore_unused_variable_warning(b);
b = m_pointer >= m_sub;
ignore_unused_variable_warning(b);
b = m_sub == m_char;
ignore_unused_variable_warning(b);
b = m_sub != m_char;
ignore_unused_variable_warning(b);
b = m_sub <= m_char;
ignore_unused_variable_warning(b);
b = m_sub <= m_char;
ignore_unused_variable_warning(b);
b = m_sub > m_char;
ignore_unused_variable_warning(b);
b = m_sub >= m_char;
ignore_unused_variable_warning(b);
b = m_char == m_sub;
ignore_unused_variable_warning(b);
b = m_char != m_sub;
ignore_unused_variable_warning(b);
b = m_char <= m_sub;
ignore_unused_variable_warning(b);
b = m_char <= m_sub;
ignore_unused_variable_warning(b);
b = m_char > m_sub;
ignore_unused_variable_warning(b);
b = m_char >= m_sub;
ignore_unused_variable_warning(b);
b = m_sub == m_string;
ignore_unused_variable_warning(b);
b = m_sub != m_string;
ignore_unused_variable_warning(b);
b = m_sub <= m_string;
ignore_unused_variable_warning(b);
b = m_sub <= m_string;
ignore_unused_variable_warning(b);
b = m_sub > m_string;
ignore_unused_variable_warning(b);
b = m_sub >= m_string;
ignore_unused_variable_warning(b);
b = m_string == m_sub;
ignore_unused_variable_warning(b);
b = m_string != m_sub;
ignore_unused_variable_warning(b);
b = m_string <= m_sub;
ignore_unused_variable_warning(b);
b = m_string <= m_sub;
ignore_unused_variable_warning(b);
b = m_string > m_sub;
ignore_unused_variable_warning(b);
b = m_string >= m_sub;
ignore_unused_variable_warning(b);
// match results:
m_string = m_results.str();
ignore_unused_variable_warning(m_string);
m_string = m_results.str(0);
ignore_unused_variable_warning(m_string);
m_out = m_cresults.format(m_out, m_string);
m_out = m_cresults.format(m_out, m_string, m_mft);
m_string = m_cresults.format(m_string);
ignore_unused_variable_warning(m_string);
m_string = m_cresults.format(m_string, m_mft);
ignore_unused_variable_warning(m_string);
// regex_match:
b = global_regex_namespace::regex_match(m_string, m_smatch, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_string, m_smatch, e, m_mft);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_string, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_match(m_string, e, m_mft);
ignore_unused_variable_warning(b);
// regex_search:
b = global_regex_namespace::regex_search(m_string, m_smatch, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_string, m_smatch, e, m_mft);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_string, e);
ignore_unused_variable_warning(b);
b = global_regex_namespace::regex_search(m_string, e, m_mft);
ignore_unused_variable_warning(b);
// regex_replace:
m_out = global_regex_namespace::regex_replace(m_out, m_in, m_in, e, m_string, m_mft);
m_out = global_regex_namespace::regex_replace(m_out, m_in, m_in, e, m_string);
m_string = global_regex_namespace::regex_replace(m_string, e, m_string, m_mft);
ignore_unused_variable_warning(m_string);
m_string = global_regex_namespace::regex_replace(m_string, e, m_string);
ignore_unused_variable_warning(m_string);
}
flag_type m_flags;
string_type m_string;
const sub_match_type m_sub;
match_results_type m_results;
pointer_type m_pointer;
value_type m_char;
const match_results_type m_cresults;
OutIterator m_out;
BidiIterator m_in;
global_regex_namespace::regex_constants::match_flag_type m_mft;
global_regex_namespace::match_results<typename string_type::const_iterator> m_smatch;
RegexConcept();
RegexConcept(const RegexConcept&);
RegexConcept& operator=(const RegexConcept&);
};
//
// BoostRegexConcept:
// Test every interface in the Boost implementation:
//
template <class Regex>
struct BoostRegexConcept
{
typedef typename Regex::value_type value_type;
typedef typename Regex::size_type size_type;
typedef typename Regex::flag_type flag_type;
typedef typename Regex::locale_type locale_type;
// derived test types:
typedef const value_type* pointer_type;
typedef std::basic_string<value_type> string_type;
typedef typename Regex::const_iterator const_iterator;
typedef bidirectional_iterator_archetype<value_type> BidiIterator;
typedef global_regex_namespace::sub_match<BidiIterator> sub_match_type;
typedef global_regex_namespace::match_results<BidiIterator> match_results_type;
void constraints()
{
global_regex_namespace::regex_constants::match_flag_type mopts
= global_regex_namespace::regex_constants::match_default
| global_regex_namespace::regex_constants::match_not_bol
| global_regex_namespace::regex_constants::match_not_eol
| global_regex_namespace::regex_constants::match_not_bow
| global_regex_namespace::regex_constants::match_not_eow
| global_regex_namespace::regex_constants::match_any
| global_regex_namespace::regex_constants::match_not_null
| global_regex_namespace::regex_constants::match_continuous
| global_regex_namespace::regex_constants::match_partial
| global_regex_namespace::regex_constants::match_prev_avail
| global_regex_namespace::regex_constants::format_default
| global_regex_namespace::regex_constants::format_sed
| global_regex_namespace::regex_constants::format_perl
| global_regex_namespace::regex_constants::format_no_copy
| global_regex_namespace::regex_constants::format_first_only;
function_requires<RegexConcept<Regex> >();
const global_regex_namespace::regex_error except(global_regex_namespace::regex_constants::error_collate);
std::ptrdiff_t pt = except.position();
ignore_unused_variable_warning(pt);
const Regex ce, ce2;
#ifndef BOOST_NO_STD_LOCALE
m_stream << ce;
#endif
unsigned i = ce.error_code();
ignore_unused_variable_warning(i);
pointer_type p = ce.expression();
ignore_unused_variable_warning(p);
int i2 = ce.compare(ce2);
ignore_unused_variable_warning(i2);
bool b = ce == ce2;
ignore_unused_variable_warning(b);
b = ce != ce2;
ignore_unused_variable_warning(b);
b = ce < ce2;
ignore_unused_variable_warning(b);
b = ce > ce2;
ignore_unused_variable_warning(b);
b = ce <= ce2;
ignore_unused_variable_warning(b);
b = ce >= ce2;
ignore_unused_variable_warning(b);
i = ce.status();
ignore_unused_variable_warning(i);
size_type s = ce.max_size();
ignore_unused_variable_warning(s);
s = ce.size();
ignore_unused_variable_warning(s);
const_iterator pi = ce.begin();
ignore_unused_variable_warning(pi);
pi = ce.end();
ignore_unused_variable_warning(pi);
string_type s2 = ce.str();
ignore_unused_variable_warning(s2);
m_string = m_sub + m_sub;
ignore_unused_variable_warning(m_string);
m_string = m_sub + m_pointer;
ignore_unused_variable_warning(m_string);
m_string = m_pointer + m_sub;
ignore_unused_variable_warning(m_string);
m_string = m_sub + m_string;
ignore_unused_variable_warning(m_string);
m_string = m_string + m_sub;
ignore_unused_variable_warning(m_string);
m_string = m_sub + m_char;
ignore_unused_variable_warning(m_string);
m_string = m_char + m_sub;
ignore_unused_variable_warning(m_string);
#ifndef BOOST_NO_STD_LOCALE
m_stream << m_sub;
m_stream << m_cresults;
#endif
}
std::basic_ostream<value_type> m_stream;
sub_match_type m_sub;
pointer_type m_pointer;
string_type m_string;
const value_type m_char;
match_results_type m_results;
const match_results_type m_cresults;
BoostRegexConcept();
BoostRegexConcept(const BoostRegexConcept&);
BoostRegexConcept& operator=(const BoostRegexConcept&);
};
}
#endif
include/boost/regex/config.hpp
+411
View File
@@ -0,0 +1,411 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE config.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: regex extended config setup.
*/
#ifndef BOOST_REGEX_CONFIG_HPP
#define BOOST_REGEX_CONFIG_HPP
/*
* Borland C++ Fix/error check
* this has to go *before* we include any std lib headers:
*/
#if defined(__BORLANDC__)
# include <boost/regex/config/borland.hpp>
#endif
/*****************************************************************************
*
* Include all the headers we need here:
*
****************************************************************************/
#ifdef __cplusplus
# ifndef BOOST_REGEX_USER_CONFIG
# define BOOST_REGEX_USER_CONFIG <boost/regex/user.hpp>
# endif
# include BOOST_REGEX_USER_CONFIG
# include <boost/config.hpp>
#else
/*
* C build,
* don't include <boost/config.hpp> because that may
* do C++ specific things in future...
*/
# include <stdlib.h>
# include <stddef.h>
# ifdef _MSC_VER
# define BOOST_MSVC _MSC_VER
# endif
#endif
/*****************************************************************************
*
* Boilerplate regex config options:
*
****************************************************************************/
/* Obsolete macro, use BOOST_VERSION instead: */
#define BOOST_RE_VERSION 320
/* fix: */
#if defined(_UNICODE) && !defined(UNICODE)
#define UNICODE
#endif
/*
* Fix for gcc prior to 3.4: std::ctype<wchar_t> doesn't allow
* masks to be combined, for example:
* std::use_facet<std::ctype<wchar_t> >.is(std::ctype_base::lower|std::ctype_base::upper, L'a');
* returns *false*.
*/
#ifdef __GLIBCPP__
# define BOOST_REGEX_BUGGY_CTYPE_FACET
#endif
/*
* Intel C++ before 8.0 ends up with unresolved externals unless we turn off
* extern template support:
*/
#if defined(BOOST_INTEL) && defined(__cplusplus) && (BOOST_INTEL <= 800)
# define BOOST_REGEX_NO_EXTERNAL_TEMPLATES
#endif
/*
* If there isn't good enough wide character support then there will
* be no wide character regular expressions:
*/
#if (defined(BOOST_NO_CWCHAR) || defined(BOOST_NO_CWCTYPE) || defined(BOOST_NO_STD_WSTRING))
# if !defined(BOOST_NO_WREGEX)
# define BOOST_NO_WREGEX
# endif
#else
# if defined(__sgi) && (defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION))
/* STLPort on IRIX is misconfigured: <cwctype> does not compile
* as a temporary fix include <wctype.h> instead and prevent inclusion
* of STLPort version of <cwctype> */
# include <wctype.h>
# define __STLPORT_CWCTYPE
# define _STLP_CWCTYPE
# endif
#ifdef __cplusplus
# include <boost/regex/config/cwchar.hpp>
#endif
#endif
/*
* If Win32 support has been disabled for boost in general, then
* it is for regex in particular:
*/
#if defined(BOOST_DISABLE_WIN32) && !defined(BOOST_REGEX_NO_W32)
# define BOOST_REGEX_NO_W32
#endif
/* disable our own file-iterators and mapfiles if we can't
* support them: */
#if !defined(BOOST_HAS_DIRENT_H) && !(defined(_WIN32) && !defined(BOOST_REGEX_NO_W32))
# define BOOST_REGEX_NO_FILEITER
#endif
/* backwards compatibitity: */
#if defined(BOOST_RE_NO_LIB)
# define BOOST_REGEX_NO_LIB
#endif
#if defined(__GNUC__) && (defined(_WIN32) || defined(__CYGWIN__))
/* gcc on win32 has problems if you include <windows.h>
(sporadically generates bad code). */
# define BOOST_REGEX_NO_W32
#endif
#if defined(__COMO__) && !defined(BOOST_REGEX_NO_W32) && !defined(_MSC_EXTENSIONS)
# define BOOST_REGEX_NO_W32
#endif
/*****************************************************************************
*
* Wide character workarounds:
*
****************************************************************************/
/*
* define BOOST_REGEX_HAS_OTHER_WCHAR_T when wchar_t is a native type, but the users
* code may be built with wchar_t as unsigned short: basically when we're building
* with MSVC and the /Zc:wchar_t option we place some extra unsigned short versions
* of the non-inline functions in the library, so that users can still link to the lib,
* irrespective of whether their own code is built with /Zc:wchar_t.
*/
#if defined(__cplusplus) && (defined(BOOST_MSVC) || defined(__ICL)) && !defined(BOOST_NO_INTRINSIC_WCHAR_T) && defined(BOOST_WINDOWS) && !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION)
# define BOOST_REGEX_HAS_OTHER_WCHAR_T
# ifdef BOOST_MSVC
# pragma warning(push)
# pragma warning(disable : 4251 4231 4660)
# endif
# ifdef _DLL
# include <string>
extern template class __declspec(dllimport) std::basic_string<unsigned short>;
# endif
# ifdef BOOST_MSVC
# pragma warning(pop)
# endif
#endif
/*****************************************************************************
*
* Set up dll import/export options:
*
****************************************************************************/
#if defined(BOOST_HAS_DECLSPEC) && (defined(BOOST_REGEX_DYN_LINK) || defined(BOOST_ALL_DYN_LINK)) && !defined(BOOST_REGEX_STATIC_LINK)
# if defined(BOOST_REGEX_SOURCE)
# define BOOST_REGEX_DECL __declspec(dllexport)
# define BOOST_REGEX_BUILD_DLL
# else
# define BOOST_REGEX_DECL __declspec(dllimport)
# endif
#endif
#ifndef BOOST_REGEX_DECL
# define BOOST_REGEX_DECL
#endif
#if !defined(BOOST_REGEX_NO_LIB) && !defined(BOOST_REGEX_SOURCE) && !defined(BOOST_ALL_NO_LIB) && defined(__cplusplus)
# define BOOST_LIB_NAME boost_regex
# if defined(BOOST_REGEX_DYN_LINK) || defined(BOOST_ALL_DYN_LINK)
# define BOOST_DYN_LINK
# endif
# ifdef BOOST_REGEX_DIAG
# define BOOST_LIB_DIAGNOSTIC
# endif
# include <boost/config/auto_link.hpp>
#endif
/*****************************************************************************
*
* Set up function call type:
*
****************************************************************************/
#if defined(BOOST_MSVC) && (BOOST_MSVC >= 1200) && defined(_MSC_EXTENSIONS)
#if defined(_DEBUG) || defined(__MSVC_RUNTIME_CHECKS)
# define BOOST_REGEX_CALL __cdecl
#else
# define BOOST_REGEX_CALL __fastcall
#endif
# define BOOST_REGEX_CCALL __cdecl
#endif
#if defined(__BORLANDC__) && !defined(BOOST_DISABLE_WIN32)
# define BOOST_REGEX_CALL __fastcall
# define BOOST_REGEX_CCALL __stdcall
#endif
#ifndef BOOST_REGEX_CALL
# define BOOST_REGEX_CALL
#endif
#ifndef BOOST_REGEX_CCALL
#define BOOST_REGEX_CCALL
#endif
/*****************************************************************************
*
* Set up localisation model:
*
****************************************************************************/
/* backwards compatibility: */
#ifdef BOOST_RE_LOCALE_C
# define BOOST_REGEX_USE_C_LOCALE
#endif
#ifdef BOOST_RE_LOCALE_CPP
# define BOOST_REGEX_USE_CPP_LOCALE
#endif
/* Win32 defaults to native Win32 locale: */
#if defined(_WIN32) && !defined(BOOST_REGEX_USE_WIN32_LOCALE) && !defined(BOOST_REGEX_USE_C_LOCALE) && !defined(BOOST_REGEX_USE_CPP_LOCALE) && !defined(BOOST_REGEX_NO_W32)
# define BOOST_REGEX_USE_WIN32_LOCALE
#endif
/* otherwise use C++ locale if supported: */
#if !defined(BOOST_REGEX_USE_WIN32_LOCALE) && !defined(BOOST_REGEX_USE_C_LOCALE) && !defined(BOOST_REGEX_USE_CPP_LOCALE) && !defined(BOOST_NO_STD_LOCALE)
# define BOOST_REGEX_USE_CPP_LOCALE
#endif
/* otherwise use C+ locale: */
#if !defined(BOOST_REGEX_USE_WIN32_LOCALE) && !defined(BOOST_REGEX_USE_C_LOCALE) && !defined(BOOST_REGEX_USE_CPP_LOCALE)
# define BOOST_REGEX_USE_C_LOCALE
#endif
#ifndef BOOST_REGEX_MAX_STATE_COUNT
# define BOOST_REGEX_MAX_STATE_COUNT 100000000
#endif
/*****************************************************************************
*
* Error Handling for exception free compilers:
*
****************************************************************************/
#ifdef BOOST_NO_EXCEPTIONS
/*
* If there are no exceptions then we must report critical-errors
* the only way we know how; by terminating.
*/
#include <stdexcept>
#include <string>
#include <boost/throw_exception.hpp>
# define BOOST_REGEX_NOEH_ASSERT(x)\
if(0 == (x))\
{\
std::string s("Error: critical regex++ failure in: ");\
s.append(#x);\
std::runtime_error e(s);\
boost::throw_exception(e);\
}
#else
/*
* With exceptions then error handling is taken care of and
* there is no need for these checks:
*/
# define BOOST_REGEX_NOEH_ASSERT(x)
#endif
/*****************************************************************************
*
* Stack protection under MS Windows:
*
****************************************************************************/
#if !defined(BOOST_REGEX_NO_W32) && !defined(BOOST_REGEX_V3)
# if(defined(_WIN32) || defined(_WIN64) || defined(_WINCE)) \
&& !defined(__GNUC__) \
&& !(defined(__BORLANDC__) && (__BORLANDC__ >= 0x600)) \
&& !(defined(__MWERKS__) && (__MWERKS__ <= 0x3003))
# define BOOST_REGEX_HAS_MS_STACK_GUARD
# endif
#elif defined(BOOST_REGEX_HAS_MS_STACK_GUARD)
# undef BOOST_REGEX_HAS_MS_STACK_GUARD
#endif
#if defined(__cplusplus) && defined(BOOST_REGEX_HAS_MS_STACK_GUARD)
namespace boost{
namespace re_detail{
BOOST_REGEX_DECL void BOOST_REGEX_CALL reset_stack_guard_page();
}
}
#endif
/*****************************************************************************
*
* Algorithm selection and configuration:
*
****************************************************************************/
#if !defined(BOOST_REGEX_RECURSIVE) && !defined(BOOST_REGEX_NON_RECURSIVE)
# if defined(BOOST_REGEX_HAS_MS_STACK_GUARD) && !defined(_STLP_DEBUG) && !defined(__STL_DEBUG) && !(defined(BOOST_MSVC) && (BOOST_MSVC >= 1400))
# define BOOST_REGEX_RECURSIVE
# else
# define BOOST_REGEX_NON_RECURSIVE
# endif
#endif
#ifdef BOOST_REGEX_NON_RECURSIVE
# ifdef BOOST_REGEX_RECURSIVE
# error "Can't set both BOOST_REGEX_RECURSIVE and BOOST_REGEX_NON_RECURSIVE"
# endif
# ifndef BOOST_REGEX_BLOCKSIZE
# define BOOST_REGEX_BLOCKSIZE 4096
# endif
# if BOOST_REGEX_BLOCKSIZE < 512
# error "BOOST_REGEX_BLOCKSIZE must be at least 512"
# endif
# ifndef BOOST_REGEX_MAX_BLOCKS
# define BOOST_REGEX_MAX_BLOCKS 1024
# endif
# ifdef BOOST_REGEX_HAS_MS_STACK_GUARD
# undef BOOST_REGEX_HAS_MS_STACK_GUARD
# endif
# ifndef BOOST_REGEX_MAX_CACHE_BLOCKS
# define BOOST_REGEX_MAX_CACHE_BLOCKS 16
# endif
#endif
/*****************************************************************************
*
* helper memory allocation functions:
*
****************************************************************************/
#if defined(__cplusplus) && defined(BOOST_REGEX_NON_RECURSIVE)
namespace boost{ namespace re_detail{
BOOST_REGEX_DECL void* BOOST_REGEX_CALL get_mem_block();
BOOST_REGEX_DECL void BOOST_REGEX_CALL put_mem_block(void*);
}} /* namespaces */
#endif
/*****************************************************************************
*
* Diagnostics:
*
****************************************************************************/
#ifdef BOOST_REGEX_CONFIG_INFO
BOOST_REGEX_DECL void BOOST_REGEX_CALL print_regex_library_info();
#endif
#if defined(BOOST_REGEX_DIAG)
# pragma message ("BOOST_REGEX_DECL" BOOST_STRINGIZE(=BOOST_REGEX_DECL))
# pragma message ("BOOST_REGEX_CALL" BOOST_STRINGIZE(=BOOST_REGEX_CALL))
# pragma message ("BOOST_REGEX_CCALL" BOOST_STRINGIZE(=BOOST_REGEX_CCALL))
#ifdef BOOST_REGEX_USE_C_LOCALE
# pragma message ("Using C locale in regex traits class")
#elif BOOST_REGEX_USE_CPP_LOCALE
# pragma message ("Using C++ locale in regex traits class")
#else
# pragma message ("Using Win32 locale in regex traits class")
#endif
#if defined(BOOST_REGEX_DYN_LINK) || defined(BOOST_ALL_DYN_LINK)
# pragma message ("Dynamic linking enabled")
#endif
#if defined(BOOST_REGEX_NO_LIB) || defined(BOOST_ALL_NO_LIB)
# pragma message ("Auto-linking disabled")
#endif
#ifdef BOOST_REGEX_NO_EXTERNAL_TEMPLATES
# pragma message ("Extern templates disabled")
#endif
#endif
#endif
include/boost/regex/config/borland.hpp
+72
View File
@@ -0,0 +1,72 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE boost/regex/config/borland.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: regex borland-specific config setup.
*/
#if defined(__BORLANDC__)
# if (__BORLANDC__ == 0x550) || (__BORLANDC__ == 0x551)
// problems with std::basic_string and dll RTL:
# if defined(_RTLDLL) && defined(_RWSTD_COMPILE_INSTANTIATE)
# ifdef BOOST_REGEX_BUILD_DLL
# error _RWSTD_COMPILE_INSTANTIATE must not be defined when building regex++ as a DLL
# else
# pragma message("Defining _RWSTD_COMPILE_INSTANTIATE when linking to the DLL version of the RTL may produce memory corruption problems in std::basic_string, as a result of separate versions of basic_string's static data in the RTL and you're exe/dll: be warned!!")
# endif
# endif
# ifndef _RTLDLL
// this is harmless for a staic link:
# define _RWSTD_COMPILE_INSTANTIATE
# endif
// external templates cause problems for some reason:
# define BOOST_REGEX_NO_EXTERNAL_TEMPLATES
# endif
# if (__BORLANDC__ <= 0x540) && !defined(BOOST_REGEX_NO_LIB) && !defined(_NO_VCL)
// C++ Builder 4 and earlier, we can't tell whether we should be using
// the VCL runtime or not, do a static link instead:
# define BOOST_REGEX_STATIC_LINK
# endif
//
// VCL support:
// if we're building a console app then there can't be any VCL (can there?)
# if !defined(__CONSOLE__) && !defined(_NO_VCL)
# define BOOST_REGEX_USE_VCL
# endif
//
// if this isn't Win32 then don't automatically select link
// libraries:
//
# ifndef _Windows
# ifndef BOOST_REGEX_NO_LIB
# define BOOST_REGEX_NO_LIB
# endif
# ifndef BOOST_REGEX_STATIC_LINK
# define BOOST_REGEX_STATIC_LINK
# endif
# endif
#if __BORLANDC__ < 0x600
//
// string workarounds:
//
#include <cstring>
#undef strcmp
#undef strcpy
#endif
#endif
include/boost/regex/config/cwchar.hpp
+207
View File
@@ -0,0 +1,207 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE boost/regex/config/cwchar.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: regex wide character string fixes.
*/
#ifndef BOOST_REGEX_CONFIG_CWCHAR_HPP
#define BOOST_REGEX_CONFIG_CWCHAR_HPP
#include <cwchar>
#include <cwctype>
#include <boost/config.hpp>
#if defined(__STD_RWCOMPILER_H__) || defined(_RWSTD_VER)
// apparently this is required for the RW STL on Linux:
#undef iswalnum
#undef iswalpha
#undef iswblank
#undef iswcntrl
#undef iswdigit
#undef iswgraph
#undef iswlower
#undef iswprint
#undef iswprint
#undef iswpunct
#undef iswspace
#undef iswupper
#undef iswxdigit
#undef iswctype
#undef towlower
#undef towupper
#undef towctrans
#undef wctrans
#undef wctype
#endif
namespace std{
#ifndef BOOST_NO_STDC_NAMESPACE
extern "C"{
#endif
#ifdef iswalnum
inline int (iswalnum)(wint_t i)
{ return iswalnum(i); }
#undef iswalnum
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswalnum;
#endif
#ifdef iswalpha
inline int (iswalpha)(wint_t i)
{ return iswalpha(i); }
#undef iswalpha
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswalpha;
#endif
#ifdef iswcntrl
inline int (iswcntrl)(wint_t i)
{ return iswcntrl(i); }
#undef iswcntrl
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswcntrl;
#endif
#ifdef iswdigit
inline int (iswdigit)(wint_t i)
{ return iswdigit(i); }
#undef iswdigit
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswdigit;
#endif
#ifdef iswgraph
inline int (iswgraph)(wint_t i)
{ return iswgraph(i); }
#undef iswgraph
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswgraph;
#endif
#ifdef iswlower
inline int (iswlower)(wint_t i)
{ return iswlower(i); }
#undef iswlower
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswlower;
#endif
#ifdef iswprint
inline int (iswprint)(wint_t i)
{ return iswprint(i); }
#undef iswprint
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswprint;
#endif
#ifdef iswpunct
inline int (iswpunct)(wint_t i)
{ return iswpunct(i); }
#undef iswpunct
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswpunct;
#endif
#ifdef iswspace
inline int (iswspace)(wint_t i)
{ return iswspace(i); }
#undef iswspace
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswspace;
#endif
#ifdef iswupper
inline int (iswupper)(wint_t i)
{ return iswupper(i); }
#undef iswupper
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswupper;
#endif
#ifdef iswxdigit
inline int (iswxdigit)(wint_t i)
{ return iswxdigit(i); }
#undef iswxdigit
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::iswxdigit;
#endif
#ifdef towlower
inline wint_t (towlower)(wint_t i)
{ return towlower(i); }
#undef towlower
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::towlower;
#endif
#ifdef towupper
inline wint_t (towupper)(wint_t i)
{ return towupper(i); }
#undef towupper
#elif defined(BOOST_NO_STDC_NAMESPACE)
using :: towupper;
#endif
#ifdef wcscmp
inline int (wcscmp)(const wchar_t *p1, const wchar_t *p2)
{ return wcscmp(p1,p2); }
#undef wcscmp
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::wcscmp;
#endif
#ifdef wcscoll
inline int (wcscoll)(const wchar_t *p1, const wchar_t *p2)
{ return wcscoll(p1,p2); }
#undef wcscoll
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::wcscoll;
#endif
#ifdef wcscpy
inline wchar_t *(wcscpy)(wchar_t *p1, const wchar_t *p2)
{ return wcscpy(p1,p2); }
#undef wcscpy
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::wcscpy;
#endif
#ifdef wcslen
inline size_t (wcslen)(const wchar_t *p)
{ return wcslen(p); }
#undef wcslen
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::wcslen;
#endif
#ifdef wcsxfrm
size_t wcsxfrm(wchar_t *p1, const wchar_t *p2, size_t s)
{ return wcsxfrm(p1,p2,s); }
#undef wcsxfrm
#elif defined(BOOST_NO_STDC_NAMESPACE)
using ::wcsxfrm;
#endif
#ifndef BOOST_NO_STDC_NAMESPACE
} // extern "C"
#endif
} // namespace std
#endif
include/boost/regex/icu.hpp
+974
View File
@@ -0,0 +1,974 @@
/*
*
* Copyright (c) 2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE icu.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Unicode regular expressions on top of the ICU Library.
*/
#ifndef BOOST_REGEX_ICU_HPP
#define BOOST_REGEX_ICU_HPP
#include <unicode/utypes.h>
#include <unicode/uchar.h>
#include <unicode/coll.h>
#include <boost/regex.hpp>
#include <boost/regex/pending/unicode_iterator.hpp>
#include <boost/mpl/int_fwd.hpp>
#include <bitset>
namespace boost{
namespace re_detail{
//
// Implementation details:
//
class BOOST_REGEX_DECL icu_regex_traits_implementation
{
typedef UChar32 char_type;
typedef std::size_t size_type;
typedef std::vector<char_type> string_type;
typedef U_NAMESPACE_QUALIFIER Locale locale_type;
typedef boost::uint_least32_t char_class_type;
public:
icu_regex_traits_implementation(const U_NAMESPACE_QUALIFIER Locale& l)
: m_locale(l)
{
UErrorCode success = U_ZERO_ERROR;
m_collator.reset(U_NAMESPACE_QUALIFIER Collator::createInstance(l, success));
if(U_SUCCESS(success) == 0)
init_error();
m_collator->setStrength(U_NAMESPACE_QUALIFIER Collator::IDENTICAL);
success = U_ZERO_ERROR;
m_primary_collator.reset(U_NAMESPACE_QUALIFIER Collator::createInstance(l, success));
if(U_SUCCESS(success) == 0)
init_error();
m_primary_collator->setStrength(U_NAMESPACE_QUALIFIER Collator::PRIMARY);
}
U_NAMESPACE_QUALIFIER Locale getloc()const
{
return m_locale;
}
string_type do_transform(const char_type* p1, const char_type* p2, const U_NAMESPACE_QUALIFIER Collator* pcoll) const;
string_type transform(const char_type* p1, const char_type* p2) const
{
return do_transform(p1, p2, m_collator.get());
}
string_type transform_primary(const char_type* p1, const char_type* p2) const
{
return do_transform(p1, p2, m_primary_collator.get());
}
private:
void init_error()
{
std::runtime_error e("Could not initialize ICU resources");
boost::throw_exception(e);
}
U_NAMESPACE_QUALIFIER Locale m_locale; // The ICU locale that we're using
boost::scoped_ptr< U_NAMESPACE_QUALIFIER Collator> m_collator; // The full collation object
boost::scoped_ptr< U_NAMESPACE_QUALIFIER Collator> m_primary_collator; // The primary collation object
};
inline boost::shared_ptr<icu_regex_traits_implementation> get_icu_regex_traits_implementation(const U_NAMESPACE_QUALIFIER Locale& loc)
{
return boost::shared_ptr<icu_regex_traits_implementation>(new icu_regex_traits_implementation(loc));
}
}
class BOOST_REGEX_DECL icu_regex_traits
{
public:
typedef UChar32 char_type;
typedef std::size_t size_type;
typedef std::vector<char_type> string_type;
typedef U_NAMESPACE_QUALIFIER Locale locale_type;
#ifdef BOOST_NO_INT64_T
typedef std::bitset<64> char_class_type;
#else
typedef boost::uint64_t char_class_type;
#endif
struct boost_extensions_tag{};
icu_regex_traits()
: m_pimpl(re_detail::get_icu_regex_traits_implementation(U_NAMESPACE_QUALIFIER Locale()))
{
}
static size_type length(const char_type* p);
::boost::regex_constants::syntax_type syntax_type(char_type c)const
{
return ((c < 0x7f) && (c > 0)) ? re_detail::get_default_syntax_type(static_cast<char>(c)) : regex_constants::syntax_char;
}
::boost::regex_constants::escape_syntax_type escape_syntax_type(char_type c) const
{
return ((c < 0x7f) && (c > 0)) ? re_detail::get_default_escape_syntax_type(static_cast<char>(c)) : regex_constants::syntax_char;
}
char_type translate(char_type c) const
{
return c;
}
char_type translate_nocase(char_type c) const
{
return ::u_tolower(c);
}
char_type translate(char_type c, bool icase) const
{
return icase ? translate_nocase(c) : translate(c);
}
char_type tolower(char_type c) const
{
return ::u_tolower(c);
}
char_type toupper(char_type c) const
{
return ::u_toupper(c);
}
string_type transform(const char_type* p1, const char_type* p2) const
{
return m_pimpl->transform(p1, p2);
}
string_type transform_primary(const char_type* p1, const char_type* p2) const
{
return m_pimpl->transform_primary(p1, p2);
}
char_class_type lookup_classname(const char_type* p1, const char_type* p2) const;
string_type lookup_collatename(const char_type* p1, const char_type* p2) const;
bool isctype(char_type c, char_class_type f) const;
int toi(const char_type*& p1, const char_type* p2, int radix)const
{
return re_detail::global_toi(p1, p2, radix, *this);
}
int value(char_type c, int radix)const
{
return u_digit(c, static_cast< ::int8_t>(radix));
}
locale_type imbue(locale_type l)
{
locale_type result(m_pimpl->getloc());
m_pimpl = re_detail::get_icu_regex_traits_implementation(l);
return result;
}
locale_type getloc()const
{
return locale_type();
}
std::string error_string(::boost::regex_constants::error_type n) const
{
return re_detail::get_default_error_string(n);
}
private:
icu_regex_traits(const icu_regex_traits&);
icu_regex_traits& operator=(const icu_regex_traits&);
//
// define the bitmasks offsets we need for additional character properties:
//
enum{
offset_blank = U_CHAR_CATEGORY_COUNT,
offset_space = U_CHAR_CATEGORY_COUNT+1,
offset_xdigit = U_CHAR_CATEGORY_COUNT+2,
offset_underscore = U_CHAR_CATEGORY_COUNT+3,
offset_unicode = U_CHAR_CATEGORY_COUNT+4,
offset_any = U_CHAR_CATEGORY_COUNT+5,
offset_ascii = U_CHAR_CATEGORY_COUNT+6
};
//
// and now the masks:
//
static const char_class_type mask_blank;
static const char_class_type mask_space;
static const char_class_type mask_xdigit;
static const char_class_type mask_underscore;
static const char_class_type mask_unicode;
static const char_class_type mask_any;
static const char_class_type mask_ascii;
static char_class_type lookup_icu_mask(const ::UChar32* p1, const ::UChar32* p2);
boost::shared_ptr< ::boost::re_detail::icu_regex_traits_implementation> m_pimpl;
};
// types:
typedef basic_regex< ::UChar32, icu_regex_traits> u32regex;
typedef match_results<const ::UChar32*> u32match;
typedef match_results<const ::UChar*> u16match;
//
// Construction of 32-bit regex types from UTF-8 and UTF-16 primitives:
//
namespace re_detail{
#if !defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(__IBMCPP__)
template <class InputIterator>
inline u32regex do_make_u32regex(InputIterator i,
InputIterator j,
boost::regex_constants::syntax_option_type opt,
const boost::mpl::int_<1>*)
{
typedef boost::u8_to_u32_iterator<InputIterator, UChar32> conv_type;
return u32regex(conv_type(i), conv_type(j), opt);
}
template <class InputIterator>
inline u32regex do_make_u32regex(InputIterator i,
InputIterator j,
boost::regex_constants::syntax_option_type opt,
const boost::mpl::int_<2>*)
{
typedef boost::u16_to_u32_iterator<InputIterator, UChar32> conv_type;
return u32regex(conv_type(i), conv_type(j), opt);
}
template <class InputIterator>
inline u32regex do_make_u32regex(InputIterator i,
InputIterator j,
boost::regex_constants::syntax_option_type opt,
const boost::mpl::int_<4>*)
{
return u32regex(i, j, opt);
}
#else
template <class InputIterator>
inline u32regex do_make_u32regex(InputIterator i,
InputIterator j,
boost::regex_constants::syntax_option_type opt,
const boost::mpl::int_<1>*)
{
typedef boost::u8_to_u32_iterator<InputIterator, UChar32> conv_type;
typedef std::vector<UChar32> vector_type;
vector_type v;
conv_type a(i), b(j);
while(a != b)
{
v.push_back(*a);
++a;
}
return u32regex(&*v.begin(), v.size(), opt);
}
template <class InputIterator>
inline u32regex do_make_u32regex(InputIterator i,
InputIterator j,
boost::regex_constants::syntax_option_type opt,
const boost::mpl::int_<2>*)
{
typedef boost::u16_to_u32_iterator<InputIterator, UChar32> conv_type;
typedef std::vector<UChar32> vector_type;
vector_type v;
conv_type a(i), b(j);
while(a != b)
{
v.push_back(*a);
++a;
}
return u32regex(&*v.begin(), v.size(), opt);
}
template <class InputIterator>
inline u32regex do_make_u32regex(InputIterator i,
InputIterator j,
boost::regex_constants::syntax_option_type opt,
const boost::mpl::int_<4>*)
{
typedef std::vector<UCHAR32> vector_type;
vector_type v;
while(i != j)
{
v.push_back((UCHAR32)(*i));
++a;
}
return u32regex(&*v.begin(), v.size(), opt);
}
#endif
}
//
// Construction from an iterator pair:
//
template <class InputIterator>
inline u32regex make_u32regex(InputIterator i,
InputIterator j,
boost::regex_constants::syntax_option_type opt)
{
return re_detail::do_make_u32regex(i, j, opt, static_cast<boost::mpl::int_<sizeof(*i)> const*>(0));
}
//
// construction from UTF-8 nul-terminated strings:
//
inline u32regex make_u32regex(const char* p, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl)
{
return re_detail::do_make_u32regex(p, p + std::strlen(p), opt, static_cast<boost::mpl::int_<1> const*>(0));
}
inline u32regex make_u32regex(const unsigned char* p, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl)
{
return re_detail::do_make_u32regex(p, p + std::strlen(reinterpret_cast<const char*>(p)), opt, static_cast<boost::mpl::int_<1> const*>(0));
}
//
// construction from UTF-16 nul-terminated strings:
//
#ifndef BOOST_NO_WREGEX
inline u32regex make_u32regex(const wchar_t* p, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl)
{
return re_detail::do_make_u32regex(p, p + std::wcslen(p), opt, static_cast<boost::mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
#ifndef U_WCHAR_IS_UTF16
inline u32regex make_u32regex(const UChar* p, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl)
{
return re_detail::do_make_u32regex(p, p + u_strlen(p), opt, static_cast<boost::mpl::int_<2> const*>(0));
}
#endif
//
// construction from basic_string class-template:
//
template<class C, class T, class A>
inline u32regex make_u32regex(const std::basic_string<C, T, A>& s, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl)
{
return re_detail::do_make_u32regex(s.begin(), s.end(), opt, static_cast<boost::mpl::int_<sizeof(C)> const*>(0));
}
//
// Construction from ICU string type:
//
inline u32regex make_u32regex(const UnicodeString& s, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl)
{
return re_detail::do_make_u32regex(s.getBuffer(), s.getBuffer() + s.length(), opt, static_cast<boost::mpl::int_<2> const*>(0));
}
//
// regex_match overloads that widen the character type as appropriate:
//
namespace re_detail{
template<class MR1, class MR2>
void copy_results(MR1& out, MR2 const& in)
{
// copy results from an adapted MR2 match_results:
out.set_size(in.size(), in.prefix().first.base(), in.suffix().second.base());
out.set_base(in.base().base());
for(int i = 0; i < (int)in.size(); ++i)
{
if(in[i].matched)
{
out.set_first(in[i].first.base(), i);
out.set_second(in[i].second.base(), i);
}
}
}
template <class BidiIterator, class Allocator>
inline bool do_regex_match(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const u32regex& e,
match_flag_type flags,
boost::mpl::int_<4> const*)
{
return ::boost::regex_match(first, last, m, e, flags);
}
template <class BidiIterator, class Allocator>
bool do_regex_match(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const u32regex& e,
match_flag_type flags,
boost::mpl::int_<2> const*)
{
typedef u16_to_u32_iterator<BidiIterator, UChar32> conv_type;
typedef match_results<conv_type> match_type;
typedef typename match_type::allocator_type alloc_type;
match_type what;
bool result = ::boost::regex_match(conv_type(first), conv_type(last), what, e, flags);
// copy results across to m:
if(result) copy_results(m, what);
return result;
}
template <class BidiIterator, class Allocator>
bool do_regex_match(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const u32regex& e,
match_flag_type flags,
boost::mpl::int_<1> const*)
{
typedef u8_to_u32_iterator<BidiIterator, UChar32> conv_type;
typedef match_results<conv_type> match_type;
typedef typename match_type::allocator_type alloc_type;
match_type what;
bool result = ::boost::regex_match(conv_type(first), conv_type(last), what, e, flags);
// copy results across to m:
if(result) copy_results(m, what);
return result;
}
} // namespace re_detail
template <class BidiIterator, class Allocator>
inline bool u32regex_match(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_match(first, last, m, e, flags, static_cast<mpl::int_<sizeof(*first)> const*>(0));
}
inline bool u32regex_match(const UChar* p,
match_results<const UChar*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_match(p, p+u_strlen(p), m, e, flags, static_cast<mpl::int_<2> const*>(0));
}
#if !defined(U_WCHAR_IS_UTF16) && !defined(BOOST_NO_WREGEX)
inline bool u32regex_match(const wchar_t* p,
match_results<const wchar_t*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_match(p, p+std::wcslen(p), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
inline bool u32regex_match(const char* p,
match_results<const char*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_match(p, p+std::strlen(p), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
inline bool u32regex_match(const unsigned char* p,
match_results<const unsigned char*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_match(p, p+std::strlen((const char*)p), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
inline bool u32regex_match(const std::string& s,
match_results<std::string::const_iterator>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_match(s.begin(), s.end(), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
#ifndef BOOST_NO_STD_WSTRING
inline bool u32regex_match(const std::wstring& s,
match_results<std::wstring::const_iterator>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_match(s.begin(), s.end(), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
inline bool u32regex_match(const UnicodeString& s,
match_results<const UChar*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_match(s.getBuffer(), s.getBuffer() + s.length(), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
//
// regex_match overloads that do not return what matched:
//
template <class BidiIterator>
inline bool u32regex_match(BidiIterator first, BidiIterator last,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<BidiIterator> m;
return re_detail::do_regex_match(first, last, m, e, flags, static_cast<mpl::int_<sizeof(*first)> const*>(0));
}
inline bool u32regex_match(const UChar* p,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const UChar*> m;
return re_detail::do_regex_match(p, p+u_strlen(p), m, e, flags, static_cast<mpl::int_<2> const*>(0));
}
#if !defined(U_WCHAR_IS_UTF16) && !defined(BOOST_NO_WREGEX)
inline bool u32regex_match(const wchar_t* p,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const wchar_t*> m;
return re_detail::do_regex_match(p, p+std::wcslen(p), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
inline bool u32regex_match(const char* p,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const char*> m;
return re_detail::do_regex_match(p, p+std::strlen(p), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
inline bool u32regex_match(const unsigned char* p,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const unsigned char*> m;
return re_detail::do_regex_match(p, p+std::strlen((const char*)p), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
inline bool u32regex_match(const std::string& s,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<std::string::const_iterator> m;
return re_detail::do_regex_match(s.begin(), s.end(), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
#ifndef BOOST_NO_STD_WSTRING
inline bool u32regex_match(const std::wstring& s,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<std::wstring::const_iterator> m;
return re_detail::do_regex_match(s.begin(), s.end(), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
inline bool u32regex_match(const UnicodeString& s,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const UChar*> m;
return re_detail::do_regex_match(s.getBuffer(), s.getBuffer() + s.length(), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
//
// regex_search overloads that widen the character type as appropriate:
//
namespace re_detail{
template <class BidiIterator, class Allocator>
inline bool do_regex_search(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const u32regex& e,
match_flag_type flags,
boost::mpl::int_<4> const*)
{
return ::boost::regex_search(first, last, m, e, flags);
}
template <class BidiIterator, class Allocator>
bool do_regex_search(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const u32regex& e,
match_flag_type flags,
boost::mpl::int_<2> const*)
{
typedef u16_to_u32_iterator<BidiIterator, UChar32> conv_type;
typedef match_results<conv_type> match_type;
typedef typename match_type::allocator_type alloc_type;
match_type what;
bool result = ::boost::regex_search(conv_type(first), conv_type(last), what, e, flags);
// copy results across to m:
if(result) copy_results(m, what);
return result;
}
template <class BidiIterator, class Allocator>
bool do_regex_search(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const u32regex& e,
match_flag_type flags,
boost::mpl::int_<1> const*)
{
typedef u8_to_u32_iterator<BidiIterator, UChar32> conv_type;
typedef match_results<conv_type> match_type;
typedef typename match_type::allocator_type alloc_type;
match_type what;
bool result = ::boost::regex_search(conv_type(first), conv_type(last), what, e, flags);
// copy results across to m:
if(result) copy_results(m, what);
return result;
}
}
template <class BidiIterator, class Allocator>
inline bool u32regex_search(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_search(first, last, m, e, flags, static_cast<mpl::int_<sizeof(*first)> const*>(0));
}
inline bool u32regex_search(const UChar* p,
match_results<const UChar*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_search(p, p+u_strlen(p), m, e, flags, static_cast<mpl::int_<2> const*>(0));
}
#if !defined(U_WCHAR_IS_UTF16) && !defined(BOOST_NO_WREGEX)
inline bool u32regex_search(const wchar_t* p,
match_results<const wchar_t*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_search(p, p+std::wcslen(p), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
inline bool u32regex_search(const char* p,
match_results<const char*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_search(p, p+std::strlen(p), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
inline bool u32regex_search(const unsigned char* p,
match_results<const unsigned char*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_search(p, p+std::strlen((const char*)p), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
inline bool u32regex_search(const std::string& s,
match_results<std::string::const_iterator>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_search(s.begin(), s.end(), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
#ifndef BOOST_NO_STD_WSTRING
inline bool u32regex_search(const std::wstring& s,
match_results<std::wstring::const_iterator>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_search(s.begin(), s.end(), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
inline bool u32regex_search(const UnicodeString& s,
match_results<const UChar*>& m,
const u32regex& e,
match_flag_type flags = match_default)
{
return re_detail::do_regex_search(s.getBuffer(), s.getBuffer() + s.length(), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
template <class BidiIterator>
inline bool u32regex_search(BidiIterator first, BidiIterator last,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<BidiIterator> m;
return re_detail::do_regex_search(first, last, m, e, flags, static_cast<mpl::int_<sizeof(*first)> const*>(0));
}
inline bool u32regex_search(const UChar* p,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const UChar*> m;
return re_detail::do_regex_search(p, p+u_strlen(p), m, e, flags, static_cast<mpl::int_<2> const*>(0));
}
#if !defined(U_WCHAR_IS_UTF16) && !defined(BOOST_NO_WREGEX)
inline bool u32regex_search(const wchar_t* p,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const wchar_t*> m;
return re_detail::do_regex_search(p, p+std::wcslen(p), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
inline bool u32regex_search(const char* p,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const char*> m;
return re_detail::do_regex_search(p, p+std::strlen(p), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
inline bool u32regex_search(const unsigned char* p,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const unsigned char*> m;
return re_detail::do_regex_search(p, p+std::strlen((const char*)p), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
inline bool u32regex_search(const std::string& s,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<std::string::const_iterator> m;
return re_detail::do_regex_search(s.begin(), s.end(), m, e, flags, static_cast<mpl::int_<1> const*>(0));
}
#ifndef BOOST_NO_STD_WSTRING
inline bool u32regex_search(const std::wstring& s,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<std::wstring::const_iterator> m;
return re_detail::do_regex_search(s.begin(), s.end(), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
#endif
inline bool u32regex_search(const UnicodeString& s,
const u32regex& e,
match_flag_type flags = match_default)
{
match_results<const UChar*> m;
return re_detail::do_regex_search(s.getBuffer(), s.getBuffer() + s.length(), m, e, flags, static_cast<mpl::int_<sizeof(wchar_t)> const*>(0));
}
//
// overloads for regex_replace with utf-8 and utf-16 data types:
//
namespace re_detail{
template <class I>
inline std::pair< boost::u8_to_u32_iterator<I>, boost::u8_to_u32_iterator<I> >
make_utf32_seq(I i, I j, mpl::int_<1> const*)
{
return std::pair< boost::u8_to_u32_iterator<I>, boost::u8_to_u32_iterator<I> >(boost::u8_to_u32_iterator<I>(i), boost::u8_to_u32_iterator<I>(j));
}
template <class I>
inline std::pair< boost::u16_to_u32_iterator<I>, boost::u16_to_u32_iterator<I> >
make_utf32_seq(I i, I j, mpl::int_<2> const*)
{
return std::pair< boost::u16_to_u32_iterator<I>, boost::u16_to_u32_iterator<I> >(boost::u16_to_u32_iterator<I>(i), boost::u16_to_u32_iterator<I>(j));
}
template <class I>
inline std::pair< I, I >
make_utf32_seq(I i, I j, mpl::int_<4> const*)
{
return std::pair< I, I >(i, j);
}
template <class charT>
inline std::pair< boost::u8_to_u32_iterator<const charT*>, boost::u8_to_u32_iterator<const charT*> >
make_utf32_seq(const charT* p, mpl::int_<1> const*)
{
return std::pair< boost::u8_to_u32_iterator<const charT*>, boost::u8_to_u32_iterator<const charT*> >(boost::u8_to_u32_iterator<const charT*>(p), boost::u8_to_u32_iterator<const charT*>(p+std::strlen((const char*)p)));
}
template <class charT>
inline std::pair< boost::u16_to_u32_iterator<const charT*>, boost::u16_to_u32_iterator<const charT*> >
make_utf32_seq(const charT* p, mpl::int_<2> const*)
{
return std::pair< boost::u16_to_u32_iterator<const charT*>, boost::u16_to_u32_iterator<const charT*> >(boost::u16_to_u32_iterator<const charT*>(p), boost::u16_to_u32_iterator<const charT*>(p+u_strlen((const UChar*)p)));
}
template <class charT>
inline std::pair< const charT*, const charT* >
make_utf32_seq(const charT* p, mpl::int_<4> const*)
{
return std::pair< const charT*, const charT* >(p, p+icu_regex_traits::length((UChar32 const*)p));
}
template <class OutputIterator>
inline OutputIterator make_utf32_out(OutputIterator o, mpl::int_<4> const*)
{
return o;
}
template <class OutputIterator>
inline utf16_output_iterator<OutputIterator> make_utf32_out(OutputIterator o, mpl::int_<2> const*)
{
return o;
}
template <class OutputIterator>
inline utf8_output_iterator<OutputIterator> make_utf32_out(OutputIterator o, mpl::int_<1> const*)
{
return o;
}
template <class OutputIterator, class I1, class I2>
OutputIterator do_regex_replace(OutputIterator out,
std::pair<I1, I1> const& in,
const u32regex& e,
const std::pair<I2, I2>& fmt,
match_flag_type flags
)
{
// unfortunately we have to copy the format string in order to pass in onward:
std::vector<UChar32> f;
#ifndef BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS
f.assign(fmt.first, fmt.second);
#else
f.clear();
I2 pos = fmt.first;
while(pos != fmt.second)
f.push_back(*pos++);
#endif
regex_iterator<I1, UChar32, icu_regex_traits> i(in.first, in.second, e, flags);
regex_iterator<I1, UChar32, icu_regex_traits> j;
if(i == j)
{
if(!(flags & regex_constants::format_no_copy))
out = re_detail::copy(in.first, in.second, out);
}
else
{
I1 last_m = in.first;
while(i != j)
{
if(!(flags & regex_constants::format_no_copy))
out = re_detail::copy(i->prefix().first, i->prefix().second, out);
out = ::boost::re_detail::regex_format_imp(out, *i, &*f.begin(), &*f.end(), flags, e.get_traits());
last_m = (*i)[0].second;
if(flags & regex_constants::format_first_only)
break;
++i;
}
if(!(flags & regex_constants::format_no_copy))
out = re_detail::copy(last_m, in.second, out);
}
return out;
}
template <class BaseIterator>
inline const BaseIterator& extract_output_base(const BaseIterator& b)
{
return b;
}
template <class BaseIterator>
inline BaseIterator extract_output_base(const utf8_output_iterator<BaseIterator>& b)
{
return b.base();
}
template <class BaseIterator>
inline BaseIterator extract_output_base(const utf16_output_iterator<BaseIterator>& b)
{
return b.base();
}
} // re_detail
template <class OutputIterator, class BidirectionalIterator, class charT>
inline OutputIterator u32regex_replace(OutputIterator out,
BidirectionalIterator first,
BidirectionalIterator last,
const u32regex& e,
const charT* fmt,
match_flag_type flags = match_default)
{
return re_detail::extract_output_base
#if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
<OutputIterator>
#endif
(
re_detail::do_regex_replace(
re_detail::make_utf32_out(out, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
re_detail::make_utf32_seq(first, last, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
e,
re_detail::make_utf32_seq(fmt, static_cast<mpl::int_<sizeof(*fmt)> const*>(0)),
flags)
);
}
template <class OutputIterator, class Iterator, class charT>
inline OutputIterator u32regex_replace(OutputIterator out,
Iterator first,
Iterator last,
const u32regex& e,
const std::basic_string<charT>& fmt,
match_flag_type flags = match_default)
{
return re_detail::extract_output_base
#if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
<OutputIterator>
#endif
(
re_detail::do_regex_replace(
re_detail::make_utf32_out(out, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
re_detail::make_utf32_seq(first, last, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
e,
re_detail::make_utf32_seq(fmt.begin(), fmt.end(), static_cast<mpl::int_<sizeof(charT)> const*>(0)),
flags)
);
}
template <class OutputIterator, class Iterator>
inline OutputIterator u32regex_replace(OutputIterator out,
Iterator first,
Iterator last,
const u32regex& e,
const UnicodeString& fmt,
match_flag_type flags = match_default)
{
return re_detail::extract_output_base
#if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
<OutputIterator>
#endif
(
re_detail::do_regex_replace(
re_detail::make_utf32_out(out, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
re_detail::make_utf32_seq(first, last, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
e,
re_detail::make_utf32_seq(fmt.getBuffer(), fmt.getBuffer() + fmt.length(), static_cast<mpl::int_<2> const*>(0)),
flags)
);
}
template <class charT>
std::basic_string<charT> u32regex_replace(const std::basic_string<charT>& s,
const u32regex& e,
const charT* fmt,
match_flag_type flags = match_default)
{
std::basic_string<charT> result;
re_detail::string_out_iterator<std::basic_string<charT> > i(result);
u32regex_replace(i, s.begin(), s.end(), e, fmt, flags);
return result;
}
template <class charT>
std::basic_string<charT> u32regex_replace(const std::basic_string<charT>& s,
const u32regex& e,
const std::basic_string<charT>& fmt,
match_flag_type flags = match_default)
{
std::basic_string<charT> result;
re_detail::string_out_iterator<std::basic_string<charT> > i(result);
u32regex_replace(i, s.begin(), s.end(), e, fmt.c_str(), flags);
return result;
}
namespace re_detail{
class unicode_string_out_iterator
{
UnicodeString* out;
public:
unicode_string_out_iterator(UnicodeString& s) : out(&s) {}
unicode_string_out_iterator& operator++() { return *this; }
unicode_string_out_iterator& operator++(int) { return *this; }
unicode_string_out_iterator& operator*() { return *this; }
unicode_string_out_iterator& operator=(UChar v)
{
*out += v;
return *this;
}
typedef std::ptrdiff_t difference_type;
typedef UChar value_type;
typedef value_type* pointer;
typedef value_type& reference;
typedef std::output_iterator_tag iterator_category;
};
}
inline UnicodeString u32regex_replace(const UnicodeString& s,
const u32regex& e,
const UChar* fmt,
match_flag_type flags = match_default)
{
UnicodeString result;
re_detail::unicode_string_out_iterator i(result);
u32regex_replace(i, s.getBuffer(), s.getBuffer()+s.length(), e, fmt, flags);
return result;
}
inline UnicodeString u32regex_replace(const UnicodeString& s,
const u32regex& e,
const UnicodeString& fmt,
match_flag_type flags = match_default)
{
UnicodeString result;
re_detail::unicode_string_out_iterator i(result);
re_detail::do_regex_replace(
re_detail::make_utf32_out(i, static_cast<mpl::int_<2> const*>(0)),
re_detail::make_utf32_seq(s.getBuffer(), s.getBuffer()+s.length(), static_cast<mpl::int_<2> const*>(0)),
e,
re_detail::make_utf32_seq(fmt.getBuffer(), fmt.getBuffer() + fmt.length(), static_cast<mpl::int_<2> const*>(0)),
flags);
return result;
}
} // namespace boost.
#include <boost/regex/v4/u32regex_iterator.hpp>
#include <boost/regex/v4/u32regex_token_iterator.hpp>
#endif
include/boost/regex/mfc.hpp
+190
View File
@@ -0,0 +1,190 @@
/*
*
* Copyright (c) 2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE mfc.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Overloads and helpers for using MFC/ATL string types with Boost.Regex.
*/
#ifndef BOOST_REGEX_MFC_HPP
#define BOOST_REGEX_MFC_HPP
#include <atlsimpstr.h>
#include <boost/regex.hpp>
namespace boost{
//
// define the types used for TCHAR's:
typedef basic_regex<TCHAR> tregex;
typedef match_results<TCHAR const*> tmatch;
typedef regex_iterator<TCHAR const*> tregex_iterator;
typedef regex_token_iterator<TCHAR const*> tregex_token_iterator;
#if _MSC_VER >= 1310
#define SIMPLE_STRING_PARAM class B, bool b
#define SIMPLE_STRING_ARG_LIST B, b
#else
#define SIMPLE_STRING_PARAM class B
#define SIMPLE_STRING_ARG_LIST B
#endif
//
// define regex creation functions:
//
template <SIMPLE_STRING_PARAM>
inline basic_regex<B>
make_regex(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s, ::boost::regex_constants::syntax_option_type f = boost::regex_constants::normal)
{
basic_regex<B> result(s.GetString(), s.GetString() + s.GetLength(), f);
return result;
}
//
// regex_match overloads:
//
template <SIMPLE_STRING_PARAM, class A, class T>
inline bool regex_match(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s,
match_results<const B*, A>& what,
const basic_regex<B, T>& e,
boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
{
return ::boost::regex_match(s.GetString(),
s.GetString() + s.GetLength(),
what,
e,
f);
}
template <SIMPLE_STRING_PARAM, class T>
inline bool regex_match(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s,
const basic_regex<B, T>& e,
boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
{
return ::boost::regex_match(s.GetString(),
s.GetString() + s.GetLength(),
e,
f);
}
//
// regex_search overloads:
//
template <SIMPLE_STRING_PARAM, class A, class T>
inline bool regex_search(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s,
match_results<const B*, A>& what,
const basic_regex<B, T>& e,
boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
{
return ::boost::regex_search(s.GetString(),
s.GetString() + s.GetLength(),
what,
e,
f);
}
template <SIMPLE_STRING_PARAM, class T>
inline bool regex_search(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s,
const basic_regex<B, T>& e,
boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
{
return ::boost::regex_search(s.GetString(),
s.GetString() + s.GetLength(),
e,
f);
}
//
// regex_iterator creation:
//
template <SIMPLE_STRING_PARAM>
inline regex_iterator<B const*>
make_regex_iterator(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s, const basic_regex<B>& e, ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
{
regex_iterator<B const*> result(s.GetString(), s.GetString() + s.GetLength(), e, f);
return result;
}
template <SIMPLE_STRING_PARAM>
inline regex_token_iterator<B const*>
make_regex_token_iterator(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s, const basic_regex<B>& e, int sub = 0, ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
{
regex_token_iterator<B const*> result(s.GetString(), s.GetString() + s.GetLength(), e, sub, f);
return result;
}
template <SIMPLE_STRING_PARAM>
inline regex_token_iterator<B const*>
make_regex_token_iterator(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s, const basic_regex<B>& e, const std::vector<int>& subs, ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
{
regex_token_iterator<B const*> result(s.GetString(), s.GetString() + s.GetLength(), e, subs, f);
return result;
}
template <SIMPLE_STRING_PARAM, std::size_t N>
inline regex_token_iterator<B const*>
make_regex_token_iterator(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s, const basic_regex<B>& e, const int (& subs)[N], ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
{
regex_token_iterator<B const*> result(s.GetString(), s.GetString() + s.GetLength(), e, subs, f);
return result;
}
template <class OutputIterator, class BidirectionalIterator, class traits,
SIMPLE_STRING_PARAM>
OutputIterator regex_replace(OutputIterator out,
BidirectionalIterator first,
BidirectionalIterator last,
const basic_regex<B, traits>& e,
const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& fmt,
match_flag_type flags = match_default)
{
return ::boost::regex_replace(out, first, last, e, fmt.GetString(), flags);
}
namespace re_detail{
template <SIMPLE_STRING_PARAM>
class mfc_string_out_iterator
{
ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>* out;
public:
mfc_string_out_iterator(ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s) : out(&s) {}
mfc_string_out_iterator& operator++() { return *this; }
mfc_string_out_iterator& operator++(int) { return *this; }
mfc_string_out_iterator& operator*() { return *this; }
mfc_string_out_iterator& operator=(B v)
{
out->AppendChar(v);
return *this;
}
typedef std::ptrdiff_t difference_type;
typedef B value_type;
typedef value_type* pointer;
typedef value_type& reference;
typedef std::output_iterator_tag iterator_category;
};
}
template <class traits, SIMPLE_STRING_PARAM>
ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST> regex_replace(const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& s,
const basic_regex<B, traits>& e,
const ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST>& fmt,
match_flag_type flags = match_default)
{
ATL::CSimpleStringT<SIMPLE_STRING_ARG_LIST> result(s.GetManager());
re_detail::mfc_string_out_iterator<SIMPLE_STRING_ARG_LIST> i(result);
regex_replace(i, s.GetString(), s.GetString() + s.GetLength(), e, fmt.GetString(), flags);
return result;
}
} // namespace boost.
#endif
include/boost/regex/pattern_except.hpp
+83
View File
@@ -0,0 +1,83 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE pattern_except.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares pattern-matching exception classes.
*/
#ifndef BOOST_RE_PAT_EXCEPT_HPP
#define BOOST_RE_PAT_EXCEPT_HPP
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#include <stdexcept>
#include <cstddef>
#include <boost/regex/v4/error_type.hpp>
namespace boost{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable : 4275)
#endif
class BOOST_REGEX_DECL regex_error : public std::runtime_error
{
public:
explicit regex_error(const std::string& s, regex_constants::error_type err = regex_constants::error_unknown, std::ptrdiff_t pos = 0);
explicit regex_error(regex_constants::error_type err);
~regex_error() throw();
regex_constants::error_type code()const
{ return m_error_code; }
std::ptrdiff_t position()const
{ return m_position; }
void raise()const;
private:
regex_constants::error_type m_error_code;
std::ptrdiff_t m_position;
};
typedef regex_error bad_pattern;
typedef regex_error bad_expression;
namespace re_detail{
BOOST_REGEX_DECL void BOOST_REGEX_CALL raise_runtime_error(const std::runtime_error& ex);
template <class traits>
void raise_error(const traits& t, regex_constants::error_type code)
{
(void)t; // warning suppression
std::runtime_error e(t.error_string(code));
::boost::re_detail::raise_runtime_error(e);
}
}
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace boost
#endif
include/boost/regex/pending/object_cache.hpp
+163
View File
@@ -0,0 +1,163 @@
/*
*
* Copyright (c) 2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE object_cache.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Implements a generic object cache.
*/
#ifndef BOOST_REGEX_OBJECT_CACHE_HPP
#define BOOST_REGEX_OBJECT_CACHE_HPP
#include <map>
#include <list>
#include <stdexcept>
#include <string>
#include <boost/config.hpp>
#include <boost/shared_ptr.hpp>
#ifdef BOOST_HAS_THREADS
#include <boost/regex/pending/static_mutex.hpp>
#endif
namespace boost{
template <class Key, class Object>
class object_cache
{
public:
typedef std::pair< ::boost::shared_ptr<Object>, Key const*> value_type;
typedef std::list<value_type> list_type;
typedef typename list_type::iterator list_iterator;
typedef std::map<Key, list_iterator> map_type;
typedef typename map_type::iterator map_iterator;
typedef typename list_type::size_type size_type;
static boost::shared_ptr<Object> get(const Key& k, size_type max_cache_size);
private:
static boost::shared_ptr<Object> do_get(const Key& k, size_type max_cache_size);
struct data
{
list_type cont;
map_type index;
};
// Needed by compilers not implementing the resolution to DR45. For reference,
// see http://www.open-std.org/JTC1/SC22/WG21/docs/cwg_defects.html#45.
friend struct data;
};
template <class Key, class Object>
boost::shared_ptr<Object> object_cache<Key, Object>::get(const Key& k, size_type max_cache_size)
{
#ifdef BOOST_HAS_THREADS
static boost::static_mutex mut = BOOST_STATIC_MUTEX_INIT;
boost::static_mutex::scoped_lock l(mut);
if(l)
{
return do_get(k, max_cache_size);
}
//
// what do we do if the lock fails?
// for now just throw, but we should never really get here...
//
::boost::throw_exception(std::runtime_error("Error in thread safety code: could not acquire a lock"));
return boost::shared_ptr<Object>();
#else
return do_get(k, max_cache_size);
#endif
}
template <class Key, class Object>
boost::shared_ptr<Object> object_cache<Key, Object>::do_get(const Key& k, size_type max_cache_size)
{
typedef typename object_cache<Key, Object>::data object_data;
typedef typename list_type::size_type list_size_type;
static object_data s_data;
//
// see if the object is already in the cache:
//
map_iterator mpos = s_data.index.find(k);
if(mpos != s_data.index.end())
{
//
// Eureka!
// We have a cached item, bump it up the list and return it:
//
if(--(s_data.cont.end()) != mpos->second)
{
// splice out the item we want to move:
list_type temp;
temp.splice(temp.end(), s_data.cont, mpos->second);
// and now place it at the end of the list:
s_data.cont.splice(s_data.cont.end(), temp, temp.begin());
BOOST_ASSERT(*(s_data.cont.back().second) == k);
// update index with new position:
mpos->second = --(s_data.cont.end());
BOOST_ASSERT(&(mpos->first) == mpos->second->second);
BOOST_ASSERT(&(mpos->first) == s_data.cont.back().second);
}
return s_data.cont.back().first;
}
//
// if we get here then the item is not in the cache,
// so create it:
//
boost::shared_ptr<Object> result(new Object(k));
//
// Add it to the list, and index it:
//
s_data.cont.push_back(value_type(result, 0));
s_data.index.insert(std::make_pair(k, --(s_data.cont.end())));
s_data.cont.back().second = &(s_data.index.find(k)->first);
list_size_type s = s_data.cont.size();
BOOST_ASSERT(s_data.index[k]->first.get() == result.get());
BOOST_ASSERT(&(s_data.index.find(k)->first) == s_data.cont.back().second);
BOOST_ASSERT(s_data.index.find(k)->first == k);
if(s > max_cache_size)
{
//
// We have too many items in the list, so we need to start
// popping them off the back of the list, but only if they're
// being held uniquely by us:
//
list_iterator pos = s_data.cont.begin();
list_iterator last = s_data.cont.end();
while((pos != last) && (s > max_cache_size))
{
if(pos->first.unique())
{
list_iterator condemmed(pos);
++pos;
// now remove the items from our containers,
// then order has to be as follows:
BOOST_ASSERT(s_data.index.find(*(condemmed->second)) != s_data.index.end());
s_data.index.erase(*(condemmed->second));
s_data.cont.erase(condemmed);
--s;
}
else
--pos;
}
BOOST_ASSERT(s_data.index[k]->first.get() == result.get());
BOOST_ASSERT(&(s_data.index.find(k)->first) == s_data.cont.back().second);
BOOST_ASSERT(s_data.index.find(k)->first == k);
}
return result;
}
}
#endif
include/boost/regex/pending/static_mutex.hpp
+177
View File
@@ -0,0 +1,177 @@
/*
*
* Copyright (c) 2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE static_mutex.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares static_mutex lock type, there are three different
* implementations: POSIX pthreads, WIN32 threads, and portable,
* these are described in more detail below.
*/
#ifndef BOOST_REGEX_STATIC_MUTEX_HPP
#define BOOST_REGEX_STATIC_MUTEX_HPP
#include <boost/config.hpp>
#include <boost/regex/config.hpp> // dll import/export options.
#ifdef BOOST_HAS_PTHREADS
#include <pthread.h>
#endif
#if defined(BOOST_HAS_PTHREADS) && defined(PTHREAD_MUTEX_INITIALIZER)
//
// pthreads version:
// simple wrap around a pthread_mutex_t initialized with
// PTHREAD_MUTEX_INITIALIZER.
//
namespace boost{
class BOOST_REGEX_DECL scoped_static_mutex_lock;
class static_mutex
{
public:
typedef scoped_static_mutex_lock scoped_lock;
pthread_mutex_t m_mutex;
};
#define BOOST_STATIC_MUTEX_INIT { PTHREAD_MUTEX_INITIALIZER, }
class BOOST_REGEX_DECL scoped_static_mutex_lock
{
public:
scoped_static_mutex_lock(static_mutex& mut, bool lk = true);
~scoped_static_mutex_lock();
inline bool locked()const
{
return m_have_lock;
}
inline operator void const*()const
{
return locked() ? this : 0;
}
void lock();
void unlock();
private:
static_mutex& m_mutex;
bool m_have_lock;
};
} // namespace boost
#elif defined(BOOST_HAS_WINTHREADS)
//
// Win32 version:
// Use a 32-bit int as a lock, along with a test-and-set
// implementation using InterlockedCompareExchange.
//
#include <boost/cstdint.hpp>
namespace boost{
class BOOST_REGEX_DECL scoped_static_mutex_lock;
class static_mutex
{
public:
typedef scoped_static_mutex_lock scoped_lock;
boost::int32_t m_mutex;
};
#define BOOST_STATIC_MUTEX_INIT { 0, }
class BOOST_REGEX_DECL scoped_static_mutex_lock
{
public:
scoped_static_mutex_lock(static_mutex& mut, bool lk = true);
~scoped_static_mutex_lock();
operator void const*()const;
bool locked()const;
void lock();
void unlock();
private:
static_mutex& m_mutex;
bool m_have_lock;
scoped_static_mutex_lock(const scoped_static_mutex_lock&);
scoped_static_mutex_lock& operator=(const scoped_static_mutex_lock&);
};
inline scoped_static_mutex_lock::operator void const*()const
{
return locked() ? this : 0;
}
inline bool scoped_static_mutex_lock::locked()const
{
return m_have_lock;
}
} // namespace
#else
//
// Portable version of a static mutex based on Boost.Thread library:
// This has to use a single mutex shared by all instances of static_mutex
// because boost::call_once doesn't alow us to pass instance information
// down to the initialisation proceedure. In fact the initialisation routine
// may need to be called more than once - but only once per instance.
//
#include <boost/thread/once.hpp>
#include <boost/thread/recursive_mutex.hpp>
namespace boost{
class BOOST_REGEX_DECL scoped_static_mutex_lock;
extern "C" BOOST_REGEX_DECL void free_static_mutex();
class BOOST_REGEX_DECL static_mutex
{
public:
typedef scoped_static_mutex_lock scoped_lock;
static void init();
static boost::recursive_mutex* m_pmutex;
static boost::once_flag m_once;
};
#define BOOST_STATIC_MUTEX_INIT { }
class BOOST_REGEX_DECL scoped_static_mutex_lock
{
public:
scoped_static_mutex_lock(static_mutex& mut, bool lk = true);
~scoped_static_mutex_lock();
operator void const*()const;
bool locked()const;
void lock();
void unlock();
private:
boost::recursive_mutex::scoped_lock* m_plock;
bool m_have_lock;
};
inline scoped_static_mutex_lock::operator void const*()const
{
return locked() ? this : 0;
}
inline bool scoped_static_mutex_lock::locked()const
{
return m_have_lock;
}
} // namespace
#endif
#endif
include/boost/regex/pending/unicode_iterator.hpp
+689
View File
@@ -0,0 +1,689 @@
/*
*
* Copyright (c) 2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE unicode_iterator.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Iterator adapters for converting between different Unicode encodings.
*/
/****************************************************************************
Contents:
~~~~~~~~~
1) Read Only, Input Adapters:
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template <class BaseIterator, class U8Type = ::boost::uint8_t>
class u32_to_u8_iterator;
Adapts sequence of UTF-32 code points to "look like" a sequence of UTF-8.
template <class BaseIterator, class U32Type = ::boost::uint32_t>
class u8_to_u32_iterator;
Adapts sequence of UTF-8 code points to "look like" a sequence of UTF-32.
template <class BaseIterator, class U16Type = ::boost::uint16_t>
class u32_to_u16_iterator;
Adapts sequence of UTF-32 code points to "look like" a sequence of UTF-16.
template <class BaseIterator, class U32Type = ::boost::uint32_t>
class u16_to_u32_iterator;
Adapts sequence of UTF-16 code points to "look like" a sequence of UTF-32.
2) Single pass output iterator adapters:
template <class BaseIterator>
class utf8_output_iterator;
Accepts UTF-32 code points and forwards them on as UTF-8 code points.
template <class BaseIterator>
class utf16_output_iterator;
Accepts UTF-32 code points and forwards them on as UTF-16 code points.
****************************************************************************/
#ifndef BOOST_REGEX_UNICODE_ITERATOR_HPP
#define BOOST_REGEX_UNICODE_ITERATOR_HPP
#include <boost/cstdint.hpp>
#include <boost/assert.hpp>
#include <boost/iterator/iterator_facade.hpp>
#include <boost/static_assert.hpp>
#include <boost/throw_exception.hpp>
#include <stdexcept>
#ifndef BOOST_NO_STD_LOCALE
#include <sstream>
#endif
namespace boost{
namespace detail{
static const ::boost::uint16_t high_surrogate_base = 0xD7C0u;
static const ::boost::uint16_t low_surrogate_base = 0xDC00u;
static const ::boost::uint32_t ten_bit_mask = 0x3FFu;
inline bool is_high_surrogate(::boost::uint16_t v)
{
return (v & 0xFC00u) == 0xd800u;
}
inline bool is_low_surrogate(::boost::uint16_t v)
{
return (v & 0xFC00u) == 0xdc00u;
}
template <class T>
inline bool is_surrogate(T v)
{
return (v & 0xF800u) == 0xd800;
}
inline unsigned utf8_byte_count(boost::uint8_t c)
{
// if the most significant bit with a zero in it is in position
// 8-N then there are N bytes in this UTF-8 sequence:
boost::uint8_t mask = 0x80u;
unsigned result = 0;
while(c & mask)
{
++result;
mask >>= 1;
}
return (result == 0) ? 1 : ((result > 4) ? 4 : result);
}
inline unsigned utf8_trailing_byte_count(boost::uint8_t c)
{
return utf8_byte_count(c) - 1;
}
inline void invalid_utf32_code_point(::boost::uint32_t val)
{
#ifndef BOOST_NO_STD_LOCALE
std::stringstream ss;
ss << "Invalid UTF-32 code point U+" << std::showbase << std::hex << val << " encountered while trying to encode UTF-16 sequence";
std::out_of_range e(ss.str());
#else
std::out_of_range e("Invalid UTF-32 code point encountered while trying to encode UTF-16 sequence");
#endif
boost::throw_exception(e);
}
} // namespace detail
template <class BaseIterator, class U16Type = ::boost::uint16_t>
class u32_to_u16_iterator
: public boost::iterator_facade<u32_to_u16_iterator<BaseIterator, U16Type>, U16Type, std::bidirectional_iterator_tag, const U16Type>
{
typedef boost::iterator_facade<u32_to_u16_iterator<BaseIterator, U16Type>, U16Type, std::bidirectional_iterator_tag, const U16Type> base_type;
#if !defined(BOOST_NO_STD_ITERATOR_TRAITS) && !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
typedef typename std::iterator_traits<BaseIterator>::value_type base_value_type;
BOOST_STATIC_ASSERT(sizeof(base_value_type)*CHAR_BIT == 32);
BOOST_STATIC_ASSERT(sizeof(U16Type)*CHAR_BIT == 16);
#endif
public:
typename base_type::reference
dereference()const
{
if(m_current == 2)
extract_current();
return m_values[m_current];
}
bool equal(const u32_to_u16_iterator& that)const
{
if(m_position == that.m_position)
{
// Both m_currents must be equal, or both even
// this is the same as saying their sum must be even:
return (m_current + that.m_current) & 1u ? false : true;
}
return false;
}
void increment()
{
// if we have a pending read then read now, so that we know whether
// to skip a position, or move to a low-surrogate:
if(m_current == 2)
{
// pending read:
extract_current();
}
// move to the next surrogate position:
++m_current;
// if we've reached the end skip a position:
if(m_values[m_current] == 0)
{
m_current = 2;
++m_position;
}
}
void decrement()
{
if(m_current != 1)
{
// decrementing an iterator always leads to a valid position:
--m_position;
extract_current();
m_current = m_values[1] ? 1 : 0;
}
else
{
m_current = 0;
}
}
BaseIterator base()const
{
return m_position;
}
// construct:
u32_to_u16_iterator() : m_position(), m_current(0)
{
m_values[0] = 0;
m_values[1] = 0;
m_values[2] = 0;
}
u32_to_u16_iterator(BaseIterator b) : m_position(b), m_current(2)
{
m_values[0] = 0;
m_values[1] = 0;
m_values[2] = 0;
}
private:
void extract_current()const
{
// begin by checking for a code point out of range:
::boost::uint32_t v = *m_position;
if(v >= 0x10000u)
{
if(v > 0x10FFFFu)
detail::invalid_utf32_code_point(*m_position);
// split into two surrogates:
m_values[0] = static_cast<U16Type>(v >> 10) + detail::high_surrogate_base;
m_values[1] = static_cast<U16Type>(v & detail::ten_bit_mask) + detail::low_surrogate_base;
m_current = 0;
BOOST_ASSERT(detail::is_high_surrogate(m_values[0]));
BOOST_ASSERT(detail::is_low_surrogate(m_values[1]));
}
else
{
// 16-bit code point:
m_values[0] = static_cast<U16Type>(*m_position);
m_values[1] = 0;
m_current = 0;
// value must not be a surrogate:
if(detail::is_surrogate(m_values[0]))
detail::invalid_utf32_code_point(*m_position);
}
}
BaseIterator m_position;
mutable U16Type m_values[3];
mutable unsigned m_current;
};
template <class BaseIterator, class U32Type = ::boost::uint32_t>
class u16_to_u32_iterator
: public boost::iterator_facade<u16_to_u32_iterator<BaseIterator, U32Type>, U32Type, std::bidirectional_iterator_tag, const U32Type>
{
typedef boost::iterator_facade<u16_to_u32_iterator<BaseIterator, U32Type>, U32Type, std::bidirectional_iterator_tag, const U32Type> base_type;
// special values for pending iterator reads:
BOOST_STATIC_CONSTANT(U32Type, pending_read = 0xffffffffu);
#if !defined(BOOST_NO_STD_ITERATOR_TRAITS) && !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
typedef typename std::iterator_traits<BaseIterator>::value_type base_value_type;
BOOST_STATIC_ASSERT(sizeof(base_value_type)*CHAR_BIT == 16);
BOOST_STATIC_ASSERT(sizeof(U32Type)*CHAR_BIT == 32);
#endif
public:
typename base_type::reference
dereference()const
{
if(m_value == pending_read)
extract_current();
return m_value;
}
bool equal(const u16_to_u32_iterator& that)const
{
return m_position == that.m_position;
}
void increment()
{
// skip high surrogate first if there is one:
if(detail::is_high_surrogate(*m_position)) ++m_position;
++m_position;
m_value = pending_read;
}
void decrement()
{
--m_position;
// if we have a low surrogate then go back one more:
if(detail::is_low_surrogate(*m_position))
--m_position;
m_value = pending_read;
}
BaseIterator base()const
{
return m_position;
}
// construct:
u16_to_u32_iterator() : m_position()
{
m_value = pending_read;
}
u16_to_u32_iterator(BaseIterator b) : m_position(b)
{
m_value = pending_read;
}
private:
static void invalid_code_point(::boost::uint16_t val)
{
#ifndef BOOST_NO_STD_LOCALE
std::stringstream ss;
ss << "Misplaced UTF-16 surrogate U+" << std::showbase << std::hex << val << " encountered while trying to encode UTF-32 sequence";
std::out_of_range e(ss.str());
#else
std::out_of_range e("Misplaced UTF-16 surrogate encountered while trying to encode UTF-32 sequence");
#endif
boost::throw_exception(e);
}
void extract_current()const
{
m_value = static_cast<U32Type>(static_cast< ::boost::uint16_t>(*m_position));
// if the last value is a high surrogate then adjust m_position and m_value as needed:
if(detail::is_high_surrogate(*m_position))
{
// precondition; next value must have be a low-surrogate:
BaseIterator next(m_position);
::boost::uint16_t t = *++next;
if((t & 0xFC00u) != 0xDC00u)
invalid_code_point(t);
m_value = (m_value - detail::high_surrogate_base) << 10;
m_value |= (static_cast<U32Type>(static_cast< ::boost::uint16_t>(t)) & detail::ten_bit_mask);
}
// postcondition; result must not be a surrogate:
if(detail::is_surrogate(m_value))
invalid_code_point(static_cast< ::boost::uint16_t>(m_value));
}
BaseIterator m_position;
mutable U32Type m_value;
};
template <class BaseIterator, class U8Type = ::boost::uint8_t>
class u32_to_u8_iterator
: public boost::iterator_facade<u32_to_u8_iterator<BaseIterator, U8Type>, U8Type, std::bidirectional_iterator_tag, const U8Type>
{
typedef boost::iterator_facade<u32_to_u8_iterator<BaseIterator, U8Type>, U8Type, std::bidirectional_iterator_tag, const U8Type> base_type;
#if !defined(BOOST_NO_STD_ITERATOR_TRAITS) && !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
typedef typename std::iterator_traits<BaseIterator>::value_type base_value_type;
BOOST_STATIC_ASSERT(sizeof(base_value_type)*CHAR_BIT == 32);
BOOST_STATIC_ASSERT(sizeof(U8Type)*CHAR_BIT == 8);
#endif
public:
typename base_type::reference
dereference()const
{
if(m_current == 4)
extract_current();
return m_values[m_current];
}
bool equal(const u32_to_u8_iterator& that)const
{
if(m_position == that.m_position)
{
// either the m_current's must be equal, or one must be 0 and
// the other 4: which means neither must have bits 1 or 2 set:
return (m_current == that.m_current)
|| (((m_current | that.m_current) & 3) == 0);
}
return false;
}
void increment()
{
// if we have a pending read then read now, so that we know whether
// to skip a position, or move to a low-surrogate:
if(m_current == 4)
{
// pending read:
extract_current();
}
// move to the next surrogate position:
++m_current;
// if we've reached the end skip a position:
if(m_values[m_current] == 0)
{
m_current = 4;
++m_position;
}
}
void decrement()
{
if((m_current & 3) == 0)
{
--m_position;
extract_current();
m_current = 3;
while(m_current && (m_values[m_current] == 0))
--m_current;
}
else
--m_current;
}
BaseIterator base()const
{
return m_position;
}
// construct:
u32_to_u8_iterator() : m_position(), m_current(0)
{
m_values[0] = 0;
m_values[1] = 0;
m_values[2] = 0;
m_values[3] = 0;
m_values[4] = 0;
}
u32_to_u8_iterator(BaseIterator b) : m_position(b), m_current(4)
{
m_values[0] = 0;
m_values[1] = 0;
m_values[2] = 0;
m_values[3] = 0;
m_values[4] = 0;
}
private:
void extract_current()const
{
boost::uint32_t c = *m_position;
if(c > 0x10FFFFu)
detail::invalid_utf32_code_point(c);
if(c < 0x80u)
{
m_values[0] = static_cast<unsigned char>(c);
m_values[1] = static_cast<unsigned char>(0u);
m_values[2] = static_cast<unsigned char>(0u);
m_values[3] = static_cast<unsigned char>(0u);
}
else if(c < 0x800u)
{
m_values[0] = static_cast<unsigned char>(0xC0u + (c >> 6));
m_values[1] = static_cast<unsigned char>(0x80u + (c & 0x3Fu));
m_values[2] = static_cast<unsigned char>(0u);
m_values[3] = static_cast<unsigned char>(0u);
}
else if(c < 0x10000u)
{
m_values[0] = static_cast<unsigned char>(0xE0u + (c >> 12));
m_values[1] = static_cast<unsigned char>(0x80u + ((c >> 6) & 0x3Fu));
m_values[2] = static_cast<unsigned char>(0x80u + (c & 0x3Fu));
m_values[3] = static_cast<unsigned char>(0u);
}
else
{
m_values[0] = static_cast<unsigned char>(0xF0u + (c >> 18));
m_values[1] = static_cast<unsigned char>(0x80u + ((c >> 12) & 0x3Fu));
m_values[2] = static_cast<unsigned char>(0x80u + ((c >> 6) & 0x3Fu));
m_values[3] = static_cast<unsigned char>(0x80u + (c & 0x3Fu));
}
m_current= 0;
}
BaseIterator m_position;
mutable U8Type m_values[5];
mutable unsigned m_current;
};
template <class BaseIterator, class U32Type = ::boost::uint32_t>
class u8_to_u32_iterator
: public boost::iterator_facade<u8_to_u32_iterator<BaseIterator, U32Type>, U32Type, std::bidirectional_iterator_tag, const U32Type>
{
typedef boost::iterator_facade<u8_to_u32_iterator<BaseIterator, U32Type>, U32Type, std::bidirectional_iterator_tag, const U32Type> base_type;
// special values for pending iterator reads:
BOOST_STATIC_CONSTANT(U32Type, pending_read = 0xffffffffu);
#if !defined(BOOST_NO_STD_ITERATOR_TRAITS) && !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
typedef typename std::iterator_traits<BaseIterator>::value_type base_value_type;
BOOST_STATIC_ASSERT(sizeof(base_value_type)*CHAR_BIT == 8);
BOOST_STATIC_ASSERT(sizeof(U32Type)*CHAR_BIT == 32);
#endif
public:
typename base_type::reference
dereference()const
{
if(m_value == pending_read)
extract_current();
return m_value;
}
bool equal(const u8_to_u32_iterator& that)const
{
return m_position == that.m_position;
}
void increment()
{
// skip high surrogate first if there is one:
unsigned c = detail::utf8_byte_count(*m_position);
std::advance(m_position, c);
m_value = pending_read;
}
void decrement()
{
// Keep backtracking until we don't have a trailing character:
unsigned count = 0;
while((*--m_position & 0xC0u) == 0x80u) ++count;
// now check that the sequence was valid:
if(count != detail::utf8_trailing_byte_count(*m_position))
invalid_sequnce();
m_value = pending_read;
}
BaseIterator base()const
{
return m_position;
}
// construct:
u8_to_u32_iterator() : m_position()
{
m_value = pending_read;
}
u8_to_u32_iterator(BaseIterator b) : m_position(b)
{
m_value = pending_read;
}
private:
static void invalid_sequnce()
{
std::out_of_range e("Invalid UTF-8 sequence encountered while trying to encode UTF-32 character");
boost::throw_exception(e);
}
void extract_current()const
{
m_value = static_cast<U32Type>(static_cast< ::boost::uint8_t>(*m_position));
// we must not have a continuation character:
if((m_value & 0xC0u) == 0x80u)
invalid_sequnce();
// see how many extra byts we have:
unsigned extra = detail::utf8_trailing_byte_count(*m_position);
// extract the extra bits, 6 from each extra byte:
BaseIterator next(m_position);
for(unsigned c = 0; c < extra; ++c)
{
++next;
m_value <<= 6;
m_value += static_cast<boost::uint8_t>(*next) & 0x3Fu;
}
// we now need to remove a few of the leftmost bits, but how many depends
// upon how many extra bytes we've extracted:
static const boost::uint32_t masks[4] =
{
0x7Fu,
0x7FFu,
0xFFFFu,
0x1FFFFFu,
};
m_value &= masks[extra];
// check the result:
if(m_value > static_cast<U32Type>(0x10FFFFu))
invalid_sequnce();
}
BaseIterator m_position;
mutable U32Type m_value;
};
template <class BaseIterator>
class utf16_output_iterator
{
public:
typedef void difference_type;
typedef void value_type;
typedef boost::uint32_t* pointer;
typedef boost::uint32_t& reference;
typedef std::output_iterator_tag iterator_category;
utf16_output_iterator(const BaseIterator& b)
: m_position(b){}
utf16_output_iterator(const utf16_output_iterator& that)
: m_position(that.m_position){}
utf16_output_iterator& operator=(const utf16_output_iterator& that)
{
m_position = that.m_position;
return *this;
}
const utf16_output_iterator& operator*()const
{
return *this;
}
void operator=(boost::uint32_t val)const
{
push(val);
}
utf16_output_iterator& operator++()
{
return *this;
}
utf16_output_iterator& operator++(int)
{
return *this;
}
BaseIterator base()const
{
return m_position;
}
private:
void push(boost::uint32_t v)const
{
if(v >= 0x10000u)
{
// begin by checking for a code point out of range:
if(v > 0x10FFFFu)
detail::invalid_utf32_code_point(v);
// split into two surrogates:
*m_position++ = static_cast<boost::uint16_t>(v >> 10) + detail::high_surrogate_base;
*m_position++ = static_cast<boost::uint16_t>(v & detail::ten_bit_mask) + detail::low_surrogate_base;
}
else
{
// 16-bit code point:
// value must not be a surrogate:
if(detail::is_surrogate(v))
detail::invalid_utf32_code_point(v);
*m_position++ = static_cast<boost::uint16_t>(v);
}
}
mutable BaseIterator m_position;
};
template <class BaseIterator>
class utf8_output_iterator
{
public:
typedef void difference_type;
typedef void value_type;
typedef boost::uint32_t* pointer;
typedef boost::uint32_t& reference;
typedef std::output_iterator_tag iterator_category;
utf8_output_iterator(const BaseIterator& b)
: m_position(b){}
utf8_output_iterator(const utf8_output_iterator& that)
: m_position(that.m_position){}
utf8_output_iterator& operator=(const utf8_output_iterator& that)
{
m_position = that.m_position;
return *this;
}
const utf8_output_iterator& operator*()const
{
return *this;
}
void operator=(boost::uint32_t val)const
{
push(val);
}
utf8_output_iterator& operator++()
{
return *this;
}
utf8_output_iterator& operator++(int)
{
return *this;
}
BaseIterator base()const
{
return m_position;
}
private:
void push(boost::uint32_t c)const
{
if(c > 0x10FFFFu)
detail::invalid_utf32_code_point(c);
if(c < 0x80u)
{
*m_position++ = static_cast<unsigned char>(c);
}
else if(c < 0x800u)
{
*m_position++ = static_cast<unsigned char>(0xC0u + (c >> 6));
*m_position++ = static_cast<unsigned char>(0x80u + (c & 0x3Fu));
}
else if(c < 0x10000u)
{
*m_position++ = static_cast<unsigned char>(0xE0u + (c >> 12));
*m_position++ = static_cast<unsigned char>(0x80u + ((c >> 6) & 0x3Fu));
*m_position++ = static_cast<unsigned char>(0x80u + (c & 0x3Fu));
}
else
{
*m_position++ = static_cast<unsigned char>(0xF0u + (c >> 18));
*m_position++ = static_cast<unsigned char>(0x80u + ((c >> 12) & 0x3Fu));
*m_position++ = static_cast<unsigned char>(0x80u + ((c >> 6) & 0x3Fu));
*m_position++ = static_cast<unsigned char>(0x80u + (c & 0x3Fu));
}
}
mutable BaseIterator m_position;
};
} // namespace boost
#endif // BOOST_REGEX_UNICODE_ITERATOR_HPP
include/boost/regex/regex_traits.hpp
+41
View File
@@ -0,0 +1,41 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_traits.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares regular expression traits classes.
*/
#ifndef BOOST_REGEX_TRAITS_HPP
#define BOOST_REGEX_TRAITS_HPP
#ifndef BOOST_REGEX_CONFIG_HPP
# include <boost/regex/config.hpp>
#endif
#ifdef BOOST_REGEX_V3
# ifndef BOOST_REGEX_TRAITS_HPP_INCLUDED
# include <boost/regex/v3/regex_traits.hpp>
# endif
#else
# ifndef BOOST_REGEX_TRAITS_HPP_INCLUDED
# include <boost/regex/v4/regex_traits.hpp>
# endif
#endif
#endif // include
include/boost/regex/user.hpp
+90
View File
@@ -0,0 +1,90 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE user.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: User settable options.
*/
// define if you want the regex library to use the C locale
// even on Win32:
// #define BOOST_REGEX_USE_C_LOCALE
// define this is you want the regex library to use the C++
// locale:
// #define BOOST_REGEX_USE_CPP_LOCALE
// define this if the runtime library is a dll, and you
// want BOOST_REGEX_DYN_LINK to set up dll exports/imports
// with __declspec(dllexport)/__declspec(dllimport.)
// #define BOOST_REGEX_HAS_DLL_RUNTIME
// define this if you want to dynamically link to regex,
// if the runtime library is also a dll (Probably Win32 specific,
// and has no effect unless BOOST_REGEX_HAS_DLL_RUNTIME is set):
// #define BOOST_REGEX_DYN_LINK
// define this if you don't want the lib to automatically
// select its link libraries:
// #define BOOST_REGEX_NO_LIB
// define this if templates with switch statements cause problems:
// #define BOOST_REGEX_NO_TEMPLATE_SWITCH_MERGE
// define this to disable Win32 support when available:
// #define BOOST_REGEX_NO_W32
// define this if bool is not a real type:
// #define BOOST_REGEX_NO_BOOL
// define this if no template instances are to be placed in
// the library rather than users object files:
// #define BOOST_REGEX_NO_EXTERNAL_TEMPLATES
// define this if the forward declarations in regex_fwd.hpp
// cause more problems than they are worth:
// #define BOOST_REGEX_NO_FWD
// define this if your compiler supports MS Windows structured
// exception handling.
// #define BOOST_REGEX_HAS_MS_STACK_GUARD
// define this if you want to use the recursive algorithm
// even if BOOST_REGEX_HAS_MS_STACK_GUARD is not defined.
// #define BOOST_REGEX_RECURSIVE
// define this if you want to use the non-recursive
// algorithm, even if the recursive version would be the default.
// #define BOOST_REGEX_NON_RECURSIVE
// define this if you want to set the size of the memory blocks
// used by the non-recursive algorithm.
// #define BOOST_REGEX_BLOCKSIZE 4096
// define this if you want to set the maximum number of memory blocks
// used by the non-recursive algorithm.
// #define BOOST_REGEX_MAX_BLOCKS 1024
// define this if you want to set the maximum number of memory blocks
// cached by the non-recursive algorithm: Normally this is 16, but can be
// higher if you have multiple threads all using boost.regex, or lower
// if you don't want boost.regex to cache memory.
// #define BOOST_REGEX_MAX_CACHE_BLOCKS 16
// define this if you want to be able to access extended capture
// information in your sub_match's (caution this will slow things
// down quite a bit).
// #define BOOST_REGEX_MATCH_EXTRA
// define this if you want to enable support for Unicode via ICU.
// #define BOOST_HAS_ICU
include/boost/regex/v4/basic_regex.hpp
+630
View File
@@ -0,0 +1,630 @@
/*
*
* Copyright (c) 1998-2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE basic_regex.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares template class basic_regex.
*/
#ifndef BOOST_REGEX_V4_BASIC_REGEX_HPP
#define BOOST_REGEX_V4_BASIC_REGEX_HPP
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable : 4251 4231 4660)
#endif
namespace re_detail{
//
// forward declaration, we will need this one later:
//
template <class charT, class traits>
class basic_regex_parser;
//
// class regex_data:
// represents the data we wish to expose to the matching algorithms.
//
template <class charT, class traits>
struct regex_data
{
typedef regex_constants::syntax_option_type flag_type;
typedef std::size_t size_type;
regex_data(const ::boost::shared_ptr<
::boost::regex_traits_wrapper<traits> >& t)
: m_ptraits(t), m_expression(0), m_expression_len(0) {}
regex_data()
: m_ptraits(new ::boost::regex_traits_wrapper<traits>()), m_expression(0), m_expression_len(0) {}
::boost::shared_ptr<
::boost::regex_traits_wrapper<traits>
> m_ptraits; // traits class instance
flag_type m_flags; // flags with which we were compiled
int m_status; // error code (0 implies OK).
const charT* m_expression; // the original expression
std::ptrdiff_t m_expression_len; // the length of the original expression
size_type m_mark_count; // the number of marked sub-expressions
re_detail::re_syntax_base* m_first_state; // the first state of the machine
unsigned m_restart_type; // search optimisation type
unsigned char m_startmap[1 << CHAR_BIT]; // which characters can start a match
unsigned int m_can_be_null; // whether we can match a null string
re_detail::raw_storage m_data; // the buffer in which our states are constructed
};
//
// class basic_regex_implementation
// pimpl implementation class for basic_regex.
//
template <class charT, class traits>
class basic_regex_implementation
: public regex_data<charT, traits>
{
public:
typedef regex_constants::syntax_option_type flag_type;
typedef std::ptrdiff_t difference_type;
typedef std::size_t size_type;
typedef typename traits::locale_type locale_type;
typedef const charT* const_iterator;
basic_regex_implementation(){}
basic_regex_implementation(const ::boost::shared_ptr<
::boost::regex_traits_wrapper<traits> >& t)
: regex_data<charT, traits>(t) {}
void assign(const charT* arg_first,
const charT* arg_last,
flag_type f)
{
regex_data<charT, traits>* pdat = this;
basic_regex_parser<charT, traits> parser(pdat);
parser.parse(arg_first, arg_last, f);
}
locale_type BOOST_REGEX_CALL imbue(locale_type l)
{
return this->m_ptraits->imbue(l);
}
locale_type BOOST_REGEX_CALL getloc()const
{
return this->m_ptraits->getloc();
}
std::basic_string<charT> BOOST_REGEX_CALL str()const
{
std::basic_string<charT> result;
if(this->m_status == 0)
result = std::basic_string<charT>(this->m_expression, this->m_expression_len);
return result;
}
const_iterator BOOST_REGEX_CALL expression()const
{
return this->m_expression;
}
//
// begin, end:
const_iterator BOOST_REGEX_CALL begin()const
{
return (!this->m_status ? 0 : this->m_expression);
}
const_iterator BOOST_REGEX_CALL end()const
{
return (!this->m_status ? 0 : this->m_expression + this->m_expression_len);
}
flag_type BOOST_REGEX_CALL flags()const
{
return this->m_flags;
}
size_type BOOST_REGEX_CALL size()const
{
return this->m_expression_len;
}
int BOOST_REGEX_CALL status()const
{
return this->m_status;
}
size_type BOOST_REGEX_CALL mark_count()const
{
return this->m_mark_count;
}
const re_detail::re_syntax_base* get_first_state()const
{
return this->m_first_state;
}
unsigned get_restart_type()const
{
return this->m_restart_type;
}
const unsigned char* get_map()const
{
return this->m_startmap;
}
const ::boost::regex_traits_wrapper<traits>& get_traits()const
{
return *(this->m_ptraits);
}
bool can_be_null()const
{
return this->m_can_be_null;
}
const regex_data<charT, traits>& get_data()const
{
basic_regex_implementation<charT, traits> const* p = this;
return *static_cast<const regex_data<charT, traits>*>(p);
}
};
} // namespace re_detail
//
// class basic_regex:
// represents the compiled
// regular expression:
//
#ifdef BOOST_REGEX_NO_FWD
template <class charT, class traits = regex_traits<charT> >
#else
template <class charT, class traits >
#endif
class basic_regex : public regbase
{
public:
// typedefs:
typedef typename traits::size_type traits_size_type;
typedef typename traits::string_type traits_string_type;
typedef charT char_type;
typedef traits traits_type;
typedef charT value_type;
typedef charT& reference;
typedef const charT& const_reference;
typedef const charT* const_iterator;
typedef const_iterator iterator;
typedef std::ptrdiff_t difference_type;
typedef std::size_t size_type;
typedef regex_constants::syntax_option_type flag_type;
// locale_type
// placeholder for actual locale type used by the
// traits class to localise *this.
typedef typename traits::locale_type locale_type;
public:
explicit basic_regex(){}
explicit basic_regex(const charT* p, flag_type f = regex_constants::normal)
{
assign(p, f);
}
basic_regex(const charT* p1, const charT* p2, flag_type f = regex_constants::normal)
{
assign(p1, p2, f);
}
basic_regex(const charT* p, size_type len, flag_type f)
{
assign(p, len, f);
}
basic_regex(const basic_regex& that)
: m_pimpl(that.m_pimpl) {}
~basic_regex(){}
basic_regex& BOOST_REGEX_CALL operator=(const basic_regex& that)
{
return assign(that);
}
basic_regex& BOOST_REGEX_CALL operator=(const charT* ptr)
{
return assign(ptr);
}
//
// assign:
basic_regex& assign(const basic_regex& that)
{
m_pimpl = that.m_pimpl;
return *this;
}
basic_regex& assign(const charT* p, flag_type f = regex_constants::normal)
{
return assign(p, p + traits::length(p), f);
}
basic_regex& assign(const charT* p, size_type len, flag_type f)
{
return assign(p, p + len, f);
}
private:
basic_regex& do_assign(const charT* p1,
const charT* p2,
flag_type f);
public:
basic_regex& assign(const charT* p1,
const charT* p2,
flag_type f = regex_constants::normal)
{
return do_assign(p1, p2, f);
}
#if !defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(__IBMCPP__)
template <class ST, class SA>
unsigned int BOOST_REGEX_CALL set_expression(const std::basic_string<charT, ST, SA>& p, flag_type f = regex_constants::normal)
{
return set_expression(p.data(), p.data() + p.size(), f);
}
template <class ST, class SA>
explicit basic_regex(const std::basic_string<charT, ST, SA>& p, flag_type f = regex_constants::normal)
{
assign(p, f);
}
template <class InputIterator>
basic_regex(InputIterator arg_first, InputIterator arg_last, flag_type f = regex_constants::normal)
{
typedef typename traits::string_type seq_type;
seq_type a(arg_first, arg_last);
assign(&*a.begin(), &*a.begin() + a.size(), f);
}
template <class ST, class SA>
basic_regex& BOOST_REGEX_CALL operator=(const std::basic_string<charT, ST, SA>& p)
{
return assign(p.data(), p.data() + p.size(), regex_constants::normal);
}
template <class string_traits, class A>
basic_regex& BOOST_REGEX_CALL assign(
const std::basic_string<charT, string_traits, A>& s,
flag_type f = regex_constants::normal)
{
return assign(s.data(), s.data() + s.size(), f);
}
template <class InputIterator>
basic_regex& BOOST_REGEX_CALL assign(InputIterator arg_first,
InputIterator arg_last,
flag_type f = regex_constants::normal)
{
typedef typename traits::string_type seq_type;
seq_type a(arg_first, arg_last);
const charT* p1 = &*a.begin();
const charT* p2 = &*a.begin() + a.size();
return assign(p1, p2, f);
}
#else
unsigned int BOOST_REGEX_CALL set_expression(const std::basic_string<charT>& p, flag_type f = regex_constants::normal)
{
return set_expression(p.data(), p.data() + p.size(), f);
}
basic_regex(const std::basic_string<charT>& p, flag_type f = regex_constants::normal)
{
assign(p, f);
}
basic_regex& BOOST_REGEX_CALL operator=(const std::basic_string<charT>& p)
{
return assign(p.data(), p.data() + p.size(), regex_constants::normal);
}
basic_regex& BOOST_REGEX_CALL assign(
const std::basic_string<charT>& s,
flag_type f = regex_constants::normal)
{
return assign(s.data(), s.data() + s.size(), f);
}
#endif
//
// locale:
locale_type BOOST_REGEX_CALL imbue(locale_type l);
locale_type BOOST_REGEX_CALL getloc()const
{
return m_pimpl.get() ? m_pimpl->getloc() : locale_type();
}
//
// getflags:
// retained for backwards compatibility only, "flags"
// is now the prefered name:
flag_type BOOST_REGEX_CALL getflags()const
{
return flags();
}
flag_type BOOST_REGEX_CALL flags()const
{
return m_pimpl.get() ? m_pimpl->flags() : 0;
}
//
// str:
std::basic_string<charT> BOOST_REGEX_CALL str()const
{
return m_pimpl.get() ? m_pimpl->str() : std::basic_string<charT>();
}
//
// begin, end:
const_iterator BOOST_REGEX_CALL begin()const
{
return (m_pimpl.get() ? m_pimpl->begin() : 0);
}
const_iterator BOOST_REGEX_CALL end()const
{
return (m_pimpl.get() ? m_pimpl->end() : 0);
}
//
// swap:
void BOOST_REGEX_CALL swap(basic_regex& that)throw()
{
m_pimpl.swap(that.m_pimpl);
}
//
// size:
size_type BOOST_REGEX_CALL size()const
{
return (m_pimpl.get() ? m_pimpl->size() : 0);
}
//
// max_size:
size_type BOOST_REGEX_CALL max_size()const
{
return UINT_MAX;
}
//
// empty:
bool BOOST_REGEX_CALL empty()const
{
return (m_pimpl.get() ? 0 != m_pimpl->status() : true);
}
size_type BOOST_REGEX_CALL mark_count()const
{
return (m_pimpl.get() ? m_pimpl->mark_count() : 0);
}
int status()const
{
return (m_pimpl.get() ? m_pimpl->status() : regex_constants::error_empty);
}
int BOOST_REGEX_CALL compare(const basic_regex& that) const
{
if(m_pimpl.get() == that.m_pimpl.get())
return 0;
if(!m_pimpl.get())
return -1;
if(!that.m_pimpl.get())
return 1;
if(status() != that.status())
return status() - that.status();
if(flags() != that.flags())
return flags() - that.flags();
return str().compare(that.str());
}
bool BOOST_REGEX_CALL operator==(const basic_regex& e)const
{
return compare(e) == 0;
}
bool BOOST_REGEX_CALL operator != (const basic_regex& e)const
{
return compare(e) != 0;
}
bool BOOST_REGEX_CALL operator<(const basic_regex& e)const
{
return compare(e) < 0;
}
bool BOOST_REGEX_CALL operator>(const basic_regex& e)const
{
return compare(e) > 0;
}
bool BOOST_REGEX_CALL operator<=(const basic_regex& e)const
{
return compare(e) <= 0;
}
bool BOOST_REGEX_CALL operator>=(const basic_regex& e)const
{
return compare(e) >= 0;
}
//
// The following are deprecated as public interfaces
// but are available for compatibility with earlier versions.
const charT* BOOST_REGEX_CALL expression()const
{
return (m_pimpl.get() && !m_pimpl->status() ? m_pimpl->expression() : 0);
}
unsigned int BOOST_REGEX_CALL set_expression(const charT* p1, const charT* p2, flag_type f = regex_constants::normal)
{
assign(p1, p2, f | regex_constants::no_except);
return status();
}
unsigned int BOOST_REGEX_CALL set_expression(const charT* p, flag_type f = regex_constants::normal)
{
assign(p, f | regex_constants::no_except);
return status();
}
unsigned int BOOST_REGEX_CALL error_code()const
{
return status();
}
//
// private access methods:
//
const re_detail::re_syntax_base* get_first_state()const
{
BOOST_ASSERT(0 != m_pimpl.get());
return m_pimpl->get_first_state();
}
unsigned get_restart_type()const
{
BOOST_ASSERT(0 != m_pimpl.get());
return m_pimpl->get_restart_type();
}
const unsigned char* get_map()const
{
BOOST_ASSERT(0 != m_pimpl.get());
return m_pimpl->get_map();
}
const ::boost::regex_traits_wrapper<traits>& get_traits()const
{
BOOST_ASSERT(0 != m_pimpl.get());
return m_pimpl->get_traits();
}
bool can_be_null()const
{
BOOST_ASSERT(0 != m_pimpl.get());
return m_pimpl->can_be_null();
}
const re_detail::regex_data<charT, traits>& get_data()const
{
BOOST_ASSERT(0 != m_pimpl.get());
return m_pimpl->get_data();
}
private:
shared_ptr<re_detail::basic_regex_implementation<charT, traits> > m_pimpl;
};
//
// out of line members;
// these are the only members that mutate the basic_regex object,
// and are designed to provide the strong exception guarentee
// (in the event of a throw, the state of the object remains unchanged).
//
template <class charT, class traits>
basic_regex<charT, traits>& basic_regex<charT, traits>::do_assign(const charT* p1,
const charT* p2,
flag_type f)
{
shared_ptr<re_detail::basic_regex_implementation<charT, traits> > temp;
if(!m_pimpl.get())
{
temp = shared_ptr<re_detail::basic_regex_implementation<charT, traits> >(new re_detail::basic_regex_implementation<charT, traits>());
}
else
{
temp = shared_ptr<re_detail::basic_regex_implementation<charT, traits> >(new re_detail::basic_regex_implementation<charT, traits>(m_pimpl->m_ptraits));
}
temp->assign(p1, p2, f);
temp.swap(m_pimpl);
return *this;
}
template <class charT, class traits>
typename basic_regex<charT, traits>::locale_type BOOST_REGEX_CALL basic_regex<charT, traits>::imbue(locale_type l)
{
shared_ptr<re_detail::basic_regex_implementation<charT, traits> > temp(new re_detail::basic_regex_implementation<charT, traits>());
locale_type result = temp->imbue(l);
temp.swap(m_pimpl);
return result;
}
//
// non-members:
//
template <class charT, class traits>
void swap(basic_regex<charT, traits>& e1, basic_regex<charT, traits>& e2)
{
e1.swap(e2);
}
#ifndef BOOST_NO_STD_LOCALE
template <class charT, class traits, class traits2>
std::basic_ostream<charT, traits>&
operator << (std::basic_ostream<charT, traits>& os,
const basic_regex<charT, traits2>& e)
{
return (os << e.str());
}
#else
template <class traits>
std::ostream& operator << (std::ostream& os, const basic_regex<char, traits>& e)
{
return (os << e.str());
}
#endif
//
// class reg_expression:
// this is provided for backwards compatibility only,
// it is deprecated, no not use!
//
#ifdef BOOST_REGEX_NO_FWD
template <class charT, class traits = regex_traits<charT> >
#else
template <class charT, class traits >
#endif
class reg_expression : public basic_regex<charT, traits>
{
public:
typedef typename basic_regex<charT, traits>::flag_type flag_type;
typedef typename basic_regex<charT, traits>::size_type size_type;
explicit reg_expression(){}
explicit reg_expression(const charT* p, flag_type f = regex_constants::normal)
: basic_regex<charT, traits>(p, f){}
reg_expression(const charT* p1, const charT* p2, flag_type f = regex_constants::normal)
: basic_regex<charT, traits>(p1, p2, f){}
reg_expression(const charT* p, size_type len, flag_type f)
: basic_regex<charT, traits>(p, len, f){}
reg_expression(const reg_expression& that)
: basic_regex<charT, traits>(that) {}
~reg_expression(){}
reg_expression& BOOST_REGEX_CALL operator=(const reg_expression& that)
{
return this->assign(that);
}
#if !defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(__IBMCPP__)
template <class ST, class SA>
explicit reg_expression(const std::basic_string<charT, ST, SA>& p, flag_type f = regex_constants::normal)
: basic_regex<charT, traits>(p, f)
{
}
template <class InputIterator>
reg_expression(InputIterator arg_first, InputIterator arg_last, flag_type f = regex_constants::normal)
: basic_regex<charT, traits>(arg_first, arg_last, f)
{
}
template <class ST, class SA>
reg_expression& BOOST_REGEX_CALL operator=(const std::basic_string<charT, ST, SA>& p)
{
this->assign(p);
return *this;
}
#else
explicit reg_expression(const std::basic_string<charT>& p, flag_type f = regex_constants::normal)
: basic_regex<charT, traits>(p, f)
{
}
reg_expression& BOOST_REGEX_CALL operator=(const std::basic_string<charT>& p)
{
this->assign(p);
return *this;
}
#endif
};
#ifdef BOOST_MSVC
#pragma warning (pop)
#endif
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/basic_regex_creator.hpp
+1230
View File
File diff suppressed because it is too large Load Diff
include/boost/regex/v4/basic_regex_parser.hpp
+2043
View File
File diff suppressed because it is too large Load Diff
include/boost/regex/v4/c_regex_traits.hpp
+197
View File
@@ -0,0 +1,197 @@
/*
*
* Copyright (c) 2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE c_regex_traits.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares regular expression traits class that wraps the global C locale.
*/
#ifndef BOOST_C_REGEX_TRAITS_HPP_INCLUDED
#define BOOST_C_REGEX_TRAITS_HPP_INCLUDED
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#ifndef BOOST_REGEX_WORKAROUND_HPP
#include <boost/regex/v4/regex_workaround.hpp>
#endif
#include <cctype>
#ifdef BOOST_NO_STDC_NAMESPACE
namespace std{
using ::strlen; using ::tolower;
}
#endif
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
template <class charT>
struct c_regex_traits;
template<>
struct BOOST_REGEX_DECL c_regex_traits<char>
{
c_regex_traits(){}
typedef char char_type;
typedef std::size_t size_type;
typedef std::string string_type;
struct locale_type{};
typedef boost::uint32_t char_class_type;
static size_type length(const char_type* p)
{
return (std::strlen)(p);
}
char translate(char c) const
{
return c;
}
char translate_nocase(char c) const
{
return static_cast<char>((std::tolower)(static_cast<unsigned char>(c)));
}
static string_type BOOST_REGEX_CALL transform(const char* p1, const char* p2);
static string_type BOOST_REGEX_CALL transform_primary(const char* p1, const char* p2);
static char_class_type BOOST_REGEX_CALL lookup_classname(const char* p1, const char* p2);
static string_type BOOST_REGEX_CALL lookup_collatename(const char* p1, const char* p2);
static bool BOOST_REGEX_CALL isctype(char, char_class_type);
static int BOOST_REGEX_CALL value(char, int);
locale_type imbue(locale_type l)
{ return l; }
locale_type getloc()const
{ return locale_type(); }
private:
// this type is not copyable:
c_regex_traits(const c_regex_traits&);
c_regex_traits& operator=(const c_regex_traits&);
};
#ifndef BOOST_NO_WREGEX
template<>
struct BOOST_REGEX_DECL c_regex_traits<wchar_t>
{
c_regex_traits(){}
typedef wchar_t char_type;
typedef std::size_t size_type;
typedef std::wstring string_type;
struct locale_type{};
typedef boost::uint32_t char_class_type;
static size_type length(const char_type* p)
{
return (std::wcslen)(p);
}
wchar_t translate(wchar_t c) const
{
return c;
}
wchar_t translate_nocase(wchar_t c) const
{
return (std::towlower)(c);
}
static string_type BOOST_REGEX_CALL transform(const wchar_t* p1, const wchar_t* p2);
static string_type BOOST_REGEX_CALL transform_primary(const wchar_t* p1, const wchar_t* p2);
static char_class_type BOOST_REGEX_CALL lookup_classname(const wchar_t* p1, const wchar_t* p2);
static string_type BOOST_REGEX_CALL lookup_collatename(const wchar_t* p1, const wchar_t* p2);
static bool BOOST_REGEX_CALL isctype(wchar_t, char_class_type);
static int BOOST_REGEX_CALL value(wchar_t, int);
locale_type imbue(locale_type l)
{ return l; }
locale_type getloc()const
{ return locale_type(); }
private:
// this type is not copyable:
c_regex_traits(const c_regex_traits&);
c_regex_traits& operator=(const c_regex_traits&);
};
#ifdef BOOST_REGEX_HAS_OTHER_WCHAR_T
//
// Provide an unsigned short version as well, so the user can link to this
// no matter whether they build with /Zc:wchar_t or not (MSVC specific).
//
template<>
struct BOOST_REGEX_DECL c_regex_traits<unsigned short>
{
c_regex_traits(){}
typedef unsigned short char_type;
typedef std::size_t size_type;
typedef std::basic_string<unsigned short> string_type;
struct locale_type{};
typedef boost::uint32_t char_class_type;
static size_type length(const char_type* p)
{
return (std::wcslen)((const wchar_t*)p);
}
unsigned short translate(unsigned short c) const
{
return c;
}
unsigned short translate_nocase(unsigned short c) const
{
return (std::towlower)((wchar_t)c);
}
static string_type BOOST_REGEX_CALL transform(const unsigned short* p1, const unsigned short* p2);
static string_type BOOST_REGEX_CALL transform_primary(const unsigned short* p1, const unsigned short* p2);
static char_class_type BOOST_REGEX_CALL lookup_classname(const unsigned short* p1, const unsigned short* p2);
static string_type BOOST_REGEX_CALL lookup_collatename(const unsigned short* p1, const unsigned short* p2);
static bool BOOST_REGEX_CALL isctype(unsigned short, char_class_type);
static int BOOST_REGEX_CALL value(unsigned short, int);
locale_type imbue(locale_type l)
{ return l; }
locale_type getloc()const
{ return locale_type(); }
private:
// this type is not copyable:
c_regex_traits(const c_regex_traits&);
c_regex_traits& operator=(const c_regex_traits&);
};
#endif
#endif // BOOST_NO_WREGEX
}
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/char_regex_traits.hpp
+67
View File
@@ -0,0 +1,67 @@
/*
*
* Copyright (c) 2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE char_regex_traits.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares deprecated traits classes char_regex_traits<>.
*/
#ifndef BOOST_REGEX_V4_CHAR_REGEX_TRAITS_HPP
#define BOOST_REGEX_V4_CHAR_REGEX_TRAITS_HPP
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
namespace deprecated{
//
// class char_regex_traits_i
// provides case insensitive traits classes (deprecated):
template <class charT>
class char_regex_traits_i : public regex_traits<charT> {};
template<>
class char_regex_traits_i<char> : public regex_traits<char>
{
public:
typedef char char_type;
typedef unsigned char uchar_type;
typedef unsigned int size_type;
typedef regex_traits<char> base_type;
};
#ifndef BOOST_NO_WREGEX
template<>
class char_regex_traits_i<wchar_t> : public regex_traits<wchar_t>
{
public:
typedef wchar_t char_type;
typedef unsigned short uchar_type;
typedef unsigned int size_type;
typedef regex_traits<wchar_t> base_type;
};
#endif
} // namespace deprecated
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif // include
include/boost/regex/v4/cpp_regex_traits.hpp
+1039
View File
File diff suppressed because it is too large Load Diff
include/boost/regex/v4/cregex.hpp
+301
View File
@@ -0,0 +1,301 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE cregex.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares POSIX API functions
* + boost::RegEx high level wrapper.
*/
#ifndef BOOST_RE_CREGEX_HPP_INCLUDED
#define BOOST_RE_CREGEX_HPP_INCLUDED
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#include <boost/regex/v4/match_flags.hpp>
#include <boost/regex/v4/error_type.hpp>
#ifdef __cplusplus
#include <cstddef>
#else
#include <stddef.h>
#endif
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
/* include these defs only for POSIX compatablity */
#ifdef __cplusplus
namespace boost{
extern "C" {
#endif
#if defined(__cplusplus) && !defined(BOOST_NO_STDC_NAMESPACE)
typedef std::ptrdiff_t regoff_t;
typedef std::size_t regsize_t;
#else
typedef ptrdiff_t regoff_t;
typedef size_t regsize_t;
#endif
typedef struct
{
unsigned int re_magic;
#ifdef __cplusplus
std::size_t re_nsub; /* number of parenthesized subexpressions */
#else
size_t re_nsub;
#endif
const char* re_endp; /* end pointer for REG_PEND */
void* guts; /* none of your business :-) */
match_flag_type eflags; /* none of your business :-) */
} regex_tA;
#ifndef BOOST_NO_WREGEX
typedef struct
{
unsigned int re_magic;
#ifdef __cplusplus
std::size_t re_nsub; /* number of parenthesized subexpressions */
#else
size_t re_nsub;
#endif
const wchar_t* re_endp; /* end pointer for REG_PEND */
void* guts; /* none of your business :-) */
match_flag_type eflags; /* none of your business :-) */
} regex_tW;
#endif
typedef struct
{
regoff_t rm_so; /* start of match */
regoff_t rm_eo; /* end of match */
} regmatch_t;
/* regcomp() flags */
typedef enum{
REG_BASIC = 0000,
REG_EXTENDED = 0001,
REG_ICASE = 0002,
REG_NOSUB = 0004,
REG_NEWLINE = 0010,
REG_NOSPEC = 0020,
REG_PEND = 0040,
REG_DUMP = 0200,
REG_NOCOLLATE = 0400,
REG_ESCAPE_IN_LISTS = 01000,
REG_NEWLINE_ALT = 02000,
REG_PERLEX = 04000,
REG_PERL = REG_EXTENDED | REG_NOCOLLATE | REG_ESCAPE_IN_LISTS | REG_PERLEX,
REG_AWK = REG_EXTENDED | REG_ESCAPE_IN_LISTS,
REG_GREP = REG_BASIC | REG_NEWLINE_ALT,
REG_EGREP = REG_EXTENDED | REG_NEWLINE_ALT,
REG_ASSERT = 15,
REG_INVARG = 16,
REG_ATOI = 255, /* convert name to number (!) */
REG_ITOA = 0400 /* convert number to name (!) */
} reg_comp_flags;
/* regexec() flags */
typedef enum{
REG_NOTBOL = 00001,
REG_NOTEOL = 00002,
REG_STARTEND = 00004
} reg_exec_flags;
//
// POSIX error codes:
//
typedef unsigned reg_error_t;
typedef reg_error_t reg_errcode_t; // backwards compatibility
static const reg_error_t REG_NOERROR = 0; /* Success. */
static const reg_error_t REG_NOMATCH = 1; /* Didn't find a match (for regexec). */
/* POSIX regcomp return error codes. (In the order listed in the
standard.) */
static const reg_error_t REG_BADPAT = 2; /* Invalid pattern. */
static const reg_error_t REG_ECOLLATE = 3; /* Undefined collating element. */
static const reg_error_t REG_ECTYPE = 4; /* Invalid character class name. */
static const reg_error_t REG_EESCAPE = 5; /* Trailing backslash. */
static const reg_error_t REG_ESUBREG = 6; /* Invalid back reference. */
static const reg_error_t REG_EBRACK = 7; /* Unmatched left bracket. */
static const reg_error_t REG_EPAREN = 8; /* Parenthesis imbalance. */
static const reg_error_t REG_EBRACE = 9; /* Unmatched \{. */
static const reg_error_t REG_BADBR = 10; /* Invalid contents of \{\}. */
static const reg_error_t REG_ERANGE = 11; /* Invalid range end. */
static const reg_error_t REG_ESPACE = 12; /* Ran out of memory. */
static const reg_error_t REG_BADRPT = 13; /* No preceding re for repetition op. */
static const reg_error_t REG_EEND = 14; /* unexpected end of expression */
static const reg_error_t REG_ESIZE = 15; /* expression too big */
static const reg_error_t REG_ERPAREN = 8; /* = REG_EPAREN : unmatched right parenthesis */
static const reg_error_t REG_EMPTY = 17; /* empty expression */
static const reg_error_t REG_E_MEMORY = 15; /* = REG_ESIZE : out of memory */
static const reg_error_t REG_ECOMPLEXITY = 18; /* complexity too high */
static const reg_error_t REG_ESTACK = 19; /* out of stack space */
static const reg_error_t REG_E_UNKNOWN = 20; /* unknown error */
static const reg_error_t REG_ENOSYS = 20; /* = REG_E_UNKNOWN : Reserved. */
BOOST_REGEX_DECL int BOOST_REGEX_CCALL regcompA(regex_tA*, const char*, int);
BOOST_REGEX_DECL regsize_t BOOST_REGEX_CCALL regerrorA(int, const regex_tA*, char*, regsize_t);
BOOST_REGEX_DECL int BOOST_REGEX_CCALL regexecA(const regex_tA*, const char*, regsize_t, regmatch_t*, int);
BOOST_REGEX_DECL void BOOST_REGEX_CCALL regfreeA(regex_tA*);
#ifndef BOOST_NO_WREGEX
BOOST_REGEX_DECL int BOOST_REGEX_CCALL regcompW(regex_tW*, const wchar_t*, int);
BOOST_REGEX_DECL regsize_t BOOST_REGEX_CCALL regerrorW(int, const regex_tW*, wchar_t*, regsize_t);
BOOST_REGEX_DECL int BOOST_REGEX_CCALL regexecW(const regex_tW*, const wchar_t*, regsize_t, regmatch_t*, int);
BOOST_REGEX_DECL void BOOST_REGEX_CCALL regfreeW(regex_tW*);
#endif
#ifdef UNICODE
#define regcomp regcompW
#define regerror regerrorW
#define regexec regexecW
#define regfree regfreeW
#define regex_t regex_tW
#else
#define regcomp regcompA
#define regerror regerrorA
#define regexec regexecA
#define regfree regfreeA
#define regex_t regex_tA
#endif
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#ifdef __cplusplus
} // extern "C"
} // namespace
#endif
//
// C++ high level wrapper goes here:
//
#if defined(__cplusplus)
#include <string>
#include <vector>
namespace boost{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
class RegEx;
namespace re_detail{
class RegExData;
struct pred1;
struct pred2;
struct pred3;
struct pred4;
} // namespace re_detail
#if (defined(BOOST_MSVC) || defined(__BORLANDC__)) && !defined(BOOST_DISABLE_WIN32)
typedef bool (__cdecl *GrepCallback)(const RegEx& expression);
typedef bool (__cdecl *GrepFileCallback)(const char* file, const RegEx& expression);
typedef bool (__cdecl *FindFilesCallback)(const char* file);
#else
typedef bool (*GrepCallback)(const RegEx& expression);
typedef bool (*GrepFileCallback)(const char* file, const RegEx& expression);
typedef bool (*FindFilesCallback)(const char* file);
#endif
class BOOST_REGEX_DECL RegEx
{
private:
re_detail::RegExData* pdata;
public:
RegEx();
RegEx(const RegEx& o);
~RegEx();
explicit RegEx(const char* c, bool icase = false);
explicit RegEx(const std::string& s, bool icase = false);
RegEx& operator=(const RegEx& o);
RegEx& operator=(const char* p);
RegEx& operator=(const std::string& s){ return this->operator=(s.c_str()); }
unsigned int SetExpression(const char* p, bool icase = false);
unsigned int SetExpression(const std::string& s, bool icase = false){ return SetExpression(s.c_str(), icase); }
std::string Expression()const;
unsigned int error_code()const;
//
// now matching operators:
//
bool Match(const char* p, match_flag_type flags = match_default);
bool Match(const std::string& s, match_flag_type flags = match_default) { return Match(s.c_str(), flags); }
bool Search(const char* p, match_flag_type flags = match_default);
bool Search(const std::string& s, match_flag_type flags = match_default) { return Search(s.c_str(), flags); }
unsigned int Grep(GrepCallback cb, const char* p, match_flag_type flags = match_default);
unsigned int Grep(GrepCallback cb, const std::string& s, match_flag_type flags = match_default) { return Grep(cb, s.c_str(), flags); }
unsigned int Grep(std::vector<std::string>& v, const char* p, match_flag_type flags = match_default);
unsigned int Grep(std::vector<std::string>& v, const std::string& s, match_flag_type flags = match_default) { return Grep(v, s.c_str(), flags); }
unsigned int Grep(std::vector<std::size_t>& v, const char* p, match_flag_type flags = match_default);
unsigned int Grep(std::vector<std::size_t>& v, const std::string& s, match_flag_type flags = match_default) { return Grep(v, s.c_str(), flags); }
#ifndef BOOST_REGEX_NO_FILEITER
unsigned int GrepFiles(GrepFileCallback cb, const char* files, bool recurse = false, match_flag_type flags = match_default);
unsigned int GrepFiles(GrepFileCallback cb, const std::string& files, bool recurse = false, match_flag_type flags = match_default) { return GrepFiles(cb, files.c_str(), recurse, flags); }
unsigned int FindFiles(FindFilesCallback cb, const char* files, bool recurse = false, match_flag_type flags = match_default);
unsigned int FindFiles(FindFilesCallback cb, const std::string& files, bool recurse = false, match_flag_type flags = match_default) { return FindFiles(cb, files.c_str(), recurse, flags); }
#endif
std::string Merge(const std::string& in, const std::string& fmt,
bool copy = true, match_flag_type flags = match_default);
std::string Merge(const char* in, const char* fmt,
bool copy = true, match_flag_type flags = match_default);
std::size_t Split(std::vector<std::string>& v, std::string& s, match_flag_type flags = match_default, unsigned max_count = ~0);
//
// now operators for returning what matched in more detail:
//
std::size_t Position(int i = 0)const;
std::size_t Length(int i = 0)const;
bool Matched(int i = 0)const;
std::size_t Marks()const;
std::string What(int i = 0)const;
std::string operator[](int i)const { return What(i); }
static const std::size_t npos;
friend struct re_detail::pred1;
friend struct re_detail::pred2;
friend struct re_detail::pred3;
friend struct re_detail::pred4;
};
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace boost
#endif
#endif // include guard
include/boost/regex/v4/error_type.hpp
+58
View File
@@ -0,0 +1,58 @@
/*
*
* Copyright (c) 2003-2005
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE error_type.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares regular expression error type enumerator.
*/
#ifndef BOOST_REGEX_ERROR_TYPE_HPP
#define BOOST_REGEX_ERROR_TYPE_HPP
#ifdef __cplusplus
namespace boost{
#endif
#ifdef __cplusplus
namespace regex_constants{
enum error_type{
error_ok = 0, // not used
error_no_match = 1, // not used
error_bad_pattern = 2,
error_collate = 3,
error_ctype = 4,
error_escape = 5,
error_backref = 6,
error_brack = 7,
error_paren = 8,
error_brace = 9,
error_badbrace = 10,
error_range = 11,
error_space = 12,
error_badrepeat = 13,
error_end = 14, // not used
error_size = 15,
error_right_paren = 16, // not used
error_empty = 17,
error_complexity = 18,
error_stack = 19,
error_unknown = 20
};
}
}
#endif // __cplusplus
#endif
include/boost/regex/v4/fileiter.hpp
+449
View File
@@ -0,0 +1,449 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE fileiter.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares various platform independent file and
* directory iterators, plus binary file input in
* the form of class map_file.
*/
#ifndef BOOST_RE_FILEITER_HPP_INCLUDED
#define BOOST_RE_FILEITER_HPP_INCLUDED
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#include <boost/assert.hpp>
#ifndef BOOST_REGEX_NO_FILEITER
#if (defined(__CYGWIN__) || defined(__CYGWIN32__)) && !defined(BOOST_REGEX_NO_W32)
#error "Sorry, can't mix <windows.h> with STL code and gcc compiler: if you ran configure, try again with configure --disable-ms-windows"
#define BOOST_REGEX_FI_WIN32_MAP
#define BOOST_REGEX_FI_POSIX_DIR
#elif (defined(__WIN32__) || defined(_WIN32) || defined(WIN32)) && !defined(BOOST_REGEX_NO_W32)
#define BOOST_REGEX_FI_WIN32_MAP
#define BOOST_REGEX_FI_WIN32_DIR
#else
#define BOOST_REGEX_FI_POSIX_MAP
#define BOOST_REGEX_FI_POSIX_DIR
#endif
#if defined(BOOST_REGEX_FI_WIN32_MAP)||defined(BOOST_REGEX_FI_WIN32_DIR)
#include <windows.h>
#endif
#if defined(BOOST_REGEX_FI_WIN32_DIR)
namespace boost{
namespace re_detail{
typedef WIN32_FIND_DATAA _fi_find_data;
typedef HANDLE _fi_find_handle;
} // namespace re_detail
} // namespace boost
#define _fi_invalid_handle INVALID_HANDLE_VALUE
#define _fi_dir FILE_ATTRIBUTE_DIRECTORY
#elif defined(BOOST_REGEX_FI_POSIX_DIR)
#include <cstddef>
#include <cstdio>
#include <cctype>
#include <iterator>
#include <list>
#include <cassert>
#include <dirent.h>
#if defined(__SUNPRO_CC)
using std::list;
#endif
#ifndef MAX_PATH
#define MAX_PATH 256
#endif
namespace boost{
namespace re_detail{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
struct _fi_find_data
{
unsigned dwFileAttributes;
char cFileName[MAX_PATH];
};
struct _fi_priv_data;
typedef _fi_priv_data* _fi_find_handle;
#define _fi_invalid_handle 0
#define _fi_dir 1
_fi_find_handle _fi_FindFirstFile(const char* lpFileName, _fi_find_data* lpFindFileData);
bool _fi_FindNextFile(_fi_find_handle hFindFile, _fi_find_data* lpFindFileData);
bool _fi_FindClose(_fi_find_handle hFindFile);
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace re_detail
} // namespace boost
#ifdef FindFirstFile
#undef FindFirstFile
#endif
#ifdef FindNextFile
#undef FindNextFile
#endif
#ifdef FindClose
#undef FindClose
#endif
#define FindFirstFileA _fi_FindFirstFile
#define FindNextFileA _fi_FindNextFile
#define FindClose _fi_FindClose
#endif
namespace boost{
namespace re_detail{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
#ifdef BOOST_REGEX_FI_WIN32_MAP // win32 mapfile
class BOOST_REGEX_DECL mapfile
{
HANDLE hfile;
HANDLE hmap;
const char* _first;
const char* _last;
public:
typedef const char* iterator;
mapfile(){ hfile = hmap = 0; _first = _last = 0; }
mapfile(const char* file){ hfile = hmap = 0; _first = _last = 0; open(file); }
~mapfile(){ close(); }
void open(const char* file);
void close();
const char* begin(){ return _first; }
const char* end(){ return _last; }
size_t size(){ return _last - _first; }
bool valid(){ return (hfile != 0) && (hfile != INVALID_HANDLE_VALUE); }
};
#else
class BOOST_REGEX_DECL mapfile_iterator;
class BOOST_REGEX_DECL mapfile
{
typedef char* pointer;
std::FILE* hfile;
long int _size;
pointer* _first;
pointer* _last;
mutable std::list<pointer*> condemed;
enum sizes
{
buf_size = 4096
};
void lock(pointer* node)const;
void unlock(pointer* node)const;
public:
typedef mapfile_iterator iterator;
mapfile(){ hfile = 0; _size = 0; _first = _last = 0; }
mapfile(const char* file){ hfile = 0; _size = 0; _first = _last = 0; open(file); }
~mapfile(){ close(); }
void open(const char* file);
void close();
iterator begin()const;
iterator end()const;
unsigned long size()const{ return _size; }
bool valid()const{ return hfile != 0; }
friend class mapfile_iterator;
};
class BOOST_REGEX_DECL mapfile_iterator
#if !defined(BOOST_NO_STD_ITERATOR) || defined(BOOST_MSVC_STD_ITERATOR)
: public std::iterator<std::random_access_iterator_tag, char>
#endif
{
typedef mapfile::pointer internal_pointer;
internal_pointer* node;
const mapfile* file;
unsigned long offset;
long position()const
{
return file ? ((node - file->_first) * mapfile::buf_size + offset) : 0;
}
void position(long pos)
{
if(file)
{
node = file->_first + (pos / mapfile::buf_size);
offset = pos % mapfile::buf_size;
}
}
public:
typedef std::ptrdiff_t difference_type;
typedef char value_type;
typedef const char* pointer;
typedef const char& reference;
typedef std::random_access_iterator_tag iterator_category;
mapfile_iterator() { node = 0; file = 0; offset = 0; }
mapfile_iterator(const mapfile* f, long arg_position)
{
file = f;
node = f->_first + arg_position / mapfile::buf_size;
offset = arg_position % mapfile::buf_size;
if(file)
file->lock(node);
}
mapfile_iterator(const mapfile_iterator& i)
{
file = i.file;
node = i.node;
offset = i.offset;
if(file)
file->lock(node);
}
~mapfile_iterator()
{
if(file && node)
file->unlock(node);
}
mapfile_iterator& operator = (const mapfile_iterator& i);
char operator* ()const
{
BOOST_ASSERT(node >= file->_first);
BOOST_ASSERT(node < file->_last);
return file ? *(*node + sizeof(int) + offset) : char(0);
}
char operator[] (long off)const
{
mapfile_iterator tmp(*this);
tmp += off;
return *tmp;
}
mapfile_iterator& operator++ ();
mapfile_iterator operator++ (int);
mapfile_iterator& operator-- ();
mapfile_iterator operator-- (int);
mapfile_iterator& operator += (long off)
{
position(position() + off);
return *this;
}
mapfile_iterator& operator -= (long off)
{
position(position() - off);
return *this;
}
friend inline bool operator==(const mapfile_iterator& i, const mapfile_iterator& j)
{
return (i.file == j.file) && (i.node == j.node) && (i.offset == j.offset);
}
friend inline bool operator!=(const mapfile_iterator& i, const mapfile_iterator& j)
{
return !(i == j);
}
friend inline bool operator<(const mapfile_iterator& i, const mapfile_iterator& j)
{
return i.position() < j.position();
}
friend inline bool operator>(const mapfile_iterator& i, const mapfile_iterator& j)
{
return i.position() > j.position();
}
friend inline bool operator<=(const mapfile_iterator& i, const mapfile_iterator& j)
{
return i.position() <= j.position();
}
friend inline bool operator>=(const mapfile_iterator& i, const mapfile_iterator& j)
{
return i.position() >= j.position();
}
friend mapfile_iterator operator + (const mapfile_iterator& i, long off);
friend mapfile_iterator operator + (long off, const mapfile_iterator& i)
{
mapfile_iterator tmp(i);
return tmp += off;
}
friend mapfile_iterator operator - (const mapfile_iterator& i, long off);
friend inline long operator - (const mapfile_iterator& i, const mapfile_iterator& j)
{
return i.position() - j.position();
}
};
#endif
// _fi_sep determines the directory separator, either '\\' or '/'
BOOST_REGEX_DECL extern const char* _fi_sep;
struct file_iterator_ref
{
_fi_find_handle hf;
_fi_find_data _data;
long count;
};
class BOOST_REGEX_DECL file_iterator
{
char* _root;
char* _path;
char* ptr;
file_iterator_ref* ref;
public:
typedef std::ptrdiff_t difference_type;
typedef const char* value_type;
typedef const char** pointer;
typedef const char*& reference;
typedef std::input_iterator_tag iterator_category;
file_iterator();
file_iterator(const char* wild);
~file_iterator();
file_iterator(const file_iterator&);
file_iterator& operator=(const file_iterator&);
const char* root()const { return _root; }
const char* path()const { return _path; }
const char* name()const { return ptr; }
_fi_find_data* data() { return &(ref->_data); }
void next();
file_iterator& operator++() { next(); return *this; }
file_iterator operator++(int);
const char* operator*() { return path(); }
friend inline bool operator == (const file_iterator& f1, const file_iterator& f2)
{
return ((f1.ref->hf == _fi_invalid_handle) && (f2.ref->hf == _fi_invalid_handle));
}
friend inline bool operator != (const file_iterator& f1, const file_iterator& f2)
{
return !(f1 == f2);
}
};
// dwa 9/13/00 - suppress unused parameter warning
inline bool operator < (const file_iterator&, const file_iterator&)
{
return false;
}
class BOOST_REGEX_DECL directory_iterator
{
char* _root;
char* _path;
char* ptr;
file_iterator_ref* ref;
public:
typedef std::ptrdiff_t difference_type;
typedef const char* value_type;
typedef const char** pointer;
typedef const char*& reference;
typedef std::input_iterator_tag iterator_category;
directory_iterator();
directory_iterator(const char* wild);
~directory_iterator();
directory_iterator(const directory_iterator& other);
directory_iterator& operator=(const directory_iterator& other);
const char* root()const { return _root; }
const char* path()const { return _path; }
const char* name()const { return ptr; }
_fi_find_data* data() { return &(ref->_data); }
void next();
directory_iterator& operator++() { next(); return *this; }
directory_iterator operator++(int);
const char* operator*() { return path(); }
static const char* separator() { return _fi_sep; }
friend inline bool operator == (const directory_iterator& f1, const directory_iterator& f2)
{
return ((f1.ref->hf == _fi_invalid_handle) && (f2.ref->hf == _fi_invalid_handle));
}
friend inline bool operator != (const directory_iterator& f1, const directory_iterator& f2)
{
return !(f1 == f2);
}
};
inline bool operator < (const directory_iterator&, const directory_iterator&)
{
return false;
}
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace re_detail
using boost::re_detail::directory_iterator;
using boost::re_detail::file_iterator;
using boost::re_detail::mapfile;
} // namespace boost
#endif // BOOST_REGEX_NO_FILEITER
#endif // BOOST_RE_FILEITER_HPP
include/boost/regex/v4/instances.hpp
+158
View File
@@ -0,0 +1,158 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE instances.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Defines those template instances that are placed in the
* library rather than in the users object files.
*/
//
// note no include guard, we may include this multiple times:
//
#ifndef BOOST_REGEX_NO_EXTERNAL_TEMPLATES
namespace boost{
//
// this header can be included multiple times, each time with
// a different character type, BOOST_REGEX_CHAR_T must be defined
// first:
//
#ifndef BOOST_REGEX_CHAR_T
# error "BOOST_REGEX_CHAR_T not defined"
#endif
//
// what follows is compiler specific:
//
#if defined(__BORLANDC__) && (__BORLANDC__ < 0x600)
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
# ifndef BOOST_REGEX_INSTANTIATE
# pragma option push -Jgx
# endif
template class BOOST_REGEX_DECL basic_regex< BOOST_REGEX_CHAR_T >;
# ifndef BOOST_REGEX_INSTANTIATE
# pragma option pop
# endif
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#elif defined(BOOST_MSVC) || defined(__ICL)
# ifndef BOOST_REGEX_INSTANTIATE
# ifdef __GNUC__
# define template __extension__ extern template
# else
# define template extern template
# endif
# endif
# ifdef BOOST_MSVC
# pragma warning(push)
# pragma warning(disable : 4251 4231 4660)
# endif
template class BOOST_REGEX_DECL basic_regex< BOOST_REGEX_CHAR_T >;
#if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
template class BOOST_REGEX_DECL match_results< const BOOST_REGEX_CHAR_T* >;
#endif
#ifndef BOOST_NO_STD_ALLOCATOR
template class BOOST_REGEX_DECL ::boost::re_detail::perl_matcher<BOOST_REGEX_CHAR_T const *, match_results< const BOOST_REGEX_CHAR_T* >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >;
#endif
#if !(defined(BOOST_DINKUMWARE_STDLIB) && (BOOST_DINKUMWARE_STDLIB <= 1))\
&& !(defined(BOOST_INTEL_CXX_VERSION) && (BOOST_INTEL_CXX_VERSION <= 800))\
&& !(defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION))
#if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
template class BOOST_REGEX_DECL match_results< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator >;
#endif
#ifndef BOOST_NO_STD_ALLOCATOR
template class BOOST_REGEX_DECL ::boost::re_detail::perl_matcher< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator, match_results< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >;
#endif
#endif
# ifdef BOOST_MSVC
# pragma warning(pop)
# endif
# ifdef template
# undef template
# endif
#elif (defined(__GNUC__) && (__GNUC__ >= 3))
# ifndef BOOST_REGEX_INSTANTIATE
# define template __extension__ extern template
# endif
template BOOST_REGEX_DECL basic_regex<BOOST_REGEX_CHAR_T>&
basic_regex<BOOST_REGEX_CHAR_T>::do_assign(
const BOOST_REGEX_CHAR_T* p1,
const BOOST_REGEX_CHAR_T* p2,
flag_type f);
template BOOST_REGEX_DECL basic_regex<BOOST_REGEX_CHAR_T>::locale_type BOOST_REGEX_CALL
basic_regex<BOOST_REGEX_CHAR_T>::imbue(locale_type l);
template BOOST_REGEX_DECL void BOOST_REGEX_CALL
match_results<const BOOST_REGEX_CHAR_T*>::maybe_assign(
const match_results<const BOOST_REGEX_CHAR_T*>& m);
template BOOST_REGEX_DECL void ::boost::re_detail::perl_matcher<BOOST_REGEX_CHAR_T const *, match_results< const BOOST_REGEX_CHAR_T* >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >::construct_init(
BOOST_REGEX_CHAR_T const * first, BOOST_REGEX_CHAR_T const * end,
match_results<BOOST_REGEX_CHAR_T const *>& what,
const basic_regex<BOOST_REGEX_CHAR_T>& e,
match_flag_type f);
template BOOST_REGEX_DECL bool ::boost::re_detail::perl_matcher<BOOST_REGEX_CHAR_T const *, match_results< const BOOST_REGEX_CHAR_T* >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >::match();
template BOOST_REGEX_DECL bool ::boost::re_detail::perl_matcher<BOOST_REGEX_CHAR_T const *, match_results< const BOOST_REGEX_CHAR_T* >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >::find();
#if defined(__GLIBCPP__) || defined(__GLIBCXX__)
// std:basic_string<>::const_iterator instances as well:
template BOOST_REGEX_DECL void BOOST_REGEX_CALL
match_results<std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator>::maybe_assign(
const match_results<std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator>& m);
template BOOST_REGEX_DECL void ::boost::re_detail::perl_matcher<std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator, match_results< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >::construct_init(
std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator first, std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator end,
match_results<std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator>& what,
const basic_regex<BOOST_REGEX_CHAR_T>& e,
match_flag_type f);
template BOOST_REGEX_DECL bool ::boost::re_detail::perl_matcher<std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator, match_results< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >::match();
template BOOST_REGEX_DECL bool ::boost::re_detail::perl_matcher<std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator, match_results< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >::find();
#endif
# ifdef template
# undef template
# endif
#endif
} // namespace boost
#endif // BOOST_REGEX_NO_EXTERNAL_TEMPLATES
include/boost/regex/v4/iterator_category.hpp
+87
View File
@@ -0,0 +1,87 @@
/*
*
* Copyright (c) 2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_match.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Iterator traits for selecting an iterator type as
* an integral constant expression.
*/
#ifndef BOOST_REGEX_ITERATOR_CATEGORY_HPP
#define BOOST_REGEX_ITERATOR_CATEGORY_HPP
#include <iterator>
#include <boost/type_traits/is_convertible.hpp>
#include <boost/type_traits/is_pointer.hpp>
namespace boost{
namespace detail{
template <class I>
struct is_random_imp
{
private:
typedef typename std::iterator_traits<I>::iterator_category cat;
public:
BOOST_STATIC_CONSTANT(bool, value = (::boost::is_convertible<cat*, std::random_access_iterator_tag*>::value));
};
template <class I>
struct is_random_pointer_imp
{
BOOST_STATIC_CONSTANT(bool, value = true);
};
template <bool is_pointer_type>
struct is_random_imp_selector
{
template <class I>
struct rebind
{
typedef is_random_imp<I> type;
};
};
template <>
struct is_random_imp_selector<true>
{
template <class I>
struct rebind
{
typedef is_random_pointer_imp<I> type;
};
};
}
template <class I>
struct is_random_access_iterator
{
private:
typedef detail::is_random_imp_selector< ::boost::is_pointer<I>::value> selector;
typedef typename selector::template rebind<I> bound_type;
typedef typename bound_type::type answer;
public:
BOOST_STATIC_CONSTANT(bool, value = answer::value);
};
#ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION
template <class I>
const bool is_random_access_iterator<I>::value;
#endif
}
#endif
include/boost/regex/v4/iterator_traits.hpp
+121
View File
@@ -0,0 +1,121 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE iterator_traits.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares iterator traits workarounds.
*/
#ifndef BOOST_REGEX_V4_ITERATOR_TRAITS_HPP
#define BOOST_REGEX_V4_ITERATOR_TRAITS_HPP
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
namespace re_detail{
#if defined(BOOST_NO_STD_ITERATOR_TRAITS) || defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
template <class T>
struct regex_iterator_traits
{
typedef typename T::iterator_category iterator_category;
typedef typename T::value_type value_type;
#if !defined(BOOST_NO_STD_ITERATOR)
typedef typename T::difference_type difference_type;
typedef typename T::pointer pointer;
typedef typename T::reference reference;
#else
typedef std::ptrdiff_t difference_type;
typedef value_type* pointer;
typedef value_type& reference;
#endif
};
template <class T>
struct pointer_iterator_traits
{
typedef std::ptrdiff_t difference_type;
typedef T value_type;
typedef T* pointer;
typedef T& reference;
typedef std::random_access_iterator_tag iterator_category;
};
template <class T>
struct const_pointer_iterator_traits
{
typedef std::ptrdiff_t difference_type;
typedef T value_type;
typedef const T* pointer;
typedef const T& reference;
typedef std::random_access_iterator_tag iterator_category;
};
template<>
struct regex_iterator_traits<char*> : pointer_iterator_traits<char>{};
template<>
struct regex_iterator_traits<const char*> : const_pointer_iterator_traits<char>{};
template<>
struct regex_iterator_traits<wchar_t*> : pointer_iterator_traits<wchar_t>{};
template<>
struct regex_iterator_traits<const wchar_t*> : const_pointer_iterator_traits<wchar_t>{};
//
// the follwoing are needed for ICU support:
//
template<>
struct regex_iterator_traits<unsigned char*> : pointer_iterator_traits<char>{};
template<>
struct regex_iterator_traits<const unsigned char*> : const_pointer_iterator_traits<char>{};
template<>
struct regex_iterator_traits<int*> : pointer_iterator_traits<int>{};
template<>
struct regex_iterator_traits<const int*> : const_pointer_iterator_traits<int>{};
#ifdef BOOST_REGEX_HAS_OTHER_WCHAR_T
template<>
struct regex_iterator_traits<unsigned short*> : pointer_iterator_traits<unsigned short>{};
template<>
struct regex_iterator_traits<const unsigned short*> : const_pointer_iterator_traits<unsigned short>{};
#endif
#if defined(__SGI_STL_PORT) && defined(__STL_DEBUG)
template<>
struct regex_iterator_traits<std::string::iterator> : pointer_iterator_traits<char>{};
template<>
struct regex_iterator_traits<std::string::const_iterator> : const_pointer_iterator_traits<char>{};
#ifndef BOOST_NO_STD_WSTRING
template<>
struct regex_iterator_traits<std::wstring::iterator> : pointer_iterator_traits<wchar_t>{};
template<>
struct regex_iterator_traits<std::wstring::const_iterator> : const_pointer_iterator_traits<wchar_t>{};
#endif // BOOST_NO_WSTRING
#endif // stport
#else
template <class T>
struct regex_iterator_traits : public std::iterator_traits<T> {};
#endif
} // namespace re_detail
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/match_flags.hpp
+140
View File
@@ -0,0 +1,140 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE match_flags.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares match_flags type.
*/
#ifndef BOOST_REGEX_V4_MATCH_FLAGS
#define BOOST_REGEX_V4_MATCH_FLAGS
#ifdef __cplusplus
# include <boost/cstdint.hpp>
#endif
#include <boost/detail/workaround.hpp>
#ifdef __cplusplus
namespace boost{
namespace regex_constants{
#endif
typedef enum _match_flags
{
match_default = 0,
match_not_bol = 1, // first is not start of line
match_not_eol = match_not_bol << 1, // last is not end of line
match_not_bob = match_not_eol << 1, // first is not start of buffer
match_not_eob = match_not_bob << 1, // last is not end of buffer
match_not_bow = match_not_eob << 1, // first is not start of word
match_not_eow = match_not_bow << 1, // last is not end of word
match_not_dot_newline = match_not_eow << 1, // \n is not matched by '.'
match_not_dot_null = match_not_dot_newline << 1, // '\0' is not matched by '.'
match_prev_avail = match_not_dot_null << 1, // *--first is a valid expression
match_init = match_prev_avail << 1, // internal use
match_any = match_init << 1, // don't care what we match
match_not_null = match_any << 1, // string can't be null
match_continuous = match_not_null << 1, // each grep match must continue from
// uninterupted from the previous one
match_partial = match_continuous << 1, // find partial matches
match_stop = match_partial << 1, // stop after first match (grep) V3 only
match_not_initial_null = match_stop, // don't match initial null, V4 only
match_all = match_stop << 1, // must find the whole of input even if match_any is set
match_perl = match_all << 1, // Use perl matching rules
match_posix = match_perl << 1, // Use POSIX matching rules
match_nosubs = match_posix << 1, // don't trap marked subs
match_extra = match_nosubs << 1, // include full capture information for repeated captures
match_single_line = match_extra << 1, // treat text as single line and ignor any \n's when matching ^ and $.
match_unused1 = match_single_line << 1, // unused
match_unused2 = match_unused1 << 1, // unused
match_unused3 = match_unused2 << 1, // unused
match_max = match_unused3,
format_perl = 0, // perl style replacement
format_default = 0, // ditto.
format_sed = match_max << 1, // sed style replacement.
format_all = format_sed << 1, // enable all extentions to sytax.
format_no_copy = format_all << 1, // don't copy non-matching segments.
format_first_only = format_no_copy << 1, // Only replace first occurance.
format_is_if = format_first_only << 1, // internal use only.
format_literal = format_is_if << 1 // treat string as a literal
} match_flags;
#if BOOST_WORKAROUND(BOOST_MSVC, < 1300) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
typedef unsigned long match_flag_type;
#else
typedef match_flags match_flag_type;
#ifdef __cplusplus
inline match_flags operator&(match_flags m1, match_flags m2)
{ return static_cast<match_flags>(static_cast<boost::int32_t>(m1) & static_cast<boost::int32_t>(m2)); }
inline match_flags operator|(match_flags m1, match_flags m2)
{ return static_cast<match_flags>(static_cast<boost::int32_t>(m1) | static_cast<boost::int32_t>(m2)); }
inline match_flags operator^(match_flags m1, match_flags m2)
{ return static_cast<match_flags>(static_cast<boost::int32_t>(m1) ^ static_cast<boost::int32_t>(m2)); }
inline match_flags operator~(match_flags m1)
{ return static_cast<match_flags>(~static_cast<boost::int32_t>(m1)); }
inline match_flags& operator&=(match_flags& m1, match_flags m2)
{ m1 = m1&m2; return m1; }
inline match_flags& operator|=(match_flags& m1, match_flags m2)
{ m1 = m1|m2; return m1; }
inline match_flags& operator^=(match_flags& m1, match_flags m2)
{ m1 = m1^m2; return m1; }
#endif
#endif
#ifdef __cplusplus
} // namespace regex_constants
//
// import names into boost for backwards compatiblity:
//
using regex_constants::match_flag_type;
using regex_constants::match_default;
using regex_constants::match_not_bol;
using regex_constants::match_not_eol;
using regex_constants::match_not_bob;
using regex_constants::match_not_eob;
using regex_constants::match_not_bow;
using regex_constants::match_not_eow;
using regex_constants::match_not_dot_newline;
using regex_constants::match_not_dot_null;
using regex_constants::match_prev_avail;
//using regex_constants::match_init;
using regex_constants::match_any;
using regex_constants::match_not_null;
using regex_constants::match_continuous;
using regex_constants::match_partial;
//using regex_constants::match_stop;
using regex_constants::match_all;
using regex_constants::match_perl;
using regex_constants::match_posix;
using regex_constants::match_nosubs;
using regex_constants::match_extra;
using regex_constants::match_single_line;
//using regex_constants::match_max;
using regex_constants::format_all;
using regex_constants::format_sed;
using regex_constants::format_perl;
using regex_constants::format_default;
using regex_constants::format_no_copy;
using regex_constants::format_first_only;
//using regex_constants::format_is_if;
} // namespace boost
#endif // __cplusplus
#endif // include guard
include/boost/regex/v4/match_results.hpp
+412
View File
@@ -0,0 +1,412 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE match_results.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares template class match_results.
*/
#ifndef BOOST_REGEX_V4_MATCH_RESULTS_HPP
#define BOOST_REGEX_V4_MATCH_RESULTS_HPP
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable : 4251 4231 4660)
#endif
template <class BidiIterator, class Allocator>
class match_results
{
private:
#ifndef BOOST_NO_STD_ALLOCATOR
typedef std::vector<sub_match<BidiIterator>, Allocator> vector_type;
#else
typedef std::vector<sub_match<BidiIterator> > vector_type;
#endif
public:
typedef sub_match<BidiIterator> value_type;
#if !defined(BOOST_NO_STD_ALLOCATOR) && !(defined(BOOST_MSVC) && defined(_STLPORT_VERSION))
typedef typename Allocator::const_reference const_reference;
#else
typedef const value_type& const_reference;
#endif
typedef const_reference reference;
typedef typename vector_type::const_iterator const_iterator;
typedef const_iterator iterator;
typedef typename re_detail::regex_iterator_traits<
BidiIterator>::difference_type difference_type;
typedef typename Allocator::size_type size_type;
typedef Allocator allocator_type;
typedef typename re_detail::regex_iterator_traits<
BidiIterator>::value_type char_type;
typedef std::basic_string<char_type> string_type;
// construct/copy/destroy:
explicit match_results(const Allocator& a = Allocator())
#ifndef BOOST_NO_STD_ALLOCATOR
: m_subs(a), m_base() {}
#else
: m_subs(), m_base() { (void)a; }
#endif
match_results(const match_results& m)
: m_subs(m.m_subs), m_base(m.m_base) {}
match_results& operator=(const match_results& m)
{
m_subs = m.m_subs;
m_base = m.m_base;
return *this;
}
~match_results(){}
// size:
size_type size() const
{ return empty() ? 0 : m_subs.size() - 2; }
size_type max_size() const
{ return m_subs.max_size(); }
bool empty() const
{ return m_subs.size() < 2; }
// element access:
difference_type length(int sub = 0) const
{
sub += 2;
if((sub < (int)m_subs.size()) && (sub > 0))
return m_subs[sub].length();
return 0;
}
difference_type position(unsigned int sub = 0) const
{
sub += 2;
if(sub < m_subs.size())
{
const sub_match<BidiIterator>& s = m_subs[sub];
if(s.matched)
{
return ::boost::re_detail::distance((BidiIterator)(m_base), (BidiIterator)(s.first));
}
}
return ~static_cast<difference_type>(0);
}
string_type str(int sub = 0) const
{
sub += 2;
string_type result;
if(sub < (int)m_subs.size() && (sub > 0))
{
const sub_match<BidiIterator>& s = m_subs[sub];
if(s.matched)
{
result = s.str();
}
}
return result;
}
const_reference operator[](int sub) const
{
sub += 2;
if(sub < (int)m_subs.size() && (sub >= 0))
{
return m_subs[sub];
}
return m_null;
}
const_reference prefix() const
{
return (*this)[-1];
}
const_reference suffix() const
{
return (*this)[-2];
}
const_iterator begin() const
{
return (m_subs.size() > 2) ? (m_subs.begin() + 2) : m_subs.end();
}
const_iterator end() const
{
return m_subs.end();
}
// format:
template <class OutputIterator>
OutputIterator format(OutputIterator out,
const string_type& fmt,
match_flag_type flags = format_default) const
{
re_detail::trivial_format_traits<char_type> traits;
return re_detail::regex_format_imp(out, *this, fmt.data(), fmt.data() + fmt.size(), flags, traits);
}
string_type format(const string_type& fmt,
match_flag_type flags = format_default) const
{
string_type result;
re_detail::string_out_iterator<string_type> i(result);
re_detail::trivial_format_traits<char_type> traits;
re_detail::regex_format_imp(i, *this, fmt.data(), fmt.data() + fmt.size(), flags, traits);
return result;
}
// format with locale:
template <class OutputIterator, class RegexT>
OutputIterator format(OutputIterator out,
const string_type& fmt,
match_flag_type flags,
const RegexT& re) const
{
return ::boost::re_detail::regex_format_imp(out, *this, fmt.data(), fmt.data() + fmt.size(), flags, re.get_traits());
}
template <class RegexT>
string_type format(const string_type& fmt,
match_flag_type flags,
const RegexT& re) const
{
string_type result;
re_detail::string_out_iterator<string_type> i(result);
::boost::re_detail::regex_format_imp(i, *this, fmt.data(), fmt.data() + fmt.size(), flags, re.get_traits());
return result;
}
allocator_type get_allocator() const
{
#ifndef BOOST_NO_STD_ALLOCATOR
return m_subs.get_allocator();
#else
return allocator_type();
#endif
}
void swap(match_results& that)
{
std::swap(m_subs, that.m_subs);
std::swap(m_base, that.m_base);
}
bool operator==(const match_results& that)const
{
return (m_subs == that.m_subs) && (m_base == that.m_base);
}
bool operator!=(const match_results& that)const
{ return !(*this == that); }
#ifdef BOOST_REGEX_MATCH_EXTRA
typedef typename sub_match<BidiIterator>::capture_sequence_type capture_sequence_type;
const capture_sequence_type& captures(int i)const
{
return (*this)[i].captures();
}
#endif
//
// private access functions:
void BOOST_REGEX_CALL set_second(BidiIterator i)
{
BOOST_ASSERT(m_subs.size() > 2);
m_subs[2].second = i;
m_subs[2].matched = true;
m_subs[0].first = i;
m_subs[0].matched = (m_subs[0].first != m_subs[0].second);
m_null.first = i;
m_null.second = i;
m_null.matched = false;
}
void BOOST_REGEX_CALL set_second(BidiIterator i, size_type pos, bool m = true)
{
pos += 2;
BOOST_ASSERT(m_subs.size() > pos);
m_subs[pos].second = i;
m_subs[pos].matched = m;
if(pos == 2)
{
m_subs[0].first = i;
m_subs[0].matched = (m_subs[0].first != m_subs[0].second);
m_null.first = i;
m_null.second = i;
m_null.matched = false;
}
}
void BOOST_REGEX_CALL set_size(size_type n, BidiIterator i, BidiIterator j)
{
value_type v(j);
size_type len = m_subs.size();
if(len > n + 2)
{
m_subs.erase(m_subs.begin()+n+2, m_subs.end());
std::fill(m_subs.begin(), m_subs.end(), v);
}
else
{
std::fill(m_subs.begin(), m_subs.end(), v);
if(n+2 != len)
m_subs.insert(m_subs.end(), n+2-len, v);
}
m_subs[1].first = i;
}
void BOOST_REGEX_CALL set_base(BidiIterator pos)
{
m_base = pos;
}
BidiIterator base()const
{
return m_base;
}
void BOOST_REGEX_CALL set_first(BidiIterator i)
{
// set up prefix:
m_subs[1].second = i;
m_subs[1].matched = (m_subs[1].first != i);
// set up $0:
m_subs[2].first = i;
// zero out everything else:
for(size_type n = 3; n < m_subs.size(); ++n)
{
m_subs[n].first = m_subs[n].second = m_subs[0].second;
m_subs[n].matched = false;
}
}
void BOOST_REGEX_CALL set_first(BidiIterator i, size_type pos)
{
BOOST_ASSERT(pos+2 < m_subs.size());
if(pos)
m_subs[pos+2].first = i;
else
set_first(i);
}
void BOOST_REGEX_CALL maybe_assign(const match_results<BidiIterator, Allocator>& m);
private:
vector_type m_subs; // subexpressions
BidiIterator m_base; // where the search started from
sub_match<BidiIterator> m_null; // a null match
};
template <class BidiIterator, class Allocator>
void BOOST_REGEX_CALL match_results<BidiIterator, Allocator>::maybe_assign(const match_results<BidiIterator, Allocator>& m)
{
const_iterator p1, p2;
p1 = begin();
p2 = m.begin();
//
// Distances are measured from the start of *this* match, unless this isn't
// a valid match in which case we use the start of the whole sequence. Note that
// no subsequent match-candidate can ever be to the left of the first match found.
// This ensures that when we are using bidirectional iterators, that distances
// measured are as short as possible, and therefore as efficient as possible
// to compute. Finally note that we don't use the "matched" data member to test
// whether a sub-expression is a valid match, because partial matches set this
// to false for sub-expression 0.
//
BidiIterator end = this->suffix().second;
BidiIterator base = (p1->first == end) ? this->prefix().first : (*this)[0].first;
difference_type len1 = 0;
difference_type len2 = 0;
difference_type base1 = 0;
difference_type base2 = 0;
std::size_t i;
for(i = 0; i < size(); ++i, ++p1, ++p2)
{
//
// Leftmost takes priority over longest; handle special cases
// where distances need not be computed first (an optimisation
// for bidirectional iterators: ensure that we don't accidently
// compute the length of the whole sequence, as this can be really
// expensive).
//
if(p1->first == end)
{
if(p2->first != end)
{
// p2 must be better than p1, and no need to calculate
// actual distances:
base1 = 1;
base2 = 0;
break;
}
else
{
// *p1 and *p2 are either unmatched or match end-of sequence,
// either way no need to calculate distances:
if((p1->matched == false) && (p2->matched == true))
break;
if((p1->matched == true) && (p2->matched == false))
return;
continue;
}
}
else if(p2->first == end)
{
// p1 better than p2, and no need to calculate distances:
return;
}
base1 = ::boost::re_detail::distance(base, p1->first);
base2 = ::boost::re_detail::distance(base, p2->first);
BOOST_ASSERT(base1 >= 0);
BOOST_ASSERT(base2 >= 0);
if(base1 < base2) return;
if(base2 < base1) break;
len1 = ::boost::re_detail::distance((BidiIterator)p1->first, (BidiIterator)p1->second);
len2 = ::boost::re_detail::distance((BidiIterator)p2->first, (BidiIterator)p2->second);
BOOST_ASSERT(len1 >= 0);
BOOST_ASSERT(len2 >= 0);
if((len1 != len2) || ((p1->matched == false) && (p2->matched == true)))
break;
if((p1->matched == true) && (p2->matched == false))
return;
}
if(i == size())
return;
if(base2 < base1)
*this = m;
else if((len2 > len1) || ((p1->matched == false) && (p2->matched == true)) )
*this = m;
}
template <class BidiIterator, class Allocator>
void swap(match_results<BidiIterator, Allocator>& a, match_results<BidiIterator, Allocator>& b)
{
a.swap(b);
}
#ifndef BOOST_NO_STD_LOCALE
template <class charT, class traits, class BidiIterator, class Allocator>
std::basic_ostream<charT, traits>&
operator << (std::basic_ostream<charT, traits>& os,
const match_results<BidiIterator, Allocator>& s)
{
return (os << s.str());
}
#else
template <class BidiIterator, class Allocator>
std::ostream& operator << (std::ostream& os,
const match_results<BidiIterator, Allocator>& s)
{
return (os << s.str());
}
#endif
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/mem_block_cache.hpp
+99
View File
@@ -0,0 +1,99 @@
/*
* Copyright (c) 2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE mem_block_cache.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: memory block cache used by the non-recursive matcher.
*/
#ifndef BOOST_REGEX_V4_MEM_BLOCK_CACHE_HPP
#define BOOST_REGEX_V4_MEM_BLOCK_CACHE_HPP
#include <new>
#ifdef BOOST_HAS_THREADS
#include <boost/regex/pending/static_mutex.hpp>
#endif
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
namespace re_detail{
struct mem_block_node
{
mem_block_node* next;
};
struct mem_block_cache
{
// this member has to be statically initialsed:
mem_block_node* next;
unsigned cached_blocks;
#ifdef BOOST_HAS_THREADS
boost::static_mutex mut;
#endif
~mem_block_cache()
{
while(next)
{
mem_block_node* old = next;
next = next->next;
::operator delete(old);
}
}
void* get()
{
#ifdef BOOST_HAS_THREADS
boost::static_mutex::scoped_lock g(mut);
#endif
if(next)
{
mem_block_node* result = next;
next = next->next;
--cached_blocks;
return result;
}
return ::operator new(BOOST_REGEX_BLOCKSIZE);
}
void put(void* p)
{
#ifdef BOOST_HAS_THREADS
boost::static_mutex::scoped_lock g(mut);
#endif
if(cached_blocks >= BOOST_REGEX_MAX_CACHE_BLOCKS)
{
::operator delete(p);
}
else
{
mem_block_node* old = static_cast<mem_block_node*>(p);
old->next = next;
next = old;
++cached_blocks;
}
}
};
extern mem_block_cache block_cache;
}
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/perl_matcher.hpp
+518
View File
@@ -0,0 +1,518 @@
/*
*
* Copyright (c) 2002
* 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)
*
*/
#ifndef BOOST_REGEX_MATCHER_HPP
#define BOOST_REGEX_MATCHER_HPP
#include <boost/regex/v4/iterator_category.hpp>
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
namespace re_detail{
//
// error checking API:
//
BOOST_REGEX_DECL void BOOST_REGEX_CALL verify_options(boost::regex_constants::syntax_option_type ef, match_flag_type mf);
//
// function can_start:
//
template <class charT>
bool can_start(charT c, const unsigned char* map, unsigned char mask)
{
return ((c < static_cast<charT>(0)) ? true : ((c >= static_cast<charT>(1 << CHAR_BIT)) ? true : map[c] & mask));
}
inline bool can_start(char c, const unsigned char* map, unsigned char mask)
{
return map[(unsigned char)c] & mask;
}
inline bool can_start(signed char c, const unsigned char* map, unsigned char mask)
{
return map[(unsigned char)c] & mask;
}
inline bool can_start(unsigned char c, const unsigned char* map, unsigned char mask)
{
return map[c] & mask;
}
inline bool can_start(unsigned short c, const unsigned char* map, unsigned char mask)
{
return ((c >= (1 << CHAR_BIT)) ? true : map[c] & mask);
}
#if !defined(__HP_aCC)
#if defined(WCHAR_MIN) && (WCHAR_MIN == 0) && !defined(BOOST_NO_INTRINSIC_WCHAR_T)
inline bool can_start(wchar_t c, const unsigned char* map, unsigned char mask)
{
return ((c >= (1 << CHAR_BIT)) ? true : map[c] & mask);
}
#endif
#endif
//
// Unfortunately Rogue Waves standard library appears to have a bug
// in std::basic_string::compare that results in eroneous answers
// in some cases (tested with Borland C++ 5.1, Rogue Wave lib version
// 0x020101) the test case was:
// {39135,0} < {0xff,0}
// which succeeds when it should not.
//
#ifndef _RWSTD_VER
#if !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
template <class C, class T, class A>
inline int string_compare(const std::basic_string<C,T,A>& s, const C* p)
{
if(0 == *p)
{
if(s.empty() || ((s.size() == 1) && (s[0] == 0)))
return 0;
}
return s.compare(p);
}
#endif
#else
#if !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
template <class C, class T, class A>
inline int string_compare(const std::basic_string<C,T,A>& s, const C* p)
{
if(0 == *p)
{
if(s.empty() || ((s.size() == 1) && (s[0] == 0)))
return 0;
}
return s.compare(p);
}
#endif
inline int string_compare(const std::string& s, const char* p)
{ return std::strcmp(s.c_str(), p); }
# ifndef BOOST_NO_WREGEX
inline int string_compare(const std::wstring& s, const wchar_t* p)
{ return std::wcscmp(s.c_str(), p); }
#endif
#endif
template <class Seq, class C>
inline int string_compare(const Seq& s, const C* p)
{
std::size_t i = 0;
while((i < s.size()) && (p[i] == s[i]))
{
++i;
}
return (i == s.size()) ? -p[i] : s[i] - p[i];
}
# define STR_COMP(s,p) string_compare(s,p)
template<class charT>
inline const charT* re_skip_past_null(const charT* p)
{
while (*p != static_cast<charT>(0)) ++p;
return ++p;
}
template <class iterator, class charT, class traits_type, class char_classT>
iterator BOOST_REGEX_CALL re_is_set_member(iterator next,
iterator last,
const re_set_long<char_classT>* set_,
const regex_data<charT, traits_type>& e, bool icase)
{
const charT* p = reinterpret_cast<const charT*>(set_+1);
iterator ptr;
unsigned int i;
//bool icase = e.m_flags & regex_constants::icase;
if(next == last) return next;
typedef typename traits_type::string_type traits_string_type;
const ::boost::regex_traits_wrapper<traits_type>& traits_inst = *(e.m_ptraits);
// dwa 9/13/00 suppress incorrect MSVC warning - it claims this is never
// referenced
(void)traits_inst;
// try and match a single character, could be a multi-character
// collating element...
for(i = 0; i < set_->csingles; ++i)
{
ptr = next;
if(*p == static_cast<charT>(0))
{
// treat null string as special case:
if(traits_inst.translate(*ptr, icase) != *p)
{
while(*p == static_cast<charT>(0))++p;
continue;
}
return set_->isnot ? next : (ptr == next) ? ++next : ptr;
}
else
{
while(*p && (ptr != last))
{
if(traits_inst.translate(*ptr, icase) != *p)
break;
++p;
++ptr;
}
if(*p == static_cast<charT>(0)) // if null we've matched
return set_->isnot ? next : (ptr == next) ? ++next : ptr;
p = re_skip_past_null(p); // skip null
}
}
charT col = traits_inst.translate(*next, icase);
if(set_->cranges || set_->cequivalents)
{
traits_string_type s1;
//
// try and match a range, NB only a single character can match
if(set_->cranges)
{
if((e.m_flags & regex_constants::collate) == 0)
s1.assign(1, col);
else
{
charT a[2] = { col, charT(0), };
s1 = traits_inst.transform(a, a + 1);
}
for(i = 0; i < set_->cranges; ++i)
{
if(STR_COMP(s1, p) >= 0)
{
do{ ++p; }while(*p);
++p;
if(STR_COMP(s1, p) <= 0)
return set_->isnot ? next : ++next;
}
else
{
// skip first string
do{ ++p; }while(*p);
++p;
}
// skip second string
do{ ++p; }while(*p);
++p;
}
}
//
// try and match an equivalence class, NB only a single character can match
if(set_->cequivalents)
{
charT a[2] = { col, charT(0), };
s1 = traits_inst.transform_primary(a, a +1);
for(i = 0; i < set_->cequivalents; ++i)
{
if(STR_COMP(s1, p) == 0)
return set_->isnot ? next : ++next;
// skip string
do{ ++p; }while(*p);
++p;
}
}
}
if(traits_inst.isctype(col, set_->cclasses) == true)
return set_->isnot ? next : ++next;
return set_->isnot ? ++next : next;
}
template <class BidiIterator>
class repeater_count
{
repeater_count** stack;
repeater_count* next;
int id;
std::size_t count; // the number of iterations so far
BidiIterator start_pos; // where the last repeat started
public:
repeater_count(repeater_count** s)
{
stack = s;
next = 0;
id = -1;
count = 0;
}
repeater_count(int i, repeater_count** s, BidiIterator start)
: start_pos(start)
{
id = i;
stack = s;
next = *stack;
*stack = this;
if(id > next->id)
count = 0;
else
{
repeater_count* p = next;
while(p->id != id)
p = p->next;
count = p->count;
start_pos = p->start_pos;
}
}
~repeater_count()
{
*stack = next;
}
std::size_t get_count() { return count; }
int get_id() { return id; }
std::size_t operator++() { return ++count; }
bool check_null_repeat(const BidiIterator& pos, std::size_t max)
{
// this is called when we are about to start a new repeat,
// if the last one was NULL move our count to max,
// otherwise save the current position.
bool result = (count == 0) ? false : (pos == start_pos);
if(result)
count = max;
else
start_pos = pos;
return result;
}
};
struct saved_state;
enum saved_state_type
{
saved_type_end = 0,
saved_type_paren = 1,
saved_type_recurse = 2,
saved_type_assertion = 3,
saved_state_alt = 4,
saved_state_repeater_count = 5,
saved_state_extra_block = 6,
saved_state_greedy_single_repeat = 7,
saved_state_rep_slow_dot = 8,
saved_state_rep_fast_dot = 9,
saved_state_rep_char = 10,
saved_state_rep_short_set = 11,
saved_state_rep_long_set = 12,
saved_state_non_greedy_long_repeat = 13,
saved_state_count = 14
};
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable : 4251 4231 4660)
#endif
template <class BidiIterator, class Allocator, class traits>
class perl_matcher
{
public:
typedef typename traits::char_type char_type;
typedef perl_matcher<BidiIterator, Allocator, traits> self_type;
typedef bool (self_type::*matcher_proc_type)(void);
typedef typename traits::size_type traits_size_type;
typedef typename is_byte<char_type>::width_type width_type;
typedef typename regex_iterator_traits<BidiIterator>::difference_type difference_type;
perl_matcher(BidiIterator first, BidiIterator end,
match_results<BidiIterator, Allocator>& what,
const basic_regex<char_type, traits>& e,
match_flag_type f);
bool match();
bool find();
void setf(match_flag_type f)
{ m_match_flags |= f; }
void unsetf(match_flag_type f)
{ m_match_flags &= ~f; }
private:
void construct_init(BidiIterator first, BidiIterator end,
match_results<BidiIterator, Allocator>& what,
const basic_regex<char_type, traits>& e,
match_flag_type f);
bool find_imp();
bool match_imp();
#ifdef BOOST_REGEX_HAS_MS_STACK_GUARD
typedef bool (perl_matcher::*protected_proc_type)();
bool protected_call(protected_proc_type);
#endif
void estimate_max_state_count(std::random_access_iterator_tag*);
void estimate_max_state_count(void*);
bool match_prefix();
bool match_all_states();
// match procs, stored in s_match_vtable:
bool match_startmark();
bool match_endmark();
bool match_literal();
bool match_start_line();
bool match_end_line();
bool match_wild();
bool match_match();
bool match_word_boundary();
bool match_within_word();
bool match_word_start();
bool match_word_end();
bool match_buffer_start();
bool match_buffer_end();
bool match_backref();
bool match_long_set();
bool match_set();
bool match_jump();
bool match_alt();
bool match_rep();
bool match_combining();
bool match_soft_buffer_end();
bool match_restart_continue();
bool match_long_set_repeat();
bool match_set_repeat();
bool match_char_repeat();
bool match_dot_repeat_fast();
bool match_dot_repeat_slow();
bool match_backstep();
bool match_assert_backref();
bool match_toggle_case();
#ifdef BOOST_REGEX_RECURSIVE
bool backtrack_till_match(std::size_t count);
#endif
// find procs stored in s_find_vtable:
bool find_restart_any();
bool find_restart_word();
bool find_restart_line();
bool find_restart_buf();
bool find_restart_lit();
private:
// final result structure to be filled in:
match_results<BidiIterator, Allocator>& m_result;
// temporary result for POSIX matches:
scoped_ptr<match_results<BidiIterator, Allocator> > m_temp_match;
// pointer to actual result structure to fill in:
match_results<BidiIterator, Allocator>* m_presult;
// start of sequence being searched:
BidiIterator base;
// end of sequence being searched:
BidiIterator last;
// current character being examined:
BidiIterator position;
// where to restart next search after failed match attempt:
BidiIterator restart;
// where the current search started from, acts as base for $` during grep:
BidiIterator search_base;
// the expression being examined:
const basic_regex<char_type, traits>& re;
// the expression's traits class:
const ::boost::regex_traits_wrapper<traits>& traits_inst;
// the next state in the machine being matched:
const re_syntax_base* pstate;
// matching flags in use:
match_flag_type m_match_flags;
// how many states we have examined so far:
difference_type state_count;
// max number of states to examine before giving up:
difference_type max_state_count;
// whether we should ignore case or not:
bool icase;
// set to true when (position == last), indicates that we may have a partial match:
bool m_has_partial_match;
// set to true whenever we get a match:
bool m_has_found_match;
// set to true whenever we're inside an independent sub-expression:
bool m_independent;
// the current repeat being examined:
repeater_count<BidiIterator>* next_count;
// the first repeat being examined (top of linked list):
repeater_count<BidiIterator> rep_obj;
// the mask to pass when matching word boundaries:
typename traits::char_class_type m_word_mask;
// the bitmask to use when determining whether a match_any matches a newline or not:
unsigned char match_any_mask;
#ifdef BOOST_REGEX_NON_RECURSIVE
//
// additional members for non-recursive version:
//
typedef bool (self_type::*unwind_proc_type)(bool);
void extend_stack();
bool unwind(bool);
bool unwind_end(bool);
bool unwind_paren(bool);
bool unwind_recursion_stopper(bool);
bool unwind_assertion(bool);
bool unwind_alt(bool);
bool unwind_repeater_counter(bool);
bool unwind_extra_block(bool);
bool unwind_greedy_single_repeat(bool);
bool unwind_slow_dot_repeat(bool);
bool unwind_fast_dot_repeat(bool);
bool unwind_char_repeat(bool);
bool unwind_short_set_repeat(bool);
bool unwind_long_set_repeat(bool);
bool unwind_non_greedy_repeat(bool);
void destroy_single_repeat();
void push_matched_paren(int index, const sub_match<BidiIterator>& sub);
void push_recursion_stopper();
void push_assertion(const re_syntax_base* ps, bool positive);
void push_alt(const re_syntax_base* ps);
void push_repeater_count(int i, repeater_count<BidiIterator>** s);
void push_single_repeat(std::size_t c, const re_repeat* r, BidiIterator last_position, int id);
void push_non_greedy_repeat(const re_syntax_base* ps);
// pointer to base of stack:
saved_state* m_stack_base;
// pointer to current stack position:
saved_state* m_backup_state;
// determines what value to return when unwinding from recursion,
// allows for mixed recursive/non-recursive algorithm:
bool m_recursive_result;
// how many memory blocks have we used up?:
unsigned used_block_count;
#endif
// these operations aren't allowed, so are declared private,
// bodies are provided to keep explicit-instantiation requests happy:
perl_matcher& operator=(const perl_matcher&)
{
return *this;
}
perl_matcher(const perl_matcher& that)
: m_result(that.m_result), re(that.re), traits_inst(that.traits_inst), rep_obj(0) {}
};
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
} // namespace re_detail
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace boost
//
// include the implementation of perl_matcher:
//
#ifdef BOOST_REGEX_RECURSIVE
#include <boost/regex/v4/perl_matcher_recursive.hpp>
#else
#include <boost/regex/v4/perl_matcher_non_recursive.hpp>
#endif
// this one has to be last:
#include <boost/regex/v4/perl_matcher_common.hpp>
#endif
include/boost/regex/v4/perl_matcher_common.hpp
+899
View File
@@ -0,0 +1,899 @@
/*
*
* Copyright (c) 2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE perl_matcher_common.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Definitions of perl_matcher member functions that are
* common to both the recursive and non-recursive versions.
*/
#ifndef BOOST_REGEX_V4_PERL_MATCHER_COMMON_HPP
#define BOOST_REGEX_V4_PERL_MATCHER_COMMON_HPP
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
#ifdef __BORLANDC__
# pragma option push -w-8008 -w-8066
#endif
namespace boost{
namespace re_detail{
template <class BidiIterator, class Allocator, class traits>
perl_matcher<BidiIterator, Allocator, traits>::perl_matcher(BidiIterator first, BidiIterator end,
match_results<BidiIterator, Allocator>& what,
const basic_regex<char_type, traits>& e,
match_flag_type f)
: m_result(what), base(first), last(end),
position(first), re(e), traits_inst(e.get_traits()),
m_independent(false), next_count(&rep_obj), rep_obj(&next_count)
{
construct_init(first, last, what, e, f);
}
template <class BidiIterator, class Allocator, class traits>
void perl_matcher<BidiIterator, Allocator, traits>::construct_init(BidiIterator first, BidiIterator end,
match_results<BidiIterator, Allocator>& what,
const basic_regex<char_type, traits>& e,
match_flag_type f)
{
typedef typename regex_iterator_traits<BidiIterator>::iterator_category category;
if(e.empty())
{
// precondition failure: e is not a valid regex.
std::invalid_argument ex("Invalid regular expression object");
boost::throw_exception(ex);
}
pstate = 0;
m_match_flags = f;
icase = re.flags() & regex_constants::icase;
estimate_max_state_count(static_cast<category*>(0));
if(!(m_match_flags & (match_perl|match_posix)))
{
if((re.flags() & (regbase::main_option_type|regbase::no_perl_ex)) == 0)
m_match_flags |= match_perl;
else if((re.flags() & (regbase::main_option_type|regbase::emacs_ex)) == (regbase::basic_syntax_group|regbase::emacs_ex))
m_match_flags |= match_perl;
else
m_match_flags |= match_posix;
}
if(m_match_flags & match_posix)
{
m_temp_match.reset(new match_results<BidiIterator, Allocator>());
m_presult = m_temp_match.get();
}
else
m_presult = &m_result;
#ifdef BOOST_REGEX_NON_RECURSIVE
m_stack_base = 0;
m_backup_state = 0;
#endif
// find the value to use for matching word boundaries:
const char_type w = static_cast<char_type>('w');
m_word_mask = traits_inst.lookup_classname(&w, &w+1);
// find bitmask to use for matching '.':
match_any_mask = static_cast<unsigned char>((f & match_not_dot_newline) ? re_detail::test_not_newline : re_detail::test_newline);
}
template <class BidiIterator, class Allocator, class traits>
void perl_matcher<BidiIterator, Allocator, traits>::estimate_max_state_count(std::random_access_iterator_tag*)
{
static const difference_type k = 100000;
difference_type dist = boost::re_detail::distance(base, last);
traits_size_type states = static_cast<traits_size_type>(re.size());
states *= states;
difference_type lim = ((std::numeric_limits<difference_type>::max)() - k) / states;
if(dist >= lim)
max_state_count = (std::numeric_limits<difference_type>::max)();
else
max_state_count = k + states * dist;
}
template <class BidiIterator, class Allocator, class traits>
void perl_matcher<BidiIterator, Allocator, traits>::estimate_max_state_count(void*)
{
// we don't know how long the sequence is:
max_state_count = BOOST_REGEX_MAX_STATE_COUNT;
}
#ifdef BOOST_REGEX_HAS_MS_STACK_GUARD
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::protected_call(
protected_proc_type proc)
{
/*
__try{
return (this->*proc)();
}__except(EXCEPTION_STACK_OVERFLOW == GetExceptionCode())
{
reset_stack_guard_page();
}
// we only get here after a stack overflow:
raise_error<traits>(traits_inst, regex_constants::error_size);
// and we never really get here at all:
return false;
*/
::boost::re_detail::concrete_protected_call
<perl_matcher<BidiIterator, Allocator, traits> >
obj(this, proc);
return obj.execute();
}
#endif
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match()
{
#ifdef BOOST_REGEX_HAS_MS_STACK_GUARD
return protected_call(&perl_matcher<BidiIterator, Allocator, traits>::match_imp);
#else
return match_imp();
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_imp()
{
// initialise our stack if we are non-recursive:
#ifdef BOOST_REGEX_NON_RECURSIVE
save_state_init init(&m_stack_base, &m_backup_state);
used_block_count = BOOST_REGEX_MAX_BLOCKS;
#if !defined(BOOST_NO_EXCEPTIONS)
try{
#endif
#endif
// reset our state machine:
position = base;
search_base = base;
state_count = 0;
m_match_flags |= regex_constants::match_all;
m_presult->set_size((m_match_flags & match_nosubs) ? 1 : re.mark_count(), base, last);
m_presult->set_base(base);
if(m_match_flags & match_posix)
m_result = *m_presult;
verify_options(re.flags(), m_match_flags);
if(0 == match_prefix())
return false;
return m_result[0].second == last;
#if defined(BOOST_REGEX_NON_RECURSIVE) && !defined(BOOST_NO_EXCEPTIONS)
}
catch(...)
{
// unwind all pushed states, apart from anything else this
// ensures that all the states are correctly destructed
// not just the memory freed.
while(unwind(true)){}
throw;
}
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::find()
{
#ifdef BOOST_REGEX_HAS_MS_STACK_GUARD
return protected_call(&perl_matcher<BidiIterator, Allocator, traits>::find_imp);
#else
return find_imp();
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::find_imp()
{
static matcher_proc_type const s_find_vtable[7] =
{
&perl_matcher<BidiIterator, Allocator, traits>::find_restart_any,
&perl_matcher<BidiIterator, Allocator, traits>::find_restart_word,
&perl_matcher<BidiIterator, Allocator, traits>::find_restart_line,
&perl_matcher<BidiIterator, Allocator, traits>::find_restart_buf,
&perl_matcher<BidiIterator, Allocator, traits>::match_prefix,
&perl_matcher<BidiIterator, Allocator, traits>::find_restart_lit,
&perl_matcher<BidiIterator, Allocator, traits>::find_restart_lit,
};
// initialise our stack if we are non-recursive:
#ifdef BOOST_REGEX_NON_RECURSIVE
save_state_init init(&m_stack_base, &m_backup_state);
used_block_count = BOOST_REGEX_MAX_BLOCKS;
#if !defined(BOOST_NO_EXCEPTIONS)
try{
#endif
#endif
state_count = 0;
if((m_match_flags & regex_constants::match_init) == 0)
{
// reset our state machine:
position = base;
search_base = base;
pstate = re.get_first_state();
m_presult->set_size((m_match_flags & match_nosubs) ? 1 : re.mark_count(), base, last);
m_presult->set_base(base);
m_match_flags |= regex_constants::match_init;
}
else
{
// start again:
search_base = position = m_result[0].second;
// If last match was null and match_not_null was not set then increment
// our start position, otherwise we go into an infinite loop:
if(((m_match_flags & match_not_null) == 0) && (m_result.length() == 0))
{
if(position == last)
return false;
else
++position;
}
// reset $` start:
m_presult->set_size((m_match_flags & match_nosubs) ? 1 : re.mark_count(), search_base, last);
if(base != search_base)
m_match_flags |= match_prev_avail;
}
if(m_match_flags & match_posix)
{
m_result.set_size(re.mark_count(), base, last);
m_result.set_base(base);
}
verify_options(re.flags(), m_match_flags);
// find out what kind of expression we have:
unsigned type = (m_match_flags & match_continuous) ?
static_cast<unsigned int>(regbase::restart_continue)
: static_cast<unsigned int>(re.get_restart_type());
// call the appropriate search routine:
matcher_proc_type proc = s_find_vtable[type];
return (this->*proc)();
#if defined(BOOST_REGEX_NON_RECURSIVE) && !defined(BOOST_NO_EXCEPTIONS)
}
catch(...)
{
// unwind all pushed states, apart from anything else this
// ensures that all the states are correctly destructed
// not just the memory freed.
while(unwind(true)){}
throw;
}
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_prefix()
{
m_has_partial_match = false;
m_has_found_match = false;
pstate = re.get_first_state();
m_presult->set_first(position);
restart = position;
match_all_states();
if(!m_has_found_match && m_has_partial_match && (m_match_flags & match_partial))
{
m_has_found_match = true;
m_presult->set_second(last, 0, false);
position = last;
}
#ifdef BOOST_REGEX_MATCH_EXTRA
if(m_has_found_match && (match_extra & m_match_flags))
{
//
// we have a match, reverse the capture information:
//
for(unsigned i = 0; i < m_presult->size(); ++i)
{
typename sub_match<BidiIterator>::capture_sequence_type & seq = ((*m_presult)[i]).get_captures();
std::reverse(seq.begin(), seq.end());
}
}
#endif
if(!m_has_found_match)
position = restart; // reset search postion
return m_has_found_match;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_endmark()
{
int index = static_cast<const re_brace*>(pstate)->index;
if(index > 0)
{
if((m_match_flags & match_nosubs) == 0)
m_presult->set_second(position, index);
}
else if((index < 0) && (index != -4))
{
// matched forward lookahead:
pstate = 0;
return true;
}
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_literal()
{
unsigned int len = static_cast<const re_literal*>(pstate)->length;
const char_type* what = reinterpret_cast<const char_type*>(static_cast<const re_literal*>(pstate) + 1);
//
// compare string with what we stored in
// our records:
for(unsigned int i = 0; i < len; ++i, ++position)
{
if((position == last) || (traits_inst.translate(*position, icase) != what[i]))
return false;
}
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_start_line()
{
if(position == base)
{
if((m_match_flags & match_prev_avail) == 0)
{
if((m_match_flags & match_not_bol) == 0)
{
pstate = pstate->next.p;
return true;
}
return false;
}
}
else if(m_match_flags & match_single_line)
return false;
// check the previous value character:
BidiIterator t(position);
--t;
if(position != last)
{
if(is_separator(*t) && !((*t == static_cast<char_type>('\r')) && (*position == static_cast<char_type>('\n'))) )
{
pstate = pstate->next.p;
return true;
}
}
else if(is_separator(*t))
{
pstate = pstate->next.p;
return true;
}
return false;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_end_line()
{
if(position != last)
{
if(m_match_flags & match_single_line)
return false;
// we're not yet at the end so *first is always valid:
if(is_separator(*position))
{
if((position != base) || (m_match_flags & match_prev_avail))
{
// check that we're not in the middle of \r\n sequence
BidiIterator t(position);
--t;
if((*t == static_cast<char_type>('\r')) && (*position == static_cast<char_type>('\n')))
{
return false;
}
}
pstate = pstate->next.p;
return true;
}
}
else if((m_match_flags & match_not_eol) == 0)
{
pstate = pstate->next.p;
return true;
}
return false;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_wild()
{
if(position == last)
return false;
if(is_separator(*position) && ((match_any_mask & static_cast<const re_dot*>(pstate)->mask) == 0))
return false;
if((*position == char_type(0)) && (m_match_flags & match_not_dot_null))
return false;
pstate = pstate->next.p;
++position;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_match()
{
if((m_match_flags & match_not_null) && (position == (*m_presult)[0].first))
return false;
if((m_match_flags & match_all) && (position != last))
return false;
if((m_match_flags & regex_constants::match_not_initial_null) && (position == search_base))
return false;
m_presult->set_second(position);
pstate = 0;
m_has_found_match = true;
if((m_match_flags & match_posix) == match_posix)
{
m_result.maybe_assign(*m_presult);
if((m_match_flags & match_any) == 0)
return false;
}
#ifdef BOOST_REGEX_MATCH_EXTRA
if(match_extra & m_match_flags)
{
for(unsigned i = 0; i < m_presult->size(); ++i)
if((*m_presult)[i].matched)
((*m_presult)[i]).get_captures().push_back((*m_presult)[i]);
}
#endif
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_word_boundary()
{
bool b; // indcates whether next character is a word character
if(position != last)
{
// prev and this character must be opposites:
#if defined(BOOST_REGEX_USE_C_LOCALE) && defined(__GNUC__) && (__GNUC__ == 2) && (__GNUC_MINOR__ < 95)
b = traits::isctype(*position, m_word_mask);
#else
b = traits_inst.isctype(*position, m_word_mask);
#endif
}
else
{
b = (m_match_flags & match_not_eow) ? true : false;
}
if((position == base) && ((m_match_flags & match_prev_avail) == 0))
{
if(m_match_flags & match_not_bow)
b ^= true;
else
b ^= false;
}
else
{
--position;
b ^= traits_inst.isctype(*position, m_word_mask);
++position;
}
if(b)
{
pstate = pstate->next.p;
return true;
}
return false; // no match if we get to here...
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_within_word()
{
if(position == last)
return false;
// both prev and this character must be m_word_mask:
if(traits_inst.isctype(*position, m_word_mask))
{
bool b;
if((position == base) && ((m_match_flags & match_prev_avail) == 0))
return false;
else
{
--position;
b = traits_inst.isctype(*position, m_word_mask);
++position;
}
if(b)
{
pstate = pstate->next.p;
return true;
}
}
return false;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_word_start()
{
if(position == last)
return false; // can't be starting a word if we're already at the end of input
if(!traits_inst.isctype(*position, m_word_mask))
return false; // next character isn't a word character
if((position == base) && ((m_match_flags & match_prev_avail) == 0))
{
if(m_match_flags & match_not_bow)
return false; // no previous input
}
else
{
// otherwise inside buffer:
BidiIterator t(position);
--t;
if(traits_inst.isctype(*t, m_word_mask))
return false; // previous character not non-word
}
// OK we have a match:
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_word_end()
{
if((position == base) && ((m_match_flags & match_prev_avail) == 0))
return false; // start of buffer can't be end of word
BidiIterator t(position);
--t;
if(traits_inst.isctype(*t, m_word_mask) == false)
return false; // previous character wasn't a word character
if(position == last)
{
if(m_match_flags & match_not_eow)
return false; // end of buffer but not end of word
}
else
{
// otherwise inside buffer:
if(traits_inst.isctype(*position, m_word_mask))
return false; // next character is a word character
}
pstate = pstate->next.p;
return true; // if we fall through to here then we've succeeded
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_buffer_start()
{
if((position != base) || (m_match_flags & match_not_bob))
return false;
// OK match:
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_buffer_end()
{
if((position != last) || (m_match_flags & match_not_eob))
return false;
// OK match:
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_backref()
{
// compare with what we previously matched:
BidiIterator i = (*m_presult)[static_cast<const re_brace*>(pstate)->index].first;
BidiIterator j = (*m_presult)[static_cast<const re_brace*>(pstate)->index].second;
while(i != j)
{
if((position == last) || (traits_inst.translate(*position, icase) != traits_inst.translate(*i, icase)))
return false;
++i;
++position;
}
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_long_set()
{
typedef typename traits::char_class_type char_class_type;
// let the traits class do the work:
if(position == last)
return false;
BidiIterator t = re_is_set_member(position, last, static_cast<const re_set_long<char_class_type>*>(pstate), re.get_data(), icase);
if(t != position)
{
pstate = pstate->next.p;
position = t;
return true;
}
return false;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_set()
{
if(position == last)
return false;
if(static_cast<const re_set*>(pstate)->_map[static_cast<unsigned char>(traits_inst.translate(*position, icase))])
{
pstate = pstate->next.p;
++position;
return true;
}
return false;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_jump()
{
pstate = static_cast<const re_jump*>(pstate)->alt.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_combining()
{
if(position == last)
return false;
if(is_combining(traits_inst.translate(*position, icase)))
return false;
++position;
while((position != last) && is_combining(traits_inst.translate(*position, icase)))
++position;
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_soft_buffer_end()
{
if(m_match_flags & match_not_eob)
return false;
BidiIterator p(position);
while((p != last) && is_separator(traits_inst.translate(*p, icase)))++p;
if(p != last)
return false;
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_restart_continue()
{
if(position == search_base)
{
pstate = pstate->next.p;
return true;
}
return false;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_backstep()
{
std::ptrdiff_t maxlen = ::boost::re_detail::distance(search_base, position);
if(maxlen < static_cast<const re_brace*>(pstate)->index)
return false;
std::advance(position, -static_cast<const re_brace*>(pstate)->index);
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
inline bool perl_matcher<BidiIterator, Allocator, traits>::match_assert_backref()
{
// return true if marked sub-expression N has been matched:
bool result = (*m_presult)[static_cast<const re_brace*>(pstate)->index].matched;
pstate = pstate->next.p;
return result;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_toggle_case()
{
// change our case sensitivity:
this->icase = static_cast<const re_case*>(pstate)->icase;
pstate = pstate->next.p;
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::find_restart_any()
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127)
#endif
const unsigned char* _map = re.get_map();
while(true)
{
// skip everything we can't match:
while((position != last) && !can_start(*position, _map, (unsigned char)mask_any) )
++position;
if(position == last)
{
// run out of characters, try a null match if possible:
if(re.can_be_null())
return match_prefix();
break;
}
// now try and obtain a match:
if(match_prefix())
return true;
if(position == last)
return false;
++position;
}
return false;
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::find_restart_word()
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127)
#endif
// do search optimised for word starts:
const unsigned char* _map = re.get_map();
if((m_match_flags & match_prev_avail) || (position != base))
--position;
else if(match_prefix())
return true;
do
{
while((position != last) && traits_inst.isctype(*position, m_word_mask))
++position;
while((position != last) && !traits_inst.isctype(*position, m_word_mask))
++position;
if(position == last)
break;
if(can_start(*position, _map, (unsigned char)mask_any) )
{
if(match_prefix())
return true;
}
if(position == last)
break;
} while(true);
return false;
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::find_restart_line()
{
// do search optimised for line starts:
const unsigned char* _map = re.get_map();
if(match_prefix())
return true;
while(position != last)
{
while((position != last) && !is_separator(*position))
++position;
if(position == last)
return false;
++position;
if(position == last)
{
if(re.can_be_null() && match_prefix())
return true;
return false;
}
if( can_start(*position, _map, (unsigned char)mask_any) )
{
if(match_prefix())
return true;
}
if(position == last)
return false;
//++position;
}
return false;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::find_restart_buf()
{
if((position == base) && ((m_match_flags & match_not_bob) == 0))
return match_prefix();
return false;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::find_restart_lit()
{
#if 0
if(position == last)
return false; // can't possibly match if we're at the end already
unsigned type = (m_match_flags & match_continuous) ?
static_cast<unsigned int>(regbase::restart_continue)
: static_cast<unsigned int>(re.get_restart_type());
const kmp_info<char_type>* info = access::get_kmp(re);
int len = info->len;
const char_type* x = info->pstr;
int j = 0;
while (position != last)
{
while((j > -1) && (x[j] != traits_inst.translate(*position, icase)))
j = info->kmp_next[j];
++position;
++j;
if(j >= len)
{
if(type == regbase::restart_fixed_lit)
{
std::advance(position, -j);
restart = position;
std::advance(restart, len);
m_result.set_first(position);
m_result.set_second(restart);
position = restart;
return true;
}
else
{
restart = position;
std::advance(position, -j);
if(match_prefix())
return true;
else
{
for(int k = 0; (restart != position) && (k < j); ++k, --restart)
{} // dwa 10/20/2000 - warning suppression for MWCW
if(restart != last)
++restart;
position = restart;
j = 0; //we could do better than this...
}
}
}
}
if((m_match_flags & match_partial) && (position == last) && j)
{
// we need to check for a partial match:
restart = position;
std::advance(position, -j);
return match_prefix();
}
#endif
return false;
}
} // namespace re_detail
} // namespace boost
#ifdef __BORLANDC__
# pragma option pop
#endif
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/perl_matcher_non_recursive.hpp
+1354
View File
File diff suppressed because it is too large Load Diff
include/boost/regex/v4/perl_matcher_recursive.hpp
+819
View File
@@ -0,0 +1,819 @@
/*
*
* Copyright (c) 2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE perl_matcher_common.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Definitions of perl_matcher member functions that are
* specific to the recursive implementation.
*/
#ifndef BOOST_REGEX_V4_PERL_MATCHER_RECURSIVE_HPP
#define BOOST_REGEX_V4_PERL_MATCHER_RECURSIVE_HPP
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
namespace re_detail{
template <class BidiIterator>
class backup_subex
{
int index;
sub_match<BidiIterator> sub;
public:
template <class A>
backup_subex(const match_results<BidiIterator, A>& w, int i)
: index(i), sub(w[i], false) {}
template <class A>
void restore(match_results<BidiIterator, A>& w)
{
w.set_first(sub.first, index);
w.set_second(sub.second, index, sub.matched);
}
const sub_match<BidiIterator>& get() { return sub; }
};
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_all_states()
{
static matcher_proc_type const s_match_vtable[29] =
{
(&perl_matcher<BidiIterator, Allocator, traits>::match_startmark),
&perl_matcher<BidiIterator, Allocator, traits>::match_endmark,
&perl_matcher<BidiIterator, Allocator, traits>::match_literal,
&perl_matcher<BidiIterator, Allocator, traits>::match_start_line,
&perl_matcher<BidiIterator, Allocator, traits>::match_end_line,
&perl_matcher<BidiIterator, Allocator, traits>::match_wild,
&perl_matcher<BidiIterator, Allocator, traits>::match_match,
&perl_matcher<BidiIterator, Allocator, traits>::match_word_boundary,
&perl_matcher<BidiIterator, Allocator, traits>::match_within_word,
&perl_matcher<BidiIterator, Allocator, traits>::match_word_start,
&perl_matcher<BidiIterator, Allocator, traits>::match_word_end,
&perl_matcher<BidiIterator, Allocator, traits>::match_buffer_start,
&perl_matcher<BidiIterator, Allocator, traits>::match_buffer_end,
&perl_matcher<BidiIterator, Allocator, traits>::match_backref,
&perl_matcher<BidiIterator, Allocator, traits>::match_long_set,
&perl_matcher<BidiIterator, Allocator, traits>::match_set,
&perl_matcher<BidiIterator, Allocator, traits>::match_jump,
&perl_matcher<BidiIterator, Allocator, traits>::match_alt,
&perl_matcher<BidiIterator, Allocator, traits>::match_rep,
&perl_matcher<BidiIterator, Allocator, traits>::match_combining,
&perl_matcher<BidiIterator, Allocator, traits>::match_soft_buffer_end,
&perl_matcher<BidiIterator, Allocator, traits>::match_restart_continue,
(::boost::is_random_access_iterator<BidiIterator>::value ? &perl_matcher<BidiIterator, Allocator, traits>::match_dot_repeat_fast : &perl_matcher<BidiIterator, Allocator, traits>::match_dot_repeat_slow),
&perl_matcher<BidiIterator, Allocator, traits>::match_char_repeat,
&perl_matcher<BidiIterator, Allocator, traits>::match_set_repeat,
&perl_matcher<BidiIterator, Allocator, traits>::match_long_set_repeat,
&perl_matcher<BidiIterator, Allocator, traits>::match_backstep,
&perl_matcher<BidiIterator, Allocator, traits>::match_assert_backref,
&perl_matcher<BidiIterator, Allocator, traits>::match_toggle_case,
};
if(state_count > max_state_count)
raise_error(traits_inst, regex_constants::error_space);
while(pstate)
{
matcher_proc_type proc = s_match_vtable[pstate->type];
++state_count;
if(!(this->*proc)())
{
if((m_match_flags & match_partial) && (position == last) && (position != search_base))
m_has_partial_match = true;
return 0;
}
}
return true;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_startmark()
{
int index = static_cast<const re_brace*>(pstate)->index;
bool r = true;
switch(index)
{
case 0:
pstate = pstate->next.p;
break;
case -1:
case -2:
{
// forward lookahead assert:
BidiIterator old_position(position);
const re_syntax_base* next_pstate = static_cast<const re_jump*>(pstate->next.p)->alt.p->next.p;
pstate = pstate->next.p->next.p;
r = match_all_states();
pstate = next_pstate;
position = old_position;
if((r && (index != -1)) || (!r && (index != -2)))
r = false;
else
r = true;
break;
}
case -3:
{
// independent sub-expression:
bool old_independent = m_independent;
m_independent = true;
const re_syntax_base* next_pstate = static_cast<const re_jump*>(pstate->next.p)->alt.p->next.p;
pstate = pstate->next.p->next.p;
r = match_all_states();
pstate = next_pstate;
m_independent = old_independent;
#ifdef BOOST_REGEX_MATCH_EXTRA
if(r && (m_match_flags & match_extra))
{
//
// our captures have been stored in *m_presult
// we need to unpack them, and insert them
// back in the right order when we unwind the stack:
//
unsigned i;
match_results<BidiIterator, Allocator> tm(*m_presult);
for(i = 0; i < tm.size(); ++i)
(*m_presult)[i].get_captures().clear();
// match everything else:
r = match_all_states();
// now place the stored captures back:
for(i = 0; i < tm.size(); ++i)
{
typedef typename sub_match<BidiIterator>::capture_sequence_type seq;
seq& s1 = (*m_presult)[i].get_captures();
const seq& s2 = tm[i].captures();
s1.insert(
s1.end(),
s2.begin(),
s2.end());
}
}
#endif
break;
}
case -4:
{
// conditional expression:
const re_alt* alt = static_cast<const re_alt*>(pstate->next.p);
BOOST_ASSERT(alt->type == syntax_element_alt);
pstate = alt->next.p;
if(pstate->type == syntax_element_assert_backref)
{
if(!match_assert_backref())
pstate = alt->alt.p;
break;
}
else
{
// zero width assertion, have to match this recursively:
BOOST_ASSERT(pstate->type == syntax_element_startmark);
bool negated = static_cast<const re_brace*>(pstate)->index == -2;
BidiIterator saved_position = position;
const re_syntax_base* next_pstate = static_cast<const re_jump*>(pstate->next.p)->alt.p->next.p;
pstate = pstate->next.p->next.p;
bool r = match_all_states();
position = saved_position;
if(negated)
r = !r;
if(r)
pstate = next_pstate;
else
pstate = alt->alt.p;
break;
}
}
default:
{
BOOST_ASSERT(index > 0);
if((m_match_flags & match_nosubs) == 0)
{
backup_subex<BidiIterator> sub(*m_presult, index);
m_presult->set_first(position, index);
pstate = pstate->next.p;
r = match_all_states();
if(r == false)
sub.restore(*m_presult);
#ifdef BOOST_REGEX_MATCH_EXTRA
//
// we have a match, push the capture information onto the stack:
//
else if(sub.get().matched && (match_extra & m_match_flags))
((*m_presult)[index]).get_captures().push_back(sub.get());
#endif
}
else
{
pstate = pstate->next.p;
}
break;
}
}
return r;
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_alt()
{
bool take_first, take_second;
const re_alt* jmp = static_cast<const re_alt*>(pstate);
// find out which of these two alternatives we need to take:
if(position == last)
{
take_first = jmp->can_be_null & mask_take;
take_second = jmp->can_be_null & mask_skip;
}
else
{
take_first = can_start(*position, jmp->_map, (unsigned char)mask_take);
take_second = can_start(*position, jmp->_map, (unsigned char)mask_skip);
}
if(take_first)
{
// we can take the first alternative,
// see if we need to push next alternative:
if(take_second)
{
BidiIterator oldposition(position);
const re_syntax_base* old_pstate = jmp->alt.p;
pstate = pstate->next.p;
if(!match_all_states())
{
pstate = old_pstate;
position = oldposition;
}
return true;
}
pstate = pstate->next.p;
return true;
}
if(take_second)
{
pstate = jmp->alt.p;
return true;
}
return false; // neither option is possible
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_rep()
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127 4244)
#endif
const re_repeat* rep = static_cast<const re_repeat*>(pstate);
if(next_count->get_id() != rep->id)
{
// we're moving to a different repeat from the last
// one, so set up a counter object and recurse:
repeater_count<BidiIterator> r(rep->id, &next_count, position);
return match_rep();
}
//
// If we've had at least one repeat already, and the last one
// matched the NULL string then set the repeat count to
// maximum:
//
next_count->check_null_repeat(position, rep->max);
// find out which of these two alternatives we need to take:
bool take_first, take_second;
if(position == last)
{
take_first = rep->can_be_null & mask_take;
take_second = rep->can_be_null & mask_skip;
}
else
{
take_first = can_start(*position, rep->_map, (unsigned char)mask_take);
take_second = can_start(*position, rep->_map, (unsigned char)mask_skip);
}
if(next_count->get_count() < rep->min)
{
// we must take the repeat:
if(take_first)
{
// increase the counter:
++(*next_count);
pstate = rep->next.p;
return match_all_states();
}
return false;
}
bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);
if(greedy)
{
// try and take the repeat if we can:
if((next_count->get_count() < rep->max) && take_first)
{
// store position in case we fail:
BidiIterator pos = position;
// increase the counter:
++(*next_count);
pstate = rep->next.p;
if(match_all_states())
return true;
// failed repeat, reset posistion and fall through for alternative:
position = pos;
}
if(take_second)
{
pstate = rep->alt.p;
return true;
}
return false; // can't take anything, fail...
}
else // non-greedy
{
// try and skip the repeat if we can:
if(take_second)
{
// store position in case we fail:
BidiIterator pos = position;
pstate = rep->alt.p;
if(match_all_states())
return true;
// failed alternative, reset posistion and fall through for repeat:
position = pos;
}
if((next_count->get_count() < rep->max) && take_first)
{
// increase the counter:
++(*next_count);
pstate = rep->next.p;
return match_all_states();
}
}
return false;
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_dot_repeat_slow()
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127)
#endif
unsigned count = 0;
const re_repeat* rep = static_cast<const re_repeat*>(pstate);
re_syntax_base* psingle = rep->next.p;
// match compulsary repeats first:
while(count < rep->min)
{
pstate = psingle;
if(!match_wild())
return false;
++count;
}
bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);
if(greedy)
{
// normal repeat:
while(count < rep->max)
{
pstate = psingle;
if(!match_wild())
break;
++count;
}
if((rep->leading) && (count < rep->max))
restart = position;
pstate = rep;
return backtrack_till_match(count - rep->min);
}
else
{
// non-greedy, keep trying till we get a match:
BidiIterator save_pos;
do
{
if((rep->leading) && (rep->max == UINT_MAX))
restart = position;
pstate = rep->alt.p;
save_pos = position;
++state_count;
if(match_all_states())
return true;
if(count >= rep->max)
return false;
++count;
pstate = psingle;
position = save_pos;
if(!match_wild())
return false;
}while(true);
}
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_dot_repeat_fast()
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127)
#endif
if(m_match_flags & match_not_dot_null)
return match_dot_repeat_slow();
if((static_cast<const re_dot*>(pstate->next.p)->mask & match_any_mask) == 0)
return match_dot_repeat_slow();
//
// start by working out how much we can skip:
//
const re_repeat* rep = static_cast<const re_repeat*>(pstate);
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4267)
#endif
bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);
std::size_t count = (std::min)(static_cast<std::size_t>(::boost::re_detail::distance(position, last)), static_cast<std::size_t>(greedy ? rep->max : rep->min));
if(rep->min > count)
{
position = last;
return false; // not enough text left to match
}
std::advance(position, count);
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
if((rep->leading) && (count < rep->max) && greedy)
restart = position;
if(greedy)
return backtrack_till_match(count - rep->min);
// non-greedy, keep trying till we get a match:
BidiIterator save_pos;
do
{
while((position != last) && (count < rep->max) && !can_start(*position, rep->_map, mask_skip))
{
++position;
++count;
}
if((rep->leading) && (rep->max == UINT_MAX))
restart = position;
pstate = rep->alt.p;
save_pos = position;
++state_count;
if(match_all_states())
return true;
if(count >= rep->max)
return false;
if(position == last)
return false;
position = ++save_pos;
++count;
}while(true);
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_char_repeat()
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127)
#endif
#ifdef __BORLANDC__
#pragma option push -w-8008 -w-8066 -w-8004
#endif
const re_repeat* rep = static_cast<const re_repeat*>(pstate);
BOOST_ASSERT(1 == static_cast<const re_literal*>(rep->next.p)->length);
const char_type what = *reinterpret_cast<const char_type*>(static_cast<const re_literal*>(rep->next.p) + 1);
unsigned count = 0;
//
// start by working out how much we can skip:
//
bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);
std::size_t desired = greedy ? rep->max : rep->min;
if(::boost::is_random_access_iterator<BidiIterator>::value)
{
BidiIterator end = position;
std::advance(end, (std::min)((unsigned)::boost::re_detail::distance(position, last), desired));
BidiIterator origin(position);
while((position != end) && (traits_inst.translate(*position, icase) == what))
{
++position;
}
count = (unsigned)::boost::re_detail::distance(origin, position);
}
else
{
while((count < desired) && (position != last) && (traits_inst.translate(*position, icase) == what))
{
++position;
++count;
}
}
if((rep->leading) && (count < rep->max) && greedy)
restart = position;
if(count < rep->min)
return false;
if(greedy)
return backtrack_till_match(count - rep->min);
// non-greedy, keep trying till we get a match:
BidiIterator save_pos;
do
{
while((position != last) && (count < rep->max) && !can_start(*position, rep->_map, mask_skip))
{
if((traits_inst.translate(*position, icase) == what))
{
++position;
++count;
}
else
return false; // counldn't repeat even though it was the only option
}
if((rep->leading) && (rep->max == UINT_MAX))
restart = position;
pstate = rep->alt.p;
save_pos = position;
++state_count;
if(match_all_states())
return true;
if(count >= rep->max)
return false;
if(position == last)
return false;
position = save_pos;
if(traits_inst.translate(*position, icase) == what)
{
++position;
++count;
}
else
{
return false;
}
}while(true);
#ifdef __BORLANDC__
#pragma option pop
#endif
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_set_repeat()
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127)
#endif
#ifdef __BORLANDC__
#pragma option push -w-8008 -w-8066 -w-8004
#endif
const re_repeat* rep = static_cast<const re_repeat*>(pstate);
const unsigned char* map = static_cast<const re_set*>(rep->next.p)->_map;
unsigned count = 0;
//
// start by working out how much we can skip:
//
bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);
std::size_t desired = greedy ? rep->max : rep->min;
if(::boost::is_random_access_iterator<BidiIterator>::value)
{
BidiIterator end = position;
std::advance(end, (std::min)((unsigned)::boost::re_detail::distance(position, last), desired));
BidiIterator origin(position);
while((position != end) && map[static_cast<unsigned char>(traits_inst.translate(*position, icase))])
{
++position;
}
count = (unsigned)::boost::re_detail::distance(origin, position);
}
else
{
while((count < desired) && (position != last) && map[static_cast<unsigned char>(traits_inst.translate(*position, icase))])
{
++position;
++count;
}
}
if((rep->leading) && (count < rep->max) && greedy)
restart = position;
if(count < rep->min)
return false;
if(greedy)
return backtrack_till_match(count - rep->min);
// non-greedy, keep trying till we get a match:
BidiIterator save_pos;
do
{
while((position != last) && (count < rep->max) && !can_start(*position, rep->_map, mask_skip))
{
if(map[static_cast<unsigned char>(traits_inst.translate(*position, icase))])
{
++position;
++count;
}
else
return false; // counldn't repeat even though it was the only option
}
if((rep->leading) && (rep->max == UINT_MAX))
restart = position;
pstate = rep->alt.p;
save_pos = position;
++state_count;
if(match_all_states())
return true;
if(count >= rep->max)
return false;
if(position == last)
return false;
position = save_pos;
if(map[static_cast<unsigned char>(traits_inst.translate(*position, icase))])
{
++position;
++count;
}
else
{
return false;
}
}while(true);
#ifdef __BORLANDC__
#pragma option pop
#endif
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::match_long_set_repeat()
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127)
#endif
#ifdef __BORLANDC__
#pragma option push -w-8008 -w-8066 -w-8004
#endif
typedef typename traits::char_class_type char_class_type;
const re_repeat* rep = static_cast<const re_repeat*>(pstate);
const re_set_long<char_class_type>* set = static_cast<const re_set_long<char_class_type>*>(pstate->next.p);
unsigned count = 0;
//
// start by working out how much we can skip:
//
bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);
std::size_t desired = greedy ? rep->max : rep->min;
if(::boost::is_random_access_iterator<BidiIterator>::value)
{
BidiIterator end = position;
std::advance(end, (std::min)((unsigned)::boost::re_detail::distance(position, last), desired));
BidiIterator origin(position);
while((position != end) && (position != re_is_set_member(position, last, set, re.get_data(), icase)))
{
++position;
}
count = (unsigned)::boost::re_detail::distance(origin, position);
}
else
{
while((count < desired) && (position != last) && (position != re_is_set_member(position, last, set, re.get_data(), icase)))
{
++position;
++count;
}
}
if((rep->leading) && (count < rep->max) && greedy)
restart = position;
if(count < rep->min)
return false;
if(greedy)
return backtrack_till_match(count - rep->min);
// non-greedy, keep trying till we get a match:
BidiIterator save_pos;
do
{
while((position != last) && (count < rep->max) && !can_start(*position, rep->_map, mask_skip))
{
if(position != re_is_set_member(position, last, set, re.get_data(), icase))
{
++position;
++count;
}
else
return false; // counldn't repeat even though it was the only option
}
if((rep->leading) && (rep->max == UINT_MAX))
restart = position;
pstate = rep->alt.p;
save_pos = position;
++state_count;
if(match_all_states())
return true;
if(count >= rep->max)
return false;
if(position == last)
return false;
position = save_pos;
if(position != re_is_set_member(position, last, set, re.get_data(), icase))
{
++position;
++count;
}
else
{
return false;
}
}while(true);
#ifdef __BORLANDC__
#pragma option pop
#endif
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
template <class BidiIterator, class Allocator, class traits>
bool perl_matcher<BidiIterator, Allocator, traits>::backtrack_till_match(std::size_t count)
{
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable:4127)
#endif
if((m_match_flags & match_partial) && (position == last))
m_has_partial_match = true;
const re_repeat* rep = static_cast<const re_repeat*>(pstate);
BidiIterator backtrack = position;
if(position == last)
{
if(rep->can_be_null & mask_skip)
{
pstate = rep->alt.p;
if(match_all_states())
return true;
}
if(count)
{
position = --backtrack;
--count;
}
else
return false;
}
do
{
while(count && !can_start(*position, rep->_map, mask_skip))
{
--position;
--count;
++state_count;
}
pstate = rep->alt.p;
backtrack = position;
if(match_all_states())
return true;
if(count == 0)
return false;
position = --backtrack;
++state_count;
--count;
}while(true);
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
}
} // namespace re_detail
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/primary_transform.hpp
+132
View File
@@ -0,0 +1,132 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE: primary_transform.hpp
* VERSION: see <boost/version.hpp>
* DESCRIPTION: Heuristically determines the sort string format in use
* by the current locale.
*/
#ifndef BOOST_REGEX_PRIMARY_TRANSFORM
#define BOOST_REGEX_PRIMARY_TRANSFORM
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
namespace re_detail{
enum{
sort_C,
sort_fixed,
sort_delim,
sort_unknown
};
template <class S, class charT>
unsigned count_chars(const S& s, charT c)
{
//
// Count how many occurances of character c occur
// in string s: if c is a delimeter between collation
// fields, then this should be the same value for all
// sort keys:
//
unsigned int count = 0;
for(unsigned pos = 0; pos < s.size(); ++pos)
{
if(s[pos] == c) ++count;
}
return count;
}
template <class traits, class charT>
unsigned find_sort_syntax(const traits* pt, charT* delim)
{
//
// compare 'a' with 'A' to see how similar they are,
// should really use a-accute but we can't portably do that,
//
typedef typename traits::string_type string_type;
typedef typename traits::char_type char_type;
// Suppress incorrect warning for MSVC
(void)pt;
char_type a[2] = {'a', '\0', };
string_type sa(pt->transform(a, a+1));
if(sa == a)
{
*delim = 0;
return sort_C;
}
char_type A[2] = { 'A', '\0', };
string_type sA(pt->transform(A, A+1));
char_type c[2] = { ';', '\0', };
string_type sc(pt->transform(c, c+1));
int pos = 0;
while((pos <= static_cast<int>(sa.size())) && (pos <= static_cast<int>(sA.size())) && (sa[pos] == sA[pos])) ++pos;
--pos;
if(pos < 0)
{
*delim = 0;
return sort_unknown;
}
//
// at this point sa[pos] is either the end of a fixed width field
// or the character that acts as a delimiter:
//
charT maybe_delim = sa[pos];
if((pos != 0) && (count_chars(sa, maybe_delim) == count_chars(sA, maybe_delim)) && (count_chars(sa, maybe_delim) == count_chars(sc, maybe_delim)))
{
*delim = maybe_delim;
return sort_delim;
}
//
// OK doen't look like a delimiter, try for fixed width field:
//
if((sa.size() == sA.size()) && (sa.size() == sc.size()))
{
// note assumes that the fixed width field is less than
// (numeric_limits<charT>::max)(), should be true for all types
// I can't imagine 127 character fields...
*delim = static_cast<charT>(++pos);
return sort_fixed;
}
//
// don't know what it is:
//
*delim = 0;
return sort_unknown;
}
} // namespace re_detail
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/protected_call.hpp
+67
View File
@@ -0,0 +1,67 @@
/*
*
* Copyright (c) 2004
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE basic_regex_creator.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares template class basic_regex_creator which fills in
* the data members of a regex_data object.
*/
#ifndef BOOST_REGEX_V4_PROTECTED_CALL_HPP
#define BOOST_REGEX_V4_PROTECTED_CALL_HPP
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
namespace re_detail{
class BOOST_REGEX_DECL abstract_protected_call
{
public:
bool BOOST_REGEX_CALL execute()const;
// this stops gcc-4 from complaining:
virtual ~abstract_protected_call(){}
private:
virtual bool call()const = 0;
};
template <class T>
class concrete_protected_call
: public abstract_protected_call
{
public:
typedef bool (T::*proc_type)();
concrete_protected_call(T* o, proc_type p)
: obj(o), proc(p) {}
private:
virtual bool call()const;
T* obj;
proc_type proc;
};
template <class T>
bool concrete_protected_call<T>::call()const
{
return (obj->*proc)();
}
}
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/regbase.hpp
+162
View File
@@ -0,0 +1,162 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regbase.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares class regbase.
*/
#ifndef BOOST_REGEX_V4_REGBASE_HPP
#define BOOST_REGEX_V4_REGBASE_HPP
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
namespace boost{
//
// class regbase
// handles error codes and flags
//
class BOOST_REGEX_DECL regbase
{
public:
enum flag_type_
{
//
// Divide the flags up into logical groups:
// bits 0-7 indicate main synatx type.
// bits 8-15 indicate syntax subtype.
// bits 16-31 indicate options that are common to all
// regex syntaxes.
// In all cases the default is 0.
//
// Main synatx group:
//
perl_syntax_group = 0, // default
basic_syntax_group = 1, // POSIX basic
literal = 2, // all characters are literals
main_option_type = literal | basic_syntax_group | perl_syntax_group, // everything!
//
// options specific to perl group:
//
no_bk_refs = 1 << 8, // \d not allowed
no_perl_ex = 1 << 9, // disable perl extensions
no_mod_m = 1 << 10, // disable Perl m modifier
mod_x = 1 << 11, // Perl x modifier
mod_s = 1 << 12, // force s modifier on (overrides match_not_dot_newline)
no_mod_s = 1 << 13, // force s modifier off (overrides match_not_dot_newline)
//
// options specific to basic group:
//
no_char_classes = 1 << 8, // [[:CLASS:]] not allowed
no_intervals = 1 << 9, // {x,y} not allowed
bk_plus_qm = 1 << 10, // uses \+ and \?
bk_vbar = 1 << 11, // use \| for alternatives
emacs_ex = 1 << 12, // enables emacs extensions
//
// options common to all groups:
//
no_escape_in_lists = 1 << 16, // '\' not special inside [...]
newline_alt = 1 << 17, // \n is the same as |
no_except = 1 << 18, // no exception on error
failbit = 1 << 19, // error flag
icase = 1 << 20, // characters are matched regardless of case
nocollate = 0, // don't use locale specific collation (deprecated)
collate = 1 << 21, // use locale specific collation
nosubs = 1 << 22, // don't mark sub-expressions
optimize = 0, // not really supported
basic = basic_syntax_group | collate | no_escape_in_lists,
extended = no_bk_refs | collate | no_perl_ex | no_escape_in_lists,
normal = 0,
emacs = basic_syntax_group | collate | emacs_ex | bk_vbar,
awk = no_bk_refs | collate | no_perl_ex,
grep = basic | newline_alt,
egrep = extended | newline_alt,
sed = basic,
perl = normal,
ECMAScript = normal,
JavaScript = normal,
JScript = normal
};
typedef unsigned int flag_type;
enum restart_info
{
restart_any = 0,
restart_word = 1,
restart_line = 2,
restart_buf = 3,
restart_continue = 4,
restart_lit = 5,
restart_fixed_lit = 6,
restart_count = 7
};
};
//
// provide std lib proposal compatible constants:
//
namespace regex_constants{
enum flag_type_
{
no_except = ::boost::regbase::no_except,
failbit = ::boost::regbase::failbit,
literal = ::boost::regbase::literal,
icase = ::boost::regbase::icase,
nocollate = ::boost::regbase::nocollate,
collate = ::boost::regbase::collate,
nosubs = ::boost::regbase::nosubs,
optimize = ::boost::regbase::optimize,
bk_plus_qm = ::boost::regbase::bk_plus_qm,
bk_vbar = ::boost::regbase::bk_vbar,
no_intervals = ::boost::regbase::no_intervals,
no_char_classes = ::boost::regbase::no_char_classes,
no_escape_in_lists = ::boost::regbase::no_escape_in_lists,
no_mod_m = ::boost::regbase::no_mod_m,
mod_x = ::boost::regbase::mod_x,
mod_s = ::boost::regbase::mod_s,
no_mod_s = ::boost::regbase::no_mod_s,
basic = ::boost::regbase::basic,
extended = ::boost::regbase::extended,
normal = ::boost::regbase::normal,
emacs = ::boost::regbase::emacs,
awk = ::boost::regbase::awk,
grep = ::boost::regbase::grep,
egrep = ::boost::regbase::egrep,
sed = basic,
perl = normal,
ECMAScript = normal,
JavaScript = normal,
JScript = normal
};
typedef ::boost::regbase::flag_type syntax_option_type;
} // namespace regex_constants
} // namespace boost
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
#endif
include/boost/regex/v4/regex.hpp
+202
View File
@@ -0,0 +1,202 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Declares boost::basic_regex<> and associated
* functions and classes. This header is the main
* entry point for the template regex code.
*/
#ifndef BOOST_RE_REGEX_HPP_INCLUDED
#define BOOST_RE_REGEX_HPP_INCLUDED
#ifdef __cplusplus
// what follows is all C++ don't include in C builds!!
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#ifndef BOOST_REGEX_WORKAROUND_HPP
#include <boost/regex/v4/regex_workaround.hpp>
#endif
#ifndef BOOST_REGEX_FWD_HPP
#include <boost/regex_fwd.hpp>
#endif
#ifndef BOOST_REGEX_TRAITS_HPP
#include <boost/regex/regex_traits.hpp>
#endif
#ifndef BOOST_REGEX_RAW_BUFFER_HPP
#include <boost/regex/v4/error_type.hpp>
#endif
#ifndef BOOST_REGEX_V4_MATCH_FLAGS
#include <boost/regex/v4/match_flags.hpp>
#endif
#ifndef BOOST_REGEX_RAW_BUFFER_HPP
#include <boost/regex/v4/regex_raw_buffer.hpp>
#endif
#ifndef BOOST_RE_PAT_EXCEPT_HPP
#include <boost/regex/pattern_except.hpp>
#endif
#ifndef BOOST_REGEX_V4_CHAR_REGEX_TRAITS_HPP
#include <boost/regex/v4/char_regex_traits.hpp>
#endif
#ifndef BOOST_REGEX_V4_STATES_HPP
#include <boost/regex/v4/states.hpp>
#endif
#ifndef BOOST_REGEX_V4_REGBASE_HPP
#include <boost/regex/v4/regbase.hpp>
#endif
#ifndef BOOST_REGEX_V4_ITERATOR_TRAITS_HPP
#include <boost/regex/v4/iterator_traits.hpp>
#endif
#ifndef BOOST_REGEX_V4_BASIC_REGEX_HPP
#include <boost/regex/v4/basic_regex.hpp>
#endif
#ifndef BOOST_REGEX_V4_BASIC_REGEX_CREATOR_HPP
#include <boost/regex/v4/basic_regex_creator.hpp>
#endif
#ifndef BOOST_REGEX_V4_BASIC_REGEX_PARSER_HPP
#include <boost/regex/v4/basic_regex_parser.hpp>
#endif
#ifndef BOOST_REGEX_V4_SUB_MATCH_HPP
#include <boost/regex/v4/sub_match.hpp>
#endif
#ifndef BOOST_REGEX_FORMAT_HPP
#include <boost/regex/v4/regex_format.hpp>
#endif
#ifndef BOOST_REGEX_V4_MATCH_RESULTS_HPP
#include <boost/regex/v4/match_results.hpp>
#endif
#ifndef BOOST_REGEX_V4_PROTECTED_CALL_HPP
#include <boost/regex/v4/protected_call.hpp>
#endif
#ifndef BOOST_REGEX_MATCHER_HPP
#include <boost/regex/v4/perl_matcher.hpp>
#endif
//
// template instances:
//
#define BOOST_REGEX_CHAR_T char
#ifdef BOOST_REGEX_NARROW_INSTANTIATE
# define BOOST_REGEX_INSTANTIATE
#endif
#include <boost/regex/v4/instances.hpp>
#undef BOOST_REGEX_CHAR_T
#ifdef BOOST_REGEX_INSTANTIATE
# undef BOOST_REGEX_INSTANTIATE
#endif
#ifndef BOOST_NO_WREGEX
#define BOOST_REGEX_CHAR_T wchar_t
#ifdef BOOST_REGEX_WIDE_INSTANTIATE
# define BOOST_REGEX_INSTANTIATE
#endif
#include <boost/regex/v4/instances.hpp>
#undef BOOST_REGEX_CHAR_T
#ifdef BOOST_REGEX_INSTANTIATE
# undef BOOST_REGEX_INSTANTIATE
#endif
#endif
#if !defined(BOOST_NO_WREGEX) && defined(BOOST_REGEX_HAS_OTHER_WCHAR_T)
#define BOOST_REGEX_CHAR_T unsigned short
#ifdef BOOST_REGEX_US_INSTANTIATE
# define BOOST_REGEX_INSTANTIATE
#endif
#include <boost/regex/v4/instances.hpp>
#undef BOOST_REGEX_CHAR_T
#ifdef BOOST_REGEX_INSTANTIATE
# undef BOOST_REGEX_INSTANTIATE
#endif
#endif
namespace boost{
#ifdef BOOST_REGEX_NO_FWD
typedef basic_regex<char, regex_traits<char> > regex;
#ifndef BOOST_NO_WREGEX
typedef basic_regex<wchar_t, regex_traits<wchar_t> > wregex;
#endif
#endif
typedef match_results<const char*> cmatch;
typedef match_results<std::string::const_iterator> smatch;
#ifndef BOOST_NO_WREGEX
typedef match_results<const wchar_t*> wcmatch;
typedef match_results<std::wstring::const_iterator> wsmatch;
#endif
} // namespace boost
#ifndef BOOST_REGEX_MATCH_HPP
#include <boost/regex/v4/regex_match.hpp>
#endif
#ifndef BOOST_REGEX_V4_REGEX_SEARCH_HPP
#include <boost/regex/v4/regex_search.hpp>
#endif
#ifndef BOOST_REGEX_ITERATOR_HPP
#include <boost/regex/v4/regex_iterator.hpp>
#endif
#ifndef BOOST_REGEX_TOKEN_ITERATOR_HPP
#include <boost/regex/v4/regex_token_iterator.hpp>
#endif
#ifndef BOOST_REGEX_V4_REGEX_GREP_HPP
#include <boost/regex/v4/regex_grep.hpp>
#endif
#ifndef BOOST_REGEX_V4_REGEX_REPLACE_HPP
#include <boost/regex/v4/regex_replace.hpp>
#endif
#ifndef BOOST_REGEX_V4_REGEX_MERGE_HPP
#include <boost/regex/v4/regex_merge.hpp>
#endif
#ifndef BOOST_REGEX_SPLIT_HPP
#include <boost/regex/v4/regex_split.hpp>
#endif
#endif // __cplusplus
#endif // include
include/boost/regex/v4/regex_cstring.hpp
+123
View File
@@ -0,0 +1,123 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_cstring.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: This is an internal header file, do not include directly.
* String support and helper functions, for regular
* expression library.
*/
#ifndef BOOST_REGEX_CSTRING_HPP
#define BOOST_REGEX_CSTRING_HPP
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#include <cstring>
namespace boost{
namespace re_detail{
//
// start by defining some template function aliases for C API functions:
//
template <class charT>
std::size_t BOOST_REGEX_CALL re_strlen(const charT *s)
{
std::size_t len = 0;
while(*s)
{
++s;
++len;
}
return len;
}
inline std::size_t BOOST_REGEX_CALL re_strlen(const char *s)
{
return std::strlen(s);
}
#ifndef BOOST_NO_WREGEX
inline std::size_t BOOST_REGEX_CALL re_strlen(const wchar_t *s)
{
return std::wcslen(s);
}
#endif
#ifndef BOOST_NO_WREGEX
BOOST_REGEX_DECL void BOOST_REGEX_CALL re_transform(std::basic_string<wchar_t>& out, const std::basic_string<wchar_t>& in);
#endif
BOOST_REGEX_DECL void BOOST_REGEX_CALL re_transform(std::string& out, const std::string& in);
template <class charT>
void BOOST_REGEX_CALL re_trunc_primary(std::basic_string<charT>& s)
{
for(unsigned int i = 0; i < s.size(); ++i)
{
if(s[i] <= 1)
{
s.erase(i);
break;
}
}
}
inline char* BOOST_REGEX_CALL re_strcpy(char *s1, const char *s2)
{
#if defined(__BORLANDC__) && defined(strcpy)
return ::strcpy(s1, s2);
#else
return std::strcpy(s1, s2);
#endif
}
#ifndef BOOST_NO_WREGEX
inline wchar_t* BOOST_REGEX_CALL re_strcpy(wchar_t *s1, const wchar_t *s2)
{
return std::wcscpy(s1, s2);
}
#endif
template <class charT>
charT* BOOST_REGEX_CALL re_strdup(const charT* p)
{
charT* buf = new charT[re_strlen(p) + 1];
re_strcpy(buf, p);
return buf;
}
template <class charT>
inline void BOOST_REGEX_CALL re_strfree(charT* p)
{
delete[] p;
}
} // namespace re_detail
} // namespace boost
#endif // BOOST_REGEX_CSTRING_HPP
include/boost/regex/v4/regex_format.hpp
+633
View File
@@ -0,0 +1,633 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_format.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Provides formatting output routines for search and replace
* operations. Note this is an internal header file included
* by regex.hpp, do not include on its own.
*/
#ifndef BOOST_REGEX_FORMAT_HPP
#define BOOST_REGEX_FORMAT_HPP
namespace boost{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
//
// Forward declaration:
//
template <class BidiIterator, class Allocator = BOOST_DEDUCED_TYPENAME std::vector<sub_match<BidiIterator> >::allocator_type >
class match_results;
namespace re_detail{
//
// struct trivial_format_traits:
// defines minimum localisation support for formatting
// in the case that the actual regex traits is unavailable.
//
template <class charT>
struct trivial_format_traits
{
typedef charT char_type;
static std::ptrdiff_t length(const charT* p)
{
return global_length(p);
}
static charT tolower(charT c)
{
return ::boost::re_detail::global_lower(c);
}
static charT toupper(charT c)
{
return ::boost::re_detail::global_upper(c);
}
static int value(const charT c, int radix)
{
int result = global_value(c);
return result >= radix ? -1 : result;
}
int toi(const charT*& p1, const charT* p2, int radix)const
{
return global_toi(p1, p2, radix, *this);
}
};
template <class OutputIterator, class Results, class traits>
class basic_regex_formatter
{
public:
typedef typename traits::char_type char_type;
basic_regex_formatter(OutputIterator o, const Results& r, const traits& t)
: m_traits(t), m_results(r), m_out(o), m_state(output_copy), m_have_conditional(false) {}
OutputIterator format(const char_type* p1, const char_type* p2, match_flag_type f);
OutputIterator format(const char_type* p1, match_flag_type f)
{
return format(p1, p1 + m_traits.length(p1), f);
}
private:
typedef typename Results::value_type sub_match_type;
enum output_state
{
output_copy,
output_next_lower,
output_next_upper,
output_lower,
output_upper,
output_none
};
void put(char_type c);
void put(const sub_match_type& sub);
void format_all();
void format_perl();
void format_escape();
void format_conditional();
void format_until_scope_end();
const traits& m_traits; // the traits class for localised formatting operations
const Results& m_results; // the match_results being used.
OutputIterator m_out; // where to send output.
const char_type* m_position; // format string, current position
const char_type* m_end; // format string end
match_flag_type m_flags; // format flags to use
output_state m_state; // what to do with the next character
bool m_have_conditional; // we are parsing a conditional
private:
basic_regex_formatter(const basic_regex_formatter&);
basic_regex_formatter& operator=(const basic_regex_formatter&);
};
template <class OutputIterator, class Results, class traits>
OutputIterator basic_regex_formatter<OutputIterator, Results, traits>::format(const char_type* p1, const char_type* p2, match_flag_type f)
{
m_position = p1;
m_end = p2;
m_flags = f;
format_all();
return m_out;
}
template <class OutputIterator, class Results, class traits>
void basic_regex_formatter<OutputIterator, Results, traits>::format_all()
{
// over and over:
while(m_position != m_end)
{
switch(*m_position)
{
case '&':
if(m_flags & ::boost::regex_constants::format_sed)
{
++m_position;
put(m_results[0]);
break;
}
put(*m_position++);
break;
case '\\':
format_escape();
break;
case '(':
if(m_flags & boost::regex_constants::format_all)
{
++m_position;
bool have_conditional = m_have_conditional;
m_have_conditional = false;
format_until_scope_end();
m_have_conditional = have_conditional;
if(m_position == m_end)
return;
BOOST_ASSERT(*m_position == static_cast<char_type>(')'));
++m_position; // skip the closing ')'
break;
}
put(*m_position);
++m_position;
break;
case ')':
if(m_flags & boost::regex_constants::format_all)
{
return;
}
put(*m_position);
++m_position;
break;
case ':':
if((m_flags & boost::regex_constants::format_all) && m_have_conditional)
{
return;
}
put(*m_position);
++m_position;
break;
case '?':
if(m_flags & boost::regex_constants::format_all)
{
++m_position;
format_conditional();
break;
}
put(*m_position);
++m_position;
break;
case '$':
if((m_flags & format_sed) == 0)
{
format_perl();
break;
}
// fall through, not a special character:
default:
put(*m_position);
++m_position;
break;
}
}
}
template <class OutputIterator, class Results, class traits>
void basic_regex_formatter<OutputIterator, Results, traits>::format_perl()
{
//
// On entry *m_position points to a '$' character
// output the information that goes with it:
//
BOOST_ASSERT(*m_position == '$');
//
// see if this is a trailing '$':
//
if(++m_position == m_end)
{
--m_position;
put(*m_position);
++m_position;
return;
}
//
// OK find out what kind it is:
//
switch(*m_position)
{
case '&':
++m_position;
put(this->m_results[0]);
break;
case '`':
++m_position;
put(this->m_results.prefix());
break;
case '\'':
++m_position;
put(this->m_results.suffix());
break;
case '$':
put(*m_position++);
break;
default:
// see if we have a number:
{
std::ptrdiff_t len = (std::min)(static_cast<std::ptrdiff_t>(2), ::boost::re_detail::distance(m_position, m_end));
int v = m_traits.toi(m_position, m_position + len, 10);
if(v < 0)
{
// leave the $ as is, and carry on:
--m_position;
put(*m_position);
++m_position;
break;
}
// otherwise output sub v:
put(this->m_results[v]);
}
}
}
template <class OutputIterator, class Results, class traits>
void basic_regex_formatter<OutputIterator, Results, traits>::format_escape()
{
// skip the escape and check for trailing escape:
if(++m_position == m_end)
{
put(static_cast<char_type>('\\'));
return;
}
// now switch on the escape type:
switch(*m_position)
{
case 'a':
put(static_cast<char_type>('\a'));
++m_position;
break;
case 'f':
put(static_cast<char_type>('\f'));
++m_position;
break;
case 'n':
put(static_cast<char_type>('\n'));
++m_position;
break;
case 'r':
put(static_cast<char_type>('\r'));
++m_position;
break;
case 't':
put(static_cast<char_type>('\t'));
++m_position;
break;
case 'v':
put(static_cast<char_type>('\v'));
++m_position;
break;
case 'x':
if(++m_position == m_end)
{
put(static_cast<char_type>('x'));
return;
}
// maybe have \x{ddd}
if(*m_position == static_cast<char_type>('{'))
{
++m_position;
int val = m_traits.toi(m_position, m_end, 16);
if(val < 0)
{
// invalid value treat everything as literals:
put(static_cast<char_type>('x'));
put(static_cast<char_type>('{'));
return;
}
if(*m_position != static_cast<char_type>('}'))
{
while(*m_position != static_cast<char_type>('\\'))
--m_position;
++m_position;
put(*m_position++);
return;
}
++m_position;
put(static_cast<char_type>(val));
return;
}
else
{
std::ptrdiff_t len = (std::min)(static_cast<std::ptrdiff_t>(2), ::boost::re_detail::distance(m_position, m_end));
int val = m_traits.toi(m_position, m_position + len, 16);
if(val < 0)
{
--m_position;
put(*m_position++);
return;
}
put(static_cast<char_type>(val));
}
break;
case 'c':
if(++m_position == m_end)
{
--m_position;
put(*m_position++);
return;
}
put(static_cast<char_type>(*m_position++ % 32));
break;
case 'e':
put(static_cast<char_type>(27));
++m_position;
break;
default:
// see if we have a perl specific escape:
if((m_flags & boost::regex_constants::format_sed) == 0)
{
bool breakout = false;
switch(*m_position)
{
case 'l':
++m_position;
m_state = output_next_lower;
breakout = true;
break;
case 'L':
++m_position;
m_state = output_lower;
breakout = true;
break;
case 'u':
++m_position;
m_state = output_next_upper;
breakout = true;
break;
case 'U':
++m_position;
m_state = output_upper;
breakout = true;
break;
case 'E':
++m_position;
m_state = output_copy;
breakout = true;
break;
}
if(breakout)
break;
}
// see if we have a \n sed style backreference:
int v = m_traits.toi(m_position, m_position+1, 10);
if((v > 0) || ((v == 0) && (m_flags & ::boost::regex_constants::format_sed)))
{
put(m_results[v]);
break;
}
else if(v == 0)
{
// octal ecape sequence:
--m_position;
std::ptrdiff_t len = (std::min)(static_cast<std::ptrdiff_t>(4), ::boost::re_detail::distance(m_position, m_end));
v = m_traits.toi(m_position, m_position + len, 8);
BOOST_ASSERT(v >= 0);
put(static_cast<char_type>(v));
break;
}
// Otherwise output the character "as is":
put(*m_position++);
break;
}
}
template <class OutputIterator, class Results, class traits>
void basic_regex_formatter<OutputIterator, Results, traits>::format_conditional()
{
if(m_position == m_end)
{
// oops trailing '?':
put(static_cast<char_type>('?'));
return;
}
std::ptrdiff_t len = (std::min)(static_cast<std::ptrdiff_t>(2), ::boost::re_detail::distance(m_position, m_end));
int v = m_traits.toi(m_position, m_position + len, 10);
if(v < 0)
{
// oops not a number:
put(static_cast<char_type>('?'));
return;
}
// output varies depending upon whether sub-expression v matched or not:
if(m_results[v].matched)
{
m_have_conditional = true;
format_all();
m_have_conditional = false;
if((m_position != m_end) && (*m_position == static_cast<char_type>(':')))
{
// skip the ':':
++m_position;
// save output state, then turn it off:
output_state saved_state = m_state;
m_state = output_none;
// format the rest of this scope:
format_until_scope_end();
// restore output state:
m_state = saved_state;
}
}
else
{
// save output state, then turn it off:
output_state saved_state = m_state;
m_state = output_none;
// format until ':' or ')':
m_have_conditional = true;
format_all();
m_have_conditional = false;
// restore state:
m_state = saved_state;
if((m_position != m_end) && (*m_position == static_cast<char_type>(':')))
{
// skip the ':':
++m_position;
// format the rest of this scope:
format_until_scope_end();
}
}
}
template <class OutputIterator, class Results, class traits>
void basic_regex_formatter<OutputIterator, Results, traits>::format_until_scope_end()
{
do
{
format_all();
if((m_position == m_end) || (*m_position == static_cast<char_type>(')')))
return;
put(*m_position++);
}while(m_position != m_end);
}
template <class OutputIterator, class Results, class traits>
void basic_regex_formatter<OutputIterator, Results, traits>::put(char_type c)
{
// write a single character to output
// according to which case translation mode we are in:
switch(this->m_state)
{
case output_none:
return;
case output_next_lower:
c = m_traits.tolower(c);
this->m_state = output_copy;
break;
case output_next_upper:
c = m_traits.toupper(c);
this->m_state = output_copy;
break;
case output_lower:
c = m_traits.tolower(c);
break;
case output_upper:
c = m_traits.toupper(c);
break;
default:
break;
}
*m_out = c;
++m_out;
}
template <class OutputIterator, class Results, class traits>
void basic_regex_formatter<OutputIterator, Results, traits>::put(const sub_match_type& sub)
{
typedef typename sub_match_type::iterator iterator_type;
iterator_type i = sub.first;
while(i != sub.second)
{
put(*i);
++i;
}
}
template <class S>
class string_out_iterator
#ifndef BOOST_NO_STD_ITERATOR
: public std::iterator<std::output_iterator_tag, typename S::value_type>
#endif
{
S* out;
public:
string_out_iterator(S& s) : out(&s) {}
string_out_iterator& operator++() { return *this; }
string_out_iterator& operator++(int) { return *this; }
string_out_iterator& operator*() { return *this; }
string_out_iterator& operator=(typename S::value_type v)
{
out->append(1, v);
return *this;
}
#ifdef BOOST_NO_STD_ITERATOR
typedef std::ptrdiff_t difference_type;
typedef typename S::value_type value_type;
typedef value_type* pointer;
typedef value_type& reference;
typedef std::output_iterator_tag iterator_category;
#endif
};
template <class OutputIterator, class Iterator, class Alloc, class charT, class traits>
OutputIterator regex_format_imp(OutputIterator out,
const match_results<Iterator, Alloc>& m,
const charT* p1, const charT* p2,
match_flag_type flags,
const traits& t
)
{
if(flags & regex_constants::format_literal)
{
return re_detail::copy(p1, p2, out);
}
re_detail::basic_regex_formatter<
OutputIterator,
match_results<Iterator, Alloc>,
traits > f(out, m, t);
return f.format(p1, p2, flags);
}
} // namespace re_detail
template <class OutputIterator, class Iterator, class charT>
OutputIterator regex_format(OutputIterator out,
const match_results<Iterator>& m,
const charT* fmt,
match_flag_type flags = format_all
)
{
re_detail::trivial_format_traits<charT> traits;
return re_detail::regex_format_imp(out, m, fmt, fmt + traits.length(fmt), flags, traits);
}
template <class OutputIterator, class Iterator, class charT>
OutputIterator regex_format(OutputIterator out,
const match_results<Iterator>& m,
const std::basic_string<charT>& fmt,
match_flag_type flags = format_all
)
{
re_detail::trivial_format_traits<charT> traits;
return re_detail::regex_format_imp(out, m, fmt.data(), fmt.data() + fmt.size(), flags, traits);
}
template <class Iterator, class charT>
std::basic_string<charT> regex_format(const match_results<Iterator>& m,
const charT* fmt,
match_flag_type flags = format_all)
{
std::basic_string<charT> result;
re_detail::string_out_iterator<std::basic_string<charT> > i(result);
re_detail::trivial_format_traits<charT> traits;
re_detail::regex_format_imp(i, m, fmt, fmt + traits.length(fmt), flags, traits);
return result;
}
template <class Iterator, class charT>
std::basic_string<charT> regex_format(const match_results<Iterator>& m,
const std::basic_string<charT>& fmt,
match_flag_type flags = format_all)
{
std::basic_string<charT> result;
re_detail::string_out_iterator<std::basic_string<charT> > i(result);
re_detail::trivial_format_traits<charT> traits;
re_detail::regex_format_imp(i, m, fmt.data(), fmt.data() + fmt.size(), flags, traits);
return result;
}
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace boost
#endif // BOOST_REGEX_FORMAT_HPP
include/boost/regex/v4/regex_fwd.hpp
+73
View File
@@ -0,0 +1,73 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_fwd.cpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Forward declares boost::basic_regex<> and
* associated typedefs.
*/
#ifndef BOOST_REGEX_FWD_HPP_INCLUDED
#define BOOST_REGEX_FWD_HPP_INCLUDED
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
//
// define BOOST_REGEX_NO_FWD if this
// header doesn't work!
//
#ifdef BOOST_REGEX_NO_FWD
# ifndef BOOST_RE_REGEX_HPP
# include <boost/regex.hpp>
# endif
#else
namespace boost{
template <class charT>
class cpp_regex_traits;
template <class charT>
struct c_regex_traits;
template <class charT>
class w32_regex_traits;
#ifdef BOOST_REGEX_USE_WIN32_LOCALE
template <class charT, class implementationT = w32_regex_traits<charT> >
struct regex_traits;
#elif defined(BOOST_REGEX_USE_CPP_LOCALE)
template <class charT, class implementationT = cpp_regex_traits<charT> >
struct regex_traits;
#else
template <class charT, class implementationT = c_regex_traits<charT> >
struct regex_traits;
#endif
template <class charT, class traits = regex_traits<charT> >
class basic_regex;
typedef basic_regex<char, regex_traits<char> > regex;
#ifndef BOOST_NO_WREGEX
typedef basic_regex<wchar_t, regex_traits<wchar_t> > wregex;
#endif
} // namespace boost
#endif // BOOST_REGEX_NO_FWD
#endif
include/boost/regex/v4/regex_grep.hpp
+141
View File
@@ -0,0 +1,141 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_grep.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Provides regex_grep implementation.
*/
#ifndef BOOST_REGEX_V4_REGEX_GREP_HPP
#define BOOST_REGEX_V4_REGEX_GREP_HPP
namespace boost{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
//
// regex_grep:
// find all non-overlapping matches within the sequence first last:
//
template <class Predicate, class BidiIterator, class charT, class traits>
inline unsigned int regex_grep(Predicate foo,
BidiIterator first,
BidiIterator last,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
if(e.flags() & regex_constants::failbit)
return false;
typedef typename match_results<BidiIterator>::allocator_type match_allocator_type;
match_results<BidiIterator> m;
re_detail::perl_matcher<BidiIterator, match_allocator_type, traits> matcher(first, last, m, e, flags);
unsigned int count = 0;
while(matcher.find())
{
++count;
if(0 == foo(m))
return count; // caller doesn't want to go on
if(m[0].second == last)
return count; // we've reached the end, don't try and find an extra null match.
if(m.length() == 0)
{
if(m[0].second == last)
return count;
// we found a NULL-match, now try to find
// a non-NULL one at the same position:
match_results<BidiIterator, match_allocator_type> m2(m);
matcher.setf(match_not_null | match_continuous);
if(matcher.find())
{
++count;
if(0 == foo(m))
return count;
}
else
{
// reset match back to where it was:
m = m2;
}
matcher.unsetf((match_not_null | match_continuous) & ~flags);
}
}
return count;
}
//
// regex_grep convenience interfaces:
#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
//
// this isn't really a partial specialisation, but template function
// overloading - if the compiler doesn't support partial specialisation
// then it really won't support this either:
template <class Predicate, class charT, class traits>
inline unsigned int regex_grep(Predicate foo, const charT* str,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
return regex_grep(foo, str, str + traits::length(str), e, flags);
}
template <class Predicate, class ST, class SA, class charT, class traits>
inline unsigned int regex_grep(Predicate foo, const std::basic_string<charT, ST, SA>& s,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
return regex_grep(foo, s.begin(), s.end(), e, flags);
}
#else // partial specialisation
inline unsigned int regex_grep(bool (*foo)(const cmatch&), const char* str,
const regex& e,
match_flag_type flags = match_default)
{
return regex_grep(foo, str, str + regex::traits_type::length(str), e, flags);
}
#ifndef BOOST_NO_WREGEX
inline unsigned int regex_grep(bool (*foo)(const wcmatch&), const wchar_t* str,
const wregex& e,
match_flag_type flags = match_default)
{
return regex_grep(foo, str, str + wregex::traits_type::length(str), e, flags);
}
#endif
inline unsigned int regex_grep(bool (*foo)(const match_results<std::string::const_iterator>&), const std::string& s,
const regex& e,
match_flag_type flags = match_default)
{
return regex_grep(foo, s.begin(), s.end(), e, flags);
}
#if !defined(BOOST_NO_WREGEX)
inline unsigned int regex_grep(bool (*foo)(const match_results<std::basic_string<wchar_t>::const_iterator>&),
const std::basic_string<wchar_t>& s,
const wregex& e,
match_flag_type flags = match_default)
{
return regex_grep(foo, s.begin(), s.end(), e, flags);
}
#endif
#endif
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace boost
#endif // BOOST_REGEX_V4_REGEX_GREP_HPP
include/boost/regex/v4/regex_iterator.hpp
+187
View File
@@ -0,0 +1,187 @@
/*
*
* Copyright (c) 2003
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_iterator.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Provides regex_iterator implementation.
*/
#ifndef BOOST_REGEX_V4_REGEX_ITERATOR_HPP
#define BOOST_REGEX_V4_REGEX_ITERATOR_HPP
#include <boost/shared_ptr.hpp>
namespace boost{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
template <class BidirectionalIterator,
class charT,
class traits>
class regex_iterator_implementation
{
typedef basic_regex<charT, traits> regex_type;
match_results<BidirectionalIterator> what; // current match
BidirectionalIterator base; // start of sequence
BidirectionalIterator end; // end of sequence
const regex_type re; // the expression
match_flag_type flags; // flags for matching
public:
regex_iterator_implementation(const regex_type* p, BidirectionalIterator last, match_flag_type f)
: base(), end(last), re(*p), flags(f){}
bool init(BidirectionalIterator first)
{
base = first;
return regex_search(first, end, what, re, flags);
}
bool compare(const regex_iterator_implementation& that)
{
if(this == &that) return true;
return (&re.get_data() == &that.re.get_data()) && (end == that.end) && (flags == that.flags) && (what[0].first == that.what[0].first) && (what[0].second == that.what[0].second);
}
const match_results<BidirectionalIterator>& get()
{ return what; }
bool next()
{
if(what.prefix().first != what[0].second)
flags |= match_prev_avail;
BidirectionalIterator next_start = what[0].second;
match_flag_type f(flags);
if(!what.length())
f |= regex_constants::match_not_initial_null;
if(base != next_start)
f |= regex_constants::match_not_bob;
bool result = regex_search(next_start, end, what, re, f);
if(result)
what.set_base(base);
return result;
}
private:
regex_iterator_implementation& operator=(const regex_iterator_implementation&);
};
template <class BidirectionalIterator,
class charT = BOOST_DEDUCED_TYPENAME re_detail::regex_iterator_traits<BidirectionalIterator>::value_type,
class traits = regex_traits<charT> >
class regex_iterator
#ifndef BOOST_NO_STD_ITERATOR
: public std::iterator<
std::forward_iterator_tag,
match_results<BidirectionalIterator>,
typename re_detail::regex_iterator_traits<BidirectionalIterator>::difference_type,
const match_results<BidirectionalIterator>*,
const match_results<BidirectionalIterator>& >
#endif
{
private:
typedef regex_iterator_implementation<BidirectionalIterator, charT, traits> impl;
typedef shared_ptr<impl> pimpl;
public:
typedef basic_regex<charT, traits> regex_type;
typedef match_results<BidirectionalIterator> value_type;
typedef typename re_detail::regex_iterator_traits<BidirectionalIterator>::difference_type
difference_type;
typedef const value_type* pointer;
typedef const value_type& reference;
typedef std::forward_iterator_tag iterator_category;
regex_iterator(){}
regex_iterator(BidirectionalIterator a, BidirectionalIterator b,
const regex_type& re,
match_flag_type m = match_default)
: pdata(new impl(&re, b, m))
{
if(!pdata->init(a))
{
pdata.reset();
}
}
regex_iterator(const regex_iterator& that)
: pdata(that.pdata) {}
regex_iterator& operator=(const regex_iterator& that)
{
pdata = that.pdata;
return *this;
}
bool operator==(const regex_iterator& that)const
{
if((pdata.get() == 0) || (that.pdata.get() == 0))
return pdata.get() == that.pdata.get();
return pdata->compare(*(that.pdata.get()));
}
bool operator!=(const regex_iterator& that)const
{ return !(*this == that); }
const value_type& operator*()const
{ return pdata->get(); }
const value_type* operator->()const
{ return &(pdata->get()); }
regex_iterator& operator++()
{
cow();
if(0 == pdata->next())
{
pdata.reset();
}
return *this;
}
regex_iterator operator++(int)
{
regex_iterator result(*this);
++(*this);
return result;
}
private:
pimpl pdata;
void cow()
{
// copy-on-write
if(pdata.get() && !pdata.unique())
{
pdata.reset(new impl(*(pdata.get())));
}
}
};
typedef regex_iterator<const char*> cregex_iterator;
typedef regex_iterator<std::string::const_iterator> sregex_iterator;
#ifndef BOOST_NO_WREGEX
typedef regex_iterator<const wchar_t*> wcregex_iterator;
typedef regex_iterator<std::wstring::const_iterator> wsregex_iterator;
#endif
// make_regex_iterator:
template <class charT, class traits>
inline regex_iterator<const charT*, charT, traits> make_regex_iterator(const charT* p, const basic_regex<charT, traits>& e, regex_constants::match_flag_type m = regex_constants::match_default)
{
return regex_iterator<const charT*, charT, traits>(p, p+traits::length(p), e, m);
}
template <class charT, class traits, class ST, class SA>
inline regex_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits> make_regex_iterator(const std::basic_string<charT, ST, SA>& p, const basic_regex<charT, traits>& e, regex_constants::match_flag_type m = regex_constants::match_default)
{
return regex_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>(p.begin(), p.end(), e, m);
}
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace boost
#endif // BOOST_REGEX_V4_REGEX_ITERATOR_HPP
include/boost/regex/v4/regex_kmp.hpp
+108
View File
@@ -0,0 +1,108 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_kmp.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Provides Knuth Morris Pratt search operations.
* Note this is an internal header file included
* by regex.hpp, do not include on its own.
*/
#ifndef BOOST_REGEX_KMP_HPP
#define BOOST_REGEX_KMP_HPP
#ifdef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
namespace boost{
namespace re_detail{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
template <class charT>
struct kmp_info
{
unsigned int size;
unsigned int len;
const charT* pstr;
int kmp_next[1];
};
template <class charT, class Allocator>
void kmp_free(kmp_info<charT>* pinfo, const Allocator& a)
{
typedef typename boost::detail::rebind_allocator<char, Allocator>::type atype;
atype(a).deallocate(reinterpret_cast<char*>(pinfo), pinfo->size);
}
template <class iterator, class charT, class Trans, class Allocator>
kmp_info<charT>* kmp_compile(iterator first, iterator last, charT, Trans translate, const Allocator& a)
{
typedef typename boost::detail::rebind_allocator<char, Allocator>::type atype;
int i, j, m;
i = 0;
m = static_cast<int>(::boost::re_detail::distance(first, last));
++m;
unsigned int size = sizeof(kmp_info<charT>) + sizeof(int)*m + sizeof(charT)*m;
--m;
//
// allocate struct and fill it in:
//
kmp_info<charT>* pinfo = reinterpret_cast<kmp_info<charT>*>(atype(a).allocate(size));
BOOST_REGEX_NOEH_ASSERT(pinfo)
pinfo->size = size;
pinfo->len = m;
charT* p = reinterpret_cast<charT*>(reinterpret_cast<char*>(pinfo) + sizeof(kmp_info<charT>) + sizeof(int)*(m+1));
pinfo->pstr = p;
while(first != last)
{
*p = translate(*first);
++first;
++p;
}
*p = 0;
//
// finally do regular kmp compile:
//
j = pinfo->kmp_next[0] = -1;
while (i < m)
{
while ((j > -1) && (pinfo->pstr[i] != pinfo->pstr[j]))
j = pinfo->kmp_next[j];
++i;
++j;
if (pinfo->pstr[i] == pinfo->pstr[j])
pinfo->kmp_next[i] = pinfo->kmp_next[j];
else
pinfo->kmp_next[i] = j;
}
return pinfo;
}
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namepsace re_detail
} // namespace boost
#endif // BOOST_REGEX_KMP_HPP
include/boost/regex/v4/regex_match.hpp
+368
View File
@@ -0,0 +1,368 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_match.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Regular expression matching algorithms.
* Note this is an internal header file included
* by regex.hpp, do not include on its own.
*/
#ifndef BOOST_REGEX_MATCH_HPP
#define BOOST_REGEX_MATCH_HPP
namespace boost{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
//
// proc regex_match
// returns true if the specified regular expression matches
// the whole of the input. Fills in what matched in m.
//
template <class BidiIterator, class Allocator, class charT, class traits>
bool regex_match(BidiIterator first, BidiIterator last,
match_results<BidiIterator, Allocator>& m,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
re_detail::perl_matcher<BidiIterator, Allocator, traits> matcher(first, last, m, e, flags);
return matcher.match();
}
template <class iterator, class charT, class traits>
bool regex_match(iterator first, iterator last,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
match_results<iterator> m;
return regex_match(first, last, m, e, flags | regex_constants::match_any);
}
//
// query_match convenience interfaces:
#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
//
// this isn't really a partial specialisation, but template function
// overloading - if the compiler doesn't support partial specialisation
// then it really won't support this either:
template <class charT, class Allocator, class traits>
inline bool regex_match(const charT* str,
match_results<const charT*, Allocator>& m,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + traits::length(str), m, e, flags);
}
template <class ST, class SA, class Allocator, class charT, class traits>
inline bool regex_match(const std::basic_string<charT, ST, SA>& s,
match_results<typename std::basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
template <class charT, class traits>
inline bool regex_match(const charT* str,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
match_results<const charT*> m;
return regex_match(str, str + traits::length(str), m, e, flags | regex_constants::match_any);
}
template <class ST, class SA, class charT, class traits>
inline bool regex_match(const std::basic_string<charT, ST, SA>& s,
const basic_regex<charT, traits>& e,
match_flag_type flags = match_default)
{
typedef typename std::basic_string<charT, ST, SA>::const_iterator iterator;
match_results<iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#else // partial ordering
inline bool regex_match(const char* str,
cmatch& m,
const regex& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + regex::traits_type::length(str), m, e, flags);
}
inline bool regex_match(const char* str,
const regex& e,
match_flag_type flags = match_default)
{
match_results<const char*> m;
return regex_match(str, str + regex::traits_type::length(str), m, e, flags | regex_constants::match_any);
}
#ifndef BOOST_NO_STD_LOCALE
inline bool regex_match(const char* str,
cmatch& m,
const basic_regex<char, cpp_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + regex::traits_type::length(str), m, e, flags);
}
inline bool regex_match(const char* str,
const basic_regex<char, cpp_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
match_results<const char*> m;
return regex_match(str, str + regex::traits_type::length(str), m, e, flags | regex_constants::match_any);
}
#endif
inline bool regex_match(const char* str,
cmatch& m,
const basic_regex<char, c_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + regex::traits_type::length(str), m, e, flags);
}
inline bool regex_match(const char* str,
const basic_regex<char, c_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
match_results<const char*> m;
return regex_match(str, str + regex::traits_type::length(str), m, e, flags | regex_constants::match_any);
}
#if defined(_WIN32) && !defined(BOOST_REGEX_NO_W32)
inline bool regex_match(const char* str,
cmatch& m,
const basic_regex<char, w32_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + regex::traits_type::length(str), m, e, flags);
}
inline bool regex_match(const char* str,
const basic_regex<char, w32_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
match_results<const char*> m;
return regex_match(str, str + regex::traits_type::length(str), m, e, flags | regex_constants::match_any);
}
#endif
#ifndef BOOST_NO_WREGEX
inline bool regex_match(const wchar_t* str,
wcmatch& m,
const wregex& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + wregex::traits_type::length(str), m, e, flags);
}
inline bool regex_match(const wchar_t* str,
const wregex& e,
match_flag_type flags = match_default)
{
match_results<const wchar_t*> m;
return regex_match(str, str + wregex::traits_type::length(str), m, e, flags | regex_constants::match_any);
}
#ifndef BOOST_NO_STD_LOCALE
inline bool regex_match(const wchar_t* str,
wcmatch& m,
const basic_regex<wchar_t, cpp_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + wregex::traits_type::length(str), m, e, flags);
}
inline bool regex_match(const wchar_t* str,
const basic_regex<wchar_t, cpp_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
match_results<const wchar_t*> m;
return regex_match(str, str + wregex::traits_type::length(str), m, e, flags | regex_constants::match_any);
}
#endif
inline bool regex_match(const wchar_t* str,
wcmatch& m,
const basic_regex<wchar_t, c_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + wregex::traits_type::length(str), m, e, flags);
}
inline bool regex_match(const wchar_t* str,
const basic_regex<wchar_t, c_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
match_results<const wchar_t*> m;
return regex_match(str, str + wregex::traits_type::length(str), m, e, flags | regex_constants::match_any);
}
#if defined(_WIN32) && !defined(BOOST_REGEX_NO_W32)
inline bool regex_match(const wchar_t* str,
wcmatch& m,
const basic_regex<wchar_t, w32_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
return regex_match(str, str + wregex::traits_type::length(str), m, e, flags);
}
inline bool regex_match(const wchar_t* str,
const basic_regex<wchar_t, w32_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
match_results<const wchar_t*> m;
return regex_match(str, str + wregex::traits_type::length(str), m, e, flags | regex_constants::match_any);
}
#endif
#endif
inline bool regex_match(const std::string& s,
smatch& m,
const regex& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
inline bool regex_match(const std::string& s,
const regex& e,
match_flag_type flags = match_default)
{
match_results<std::string::const_iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#ifndef BOOST_NO_STD_LOCALE
inline bool regex_match(const std::string& s,
smatch& m,
const basic_regex<char, cpp_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
inline bool regex_match(const std::string& s,
const basic_regex<char, cpp_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
match_results<std::string::const_iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#endif
inline bool regex_match(const std::string& s,
smatch& m,
const basic_regex<char, c_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
inline bool regex_match(const std::string& s,
const basic_regex<char, c_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
match_results<std::string::const_iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#if defined(_WIN32) && !defined(BOOST_REGEX_NO_W32)
inline bool regex_match(const std::string& s,
smatch& m,
const basic_regex<char, w32_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
inline bool regex_match(const std::string& s,
const basic_regex<char, w32_regex_traits<char> >& e,
match_flag_type flags = match_default)
{
match_results<std::string::const_iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#endif
#if !defined(BOOST_NO_WREGEX)
inline bool regex_match(const std::basic_string<wchar_t>& s,
match_results<std::basic_string<wchar_t>::const_iterator>& m,
const wregex& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
inline bool regex_match(const std::basic_string<wchar_t>& s,
const wregex& e,
match_flag_type flags = match_default)
{
match_results<std::basic_string<wchar_t>::const_iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#ifndef BOOST_NO_STD_LOCALE
inline bool regex_match(const std::basic_string<wchar_t>& s,
match_results<std::basic_string<wchar_t>::const_iterator>& m,
const basic_regex<wchar_t, cpp_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
inline bool regex_match(const std::basic_string<wchar_t>& s,
const basic_regex<wchar_t, cpp_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
match_results<std::basic_string<wchar_t>::const_iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#endif
inline bool regex_match(const std::basic_string<wchar_t>& s,
match_results<std::basic_string<wchar_t>::const_iterator>& m,
const basic_regex<wchar_t, c_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
inline bool regex_match(const std::basic_string<wchar_t>& s,
const basic_regex<wchar_t, c_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
match_results<std::basic_string<wchar_t>::const_iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#if defined(_WIN32) && !defined(BOOST_REGEX_NO_W32)
inline bool regex_match(const std::basic_string<wchar_t>& s,
match_results<std::basic_string<wchar_t>::const_iterator>& m,
const basic_regex<wchar_t, w32_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
return regex_match(s.begin(), s.end(), m, e, flags);
}
inline bool regex_match(const std::basic_string<wchar_t>& s,
const basic_regex<wchar_t, w32_regex_traits<wchar_t> >& e,
match_flag_type flags = match_default)
{
match_results<std::basic_string<wchar_t>::const_iterator> m;
return regex_match(s.begin(), s.end(), m, e, flags | regex_constants::match_any);
}
#endif
#endif
#endif
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace boost
#endif // BOOST_REGEX_MATCH_HPP
include/boost/regex/v4/regex_merge.hpp
+79
View File
@@ -0,0 +1,79 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_format.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Provides formatting output routines for search and replace
* operations. Note this is an internal header file included
* by regex.hpp, do not include on its own.
*/
#ifndef BOOST_REGEX_V4_REGEX_MERGE_HPP
#define BOOST_REGEX_V4_REGEX_MERGE_HPP
namespace boost{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
template <class OutputIterator, class Iterator, class traits, class charT>
inline OutputIterator regex_merge(OutputIterator out,
Iterator first,
Iterator last,
const basic_regex<charT, traits>& e,
const charT* fmt,
match_flag_type flags = match_default)
{
return regex_replace(out, first, last, e, fmt, flags);
}
template <class OutputIterator, class Iterator, class traits, class charT>
inline OutputIterator regex_merge(OutputIterator out,
Iterator first,
Iterator last,
const basic_regex<charT, traits>& e,
const std::basic_string<charT>& fmt,
match_flag_type flags = match_default)
{
return regex_merge(out, first, last, e, fmt.c_str(), flags);
}
template <class traits, class charT>
inline std::basic_string<charT> regex_merge(const std::basic_string<charT>& s,
const basic_regex<charT, traits>& e,
const charT* fmt,
match_flag_type flags = match_default)
{
return regex_replace(s, e, fmt, flags);
}
template <class traits, class charT>
inline std::basic_string<charT> regex_merge(const std::basic_string<charT>& s,
const basic_regex<charT, traits>& e,
const std::basic_string<charT>& fmt,
match_flag_type flags = match_default)
{
return regex_replace(s, e, fmt, flags);
}
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace boost
#endif // BOOST_REGEX_V4_REGEX_MERGE_HPP
include/boost/regex/v4/regex_raw_buffer.hpp
+196
View File
@@ -0,0 +1,196 @@
/*
*
* Copyright (c) 1998-2002
* 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.
* FILE regex_raw_buffer.hpp
* VERSION see <boost/version.hpp>
* DESCRIPTION: Raw character buffer for regex code.
* Note this is an internal header file included
* by regex.hpp, do not include on its own.
*/
#ifndef BOOST_REGEX_RAW_BUFFER_HPP
#define BOOST_REGEX_RAW_BUFFER_HPP
#ifndef BOOST_REGEX_CONFIG_HPP
#include <boost/regex/config.hpp>
#endif
#include <algorithm>
#include <cstddef>
namespace boost{
namespace re_detail{
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_PREFIX
#endif
struct empty_padding{};
union padding
{
void* p;
unsigned int i;
};
template <int N>
struct padding3
{
enum{
padding_size = 8,
padding_mask = 7
};
};
template<>
struct padding3<2>
{
enum{
padding_size = 2,
padding_mask = 1
};
};
template<>
struct padding3<4>
{
enum{
padding_size = 4,
padding_mask = 3
};
};
template<>
struct padding3<8>
{
enum{
padding_size = 8,
padding_mask = 7
};
};
template<>
struct padding3<16>
{
enum{
padding_size = 16,
padding_mask = 15
};
};
enum{
padding_size = padding3<sizeof(padding)>::padding_size,
padding_mask = padding3<sizeof(padding)>::padding_mask
};
//
// class raw_storage
// basically this is a simplified vector<unsigned char>
// this is used by basic_regex for expression storage
//
class BOOST_REGEX_DECL raw_storage
{
public:
typedef std::size_t size_type;
typedef unsigned char* pointer;
private:
pointer last, start, end;
public:
raw_storage();
raw_storage(size_type n);
~raw_storage()
{
::operator delete(start);
}
void BOOST_REGEX_CALL resize(size_type n);
void* BOOST_REGEX_CALL extend(size_type n)
{
if(size_type(last - end) < n)
resize(n + (end - start));
register pointer result = end;
end += n;
return result;
}
void* BOOST_REGEX_CALL insert(size_type pos, size_type n);
size_type BOOST_REGEX_CALL size()
{
return end - start;
}
size_type BOOST_REGEX_CALL capacity()
{
return last - start;
}
void* BOOST_REGEX_CALL data()const
{
return start;
}
size_type BOOST_REGEX_CALL index(void* ptr)
{
return static_cast<pointer>(ptr) - static_cast<pointer>(data());
}
void BOOST_REGEX_CALL clear()
{
end = start;
}
void BOOST_REGEX_CALL align()
{
// move end up to a boundary:
end = start + (((end - start) + padding_mask) & ~padding_mask);
}
void swap(raw_storage& that)
{
std::swap(start, that.start);
std::swap(end, that.end);
std::swap(last, that.last);
}
};
inline raw_storage::raw_storage()
{
last = start = end = 0;
}
inline raw_storage::raw_storage(size_type n)
{
start = end = static_cast<pointer>(::operator new(n));
BOOST_REGEX_NOEH_ASSERT(start)
last = start + n;
}
#ifdef BOOST_HAS_ABI_HEADERS
# include BOOST_ABI_SUFFIX
#endif
} // namespace re_detail
} // namespace boost
#endif

Some files were not shown because too many files have changed in this diff Show More