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

meta state machine, process_event need to copy given event
by SBAM 13 Feb '15

13 Feb '15

Hello Christophe, I'm a boost msm first time user and I'm attempting to pass an event to my msm that cannot be copied. This event contains a /unique_ptr/ and my goal is to eventually steal it and store it under my msm. However, even with no deferred events, events are /copied/ to an internal queue, in /boost::msm::back::state_machine::do_pre_msg_queue_helper/. I just wanted to know if there was any chance /process_event/ could be overloaded and accept rvalue-ref or if by design, it's absolutely mandatory to copy those events. Many thanks for your great library -- View this message in context: http://boost.2283326.n4.nabble.com/meta-state-machine-process-event-need-to… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Performance optimization in Boost using std::vector<>
by saloo 12 Feb '15

12 Feb '15

Hello everybody, I have a question related to performance optimization using Boost. I found this link http://www.boost.org/doc/libs/1_41_0/doc/html/mpi/performance.html <http://www.boost.org/doc/libs/1_41_0/doc/html/mpi/performance.html> and trying to figure out which curve (on the graph in the link) represents the communication of std::vector<int> and std::vector<double>? Is communication using std::vector<int> and std::vector<double> optimized (is_mpi_datatype) or not? So I use "boost_mpi" and "boost_serialization" libraries. I include the header "#include <boost/serialization/vector.hpp>" in my code. Then I send directly std::vector<int> and std::vector<double> using "world.send(...) " and world.recv(...)" calls. I fill the vector with some values (for example I fill ten values) and I get the same ten values on other side of processor boundary. This thing works but I want to improve communication performance. I found out in this link http://www.boost.org/doc/libs/1_57_0/doc/html/mpi/tutorial.html under section "User-defined data types" that "Fixed data types can be optimized for transmission using the is_mpi_datatype type trait. ". Also I studied the information on http://www.boost.org/doc/libs/1_57_0/doc/html/mpi/tutorial.html#mpi.perform…. Also this link http://www.boost.org/doc/libs/1_46_1/libs/serialization/doc/wrappers.html#a… shows that std::vector<> are optimized for serialization. I am now confused that sending std::vector<> like this is good for performance optimization or not? What other better methods are available? Is something like this http://www.boost.org/doc/libs/1_57_0/doc/html/mpi/tutorial.html#mpi.skeleto… a good option? Best Regards, Salman Arshad -- View this message in context: http://boost.2283326.n4.nabble.com/Performance-optimization-in-Boost-using-… Sent from the Boost - Users mailing list archive at Nabble.com.

4 5

Min cut between two vertices, undirected graph
by Mads Jensen 12 Feb '15

12 Feb '15

Hi, The Stoer Wagner implementation only takes as input a complete graph, and then it computes the min cut with the parity map indicating which cut set the vertex belongs to. I need something for computing the minimum cut between two arbitrary vertices given as input for an undirected graph. Edmonds Karps works just for a directed graph. Any help with this will be highly appreciated. -- Med Venlig Hilsen / Kind regards, Mads Jensen Max Jerry Horovitz: "Unfortunately, in America, babies are not found in cola cans. I asked my mother when I was four and she said they came from eggs laid by rabbis. If you aren't Jewish, they're laid by Catholic nuns. If you're an atheist, they're laid by dirty, lonely prostitutes." -- Mary and Max (2009)

1 0

Which URL should I use in ExternalProject_Add
by Yi-Hong Lyu 11 Feb '15

11 Feb '15

Hello all, I used CMake's ExternalProject_Add to download and build boost in my project. The URL I used is ' http://sourceforge.net/projects/boost/files/boost/1.55.0/boost_1_55_0.zip/d…' and it works. However I got an error several days ago like: CMake Error: Problem with archive_read_open_file(): Unrecognized archive format It seems that what I download by CMake becomes 'HTML document, ASCII text' rather than 'Zip archive data, at least v2.0 to extract'. Could you tell me which URL should I use in ExternalProject_Add? Thanks, Yi-Hong

2 1

boost iOS8 failure
by David Medine 11 Feb '15

11 Feb '15

First of all, I know that calls for help are not appropriate to the list, so let me disclaim by saying that I am not asking for help, simply reporting an issue. I am attempting to compile a C++ library (that uses boost) for iOS8 distribution. The library compiles fine on OSX (and Linux and Windows) but will not compile for iOS8. I get dozens of compiler complaints regarding boost headers that all involve some sort of 'Semantic Issue'. For example, in boost's hash.hpp, I get a 'No matching function for call to 'has_value' error on these lines (439-442): | BOOST_HASH_SPECIALIZE_REF(std::string) #if !defined(BOOST_NO_STD_WSTRING) BOOST_HASH_SPECIALIZE_REF(std::wstring) #endif | In this case I was able to skirt the issue by adding code to define the function hash_value for std::string and std::wstring: inline std::size_t hash_value( std::string const &v) { return hash_range(v.begin(), v.end()); } inline std::size_t hash_value( std::wstring const &v) { return hash_range(v.begin(), v.end()); } I am probably going to go through all such failures of clang to interpret the boost code correctly for iOS compilation and modify the source just so I can get this going. This is a major pain because there are dozens of these, many of which are far less straightforward to remedy. Besides I don't necessarily want a custom version of boost that ships with my library. I have the build settings in my iOS project (I'm using XCode) exactly the same as they are in the OSX project. I don't understand why the compiler behaves differently for these two targets. Finally, there are two stackoverflow questions that I posted related to this problem. http://stackoverflow.com/questions/28422862/clang-different-when-compiling-… http://stackoverflow.com/questions/28308466/ios8-boost-hash-hpp-system-cloc… THX!

2 2

[gsoc15] Google Summer of Code 2015 ideas needed before 20th Feb
by Niall Douglas 10 Feb '15

10 Feb '15

Dear Boost community, The Google Summer of Code 2015 organisation application period has begun. We need project ideas for our ideas page at https://svn.boost.org/trac/boost/wiki/SoC2015, plus anyone willing to mentor. Last year we got eight slots, the previous year seven slots. Let's try to get back to ten slots for 2015! Niall & Boris --- Boost C++ Libraries Google Summer of Code 2015 admin https://svn.boost.org/trac/boost/wiki/SoC2015

2 4

Problems/crash update a Spirit grammar from Boost 1.47 to 1.57
by Christoph Duelli 10 Feb '15

10 Feb '15

Updating Boost from 1.47 to 1.57 the code no longer compiles. It boils down to Both these includes are included (at various places) and these 2 lines compiled in 1.47 but no longer under 1.57. #include <boost/spirit/home/qi.hpp> #include <boost/spirit/home/phoenix.hpp> Changing #include <boost/spirit/home/phoenix.hpp> to #include <boost/phoenix.hpp> the code does compile, but causes crashes while parsing. (I was not able yet to narrow that down.) Is the correct way of porting a 1.47 boost spirit grammar to 1.57, to replace the old phoenix V2 header to #include <boost/phoenix.hpp> ? (Are there known issues? Or is there a "porting howto"?) Or is it still possible to use Spirit with Phoenix V2? Best regards -- Christoph Duelli --------------------------------------------------------------------------------- MELOS-Medizinische Labor-Organisations-Systeme GmbH Franz-Beer-Straße 6 86459 Gessertshausen Tel.: +49 8238/9611-0 Fax: +49 8238/9611-99 mailto: info(a)melosgmbh.de URL: www.melosgmbh.de Amtsgericht Augsburg, HRB 13226 USt-IdNr. DE 130 958 139 Geschäftsführer: Herbert Mayer, Andreas Manntz, Helmut Welsch -------------------------------------------- This e-mail (including any attachments) is confidential and may be privileged. If you have received it by mistake, please notify the sender by e-mail and delete it from your system. Any unauthorised use or dissemination of this e-mail or its contents in whole or in part is strictly prohibited. Please note that e-mails are susceptible to change. MELOS GmbH shall not be liable for the improper or incomplete transmission of the information contained in this communication nor for any delay in its receipt. MELOS GmbH does not guarantee that the integrity of this communication has been maintained nor that this communication is free of viruses, interceptions or interference.

1 1

[gsoc15] Attn: We need 2015 mentors and project ideas for Boost!
by Niall Douglas 10 Feb '15

10 Feb '15

Dear Boost community, We are now within one month of the beginning of Google Summer of Code 2015! Last year's GSoC furthered the continuing success of the Boost GSoC programme with the first ever Boost funded extension to a GSoC project (that being Boost.Hana by Louis Dionne mentored by Joel Falcou, congrats to both of them on passing an exceptionally tough selection process), and over $50,000 of Google funding brought to Boost in 2014. We also sent three representatives to last year's mentor summit, including one student whose entire expenses the Boost Steering Committee very generously covered. As part of filling in our application for 2015, we must supply to Google a list of potential GSoC mentors and potential GSoC projects for summer 2015. There are a number of changes to how we design project ideas for students this year intended to improve the GSoC experience for both students and mentors, so please examine the ideas page which outlines those changes at https://svn.boost.org/trac/boost/wiki/SoC2015 and if you have any questions or concerns about those changes, please ask now rather than just before the GSoC deadline. If you think yourself able to mentor a student doing some work on Boost this summer, *please* consider adding a description of the proposed work item and your name to the list. Last year we acquired eight slots from Google and had to disappoint two mentors and students, we hope with the improved selection process we can get back to the ten annual slots we once had. If you want to know more about mentoring a Google Summer of Code funded student work before you nominate yourself, please feel free to ask on the main Boost developers mailing list boost(a)lists.boost.org. Thank you in advance for your time. Niall Douglas (Boost Google Summer of Code admin) Boris Schäling (Boost Google Summer of Code admin) --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

4 7

[iostreams] How to utilize zlib setDictionary method
by Ringel, Rick 10 Feb '15

10 Feb '15

I have a use-case that requires highly efficient bandwidth utilization over a narrow WAN connection, where communication is message-oriented. I have successfully used boost to gzip, zlib, and bzip2 my messages, and ran some numbers (bzip2 is best so far). However, in researching and profiling zlib's native API, I found I could improve efficiently by an additional 15% over bzip2 by using zlib's SetDictionary methods for deflate and inflate. How would I go about extending boost:iostream's zlib_compressor and zlib_decompressor classes to utilized a predefined/static dictionary? Or, is it best just to use zlib's API directly, and bypass boost for this specialized zlib compression case? -Rick

1 0

Re: [Boost-users] Boost-users Digest, Vol 4049, Issue 1
by David Frank 09 Feb '15

09 Feb '15

Thanks Howard ! On Monday, February 9, 2015 12:00 PM, "boost-users-request(a)lists.boost.org" <boost-users-request(a)lists.boost.org> wrote: Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Re: Signals2 benchmark (Klaim - Jo?l Lamotte) 2. Re: Signals2 benchmark (Michael Powell) 3. write starvation of upgradable lock (David Frank) 4. Re: write starvation of upgradable lock (Howard Hinnant) 5. Re: Signals2 benchmark (Nevin Liber) 6. Re: [Serialization] XML: float format is scientific instead of human-readable since Boost 1.57 (Frank St?hr) 7. Re: Signals2 benchmark (Dominique Devienne) ---------------------------------------------------------------------- Message: 1 Date: Sun, 8 Feb 2015 18:49:06 +0100 From: Klaim - Jo?l Lamotte <mjklaim(a)gmail.com> To: Boost users list <boost-users(a)lists.boost.org> Subject: Re: [Boost-users] Signals2 benchmark Message-ID: <CAOU91ON-+ywWjniue3n56sYSy2ZALtYykDN9ehLp4Qcm6BYoxg(a)mail.gmail.com> Content-Type: text/plain; charset="utf-8" On Sun, Feb 8, 2015 at 4:42 PM, Michael Powell <mwpowellhtx(a)gmail.com> wrote: > On Sun, Feb 8, 2015 at 8:02 AM, Klaim - Jo?l Lamotte <mjklaim(a)gmail.com> > wrote: > > > > > > An executor takes arbitrary tasks as input and only > > guarantee that these tasks will be executed, under some constraints > > defined by the specific executor type. > > A signal dispatch it's call and parametters to a set of observers. > > Using the Boost.Signals2 for example, it is easy AFAIK to type-define > a signal, and re-use that type anywhere that signal is required. So a > listener could receive a signal, and subsequently do whatever it > wanted to with that message; dispatch it again, process it, > whatever... > > Yes but the executor would specify how the observers are notified, not how the observer's work is executed (which depends on the observer implementation indeed). There is an important nuance here.

1 0

boost variant + boost serialization unused type
by Merrill Cornish 09 Feb '15

09 Feb '15

Using boost::variant with boost::serialization gives me a warning about unused type in the boost::serialization namespace: D:/Boost/boost/serialization/variant.hpp:69:75: warning: typedef 'types' locally defined but not used [-Wunused-local-typedefs] typedef typename boost::variant<BOOST_VARIANT_ENUM_PARAMS(T)>::types types; I looked up boost::ignore_unused, which says it's for unused types also, but everything I've tried for using in my code (following the definition of my variant) results in a syntax error or other bug claim. How should I use ignore_unused in this case?

2 1

[Serialization] XML: float format is scientific instead of human-readable since Boost 1.57
by Frank Stähr 09 Feb '15

09 Feb '15

Hello Boost guys, when I switched from Boost 1.55 to 1.57 there was a change in the formation of floats and doubles for xml archives. Look at this example: #include <fstream> #include <boost/archive/xml_oarchive.hpp> class MyClass { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::make_nvp("accuracy", accuracy); } double accuracy = 0.03; }; int main() { MyClass obj; std::ofstream ofs("sample.xml"); boost::archive::xml_oarchive oa(ofs); oa & boost::serialization::make_nvp("myclass", obj); } I compiled it with VS 2013 for 32 bit. The output file has the line: <m_accuracy>2.99999999999999990e-002</m_accuracy> In Boost 1.55 it was much better human-readable: 0.03. Is this behaviour (this change) intended? In any case, what is the best way to format floats and doubles? (i. e. a manipulator for the ofstream?) Thanks, Frank -- Frank Stähr Technische Universität Berlin Communication Systems Group Sekr. EN1 Einsteinufer 17 10587 Berlin, Germany

5 10

write starvation of upgradable lock
by David Frank 09 Feb '15

09 Feb '15

From this discussion, http://stackoverflow.com/questions/21773618/starvation-with-upgrade-lock?no… There seems to be a starvation of writer with upgradable lock, I'm wondering if there is any fix/improvement with later release, e.g, 1.56, or 1.57 Thanks,David

2 1

[website] File appears truncated
by Joaquin M Lopez Munoz 07 Feb '15

07 Feb '15

The following file (which is linked from Boost.MultiIndex docs): http://www.boost.org/doc/libs/1_57_0/libs/multi_index/example/hashed.cpp appears truncated at line 8, yet it is perfectly OK in github: https://github.com/boostorg/multi_index/blob/master/example/hashed.cpp Any clue what's going on? Thank you, Joaquín M López Muñoz Telefónica

2 1

[System] Link issues using BOOST_ERROR_CODE_HEADER_ONLY
by Jonathan Jones 07 Feb '15

07 Feb '15

Hello, We're in the process of upgrading from Boost 1.49 to Boost 1.56. As part of this upgrade, we've noticed the linkage requirements for using the "system" library are much more strict in 1.56. We are getting linker errors like the following across dozens of our libraries: boost/system/error_code.hpp: undefined reference to `boost::system::generic_category()' boost/system/error_code.hpp: undefined reference to `boost::system::system_category()' We decided to fix these by defining the macro BOOST_ERROR_CODE_HEADER_ONLY according to this link: http://www.boost.org/doc/libs/1_56_0/libs/system/doc/reference.html#Header- error_code However, when building Boost itself with this macro defined, we're encountering several problems: 1) Some Boost libraries (chrono, filesystem, random) that use the "system" library no longer link, as if they are still expecting the library to be present. Note that some libraries, like thread, that use "system", link fine without the shared library being present. 2) We get multiple definitions of "boost::system::throws" Any thoughts on how to resolve these? Google search has not turned up any bugs that I can find. Sincerely, Jonathan Jones

2 1

[msm] multi thread access
by Sam Fisher 05 Feb '15

05 Feb '15

Hi Christophe, Did you consider adding build-in multi-thread support? (via policies maybe?) For example, I can guaranteed that all access to sub-fsm within its handlers (process_event()) will be synchronized. The problem is, sub-fsm "knows" about its parent and internally communicates with it (forwarding events etc). I can't control it from my side. typical scenario: an action from sub-fsm struct A_Init { template <typename Evt, typename FSM, typename SourceState, typename TargetState> void operator()(Evt&, FSM& fsm, SourceState&, TargetState&) const { std::thread([=]() mutable { std::lock_guard<std::mutex> l(access); fsm.process_event(some_event()); }).detach(); } }; locking proccess_event() in sub-fsm doesn't help if it alters the root.

