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

Selecting one element per fusion sequence using mpl::int_s
by gsermaid 29 Jun '14

29 Jun '14

Dear all, I am trying to create a fusion sequence whose elements are non-const references to the elements of given set of sequences. In particular, for a given sequence of integral constants, say vector< int_<2>, int_<1> >, and two fusion sequences, say X = vector< X0, X1, X2, X3 > and Y = vector< Y0, Y1, Y2 >, I would like to create the following sequence R = vector< X2&, Y1& >, such that at<0>(R) == at<2>(X) and at<1>(R) == at<1>(Y). I am using fusion::transform to achieve the above but the transform function takes the sequences as const references so I end up with R = vector<const X2&, const Y1&>, which is not what I want. Below is my code; any ideas on how to get a sequence of non-const references would be greatly appreciated. Thanks for reading! #include <boost/fusion/include/vector.hpp> #include <boost/fusion/include/transform.hpp> #include <boost/fusion/sequence/io/out.hpp> #include <boost/fusion/include/at.hpp> #include <boost/mpl/assert.hpp> #include <boost/type_traits.hpp> #include <iostream> using namespace boost::fusion; using boost::mpl::int_; using my_ints = vector< int_<2>, int_<1> >; using my_x = vector<int, double, unsigned, float>; using my_y = vector<unsigned, float, long>; using joined = vector<my_x, my_y>; struct my_functor { template <class I, class Seq> typename result_of::at<Seq, I>::type operator()(I& i, Seq& seq) const { return boost::fusion::at<I>(seq); } }; int main() { my_ints ints; my_x x(-2, 3.5, 15, -1.3); my_y y(4, 10.1, 100); joined jv(x, y); auto tv = transform(ints, jv, my_functor()); std::cout << tv << std::endl; // prints (15 10.1) // these two fail to compile because the first argument is const-qualified BOOST_MPL_ASSERT(( boost::is_same< decltype(at_c<0>(tv)), unsigned& > )); BOOST_MPL_ASSERT(( boost::is_same< decltype(at_c<1>(tv)), float& > )); }

2 1

[fusion] maps and arrays
by Seeger, Steven D. (GSFC-444.0)[Embedded Flight Systems, Inc] 28 Jun '14

28 Jun '14

I've had some code written with boost 1.53 a while ago that uses fusion maps to define at compile-time packet structures. There is then compile time generated code that handles marshaling, unmarshaling, and packet size calculation on these structures. One of the big reasons for going this route was the ability to have arrays contained in the packets. When upgrading from boost 1.53 to 1.55 on my Gentoo box, this all broke. I posted a bug report at https://svn.boost.org/trac/boost/ticket/10133 but it seems fusion bug reports don't get much activity here. I'm contacting the list to ask if the use of arrays in containers was just a fluke or if it should be working and something happened in 1.55 (or possibly 1.54 which I never tried.) If this is not something that should be supported then I will abandon this code and go with something else. It's been really nice to work on some client/server stuff with it because the work that went in to handle the code generation saves a lot of time going forward. Thanks, Steven

2 1

Boost.Coroutine with segmentation fault
by Van Pers 27 Jun '14

27 Jun '14

Hi all, I am writting a code with Coroutines lib, this code uses coroutines in a recursive way but when I create a large number of coroutines the program crashes (segmentation fault). I write a simplified version that reproduces this error: #include<iostream> #include<cstdlib> #include<boost/coroutine/all.hpp> #include <boost/bind.hpp> #include <boost/shared_ptr.hpp> class FClass{ private: int n; public: boost::coroutines::coroutine<void>::pull_type* startResume; FClass(int n) : n(n){ startResume = NULL; } void resume(){ if(startResume && *(startResume)) (*(startResume))(); } void doSomething ( boost::coroutines::coroutine< void >::push_type & fPause){ if (n > 2){ FClass* tc1 = new FClass(--n); tc1->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind( &FClass::doSomething, tc1, _1) ); FClass* tc2 = new FClass(--n); tc2->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind( &FClass::doSomething, tc2, _1) ); fPause(); tc1->resume(); tc2->resume(); } return; } }; int main(int argc, char** argv){ int max = 10; if (argc > 1){ max = atoi(argv[1]); } FClass* firstObject = new FClass (max) ; firstObject->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind(&FClass::doSomething, firstObject, _1) ); firstObject->resume(); } gdb output reports:"memset () at ../sysdeps/x86_64/memset.S:78 ../sysdeps/x86_64/memset.S:No such file or directory." Anybody can help me? Regards, Van

1 0

core when using managed shared memory -- file based
by Sean K 27 Jun '14

27 Jun '14

