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

Good Template questions enlist
by Hughes, James 19 Jun '06

19 Jun '06

Hello all, I have a convoluted problem with templates and shared libs under Linux that I would like to get some advice on. Since it's not particularly Boost related, does anyone have any suggestions of a good mailing list on which I can ask my question. Or should I ask it here (I think not) Thanks James This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

1 0

[Interprocess] How to Get Started?
by Wu Yinghui, Freddie 19 Jun '06

19 Jun '06

Hi all, I can see that Boost.Interprocess (former Shmem) is now in the CVS. But is there any documentation on it to get one started? I intend to test it out for our future development, but so far I've not been able to find information specific to the now Interprocess library. So is there any documentation available anywhere on the web now? Cheers, Freddie -- Wu Yinghui, Freddie Research & Development Software Engineer Volume Interactions Pte Ltd 1 Kim Seng Promenade, #12-01 Great World City East Tower Singapore 237994 Tel: +65 62226962 (Ext 216) Fax: +65 62226215 Email: yhwu(a)volumeinteractions.com URL: http://www.volumeinteractions.com Important: This message is intended for the recipient(s) addressed above. It contains privileged and confidential information. If you are not the intended recipient, please notify the sender immediately by replying to this message and then delete it from your system. You must not read, copy, use, or disseminate this communication in any form. Thank you.

3 2

Debug data structures using aligned storage
by Pierre THIERRY 19 Jun '06

19 Jun '06

Hi, I've googled for web pages and groups, but I didn't even find anyone *asking* that question: How can I debug data structures using aligned storage? It's very practical to use a graphical debugger like DDD to browse data structures like linked lists or trees. But aligned storages, as used by boost::variant, are opaque to the debugger. Blindly, Nowhere man -- nowhere.man(a)levallois.eu.org OpenPGP 0xD9D50D8A

4 9

ADL comment in noncopyable
by Kobi Cohen-Arazi 19 Jun '06

19 Jun '06

Hi, I've seen the following comment in noncopyable.hpp namespace noncopyable_ // protection from unintended ADL What does it mean protection from unintended ADL? Thanks, -- - Kobi

9 26

variant assignement failure
by Pierre THIERRY 19 Jun '06

19 Jun '06

