- Boost-users - lists.boost.org

Boost.Lambda: failure to compile with std::set, OK withstd::vector, bug?
by Joost Kraaijeveld 04 Jan '09

04 Jan '09

Hi, Compiling the code below with std::vector goes OK, the std::set variant does not compile: /usr/include/boost/lambda/detail/actions.hpp no matching function for call to ‘boost::lambda::function_adaptor<void (Integer::*)()>::apply(void (Integer::* const&)(), const Integer&)’ /usr/include/boost/lambda/detail/actions.hpp return-statement with a value, in function returning 'void' /usr/include/c++/4.3/bits/stl_tree.h invalid type argument of ‘unary *’ Is this a bug or am I doing something wrong (gcc (Debian 4.3.2-1) 4.3.2 / Boost 1.35) ? #include <iostream> #include <vector> #include <set> #include <boost/lambda/lambda.hpp> #include <boost/lambda/algorithm.hpp> #include <boost/lambda/bind.hpp> struct Integer { Integer(int anInt) : integer(anInt){} bool operator<( const Integer& anInteger) const { return integer < anInteger.integer;} void print(){std::cout << integer << std::endl;} int integer; }; int main(int argc, char* argv[]) { // std::vector<Integer> collection(5,2); std::set<Integer> collection(5,2); // Calling a member function std::for_each(collection.begin(), collection.end(), boost::lambda::bind(&Integer::print, boost::lambda::_1)); } TIA -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

1 0

BoostCon 2009: Call for participation
by Hartmut Kaiser 04 Jan '09

04 Jan '09

Hi all, Please find below the call for participation for the 3rd annual Boost Conference in Aspen. There are only a couple of days left to submit any proposals. I'm sorry for any duplicates you might receive. Please forward this mail to any related mailing list or any person you think might be interested. Regards Hartmut ---------------------------------------------------------------------------- 3rd annual Boost Conference 2009 Aspen CO, USA, May 3-9, 2009, www.boostcon.com ---------------------------------------------------------------------------- Call for participation ---------------------- Promising to be the main face-to-face event for all things Boost (www.boost.org) BoostCon'09 opens the door to your C++ future. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and from TR1 to TR2 and the new C++0x Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at two constituencies: Boost end-users and hard-core Boost library and tool developers. The program fosters interaction and engagement within and across those two groups, with an emphasis on hands-on, participatory sessions. Session topics -------------- * Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing one or more Boost libraries * In-depth sessions on using specific libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * C++0x and how it will change life for users and library writers * TR1 and TR2 * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Other topics likely to be of great interest to Boost users and Developers. Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. Session formats --------------- Presentations ............. Presentations focus on a practitioner's ideas and experience with anything relevant to Boost and Boost users. Panels ...... Panels feature three or four people presenting their ideas and experiences relating to Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials ......... Tutorials are sessions at which instructors teach conference participants specific Boost-relevant skills. Workshops ......... Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations ............................. These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems boost libraries. Tool Vendors Presentations .......................... We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. Submitting a proposal --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other * A paragraph or two describing the topic covered, suitable for the conference web site * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half-day, full day * Alternate lengths, if you are willing to make adjustments: 10-20 minute lightning-talks, 45 minutes, 90 minutes, half-day, full day * Audience: users, developers, both * Level: basic, intermediate, advanced * A biography, suitable for the conference web site * Your contact information (will not be made public) Submission details ------------------ All submissions have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon09. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted papers will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the BoostCon CD handed out to attendees. For general information on the BoostCon 2009 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon09(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to BoostCon. Important dates --------------- Proposals for submissions due: January 10th 2009. Proposals acceptances sent (tentative program available): February 10th, 2009 Fully scheduled program available: March 1st, 2009 Session materials due: April 1st 2009. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Re: [Boost-users] How to access COM ports
by Max 04 Jan '09

04 Jan '09

