November 2012 - Boost-users

Updated serialization performance tests
by Brian Wood 16 Nov '12

16 Nov '12

Shalom I've updated this page -- http://webEbenezer.net/comparison.html with results from Boost 1.52. A few notes about the testing: I decided to use -O2 on the Linux/g++ tests. In previous tests I used -O3. I hadn't updated the Windows test results since the Boost 1.48 time-frame. Around Boost 1.51 I had to start building the serialization library in Boost with runtime-link=static in order to get the Windows tests to build. I haven't understood why that became necessary, but the results for the serialization library in Boost seem to have been adversely affected by this. On Windows, I now report that tests built with the serialization library in Boost are over 1.8 times slower than parallel Ebenezer tests. Previously I reported the tests built with the serialization library in Boost were between 1.7 and 1.8 times slower than the Ebenezer tests. -- Brian Ebenezer Enterprises -- making programming fun again. http://webEbenezer.net

1 0

how to build a release version of my application from source control using boost libs?
by Anil 16 Nov '12

16 Nov '12

Trying to build a release version from source code put into Clearcase source control. Boost is installed on my computer hard disk. what libraries should I copy to the repository? I tried copying libboost_regex-vc90-mt-gd-1_51.lib but it still gave an error. 1>------ Build started: Project: MyApplication, Configuration: Release Win32 ------ 1>Compiling... 1>MyApplication.cpp 1>.\MyApplication.cpp(40) : warning C4627: '#include <boost/property_tree/ptree.hpp>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(41) : warning C4627: '#include <boost/property_tree/xml_parser.hpp>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(42) : warning C4627: '#include <boost/foreach.hpp>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(43) : warning C4627: '#include <boost/lexical_cast.hpp>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(44) : warning C4627: '#include <string>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(45) : warning C4627: '#include <set>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(46) : warning C4627: '#include <exception>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(47) : warning C4627: '#include <iostream>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(48) : warning C4627: '#include <fstream>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(49) : warning C4627: '#include "MyApplication.h"': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(50) : warning C4627: '#include <boost/filesystem.hpp>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(51) : warning C4627: '#include <boost/regex.hpp>': skipped when looking for precompiled header use 1> Add directive to 'stdafx.h' or rebuild precompiled header 1>.\MyApplication.cpp(875) : fatal error C1010: unexpected end of file while looking for precompiled header. Did you forget to add '#include "stdafx.h"' to your source? 1>Build log was saved at "file://a:\MyApplication\Release\BuildLog.htm" 1>MyApplication - 1 error(s), 12 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== how to build a release version of my application from source control using boost libs?

1 0

Newbie-Question: recursive_directory_iterator and Unicode
by Andy 16 Nov '12

16 Nov '12

Hi all, i'm using the following code-part to show a file-listing of the current directory: boost::locale::generator gen; std::locale l = gen(""); std::locale::global(l); boost::filesystem::recursive_directory_iterator it(L"."); boost::filesystem::recursive_directory_iterator itEnd; while (it != itEnd) { if (boost::filesystem::status_known(it->status()) && boost::filesystem::is_regular(it->status())) { cout << it->path() << endl; } ++it; } This work's great but not if some files contain unicode-characters. If so, then a lot of ????'s will be printed. Could anyone show me how to print those unicode-characters to stdout? Using wcout won't print anything. I'm new to boost and unicode and i'm not sure if this is a problem of boost! I'm using MinGW (gcc (tdm-1) 4.6.1), Boost 1-52, ICU 50.1 - Output goes to the windows command-prompt (Already tried "chcp 65001") Thanks, Andreas

2 1

Build boost 1.52 on Mac OS X 10.8.2 with Clang c++11
by Kikohs x 15 Nov '12

15 Nov '12

