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

Variadic Max Function
by Hossein Haeri 25 Oct '10

25 Oct '10

Dear all, Is there any variadic max function in Boost? I mean something which returns the max of all the arguments it takes -- no matter how many they are. (Feel free to correct me if this use of 'variadic' is not the correct terminology.) Please note that I'm not after working on ranges of arguments. I'm rather looking for a max function which is applicable in all the examples below: int m1 = max(a1, a2); int m2 = max(a1, a2, a3); ... int mk = max(a1, a2, ..., ak); TIA, --Hossein

4 5

order of headers with Boost.Serialization and Boost.MPI
by Riccardo Murri 25 Oct '10

25 Oct '10

Hello, I'm writing a code that uses Boost.MPI to send some GMP (http://gmplib.org/) datatypes around. Since I do not want to change GMP, I'm using the "non-intrusive" serialization support (code in attached file "gmpxx_boost_serialization.hpp"). However, I'm running into a strange include-order mess: * If I include first my "gmpxx_boost_serialization.hpp" and _then_ "boost/mpi.h", then I get a slew of errors (attached file "errors.txt") * If I reverse the include order, and include "boost/mpi.h" _first_, then everything compiles fine. Is this to be expected, or am I doing something wrong in my code? For the record, I'm compiling on Ubuntu 10.10, gcc 4.4.5, arch. amd64. Thanks for any hint! Best regards, Riccardo Murri -- Riccardo Murri, Hadlaubstr. 150, 8006 Zürich (CH)

2 7

General question about C++ [slightly off topic, sorry]
by Julien Martin 25 Oct '10

25 Oct '10

Hello, I am a beginner in C++. I learn using the Linux platform. What is the best place to look for general help about C++ please? Thanks in advance, J.

2 2

Changes breaking behavior of operators /, /= and << in filesystem v3?
by Roel Vanhout 25 Oct '10

25 Oct '10

Hello, I enabled filesystem v3 after upgrading to 1.44. The api changes that caused the compiler to signal errors were rather easy to fix. However when running my program, it behaves differently from the way it used to. I narrowed it down to the following: char buf[MAX_PATH]; HRESULT res = ::SHGetFolderPath(NULL, CSIDL_APPDATA, NULL, SHGFP_TYPE_CURRENT, buf); boost::filesystem::path result(buf); // 'result' is after this "C:\Documents and Settings\rvanhout\Application Data" result /= "MyCompany"; At this point, 'result' *still* contains "C:\Documents and Settings\rvanhout\Application Data" whereas with v2 it used to contain "C:\Documents and Settings\rvanhout\Application Data\MyCompany\MyProduct". (environment: Windows (obviously) with VS 2008 (vc9)) There seem to be two way to get the desired behaviour: - initialize the path with a trailing slash, like this: boost::filesystem::path result(buf + std::string("/")); - convert 'buf' into a std::string first: std::string str(buf); boost::filesystem::path result(str); So I guess my code broke because the path is not initialized with the platform's native path encoding (although std::string is char also and it does work). Is this by design? It seems quite unintuitive to me. Second thing I was bit by is that the io streaming operator now seems to add quotes to a path with spaces in it when streaming a path object to an ostringstream. The string that is returned with .string() isn't quoted, of course, so my 'fix' is to not stream path objects anymore but add the .string() call. What's more important, is there a way to let the compiler signal these situations in my code? The way it is now, everything compiles but I have no way to know if it will actually work as it used to/should. Otherwise, it might be an idea to add #pragma warning statements to those parts for a release or two, to give people a heads up. Thanks. regards, Roel Vanhout

2 2

32 bit time stamp to date and time
by Lloyd 25 Oct '10

25 Oct '10

Hi, I am writing a simple NTP client. NTP retuns the time as a 32bit value, as the seconds since 1900. using boost date time library is it possible to convert it to a date and time (year,month,day of week,day,hour,minute,second) ? Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

4 8

this_thread::sleep hangs on local clock change
by Goldshmidt, Mark 25 Oct '10

25 Oct '10

