From: Roman Neuhauser

If so, what are you envisioning to construct those objects with if not regular expression literals? You'll end up using regex_match() in operator==() anyway, so again, what's the question exactly?

I suggest that the fundamental problem to be solved here is: given regular expressions X and Y, can some string matching X completely be a substring match for Y? In general, this sounds hard. Can we do better than brute-force (i.e. generating every possible string for X and checking it against Y)? The brute-force solution is obviously exponential-time (or infinite-time!) in worst-case, so something better would be nice. I doubt a few simple changes to boost::regex would solve it. - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837