- Boost-users - lists.boost.org

Tokenizer Problem
by Thomas Johnson 22 Feb '04

22 Feb '04

Can anyone explain to me why the code below prints: Token: A1B21 Token: A1B Token: : Token: 12 Instead of printing: Token: A1B2 Token: : Token: 12 Token: A1B Token: : Token: 12 Using boost 1.31.0 Thanks! ---Cut here--- #include <boost/tokenizer.hpp> #include <iostream> int main() { boost::char_separator<char> sep("", ":", boost::keep_empty_tokens); boost::tokenizer< boost::char_separator<char> > stringTok(std::string("A1B2:12"),sep); boost::tokenizer< boost::char_separator<char> >::iterator tokIter=stringTok.begin(); while(tokIter!=stringTok.end()) { std::cout << "Token: " << (*tokIter) << "\n"; tokIter++; } boost::tokenizer< boost::char_separator<char> > stringTok2(std::string("A1B:12"),sep); boost::tokenizer< boost::char_separator<char> >::iterator tokIter2=stringTok2.begin(); while(tokIter2!=stringTok2.end()) { std::cout << "Token: " << (*tokIter2) << "\n"; tokIter2++; } } ---Cut Here--- -- Thomas Johnson <thomas(a)unifiedconsulting.com>

2 1

Boost Newbie: Boost Libraries not included ..... Linker Error
by Mohammed Abbas 20 Feb '04

20 Feb '04

Hi, Im a newbie in C++ just barely getting to grips with the Boost Libraries. I had built the Boost Libraries and was expecting that the sample simple_ls program to work. Unfortunately as I compiled it I had received a million plus errors due to the Linker Error. Please tell me whats wrong???????????? P.S. The Library folder for Boost is Empty and I includeded the Boost Include Directory in the gcc path. Yours, MJ ____________________________________________________________ Find what you are looking for with the Lycos Yellow Pages http://r.lycos.com/r/yp_emailfooter/http://yellowpages.lycos.com/default.as…

2 1

Semaphore and barriers for boost-threads?
by Craig Rodrigues 20 Feb '04

20 Feb '04

Hi, I am new to Boost, and like what I see. I hope to be able to use more Boost libraries in the C++ projects that I work on. Would it be a good thing to add semaphore and barrier classes to Boost Threads? For semaphores, having something analogous to the POSIX functions sem_wait() and sem_post() would be nice. For barriers, having something analogous to pthread_barrier_wait() would be nice. It is not very hard to roll your own versions of these primitives using boost::condition and boost::mutex classes, but it would be nice to have them in a library. Any opinions? Thanks. -- Craig Rodrigues http://crodrigues.org rodrigc(a)crodrigues.org

5 12

Counting matches with Regex V4
by john.wismar＠autozone.com 20 Feb '04

20 Feb '04

<Using VC7.0> I'm converting to V4 of Regex, and I thought I might be able to count regex matches using this snippet: boost::regex e; std::string::const_iterator first, last; //Initialize first, last boost::sregex_iterator itBegin(first, last, e) boost::sregex_iterator itEnd; ptrdiff_t pd = std::distance(itBegin, itEnd); I get these errors: xutility(312) : error C2665: 'std::_Iter_cat' : none of the 12 overloads can convert parameter 1 from type 'boost::sregex_iterator' xutility(127): could be 'std::_Int_iterator_tag std:: _Iter_cat(std::_Bool)' xutility(133): or 'std::_Int_iterator_tag std:: _Iter_cat(char)' xutility(139): or 'std::_Int_iterator_tag std:: _Iter_cat(signed char)' xutility(145): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned char)' xutility(151): or 'std::_Int_iterator_tag std:: _Iter_cat(short)' xutility(157): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned short)' xutility(163): or 'std::_Int_iterator_tag std:: _Iter_cat(int)' xutility(169): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned int)' xutility(175): or 'std::_Int_iterator_tag std:: _Iter_cat(long)' xutility(181): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned long)' xutility(188): or 'std::_Int_iterator_tag std::_Iter_cat (__int64)' xutility(194): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned __int64)' while trying to match the argument list '(boost::sregex_iterator)' myfile.h(47) : see reference to function template instantiation 'ptrdiff_t std::distance(_InIt,boost::sregex_iterator)' being compiled with [ _InIt=boost::sregex_iterator ] Anyone have any thoughts? Is it a VC7.0 issue? Is there a better or different way of doing the same thing? -------------------------------- John Wismar jwismar(a)midsouth.rr.com ------------------------------------------------------------------------ The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

[Graph] What can I do with null_vertex?
by Douglas Gregor 20 Feb '04

20 Feb '04

There are no semantics for null_vertex. I assume I can copy it, but can I compare it against other vertex descriptors via == and !=? Is it always different from "real" vertex descriptors? Doug

2 1

Determining offset of regex syntax errors
by Keith MacDonald 20 Feb '04

20 Feb '04

Members of class reg_expression know where they are up to while compiling, but don't include that information when they throw. It can be pretty daunting to get the "Invalid regular expression" error message, with no indication of where to start looking, so I'd like to be more helpful. Given the character offset from the start of the RE, I can put the cursor there. Any suggestions as to how to obtain that information? Thanks, Keith MacDonald

2 3

Redirecting the detailed test report
by Hermann Oliveira Rodrigues 20 Feb '04

20 Feb '04