2 3

Using io_service for synchronous tcp accept + custom tasks
by Aaron Levy 04 Feb '15

04 Feb '15

I've written code of the form: Code: io_service svc; io_service::work work(svc); thread t1( [&svc]() { svc.run(); } ); thread t2( [&svc]() { svc.run(); } ); thread t3( [&svc]() { svc.run(); } ); endpoint ep(ip::tcp::v4(), port); acceptor acceptor(svc, ep); while (true) { shared_ptr<socket> sock(new socket(svc)); acceptor.accept(*sock); svc.post( [sock]() { /* do stuff on sock here */ }); } Is this way of using io_service for accepting tcp connections and also as a thread pool for serving connected clients valid or could I hit some undefined behavior. -- Aaron Levy aaron.levy(a)yandex.com

3 5

joining boost ranges in loop
by Ernest Zaslavsky 04 Feb '15

04 Feb '15

Actually the question is how to achieve it? The use of boost::any_range is possible but undesirable (performance considerations) Sample code: typedef boost::multi_index_container< int, bmi::indexed_by<bmi::hashed_unique<bmi::tag<struct someTag>, bmi::identity<int>>>> Datum; class bar { public: auto foo() const; private: Datum m_someDataContainer; }; SomeType bar::foo() const { SomeType retVal; for (auto i = 0u; i < 10; ++i) { retVal = boost::range::join(retVal, m_someDataContainer.equal_range(i)); } return retVal; } Here we can observe several problems. The return type cannot be easily deduced. The join would create joined_range<joined_range<joined_range and so on of nested types. The above can be achieved by using any_range like typedef boost::any_range<int, boost::random_access_traversal_tag, int&, std::ptrdiff_t> VersionRange; but above will create nested joined_range of any_range which, when the number of iterations is big enough, has tremendous impact on performance. So, what can be done here?

1 0

boost serialization + boost variant + boost blank
by Merrill Cornish 04 Feb '15

04 Feb '15

I'm running Boost 1.57.0 using serialization, variant, and boost::blank with that variant. I found that when compiled, serialization complains that blank does not contain a serialize method, which is true. I made a copy of blank.hpp, called it blank.h, and added template< class Archive > void serialize(Archive& ar, const unsigned int version) {} to the body of struct blank. That made the compiler happy, but is it a fix in general?

4 6

[statechart] fifo_scheduler<>::operator() in state constructor
by Andrew C 04 Feb '15

04 Feb '15

Hi, is it allowed to call fifo_scheduler<>::operator() from state constructor? If yes, then let's assume "scheduler" and "processor" are objects of "fifo_scheduler<>" and "fifo_scheduler<>::processor_handle" types respectively in the some state constructor code below: State(my_context ctx): my_base(ctx) { boost::intrusive_ptr<Event> pEvent(new Event()); // If both lines [A] and [B] are uncommented // then "unconsumed_event" method is called twice. // If just line [A] is uncommented then "unconsumed_event" method is called. // If just line [B] is uncommented then certain "react" method is called. // scheduler.queue_event(processor, pEvent); // [A] // this->post_event(Event()); // [B] scheduler(); } Note constructor calls "scheduler()" at the end. Other questions: Is this code correct and runs expectedly as described in comments? Why "unconsumed_event" is called if use "queue_event" instead of "post_event"? Thanks, Andrew.

1 0

Crashing Issue
by swati upadhyaya 03 Feb '15

03 Feb '15

In my code join() timed_joined() is crashing, I am using these API after interrupt(),Same piece of code is working for others but in my system its crashing, Is there some dependency problem I am using Boost version: 1.55.0 OS: Windows 8 IDE: Visual Studio 2010

2 1

[Variant] Assertion fails at variant/detail/visitation_impl.hpp:207
by Attila Rajmund Nohl 02 Feb '15

02 Feb '15

Hello! I'm using boost-1.55 on Linux. When I run a specific testcase, I get an abort at line 207 in the visitation_impl.hpp file. The comment says that "should never be here at runtime". Unfortunately I don't really understand under what circumstances could runtime end up here - could someone explain how? The variant has a recursive element, i.e. looks something like this: struct Resp; struct SR { } struct AR { std::vector<Resp> resp; } typedef variant< SR, recursive_wrapper<AR> > RMType; struct Resp { RMType rm; }

2 2

boost::ptr_container library question ?
by Danny K 02 Feb '15

02 Feb '15

The ptr_container supports an overload for std::auto_ptr. I was curious if there was a way to add the same functionality for std::unique_ptr. ie an overload that allows a std::unique_ptr to be added to a ptr_vector for example?

2 1

[type_erasure] Problem with iterators
by Marco Guazzone 31 Jan '15

31 Jan '15

Hi, I'm new to the Type Erasure library. I need to write a base class with type-erased forward iterators. To do so I've taken inspiration from the print_sequence.cpp example I've found in the Type Erasure source tree. At the end of the email there is the whole code of my tentative, called "erasure.cpp". Unfortunately, I've problems (presumably) with const iterators which cause the following compile error: $ g++ -Wall -Wextra -pedantic -std=c++11 -I$HOME/sys/src/git/boost -o erasure erasure.cpp -lm *** [begin error] *** In file included from /home/sguazt/sys/src/git/boost/boost/type_erasure/iterator.hpp:20:0, from erasure.cpp:2: /home/sguazt/sys/src/git/boost/boost/type_erasure/operators.hpp: In instantiation of ‘static R boost::type_erasure::dereferenceable<R, T>::apply(const T&) [with R = double&; T = __gnu_cxx::__normal_iterator<const double*, std::vector<double> >]’: /home/sguazt/sys/src/git/boost/boost/type_erasure/detail/instantiate.hpp:91:9: required from ‘static void boost::type_erasure::detail::instantiate_concept7::apply(Concept*, Map*) [with Concept = boost::mpl::vector<boost::type_erasure::forward_iterator<>, boost::type_erasure::same_type<boost::type_erasure::deduced<boost::type_erasure::iterator_value_type<boost::type_erasure::_self> >, double>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>; Map = boost::mpl::map1<boost::mpl::pair<boost::type_erasure::_self, __gnu_cxx::__normal_iterator<const double*, std::vector<double> > > >]’ /home/sguazt/sys/src/git/boost/boost/type_erasure/any.hpp:225:13: required from ‘boost::type_erasure::any<Concept, T>::any(U&&) [with U = __gnu_cxx::__normal_iterator<const double*, std::vector<double> >&; Concept = boost::mpl::vector<boost::type_erasure::forward_iterator<>, boost::type_erasure::same_type<boost::type_erasure::deduced<boost::type_erasure::iterator_value_type<boost::type_erasure::_self> >, double>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>; T = boost::type_erasure::_self]’ erasure.cpp:36:40: required from ‘std::vector<_RealType> base<T>::foo(IterT, IterT) [with IterT = __gnu_cxx::__normal_iterator<const double*, std::vector<double> >; T = double]’ erasure.cpp:77:73: required from here /home/sguazt/sys/src/git/boost/boost/type_erasure/operators.hpp:134:44: error: invalid initialization of reference of type ‘double&’ from expression of type ‘const double’ static R apply(const T& arg) { return *arg; } *** [/end error] *** The GCC version is 4.9.2. Here below is the content of "erasure.cpp". If I comment lines below the comment "THE FOLLOWING WON'T COMPILE" I get no error. So the problem is due to the use of cbegin/cend. *** [erasure.cpp] *** #include <boost/type_erasure/any.hpp> #include <boost/type_erasure/iterator.hpp> #include <boost/type_erasure/operators.hpp> #include <boost/type_erasure/same_type.hpp> #include <boost/mpl/vector.hpp> #include <boost/smart_ptr.hpp> #include <cmath> #include <cstddef> #include <iostream> #include <iterator> #include <vector> namespace mpl = boost::mpl; namespace te = boost::type_erasure; template <typename T> using fwd_iter_impl_t = te::any< mpl::vector< te::forward_iterator<>, te::same_type<te::forward_iterator<>::value_type,T>>>; template <typename T> class base { protected: typedef fwd_iter_impl_t<T> fwd_iter_type; public: virtual ~base() { } template <typename IterT> std::vector<T> foo(IterT first, IterT last) { return this->do_foo(first, last); } private: virtual std::vector<T> do_foo(fwd_iter_type first, fwd_iter_type last) = 0; }; // base template <typename T> class derived: public base<T> { private: typedef typename base<T>::fwd_iter_type fwd_iter_type; std::vector<T> do_foo(fwd_iter_type first, fwd_iter_type last) { const std::ptrdiff_t n = std::distance(first, last); std::vector<T> res(n); for (std::size_t i = 0; first != last; ++first, ++i) { res[i] = std::pow(*first,i)/n; } return res; } }; // derived int main() { std::vector<double> dv; dv.push_back(5); dv.push_back(8); dv.push_back(11); boost::scoped_ptr< base<double> > p_base(new derived<double>()); // begin/end const std::vector<double> foos = p_base->foo(dv.begin(), dv.end()); for (std::size_t i = 0; i < foos.size(); ++i) { std::cout << "foos[" < cfoos = p_base->foo(dv.cbegin(), dv.cend()); for (std::size_t i = 0; i < cfoos.size(); ++i) { std::cout << "cfoos[" << i << "]: " << cfoos[i] << std::endl; } } *** [/erasure.cpp] *** Thank you very much for your help. Best, -- Marco

3 9

[Asio] Handlers of asycn_send_to are called in which order?
by Attila Rajmund Nohl 30 Jan '15

30 Jan '15

Hello! My code sends UDP packets using async_send_to. If all packets are successfully sent, are their handlers called in the same order as the async_send_to calls happened? I mean if my code looks something like this: socket.async_send_to(buffer1, destination, handler1); socket.async_send_to(buffer2, destination, handler2); Is it guaranteed that handler2 is always called after handler1?

3 2

[iostreams] Devices and WOULD_BLOCK
by David Hawkins 30 Jan '15

30 Jan '15

Hi all, Boost newcomer here ... I have an application where I need to encode/decode a serialized data stream. I have used Boost.Iostreams filtering_stream filter to implement encoding and decoding function of each layer. The device interface is via a USB device, eg., think USB-to-Serial device, but without the classic Virtual COM Port or ttyUSB0 layer available. For example, the FTDI FT232H USB-to-MPSSE interface is a suitable cable http://www.ftdichip.com/Products/Cables/USBMPSSE.htm The cable can be used to implement either JTAG or SPI mode access (the mode selection introduces different filters into the filtering_stream stack). I have the filters working, and am working on getting a device working. Rather than deal with the details of the final hardware, I figured I'd simplify the design by creating a client/server design via sockets; the client code matches what I would use with real hardware, while the server code emulates the hardware. I started with this example for a socket device http://stackoverflow.com/questions/12023166/is-there-a-boostiostreams-bidir… The "problem" with the protocol I need to decode (which I have no choice to change) is that the data stream possibly contains escaped characters, so there is no way to know the read data length at the socket layer - its up to the filtering_stream layers to request data from the device layer until a complete packet is decoded. This all sounds good in theory, but in practice the filter layers attempt to read in blocks, and the read size is often larger than the read data that the device layer will supply. This lead to higher-level layers blocking in read(). I figured (perhaps incorrectly) that I could deal with this using non-blocking socket reads. After reading Boost.Iostreams non-blocking support in Section 3.6 http://www.boost.org/doc/libs/1_57_0/libs/iostreams/doc/index.html http://www.boost.org/doc/libs/1_57_0/libs/iostreams/doc/guide/asynchronous.… I modified the socket device example in the link above to; * put the socket in non-blocking mode before constructing the device * change the device 'read' procedure to return WOULD_BLOCK rather than throw an exception This does not work, and its not due to the filter layers. There is an issue with the device layer. Here's the issue ... given a design with a filtering_stream created only with a socket_device and no filters, if I trace the code in a debugger (Boost 1.57.0 source, Visual Studio 2012 under Win7), the socket_device read method call return sequence is boost/iostreams/read.hpp - read_device_impl read template at line 187 - read at line 52 boost/iostreams/detail/adapter/concept_adapter.hpp - device_wrapper_impl read at line 169 - read at line 77 boost/iostreams/detail/streambuf/indirect_streambuf.hpp - line 258 i.e., this source file https://github.com/boostorg/iostreams/blob/master/include/boost/iostreams/d… and this particular block of code // Read from source. std::streamsize chars = obj().read(buf.data() + pback_size_, buf.size() - pback_size_, next_); if (chars == -1) { this->set_true_eof(true); chars = 0; } setg(eback(), gptr(), buf.data() + pback_size_ + chars); The code tests for EOF (-1), but not WOULD_BLOCK (-2), so after this point, since chars is -2, things go bad. So I guess my question now is; Have I just bumped into the as-yet-unsupported part of Boost.Iostreams support for asynchronous I/O? Cheers, Dave PS. I can post example code if anyone wants to trace the code for themselves, I just figured I'd post the question to start with.

4 15

Joining boost::asio::strands
by Cesar Mello 29 Jan '15

29 Jan '15

Hi, After spawning several paralell jobs through calls to boost::asio::spawn inside a loop, is there an easy way to wait for all of them to finish? I would like to join them to aggregate the results. Please can you give me any clue? Thank you a lot! Best regards Cesar

1 0

ProgramOptions: explicit empty string argument
by Akim Demaille 29 Jan '15

29 Jan '15

Hi, I would like to be able to support an empty optional argument for long options. This is something that is supported by gnu getopt_long and argp. Consider for instance a simplified version of the first simple example program: #include <iostream> #include <boost/program_options.hpp> int main(int ac, char* av[]) { namespace po = boost::program_options; using namespace std; po::options_description desc("Allowed options"); desc.add_options() ("help", "produce help message") ("compression", po::value<string>()->implicit_value(""), "set compression level") ; po::variables_map vm; po::store(po::parse_command_line(ac, av, desc), vm); po::notify(vm); if (vm.count("help")) cout << desc << "\n"; else if (vm.count("compression")) cout << "Compression level was set to " << vm["compression"].as<string>() << ".\n"; else cout << "Compression level was not set.\n"; } when I run it, in "typical cases", I have: $ ./a.out Compression level was not set. $ ./a.out --compression=foo Compression level was set to foo. $ ./a.out --compression foo Compression level was set to foo. $ ./a.out --compression Compression level was set to . all of this is fine. However, how can I explicitly pass the empty string? $ ./a.out --compression= libc++abi.dylib: terminating with uncaught exception of type boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::program_options::invalid_command_line_syntax> >: the argument for option '--compression' should follow immediately after the equal sign zsh: abort ./a.out --compression= Of course I could simply to my user that there is a special token, say '-', that means "empty", but it is still more complex than simply accepting the empty string to mean the empty string. Thanks! (There are some stack overflow questions, but they do not address this particular point, --foo='').

1 0

[interprocess] Bizarro File Names (Windows)
by Aaron_Wright＠selinc.com 28 Jan '15

28 Jan '15

I have a service that is running in Windows Server 2008 R2 SP1 that uses shared memory. It runs fine for a month or so, but then stops working correctly. When I check the C:\ProgramData\boost_interprocess\*\ folder, I get a bunch of weird file names, such as: 88C861CD6DE2CF01EBA2F0CC1200D001A4070000EBFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000ECFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000EDFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000EEFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000EFFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000F0FFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000F1FFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000F2FFFFFF 88C861CD6DE2CF014B04F3CC1200D001A40700000AFFFFFF 88C861CD6DE2CF014B04F3CC1200D001A40700000BFFFFFF 88C861CD6DE2CF014B04F3CC1200D001A40700000CFFFFFF 88C861CD6DE2CF014B04F3CC1200D001A40700000DFFFFFF ... (and so on) These are not even close to the names that are supposed to be used. They seem to increment a bit, then shift slightly, and start incrementing again. When I restart the service I get similar named files and patterns, and my services crashes because it can't grow shared memory (presumably because the file names are not correct). I have to restart the box in order to get the correct behavior. Has anyone seen this behavior before? --------------------------------------------------------- Aaron Wright

1 1

[mpl] lazy condition in enable_if
by Sam Fisher 28 Jan '15

28 Jan '15