Hi, I've just got an error I would think impossible with variant: assigning another variant to it triggered the false assert at /usr/include/boost/variant/detail/visitation_impl.hpp:203 which, IIUC, seems to say that there is a lack of a fallback type... FWIW, it's a variant holding 3 types, an int and 2 pointers types. When the error occurs, it's in the copy constructor of an object holding such a variant, and at this moment, the rhs variant holds it's third type, the second pointer type. The exact error is, at runtime (compilation goes without a warning): /usr/include/boost/variant/detail/visitation_impl.hpp:203: typename Visitor::result_type boost::detail::variant::visitation_impl(int, int, Visitor&, VPCV, mpl_::true_, NBF, W*, S*) [with W = mpl_::int_<20>, S = boost::detail::variant::visitation_impl_step<boost::mpl::l_iter<boost::mpl::l_end>, boost::mpl::l_iter<boost::mpl::l_end> >, Visitor = boost::variant<twotypestree::tree_placeholder, twotypestree::tree<T1, T2*>::node_iterator*, twotypestree::tree<T1, T2*>::leaf_iterator*, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_>::assigner, VPCV = const void*, NBF = boost::variant<twotypestree::tree_placeholder, twotypestree::tree<T1, T2*>::node_iterator*, twotypestree::tree<T1, T2*>::leaf_iterator*, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_>::has_fallback_type_]: Assertion `false' failed. - twotypestree::tree<T1, T2*> is a tree holding a different data at it's nodes (T1 here) and it's leafs (T2* here). - twotypestree::tree_placeholder is an enum with just a value, not_a_tree The code triggering the problem is as simple as: tree_iterator(const tree_iterator& original) { pimpl_ = original.pimpl_; // pimpl_ is the variant } Would anyone see what the problem is? Confusingly, Nowhere man -- nowhere.man(a)levallois.eu.org OpenPGP 0xD9D50D8A

1 0

[test] Customizing the xml logs
by Johan Nilsson 19 Jun '06

19 Jun '06

Hi, it doesn't seem to exist a simple way to customize the xml output without rewriting the xml log formatter altogether - is that right? I'd like to be able to specifiy the tag names used (TestSuite, TestLog, TestCase etc) for compatibility with an already existing log parser. It would be nice to have the current xml_log_formatter either providing overridable methods or a traits template parameter used for setting the tag names, e.g.: enum xml_log_tag_type { testsuite_tag, ... }; class xml_log_formatter { ... private: virtual const_string tag(xml_log_tag_type t) const; }; .. or ... struct default_xml_log_tag_provider { static const_string& tag(xml_log_tag_type t); }; template<typename TagProvider = default_xml_log_tag_provider> class xml_log_formatter { ... }; ---- // Johan

2 6

[Boost.Format] Assertion failure for empty strings in VS2005
by Daniel Krügler 19 Jun '06

19 Jun '06

Hello, Since introduction of VC 8, boost::format causes an assertion failure, if empty strings are provided as format arguments, e.g. std::string arg; boost::format frmt("%s"); // Alternatively use: "%1%" std::string res = (frmt % arg).str(); This defect is well known since end of 2005 (e.g. by Mick Hollins et al. in the thread "[Boost.Format] empty string argument causes VC 8.0 to assert" or by J.S.Otis in the thread "Assertion failure usign boost::format with Visual C++ 2005" The defect was well-analyzed by Caleb Epstein and I share his opinion, that this is due to a defect in boost::io::detail::mk_str, which provides a null pointer as argument to std::string::append, which violates its preconditions. The null pointer effectively is a result of some streambuf::pbase() call, which is allowed to return a null result under well-defined conditions. My question is: Has this error been fixed since then? Thanks in advance, Daniel Krügler

2 7

[regex] boost::match_any
by Andriy Tylychko (mail.ru) 19 Jun '06

19 Jun '06

Hi. Content = "abcab", expression = "a{1, 2}b?c" + "a{1, 2}b?c" (doubled pattern). I think the expression can be simplified even more. As you can see, there's only partial match, and boost::regex_search(content, m, expression, boost::match_partial); detects it. But boost::regex_search(content, m, expression, boost::match_partial | boost::match_any); doesn't detect it. I expected that boost::match_any doesn't affect the main result (found or not), but just can return different sub-results (where and what found). Can you please explain where I'm wrong? Environment: VC 8.0, boost 1.33.1. Best regards, Andriy Tylychko, <mailto:telya@mail.ru> telya(a)mail.ru

2 1

problem in multithreaded regex_replace on linux
by Ashish Varman 19 Jun '06

19 Jun '06

Hello all I am getting segmentation faults when we use our program in multithreaded mode on linux (RedHat 9). The same code runs flawlessly on windows. The crash always happens in boost::regex_replace. I had read the following posts on this topic: http://lists.boost.org/MailArchives/boost/msg59110.php and http://lists.boost.org/boost-users/2005/01/9712.php Accordingly, I've initialised all the regexes before the main working threads starts. I also came across the gcc string threading issue at http://gcc.gnu.org/bugzilla/show_bug.cgi?id=21334 and switched to STLport but to no avail. If anything, the crash happens much more quickly. Stack trace is as follows: Program received signal SIGSEGV, Segmentation fault. [Switching to Thread 1129827392 (LWP 3124)] 0x4013f843 in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > >, boost::match_results<wchar_t const*, stlp_std::allocator<boost::sub_match<wchar_t const*> > >, boost::regex_traits_wrapper<boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > > >::format_all() ( this=0x4357bcfc) at regex_format.hpp:133 133regex_format.hpp: No such file or directory. in regex_format.hpp (gdb) bt Thread 3 (Thread 1129827392 (LWP 3124)): #0 0x4013f843 in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > >, boost::match_results<wchar_t const*, stlp_std::allocator<boost::sub_match<wchar_t const*> > >, boost::regex_traits_wrapper<boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > > >::format_all() (this=0x4357bcfc) at regex_format.hpp:133 #1 0x4013f72c in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > >, boost::match_results<wchar_t const*, stlp_std::allocator<boost::sub_match<wchar_t const*> > >, boost::regex_traits_wrapper<boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > > >::format(wchar_t const*, wchar_t const*, boost::regex_constants::_match_flags) ( this=0x4357bcfc, p1=0x4357bdac, p2=0x4357bdc4, f=50331648) at regex_format.hpp:123 #2 0x4013f5bd in boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > > boost::re_detail::regex_format_imp<boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > >, wchar_t const*, stlp_std::allocator<boost::sub_match<wchar_t const*> >, wchar_t, boost::regex_traits_wrapper<boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > > >(boost::regex_traits_wrapper<boost::regex_traits<wchar_t, bo ost::cpp_regex_traits<wchar_t> > >, boost::match_results<wchar_t const*, stlp_std::allocator<boost::sub_match<wchar_t const*> > > const&, wchar_t const*, wchar_t, boost::regex_constants::_match_flags, boost::regex_traits_wrapper<boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > > const&) (out= {<iterator<stlp_std::output_iterator_tag,wchar_t,int,wchar_t*,wchar_t&>> = {<No data fields>}, out = 0x4357becc}, m=@0x80c3d70, p1=0x4357bdac, p2=0x4357bdc4, flags=50331648, t=@0x8077d48) at regex_format.hpp:569 #3 0x4013f28c in format<boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > >, boost::basic_regex<wchar_t, boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > > > (this=0x80c3d70, out= {<iterator<stlp_std::output_iterator_tag,wchar_t,int,wchar_t*,wchar_t&>> = {<No data fields>}, out = 0x4357becc}, fmt=@0x4357bdac, flags=50331648, re=@0x810eefc) at match_results.hpp:170 #4 0x4013ed6b in boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > > boost::regex_replace<boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > >, wchar_t const*, boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> >, wchar_t>(boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > >, wchar_t const*, boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > >, boost::basic_regex<wchar_t, boos t::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > > const&, boost::re_detail::string_out_iterator<stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > > const*, boost::regex_constants::_match_flags) (out= {<iterator<stlp_std::output_iterator_tag,wchar_t,int,wchar_t*,wchar_t&>> = {<No data fields>}, out = 0x4357becc}, first=0x4357bfdc, last=0x4357bff8, e=@0x810eefc, fmt=0x4357bf3c, flags=50331648) at regex_replace.hpp:53 #5 0x4013e123 in stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > boost::regex_replace<boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> >, wchar_t>(stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > const&, boost::basic_regex<wchar_t, boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > > const&, stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> > const, boost::regex_constants::_match_flags) ( s=@0x4357bfdc, e=@0x810eefc, fmt=@0x4357bf3c, flags=50331648) at regex_replace.hpp:96 #6 0x4013d9c5 in RegExRuleSet::ApplyRules(stlp_std::basic_string<wchar_t, stlp_std::char_traits<wchar_t>, stlp_std::allocator<wchar_t> >&) (this=0x807d93c, zrTok=@0x4357c12c) at common/utils/RuleApplier.cpp:192 #7 0x4014d42a in Transform1::PhonetizeAndSyllabify(stlp_std::vector<Item, stlp_std::allocator<Item> >&) (this=0x807d8e8, zrItems=@0x4188d448) at textProcessor/Transforms/Transform1/Transform1.cpp:620 #8 0x4014c0f9 in Transform1::Process(stlp_std::vector<Item, stlp_std::allocator<Item > >&) (this=0x807d8e8, zrItems=@0x4188d448) at textProcessor/Transforms/Transform1/Transform1.cpp:326 #9 0x4012f327 in Fragment::ProcessTransforms(int) (this=0x4188d448, zLangIndex=0) at common/shared/Fragment.cpp:187 #10 0x40119ef8 in Engine::ProcessFragment() (this=0x4357c50c) at main/Engine.cpp:64 #11 0x401110b4 in Input2Stage1(wchar_t const*, Engine&, int) ( zpText=0x80b9cb0, zrEngineObj=@0x4357c50c, zLangIndx=0) at main/InterfaceFunctions.cpp:137 #12 0x401039da in GetOutput (zpText=0x80b9cb0, zSamplingRate=16000, zBitRate=16, zTimeModFact=1, zPitchModFact=0, zpOutFileName=0x4357c60c "./buffer/Thread_1_Line_3.wav", zLangIndx=0, zOutput=WAVEFILE, zppWaveBuffer=0x0) at main/Interface.cpp:185 #13 0x08056ea4 in GetOutputer(void*) (zpThreadPara=0xbfffe5b0) at testing/MultiThreadedApp.cpp:194 #14 0x404da2b6 in start_thread () from /lib/tls/libpthread.so.0 The code fragment is as follows vector <Rule>::iterator yIterInRule = this->inclusiveRuleSet.begin(); for (; yIterInRule != inclusiveRuleSet.end(); yIterInRule++) { const boost::wregex &ySearchExp = yIterInRule->getSearchExpr(); yReplaceStr.assign(yIterInRule->getReplaceExpr()); if (yIterInRule->getContinousStatus() == false) { yInputStr = regex_replace(yInputStr,ySearchExp, yReplaceStr, boost::format_all | match_default | format_sed); } else { do { yInputStr = boost::regex_replace(yInputStr,ySearchExp, yReplaceStr, boost::format_all | match_default | format_sed); ystart = yInputStr.begin(); yend = yInputStr.end(); } while (boost::regex_search(ystart, yend,ySearchExp)); } // End Else }// end of inclusiveRuleSet for loop It crashes in any of the two regex_replace calls. OS is Red Hat Linux 9 The compiler is gcc-3.2.2 STLport is STLport-5.0.2 boost is boost_1_33_1 Crash happens only on multiprocessor machines. It would overcome a great roadblock if someone helps Thanks in advance Yours Sincerely Ashish Varman

2 1

hash table
by Brendan Miller 18 Jun '06

18 Jun '06

I was wondering if there's been any progress in adding hash tables to the boost library. Past posts, as long as two years ago, indicated that there was a good implementation available with standard interface, but it just hadn't been thrown in the official distribution yet. What's the holdup? You'd think hashtables would be the first thing to go into the library and not the last.

1 0

Newbie question: installation of property_tree.
by Thierry Dumont 17 Jun '06

17 Jun '06

I am trying to use "property_tree" library; as it is not yet included in the frozen distribution of boost on my Linux-Debian machine, I need to install it. Is it enough to copy the "property_tree" tree of the archive in /usr/include/boost ? Or do I need to compile something using bjam? I only see .hpp files in the distribution. Thank you in advance t.d. -- Thierry Dumont. Institut Camille Jordan -- Mathematiques-- Univ. Lyon I,43 Bd du 11 Novembre 1918, 69622 - Villeurbanne Cedex - France. Thierry.Dumont(a)maply.univ-lyon1.fr web: http://maply.univ-lyon1.fr/~tdumont

2 1

[Wave] advanced preprocessing hooks
by Andreas Sæbjørnsen 17 Jun '06

17 Jun '06

Hi, I have a question and a suggestion regarding Wave. First I have a problem when preprocessing the following file: #if 0 #elif 1 test #endif #if 1 #elif 0 int x; #endif The first '#elif' directive is registered as an 'evaluated_conditional_expression(...)', but the second '#elif' is never evaluated since the previous '#if' directive is true, and it is therefore not registered as either a 'skipped_token(...)' or an 'evaluated_conditional_expression(...)'. The way I expected it to work was to register it as a 'skipped_token(...)'. Do you have a suggestion to how I should otherwise be handling this? If not, could it be possible to add the non-evaluated '#elif' to the skipped token stream? The suggestion is for preprocessor generated tokens where the ' macro.get_position().get_file().size() == 0'. An example of this is in the following code #ifdef SOME_MACRO //DO SOMETHING #endif Since 'SOME_MACRO' is not defined the 'expanding_object_like_macro(TokenT const &macro,....)' will be passed a TokentT& const& macro with no position object, so asking for the line or column number will give a hard to debug segmentation fault. In order to detect this to avoid an error it is necessary to always ask for the size of the file as demonstrated above before asking for the line, file or column My suggestion is that alternatively a position object could be attached to 'macro', and a Boolean flag 'is_preprocessor_generated' could be used to find out if the position object is preprocessor generated or not. What do you think? Thanks Andreas

2 5

[pool] Problem with operator new[](std::size_t) and operator delete[]()
by Boris 17 Jun '06

17 Jun '06

I created a memory manager based on boost::pool and overloaded various operators like this: template <class T> class mem_manager { protected: static boost::pool<my_allocator> mem_pool; public: void *operator new(std::size_t) { return mem_pool.malloc(); } void operator delete(void *p) { mem_pool.free(p); } void *operator new(std::size_t, void *p) { return p; } void operator delete(void*, void*) { } void *operator new[](std::size_t size) { return mem_pool.ordered_malloc(size / sizeof(T)); } void operator delete[](void *p) { mem_pool.ordered_free(p); } }; Any class derived from mem_manager uses now its own boost::pool. While new and delete work fine there is a problem with new[] and delete[]. I haven't really investigated the problem yet because I'm not sure if I implemented these two operators correctly or if I understood ordered_malloc() and ordered_free() wrong. The documentation at http://www.boost.org/libs/pool/doc/interfaces/pool.html says something about merging free lists and preserving order with ordered_malloc(). Is this related to allocating an array? Or how shall I implement new[] and delete[] correctly? Boris

1 0

Re: [Boost-users] Trap in regex library (help requested)
by Marty Eaves 16 Jun '06

16 Jun '06

John, Thanks, I'll look into the STL compatibility. We were using STL port with VC6, but I think we are using the Microsoft STL with VC7. I'll double check. As far as test cases go, the regex string looks like this: "^(((((((((19)|(20)|(21)))){0,1}((((0)|(1)|(2)|(3)|(4)|(5)|(6)|(7)|(8)|( 9)))(((0)|(1)|(2)|(3)|(4)|(5)|(6)|(7)|(8)|(9))))){0,1}(((01)|(02)|(03)|( 04)|(05)|(06)|(07)|(08)|(09)|(10)|(11)|(12)))(((01)|(02)|(03)|(04)|(05)| (06)|(07)|(08)|(09)|(10)|(11)|(12)|(13)|(14)|(15)|(16)|(17)|(18)|(19)|(2 0)|(21)|(22)|(23)|(24)|(25)|(26)|(27)|(28)|(29)|(30)|(31)))))))" As back ground information, this string was generated from a SRGS date DTMF grammar. I am attempting to modify the code to try to determine which parts of the regex string where used in the match. This is necessary to implement support for the <tag> element in the SRGS grammar. I am looking into potentially trying to use "named groups" whenever a <tag> is encountered in the SRGS grammar as the "regex grammar" is getting generated. Thus I am starting to play with the extended match functionality. I have not modified any code yet, other than using the BOOST_REGEX_MATCH_EXTRA flag in user.hpp. This appears to cause the exception detailed in the call stack. The test case failing is using the above grammar with the value of into the "inputValue" parameter set to "2" in the code snippet below: else { // no termchar std::string tmpString; boost::match_results<std::string::const_iterator> what; try { boost::regex e(regex_grammar.c_str()); // return false for partial match, true for full match, or throw for // impossible match based on what we have so far... if(0 == boost::regex_match(inputData, what, e, boost::match_default | boost::match_partial | boost::match_extra)) { // the input so far could not possibly be valid so reject it: return SEQUENCE_NOMATCH; } } catch(...) { VXML_LOG::CLogBuff log(LOG_REC_SIZE,IVILOG_VXML_MODULE); log.WriteRecord("CDtmfGrammar_custom::check", // pTrm->GetLine(), 0, IVILOG_CLASS_TRACE, __FILE__,__LINE__, "Exception from Boost regex caught. Grammar = (%s)",regex_grammar.c_str()); return SEQUENCE_NOMATCH; } // OK so far so good, but have we finished? if(what[0].matched) { GRAMMAR_RETM_ITER iter=m_input_map.find(inputData.c_str()); if (iter != m_input_map.end()) { if(pResultValue) *pResultValue = (*iter).second; } else { if(pResultValue) { slotData = CDtmfGrammar::addWhiteSpaces(inputData); *pResultValue = slotData.c_str(); } } // excellent, we have a result: { boost::regex e(regex_grammar.c_str()); std::string newInput; bool matchOccurred = false; // loop thru 1 2 3 4 5 6 7 8 9 0 * # A B C D std::string charArray = "1234567890*#ABCD"; for(unsigned int x=0; x < charArray.length(); x++) { newInput = inputData + charArray.substr(x,1); if(0 != boost::regex_match(newInput, what, e, boost::match_default | boost::match_partial | boost::match_extra)) { matchOccurred = true; break; } } if(!matchOccurred) return SEQUENCE_OK; // we are done. } } // what we have so far is only a partial match... return SEQUENCE_MORE; } } ________________________________ 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. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of John Maddock Sent: Thursday, June 15, 2006 1:22 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Trap in regex library (help requested) Marty Eaves wrote: > 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. Just a clarification: you only need that define if you want extended capture information. You can access regular Perl style marked sub-expressions perfectly well without it. > 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? No none, if I'm reading your stack trace right it's std::vector that's causing the failure: there's nothing fancy going on inside sub_match just a scoped_ptr to a vector or sub_matches. Do you have a test case I can look at? If you're using managed code (looks like you are?) you might want to double check to see if there are any known issues using that with the STL. John. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users 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] mac/windows difference
by Hugh Hoover 16 Jun '06

16 Jun '06

I have a test program (boost::test) for a set of my application classes. When run on darwin (10.4.6, gcc4.01) the tests work correctly - that is, I can serialize the structure to an XML archive and read it back (actually, all 3 archive types). When I run the same test on windows (XP sp2, vc8), the read back of the XML archive fails very early because it apparently can't find an appropriate class to instantiate. When I look at the XML output, the windows version has a class name at the point where it fails, while the darwin version does not (there are NO class names written in the darwin archive). The code between darwin and windows is essentially the same - there aren't any differences in MY code in the serialization code. Several points: a) The topmost level is a pointer (plain) to an abstract class - the concrete subclass being serialized is very simple at this point. b) The specific class that's failing is from an STL map with pointers to an abstract base class. 1) That particular failing class is successfully tested prior to where it fails in the same test application (output to all archive types and read-back). 2) although it's using a different archive to test, initialization of all archives is identical (register_type and register_void_pointer called as appropriate) c) There is one other class that also gets serialized with a class name in addition to it's ID (I presume this means that something's up with class registration?) Ok - any suggestions on how to tackle this? I can't find anything wrong in the registration (i've walked through my part of the registration code in the debugger). I'm using boost 1.33.1 Thanks Hugh Hoover Enumclaw Software

3 3

Re: [Boost-users] [serialization-1.32.0] de-serializing newer versions that the application can deal with
by Tarjei Knapstad 16 Jun '06

16 Jun '06

[sorry for breaking the threading, just re-joined the list] > 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. Hi Russel, To handle different versions of data you should split serialize() into separate save()/load() functions as described in the tutorial: http://boost.org/libs/serialization/doc/tutorial.html#splitting The implementation will look something like: void save(...) { // Serialize all data here } void load(Archive & ar, unsigned int version) { if (version > 0) { // Load data added in version 1 } if (version > 1) { // Load data added in version 2 } // Load version 0 data } Regards, -- Tarjei

4 6

Boost.property_tree help
by Demetrius Cassidy 16 Jun '06

16 Jun '06

Reading the tutorial for property_tree, using the functions ptree.find, ptree.get and ptree.get_child, they will only return the topmost node, so if I had two different children nodes under my root named '<Logistics>' with different data within the children, I would only be able to access the first one. So my question is that how would I go about navigating to each top node under my root when they are all named the same? I basicly will have a file that looks something like this: XML file contents: <Technologies> <Logistics ID="Damage Diagnostics"> <DisplayName>Damage Diagnostics</DisplayName> <Cost>1500</Cost> <Description>Increases repair ability by 10%</Description> <RepairAbility>10</RepairAbility> <Requires>Advanced Starship Repair</Requires> <Category>Logistics</Category> <Model>lrgbuilding0</Model> <AIValue>30</AIValue> </Logistics> <Logistics ID="Basic Self-Repair"> /* I need to access this node */ <DisplayName>Basic Self-Repair</DisplayName> <Cost>3000</Cost> <Description>Increases repair ability by 10%</Description> <RepairAbility>10</RepairAbility> <Requires>Damage Diagnostics</Requires> <Category>Logistics</Category> <Model>controlgrav0</Model> <AIValue>40</AIValue> </Logistics> </Technologies> I will have a very large number of nodes with the same name under my root, but each will have different data in their children that I need to access. A full DOM parser is too much overhead when I do not need any validation, but rather I need to read a large number of configuration data across XML files. I really like the ease of use of this library, but I just can't figure this out. Any help would be greatly appreciated.

2 3

templatized constructor, destructor
by Gottlob Frege 16 Jun '06

16 Jun '06

Is there really no way to templatize a) a zero argument constructor b) a destructor ? I'm trying to delay the compile of the functions until everything is known... Tony

3 2

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

compiling boost shmem-0.93 on winxp with mingw-3.4.2
by christopher taylor 14 Jun '06

14 Jun '06

To the Boost-User community, I'm not sure if this is the right forum for this type of question so I'll probably take heat for posting this problem here...in any case, I've been having some build errors working with boost shmem-0.93 on winxp using mingw-3.4.2. Documentation states that shmem should compile on this platform but, I've discovered an interesting error with char_traits. In all shmem streams, I have problems with the type referencing of post_type - I'm getting this error: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' Below is the gcc output of my build error. Any help with this is greatly appreciated! Chris Taylor gcc ../../test/bufferstream_test.cpp -I/C/MinGW/include/boost-1_33_1 -L/C/MinGW/ libs -Wall -L-I/C/MinGW/include -L/C/MinGW/libs -lboost_thread-gcc-mt -I../../. ./.. -lstdc++ -o ../../bin/mingw/test_bufferstream_test.out c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/streambuf: I n instantiation of `std::basic_streambuf<wchar_t, std::char_traits<wchar_t> >': ../../../../boost/shmem/streams/bufferstream.hpp:56: instantiated from `boost: :shmem::basic_bufferbuf<wchar_t, std::char_traits<wchar_t> >' ../../test/bufferstream_test.cpp:9: instantiated from here c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/streambuf:13 5: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/streambuf:23 4: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/streambuf:23 9: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/streambuf:57 4: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/streambuf:58 6: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' ../../../../boost/shmem/streams/bufferstream.hpp: In instantiation of `boost::sh mem::basic_bufferbuf<wchar_t, std::char_traits<wchar_t> >': ../../test/bufferstream_test.cpp:9: instantiated from here ../../../../boost/shmem/streams/bufferstream.hpp:60: error: no type named `pos_t ype' in `struct std::char_traits<wchar_t>' ../../../../boost/shmem/streams/bufferstream.hpp:236: error: no type named `pos_ type' in `struct std::char_traits<wchar_t>' ../../../../boost/shmem/streams/bufferstream.hpp:301: error: no type named `pos_ type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/bits/basic_i os.h: In instantiation of `std::basic_ios<wchar_t, std::char_traits<wchar_t> >': c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/istream:60: instantiated from `std::basic_istream<wchar_t, std::char_traits<wchar_t> >' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/istream:706: instantiated from `std::basic_iostream<wchar_t, std::char_traits<wchar_t> >' ../../../../boost/shmem/streams/bufferstream.hpp:443: instantiated from `boost ::shmem::basic_bufferstream<wchar_t, std::char_traits<wchar_t> >' ../../test/bufferstream_test.cpp:11: instantiated from here c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/bits/basic_i os.h:67: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/istream: In instantiation of `std::basic_istream<wchar_t, std::char_traits<wchar_t> >': c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/istream:706: instantiated from `std::basic_iostream<wchar_t, std::char_traits<wchar_t> >' ../../../../boost/shmem/streams/bufferstream.hpp:443: instantiated from `boost ::shmem::basic_bufferstream<wchar_t, std::char_traits<wchar_t> >' ../../test/bufferstream_test.cpp:11: instantiated from here c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/istream:65: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/bits/istream .tcc:847: error: no type named `pos_type' in `class std::basic_istream<wchar_t, std::char_traits<wchar_t> >' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/bits/istream .tcc:865: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/ostream: In instantiation of `std::basic_ostream<wchar_t, std::char_traits<wchar_t> >': c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/istream:706: instantiated from `std::basic_iostream<wchar_t, std::char_traits<wchar_t> >' ../../../../boost/shmem/streams/bufferstream.hpp:443: instantiated from `boost ::shmem::basic_bufferstream<wchar_t, std::char_traits<wchar_t> >' ../../test/bufferstream_test.cpp:11: instantiated from here c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/ostream:64: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/bits/ostream .tcc:404: error: no type named `pos_type' in `class std::basic_ostream<wchar_t, std::char_traits<wchar_t> >' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/bits/ostream .tcc:420: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/istream: In instantiation of `std::basic_iostream<wchar_t, std::char_traits<wchar_t> >': ../../../../boost/shmem/streams/bufferstream.hpp:443: instantiated from `boost ::shmem::basic_bufferstream<wchar_t, std::char_traits<wchar_t> >' ../../test/bufferstream_test.cpp:11: instantiated from here c:/MinGW/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/istream:713: error: no type named `pos_type' in `struct std::char_traits<wchar_t>' ../../../../boost/shmem/streams/bufferstream.hpp: In instantiation of `boost::sh mem::basic_bufferstream<wchar_t, std::char_traits<wchar_t> >': ../../test/bufferstream_test.cpp:11: instantiated from here ../../../../boost/shmem/streams/bufferstream.hpp:448: error: no type named `pos_ type' in `class std::basic_ios<wchar_t, std::char_traits<wchar_t> >' ../../../../boost/shmem/streams/bufferstream.hpp: In instantiation of `boost::sh mem::basic_ibufferstream<wchar_t, std::char_traits<wchar_t> >': ../../test/bufferstream_test.cpp:13: instantiated from here ../../../../boost/shmem/streams/bufferstream.hpp:342: error: no type named `pos_ type' in `class std::basic_ios<wchar_t, std::char_traits<wchar_t> >' ../../../../boost/shmem/streams/bufferstream.hpp: In instantiation of `boost::sh mem::basic_obufferstream<wchar_t, std::char_traits<wchar_t> >': ../../test/bufferstream_test.cpp:15: instantiated from here ../../../../boost/shmem/streams/bufferstream.hpp:394: error: no type named `pos_ type' in `class std::basic_ios<wchar_t, std::char_traits<wchar_t> >' make: *** [../../bin/mingw/test_bufferstream_test.out] Error 1

