March 2009 - Boost - lists.preview.boost.org

Boost.Asio and Steinberg ASIO
by Alexander Churanov 19 Mar '09

19 Mar '09

Hi folks! I wonder how Boost.Asio is related to Steinberg ASIO? It seems that ASIO is an older technology and it's name is a registered trademark. http://www.steinberg.net/en/company/steinberg_technology.html It's a source for confusion. For the first time I've noticed the Boost.Asio library, I was thinking it's an STL-compliant facade for Steinberg ASIO :-) Alexander Churanov

3 2

[gsoc][student] Proposal
by Kasra 19 Mar '09

19 Mar '09

Hi All, I was wondering how the community is feeling about a new library proposal? Since few month ago I started talking about boost.crypto on the mailing list and considered its implications with few (namely Kevin Sopp). At present the library has more than 60K LOC. Any thought? :D -- Kasra Nassiri

2 1

[asio] global timer cancellation?
by Brian and Victoria 19 Mar '09

19 Mar '09

Hi, I've got various objects that make use of the asio deadline timer to schedule events. The problem is that there isn't a central repository of timer references that I can walk to cancel them when shutting down asio. I'd like to be able to just tell asio to cancel any pending work and have the thread(s) return. Is this possible? I came across the io_service::work class but haven't yet found an example of how it works. Thanks, Brian

2 1

dynamic_bitset count
by Andreas Klein 19 Mar '09

19 Mar '09

Hello. Sorry for multiple posts. Hopplfully I got I now right. ----------------------------------------------------- Dear boost developers, I checked the implementation of boost::dynamic_bitset::count and find that it uses a table look up. This is not optimal. First on 64-bit machines divide-and-conquer algorithms are faster than table look up and save even memory. Second if the bitset contains several words, there are for both 32 and 64 bit machines population count algorithms that are faster than the simple loop over all words used by boost. Together with Y. Edel I developed a new version,which saves 60% against the simple algorithm. We put the code online (http://cage.ugent.be/~klein/popc.html) A disadvantage of our implementation is that we relay on aggressive optimization (-O3) of the compiler. If you are searching a compromise between speed and code complexity. The first iteration of the Harley-Seal-method (25% faster than the simple loop) would be a candidate. You find this and other population count algorithms on our homepage, too. If there is interest I can add one of the advance algorithms in boost. Best wishes Andreas Klein

2 2

[shared_ptr] calling shared_from_this from constructor
by Пюрецкий 18 Mar '09

18 Mar '09

Hi, A have just get latest version from SVN. And now my code does not work. I found problem in a changed version of shared_ptr and shared_from_this (revision 51485). Now calling shared_from_this in constructor throw's boost::bad_weak_ptr exception. -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.

2 1

boost::is_less::result_type
by Arno Schödl 18 Mar '09

18 Mar '09

Shouldn't boost::is_less et. al. define typedef bool result_type; for interoperability with boost::bind? Arno -- Dr. Arno Schoedl · aschoedl(a)think-cell.com Technical Director think-cell Software GmbH · Invalidenstr. 34 · 10115 Berlin, Germany http://www.think-cell.com · phone +49-30-666473-10 · toll-free (US) +1-800-891-8091 Directors: Dr. Markus Hannebauer, Dr. Arno Schoedl · Amtsgericht Charlottenburg, HRB 85229

3 4

Google SOC Mentors?
by John Maddock 18 Mar '09

18 Mar '09

Would folks willing to mentor students for this years GSOC please step forward and make themselves known? We need both people to assist in assessing the student applications, and experienced Boosters to mentor the students themselves. We really need to get some new blood into this if our SOC participation is to continue - we can't rely on the "usual suspects" taking this on year after year - in short, "Your Boost Needs You!". Regards, John Maddock.

11 11

Re: [boost] [lexical_cast] Strange behaviour
by raindog＠macrohmasheen.com 18 Mar '09

18 Mar '09

What exactly do you think -1 is as an unsigned int? ------Original Message------ From: Robert Jones Sender: boost-bounces(a)lists.boost.org To: boost(a)lists.boost.org ReplyTo: boost(a)lists.boost.org Sent: Mar 18, 2009 9:03 AM Subject: [boost] [lexical_cast] Strange behaviour Trying again 'cos I mucked up the code last time! This code #include <iostream> #include <boost/lexical_cast.hpp> int main() { using namespace std; try { unsigned int u=boost::lexical_cast<unsigned int>("-1"); cout << u << '\n'; } catch(const std::exception&) { cout << "Exception" << '\n'; } } produces 4294967295 on MSVC7 & 8 rather than an exception. Is it supposed to do this? Rob. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost Sent from my Verizon Wireless BlackBerry

2 1

Re: [boost] Range_Ex and Multi-Index: conflicting mpl::begin and boost::begin
by JOAQUIN M. LOPEZ MUÑOZ 18 Mar '09

18 Mar '09

________________________________________ De: boost-bounces(a)lists.boost.org [boost-bounces(a)lists.boost.org] En nombre de Joaquin M Lopez Munoz [joaquin(a)tid.es] Enviado el: miércoles, 18 de marzo de 2009 19:49 Para: boost(a)lists.boost.org Asunto: Re: [boost] Range_Ex and Multi-Index: conflicting mpl::begin and boost::begin > Sandeep Gupta <gupta.sandeep <at> gmail.com> writes: > > > Thanks for looking into this Vicente. I am not directly adding > > boost::mpl to the namespace. Please find attached the code. Below is > > the full error. > > > [...] > > /home/sandeep/Computing/boost_1_38_0/boost/range_ex/./detail/ > > adl_begin_end.hpp:27: > > error: in call to ‘begin’ [...] Adding to my previous post, I found the following in the Boost users list: http://lists.boost.org/boost-users/2006/01/16513.php Seems related, doesn't it? Alas the thread concludes with no satisfactory answer. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Range_Ex and Multi-Index: conflicting mpl::begin and boost::begin
by Sandeep Gupta 18 Mar '09

18 Mar '09

Hi, I am under-impression that for_each construct of range_ex for all container concepts. However when I tried with multi-index it gave conflicting errors. Attached below is the code and corresponding errors. code: typedef multi_index_container< std::pair<value_type,int>, indexed_by< ordered_unique<member<pair<value_type,int>, value_type, &pair<value_type, int>::first> >, ordered_unique<member<pair<value_type,int>, int, &pair<value_type, int>::second> > > > mic; mic serialStore; for_each(serialStore, std::cout<<boost::lambda::_1<<' '); error: /home/sandeep/Computing/boost_1_38_0/boost/mpl/begin_end_fwd.hpp:22: error: ‘template<class Sequence> struct boost::mpl::begin’ is not a function, /home/sandeep/Computing/boost_1_38_0/boost/range/begin.hpp:96: error: conflict with ‘template<class T> typename boost::range_iterator::type boost::begin(T&)’ /home/sandeep/Computing/boost_1_38_0/boost/range_ex/./detail/adl_begin_end.hpp:27: error: in call to ‘begin’ /home/sandeep/Computing/boost_1_38_0/boost/mpl/begin_end_fwd.hpp:23: error: ‘template<class Sequence> struct boost::mpl::end’ is not a function, /home/sandeep/Computing/boost_1_38_0/boost/range/end.hpp:92: error: conflict with ‘template<class T> typename boost::range_iterator::type boost::end(T&)’ /home/sandeep/Computing/boost_1_38_0/boost/range_ex/./detail/adl_begin_end.hpp:35: error: in call to ‘end’ I apologies in advance if this is due to trivial omission. Thanks -sandeep

4 4