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

Re: [Boost-users] [Containers] Marshalling deques
by Brian Wood 25 Aug '11

25 Aug '11

Ion Gazta?aga: > >El 22/08/2011 19:44, Brian Wood escribi?: >> Would you be willing to add a function that gives that? Tia. > > Yes, I think we need to think about a useful interface for that, maybe > something like local_iterator in unordered containers or something like > segmented iterator described by Matt Austern in his "Segmented Iterators > and Hierarchical Algorithms" paper If I could get the number of elements in the first chunk and the size of the chunks, that would be sufficient. (I believe the size of the chunks is constant within a deque instance.) I find it disappointing that the latest version of the standard doesn't have anything related to this and would rather just get something working than figuring out what would be a flexible, general interface. Shalom, Brian Wood Ebenezer Enterprises http://webEbenezer.net

3 2

[build] cannot specify different version of gcc
by Brodie Thiesfield 25 Aug '11

25 Aug '11

Hi, I'm trying to build boost on CentOS 5.5 using the /usr/bin/gcc44 compiler and I'm running into difficulties with documentation not fitting reality. How do I make this work? What I've tried... Note: I've removed /usr/bin/gcc and /usr/bin/g++ to force errors when gcc44 and g++44 are not used. Using ./bootstrap.sh Building Boost.Jam with toolset ... tools/jam/src/### ### No toolset specified. Please use --toolset option. Setting CC=/usr/bin/gcc44 and CXX=/usr/bin/g++44 (note that this won't work if gcc and g++ exist because then it will default to the gcc toolkit and not the gcc-4.4 toolkit that I want). This builds a number of things (looking at the bootstrap.log) but still gives the following error. Ignoring the error and calling ./bjam then fails. Building Boost.Jam with toolset ... tools/jam/src/### ### No toolset specified. Please use --toolset option. Using ./bootstrap.sh --toolset=gcc gives an error: unrecognized option: --toolset=gcc Using ./bootstrap.sh --with-toolset=gcc gives an error: Building Boost.Jam with toolset gcc... Failed to build Boost.Jam -> bootstrap.log shows that it is trying to build with gcc, which doesn't exist, therefore error. Using ./bootstrap.sh --with-toolset=gcc-4.4 gives an error: Building Boost.Jam with toolset gcc... Failed to build Boost.Jam -> bootstrap.log shows ### Unknown toolset: gcc-4.4 Creating ~/user-config.jam as: import toolset.using ; using gcc : 4.4 : g++44 ; export BOOST_USER_CONFIG=~/user-config.jam Then calling the same ./bootstrap.sh command lines above show no difference. How in the world do I get this thing to use /usr/bin/gcc44 and /usr/bin/g++44 to compile? I think that I'm going to have to create local links ./gcc -> /usr/bin/gcc44 and add the current directory to the path just to get this to build the way that I want it to. This seems crazy. Regards, Brodie

3 3

Re: [Boost-users] [Containers] Marshalling deques
by Brian Wood 24 Aug '11

24 Aug '11

Ion Gazta?aga: El 24/08/2011 20:06, Brian Wood escribi?: >> >> If I could get the number of elements in the first chunk and the >> size of the chunks, that would be sufficient. (I believe the size >> of the chunks is constant within a deque instance.) > > Not necessarily, but I think all implementations do that. The question > is whether we should have a standard-friendly and implementation > agnostic interface or an interface just for boost::deque implementation. How about both? First a boost::deque implementation and then if someone is inclined to delve into this further a more general implementation that might replace the earlier implementation. Since this wasn't addressed by C++11, I'm not sure how long it will take to get attention. If the interface we come up with has weaknesses, someone else will figure out how to improve upon it. Regards, Brian Wood Ebenezer Enterprises http://webEbenezer.net

1 0

Boost::Test: Registering Positive and Negative Tests
by Jeffrey Walton 24 Aug '11

24 Aug '11

Hi All, Our project currently uses Boost ::Test and auto registers the tests with BOOST_AUTO_TEST_CASE. We have both positive an negative tests, and would like to register accordingly so we can selectively turn off negative tests (for example, turn of negative tests when running Valgrind due to Signal/Noise ratio). Is this supported? Jeff

2 1

[Boost.Signals] set_connection
by gast128 24 Aug '11

24 Aug '11

Hello all, I use the 'set_controlling' function for automatic disconnect when the connection goes out of scope. This is quite handy but not documented. Is it an implementation detail not to be used ordinary mortals or a small documentation mismatch? Also the reference section of the documentation mentions that scope_connection's are noncopyable but in fact u can just copy them (with all consequences). Is this a documentation overlook (I would think that marking them as noncopyable is safer). I use Boost 1.47

1 0

multi_array with large dimensions crashes
by Jothy 24 Aug '11

24 Aug '11

Hi all, I have just started to use boost libs. I am trying to create a large float array (mandatory for my purpose). it works fine till certain limit, but crashes above that. I think it about allocating memory in the stack. My code is like this typedef boost::multi_array<float,3> array_type; typedef array_type::index index; array_type Array(boost::extents[xDim][yDim][zDim]);//500,300,400 for instance Can some one help me to resolve this? Thanks Jothy

3 6

Re: [Boost-users] Boost.Serialization: Error on Calling Class Method during serialization process
by Alex Perry 24 Aug '11

24 Aug '11

