- Boost-users - lists.preview.boost.org

boost::regex: regex_constants::error_space
by Andriy Tylychko (mail.ru) 16 Jun '06

16 Jun '06

John Maddock wrote: * You shouldn't get that exception from that expression: that exception is raised when the number of states visted in the search for a match looks to be growing exponentially, it's usually caused by "pathological" regular expressions like "(.*)*" that can end up searching forever on some inputs. Do you have a more specific test case please? John. * Hi John. Thanks for quick reply. I'm afraid I don't have more specific test. Maybe additional info will help. Boost v.1.33.1, VC 8.0. The buffer content looks like: 00:00:00.000 [category 100] EXCEPTION: test log-message #100 00:00:00.000 [category 101] ERROR: test log-message #101 new line 00:00:00.000 [category 102] WARNING: test log-message #102 00:00:00.000 [category 103] INFO: test log-message #103 00:00:00.000 [category 104] DEBUG: test log-message #104 00:00:00.000 [category 105] EXCEPTION: test log-message #105 new line 00:00:00.000 [category 106] ERROR: test log-message #106 [...] 00:00:00.000 [category 300] EXCEPTION: test log-message #300 As result, threre's no match for "#1.*#7" in such content. Debugger shows that regex_search reached position "171\r\n00:00:00.000 [category 172] WARNING: test log-message #172[...]", state_count = 468663, max_state_count = 468640. Can I provide any additional useful info? Should I send you standalone test for problem reproduction? Thank you, Andriy. John Maddock wrote: > Andriy Tylychko (mail.ru) wrote: >> Hi, >> >> The code looks like: >> >> std::string buffer(10240, '\0'); >> // ... fill buffer >> boost::regex e("#1.*#7"); >> boost::smatch m; >> boost::regex_search(buffer, m, e); >> >> The buffer of 10KB is full of "something #x". As result I receive >> regex_constants::error_space at >> boost\regex\v4\perl_matcher_non_recursive.hpp:164. >> I'll highly appreciate any help. > > You shouldn't get that exception from that expression: that exception is > raised when the number of states visted in the search for a match looks to > be growing exponentially, it's usually caused by "pathological" regular > expressions like "(.*)*" that can end up searching forever on some inputs. > > Do you have a more specific test case please? > > John.

1 0

[Boost.Test]unit_test_example1.cpp and vc80
by obirsoy＠comcast.net 16 Jun '06

16 Jun '06

My problem is "access violation" in unit_test_example1.cpp can not be caught with vc80. Do I need to set some compiler or linker option? When I ran unit_test_example1 (compiled with vc71, boost version 1.32.0) I used to get this output. The access violation was reported and the test continued. >Running 1 test case... >c:/development/projects/test/boosttest/main.cpp(17): error in "free_test_function": check 2 == 1 failed >unknown location(0): fatal error in "free_test_function": memory access violation > >*** 1 failure detected (1 failure expected) in test suite "Unit test example 1" >Press any key to continue But with vc80 (both with 1.33.1 and cvs head), when I run unit_test_example1 I get the access violation dialog and after selecting "Don't Send" I get this output. Note I also get some memory leak dump if I ran it the debug version. >Running 1 test case... >./main.cpp(17): error in "free_test_function": check 2 == 1 failed >Press any key to continue . . . What am I missing? Thanks Orhun Birsoy

3 3

boost::regex: regex_constants::error_space
by Andriy Tylychko (mail.ru) 15 Jun '06

15 Jun '06

Hi, The code looks like: std::string buffer(10240, '\0'); // ... fill buffer boost::regex e("#1.*#7"); boost::smatch m; boost::regex_search(buffer, m, e); The buffer of 10KB is full of "something #x". As result I receive regex_constants::error_space at boost\regex\v4\perl_matcher_non_recursive.hpp:164. I'll highly appreciate any help. Thank you, Andriy Tylychko, telya(a)vichnavich.com

2 1

