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

Boost.Thread tss_cleanup_implemented question
by Simon Carter 29 Jun '05

29 Jun '05

I'm having some difficulty understanding what I need to implement in tss_cleanup_implemented when using boost.thread I'm using Windows Borland C++ Builder 6 (bcc32 v5.6.4) Roguewave stl Static (.lib) build of boost.thread In my project I #define BOOST_THREAD_USE_LIB My first problem was a pair of unresolved externals - this seems to happen occasionally with boost, bcb6 & roguewave. The missing definitions were boost::thread::thread(boost::function0<void>&) and boost::detail::tss::init(boost::function1<void, void *, std::allocator<boost::function_base> > *) I resolved these by forcing the compiler to generate the relevant code by #including the implementation definitions and creating a function which is never called so: #if (__BORLANDC__ >= 0x560) && defined(_USE_OLD_RW_STL) #include <boost/thread.hpp> #include <boost/thread/tss.hpp> #include <libs/thread/src/thread.cpp> #include <libs/thread/src/tss.cpp> void DummyFuncToGenerateTemplateSpecializations(void) { // This forces generation of // boost::thread::thread(boost::function0<void>&) boost::function0<void> A = NULL; boost::thread B(A); // This forces generation of // boost::detail::tss::init(boost::function1<void, void *, // std::allocator<boost::function_base> > *) // but has the consequence of requiring the deliberately undefined function // tss_cleanup_implemented boost::function1<void, void*>* C = NULL; boost::detail::tss D(C); } But this then causes a call to the deliberately undefined tss_cleanup_implemented so I get another unresolved external. I can't find any info on the sort of thing I need to implement in tss_cleanup_implemented. What should I be doing? Or I have gone wrong somewhere else? Thanks in anticipation Simon

1 0

Boost string algorithms binary-safety
by Leon Mergen 29 Jun '05

29 Jun '05

Hello, I need to replace patterns in a string with contains (partially) binary data. Is it safe to use the Boost string algorithms for it ? I wasn't able to find anything about binary-safety of the string algorithms in the Boost documentation. Regards, Leon Mergen

3 3

filesystem statistics
by Steve Hartmann 29 Jun '05

29 Jun '05

Hello all, I was browsing boost to find some portable means for getting file system statistics such as file system (disk) size, free space, etc. I kind of expected to see this in the boost filesystem library, but they don't appear to be there. Doesn't even seem to be in the "Do-list". Am I missing something? Looking in the wrong place? Thanks, Steve

5 10

Re: [Boost-users] Application using boost library hangs
by Thameem Ansari - CTD ,Chennai 29 Jun '05

29 Jun '05

Hi Sorry guys I have bothered you much as to my mail's disclaimer which even i did not aware while i was sending my query. Thanks for your valuable response. I am using boost version 1.0 dlls/libraries. Any how my application works with the following code than the one which leads to hang the application std::vector<std::string> v; boost::RegEx expr("(?=adc)", TRUE); bool b = expr.Search("XYZ(M-ADC)"); (replaced for 'expr.Grep(v, "XYZ(M-ADC)")') the last statement returns true succesfully in this case. thanks again and regards thameem DISCLAIMER This message and any attachment(s) contained here are information that is confidential, proprietary to HCL Technologies and its customers. Contents may be privileged or otherwise protected by law. The information is solely intended for the individual or the entity it is addressed to. If you are not the intended recipient of this message, you are not authorized to read, forward, print, retain, copy or disseminate this message or any part of it. If you have received this e-mail in error, please notify the sender immediately by return e-mail and delete it from your computer

1 0

Memory pool
by Shriram V 29 Jun '05

29 Jun '05

Hi, I am working on a project, where the requirement is to share memory between processes. I have been reading at the boost::pool documentation. But unfortunately I suspect that I can't use it very easily. Basically, what I want to do is pre-allocate a large fixed size memory segment using mmap, and hand that memory over to pool. The pool should allocate memory from this segment. However I can't find such an interface for pool. I know that you can write a UserAllocator, but, I can not write one for shared memory. Dynamic nature of UserAllocator would mean maintaining free block myself, which is precisely what I wanted to avoid at the first place. Is it possible to use the pool interface to achieve this? If yes how? If not, can you suggest an alternate package or something? Or, Am I missing something? Please help. Regards, -Shriram ======================================================================================================== This e-mail and any files transmitted with it are for the sole use of the intended recipient(s) and may contain confidential and privileged information. If you are not the intended recipient, please contact the sender by reply e-mail and destroy all copies of the original message. Any unauthorized review, use, disclosure, dissemination, forwarding, printing or copying of this email or any action taken in reliance on this e-mail is strictly prohibited and may be unlawful. Warning: Although Persistent Systems Pvt. Ltd. has taken reasonable precautions to ensure no viruses are present in this email; the company cannot accept responsibility for any loss or damage arising from the use of this email or attachments. ========================================================================================================

2 1

Dangling edges in BOOST graph library
by Abhijit Deshmukh 29 Jun '05

29 Jun '05

Hi, I am developing an application for which I need to define edges that have only one of the node defined. The second node is not defined. Does BOOST allow to do this? I know this is not the definition of a graph and is considered illegal in defining a graph. I want to know whether this functionality is available in BOOST graph library. Thanks and Regards, Abhijit Deshmukh

4 5

Boost.Filesystem -- bug or user error?
by Chris 'Xenon' Hanson 29 Jun '05

29 Jun '05