I have a client and server set up where the client would write to the shared memory via a managed memory vector. And then the server would read that shared memory via the managed mapped file. It works for most situations. However, I just ran into a situation where the client -- writing to the vector, crashes. and I am trying to figure out what caused the crash. Below are the client (writer) and the server (reader) source code.... as close as to the current. Any insights as to why the vector.push_back() crashed? (this is happening on RH 5.9 64 bit OS.. but the code is compiled for 32 bit.) client: #include <iostream> #include <iostream> #include <string> #include <cstdlib> using namespace std; #include "fileheader.h" int main() { std::string data = "Hello"; char myinput[1024]; printf("enter number of count \n"); scanf("%s", &myinput); printf("You entered %s \n", myinput); data = myinput; int count = std::atoi(myinput); for (int counter = 0; counter < count; counter ++) { try { std::string tmpPath = "/var/tmp/log/testfile/ManagedMappedFile";; printf("temp directory: %s \n", tmpPath.c_str()); managed_mapped_file segment(open_or_create, tmpPath.c_str(), SHARED_MEMORY_SIZE); printf("initialized managed shared memory \n"); BString bstrData(segment.get_segment_manager()); bstrData = "hello world"; StrAllocator alloc_init(segment.get_segment_manager()); printf("ALLOCATED memory successfully\n"); BStrVector *myvec = segment.find_or_construct<BStrVector> (SHARED_VECTOR_NAME)(alloc_init); myvec->push_back(bstrData); segment.flush(); printf("inserted mystring into shmvector %d\n", counter); } catch (boost::interprocess::bad_alloc e) { printf("we caught bad alloc\n"); printf("explanation: %s\n", e.what()); printf("error code: %d\n", e.get_error_code()); printf("native: %d\n", e.get_native_error()); break; } catch (...) { printf("caught unknown exception\n"); } } printf("wrote number"); return 0; } contents of fileheader.h #ifndef FILEHEADER_H_ #define FILEHEADER_H_ #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/managed_mapped_file.hpp> #include <boost/thread/thread.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/containers/string.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/detail/tmp_dir_helpers.hpp> using namespace boost::interprocess; typedef boost::interprocess::managed_mapped_file::segment_manager segment_manager_t; typedef boost::interprocess::allocator<char, segment_manager_t> ShmemAllocator; typedef boost::interprocess::basic_string<char, std::char_traits<char>, ShmemAllocator> BString; typedef boost::interprocess::allocator<BString, segment_manager_t> StrAllocator; typedef boost::interprocess::vector<BString, StrAllocator> BStrVector; typedef std::pair<BString *, std::size_t> BStringPair; typedef std::pair<BStrVector *, std::size_t> BStrVectorPair; const char * SHARED_VECTOR_NAME = "MyVector"; const int SHARED_MEMORY_SIZE = 65536; #endif /* FILEHEADER_H_ */ g++ -m32 -fPIC -Xlinker -zmuldefs filewriter.cpp -o writer -I/cots/boost_1_42_0/include -L/cots/boost_1_42_0/lib -lboost_thread -lboost_system -pthread Server: #include <iostream> #include <string> #include <cstdlib> using namespace std; #include "../../filewriter/src/fileheader.h" int main() { int count = 0; std::string tmpPath = "/var/tmp/log/testfile"; //boost::interprocess::detail::get_tmp_base_dir(tmpPath); printf("temp directory: %s \n", tmpPath.c_str()); //boost::interprocess::detail::create_tmp_dir_and_get_filename("ManagedMappedFile", tmpPath); printf("temp file: %s \n", tmpPath.c_str()); // file_mapping::remove(tmpPath.c_str()); while (true) { try { managed_mapped_file segment(open_only, tmpPath.c_str()); if (segment.get_num_named_objects() > 0){ BStrVectorPair message = segment.find<BStrVector> (SHARED_VECTOR_NAME); printf("stuff in memory\n"); int size = message.first->size(); int retcode = 0; bool success=true; printf("PROCESS: Number of messages: %d\n", size); for (int imessage=0; imessage < size ; imessage++){ const char * const buffer = message.first->at(imessage).c_str(); int len = message.first->at(imessage).length(); printf("PROCESS: going to process this message: %s\n" , buffer); } printf("p.second: %d \n", message.second); segment.destroy<BStrVectorPair>(SHARED_VECTOR_NAME); } } catch (exception& e){ printf("exception %s", e.what()); } catch (...){ printf("unexpected exception"); } int msecs = 2000; boost::this_thread::sleep(boost::posix_time::milliseconds(msecs)); printf("sleeping...\n"); } return 0; } g++ -m32 -fPIC -Xlinker -zmuldefs filereader.cpp -o reader -I/cots/boost_1_42_0/include -L/cots/boost_1_42_0/lib -lboost_thread -lboost_system -pthread

1 0

Unexpected behavior when using as::ftime() of Boost Locale library
by Mouse Beer 27 Jun '14

27 Jun '14

