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

wrapping stdlib fstream with boost filtering streams
by Daniel Oberhoff 06 Jul '07

06 Jul '07

Hi, I have a homebrewed matlab file library for which I am considering using the boost filtering streams for zlib compression. In Matlab(tm) files, variables may be compressed individually, meaning there will be compressed blocks inside the file surrounded by umcompressed data. Thus I would like to have (de)compressors which I can plug in at the start of the block and take back out when I am done. I went and applied the boost filtering streams but I have some problems, so before I go into hardcore debugging I would like to ask if I am using the lib right (because the docs are a bit sparse at the relevant spots). This is how I start up the stream(s): File::File(std::string path, std::ios_base::openmode mode) : _fstream(path.c_str(), mode | std::ios_base::binary) { if (!_fstream.is_open()) throw_error("could not open matfile " << path); _istream.set_auto_close(false); _ostream.set_auto_close(false); _istream.push(_fstream); _ostream.push(_fstream); } and these are the methods for starting/stopping the compressed blocks for reading/writing: void File::startunzipping(std::streampos len) { stopunzipping(); _unzend = _fstream.tellg() + len; _unzcount = 0; _istream.pop(); _istream.push(boost::iostreams::zlib_decompressor()); _istream.push(_fstream); _unzipping = true; } void File::stopunzipping() { if (_unzipping==false) return; _istream.pop(); _istream.pop(); _istream.push(_fstream); _unzipping = false; _fstream.seekg(_unzend); } void File::startzipping() { stopzipping(); write_type_and_size(TypeAndSize(Types::Compressed,0),false); _zstart = _fstream.tellp(); _zcount = 0; _ostream.pop(); _ostream.push(boost::iostreams::zlib_compressor()); _ostream.push(_fstream); _zipping = true; } void File::stopzipping() { if (_zipping==false) return; _ostream.flush(); _ostream.pop(); _ostream.pop(); _ostream.push(_fstream); _zipping = false; _zend = _fstream.tellp(); } Two open questions that come to mind: 1) does the compressor flush the zlib compression buffer when I flush/ pop it? 2) is fstream a bidirectional stream (my guess due to separate seekg/ seekp methods) or a seekable stream (one read/write head)? Because I currently require the former. btw: the above code runs without exceptions, but when I read back variables I have just written they are garbled.

2 1

[asio] File I/O
by William Kemper 05 Jul '07

05 Jul '07

I know I'm not the first person to bring this up and it seems that some work has been done: http://lists.boost.org/Archives/boost/2006/03/102350.php . Does anybody know if Felipe has posted his code somewhere? Or when we might an implementation of asynchronous file I/O in asio itself? Failing that - is there some class in the library (or examples) which would be a suitable starting point or reference/guide for creating a non-socket asynchronous I/O service? Thanks in advance.

2 1

[Boost-user]multithreaded app hangs in boost libraries
by Farberov, Inga 05 Jul '07

05 Jul '07

Hello, I have written a static library that uses boost program_options, threads, date-time and serialization libraries. There is also an extensive use of shared_ptr. I am working on a multithreaded application, so when I link my library into the executable, I use multithreaded versions of the boost libraries. When I compile my library and application that links to it, I use -pthread flag in attempt to make it multi-threaded. Everything compiles and links without a problem, however when I try to run the application, it hangs. I have tried to bedug it and when I suspend a hanging thread it gives me following stack trace: 18 _dl_sysinfo_int80() 0x003317a2 17 __lll_mutex_lock_wait() 0x0062e30e 16 _L_mutex_lock_35() 0x0062af3b 15 <symbol is not available> 0x080c80e8 14 <symbol is not available> 0x00472ff4 13 <symbol is not available> 0x080c80e8 12 <symbol is not available> 0xbffff6b0 11 <symbol is not available> 0xbffff208 10 pthread_mutex_lock() 0x0042097e 9 pthread_mutex_lock() 0x0042097e 8 scoped_lock() /usr/include/boost/detail/lwm_pthreads.hpp:72 0x080598eb 7 boost::detail::sp_counted_base::add_ref_copy() /usr/include/boost/detail/shared_count.hpp:122 0x0805b679 6 shared_count() /usr/lib/boost/include/boost-1_34/boost/detail/shared_count.hpp:216 0x0805b65b 5 shared_ptr() /usr/include/c++/3.4.6/bits/stl_construct.h:81 0x0807a7c8 4 boost::program_options::options_description_easy_init::operator() libs/program_options/src/options_description.cpp:178 0xb7fd7189 3 Settings() ../Settings.cpp:9 0x08081808 If this post sounds familiar, that's because this is my second attempt to get this problem resolved. Previously I have been told that this sounds like I've built my application with single-threading, and linked it to multi-threaded build of a boost library, or vice versa. Could you please let me know what's the right way to build my app with multi-threading. I am using Boost 1.34 libraries on Linux and compile with gcc 3.4.6 Thank you in advance for your help, Inga