3 3

Mingw 3.4.2 char_traits.hpp patch fixes shmem-0.93 build for winxp
by christopher taylor 14 Jun '06

14 Jun '06

to interested parties: i did some additional searching today and managed to find out that there is a bug in mingw's c++ include directory. to get shmem compiled for winxp using mingw, go into your equivalent to "/C/MinGW/include/c++/3.4.2/bits" open "char_traits.hpp" and comment out lines 309 and 311. The area, after commenting, should look like this: 309: //#if defined (_GLIBCXX_USE_WCHAR_T) 310: typedef wstreampos pos_type; 311: typedef mbstate_t state_type; 312: //#endif the define statement conflicts with a similar define statement that takes places at the begining of this template type's definition. after completing this simple patch, run the build script for mingw in the shmem 0.93 and try out the test programs, they should work at this point. the semi-notorious, "fixes error: no type named `pos_type' in `struct std::char_traits<wchar_t>'" error is gone. thanks to those parties that were looking into this issue and i hope this proves helpful for someone out there. chris taylor

2 1

[numeric] fit to numeric PODs
by alefor＠gmx.de 14 Jun '06

14 Jun '06

Hi, I'm parsing with Spirit strings of numeric values and want to guess the right POD that can fit all of them. For example, I see at glance sets with only 0.0 and 1.0, that can be optimized to a adjacent group of bool: 1. Or some doubles, in another set, which value ranges and resolution like shorts. Or if something like "0.000000000000000000000001" will fit exactly in my floats. I'm reading boost/lexical_cast , numeric/conversion and interval docs, but still don't found a way to convert strings to POD knowing if that cast is exact or not. Range check is there, but don't find a test telling me if that cast was exact. The 'exact' term here is what boost::numeric doc definitions chapter means. Thanks, alef -- Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer

1 0

Re: [Boost-users] Boost.Thread locking across two functions
by Moshe Matitya 14 Jun '06

14 Jun '06

On Fri, 09 Jun 2006 22:51:48 -0300, Peteris Krumins [Newsgroups] <pknewsgroups_at_[hidden]> wrote: > > Hello! > > I am using a library which itself internally does not use any thread > sync mechanisms but it provides callback functions > lib_lock() and lib_unlock() which I can specify if the lib is used in > multithread environment. > lib_lock() would get called before critical segment and after it > lib_unlock() would get called. > > I read Boost.Thread documentation and I understand that lock concept is > not thread-safe itself and should be used only at block scope. > This makes me think that I have no way to use locking provided by Boost > to acquire a lock in > lib_lock() function and release it in lib_unlock()? But I am not sure. > > Do you have any suggestions if this can be done using Boost? > > Thanks! > P.Krumins I don't think it was intended to be used this way, but you can accomplish what you want with the lock_ops<> class: mutex m; lib_lock() { boost::detail::thread::lock_ops<boost::mutex>::lock (m); } lib_unlock() { boost::detail::thread::lock_ops<boost::mutex>::unlock (m); } Moshe

1 0

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

14 Jun '06

> > Date: Tue, 13 Jun 2006 19:28:07 +0100 > From: "John Maddock" <john(a)johnmaddock.co.uk> > > What's wrong with: > > boost::alignment_of<unknown_struct>::value ? > > You can feed the result into type_with_alignment<> if that's what you want > as well. > > John. if unknown_struct is an incomplete type (which is what I meant, and should have said), alignment_of doesn't compile. Tony

4 5

boost::iostreams' zlib and writing multiple files
by Sascha Friedmann 14 Jun '06

14 Jun '06

Hello, how can I write/create an archive (gzlip or zlib) that contains multiple files. At the moment I can create only an archive which contains a file (named like the archive but ommitted the file-type) that contains my output. But what I need is to create an archive which contains multiple files. Is this even possible with the boost::iostreams framework? thanks Sascha

1 0

[installer] No test libraries?
by Johan Nilsson 14 Jun '06

14 Jun '06

Hi, is there any specific reason as for why the Boost.Test libraries aren't available for download in the installer? // Johan

3 4

Re: [Boost-users] Boost.Thread locking across two functions
by Moshe Matitya 14 Jun '06

14 Jun '06

On Fri, 09 Jun 2006 22:51:48 -0300, Peteris Krumins [Newsgroups] <pknewsgroups_at_[hidden]> wrote: > > Hello! > > I am using a library which itself internally does not use any thread > sync mechanisms but it provides callback functions > lib_lock() and lib_unlock() which I can specify if the lib is used in > multithread environment. > lib_lock() would get called before critical segment and after it > lib_unlock() would get called. > > I read Boost.Thread documentation and I understand that lock concept is > not thread-safe itself and should be used only at block scope. > This makes me think that I have no way to use locking provided by Boost > to acquire a lock in > lib_lock() function and release it in lib_unlock()? But I am not sure. > > Do you have any suggestions if this can be done using Boost? > > Thanks! > P.Krumins I don't think it was intended to be used this way, but you can accomplish what you want with the lock_ops<> class: mutex m; lib_lock() { boost::detail::thread::lock_ops<boost::mutex>::lock (m); } lib_unlock() { boost::detail::thread::lock_ops<boost::mutex>::unlock (m); } Moshe

1 0

[test] Output log file name
by Johan Nilsson 14 Jun '06

14 Jun '06

Hi, I'm using the Boost.Test (unit test framework) from cvs, trying to get xml output redirected into files. The xml format itself is not a problem, but I can't find any options to get the output into files. Is this possible to do using either command-line arguments or environment variables? It's possible, but awkard, to use unit_test_log::set_stream, but I figured I'd check if there were any options before implementing that. / Johan

3 8

n3wb question: Compiling boost::python "hello world" demo
by Salim Fadhley 13 Jun '06

13 Jun '06

I'm an experienced python developer, but unfortunately a ten-years out of practice C++ developer. For a future project I was hoping to play with Boost.python as a means of speeding up some calculations that were very tedious in python. For starters I wanted to get the "hello.cpp" demo compiling, but I am failing almost at step one. For starters in this file I am supposed to set the BOOST_ROOT: http://www.boost.org/libs/python/example/tutorial/Jamrules However I am not 100% sure that the operating system (Gentoo Linux) even installed the files in the right area. Is there a particular file that is allways going to be in the "BOOST ROOT", that way I will know for certain what to run. Next I am supposed to set up some environment variables. The instructions provided are for Windows only and say: " Make sure that the environment is set so that we can invoke the C++ compiler. With MSVC, that would mean running the Vcvars32.bat batch file. For instance:" Is there a Linux equivalent? Next I am told to use "bjam" to do the actual build. The instructions are once again very windows-centric: "bjam -sTOOLS=vc-7_1" What might be the corresponding syntax for users of GNU C++? Thanks! Sal

3 4

type_with_alignment<5> ?
by Gottlob Frege 13 Jun '06

13 Jun '06

I'd like type_with_alignment<> to handle sizes between 'true' alignments, and/or have a way to map 'in bwetween' alignments to their lower alignment. ie I have a struct of unknown type, but known size = 5. What is it's alignment? You could 'punt' and say max_align, but I suggest that its alignment is <= 5 (ie probably 4 for a typical platform). ie imagine that the struct might have an int as it's first member, but can't have a double (assuming sizeof(double) > 5), so the alignment might need to be alignment_of<int>, but can't be alignment_of<double>. Does this assumption hold true? So how can I map (at compile time) an integer 'n' to the closest 'x' <= n where x is from the set S, and where S is the set of possible alignments? Tony

2 1

Re: [Boost-users] [boost.multi_array] Best use of memory
by Ronald Garcia 13 Jun '06

13 Jun '06

Hello Sebastien, Ideally, you should be able to work with an array of doubles, rather than an array of pointers to double. I can create an multi_array with the dimensions you mention. To answer your questions, multi_array uses a standard library allocator to allocate a contiguous block of memory in which to hold the array data. I'm afraid I do not know why you cannot exceed these limits. ron > I'm currently using multi_array to represent 3D matrices of doubles, I > was wondering which would be the best use since the array has to > hold a > very large amount of data. I' currently testing whith a multi_array of > 800x800x100 to hold double or pointers to double and I have memory > problems. When I declare the multi_array whith pointers to doubles > I can > usually go up to 775x775x100 without problems but when I try the same > thing with a multi_array of doubles I get a bad alloc error. My real > needs for the moment are for a multi_array of 800x600x57 but I will > need > bigger storage capacity in the near future, what are your sugesstions. > Is the multi_array a pointer itself? > How is memory management handled? > How can go beyond these limits? > > > > -- > Sébastien Fortier

2 1

[Tokenizer] Separate by multiple characters?
by Stian Karlsen 13 Jun '06

13 Jun '06

Hi. Can the Boost Tokenizer be used to split a string with a delimiter of several characters? With this I mean that the delimiter ";;" would split ("12;3;;45") into ("12;3","45"). I can't find functions etc for this in the documentation and the examples. Is there any other class that does this easily? Best Regards, Stian

2 1

how to turn on multiline option of boost::regex_search() algorithm
by Renjie Zhao 13 Jun '06

13 Jun '06

Can any one tell me how to specify "Multiline" search while using regex? e.g. std::string fb; // fb stores a fragment of html code, multiline; boost::regex pattern("</tr>\r\n</table>\r\n</td>\r\n</tr>\r\n</table>\r\n</td>\r\n</tr>\r\n</table>"); boost::smatch res; boost::match_flag_type flags = boost::match_default; std::string::const_iterator s , e; s = fb.begin(); e = fb.end(); if(boost::regex_search(s, e, res, pattern, flags)) { //process the match. } else { //I am always here } When I use some other regex tools to check the same target string and match pattern string, I always get the right thing as expected. How can I alter the option of boost::regex_search to satisfy the original request? thanks -- This is my Very Signature. Ha, pretty good?

3 4

Link options(TO DALE MCCOY)
by umut tabak 13 Jun '06

13 Jun '06

Dear, Sorry for replying to a specific person since the reply link is not operational for me(at least). g++ -c -I/usr/local/include/boost-1_33_1 filename.cc -c option only creates the linkable object file(correct me if I am mistaken so you have link some libraries to get the proper exe file(I am under XP now)) but -c option does not call the linker. I have chosen both boost and boost devel packages for install under Cygwin. I was using the same code under linux with the following link options g++ -g -o filename filename.cc -I/usr/local/opt/boost_1_33_1/include/boost-1_33_1/ -L/usr/local/opt/boost-1_33_1/lib -lboost_filesystem-gcc So I was linking to the boost_filesystem-gcc library. I tried the same but it gave errors, Regards,

1 0

bjam under cygwin/XP
by Janos Vegh 13 Jun '06

13 Jun '06

Hi, I am trying to use bjam, through building a 'hello' project. However, I receive the following: $ bjam Unable to load Boost.Build: could not find build system. --------------------------------------------------------- C:\cygwin\home\Veghj\projects\hello\boost-build.jam attempted to load the build system by invoking 'boost-build /cygdrive/c/veghj/projects/boost_1_33_1/tools/build/v2 ;' but we were unable to find "bootstrap.jam" in the specified directory or in BOOST_BUILD_PATH (searching /cygdrive/c/veghj/projects/boost_1_33_1/tools/ build/v2). Please consult the documentation at 'http://www.boost.org'. At the same time, the requested file is apparently there: $ ls /cygdrive/c/veghj/projects/boost_1_33_1/tools/build/v2 boost-build.jam example release_procedure.txt boost.css generators_prototype.py roll.sh bootstrap.jam hacking.txt site-config.jam build index.html test build-system.jam kernel tools changes.txt nightly.sh user-config.jam debian notes util doc options What do I wrong? Thanks for any help Janos

