reworked regex directory structure to match boost requirements.

[SVN r9752]

test/c_compiler_checks/posix_api_check.c

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

test/c_compiler_checks/posix_api_check.cpp

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

test/c_compiler_checks/wide_posix_api_check.c

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

test/c_compiler_checks/wide_posix_api_check.cpp

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

test/regress/bc55.mak

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

test/regress/bcb4.mak

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

test/regress/bcb5.mak

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

test/regress/gcc.mak

@@ -0,0 +1,56 @@
+
+# very basic makefile for regression tests
+#
+# g++ 2.95 and greater
+#
+CXX= g++ $(INCLUDES) -pedantic -Wall -I../../../../ -I./ $(CXXFLAGS) -L../../build/gcc $(LDFLAGS)
+
+total : r2
+	./r2 tests.txt
+
+r2 : tests.cpp parse.cpp regress.cpp
+	$(CXX) -O2 -o r2 tests.cpp parse.cpp regress.cpp -lboost_regex $(LIBS)
+
+debug : tests.cpp parse.cpp regress.cpp
+	$(CXX) -g -o r2 tests.cpp parse.cpp regress.cpp -lboost_regex_debug $(LIBS)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

test/regress/makefile.in

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

test/regress/parse.cpp

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

test/regress/regex_test.cpp

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

test/regress/regress.cpp

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

test/regress/regress.h

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

test/regress/sunpro.mak

@@ -0,0 +1,131 @@
+
+# very basic makefile for regression tests
+# tests every library combination, static/dynamic/multimthread/singlethread/narrow/wide
+#
+# Sun Workshop 6 and greater:
+#
+CXX= CC $(INCLUDES) -I../../../../ -I./ $(CXXFLAGS) -L../../build/sunpro $(LDFLAGS)
+
+total : r rm r/regress rm/regress rs rms rs/regress rms/regress rw rmw rw/regress rmw/regress rsw rmsw rsw/regress rmsw/regress
+	echo testsing narrow character versions:
+	./r/regress tests.txt
+	./rm/regress tests.txt
+	./rs/regress tests.txt
+	./rms/regress tests.txt
+	echo testsing wide character versions;
+	./rw/regress tests.txt
+	./rmw/regress tests.txt
+	./rsw/regress tests.txt
+	./rmsw/regress tests.txt
+
+#
+# delete the cache before each build.
+# NB this precludes multithread builds:
+#
+r/regress : tests.cpp parse.cpp regress.cpp
+	rm -f *.o
+	rm -fr SunWS_cache
+	$(CXX) -O2 -o r/regress tests.cpp parse.cpp regress.cpp -lboost_regex$(LIBSUFFIX) $(LIBS)
+
+rm/regress : tests.cpp parse.cpp regress.cpp
+	rm -f *.o
+	rm -fr SunWS_cache
+	$(CXX) -O2 -mt -o rm/regress tests.cpp parse.cpp regress.cpp -lboost_regex_mt$(LIBSUFFIX) $(LIBS)
+
+rs/regress : tests.cpp parse.cpp regress.cpp
+	rm -f *.o
+	rm -fr SunWS_cache
+	$(CXX) -O2 -o rs/regress tests.cpp parse.cpp regress.cpp -Bstatic -lboost_regex$(LIBSUFFIX) -Bdynamic $(LIBS)
+
+rms/regress : tests.cpp parse.cpp regress.cpp
+	rm -f *.o
+	rm -fr SunWS_cache
+	$(CXX) -O2 -mt -o rms/regress tests.cpp parse.cpp regress.cpp -Bstatic -lboost_regex_mt$(LIBSUFFIX) -Bdynamic $(LIBS)
+
+rw/regress : tests.cpp parse.cpp regress.cpp
+	rm -f *.o
+	rm -fr SunWS_cache
+	$(CXX) -O2 -DTEST_UNICODE -o rw/regress tests.cpp parse.cpp regress.cpp -lboost_regex$(LIBSUFFIX) $(LIBS)
+
+rmw/regress : tests.cpp parse.cpp regress.cpp
+	rm -f *.o
+	rm -fr SunWS_cache
+	$(CXX) -O2 -mt -DTEST_UNICODE -o rmw/regress tests.cpp parse.cpp regress.cpp -lboost_regex_mt$(LIBSUFFIX) $(LIBS)
+
+rsw/regress : tests.cpp parse.cpp regress.cpp
+	rm -f *.o
+	rm -fr SunWS_cache
+	$(CXX) -O2 -DTEST_UNICODE -o rsw/regress tests.cpp parse.cpp regress.cpp -Bstatic -lboost_regex$(LIBSUFFIX) -Bdynamic $(LIBS)
+
+rmsw/regress : tests.cpp parse.cpp regress.cpp
+	rm -f *.o
+	rm -fr SunWS_cache
+	$(CXX) -O2 -mt -DTEST_UNICODE -o rmsw/regress tests.cpp parse.cpp regress.cpp -Bstatic -lboost_regex_mt$(LIBSUFFIX) -Bdynamic $(LIBS)
+
+r:
+	mkdir -p r
+
+rm:
+	mkdir -p rm
+
+rs:
+	mkdir -p rs
+
+rms:
+	mkdir -p rms
+
+rw:
+	mkdir -p rw
+
+rmw:
+	mkdir -p rmw
+
+rsw:
+	mkdir -p rsw
+
+rmsw:
+	mkdir -p rmsw
+
+clean:
+	rm -f *.o
+	rm -fr SunWS_cache
+	rm -fr r rm rs rms rw rmw rsw rmsw
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

test/regress/test1252.txt

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

test/regress/tests.cpp

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

test/regress/tests.txt

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

test/regress/vc6-stlport.mak

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

test/regress/vc6.mak

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

test/regress/wregex_test.cpp

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