2 3

Problem with unit test BOOST_AUTO_TEST_MAIN
by Sakharuk, Vlad (GMI Development) 05 Jul '07

05 Jul '07

Hi all, here is my code: #define BOOST_AUTO_TEST_MAIN #include <boost/test/auto_unit_test.hpp> BOOST_AUTO_TEST_CASE( test1 ) { BOOST_CHECK(true); } I link it dynamically with boost ver 1.3.3.1 with gcc-3.4.4 on Linux 2.6. (Note I did not compile this library myself.) However there is a lot of other libraries linked to the module but never used. Bellow is output I am getting. I suspect that other libraries have embedded boost tests. BUT 1) There is no test1 in my output. 2) How I can remove all unnecessary test and stick only to those in my files only? Here is command I have used test1 --output_format=XML --log_level=success Thanks Vlad. ** Demo doc read from disk: ** ** Printing via doc.Print ** <?xml version="1.0" standalone="no" ?>  <ToDo>  <Item priority="1" distance="close">Go to the <bold>Toy store!</bold> </Item> <Item priority="2" distance="none">Do bills</Item> <Item priority="2" distance="far & back">Look for Evil Dinosaurs!</Item> </ToDo> ** Printing via TiXmlPrinter ** <?xml version="1.0" standalone="no" ?>  <ToDo>  <Item priority="1" distance="close"> Go to the <bold>Toy store!</bold> </Item> <Item priority="2" distance="none">Do bills</Item> <Item priority="2" distance="far & back">Look for Evil Dinosaurs!</Item> </ToDo> ** Printing via operator<< ** <?xml version="1.0" standalone="no" ?><ToDo><Item priority="1" distance="close">Go to the<bold>Toy store!</bold></Item><Item priority="2" distance="none">Do bills</Item><Item priority="2" distance="far & back">Look for Evil Dinosaurs!</Item></ToDo> ** Demo doc processed: ** <?xml version="1.0" standalone="no" ?>  <ToDo>  <Item priority="2" distance="close">Go to the <bold>Toy store!</bold> </Item> <Item priority="1" distance="far">Talk to: <Meeting where="School"> <Attendee name="Marple" position="teacher" /> <Attendee name="Voel" position="counselor" /> </Meeting> <Meeting where="Lunch" /> </Item> <Item priority="2" distance="here">Do bills</Item> </ToDo> ** Demo doc processed to stream: ** <?xml version="1.0" standalone="no" ?><ToDo><Item priority="2" distance="close">Go to the<bold>Toy store!</bold></Item><Item priority="1" distance="far">Talk to:<Meeting where="School"><Attendee name="Marple" position="teacher" /><Attendee name="Voel" position="counselor" /></Meeting><Meeting where="Lunch" /></Item><Item priority="2" distance="here">Do bills</Item></ToDo> ** Basic structure. ** [pass] Output stream correct. [pass] Root element exists. [1][1] [pass] Root element value is 'ToDo'. [ToDo][ToDo] [pass] First child exists & is a comment. [1][1] [pass] Sibling element exists & is an element. [1][1] [pass] Value is 'Item'. [Item][Item] [pass] First child exists. [1][1] [pass] Value is 'Go to the'. [Go to the][Go to the] ** Iterators. ** [pass] Top level nodes, using First / Next. [3][3] [pass] Top level nodes, using Last / Previous. [3][3] [pass] Top level nodes, using IterateChildren. [3][3] [pass] Children of the 'ToDo' element, using First / Next. [3][3] [pass] 'Item' children of the 'ToDo' element, using First/Next. [3][3] [pass] 'Item' children of the 'ToDo' element, using Last/Previous. [3][3] ** Parsing. ** [pass] Element parsed, value is 'Element0'. [Element0][Element0] [pass] Reads attribute 'attribute0="foo0"'. [foo0][foo0] [pass] Reads incorrectly formatted 'attribute1=noquotes'. [noquotes][noquotes] [pass] Read attribute with entity value '>'. [>][>] [pass] Error row [3][3] [pass] Error column [17][17] ** Streaming. ** [pass] Stream round trip correct. [pass] String printing correct. [pass] Query attribute: int as double [0][0] [pass] Query attribute: int as double [1][1] [pass] Query attribute: double as double [2][2] [pass] Query attribute: double as int [0][0] [pass] Query attribute: double as int [2][2] [pass] Query attribute: not a number [2][2] [pass] Query attribute: does not exist [1][1] [pass] Location tracking: Tab 8: room row [1][1] [pass] Location tracking: Tab 8: room col [49][49] [pass] Location tracking: Tab 8: doors row [1][1] [pass] Location tracking: Tab 8: doors col [55][55] [pass] Location tracking: Declaration row [1][1] [pass] Location tracking: Declaration col [5][5] [pass] Location tracking: room row [1][1] [pass] Location tracking: room col [45][45] [pass] Location t etc ... -------------------------------------------------------- This message w/attachments (message) may be privileged, confidential or proprietary, and if you are not an intended recipient, please notify the sender, do not use or share it and delete it. Unless specifically indicated, this message is not an offer to sell or a solicitation of any investment products or other financial product or service, an official confirmation of any transaction, or an official statement of Merrill Lynch. Subject to applicable law, Merrill Lynch may monitor, review and retain e-communications (EC) traveling through its networks/systems. The laws of the country of each sender/recipient may impact the handling of EC, and EC may be archived, supervised and produced in countries other than the country in which you are located. This message cannot be guaranteed to be secure or error-free. This message is subject to terms available at the following link: http://www.ml.com/e-communications_terms/. By messaging with Merrill Lynch you consent to the foregoing. --------------------------------------------------------

