December 2007 - Boost-users

BoostCon 2008: May 4-9
by David Abrahams 17 Dec '07

17 Dec '07

The 2nd annual Boost Conference has been scheduled for May 4-9 2008. Please save the date! Registration should open sometime in the next week. If you want to stay at the Aspen Meadows (highly recommended as it is within walking distance of the conference venue and was the site of great after-hours discussions in '07), it's especially important this year that you book your rooms early. Since, unlike last year, Aspen's airport will be open this May, demand for rooms has been heavy. In fact, the following week, which we tried to get, was snapped up by another group before we even had a chance to catch our breath, just weeks after BoostCon'07 ended. We'll be working hard on getting the program together for 2008 over the coming weeks. We hope to include many more Boost authors and contributors, and build in several more intensive library-specific sessions, to make 2008 better than ever. Please send any questions to the BoostCon planning committee at: boostcon-plan(a)lists.boost-consulting.com Those of you who didn't make it to BoostCon'07 may want to have a look at the photo gallery at http://boostcon.com/community/photos, peruse the 2007 program at http://boostcon.com/program, and check out the two trip reports mentioned here: http://boostcon.com/news/2007/Jul/16/yet-another-trip-report. See you in Aspen! -- The BoostCon Planning Committee

1 0

[review] Review of Unordered library begins today December 7
by Ion Gaztañaga 16 Dec '07

16 Dec '07

Hi all, The formal review of the Unordered library, proposed by Daniel James, begins today : *Description*: An implementation of the unordered containers specified in TR1, with most of the changes from the recent draft standards. *Author*: Daniel James *Download*: http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… The documentation is in the zip file. I've put documentation online here: http://igaztanaga.drivehq.com/unordered http://tinyurl.com/yw8wjp What to include in Review Comments ================================== Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: * 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? And finally, every review should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Unordered containers are likely to become one of the most used Boost libraries so I encourage you to review the library in order to see if Unordered fulfills all your expectations. Ion Gaztañaga - Review Manager -

6 8

[boost-users] tokenizer vs string algorithm split.
by chun ping wang 15 Dec '07

15 Dec '07

Hi I was wondering which one is better and faster to split a file of csv value of number and put it into container of double. 1.) Which option is better. // method 1. std::vector<std::string> split_string; boost::algorithm::trim(flist); boost::algorithm::split(split_string, flist, boost::algorithm::is_any_of(",")); std::vector<double> elements; BOOST_FOREACH(std::string s, split_string) { elements += boost::lexical_cast<double>(s); } // method 2. boost::char_separator<char> sep(","); boost::tokenizer<boost::char_separator<char> > tokens(flist, sep); std::vector<double> elements; BOOST_FOREACH(std::string token, tokens) { elements += boost::lexical_cast<double>(token); } 2.) When is it better to use string algorithm split instead of tokenizer and vice versa.

6 10

Re: [Boost-users] Linking problem trying to use mutex, condition
by Brian Krahmer 15 Dec '07

15 Dec '07

So it turns out that I wasn't linking against the thread library. I assumed there wasn't a thread library (all implemented in headers) because when I tried to get it to build by doing 'bjam --with-libraries=regex,serialization,thread', it didn't do anything with thread. I then tried 'bjam --with-thread --with-regex --with-serialization', and that seems to work. BTW, I tried building using a parallel make (-j3), but there were errors in the build process. It appears perhaps there's a bug in the parallel compilation or the jamfile for thread. thanks, brian

2 1

Interprocess documentation
by Stefan Funck 15 Dec '07

15 Dec '07

Hi, could someone please give a hint where to find the interprocess documentation? http://igaztanaga.drivehq.com/interprocess seems to be broken, also http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/interproces… as given in doc/html/interprocess.html from the current svn trunk does not work. thanks, Stefan

3 2

Linking problem trying to use mutex, condition
by Brian Krahmer 15 Dec '07

15 Dec '07

I'm trying to compile a test program using the ReadWriteMutex example at http://paulbridger.net/read_write_lock, and I'm getting about 30 linking errors referring to mutex, lock_error and the like. I'm on an Ubuntu system, using boost 1.33.1. I'm including "boost/thread/mutex.hpp" and "boost/thread/condition.hpp". I can post more details, but was wondering if anybody was familiar with this problem. thanks, brian

