July 2006 - Boost-users - lists.boost.org

Re: [Boost-users] Macro to contruct/allocate a shared_ptr?
by Perepelitsa Roman 14 Jul '06

14 Jul '06

> Thanks Roman. > > so is this how i would use your implementation? > > boost::shared_ptr<Test> t = newptr<int, char, std::string>(1, 'a', "hello"); > > that is getting a lot closer to what i need. and is far better that a > MACRO. declaring the types may annoying however. > > the good thing about this approach it that is will also be exception > safe: ie i dont need to declare a variable for the shared_ptr. and > will be cleaned up if g() fails > > // exception safe > fn(newptr<int, char, std::string>(1, 'a', "hello"), g()); You can omit all but the first template parameters because they can be deduced by compiler. shared_ptr<Test> t = newptr<Test>(1, 'a', "hello"); which is equivalent to shared_ptr<Test> t = shared_ptr<Test>(new Test(1, 'a', "hello")); HTH, Roman Perepelitsa.

1 0

Re: [Boost-users] Macro to contruct/allocate a shared_ptr?
by David Klein 14 Jul '06

14 Jul '06

[snip] > I just have a problem with having the user manage the memory. > ie I'd rather do the following: > > shared_ptr<Test> p(1, 'a', "hello"); > or: > shared_ptr<Test> p = newptr<Test>(1, 'a', "hello"); > > instead of: > > shared_ptr<Test> p(new p(1, 'a', "hello")); > > but i guess that's a limitation of the language. to get hi, have a look at shared_new.zip in the vault. http://tinyurl.com/khd8v -- HTH dave

2 1

library to workig with ip-addresses & ranges
by Alex Ott 14 Jul '06

14 Jul '06

Hallo all Is anybody knows a library to manipulate IP-addresses and their ranges. for example, to look ip address N.N.N.N in network specified by X.X.X.X/27, etc. -- With best wishes, Alex Ott Jet Infosystems, Head of software development group, MBA +7 (495) 411 76 01 http://www.jetsoft.ru/

1 0

bug in documentation
by Ovanes Markarian 14 Jul '06

14 Jul '06

Hi! there is currently a bug in boost::lambda documentation ( <http://www.boost.org/doc/html/lambda/s03.html> http://www.boost.org/doc/html/lambda/s03.html) Current version: template <class T> : public binary_function<T, T, T> struct plus { T operator()(const T& i, const T& j) const { return i + j; } }; should be: template <class T> struct plus : public binary_function<T, T, T> { T operator()(const T& i, const T& j) const { return i + j; } }; With Kind Regards, Ovanes

2 1

problem building boost's bjam for boost-1.32.0 on solaris with gcc
by William Deegan 14 Jul '06

14 Jul '06

Greetings, Here's whats happening: bash ./build.sh ### ### Using 'gcc' toolset. ### rm -rf bootstrap.gcc mkdir bootstrap.gcc gcc -o bootstrap.gcc/jam0 command.c compile.c execnt.c execunix.c execvms.c expand.c filent.c fileos2.c fileunix.c filevms.c glob.c hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c newstr.c option.c parse.c pathunix.c pathvms.c regexp.c rules.c scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c pwd.c ./bootstrap.gcc/jam0 -f build.jam --toolset=gcc --toolset-root= build.jam:66: in module scope *** argument error * rule toolset ( name command : opt.out + : opt.define + : release-flags * : debug-flags * : linklibs * ) * called with: ( cc /eng/tools/cm/solaris/bin/gcc -m64 : -o : -D : -s -O : -g : ) * extra argument build.jam:39:see definition of rule 'toolset' being called This is run via script. If I run it interactively it builds fine. I'm trying to script up building boost+ many other third party packages for many platforms. Any idea why it fails when run via a script? Thanks, Bill

2 5

boost regex seg fault, can't run a single example....
by paulo.fernando.silva＠sapo.pt 13 Jul '06

13 Jul '06

Greetings I've just emerged (I'm using gentoo) boost, once using bjam and another time without it. In both cases (not that it could make a difference) I just can't get the boost_regex to work. It blows... After compiling a few examples (captures_example, and grep) in both my home and work pc. I get the same result... segmentation fault. While running captures_example in the line std::cout << " $" << i << " = \"" << what[i] << "\"\n"; After doing some debug, I was able to find only the consequence. (I didn't search that hard...) In sub_match.hpp:73 result.append(1, *i); the value of i is 0x1<address out of bounds>. the line match_results.hpp:123 supposly returns const boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::string> > &) @0x804ded8: {<std::pair<__gnu_cxx::__normal_iterator<char const*, std::string>, __gnu_cxx::__normal_iterator<char const*, std::string> >> = { first = {<std::iterator<std::random_access_iterator_tag, char, int, char const*, char const&>> = {<No data fields>}, _M_current = 0x1 <Address 0x1 out of bounds>}, second = {<std::iterator<std::random_access_iterator_tag, char, int, char const*, char const&>> = {<No data fields>}, _M_current = 0x804d067 "eeeeeeee"}}, matched = 111, m_captures = {ptr = 0x1}} strangely enough, in the debuger, after returning from line match_results.hpp:123 the execution jumps to match_results.hpp:125 and return return m_null; but the cpu registers don't change... the truth is that I get this Program received signal SIGSEGV, Segmentation fault. 0x0804a6d6 in boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::string> >::str ( this=0x804ded8) at sub_match.hpp:73 73 result.append(1, *i); for no apparent reason. Any ideas? I'm using gcc 4.1 in my home pc and gcc 3.3.6 in my office pc. PIII800MHz and PIV1.5GHz both with 512MB ram. ___________________________________________________________________ O SAPO já está livre de vírus com a Panda Software, fique você também! Clique em: http://antivirus.sapo.pt