2 1

[Serialization] serializing handles to pointers, and serializing as garbage collection
by Sean Cavanaugh 05 Jul '07

05 Jul '07

I'm a bit new to boost and am trying to determine if I can coax the existing boost serialization system to work for a fairly standard asset loading system. Assets in my domain of game programming are things such as bitmaps, model geometry, audio data, shaders, and various chunks of meta data attached to them. The quantity of such data should always be assumed to vastly exceed the ability to load it all at once, which means getting sneaky when dealing with persistence. From my point of view the boost::serialization code is missing a lot of important features, so I am kind of surprised that they are not there. A) Serializing for persistence: Assets can reference other assets via pointers, but serializing for persistence should only store names of other assets, and query a resource manager to help convert the pointer into a name (or vice versa). A model object might reference via a pointer a shader and a texture in addition to its geometric data. When I serialize the model for persistence I want to store the geometric data, but when it comes to the shader and textures I only want to store their names. I could manually do this in each method's serialize methods. However the serialization system should also be able to do this via type traits, so that I don't have to hack up the serialize methods. The type trait method for this is preferable, since the method bodies of serialize could then be written as the originally would want to be, so that completely different kinds of archivers can operate on them, especially ones that depend on actually being able to walk into the pointers. Its the archive's call how to walk the data really. B) Serializing for garbage collection: A full set of raw assets for an engine can easily push into the terabyte range, which means you never actually work with all of the data at once. To work you need to be able to load what you need as you go, but to keep your working set down you need to evict unused assets as much as possible. Another type trait could be used to build a list of reachable objects containing the type trait from an array of root objects which are serialized. You can then compare this list to the full list of what the resource manager has currently loaded, and either delete or save the modified but now unreachable nodes. This system has the advantage of being useful for other purposes, such as making making an asset browser, without having to also implement a full blown system for reflection and introspection. C) Serializing for counting memory: You can also make the archive simply count the memory overhead of your objects. It needs the ability to count memory without counting the memory twice, and it also needs to be able to either do this for a single object (i.e. don't follow reference to other assets), or for a hierarchy (i.e. 'how much memory does using this asset require, factoring in its dependencies'). So my real question boils down to : I can't really be the first person to want it to be able to do these things right? Am I crazy for wanting to coax the boost serialization code into working this way?

2 1

Re: [Boost-users] [Boost-user]multithreaded app hangs in boost libraries
by Ovanes Markarian 05 Jul '07

05 Jul '07

May be you should not initialize it globally??? ;) What happens if you initialize it from main? With Kind Regards, Ovanes Markarian On Thu, July 5, 2007 15:23, Farberov, Inga wrote: > My application actually hangs in the initialization phase, before I even > get a chance to start any threads - in the main thread. The stacktrace > that I have attached resulted from a call to init program_options > object. > Inga > > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Ovanes > Markarian > Sent: Thursday, July 05, 2007 9:16 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Boost-user]multithreaded app hangs in boost > libraries > > Can you please describe a bit more? How do you start your threads > (before your app enters main or > from the main)? Is there any chance, that you create threads and > afterwards leave main? > > > Try to build in some simple logging mechanism, which will produce logs > to cout from your threads > and main as well... Do not forget to lock access to cout. Try may be > create an instance of a > global object, which will output log message from its constructor. > > > With Kind Regards, > > Ovanes Markarian > > > On Thu, July 5, 2007 15:05, Farberov, Inga wrote: >> Hello, >> >> [...] >> Inga >> >>

1 0

Re: [Boost-users] [Boost-user]multithreaded app hangs in boost libraries
by Ovanes Markarian 05 Jul '07

05 Jul '07