Hazrat Pradipta Ranjali <mrdipta(a)gmail.com> wrote :- > I have the following problem when I try to call method in "TestSerialize" > class during serialization process. > > Here is my code: > > class TestSerialize > { > public: > std::string GetVal() { return Val + "abc"; } > void SetVal(std::string tVal) { Val = tVal.substr(0, 2); } GetVal() needs to be declared as const HTH Alex

1 0

[phoenix] Simple bind example not compiling
by Gabriel Redner 24 Aug '11

24 Aug '11

Hi all, I am trying to compile the phoenix::bind example partially laid out here: http://www.boost.org/doc/libs/1_47_0/libs/phoenix/doc/html/phoenix/modules/… The code, with #includes and using decls added, is: ========== #include <boost/phoenix/bind/bind_function.hpp> #include <boost/phoenix/core/argument.hpp> #include <iostream> using namespace boost::phoenix; using namespace boost::phoenix::placeholders; void foo(int n) { std::cout << n << std::endl; } int main() { bind(&foo, arg1)(4); } ========== However, the compiler (g++ 4.4.5) complains: /home/gredner/main.cpp: In function ‘int main()’: /home/gredner/main.cpp:16: error: no matching function for call to ‘bind(void (*)(int), const boost::phoenix::actor<boost::proto::exprns_::basic_expr<boost::proto::tag::terminal, boost::proto::argsns_::term<boost::phoenix::argument<1> >, 0l> >&)’ What am I doing wrong? I also tried fully-qualifying 'bind' and 'arg1', but got the same results. Also, there is no simple bind example under libs/phoenix/examples - in light of this sort of problem, it would be very nice to have one. Thanks, -Gabe

3 4

Program Options / Windows command line
by asif saeed 24 Aug '11

24 Aug '11

Hi, The page at http://www.boost.org/doc/libs/1_47_0/doc/html/program_options/howto.html#id… says that the "split_winmain function is a portable mechanism provided by the library." Does that mean that the same code (containing the split_winmain function, that is) will also run on Linux, for example? I guess it would return normal args on Linux. Could you elaborate please? In addition, could you please post a link to a cookbook-type recipe for parsing windows command-line (that parses linux/unix command line as well)? Are there any tutorials to get up to speed with program options - especially, the windows command-line parsing stuff? Best regards, Asif

1 0

[thread] boost::this_thread::get_id causing interrupt
by Yi Ding 24 Aug '11

24 Aug '11

Hi everyone, I've been dipping my toes into boost threads, and I'm running into a strange issue. What I'm trying to do is to run a comparison between thread_ids. I have an object that's "owned" by a thread, and when something calls one of its functions, I'd like to compare the thread_id to the owner's thread id. So I thought that boost::this_thread::get_id would do the trick to figure out what the current running thread's thread id is. For some reason, when I call it, an interrupt is signalled to my main thread. Is boost::this_thread::get_id not the right thing to use here? Thanks in advance, Yi

1 1

Boost.Conversion review
by Gordon Woodhull 23 Aug '11

23 Aug '11

Hi all, The review of Vicente Botet Escriba's Conversion library starts this Saturday August 20 and continues through August 29. This library provides a general system for type-to-type conversion. As such, it can be thought of either as a substitute for overloading static_cast, or as an alternative to lexical_cast when the intermediate conversion to text is not wanted. The code is in the sandbox: http://svn.boost.org/svn/boost/sandbox/conversion/ And the docs are here: http://svn.boost.org/svn/boost/sandbox/conversion/libs/conversion_ext/doc/h… I'll send out a formal announcement when the review begins, but I wanted to send out this reminder because participation in summer months tends to be somewhat low. Your review and/or discussion would be greatly appreciated. As always, please post to the main Boost list if possible, or the boost-users list, or you can send your review directly to the Review Managers. Thanks, Gordon Woodhull, Review Manager Espen Harlinn, Review Manager Assistant

3 2

Re: [Boost-users] [IOStream] issue
by Sean Farrow 23 Aug '11

23 Aug '11

Hi: I forgot to include the error in the last message. The error is: error C2039: 'category' : is not a member of 'std::basic_string<_Elem,_Traits,_Ax>' traits.hpp 242 1 Surface Reader visual studio 2010, windows 7.1 sdk. Cheers Sean.

1 0

[iostreams] issue
by Sean Farrow 23 Aug '11

23 Aug '11

Hi: I am writing some serialization code that uses IOStreams as a filter. The following is the class I am trying to serialize. class MIDISurface { public: // surface variables std::wstring strSurfaceName; }; The string header file is included. I then have a template function as follows: template <class SerializingType> void SaveData(SerializingType Data, boost::filesystem::path FileName, bool EncryptData) { //Check file existance. if (boost::filesystem::exists(FileName)) //Delete file boost::filesystem::remove(FileName); //Now create a WOfstream to serialize the data. std::wofstream OutputStream(FileName.generic_wstring()); //Create a filtering_stream to allow us to encrypt the data if necessary. boost::iostreams::wfiltering_stream<boost::iostreams::output> FilteringStream(FileName.generic_wstring()); if (EncryptData) //FilteringStream.push(test); //add the encryption filter defined in Encryption.hpp. FilteringStream.push(OutputStream); boost::archive::xml_woarchive Archive(FilteringStream); //create an archive and assign the filtering stream. Archive << BOOST_SERIALIZATION_NVP(Data); } I am including the following headers. //Standard c++ headers. #include <fstream> #include <stdlib.h> #include <string> #include <boost/iostreams/traits.hpp> //boost filesystem headers. #include <boost/config.hpp> #define BOOST_FILESYSTEM_VERSION 3 #include <boost/filesystem/operations.hpp> #include <boost/filesystem/path.hpp> //Boost xml serialization headers. #include <boost/archive/xml_wiarchive.hpp> #include <boost/archive/xml_woarchive.hpp> //Data type boost serialization headers. #include <boost/config.hpp> #include <boost/serialization/string.hpp> #include <boost/Serialization/Vector.hpp> #include <boost/Serialization/Map.hpp> #include <boost/Serialization/nvp.hpp> //boost io streams header. #include <boost/iostreams/detail/config/wide_streams.hpp> #include <boost/iostreams/concepts.hpp> #include <boost/iostreams/detail/ios.hpp> // BOOST_IOS. #include <boost/iostreams/filter/stdio.hpp> #include <boost/iostreams/operations.hpp> #include <boost/iostreams/filtering_stream.hpp> I am using boost 1.47, from the installer from boost pro computing. Can anyone point in the direction of the solution. Any help appreciated. Sean

1 0

[Serialization | Multi-Array] About the array.hpp header
by Júlio Hoffimann 23 Aug '11

23 Aug '11

Dear all, After read the "Optimizations" section of Boost.Serialization docs ( http://www.boost.org/doc/libs/1_47_0/libs/serialization/doc/special.html#op…) i get confused about the need to include/use array.hpp header with std::vector<>. I just need to include <boost/serialization/vector.hpp> and all is done, correct? Furthermore, i'm wondering if there is some header to include for serialize boost::multi_array<> class without doing myself the overload of the "array wrapper" and serialization member functions. Thanks in advance, Júlio.

1 0

Serialization: how to port binary archives containing NAN created with version 1.43 to version 1.47?
by Terry McLendive 23 Aug '11

23 Aug '11

Hi everyone, I am encountering a particularly gnarly version of the backward-compatibility problem with binary archives that others have discovered (here: http://groups.google.com/group/boost-list/browse_thread/thread/f4e3287f6925…, for example). Specifically, I have a number of binary archives created with version 1.43 of the library that are unreadable using version 1.47. I'd like to "port" them forward, so my initial plan was to compile a simple translator program against the 1.43 library that would read the binary archives and save them as (1.43) text archives. Then, a second program compiled against the 1.47 library would read the text archives and save them as (1.47) binary. Easy peasy. Except: the archives contain NAN values, which work fine when everything is binary but fail to deserialize for any version of the library when the archive is text (or xml, apparently), for reasons I don't quite understand. So my question is: how can I take my (1.43) binary archives containing NAN values and get them into a format readable by the current (1.47) version of the library? Is it possible? Thanks, Terry (An aside: it seems strange that I'm allowed to serialize a NAN to text, but it breaks when I try to deserialize it... why not prevent the creation of un-deserializable archives at the point of serialization?).

3 4

Valgrind Supression Settings
by Jeffrey Walton 23 Aug '11

23 Aug '11

Hi All, Does anyone have supression specs for Boost? We're getting overwhelmed with Boost squawks, and we are concerned Boost noise is drowning out problems with our gear. A small sample is below. For the full run, there are about 12,000 lines, mostly relating to Boost. Jeff ... ==8199== 24 bytes in 1 blocks are still reachable in loss record 147 of 999 ==8199== at 0x4C27CC1: operator new(unsigned long) (vg_replace_malloc.c:261) ==8199== by 0x50D221C: boost::runtime::environment::rt_env_detail::new_var_record(boost::unit_test::basic_cstring<char const>) (new_allocator.h:89) ==8199== by 0x50D2A52: boost::runtime::environment::rt_env_detail::variable_data& boost::runtime::environment::rt_env_detail::init_new_var<bool, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char> >(boost::unit_test::basic_cstring<char const>, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char>) (environment.hpp:54) ==8199== by 0x50BDE39: T.6666 (environment.hpp:113) ==8199== by 0x50BDF63: boost::unit_test::runtime_config::show_build_info() (unit_test_parameters.ipp:395) ==8199== by 0x50B3E16: boost::unit_test::unit_test_log_t::test_start(unsigned long) (unit_test_log.ipp:140) ==8199== by 0x50A8623: boost::unit_test::ut_detail::callback0_impl_t<int, boost::unit_test::ut_detail::test_start_caller>::invoke() (framework.ipp:71) ==8199== by 0x509D51D: boost::execution_monitor::catch_signals(boost::unit_test::callback0<int> const&) (callback.hpp:118) ==8199== by 0x509D59A: boost::execution_monitor::execute(boost::unit_test::callback0<int> const&) (execution_monitor.ipp:1282) ==8199== by 0x50A5891: boost::unit_test::framework::run(unsigned long, bool) (framework.ipp:413) ==8199== by 0x50B4D42: boost::unit_test::unit_test_main(bool (*)(), int, char**) (unit_test_main.ipp:185) ==8199== by 0x475CC1: main (unit_test.hpp:59) ==8199== ==8199== 24 bytes in 1 blocks are still reachable in loss record 148 of 999 ==8199== at 0x4C27CC1: operator new(unsigned long) (vg_replace_malloc.c:261) ==8199== by 0x50D221C: boost::runtime::environment::rt_env_detail::new_var_record(boost::unit_test::basic_cstring<char const>) (new_allocator.h:89) ==8199== by 0x50D2A52: boost::runtime::environment::rt_env_detail::variable_data& boost::runtime::environment::rt_env_detail::init_new_var<bool, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char> >(boost::unit_test::basic_cstring<char const>, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char>) (environment.hpp:54) ==8199== by 0x50BDE39: T.6666 (environment.hpp:113) ==8199== by 0x50BDFA3: boost::unit_test::runtime_config::catch_sys_errors() (unit_test_parameters.ipp:409) ==8199== by 0x50B7CF2: boost::unit_test::unit_test_monitor_t::execute_and_translate(boost::unit_test::test_case const&) (unit_test_monitor.ipp:63) ==8199== by 0x50A8940: boost::unit_test::framework_impl::visit(boost::unit_test::test_case const&) (framework.ipp:150) ==8199== by 0x50D7762: boost::unit_test::traverse_test_tree(boost::unit_test::test_suite const&, boost::unit_test::test_tree_visitor&) (unit_test_suite.ipp:207) ==8199== by 0x50A5C27: boost::unit_test::framework::run(unsigned long, bool) (framework.ipp:436) ==8199== by 0x50B4D42: boost::unit_test::unit_test_main(bool (*)(), int, char**) (unit_test_main.ipp:185) ==8199== by 0x475CC1: main (unit_test.hpp:59) ==8199== ==8199== 24 bytes in 1 blocks are still reachable in loss record 149 of 999 ==8199== at 0x4C27CC1: operator new(unsigned long) (vg_replace_malloc.c:261) ==8199== by 0x50D221C: boost::runtime::environment::rt_env_detail::new_var_record(boost::unit_test::basic_cstring<char const>) (new_allocator.h:89) ==8199== by 0x50D2A52: boost::runtime::environment::rt_env_detail::variable_data& boost::runtime::environment::rt_env_detail::init_new_var<bool, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char> >(boost::unit_test::basic_cstring<char const>, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char>) (environment.hpp:54) ==8199== by 0x50BDE39: T.6666 (environment.hpp:113) ==8199== by 0x50BDFE3: boost::unit_test::runtime_config::auto_start_dbg() (unit_test_parameters.ipp:418) ==8199== by 0x50B7CFF: boost::unit_test::unit_test_monitor_t::execute_and_translate(boost::unit_test::test_case const&) (unit_test_monitor.ipp:65) ==8199== by 0x50A8940: boost::unit_test::framework_impl::visit(boost::unit_test::test_case const&) (framework.ipp:150) ==8199== by 0x50D7762: boost::unit_test::traverse_test_tree(boost::unit_test::test_suite const&, boost::unit_test::test_tree_visitor&) (unit_test_suite.ipp:207) ==8199== by 0x50A5C27: boost::unit_test::framework::run(unsigned long, bool) (framework.ipp:436) ==8199== by 0x50B4D42: boost::unit_test::unit_test_main(bool (*)(), int, char**) (unit_test_main.ipp:185) ==8199== by 0x475CC1: main (unit_test.hpp:59) ==8199== ==8199== 24 bytes in 1 blocks are still reachable in loss record 150 of 999 ==8199== at 0x4C27CC1: operator new(unsigned long) (vg_replace_malloc.c:261) ==8199== by 0x50D221C: boost::runtime::environment::rt_env_detail::new_var_record(boost::unit_test::basic_cstring<char const>) (new_allocator.h:89) ==8199== by 0x50D2A52: boost::runtime::environment::rt_env_detail::variable_data& boost::runtime::environment::rt_env_detail::init_new_var<bool, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char> >(boost::unit_test::basic_cstring<char const>, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char>) (environment.hpp:54) ==8199== by 0x50BDE39: T.6666 (environment.hpp:113) ==8199== by 0x50BE023: boost::unit_test::runtime_config::use_alt_stack() (unit_test_parameters.ipp:427) ==8199== by 0x50B7D07: boost::unit_test::unit_test_monitor_t::execute_and_translate(boost::unit_test::test_case const&) (unit_test_monitor.ipp:66) ==8199== by 0x50A8940: boost::unit_test::framework_impl::visit(boost::unit_test::test_case const&) (framework.ipp:150) ==8199== by 0x50D7762: boost::unit_test::traverse_test_tree(boost::unit_test::test_suite const&, boost::unit_test::test_tree_visitor&) (unit_test_suite.ipp:207) ==8199== by 0x50A5C27: boost::unit_test::framework::run(unsigned long, bool) (framework.ipp:436) ==8199== by 0x50B4D42: boost::unit_test::unit_test_main(bool (*)(), int, char**) (unit_test_main.ipp:185) ==8199== by 0x475CC1: main (unit_test.hpp:59) ==8199== ==8199== 24 bytes in 1 blocks are still reachable in loss record 151 of 999 ==8199== at 0x4C27CC1: operator new(unsigned long) (vg_replace_malloc.c:261) ==8199== by 0x50D221C: boost::runtime::environment::rt_env_detail::new_var_record(boost::unit_test::basic_cstring<char const>) (new_allocator.h:89) ==8199== by 0x50D2A52: boost::runtime::environment::rt_env_detail::variable_data& boost::runtime::environment::rt_env_detail::init_new_var<bool, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char> >(boost::unit_test::basic_cstring<char const>, boost::nfp::named_parameter<char, boost::nfp::nfp_detail::no_params_type_t, char>) (environment.hpp:54) ==8199== by 0x50BDE39: T.6666 (environment.hpp:113) ==8199== by 0x50BE063: boost::unit_test::runtime_config::detect_fp_exceptions() (unit_test_parameters.ipp:435) ==8199== by 0x50B7D0F: boost::unit_test::unit_test_monitor_t::execute_and_translate(boost::unit_test::test_case const&) (unit_test_monitor.ipp:67) ==8199== by 0x50A8940: boost::unit_test::framework_impl::visit(boost::unit_test::test_case const&) (framework.ipp:150) ==8199== by 0x50D7762: boost::unit_test::traverse_test_tree(boost::unit_test::test_suite const&, boost::unit_test::test_tree_visitor&) (unit_test_suite.ipp:207) ==8199== by 0x50A5C27: boost::unit_test::framework::run(unsigned long, bool) (framework.ipp:436) ==8199== by 0x50B4D42: boost::unit_test::unit_test_main(bool (*)(), int, char**) (unit_test_main.ipp:185) ==8199== by 0x475CC1: main (unit_test.hpp:59) ==8199== ==8199== 24 bytes in 1 blocks are still reachable in loss record 152 of 999 ==8199== at 0x4C27CC1: operator new(unsigned long) (vg_replace_malloc.c:261) ==8199== by 0x50B7D4A: boost::unit_test::unit_test_monitor_t::execute_and_translate(boost::unit_test::test_case const&) (shared_count.hpp:87) ==8199== by 0x50A8940: boost::unit_test::framework_impl::visit(boost::unit_test::test_case const&) (framework.ipp:150) ==8199== by 0x50D7762: boost::unit_test::traverse_test_tree(boost::unit_test::test_suite const&, boost::unit_test::test_tree_visitor&) (unit_test_suite.ipp:207) ==8199== by 0x50A5C27: boost::unit_test::framework::run(unsigned long, bool) (framework.ipp:436) ==8199== by 0x50B4D42: boost::unit_test::unit_test_main(bool (*)(), int, char**) (unit_test_main.ipp:185) ==8199== by 0x475CC1: main (unit_test.hpp:59) ==8199== ...

1 0

[Review] Review results for Lockfree
by Hartmut Kaiser 23 Aug '11

23 Aug '11

All, The review for the Lockfree library written by Tim Blechman started July 18th 2011 and ended on July 28th. I counted 8 votes, none of which were NO. All authors votes YES, some made additional requests. Overall, the verdict of the community was clear: Tim Blechmann's Lockfree library is ACCEPTED The discussion was lively and it touched on several points. Design ------ The design of the library is sound, the API is usable. Except for naming issues (discussed below) almost no comments have been made on how to change it. People reviewing the library would like to see a more modular approach to lockfree data structures in general, possibly by exposing building blocks or by utilizing policies. The general interest was to have a more diverse set of data structures available, such as a lock-free linked list or bounded and fixed-sized data structures. Atomics Library --------------- As the initial review announcement stated, Lockfree depends on an external Atomics library, which has to be separately reviewed in order to get into Boost as a first class library. There has been some discussions whether Lockfree could be accepted without Atomics being reviewed. Others suggested Lockfree may be reviewed and added to Boost SVN only after Atomics got reviewed (this was mentioned in the review announcement as well). After all those discussions and based on the wide interest Lockfree data structures have, I'd suggest to add the current Atomics library as an implementation detail to Lockfree. Special handling of compilers which already have implemented std::atomics has to be added to Lockfree, though. In this case Lockfree should use the atomics from the stdandard library. Naming ------ The consensus was that the naming of the reviewed data structures has to be changed. The names should be either fifo and lifo or queue and stack. AFAIK, Tim already addresses this point. Documentation ------------- The consensus of almost everybody referring to the documentation was that it needs more work. Here is a short (but non-exhaustive) list of things being mentioned: - It lacks rationale and information about the implementation - The class synopsis of the data structures should be accessible from the "Reference" page. - Make non-thread-safe parts more explicit (fifo::empty is described as non-thread-safe) - Document exception guarantees - More information needed on internals, the design, and rationale I would like to thank all who participated in the discussions. Regards Hartmut --------------- http://boost-spirit.com

1 0

Custom services using boost::asio
by Allan Nielsen 22 Aug '11

22 Aug '11

Hi I would like to migrate an application from using Glib::Source (glibmm event loop) to use io_service instead. The application is using glib::sources for two job: - Drive lots of network IO connection - Process internal event which are generated in side the application it self. The Io part is easy to fit into asio, but I'm having problems seeing what the best way is to implement the core application event processing. Using glib::source I could register an interface where two function is called: bool prepare (int &timeout); bool dispatch (sigc::slot_base *slot); Prepare could set a time out identifying how much time should elapse before dispatch is ready to process an event. When the time is passed, the glib main loop will call the dispatch function, where I then can process the internal events. How can this be implemented in boost::asio io_service? I have look at the section 7.5 in http://en.highscore.de/cpp/boost/asio.htmlbut he is using a thread and a blocking call. Using a thread is not a solution in my case. I would rather like either polling, or some kind of scheduling... I any body has some hints, examples, advices it would be most appreciated. -- Allan W. Nielsen

2 1

[fusion]Is it possible to wrap a function template into a function object?
by someguy 22 Aug '11

22 Aug '11

If there is a function template: template<typename T> T f(T t); then f is not a type and cannot be passed to fusion::for_each() as the second argument. But I can't write fusion::for_each(someSequence,&f<SomeType>) either since elements of someSequence has different types. While I can write f as a functor fo struct fo{ template<typename T> T operator()(T t); }; and call fusion::for_each(someSequence,fo()), sometimes I need to use function templates in libraries ( say, I have a fusion::vector whose elements are ranges ) and the only solution seems to be writing a lot of functors to wrap the function templates. I tried to find a wrapper class template that can wrap arbitary function templates to functors in boost but I didn't find any. Then I tried to write such a wrapper using constructs like template<template<typename T0> class F>struct temp_fun_1; but the code made my MSVC2008 compiler crash(really!). Is there such a wrapper in boost or any other library, or is it even possible? -- View this message in context: http://boost.2283326.n4.nabble.com/fusion-Is-it-possible-to-wrap-a-function… Sent from the Boost - Users mailing list archive at Nabble.com.

5 7

[Containers Review Result] Boost.Containers is accepted into Boost.
by John Maddock 22 Aug '11

22 Aug '11

This is to announce that the Containers library by Ion Gaztanaga has been accepted into Boost. There were 11 positive reviews and one negative, many making the same points (see summary below). Acceptance is therefore conditional on Ion improving the documentation as the reviewers requested. Review comments summary: ~~~~~~~~~~~~~~~~~~~~~~~~ * Needs a better introduction/overview/tutorial in the docs: # what are stateful allocators, what's currently supported in this area, how is it supported, does it have performance implications. # Needs overview of the new containers - stable_vector, flat_* etc. # Needs description of recursive containers and why this library supports them but not C++03 containers. # Needs to justify why this library and not the std one (probably by mention of the above). * Make clear in the docs (if not already) what the default allocator is. * Make allocator template parameter name consistent. * Add basic_string::shrink_to_fit member function (from C++11). * Typo in range insertion docs (first/last vs i/j) * vector<bool> behavior needs to be documented (and justified either which way). * Need to document conformance to C++0x container requirements, plus use (or not) of new C++0x features such as std::allocator_traits. * Missing documentation for some deque member functions. * Missing Returns/Effects,Complexity or Throws. (ex: after No.23 in basic_string) * The "Acknowledgements" page is currently empty. There are various (c) notices in the source referring to sources from which parts of the code may have come. This page should clarify these sources, including any cases where the original code has now all been replaced, and assert that the licenses are all in order. It should also point out the history of the code in Boost, i.e. that parts were previously in Boost.Interprocess, so that anyone with previous exposure to the Interprocess containers is not confused. * There are some comments that the organisation of the docs makes it unnecessarily hard to jump directly to the info you want. Requests for additional features: ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * Consider implementing std::forward_list from C++0x. * Consider Boost.Range interoperability and/or range insert support. * Make the flat_* containers container adapters - so that a) the user can choose the underlying implementation and b) they can shoot themselves in the foot if they want to by manipulating the underlying container (mostly for efficient loading of data). Alternatively, provide some other interface enhancements to try to meet most of the use cases given. * Efficient construction of ordered containers from already sorted data. * Investigate Clang's Libc++ std lib performance tests. John Maddock Containers review manager. PS: Ion: if you need any help with quickbook/docbook and AutoIndex ping me and I'll see what I can do to help - there are all sorts of parameters that can be used to tweak the appearance etc.

2 1

Problems matching parantheses in a string using boost::regex 1.42.0 on a amd64 debian system
by Simon Hoerder 22 Aug '11

22 Aug '11

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA224 Hi, I'm fairly new to boost libraries but searched the documentation and googled for an answer to my problem but couldn't come up with something. Please bear with me. I am using boost::regex (version 1.42.0 on debian amd64 machine) to parse a vhdl-like file. To this end, I am trying to use the regular expression boost::regex("^SIGNAL ([A-Z0-9_]*?): STD_LOGIC_VECTOR$ ([0-9]*?) DOWNTO ([0-9]*?)$;$"); to match strings like: SIGNAL W07: STD_LOGIC_VECTOR( 255 DOWNTO 0); My problem is that matching those parantheses in the string doesn't work - - I've tested the regexp under perl and it works fine but boost::regexp and C++ works only if I remove the brackets from the string and from the regular expression. Issues I observed & tested: 1) '$' ... '$' no match but g++ complains about an unknown escape sequence '\)'. 1a) Using '$' ... ')' doesn't match. (I would have expected an exception to be thrown but none whatsoever.) 2) '0x28' ... '0x29' doesn't match. (0x28 = ASCII '(', 0x29 = ASCII ')') 3) '\Q(\E' ... '\Q)\E' no match but g++ complains about an unknown escape sequence '\Q'. 4) If I try to match only one of the brackets and remove the other from the string & regex I get one of the following: '\(' ... gives me: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::regex_error> >' what(): Found a closing ) with no corresponding openening parenthesis. The error occured while parsing the regular expression fragment: '?([0-9]*?)>>>HERE>>>);$'. ... '$' gives me: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::regex_error> >' what(): Unmatched marking parenthesis ( or $. The error occured while parsing the regular expression fragment: '[0-9]*?);$>>>HERE>>>'. 5) Even boost::regex("^SIGNAL W07: STD_LOGIC_VECTOR\( 255 DOWNTO 0$;$"); fails to match SIGNAL W07: STD_LOGIC_VECTOR( 255 DOWNTO 0); Points 1a and 4 suggests that boost::regex treats even escaped parantheses as special characters which is quite surprising to me. I am sure a lot of people successfully used boost::regex to match parantheses so I do wonder which part of the documentation I have missed. I'd be happy to provide more debugging information if you tell me how to produce it. Many thanks, Simon Hoerder - -- /*** * Dipl. Ing. Simon Hoerder * Work: | Private: * Department of Computer Science | First Floor Flat * Merchant Venturers Building, 2.01 | 7 Whatley Road * Woodland Road | * Bristol, BS8 1UB | Bristol, BS8 2PS * United Kingdom | United Kingdom * * http://www.cs.bris.ac.uk/Research/CryptographySecurity/ * UK mobile: +44 7564 035925 * DE mobile: +49 179 7906117 * Skype: aloisius_hingerl ***/ -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.10 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iFYEARELAAYFAk5SilEACgkQE8ykjYCSVs7wGQDgmE795i+lC/qNHlwYVQvlxZtm SyiB7JreAuxQogDfUY0VLkfvNOcj9q41/43U5D8WxwljzL71+TkW2g== =wN0G -----END PGP SIGNATURE-----