Hello, I cannot compile boost with clang 3.1 on Mac os x 10.8.2. This is what I did: ./boostrap.sh --with-toolset=clang ./b2 toolset=clang cxxflags="-std=c++11 -stdlib=libc++" linkflags="-stdlib=libc++" I also tried without chrono, test, wave and signals. I tried a user-config.jam with using clang-darwin This is the error I have for almost every file: /boost/config/select_stdlib_config.hpp:18:12: fatal error: 'cstddef' file not found It is kind of similar to [ http://stackoverflow.com/questions/8486077/how-to-compile-link-boost-with-c… ] I do have the latest Xcode 4.5.2 with the command line tools installed. Here is part of the console output: Kikohs:trunk kikohs$ ./b2 toolset=clang cxxflags="-std=c++11 -stdlib=libc++" linkflags="-stdlib=libc++" Performing configuration checks - 32-bit : no - 64-bit : yes - x86 : yes - has_icu builds : no warning: Graph library does not contain MPI-based parallel components. note: to enable them, add "using mpi ;" to your user-config.jam - gcc visibility : yes - long double support : no 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. Building the Boost C++ Libraries. - iconv (libc) : no - iconv (separate) : yes - icu : no - icu (lib64) : no Component configuration: - atomic : building - chrono : building - context : building - date_time : building - exception : building - filesystem : building - graph : building - graph_parallel : building - iostreams : building - locale : building - math : building - mpi : building - program_options : building - python : building - random : building - regex : building - serialization : building - signals : building - system : building - test : building - thread : building - timer : building - wave : building ...patience... ...patience... ...patience... ...patience... ...found 8672 targets... ...updating 1127 targets... common.mkdir bin.v2/libs/atomic common.mkdir bin.v2/libs/atomic/build common.mkdir bin.v2/libs/atomic/build/clang-darwin-4.2.1 common.mkdir bin.v2/libs/atomic/build/clang-darwin-4.2.1/debug clang-darwin.compile.c++ bin.v2/libs/atomic/build/clang-darwin-4.2.1/debug/lockpool.o In file included from libs/atomic/src/lockpool.cpp:1: ./boost/atomic.hpp:10:10: fatal error: 'cstddef' file not found #include <cstddef> ^ 1 error generated. "clang++" -x c++ -O0 -g -std=c++11 -stdlib=libc++ -O0 -fno-inline -Wall -g -DBOOST_ALL_NO_LIB=1 -DBOOST_ATOMIC_DYN_LINK=1 -DBOOST_ATOMIC_SOURCE -I"." -c -o "bin.v2/libs/atomic/build/clang-darwin-4.2.1/debug/lockpool.o" "libs/atomic/src/lockpool.cpp" Any help would be greatly appreciated, Thank you, Kikohs

2 2

A Special Note for Boost 1.52.0 and Higher - how this affects me?
by Adam Romanek 15 Nov '12

15 Nov '12

Hi, I've just read the Special Note for Boost 1.52.0 and Higher. I must say that I don't fully understand what's going on and how this affects me. I'm using some of Boost's libraries with gcc on Ubuntu. Most often it's gcc 4.4.3, sometimes 4.6.3 but without C++0x mode. Does the change in boost::result_of affect me in any way? Can it make my code fail to compile or make it behave in a different way than before? I just don't understand whether a switch from Boost 1.51.0 to 1.52.0 may do any harm to my code. WBR, Adam Romanek

3 2

[fusion] remove_if and as_vector with Placeholder Expression as predicate
by Felipe Magno de Almeida 15 Nov '12

15 Nov '12

Hello, I'm trying to remove_if a few elements from a fusion sequence. But it is instantiating my predicate with the placeholder from MPL later on. Including with as_vector. The following code generates the error code I'm pasting by the end of the message. I'm using GCC 4.7.2 and Linux x86_64. If I wrap meta_func<mpl::_1> in a mpl::lambda<>::type then the errors following the first error messages is what I get. I'm not sure if I'm doing something wrong here. If anyone could please shed some light, I would really appreciate it. #include <boost/fusion/include/as_vector.hpp> #include <boost/fusion/include/remove_if.hpp> namespace mpl = boost::mpl; namespace fusion = boost::fusion; struct element { typedef mpl::false_ type; }; template <typename T> struct meta_func { typedef typename T::type type; }; int main() { fusion::vector<element, element> e; fusion::as_vector(fusion::remove_if<meta_func<mpl::_1> >(e)); } -- main.cpp: In instantiation of ‘struct meta_func<mpl_::arg<1> >’: ../boost/boost_1_51_0/boost/mpl/aux_/nested_type_wknd.hpp:26:31: required from ‘struct boost::mpl::aux::nested_type_wknd<meta_func<mpl_::arg<1> > >’ ../boost/boost_1_51_0/boost/mpl/not.hpp:39:8: required from ‘struct boost::mpl::not_<meta_func<mpl_::arg<1> > >’ ../boost/boost_1_51_0/boost/fusion/container/vector/detail/preprocessed/as_vector10.hpp:48:36: required from ‘static typename boost::fusion::detail::as_vector<2>::apply<I0>::type boost::fusion::detail::as_vector<2>::call(const Iterator&) [with Iterator = boost::fusion::filter_iterator<boost::fusion::forward_traversal_tag, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0>, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 2>, boost::mpl::not_<meta_func<mpl_::arg<1> > > >; typename boost::fusion::detail::as_vector<2>::apply<I0>::type = boost::fusion::vector2<element, element>]’ ../boost/boost_1_51_0/boost/fusion/container/vector/convert.hpp:43:44: required from ‘typename boost::fusion::result_of::as_vector<const Sequence>::type boost::fusion::as_vector(const Sequence&) [with Sequence = boost::fusion::filter_view<const boost::fusion::vector<element, element>, boost::mpl::not_<meta_func<mpl_::arg<1> > > >; typename boost::fusion::result_of::as_vector<const Sequence>::type = boost::fusion::vector2<element, element>]’ main.cpp:22:62: required from here main.cpp:16:28: error: no type named ‘type’ in ‘struct mpl_::arg<1>’ In file included from ../boost/boost_1_51_0/boost/mpl/is_sequence.hpp:17:0, from ../boost/boost_1_51_0/boost/fusion/support/detail/is_mpl_sequence.hpp:12, from ../boost/boost_1_51_0/boost/fusion/support/tag_of.hpp:13, from ../boost/boost_1_51_0/boost/fusion/iterator/next.hpp:10, from ../boost/boost_1_51_0/boost/fusion/container/vector/vector10.hpp:13, from ../boost/boost_1_51_0/boost/fusion/container/vector/vector_fwd.hpp:14, from ../boost/boost_1_51_0/boost/fusion/container/vector/vector.hpp:10, from ../boost/boost_1_51_0/boost/fusion/container/vector/detail/as_vector.hpp:18, from ../boost/boost_1_51_0/boost/fusion/container/vector/convert.hpp:10, from ../boost/boost_1_51_0/boost/fusion/include/as_vector.hpp:10, from main.cpp:2: ../boost/boost_1_51_0/boost/mpl/not.hpp: In instantiation of ‘struct boost::mpl::not_<meta_func<mpl_::arg<1> > >’: ../boost/boost_1_51_0/boost/fusion/container/vector/detail/preprocessed/as_vector10.hpp:48:36: required from ‘static typename boost::fusion::detail::as_vector<2>::apply<I0>::type boost::fusion::detail::as_vector<2>::call(const Iterator&) [with Iterator = boost::fusion::filter_iterator<boost::fusion::forward_traversal_tag, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0>, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 2>, boost::mpl::not_<meta_func<mpl_::arg<1> > > >; typename boost::fusion::detail::as_vector<2>::apply<I0>::type = boost::fusion::vector2<element, element>]’ ../boost/boost_1_51_0/boost/fusion/container/vector/convert.hpp:43:44: required from ‘typename boost::fusion::result_of::as_vector<const Sequence>::type boost::fusion::as_vector(const Sequence&) [with Sequence = boost::fusion::filter_view<const boost::fusion::vector<element, element>, boost::mpl::not_<meta_func<mpl_::arg<1> > > >; typename boost::fusion::result_of::as_vector<const Sequence>::type = boost::fusion::vector2<element, element>]’ main.cpp:22:62: required from here ../boost/boost_1_51_0/boost/mpl/not.hpp:39:8: error: ‘value’ is not a member of ‘boost::mpl::aux::nested_type_wknd<meta_func<mpl_::arg<1> > >’ -- -*- mode: compilation; default-directory: "~/dev/test/" -*- Compilation started at Mon Nov 12 15:09:15 bjam -q -j8 ...patience... ...found 584 targets... ...updating 2 targets... gcc.compile.c++ bin/gcc-4.7.2/debug/main.o In file included from ../boost/boost_1_51_0/boost/mpl/is_sequence.hpp:17:0, from ../boost/boost_1_51_0/boost/fusion/support/detail/is_mpl_sequence.hpp:12, from ../boost/boost_1_51_0/boost/fusion/support/tag_of.hpp:13, from ../boost/boost_1_51_0/boost/fusion/iterator/next.hpp:10, from ../boost/boost_1_51_0/boost/fusion/container/vector/vector10.hpp:13, from ../boost/boost_1_51_0/boost/fusion/container/vector/vector_fwd.hpp:14, from ../boost/boost_1_51_0/boost/fusion/container/vector/vector.hpp:10, from ../boost/boost_1_51_0/boost/fusion/container/vector/detail/as_vector.hpp:18, from ../boost/boost_1_51_0/boost/fusion/container/vector/convert.hpp:10, from ../boost/boost_1_51_0/boost/fusion/include/as_vector.hpp:10, from main.cpp:2: ../boost/boost_1_51_0/boost/mpl/not.hpp: In instantiation of ‘struct boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> >’: ../boost/boost_1_51_0/boost/mpl/aux_/preprocessed/gcc/apply_wrap.hpp:36:8: required from ‘struct boost::mpl::apply_wrap1<boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> >, element>’ ../boost/boost_1_51_0/boost/mpl/aux_/preprocessed/gcc/bind.hpp:144:21: required from ‘struct boost::mpl::bind1<boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> >, boost::mpl::bind1<boost::mpl::quote1<boost::fusion::result_of::value_of>, mpl_::arg<1> > >::apply<boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0> >’ ../boost/boost_1_51_0/boost/mpl/aux_/preprocessed/gcc/apply_wrap.hpp:36:8: required from ‘struct boost::mpl::apply_wrap1<boost::mpl::bind1<boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> >, boost::mpl::bind1<boost::mpl::quote1<boost::fusion::result_of::value_of>, mpl_::arg<1> > >, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0> >’ ../boost/boost_1_51_0/boost/mpl/aux_/preprocessed/gcc/apply.hpp:42:8: required from ‘struct boost::mpl::apply1<boost::mpl::bind1<boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> >, boost::mpl::bind1<boost::mpl::quote1<boost::fusion::result_of::value_of>, mpl_::arg<1> > >, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0> >’ ../boost/boost_1_51_0/boost/fusion/algorithm/query/detail/find_if.hpp:33:35: required from ‘struct boost::fusion::detail::apply_filter<boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0>, boost::mpl::bind1<boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> >, boost::mpl::bind1<boost::mpl::quote1<boost::fusion::result_of::value_of>, mpl_::arg<1> > > >’ ../boost/boost_1_51_0/boost/mpl/if.hpp:67:11: [ skipping 10 instantiation contexts ] ../boost/boost_1_51_0/boost/fusion/support/tag_of.hpp:69:16: required from ‘struct boost::fusion::traits::tag_of<boost::fusion::filter_iterator<boost::fusion::forward_traversal_tag, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0>, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 2>, boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> > >, void>’ ../boost/boost_1_51_0/boost/fusion/support/tag_of.hpp:77:16: required from ‘struct boost::fusion::detail::tag_of<boost::fusion::filter_iterator<boost::fusion::forward_traversal_tag, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0>, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 2>, boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> > > >’ ../boost/boost_1_51_0/boost/fusion/iterator/distance.hpp:60:16: required from ‘struct boost::fusion::result_of::distance<boost::fusion::filter_iterator<boost::fusion::forward_traversal_tag, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 0>, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 2>, boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> > >, boost::fusion::filter_iterator<boost::fusion::forward_traversal_tag, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 2>, boost::fusion::vector_iterator<const boost::fusion::vector<element, element>, 2>, boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> > > >’ ../boost/boost_1_51_0/boost/fusion/view/filter_view/detail/size_impl.hpp:27:20: required from ‘struct boost::fusion::extension::size_impl<boost::fusion::filter_view_tag>::apply<const boost::fusion::filter_view<const boost::fusion::vector<element, element>, boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> > > >’ ../boost/boost_1_51_0/boost/fusion/sequence/intrinsic/size.hpp:68:16: required from ‘struct boost::fusion::result_of::size<const boost::fusion::filter_view<const boost::fusion::vector<element, element>, boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> > > >’ ../boost/boost_1_51_0/boost/fusion/container/vector/convert.hpp:23:82: required from ‘struct boost::fusion::result_of::as_vector<const boost::fusion::filter_view<const boost::fusion::vector<element, element>, boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> > > >’ ../boost/boost_1_51_0/boost/fusion/container/vector/convert.hpp:40:5: required by substitution of ‘template<class Sequence> typename boost::fusion::result_of::as_vector<const Sequence>::type boost::fusion::as_vector(const Sequence&) [with Sequence = boost::fusion::filter_view<const boost::fusion::vector<element, element>, boost::mpl::not_<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> > >]’ main.cpp:22:81: required from here ../boost/boost_1_51_0/boost/mpl/not.hpp:39:8: error: ‘value’ is not a member of ‘boost::mpl::aux::nested_type_wknd<boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<meta_func, mpl_::void_>, mpl_::arg<1> >, 0> >’ Thanks in advance, -- Felipe Magno de Almeida

4 4

Am I building 64-bit Boost correctly?
by Ramon F Herrera 15 Nov '12

15 Nov '12

I have finally decided to get my feet wet, when it comes to the 64-bit world. Honestly, all my fears turned out to be valid, and then some. I have a MSVS-2010 Solution that includes several varied projects: GUI, libraries (both kids) and Shell Extensions. Since a couple of my projects depend on Boost (the greatest set of libraries ever known to man! Boost rocks! Boost rules!!... but I digress): I decided to start there. Since I am getting some boost-related error messages, I figure that step number zero is to make sure that my Boost installation is healthy. This is how I build it: .\bootstrap.bat .\bjam.exe --with-date_time --with-filesystem --with-regex --with-system --stagedir=. --build-type=complete toolset=msvc-10.0 address-model=64 Notice that the above commands have served me well for years (minus the last parameter, which I am now using for the first time). Is that all I need? TIA, -Ramon

4 5

read_graphml: read more than 1 graph from the same graphml file
by Bartha Attila 15 Nov '12

15 Nov '12

Hello ! Is there a way a to read more than one graph from a .graphml file using read_graphml ? Here's what I tried: -open an input stream to the graphml file; -call a function to read the graph from the file (the function uses read_graphml) and print the graph to stdout; -call the same function again, hoping that the second graph from the file will be read; -close the file input stream. If I call the function once, it works fine and returns the first graph defined in the graphml file. If I call the function the twice, I get the following runtime exception: 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::property_tree::ptree_bad_path> >' what(): No such node (graphml) The graphml file looks like this : <graphml ....header stuff... > <key id= ...key definitions...> <graph id="TestSite1" edgedefault="undirected"> <node id="node0"> <data key="map">map1</data> <data key="x">5.0</data> <data key="y">1.0</data> </node> <node id="node1"> <data key="map">map1</data> <data key="x">5.0</data> <data key="y">4.0</data> </node> <edge source="node0" target="node1"/> </graph> <graph id="TestSite2" edgedefault="undirected"> <node id="node0"> <data key="map">map3</data> <data key="x">6.0</data> <data key="y">2.0</data> </node> <node id="node1"> <data key="map">map4</data> <data key="x">7.0</data> <data key="y">9.0</data> </node> <edge source="node0" target="node1"/> </graph></graphml> I can correctly get the data of TestSite1 graph if I call the function once. How can I get the TestSite2 graph from the same file, or, for that matter, how can I get one specific graph (ex TestSiteN) ? Thanx for any help, -attoparsec-

2 2

Further Boost.MPI development
by Matthias Troyer 15 Nov '12

15 Nov '12

Dear Boost.MPI users, With the MPI-3 standard having been finalized we want to intensify Boost.MPI development as soon as my crazy teaching schedule this fall gives me time from the middle of next month. With the deprecation of the - little used - official MPI C++ API in MPI-3 Boost.MPI has a chance of becoming a de facto standard C++ API for MPI. We first want to focus on features from MPI-2 and MPI-3 that are widely used or useful. For this purpose I would like to collect suggestions. Can you please reply and mention the functions of MPI that you would most like to see supported by Boost.MPI. Best regards Matthias

6 5

[coroutine] errors compiling with clang 3.2
by Marco Craveiro 14 Nov '12

14 Nov '12

Hi boost-users, As reported by Eugene Yakubovich[1], I am seeing problems compiling boost coroutine with clang 3.1 on debian testing. I got my sources from git://gitorious.org/boost-dev/boost-dev.git at commit c083660c54b88ca1ce9a940f4a71bc6c3ab89003. The error I get is: /boost/coroutine/detail/coroutine_object.hpp:54:46: error: expected expression Context * ctx( hldr->data.get().get< 0 >() ); ^ The same code compiles and runs fine with gcc 4.7. In both cases I'm using C++11. I just want to double-check that this is some kind of problem with clang - since 3.2 is on the wings I was wondering if this would be resolved by the upgrade. If anyone has managed to get it working with 3.1 I'd appreciate some pointers. Many thanks for your time, Marco -- So young, and already so unknown -- Pauli blog: http://mcraveiro.blogspot.com [1] http://boost.2283326.n4.nabble.com/Review-Coroutine-reviewstarts-today-Sept…

2 6

boost asio: boost::asio::deadline_timer blocking ?
by Avi Bahra 14 Nov '12

14 Nov '12

Answers: 1. I doubt this is really an issue is with deadline_timer accuracy. 2. Are you double-scheduling the same timer? Or are you just doing some extra work, every time a single expiry event crosses a minute boundary? I wouldn't double-schedule the same timer, if that's what you're doing. >> No. I record the next minute boundary, when the timer fires, I check the current >> time against the minute boundary. So no double scheduling. 3. The timer may be susceptible to time changes on your system. It needn't be, but don't assume that means it's not. It might be worth looking at the implementation, to make sure. >> The problem occurs independent of the time change. 4. Slow disk could be an issue, but only if your io_service thread(s) are blocking on disk activity (either direct disk access or page faults). The file descriptors you're talking about have nothing to do with disk files, in this case. >> The current server is single threaded, so my this was my first suspect. >> I log every client request to a log file. I had suspected that a slow >> file system, would block when logging the client request, and affect the timer. >> I added extra instrumentation to time the logging. However this was not the cause 5. Depends on your accuracy needs and the load on the rest of the system. On a system under moderate loads, I'd expect no problems using ASIO to perform processing on a one-second granularity. Just be sure to compute the next expiry based the current time, rather than sleeping for 1 second. If you want to make this resilient to time change, you can use a monotonic timebase. Matt ================================================================ The client is designed to cancel long running connection to the server.. ( > 20seconds) This timeout is based on boost asio example: http://www.boost.org/doc/libs/1_47_0/doc/html/boost_asio/example/timeouts/a… What I have noticed is that the 1 second timer in the server does not fire, *when* client request have been cancelled. It appears that some of chain of async handlers that are being called in the server, during this process, cause the timer to hang ? For example if the client cancels after 20 seconds, then something in the server must been blocking, for that period ? When the client cancels, the server::handle_write(..), closes both end of the socket. So I see the following message logged: shutdown: Transport endpoint is not connected Here is the async' functions in the server: void server::start_accept() { connection_ptr new_conn( new connection( io_service_ ) ); acceptor_.async_accept( new_conn->socket(), boost::bind( &server::handle_accept, this, boost::asio::placeholders::error, new_conn ) ); } void server::handle_accept( const boost::system::error_code& e, connection_ptr conn ) { if (!acceptor_.is_open()) { if (serverEnv_.debug()) cout << " server::handle_accept: acceptor is closed, returning\n"; return; } if ( !e ) { conn->async_read( inbound_request_, boost::bind( &server::handle_read, this, boost::asio::placeholders::error,conn ) ); } else { if (e != boost::asio::error::operation_aborted) { // An error occurred. Log it LogToCout toCoutAsWell; LOG(Log::ERR, " server::handle_accept error occurred " << e.message()); } } start_accept(); } void server::handle_read( const boost::system::error_code& e,connection_ptr conn ) { if ( !e ) { try { // Service the in bound request, handling the request will populate the outbound_response_ // Note:: Handle request will first authenticate outbound_response_.set_cmd( inbound_request_.handleRequest( this ) ); } catch (exception& e) { outbound_response_.set_cmd( PreAllocatedReply::error_cmd( e.what() )); } // *Reply* back to the client: conn->async_write( outbound_response_, boost::bind(&server::handle_write, this, boost::asio::placeholders::error, conn ) ); } else { LOG(Log::ERR, "server::handle_read error occurred : " << e.message()); } } void server::handle_write( const boost::system::error_code& e, connection_ptr conn ) { boost::system::error_code ec; conn->socket().shutdown(boost::asio::ip::tcp::socket::shutdown_both,ec); if (ec) { ecf::LogToCout logToCout; LOG(Log::ERR,"server::handle_write: socket shutdown both failed: " << ec.message()); return; } } I had noticed that I was not checking error code in the server::handle_write(..) but I'm not sure if this would account, for why the timer does not fire temporarily. Ta, Avi

1 0

[msm] Why does it take so many bytes to represent a state machine?
by ☂Josh Chia (谢任中) 13 Nov '12

13 Nov '12

Hi, I'm using msm to store the state of many small objects. Each one is around 24 bytes on its own. However, I just found out from experimentation that a MSM state machine takes many bytes to store. For the following program, the print out is: entering: State1 104 48 This indicates that the very simple one-state, no-transition, machine is 104 bytes, and takes 48 bytes even to serialized. The front::state_machine_def, however, is only 1 byte, though I suspect thet real state is stored only in the 104-byte back::state_machine. Even the SimpleTutorial.cpp example, when I adapt it to print the size, shows 128 bytes. Theoretically, all this information take no more than a few bits to store, and one byte is generous. What's the internal representation of a state machine and how can I optimize the size of the representation? This matters for my use case because I have many small objects for which I want to maintain state, that are only ~20 bytes each. I thought perhaps I could mitigate this size problem by storing the serialized bytes but even the serialized bytes are many. I'm using boost 1.51 and gcc 4.7.2 on 64-bit Linux. Josh #include <iostream> #include <strstream> #include <boost/archive/text_oarchive.hpp> #include <boost/msm/back/state_machine.hpp> #include <boost/msm/front/functor_row.hpp> #include <boost/msm/front/state_machine_def.hpp> using namespace std; namespace mpl = boost::mpl; namespace msm = boost::msm; using namespace msm::front; struct Event { }; struct state_ : public msm::front::state_machine_def<state_> { struct State1 : public msm::front::state<> { // optional entry/exit methods template <class Event,class FSM> void on_entry(Event const&, FSM& f) { std::cout << "entering: State1" << std::endl; } template <class Event,class FSM> void on_exit(Event const&,FSM& ) { std::cout << "leaving: State1" << std::endl; } }; typedef State1 initial_state; struct transition_table : mpl::vector< > {}; }; typedef msm::back::state_machine<state_> State; int main() { State state; state.start(); cout << sizeof(state) << endl; ostrstream os; { boost::archive::text_oarchive oa(os); oa << state; } cout << os.pcount() << endl; return 0; }

2 4

[msm] How to cause no_transition for cases of guard returning false?
by ☂Josh Chia (谢任中) 13 Nov '12

13 Nov '12

Hi, I want no_transition() to be called whenever no row matches, even if there is a row that does not match only because the guard returns false. How can I achieve this? I want to be strict about the input events. I can probably workaround this by putting guardless rows at the top whose action is to call no_transition(), but I'm hoping to find a cleaner solution. If I get this behavior in msm, then the following code should output "no transition..." as its last line. Right now, with boost 1.51, it doesn't. It just prints "entering State1". Josh #include <iostream> #include <boost/msm/back/state_machine.hpp> #include <boost/msm/front/functor_row.hpp> #include <boost/msm/front/state_machine_def.hpp> using namespace std; namespace mpl = boost::mpl; namespace msm = boost::msm; using namespace msm::front; struct Event { Event(bool data) : data(data) { } bool data; }; struct state_ : public msm::front::state_machine_def<state_> { struct MyGuard { template <class EVT, class FSM, class SourceState, class TargetState> bool operator()(EVT const& e, FSM&, SourceState&, TargetState&) { return e.data; } }; struct State1 : public msm::front::state<> { // optional entry/exit methods template <class Event,class FSM> void on_entry(Event const&, FSM& f) { std::cout << "entering: State1" << std::endl; } template <class Event,class FSM> void on_exit(Event const&,FSM& ) { std::cout << "leaving: State1" << std::endl; } }; struct State2 : public msm::front::state<> { // optional entry/exit methods template <class Event,class FSM> void on_entry(Event const&, FSM& f) { std::cout << "entering: State2" << std::endl; } template <class Event,class FSM> void on_exit(Event const&,FSM& ) { std::cout << "leaving: State2" << std::endl; } }; typedef State1 initial_state; struct transition_table : mpl::vector< Row< State1, Event , State2, none, MyGuard > > {}; template <class FSM, class Event> void no_transition(Event const& e, FSM&, int state) { std::cout << "no transition from state " << state << " on event " << typeid(e).name() << std::endl; } }; typedef msm::back::state_machine<state_> State; int main() { State state; state.start(); state.process_event(Event(false)); return 0; }

2 2

[Locale] MinGW + ICU + cross compiling = wchar errors?
by Jookia 12 Nov '12

12 Nov '12

Hello! I'm trying to compile Boost.Locale 1.51.0 with ICU 1.50 support in x86_64 MinGW-w64 4.7.2. So to start off, I have a structure of all my libs, includes and whatnot at /home/jookia/Programming/mingw64. I've built ICU using this command and installed it: CXXFLAGS=-fpermissive ../configure --prefix=/home/jookia/Programming/mingw64/ --host x86_64-w64-mingw32 --with-cross-build=/home/jookia/Programming/local/icu/source/build --enable-static --enable-shared --with-data-packaging=archive --with-library-bits=64 Building Boost uses this user-config: using gcc : 4.7 : x86_64-w64-mingw32-g++ : <rc>x86_64-w64-mingw32-windres <archiver>x86_64-w64-mingw32-ar <compileflags>-I/home/jookia/Programming/mingw64/include/ <linkflags>-L/home/jookia/Programming/mingw64/lib/ ; and this command: bjam threadapi=win32 target-os=windows variant=release threading=multi link=shared runtime-link=shared --prefix=/home/jookia/Programming/mingw64 --user-config=user-config.jam --without-python --without-mpi --layout=tagged -sNO_BZIP=1 -sNO_ZLIB=1 install In order to try and build Boost.Locale I've patched its Jamfile to remove the shared libstdc++ stuff as MinGW doesn't seem to support it, and also rename all of the searched-lib <name>s to their MSVC equivalents so I can find those. The command it used to build is this (stuff omitted to save space): "x86_64-w64-mingw32-g++" "-Wl,--out-implib,bin.v2/libs/locale/build/.../libboost_locale-mt.dll.a" -o "bin.v2/libs/locale/build/.../libboost_locale-mt.dll" -Wl,-h -Wl,libboost_locale-mt.dll -shared -Wl,--start-group ... -Wl,-Bstatic -Wl,-Bdynamic -licuuc -licuin -licudt -liconv -Wl,--end-group -L/home/jookia/Programming/mingw64/lib/ -mthreads Compiling works fine up until linking, where it gives a few errors like this (paths and mangled names omitted to save sapce): bin.v2/.../formatter.o:formatter.cpp:(... undefined reference to `icu_50::UnicodeString::UnicodeString(wchar_t const*, int)' Is there any solution to this or is this something to do with MinGW's lack of support for wchars? Thanks, Jookia.

1 1

boost::variant compile error
by Georg.Kellerer＠lfu.bayern.de 12 Nov '12

12 Nov '12

Hi, i'd like to build a heterogenous container based on the boost::variant datastructure. My code looks like this: // forward-Deklarationen: class fExport FB_Ordered; class fExport FB_Dictionary; // Typedefs typedef boost::variant<int, std::string> keydicttype; typedef boost::variant< int, std::string, date, ptime, boost::recursive_wrapper<FB_Dictionary>, boost::recursive_wrapper<FB_Ordered>> valuedicttype; typedef boost::container::map<keydicttype, valuedicttype> basedict; C:\dev\boost_1_52_0\boost/checked_delete.hpp(32) : error C2027: use of undefined Type "FB_Ordered" what i want to do is to create a container fb_dictionary which can hold datatypes that are listed in the valuedicttype and which can accept keyvalues of int and string (see above). fb_ordered is another container defined in a diferent header file so i need the forward declarations. Could anybody please give me a hint in the right direction? I am using vs2008. Thanks for help, Georg

3 3

Threading and Asio
by Gonzalo Garramuno 11 Nov '12

11 Nov '12

I started playing with asio server/client model and I run into a problem. I have a thread for the server, another for the client and another for the send/receive message. This results in: write: Socket operation on non-socket as the send thread is not made aware of the socket initialized in the client thread. I'm wondering what is the solution to have the send in a separate thread.

2 1

[statechart] history not saved
by Ilya Orlov 11 Nov '12

11 Nov '12

I have following code: // from A11 and A12 and back struct Ev1 : sc::event < Ev1 >{}; struct Ev2 : sc::event < Ev2 >{}; // from A to B and back struct Ev3 : sc::event < Ev3 >{}; struct Ev4 : sc::event < Ev4 >{}; // from A1 to A2 and back struct Ev5 : sc::event < Ev5 >{}; struct Ev6 : sc::event < Ev6 >{}; struct StateA; struct StateA1; struct StateA11; struct StateA12; struct StateA2; struct StateA21; struct StateA22; struct StateB; struct Machine : sc::state_machine < Machine, StateA > {}; struct StateA : sc::simple_state < StateA, Machine, mpl::list < sc::deep_history < StateA1 > >, sc::has_deep_history > { typedef sc::transition < Ev3, StateB > reactions; }; struct StateA1 : sc::simple_state < StateA1, StateA, mpl::list < sc::deep_history < StateA11 > >, sc::has_deep_history > { typedef sc::transition < Ev5, StateA2 > reactions; }; struct StateA11 : sc::simple_state < StateA11, StateA1 > { typedef sc::transition < Ev1, StateA12 > reactions; }; struct StateA12 : sc::simple_state < StateA12, StateA1 > { typedef sc::transition < Ev2, StateA11 > reactions; }; struct StateA2 : sc::simple_state < StateA2, StateA, mpl::list < sc::deep_history < StateA21 > >, sc::has_deep_history > { typedef sc::transition < Ev6, StateA1 > reactions; }; struct StateA21 : sc::simple_state < StateA21, StateA2 > {}; struct StateA22 : sc::simple_state < StateA22, StateA2 > {}; struct StateB : sc::simple_state < StateB, Machine > { typedef sc::custom_reaction < Ev4 > reactions; sc::result react(const Ev4&) { std::cout << "react" << std::endl; return transit < sc::deep_history < StateA11 > >(); } }; I am sending events like this: Machine m; m.initiate(); std::cout << "Ev5" << std::endl; m.process_event(Ev5()); std::cout << "Ev3" << std::endl; m.process_event(Ev3()); std::cout << "Ev4" << std::endl; m.process_event(Ev4()); After Ev5 machine goes to A2 -> A21 state. After Ev3 machine leaves state A with history and goes to state B. After Ev4 machine leaves state B and should go back to A2 -> A21 but actually goes to A -> A1 -> A11 - default states. How I can fix it? Thanks, Ilya

2 6

Review Wizard Report for November 2012
by Ronald Garcia 10 Nov '12

10 Nov '12

============================================== Review Wizard Status Report for November 2012 ============================================== News ==== 1. ODEInt Reviewed 2. Boost 1.52.0 Released. No New Libraries. Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been reviewed and await reports from their review managers: * Predef - reviewed February 2012; review manager: Joel Falcou. * Coroutine - reviewed September 2012; review manager: Hartmut Kaiser. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Atomic - accepted July 2011; author Helge Bahmann. * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Lockfree - accepted August 2011; author: Tim Blechmann. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Polygon: Voronoi Extensions * Coroutine * Range Extensions * Nowide (M) * Array (M) * TypeIndex (M) * STL Extensions (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Polygon: Voronoi Extensions --------------------------- :Author: Andril Sydorchuk :Review Manager: Lucanus Simonson :Download: http://svn.boost.org/svn/boost/sandbox/gtl/ :Description: This library extends Boost.Polygon with the following features: - Robust and efficient implementation of the sweepline algorithm that allows to construct Voronoi diagram, Delaunay triangulation and medial axis of a set of points and line segments. - Coordinates of the output geometries are computed within the 64 machine epsilon relative error (6 mantissa bits). - Voronoi diagram data structure that allows efficient traversal and data association with the output Voronoi graph. - No 3rd party dependencies (e.g. GMP, MPFR), all the required multiple precision types are implemented as part of the library. - The input and output coordinate type domains are configurable via coordinate type traits, thus allowing to compute coordinates of the Voronoi vertices within any required precision. - The full construction of the Voronoi diagram of 100 000 points takes only 0.27 seconds (see benchmarks). Coroutine --------- :Author: Oliver Kowalke :Review Manager: Hartmut Kaiser :Download: http://gitorious.org/boost-dev/boost-dev/archive-tarball/coroutine :Description: This library is an implementation of coroutines and generators using Boost.Context. Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. TypeIndex --------- :Author: Antony Polukhin :Review Manager: Needed :Download: https://github.com/apolukhin/type_index :Description: TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

smart_ptr/enable_shared_from_raw
by Andreas Beisler 09 Nov '12

09 Nov '12

Hi, it's known that calling shared_from_this() in a constructor doesn't work. It seems that whenever this issue arises, people resort to creating a factory that first constructs the object and then calls an init function in which the user is free to call shared_from_this(). It seems though that there is a perfectly working enable_shared_from_raw class in the trunk since a couple of years now that allows the developer to call shared_from_raw(this) in a constructor. Are there plans of merging this into a release sometime? If not, is it safe to throw out the smart_ptr stuff of a release (I'm using 1.48.0 still) and replace it with the version from the trunk? Thanks, Andreas

1 0

Boost::Asio help for viewer
by Gonzalo Garramuno 09 Nov '12

09 Nov '12

I am designing a viewer that communicates via the network some actions, like playback, scrubbing, etc. I decided to code it with boost::asio, but I am too unfamiliar with it and the examples did not help much. What I need is the following: - server starts a group - one client connects to server - server and client do several handshake transmissions to sync (same movie file, etc). - client or server perform a playback or a seek to certain frame and the other (client or server) follows. Can someone suggest what should I use and what steps to take in draft form? Currently I have two threads one for the server and one for the client but lack knowledge of the asio api on how to perform a handshake (a send/receive pair, basically).

3 4

boost asio: boost::asio::deadline_timer blocking ?
by Avi Bahra 09 Nov '12

09 Nov '12

Using boost asio 1.47, suse linux 11.3, gcc 4.5 I am using boost::asio::deadline_timer, where the timer fires every second. When the timer expires, I check responses from the clients. I use the same timer to check when I have reach the minute boundary, so that server can do some other work. Now 99.9% of the time this works perfectly. However occasionally the timer does not fire every second, in fact it can delay/block for several minutes! This is what I use: timer_.expires_from_now( boost::posix_time::seconds( 1 ) ); timer_.async_wait( server_->io_service_.wrap( boost::bind( &NodeTreeTraverser::traverse,this,boost::asio::placeholders::error ) ) ); When I run strace on the process I see: epoll_wait(4, {{EPOLLIN, {u32=15957244, u64=15957244}}}, 128, 4294967295) = 1 timerfd_settime(5, 0, {it_interval={0, 0}, it_value={16, 944525000}}, {it_interval={16048400, 15957984}, it_value={140733847085872, 6025966}}) = 0 timerfd_settime(5, 0, {it_interval={0, 0}, it_value={0, 999992000}}, {it_interval={15958092, 6011901}, it_value={17195917584, 140733847086024}}) = 0 I have several questions: o Are there known problems with boost::asio::deadline_timer accuracy I realise I need soft real time, with one minute resolution. o Should I have two separate timers, one 1 second & for 1 minute o Is using timer_.expires_at(...) more reliable, I assume this affects how it configures timerfd_settime o Now I suspect this issue may be related to slow disk system Could a slow disk system affect timerfd_settime system call, since it is based on file descriptors. o Are there any well known asio based design patterns/idioms for ensuring reliable timer resolutions Any help appreciated. Ta, Avi

2 1

[thread] thread.join() throws in 1.52.0
by Szymon Gatner 09 Nov '12

09 Nov '12

Hi, after updating from 1.51.0 to 1.52.0 call to a thread::join() throws "invalid_argument" / not joinable. I see that there is a change with regards to thread d-tor in this version but I don't really understand if and why this is related. Should joinable() be called now before every join()? -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

3 7

Unit Test Framework Static library compilation
by Edouard Tallent 08 Nov '12

08 Nov '12

Hi all. This is Boost 1.52.0 and Visual Studio 2012 Express (VC11). I am stuck with the static compilation of the Unit Test Framework, as documented here: http://www.boost.org/doc/libs/1_52_0/libs/test/doc/html/utf/compilation/sta… I get the message 'bjam' is not recognized as an internal or external command, operable program or batch file while using the command bjam [-sTOOLS=] {-sBUILD=boost_unit_test_framework} as read in the documentation. Boost is not installed on my computer (header-only). And, maybe the library Boost.build HAS to be installed first? (if it so, how do I do that?) That would be great if someone give a clear explanation of that. Thank you very much, indeed. Édouard -- http://quantcorner.wordpress.com

3 3

[Boost units] Derived units for specific_heat_capacity
by A Andrew 08 Nov '12

08 Nov '12

2 2

ptr_map<U, T> with polymorphic U
by Victor Snyder 08 Nov '12

08 Nov '12

ptr_map<U, T> lets me map simple types to pointers-to-T, preserving polymorphic behavior of the mapped-to objects, and clearly stating that the ptr_map solely owns the pointed-to objects. I'd like to map pointers-to-U to pointers-to-T and have the map solely own the key objects as well as the mapped-to objects. ptr_map doesn't do this. I could map shared_ptrs-to-U to pointers-to-T, but then I lose the clear ownership semantics. Does anyone know of an easy workaround to get the behavior and semantics that I want, or is this more properly a feature request? Thanks!

2 2

pattern support for traversing inheritance chain
by Brian Budge 07 Nov '12

07 Nov '12

Hi all - I have a case where I have a largeish inheritance hierarchy. I will be calling an initialization function on all objects before using them in some fashion. Basically what I need to happen is when I call init() on a Foo the following would occur: void Foo::init() { super::init(); // now with the knowledge that anything I inherited is set up, I can set myself up... } It is not necessary for every call to implement init, in which case the behavior should be that the call is propagated up the inheritance chain (which it is by default in C++). In order to make this work, I need to write different code for "super" in every class implementation, which is a bit error prone. Even if I don't copy/paste, my brain might be on autopilot and type something further up the inheritance chain than it should be. Alternatively, I could require that each class provides a typedef for super, but I'm still relying on myself to remember to call super's init function. Is there anything in boost that would support this kind of hierarchy traversal (semi-)automatically? If there is not, are there suggestions for ways to implement this in a less error-prone fashion? Thanks, Brian

3 5

[1.52] PDF Documentation build available
by John Maddock 07 Nov '12

07 Nov '12

The PDF build of Boost docs is now available for 1.52 from: https://sourceforge.net/projects/boost/files/boost-docs/1.52.0/ John.

1 0

Virtual memory exhausted compile error with too many Boost state machine transitions
by Adlai Shawareb 06 Nov '12

06 Nov '12

All, We are getting the virtual memory exhausted error when compiling a Boost state machine file. If we cut back the number of state transitions in this state machine, we do not get the error, and the compile completes without errors. We are using Boost 1.49. Here is what we have done: 1) Allocated 4GB of memory to our Virtual Machine(it runs Ubuntu), and created a 4.5GB swap file. When I compile I look at the System Monitor dialog, and can see that the RAM memory is not even used up when we get the compile error. The virtual memory is never used. 2) I saw online that the 3.80 version of make had a bug that would cause this type of error. I've confirmed that we are using 3.81. I also tried 3.82, but get the same error. 3) I've confirmed that "ulimit -v" returns "unlimited" 4) Looking online, I saw a recommendation to add the following two lines to /etc/security/limits.conf. I've tried this but I still get the error. * hard rss unlimited * hard cpu unlimited 1) 2) 3) 4) 5) We have set up precompiled headers, and I've added SystemHSM.hpp, and associated Boost include files to our list of precompiled headers. However, I still get the error. 6) FYI - In the past we ran up against Boost's limit of 20 state transitions per state machine. To get around that, I've added the following to SystemHSM.cpp: #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS // Discard the pre-generated headers and use preprocessor metaprogramming techniques to generate the necessary versions of the library components on the fly. #define BOOST_MPL_LIMIT_VECTOR_SIZE 50 // Increase the default (transition table) vector size beyond the standard limit of 20. #include <boost/mpl/vector.hpp> 1) 2) 3) 4) 5) 6) 7) FYI - We recently ran into an issue with the set size in the SystemHSM #define BOOST_FUSION_DONT_USE_PREPROCESSED_FILES #define FUSION_MAX_VECTOR_SIZE 30 #define FUSION_MAX_SET_SIZE 30 #include <boost/mpl/set.hpp> In addition I have looked for this type of error with gcc, but have not found anything concrete online. Any help would be appreciated!

1 0

Known way to handle this?
by Lemay.Steve 06 Nov '12

06 Nov '12

Is there already a known [proper] way to correct his issue (shown below)? I had reported it during the beta - this occurs many times for various source. "QCC" -Wc,-ftemplate-depth-128 -DFD_SETSIZE=2048 -march=k8-sse3 -mtune=k8-sse3 -mmmx -msse3 -mfpmath=sse -mno-3dnow -mstackrealign -Y_cpp -Wc,-fPIC,-fnothrow-opt,-std=c++11,-std=gnu++11 -O3 -Wc,-finline-functions -Wc,-Wno-inline -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "D:\boostBuild_QCC_1_52_0\boost\bin.v2\libs\serialization\build\qcc\release\link-static\target-os-qnxnto\threadapi-pthread\threading-multi\xml_iarchive.o" "libs\serialization\src\xml_iarchive.cpp" ...failed qcc.compile.c++ D:\boostBuild_QCC_1_52_0\boost\bin.v2\libs\serialization\build\qcc\release\link-static\target-os-qnxnto\threadapi-pthread\threading-multi\xml_iarchive.o... qcc.compile.c++ D:\boostBuild_QCC_1_52_0\boost\bin.v2\libs\serialization\build\qcc\release\link-static\target-os-qnxnto\threadapi-pthread\threading-multi\xml_archive_exception.o In file included from libs\serialization\src\xml_archive_exception.cpp:21:0: ./boost/archive/xml_archive_exception.hpp:35:44: error: looser throw specifier for 'virtual boost::archive::xml_archive_exception::~xml_archive_exception()' In file included from ./boost/archive/xml_archive_exception.hpp:25:0, from libs\serialization\src\xml_archive_exception.cpp:21: ./boost/archive/archive_exception.hpp:86:5: error: overriding 'virtual boost::archive::archive_exception::~archive_exception() throw ()' cc: d:/qnxsdk/qnxsdk6.5-001/host/win32/x86/usr/lib/gcc/i486-pc-nto-qnx6.5.0/4.7.2/cc1plus caught signal 1 Steven LeMay Game Platform Engineering International Game Technology 9295 Prototype Way Reno, NV 89521 Office: +1 775.448.8089 Mobile: +1 775.813.6676 steven.lemay(a)igt.com<mailto:steven.lemay@igt.com> This email message is for the sole use of the intended recipient(s) and may contain confidential and privileged information. Any unauthorized review, use, disclosure or distribution is prohibited. If you are not the intended recipient, please contact the sender by reply email and destroy all copies of the original message. Any humorous implications are purely the result of misinterpretations provided by the reader.

2 2

Question about boost::locale translations
by Bastien Montagne 06 Nov '12

06 Nov '12

Hi everybody! :) I’m currently trying to replace libintl (from gnu gettext) by boost::locale lib, in a (mostly) C program (blender, actually). To do so, I wrote a simplistic wrapper: #include <boost/locale.hpp> #include "boost_locale_wrapper.h" static boost::locale::generator gen; /* Called only once */ void boost_locale_init(const char *messages_path, const char *default_domain) { gen.add_messages_path(messages_path); gen.add_messages_domain(default_domain); gen.set_default_messages_domain(default_domain); } /* Called each time you change locale */ void boost_locale_set(const char *locale) { if (locale && locale[0]) { std::locale::global(gen(locale)); } else { std::locale::global(gen("")); } } const char* boost_locale_gettext(const char *msgid) { return boost::locale::gettext(msgid).c_str(); } (this wrapper lib is linked statically with the main app) But I'm facing a big problem: I would expect strings returned by boost::locale::gettext & co to be "const", i.e. that the char pointer gotten by boost::locale::gettext(msgid).c_str() would be const (and unique to a given locale/msgid/context/etc.), as it is with gnu gettext. But this is obviously not the case, as demonstrated by those prints (translated_msgid (address)): Serbe latin (Srpski latinica) (0x7fcaed0dac58) sr_RS@latin (0x7fcaee1e5628) Suédois (Svenska) (0x7fcaed0dac58) sv_SE (0x7fcaee1e5628) Am I missing something obvious here, or are returned string just not "const"? If so, how can a code like: MessageBoxW(0,pgettext <http://www.boost.org/doc/libs/1_49_0/libs/locale/doc/html/group__message.ht…>(L"File Dialog",L"Open?").c_str(),gettext <http://www.boost.org/doc/libs/1_49_0/libs/locale/doc/html/group__message.ht…>(L"Question").c_str(),MB_YESNO); (taken from boost doc) could work? I'm quite new to all this C++2C stuff (and to boost too), so please forgive me if this is a noob question... Best regards, Bastien

3 5

Re: [Boost-users] Is this possible with boost? Linear Interpolation?
by rakesh patil 06 Nov '12

06 Nov '12

Hey Joel, Thanks for your quick reply. I check those links. If I am not mis-understood, that library can be used to compute intermediate values for a given range. In my case it is a polyline. The track of polyline must be maintained properly. The topology must not change here. Even if it changes, the change must not be a major one. So this one won't be of much use as of now. And before posting the question I checked Boost.Geometry. But I didn't find what I want. Any other possibilities other than writing my own code to do this? Thanks Regards

1 0

Worth reporting warnings for 1.52?
by Lemay.Steve 06 Nov '12

06 Nov '12

I know the documentation says to expect warnings during compilation. So, are these boost 1.52 warnings worth reporting? Or are they typically tolerated? (gnu 4.7.2 C++11 enabled) Line 27367: ./boost/regex/v4/cpp_regex_traits.hpp:1069:34: warning: narrowing conversion of '2147483648u' from 'unsigned int' to 'int' inside { } [-Wnarrowing] Line 27372: libs\regex\build\..\src\regex.cpp:195:64: warning: narrowing conversion of '2147483648u' from 'unsigned int' to 'int' inside { } [-Wnarrowing] Line 27403: ./boost/regex/pending/object_cache.hpp:64:37: warning: narrowing conversion of '2147483648u' from 'unsigned int' to 'int' inside { } [-Wnarrowing] Line 27429: ./boost/regex/v4/regex_traits_defaults.hpp:329:73: warning: narrowing conversion of ''\37777777605'' from 'char' to 'const wchar_t' inside { } [-Wnarrowing] Line 27430: ./boost/regex/v4/regex_traits_defaults.hpp:331:64: warning: narrowing conversion of ''\37777777605'' from 'char' to 'const wchar_t' inside { } [-Wnarrowing] Line 27751: libs\thread\src\pthread\once.cpp:18:60: warning: narrowing conversion of '2147483648u' from 'unsigned int' to 'int' inside { } [-Wnarrowing] Line 27752: libs\thread\src\pthread\once.cpp:24:47: warning: narrowing conversion of '2147483648u' from 'unsigned int' to 'int' inside { } [-Wnarrowing] In file included from ./boost/regex/v4/regex_traits.hpp:39:0, from ./boost/regex/regex_traits.hpp:27, from ./boost/regex/v4/regex.hpp:39, from ./boost/regex.hpp:31, from libs\regex\build\..\src\winstances.cpp:30: ./boost/regex/v4/cpp_regex_traits.hpp: In instantiation of 'boost::re_detail::parser_buf<charT, traits>::pos_type boost::re_detail::parser_buf<charT, traits>::seekoff(boost::re_detail::parser_buf<charT, traits>::off_type, std::_Iosb<int>::seekdir, std::_Iosb<int>::openmode) [with charT = wchar_t; traits = std::char_traits<wchar_t>; boost::re_detail::parser_buf<charT, traits>::pos_type = std::fpos<_Mbstatet>; boost::re_detail::parser_buf<charT, traits>::off_type = long int; std::_Iosb<int>::seekdir = std::_Iosb<int>::_Seekdir; std::_Iosb<int>::openmode = std::_Iosb<int>::_Openmode]': ./boost/regex/v4/regex_split.hpp:168:1: required from here ./boost/regex/v4/cpp_regex_traits.hpp:117:4: warning: case value '0' not in enumerated type 'std::_Iosb<int>::seekdir {aka std::_Iosb<int>::_Seekdir}' [-Wswitch] ./boost/regex/v4/cpp_regex_traits.hpp:129:4: warning: case value '1' not in enumerated type 'std::_Iosb<int>::seekdir {aka std::_Iosb<int>::_Seekdir}' [-Wswitch] ./boost/regex/v4/cpp_regex_traits.hpp:123:4: warning: case value '2' not in enumerated type 'std::_Iosb<int>::seekdir {aka std::_Iosb<int>::_Seekdir}' [-Wswitch] Steven LeMay Game Platform Engineering International Game Technology 9295 Prototype Way Reno, NV 89521 Office: +1 775.448.8089 Mobile: +1 775.813.6676 steven.lemay(a)igt.com<mailto:steven.lemay@igt.com> This email message is for the sole use of the intended recipient(s) and may contain confidential and privileged information. Any unauthorized review, use, disclosure or distribution is prohibited. If you are not the intended recipient, please contact the sender by reply email and destroy all copies of the original message. Any humorous implications are purely the result of misinterpretations provided by the reader.

2 1

Is this possible with boost? Linear Interpolation?
by rakesh patil 06 Nov '12

06 Nov '12

Hello, I have a set of xy points(forms a polyline). What I want to do is, with the help of existing set of points, I need to redistribute the number of points such that the first and last point remain is same position. The intermediate points will change. For example, initally I have set of 10 points. I want to redistribute this polyline containing 10 points into 40 points. But the first and last point must remain as it is. Internal points may be adjusted. I guess interpolation should be used for this. What I want to know is that whether this is possible to do using boost c++ library? Thanks Regards

2 1

[Boost.Test] Test Ordering?
by John M. Dlugosz 05 Nov '12

05 Nov '12

If I make unit*test*s in different source files, I need to declare a BOOST_AUTO_*TEST*_SUITEin each one, right? At link time, these appear in some undetermined order. How can I cause them to be run in the desired order instead?

3 3

On Windows, how does Boost decide which MSVS version to use, if I have more than one installed?
by Ramon F Herrera 05 Nov '12

05 Nov '12

When I tried to build some app, I ended up with this error message: 1>LINK : fatal error LNK1104: cannot open file 'libboost_filesystem-vc80-mt-1_51.lib' I am sure it is due to the fact that I have a couple of Boost installations and 2 Versions of MSVS as well (2005 and 2010). NB: This is the way I build Boost on Windows: .\bootstrap.bat .\bjam.exe --with-date_time --with-filesystem --with-regex --with-system --stagedir=. --build-type=complete toolset=msvc The question is about that last parameter above. Does the install procedure: (a) Go to "Program Files" and takes a look at the name of the highest numbered MSVS folder? or (b) Is this info extracted from the Registry or something? TIA, -Ramon

2 1

Boost 1.52.0 released!
by Marshall Clow 05 Nov '12

05 Nov '12

Release 1.52.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains numerous enhancements and bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_52_0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.52.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Beman Dawes Daniel James Eric Niebler Marshall Clow Rene Rivera Vladimir Prus

3 2

Linking problems with boost serialization and MinGW
by Florian Burkart 05 Nov '12

05 Nov '12

Hi, I am having a bit of trouble linking to boost serialization with MinGW. If I don't include -lboost_serialization-mgw46-mt-d-1_50 I get loads of undefined references, however, if I do include it, most disappear but I still get some, namely I get RDebug/libFlamLib.a(Common_Collector.o): In function `ZN5boost7archive21basic_text_oprimitiveISoE4saveINS0_14object_id_typeEEEvRKT_': /Sys/boost/MinGW32/boost_1_50_0/include/boost-1_50/boost/archive/basic_text_oprimitive.hpp:89: undefined reference to `boost::archive::archive_exception::archive_exception(boost::archive::archive_exception::exception_code, char const*, char const*)' RDebug/libFlamLib.a(Common_Collector.o): In function `ZN5boost7archive21basic_text_oprimitiveISoE4saveINS0_21object_reference_typeEEEvRKT_': /Sys/boost/MinGW32/boost_1_50_0/include/boost-1_50/boost/archive/basic_text_oprimitive.hpp:89: undefined reference to `boost::archive::archive_exception::archive_exception(boost::archive::archive_exception::exception_code, char const*, char const*)' RDebug/libFlamLib.a(Common_Collector.o): In function `ZN5boost7archive21basic_text_oprimitiveISoE4saveINS0_13class_id_typeEEEvRKT_': /Sys/boost/MinGW32/boost_1_50_0/include/boost-1_50/boost/archive/basic_text_oprimitive.hpp:89: undefined reference to `boost::archive::archive_exception::archive_exception(boost::archive::archive_exception::exception_code, char const*, char const*)' RDebug/libFlamLib.a(Common_Collector.o): In function `ZN5boost7archive21basic_text_oprimitiveISoE4saveINS0_23class_id_reference_typeEEEvRKT_': /Sys/boost/MinGW32/boost_1_50_0/include/boost-1_50/boost/archive/basic_text_oprimitive.hpp:89: undefined reference to `boost::archive::archive_exception::archive_exception(boost::archive::archive_exception::exception_code, char const*, char const*)' RDebug/libFlamLib.a(Common_Collector.o): In function `ZN5boost7archive21basic_text_oprimitiveISoE4saveINS0_13tracking_typeEEEvRKT_': /Sys/boost/MinGW32/boost_1_50_0/include/boost-1_50/boost/archive/basic_text_oprimitive.hpp:89: undefined reference to `boost::archive::archive_exception::archive_exception(boost::archive::archive_exception::exception_code, char const*, char const*)' RDebug/libFlamLib.a(Common_Collector.o):/Sys/boost/MinGW32/boost_1_50_0/include/boost-1_50/boost/archive/basic_text_oprimitive.hpp:89: more undefined references to `boost::archive::archive_exception::archive_exception(boost::archive::archive_exception::exception_code, char const*, char const*)' follow Basically they all refer to "`boost::archive::archive_exception::archive_exception". boost serialization built fine with .\b2.exe --prefix=c:\Sys\boost\MinGW32\boost_1_50_0 toolset=gcc address-model=32 --with-serialization install The same code compiles and links just fine with gcc on linux and MSVC on windows. I haven't isolate the issue yet, so am afraid can't give a reproducible sample, but any ideas so far? Maybe look familiar? Thanks, Florian

2 3

Symantec Norton shold not longer flag boost_signals-vc100-mt-gd-1_50.dll as suspicious
by Paul A. Bristow 05 Nov '12

05 Nov '12

I was slightly inconvenienced by having the new version of boost_signals-vc100-mt-gd-1_50.dll that I had just built flagged by Norton as suspicious and placed in 'quarantine'. "Name of detection given by Symantec product: suspicious.cloud.7.f" But I was impressed that reporting this to Symantec I got (in 48 hours) this response: "Dispute Submission [2985065] Symantec FP Incident Response falsepositives(a)symantec.com" saying that it was now whitelisted in the daily virus definitions update. Paul PS I have had bjam/b2 also flagged in the past saying it only had five users! --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

[range] questions about documentation and usage
by Robert Ramey 05 Nov '12

05 Nov '12

I want to use Boost.Range in a bigger way. But I have a few problems with it. I think most of them are just issues of understanding and the writting of the documentation a) I see examples like std::vector<T> v; boost::range::find(v, 0); find(SinglePassRange& rng, Value val); BUT when looking at the documentation at http://www.boost.org/doc/libs/1_51_0/libs/range/doc/html/range/concepts/sin… I see only two valid expressions boost::begin(a) boost::end(a) where in this case a would be v which is of type std::vector<int>. BUT boost:begin(v) is NOT a valid expression for the above. Spelunking into the range header code reveals the following: template< class T > inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type begin( T& r ) { #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ using namespace range_detail; #endif return range_begin( r ); } and template< typename C > inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type range_begin( C& c ) { // // If you get a compile-error here, it is most likely because // you have not implemented range_begin() properly in // the namespace of C // return c.begin(); } This effectively means that the "Valid Expressions" for SinglePassRange part of the documenation should read: a.begin() a.end() Doesn't it. I would be interested to know if I got this wrong. b) I see the template iterator_range<ForwardTraversalIterator> - which seem to be to in an instance of what the ForwardRangeConcept should be. To me, the range documentation is out of whack. I can figure it out - but it's misleading - atleast to me. c) Another really annoying thing is that every thing is directly in the boost namespace. This breaks the convention that library headers are in boost/<library name> and in the namespace boost::<library name>. This creates a lot of opportunity for conflict. Robert Ramey

8 38

Debug Assertion with MFC
by Yiğit Çağrı Akkaya 05 Nov '12

05 Nov '12

Hi, I have an MFC application. There are plenty of dll's written by us. In one dll module, we use boost. However, on start up of application, it throws several assertions about loading dll. I know assertions are available only for debug mode, but we want to get rid of every small problem in order to provide a stable release. I made web search and I found this thread: http://lists.boost.org/threads-devel/2009/06/0476.php This belongs to 2009 and Boost 1.39. We use Boost 1.48 and Visual Studio 2008 SP1. Thread says that this happens when MFC application statically linked to boost. Probably, nothing changed up to 1.48 because I found that line and commented it out(extern BOOL (WINAPI * const _pRawDllMain)(HANDLE, DWORD, LPVOID)=&dll_callback;). Is there a macro defined in boost to differentiate static and dynamic builds? If there is a macro, we are planning to wrap macro around that line. Or is there any better solution for this? Thanks in advance...

1 0

[Program_options] Positional options are not parsed, "unrecognised option". A bug?
by Dmitry Shintyakov 04 Nov '12

04 Nov '12

Hello, everybody. I am having problems using Boost::Program_options library. I have a program, that have several optional keyword arguments, and 3 positional arguments. Keyword arguments are parsed well, but positional arguments are always causing an exception? saying: "unrecognised option" After spending 2 hours trying to find a problem, I decided to ask for help. I am using Boost 1.50.0-2, GCC 4.7.2 under Arch linux (32 bit). My example is almost exact copy from the tutorial, so I suspect that there is some bug. Example code (with all non-relevant code removed) follows. To test it, run it as following: ./a.out 123 123 test Expected behaviour is to see a line: Arguments: output=output.png width=123 height=123 Instead, I see this: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail:: error_info_injector<boost::program_options::unknown_option> >' what(): unrecognised option '1' ==Test code== #include <iostream> #include <boost/program_options.hpp> using namespace std; int main( int argc, char * argv[] ) { namespace po = boost::program_options; string output_file; po::options_description desc("converter [options] width height source"); desc.add_options() ("help", "Show help message") ("output,o", po::value<string>( &output_file )->default_value("output.png"), "Output file to put converted image data to. Default is output.png") ; po::positional_options_description pos_desc; pos_desc.add("width",1).add("height",1).add("input-file",1); po::variables_map vm; po::store( po::command_line_parser(argc, argv) .options(desc) .positional(pos_desc) .run() , vm ); po::notify( vm ); if( vm.count("help") ){ cout << desc <<endl; return 0; } if (!vm.count("width") || !vm.count("height") || !vm.count("input-file") ){ cerr<<"Error: width, weight and input file must be specified"<<endl; return 1; } cout << "Arguments: output="<<output_file << " width="<<vm["width"].as<string>() << " height="<<vm["height"].as<string>()<<endl; return 0; }

1 0

MingW compilation errors
by Alice Gamewell 03 Nov '12

03 Nov '12

I have managed to build the boost libraries with b2 and the gcc toolset option. Alas, whenever I use a header which invokes such a library in Code::Blocks chained with MingW I get these errors: undefined reference to _Unwind_SiLj_Register undefined reference to _Unwind_SiLj_Unregister undefined reference to _Unwind_SiLj_Resume undefined reference to __gxx_personality_sj0 undefined reference to _WSACleanup@0 undefined reference to _WSAStartup@8 All but the last two repeatedly. I would really appreciate anyone who could point me out of this mess. Thanks!

3 2

[Date Time] MSVC CRT assertion stops execution in debug mode
by Fumito Hamamura 03 Nov '12

03 Nov '12

Hi, I'm testing the code below using boost 1.50.0 and Visual C++ 2008. What I expected was, the ptime t doesn't throw an exception even though it doesn't get a valid date time string passed by the wstringstream ss. When it is compiled in Release mode, it works as expected, i.e. the program runs without an error, but when compiled in Debug mode, the program stops because debug assertion fails in _chvalidator in isctype.c, which is called by std::isspace. Is there a known workaround for this? Thanks, Fumito ----- #include <iostream> #include <string> #include "boost/date_time/posix_time/posix_time.hpp" int wmain(int argc, wchar_t* argv[]) { boost::posix_time::wtime_input_facet* dt_facet(new boost::posix_time::wtime_input_facet(L"%Y/%m/%d %H:%M")); std::wstringstream ss; boost::posix_time::ptime t; ss.imbue(std::locale(ss.getloc(), dt_facet)); ss << L"あいうえお"; ss >> t; return 0; } -----

2 1

C++ announcements coming tomorrow
by Beman Dawes 03 Nov '12

03 Nov '12

Herb Sutter, the Convenor of the ISO C++ Standards Committee, will be making some announcements tomorrow likely to be of interest to C++ developers in general and Boosters in particular. The venue is a talk titled "The Future of C++" at the Microsoft Build Conference. While some of Herb's announcements will be specific to Microsoft, the key C++ initiatives involve Boost and the whole C++ community. Some of the ideas evolved from feedback Herb got at C++Now/BoostCon 2012 last May. I'll post a summary of the announcements tomorrow, but you can also watch the live stream at http://channel9.msdn.com at 12:45 PM Pacific time. For other time zones, see http://www.timeanddate.com/worldclock/fixedtime.html?iso=20121102T1945 --Beman PS: We don't usually post teasers like this on the Boost lists, but Herb asked that a notice be posted, and given the endless work he has put in on this over the summer, I couldn't say no.

4 4

boost with mingw
by Kraus Philipp 03 Nov '12

03 Nov '12

Hello, I try to build Boost with MinGW / MSYS. I have found in the dokumentation http://www.boost.org/doc/libs/1_51_0/more/getting_started/windows.html that MinGW shell is not supported, but I can build bJam with booststrap.sh --toolset=mingw under the shell, but I get the error: mingw.jam: No such file or directory Can I build boost under MinGW shell or another shell with the MinGW gcc? Thanks Phil

3 4

[Filesystem] Reverse traversal of boost::filesystem::path::const_iterator?
by Nat Linden 02 Nov '12

02 Nov '12

I've stumbled across some code in our code base that wants to walk up a fixed number of containing parent directories from the starting path. (It's in a Mac application bundle nested within another.) boost::filesystem::path::[const_]iterator is described as bidirectional. But boost::filesystem::path has no rbegin() or rend(). In libs/filesystem/test/path_test.cpp's iterator_tests(), I see, for a path variable named itr_ck, use of boost::prior(itr_ck.end()). That suggests that usage of this form would be legal: path mypath = /* ...something... */; for (path::const_iterator rcomp(mypath.end()), rend(mypath.begin()); rcomp != rend; --rcomp) { // ... use boost::prior(rcomp) ... } Am I correct? Given the way some containers implement end(), I always feel nervous about decrementing end(). I'm happy to see that Boost.Filesystem's own tests guarantee that usage; but is there anything in the documentation that would have assured me of that?

