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

[lexical_cast] Some code that was compiling in 1.50 stopped compiling in 1.53
by Alain Leblanc 17 Mar '13

17 Mar '13

Here's some code that has been compiling till at least 1.50, and starting long before. I isolated the part that breaks to create a program. Here it is: Just taking a std::vector of int and copying into strings. #include <boost/lexical_cast.hpp> #include <vector> #include <string> using namespace std; int main (int, char **) { vector<int> values; vector<string> ret; std::transform(values.begin(), values.end(), ret.begin(), boost::lexical_cast<std::string, int>); } And compiling on fedora 18, gcc 4.7 (Got same issues, I believe, with MSVC 10) I get the output at the bottom. Anyone has an idea on what the problem could be? Thanks, a [aleblanc@localhost base]$ gcc -c TestLexicalCast.cc [aleblanc@localhost base]$ gcc -c -I/home/aleblanc/local/boost_1_53/include/ TestLexicalCast.cc TestLexicalCast.cc: In function ‘int main(int, char**)’: TestLexicalCast.cc:10:98: error: no matching function for call to ‘transform(std::vector<int>::iterator, std::vector<int>::iterator, std::vector<std::basic_string<char> >::iterator, <unresolved overloaded function type>)’ TestLexicalCast.cc:10:98: note: candidates are: In file included from /usr/lib/gcc/x86_64-redhat-linux/4.7.2/../../../../include/c++/4.7.2/algorithm:63:0, from /home/aleblanc/local/boost_1_53/include/boost/utility/swap.hpp:24, from /home/aleblanc/local/boost_1_53/include/boost/swap.hpp:10, from /home/aleblanc/local/boost_1_53/include/boost/array.hpp:45, from /home/aleblanc/local/boost_1_53/include/boost/lexical_cast.hpp:158, from TestLexicalCast.cc:1: /usr/lib/gcc/x86_64-redhat-linux/4.7.2/../../../../include/c++/4.7.2/bits/stl_algo.h:4940:5: note: template<class _IIter, class _OIter, class _UnaryOperation> _OIter std::transform(_IIter, _IIter, _OIter, _UnaryOperation) /usr/lib/gcc/x86_64-redhat-linux/4.7.2/../../../../include/c++/4.7.2/bits/stl_algo.h:4940:5: note: template argument deduction/substitution failed: TestLexicalCast.cc:10:98: note: could not resolve address from overloaded function ‘lexical_cast<std::string, int>’ In file included from /usr/lib/gcc/x86_64-redhat-linux/4.7.2/../../../../include/c++/4.7.2/algorithm:63:0, from /home/aleblanc/local/boost_1_53/include/boost/utility/swap.hpp:24, from /home/aleblanc/local/boost_1_53/include/boost/swap.hpp:10, from /home/aleblanc/local/boost_1_53/include/boost/array.hpp:45, from /home/aleblanc/local/boost_1_53/include/boost/lexical_cast.hpp:158, from TestLexicalCast.cc:1: /usr/lib/gcc/x86_64-redhat-linux/4.7.2/../../../../include/c++/4.7.2/bits/stl_algo.h:4977:5: note: template<class _IIter1, class _IIter2, class _OIter, class _BinaryOperation> _OIter std::transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation) /usr/lib/gcc/x86_64-redhat-linux/4.7.2/../../../../include/c++/4.7.2/bits/stl_algo.h:4977:5: note: template argument deduction/substitution failed: TestLexicalCast.cc:10:98: note: could not resolve address from overloaded function ‘lexical_cast<std::string, int>’ [aleblanc@localhost base]$

2 3

[interprocess] message_queue has non const get_num_msg(). Why?
by Gábor Márton 16 Mar '13

16 Mar '13

In 1.53, get_num_msg() is non const. Does it really modify the object? Thanks, Gabor

2 2

[fusion] Defining pixel formats
by Christian Henning 16 Mar '13

16 Mar '13

Hi all, ever since Jang Tongary suggested to use boost::fusion to define pixel types I wondered what he meant by that. I never had the opportunity to get myself familiar with fusion so I started learning it and I'm really amazed how easy the library is to use. I think I'm at a point where I would like to reach to the community for some advice. Let's say I wanna create a homogeneous three channel pixel type, like RGB. For that I would use a fusion map since I want to access channel by name. I also would like to be able to swap channels around to create BGR. How would I do that? namespace boost { namespace gil_3 { struct red_t; struct green_t; struct blue_t; } } // namespace boost::gil_3 void foo() { typedef fusion::map< fusion::pair< gil_3::red_t , boost::uint8_t > , fusion::pair< gil_3::green_t, boost::uint8_t > , fusion::pair< gil_3::blue_t , boost::uint8_t > > rgb8_pixel_t; // not working typedef fusion::reverse_view< rgb8_pixel_t >::type bgr8_pixel_t; rgb8_pixel_t a( 10, 20, 30 ); bgr8_pixel_t b( 30, 20, 10 ); boost::uint8_t red_a = fusion::at_key< gil_3::red_t >( a ); boost::uint8_t red_b = fusion::at_key< gil_3::red_t >( b ); } Thanks! Christian