3 4

Linking with the appropriate library component
by Umut TABAK 13 Jun '06

13 Jun '06

Dear all, I have tried to install boost by the packages that are supplied as a part of Cygwin which kept me doing a lot of work. Anyway, to test the library(lexical_cast) I have a very simple code, for the moment I can compile the file and the .o file is succesfully written, but in the link process I could not figure out which library and/or options I have to use. I have the obj file but can not produce an exe file. I used g++ -c -I"C:\cygwin\usr\local\include\boost-1_33_1\boost" filename.cc and filename.o is in the directory. Can somebody share his/her ideas with me. Best regards, Umut

3 2

Compilers supported by a given library
by Edward Diener 13 Jun '06

13 Jun '06

Is there any central place in the Boost documentation which tells, for any given release, or even just for the latest release, which compilers are supported by a given library ? I ask this because attempting to build a particular library in Boost 1.33.1 for a particular compiler failed, and I could see no place where I could determine whether that Boost library was actually meant to support the particular compiler or not in the 1.33.1 implementation.

5 10

[BGL] Betweenness Centrality Clustering
by Rui Carvalho 12 Jun '06

12 Jun '06

Hello, I'm trying to implement the algorithm in the paper below and I'd like to know if I need to do it myself, or whether it has been implemented as part of the BGL as 'Betweenness Centrality Clustering'. Could someone help, please. I just don't want to reinvent the wheel. Cheers, Rui > -----Original Message----- > From: Rui Carvalho [mailto:rui.carvalho@ucl.ac.uk] > Sent: 07 June 2006 23:48 > To: 'boost-users(a)lists.boost.org' > Subject: [BGL] Betweenness Centrality Clustering > > Hi, > > Is the BGL betweenness centrality clustering algorithm an implementation of: > > Community structure in social and biological networks > M. Girvan and M. E. J. Newman > Proc. Natl. Acad. Sci. USA 99, 7821-7826 (2002). > http://aps.arxiv.org/PS_cache/cond-mat/pdf/0112/0112110.pdf > > thanks, > Rui

1 0

gzseek equivalent in boost::iostreams with bzip2/gzip?
by Hin-Tak Leung 12 Jun '06

12 Jun '06

What I would like to do is to skip over part of a gzip'ed input, in a manner similiar to calling gzseek() in C, but I don't seem to be able to do that. Since it is possible to do it in C (somewhat slowly and there is no bzseek), I was thinking of something similiar to: namespace boost_io = boost::iostreams; boost_io::filtering_istream *instr = new boost_io::filtering_istream(); /* one of these two */ //instr->push(boost_io::gzip_decompressor()); instr->push(boost_io::bzip2_decompressor()); instr->push(boost_io::file_source(m_FileName.c_str(), std::ios::in | std::ios::binary)); // skip the header //instr->seekg(boost_io::offset_to_position(m_iHeaderBytes), std::ios_base::beg); instr->seekg(boost_io::offset_to_position(m_iHeaderBytes)); int32_t datasize = BUFFER_ZIZE; m_lpData = new char[datasize]; std::cout << "position before:\t " << instr->tellg() << std::endl; instr->read(m_lpData, datasize); std::cout << "position after:\t " << instr->tellg() << std::endl; But I tellg() returns 0 and datasize without the push::decompressor, and -1/-1 when the decompressor is pushed. Am I doing something wrong? I know streams aren't really seekable, but I was hoping that there is a poorman's seek (like gzseek - which is essentially read and throw-away) that's implementable. The incentive - is to have transparent decompression of input in some legacy code - I don't really want to modify every read to gzread, or bzread, for example... Thanks a lot. Hin-Tak Leung Send instant messages to your online friends http://uk.messenger.yahoo.com

1 0

Re: [Boost-users] [boost.multi_array] Best use of memory
by Sohail Somani 12 Jun '06

12 Jun '06

Well if its contiguous, that's your problem. Likely it just can't allocate that much contiguous memory. > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Ronald Garcia > Sent: Monday, June 12, 2006 11:02 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [boost.multi_array] Best use of memory > > > Hello Sebastien, > > Ideally, you should be able to work with an array of doubles, > rather than an array of pointers to double. I can create an > multi_array with the dimensions you mention. > > To answer your questions, multi_array uses a standard library > allocator to allocate a contiguous block of memory in which > to hold the array data. I'm afraid I do not know why you > cannot exceed these limits. > > ron > > > > > I'm currently using multi_array to represent 3D > matrices of doubles, I > was wondering which would be the best use since the > array has to hold a > very large amount of data. I' currently testing whith a > multi_array of > 800x800x100 to hold double or pointers to double and I > have memory > problems. When I declare the multi_array whith pointers > to doubles I can > usually go up to 775x775x100 without problems but when > I try the same > thing with a multi_array of doubles I get a bad alloc > error. My real > needs for the moment are for a multi_array of > 800x600x57 but I will need > bigger storage capacity in the near future, what are > your sugesstions. > > Is the multi_array a pointer itself? > How is memory management handled? > How can go beyond these limits? > > > > > -- > Sébastien Fortier > > >

1 0

problem with regex library
by Renjie Zhao 12 Jun '06

12 Jun '06

After downloading boost_1_33_1, I succeeded in building regex lib with both VC8 and GCC 3.4.2(mingw special) 1st: The following code, which is compiled ok using VC8 (cl a.cpp/I"F:\boost_1_33_1" /EHsc), gives out wrong answer. Well I think the answer is wrong. Do I misunderstand the regular expression? It says"no match" while it is supposed to match twice. 01234 and 56972. If I changes the regex expr to ".*", the code functions well and gives out: The (0) match is:01234abcd56972 //==================CODE================ #include <string> #include <boost\regex.hpp> #include <iostream> using namespace std; using namespace boost; regex expr("([0-9]+)"); const char *src = "01234abcd56972"; int main(int argc, char *argv[]) { cmatch m; if(regex_match(src, m, expr)) { for(int i = 0; i < m.size(); ++i) { string msg; msg.assign(m[i].first, m[i].second); cout<<"The ("<< i <<") match is:"<<msg<<endl; } } else { cout<<"no match"; } cout<<endl; return 0; } //=================CODE================== What is the problem? Checking the same target string "01234abcd56972" and pattern "([0-9]+)", I get the expected result. Why? 2nd: I got a lot of error messages when I tried to compile the same piece of code with GCC 3.4.2 (mingw-special) under windows 2003 and GCC 4.1.0-3 (shipped with Fedora Core 5) under Linux. The previous work using Boost::regex is to build the lib, under windows and linux, the work is done with no error. ------------------error message under windows:------------------------- F:\projects> g++ a.cpp -I"F:\boost_1_33_1" -o a.exe C:\DOCUME~1\ADMINI~1\LOCALS~1\Temp/cccPaaaa.o(.text$_ZN5boost11regex_matchIPKcSa INS_9sub_matchIS2_EEEcNS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEEEbT_SA_RNS_ 13match_resultsISA_T0_EERKNS_11basic_regexIT1_T2_EENS_15regex_constants12_match_ flagsE[bool boost::regex_match<char const*, std::allocator<boost::sub_match<char const*> >, char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >(ch ar const*, char const*, boost::match_results<char const*, std::allocator<boost:: sub_match<char const*> > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags)] +0x9a):reg.cpp: undefined reference to `boost::re_detail::perl_matcher<char cons t*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, bo ost::cpp_regex_traits<char> > >::match()' C:\DOCUME~1\ADMINI~1\LOCALS~1\Temp/cccPaaaa.o(.text$_ZN5boost9re_detail12perl_ma tcherIPKcSaINS_9sub_matchIS3_EEENS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEEC 1ES3_S3_RNS_13match_resultsIS3_S6_EERKNS_11basic_regexIcSA_EENS_15regex_constant s12_match_flagsES3_[boost::re_detail::perl_matcher<char const*, std::allocator<b oost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_trait s<char> > >::perl_matcher(char const*, char const*, boost::match_results<char co nst*, std::allocator<boost::sub_match<char const*> > >&, boost::basic_regex<char , boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::reg ex_constants::_match_flags, char const*)]+0xec):reg.cpp: undefined reference to `boost::re_detail::perl_matcher<char const*, std::allocator<boost::sub_match<cha r const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::constr uct_init(boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_tra its<char> > > const&, boost::regex_constants::_match_flags)' C:\DOCUME~1\ADMINI~1\LOCALS~1\Temp/cccPaaaa.o(.text$_ZN5boost11basic_regexIcNS_1 2regex_traitsIcNS_16cpp_regex_traitsIcEEEEE6assignEPKcS7_j[boost::basic_regex<ch ar, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char con st*, char const*, unsigned int)]+0x22):reg.cpp: undefined reference to `boost::b asic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do _assign(char const*, char const*, unsigned int)' collect2: ld returned 1 exit status ------------------error message under Linux:------------------------- [root@FC5 project]g++ a.cpp -I"/usr/include" -o a.o /tmp/cczdwrqd.o: In function `boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char const*, char const*, unsigned int)':reg.cpp:(.text._ZN5boost11basic_regexIcNS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEE6assignEPKcS7_j[boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char const*, char const*, unsigned int)]+0x22)：undefined referrence to'boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign(char const*, char const*, unsigned int)' /tmp/cczdwrqd.o: In function `boost::re_detail::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::perl_matcher(char const*, char const*, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags, char const*)':reg.cpp:(.text._ZN5boost9re_detail12perl_matcherIPKcSaINS_9sub_matchIS3_EEENS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEEC1ES3_S3_RNS_13match_resultsIS3_S6_EERKNS_11basic_regexIcSA_EENS_15regex_constants12_match_flagsES3_[boost::re_detail::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::perl_matcher(char const*, char const*, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags, char const*)]+0xa5)：undefined reference to'boost::re_detail::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::construct_init(boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags)' /tmp/cczdwrqd.o: In function `bool boost::regex_match<char const*, std::allocator<boost::sub_match<char const*> >, char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >(char const*, char const*, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags)':reg.cpp:(.text._ZN5boost11regex_matchIPKcSaINS_9sub_matchIS2_EEEcNS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEEEbT_SA_RNS_13match_resultsISA_T0_EERKNS_11basic_regexIT1_T2_EENS_15regex_constants12_match_flagsE[bool boost::regex_match<char const*, std::allocator<boost::sub_match<char const*> >, char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >(char const*, char const*, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags)]+0x46)：undefined reference to'boost::re_detail::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::match()' collect2: ld returns 1 Can some help me? Although I know the question above may seem stupid and easy to solve. //Thanks -- This is my Very Signature. Ha, pretty good?

2 1

Green Hills Integrity and boost?
by Brian Neal 12 Jun '06

12 Jun '06

We have successfully used several boost libraries on our real-time embedded system that runs under one of the real-time Linux variants. We are going to continue the development of this program under the Green Hills Integrity environment (it wasn't my decision ;-) ). Has anyone used boost under this environment before? I understand they have their own C++ compiler which uses the EDG front end, and their OS calls have POSIX interfaces, but that's all I really know. Thanks for sharing any experiences.

1 0

Re: [Boost-users] mpl::accumulate
by Ovanes Markarian 12 Jun '06

12 Jun '06

Hello, can someone tell me what exactly a parameter State in the mpl::accumulate means. After the evaluation is finished, which type is returned by accumulate? State? Which types are passed to the binary ForwardOp? I do not exactly understand this example: typedef vector<long,float,short,double,float,long,long double> types; typedef accumulate< types , int_<0> , if_< is_float<_2>,next<_1>,_1 > >::type number_of_floats; With Kind Regards, Ovanes Markarian

2 1

Re: [Boost-users] [asio] ASIO Questions
by Scott 12 Jun '06

12 Jun '06

> Try the boost devel mailing list > (gmane.comp.lib.boost.devel). ASIO questions there appear to > get answered very quickly. At some point I assume they will > be answered quickly here too. > > PS, I believe there are SSL tutorials for ASIO... but you > probably already knew that. :) Thanks for the info. On the contrary, if there are SSL tutorials for ASIO I have not been able to find them in the docs. The best I found were two undocumented files (client.cpp/server.cpp) that demonstrate creating an SSL connection with ASIO. But I have more questions than those 2 files can answer. I'll try the boost developers list. Thanks.

1 0

[python] call f(shared_ptr<const A>) with shared_ptr<A>?
by Malte Clasen 12 Jun '06

12 Jun '06

Hi, I usually use shared_ptrs to const as function parameters, such as boost::shared_ptr<const A>, to explicitly state that this function does not modify the pointee. Now I'm trying to do the same in boost.python: ----- C++ class A {}; void testA(boost::shared_ptr<A> s) {} void testAc(boost::shared_ptr<const A> s) {} void register() { class_<A, boost::shared_ptr<A> >("A") def("testA", testA); def("testAc", testAc); } void testCPP() { boost::shared_ptr<A> a(new A()); testA(a); testAc(a); } ----- Python a = A() testA(a) testAc(a) ----- The c++ part compiles and runs just fine, but the python call to testAc() fails with the following error message: ----- testAc(a) ArgumentError: Python argument types in _Map.testAc(A) did not match C++ signature: testAc(class boost::shared_ptr<class Map::A const >) ----- Is there a way to use the automatic conversion from A to const A in boost.python? Malte

2 1

mfc applications must not include <windows.h>
by Silvester 12 Jun '06

12 Jun '06

How can i use spirit within a MFC-application? VC7.1 complains about the inclusion of <windows.h> when I include "boost/spirit.hpp" and refuses any further compilation.

4 3

Boost compile and link problem
by Umut TABAK 12 Jun '06

12 Jun '06