2 2

vector vs list speed test
by bringiton bringiton 13 Jul '06

13 Jul '06

I'm just wondering what your thoughts are on my findings. I need a container that meets the following: - forward iteration only - insert to end only - no random access - delete from any position - average size of list will be 64 items I would first say use list over vector. because no random access and delete from any position. I ran some performance tests, which proved otherwise. The test builds a list by inserting to end. And then removes all items from the front until size == 0. (note: removing from index [0] should provide worst case linear complexity for vector) Here are my finding for containers of size 64, 256 and 1024. first result uses vector, 2nd uses list. i ran the test in release mode in ms vc++ 6. Test build/remove 64 0.062 0.234 Test build/remove 256 0.422 0.938 Test build/remove 1024 5.844 3.75 - it seems vector is best for smaller lists. even at 256 items, the vector is twice as fast at building at contant time and deleting and worst case linear time. - is this strange behaviour? is my test correct or do i have a bug? - i am also curious to how this runs on other compilers (esp later version of ms vc++) For those curious, here is my code. feel free to pick at it ;) void TestVectBuildDelete(int redoCount, int listSize) { boost::timer t; for (int i = 0; i < redoCount; i++) { // build the list std::vector<int> vect; for (int j = 0; j < listSize; j++) { vect.push_back(j); //vect.insert(vect.begin(), j); //.push_front(j); } // remove all elements in list while (!vect.empty()) { vect.erase(vect.begin()); } } std::cout << t.elapsed() << std::endl; } void TestListBuildDelete(int redoCount, int listSize) { boost::timer t; for (int i = 0; i < redoCount; i++) { // build the list std::list<int> vect; for (int j = 0; j < listSize; j++) { vect.push_back(j); } // remove all elements in list while (!vect.empty()) { vect.pop_front(); } } std::cout << t.elapsed() << std::endl; } void Test() { std::cout << "Test build/remove 64" << std::endl; TestVectBuildDelete(10000, 64); TestListBuildDelete(10000, 64); std::cout << "Test build/remove 256" << std::endl; TestVectBuildDelete(10000, 256); TestListBuildDelete(10000, 256); std::cout << "Test build/remove 1024" << std::endl; TestVectBuildDelete(10000, 1024); TestListBuildDelete(10000, 1024); }

6 10

boost windows installer problem
by Ovanes Markarian 13 Jul '06

13 Jul '06

Hello, is there any way to specify the proxy server to the installer provided by boost-consulting? At work I can access inet via some proxy server only. Now I have to rebuild the entire boost lib again... May be boost-consulting should offer big old monolithic single file installations for vc8.0 or vc7.1 for those who cannot easily access network and still require all libs. With Kind Regards, Ovanes Markarian

4 5

Boost::Spirit - Just enough to match a term?
by Eric Hill 13 Jul '06

13 Jul '06

I'm past the initial learning curve with Spirit, but would like to see how the pros handle this problem. I have the following simple command structure: show queues show users show processes start process foo queue user bar to process foo ...etc I would like to parse these commands with Spirit. Easy enough. Since this is being entered from a keyboard, it would be nice to short-circuit the parser so you only have to enter enough of the command for the parser to reliably figure out what you want. e.g. "sh qu" would parse as "show queues", and "st pr foo" would parse as "start process foo". I can easily model the whole "show queues" command word with: str_p("show") >> str_p("queues") But how do I match "just enough" instead of "whole word" without doing it manually? TIA, Eric

3 4

serialization-lib add user info to XML format
by Eduardo Ferro Aldama 13 Jul '06

13 Jul '06

Hi! We are trying the boost's serialization-lib to serialize C++ objets to send them throw the network. Initialy, we are use xml-serialization to facilitate the inspect the comunications. We are trying to develop a little tool to work/inspect this messages (xml-serializated) but we need to develop this tool in another languaje (in this case python) and We want that this tool don't need to know nothing about the original C++ clases.... In order to develop this tool we need add to the output xml string information about the names of the class that we are serializing -Is possible to configure something to add the class name in the xml output format? -Can we add any other information to taht format without disturb the deserialization process?? Some hint/tipo/doc to add this functionality without changing the boost-lib source? Thanks in advance Please accept my apologies for my poor english -- Eduardo Ferro Aldama Desarrollo TPVs (Gestión Stock) Tlf 91 5142101 Ext:2101 Ce message électronique et tous les fichiers attachés sont confidentiels et destinés exclusivement à l'usage de la personne à laquelle ils sont adressés. Si vous n'êtes pas le destinataire de ce message, merci d'avertir ou de le retourner à son émetteur et détruire ce message électronique et tous les fichiers attachés de votre système informatique. La publication, l'usage, la distribution, l'impression ou la copie non autorisée de ce message et des attachements qu'il contient sont strictement interdits. This e-mail and any attachment are confidential and intended solely for the use of the individual to whom it is addressed. If you are not the intended recipient, please telephone or email the sender and delete this message and any attachment from your system. Unauthorized publication, use, dissemination, forwarding, printing or copying of this e-mail and its associated attachments is strictly prohibited. Este correo electrónico y todos los ficheros adjuntos son confidenciales y destinados exclusivamente al uso de la persona a la cual han sido remitidos. Si Usted no es el destinatario del mensaje, agradecemos advierta al remitente y elimine el mensaje y sus adjuntos de su sistema. La publicación, distribución, impresión o copia no autorizada de este mensaje y de sus adjuntos queda estrictamente prohibida.

2 1