Trap in regex library (help requested)
by Marty Eaves 15 Jun '06

15 Jun '06

Hello, I am having an issue using the regex library. I am developing in VC7 and this issue occurs with both Boost 1.33.0 and 1.33.1. I have recently tried to start retrieving capture information in the regex matches by using the match_result and sub_match classes. In order to use these classes, the compile flag BOOST_REGEX_MATCH_EXTRA is required to be turned on (enabled in user.hpp). With the library is built with this flag on, I will get the following trap when the method calling regex_match() returns. An unhandled exception of type 'System.NullReferenceException' occurred in tg12.exe Additional information: Object reference not set to an instance of an object This exception appears to occur in the cleanup logic of the ~match_results() destructor. I have yet to make any changes to the code to use the match_results object. In other words, the code I am using worked previously without the BOOST_REGEX_MATCH_EXTRA flag enabled. Are there any compiler options required? The stack trace is below. Thanks, Marty > DtmfGrammarManager.dll!std::vector<boost::sub_match<std::basic_string<ch ar,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >::_Tidy() Line 797 + 0x3 C++ DtmfGrammarManager.dll!std::vector<boost::sub_match<std::basic_string<ch ar,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >::~vector<boost::sub_match<std::basic_string<char,std::char_traits<char >,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >() Line 389 C++ DtmfGrammarManager.dll!std::vector<boost::sub_match<std::basic_string<ch ar,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >::`scalar deleting destructor'() + 0xf C++ DtmfGrammarManager.dll!boost::checked_delete<std::vector<boost::sub_matc h<std::basic_string<char,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > > >(std::vector<boost::sub_match<std::basic_string<char,std::char_traits<c har>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > > * x=0x00baadf0) Line 34 + 0x1c C++ DtmfGrammarManager.dll!boost::scoped_ptr<std::vector<boost::sub_match<st d::basic_string<char,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > > >::~scoped_ptr<std::vector<boost::sub_match<std::basic_string<char,std:: char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > > >() Line 77 + 0xb C++ DtmfGrammarManager.dll!boost::sub_match<std::basic_string<char,std::char _traits<char>,std::allocator<char> >::const_iterator>::~sub_match<std::basic_string<char,std::char_traits<c har>,std::allocator<char> >::const_iterator>() + 0x12 C++ DtmfGrammarManager.dll!boost::sub_match<std::basic_string<char,std::char _traits<char>,std::allocator<char> >::const_iterator>::`scalar deleting destructor'() + 0xf C++ DtmfGrammarManager.dll!std::_Destroy<boost::sub_match<std::basic_string< char,std::char_traits<char>,std::allocator<char> >::const_iterator> >(boost::sub_match<std::basic_string<char,std::char_traits<char>,std::al locator<char> >::const_iterator> * _Ptr=0x008d8428) Line 50 C++ DtmfGrammarManager.dll!std::allocator<boost::sub_match<std::basic_string <char,std::char_traits<char>,std::allocator<char> >::const_iterator> >::destroy(boost::sub_match<std::basic_string<char,std::char_traits<char >,std::allocator<char> >::const_iterator> * _Ptr=0x008d8428) Line 152 + 0x9 C++ DtmfGrammarManager.dll!std::_Destroy_range<boost::sub_match<std::basic_s tring<char,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >(boost::sub_match<std::basic_string<char,std::char_traits<char>,std::al locator<char> >::const_iterator> * _First=0x008d8428, boost::sub_match<std::basic_string<char,std::char_traits<char>,std::allo cator<char> >::const_iterator> * _Last=0x008d8988, std::allocator<boost::sub_match<std::basic_string<char,std::char_traits< char>,std::allocator<char> >::const_iterator> > & _Al={...}, std::_Nonscalar_ptr_iterator_tag __formal={...}) Line 226 + 0xc C++ DtmfGrammarManager.dll!std::_Destroy_range<boost::sub_match<std::basic_s tring<char,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >(boost::sub_match<std::basic_string<char,std::char_traits<char>,std::al locator<char> >::const_iterator> * _First=0x008d8428, boost::sub_match<std::basic_string<char,std::char_traits<char>,std::allo cator<char> >::const_iterator> * _Last=0x008d8988, std::allocator<boost::sub_match<std::basic_string<char,std::char_traits< char>,std::allocator<char> >::const_iterator> > & _Al={...}) Line 217 + 0x28 C++ DtmfGrammarManager.dll!std::vector<boost::sub_match<std::basic_string<ch ar,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >::_Destroy(boost::sub_match<std::basic_string<char,std::char_traits<cha r>,std::allocator<char> >::const_iterator> * _First=0x008d8428, boost::sub_match<std::basic_string<char,std::char_traits<char>,std::allo cator<char> >::const_iterator> * _Last=0x008d8988) Line 787 + 0x11 C++ DtmfGrammarManager.dll!std::vector<boost::sub_match<std::basic_string<ch ar,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >::_Tidy() Line 795 C++ DtmfGrammarManager.dll!std::vector<boost::sub_match<std::basic_string<ch ar,std::char_traits<char>,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >::~vector<boost::sub_match<std::basic_string<char,std::char_traits<char >,std::allocator<char> >::const_iterator>,std::allocator<boost::sub_match<std::basic_string<cha r,std::char_traits<char>,std::allocator<char> >::const_iterator> > >() Line 389 C++ DtmfGrammarManager.dll!boost::match_results<std::basic_string<char,std:: char_traits<char>,std::allocator<char> >::const_iterator,std::allocator<boost::sub_match<std::basic_string<char ,std::char_traits<char>,std::allocator<char> >::const_iterator> > >::~match_results<std::basic_string<char,std::char_traits<char>,std::all ocator<char> >::const_iterator,std::allocator<boost::sub_match<std::basic_string<char ,std::char_traits<char>,std::allocator<char> >::const_iterator> > >() Line 74 + 0x3d C++ DtmfGrammarManager.dll!CDtmfGrammar_custom::check(const std::basic_string<char,std::char_traits<char>,std::allocator<char> > & inputData={...}, const std::basic_string<char,std::char_traits<char>,std::allocator<char> > & currentInput={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > * pResultValue=0x0012ea9c, const std::basic_string<char,std::char_traits<char>,std::allocator<char> > & termcharArg={...}) Line 949 + 0x19 C++ DtmfGrammarManager.dll!CDtmfGrammarManager::inputUpdate(const char * utterancePortionArg=0x00406e2c) Line 200 + 0x3b C++ mscorwks.dll!7925de73() tg12.exe!feedInput(char* iArg = 0x00406e2c, char* termcharArg = 0x00406e28) Line 22 + 0x1e bytes C++ tg12.exe!main(__int32 argc = 1, char** argv = 0x008d8120) Line 309 + 0x10 bytes C++ tg12.exe!mainCRTStartup() Line 398 + 0xe C ________________________________ <http://www.intervoice.com> Marty Eaves STAFF SOFTWARE ENGINEER CALL PROCESSING & MEDIA SERVICES RESEARCH AND DEVELOPMENT INTERVOICE, INC. P: (972) 454-8348 marty.eaves(a)intervoice.com ________________________________ Intervoice: Connecting People and Information. This e-mail transmission may contain information that is proprietary, privileged and/or confidential and is intended exclusively for the person(s) to whom it is addressed. Any use, copying, retention or disclosure by any person other than the intended recipient or the intended recipient's designees is strictly prohibited. If you are the intended recipient, you must treat the information in confidence and in accordance with all laws related to the privacy and confidentiality of such information. If you are not the intended recipient or their designee, please notify the sender immediately by return e-mail and delete all copies of this email, including all attachments.