Hi all, I see a mismatch when using %Y format specifier with as::ftime. It looks like it outputs the year according to the week of the year. I hope I didn't miss or misunderstand anything... please find my small test program attached for reference. It was compiled as follows: g++ -g -Wall -I /opt/boost/1.55/include -L /opt/boost/1.55/lib -lboost_locale -lboost_thread -lboost_system -licuuc -licui18n -licudata -lpthread -lrt boost_dates_test.cpp I am running on Debian Testing: $ ldd a.out linux-vdso.so.1 (0x00007fffa39fe000) libboost_locale.so.1.55.0 => /opt/boost/1.55/lib/libboost_locale.so.1.55.0 (0x00007fba3335b000) libboost_thread.so.1.55.0 => /opt/boost/1.55/lib/libboost_thread.so.1.55.0 (0x00007fba33142000) libboost_system.so.1.55.0 => /opt/boost/1.55/lib/libboost_system.so.1.55.0 (0x00007fba32f3e000) libicuuc.so.52 => /usr/lib/x86_64-linux-gnu/libicuuc.so.52 (0x00007fba32ba2000) libicui18n.so.52 => /usr/lib/x86_64-linux-gnu/libicui18n.so.52 (0x00007fba3279a000) libicudata.so.52 => /usr/lib/x86_64-linux-gnu/libicudata.so.52 (0x00007fba30f2c000) libpthread.so.0 => /lib/x86_64-linux-gnu/libpthread.so.0 (0x00007fba30d0f000) librt.so.1 => /lib/x86_64-linux-gnu/librt.so.1 (0x00007fba30b07000) libstdc++.so.6 => /usr/lib/x86_64-linux-gnu/libstdc++.so.6 (0x00007fba307fb000) libm.so.6 => /lib/x86_64-linux-gnu/libm.so.6 (0x00007fba304fa000) libgcc_s.so.1 => /lib/x86_64-linux-gnu/libgcc_s.so.1 (0x00007fba302e4000) libc.so.6 => /lib/x86_64-linux-gnu/libc.so.6 (0x00007fba2ff3a000) libboost_chrono.so.1.55.0 => /opt/boost/1.55/lib/libboost_chrono.so.1.55.0 (0x00007fba2fd34000) libdl.so.2 => /lib/x86_64-linux-gnu/libdl.so.2 (0x00007fba2fb2f000) /lib64/ld-linux-x86-64.so.2 (0x00007fba33642000) The program shows the output of cout<<date_time and cout<<as:ftime("%Y-%m...")<<date_time If a mismatch in the year is detected, a "!" is added at the end of the line. When running with en_US locale, the output is as follows: [ 10:49:40 ] [0] $ export LC_ALL=en_US.utf8 [ 10:50:39 ] [0] $ locale LANG= LANGUAGE= LC_CTYPE="en_US.utf8" LC_NUMERIC="en_US.utf8" LC_TIME="en_US.utf8" LC_COLLATE="en_US.utf8" LC_MONETARY="en_US.utf8" LC_MESSAGES="en_US.utf8" LC_PAPER="en_US.utf8" LC_NAME="en_US.utf8" LC_ADDRESS="en_US.utf8" LC_TELEPHONE="en_US.utf8" LC_MEASUREMENT="en_US.utf8" LC_IDENTIFICATION="en_US.utf8" LC_ALL=en_US.utf8 [ 10:50:41 ] [0] $ ./a.out Dec 27, 2000, 12:00:00 AM ++ 2000-12-27 00:00:00 Dec 28, 2000, 12:00:00 AM ++ 2000-12-28 00:00:00 Dec 29, 2000, 12:00:00 AM ++ 2000-12-29 00:00:00 Dec 30, 2000, 12:00:00 AM ++ 2000-12-30 00:00:00 Dec 31, 2000, 12:00:00 AM ++ 2001-12-31 00:00:00 ! Jan 1, 2001, 12:00:00 AM ++ 2001-01-01 00:00:00 Jan 2, 2001, 12:00:00 AM ++ 2001-01-02 00:00:00 Jan 3, 2001, 12:00:00 AM ++ 2001-01-03 00:00:00 Jan 4, 2001, 12:00:00 AM ++ 2001-01-04 00:00:00 Jan 5, 2001, 12:00:00 AM ++ 2001-01-05 00:00:00 Dec 27, 2001, 12:00:00 AM ++ 2001-12-27 00:00:00 Dec 28, 2001, 12:00:00 AM ++ 2001-12-28 00:00:00 Dec 29, 2001, 12:00:00 AM ++ 2001-12-29 00:00:00 Dec 30, 2001, 12:00:00 AM ++ 2002-12-30 00:00:00 ! Dec 31, 2001, 12:00:00 AM ++ 2002-12-31 00:00:00 ! Jan 1, 2002, 12:00:00 AM ++ 2002-01-01 00:00:00 Jan 2, 2002, 12:00:00 AM ++ 2002-01-02 00:00:00 Jan 3, 2002, 12:00:00 AM ++ 2002-01-03 00:00:00 Jan 4, 2002, 12:00:00 AM ++ 2002-01-04 00:00:00 Jan 5, 2002, 12:00:00 AM ++ 2002-01-05 00:00:00 Dec 27, 2002, 12:00:00 AM ++ 2002-12-27 00:00:00 Dec 28, 2002, 12:00:00 AM ++ 2002-12-28 00:00:00 Dec 29, 2002, 12:00:00 AM ++ 2003-12-29 00:00:00 ! Dec 30, 2002, 12:00:00 AM ++ 2003-12-30 00:00:00 ! Dec 31, 2002, 12:00:00 AM ++ 2003-12-31 00:00:00 ! Jan 1, 2003, 12:00:00 AM ++ 2003-01-01 00:00:00 Jan 2, 2003, 12:00:00 AM ++ 2003-01-02 00:00:00 Jan 3, 2003, 12:00:00 AM ++ 2003-01-03 00:00:00 Jan 4, 2003, 12:00:00 AM ++ 2003-01-04 00:00:00 Jan 5, 2003, 12:00:00 AM ++ 2003-01-05 00:00:00 Dec 27, 2003, 12:00:00 AM ++ 2003-12-27 00:00:00 Dec 28, 2003, 12:00:00 AM ++ 2004-12-28 00:00:00 ! Dec 29, 2003, 12:00:00 AM ++ 2004-12-29 00:00:00 ! Dec 30, 2003, 12:00:00 AM ++ 2004-12-30 00:00:00 ! Dec 31, 2003, 12:00:00 AM ++ 2004-12-31 00:00:00 ! Jan 1, 2004, 12:00:00 AM ++ 2004-01-01 00:00:00 Jan 2, 2004, 12:00:00 AM ++ 2004-01-02 00:00:00 Jan 3, 2004, 12:00:00 AM ++ 2004-01-03 00:00:00 Jan 4, 2004, 12:00:00 AM ++ 2004-01-04 00:00:00 Jan 5, 2004, 12:00:00 AM ++ 2004-01-05 00:00:00 Dec 27, 2004, 12:00:00 AM ++ 2005-12-27 00:00:00 ! Dec 28, 2004, 12:00:00 AM ++ 2005-12-28 00:00:00 ! Dec 29, 2004, 12:00:00 AM ++ 2005-12-29 00:00:00 ! Dec 30, 2004, 12:00:00 AM ++ 2005-12-30 00:00:00 ! Dec 31, 2004, 12:00:00 AM ++ 2005-12-31 00:00:00 ! Jan 1, 2005, 12:00:00 AM ++ 2005-01-01 00:00:00 Jan 2, 2005, 12:00:00 AM ++ 2005-01-02 00:00:00 Jan 3, 2005, 12:00:00 AM ++ 2005-01-03 00:00:00 Jan 4, 2005, 12:00:00 AM ++ 2005-01-04 00:00:00 Jan 5, 2005, 12:00:00 AM ++ 2005-01-05 00:00:00 Dec 27, 2005, 12:00:00 AM ++ 2005-12-27 00:00:00 Dec 28, 2005, 12:00:00 AM ++ 2005-12-28 00:00:00 Dec 29, 2005, 12:00:00 AM ++ 2005-12-29 00:00:00 Dec 30, 2005, 12:00:00 AM ++ 2005-12-30 00:00:00 Dec 31, 2005, 12:00:00 AM ++ 2005-12-31 00:00:00 Jan 1, 2006, 12:00:00 AM ++ 2006-01-01 00:00:00 Jan 2, 2006, 12:00:00 AM ++ 2006-01-02 00:00:00 Jan 3, 2006, 12:00:00 AM ++ 2006-01-03 00:00:00 Jan 4, 2006, 12:00:00 AM ++ 2006-01-04 00:00:00 Jan 5, 2006, 12:00:00 AM ++ 2006-01-05 00:00:00 Dec 27, 2006, 12:00:00 AM ++ 2006-12-27 00:00:00 Dec 28, 2006, 12:00:00 AM ++ 2006-12-28 00:00:00 Dec 29, 2006, 12:00:00 AM ++ 2006-12-29 00:00:00 Dec 30, 2006, 12:00:00 AM ++ 2006-12-30 00:00:00 Dec 31, 2006, 12:00:00 AM ++ 2007-12-31 00:00:00 ! Jan 1, 2007, 12:00:00 AM ++ 2007-01-01 00:00:00 Jan 2, 2007, 12:00:00 AM ++ 2007-01-02 00:00:00 Jan 3, 2007, 12:00:00 AM ++ 2007-01-03 00:00:00 Jan 4, 2007, 12:00:00 AM ++ 2007-01-04 00:00:00 Jan 5, 2007, 12:00:00 AM ++ 2007-01-05 00:00:00 Dec 27, 2007, 12:00:00 AM ++ 2007-12-27 00:00:00 Dec 28, 2007, 12:00:00 AM ++ 2007-12-28 00:00:00 Dec 29, 2007, 12:00:00 AM ++ 2007-12-29 00:00:00 Dec 30, 2007, 12:00:00 AM ++ 2008-12-30 00:00:00 ! Dec 31, 2007, 12:00:00 AM ++ 2008-12-31 00:00:00 ! Jan 1, 2008, 12:00:00 AM ++ 2008-01-01 00:00:00 Jan 2, 2008, 12:00:00 AM ++ 2008-01-02 00:00:00 Jan 3, 2008, 12:00:00 AM ++ 2008-01-03 00:00:00 Jan 4, 2008, 12:00:00 AM ++ 2008-01-04 00:00:00 Jan 5, 2008, 12:00:00 AM ++ 2008-01-05 00:00:00 Dec 27, 2008, 12:00:00 AM ++ 2008-12-27 00:00:00 Dec 28, 2008, 12:00:00 AM ++ 2009-12-28 00:00:00 ! Dec 29, 2008, 12:00:00 AM ++ 2009-12-29 00:00:00 ! Dec 30, 2008, 12:00:00 AM ++ 2009-12-30 00:00:00 ! Dec 31, 2008, 12:00:00 AM ++ 2009-12-31 00:00:00 ! Jan 1, 2009, 12:00:00 AM ++ 2009-01-01 00:00:00 Jan 2, 2009, 12:00:00 AM ++ 2009-01-02 00:00:00 Jan 3, 2009, 12:00:00 AM ++ 2009-01-03 00:00:00 Jan 4, 2009, 12:00:00 AM ++ 2009-01-04 00:00:00 Jan 5, 2009, 12:00:00 AM ++ 2009-01-05 00:00:00 Dec 27, 2009, 12:00:00 AM ++ 2010-12-27 00:00:00 ! Dec 28, 2009, 12:00:00 AM ++ 2010-12-28 00:00:00 ! Dec 29, 2009, 12:00:00 AM ++ 2010-12-29 00:00:00 ! Dec 30, 2009, 12:00:00 AM ++ 2010-12-30 00:00:00 ! Dec 31, 2009, 12:00:00 AM ++ 2010-12-31 00:00:00 ! Jan 1, 2010, 12:00:00 AM ++ 2010-01-01 00:00:00 Jan 2, 2010, 12:00:00 AM ++ 2010-01-02 00:00:00 Jan 3, 2010, 12:00:00 AM ++ 2010-01-03 00:00:00 Jan 4, 2010, 12:00:00 AM ++ 2010-01-04 00:00:00 Jan 5, 2010, 12:00:00 AM ++ 2010-01-05 00:00:00 Dec 27, 2010, 12:00:00 AM ++ 2011-12-27 00:00:00 ! Dec 28, 2010, 12:00:00 AM ++ 2011-12-28 00:00:00 ! Dec 29, 2010, 12:00:00 AM ++ 2011-12-29 00:00:00 ! Dec 30, 2010, 12:00:00 AM ++ 2011-12-30 00:00:00 ! Dec 31, 2010, 12:00:00 AM ++ 2011-12-31 00:00:00 ! Jan 1, 2011, 12:00:00 AM ++ 2011-01-01 00:00:00 Jan 2, 2011, 12:00:00 AM ++ 2011-01-02 00:00:00 Jan 3, 2011, 12:00:00 AM ++ 2011-01-03 00:00:00 Jan 4, 2011, 12:00:00 AM ++ 2011-01-04 00:00:00 Jan 5, 2011, 12:00:00 AM ++ 2011-01-05 00:00:00 Dec 27, 2011, 12:00:00 AM ++ 2011-12-27 00:00:00 Dec 28, 2011, 12:00:00 AM ++ 2011-12-28 00:00:00 Dec 29, 2011, 12:00:00 AM ++ 2011-12-29 00:00:00 Dec 30, 2011, 12:00:00 AM ++ 2011-12-30 00:00:00 Dec 31, 2011, 12:00:00 AM ++ 2011-12-31 00:00:00 Jan 1, 2012, 12:00:00 AM ++ 2012-01-01 00:00:00 Jan 2, 2012, 12:00:00 AM ++ 2012-01-02 00:00:00 Jan 3, 2012, 12:00:00 AM ++ 2012-01-03 00:00:00 Jan 4, 2012, 12:00:00 AM ++ 2012-01-04 00:00:00 Jan 5, 2012, 12:00:00 AM ++ 2012-01-05 00:00:00 Dec 27, 2012, 12:00:00 AM ++ 2012-12-27 00:00:00 Dec 28, 2012, 12:00:00 AM ++ 2012-12-28 00:00:00 Dec 29, 2012, 12:00:00 AM ++ 2012-12-29 00:00:00 Dec 30, 2012, 12:00:00 AM ++ 2013-12-30 00:00:00 ! Dec 31, 2012, 12:00:00 AM ++ 2013-12-31 00:00:00 ! Jan 1, 2013, 12:00:00 AM ++ 2013-01-01 00:00:00 Jan 2, 2013, 12:00:00 AM ++ 2013-01-02 00:00:00 Jan 3, 2013, 12:00:00 AM ++ 2013-01-03 00:00:00 Jan 4, 2013, 12:00:00 AM ++ 2013-01-04 00:00:00 Jan 5, 2013, 12:00:00 AM ++ 2013-01-05 00:00:00 Dec 27, 2013, 12:00:00 AM ++ 2013-12-27 00:00:00 Dec 28, 2013, 12:00:00 AM ++ 2013-12-28 00:00:00 Dec 29, 2013, 12:00:00 AM ++ 2014-12-29 00:00:00 ! Dec 30, 2013, 12:00:00 AM ++ 2014-12-30 00:00:00 ! Dec 31, 2013, 12:00:00 AM ++ 2014-12-31 00:00:00 ! Jan 1, 2014, 12:00:00 AM ++ 2014-01-01 00:00:00 Jan 2, 2014, 12:00:00 AM ++ 2014-01-02 00:00:00 Jan 3, 2014, 12:00:00 AM ++ 2014-01-03 00:00:00 Jan 4, 2014, 12:00:00 AM ++ 2014-01-04 00:00:00 Jan 5, 2014, 12:00:00 AM ++ 2014-01-05 00:00:00 When running with de_DE locale, the output is as follows: [ 10:51:42 ] [0] $ export LC_ALL=de_DE.utf8 [ 10:55:04 ] [0] $ locale LANG= LANGUAGE= LC_CTYPE="de_DE.utf8" LC_NUMERIC="de_DE.utf8" LC_TIME="de_DE.utf8" LC_COLLATE="de_DE.utf8" LC_MONETARY="de_DE.utf8" LC_MESSAGES="de_DE.utf8" LC_PAPER="de_DE.utf8" LC_NAME="de_DE.utf8" LC_ADDRESS="de_DE.utf8" LC_TELEPHONE="de_DE.utf8" LC_MEASUREMENT="de_DE.utf8" LC_IDENTIFICATION="de_DE.utf8" LC_ALL=de_DE.utf8 [ 10:55:05 ] [0] $ ./a.out 27.12.2000 00:00:00 ++ 2000-12-27 00:00:00 28.12.2000 00:00:00 ++ 2000-12-28 00:00:00 29.12.2000 00:00:00 ++ 2000-12-29 00:00:00 30.12.2000 00:00:00 ++ 2000-12-30 00:00:00 31.12.2000 00:00:00 ++ 2000-12-31 00:00:00 01.01.2001 00:00:00 ++ 2001-01-01 00:00:00 02.01.2001 00:00:00 ++ 2001-01-02 00:00:00 03.01.2001 00:00:00 ++ 2001-01-03 00:00:00 04.01.2001 00:00:00 ++ 2001-01-04 00:00:00 05.01.2001 00:00:00 ++ 2001-01-05 00:00:00 27.12.2001 00:00:00 ++ 2001-12-27 00:00:00 28.12.2001 00:00:00 ++ 2001-12-28 00:00:00 29.12.2001 00:00:00 ++ 2001-12-29 00:00:00 30.12.2001 00:00:00 ++ 2001-12-30 00:00:00 31.12.2001 00:00:00 ++ 2002-12-31 00:00:00 ! 01.01.2002 00:00:00 ++ 2002-01-01 00:00:00 02.01.2002 00:00:00 ++ 2002-01-02 00:00:00 03.01.2002 00:00:00 ++ 2002-01-03 00:00:00 04.01.2002 00:00:00 ++ 2002-01-04 00:00:00 05.01.2002 00:00:00 ++ 2002-01-05 00:00:00 27.12.2002 00:00:00 ++ 2002-12-27 00:00:00 28.12.2002 00:00:00 ++ 2002-12-28 00:00:00 29.12.2002 00:00:00 ++ 2002-12-29 00:00:00 30.12.2002 00:00:00 ++ 2003-12-30 00:00:00 ! 31.12.2002 00:00:00 ++ 2003-12-31 00:00:00 ! 01.01.2003 00:00:00 ++ 2003-01-01 00:00:00 02.01.2003 00:00:00 ++ 2003-01-02 00:00:00 03.01.2003 00:00:00 ++ 2003-01-03 00:00:00 04.01.2003 00:00:00 ++ 2003-01-04 00:00:00 05.01.2003 00:00:00 ++ 2003-01-05 00:00:00 27.12.2003 00:00:00 ++ 2003-12-27 00:00:00 28.12.2003 00:00:00 ++ 2003-12-28 00:00:00 29.12.2003 00:00:00 ++ 2004-12-29 00:00:00 ! 30.12.2003 00:00:00 ++ 2004-12-30 00:00:00 ! 31.12.2003 00:00:00 ++ 2004-12-31 00:00:00 ! 01.01.2004 00:00:00 ++ 2004-01-01 00:00:00 02.01.2004 00:00:00 ++ 2004-01-02 00:00:00 03.01.2004 00:00:00 ++ 2004-01-03 00:00:00 04.01.2004 00:00:00 ++ 2004-01-04 00:00:00 05.01.2004 00:00:00 ++ 2004-01-05 00:00:00 27.12.2004 00:00:00 ++ 2004-12-27 00:00:00 28.12.2004 00:00:00 ++ 2004-12-28 00:00:00 29.12.2004 00:00:00 ++ 2004-12-29 00:00:00 30.12.2004 00:00:00 ++ 2004-12-30 00:00:00 31.12.2004 00:00:00 ++ 2004-12-31 00:00:00 01.01.2005 00:00:00 ++ 2004-01-01 00:00:00 ! 02.01.2005 00:00:00 ++ 2004-01-02 00:00:00 ! 03.01.2005 00:00:00 ++ 2005-01-03 00:00:00 04.01.2005 00:00:00 ++ 2005-01-04 00:00:00 05.01.2005 00:00:00 ++ 2005-01-05 00:00:00 27.12.2005 00:00:00 ++ 2005-12-27 00:00:00 28.12.2005 00:00:00 ++ 2005-12-28 00:00:00 29.12.2005 00:00:00 ++ 2005-12-29 00:00:00 30.12.2005 00:00:00 ++ 2005-12-30 00:00:00 31.12.2005 00:00:00 ++ 2005-12-31 00:00:00 01.01.2006 00:00:00 ++ 2005-01-01 00:00:00 ! 02.01.2006 00:00:00 ++ 2006-01-02 00:00:00 03.01.2006 00:00:00 ++ 2006-01-03 00:00:00 04.01.2006 00:00:00 ++ 2006-01-04 00:00:00 05.01.2006 00:00:00 ++ 2006-01-05 00:00:00 27.12.2006 00:00:00 ++ 2006-12-27 00:00:00 28.12.2006 00:00:00 ++ 2006-12-28 00:00:00 29.12.2006 00:00:00 ++ 2006-12-29 00:00:00 30.12.2006 00:00:00 ++ 2006-12-30 00:00:00 31.12.2006 00:00:00 ++ 2006-12-31 00:00:00 01.01.2007 00:00:00 ++ 2007-01-01 00:00:00 02.01.2007 00:00:00 ++ 2007-01-02 00:00:00 03.01.2007 00:00:00 ++ 2007-01-03 00:00:00 04.01.2007 00:00:00 ++ 2007-01-04 00:00:00 05.01.2007 00:00:00 ++ 2007-01-05 00:00:00 27.12.2007 00:00:00 ++ 2007-12-27 00:00:00 28.12.2007 00:00:00 ++ 2007-12-28 00:00:00 29.12.2007 00:00:00 ++ 2007-12-29 00:00:00 30.12.2007 00:00:00 ++ 2007-12-30 00:00:00 31.12.2007 00:00:00 ++ 2008-12-31 00:00:00 ! 01.01.2008 00:00:00 ++ 2008-01-01 00:00:00 02.01.2008 00:00:00 ++ 2008-01-02 00:00:00 03.01.2008 00:00:00 ++ 2008-01-03 00:00:00 04.01.2008 00:00:00 ++ 2008-01-04 00:00:00 05.01.2008 00:00:00 ++ 2008-01-05 00:00:00 27.12.2008 00:00:00 ++ 2008-12-27 00:00:00 28.12.2008 00:00:00 ++ 2008-12-28 00:00:00 29.12.2008 00:00:00 ++ 2009-12-29 00:00:00 ! 30.12.2008 00:00:00 ++ 2009-12-30 00:00:00 ! 31.12.2008 00:00:00 ++ 2009-12-31 00:00:00 ! 01.01.2009 00:00:00 ++ 2009-01-01 00:00:00 02.01.2009 00:00:00 ++ 2009-01-02 00:00:00 03.01.2009 00:00:00 ++ 2009-01-03 00:00:00 04.01.2009 00:00:00 ++ 2009-01-04 00:00:00 05.01.2009 00:00:00 ++ 2009-01-05 00:00:00 27.12.2009 00:00:00 ++ 2009-12-27 00:00:00 28.12.2009 00:00:00 ++ 2009-12-28 00:00:00 29.12.2009 00:00:00 ++ 2009-12-29 00:00:00 30.12.2009 00:00:00 ++ 2009-12-30 00:00:00 31.12.2009 00:00:00 ++ 2009-12-31 00:00:00 01.01.2010 00:00:00 ++ 2009-01-01 00:00:00 ! 02.01.2010 00:00:00 ++ 2009-01-02 00:00:00 ! 03.01.2010 00:00:00 ++ 2009-01-03 00:00:00 ! 04.01.2010 00:00:00 ++ 2010-01-04 00:00:00 05.01.2010 00:00:00 ++ 2010-01-05 00:00:00 27.12.2010 00:00:00 ++ 2010-12-27 00:00:00 28.12.2010 00:00:00 ++ 2010-12-28 00:00:00 29.12.2010 00:00:00 ++ 2010-12-29 00:00:00 30.12.2010 00:00:00 ++ 2010-12-30 00:00:00 31.12.2010 00:00:00 ++ 2010-12-31 00:00:00 01.01.2011 00:00:00 ++ 2010-01-01 00:00:00 ! 02.01.2011 00:00:00 ++ 2010-01-02 00:00:00 ! 03.01.2011 00:00:00 ++ 2011-01-03 00:00:00 04.01.2011 00:00:00 ++ 2011-01-04 00:00:00 05.01.2011 00:00:00 ++ 2011-01-05 00:00:00 27.12.2011 00:00:00 ++ 2011-12-27 00:00:00 28.12.2011 00:00:00 ++ 2011-12-28 00:00:00 29.12.2011 00:00:00 ++ 2011-12-29 00:00:00 30.12.2011 00:00:00 ++ 2011-12-30 00:00:00 31.12.2011 00:00:00 ++ 2011-12-31 00:00:00 01.01.2012 00:00:00 ++ 2011-01-01 00:00:00 ! 02.01.2012 00:00:00 ++ 2012-01-02 00:00:00 03.01.2012 00:00:00 ++ 2012-01-03 00:00:00 04.01.2012 00:00:00 ++ 2012-01-04 00:00:00 05.01.2012 00:00:00 ++ 2012-01-05 00:00:00 27.12.2012 00:00:00 ++ 2012-12-27 00:00:00 28.12.2012 00:00:00 ++ 2012-12-28 00:00:00 29.12.2012 00:00:00 ++ 2012-12-29 00:00:00 30.12.2012 00:00:00 ++ 2012-12-30 00:00:00 31.12.2012 00:00:00 ++ 2013-12-31 00:00:00 ! 01.01.2013 00:00:00 ++ 2013-01-01 00:00:00 02.01.2013 00:00:00 ++ 2013-01-02 00:00:00 03.01.2013 00:00:00 ++ 2013-01-03 00:00:00 04.01.2013 00:00:00 ++ 2013-01-04 00:00:00 05.01.2013 00:00:00 ++ 2013-01-05 00:00:00 27.12.2013 00:00:00 ++ 2013-12-27 00:00:00 28.12.2013 00:00:00 ++ 2013-12-28 00:00:00 29.12.2013 00:00:00 ++ 2013-12-29 00:00:00 30.12.2013 00:00:00 ++ 2014-12-30 00:00:00 ! 31.12.2013 00:00:00 ++ 2014-12-31 00:00:00 ! 01.01.2014 00:00:00 ++ 2014-01-01 00:00:00 02.01.2014 00:00:00 ++ 2014-01-02 00:00:00 03.01.2014 00:00:00 ++ 2014-01-03 00:00:00 04.01.2014 00:00:00 ++ 2014-01-04 00:00:00 05.01.2014 00:00:00 ++ 2014-01-05 00:00:00 Sorry for the long post! Did I make any mistake in my program or is this a bug of as::ftime("%Y") formatting? Thank you yery much for your help! Regards, Holger