Hi, I need to run boost::mpl::for_each<> function with template condition, like: boost::mpl::for_each< vector_of_types, boost::mpl::make_identity<boost::mpl::_1> > (Functor< condition >()); I'm trying to implement lazy binding in enable_if. Visual studio fails with error "'X<IsFoo<boost::mpl::_>>::operator ()' : ambiguous call to overloaded function" minimal test code which fail on boost 1.57 #include <boost/mpl/for_each.hpp> #include <boost/mpl/lambda.hpp> #include <boost/mpl/bind.hpp> #include <boost/mpl/vector.hpp> #include <boost/core/enable_if.hpp> #include <iostream> #include <type_traits> template <int> struct dummy { dummy(int) {} }; // from doc struct Foo {}; struct Bar {}; template <typename T> struct IsFoo { typedef typename std::is_same<T, Foo>::type type; }; #define generate_type(_fn) \ typename boost::mpl::apply<boost::mpl::bind< \ boost::mpl::lambda< _fn <boost::mpl::_> >::type, \ boost::mpl::bind<typename boost::mpl::lambda<_Pred>::type, U> \ > >::type #define enable_type generate_type(boost::enable_if) #define disable_type generate_type(boost::disable_if) template <typename _Pred> struct X { template <typename U> enable_type operator()(boost::mpl::identity, dummy<0> = 0) const { std::cout << "enable: " << typeid(U).name() << std::endl; } template <typename U> disable_type operator()(boost::mpl::identity, dummy<1> = 0) const { std::cout << "disable: " << typeid(U).name() << std::endl; } }; int main() { X<IsFoo<boost::mpl::_> > x; x(boost::mpl::identity<Foo>()); x(boost::mpl::identity<Bar>()); return 0; }

1 0

[release] Release schedule changes..
by Rene Rivera 27 Jan '15

27 Jan '15

After some discussion in the Boost Release Team we've decided on an ongoing schedule for releases. Taking into account the realities of how long it takes for authors and the release team to work on a release we've decided to move to *three* releases a year. The targets for the releases will now be: * Spring release on the second Wednesday of April. * Summer release on the second Wednesday of August. * Fall/Winter release on the second Wednesday of December. There will be no January release. This will allow for the fact that most people are on extended holidays during Winter. It will also allow for people to work on larger changes that require more testing time during the longer Winter period. We are also moving to Wednesday release to allow the release managers non-weekend time to work before and after the release. Please consult the Boost calendar for specific dates and merge schedule for the next release. Thanks, the Boost Release Team. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[multi state machine/ MSM] execute_queued_events
by Steve Hickman 26 Jan '15

26 Jan '15

In the MSM doc section "Enqueueing events for later processing", you state that "Calling execute_queued_events() will then process all enqueued events (in FIFO order)." You also said in a previous post that MSM is not thread safe, thus requiring an external mechanism to insure thread safety. I don't see a mechanism to execute a single event at a time, which would be preferable if I have to lock the queue while processing events. Having said that, a cursory examination of the "execute_queued_events" code makes me think it only processes one event per call. Which is correct? Is the documentation correct that it actually processes all queued events? If not, can the documentation be corrected? If so, is there a publicly usable call to process a single queued event? If there is no publicly available call for processing a single queued event, how do you recommend processing queued events in a thread safe manner that won't lock the queue for extended periods of time?

4 7

[multi_index] recursive declaration of MIC with a value which contains references of its kind
by Nick Stokes 26 Jan '15

26 Jan '15

I have a value type (Foo) which is supposed to contain references to some multi_index_container of its type, like so: struct Foo { int property1; int property2; FooMIC* other; // this (the pointer value) may or may not be indexed upon }; typedef multi_index_container< Foo, indexed_by < sequenced<> , ordered_unique< member<Foo, int, &Foo::property1> > , ... >> FooMIC; Due to recursive nature of this, I wasn't able to figure out how do declare such a thing (other than unsafely using void* references in Foo). Any ideas? Thanks many, Nick

2 2

Re: [Boost-users] [boost] [Review] Boost.Endian mini-review
by Beman Dawes 26 Jan '15

26 Jan '15

On Sun, Jan 25, 2015 at 6:12 PM, Jason Newton <nevion(a)gmail.com> wrote: > On Sun, Jan 25, 2015 at 8:21 AM, Beman Dawes <bdawes(a)acm.org> wrote: > >> On Sat, Jan 24, 2015 at 2:25 AM, Jason Newton <nevion(a)gmail.com> wrote: >> > I think the only thing that I have no interest in using - a kind way of >> > saying its probably unneeded bloat IMO is the arithmetic types. I prefer >> > native types and using conversion functions. But maybe they could >> improve >> > my code - its something I toss back and forth a little and haven't >> > attempted embracing. >> >> Because even the endian buffer and arithmetic types that appear most >> expensive generate only short sequences of code, the optimizing >> compilers often generate exactly the same instructions regardless of >> endian approach. On Intel machines, that often distills down to a >> single bswap instruction since the value is already in a register. >> >> That isn't always true, so you do need to measure performance of >> various approaches in the context of your actual application. But if >> use of the buffer or arithmetic types would otherwise improve your >> code, please don't reject them without actually testing performance >> first. >> > > Allow me to clarify: I meant code bloat, not speed. Sorry - your original post was clear, but I misinterpreted. I have not systematically measured code bloat. Maybe I can do that at least for some common use cases. Thanks, --Beman

1 0

Re: [Boost-users] [boost] [Review] Boost.Endian mini-review
by Beman Dawes 25 Jan '15

25 Jan '15

On Sat, Jan 24, 2015 at 2:25 AM, Jason Newton <nevion(a)gmail.com> wrote: ... > As a long time user of the Boost.Endian library (applying patches to the > distribution I maintain), I am happy to see it finally up for uh... > mini-review. Hoping to see it get to formal review and included... further > hoping it makes it into the next C++ standard! The library went through formal review in 2011, so will go into Boost as soon as the mini-review is over. And, yes, I do plan to propose it to the standards committee. > It is ready in my opinion. I've seen it go through some topical changes > over the years but the only thing I've used from it are the conversion > functions which have been great for implementing proper io in the range of > network socket io / serial with various protocols and stored data from > varies devices/sensors) if a specification enforces byte order. It > fullfills my needs and always did fairly well on performance with gcc/clang. Depending on what version you have been using, the performance may now be even better. > I think the only thing that I have no interest in using - a kind way of > saying its probably unneeded bloat IMO is the arithmetic types. I prefer > native types and using conversion functions. But maybe they could improve > my code - its something I toss back and forth a little and haven't > attempted embracing. Because even the endian buffer and arithmetic types that appear most expensive generate only short sequences of code, the optimizing compilers often generate exactly the same instructions regardless of endian approach. On Intel machines, that often distills down to a single bswap instruction since the value is already in a register. That isn't always true, so you do need to measure performance of various approaches in the context of your actual application. But if use of the buffer or arithmetic types would otherwise improve your code, please don't reject them without actually testing performance first. > > This library should not be looked at as fulfilling an uncommon need - and > should even be part of future C++ standards because the usual > macro/functions (e.g. htons) in the in arpa/inet.h are widely used outside > of inet related code (see above examples) and have the types encoded in the > name making them not easily usable/composable in contrast to something > template based which the library offers. Further IEEE 754 support - > especially for double floating point types. The library definitely fills > that gap and has for years IMO. Thanks for the kind words! --Beman

1 0

[thread] await hangs when using boost::promise/future
by TONGARI J 25 Jan '15

25 Jan '15

Hi, The sample code is here: https://gist.github.com/jamboree/3b8716ad1922749e77ae The boost::future adaption code is adapted from N4286. Tested with VS2015 preview. If std::promise is passed, the code works fine. Any clue why it hangs if boost::promise is passed? Thanks.

3 10

[Graph] source vertex colour at start of BFS or DFS
by Jeremy Murphy 24 Jan '15

24 Jan '15

Hi, I'm wondering, why do the BFS and DFS algorithms not inspect the colour of the source vertices given to them? If a source vertex is already black, shouldn't the search effectively be a no-op? Currently the source vertex is 'discovered' and coloured grey regardless of its previous colour. I know it might seem weird to pass a black vertex as the source, but I guess I see it as similar to passing an empty range to an algorithm: it's valid but nothing happens. Thanks, cheers. Jeremy

1 0

Re: [Boost-users] unit test BOOST_CHECK_CLOSE absolute
by Dave Gomboc 24 Jan '15

24 Jan '15

Gennadiy Rozental <rogeeff <at> gmail.com> writes: > > Paul A. Bristow <pbristow <at> hetp.u-net.com> writes: > > FWIW I've also wanted the *values* in a message (rather > > than just a test fail). > > I do not follow this comment. Which message and which tool do you refer to? Perhaps he meant that he'd like the error message when a BOOST_CHECK_CLOSE fails to show the value that was rejected, and also the range of values that would have been accepted? Dave

2 1

[Review] Boost.Endian mini-review
by Joel FALCOU 23 Jan '15

23 Jan '15

The mini-review of Boost.Endian starts today and runs through Sunday, February 1. The library repository is available on GitHub at https://github.com/boostorg/endian The docs for the library can be viewed online at https://boostorg.github.io/endian/ The objective of the mini-review is to verify that the issues raised during the formal review have been addressed. Those issues are documented at https://boostorg.github.io/endian/mini_review_topics.html which also describes the resolution of each issue. Comments and suggestions unrelated to the mini-review issues are also welcome, but the key question the review manager needs your opinion on is this: Is the library ready to be added to Boost releases? -- Joel Falcou, Endian Review Manager

1 0

Review Wizard Status Report for January 2015
by Ron Garcia 23 Jan '15

23 Jan '15

============================================== Review Wizard Status Report for January 2015 ============================================== News ==== 1. Boost 1.56 Released November 2014. New Libraries: none 2. Sort Accepted. November 2014. 3. Compute Accepted. December 2014. 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 accepted to Boost, but have not yet been integrated into Boost Git: * Contract - accepted September 2012; author: Lorenzo Caminiti. * Sort - accepted November 2014: author: . * Compute - accepted December 2014: author: . The following libraries have been accepted and submitted to Boost Git, but have not yet appeared in a release: * Convert - accepted June 2014; author: Vladimir Batov. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally September 2011; author Beman Dawes. * Fiber - accepted provisionally January 2014; author Oliver Kowalke. 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 ubc dot ca" and "johnphillipsithica at gmail dot com" 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) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Boost.Range Extensions * Nowide (M) * Array (M) * STL Extensions (M) * Countertree (M) * Process (M) * Asynchronous File I/O (M) * Application (M) * Edit Distance (M) * Mixin (M) * Dependency Injection (M) * DLL (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. 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. 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. 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 :Review Manager: Needed :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 Asynchronous File I/O --------------------- :Author: Niall Douglas and Paul Kirth :Review Manager: Needed :Download: https://github.com/BoostGSoC/boost.afio/archive/boost-peer-review.tar.gz :Description: Boost.AFIO is a linear scalable, batch, chainable, asynchronous closure execution engine with an almost wait free implementation extending Boost.ASIO and Boost.Thread specialised as a portable asynchronous file i/o implementation library. Implementation of this first version has been kept as simple as possible (~ 1000 active LOC) at the cost of some performance, though with a good compiler you can expect 25-50% of the performance of using raw Boost.ASIO. Application ----------- :Author: Renato Tegon Forti :Review Manager: Needed :Download: https://github.com/retf/Boost.Application :Documentation: http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/index.html :Description: Application provides an application environment, or start point to any people that want a basic infrastructure to build an system application on Windows or Unix Variants (e.g. Linux, MacOS). Application uses behaviours modeled using 'aspects' concept proposed by 'Vicente J. Botet Escriba', that allow easy extension and customization of library components. The application modes uses these components internally to achieve the user desirable behaviours. Application provide many useful ready-to-use features, e.g: * Run application as Windows Service; * Run application as UNIX/POSIX Daemon; * Plugin extension system; * Process(executable) Single instance Instantiation support; * Application SIGNAL/Callbacks customization; * Windows Service Setup feature; * And many others. Edit Distance ------------- :Author: Erik Erlandson :Review Manager: Needed :Download: https://github.com/erikerlandson/algorithm/tree/edit_distance/sequence :Description: The edit distance is the length of the shortest (or least-cost) edit script from one sequence to another, where an edit script is defined as a sequence of insertion, deletion and (optionally) substitution operations. The function implementing the edit distance is named edit_distance. This function will return the edit distance between two sequences, where sequences may be any valid range object supporting forward iteration. The edit_distance function will also, if requested, return the edit script. Mixin ----- :Author: Borislav Stanimirov :Download: https://github.com/iboB/boost.mixin :Documentation: http://ibob.github.io/boost.mixin/ :Review Manager: Needed :Description: Boost.Mixin is a library that allows the composition and modifications of polymorphic types at run time. Types and objects are constructed out of building blocks called mixins. The library uses the type boost::mixin::object as a placeholder, whose instances can be extended with existing classes (mixins), thus providing a particular instance with the functionality of all those types. Accessing the newly formed type's interface is made through messages: stand-alone functions generated by the library, which can be thought of as methods. This is given while also having full abstraction between the interface and the definition of types. An existing feature in another language similar to Boost.Mixin and also an inspiration for the library are the mixins in Ruby. The library also has similarities with the pattern entity-component-system. Dependency Injection -------------------- :Author: :Download: https://github.com/krzysztof-jusiak/di :Documentation: http://krzysztof-jusiak.github.io/di/boost/libs/di/doc/html :Incubator: http://rrsd.com/blincubator.com/bi_library/di-dependency-injection/?gform_p… :Review Manager: Needed :Description: Boost.DI is a dependency injection library improving manual dependency injection by simplifying object instantiation with automatic dependencies injection. Using Boost.DI has many advantages over manual dependency injection. * Reduce boilerplate code (No factories, no objects creation in specific order) * Reduce cost of maintenance effort (Constructor signature change won't affect di configuration) * Reduce testing effort * Give better control of what and how is created (Policies, Providers) * Give better understanding about objects hierarchy (UML Dumper) DLL --- :Author: Antony Polukhin :Download: https://github.com/apolukhin/Boost.DLL :Documentation: http://apolukhin.github.io/Boost.DLL/index.html :Review Manager: Needed :Description: This library was designed to simplify plugin development using C++ in a portable cross-platform manner. Library provides a portable across platforms way to: * load libraries * import any native functions and variables * make alias names for C++ mangled functions and symbols * query libraries for sections and exported symbols * self loading and self querying * getting program and module location by exported symbol Libraries under development =========================== See The Boost Library Incubator Project at http://blincubator.com for discussion of libraries currently under development.

2 1

problems building Boost-1.55.0 in 32b machines with c++11
by Patricia Mendez Lorenzo 22 Jan '15

22 Jan '15

Dear Boost experts, since a while I am trying to compile Boost from the source in a 32b linux machine with c++11 enabled. The compiler version used is gcc4.8.1 This is performed through cmake as follows: --> Configuration: bootstrap.sh --with-python=<path to /bin/python> --with-toolset=gcc --> Build: /b2 -j4 variant=release --layout=versioned --debug-configuration --toolset=gcc --user-config=<path to a user-config.jam> Where user-config.jam contains the following information: using gcc : : : <linkflags>-m32 <compileflags>-m32 -std=gnu++0x also tested it with -std=c++11 And finally installed which basically contains the same options as the build adding --prefix=<installation dir> The libraries built following this procedure does not seem to have been created with c++11. If I compare the signatures of the same library build in 64 against 32 the result are In 64: nm --defined-only --demangle libboost_filesystem-gcc48-mt-1_55.so | grep copy_file boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::copy_option, boost::system::error_code*) In 32, the same produces: boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::copy_option::enum_type, boost::system::error_code*) The difference seems to come from wrong i686 build options. Could you please help me to find the good options to build these libs in 32b with c+=11 enabled? Thank you so much,

2 2

Question about subgraph isomorphism function
by Shouwei Li 20 Jan '15

20 Jan '15

Hi Guys, I am using boost graph library in my research project about graph theory. One object is testing whether graph G1 has a subgraph isomorphic to another graph G2. I only care about the result, "yes" or "no", and don't expected to find out a isomorphism pattern. I use the library function vf2_subgraph_iso(), but the third parameter is a callback function which will print out the isomorphic pattern all the time. Is there any way to omit this parameter or eliminate the output pattern. Here is my code snippet: ----------------------------------------------------- vf2_print_callback<Graph, Graph> callback(C4, g); if (!vf2_subgraph_iso(C4, g, callback) { // something; } else { // something; } __________________________________ Thanks for you attention! Best Regards! Shouwei

1 0

How to build modular boost for android?
by Robert Dailey 19 Jan '15