2 2

[iterator] [iterator_facade] Why is advance not defined for bidirectional iterators?
by Ovanes Markarian 22 Aug '11

22 Aug '11

Hello *! I defined a custom bidi-iterator and assumed it was going to support std::advance(iterator, Difference n), where n can be negative for random access and bidirectional iterators. The definition of my iterator's facade base looks like: struct my_iter : boost::iterator_facade < my_iter , const byte , boost::bidirectional_traversal_tag , const byte > { // some impl stuff follows... }; My tests show that calling: advance(instance_of_my_iter, N) works fine (increment implementation is called) advance(instance_of_my_iter, -N) does not work, because increment (instead of decrement) is called as well While reading through the docs for iterator facade at http://www.boost.org/doc/libs/1_46_0/libs/iterator/doc/iterator_facade.html I found the section iterator_facade Core Operations. For the advance implementation is stated there that it is only gets called for Random Access Iterators. C++ Standard clearly defines that N-Parameter to std::advance can be negative to random access and bidi iterators. Implementing void advance member in my_iter still results in the call to increment member. Can someone give me any suggestions or is it a bug in the iterator lib? My compiler is gcc 4.3 under Debian Linux with Kernal 2.6.26. and Boost 1.42. With Kind Regards, Ovanes

2 5

[Bind] Unresolved overloaded function type
by Robert Jones 22 Aug '11