Can you please describe a bit more? How do you start your threads (before your app enters main or from the main)? Is there any chance, that you create threads and afterwards leave main? Try to build in some simple logging mechanism, which will produce logs to cout from your threads and main as well... Do not forget to lock access to cout. Try may be create an instance of a global object, which will output log message from its constructor. With Kind Regards, Ovanes Markarian On Thu, July 5, 2007 15:05, Farberov, Inga wrote: > Hello, > > > > I have written a static library that uses boost program_options, > threads, date-time and serialization libraries. There is also an > extensive use of shared_ptr. > > I am working on a multithreaded application, so when I link my library > into the executable, I use multithreaded versions of the boost > libraries. When I compile my library and application that links to it, > I use -pthread flag in attempt to make it multi-threaded. > > > > Everything compiles and links without a problem, however when I try to > run the application, it hangs. I have tried to bedug it and when I > suspend a hanging thread it gives me following stack trace: > > > > 18 _dl_sysinfo_int80() 0x003317a2 > > 17 __lll_mutex_lock_wait() 0x0062e30e > > 16 _L_mutex_lock_35() 0x0062af3b > > 15 <symbol is not available> 0x080c80e8 > > 14 <symbol is not available> 0x00472ff4 > > 13 <symbol is not available> 0x080c80e8 > > 12 <symbol is not available> 0xbffff6b0 > > 11 <symbol is not available> 0xbffff208 > > 10 pthread_mutex_lock() 0x0042097e > > 9 pthread_mutex_lock() 0x0042097e > > 8 scoped_lock() /usr/include/boost/detail/lwm_pthreads.hpp:72 > 0x080598eb > > 7 boost::detail::sp_counted_base::add_ref_copy() > /usr/include/boost/detail/shared_count.hpp:122 0x0805b679 > > 6 shared_count() > /usr/lib/boost/include/boost-1_34/boost/detail/shared_count.hpp:216 > 0x0805b65b > > 5 shared_ptr() /usr/include/c++/3.4.6/bits/stl_construct.h:81 > 0x0807a7c8 > > 4 > boost::program_options::options_description_easy_init::operator() > libs/program_options/src/options_description.cpp:178 0xb7fd7189 > > 3 Settings() ../Settings.cpp:9 0x08081808 > > > > If this post sounds familiar, that's because this is my second attempt > to get this problem resolved. > > Previously I have been told that this sounds like I've built my > application with single-threading, and linked it to multi-threaded build > of a boost library, or vice versa. > > Could you please let me know what's the right way to build my app with > multi-threading. > > > > I am using Boost 1.34 libraries on Linux and compile with gcc 3.4.6 > > > > Thank you in advance for your help, > > Inga > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[tuples] How to impose external allocator onto a class?
by Zeljko Vrba 05 Jul '07

05 Jul '07

I want to define custom new and delete operators for tuples. The usual way to do it would be, I presume, to derive from a base class and define these operators in the derived class. However, doing this for tuples would require me to provide all possible templated derivations for up to 10 arguments, including constructors. (And then maybe even defining new make_tuple functions). Is there a better way to accomplish this task?

1 0

[serialization] bad alloc and deserialization
by Cyril 05 Jul '07

05 Jul '07

Hello all, I have some trouble using boost::serialization : this code ============== try { std::stringstream erroneousStream; erroneousStream << "not a message ! @@@"; boost::archive::text_iarchive input(erroneousStream); Message* deserializedMessage; input >> deserializedMessage; // failure } catch (boost::archive::archive_exception& e){ std::cerr << e.what() << std::endl; } catch (std::exception& e) { std::cerr << e.what () << std::endl; } catch(...) { failmsg("unexpected !"); } =============== fails with a bad alloc exception. I don't think this is a normal behavior. So, what can I do to make this code fail correctly (with an archive_exception or even better with a serialization_exception) ? I must precise that in a normal scenario (with a real serialized message, this works perfectly well ! Any other idea ? Tanks in advance for you answers.

1 0

[Boost-docs] [Improving Boost Docs] Help Request, Request for Testers
by Stuart Dootson 05 Jul '07

05 Jul '07

As many of you will be aware, Matias Capeletto has been working at improving the Boost documentation in various ways, one of which is adding webpage functionality. Now, hopefully all these changes are cross-browser compatible, but to make sure, we need testers using as many platforms and browsers as we can get hold of. We currently have the combinations shown below covered, but could do with coverage a) for ones we don't already have, and b) to provide confirmation of existing test results. Firefox 2, Opera 9, Konqueror on Linux Firefox 2, IE 6, IE 7 on Windows XP Firefox 2, Camino 1.5, Safari 3 on Mac OS X If you are willing and able to help with testing (see http://svn.boost.org/trac/boost/wiki/BrowserTestingChart for details of what's involved), please let me know. I will then add you to the list of testers I have and will let you know when updated docs are available and re-testing is required. I'll then collate results (manually at first, but not for long - I'm lazy). So - please get in touch! Stuart Dootson

3 2

Re: [Boost-users] Simple regex question
by david v 05 Jul '07

05 Jul '07