6 8

boost::heap::skew_heap(1_51_0) ordered_iterator
by imns70 02 Nov '12

02 Nov '12

Hi This question pertains to boost::heap::skew_heap as defined here:- http://www.boost.org/doc/libs/1_51_0/doc/html/boost/heap/skew_heap.html Can you please help me understand what is the complexity of skew heap traversal using ordered_iterator. I am traversing over the heap, using ordered_iterator as shown in code below :- for(bk_heap::ordered_iterator it=buy_heap->ordered_begin();it!=buy_heap->ordered_end();it++) { /// some code here... } I suspect it to be O(n), but just want to make sure. Thanks in advance. -- View this message in context: http://boost.2283326.n4.nabble.com/boost-heap-skew-heap-1-51-0-ordered-iter… Sent from the Boost - Users mailing list archive at Nabble.com.

1 1

advice with containers and data types
by Georg.Kellerer＠lfu.bayern.de 02 Nov '12

02 Nov '12

Hi all, i am a newbie to boost and hope, somebody here can give me an advice. i want to change the implementation of an existing container class in one of my projects. It is a container which for the moment is based on a very old roguewave version which should be replaced by boost. main features of this container are: - the container is based on a hashmap. - the key datatype can be string or int. - the value data type can be string, int, double, time, date, the container type itself and another container type. I thought about implementing the class based on a map container with boost:any as key and value type. is this possible? Or do you have other and even better recommendations for me? i am a bit confused about the great number of diferent containers and datastructures the boost library offers. Thanks in advance, Georg