Hello, We're using boost::thread library in a consumer application. Part of the requirements for the application is to continue operation when the user changes local time. Our problem is that if local time is set backwards X minutes during a call to this_thread::sleep(duration) the thread sleeps for X minutes+duration. This happens on MacOS in release build, but not in debug. On Windows behavior is correct. I didn't have a chance to check other platforms. I believe that the intention of this_thread::sleep(duration) is to suspend thread execution for <duration> period regardless of local clock setting, and provide consistent behavior across all platforms and build configurations. Looking into the code of libs/thread/src/pthread/thread.cpp I see that problematic flow may occur in case of detail::get_current_thread_data() is returning null. Apparently this is what causes different behavior in debug and release. The "offendinng" code tries to make sure that absolute point in time (current time + requested delay) is reached using 5 attempts and calculating necessary sleep duration each time. So if during the first sleep local clock is set backwards, second sleep will try to "compensate" for the new difference. The simplest workaround for the problem I could think of is to replace the first statement of the sleep(...) function: detail::thread_data_base* const thread_info= detail::get_current_thread_data(); with this one: detail::thread_data_base* const thread_info= get_or_make_current_thread_data(); Would it create any unwanted side effects? Is there a better way to deal with is problem? Thanks in advance, Mark This message is confidential and intended only for the addressee. If you have received this message in error, please immediately notify the postmaster(a)nds.com and delete it from your system as well as any copies. The content of e-mails as well as traffic data may be monitored by NDS for employment and security purposes. To protect the environment please do not print this e-mail unless necessary. An NDS Group Limited company. www.nds.com

1 0

extents
by Alle Meije Wink 25 Oct '10

25 Oct '10