Right, That's the confusion here !!!! thanks.!! Gottlob Frege wrote: >On 7/4/07, david v <danova_fr(a)hotmail.com> wrote: >>Ok i understand david and divad is the same so it's normal to find it >>twice, >>however why it always return as match "David" and not both matches "david" >>and "divad" in the order they appear in the searched string??? does not >>make >>sense to me ?? How can i get the matches in the same order they appear in >>the string ?? >> > >match returns what part of the input string matched the regex, not >what part of the regex matched the input string. > >so >regex = "f*.r" >stringtosearch = "foobarblah" > >match is "foobar" not "f*.r" > >Is that the confusion here? > >Tony _________________________________________________________________ MSN Messenger : appels gratuits de PC à PC ! http://www.msn.fr/newhotmail/Default.asp?Ath=f

1 0

[Boost.Random] C2825 in pass_through_engine.hpp when compiling on VS2005
by Gabriele Rizzo 05 Jul '07

05 Jul '07

Hi everyone, hope someone could help me... I'm using Boost Libraries 1.34.0 (actually Boost.Random only) in a VS2005 VC++ project. I've read the behaviour of these libraries on this platform at http://tinyurl.com/38pbp2 and all results on machines using this compiler are marked "pass", so it should work... But not for me, and I cannot really find why. Here is the code (more or less), cut'n'pasted from all around the project //begin code #include <boost/random.hpp> //commenting this line is uninfluential #include <boost/random/variate_generator.hpp> #include <boost/random/mersenne_twister.hpp> #include <boost/random/lagged_fibonacci.hpp> #include <boost/random/uniform_int.hpp> #include <boost/random/normal_distribution.hpp> boost::mt19937 Engine_Int; boost::lagged_fibonacci19937 Engine_Double; boost::uniform_int< > Uniform( 0, RAND_MAX ); boost::variate_generator< boost::mt19937&, boost::uniform_int< > > MyRand( Engine_Int, Uniform ); boost::normal_distribution< > Gaussian( 20, sqrt( (double) 20) ); boost::variate_generator< boost::lagged_fibonacci19937&, boost::normal_distribution< > > MyGaussianRand( Engine_Double, Gaussian ); unsigned SeedGenerator( unsigned uSeed ) { Engine_Int.seed( (boost::mt19937::result_type) uSeed ); Engine_Double.seed( uSeed ); return( uSeed ); } int main( ) { //do something... return EXIT_SUCCESS } //end code Does someone have a guess? Thanks a lot Gabriele

1 1

Boost::Thread 1.34 - Acess Violation at runtime (release-static)
by Mario Figueiredo 05 Jul '07

05 Jul '07

Hello everyone, I get an access violation at runtime after building against the boost::test release static library. The error doesn't occur with the debug static library. -> MinGW 3.4.5 (last updated 2007-03-26) -> Running Windows XP with SP2 Furthermore, Access violation also occurs after building (against the static-debug lib) doc\boost_1_34_0\libs\test\example\unit_test_example_02.cpp Output occurs as expected, but Access Violation is triggered at system error BOOST_CHECK. No output for this error is shown on screen. Can't seem to be able to copy-paste call stack without triggering a top-posting warning. Let me know if you need it and I'll try to format it. Anyone else experienced this two problems?

1 0

[wave] some more question...
by Ovanes Markarian 04 Jul '07

04 Jul '07

Hello Hartmut! I have a file delived from some processor manufacturer which I can not change. In the file I have following defines, which wave can't parse: #define UINT_MAX 4294967295U #define ULONG_MAX 1099511627775U First error which happens during parsing of UINT_MAX is: description: error: ill formed integer literal or integer constant too large: 4294967295U I do not understand why I get the first error, since the value 4294967295U is 0xFFFFFFFF which is 32 bits long and should be fine (since it is also marked as unsigned for the preprocessor)... Clearly the ULONG_MAX has a wrong numeric format (should be 1099511627775UL or 1099511627775ul), but unfortunately this file comes from some vendor and is deeply incorporated into the build process, so that it can not easily be changed. What do you think, could be the possible solution in this case? My other question would be: Is there any change to allow the hooking interface to specify, which preprocessor directives should be expanded, an which not. Let me summarize: I need some few macros to be expanded, which are defined in some 2-3 headers and I do not want wave to preprocess everything (huge source dir). Ideally, it would be great to have some functionality, which can notify the preprocessor whether to skip the preprocessing directive or not, e.g. function void found_include_directive(std::string const &filename, bool include_next); (as well as other functions like expanding_function_like_macro) from the default_preprocessing_hooks interface could additionaly return bool value, which would notify the preprocessor whether to include and expand the file/macro or not. May be in this second case I could solve the first problem as well, since I don't really need these defines, they are parsed as part of dependency, which is not required in my case. With Kind Regards, Ovanes Markarian

3 5

get all the elements with a certain value with multi_index
by boost＠larroy.com 04 Jul '07

04 Jul '07