2 1

[serialization-1.32.0] de-serializing newer versions that the application can deal with
by Russell Hind 15 Jun '06

15 Jun '06

We have system data written out to an XML archive and being de-serialized at application startup. One object type in the archive we written at version 1 by a newer version of the application. We then ran an older version of the software which only understood version 0 of the object. Does serialization not check the 'BOOST_CLASS_VERSION' of an object before attempting to de-serialize it? If not, how can we access the 'BOOST_CLASS_VERSION' in a serialization member function? I'm looking to do something like this: (this code is just written now so probably is incorrect but hopefully gives the idea). How do we check 'version_of_T' below which should correspond to the BOOST_CLASS_VERSION for T? I'd probably have this only check if the ArchiveT::is_loading::value is true as serializing doesn't matter. The issue at the moment is that an access violation is being thrown which definitely isn't a good idea. I'd like a 'newer object version' exception thrown instead which would enable us to give more useful error information to the user or our error log. Thanks Russell namespace serialization { template <typename T> void check_version(T* Object, unsigned int version)) { if (version_of_T > version) { throw newer_version_exception(); } } } class test { template <typename ArciveT> void serialize(ArchiveT& ar, unsigned int version) { serialization::check_version(this, version); } }; BOOST_CLASS_VERSION(test, 0x00);

