- Boost - lists.boost.org

[Announce] Boost Installer for Visual C++ 7.1/8.0
by David Abrahams 18 May '06

18 May '06

Boost Consulting is pleased to announce the availability of a Windows installer for the current Boost release (1.33.1). See: http://www.boost-consulting.com/download.html Thanks to everyone who made this possible, including Rene Rivera, Eric Niebler, Devin Smith, and especially to Daniel Wallin, who applied most of the elbow grease. Enjoy! -- Dave Abrahams Boost Consulting www.boost-consulting.com

2 1

[WIKI][SoC] Spammed!
by Andreas Huber 18 May '06

18 May '06

There has been some massive spamming of the Boost Wiki roughly 8 hours ago: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?action=rc&da… -- Andreas Huber When replying by private email, please remove the words spam and trap from the address shown in the header.

2 1

Re: [boost] [Announce] Boost Installer for Visual C++ 7.1/8.0
by Greer, Joe 18 May '06

18 May '06

> From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of Chris Little > Subject: Re: [boost] [Announce] Boost Installer for Visual C++ 7.1/8.0 > > on 5/17/06 5:46 PM, JOAQUIN LOPEZ MU?Z at joaquin(a)tid.es wrote: > > > It'd be great if the app showed a more sensible explanation > > of the problem; I'm not so sure whether the default installation > > dir should be one accessible to all users (for instance, > > the dir with moniker CSIDL_COMMON_APPDATA, typically > > "C:\Documents and Settings\All Users\Application Data".) > > You need to be at least a Power User to write to All Users\Application > Data > and Program Files so that isn't really a good option either. There is no > directory guaranteed to be writeable by all users. > > Chris I think the default should remain "Program Files". Nearly everything installs there by default and if boost were to do something different then it could potentially be more confusing. Users without permission to write to install programs presumably know that and can change the install directory to some place they have appropriate rights. Of course, the error message should convey the actual problem, if it can be determined. joe

1 0

Re: [boost] [Announce] Boost Installer for Visual C++ 7.1/8.0
by JOAQUIN LOPEZ MU?Z 18 May '06

18 May '06

----- Mensaje original ----- De: David Abrahams <dave(a)boost-consulting.com> Fecha: Miércoles, Mayo 17, 2006 11:06 pm Asunto: [boost] [Announce] Boost Installer for Visual C++ 7.1/8.0 > > Boost Consulting is pleased to announce the availability of a Windows > installer for the current Boost release (1.33.1). See: > > http://www.boost-consulting.com/download.html > Hello Dave, suggestions for improvement: when the installer is being executed by an user without administrator privileges: 1. The default installation directory (rooted in Program Files) is not allowed for writing. 2. When the installer tries to write there, it (expectedly) fails, but the error message is misleading (see attached snapshot). It'd be great if the app showed a more sensible explanation of the problem; I'm not so sure whether the default installation dir should be one accessible to all users (for instance, the dir with moniker CSIDL_COMMON_APPDATA, typically "C:\Documents and Settings\All Users\Application Data".) HTH, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Re: [boost] [Announce] Boost Installer for Visual C++ 7.1/8.0
by David Abrahams 18 May '06

18 May '06

"John Christopher" <jcxxr(a)yahoo.com> writes: > Hi, > I tried several times the Windows installer and got the above message error. The list of mirrors that have all the necessary files is only updated twice daily, and we only check for the presence of three of the files. It's possible that one of the mirrors lost a file. Try explicitly selecting a different mirror. Sheesh; maybe we need to check for all the files :(. -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 1

Library-Centric Software Design 2006, Call for Papers
by Jeremy Graham Siek 18 May '06

18 May '06