I'm using Boost.Filesystem (along with Boost.Regex, and an unofficial glob library by Angus Leeming) to do globbing and batch file processing in a utility of mine. Environment is boost_1_32_0, Windows XP, MSVC++7.1. The Glob/Regex stuff seems fine -- I fill a vector<string> container with the results and then pass it off to another piece of code to actually do the work. Part of the work involves printing the filename (without path, but with extension). Here's a snippet: int ProcessFile(ofstream &Out, const char *FullPathName) { int Success = 0; fs::path OutFilePath(FullPathName, fs::native); std::string JustName, NameNoExt; JustName = fs::basename(OutFilePath.leaf()) + fs::extension(OutFilePath.leaf()); NameNoExt = fs::basename(OutFilePath.leaf()); PrintItem(Out, FullPathName, JustName.c_str(), NameNoExt.c_str()); return(Success); } // ProcessFile Ignore that it's poor code quality -- this is just a quick & dirty hack program. Everything works great until this code is fed a FullPathName of: eggs+butter01d-thumbs.jpg (In this example, I'm running with relative paths, so there is no "path" part to discard. Makes troubleshooting even simpler.) It throws an exception of boost::filesystem::path invalid name eggs+butter01d-thumbs.jpg in path eggs+butter01d-thumbs.jpg on line 341 of path_posix_windows.cpp It appears to displike the + character. Maybe it's pilot error, but + is apparently a valid symbol in the Win32/NTFS filesystem, and Windows permits it, generally. If it were a weird platform-specific symbol, I would have thought that creating the fs::path with fs::path OutFilePath(FullPathName, fs::native); would have translated it into somethign boost-friendly. Anyone care to tell me what I'm doing wrong? Thanks in advance for any advice. -- Chris 'Xenon' Hanson | Xenon @ 3D Nature | http://www.3DNature.com/ "I set the wheels in motion, turn up all the machines, activate the programs, and run behind the scenes. I set the clouds in motion, turn up light and sound, activate the window, and watch the world go 'round." -Prime Mover, Rush.

2 1

Re: [Boost-users] Spirit - a Reversed Polish Notation calculator
by Marcin Tustin 28 Jun '05

28 Jun '05

> -----Original Message----- > From: Thore Karlsen [mailto:sid@6581.com] > Sent: 28 June 2005 14:48 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Spirit - a Reversed Polish > Notation calculator > Do you have any suggestions for books or tutorials that show > how to make proper LL grammars? Solving ambiguities, > eliminating left recursion, etc. I learned all of this in > college, but I've forgotten most of the finer points since I > never had a practical need for a parser before now. In my youth I found "Compilers" by Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman useful (http://www.amazon.com/exec/obidos/tg/detail/-/0201100886/qid=1119968544 /sr=8-1/ref=pd_bbs_1/102-1607349-4401717?v=glance&s=books&n=507846). Andrew Appel has a book on the subject which I dislike, "Modern Compiler Implementation in C".

1 0

Spirit - a Reversed Polish Notation calculator
by Misza 28 Jun '05

28 Jun '05

I've recently switched from YACC to Spirit and I've been trying to rewrite some examples from YACC manual, starting with a RPN calculator. Based on http://www.boost.org/libs/spirit/doc/grammar.html I made something like this: /* #includes and usings */ struct rpn_calc : public grammar<rpn_calc> { template <typename ScannerT> struct definition { definition (rpn_calc const& self) { expr_add = expr >> ch_p(' ') >> expr >> ch_p(' ') >> ch_p('+'); expr_sub = expr >> ch_p(' ') >> expr >> ch_p(' ') >> ch_p('-'); expr_mul = expr >> ch_p(' ') >> expr >> ch_p(' ') >> ch_p('*'); expr_div = expr >> ch_p(' ') >> expr >> ch_p(' ') >> ch_p('/'); expr_pow = expr >> ch_p(' ') >> expr >> ch_p(' ') >> ch_p('^'); expr = expr_add | expr_sub | expr_mul | expr_div | expr_pow | real_p; } rule<ScannerT> expr, expr_add, expr_sub, expr_mul, expr_div, expr_pow; rule<ScannerT> const& start () const { return expr; } }; }; int main (void) { rpn_calc calc; std::string str("1 2 + 3 4 + *"); if (parse(str.begin(), str.end(), calc, space_p).full) cout << "Parsing succeeded.\n"; else cout << "Parsing failed!\n"; return 0; } Now this compiles OK, but when executed it doesn't output anything, which means that parse(...) quits without any warnings - what's the problem? Am I doing something wrong? Thanks, Misza

3 2

Application using boost library hangs
by Thameem Ansari - CTD ,Chennai 27 Jun '05

27 Jun '05

Hi, I am facing the following problem I have the following code in my application written in VC++ 6.0 std::vector<std::string> v; boost::RegEx expr("(?=adc)", TRUE); expr.Grep(v, "XYZ(M-ADC)"); While debugging, then application hangs in the statement 'expr.Grep(v, "XYZ(M-ADC)")' . If you have faced same kind of problem or you have any solution, please mail me the solution as soon as possible thanks and regards thameem Disclaimer: This message and any attachment(s) contained here are information that is confidential, proprietary to HCL Technologies and its customers. Contents may be privileged or otherwise protected by law. The information is solely intended for the individual or the entity it is addressed to. If you are not the intended recipient of this message, you are not authorized to read, forward, print, retain, copy or disseminate this message or any part of it. If you have received this e-mail in error, please notify the sender immediately by return e-mail and delete it from your computer. DISCLAIMER This message and any attachment(s) contained here are information that is confidential, proprietary to HCL Technologies and its customers. Contents may be privileged or otherwise protected by law. The information is solely intended for the individual or the entity it is addressed to. If you are not the intended recipient of this message, you are not authorized to read, forward, print, retain, copy or disseminate this message or any part of it. If you have received this e-mail in error, please notify the sender immediately by return e-mail and delete it from your computer

6 7