2 1

[phoenix] Using with Boost.Function.
by Robert Jones 02 Nov '12

02 Nov '12

Can anyone tell me the correct incantation to get the 'Not OK' lines to work? Thx, Rob. #include <boost/function.hpp> #include <boost/phoenix/core.hpp> #include <boost/phoenix/operator.hpp> #include <boost/phoenix/bind/bind_member_variable.hpp> #include <boost/phoenix/bind/bind_function.hpp> #include <boost/function.hpp> #include <list> struct S { int i; }; void f( std::list<S> & l, int i ) { using boost::phoenix::arg_names::_1; using boost::phoenix::arg_names::_2; // OK l.remove_if( bind( & S::i, _1 ) >= i ); *// Not OK.* * boost::function<bool( int, int )> pred = _1 >= _2;* * l.remove_if( bind( pred, _1, i ) );* }

3 3

Iterator Range, sub range of a desired size
by David Kimmel 01 Nov '12

01 Nov '12

Is there a function in BOOST, given a starting point and a desired size, that returns iterators for a (sub) range? For example, given: a boost::circular_buffer which contains: 1 2 3 4 5 6 7 8 9 10 a starting point which is an iterator pointing to 5 and finally a desired size which is an int s = 4 The result of which would be iterators producing: 5 6 7 8 A possible implementation might be this (but I was hoping there was a BOOST version since I can't find an STD algorithm) template <typename Itr> std::pair<Itr, Itr> getWindowDown(Itr begin, Itr end, Itr start, const int windowSize) { // Down first, then up if need be const Itr bottom = (end - start > windowSize) ? (start + windowSize) : (end); const Itr top = (bottom - begin > windowSize) ? (bottom - windowSize) : (begin); return make_pair(top, bottom); } Thanks, -- View this message in context: http://boost.2283326.n4.nabble.com/Iterator-Range-sub-range-of-a-desired-si… Sent from the Boost - Users mailing list archive at Nabble.com.

6 17