2 3

[MPL] How to use a mpl::map
by Daniele Barzotti 15 Mar '13

15 Mar '13

Hi, I'm new to MPL and I have difficulties to use the map container. I need to map (and then retrieve) some types based on they ID: I try the following code but it does not work.. sturct MSG_METHOD_CONNECT { .... } template<class MESSAGE> class PBMessage { public: PBMessage() {}; /* ... other methods ... */ private: MESSAGE m_Msg; }; // Map of types. The key is the Message opCode typedef typename mpl::map< mpl::pair<mpl::int_[100], PBMessage<MSG_METHOD_CONNECT> >, mpl::pair<mpl::int_[101], PBMessage<MSG_EVENT_CONNECT> >, > TMessageMap; // The Message type template < typename MessageMap, int opCode > typedef typename mpl::at<MessageMap, mpl::int_<opCode> >::type::value TMessage; And to retrieve the type: TMessage<TMessageMap, opCode> msg; Could someone give me some suggestions? Regards, Daniele.

2 2

[serialization, archive] Serialize boost::shared_ptr to custom archive
by Silviu P 15 Mar '13

15 Mar '13

Hi, I'm trying to serialize a boost::shared_ptr to a custom archive. The compiler complains about the archive missing methods 'append' and 'reset'. Does anyone know where I should look to find out more information about these two methods? I wasn't able to find any documentation when looking at the Archive Concept about these two methods, and text_iarchive, together with its base classes, don't seem to declare it. On the other hand, boost::archive::text_iarchive compiles fine. Here are the compile errors I see: /usr/include/boost/serialization/shared_ptr.hpp:133:9: error: ‘class my_iarchive’ has no member named ‘append’ /usr/include/boost/serialization/shared_ptr.hpp:139:5: error: ‘class my_iarchive’ has no member named ‘reset’ My boost version is 1.46 (which comes with openSuse 12.1) Thank you in advance.

4 5

[graph][PBGL] Remove edge broken reference
by Borja Miñano 15 Mar '13

15 Mar '13

Hello, I had a problem after removing some edges from my graph. I am using the graph_parallel library. And this problem did not happened me when using the serial one. I use a predicate to remove edges, and it seems to work, it deletes the local edges and the crossing edges (source local -> target ghost). But if after that I want to iterate over the in_edges The iterator returns references to edges that does not exists any more. For example, if I had 30 in_edges and the removing process eliminate 20, then the in_edge iterator iterates over 10, but with wrong references. Could anyone help debugging this problem? I think it might be an own problem, but I don't know how to check it. -- Un saludo, Borja Miñano IAC3 - Universitat de les Illes Balears ParcBit - Edifici 17 (Disset); Local D7 Cra. Valldemossa km. 7,4 E-07121 Palma de Mallorca. Balears. Spain. Phone: +34 871 967 434

1 0

Review Wizard Status Report for March 2013
by Ronald Garcia 14 Mar '13

14 Mar '13

============================================== Review Wizard Status Report for March 2013 ============================================== News ==== 1. Boost 1.52.0 Released. No New Libraries. 2. Boost 1.53.0 Released. New Libraries: Atomic, Coroutine, Lockfree, Multiprecision, Odeint. 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. 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: * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Type Erasure - accepted August 2012; author: Steven Watanabe 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) * Range Extensions * Nowide (M) * Array (M) * TypeIndex (M) * STL Extensions (M) * Countertree (M) * Process (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). 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. Countertree ----------- :Author: Francisco Jose Tapia :Review Manager: Needed :Download: https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip :Description: This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. COUNTERTREE This kind of trees have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. With unordered information we have a vector with the same speed inserting and deleting in any position (O(log N)). With ordered information, we have the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract them. SUBALLOCATOR The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator replace to the allocator in the allocation of equal size elements. It provides speed, return the unused memory and decrease the memory used by the program and improve the cache performance due to the data locality improvement ( 30% of improvement of speed respect the std::allocator with GCC 4.7) Process ------- :Author: Boris Schaeling :Download: http://www.highscore.de/boost/process0.5/process.zip :Description: Boost.Process is a library to manage system processes. It can be used to: * create child processes * setup streams for child processes * communicate with child processes through streams (synchronously or asynchronously) * wait for processes to exit (synchronously or asynchronously) * terminate processes Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

Problems linking on Mac OSX 10.8
by Tim Burgess 14 Mar '13