3 4

[serialization] - xdr-archives?
by Oliver.Kowalke＠qimonda.com 15 Jun '06

15 Jun '06

Hello, did someone tried to implement XDR-archive? I know that Jack Reeves illustrated an XDRstream implementation on CUJ/C++ forum. Regards, Oliver

1 0

Boost installation OS X 10.3
by Amit Bhatia 15 Jun '06

15 Jun '06

Hi, I did a google search to look for how to install boost library on os X 10.3 after trying the instructions on the boost.org site (and failing). But I have not been able to find anything useful yet. I am using gcc version 3.3 20030304 (Apple Computer, Inc. build 1640). I also use fink package manager for a lot of packages that I need. I have python version 2.3 I believe. Can anyone suggest to me step by step instructions of how to install boost library 1_33_1 ? I have already tried using bjam for the same but the installation terminated with ...failed updating 49 targets... ...skipped 3624 targets... ...updated 691 targets... thanks, -a. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

[preprocessor] concatenating values to create typedef permutations
by Chris Weed 15 Jun '06

15 Jun '06

Hi, I am trying to use the preprocessor iteration ability to create typedef permutations. I want to do something like use the following set of types TYPE1: char int float TYPE2: char int float double to generate permutations of MyClass<TYPE1,TYPE2> such as typedef MyClass<char,char> Mycc; typedef MyClass<char,int> Myci; typedef MyClass<char,float> Mycf; ... Any help would be greatly appreciated. Thanks, Chris

3 8

Re: [Boost-users] type_with_alignment
by Gottlob Frege 15 Jun '06

15 Jun '06