Hi, Recently we have decided to use the Boost Test libraries to provide automated tests to our project. To help with the test result visualization, we created an utility to generate HTML pages from Boost test reports (as generated by -- report_level=detailed). In the begining of implementation, the amount of tests was small and we could just cut-and-paste the test report to a file used as the input of out in-house HTML generator. Now, the amount of tests increased and cutting-and-pasting the report become a pain. So the question: How can we send the test report to a separated file? We used unit_test_log::instance().set_log_stream( stream ) in the definition of test_suite* init_unit_test_suite( int argc, char* argv[] ) to redirect the test log and it worked fine. However, unit_test_result::instance().detailed_report( stream ) can not be used in the same way. We can not simply redirect the test output to a file (using ">") because our application prints lots of information during execution and is pretty hard to change this behaviour. Thanks in advance.

2 2

Overloading New and Delete to track memory in shared_ptr.
by Joshua Little 19 Feb '04

19 Feb '04

Hi again, Well I'm making pretty good progress in learning proper way to use shared_ptr's but I'm still a little nervous about leaking memory, especially if I manage to do something I'm not supposed to do and don't recognize that a memory leak may be occuring. I've used the overloading new/delete before to help track memory leaks and I was wondering if that would be possible with shared_ptrs. I tried my old header files with and saw tons of leaks but I think its because my New that I use logs the creation to a Tracer class but since the Delete happens in the shared_ptr, its not using the overloaded Delete that removes stuff from the tracer when its deleted. I've looked around and found some examples of making a custom deleter to pass into the shared ptr when creating a new shared_ptr which should work but I have some worries about it. I'm not quite sure what the recommended way of doing this would be. About the only thing I can think of would be to have two different deleters which would be conditionally compiled something like this : //Overloaded New to log allocation to a tracer, theres a define to add the file and line number to the new call #ifndef NDEBUG void * operator new (unsigned int size, char const * file, int line) { void * p = new (size); if (Tracer::Ready) NewTrace.Add (p, file, line); return p; } struct deleter { void operator() (void * p) const { if (Tracer::Ready) NewTrace.Remove(p); delete p; } } #else struct deleter { void operator() (void * p) const { delete p; } } #endif //NewTrace is an extern'd object in the Main.cpp file So then I'd pass in the deleter to the shared_ptr and then whichever deleter was defined would be passed into the shared_ptr. I'm kinda cobbling together a few different things I've seen but I think that with this I could include the header file in the .cpp file of any class that I want to track the memory of and then just make sure I send in the deleter when I reset or make a new shared ptr. For instance in my LoggerFactory.cpp file : #include "../include/Logger.hpp" #include "../include/LoggerFactory.hpp" #include "../include/dbnew.hpp" LoggerMap LoggerFactory::loggers; boost::shared_ptr<Logger> LoggerFactory::getInstance(std::string& logger) { boost::shared_ptr<Logger>& TheLoggerRef = loggers[logger]; if(!TheLoggerRef.get()) TheLoggerRef.reset(new Logger(logger),deleter()); return TheLoggerRef; } So then the dbnew would define the deleter to use for the Logger object, if it was a debug build it would also create the overloaded new operator, define the _FILE_ and _LINE_ macros to send into the new New operator. And if its not the debug build then essentially the normal deleter is given to the shared_ptr and everything procedes as normal. Is this a good way to go about adding memory leak checking? I've looked for a new memory leak checkers like valgrind but thats only available on Linux and I'm stuck on windows.. and all the memory checkers I've been able to find only support VC++ or borland and I use gcc. So I would like a nice simple way that I can drop right in, which is what I'm going for with the overloading new and the custom deleter. Joshua.

2 1

Concurrency support based on Boost.Threads
by Slawomir Lisznianski 19 Feb '04

19 Feb '04

License: Public Domain URL: http://www.rhapsodia.org Depends on: Boost, STL Code maturity: Beta Target platform: Any with C++ compiler. C++ compilers verified to work on: GNU g++ 3.2.x, Visual C++ 6 Service Pack 5 Description: Rhapsodia is a collection of header files implementing commonly used classes in concurrent C++ programming. Library mainly consists of implementations of: - Channel (bounded, unbounded and priority queue), - Barrier (multi-party synchronization) - Executor (replacement for direct use of thread creation and management API). Your critiques, suggestions or usage questions are much welcomed. Slawomir Lisznianski; [ www.rhapsodia.org ]

1 0

RE: [Boost-users] Mathematical expressions with containers
by Hurd, Matthew 19 Feb '04

19 Feb '04

> Russell Hind > Subject: [Boost-users] Mathematical expressions with containers > > Currently I'm doing more and more mathematical calculations on > containers, and wondered if there is any library out there that allows > containers to be placed in expressions without having to use > transform/for_each etc. > > e.g. > > std::vector<std::complex<double> > V1; > std::vector<std::complex<double> > V2; > double C1, C2; > > ... > > std::vector<std::complex<double> > Result; > > Result = C1 + V2 / (V1 * C2); > > while would be equivalent to (assuming Result has been resized) > > (I'm currently using a mixture of transforms and spirit::phoenix > (because lambda doesn't work with my compiler)) > > transform(V1.begin(), V1.end(), V2.begin(), > Result.begin(), > C1 + phoenix::arg2 / (phoenix::arg1 * C2)); > > Or something to this effect that will aid with this. > > Cheers > > Russell Seems to my quick glance you are asking for some vector operations. Have you looked at boost's ublas? Regards, Matt Hurd. IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

3 2