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

[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() { … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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 = … [View More]

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. // … [View More]

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<… [View More]

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<U>. I was curious if there was a way to add the same functionality for std::unique_ptr<U>. 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.… [View More]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[" << i << "]: " << foos[i] << std::endl; } //--- THE FOLLOWING WON'T COMPILE // cbegin/cend const std::vector<double> 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 [View Less]

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 … [View More]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. [View Less]

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 … [View More]

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 … [View More]

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/… [View More]

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. … [View More]

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 "… [View More]

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 … [View More]

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 … [View More]

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 … [View More]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 [View Less]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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:… [View More]

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-… [View More]

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 … [View More]

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 <… [View More]

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 = "[%… [View More]

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 … [View More](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 [View Less]

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, &… [View More]

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.… [View More]

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 … [View More]

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 … [View More]

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(… [View More]

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> { … [View More]

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 … [View More]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); } } // [View Less]

1 0