1 0

[Boost : icpc assignment operator compiler error with boost filter_iterator and filtered_graph
by Aniket Pugaonkar 26 Jun '14

26 Jun '14

Hello, I have the following filter iterator working perfectly with gcc 4.7 and 4.9 as well (C++11 support) But when I compile my code with intel compiler 13.0.1 version I get the following error error: *implicitly generated assignment operator cannot copy: reference member* "my_func::G" ... Details: I am using a filtered_graph over Boost::adjacency_list as my graph type (Graph_t). The vertex_iterator (from graph_traits<Graph_t> .. provides iterator range to iterate over graph vertices. I have to assign each graph vertex an id (using property_maps) and group them together by applying filter_iterator over vertex iterator. example: suppose I want to create 4 subgroups of vertices. So I create a filter predicate which is passed to filter iterator which gives me iterators <fbegin, fend> satisfying the predicate. For FOUR such groups, I get 4 pairs of filter iterators. A vector stores such filter_iterator pairs. std::vector < pair <filter_iterator_t, filter_iterator_t> > my_vector //stores iterator pair. Here is the code: vertex_iterator vbegin, vend; boost::tie(vbegin, vend) = boost::vertices(G); for (int i=0; i<4; ++i) { //for each i, create a filter_pred object my_filter_pred <Graph> filter_pred(G, i) //now create begin and end filter iterators as follows auto fbegin = boost::make_filter_iterator< my_filter_pred<Graph>, vertex_iterator> (filter_pred, vbegin, vend) auto fend = boost::make_filter_iterator< my_filter_pred<Graph>, vertex_iterator> (filter_pred, vend, vend) //fbegin, fend are of type filter iterator //insert the iterator pair into vector my_vector.push_back( std::make_pair (fbegin, fend) ); } The predicate is below : template<typename Graph> struct my_filter_pred { public: my_filter_pred() { } my_filter_pred(Graph& _G, int _value) : G(_G), value(_value) { } template<typename vertex_t> bool operator() (vertex_t vertex) { //get property "p" of vertex in graph G auto p = get (mypropertytype, vertex, G); return (p.val == value); } private: Graph& G; } ERROR : error: implicitly generated assignment operator cannot copy: reference member "my_filter_pred <Graph>::G [with ... ]" I tried to provide my own assignment operator as below: my_filter_pred& operator=(const my_filter_pred& other) { if (this != &other) G = other.G; return *this; } But it gave the same icpc error for actual typedef graph which is below : error: implicitly generated assignment operator cannot copy: " implicit generation of boost::filtered_graph_base<Graph_t> " .... Please help what should I do in this case to work. main motive : is to have a container which stores <iterator, iterator> pair which satisfies a predicate. Filter iterator was the best choice i could have to apply different filter predicate to same vertex_iterator range vbegin, vend; Thanks Aniket Pugaonkar Aniket Pugaonkar

1 0

[Bimap] Iterator invalidation
by Adam Badura 25 Jun '14

25 Jun '14

What are rules for iterator invalidation in Boost.Bimap? I have looked in documentation (version 1.55) but didn't found anything. I'm particularly interested in the bimap<...>::iterator (or ::const_iterator) invalidation. But the question remains valid for any kind of iterators. Adam Badura

2 2

Autobahn for C++: RPC and PubSub
by Tobias Oberstein 24 Jun '14

24 Jun '14

Hi, I'm happy to anounce Autobahn|Cpp - another subproject of Autobahn (http://autobahn.ws) this time for C++ 11 / Boost. Autobahn|Cpp allows remote procedure calls and publish & subscribe messaging for C++ application components and uses boost::future, continuations and Boost/ASIO as underlying network library. Here is how app code looks like: https://github.com/tavendo/AutobahnCpp/blob/master/README.md#show-me-some-c… Using Autobahn|Cpp, you can e.g. call your C++ code from JavaScript running in a browser. And much more. This is an early alpha version, things aren't fully hashed out, but there are a couple of examples included here: https://github.com/tavendo/AutobahnCpp/blob/master/README.md#examples Cheers, /Tobias

2 3

Boost Social Event at CppCon
by Jon Kalb 24 Jun '14

24 Jun '14

Boosters, Because a lot of Boosters are going to be attending CppCon, we¹d like to arrange a social event for Boosters/C++Now regulars. http://cppcon.org/ If you are planning to attend CppCon or even If you are just going to be in or around Bellevue, Washington between September 7th and 12 and you¹d like to join us for dinner, please let us know so we can get a count. Please send mail to: social(a)boost.org Once we settle on a date, etc, we¹ll let everyone who responded know when and where, so please let us know, even if you are a ³maybe.² This year¹s CppCon program includes sessions from a number of Boosters and C++Now regulars with sessions specifically about Boost Libraries. If you are considering attending, please be aware that the Early Bird registration deadline is just days away. http://cppcon.org/registration/ If you are attending, please make your hotel reservations soon. We are likely to sell out of our room block. http://cppcon.org/lodging/ I hope to see you at CppCon. Jon

1 0

Re: [Boost-users] [Boost.Test] BOOST_CHECK_THROW behaviour
by Ghyslain Leclerc 23 Jun '14

23 Jun '14

On 23/06/2014 17:19:01 +1200, Gavin Lambert wrote >>You could try submitting that as a bug report in Trac (if it's not already there), or waiting for Gennadiy Rozental's response. Done. I hope I did it properly. Never reported a bug on Boost before. Quoted our discussion, so that some more info is available if necessary. >>In the meantime, you'd need to write a more intelligent test yourself. I will do it manually. Found someone on Stack Overflow who wanted the same behavior I expected and did it. In case it helps someone, here is the snippet: try { … code that should throw ... BOOST_ERROR( “<function_name> did not throw anything. Expected a <exception_name>” ); } catch( <exception_name> const& ) { //ok, this is the expected case } catch(…) { BOOST_ERROR( “<function_name> has throw an unknown exception, but a <exception_name> was expected.” ); } and the reference: http://stackoverflow.com/questions/21774387/boost-unit-testing-exceptions Thanks again for your help.

1 0