> > From: Howard Hinnant <hinnant(a)twcny.rr.com> > >> On Jun 14, 2006, at 6:55 AM, David Abrahams wrote: > >> > >>> I think what the OP is looking for is called boost::shared_ptr ;-) > >> Actually, *one* of my uses is a bit more devious - more like the short-string optimization - you might want to call it "embedded_ptr<T, size>". Where it reserves enough space for T (because you explicitly supply the size) and acts like a pointer to T otherwise. You might call it a hack and/or dangerous, and I won't entirely disagree. It does have a static assert on the implementation side (where T is known) to ensure size == sizeof(T), but it is still dangerous if the client compiles with different settings than the implementation. However, knowing these caveats, it may still be useful in cases where you really want/need to avoid the allocation overhead (and still want to separate implementation from interface). If that use-case is not 'worthy' enough to be an argument for default-alignment-based-on-size, a more typical case would probably be a custom allocator. In particular, a small-block allocator. If I need to allocate 4 bytes, I don't want to allocate it on a 16 byte boundary. Now maybe if I am writing an allocator am doing platform-dependent things anyhow, but I don't necessarily think so. Another use of aligned_storage (where T IS complete) is a more noble cause - handling thread safe static locals: void func() { static thread_safe_static_local<Foo> foo; // foo's constructor called once, THREADSAFELY ... } Not sure why I bother to mention that, other than the fact it shares much of the same code as the embedded_ptr. P.S. even if some of you have to hold your nose when thinking of the hack that is embedded_ptr, what do people think of the name? I've been throwing around some different names (ie embedded_incomplete) but until Dave mentioned shared_ptr, I hadn't thought of embedded_ptr. >> shared_ptr can't compete with this application performance-wise. > > > > Well, it depends how expensive it is to copy your small object. If it > > turns out that T is a vector, and it fits in your local buffer, when > > Container is copied it might be a lot cheaper to use shared_ptr. > > Sure. I'm responding to the assertion that you need a known complete > type to effectively use aligned_storage. My point is that there > exist valuable use cases where this assertion is false. The > existence of these cases is what makes the defaulted alignment > template parameter on aligned_storage valuable. > > Tony's observation is that this default value is even more valuable > if it is dependent upon the buffer size, which again I fully agree > with. If you want a 5 byte buffer that is aligned to the "most > stringent alignment requirements" (definition found in 5.3.4p10), an > alignment of 16 (for example) is likely to be correct but overkill. > I had personally settled on 8 for this particular example but Tony > makes a convincing argument for 4 being the optimum (all numbers > assuming current popular desktop processors and quoted just for > example). Actually, after thinking about it a bit, I'm now tempted to say a 5 byte buffer should have 1 byte alignment. eg (given a typical platform): struct test_alignment { int x; char y; }; At first, I thought that any 5 byte structure could have AT MOST a 4 byte alignment requirement because it could have an int as the first param, as in the example above. However, if it does have 4 byte alignment, its size will be 8, so that an array of them will align to 4 bytes. (Howard, you hinted at this in another email thread). So, If sizeof(test_alignment) == 5, then the alignment must really be 1 (ie there is probably a pragma pack(1) in play). Either way, the alignment is NOT 16 (or whatever max alignment might be), but derivable from the size of the structure. Also, in any case, for boost::type_with_alignment<5> doesn't compile. I think it should at least do something (or else the standard/docs need to have lots of wording explaining which ints work and which do not). Similarly, aligned_storage has the same 'problem' and basically only works with alignment_of (or something that does the same thing). Since that is the case anyhow, I would suggest that aligned_storage be replaced with: storage_for<T, count = 1>; (which can be written in terms of aligned_storage and alignment_of, but since the two are tied together, and typically used together, why not just supply what is really wanted). So really I'd like: storage_for_type<T, size_t count = 1> and storage_for_size<size_t> where storage_for_size determines the minimum necessary alignment based on the size, as discussed. -Howard Tony

2 1

finding the index of a partial match with regex_iterator?
by dave＠superelite.net 14 Jun '06

14 Jun '06

hello (and thanks for previous help!), I'm having some difficulty accessing the location of the beginning of a successful partial match. in the callback below, match_results.position() does give me the index of successful matches. How do i get it for partial? The code does recognize a partial match but what[0].first seems to be undefined on a partial match. The callback is called 3 times and does identify the partial but have been totally unable to get that index..Code is below, thanks alot! Dave bool regex_callback(const boost::match_results<std::string::const_iterator>& what) { cout << "in callback, index is " << what.position(0) << endl; if(!what[0].matched) cout << "|--is partial " << endl; return true; } int main(int argc, char *argv[]) { string sMatchMe = "HELLO"; int theseflags=0; boost::regex xreMatchme(sMatchMe, theseflags); boost::cmatch xcmMatch; string stupid = "sdfaHELLOdsfh*saHELLOdhfas1d3ahsdf%as&d!adfasdfsdHELL"; boost::sregex_iterator m1(stupid.begin(), stupid.end(), xreMatchme, boost::match_default | boost::match_partial); boost::sregex_iterator m2; std::for_each(m1, m2, &regex_callback); return 1; }

1 0