LIBRARY-CENTRIC SOFTWARE DESIGN - LCSD'06 http://lcsd.cs.tamu.edu/2006 Workshop, on October 22nd or 23rd (exact date TBA), 2006 at Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'06) conference in Portland, Oregon, October 22-26, 2006 CALL FOR PAPERS Libraries are central to all major scientific, engineering, and business areas, yet the design, implementation, and use of libraries are underdeveloped arts. This workshop is one of the first steps in the process of placing all aspects of libraries on a sound technical and scientific basis through research into fundamental issues and documentation of best practices. A software library is an organized collection of code with associated tools supporting programming in general or in specific domains, usually united by a specified set of principles and conventions. Most libraries are aimed for use by several people and in different environments. The areas of software library research include * Design and implementation of libraries * Program and system design based on libraries * Libraries supporting specific application domains, such as biology or banking * Evolution, refactoring, and maintenance of libraries * Empirical studies of library use * Performance of libraries, including benchmarking and library-based optimizations * Design of language facilities and tools in support of library definition and use * Validation, debugging, and testing of libraries * Extensibility, parameterization, and customization * Distribution of libraries * Specification of libraries and their semantics * Usability for library users and developers * Assessing quality of libraries * Documentation and teaching of libraries * Creating and supporting communities of library users * Using several libraries in combination We invite the submission of extended abstracts on software library research, including, but not limited to, the above list of topics. The extended abstracts should address issues important to libraries as a field, i.e., describe ideas or techniques that can be reused for libraries across problem domains and/or languages; they should refrain from merely describing a particular library, no matter how novel the choice of domain. As an additional criterion, the extended abstracts are reviewed against suitability for a journal publication of the corresponding full paper. For uniformity, authors should use the latest ACM SIGS conference style file (option 1) at http://www.acm.org/sigs/pubs/proceed/template.html. Submissions should be limited to 10 pages in this style. Accepted extended abstracts will be posted on the workshop's Web site prior to the workshop, and collected in a proceedings published as a Rensselaer Polytechnic Institute tech report. Authors of selected papers will be invited to submit a full paper for a special issue of a journal, to be announced later. IMPORTANT DATES Aug 11 Submission of extended abstracts Sep 12 Notification of acceptance Oct 10 Submission of final versions of the extended abstracts Oct 15 Final version posted on Workshop web pages Oct 22 or 23 Workshop SUBMISSION PROCEDURE For details of the electronic submission procedure, see the workshop's Web site, http://lcsd.cs.tamu.edu/2006. ORGANIZERS * Josh Bloch, Google Inc. * David Musser, Rensselaer Polytechnic Institute * Jaakko Järvi, Texas A&M University * Sibylle Schupp, Chalmers University of Technology * Jeremy Siek, Rice University PROGRAM COMMITTEE * Dave Abrahams, Boost Consulting * Olav Beckman, Imperial College London * Hervé Brönnimann, Polytechnic University * Cristina Gacek, University of Newcastle upon Tyne * Douglas Gregor, Indiana University * Doug Lea, State University of New York at Oswego * Andrew Lumsdaine, Indiana University * Erik Meijer, Microsoft Research * Tim Peierls, Prior Artisans LLC * Doug Schmidt, Vanderbilt University * Anthony Simons, University of Sheffield * Bjarne Stroustrup, Texas A&M University and AT&T Labs * Todd Veldhuizen, University of Waterloo In addition, the organizers will serve as program committee members, with Jaakko Järvi and Josh Bloch as program co-chairs. Primarily, the email address lcsd06(a)cs.tamu.edu should be used for questions addressed to the organizers. KEYNOTE ADDRESS There will be an invited talk by Sean Parent, Adobe Inc. WORKSHOP GOALS AND ACTIVITIES The workshop is a scientific forum for presenting original research in the design, implementation, and evaluation of software libraries. Other major activities include the identification of open questions specific to library research and the discussion of a strategic plan for establishing library research as a field. The outcome of the workshop is a combination of research contributions and specific next steps for improving the infrastructure for library research. Participants are expected to read the accepted submissions beforehand. The technical presentations, although based on the accepted papers, should not provide mere summaries of the papers. Instead, authors are encouraged to use their presentation slots (20 + 10 mins) to bring up topics for discussion. The technical presentations are mixed with scientific and organizational discussions. The discussions aim at furthering the topics of the presentations, thus their agenda will be publicly discussed among the participants and then posted on the website of the workshop. All participants are expected to come prepared with their tentative answers or thoughts. The full-day workshop starts with a keynote talk for the stimulation of discussion and concludes with a plenary discussion that decides the specific next steps for improving the infrastructure for library research. FOR MORE INFORMATION AND UPDATES please visit the workshop's Web site, http://lcsd.cs.tamu.edu/2006