22 Aug '11

Hi All Can anyone tell me how to fix this? It's fine with one Fedora/Boost version combination, but not with another! #include <algorithm> #include <boost/bind.hpp> enum X { }; int main( ) { boost::bind<const X &>( std::max<X>, _1, _2 ); } > g++ -c a.cpp a.cpp: In function 'int main()': a.cpp:8: error: no matching function for call to 'bind(<unresolved overloaded function type>, boost::arg<1>&, boost::arg<2>&)' Thx - Rob.

2 2

[NEWBIE] [BGL] Compile error while using greedy graph coloring example v1.47.0
by Ragavendran Gopalakrishnan 22 Aug '11

22 Aug '11

Hello all, I'm a newbie to using Boost Graph Libraries for my project. I was reading the documentation, and tried implementing the greedy graph coloring algorithm that is presented in the following webpage: http://www.boost.org/doc/libs/1_47_0/libs/graph/doc/constructing_algorithms… I get compile errors involving the following lines of code: function_requires< IntegerConcept<ColorType> >(); function_requires< size_type, ReadablePropertyMapConcept<Order> >(); typedef typename same_type<OrderType, vertex_descriptor>::type req_same; I understand that the first two function_requires calls are concept checks, and I don't know what the use of the third line is, as req_same is never used. Anyway, if I comment these three lines, my program compiles fine, and works perfectly. I am unable to understand the errors and correct them. Here is my source code (coloring.cc) - the only change I made from the example algorithm is to pass color by reference, so that I can directly access the resulting coloring. 001. #include <iostream> 002. #include <map> 003. #include <limits> 004. #include <boost/concept_check.hpp> 005. #include <boost/graph/graph_traits.hpp> 006. #include <boost/graph/graph_concepts.hpp> 007. #include <boost/graph/adjacency_matrix.hpp> 008. #include <boost/property_map/property_map.hpp> 009. 010. using namespace boost; 011. 012. // Example coloring function provided in BGL online documentation at 013. // http://www.boost.org/doc/libs/1_47_0/libs/graph/doc/constructing_algorithms… 014. template <class VertexListGraph, class Order, class Color> 015. typename graph_traits<VertexListGraph>::vertices_size_type 016. sequential_vertex_color_ting (const VertexListGraph& G, 017. Order order, const Color& color) { 018. typedef graph_traits<VertexListGraph> GraphTraits; 019. typedef typename GraphTraits::vertex_descriptor vertex_descriptor; 020. typedef typename GraphTraits::vertices_size_type size_type; 021. typedef typename property_traits<Color>::value_type ColorType; 022. typedef typename property_traits<Order>::value_type OrderType; 023. 024. function_requires< VertexListGraphConcept<VertexListGraph> >(); 025. function_requires< ReadWritePropertyMapConcept<Color, vertex_descriptor> >(); 026. function_requires< IntegerConcept<ColorType> >(); 027. function_requires< size_type, ReadablePropertyMapConcept<Order> >(); 028. typedef typename same_type<OrderType, vertex_descriptor>::type req_same; 029. 030. size_type max_color = 0; 031. const size_type V = num_vertices(G); 032. std::vector<size_type> mark(V, std::numeric_limits<size_type>::max()); 033. 034. typename GraphTraits::vertex_iterator v, vend; 035. for (tie(v, vend) = vertices(G); v != vend ; v++) { 036. (*color)[*v] = V-1; // which means "not colored" 037. } 038. 039. for (size_type i = 0 ; i < V ; i++) { 040. vertex_descriptor current = order[i]; 041. 042. // mark all the colors of the adjacent vertices 043. typename GraphTraits::adjacency_iterator ai, aend; 044. for (tie(ai, aend) = adjacent_vertices(current, G) ; ai != aend ; ++ai) { 045. mark[(*color)[*ai]] = i; 046. } 047. 048. // find the smallest color unused by the adjacent vertices 049. size_type smallest_color = 0; 050. while (smallest_color < max_color && mark[smallest_color] == i) { 051. ++smallest_color; 052. } 053. 054. // if all the colors are used up, increase the number of colors 055. if (smallest_color == max_color) { 056. ++max_color; 057. } 058. 059. (*color)[current] = smallest_color; 060. } 061. return max_color; 062. } 063. 064. int main(int, char*[]) { 065. // Create adjacency matrix for a star graph on 5 vertices 066. int numberOfVertices = 5; 067. int adjacencyMatrix[numberOfVertices][numberOfVertices]; 068. for (int i = 0 ; i < numberOfVertices ; i++) { 069. for (int j = 0 ; j < numberOfVertices ; j++) { 070. if ((i == 0)||(j == 0)&&(i != j)) { 071. adjacencyMatrix[i][j] = 1; 072. } else { 073. adjacencyMatrix[i][j] = 0; 074. } 075. } 076. } 077. 078. // Construct boost graph 079. typedef adjacency_matrix<undirectedS> UGraph; 080. typedef graph_traits<UGraph> GraphTraits; 081. typedef GraphTraits::vertex_descriptor vertex_descriptor; 082. typedef GraphTraits::vertex_iterator vertex_iterator; 083. UGraph ug(numberOfVertices); 084. for (int i = 0 ; i < numberOfVertices ; i++) { 085. for (int j = i+1 ; j < numberOfVertices ; j++) { 086. if (adjacencyMatrix[i][j] == 1) { 087. add_edge(i,j,ug); 088. } 089. } 090. } 091. 092. // Create order as an externally stored property 093. vertex_descriptor order[numberOfVertices]; 094. std::pair<vertex_iterator, vertex_iterator> p = vertices(ug); 095. for (int i = 0 ; i < numberOfVertices ; i++) { 096. order[i] = *(p.first + i); 097. } 098. 099. // Create color as an externally stored property 100. std::map<vertex_descriptor, int> color; 101. for (int i = 0 ; i < numberOfVertices ; i++) { 102. color.insert(std::make_pair(vertex_descriptor(*(p.first+i)),int(0))); 103. } 104. 105. // Get the coloring 106. sequential_vertex_color_ting(ug,order,&color); 107. 108. // Display the coloring 109. for (int i = 0 ; i < numberOfVertices ; i++) { 110. std::cout << "Color of vertex " << i << " is " << color[*(p.first+i)] << std::endl; 111. } 112. 113. return 0; 114. } The command I used to compile is (g++ version 4.4.3): $ g++ -I ../../Desktop/boost_1_47_0/ coloring.cc The compiler output is: coloring.cc: In function ‘typename boost::graph_traits<G>::vertices_size_type sequential_vertex_color_ting(const VertexListGraph&, Order, const Color&)’: coloring.cc:27: error: wrong number of template arguments (1, should be 2) ../../Desktop/boost_1_47_0/boost/property_map/property_map.hpp:191: error: provided for ‘template<class PMap, class Key> struct boost::ReadablePropertyMapConcept’ coloring.cc:28: error: expected nested-name-specifier before ‘same_type’ coloring.cc:28: error: expected initializer before ‘<’ token In file included from coloring.cc:4: ../../Desktop/boost_1_47_0/boost/concept_check.hpp: In destructor ‘boost::Integer<T>::~Integer() [with T = std::map<long unsigned int, int, std::less<long unsigned int>, std::allocator<std::pair<const long unsigned int, int> > >]’: ../../Desktop/boost_1_47_0/boost/concept_check.hpp:65: instantiated from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::IntegerConcept<std::map<long unsigned int, int, std::less<long unsigned int>, std::allocator<std::pair<const long unsigned int, int> > > >]’ ../../Desktop/boost_1_47_0/boost/concept_check.hpp:45: instantiated from ‘void boost::function_requires(Model*) [with Model = boost::IntegerConcept<std::map<long unsigned int, int, std::less<long unsigned int>, std::allocator<std::pair<const long unsigned int, int> > > >]’ coloring.cc:26: instantiated from ‘typename boost::graph_traits<G>::vertices_size_type sequential_vertex_color_ting(const VertexListGraph&, Order, const Color&) [with VertexListGraph = main(int, char**)::UGraph, Order = main::vertex_descriptor*, Color = std::map<long unsigned int, int, std::less<long unsigned int>, std::allocator<std::pair<const long unsigned int, int> > >*]’ coloring.cc:106: instantiated from here ../../Desktop/boost_1_47_0/boost/concept_check.hpp:69: error: ‘class std::map<long unsigned int, int, std::less<long unsigned int>, std::allocator<std::pair<const long unsigned int, int> > >’ has no member named ‘error_type_must_be_an_integer_type’ When I comment lines 26-28, the program compiles successfully and executing a.out gives the following output, as expected: Color of vertex 0 is 0 Color of vertex 1 is 1 Color of vertex 2 is 1 Color of vertex 3 is 1 Color of vertex 4 is 1 Please advise me on what the compiler errors mean. I did try digging into some of the header files, but I couldn't find out what the mistake is. Regards, Raga.