Dear all, I have built boost under windows by using Cygwin and the usual configure, make, make install approach and for the gcc toolset I think this was the default one so that I have not done any configuration changes.(however i got a message that not all boost libraries are not properly installed.) I am trying to compile a very simple program to see whether things are going fine or not, (Since I have a program which is actually written under LINUX by using boost library, I have to port that to windows for a small project.) I am using the cygwin command line tool . I am supplying the include file directories for include options(-I/usr/local/include/boost-1_33_1/boost/ since I use Cygwin) but I do not know what to supply for link options(I was supplying "-L/usr/local/opt/boost-1_33_1/ lib -lboost_filesystem-gcc" under linux but did not work for windows, I have changed the path to proper values.) I have check the libboost_... under libs/ but confused me more. I am quite new to library build and compilation and linkage with the library(at least under windows since under linux pre-built packages are easily downloaded by an apt-get), maybe I am mistaken at some points above, but I appreciate advice and help. Have fun, UMUT

2 1

[asio] ASIO Questions
by Scott 12 Jun '06

12 Jun '06

Is this the proper forum to ask about ASIO and SSL usage? Or is there another mailing list for ASIO somewhere? Thanks, Scott

2 1

Fwd: Using numeric::ublas::matrix<...> class with NR algorithms
by Haroon Khan 12 Jun '06

12 Jun '06

Has anyone used the ublas::matrix and vector classes with the algorithms given in Numerical Recipes for C++? In other words are the ublas::matrix class and the nr::Matrix class equivalent (support the same interface) or will the algorithms require some tweaking? Haroon

1 0

Boost under Windows
by Umut TABAK 11 Jun '06

11 Jun '06

Dear all, Can somebody provide the detailed steps to build and set up boost running under Windows for MSVC. I have used boost under Linux(Ubuntu) where the installation is just an easy apt-get there. But I could not do it under Windows. I tried the steps in the getting started guide. But I think I missed something so your help is very much appreciated. Best Regards, Umut

2 1

[shmem-interprocess] Shmem 0.93 and update on Interprocess
by Ion Gaztañaga 10 Jun '06

10 Jun '06