Hello I'm trying to use multi_index with an ordered_non_unique index. My question is how can I perform a search like with "find(key)" and get all the elements that match that key. Since find only returns one element that match, and there can be several in the container. I've tried to iterate "count(key)" times with the iterator returned by find but doesn't seem to work. Is there a way to do this? Regards -- Pedro Larroy Tovar, pedro at larroy dot com | http://pedro.larroy.com/ * Las patentes de programación son nocivas para la innovación * http://proinnova.hispalinux.es/

4 5

Re: [Boost-users] Simple regex question
by david v 04 Jul '07

04 Jul '07

Ok i understand david and divad is the same so it's normal to find it twice, however why it always return as match "David" and not both matches "david" and "divad" in the order they appear in the searched string??? does not make sense to me ?? How can i get the matches in the same order they appear in the string ?? david v wrote: > > Hello, > > I'm trying to use regex_search to look for regular expressions. > > > > regex = (david|divad) > > stringtosearch = "david" > > > > > > So I'm looking for regex above in the string "david". As you see a > > very basic example. I'm expecting to find two hits, but I thought I > > should recover "david" and "david" and not twice the same match > > "david" ??? > > > > Here is a snippet of the code: > > > > .... > > boost::smatch match; > > start = stringtosearch.begin(); //that would be the start of "david" > > end = stringtosearch.end(); // that would be the end of "david" > > old_pos = 0; > > cout << "Looking for regex:" << regex << " in string " << > > stringtosearch << endl; > > while (boost::regex_search(start,end,match,regex)) > > { > > > > > > old_pos += match.position()+1; > > std::string t = match[0]; > > > > std::cout << "\tFound:" << match[0] << endl; > > > > old_pos += match.length(); > > start = match[0].second; > > > > > > } > > catch(const std::exception &regex) > > { > > std::cerr << "Exception:" << regex.what() << std::endl; > > exit(-1); > > } > > > > > > Here is the output: > > Looking for regex:(david|divad) in string david > > Found david > > Looking for regex:(david|divad) in string david > > Found david > > > > As you can see, pattern "david" is found twice ??? I was expecting two > > different patterns to be found "david" and "divad". Um, because the stringtosearch contains "divad" both times the code is called? > > cout << "Looking for regex:" << regex << " in string " << > > stringtosearch << endl; Outputs > > Looking for regex:(david|divad) in string david Both times. > > By the way how can I recover the total number of matches found ?? By keeping count? John. _________________________________________________________________ Testez Windows Live Mail Beta ! http://www.ideas.live.com/

3 2

Using lambda bind as destruct functor to shared_ptr
by Scott French 04 Jul '07

04 Jul '07

Hello, Should the following code sample work? It is the simplest reproduction case I could come up with: #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> #include <boost/shared_ptr.hpp> #include <stdlib.h> using namespace std; using namespace boost; using namespace boost::lambda; int main(void) { void * myResource = malloc(5); shared_ptr<void> mySharedResource(myResource, bind(free, _1)); } I get a compile error using g++ 4.0.1 on Mac OS X: /Documents/boost_1_34_0/boost/detail/sp_counted_impl.hpp: In member function 'void* boost::detail::sp_counted_impl_pd<P, D>::get_deleter(const std::type_info&) [with P = void*, D = boost::lambda::lambda_functor<boost::lambda:: lambda_functor_base<boost::lambda:: action<2, boost::lambda::function_action<2, void> >, boost::tuples::tuple<void (&)(void*), const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >]': test.cpp:13: instantiated from here /Documents/boost_1_34_0/boost/detail/sp_counted_impl.hpp:150: error: no match for ternary 'operator?:' in '(+ ti)->std::type_info::operator==(((const std::type_info&)((const std::type_info*)(& _ZTIN5boost6lambda14lambda_functorINS0_19lambda_functor_baseINS0_6action ILi2ENS0 _15function_actionILi2EvEEEENS_6tuples5tupleIRFvPvEKNS1_INS0_11placehold erILi1EE EEENS7_9null_typeESG_SG_SG_SG_SG_SG_SG_EEEEEE)))) ? boost::lambda::operator&(const boost::lambda::lambda_functor<T>&) [with Arg = boost::lambda::lambda_functor_base<boost::lambda::action<2, boost::lambda::function_action<2, void> >, boost::tuples::tuple<void (&)(void*), const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> >]() : 0' Of course, just using "free" instead of bind(free, _1) works, but my real case is more complicated and this appears to be a general conflict between lambda::bind and shared_ptr. Thanks, Scott French

2 1

[IBD] Weekly news: 2007-06-27 to 2007-07-03
by Matias Capeletto 04 Jul '07

04 Jul '07