14 Mar '13

Hi, I have a project within XCode 4.6 on Mac OSX 10.8 that won't link against the static serialisation library (the project also uses some other Boost binaries, which link fine). My Boost build options are: macosx-version=10.3 maxosx-vesion-min=10.6 architecture=combined threading=multi link=static address-model=32_64 The project uses the XCode GCC compiler option, as it also uses the wxWidgets libraries, which won't work with the default compiler. The errors take the form: Undefined symbols for architecture x86_64: "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_sta rt(char const*)", referenced from: void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_over ride<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o Can anybody offer any advice, please? I've read a lot of articles on StackOverflow that seem to discuss this problem, but none have pointed to a solution. Best wishes. Tim Burgess Raised Bar Ltd. Tel: +44 (0)1827 719822 Web: http://www.raisedbar.net We can supply Roland and Avid products with specialist pre and post-sales support for visually-impaired users - just drop us a line for a quote. Don't forget to sign our on-line petition to lobby for improved access to music education and music technology at: http://www.raisedbar.net/petition.htm

1 0

[posix_time] time_from_string Not Thread-Safe?
by Hering Cheng 14 Mar '13

14 Mar '13

Hi, If I invoke boost::posix_time::time_from_string() from multiple threads I get a core dump: #0 0x00000000006ded78 in std::_Rb_tree<std::string, std::pair<std::string const, unsigned short>, std::_Select1st<std::pair<std::string const, unsigned short> >, std::less<std::string>, std::allocator<std::pair<std::string const, unsigned short> > >::_M_insert_unique(std::pair<std::string const, unsigned short> const&) [clone .constprop.93] () (gdb) where #0 0x00000000006ded78 in std::_Rb_tree<std::string, std::pair<std::string const, unsigned short>, std::_Select1st<std::pair<std::string const, unsigned short> >, std::less<std::string>, std::allocator<std::pair<std::string const, unsigned short> > >::_M_insert_unique(std::pair<std::string const, unsigned short> const&) [clone .constprop.93] () #1 0x00000000006df400 in boost::gregorian::greg_month::get_month_map_ptr() () #2 0x00007f0dfbc590cd in boost::date_time::month_str_to_ushort<boost::gregorian::greg_month> (s=...) at /home/chenher/projects/cactus_strategies/cactus_includes/boost/date_time/date_parsing.hpp:67 #3 0x00007f0dfbc29115 in boost::date_time::parse_date<boost::gregorian::date> (s=..., order_spec=0) at /home/chenher/projects/cactus_strategies/cactus_includes/boost/date_time/date_parsing.hpp:143 #4 0x00007f0dfbc7b96f in parse_delimited_time<boost::posix_time::ptime> (s=..., sep=<optimized out>) at /home/chenher/projects/cactus_strategies/cactus_includes/boost/date_time/time_parsing.hpp:175 #5 time_from_string (s=...) at /home/chenher/boost/date_time/posix_time/time_parsers.hpp:31 Looking at *libs/date_time/src/gregorian/greg_month.cpp*:37, it is apparent that the use of a static variable renders the *month_map *not thread-safe: greg_month::month_map_ptr_type greg_month::get_month_map_ptr() { static month_map_ptr_type month_map_ptr(new greg_month::month_map_type()); if(month_map_ptr->empty()) { std::string s(""); for(unsigned short i = 1; i <= 12; ++i) { greg_month m(static_cast<month_enum>(i)); s = m.as_long_string(); s = date_time::convert_to_lower(s); month_map_ptr->insert(std::make_pair(s, i)); s = m.as_short_string(); s = date_time::convert_to_lower(s); month_map_ptr->insert(std::make_pair(s, i)); } } return month_map_ptr; } Is there any way around this? Is there a general initialization routine I can call to get all such use of static initialized by a single thread? Thanks. Hering Cheng

1 0

[graph][BGL] Why can not I use edge_index_t?
by bminano 14 Mar '13

14 Mar '13

Hello, I want to create an iterator_property_map to iterate over the edges, but I cannot declare the following: typedef property_map<Graph, edge_index_t>::const_type EdgeIndexMap; The compilation gives me an error. I am using an adjacency list with vertex and edge properties. I can use a vertex_index_t, so I assumed that I could use the equivalent for edges. But I don't understand why I can't. This is my adjacency list: typedef boost::adjacency_list<vecS, distributedS<mpi_process_group, vecS>, bidirectionalS, property<vertex_index_t, int>, EdgeProperties> Graph; Have anyone deal with something similar? Thank you -- View this message in context: http://boost.2283326.n4.nabble.com/graph-BGL-Why-can-not-I-use-edge-index-t… Sent from the Boost - Users mailing list archive at Nabble.com.

4 6