Hi to all, I've just uploaded to Boost Vault a new Shmem bugfix version (0.93) with bugfixes to make Shmem MinGw friendly (props to Jan Stetka). Library and documentation download: http://boost-consulting.com/vault/index.php?&direction=0&order=&directory=M… Online documentation: http://ice.prohosting.com/newfunk/boost/libs/shmem/ //////////////////////////////////////////////////////////// Update on Interprocess: -> Due to Shmem problems with shared memory/named mutex/name semaphore lifetime between POSIX/Windows. I've decided to change Shmem approach (emulation of Windows lifetime behavior in POSIX with reference counting) to a POSIX lifetime (explicit unlinking shared memory). This means that I have to rework all main classes to achieve POSIX persistence semantics in Windows even when a process crashes. This will require using memory mapped files to emulate shared memory (with some tricks to avoid performance problems with file-memory synchronization if it's possible). I think that this approach will be much more portable than the Shmem approach. -> I'm also experimenting with a new allocator with expand-in place capabilities to allow realloc-like features in shared memory containers. The first results are encouraging both in size savings and speed improvements. This expand in place features are based on a paper I plan to present as a ISO C++ proposal based on N1953. You can find the current draft here, if you want to make some comments: http://ice.prohosting.com/newfunk/proposals/nXXXX%20Improving%20STL%20Alloc… -> I'm also experimenting with a new reduced mutex interface (basically condensing shared_mutex, shared_try_mutex and shared_timed_mutex in a single interprocess_mutex type. Something in the line of the draft "Simplifying And Extending Mutex and Scoped Lock Types For C++ Multi-Threading Library" that you can find here: http://ice.prohosting.com/newfunk/proposals/ I'm also trying to implement a process-shared version of Howard Hinnant's upgradable_mutex class described here: http://home.twcny.rr.com/hinnant/cpp_extensions/rw_perf.html http://home.twcny.rr.com/hinnant/cpp_extensions/threads_move.html I still have some bugs in my upgradable_mutex implementation that I plan to solve soon. I think that this enhazed rw mutex is a winner for Interprocess. -> I'm adding a new mutex type: file_lock. The classic UNIX fcntl / Windows FileLockEx file locking is an interesting addition to Interprocess since both in POSIX and Windows, the lock is automatically unlocked by the OS when the process ends/crashes. This can help problematic Shmem atomic creation+initialization functions if the process crashes executing the atomic code. File locking is also many times easier to use than named mutexes or shared memory + process shared mutexes, specially for simple locking. That's all. Thanks for your patience! Regards, Ion

1 0

[Boost.Python] Extracting indirect base.
by Sebastian Redl 10 Jun '06

10 Jun '06

(No luck on C++-sig - is that list even active? There's absolutely no traffic, not one mail in two days. Anyway, trying again here.) Hi, I've got a hand-wrapped plugin interface hierarchy for my program allowing implementing plugins in Python. This looks approximately like this: class Plugin { public: virtual void init() = 0; virtual PluginCategory getCategory() = 0; // Subtype of the plugin // ... }; class InputPlugin : public Plugin { public: virtual void loadData(const string &resource, DataBag &target) = 0; }; class OutputPlugin : public Plugin { public: virtual void saveData(const string &resource, const DataBag &source) = 0; }; These are the plugin interfaces. PluginCategory is an enum identifying the concrete subtype of the plugin, i.e. either Input or Output. I've got them wrapped like this: class PluginWrap : public Plugin, public boost::python::wrapper<Plugin> { virtual void init() { this->get_override("init")(); } // ... }; class InputPlugin : public InputPlugin, public boost::python::wrapper<InputPlugin> { virtual void loadData(...) { ... } }; // ... BOOST_PYTHON_MODULE(myprogram) { class_<PluginWrap, boost::noncopyable>("Plugin") .def("init", pure_virtual(&Plugin::init)) .def( ... ) ; class_<InputPluginWrap, bases<PluginWrap>, boost::noncopyable>("InputPlugin") .def("loadData", ...) ; // ... } A plugin file looks like this: from myprogram import * class SomePlugin(InputPlugin): def init(self): // ... // ... plugins = [SomePlugin()] I then attempt to load these modules like this: PythonLoader::load(const path &file) { // Parse file and get namespace object for it. Get the "plugins" list and extract a python::list. Get the length of that list. python::list plugs = ...; int len = // get length of plugs for(int i = 0; i < len; ++i) { try { py::object plug = plugs[i]; Plugin *plugin = py::extract<Plugin *>(plug); // <------------- plugins.push_back(plugin); } catch(py::error_already_set &e) { // handle error } } } Finally, my problem: the extract<Plugin*> call fails: TypeError: No registered converter was able to extract a C++ pointer to type Plugin from this Python object of type SomePlugin So here are my questions: 1) Is this expected behaviour? Does my wrapping not register the appropriate base pointer extractors? 2) How can I manually register appropriate converters? 3) If 2 is not possible, how can I work around the problem? Thanks in advance Sebastian Redl

1 0

BJAM : tracking dependencies
by __PPS__ 10 Jun '06

10 Jun '06

Hello ppl I have some questions about the way bjam implements dependencies tracking. I need a tool that would do this for a project that uses gcc. (it doesn't use gmake and not entire gnu toolset is available) does bjam by iteself parses all the source files, looking for incldues and then parses them to see any updates, or gcc does it? by the way I downloaded bjam sources and wanted to build it and on one machine it gave me absolutely weird results (compilation went fine, but on linking I saw some strange output with strings from registry): ... Compiling... order.c Generating Code... Microsoft (R) Incremental Linker Version 8.00.50727.42 Copyright (C) Microsoft Corporation. All rights reserved. [HKEY_CLASSES_ROOT\Directory\shell\Command Prompt Here] Settings\Temp\deleteme.r eg "@=Command &Prompt Here" Settings\Temp\deleteme.reg [HKEY_CLASSES_ROOT\Directory\shell\Command Prompt Here\command] Settings\Temp\de leteme.reg "@=cmd.exe /k cd %1 " Settings\Temp\deleteme.reg LINK : fatal error LNK1181: cannot open input file '[HKEY_CLASSES_ROOT\Directory \shell\Command.obj' C:\PAVEL\gnu_tools\tools\build\jam_src> Same shit happend with vs71

2 1

Re: [Boost-users] Help with Tokenizer
by David Klein 09 Jun '06

09 Jun '06

boost-users-bounces(a)lists.boost.org wrote: > I have a string that is delimited with '|' that I want to > parse with boost::tokenizer. > > ie: "label 1|label2||label 3" > > It all parses ok except that the whitespace within the label > is removed. > > Is there a way to configure the tokenizer to leave whitespace alone? > > Thanks > Frank > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users hi frank, the following snippet works for me (winxp, vc71, boost 1.33.1): typedef boost::char_separator<char> separator_type; string s("label 1|label2||label 3"); boost::tokenizer<separator_type> t(s, separator_type("|")); copy(t.begin(), t.end(), ostream_iterator<string>(cout, "\n")); output: label 1 label2 label 3 HTH dave

2 1

Help with Tokenizer
by Frank 09 Jun '06

09 Jun '06

I have a string that is delimited with '|' that I want to parse with boost::tokenizer. ie: "label 1|label2||label 3" It all parses ok except that the whitespace within the label is removed. Is there a way to configure the tokenizer to leave whitespace alone? Thanks Frank

2 2

[test] BOOST_CHECK_NOT_EQUAL?
by Ed Johnson 09 Jun '06

09 Jun '06

Hi, Is there a way to get the funcationality of BOOST_CHECK_EQUAL when I want to test that two parameters are not equal to each other? I like the way BOOST_CHECK_EQUAL allow me to see the mismatched runtime values. I have been creating a custom message for BOOST_CHECK_MESSAGE to achieve this functionality, but it would be nicer if there was an automated way to do it. Thanks, Ed Johnson

4 11

[Review][PQS] Review ends
by fred bertsch 09 Jun '06

09 Jun '06

Hello, boosters! Any given day exists for 50 hours, but it does end at some point. Likewise, the PQS review ends at some point. I will arbitrarily say midnight UTC and the timezone of the author. However, it will take me roughly a week to collate all of the reviews and reach an official decision, so don't feel shy about posting or mailing me additional reviews. I thank the reviewers very much for reviewing the library, and I thank Andy Little even more for all of his work responding to the reviews and for writing the library in the first place! -Fred Bertsch

1 0

Problem with serialization of shared_ptr (with example code)
by Tim Taylor 09 Jun '06

09 Jun '06

Hi, I am having some troubles with serialization of shared_ptrs. The basic problem is that when I serialize a shared_ptr, then later deserialize into a new shared_ptr, the use_count of the new pointer is, incorrectly (as far as I can see), 2 rather than 1. I am using boost 1.33.1 and gcc 4.0.1. Here is some example code to demonstrate the problem: ----- // compile with: // gcc -o ptrser-test ptrser-test.cpp -lstdc++ -lboost_serialization-gcc #include <iostream> #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/shared_ptr.hpp> using namespace std; using namespace boost; class Item { public: // Constructors/destructor-------------------------- Item(int n = 0) : _n(n) { cout << "In Item constructor" << endl; }; Item(const Item& other) { cout << "In Item copy constructor" << endl; _n = other._n; }; ~Item() { cout << "In Item destructor" << endl; }; // Data members------------------------------------- int _n; // Methods------------------------------------------ friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar & _n; } }; class Bag { public: // Constructors/destructor-------------------------- Bag() { cout << "In Bag default constructor" << endl; }; Bag(shared_ptr<Item> item) : _item(item) { cout << "In Bag shared_ptr constructor" << endl; }; Bag(const Bag& other) { cout << "In Bag copy constructor" << endl; _item = other._item; }; ~Bag() { cout << "In Bag destructor" << endl; }; // Data members------------------------------------- shared_ptr<Item> _item; // Methods------------------------------------------ void printUseCount() const { cout << "Use count: " << _item.use_count() << endl; } friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar & _item; } }; int main(int argc, char **argv) { const char *filename = "bag.ser"; // create a Bag object with a new Item in it Bag *pBag = new Bag(shared_ptr<Item>(new Item(1))); // now serialize the Bag cout << "About to serialize bag..." << endl; ofstream osSer(filename); boost::archive::text_oarchive oa(osSer); const Bag& constBag = *pBag; oa << constBag; osSer.close(); pBag->printUseCount(); // delete the original Bag cout << "About to delete bag 1..." << endl; delete pBag; // create a new Bag object cout << "About to create a new bag..." << endl; pBag = new Bag; pBag->printUseCount(); // and deserialize it into the new Bag object cout << "About to deserialize bag..." << endl; ifstream isSer(filename, std::ios::binary); boost::archive::text_iarchive ia(isSer); ia >> *pBag; isSer.close(); pBag->printUseCount(); // delete the second BSag cout << "About to delete bag 2..." << endl; delete pBag; return 0; } ----- This code produces the following output: ----- In Item constructor In Bag shared_ptr constructor About to serialize bag... Use count: 1 About to delete bag 1... In Bag destructor In Item destructor About to create a new bag... In Bag default constructor Use count: 0 About to deserialize bag... In Item constructor Use count: 2 About to delete bag 2... In Bag destructor In Item destructor ----- The series of constructor and destructor calls is as expected. After the first Bag object is created with a shared_ptr to an Item in it, the use_count of the shared_ptr is 1. When the first Bag object (including the shared_ptr) are deleted, and a new, empty Bag object created, the use_count is now (as expected) 0. However, when the serialization archive is deserialized into the new Bag object, the use_count of the shared_ptr jumps from 0 to 2. Am I doing something silly here, or is this a bug in the shared_ptr serialization code? For interest, the saved archive (bag.ser) produced by this code looks like this: ----- 22 serialization::archive 3 0 0 0 1 2 1 0 0 1 ----- Any help would be much appreciated. Tim

3 3

[Review][PQS] Physical Quantities System review (May 31 through June 9)
by fred bertsch 09 Jun '06

09 Jun '06

The review of Andy Little's Physical Quantities System begins today, May 31, 2006, and continues through June 9, 2006. Download: pqs_3_1_0 is the Official Boost Review version of pqs. (Please note that pqs_3_1_0 has a bug in one header. This can be either patched according to the latest release notes, "relnotes.txt" available from http://tinyurl.com/7m5l8 or alternatively download pqs_3_1_1, which is basically equivalent to pqs_3_1_0, except the bug has been fixed there. Description PQS (Physical Quantities System) is designed to replace the use of floating point types for modelling physical quantities in C++ programs. Advantages include automated dimensional analysis checking, automatic unit conversions, self documentation of code and uniform mechanisms for dealing with physical quantities overall, allowing better interoperability, accuracy and repeatability among engineering, physics and trade applications. The library will ultimately consist of various types for modelling quantities in different situations. The t1_quantity, which is the first to be implemented, performs all its dimensional analysis checks as well as parts of its unit conversion calculations, at compile time rather than runtime, for maximum efficiency. PQS is designed with a firm commitment to the SI system, as being the internationally agreed preferred system of units. A reasonable selection of common quantities and units is included in the review version for demonstration purposes. The intent is to expand on this to include all the common quantities mentioned in Appendix B.8 and B.9 of the NIST SI document: http://physics.nist.gov/cuu/pdf/sp811.pdf The library also defines a selection of physical constants again intended as a flavour of the constants that would be included in a full library implementation as outlined in: http://physics.nist.gov/cuu/pdf/chart1.pdf Review questions: Please always explicitly state in your review, whether you think the library should be accepted into Boost. You might want to comment on the following questions: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? -Fred Bertsch

4 4

Re: [Boost-users] Boost.Signals: strange bug in example program
by Pranckevicius, Tadas 09 Jun '06

09 Jun '06

-----Original Message----- From: Sebastian Redl [mailto:sebastian.redl@getdesigned.at] Sent: 09 June 2006 16:22 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Boost.Signals: strange bug in example program Pranckevicius, Tadas wrote: >I tried to run this example and I got the same results, it prints 8 on >Microsoft Visual studio 2003 (7.1) as well. > >I did try to debug it and ended up in "algorithm" file: > >After adding cout: > >template<class _FwdIt> inline > _FwdIt _Max_element(_FwdIt _First, _FwdIt _Last) > { // find largest element, using operator< > _DEBUG_RANGE(_First, _Last); > _FwdIt _Found = _First; > cout<<*_Found<<endl; > if (_First != _Last) > for (; ++_First != _Last;) { > cout<<*_First <<endl; > if (_DEBUG_LT(*_Found, *_First)) > _Found = _First; > } > return (_Found); > } > > >My Visual Studio.Net 2003 does not even have this function anywhere in >the include directory. What precise version are you using? Have you >replaced your standard library? >Sebastian Redl Sorry for the confusion I have debugged in VS 2005 In VS2003 it is: C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\algorithm And it looks like: template<class _FwdIt> inline _FwdIt max_element(_FwdIt _First, _FwdIt _Last) { // find largest element, using operator< _FwdIt _Found = _First; if (_First != _Last) for (; ++_First != _Last; ) if (*_Found < *_First) _Found = _First; return (_Found); } And gives the same result... thanks

1 0

Re: [Boost-users] [multi index].[composite key] Index creation atrun-time.
by JOAQUIN LOPEZ MU?Z 09 Jun '06

09 Jun '06

----- Mensaje original ----- De: Prashant Thakre <prashant.thakre(a)gmail.com> Fecha: Jueves, Junio 8, 2006 8:46 pm Asunto: Re: [Boost-users] [multi index].[composite key] Index creation atrun-time. > One final suggestion :) regarding the choice of index_container in > terms of performance, > memory requirements, serialization support and insert/lookup > opreations considering that std::vector<const std::string> will be the > basis for this container : > 1.Composite keys and hashed indices. > 2.Hashed indices. Excuse me, but I don't get what your suggestion or question is. Would you mind rephrasing or elaborating some more? Thank you. > Thanks a lot for clarifying all the doubts. It is a pleasure. > -- > regards, > Prashant Thakre > Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 3

Re: [Boost-users] Boost.Signals: strange bug in example program
by Pranckevicius, Tadas 09 Jun '06

09 Jun '06

>-----Original Message----- >From: Benjamin Winkler [mailto:Benjamin.Winkler@RWTH-Aachen.de] >Sent: 07 June 2006 22:20 >To: boost-users(a)lists.boost.org >Subject: [Boost-users] Boost.Signals: strange bug in example program >Hi, >I just downloaded the newest boost library 1.33.1 and compiled the >"maximum.cpp" example >from the Signals library, which goes like this: >#include <algorithm> >#include <iostream> >#include <boost/signals/signal2.hpp> >template<typename T> >struct maximum { > typedef T result_type; > template<typename InputIterator> > T operator()(InputIterator first, InputIterator last) const > { > if (first == last) > throw std::runtime_error("Cannot compute maximum of zero elements!"); > return *std::max_element(first, last); > } >}; >int main() >{ > boost::signal2<int, int, int, maximum<int> > sig_max; > sig_max.connect(std::plus<int>()); > sig_max.connect(std::multiplies<int>()); > sig_max.connect(std::minus<int>()); > sig_max.connect(std::divides<int>()); > > std::cout << sig_max(5, 3) << std::endl; // prints 15 > > return 0; >} >As stated, the correct result would be 15 but the output really is 8. >However, when I print the values via > std::copy(first, last, std::ostream_iterator<T>(std::cout, " ")); >I get "8 15 2 1 ", which means that the values are calculated correctly. >This error occurs with Microsoft Visual Studio 2005 (8.0) as well as MinGW >3.4.2. >I even tried replacing std::max_element() with my own function, which >expectedly >didn't help. >Seems like a bug to me, but I can't track it down. Could it be some issue >with >copying the iterator? >Benjamin Winkler Hello, I tried to run this example and I got the same results, it prints 8 on Microsoft Visual studio 2003 (7.1) as well. I did try to debug it and ended up in "algorithm" file: After adding cout: template<class _FwdIt> inline _FwdIt _Max_element(_FwdIt _First, _FwdIt _Last) { // find largest element, using operator< _DEBUG_RANGE(_First, _Last); _FwdIt _Found = _First; cout<<*_Found<<endl; if (_First != _Last) for (; ++_First != _Last;) { cout<<*_First <<endl; if (_DEBUG_LT(*_Found, *_First)) _Found = _First; } return (_Found); } It print's 8 15 2 1.66667 This is expected, but if I add to cout *_Found Like this: cout<<*_First<<" "<<*_Found<<endl; Results are: 8 8 8 8 8 8 8 So (_DEBUG_LT(*_Found, *_First) is always comparing the same numbers. Something is wrong with overloaded operator *. Smart people please help!!! Thanks

2 1

unit_test library on linux
by gelbeiche 09 Jun '06

09 Jun '06

Hi, I tried to use boost unittest lib at my linux box (SuSE 10.0 gcc version 4.0.2 ). I'm able to compile #include using boost::unit_test::test_suite; // most frequently you implement test cases as a free functions void free_test_function() { BOOST_CHECK( 2 == 1 ); } test_suite* init_unit_test_suite( int argc, char* argv[] ) { test_suite* test= BOOST_TEST_SUITE( "Example" ); test->add( BOOST_TEST_CASE( &free_test_function )); return test; } and to link against boost_unit_test_framework. make all-am make[1]: Entering directory `/home/pberg/boost_example_unittest' if g++ -DHAVE_CONFIG_H -I. -I. -I. -I/usr/local/include -g -O2 -MT main.o -MD -MP -MF ".deps/main.Tpo" -c -o main.o main.cpp; \ then mv -f ".deps/main.Tpo" ".deps/main.Po"; else rm -f ".deps/main.Tpo"; exit 1; fi g++ -I/usr/local/include -g -O2 -lboost_unit_test_framework -o sharedpointer main.o /usr/lib/gcc/i586-suse-linux/4.0.2/../../../../i586-suse-linux/bin/ld: warning: libstdc++.so.5, needed by /usr/local/lib/libboost_unit_test_framework.so, may conflict with libstdc++.so.6 make[1]: Leaving directory `/home/pberg/boost_example_unittest' However at execution time I get: porschberg(pberg):/home/pberg/boost_example_unittest> ./sharedpointer *** glibc detected *** free(): invalid pointer: 0x0804ba10 *** Abgebrochen I "valgrinded" the executable and here is the output: *** errors detected in test suite "Example"; see standard output for details ==30533== ==30533== Mismatched free() / delete / delete [] ==30533== at 0x1B904A69: free (vg_replace_malloc.c:152) ==30533== by 0x1BC2FC80: operator delete(void*) (in /usr/lib/libstdc++.so.5.0 .7) ==30533== by 0x1B95840B: boost::unit_test::test_suite::~test_suite() (in /usr /local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B9407FA: boost::unit_test::framework_impl::~framework_impl() (in /usr/local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B93DF5E: (within /usr/local/lib/libboost_unit_test_framework. so.1.33.1) ==30533== by 0x1BA9D313: exit (in /lib/tls/libc-2.3.5.so) ==30533== by 0x1BA87EA7: __libc_start_main (in /lib/tls/libc-2.3.5.so) ==30533== by 0x8049120: ??? (start.S:119) ==30533== Address 0x1BC5D908 is 0 bytes inside a block of size 52 alloc'd ==30533== at 0x1B9046D3: operator new(unsigned) (vg_replace_malloc.c:132) ==30533== by 0x8049201: init_unit_test_suite(int, char**) (main.cpp:12) ==30533== by 0x1B93EEBD: boost::unit_test::framework::init(int, char**) (in / usr/local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B94CF93: main (in /usr/local/lib/libboost_unit_test_framework .so.1.33.1) ==30533== ==30533== Mismatched free() / delete / delete [] ==30533== at 0x1B904A69: free (vg_replace_malloc.c:152) ==30533== by 0x1BC2FC80: operator delete(void*) (in /usr/lib/libstdc++.so.5.0 .7) ==30533== by 0x1B940927: boost::unit_test::framework_impl::~framework_impl() (in /usr/local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B93DF5E: (within /usr/local/lib/libboost_unit_test_framework. so.1.33.1) ==30533== by 0x1BA9D313: exit (in /lib/tls/libc-2.3.5.so) ==30533== by 0x1BA87EA7: __libc_start_main (in /lib/tls/libc-2.3.5.so) ==30533== by 0x8049120: ??? (start.S:119) ==30533== Address 0x1BC5D9E8 is 0 bytes inside a block of size 44 alloc'd ==30533== at 0x1B9046D3: operator new(unsigned) (vg_replace_malloc.c:132) ==30533== by 0x804929E: init_unit_test_suite(int, char**) (unit_test_suite.hp p:222) ==30533== by 0x1B93EEBD: boost::unit_test::framework::init(int, char**) (in / usr/local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B94CF93: main (in /usr/local/lib/libboost_unit_test_framework .so.1.33.1) ==30533== ==30533== ERROR SUMMARY: 7 errors from 7 contexts (suppressed: 24 from 2) ==30533== malloc/free: in use at exit: 9643 bytes in 6 blocks. ==30533== malloc/free: 24 allocs, 19 frees, 11593 bytes allocated. ==30533== For counts of detected errors, rerun with: -v ==30533== searching for pointers to 6 not-freed blocks. ==30533== checked 210328 bytes. ==30533== ==30533== LEAK SUMMARY: ==30533== definitely lost: 19 bytes in 1 blocks. ==30533== possibly lost: 0 bytes in 0 blocks. ==30533== still reachable: 9624 bytes in 5 blocks. ==30533== suppressed: 0 bytes in 0 blocks. ==30533== Use --leak-check=full to see details of leaked memory. I looked through the mailing list archives with no luck. Could someone give a hint ? Thomas

2 2

[ptr_container] ptr_multimap insert and transfer functions
by Konstantin Litvinenko 09 Jun '06

09 Jun '06

Hello, All! I have a couple of questions about ptr_container library. Specificaly 1) Why ptr_multimap_adapter::insert has non const key_type argument? 2) Why ptr_multimap_adapter::transfer( iterator object, ptr_multimap_adapter& from ) has void return type instead of iterator? PS I use 1.33.1 but this is true for 1.34 too. With best regards, Konstantin Litvinenko.

2 8

Serialization of valarray, Problem with Text Type
by Thomas DAVID 09 Jun '06

09 Jun '06

Hi all (again), I'm able to send a valarray with the XML archive but I have a problem with the Text archive. I displayed the received size in valarray.hpp. template<class Archive, class U> void load( Archive & ar, STD::valarray<U> &t, const unsigned int file_version ) { collection_size_type count; ar >> BOOST_SERIALIZATION_NVP(count); cerr << "Received size : " << count << endl; t.resize(count); if (count) ar >> make_array(detail::get_data(t), t.size()); } I have a correct "512" with XML but I have "0" with Text. But the message received is like "0 1 0 0 512 2 2 2 2 2 ...". So it seems that the message is correctly sent. Is the valarray with text buggy or I missed something (I'm quite sure this is the second option). Regards, Thomas DAVID

1 0

set() of dynamic_bitset is too slow.
by Bo Peng 09 Jun '06

09 Jun '06

Dear list, I am using dynamic_bitset to store a sequence of random 0/1. The program generates repeatedly 32bit random numbers and assign the result to a dynamic_bitset. for(UINT i=0; i < m_N; ++i) { if(bit == block) // generate a block { ri = rng().randInt(m_max); bit = 0; } if((ri >> bit) & 0x1) succ.set(i); bit++; } When I profile this program, I surprisingly find out that succ.set(i) uses >50% of the execution time. Is there anyway I can assign block by block to dynamic_bitset, or assign sequentially so the position of i does not have to be calculated each time? Many thanks in advance. Bo

2 9

Help to BUILD AND INSTALL Boost Libraries
by Hemal patel 08 Jun '06

08 Jun '06

Hello!! All, I ned help for BUILDING and INSTALLING the Boost Libraries through VC++ Express Edition . I tweaked it for couple of hrs unscussefully. Here is a run down of the steps I have taken Downloaded following three packs boost_1_33_1 boost-build-2.0-m10 boost-jam-3.1.12 Changed vcvars32.bat for PATH,INCLUDE and LIB settings for Platform SDK OS Environemental variables BOOST BOOST_BUILD_PATH VC80_ROOTS VC80CMNTOOLS Use of 'bjam install' or 'bjam "-sTOOLS=vc8" install ' generates following ERRORS/MESSAGE ------------------------------------------------------------------------------------------------------------------------------------------------------------------ C:/dnld/BOOST/boost_1_33_1/tools/build/v2\build-system.jam:48: in load rule os.environ unknown in module build-system. ------------------------------------------------------------------------------------------------------------------------------------------------------------------ C:\dnld\BOOST\boost-build-2.0-m10\boost-build\kernel\modules.jam:259: in import C:\dnld\BOOST\boost-build-2.0-m10\boost-build\kernel\bootstrap.jam:120: in boost-build C:\dnld\BOOST\boost-build-2.0-m10\boost-build\boost-build.jam:1: in module scope can someone of you take a while to show pointers to correct me. Thanks for all your time. Hemal Patel

4 6

Re: [Boost-users] [multi index].[composite key] Index creation at run-time.
by Prashant Thakre 08 Jun '06

08 Jun '06

One final suggestion :) regarding the choice of index_container in terms of performance, memory requirements, serialization support and insert/lookup opreations considering that std::vector<const std::string> will be the basis for this container : 1.Composite keys and hashed indices. 2.Hashed indices. Thanks a lot for clarifying all the doubts. -- regards, Prashant Thakre ----- Original Message ----- From: "Joaquín Mª López Muñoz" <joaquin(a)tid.es> Newsgroups: gmane.comp.lib.boost.user Sent: Thursday, June 08, 2006 6:51 PM Subject: Re: [multi index].[composite key] Index creation at run-time. Prashant Thakre ha escrito: > Hi, > > > OK, here, instead of a composite_key instantiation, > > you can take advantage directly of std::vector comparison > > semantics (you don't really need tuple_element): > > > > typedef multi_index_container< > > element, > > indexed_by< > > hashed_unique< > > member<element,std::vector<const std::string>,&element::tp> > > > > > // other indices, maybe > > > > > > element_collection; > > > > Is this equivalent to having a member std::string tp which is constructed at > run-time from all the elements of std::vector< const std::string > ? Depends on how you construct that string: if you just concatenate the vector elements, then no, it's not equivalent. For instance, the following two vectors {"mast","err","apparent"} {"master","rap","parent"} both map to "masterrapparent". > Also, how does the hash function generate the key ? Boost.Hash combines the vector element's hash values as described at http://boost.org/doc/html/id2490467.html B.MI also lets you specify your own hashing mechanism if you need it: http://boost.org/libs/multi_index/doc/advanced_topics.html#hash_spec Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Re: [Boost-users] [multi_index].[composite_key] Index creation at run-time.
by Prashant Thakre 08 Jun '06

08 Jun '06

Hi, Guess, I should have given a code snippet :( >But, how are you planning to actually implement this? >Certainly you can't do the following: struct element { public: boost::tuple<t0,t1,...tn> tp; // ... }; As per your first suggestion: >1. If the maxium number of keys of the composite_key is bounded >then you can use that maximum and later on, at run-time, take >advantage of only the first N key slots. struct element { //Assumption: no more than 10 elements, a reasonable limit I guess. // boost::tuple<t0,t1,...t9> tp; const std::string & tuple_element(const int ind) const { return tp.get<ind>; } //... }; As per this suggestion: >2. You can have std::vector<> as the key, the comparison semantics >of this container in some ways resembles that of an infinite-length >composite key. struct element { std::vector<const std::string > tp; const std::string & tuple_element(const int ind) const { return tp[ind]; } //... }; template < std::size_t hash_table_size> struct element_hash { int operator() ( const std::string & hash_string ) const { std::string::const_iterator hash_iter = hash_string.begin(); register int hash_value = 0; //... return hash_value; } }; typedef multi_index_container< element, indexed_by< hashed_unique < // indexed by elements of tuple/vector composite_key< element, const_mem_fun< element, const std::string &, &element::tuple_element(0) > >, // end of composite key def composite_key_hash < element_hash< 8191 > > // end of key hash > // end of hash > // end of inedexed_by > > > element_collection; regards, Prashant Thakre > ----- Mensaje original ----- > De: Prashant Thakre <prashant.thakre_at_[hidden]> > Fecha: Martes, Junio 6, 2006 9:06 pm > Asunto: Re: [Boost-users] [multi_index].[composite_key] Index creation > atrun-time. > > > > Hi, > > Thanks for the reply. > > You're welcome. I'm afraid I'll have to ask > for some more info before I can try to answer > your original question, though :( > > > > This is what I am trying to achieve: > > a) Each entry in the container will have tuple containing n-elements > > tuple < t0, t1 ..., tn >, where n is known at run-time. This entry > > will also have other elements. > > > But, how are you planning to actually implement this? > Certainly you can't do the following: > > > class element > { > public: > boost::tuple<t0,t1,...tn> tp; > ... > }; > > > because you don't know n at compile time. This question > is important, since how you actually implement the > run-time knowledge of n will surely determine the way > you can plug a composite_key into the scheme. If you > can provide some actual code, no matter how sketchy, > showing how you implement your element type, so much > the better. > > > Looking fwd to your feedback, > > > Joaquín M López Muñoz > Telefónica, Investigación y Desarrollo

3 3

Re: [Boost-users] [date_time] posix_time input/output facet symme try
by LABELLE, Maxime 08 Jun '06

08 Jun '06

Jeff Garland wrote something like: > (...) I'm afraid this is a parser bug. I've put together a fix I'd like you to try out. (...) > Download (...) time_facet.hpp and patch it into your boost/date_time/ directory. > > Thanks, > > Jeff Thanks a lot Jeff. It does indeed solve my problem. Thank you for your time. Cheers. Maxime.

2 1

regex_search and match_results issue?
by dave＠superelite.net 08 Jun '06

08 Jun '06

Hi, im having trouble with a base case for regex_search and the number of hits it finds in a haystack. I am wondering if i am not setting flags that need to be set, but i cannot find anything for this in the docs. My usage only seems to find the string "HELLO" once, as the cout indicates xcmMatch.size() is 1 after i run this. I am using boost libs 1.31.00 . Thanks! Heres my code: string sMatchMe = "HELLO"; int theseflags=0; boost::regex xreMatchme(sMatchMe.c_str(), theseflags); boost::cmatch xcmMatch; string stupid = "sdfaHELLOdsfh*sadhfas1d3ahsdf%as&d!adfasdfsdHELLObnbc"; if(regex_search(stupid.c_str(), xcmMatch, xreMatchme)) { cout << "number of matches here should be " << xcmMatch.size() << endl; }

2 1

delaying destructor compile on imcomplete type
by Gottlob Frege 08 Jun '06

08 Jun '06

IIRC, one of boost's smart ptrs can be used with an incomplete type. How is the compile of the destructor delayed? ie ~my_smart_ptr() { get()->~T(); // error: T is an incomplete type } I wondered through lots of the shared_ptr code, but I got a bit bleary-eyed. On that note, does anyone have a script or preprocessor call or something that converts all the boost code into the 'clean and ideal boost'? ie the one without the layers and layers of compiler workarounds, etc? I think that version would be a much easier read. And maybe some day all compilers will support that version too. We can but dream... Tony

3 2

Re: [Boost-users] [spirit] trouble using parse function with rules
by Gabriel Redner 08 Jun '06

08 Jun '06

Sorry, fat-fingered things and the message was sent too early. trying again: Hi all, I am new to spirit, and my only source of information has been the current spirit documentation. I am running into a curious problem in which the manual suggests some code should compile, yet it does not. Test case: ---------------------------------------------------------------------------------------------- #include <boost/spirit/core.hpp> using namespace boost::spirit; int main() { const char *s = "(1)"; rule<> r = ch_p('(') >> int_p >> ch_p(')'); parse(s, r); // compiles OK parse(s, r, space_p); // does NOT compile parse(s, ch_p('(') >> int_p >> ch_p(')'), space_p); // compiles OK } ---------------------------------------------------------------------------------------------- Why does the third parse() compile, but not the second? Does the rule require some kind of adaptor to work in this context? Thanks, -Gabe

2 1

[date_time] posix_time input/output facet symmetry
by LABELLE, Maxime 08 Jun '06

08 Jun '06

I'm experiencing a problem using custom formatting of fractional seconds. const std::string date_string = "2006 Jun 01 999000 23.59.59"; const std::string format_string = "%Y %b %d %f %H.%M.%S"; When using a time_facet together with the "%f" flag, I get a correct output containing a 6-digit number in place of the fractional part. However, using a time_input_facet together with the "%f" flag, I cannot get a correct ptime from an input using the same format as the above example. The problem is twofold : 1) First, the input facet expects a leading '.' otherwise, it parses a special value and fails. [see time_facet.hpp(1035-1049)] This is not the case in an output facet. 2) Second, even if I include a leading dot, the space after the fractional seconds is not consumed, and the parsing of the remainder fails. This means that I need to add an extra space to the input format string. Here is a sample program: --------- #include <cassert> #include <boost/posix_time/posix_time.hpp> Using namespace boost; ... posix_time::ptime time; const std::string input_format = "%Y %b %d %f %H.%M.%S"; // formats are const std::string output_format = "%Y %b %d .%f %H.%M.%S"; // not symmetric const std::string input_date_string = "2006 Jun 01 .999000 23.59.59"; std::string output_date_string; { posix_time::time_input_facet* input_facet = new posix_time::time_input_facet(input_format.c_str()); std::istringstream in(input_date_string); in.imbue(std::locale(std::locale::classic(), input_facet)); in >> time; } { posix_time::time_facet* output_facet = new posix_time::time_facet(output_format.c_str()); std::ostringstream out; out.imbue(std::locale(std::locale::classic(), output_facet)); out << time; output_date_string = out.str(); } assert( output_date_string == input_date_string ); --------- Am I missing something ? Thanks for your help. Maxime LABELLE.

2 1

what happened to smart asserts?
by Graham Mark 07 Jun '06

07 Jun '06

A few years ago Boost included "smart asserts". It no longer does. I've lsearched the boost site and mail archives, but I can't discover why smart asserts are gone. Can anyone tell me? Thanks. G. Mark

2 1

Boost.Signals: strange bug in example program
by Benjamin Winkler 07 Jun '06

07 Jun '06

Hi, I just downloaded the newest boost library 1.33.1 and compiled the "maximum.cpp" example from the Signals library, which goes like this: #include <algorithm> #include <iostream> #include <boost/signals/signal2.hpp> template<typename T> struct maximum { typedef T result_type; template<typename InputIterator> T operator()(InputIterator first, InputIterator last) const { if (first == last) throw std::runtime_error("Cannot compute maximum of zero elements!"); return *std::max_element(first, last); } }; int main() { boost::signal2<int, int, int, maximum<int> > sig_max; sig_max.connect(std::plus<int>()); sig_max.connect(std::multiplies<int>()); sig_max.connect(std::minus<int>()); sig_max.connect(std::divides<int>()); std::cout << sig_max(5, 3) << std::endl; // prints 15 return 0; } As stated, the correct result would be 15 but the output really is 8. However, when I print the values via std::copy(first, last, std::ostream_iterator<T>(std::cout, " ")); I get "8 15 2 1 ", which means that the values are calculated correctly. This error occurs with Microsoft Visual Studio 2005 (8.0) as well as MinGW 3.4.2. I even tried replacing std::max_element() with my own function, which expectedly didn't help. Seems like a bug to me, but I can't track it down. Could it be some issue with copying the iterator? Benjamin Winkler

1 0

Logic Error with boost::lexical_cast
by umut tabak 07 Jun '06

07 Jun '06

Dear all, I am quite new to boost and need some help in problem that I encountered using boost. I am trying to read a .dat file to convert some of the fields to double values. The line format I am trying to read is sth like this GRID* 1086030 7.23756775373e-5.002455787667412 When I use the code it throws a logic_error, I controlled whether I am reading a valid field to convert or not and it is true. So I am using boost::lexical_cast<double>(string..) to convert that into a double value. What might be the problem to throw a logic error.(I know that it is a logic error :-) but I could not figure that out.) I would appreciate some help. Regards

2 3

[boost.multi_array] newbie question: Best use of memory - repost
by Sebastien Fortier 07 Jun '06

07 Jun '06

Since I got no answers I'm reposting I'm currently using multi_array to represent 3D matrices of doubles, I was wondering which would be the best use since the array has to hold a very large amount of data. I' currently testing whith a multi_array of 800x800x100 to hold double or pointers to double and I have memory problems. When I declare the multi_array whith pointers to doubles I can usually go up to 775x775x100 without problems but when I try the same thing with a multi_array of doubles I get a bad alloc error. My real needs for the moment are for a multi_array of 800x600x57 but I will need bigger storage capacity in the near future, what are your sugesstions. Is the multi_array a pointer itself? How is memory management handled? How can go beyond these limits? sebastien.fortier(a)ec.gc.ca

1 0

[future]: combining || and && futures
by Oliver.Kowalke＠qimonda.com 07 Jun '06

07 Jun '06

Hello, could the futures library add support for following construct: ft::simple_future< int > f1 = boost::bind( fac, 4); ft::simple_future< int > f2 = boost::bind( fac, 8); ft::simple_future< int > f3 = boost::bind( fac, 10); ft::future< int > f_or = f1 || f2; ft::future< fu::tuple< int, int > > f_and = f_or && f2; // doesn't compile because no match for 'operator&&' in 'f_or && f2' thx, Oliver

1 0

program options validate function question
by Suresh T 07 Jun '06

07 Jun '06

hello boosters, I have a class ( say user_type ) that i would like to use for storing cmd line option and therefore i have a validate function for the same void validate ( boost::any& v, const std::vector<std::string>& xs, <user_type> * target, int i ) I wanted to know if it is possible to access the actual variable in which the option would be stored from within the validate function. Meaning if i the options_description is something like below: //here user_type_object is an instance of user_type ("option_name" , po::value<user_type>(&user_type_object), "some option" ) Is it possible to access the user_type_object in the validate function? If so please let me know how ? P.S: I am resending this mail as my mail sys. crashed after i sent it the first time in morningso not sure if this was sent. If any one has replied earlier request that they redo as i have lost earlier mails Thanks & Rgds, --------------------------------------------------------------------------------------------------------- Suresh.T

1 0

program options validate function question
by Suresh T 07 Jun '06

07 Jun '06

hello boosters, I have a class ( say user_type ) that i would like to use for storing cmd line option and therefore i have a validate function for the same void validate ( boost::any& v, const std::vector<std::string>& xs, <user_type> * target, int i ) I wanted to know if it is possible to access the actual variable in which the option would be stored from within the validate function. Meaning if i the options_description is something like below: //here user_type_object is an instance of user_type ("option_name" , po::value<user_type>(&user_type_object), "some option" ) Is it possible to access the user_type_object in the validate function? If so please let me know how ? Thanks & Rgds, --------------------------------------------------------------------------------------------------------- Suresh.T

1 0

[serialization] binary_iarchive performance degradation with Intel 9.0 compiler
by Bill Lear 06 Jun '06

06 Jun '06

It could be that I'm being foolish, or that there is something very strange going on in how the Boost serialization library interacts with the Intel C++ compiler that I don't understand. I'll post a short question first, eliding underlying motivations, to see if this warrants further discussion. I am running on 64-bit Linux, using the Intel C++ compiler, version 9.0, and gcc 3.4.5. I have a large, complex data structure that I am serializing. All serialize methods use the BOOST_SERIALIZATION_NVP macro. The data structure serializes and deserializes accurately for each of text, xml, and binary archives. The size on disk is about 250 megabytes, using the binary archives. The load method I use is roughly this: #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> //#include <boost/archive/text_oarchive.hpp> //#include <boost/archive/text_iarchive.hpp> //#include <boost/archive/xml_oarchive.hpp> //#include <boost/archive/xml_iarchive.hpp> #include "Foo.hh" Foo* load(const string& filename) { istream ifs(filename.c_str(), ios::binary); Foo* foo = 0; boost::archive::binary_iarchive ia(ifs); ia >> BOOST_SERIALIZATION_NVP(foo); return foo; } Above this method, note the commented-out text and xml archive headers. Here is the strange part: When using the Intel compiler, and run with the text and xml archive headers commented out, the load method takes about 9.6 seconds. When I uncomment the text and xml headers, the load time almost doubles, to 18.8 seconds or so. I do not see this with gcc. So the question is: have I done something foolish here, or is this wacky? I am using the following command to compile the code: % icpc -O2 -Ob2 -ip <...> Any help appreciated. Bill

4 7

Re: [Boost-users] [multi_index].[composite_key] Index creation atrun-time.
by JOAQUIN LOPEZ MU?Z 06 Jun '06

06 Jun '06

----- Mensaje original ----- De: Prashant Thakre <prashant.thakre(a)gmail.com> Fecha: Martes, Junio 6, 2006 9:06 pm Asunto: Re: [Boost-users] [multi_index].[composite_key] Index creation atrun-time. > Hi, > Thanks for the reply. You're welcome. I'm afraid I'll have to ask for some more info before I can try to answer your original question, though :( > This is what I am trying to achieve: > a) Each entry in the container will have tuple containing n-elements > tuple < t0, t1 ..., tn >, where n is known at run-time. This entry > will also have other elements. But, how are you planning to actually implement this? Certainly you can't do the following: class element { public: boost::tuple<t0,t1,...tn> tp; ... }; because you don't know n at compile time. This question is important, since how you actually implement the run-time knowledge of n will surely determine the way you can plug a composite_key into the scheme. If you can provide some actual code, no matter how sketchy, showing how you implement your element type, so much the better. Looking fwd to your feedback, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Re: [Boost-users] [multi_index].[composite_key] Index creation at run-time.
by Prashant Thakre 06 Jun '06

06 Jun '06

Hi, Thanks for the reply. This is what I am trying to achieve: a) Each entry in the container will have tuple containing n-elements tuple < t0, t1 ..., tn >, where n is known at run-time. This entry will also have other elements. b) Multi_index container will have a composite_key, consisting of each tuple element. As per 2) it should be possible to just have std::vector<T> as a tuple and define the composite key in terms of each element of the tuple i.e. [ tuple.at(0), ..., tuple.at(n-1) ]. Please correct me if am wrong. Thanks once again. -- regards, Prashant Thakre > Date: Tue, 06 Jun 2006 13:00:09 +0200 > From: Joaqu?n M? L?pez Mu?oz <joaquin(a)tid.es> > Subject: Re: [Boost-users] [multi_index].[composite_key] Index > creation at run-time. > To: boost-users(a)lists.boost.org > Message-ID: <44856039.19A00631(a)tid.es> > Content-Type: text/plain; charset=iso-8859-1 > > Prashant Thakre ha escrito: > > > Hi, > > I would like to know if it's possible to define a multi_index using > > composite_key,where the number of keys which are part of the > > composite_key are only known at run-time. > > Thanks again. > > -- > > regards, > > Prashant Thakre > > Hello, > > The short answer is no, you must know the number of keys a > composite_key is made of at compile time. The long answer is, > depending on your usage scenario, maybe you can have something > close to what you're after: > > 1. If the maxium number of keys of the composite_key is bounded > then you can use that maximum and later on, at run-time, take > advantage of only the first N key slots. > 2. You can have std::vector<> as the key, the comparison semantics > of this container in some ways resembles that of an infinite-length > composite key. > > If you can describe what you are pursuing with a little more detail > maybe I can provide more focused help. > > Thanks for using B.MI, best regards, > > Joaqu?n M L?pez Mu?oz > Telef?nica, Investigaci?n y Desarrollo

1 0

boost::pool
by James Swift 06 Jun '06

06 Jun '06

Hi boost users, I have a question regarding the best use of the boost pools and shared_ptr Consider the following tree node object. class A { public: typedef boost::shared_ptr< A > SPA; typedef std::vector< SPA > SPAVec; SPAVec children; }; This class allows me to have a tree or trees where some of the nodes may be shared. E.g. // tree1 tree2 // X Z // Y Y Y X // Y Y Logically the root of tree1, X has two children Y and Y but physically of course I only have one copy of Y in memory. Other trees, e.g. tree2 can also share these branches. Now assume I'm also very often constructing and destroying nodes. An object pool is an obvious optimisation to try out. However shared_ptr would need to call object_pool::destruct() instead of delete when it really wants to destroy the object. Or singleton_pool::free() but this causes more difficulties for me because I want to control the lifetime of the pool separately for each instance of my objects which are working on these trees. Can anyone offer a nice solution to this problem? kind regards, James Swift.

2 2

random library: initializaing a generator.
by dvir schirman 06 Jun '06

06 Jun '06

Hi I am using boost/random library in order to create a normal distributed noise. I want to call my my_class::noise() functions several times, but I want to initialize the generator only once. I tried to declare and initialize the generator at the constructor of my_class, but then my_class::noise() doesn't recognized the generator. I wrote it the following way: my_class::my_class() { boost::mt19937 gen(42u); } my_class::noise() { boost::normal_distribution<float> n_d(5, 10); //n_d(mean,stdev) boost::variate_generator<boost::mt19937&, boost::normal_distribution<float> > normal(gen, n_d); return normal(); } I guess I need to declare the generator at the header, and only initialize it at the constructor, but I don't know how to do it. Thanks for your help. Dvir

4 4

Re: [Boost-users] random library: initializaing a generator.
by David Klein 06 Jun '06

06 Jun '06

boost-users-bounces(a)lists.boost.org wrote: > Hi > > I am using boost/random library in order to create a normal > distributed noise. I want to call my my_class::noise() functions > several times, > but I want to initialize the generator only once. > I tried to declare and initialize the generator at the > constructor of my_class, but then my_class::noise() doesn't > recognized the generator. I wrote it the following way: > > my_class::my_class() > { > boost::mt19937 gen(42u); > > } > > my_class::noise() > > { > > boost::normal_distribution< > > float> n_d(5, 10); //n_d(mean,stdev) > > boost::variate_generator<boost::mt19937&, > boost::normal_distribution<float> > normal(gen, n_d); > > return normal(); > > } > > > > I guess I need to declare the generator at the header, and > only initialize it at the constructor, but I don't know how to do it. > > Thanks for your help. > Dvir hi dvir, this is untested, but should do what you want. class my_class { boost::mt19937 gen_; public: my_class( void ) : gen_(42u) { } void noise( void ) { boost::normal_distribution<float> n_d(5, 10); //n_d(mean,stdev) boost::variate_generator<boost::mt19937&, boost::normal_distribution<float> > normal(gen_, n_d); } }; HTH dave

1 0

[multi_index].[composite_key] Index creation at run-time.
by Prashant Thakre 06 Jun '06

06 Jun '06

Hi, I would like to know if it's possible to define a multi_index using composite_key,where the number of keys which are part of the composite_key are only known at run-time. Thanks again. -- regards, Prashant Thakre

2 1

[Test] Can Boost Test Tools Be Used in Multiple Threads?
by Wu Yinghui, Freddie 05 Jun '06

05 Jun '06

Dear all, I've been trying to write some test code that involves 2 concurrent threads of execution. But I found that there are occasional crashes in the test tool code when some BOOST_CHECK_*() are triggered. So my question is: Are Boost test tools designed to be used in multiple threads? Cheers, Freddie -- Wu Yinghui, Freddie Research & Development Software Engineer Volume Interactions Pte Ltd 1 Kim Seng Promenade, #12-01 Great World City East Tower Singapore 237994 Tel: +65 62226962 (Ext 216) Fax: +65 62226215 Email: yhwu(a)volumeinteractions.com URL: http://www.volumeinteractions.com Important: This message is intended for the recipient(s) addressed above. It contains privileged and confidential information. If you are not the intended recipient, please notify the sender immediately by replying to this message and then delete it from your system. You must not read, copy, use, or disseminate this communication in any form. Thank you.

3 3

[serialization] boost::archive::archive_exception expected on invalid contents on GNU/Linux
by Julien Pervillé 05 Jun '06

05 Jun '06

Hello boost-users! I would like to report a minor (but annoying) bug in the boost::serialization library which I am using extensively in my project. The problem: trying to load serialized data from a known invalid archive does not throw a boost::archive::archive_exception but instead a normal std::exception is caught. Note: the bug seems to only affect GNU/Linux systems. The annoyance is minor since some kind of exception is caught anyway so that corrective action can be taken. At some point in my application's test suite, I test the robustness of my persistence code by feeding my Load() method a malformed buffer. If I run the test suite normally I get the expected result that is an exception happened and the program refused to corrupt its internal data structure. However, when running under Valgrind looking for leakage, I get spammed by "Conditional jump or move depends on uninitialised value(s)" messages. It appears that boost::serialization does not notice that my source stream is a malformed archive and recklessly tries to read the serialized data. As I can see in the many "load" methods from "boost/archive/impl/text_iarchive_impl.ipp" (the last method invoked before the exception occurs), the archive loader attempted to read a "size" from the malformed data and then attempted to resize its buffer to this (undefined) size, ensuing mayhem. Aren't the archive loaders supposed to check that a stream is a valid archive before deserializing? I would imagine that the boost::archive::archive_exception::invalid_archive error code is made for that purpose. Here are instructions on how to trigger the bug: a very simple boost::serialization example and the valgrind trace (compiled with -g). Here is a sample execution of the program: jp@linux ~/boost $ ./malformed-contents caught exception : basic_string::resize The compiler used was g++-4.1 on GNU/Linux (amd athlon, gentoo distribution, glibc 2.3.6). I reproduced the issue on another GNU/Linux box with an AMD 64 and g++ 3.4 and obtained the same issue. However, running the test on my ibook (Apple OSX) returned me the expected behavior : ibook:~/boost jp$ ./malformed-contents caught boost exception : invalid signature The issue seems to only affect some GNU/Linux systems. Thank you for the help, Sincerely, Julien Pervillé Intern, Global Core, Amadeus IT Group.

2 2

[statechart ] UML2.0 local transitions and history
by Tim Milward 05 Jun '06

05 Jun '06

I've built a small test program with the statechart library. (See below) It seems that the sequence of exit and entry actions invoked for a transition are modeled according to the UML 1.5 specification. In other words it models "external" transitions from the 2.0 spec. Is it possible, or are there any plans to extend it, to model the more useful local transitions from the 2.0 spec? Tests with deep history produce a static assertion if you attempt to transition to history of a containing state. UML 2.0 explicitly permits this. Are there any plans to modify the library to permit this? Yours, Tim Milward #include <iostream> #include <boost/statechart/event.hpp> #include <boost/statechart/state_machine.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/transition.hpp> #include <boost/statechart/deep_history.hpp> using namespace std; namespace sc = boost::statechart; struct S0; struct S00; struct Machine : sc::state_machine< Machine, S0 > { Machine() { cout << "Machine()\n"; } ~Machine() { cout << "~Machine()\n"; } }; struct E0 : sc::event< E0 > { E0() { cout << "E0()\n"; } ~E0() { cout << "~E0()\n"; } }; struct E1 : sc::event< E1 > { E1() { cout << "E1()\n"; } ~E1() { cout << "~E1()\n"; } }; struct S0 : sc::simple_state< S0, Machine, S00, sc::has_deep_history > { // this would comile fine // typedef sc::transition<E0, sc::deep_history< S00 > > reactions; // this invokes exit actions of S00 and S0 (an external transition) typedef sc::transition<E0, S00 > reactions; S0() { cout << "S0()\n"; } virtual ~S0() { cout << "~S0()\n"; } }; struct S00 : sc::simple_state< S00, S0 > { // this doesn't compile // typedef sc::transition<E1, sc::deep_history< S00 > > reactions; // this invokes exit actions of S00 only typedef sc::transition<E1, S00 > reactions; S00() { cout << "S00()\n"; } virtual ~S00() { cout << "~S00()\n"; } }; int main() { Machine m; m.initiate(); m.process_event(E0()); m.process_event(E1()); return 1; }

2 8