Hello Rahul, I'm also interested in such stuff. Look forward to seeing your example! B/Rgds Max ----- Original Message ----- From: master master <master_4_master(a)yahoo.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] How to access COM ports Date: 2009-1-4 10:02:52 Thank youIgor. I will try it today. How to add new example to boost lib docs. If I got success I want to add serial port example to asio lib because it is lacking with the examples. Rahul Boostian :) ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

How to access COM ports
by master master 04 Jan '09

04 Jan '09

How to access COM port using BOOST library. I want to access COM3 port using boost. For socket port the below line works .... ........ boost::asio::ip::tcp::resolver::query query("localhost", "9999"); .......... ..... but how to do it for COM port I tried this .... ....... boost::asio::ip::tcp::resolver::query query("localhost", "COM3"); ......... ....... but it didn't worked. Another problem I am facing is that the network client should be platform-independent but if I use socket.h then it will not work on windows and if I use winsock then it will not run on linux/unix variants. Same for other header files like inet.h etc Rahul To create something exceptional ________________________________ -Master4Master "Confidentiality Warning: This message and any attachments are intended only for the use of the intended recipient(s), are confidential, and may be privileged. If you are not the intended recipient, you are hereby notified that any review, re-transmission, conversion to hard copy, copying, circulation or other use of this message and any attachments is strictly prohibited. If you are not the intended recipient, please notify the sender immediately by return email, and delete this message and any attachments from your system. Virus Warning: Although I have taken reasonable precautions to ensure no viruses are present in this email, I cannot accept responsibility for any loss or damage arising from the use of this email or attachment." Speak out for justice and peace, even if your voice trembles. Add more friends to your messenger and enjoy! Go to http://messenger.yahoo.com/invite/

3 4

Re: [Boost-users] [Bind] How to bind?
by Max 04 Jan '09

04 Jan '09

Thank you, Watanabe. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[Proto] Using mpl::count as proto::transform
by Joel Falcou 04 Jan '09

04 Jan '09

I have a grammar with 3 kind of terminal : A,B and C. I want to have a transform that returns a mpl::int_ which is equal to the number of B terminal that appear in expression like : A(B,B,C,B,C ..) the grammar part for matching this is currently : when< function< vargarg<my_grammar> > , mpl::count< _, terminal<B> >() > alas this always return 0 and so does : when< function< vargarg<my_grammar> > , mpl::count< _, terminal<B>::type >() > as well as the same using flatten. What do I do wrong ? -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

2 1

Re: [Boost-users] proto for array expressions
by Daniel Oberhoff 03 Jan '09

03 Jan '09