================================================== Hi Boost, Once a week, we will send you a brief of our work for the Improving Boost Docs project. We need more hands, join us! We are waiting you on the boost-docs list. More information: http://svn.boost.org/trac/boost/wiki/ImprovingBoostDocs ================================================== 2007-07-03 ------------------------------------------------------------------------------------- * A new community builder tool for the project: Linked In. Be part of our network of trust. * Change date format to be ISO 8601 compliant. * Ohloh statistics for our project. 2007-07-02 ------------------------------------------------------------------------------- * New project: Boost Debugger Visualizers. Welcome Filip! * Formal presentation of the project. 32 downloads on the first 12 hours! * Initial structure of the Boost Glue docs project. 2007-07-01 ------------------------------------------------------------------------------- * First Release of Boost Docs! 2007-06-30 ------------------------------------------------------------------------------- * We will use ohloh as a community builder tool and for statistics about our project. * Two new objectives: Standard C++ Library Boosted Docs and Documentation Best Practices. 2007-06-29 ------------------------------------------------------------------------------- * Stuart Dootson will be our browser testing manager. Thanks! * Add fancy graphics to the wiki. 2007-06-28 ------------------------------------------------------------------------------- * The formal objectives of the project have been outlined. * We are trying to build a long term community of people that cares and constantly improve Boost docs. With that in mind new sections have been created: Subprojects, People, and Acknowledgments; including pictures of us to make us feel as a group. * The community is growing: Peter Foley starts the SVG icons set project. Welcome Peter! 2007-06-27 ------------------------------------------------------------------------------- * Help needed for a new project: Boost specific WikiMacros * "Quickbook as a WikiProcessor for our Trac", let us know we can count on you! Best regards Improving Boost Docs Crowd

2 3

Iteratiing on regex results with pointer-to-member-function
by Alain Leblanc 04 Jul '07

04 Jul '07