19 Jan '15

How do I build modular boost for android? I have it checked out from github at the 1.57 tag. I don't see a user-config.jam file, except for at "tools/build/example/user-config.jam". The structure is completely changed, where do I need to make changes? What changes do I make? Any guidance is appreciated. I'm no where near an expert here, I just need a quick ad-hoc solution. Thanks.

2 1

[interval] Guaranteed interval arithmetic for "long double"
by Александров Петр 15 Jan '15

15 Jan '15

Hello. Is guaranteed interval arithmetic for "long double" supported by Boost Interval library on x86-64 CPU, Linux, Clang or GCC? Kind regards, Petr.

1 0

[Coroutine] Migrating coroutines between different threads
by lin li 15 Jan '15

15 Jan '15

Hi, people. I have a question about the coroutines in boost (both the normal Coroutine and the asio couroutine). Can I suspend a coroutine in one thread, then later on resume it in another thread? I have been googling about this and found some (outdated) documents saying that this is not possible ( http://www.crystalclearsoftware.com/soc/coroutine/coroutine/coroutine_threa… ). However, I did not find this warning in the document of the current release. Is this limitation still there or not?

2 1

init log with BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT
by Bill Tian 15 Jan '15

15 Jan '15

Hi guys, I want to define a global logger that can be used in other place. The severity level always be "info". I init the log like this: #include <cstdlib> #include <boost/log/trivial.hpp> #include <boost/log/core.hpp> #include <boost/log/sources/global_logger_storage.hpp> #include <boost/log/sources/severity_logger.hpp> #include <boost/log/sources/record_ostream.hpp> #include <boost/log/sources/severity_feature.hpp> // Here we define our application severity levels. enum severity_level { normal, notification, warning, error, critical }; // The formatting logic for the severity level template< typename CharT, typename TraitsT > inline std::basic_ostream< CharT, TraitsT >& operator<< (std::basic_ostream< CharT, TraitsT >& strm, severity_level lvl) { static const char* const str[] = { "normal", "notification", "warning", "error", "critical" }; if (static_cast<std::size_t>(lvl) < (sizeof(str) / sizeof(*str))) strm << str[lvl]; else strm << static_cast<int>(lvl); return strm; } // Global logger declaration BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT(test_lg, boost::log::sources::severity_logger_mt<severity_level>) void try_logging() { boost::log::sources::severity_logger_mt<severity_level>& lg = test_lg::get(); // TODO: // always write "info" record, Unknown reason! BOOST_LOG_SEV(lg, normal) << "This is a normal severity record"; BOOST_LOG_SEV(lg, notification) << "This is a notification severity record"; BOOST_LOG_SEV(lg, warning) << "This is a warning severity record"; BOOST_LOG_SEV(lg, error) << "This is a error severity record"; BOOST_LOG_SEV(lg, critical) << "This is a critical severity record"; } int main(int argc, char* argv[]) { try_logging(); return EXIT_SUCCESS; } In the log i got this: [2015-01-14 19:00:34.800935] [0x40000300] [info] This is a normal severity re cord [2015-01-14 19:00:34.805935] [0x40000300] [info] This is a notification sever ity record [2015-01-14 19:00:34.806935] [0x40000300] [info] This is a warning severity r ecord [2015-01-14 19:00:34.806935] [0x40000300] [info] This is a error severity rec ord [2015-01-14 19:00:34.806935] [0x40000300] [info] This is a critical severity record What do i miss? Thank you! Bill

2 4

Re: [Boost-users] unit test BOOST_CHECK_CLOSE absolute
by lepere renaud 14 Jan '15

14 Jan '15

>> For example, I am comparing coordinates in 2d spaces and the relative >> value is not important, the meaningfull value is the absolute difference >> between coordinates. > > It is almost never true. Related error gives you much better estimate of > closeness. I agree with that most of the time but this is not always true. Just imagine the case you compare lattitude, longitude. In this case, only absolute values make sense. > >> I have seen that I can do a >> BOOST_CHECK_SMALL(fabs(x - expected_x), 1e-3); >> >> but in this can I don't have a good message when the test fails (it does >> not show the value of x and the expected_x). >> >> In fact I would like to have something like BOOST_CHECK_CLOSE_ABSOLUTE ? >> Is there something equivalent or how can I do something like this ? > > Don't. Specify relative tolerance (or percent tolerance) and keep using > BOOST_CHECK_CLOSE. Relative tolerance will give me false bug report, I want a point to be equal to (0, 0) with a small absolute error and I don't care if it is -1e-15 or +1e-10 so BOOST_CHECK_CLOSE is not an option here and I have to use BOOST_CHECK_SMALL with the absolute difference. The problem with BOOST_CHECK_SMALL(fabs(x - expected_x), 1e-3); Is that when it fails with the message that does not print the values "x" and "expected_x" and does not say something like x(2.0) is not equal to "expected_x(0.0)" with an difference of 1e-3. I can probably write my own macro combining BOOST_TEST_MESSAGE() and some glues to obtain what I want but I was wondering if someone had the same problem and a solution. Thanks Renaud

2 1

[Boost.build] Building for ARM64
by mefyl 14 Jan '15

14 Jan '15

Hi, In my quest cross-compiling Boost.Context for ARM64, I encounter the following problem (using develop since ARM64 support is not in 1.57): $ ./bootstrap.sh --with-libraries=context [...] $ ./b2 -d2 -q toolset=clang architecture=arm abi=aapcs address-model=64 binary-format=mach-o [...] "clang++" -o "bin.v2/libs/system/build/clang-darwin-4.2.1/release/abi- aapcs/address-model-64/architecture-arm/threading-multi/libboost_system.dylib" -single_module -dynamiclib -install_name "libboost _system.dylib" "bin.v2/libs/system/build/clang-darwin-4.2.1/release/abi- aapcs/address-model-64/architecture-arm/threading-multi/error_code.o" Despite asking for arm, the "-arch arm64" I would expect is not passed to clang which thus compile to x86_64. However Boost.Context DOES understand I'm targeting arm since it picks the right ASM file: "clang++" -x assembler-with-cpp -O3 -O3 -finline-functions -Wno-inline - Wall -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_DYN_LINK=1 - DBOOST_CONTEXT_DYN_LINK=1 -DBOOST_CONTEXT_SOURCE -DBOOST_SYSTEM_DYN_LINK=1 - DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_POSIX - DBOOST_THREAD_USE_DLL=1 -DNDEBUG -I"." -c -o "bin.v2/libs/context/build/clang- darwin-4.2.1/release/abi-aapcs/address-model-64/architecture-arm/threading- multi/asm/make_arm64_aapcs_macho_gas.o" "libs/context/src/asm/make_arm64_aapcs_macho_gas.S" Which yields assembly errors of course since "-arch arm64" is not passed. Other sources seem to manage to build Boost for ARM64 using darwin toolset forcing clang as the compiler and passing many additional options, but their setup fails to build Boost.Context since it either picks the wrong ASM file, either complains the platform is not supported. Thanks in advance ! -- Quentin "mefyl" Hocquet CTO @ infinit.io

4 8

Ambiguous overload for boost::blank when using optional & variant
by Berteun Damman 14 Jan '15

14 Jan '15

Hi, I'm using boost 1.57 after upgrading from 1.50, and the following innocuous looking program does not compile with either GCC (4.9) or Clang (3.5); tested both on Mac & Linux: #include <boost/optional.hpp> // This header triggers the problem #include <boost/variant.hpp> int main() { boost::variant<boost::blank> a, b; swap(a,b); // a.swap(b) does not make a difference } Both GCC and Clang give the same error: /opt/local/include/boost/variant/detail/move.hpp:60:5: error: call to 'swap' is ambiguous swap(lhs, rhs); [....] /opt/local/include/boost/core/swap.hpp:54:8: note: candidate function [with T1 = boost::blank, T2 = boost::blank] void swap(T1& left, T2& right) ^ /opt/local/include/boost/variant/detail/move.hpp:44:13: note: candidate function [with T1 = boost::blank, T2 =boost::blank] inline void swap(T1& lhs, T2& rhs) In this case one could remove the Optional header, but in a larger project this is of course not a solution; a better solution seems to add an overload for swap taking two boost blanks. I feel this is a bug in Boost, can someone confirm and tell me where I should file the bug request? Finally I noticed due to the above error messages that boost::variant will never use variadic templates when you use Clang. For GCC it uses them (in C++11 mode), but for Clang it refuses. Why is this? Thanks, -Berteun

1 0

[Context] Boost.Context ARM64 support
by mefyl 14 Jan '15

14 Jan '15

Hi, We currently use boost context on iOS, and as you may know Apple is making it mandatory for application to bundle a 64bits version starting February 1 (https://developer.apple.com/news/?id=10202014a) It is thus crucial for us - and anyone using Boost Context on iOS - to get a working ARM64 backend working. Looking at github, I see code has been contributed, but the build system still bounces to unsupported.hh when building with clang for ARM64. Is that code acutally working but not-yet-released, or is it still incomplete ? In the latter case, is anyone still working on it and do we have any rough idea of the delay before a working version get pushed ? Happy to read some ARM64 doc and contribute if it's in a stale state, of course. Cheers, -- Quentin "mefyl" Hocquet CTO @ infinit.io

2 7

unit test BOOST_CHECK_CLOSE absolute
by Renaud Lepère 12 Jan '15

12 Jan '15

I am doing unit tests using boost utf but I have sometimes problems with BOOST_CHECK_SMALL because it checks relative value. For example, I am comparing coordinates in 2d spaces and the relative value is not important, the meaningfull value is the absolute difference between coordinates. I have seen that I can do a BOOST_CHECK_SMALL(fabs(x - expected_x), 1e-3); but in this can I don't have a good message when the test fails (it does not show the value of x and the expected_x). In fact I would like to have something like BOOST_CHECK_CLOSE_ABSOLUTE ? Is there something equivalent or how can I do something like this ?

3 3

[GIL] Problem trying to use scoped_channel_value with copy_and_convert_pixels
by Gabriel Marcano 12 Jan '15

12 Jan '15

I have been experimenting with Boost.GIL, and I have run into something that I'm not sure if it's a problem on my end or with Boost.GIL. In essence, I'm trying to make a grayscale image with channels limited to 14 bits. I am using scoped_channel_value to do this. The problem happens when I try to convert the 14 bit image to a 16 bit grayscale image I get compilation errors. I am including the code I am using below: //START CODE #include <boost/gil/gil_all.hpp> #include <cstdint> using namespace std; using namespace boost::gil; namespace detail { struct bits14_min { static std::uint16_t apply() { return 0;} }; struct bits14_max { static std::uint16_t apply() { return 0x3FF;} }; } typedef scoped_channel_value <std::uint16_t, ::detail::bits14_min, ::detail::bits14_max> bits14_t; typedef pixel<bits14_t, gray_layout_t> Pixel1; typedef image<Pixel1> Frame1; int main() { Frame1 image( Frame1::point_t(100, 100), Frame1::value_type((1 << 14)-1), 0); gray16_image_t image2(image.dimensions()); Frame1::view_t view1(view(image)); gray16_image_t::view_t view2(view(image2)); copy_and_convert_pixels(view1, view2); return 0; } //END CODE The interesting thing is that the program compiles if change typedef scoped_channel_value <std::uint16_t, ::detail::bits14_min, ::detail::bits14_max> bits14_t; to typedef scoped_channel_value <float, ::detail::bits14_min, ::detail::bits14_max> bits14_t; I think the relevant error in the log is this: /usr/include/boost/gil/channel_algorithm.hpp:54:8: error: ‘struct boost::gil::scoped_channel_value<short unsigned int, detail::bits14_min, detail::bits14_max>’ is not a valid type for a template non-type parameter struct unsigned_integral_max_value : public mpl::integral_c<UnsignedIntegralChannel,-1> {}; I am attaching the full compile log to this email. Thank you for any help with this matter! Sincerely, Gabriel E. Marcano

2 2

Initializing of Boost.Log
by Igor Mironchik 11 Jan '15

11 Jan '15

Hi guys, I want to initialize simple log. I do the next: #include <boost/log/utility/setup/file.hpp> #include <boost/log/trivial.hpp> #include <boost/log/utility/setup/common_attributes.hpp> void init() { boost::log::add_file_log ( boost::log::keywords::file_name = "sample_%Y%m%d.log", boost::log::keywords::auto_flush = true, boost::log::keywords::open_mode = (std::ios::out | std::ios::app), boost::log::keywords::format = "[%TimeStamp%] [%Severity%]: %Message%" ); boost::log::add_common_attributes(); } int main(int, char*[]) { init(); BOOST_LOG_TRIVIAL( trace ) << "A trace severity message"; BOOST_LOG_TRIVIAL( debug ) << "A debug severity message"; BOOST_LOG_TRIVIAL( info ) << "An informational severity message"; BOOST_LOG_TRIVIAL( warning ) << "A warning severity message"; BOOST_LOG_TRIVIAL( error ) << "An error severity message"; BOOST_LOG_TRIVIAL( fatal ) << "A fatal severity message"; return 0; } But in log I receive: [2015-Jan-11 09:51:04.082221] []: A trace severity message [2015-Jan-11 09:51:04.082221] []: A debug severity message [2015-Jan-11 09:51:04.082221] []: An informational severity message [2015-Jan-11 09:51:04.092221] []: A warning severity message [2015-Jan-11 09:51:04.092221] []: An error severity message [2015-Jan-11 09:51:04.092221] []: A fatal severity message And my question is how to initialize logging to write severity level in messages? What do I miss? Thank you. -- Best Regards, Igor Mironchik.

1 2

Building boost under solaris
by Raphael Fuchs 10 Jan '15

10 Jan '15

Hello, I am trying to compile boost 1.57 under Solaris for the second day now, please help. Here is my setup: - Solaris Sparc 5.10 - gcc 4.9.2 What I did: ./bootstrap.sh --without-icu --prefix=/usr/local/ -n Building Boost.Build engine with toolset gcc... ./b2 This results in two errors like the following: gcc.compile.asm bin.v2/libs/context/build/gcc-4.9.2/release/threading-multi/asm/make_sparc64_sysv_elf_gas.o /usr/ccs/bin/as: "/var/tmp//cc3IBrs7.s", line 13: error: invalid character (0x40) /usr/ccs/bin/as: "/var/tmp//cc3IBrs7.s", line 34: warning: detect global register use not covered .register pseudo-op /usr/ccs/bin/as: "/var/tmp//cc3IBrs7.s", line 52: error: unknown "%"-symbol /usr/ccs/bin/as: "/var/tmp//cc3IBrs7.s", line 52: error: quoted-string operand required /usr/ccs/bin/as: "/var/tmp//cc3IBrs7.s", line 52: error: statement syntax "g++" -x assembler-with-cpp -O3 -finline-functions -Wno-inline -Wall -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_CONTEXT_DYN_LINK=1 -DBOOST_CONTEXT_SOURCE -DNDEBUG -D_XOPEN_SOURCE=600 -I"." -c -o "bin.\ v2/libs/context/build/gcc-4.9.2/release/threading-multi/asm/make_sparc64_sysv_elf_gas.o" "libs/context/src/asm/make_sparc64_sysv_elf_gas.S" Question 1: the /usr/css/bin directory is not in my PATH. How can I tell b2 to use the gnu-utils assembler? I also get a lot of errors like this: "g++" -x assembler-with-cpp -O3 -finline-functions -Wno-inline -Wall -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_CONTEXT_DYN_LINK=1 -DBOOST_CONTEXT_SOURCE -DNDEBUG -D_XOPEN_SOURCE=600 -I"." -c -o "bin.\ v2/libs/context/build/gcc-4.9.2/release/threading-multi/asm/jump_sparc64_sysv_elf_gas.o" "libs/context/src/asm/jump_sparc64_sysv_elf_gas.S" ...failed gcc.compile.asm bin.v2/libs/context/build/gcc-4.9.2/release/threading-multi/asm/jump_sparc64_sysv_elf_gas.o... gcc.compile.c++ bin.v2/libs/context/build/gcc-4.9.2/release/threading-multi/unsupported.o libs/context/src/unsupported.cpp:7:2: error: #error "platform not supported" #error "platform not supported" ^ "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthreads -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_CONTEXT_DYN_LINK=1 -DBOOST_CONTEXT_SOURCE -DNDEBUG -D_XOPEN_SOURCE=600 -I"."\ -c -o "bin.v2/libs/context/build/gcc-4.9.2/release/threading-multi/unsupported.o" "libs/context/src/unsupported.cpp" ...failed gcc.compile.c++ bin.v2/libs/context/build/gcc-4.9.2/release/threading-multi/unsupported.o... ...skipped <pbin.v2/libs/context/build/gcc-4.9.2/release/threading-multi>libboost_context.so.1.57.0 for lack of <pbin.v2/libs/context/build/gcc-4.9.2/release/threading-multi>asm/make_sparc64_sysv_\ elf_gas.o... Question 2:Why does the compiler complain, even though the -D_XOPEN_SOURCE=600 flag is specified? Your support is very much appreciated Best regards Raphael

5 7

rolling log file directory not effective after two files
by David Frank 10 Jan '15

10 Jan '15

Greetings, I'm using the following call to set the rolling log files in dir directory: // Set up where the rotated files will be stored sink->locked_backend()->set_file_collector(sinks::file::make_collector( keywords::target = dir, // where to store rotated files keywords::max_size = 16 * 1024 * 1024, // maximum total size of the stored files, in bytes keywords::min_free_space = 100 * 1024 * 1024 // minimum free space on the drive, in bytes )); But, after two files, the log files get created in the current running directory, I'm wondering if anyone has seen this. Thanks,Dave

1 0

double free when both shared library and executable linked to boost libraries
by Eric Roller 09 Jan '15

09 Jan '15

I've run into a run-time error (double free) with my software which uses a plug-in architecture. The main executable (a.out) uses dlopen to load a shared library (mylib.so). Both a.out and mylib.so utilize the boost libraries (version 1.54) and are therefore linked separately to them. Depending on whether I use static or dynamic linking to the boost libraries I encounter the double free error as confirmed by address sanitizer using gcc 4.9.2 on linux x86_64. Here is a summary of the results: a.out link mylib.so link double free? static dynamic YES static static NO dynamic dynamic NO dynamic static NO So you can see, only when the main executable used static linking to boost and the shared library used dynamic linking to boost is when I saw the double free error at run time. My question is, why is the error only triggered under that condition and what is the recommended link configuration when using boost libraries for both a shared library and an executable. Ideally, the shared library plug-in should be free to use any boost version with either static or dynamic linking, and it should be independent from (i.e. not conflict with) the main executable's boost version and link type. What compiler/link settings would be necessary to achieve this, if it is even possible at all? -- Eric Roller

3 4

Trouble compiling from git repository (VS2013)
by Cesar Mello 09 Jan '15

09 Jan '15

Hi! I cloned the git repository following the instructions from the wiki. But I get the following error on Windows using VS2013 and the command "b2 address-model=64 link=static". Can someone please give me a clue? Thank you very much! Best regards Mello "Name clash for '<pstage\lib>libboost_system-vc120-mt-1_58.lib' Tried to build the target twice, with property sets having ..." Building the Boost C++ Libraries. Performing configuration checks - symlinks supported : no - junctions supported : yes - hardlinks supported : yes - arm : no (cached) - mips1 : no (cached) - power : no (cached) - sparc : no (cached) - x86 : yes (cached) - 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 - zlib : no - iconv (libc) : no - iconv (separate) : no - icu : no - icu (lib64) : no - message-compiler : yes - compiler-supports-ssse3 : yes - compiler-supports-avx2 : yes - gcc visibility : no - long double support : yes 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. - zlib : no (cached) error: Name clash for '<pstage\lib>libboost_system-vc120-mt-1_58.lib' error: error: Tried to build the target twice, with property sets having error: these incompabile properties: error: error: - <warnings>all error: - <architecture>x86 <warnings>on error: error: Please make sure to have consistent requirements for these error: properties everywhere in your project, especially for install error: targets.

1 0

Using static code checkers against the Boost code base
by Hickman, Steve (AdvTech) 08 Jan '15

08 Jan '15

I don't know if there is a policy yet on using static code checkers on the Boost code base as part of the release cycle. Given that the Visual Studio 2012 Analyzer tool I'm using just picked up 3 issues in the 1.57 release (I've posted TRAC items on them already), I suspect not. I would like to encourage such a policy. Boost is, among other things, about quality. This is a way to enhance quality. For people like me who work in safety critical fields, it is vital. I cannot use Boost libraries if they can't be certified. Static analyzers can help insure quality, which makes it easier to qualify these tools. There are many tools available. Some, like CppCheck, are open source. Others are built into development environments (aforementioned VS Analyzer, Clang tools, etc.). Further, I suspect that tool vendors could be convinced it would be good PR to have their tools used by Boost, so I suspect even those with paid licenses can be made available for free. Steve Hickman System Architect, Flight Deck of the Future 480-236-8367

4 10

iostreams gzip/zlib: different behavior with msvc 32 bit vs 64 bit (boost 1.53)
by Simon Haegler 07 Jan '15

07 Jan '15

dear boost users if i compile & run the test code below with msvc 2010 SP1 *64 bit*, both variants (gzip/zlib) work as expected. however, compiling the same with msvc 2010 SP1 *32 bit*, the gzip_decompressor aborts with Assertion failed: 0, file libs\iostreams\src\gzip.cpp, line 127 looking at the debug stack trace, the decompressor chokes on some header byte. i tested with boost 1.53. did anybody encounter the same? TIA, simon here is my test code: BOOST_AUTO_TEST_SUITE(CompressionTests) const std::string SOME_DATA = "yadda yadda duh"; BOOST_AUTO_TEST_CASE(boost_zlib) { const std::string p = "C:\\temp\\compressed.zlib"; { boost::iostreams::filtering_ostream out; out.push(boost::iostreams::zlib_compressor()); out.push(boost::iostreams::file_sink(p, std::ios_base::binary)); out << SOME_DATA; boost::iostreams::close(out); } std::string result; { boost::iostreams::filtering_istream in; in.push(boost::iostreams::zlib_decompressor()); in.push(boost::iostreams::file_source(p, std::ios_base::binary)); result.assign((std::istreambuf_iterator<char>(in)), (std::istreambuf_iterator<char>())); boost::iostreams::close(in); } BOOST_CHECK_EQUAL(result, SOME_DATA); } BOOST_AUTO_TEST_CASE(boost_gzip) { const std::string p = "C:\\temp\\compressed.gzip"; { boost::iostreams::filtering_ostream out; out.push(boost::iostreams::gzip_compressor()); out.push(boost::iostreams::file_sink(p, std::ios_base::binary)); out << SOME_DATA; boost::iostreams::close(out); } std::string result; { boost::iostreams::filtering_istream in; in.push(boost::iostreams::gzip_decompressor()); in.push(boost::iostreams::file_source(p, std::ios_base::binary)); result.assign((std::istreambuf_iterator<char>(in)), (std::istreambuf_iterator<char>())); boost::iostreams::close(in); } BOOST_CHECK_EQUAL(result, SOME_DATA); } BOOST_AUTO_TEST_SUITE_END()

1 0

How to implement overloading functions using boost concepts?
by Neuton de Oliveira Braga Júnior 07 Jan '15

07 Jan '15

Hi, I would like to have overloading functions such that they are dispatched with boost concepts. See minimal example below: #include <iostream> #include <boost/concept/usage.hpp> #include <boost/concept/requires.hpp> template<class T> struct XConcept { BOOST_CONCEPT_USAGE(XConcept) { int x = t.x; } private: T t; }; template<class T> struct XYConcept : XConcept<T> { BOOST_CONCEPT_USAGE(XYConcept) { int y = t.y; } private: T t; }; template<typename T> BOOST_CONCEPT_REQUIRES( ((XConcept<T>)), (void)) foo(T t) { std::cout << "XConcept works!" << std::endl; } template<typename T> BOOST_CONCEPT_REQUIRES( ((XYConcept<T>)), (void)) foo(T t) { std::cout << "XYConcept works!" << std::endl; } int main() { struct { int x; } xtest; struct { int x, y; } xytest; foo(xtest); foo(xytest); return 0; } Expected output: XConcept works! XYConcept works! Can anyone help me with this? Att. Neuton Jr

1 0

[Graph] [BGL] trying to modify brandes betweenness impl
by The Maschine 06 Jan '15

06 Jan '15

Hello all and happy new year! Im trying to modify the brandes centrality in order to analyse only a subset of the graph based on a cutoff distance calculated by some other edge weight than the one used for the brandes call. What I have done so far is to add a shortest path search call before the main path search inside brandes_betweenness_centrality_impl. The first search uses the edge::m_metric_weight and constructs the distance map from 's' based on that weight. Then I feed the metric distance map in the 'brandes special visitor' and I check inside visitor's examine_vertex. Reminder that the brandes call uses the m_special_weight. While this works as a principle I have no idea how people with experience would do it! A problem with this is that while the metric cutoff can be small you still run both searches to the max (as if there is no cutoff). Any help on how to change the first 'dijkstra_shortest_paths' so that after reaching the cutoff the search stops gracefully and leaves the rest of the 'distance_map' to infinity? Thanks a lot and please let me know if something need more clarification. ############### struct EdgeProperties { double m_special_weight; double m_metric_distance_weight; }; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, VertexProperties, EdgeProperties> unGraph; // test my_brandes_dijkstra_visitor // template<typename Graph, typename WeightMap, typename IncomingMap, typename DistanceMap, typename PathCountMap> struct my_brandes_dijkstra_visitor : public bfs_visitor<> { typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor; typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor; my_brandes_dijkstra_visitor(std::stack<vertex_descriptor>& iordered_vertices, WeightMap iweight, IncomingMap iincoming, DistanceMap idistance, PathCountMap ipath_count, std::vector<float> c_dists, float coff) : ordered_vertices(iordered_vertices), weight(iweight), incoming(iincoming), distance(idistance), path_count(ipath_count), cutoff_dists(c_dists), cutoff(coff) { } /** * Whenever an edge e = (v, w) is relaxed, the incoming edge list * for w is set to {(v, w)} and the shortest path count of w is set to * the number of paths that reach {v}. */ void edge_relaxed(edge_descriptor e, const Graph& g) { vertex_descriptor v = source(e, g), w = target(e, g); incoming[w].clear(); incoming[w].push_back(e); put(path_count, w, get(path_count, v)); } /** * If an edge e = (v, w) was not relaxed, it may still be the case * that we've found more equally-short paths, so include {(v, w)} in the * incoming edges of w and add all of the shortest paths to v to the * shortest path count of w. */ void edge_not_relaxed(edge_descriptor e, const Graph& g) { typedef typename property_traits<WeightMap>::value_type weight_type; typedef typename property_traits<DistanceMap>::value_type distance_type; vertex_descriptor v = source(e, g), w = target(e, g); distance_type d_v = get(distance, v), d_w = get(distance, w); weight_type w_e = get(weight, e); closed_plus<distance_type> combine; if (d_w == combine(d_v, w_e)) { put(path_count, w, get(path_count, w) + get(path_count, v)); incoming[w].push_back(e); } } /// Keep track of vertices as they are reached void examine_vertex(vertex_descriptor w, const Graph&) { // add only if this is within the 'cutoff'. cutoff_dists holds // the metric distances from s. if( cutoff_dists[w] < cutoff ) ordered_vertices.push(w); } private: std::stack<vertex_descriptor>& ordered_vertices; WeightMap weight; IncomingMap incoming; DistanceMap distance; PathCountMap path_count; std::vector<float> cutoff_dists; float cutoff; }; //////////////////////////////////////////////////////////////////// template<typename WeightMap> struct my_brandes_dijkstra_shortest_paths { my_brandes_dijkstra_shortest_paths(WeightMap iweight_map) : weight_map(iweight_map) { } template<typename Graph, typename IncomingMap, typename DistanceMap, typename PathCountMap, typename VertexIndexMap> void operator()(Graph& g, typename graph_traits<Graph>::vertex_descriptor s, std::stack<typename graph_traits<Graph>::vertex_descriptor>& ov, IncomingMap incoming, DistanceMap distance, PathCountMap path_count, VertexIndexMap vertex_index , std::vector<float> c_dists, float coff) // modified cutoff vector and value { typedef my_brandes_dijkstra_visitor<Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap> visitor_type; visitor_type visitor(ov, weight_map, incoming, distance, path_count,c_dists,coff); // modified cutoff vector and value dijkstra_shortest_paths(g, s, boost::weight_map(weight_map) .vertex_index_map(vertex_index) .distance_map(distance) .visitor(visitor)); } private: WeightMap weight_map; }; ////////////////////////////// template<typename Graph, typename CentralityMap, typename EdgeCentralityMap, typename IncomingMap, typename DistanceMap, typename DependencyMap, typename PathCountMap, typename VertexIndexMap, typename ShortestPaths> void my_brandes_betweenness_centrality_impl(const Graph& g, CentralityMap centrality, // C_B EdgeCentralityMap edge_centrality_map, IncomingMap, //incoming, // P // OpenMP mod DistanceMap, //distance,// d // OpenMP mod DependencyMap, //dependency,// delta // OpenMP mod PathCountMap, //path_count,// sigma // OpenMP mod VertexIndexMap vertex_index, ShortestPaths shortest_paths) { typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator; typedef typename graph_traits<Graph>::edge_iterator edge_iterator; typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor; // Initialize centrality init_centrality_map(vertices(g), centrality); init_centrality_map(edges(g), edge_centrality_map); int i, N = num_vertices(g); #pragma omp parallel for default(shared) private(i) schedule(dynamic) for (i = 0; i < N; ++i) { typename graph_traits<Graph>::vertex_descriptor s = vertex(i, g); if (s == graph_traits<Graph>::null_vertex()) continue; // First we build a map of all distances from 's' based // on m_metric_distance_weight. typedef typename boost::property_map < Graph, boost::vertex_index_t >::type CIndexMap; typedef typename boost::iterator_property_map < vertex_descriptor*, CIndexMap, vertex_descriptor, vertex_descriptor& > CPredecessorMap; typedef typename boost::iterator_property_map < float*, CIndexMap, float, float& > CDistanceMap; float co = 2200.0f; std::vector<vertex_descriptor> cut_predecessors(boost::num_vertices(g)); // To store parents std::vector<float> cut_distances(boost::num_vertices(g), std::numeric_limits<double>::max() ); // To store distances CIndexMap cut_indexMap = boost::get(boost::vertex_index, g); CPredecessorMap cut_predecessorMap(&cut_predecessors[0], cut_indexMap); CDistanceMap cut_distanceMap(&cut_distances[0], cut_indexMap); // boost::dijkstra_shortest_paths(g, s, boost::weight_map(get(&EdgeProperties::m_metric_distance_weight, g)).predecessor_map(cut_predecessorMap).distance_map(cut_distanceMap)); /////////// // Local storage for OpenMP std::stack<vertex_descriptor> ordered_vertices; vector_property_map<typename property_traits<IncomingMap>:: value_type,VertexIndexMap> incoming(vertex_index); vector_property_map<typename property_traits<DistanceMap>:: value_type,VertexIndexMap> distance(vertex_index); vector_property_map<typename property_traits<DependencyMap>:: value_type,VertexIndexMap> dependency(vertex_index); vector_property_map<typename property_traits<PathCountMap>:: value_type,VertexIndexMap> path_count(vertex_index); // Initialize for this iteration vertex_iterator w, w_end; for (tie(w, w_end) = vertices(g); w != w_end; ++w) { incoming[*w].clear(); put(path_count, *w, 0); put(dependency, *w, 0); } put(path_count, s, 1); // co - cutoff added. b_centrality is calculated based on // Edge::m_special_weight while we are testing // to be inside the 'cutoff' that is based on the // Edge::m_metric_weight. shortest_paths(g, s, ordered_vertices, incoming, distance, path_count, vertex_index, cut_distances, co); while (!ordered_vertices.empty()) { vertex_descriptor u = ordered_vertices.top(); ordered_vertices.pop(); typedef typename property_traits<IncomingMap>::value_type incoming_type; typedef typename incoming_type::iterator incoming_iterator; typedef typename property_traits<DependencyMap>::value_type dependency_type; for (incoming_iterator vw = incoming[u].begin(); vw != incoming[u].end(); ++vw) { vertex_descriptor v = source(*vw, g); dependency_type factor = dependency_type(get(path_count, v)) / dependency_type(get(path_count, u)); factor *= (dependency_type(1) + get(dependency, u)); put(dependency, v, get(dependency, v) + factor); update_centrality(edge_centrality_map, *vw, factor); } if (u != s) { #pragma omp critical(globalupdate) { update_centrality(centrality, u, get(dependency, u)); } } } } typedef typename graph_traits<Graph>::directed_category directed_category; const bool is_undirected = is_convertible<directed_category*, undirected_tag*>::value; if (is_undirected) { divide_centrality_by_two(vertices(g), centrality); divide_centrality_by_two(edges(g), edge_centrality_map); } } //

1 0

pass asio socket to another class
by cap 05 Jan '15

05 Jan '15

I have two classes SslHandshake and SslRequest with according to names functionality. After client and server handshakes are done in the SslHandshake, I pass both sockets to SslRequest and start transferring data from server to client. 1. If I is not waiting for finishing of transferring, instance of SslHandshake will be destroyed automatically (in the ~SslHandshake I will destroy both socket objects and transferring in the SslRequest will be aborted). 2. If I start transferring with waiting, after a few iterations SslRequest::ReadSocketOut will be called successfully, but the readSocketHandle will not be called (so, will be called but with timeout error). So, I need to handshake in one class and transfer data into another class. How to prevent destroying instance of SslHandshake until data transferring will be done into SslRequest or how to fix socket reading without callback calling after a few iterations? void SslHandshake::HandshakeInHandle(const bSystem::error_code &error) { TRY { CHECK_BOOST_ERROR { LOG_MSG_DEBUG_KEYWORD(KEYWORD_INCOMING, << "Handshake done"); // --- Transfer with waiting of mutex //IoServicePtr servicePointer((IoService *)&m_SocketIn->get_io_service()); //boost::thread serviceThread(boost::bind(&IoService::IO_SERVICE_THREAD_VOID, servicePointer)); //SslRequest::SharedPtr sslRequest(new SslRequest(m_SocketIn, m_SocketOut)); //sslRequest->Transfer(); SslRequest::SocketPtr socketIn(m_SocketIn); SslRequest::SocketPtr socketOut(m_SocketOut); // --- Transfer with waiting of thread //IoServicePtr servicePointer((IoService *)&m_SocketIn->get_io_service()); //servicePointer->SessionIndex = IndexThis; //boost::thread serviceThread(boost::bind(&IoService::IO_SERVICE_THREAD_VOID, servicePointer)); //SslRequest::SharedPtr request = SslRequest::CreateInstance(m_SocketIn, m_SocketOut); //request->Transfer(); //serviceThread.join(); // --- Transfer with waiting of IO_SERVICE_THREAD_VOID IoServicePtr servicePointer((IoService *)&m_SocketIn->get_io_service()); servicePointer->SessionIndex = IndexThis; SslRequest::SharedPtr request = SslRequest::CreateInstance(/*m_SocketIn, m_SocketOut*/socketIn, socketOut INDEX_THIS_PASS); request->Transfer(); servicePointer->IO_SERVICE_THREAD_VOID(); } } CATCH_LOG_STD CATCH_LOG_ANY } void SslRequest::ReadSocketOut(TransferringBuffer &buffer, SimpleSocketCallback readSocketHandle) { bAsIO::async_read( *m_SocketOut, bAsIO::buffer(buffer), boost::bind( readSocketHandle, SHARED_FROM_THIS, baPlaceholders::error, baPlaceholders::bytes_transferred)); } -- View this message in context: http://boost.2283326.n4.nabble.com/pass-asio-socket-to-another-class-tp4670… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

Boost.DateTime library to synthesise time-series data?
by Riskybiz 05 Jan '15

05 Jan '15

Dear boost-users, It's my first time trying this and hope that someone may be able to enlighten me about which aspects of the Boost.DateTime library will help solve this problem... I have some time-series data which is time stamped with boost::posix_time::ptime values. From this base-series I would like to synthesise higher interval time-series. For example, a base-series of 1 second time-series data could be used to synthesise a time-series of any greater interval; 2 seconds, 5 seconds, 86400 seconds (1 day) etc. Or 1 minute base-series data could be used to synthesise, 2 min, 15min, 60 min time-series etc. It is entirely possible that any given base-series time point could be absent i.e. there could be time gaps in the base-series. I have an idea to use boost::posix_time::time_period to create regularly temporally spaced 'buckets' of the required time interval; into which the base-series data elements would accumulate and thus allow the synthesising of the higher interval time-series. Each 'bucket' represents one higher interval time-series data element. It is important that the 'buckets' are aligned with natural multiples of the time interval for which they are accumulating. So for example a 10 second synthesised time-series would have boost::posix_time::time_period 'buckets' like so at: 1-10, 11-20, 21-30, 31-40, 41-50 & 51-60 seconds time_periods. The first data element of the base-series could fall at any time, it could be on the 7th second of a minute, equally it could be on the 59th minute of an hour. Somehow the first boost::posix_time::time_period 'bucket' for a particular synthesised interval must be set such that it spans the correct period of time and ends on a multiple of the time-series interval which is being synthesised. Put simply, that first base-series data element needs to fall into a correctly aligned time_period 'bucket'. Using Boost.Date_Time how could the boost::posix_time::ptime of the first data element of the base-series be examined and the first time_period 'bucket' be correctly aligned to the relevant begin and end times for the synthesised time-series? I envisage subsequent 'buckets' will be created by incrementing forward in time from the datum of the first. With grateful thanks for any assistance, Riskybiz.

2 1

How to build Boost with VC++ 2013 to target XP/2003 platform?
by Caroline Beltran 01 Jan '15

01 Jan '15

Programs written in VC++ 2012 or 2013 will only run on Windows XP or Windows 2003 when you choose the 'Windows XP (v120_xp)' toolset option in the IDE. Is there some way to set this option from Bjam? P.S. A Stack Overflow user indicated that he got Boost to build under VC++ 2012. I tried his solution under VC++ 2013 but it did not work for some reason completely unknown to me. http://stackoverflow.com/questions/27695187/modify-visual-c-vcvars32-bat-to… Apparently, VC++ 2012/2013 use the Windows 8 SDK and the solution above causes you to use the Windows 7 SDK which is compatible with XP and Windows 2003. Please help me

2 2

[boost] [compute] Review results
by Antony Polukhin 01 Jan '15

01 Jan '15

Hi all, Extended review period for Boost.Compute library has ended. Here are the review votes for inclusion (+ means include, - means do not include, +/- means conditional include or "probably include, not quite sure"): + Denis Demidov + Sebastian Schaetz + Pavan Yalamanchili - Gruenke,Matt (+ if more backends will be supported) + Asbjørn (mini-review/comments from a library user) + Thomas M (a lot of suggestions) + Paul A. Bristow + Belcourt, Kenneth + John Bytheway +/- Yiannis Papadopoulos (there's already Bolt/Thrust for beginner and pure OpenCL for pros) +/- Vicente J. Botet Escriba (better docs and more performance tests) +/- Jason Newton (there was no explicit answer to the question "shuld be this library accepted into Boost?" but the review was positive in general) To sum up: Compute library becomes part of the Boost. Great thanks to all for the reviews and comments! Huge work was done and the issues raised are essential for library success. P.S.: Happy new year everyone! P.P.S.: Hope I did not miss some review! In case of any error, please let me know! -- Best regards, Antony Polukhin

1 0

Writing custom allocator for use with extended boost vector
by Olumide 31 Dec '14

31 Dec '14

I am considering using boost::container::vector as an alternative to std::vector because std::vector moves when its capacity is exceeded. This is a problem because I am using a lean stack-like allocator that acquires a pool of memory from the heap and manages it my incrementing or decrementing a pointer to the available memory; and automatically moving the vector in the pool is a big no-no for several reasons chief of which is that such moves invalidate the above pointer. My allocator does not use a header block in order to delineate subsequent allocations. This approach works because my application is recursive i.e. objects are allocated and deallocated in a strict LIFO order. Furthermore allocations are typically small (but not constant size) and and are routinely smaller than the size of the canonical header block consisting of a forward and backward pointer. To use such a header block would IMHO be a waste. I'd like to port this allocator to for use with boost::container::vector but I'm not sure entirely sure how much of the boost::container::allocator interface that I need to implement, or if perchance there is already an allocator that does what I am trying to do. Please advise. Regards, - Olumide

1 0

nowide
by Colin Humphries 30 Dec '14

30 Dec '14

Artyom, Please ignore my request for wifstream and wofstream constructors. I see now that these are not needed: windows accepts UTF-16 filenames so of course I just needed to use widen. I am however surprised that your fstream constructors do not directly accept std::string? I feel that the required .c_str() call should be incorporated. Regards, Colin Humphries

1 0

nowide
by Colin Humphries 29 Dec '14

29 Dec '14

Hello Artyom, Please provide wifstream and wofstream constructors. I realise this request may seem contrary to the spirit of your very useful library but wide streams are required by boost::serialize to output to XML (i.e. UTF-8) (Yes, I agree it might be more sensible to update Boost::Serialize). Regards, Colin Humphries

1 0

[filesystem] ISO TS 18822, Technical Specification - File System
by Beman Dawes 29 Dec '14

29 Dec '14

The filesystem TS has been unanimously approved by ISO. 32 countries voted. The document has been forwarded to the ISO Central Secretariat for publication. The current working draft, which is technically the same as the TS but may have editorial corrections, is available at http://cplusplus.github.io/filesystem-ts/working-draft.html Many thanks to all the Boost folks who contributed so much to the Boost library that became the ISO TS! The C++ standards committee Filesystem Study Group will continue to operate, and will issue further TSes as further proposals dictate, and will continue to publish a working paper as issues for the TS are corrected. Happy Boost New Year, --Beman

1 0

[Serialize] Conflict between Serialize and PIMPL?
by Merrill Cornish 28 Dec '14

28 Dec '14

In a normal PIMPL structure, the visible class is responsible for instantiating the private implementation class when the visible class is instantiated. However, when serialization is restoring objects, /it/ thinks it is responsible for instantiating all classes, including the private implementation classes of a PIMPL structure. Who wins? Do I end up with /two/ instances of the private implementation class, one of which is just hanging in mid-air? If you need a more solid background, here is what I'm doing: _Visible class header_: struct Foo_Private; class Foo { public: Foo(); . . ./other//stuff/ . . . . . . /data member-free serialization//code/ . . . private: *const std::unique_ptr< Foo_Private() > d_ptr**;* }; _Visible class code_: Foo::Foo() : *d_ptr(std::make_unique< Foo_Private >())* {...code to initialize Foo_Private data members...} _Private Implementation class header_: struct Foo_Private{ Foo_Private(); . . . /data member declarations/ . . . . . . /data member serialization code/ . . . }; Private implementation class has no code file. It is a header-only class. One alternative I thought of was to /not/ serialize the private implementation class, even though it contains all of the data member that need serializing. Instead, if the private class has data members, say, bar and baz, then the /visible/ class would have a serialize() function that "reached into" the private object using its d_ptr: template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & d_ptr->bar; ar & d_ptr->baz; } So, the visible class (which has no data members of its own) is serialized using data extracted from/inserted into the private class object. Would serialization-by-proxy work?

2 1

Can't build Boost::atomic
by Rui Pacheco 28 Dec '14

28 Dec '14

I've extracted a number of Boost's sub projects as source into my project using bcp. I've set CMake to find the Boost library under my project and not the one installed on my system:https://gist.github.com/ruipacheco/bae9f6694f5760da90b2 <https://gist.github.com/ruipacheco/bae9f6694f5760da90b2> I'm now trying to build my project but Boost::atomic fails while trying to find a file that indeed has not been extracted: https://gist.github.com/ruipacheco/954d0cf0dbb8ece7db75 <https://gist.github.com/ruipacheco/954d0cf0dbb8ece7db75> Is there a pre-processing step I missed with Boost when extracting the libraries? Why is it referencing a file that doesn't exist? -- Rui Pacheco

1 0

[boost-users][boost/numeric/ublas/matrix.hpp]: How to use SQL query to create boost matrix?
by It neophyte 28 Dec '14

28 Dec '14

Dear all I've read some matrix documentation (see below) and did not experience any difficulty in compiling codes: http://www.boost.org/doc/libs/1_42_0/libs/numeric/ublas/doc/matrix.htm However I am using SQL API to query data from c++, and wondering how I can build a boost price matrix. *Ps*: table contains 3 columns: name (*string* type), date (*datetime* type), price (*double* type) 1/While retrieving the query data, my screen output is as follows: aaaaa 2014-12-22 30.1 aaaaa 2014-12-21 27.7 bbbbb 2014-12-22 13.2 bbbbb 2014-12-21 10.3 ccccc 2014-12-22 80.4 ccccc 2014-12-21 79.9 2/My aim is to create a following price matrix (here 2 by 3) as: 30.1 13.2 80.4 27.7 10.3 79.9 Thanks in advance and Regards

1 0

[Test] Calling BOOST_MESSAGE too early results in malformed xml output from Boost.Test
by Martin Ba 26 Dec '14

26 Dec '14

Hi! First, I'm on 1.44 and won't get around to test it on a newer version any time soon, so I'll just throw it in anyway: I've hit the case that when the executable running boost.test is calling BOOST_MESSAGE from a BOOST_GLOBAL_FIXTURE, the message is generated *before* the unit test runner is full initialized (the message "Running ## test cases..." is displayed *after* the Message). When writing xml output, this means that the `<Message>`is generated before the `<TestLog>` root, resulting in malformed xml. I can fix this quite easily on my side, since I've [customized my logger anyway][1], I'll just have to make sure unit_test_log_formatter::log_start is always called first for the xml case, but it's still a buggy thing imho. cheers, Martin [1] : http://stackoverflow.com/questions/26505229/how-to-log-boost-test-output-to…

2 3

[Serialize] How to serialize a class with NO serializable data
by Merrill Cornish 25 Dec '14

25 Dec '14

I applied the PIMPL idiom to one of my larger classes, and it worked great. The visible class records the API with public functions and NO data member except the pointer to the implementation class. That pointer should not be serialized because it is created automatically when the visible class is instantiated. However, if I put NO serialization code in the visible class, the visible class won't (as I understand it) be instantiated when the archive is loaded. (I'm still far away from the point where I can try the archive load for myself.) Should I define the serialize<> function for the class, but with an empty body, since there are no data members to be saved?

2 1

Re: [Boost-users] [boost] [core] [addressof.hpp] [addressof_test2.cpp] ISO C++ says that these are ambiguous
by Sergey Sprogis 25 Dec '14

25 Dec '14

Peter Dimov wrote: > That's probably because of the __SUNPRO_CC workaround at addressof.hpp line 110: > #if (defined( __BORLANDC__ ) && BOOST_WORKAROUND( __BORLANDC__, > BOOST_TESTED_AT( 0x610 ) ) ) || defined( __SUNPRO_CC ) > return boost::detail::addressof_impl<T>::f( v, 0 ); > #else > return boost::detail::addressof_impl<T>::f( > boost::detail::addr_impl_ref<T>( v ), 0 ); > #endif .... Thanks Peter, Exactly, this is the reason for addressof_test2.cpp test's failure with Oracle Studio 12.4 compiler. The only issue here is that there is 5 months old opened bug with proposed fix to cure this: https://svn.boost.org/trac/boost/ticket/10311 I'd really appreciate it if someone will pay attention to this bug, and will insert proposed simple 1 line fix in trunk area. Thanks, Sergey

1 0

[TEST] Tests registered manually never exectued....
by Witold E Wolski 23 Dec '14

23 Dec '14

Im trying to manually register unit tests following the example at : http://www.boost.org/doc/libs/1_57_0/libs/test/doc/html/utf/user-guide/test… My registration code looks like follows: boost::unit_test::test_suite* init_unit_test_suite(int argc, char* argv[]) { boost::unit_test::test_suite* ts2 = BOOST_TEST_SUITE("test_suite2"); ts2->add(BOOST_TEST_CASE(&liveViewTest)); ts2->add(BOOST_TEST_CASE(&checkImageFormats)); ts2->add(BOOST_TEST_CASE(&testRethrowException)); boost::unit_test::framework::master_test_suite().add(ts2); return 0; } The init_unit_test_suite function is entered and returns but non of the added tests is ever exectued. regards -- Witold Eryk Wolski

2 1

[boost] [compute] Review period extended till December 30 + sum up
by Antony Polukhin 23 Dec '14

23 Dec '14

Hi, Review period of Compute library extended till December 30. Some notes and answers to them that were pointed out during review so far: * Some of the algorithms could be tuned for a specific hardware - Library author is working on a auto-tuning solution and improves existing algos * Why OpenCL C API used instead of C++ API? - C++ API had issues, C API allows a bit more control. No C++ API for OpenCL 2.0 * API is not N4105 compatible, library is not N*** compatible - This could be easily fixed by a library that will use Compute as a backend * Some of the algorithms return futures while other work with command queues - This is because of the OpenCL design + async chains/futures would be probably added later * Not all the types of the Khronos API are supported - A few types are not documented yet, there's a patch in the works which would allow the Khronos C++ types to be passed into Compute algorithms * A few type related errors could be detected at compile time - This will be fixed, more asserts would be added to runtime only checkable places. Report issues to the tracker https://github.com/kylelutz/compute/issues * On small data sets CPU algorithm would work faster than a GPGPU. How about implicitly dispatching algo on CPU in those cases? - The call on whether to execute the algorithm should be left up to the user. While library author agrees that this would be a useful feature, he just don't think Compute is the right place for that logic. * How about providing way to do chains of async operations - This is a big task that will be solved some day. * How about providing Boost.ASIO like error handling via throw and error_code - Implementing an approach like ASIO's wouldn't be that difficult. Thanks to all the reviewers for spending their time and providing useful comments so far! -- Best regards, Antony Polukhin

1 0

interprocess::rbtree_best_fit assertion failure with vector resize
by John Harris 22 Dec '14

22 Dec '14

I encountered this with 1.56 and 1.57 under heavy allocation load where I repeatedly resize an interprocess vector<unsigned char>. The only way I was able to get around it was to switch to the simple_seq_fit allocation algorithm. The assertion is assert(FALSE), and so I'm wondering if the algorithm doesn't handle all cases where there is a single-byte type for the vector. The stack below is from a core dump, and so the "Cannot access memory" errors are not necessarily indicative of bad pointers. #3 0x0000003dc2a2b820 in __assert_fail () from /lib64/libc.so.6 #4 0x00007f869a166793 in boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*>::copy_n_and_update (this=0x7f8698264b80) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/detail/advanced_insert_int.hpp:118 #5 0x00007f869a165fd6 in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_forward_range_insert_expand_backwards<boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*> > ( this=0x7f85adc00a40, new_start=0x7f85adc165a0 <error: Cannot access memory at address 0x7f85adc165a0>, new_capacity=199624, pos=0x7f85adc31974 <error: Cannot access memory at address 0x7f85adc31974>, n=101192, insert_range_proxy=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2783 #6 0x00007f869a164c0b in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_forward_range_insert_no_capacity<boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*> > (this=0x7f85adc00a40, pos=..., n=101192, insert_range_proxy=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2265 #7 0x00007f869a1639ec in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_forward_range_insert<boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*> > (this=0x7f85adc00a40, pos=..., n=101192, insert_range_proxy=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2328 #8 0x00007f869a16241a in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_forward_range_insert_at_end<boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*> > (this=0x7f85adc00a40, n=101192, insert_range_proxy=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2365 #9 0x00007f869a1604e5 in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_resize<boost::container::value_init_t> (this=0x7f85adc00a40, new_size=178780, u=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2151 #10 0x00007f869a15de56 in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::resize (this=0x7f85adc00a40, new_size=178780) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:1213 #

1 0

[Random] normal distribution different behaviour 1.55 vs 1.57
by Thomas M 21 Dec '14

21 Dec '14

Hi, I have just switched an existent project from boost 1.55.0 to 1.57.0 and my test suites diagnosed a divergence in program (a simulation) results. I have tracked down the issue to different behaviour in the normal distribution random variates generator. Below is a simple program (run under VS 2012, Update 4) that outputs random variates for a uniform and a normal distribution; comparing the output between 1.55.0 and 1.57.0 it turns out that the first bunch of uniformly distributed variates is identical, and then all others variates (both bunches of normally distributed variates as well as the second bunch of uniformly distributed variates) diverge. Neither for 1.56.0 nor 1.57.0 does the change-log list an update to the random numbers library, so first I am puzzled why the libraries behave differently (though [Math] has undergone some changes -> propagation to [Random]?). Second, it is not clear to me why for the first bunch of uniformly distributed variates the results are identical, while for the second, after normally distributed variates were generated, the are not. It appears that the generation of normally distributed variates changes the whole state of the random numbers engine in a different manner [e.g multiple engine calls ??]. Any insight into what is going on here is much appreciated. And foremost: Is any of 1.55 or 1.57 bugged, that is one should be clearly preferred over the other? many thanks, Thomas #include <ostream> #include <iostream> #include <fstream> #include "boost/random.hpp" void test_rng() { typedef boost::mt19937 rnengine_t; typedef boost::uniform_01<double> uniform_distr_t; typedef boost::normal_distribution<double> normal_distr_t; typedef boost::variate_generator<rnengine_t &, uniform_distr_t> uniform_gen_t; typedef boost::variate_generator<rnengine_t &, normal_distr_t> normal_gen_t; uniform_distr_t uniformDistr; normal_distr_t normalDistr(0, 1); rnengine_t rnEngine; rnEngine.seed(100); uniform_gen_t uniformGen(rnEngine, uniformDistr); normal_gen_t normalGen(rnEngine, normalDistr); std::ofstream outFile("randomNumbers.txt"); outFile.precision(16); int n = 20; for (int outer = 0; outer < 2; ++outer) { for (int i = 0; i < n; ++i) outFile << "Uniform-distr variate #" << (n*outer) + i + 1 << ": " << uniformGen() << std::endl; for (int i = 0; i < n; ++i) outFile << "Normal-distr variate #" << (n*outer) + i + 1 << ": " << normalGen() << std::endl; } } int main() { test_rng(); return 0; }

5 8

Boost.container iterator_traits and flat_map
by gast128 21 Dec '14

21 Dec '14

Hello all, I have a problem here which boils down to the non-constness of iterator_traits for const_iterator of flat_map: void Foo() { typedef boost::container::flat_map<int, int> Int2IntFmap; Int2IntFmap::const_iterator it2; std::iterator_traits<Int2IntFmap::const_iterator>::value_type::first_type& r2 = it2->first; } 1>d:\develop\shared\main\test\testcommon\testgeneral\nctstgenhmhandlemap.cpp(59): error C2440: 'initializing' : cannot convert from 'const int' to 'int &' Anyone an idea or should I use decltype instead?

1 0

[multi_index] any interests extending ord_index_node to argumented ord_index_node
by fractal 19 Dec '14

19 Dec '14

dear all: i'm a game developer, and my projects used a lot of multi_index(thanks, it's a great library). one of main problems of game development is to rank players according to they level. usually we use boost::interprocess::map for the task. but more, players should know which rank they are and who is at rank 10000 (for example). these requirements lead to two new methods for map: iterator find_by_rank(int idx) int rank(iterator i) i implemented an argumented rbtree data structure according to "Algorithms and Data Structures " (see the attachment rank_tree.hpp), and latter i find coutertree which is in boost review schedule. but IMHO, the best way is to integrate it to multi_index, and if anyone interests, i can do this by some efforts. yours sincerely

1 0

RFC: library for fractal algorithms
by legalize+jeeves＠mail.xmission.com 17 Dec '14

17 Dec '14

[Please do not mail me a copy of your followup] I'm interested in talking with other folks about the best way to generalize various fractal algorithms in the style of the standard library: iterators, containers and algorithms. If there are any libraries that already exist that apply to this sort of code, I'd love to hear about them. Most fractals consist of iterating a sequence for a point in the complex plane. The iterating sequence is parameterized for each point in the complex plane and some characteristic of the iterating sequence is used to color that point. The result is an image. For instance, the classic Mandelbrot fractal is: z <- z^2 + c z0 := 0 The complex number 'c' changes for each point in the complex plane. This sequence is iterated until norm(z) > 4, or some maximum iteration count is reached. Pixels in the image correspond to each value of 'c' and are typically colored according to the number of iterations needed until norm(z) exceeded 4. There are a couple things that make for interesting variation in the algorithms used in rendering fractal images: - choice of formula to iterate in the complex plane - parameters for deciding the "bailout" criteria: - iteration counts - predicate function on z, i.e. [](complex<float> z){ return norm(z) > 4; } Iterating until the bailout test passesis the simplest mechanism, but there are gains to be made by applying more sophisticated mechanisms. A significant optimization is to look for cycles in the sequences. With very large iteration counts, detecting cycles in the iteration can save significant amounts of time. The cycle detection algorithm is basically from Knuth and isn't specific to fractals but ends up being mixed together with the Mandelbrot set computation in most programs. This seems to be another opportunity to use generic composition in order to apply this orthogonal feature to any iterated formula in the complex plane. I did a little experiment casting the Mandelbrot formula as an iterator and got the code at the end of this message. Ideally I'd like to explore approaches that result in code that is ignorant of the underlying representation of a complex number in order to have algorithms that can be applied to arbitrary precision numeric types. My little experiment works, but even just looking at this little experiment makes me think that the mandelbrot iterator is doing too much: it is performing the z <- z^2 + c business, but it is also doing the bailout test and these seem to be separate responsibilities. #include <complex> #include <iostream> #include <iterator> #include <vector> class mandelbrot : public std::iterator< std::input_iterator_tag, std::complex<float>, unsigned> { public: mandelbrot() : c_{}, iter_{}, max_iter_{}, bailout_{}, z_{}, bailed_out_{true} { } mandelbrot(std::complex<float> const& c, int max_iter = 256, float bailout = 2.0f) : c_{c}, max_iter_{max_iter}, bailout_{bailout*bailout}, iter_{0}, z_{0.f, 0.f}, bailed_out_{false} { } mandelbrot& operator++() { z_ *= z_; z_ += c_; bailed_out_ = ++iter_ > max_iter_ || std::norm(z_) >= bailout_; return *this; } bool operator==(mandelbrot const& rhs) const { if (bailed_out_ && rhs.bailed_out_) { return true; } if (bailed_out_ != rhs.bailed_out_) { return false; } return z_ == rhs.z_; } std::complex<float> const& operator*() const { return z_; } private: std::complex<float> c_; int const max_iter_; float const bailout_; int iter_; std::complex<float> z_; bool bailed_out_; }; bool operator!=(mandelbrot const &lhs, mandelbrot const &rhs) { return !(lhs == rhs); } int main() { float const r_min = -3.0f; float const r_max = 1.0f; float const i_min = -2.0f; float const i_max = 2.0f; std::vector<float> imag; imag.resize(24); for (int y = 0; y < 24; ++y) { imag[y] = i_min + (i_max - i_min)*(23 - y)/24.0f; } std::vector<float> real; real.resize(80); for (int x = 0; x < 80; ++x) { real[x] = r_min + (r_max - r_min)*x/80.0f; } std::string printables; for (int i = 32; i < 128; ++i) { printables.push_back(char(i)); } for (int y = 0; y < 24; ++y) { float const im = imag[y]; for (int x = 0; x < 80; ++x) { float const re = real[x]; mandelbrot end; mandelbrot it{std::complex<float>{re, im}}; unsigned count = std::distance(it, end); std::cout << printables[count % printables.size()]; } std::cout << '\n'; } } -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

1 1

c++/cli & file.h
by It neophyte 16 Dec '14

16 Dec '14

hi quick question: could boost headers (.h) be complied in c++/cli project? I was told, no by someone, but need further feedback to be sure. Thanks

10 13

[endian] Heads up: breaking name changes coming
by Beman Dawes 15 Dec '14

15 Dec '14

Boost.Endian develop branch is about to have major changes merged in as part of the preparation for a mini-review. AFAICR, the breaking changes are limited to header, class, and function name changes, but there are a lot of hopefully non-breaking changes so I could easily be wrong about that. If you are currently using Boost.Endian develop branch, you will need to change your code accordingly. It would make sense to wait a few days until the mini-review merge is complete and any fixes required by regression test failures are fixed. Thanks for your patience, --Beman

1 0

Does shared_ptr support interface pointers without a virtual destructor
by John Selbie 15 Dec '14

15 Dec '14

What is the general guidance with using shared_ptr on interfaces that do not have virtual destructor? Take the following code sample: class IFoo{public: virtual void M1() = 0;}; class Foo : public IFoo{public: void M1() {} Foo() { std::cout << "Foo constructor\n";} ~Foo(){std::cout << "~Foo destructor\n";}}; I think we all know that this is not safe: { IFoo *pFoo = new Foo(); delete pFoo;} Since IFoo is missing a virtual destructor, then ~Foo() will not be invoked in the above case. So let's switch to using std::shared_ptr { std::shared_ptr<IFoo> spFoo(new Foo());} std::shared_ptr has a templated constructor that creates a "deleter". So when "spFoo" goes out of scope, the ~Foo destructor is properly invoked even though it's of type shared_ptr<IFoo>. But since my code targets older compilers, I have made use of Boost. But attempting this: { boost::shared_ptr<IFoo> spFoo(new Foo());} Generates a lot of scary warnings when compiling with -Wall. In file included from /home/jselbie/boost_1_57_0/boost/checked_delete.hpp:15:0, from /home/jselbie/boost_1_57_0/boost/smart_ptr/shared_ptr.hpp:26, from /home/jselbie/boost_1_57_0/boost/shared_ptr.hpp:17, from main.cpp:9:/home/jselbie/boost_1_57_0/boost/core/checked_delete.hpp: In instantiation of ‘void boost::checked_delete(T*) [with T = Foo]’:/home/jselbie/boost_1_57_0/boost/smart_ptr/detail/shared_count.hpp:134:38: required from ‘boost::detail::shared_count::shared_count(Y*) [with Y = Foo]’/home/jselbie/boost_1_57_0/boost/smart_ptr/shared_ptr.hpp:271:47: required from ‘void boost::detail::sp_pointer_construct(boost::shared_ptr<X>*, Y*, boost::detail::shared_count&) [with T = IFoo; Y = Foo]’/home/jselbie/boost_1_57_0/boost/smart_ptr/shared_ptr.hpp:349:58: required from ‘boost::shared_ptr<T>::shared_ptr(Y*) [with Y = Foo; T = IFoo]’main.cpp:36:44: required from here/home/jselbie/boost_1_57_0/boost/core/checked_delete.hpp:34:5: warning: deleting object of polymorphic class type ‘Foo’ which has non-virtual destructor might cause undefined behaviour [-Wdelete-non-virtual-dtor] Now despite the warning about the non virtual destructor, the correct behavior of having ~Foo() invoked works. The interesting thing is that marking the destructor of the *derived* class (virtual ~Foo) makes the warning go away. It's like it's warning me that if I ever inherit from Foo, then I might run into issues - not of any immediate problems. Should I never user shared_ptr with interface pointers that lack a virtual destructor? Always declare a virtual destructor? What is the guidance here? jrs

2 1

[boost] [compute] Review period starts today December 15, 2014, ends on December 24, 2014
by Antony Polukhin 15 Dec '14

15 Dec '14

Dear All, Review of the Compute library starts today on Mon 25st of December 2014 and will last for ten days. The Compute library provides a C++ interface to multi-core GPGPU and CPU computing platforms based on OpenCL. The project is hosted on GitHub at https://github.com/kylelutz/compute. Docs are available at http://kylelutz.github.io/compute/ Sources could be downloaded as a ZIP archive via https://github.com/kylelutz/compute/archive/master.zip Some pre-official reviews could be found in Boost Library Incubator: http://rrsd.com/blincubator.com/reviews/?library_id=669 Please, answer the following questions in your review: 1. What is your evaluation of the design? 2. What is your evaluation of the implementation? 3. What is your evaluation of the documentation? 4. What is your evaluation of the potential usefulness of the library? 5. Did you try to use the library? With what compiler? Did you have any problems? 6. How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 7. Are you knowledgeable about the problem domain? And finally, every review should answer this question: 8. Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. -- Best regards, Antony Polukhin

1 0

[endian] Boost.Endian library added for 1.57.0
by Beman Dawes 14 Dec '14

14 Dec '14

The library provides integer and floating point types and conversion functions for portable byte ordering regardless of processor endianness. Although the primary uses are for file or network I/O, it is also useful for unaligned integers or floats, or for 3, 5, 6, and 7 byte integers. The library's predecessors have been in use for thirty years and developed independently multiple times. The repository is https://github.com/boostorg/endian The documentation is online at https://boostorg.github.io/endian/ See https://boostorg.github.io/endian/index.html#Release-history for changes since the Formal Review. No need to report "Inspection Report" problems; those will be cleaned up before 1.57.0 ships. Please do report any other problems or concerns, since the time between now and when the 1.57.0 beta ships in effect acts a mini-review period. If anyone has access to a big-endian platform with a modern C++ compiler, please, please run the endian test suite and report the results. All testing and use in recent years has been on little-endian platforms, so big-endian platform testing is a worry. Thanks for you patience, --Beman

3 2

:typedef mt19937, normal_distribution, variate_generator & data storage into vector
by It neophyte 14 Dec '14

14 Dec '14

hi all, does someone know why my vstore vector returns a 0 value? any suggestion to improve the code would be appreciated.cheers. *aim*: *generating 260 random numbers following a standard normal distribution, then store the values into a vector (here: vstore)* vector<double>vstore; vstore.resize(260); typedef mt19937 ALEA; typedef normal_distribution<double> STGAUSSIAN; typedef variate_generator<ALEA,STGAUSSIAN> GENALEA; ALEA ale; STGAUSSIAN stgauss(0,1); GENALEA gen(ale,stgauss); for (int i=0;i<=260;i++) { //cout<<gen()<<endl; //system("pause"); vstore.push_back(gen()); cout<<vstore[i]<<endl; }

2 2

[serialization] slow compile times with archive register_type
by Elizabeta 14 Dec '14

14 Dec '14

Hi I am using custom archive classes. Problem is BOOST_CLASS_EXPORT_GUID is not working with the custom archive classes, i.e I am getting unregistered class exceptions all over the place, when saving derived class with base pointer. Here is link to my question http://boost.2283326.n4.nabble.com/BOOST-CLASS-EXPORT-GUID-with-custom-arch… about this. So I found other way for exporting the classes, i.e with archive register type. Exporting the classes with register_type is working well, no more unregistered_class exceptions, but probelm is it increase the compile times of my project by more than half. Project compile time with register_type is 40-45 minutes, and without 18-19 minutes. Here is how I am using the register_type : //RegisterMyTypes.h template<class Archive> void register_all_types(Archive&); //RegisterMyTypes.cpp #include "A.h" #include "B.h" // other classes includes template<class Archive> void register_all_types(Archive& a) { ar.register_type (); ar.register_type(); ..... all other classes which is maybe 100 } // explicit instiantion of all my archive classess template void register_all_types(XmlWOArchive& ar); template void register_all_types(XmlWIArchive& ar); template void register_all_types(DbgXmlWOArchive& ar); template void register_all_types(DbgXmlWIArchive& ar); template void register_all_types(BinaryOArchive& ar); template void register_all_types(BinaryIArchive& ar); template void register_all_types(CloneBinaryOArchive & ar); template void register_all_types(CloneBinaryIArchive & ar); template void register_all_types(DuplicateBinaryOArchive & ar); template void register_all_types(DuplicateBinaryIArchive & ar); I am calling register_all_types before doing the serialization/deserialization. And I am doing the serialization/deserialization in multiple functions in my project not just in one place, but this should not be problem, I mean I have the registration done only in one cpp file i.e RegisterMyTypes.cpp, so the templates should be instantiated only in this file, and it should be slow, right ? Thank you for any help -- View this message in context: http://boost.2283326.n4.nabble.com/serialization-slow-compile-times-with-ar… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

Re: [Boost-users] Using static code checkers against the Boost code base
by Niall Douglas 13 Dec '14

13 Dec '14

On 11 Dec 2014 at 13:38, boost-users(a)lists.boost.org wrote: > I was given some time to implement automated nightly testing for > Boost.Thread which is now integrated and appears as a dashboard on > https://github.com/boostorg/thread/tree/develop. > > I'll mux in the clang and MSVC static analysers later today. This now done, and as can be seen on the Boost.Thread CI dashboard we currently see 30 of 90 build targets have problems. We'll get to fixing those over the next few days. After that we'll hopefully keep everything all blue from now on. Thanks for raising the problem, it caused resources to be made available. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 0

[Test] Reviving BOOST_*_CLOSE_COLLECTIONS request
by Ghyslain Leclerc 13 Dec '14

13 Dec '14

Hello, We are in the process of creating unit tests for our in-house application development and have selected Boot.Test as a library. I’ve been toying with the library for a while now and there is one feature that I feel is missing. It is the capacity to check a whole collection for close values, i.e. the “close” equivalent of BOOST_*_EQUAL_COLLECTIONS. From what I can tell, this has already been discussed (old threads from 2007 http://boost.2283326.n4.nabble.com/Boost-Test-request-BOOST-CLOSE-COLLECTIO…) and did not end-up in the library (at least from what I can tell from my version of boost (1.57). Other more recent threads (2012, http://boost.2283326.n4.nabble.com/test-BOOST-TEST-universal-testing-tool-t…) seem to suggest that the library is undergoing under the hood changes (I might be wrong here). So this request might be completely inappropriate, given the timing. Nevertheless, I have come up with an implementation for those macros. I wanted to share them here on the list (code at the end of the mail). It might be useful for some people. If Gennadiy (library maintainer) reads this mail and finds the macros adequate for use, great. If not, too bad. Anyhow, thanks. Ghyslain namespace boost_hlp { template <typename Left, typename Right> inline ::boost::test_tools::predicate_result close_coll_impl( Left lt_begin, Left lt_end, Right rt_begin, Right rt_end, ::boost::test_tools::percent_tolerance_t<double> tolerance ) { ::boost::test_tools::predicate_result res( true ); ::std::size_t pos = 0; for( ; lt_begin != lt_end && rt_begin != rt_end; ++lt_begin, ++rt_begin, ++pos ) { if( !(::boost::test_tools::check_is_close( *lt_begin, *rt_begin, tolerance )) ) { res = false; res.message() << "\nMismatch in a position " << pos << ": " << *lt_begin << " != " << *rt_begin; } } if( lt_begin != lt_end ) { std::size_t r_size = pos; while( lt_begin != lt_end ) { ++pos; ++lt_begin; } res = false; res.message() << "\nCollections size mismatch: " << pos << " != " << r_size; } if( rt_begin != rt_end ) { std::size_t l_size = pos; while( rt_begin != rt_end ) { ++pos; ++rt_begin; } res = false; res.message() << "\nCollections size mismatch: " << l_size << " != " << pos; } return res; } } // namespace boost_hlp #define CLOSE_COLLECTIONS_IMPL( L_begin, L_end, R_begin, R_end, tolerance, TL ) \ BOOST_TEST_TOOL_IMPL( \ check_impl,\ ::boost_hlp::close_coll_impl( (L_begin), (L_end), (R_begin), (R_end), \ ::boost::test_tools::percent_tolerance_t<double>((tolerance) )), "", TL, CHECK_EQUAL_COLL ), \ 5, \ BOOST_STRINGIZE( L_begin ), BOOST_STRINGIZE( L_end ), \ BOOST_STRINGIZE( R_begin ), BOOST_STRINGIZE( R_end ),\ BOOST_STRINGIZE( ::boost::test_tools::percent_tolerance_t<double>((tolerance) ) ) ) \ /**/ #define WARN_CLOSE_COLLECTIONS( L_begin, L_end, R_begin, R_end, tolerance ) \ CLOSE_COLLECTIONS_IMPL( (L_begin), (L_end), (R_begin), (R_end), (tolerance), WARN ) #define CHECK_CLOSE_COLLECTIONS( L_begin, L_end, R_begin, R_end, tolerance ) \ CLOSE_COLLECTIONS_IMPL( (L_begin), (L_end), (R_begin), (R_end), (tolerance), CHECK ) #define REQUIRE_CLOSE_COLLECTIONS( L_begin, L_end, R_begin, R_end, tolerance ) \ CLOSE_COLLECTIONS_IMPL( (L_begin), (L_end), (R_begin), (R_end), (tolerance), REQUIRE )

3 3

Re: [Boost-users] [Test] Reviving BOOST_*_CLOSE_COLLECTIONS request
by Ghyslain Leclerc 13 Dec '14

13 Dec '14

> Hello, > > We are in the process of creating unit tests for our in-house application > development and have selected Boot.Test as a library. ?I?ve been toying > with the library for a while now and there is one feature that I feel is > missing. ?It is the capacity to check a whole collection for close values, > i.e. the ?close? equivalent of BOOST_*_EQUAL_COLLECTIONS. Devel Boost.Test can do much better: BOOST_AUTO_TEST_CASE(foo) { vector<float> a, b; BOOST_TEST( a == b, tolerance(1e-5) ); BOOST_TEST( a <= b, percent_tolerance = 1e-5 ); } BOOST_TEST_DECORATOR( -tolerance = 1e-7 ) BOOST_AUTO_TEST_CASE(goo) { vector<float> a, b; BOOST_TEST( a > b ); BOOST_TEST( a != b ); } e.t.c. Gennadiy Gennadiy, thanks for pointing it out and taking the time to answer. I had read some of that in the archive threads. When is the devel Boost.Test expected to become the main version ? How can I get the devel version of the code ? Sorry if these seem like newbie questions. Again, thanks for the info. Ghyslain

2 1

Thread prioritization on OSX
by Alexander Carôt 13 Dec '14

13 Dec '14

Hello all, according to this: http://www.boost.org/doc/libs/1_57_0/doc/html/thread/thread_management.html #thread.thread_management.tutorial.attributes I tried to change the thread priority to SCHED_RR on OS X via: boost::thread::attributes attrs; pthread_attr_setschedpolicy(attrs.get_native_handle(), SCHED_RR); sendThread = boost::thread(attrs,&sender::sendItThreadFunction,this); In that context I noticed that get_native_handle is not known so I used attr.native_handle(), which compiled ok but finally threw an error here: /boost/boost/bind/bind.hpp:313:9: Type 'boost::thread_attributes' does not provide a call operator I am still using boost 1.45 and wonder if this is the actual problem or if something else is wrong. Any help appreciated, thanks Alex Am 20.11.14 10:53 schrieb "Ben Pope" unter <benpope81(a)gmail.com>: >On Thursday, November 20, 2014 05:27 PM, Alexander Carôt wrote: >> Hello all, >> >> is it correct that boost does not offer thread prioritization ? > >There's nothing directly on the interface. > >> I am dealing with an application with a number of threads, which all >> depend on the realtime-scheduled sound card callback thread. >> >> These threads must have the same realtime scheduling priority. >> >> Is there a way to achieve this ? > >Basically there's a platform specific back door: native_handle. > >http://www.boost.org/doc/libs/1_57_0/doc/html/thread/thread_management.htm >l#thread.thread_management.tutorial.attributes > >Ben > > > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 9

BOOST_CLASS_EXPORT_GUID with custom archive
by Elizabeta 13 Dec '14

13 Dec '14

Hi I am using boost 1.49. I have custom archives derived from the boost binary archives. However it seems that when using BOOST_CLASS_EXPORT_GUID the types are not actually registered for the custom archive types, and I am getting unregistered_class exception when serializing derived class from base pointer. If I am using the boost binary original archives this is not the case. My custom archive classes are defined in in its own header file and at the end of the file I am including BOOST_SERIALIZATION_REGISTER_ARCHIVE, according to this in the documentation : " The newly created archive will usually be stored in its own header module. All that is necessary is to include the header and construct an instance of the new archive. EXCEPT for one special case. Instances of a derived class are serialized through a base class pointer. Such instances are not "registered" neither implicitly nor explicitly. That is, the macro BOOT_CLASS_EXPORT is used to instantiate the serialization code for the included archives. To make this work, the following should be included after the archive class definition. #define BOOST_SERIALIZATION_REGISTER_ARCHIVE(Archive) Failure to do this will not inhibit the program from compiling, linking and executing properly - except in one case. If an instance of a derived class is serialized through a pointer to its base class, the program will throw an unregistered_class exception." here is my archive h file : ------------------- customarchive.h -------------------- #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_oarchive_impl.hpp> #include <boost/archive/binary_iarchive_impl.hpp> #include <boost/archive/shared_ptr_helper.hpp> class CloneBinaryIArchive : // don't derive from binary_oarchive !!! public boost::archive::binary_iarchive_impl< CloneBinaryIArchive, std::istream::char_type, std::istream::traits_type >, public boost::archive::detail::shared_ptr_helper { typedef CloneBinaryIArchive derived_t; typedef boost::archive::binary_iarchive_impl< CloneBinaryIArchive, std::istream::char_type, std::istream::traits_type > base_t; public: CloneBinaryIArchive(std::istream & is,unsigned int flags = 0) : base_t(is, flags) {} CloneBinaryIArchive(std::streambuf & bsb, unsigned int flags = 0) : base_t(bsb, flags) {} int foo; }; BOOST_SERIALIZATION_REGISTER_ARCHIVE(CloneBinaryIArchive) and here is the cpp file in each I am registering all classes : -------------- register.cpp --------------- #include "customarchive.h" #include <boost/serialization/export.hpp> #include "A.h" BOOST_CLASS_EXPORT_GUID(A,"A") -- View this message in context: http://boost.2283326.n4.nabble.com/BOOST-CLASS-EXPORT-GUID-with-custom-arch… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

share_ptr and Container compilation error on new version
by JB 13 Dec '14

13 Dec '14

Hello all, I'm trying to build an application. This isn't an app that I wrote but rather inherited. I'm currently porting it from Fedora 15 to Fedora 20. It compiled well on gcc 4.6.3 with boost 1.46.0. However, Fedora 20 has gcc 4.8.3 and boost 1.54. I'm new to boost and have never used it before but it looks very comprehensive. As far as I know boost/shared_ptr is the only header this component of the application is including. I'm wondering if boost changes might be causing this or maybe gcc changes but it's difficult to tell from the documentation and I'm a little under the gun at the moment. This code: template<typename Container> class DefinableVectorFinalizer: public XmlFinalizer { typedef typename Container::value_type contained_value_type; typedef typename Container::value_type::value_type value_type; .... } g++ is throwing this error which seems to have some sort of problem with Container::value_type::value_type: ../../../../../devel/include/xcl/io/DefinableVectorFinalizer.h:31:54: error: no type named ‘value_type’ in ‘xclApp::DefinableVector<boost::shared_ptr<simApp::Project> >::value_type {aka class boost::shared_ptr<mainApp::Project>}’ typedef typename Container::value_type::value_type value_type; xclApp::DefinableVector looks like this: class DefinableVector { public: typedef typename std::vector<T>::size_type size_type; typedef typename std::vector<T>::value_type value_type; typedef value_type& reference; typedef const value_type& const_reference; typedef typename std::vector<T>::iterator iterator; typedef typename std::vector<T>::const_iterator const_iterator; .... } Any insight into this would be hugely appreciated!!!

3 4

intrusive bug: equal_range implementation vs bounded_range precondition
by Matei David 12 Dec '14

12 Dec '14

In the absence of a bug tracker, I'll post the potential bug here: I'm seeing some strange results out of `multiset::equal_range`. I didn't isolate a test case, but looking at the code something seems wrong: The `bstree_algorithms::equal_range(const KeyType &, KeyValueCompare)` method is currently implemented (in `bstree_algorithms.hpp`) as a call to `bstree_algorithms::bounded_range(header, key, key, comp, true, true)`. However, `bounded_range` states as prerequisite: If 'lower_key' == 'upper_key', ('left_closed' or 'right_closed') must be false. Either the `equal_range` implementation or the `bounded_range` precondition is wrong. Matei

2 3

[Math] advice using brent_find_minima()
by dariomt＠gmail.com 12 Dec '14

12 Dec '14

I'd like to find the root of a function f (find x such that f(x) = 0). Should I pass abs( f ) to brent_find_minima()? I can't find examples... Thanks in advance!

4 6

bug tracker not working
by Matei David 12 Dec '14

12 Dec '14

The bug tracker stopped working for me. I tried to post a new bug, and I'm getting a captcha error message below. However, the web interface doesn't display any captcha for me to solve (!?) I tried both Google Chrome & Firefox on Linux. (I disabled various ad blocker extensions.) === Captcha Error Submission rejected as potential spam (StopForumSpam says this is spam (ip)) Trac thinks your submission might be Spam. To prove otherwise please provide a response to the following. === I've seen this message before, with the exact same problem (no captcha), when in the past I had tried to include a (legitimate) link in a bug post. However, after obfuscating the link I was able to post without this error. Now I can't any more. Can somebody look into this? Thanks, Matei

1 0

Flags for strongly typed enum?
by TONGARI J 11 Dec '14

11 Dec '14

Hi there, Is there any library in Boost that provides type-safe enum bit flags? Something like below: enum class option { a = 1, b = 2, c = 4, .... }; DEFINE_FLAGS(options, option); options set1 = option::a | option::b; options set2 = set1 | option::c; options err1 = option::a | 2; // error options err2 = set2 | 2; // error if (set1 & option::a) {...} if (set1 & 2) {...} // error Thanks.

1 0

boost MSM
by Raj Sambasivan 10 Dec '14

10 Dec '14

Hi Christophe, I have been using boost msm, i have two state machines each with around 30 transitions / 4 regions , no submachine etc for now... it perfectly fits the bill on what im trying to do, thanks for the great library, one issue i face is ,the debug build takes for ever to compile and the size is very big (the optimized one with no debug symbol compiles pretty fast) and when errors happens the compiler (template barf) goes for pages and pages .. any hints on this please? thanks -raj

4 5