>> Sorry for the delay, the holidays, you know ... >> >> Daniel Oberhoff wrote: >> > On 2008-12-18 23:46:40 +0100, Eric Niebler <eric <at> boost- >> consulting.com> >> > said: >> > >> >> Daniel Oberhoff wrote: >> >>> >> >>> Now with proto I was wondering how hard it would be to build an >> et >> >>> engine for array math. Basically I am interested in general >> tensor >> >>> notation, and the resulting expressions should be iteratable >> >>> efficiently. think (advanced example): >> >>> >> >>> a_ij = b_i * (c_j - sum(d_ijk, k = [i-1,1]) >> >> >> >> I don't understand your notation. What are a_ij et. al.? >> > >> > Sorry, the underscripts where meant to be indices. So a is a 2d >> array, b >> > and c are 1d arrays, and d is a 3d array. The statement says: to >> > calculate a at a given index pair i,j (say 0,0) you substitute >> for i,j >> > on the right. And the sum sums over the third index of the 3d >> array d. >> > The notation further says that the bounds for the summation >> depend on >> > what you substitute for i. So to fill the array a like that you >> need to >> > substitute all values in the domian (say both indices run from 0 >> to 99 >> > for a 100x100 array), and for efficiency it would be best if the >> right >> > hand side would result in an iterator that substitutes subsequent >> all >> > values in series. >> >> OK, the syntax for your tensor expressions needs work, but I think >> what >> you're shooting for is certainly doable. How about a syntax like >> this: >> >> a[i][j] = b[i] * ( c[j] - sum( (d[i][j][k], k = (i-1,1)) ) ) >> >> This is a valid C++ expression, and I think there could be enough >> type >> information in it to make it do something useful. Here is a simple >> program that makes the above well-formed, and also defines a very >> rudimentary the grammar for tensor expressions, with transforms that >> calculate the expression's dimensionality. That's important because >> you >> don't want to assign a 2-D array to a 1-D array, for instance. >> >> [...] > > Hey, wow, a full implementation as a response :). Seems very lean > and mean, and I will have to look at it further. What I just tried > was defining two domains very similar to the calculator example, and > then I was going to have syntax with round brackets like this: > > a(i, j) = b(i) * ( c(j) - sum( d(i,j,k), k, i-1, 1) ) ) > so one domain was to be for arrays (a,b,c,d) and one for the indices > (i,j,k). But I could not get the grammar to check for the function > syntax. somehow the proto extends mechanism just passed through all > kinds of function call expressions, even though I explicitly > specified only things like: > > boost::proto::function< array_grammar, index_grammar > > > and still things like a(a) compile. any ideas where I am going wrong? > ok, answering my own question. Turns out the calculator example used a grammar with a match-all-terminals to specify terminals, so it could not distinguish between index placeholders and arrays. got that now and got my first fully grammar checked expression tree printed. now moving towards contractions, dimension checks, and actually getting my array implementation in there and generating iterators to evaluate the expressions. stay tuned for more problems (and again much thanks to eric niebler for the prompt and insightful response!). Daniel

1 0

Compile error OSX Callback problem for FSEventsCallback
by Bill McLean 03 Jan '09

03 Jan '09

I'm trying to code up a FSEvent callback using a member function. I may be suffering from a case of the post holiday stupids :) I am using both the boost::bind and boost::function libraries. I have the following declaration for declaring the signature of the FSEventCallback: typedef boost::function<void ( ConstFSEventStreamRef streamRef, // _1 void *clientCallBackInfo, // _2 size_t numEvents, // _3 void *eventPaths, // _4 const FSEventStreamEventFlags eventFlags[], // _5 const FSEventStreamEventId eventIds[] // _6 )> FSEventCallbackT; The above typedef has been derived from the OSX FSEvent API definition for the FSEventStreamCallback: typedef void ( *FSEventStreamCallback)( ConstFSEventStreamRef streamRef, void *clientCallBackInfo, size_t numEvents, void *eventPaths, const FSEventStreamEventFlags eventFlags[], const FSEventStreamEventId eventIds[] ); The skeleton of the struct that has the member function that is to be the call back is defined as: struct osx::detail { // Callback type definition static const CFAbsoluteTime LATENCY = 2.0; static const unsigned BUF_SIZE = 32768; CFStringRef pathToWatch; CFArrayRef pathsToWatch; FSEventStreamRef streamRef; void *callbackInfo; CFRunLoopRef mainLoop; boost::mutex event_mutex; typedef boost::mutex::scoped_lock lock_type; FSEventCallbackT callBack; // public methods detail( const boost::filesystem::path& base_path ); ~detail() { stop(); } void stop(); void FSEventTriggered( ConstFSEventStreamRef streamRef, // _1 void *clientCallBackInfo, // _2 size_t numEvents, // _3 void *eventPaths, // _4 const FSEventStreamEventFlags eventFlags[], // _5 const FSEventStreamEventId eventIds[] // _6 ); item get_item(); }; In the constructor I get a single compile error in the call to FSEventStreamCreate: osx::detail::detail( const boost::filesystem::path& base_path ) : base_path(base_path), stopped(false), pathToWatch(CFStringCreateWithCString(NULL,base_pa th.string().c_str(), kCFStringEncodingUTF8)), pathsToWatch(CFArrayCreate(NULL, (const void **) &pathToWatch, 1, NULL)) { callBack = boost::bind(&fsmon :: osx::detail::FSEventTriggered, this, _1, _2, _3, _4, _5, _6); streamRef = FSEventStreamCreate(NULL, &callBack, callbackInfo, pathsToWatch, kFSEventStreamEventIdSinceNow, LATENCY, kFSEventStreamCreateFlagNone ); ... } /Users/bill/ardev/CurrentDev/InternalLibs/fsmon/osxExample.cpp:111: error: cannot convert 'FSEventCallbackT*' to 'void (*)(const __FSEventStream*, void*, size_t, void*, const FSEventStreamEventFlags*, const FSEventStreamEventId*)' for argument '2' to '__FSEventStream* FSEventStreamCreate(const __CFAllocator*, void (*)(const __FSEventStream*, void*, size_t, void*, const FSEventStreamEventFlags*, const FSEventStreamEventId*), FSEventStreamContext*, const __CFArray*, FSEventStreamEventId, CFTimeInterval, FSEventStreamCreateFlags)' The typdef for FSEventCallbackT should be the same as the void (*)(const __FSEventStream*, void*, size_t, void*, const FSEventStreamEventFlags*, const FSEventStreamEventId*). I do not see what I am doing incorrectly. Thanks in advance. Bill

2 1

Re: [Boost-users] proto for array expressions
by Daniel Oberhoff 03 Jan '09

03 Jan '09

1 0

[serialization] load/save seem to different header format
by Ewald Peiszer 03 Jan '09

03 Jan '09

Hi I am using the boost s11n lib, version 1.35.0, in combination with a text archive, Windows platform, MSVC++ 2005 compiler. I have split serialize into load and save members, as indicated in the tutorial. However, it seems as if save expects a different header format (ie text stream like stringstream etc) as the corresponding load method outputs. Output of my load method: 22 serialization::archive 4 0 0 10(...) Everything before 10 is s11n housekeeping stuff, 10 is the beginning of the "real" data. Now, if a string like this is used as input for save, then the first variable that is extracted is not the 10 (what it should be) but rather a 0 (or something else which is equally wrong); instead, the 10 shows up as the value of the const unsigned int version which is one of the two parameters of load/save/serialize members. Actually, version is supposed to be 0, I do not set a version number deliberatly anywhere. Playing around, I added a third 0 to the header, resulting in 22 serialization::archive 4 0 0 0 10 and, guess what, this time save(...) correctly managed to de-serialize the data congtained in the string. I tried it also with a single seralize() member (and not splitting into save/load). Save behaviour. The relevant code is below (class code and code to (de)serialize class instance. Has anybody experienced the same or similar problems? Any help is greatly appreciated. If you need more information please ask. Regards Ewald ------------------------------------- Excerpt of class code: class Foo { (...) private: int buflen; // s11n stuff friend class boost::serialization::access; template<class Archive> void save(Archive & ar, const unsigned int version) const { // store length of buffer ar & buflen; // store data itself for (int j = 0; j < buflen; j++) ar & buffer[j]; } template<class Archive> void load(Archive & ar, const unsigned int version) { // get length of buffer ar & buflen; // create buffer with appropriate length deleteBuffer(); init(buflen); // reat data into buffer for (int j = 0; j < buflen; j++) ar & buffer[j]; } BOOST_SERIALIZATION_SPLIT_MEMBER() /* // just to try it with serialize alone: template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & buflen; } */ (...) }; ------------------------------------- // check the save operation std::stringstream ssq (std::stringstream::in | std::stringstream::out); { const Foo rp(10); boost::archive::text_oarchive oa(ssq); oa << rp; } ----------------------------------- // load { stringstream ss (stringstream::in| std::stringstream::out); ss << s11nbuf << endl; boost::archive::text_iarchive ia(ss); // restore from the archive ia >> rp; } ---------------------------------- (end of post)

3 4