2 1

[Boost.Build] Problem with the Boost library support module
by Marcel 21 Aug '11

21 Aug '11

Hi, I have compiled Boost.Buildv2 from the Boost V1.47 sources and have successfully compiled the Boost libraries with it. Now I want to use BBv2 in my own project, which uses the Boost libraries. So I tried using the Boost library support module: I added to my user-config.jam: using boost : 1.47 : <include>C:/boost_1_47_0/boost <library>C:/boost_1_47_0/stage/lib ; and to my project's jamroot file: import boost ; boost.use-project 1.47 ; I installed BBv2 to C:/boost_1_47_0/bjam and added this to the PATH. Calling bjam gives me the following error message, because it can't find the support module (I assume): boost.jam: No such file or directory C:/boost_1_47_0/bjam/share/boost-build/build\toolset.jam:38: in toolset.using rule boost.init unknown in module toolset. C:/boost_1_47_0/bjam/share/boost-build/build\project.jam:888: in using C:\Users\zaphod\user-config.jam:3: in modules.load C:/boost_1_47_0/tools/build/v2\build-system.jam:257: in load-config C:/boost_1_47_0/tools/build/v2\build-system.jam:399: in load-configuration-files C:/boost_1_47_0/tools/build/v2\build-system.jam:555: in load C:\boost_1_47_0\bjam\share\boost-build\kernel\modules.jam:283: in import C:\boost_1_47_0\bjam\share\boost-build\kernel\bootstrap.jam:142: in boost-build C:\boost_1_47_0\bjam\share\boost-build\boost-build.jam:8: in module scope I located boost.jam in the source tree of bbv2 of the boost libraries in the directory contrib. This is on Windows 7 x64 with mingw(32) as compiler. What is wrong here? Can I help bjam finding the boost.jam file? Many thanks in advance, Marcel

1 0