Hi, I wrote some code where I want to iterate on the result of a regex matching and call a member function for each match. It goes roughly like this: ====================================================================== class XX { typedef bool (XX::*FuncPtr)(const boost::match_results<std::string::const_iterator>& what); FuncPtr funcPtr; }; bool XX::regex_callback(const boost::match_results<std::string::const_iterator>& what) { return true; } void XX::addDelayedVariables(string expr) { funcPtr = &XX::regex_callback; regex re("([[:alpha::]][[:alnum]]+)(\[[^\\]]+])"); sregex_iterator m1(expr.begin(), expr.end(), re); sregex_iterator m2; match_results<string::const_iterator> results; (*) bool a = (this->*funcPtr)(results); (*) for_each(m1, m2, (this->*funcPtr)); (#) } =========================================================================== When compiling (gcc 4.1 on FC 6) I get an error message at (#) that says: invalid use of non-static member function I added the two lines with a (*) as a sanity check to see that I declared the pointer-to-member-function correctly, and I have no problem compiling those. So my question is: is this a problem with me not understanding how to handle pointer-to-member-functions in C++, or is there something with the boost libraries that I'm missing or is preventing me from performing this operation? I would appreciate any help or opinion. thanks, Alain

2 2

Can't compile boost 1.3.3.1 with stlport 4.6.2
by Hongquan 04 Jul '07

04 Jul '07

Hi Buddy: I down the boost 1.3.3.1 and stlport 4.6.2 and then using the command < bjam.exe -sTOOLS=msvc-stlport -sSTLPORT_4.6.2_PATH=D:\SDK\Stlport\STLport-4.6.2 > to build the boost source ,but some error was threw out in compile process just as: E:\boost_1_33_1\boost/date_time/date_formatting.hpp(64) : fatal error C1001: INT ERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information I searched the web and find out some clues at microsoft web site http://support.microsoft.com/kb/226110/en-us and Microsoft has comfirmed that this is a bug of vc6 . But I'm thinking if there is any other way to build the boost with stlport . If anyone knows it,please give me a tip! Thank you very much! Hongquan I-ZQ

3 2

Simple regex question
by david v 04 Jul '07

04 Jul '07

Hello, I'm trying to use regex_search to look for regular expressions. regex = (david|divad) stringtosearch = "david" So I'm looking for regex above in the string "david". As you see a very basic example. I'm expecting to find two hits, but I thought I should recover "david" and "david" and not twice the same match "david" ??? Here is a snippet of the code: .... boost::smatch match; start = stringtosearch.begin(); //that would be the start of "david" end = stringtosearch.end(); // that would be the end of "david" old_pos = 0; cout << "Looking for regex:" << regex << " in string " << stringtosearch << endl; while (boost::regex_search(start,end,match,regex)) { old_pos += match.position()+1; std::string t = match[0]; std::cout << "\tFound:" << match[0] << endl; old_pos += match.length(); start = match[0].second; } catch(const std::exception &regex) { std::cerr << "Exception:" << regex.what() << std::endl; exit(-1); } Here is the output: Looking for regex:(david|divad) in string david Found david Looking for regex:(david|divad) in string david Found david As you can see, pattern "david" is found twice ??? I was expecting two different patterns to be found "david" and "divad". By the way how can I recover the total number of matches found ?? thanks, david _________________________________________________________________ MSN Messenger : discutez en direct avec vos amis ! http://www.msn.fr/msger/default.asp

2 1

[signal] How to disconnect?
by Boris 04 Jul '07

04 Jul '07

void Hello() { } boost::signal<void ()> sig; sig.connect(&Hello); // OK sig.disconnect(&Hello); // Error Can anyone tell me how I disconnect the callback function Hello? I can see in the documentation that I can call disconnect with a group_type and with a slot_type but not with a slot_function_type. I'm surprised to run into such a problem as from the point of view of a library user it can't get much easier than that? Boris PS: This is with Boost 1.33.1.

4 13

[parameter] _type not defined in function signature
by Krishna Roskin 03 Jul '07

03 Jul '07

Hey everyone, I'm trying to use Boost.Parameter to make my 9 parameter BGL function more manageable. My code is very close to the example given in the Parameter docs for depth_first_search: BOOST_PARAMETER_NAME(simplified) BOOST_PARAMETER_NAME(original) BOOST_PARAMETER_NAME(initial_vertex) BOOST_PARAMETER_NAME(final_vertex) BOOST_PARAMETER_FUNCTION( (void), simp, tag, (required (in_out(simplified), *) (original, *) ) (optional (initial_vertex, (typename graph_traits<original_type>::vertex_descriptor), original.initial_vertex) (final_vertex, (typename graph_traits<original_type>::vertex_descriptor), original.final_vertex) ) ) { simplify(simplified, original, target_io_edge_map<simplified_type, original_type>(), accumulate_edge_weight(), initial_vertex, final_vertex); } When compiling this under GCC 4.0.1 I get an "'original_type' has not been declared" error in the function signature. The original_type in the function body is fine. If I change the type of initial_vertex and final_vertex to *, then everything works fine. Any idea why this code (which is almost the same as the example given for depth_first_search) doesn't work? Thanks for any help anyone can give and I hope everyone's having a good summer. -krish I'm using 1.34 and here's what gcc -v says: Using built-in specs. Target: i686-apple-darwin8 Configured with: /private/var/tmp/gcc/gcc-5250.obj~12/src/configure --disable-checking -enable-werror --prefix=/usr --mandir=/share/man --enable-languages=c,objc,c++,obj-c++ --program-transform-name=/^[cg][^.-]*$/s/$/-4.0/ --with-gxx-include-dir=/include/c++/4.0.0 --build=powerpc-apple-darwin8 --with-arch=pentium-m --with-tune=prescott --program-prefix= --host=i686-apple-darwin8 --target=i686-apple-darwin8 Thread model: posix gcc version 4.0.1 (Apple Computer, Inc. build 5250)

2 2

[BGL] Troubles with floyd_warshall_all_pairs, johnson_all_pairs
by Alex Ivanov 03 Jul '07

03 Jul '07

Hi, guys! I'm stumbled upon a weird problem using SUBJ. functions! Lets suppose that we don't know how much Vertexes we are going to have (for instance Vertexes might be got from file or stdin). So then, in my opinion, is completely impossible to execute SUBJ functions! Let me explain: =============== int xx; //"xx" is runtime-defined vertices size. double* cmat=new(xx*xx); //"cmat" is adjacency matrix actually, it's also defined during runtime. InitCmat(); //here I fill in "cmat" array typedef adjacency_list<listS, vecS, directedS, no_property, property<edge_weight_t, double> > Graph; //This is from some example Graph G(xx); for (int i=0;i<xx;i++) { for (int j=0;j<xx;j++) { if (cmat[i*xx+j]!=0) { add_edge(i,j,cmat[i*xx+j],G); } } } //and now the most interesting part of the code //AFAIK it's impossible to declare array using directive below in runtime: double [xx][xx] D; //Compiler says the same: "C2057: expected constant expression" //even code: double [(const int)xx][(const int)xx] D; //won't work, so the only option left is to make a pointer: double* D = new [xx*xx] ; //but both "floyd_warshall_all_pairs_shortest_paths" and "johnson_all_pairs_shortest_paths" are declared to take a reference, not a pointer, so you'll get multiple compile errors, if you try to compile like below: floyd_warshall_all_pairs_shortest_paths(G, D); //the instruction above will cause multiple compile errors like this: \boost_1_34_0\boost\graph\floyd_warshall_shortest.hpp(115): error C2109: subscript requires array or pointer type P.S. Compiler is MSVC7.1, but I also read that gcc does the same. P.S.S. Sorry for duplication, if this also appears in [devel] list. =============== 1. What can I do to get this code work? 2. If no workaround is available, don't you think that it's a good idea to change the DistanceMatrix type in prototypes to pointers? Thanks in advance! //Alex.

2 2

[wave] thread safety???
by Ovanes Markarian 03 Jul '07

03 Jul '07

Hello Hartmut! I would like to start multiple preprocessing threads. Is wave thread-safe or there some points I should take in account? With Kind Regards, Ovanes Markarian

3 7