1 0

n1803/n1982 “Simple Numeric Access” proposal is broken
by Oleg Abrosimov 18 May '06

18 May '06

n1803/n1982 “Simple Numeric Access” proposal is broken I’ve implemented “long stol(string& str, int base = 10)” function from n1982 proposal (see code at the bottom of this message) and faced some issues: issue 1: non-const version (“string& str”) breaks code like long l = stol("10"); usage is limited to: string s = "10"; long l = stol(s); issue 2: "function call strtol(str.c_str(), 0, base)" requirement can not be fulfilled. it conflicts with "erases the characters from the front of str that were converted to get the result" and with "Throws: invalid_argument if strtol, strtoul, strtoll, or strtoull reports that no conversion could be performed" requirements (error checking prevents usage of '0' for 2nd argument) issue 3: simple performance test shows that the function proposed is 1000 times slower compared to iostreams solution (number of samples for test were 100000) Platform: WinXP VC71 STLPort 4.6.2 all these issues (except for 2) could be solved by removing the "... erase the characters from the front of str that were converted to get the result. ..." requirement. issue 2 has a trivial solution: replace "function call strtol(str.c_str(), 0, base)" with "function call strtol with appropriate arguments". the fixed code is given in “long stol_fixed(string const& str, int base = 10)” function. this stol_fixed function is less powerful than the originally version proposed (if we forgot about issues mentioned). it disallows parsing of multiple numbers from one long string. the C-library’s strtol function allows it but if all error conditions should be checked the code becomes too complex for simple parsing task. On the other side, all issues with the stol function proposed comes from an attempt to merge in one ‘simple’ interface both needs: (1) parsing of multiple numbers from one string; (2) parsing one number from string. The (2) can be accomplished with simple function interface, but the (1) should keep a state (pointer to beginning of a char-sequence to parse from). In the n1982 proposal it was established be erasing parsed characters, but it is too expensive, because of memory [de]allocations caused. It seems that stream-like interface would be good for the (1), for example: std::string s(“10 20 30 40”); cistream cs(s); long l; cs >> l; int i; cs >> i; long arr[10]; for(int i = 0; i < 10; ++i) { cs >> arr[i]; // exception would be thrown (read after eof) } or, better: std::string s(“10 20 30 40”); cistream cs(s); long l = cs.read_long(); //convenience function int i = cs.read_int(); //convenience function long arr[10]; for(int i = 0; i < 10; ++i) { cs >> arr[i]; // exception would be thrown (read after eof) } This solution would support: cistream, costream, ciostream wcistream, wcostream, wciostream One more issue with n1982 proposal and the one I’ve proposed in this group is that both make invisible for C++ programmer that he uses wrappers around C-library I/O functions, that are incompatible with C++ locales. The solution would be to code this in components names (like the ‘c’ symbol in names above). NOTE: with from_string function that was proposed earlier by me the “parsing one number from string” task with use of C-library functions can be implemented as from_string_c function. It can not be safely merged with from_string function, because of C vs. C++ locale issues. Same applies to (w)string_from function. it’s C-wrapper counterpart would be (w)string_from_c function. Better naming suggestions are welcome. (_byc suffix?) Best, Oleg Abrosimov. // code begins #include <locale> #include <cstdlib> #include <cerrno> #include <string> // 1) "12 23 34 34 56 78" - stream-like interface is the best in C++ // 2) " 12" - conversion function is appropriate namespace std { namespace tr2 { // issue 1: non-const version breaks code like // "long l = stol("10");" // usage is limited to: // string s = "1 2"; // long l = stol(s); // long l1 = stol(s); //long stol(string const& str, int base = 10) long stol(string& str, int base = 10) { char* endptr = 0; const char* nptr = str.c_str(); long res = strtol(nptr, &endptr, base); if (endptr == nptr) { throw std::invalid_argument("stol invalid argument. str = '" + str + "'"); } if (errno == ERANGE) { switch(res) { case LONG_MAX : throw std::overflow_error("stol overflow. str = '" + str + "'"); break; case LONG_MIN : throw std::underflow_error("stol underflow. str = '" + str + "'"); break; } } // performance killer !!!!!!! str.erase(0, endptr - nptr); return res; } // issue 2: "function call strtol(str.c_str(), 0, base)" requirement can not be fulfilled // it conflicts with "erases the characters from the front of str that were converted to get the result" // and with "Throws: invalid_argument if strtol, strtoul, strtoll, or strtoull reports that no conversion could be performed" // requirements (error cheking prevents usage of '0' for 2nd argument) long stol_fixed(string const& str, int base = 10) { char* endptr = 0; const char* nptr = str.c_str(); long res = strtol(nptr, &endptr, base); if (endptr == nptr) { throw std::invalid_argument("stol invalid argument. str = '" + str + "'"); } if (errno == ERANGE) { switch(res) { case LONG_MAX : throw std::overflow_error("stol overflow. str = '" + str + "'"); break; case LONG_MIN : throw std::underflow_error("stol underflow. str = '" + str + "'"); break; } } return res; } }} // performance test code begins // it uses profiler code by Christopher Diggins #include <iostream> #include <sstream> #include <limits> #include <vector> #include <boost/profiler.hpp> #include <boost/lexical_cast.hpp> #ifdef max #undef max #endif #ifdef min #undef min #endif // 1) create a string of long values // 2) read em using std::stringstream // 3) same with stol() int main() try { // 1) create a string of long values const long lMax = std::numeric_limits<long>::max(); const long lCount = 1000000L; const long lMin = std::numeric_limits<long>::max() - lCount; std::string sLongs; std::vector<std::string> vecLongs; vecLongs.reserve(lCount); for (long l = lMax; l > lMin; --l) { std::string s = boost::lexical_cast<std::string>(l); sLongs += (s + '\t'); vecLongs.push_back(s); } sLongs = sLongs.substr(0, sLongs.length() - 1); // 2) read em using std::stringstream { boost::prof::profiler p(": read em using std::stringstream"); std::istringstream ss(sLongs); long l; volatile vl; while (!sLongs.empty() && ss.good() && !ss.eof()) { ss >> l; volatile const char* nptr = sLongs.c_str(); // uncomment it to simulate std::tr2::stol timings //sLongs.erase(0, 11); vl = l; } } // 3) same with stol_fixed() // 3.6 times faster then (2) { boost::prof::profiler p("same with stol_fixed()"); long l; volatile vl; for(long i = 0; !sLongs.empty() && i < lCount; ++i) { l = std::tr2::stol_fixed(vecLongs[i]); vl = l; } } // 4) same with stol() // 1000 times slower then iostreams solution { boost::prof::profiler p("same with stol()"); long l; volatile vl; while (!sLongs.empty()) { l = std::tr2::stol(sLongs); vl = l; } } } catch (std::exception& ex) { std::cerr << ex.what() << std::endl; } catch (...) { std::cerr << "Unknown exception occured" << std::endl; }

3 3

[SoC] Cannot evaluate applications for Statechart viewer
by Andreas Huber 18 May '06

18 May '06

Hi Jeff & other SoC moderators There is at least one application for the proposed Statechart Viewer utility. I guess we need to evaluate the application and make a recommendation to Google whether or not we'd like to see the project realized. My mentoring application (subscribed as ahd6974-spamgroupstrap <at> yahoo <dot> com) is still pending so I cannot have a look at the student applications. Could you (or any of the other moderators ) please accept my mentoring application? Thanks & Regards, -- Andreas Huber When replying by private email, please remove the words spam and trap from the address shown in the header.

1 0

[mpl][patch] mpl::begin<an_integral_c> fails to compile
by Tobias Schwinger 18 May '06

18 May '06

WHAT: ===== An instantiation of "begin<T>::type" fails to compile if T is an MPL Integral Constant. 'begin' is supposed to return 'void_' for all types that do not model the MPL Sequence concept. The bug also causes 'is_sequence' to fail. FILES: ====== - begin_end_impl.hpp.patch changes needed to make things work like documented - is_sequence.cpp.patch inclusion of the problematic case in the test suite diffed against: CVS HEAD TESTED WITH: ============ - MSVC 8.0 - MSVC 7.1 - GCC 3.4.2 Index: boost/mpl/aux_/begin_end_impl.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/mpl/aux_/begin_end_impl.hpp,v retrieving revision 1.8 diff -u -r1.8 begin_end_impl.hpp --- boost/mpl/aux_/begin_end_impl.hpp 2 Sep 2004 15:40:43 -0000 1.8 +++ boost/mpl/aux_/begin_end_impl.hpp 15 May 2006 23:22:17 -0000 @@ -17,12 +17,30 @@ #include <boost/mpl/begin_end_fwd.hpp> #include <boost/mpl/sequence_tag_fwd.hpp> #include <boost/mpl/void.hpp> +#include <boost/mpl/eval_if.hpp> +#include <boost/mpl/aux_/has_begin.hpp> #include <boost/mpl/aux_/na.hpp> #include <boost/mpl/aux_/traits_lambda_spec.hpp> #include <boost/mpl/aux_/config/eti.hpp> namespace boost { namespace mpl { + +namespace aux { + +template< typename Sequence > +struct begin_type +{ + typedef typename Sequence::begin type; +}; +template< typename Sequence > +struct end_type +{ + typedef typename Sequence::end type; +}; + +} + // default implementation; conrete sequences might override it by // specializing either the 'begin_impl/end_impl' or the primary // 'begin/end' templates @@ -32,7 +50,8 @@ { template< typename Sequence > struct apply { - typedef typename Sequence::begin type; + typedef typename eval_if<aux::has_begin<Sequence, true_>, + aux::begin_type<Sequence>, void_>::type type; }; }; @@ -41,7 +60,8 @@ { template< typename Sequence > struct apply { - typedef typename Sequence::end type; + typedef typename eval_if<aux::has_begin<Sequence, true_>, + aux::end_type<Sequence>, void_>::type type; }; }; Index: libs/mpl/test/is_sequence.cpp =================================================================== RCS file: /cvsroot/boost/boost/libs/mpl/test/is_sequence.cpp,v retrieving revision 1.5 diff -u -r1.5 is_sequence.cpp --- libs/mpl/test/is_sequence.cpp 2 Sep 2004 15:41:35 -0000 1.5 +++ libs/mpl/test/is_sequence.cpp 15 May 2006 22:55:40 -0000 @@ -12,6 +12,7 @@ // $Revision: 1.5 $ #include <boost/mpl/is_sequence.hpp> +#include <boost/mpl/int.hpp> #include <boost/mpl/list.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/range_c.hpp> @@ -25,6 +26,7 @@ MPL_TEST_CASE() { MPL_ASSERT_NOT(( is_sequence< std_vector<int> > )); + MPL_ASSERT_NOT(( is_sequence< int_<0> > )); MPL_ASSERT_NOT(( is_sequence< int > )); MPL_ASSERT_NOT(( is_sequence< int& > )); MPL_ASSERT_NOT(( is_sequence< UDT > ));

4 5

timedout async operation problem in boost::asio
by 李慧霸 18 May '06

18 May '06

I'm trying to use boost::asio, and I find that there isn't a built-in timeout parameter in any async operation. I think it's a very important function when writing real life programs, and I have done some walk around work, how can I try to contribute?

1 0