Dear all, I am trying to load data from a file, where they are (obviously) stored as a 1D contiguous block, to a N-dimensional array. For the type of files I use N could be 1 through 8. I have code to for a 1..8-dimensional container (as a class template), but how to load in the data from the file? The multi_array_ref way to do it looked ideal, eg for a 3D float-image something like im = image_ref< float, 2 >( image->data, boost::extents[512][512] ) might work. But to code the different dimensionalities in a neat way would mean to store the extents in a variable (or something), like boost_extents_type e; switch ndim { // ndim=dim[0] 1: int dim1=dim[1]; e=boost::extents[dim1]; break; 2: int dim1=dim[1],dim2=dim[2]; e=boost::extents[dim1][dim2]; //etc } Is something like this possible with extents? Many thanks, Alle Meije

1 1

[program_options] How to use "notifier" in options_description with member functions?
by Carlos Franke 25 Oct '10

25 Oct '10

Hello! I am looking for advice about the use of the "notifier" function in program_options::options_description with class methods. My problem seems very basic to mee, yet I wasn't able to find the (any) related documentation. Here is a minimal example of what I cannot get to work: struct test { void function(int i) {std::cout << i << std::endl;} void does_not_compile() { po::options_description desc; desc.add_options() ("option", po::value<int>()->notifier(&test::function), "Option") ; } }; Compilation fails with: […] test.cpp:62:82: instantiated from here /usr/include/boost/function/function_template.hpp:225:11: error: no match for call to '(boost::_mfi::mf1<void, test, int>) (const int&)' /usr/include/boost/bind/mem_fn_template.hpp:163:7: note: candidates are: R boost::_mfi::mf1<R, T, A1>::operator()(T*, A1) const [with R = void, T = test, A1 = int] /usr/include/boost/bind/mem_fn_template.hpp:184:7: note: R boost::_mfi::mf1<R, T, A1>::operator()(T&, A1) const [with R = void, T = test, A1 = int] Sorry if this is trivial. Your help is all the more appreciated! Carlos

2 2

[asio] udp sendto performance bottleneck
by Hajo Kirchhoff 25 Oct '10

25 Oct '10

Hi all, I am porting an application from linux (suse 11) to windows. This application is sending 75.000 UDP Pakets per second, 1416 bytes each. It uses sendto. IOW: the application is calling sendto approx 75.000 times per second. The GBit LAN utilization is in the 80-90% range. This works fine under linux, but the sendto call under windows takes way longer than under linux. The overhead is so high that throughput drops from about 100MB/s to less than 20MB/s. This seems to be a known problem with the windows sendto call, as cygwin has a rather complex sendto implementation/emulation and does not suffer from this problem. They are using WSASendMsg internally and pass multiple buffers with one system call. WSASendMsg passes an array of buffers to the networking stack and my impression is that it allows sending several packets with one system call. My question: Is it possible to send multiple udp pakets with one asio::sendto call? asio::sendto accepts multiple buffers but seems to combine all them into one udp paket. Is there a way to prevent that? Specifically I want to do the following: vector<array<char, 1416> > b; b.push_back(paket1); b.push_back(paket2); b.push_back(paket3); ... m_socket.sendto(b); This should send three udp pakets with 1416 bytes each instead of one udp paket with 3*1416 bytes. How can I do that? Is this possible? Regards Hajo (Sidenote to all people with dropped udp pakets under windows Vista and 7: Have you set the network throttling index to 0xffffffff? Its a registry key and without it you'll never reach maximum throughput. Another important aspect is to set the receive buffer count in your network driver to maximum - usually 512 or more - and to use a good network card. It _is_ possible to receive close to one Gigabit/sec UDP pakets if done right. Thanks to asio it is also rather easy :-)

1 0

[1.44 MSM meta state machine] accessing objects from actions
by Hajo Kirchhoff 25 Oct '10

25 Oct '10

Hi all, what is the recommended way to use objects with an MSM state machine? I've written a state machine that handles sending data via UDP (asio). I'm using the functor front end and I have a 'send' action: struct a_send { template <typename Event, typename Fsm, typename S, typename T> void operator()(Event const& evt, Fsm &fsm, S&, T&) { // get next object from queue and post it to asio } }; My question is, how are actions supposed to access the objects that the state machine should work with? Currently my queue object is a member of the state machine itself, so I can write struct Send_ : public msm::front::state_machine_def<Send_> { string m_next_line_to_send; socket m_socket; string get_next_send_line(); }; and in my a_send action void operator()(Event &const &evt, Fsm &fsm, S&, T&) { fsm.m_next_line_to_send=fsm.get_next_send_line(); fsm.m_socket.async_write(fsm.m_next_line_to_send); } This works well as long as I am not using sub-statemachines. Here is my problem: I would like to use a substate machine for the actual sending. The main state machine has the states Disconnected, Working, Error, Shutdown. The Working state should actually be a substate machine. The problem is, when a_send gets called by the substate machine Working, the fsm object is of type Working. How can I access the member variables of the parent of a substate machine? Or is there a better way of accessing the objects the state machine should work with from actions? The tutorial explains state machines very nicely with the example of a CD player. But all the actions are empty and nowhere is explained, how you would actually access a CD player member variable or other such object so that you could actually manipulate the player to do something. Regards and thanks Hajo

1 0

[OT] Can I count on order of template matching of array dimensions
by Patrick Horgan 24 Oct '10

24 Oct '10

Off topic. Feel free to ignore. About baby template meta-programming. Working my way through "C++ Template Metaprogramming" by Abrahams and Gurtovoy, and am doing exercise 2-3/4. This: template<typename T,size_t D> struct type_descriptor<T[D]> { static std::ostream& print(std::ostream& os) { os << type_descriptor<T>() << '[' << D << ']'; return os; } }; When asked to deal with a type, for example, char[7][8][9] results in the reversal of the indices and prints char[9][8][7]. I can deal with that, (see the p.s. at the end), but it made me curious. That implies that the compiler is seeing it like ((char[9])[8])[7] which makes sense. It's an array of length 7 of arrays of length 8 of arrays of length 9 characters. That's C/C++ row-major order. It has 7 tables each of which has 8 rows of 9 characters. My question is this. Can I count on this? I don't mean row-major order, I mean that the compiler will always match in this order. Is this matching BECAUSE of row-major order, or is it compiler dependent? Wait, never mind. I just thought it through. The implication, if it had done it textually as I expected, is that T would have had type char[7][8], and the second time, T would have had type char[7] which would have been a completely different beast. Well. I'm not really asking the question now after all, just throwing this out in case it helps anyone else's understanding. Please feel free to ignore. lol! I'm also implementing all of the is_char, is_array, remove_reference etc. metafunctions instead of using the boost or c++0x ones. I figure that way by the time I get through the book I'll have more understanding. That has given me questions, because after I implement each one, I look at the boost implementation, and I look at the the gcc libstdc++ implementation of the c++0x ones and generally they are, in order of reducing complexity, boost, gcc, me. Some of the difference in complexity is that boost needs to work with different compilers on different architectures, and gcc has to work with different architectures, and I just have to get it to compile on my machine (ubuntu maverick meercat on a dell inspiron 1420 laptop) with the gcc compiler (last night's pull from trunk) that I'm using. Other times, though, it LOOKS to me like there's extra complexity for nothing (I think brought about by the desire for maximal code reuse, i.e. don't include something in your template when you can invoke another cool metafunction to do it for you, but at the expense of higher compile-time complexity). I'll hold off on questions like that, though, until I finish the book in case the answers are in there. ;p Patrick p.s. if anyone cares, here's what I came up with (with the char base type type_descriptor so you can do std::cout << type_descriptor[7][8][9]). Any comments, improvements, critiques, and alternate implementations welcome: template<typename T> struct print_dimensions { // handles exit condition for recursive print_dimensions static std::ostream& print(std::ostream&os) { return os; } }; template<typename T,size_t D> struct print_dimensions<T[D]> { static std::ostream& print(std::ostream&os) { // print our dimension and invoke ourselve recursively to do the next os << '[' << D << ']'; print_dimensions<T>::print(os); return os; } }; template<typename T> struct remove_all_dimensions { // when no more dimensions this is the stop condition for the recursion typedef T type; }; template<typename T, size_t D> struct remove_all_dimensions<T [ D ]> { // recurse to ask our type with one less dimension to define the type for us typedef typename remove_all_dimensions<T>::type type; }; template<typename T> struct type_descriptor<char> { static std::ostream& print(std::ostream& os) { os << " char"; return os; } }; template<typename T,size_t D> struct type_descriptor<T[D]> { static std::ostream& print(std::ostream& os) { // pull off all the dimensions, print the base type, then ask print_dimensions to print the dims. os << type_descriptor<typename remove_all_dimensions<T>::type>(); print_dimensions<T[D]>::print(os); return os; } }; p.p.s This is really fun! p.p.p.s Does anyone know of a mailing list to discuss beginning TMP? Patrick again ;p

2 1

asio nntp reading data
by Kraus Philipp 24 Oct '10

24 Oct '10

Hello, I try to read the newsgroup list with aiso, but I've got some problems with terminate the reading. I send the "list" command to my nntp server and get a status 200, after that I read the data with boost::asio::streambuf l_response; std::istream l_response_stream( &l_response ); boost::system::error_code error; while (boost::asio::read(m_socket, l_response, boost::asio::transfer_at_least(1), error)) std::cout << &l_response; and I see on cout the list (excerpt): xs4all.ipv6 0000000481 0000000001 y de.comp.lang.vbclassic 0000000257 0000000001 y de.comp.office-pakete.ms-office.word 0000000013 0000000001 y it.comp.dotnet 0000000074 0000000001 y free.timothy.sutter 0000000003 0000000001 y free.soc.religion.christian 0000000006 0000000001 y free.fan.taylor-momsen 0000000000 0000000001 y . After the dot, my program doesn't terminate, because the while loop doesn't break. I understand the loop in that way: I read some bytes into my stream from the socket and write them to the std::cout, if there more bytes the loop will continue otherwise (like EOF) the look should be break. I use the example at http://www.boost.org/doc/libs/1_44_0/doc/html/boost_asio/example/http/clien… because I'm new on asio, so I hope someone can explain me, the problem. Thanks for help Phil .

4 5

Finite State Filters
by Kraus Philipp 24 Oct '10

24 Oct '10

Hi, I've found http://www.boost.org/doc/libs/1_44_0/libs/iostreams/doc/tutorial/finite_sta… for filtering stream data. I've got a stream which I would filter with a state filter, because I must check some data and substitute them. Now I try to create a state struct, but I can't compile it, because the headers on the page seems to be not correct. I use a a istream, in which the data saved, now I would send them through the state machine filter for get my output data. My first try was to create the states with a boost::mpl::vector, but the example on the page doesn't work because the compiler can't find the "row" deklaration. Is there an example for a full state filter, that works? Or should I use the boost spirit? I would like to filter my stream data. Thanks for help Phil

1 0

[thread] unlock
by gast128 23 Oct '10

23 Oct '10

Hello all, When using unique_lock in combination with mutex, one should only lock / unlock thru the unique_lock, otherwise its managment gets corrupted. However the unlock fct. is also offered in the mutex, which makes it vunerable for small typo errors like (code simplified): void foo() { boost::mutex mtx; for (size_t n = 0; n != 2; ++n) { boost::unique_lock<boost::mutex> lck(mtx); //mtx.unlock(); //hang in next lock attempt lck.unlock(); //ok } } Not sure if something can be done about this; mail only meant to share information.

1 0

[date-time] Getting time from midnight in nanoseconds
by ppatel＠efs-us.com 22 Oct '10

22 Oct '10

I am resending this with proper subject line. Thanks From: Priyank Patel Sent: Friday, October 22, 2010 8:47 AM To: boost-users(a)lists.boost.org Subject: Getting time from midnight in nanoseconds Hi, Can you please tell me if there is a way to get current time in nanoseconds using boost date_time library? I have tried following but it doesn't seems to be returning values in nanoseconds. I know I have used microsec_clock and that might be the problem but not sure what alternate to use. Any help will be appreciated. hrtime_t getCurrentTime() { boost::posix_time::ptime recvTime = boost::posix_time::microsec_clock::local_time(); boost::posix_time::time_duration duration( recvTime.time_of_day() ); return duration.total_nanoseconds(); // This call returns values in microseconds (last three digits are always zero in returned value) } Thanks Priyank

3 3

Re: [Boost-users] [Pool] Problems using Boost.Pool with the Eigen matrix library
by lfrfly＠icqmail.com 22 Oct '10

22 Oct '10

>2010/10/14 <lfrfly(a)icqmail.com>: >> Since Eigen matrices and vectors use SSE and therefore require a particular >> alignment, Eigen requires that when these types (specifically, the >> compile-time sized versions) are within a struct or class, that struct be >> given the EIGEN_MAKE_ALIGNED_OPERATOR_NEW macro. > >What we do require is that e.g. Vector4f's be created at 16 byte >aligned locations. EIGEN_MAKE_ALIGNED_OPERATOR_NEW is just one way of >doing that. > >> >> But here's the problem. What if that struct is allocated by a >> boost::pool_allocator<T>? Is there any way to enforce alignment then? > >That's a question for boost::pool_allocator, not for us; if this >allocator doesn't give you 16 byte alignment, then you need a >different allocator (or just modify this allocator to meet this >criterion). > >The allocator is what gives you an address. If it's giving >non-16-byte-aligned addresses, then it can't be used. > >Benoit It's now clear that this question belongs firmly on the Boost.Pool side of the fence, so here it is---I'm wondering why boost::pool_allocator isn't designed to work with a standard-compliant allocator as its second template parameter? I tried creating a boost::fast_pool_allocator<T, Eigen::aligned_allocator<T>>, but this failed with a compile error----apparently fast_pool_allocator has an unusual notion of what concept a UserAllocator should satisfy, requiring the methods malloc() and free(). Why does it not accept any standard allocator, which will instead provide allocate() and deallocate()? This seems like a serious shortcoming.

1 0

building boost with the windows sdk 7.1
by Sean Farrow 22 Oct '10

22 Oct '10

Hi: I need to build boost with the windows sdk v7.`1. I've got vs2010 (10.0) instaloled and the sdk. If there anything specific I need to do to build with 7.1 as aposed to 7.0? Cheers Sean.

4 3

Re: [Boost-users] [boost] What's so cool about Boost.MPI?
by Brian Wood 22 Oct '10

22 Oct '10

>At Thu, 21 Oct 2010 14:25:38 -0500, >Brian Wood wrote: >> >> David Abrahams: >> > Which yields huge performance benefits and makes practical some >> > computations that might otherwise not be, due to resource constraints >> >> I've been exploring this further here - >> http://www.gamedev.net/community/forums/topic.asp?topic_id=585405 >> >> Also, from what I can tell, MPI messages are composed of one >> data type or an array of one type. > > Maybe, but the library lets you easily make arbitrarily complex data > types (described to MPI as MPI type maps). Right, I don't deny that. > >> If that's the case, I'd argue there's room for more coolness. > >What more do you want? Here's an example from my work. I have a three-tier architecture: C++ Middleware Writer (server) | C++ Middleware Writer Ambassador (server) | command line program that exits I'll introduce a struct that I don't currently use, but that might make this easier to follow. struct RequestData { uint32_t accountNumber; uint32_t transactionNumber; std::vector<File> includeFiles; std::auto_ptr<File> middleFile; uint32_t userOptions; }; I could use that to send a message, but being forced to receive those fields as a unit would be detrimental to the implementation of the C++ Middelware Writer. The account number is used to determine how the files are received. A directory is associated with each account. If I couldn't break the account number out of there, I'd have to receive the files into a temporary directory and then move them into the right directory later and get rid of the temporary directory. So I do it something like this: struct TransactionData { uint32_t transactionNumber; std::vector<File> includeFiles; std::auto_ptr<File> middleFile; uint32_t userOptions; }; That's the same as RequestData, but the account number field has been removed. This middle code describes how the message is sent (@out) and received (@in): (uint32_t, TransactionData) @out @msg_id_direct (uint32_t) @in (TransactionData) @in The sending process sends 2 items as one message. The receiving process receives the message in two steps. First it gets the account number as a uint32_t which it uses to receive the balance of the message. I believe accomplishing the same thing with MPI would involve two message ids (tags) and would require more work to be certain that the messages are sent and received in the correct order. There's needless overhead associated with the additional message id and the programming is more involved to make sure everything is kosher. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

2 1

Printer Friendly Proto
by Hossein Haeri 22 Oct '10

22 Oct '10

Dear all, How can I get a printer friendly version of the complete Proto documentation? http://boost.org/doc/libs/1_44_0/doc/html/proto.html A PDF version say? (I'm going to read it in bus, bus-stop, etc etc. So, the webpage is not very useful without internet connection. Furthermore, I take it that Chapter 15 of the Boost book is now completely outdated...) TIA, --Hossein

2 1

asio UDP message packet loss even on localhost?
by Ákos Maróy 22 Oct '10

22 Oct '10

Hi, I'm having a very basic issue: when sending a large number of UDP messages in short succession via boost::asio, even to localhost, after a few hundred messages, there seems to be a serious loss. please see a sample code here: http://pastebin.com/Bq0DnkeG the output I get is the following: $ ./async_asio 0 1 2 3 ... 939 940 941 942 943 944 958 983 1013 1049 1093 1151 1234 1363 1576 1943 b sent 2000 messages a received 955 messages so, basically while 2000 messages were sent over, only up to 944 were received so that all of them are, an then there are only sporadic messages received afterwards - a total of 955. while I understand UDP is not guaranteed to be sent over, such a level of unreliability to the localhost interface seems to be quite troublesome.. what am I doing wrong? Akos

7 14

Boost.MPI build problem: auto-configuration fails
by Kondov, Ivan 22 Oct '10

22 Oct '10

Hi, I would like to build boost.mpi from boost/1.43.0 with gcc/4.4.4, openmpi/1.4.2 on GNU/Linux 2.6.18-128.1.14.el5.8hp.2sp SMP x86_64 bjam always skips the MPI section (see below). Adding a line in user-config.jam "using mpi : /software/all/openmpi/1.4.2/bin/mpiCC ;" or "using mpi : /software/all/openmpi/1.4.2/bin/mpic++ ;" does not change the result: username@host:~/boost/boost_1_43_0$ bjam -v Boost.Jam Version 3.1.18. OS=LINUX. username@host:~/boost/boost_1_43_0$ bjam --with-mpi warning: No toolsets are configured. warning: Configuring default toolset "gcc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html Building the Boost C++ Libraries. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. Component configuration: - date_time : not building - filesystem : not building - graph : not building - graph_parallel : not building - iostreams : not building - math : not building - mpi : building - program_options : not building - python : not building - random : not building - regex : not building - serialization : not building - signals : not building - system : not building - test : not building - thread : not building - wave : not building ...found 1 target... The Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: ......................../username/boost/boost_1_43_0 The following directory should be added to linker library paths: ......................../username/boost/boost_1_43_0/stage/lib username@host:~/boost/boost_1_43_0$ which mpic++ /software/all/openmpi/1.4.2/bin/mpic++ username@host:~/boost/boost_1_43_0$ mpic++ -v Using built-in specs. Target: x86_64-linux-gnu Configured with: ../gcc-4.4.4/configure --enable-threads=posix --enable-shared --prefix=/software/all/gcc/4.4.4 --enable-languages=c,c++,fortran,java --enable-checking=release --with-tune=generic --build=x86_64-linux-gnu --host=x86_64-linux-gnu --target=x86_64-linux-gnu --with-gmp=/software/all/gcc_infrastructure/gmp/4.3.2 -with-mpfr=/software/all/gcc_infrastructure/mpfr/2.4.2 --with-ppl=/software/all/gcc_infrastructure/ppl/0.10.2 --with-cloog=/software/all/gcc_infrastructure/cloog-ppl/0.15.9 Thread model: posix gcc version 4.4.4 (GCC) Many thanks in advance for any help! Best regards, Ivan

2 4

[boost] What's so cool about Boost.MPI?
by Brian Wood 22 Oct '10

22 Oct '10

David Abrahams: >At Tue, 19 Oct 2010 16:26:04 +0200, >Thorsten Ottosen wrote: >> >> The semi-automatic, but very easy to maintain, way of >> creating/maintaining the MPI type maps (via Boost.Serialization), >> IIUC. > Which yields huge performance benefits and makes practical some > computations that might otherwise not be, due to resource constraints I've been exploring this further here - http://www.gamedev.net/community/forums/topic.asp?topic_id=585405 Also, from what I can tell, MPI messages are composed of one data type or an array of one type. If that's the case, I'd argue there's room for more coolness. Brian Wood Ebenezer Enterprises http://webEbenezer.net

3 2

Re: [Boost-users] foreach question
by Pete Bartlett 21 Oct '10

21 Oct '10

Rob Riggs wrote: > On 10/15/2010 12:27 PM, Neal Becker wrote: >> The following loop iterates over strings in result (which >> comes from boost::split). Is there a way to include the integer >> enumerator 'col' into the FOREACH loop? >> >> In python that would be spelled >> for col,s in enumerate (result): >> ... >> >> int col = 0; >> BOOST_FOREACH (std::string s, result) { >> H(row, col) = boost::lexical_cast<int> (s); >> ++col; >> } >> > > >Something like: > >template <typename Range> >auto make_counting_range(Range& range, size_t start = 0 >[..] > >would then give you: > > BOOST_FOREACH(auto t, make_counting_range(result)) > { > using boost::tuples::get; > H(row, get<0>(t)) = boost::lexical_cast<int>(get<1>(t)); > } > >(Compiled with GCC 4.4.) Even without C++0x, you can wrap this up into a reasonable interface to get e.g. std::vector<std::string> data = boost::assign::list_of("foo")("bar")("baz"); BOOST_INDEXED_EACH( std::size_t i , std::string const& s , data ) std::cout << "\n" << i << " " << s; if you tinker a little bit with BOOST_FOREACH internals - see code below, compiled on vc10 with Boost.ForEach code as in 1.43. However for the same reasons that BOOST_REVERSE_FOREACH exists (rather than just using BOOST_FOREACH( ... , make_reverse_range(r) ) - see http://lists.boost.org/boost-users/2007/07/29101.php ) this approach doesn't play well with rvalue ranges. Instead you'd have to duplicate the guts of FOREACH, as Eric did for REVERSE_FOREACH, to get a library-quality version. Pete #include <boost/range/begin.hpp> #include <boost/range/end.hpp> #include <boost/range/distance.hpp> #include <boost/range/iterator_range.hpp> #include <boost/iterator/zip_iterator.hpp> #include <boost/iterator/counting_iterator.hpp> template< typename Range > struct indexed_range { typedef boost::counting_iterator<std::size_t> it0_type; typedef typename boost::range_iterator< Range >::type it1_type; typedef boost::tuple< it0_type , it1_type > tuple_type; typedef boost::zip_iterator< tuple_type > zip_type; typedef boost::iterator_range< zip_type > type; }; template< typename Range > typename indexed_range<Range>::type make_indexed_range(Range& range , std::size_t start = 0) { return make_iterator_range( boost::make_zip_iterator( boost::make_tuple( boost::counting_iterator<size_t>(start), boost::begin(range))), boost::make_zip_iterator( boost::make_tuple( boost::counting_iterator<size_t>( boost::distance(range) + start), boost::end(range)))); } #include <boost/foreach.hpp> #define BOOST_INDEXED_EACH_IMPL(VAR1, VAR2 , COL) \ BOOST_FOREACH_PREAMBLE() \ if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_col) = BOOST_FOREACH_CONTAIN(COL)) {} else \ if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_cur) = BOOST_FOREACH_BEGIN(COL)) {} else \ if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_end) = BOOST_FOREACH_END(COL)) {} else \ for (bool BOOST_FOREACH_ID(_foreach_continue) = true; \ BOOST_FOREACH_ID(_foreach_continue) && !BOOST_FOREACH_DONE(COL); \ BOOST_FOREACH_ID(_foreach_continue) ? BOOST_FOREACH_NEXT(COL) : (void)0) \ if (boost::foreach_detail_::set_false(BOOST_FOREACH_ID(_foreach_continue))) {} else \ for (VAR1 = boost::tuples::get<0>( BOOST_FOREACH_DEREF(COL) ); !BOOST_FOREACH_ID(_foreach_continue);)\ for(VAR2 = boost::tuples::get<1>( BOOST_FOREACH_DEREF(COL) ); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true) #define BOOST_INDEXED_EACH(VAR1,VAR2,COL) BOOST_INDEXED_EACH_IMPL(VAR1,VAR2,make_indexed_range(COL)) //test scaffolding #include <vector> #include <iostream> #include <boost/assign/list_of.hpp> int main() { std::vector<std::string> data = boost::assign::list_of("foo")("bar")("baz"); BOOST_INDEXED_EACH( std::size_t i , std::string s , data ) std::cout << "\n" << i << " " << s; std::cout << "\n\n"; return 0; }

1 0

exception type thrown by ip::address::from_string()
by Alan Vella 21 Oct '10

21 Oct '10

Hi all, I've started working with the Boost ASIO library and came across a problem. I'm trying to catch exceptions thrown by boost::asio::ip::address::from_string(const std::string & str) but I don't know what the type of the exception that I should catch is. I can find no mention of this in the boost reference. Any help would be appreciated. Many thanks, Alan _______________________________________________________ Unlimited Disk, Data Transfer, PHP/MySQL Domain Hosting http://www.doteasy.com

2 1

Can't link subgraphs because remove_vertex is a TODO
by Trevor Harmon 21 Oct '10

21 Oct '10

Hi, I have two directed subgraphs that I want to link together in a particular way. To illustrate: BEFORE 1 ---> 2 ---> 3 4 ---> 5 ---> 6 AFTER 1 ---> 2 ---> 3 \---> 5 ---> 6 Note that vertex 4 is removed, and the edge that was linking 4 to 5 now links 1 to 5. Seems simple enough, but there are two problems, one minor and one major: 1) To rewire the edge's source from 4 to 1, I'd like to simply change the edge's source. But that doesn't seem possible in Boost. It appears I must remove the edge and add a new one with the desired source. This can get complicated when it comes to preserving the edge's properties, index maps, and such, but hey, at least it's doable. 2) This one I can't work around. Calling remove_vertex on a subgraph gives an assertion failure: Assertion failed: (false), function remove_vertex, file /usr/local/ boost_1_43_0/boost/graph/subgraph.hpp, line 733. It turns out that subgraph's remove_vertex method is not implemented at all, which is quite the showstopper for my project. I don't know enough about Boost to implement it myself. Any suggestions? Thanks, Trevor

2 6