1 0

Can Lambda dynamic create template parameter？
by Guo Xu 15 Dec '07

15 Dec '07

I want to implement the grammar like this, to create template parameter dynamicly, set< int, ( _1 > _2 ) > intset; can lambda do it ,and how to ?

2 1

[signals, MSVC8.1] Hang in signals constructor when upgrading from 1.33.1 to 1.34.1
by Kris Braun 14 Dec '07

14 Dec '07

Hi there, Trying to upgrade from 1.33.1 to 1.34.1 on Visual Studio 2005, I'm experiencing an infinite loop in the signals code. It happens when named_slot_map constructor calls groups.clear(), which ends up in some standard library iterator cleanup code (_Clean_up_iter_debug). It appears there's a circular link in some pointers to parents. This is happening on a debug build with both Boost and my project compiled with _HAS_ITERATOR_DEBUGGING=0. The problem does not appear on non-debug builds. The signals constructor is running inside the function below, which is called during C++ static initialization: static boost::signal< void( E& ) >& GetHandler( void ) { static boost::signal< void( E& ) > _Handler; return _Handler; } Does anybody have any idea what has changed between 1.33.1 and 1.34.1 that would cause this behaviour change? Thanks, Kris --------------------------------------------------------------------- This transmission (including any attachments) may contain confidential information, privileged material (including material protected by the solicitor-client or other applicable privileges), or constitute non-public information. Any use of this information by anyone other than the intended recipient is prohibited. If you have received this transmission in error, please immediately reply to the sender and delete this information from your system. Use, dissemination, distribution, or reproduction of this transmission by unintended recipients is not authorized and may be unlawful.

1 0

[Boost.MultiIndex] map by string and search by char*
by dariomt＠gmail.com 14 Dec '07

14 Dec '07

I'm trying to use Boost-MultiIndex to achieve: 1) the equivalent (or similar) functionality & performance of an std::map<std::string, ValType> with searches by std::string 2) perform searches by const char* without creating a temporary std::string and without copying the actual char's --------------------------code----------------------- #include <string> #include <functional> #include <cassert> #include <boost/multi_index_container.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/member.hpp> using namespace boost; using namespace boost::multi_index; struct elem { std::string m_key; double m_value; elem( const std::string& key, double value) : m_key(key), m_value(value) {} }; struct less_string : std::less<std::string> { using std::less<std::string>::operator(); // use operator< bool operator() (const std::string& lhs, const char* rhs) const {return lhs < rhs;} bool operator() (const char* lhs, const std::string& rhs) const {return lhs < rhs;} }; typedef multi_index_container< elem, indexed_by< ordered_unique< member<elem,std::string,&elem::m_key>, less_string > > > elem_set; int main() { elem_set s; s.insert( elem("p", 1.0) ); assert( s.find("p") != s.end() ); // no temporary and no data copy! I did it! return 0; } --------------------------code----------------------- Is this the right way to go? Any hint will be appreciated. TIA PS: I know I'm actually getting something more like a std::set, it's ok

2 1

BGL support for graphml
by abhishek.v＠tcs.com 14 Dec '07

14 Dec '07

Hi.. I have downloaded the graphml.cpp, graphml.hpp, reader_test.cc and the test xml file. To check whether the code posted by Tiago on http://article.gmane.org/gmane.comp.lib.boost.devel/146836 to see if it is working fine or not. I m able to build the project and link the libraries of expat as well in Dev-Cpp. But while executing the exe file i m getting an error "This application has requested the Runtime to terminate it in an unusual way. Please contact the application's support team for more information." What could be the reason for this. Also i want to know from where i should download the latest version of graphml.cpp and graphml.hpp. As i have downloaded the latest version of boost from the sourceforge site but in this the graphml.cpp and graphml.hpp files are missing. Currently i m working with the version of Tiago but let me know if stable version are going to be included in the standard boost package or this itself is a the latest and stable version and i m missing out something. Thanks Abhishek Vyas ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

1 0