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

Query on Boost.DLL
by Leo Carreon 21 Feb '16

21 Feb '16

Hi, I have been reading the Boost.DLL documentation. Can a single plugin support multiple API’s? If yes, when the multiple API’s are used at the same time; will there be only one instance of the plugin loaded or will there be multiple instances loaded? Regards, Leo

2 1

Boost.DLL
by Leo Carreon 21 Feb '16

21 Feb '16

Hi, Can anyone please let me know what the status of the Boost.DLL library is? Regards, Leo

2 1

[coroutine] - only std exceptions are caught from coroutines
by Tamas.Ruszkai＠leica-geosystems.com 21 Feb '16

21 Feb '16

3 4

[Interprocess] Communication between x86 and x64 issue
by Toni Neubert 19 Feb '16

19 Feb '16

I want to communicate between different platforms using boost interprocess. I am using vc12 and boost 1.58 on windows 7. My code below is a very simple example, that should work. But it doesn't for communications between different platforms... If I create it in x64 and open in win32, the process stuck at a lock at function try_based_lock in boost/int/sync/detail/common_algorithms.hpp In the other way around: win32 create, x64 open: the process crashes at name_length in segment_manager_helper.hpp while trying to find the name in index (priv_generic_find in segment_manager). #include <iostream> #include <boost/interprocess/managed_shared_memory.hpp> int main() { namespace bip = boost::interprocess; // open in WIN32, create in x64 #ifdef _WIN32 bip::managed_shared_memory msm(bip::open_only, "TestIPC"); #elsif X64 bip::shared_memory_object::remove("TestIPC"); bip::managed_shared_memory msm(bip::create_only, "TestIPC", 4096); msm.construct<uint32_t>("Data")[1](10); #endif // Get Data and print it auto data = msm.find<uint32_t>("Data"); if (data.second == 1) { std::cout << *data.first << std::endl; } std::cin.ignore(); return 0; } Does anybody have experience in this? Thank you in advance!

3 2

Re: [Boost-users] [Serialization] This compiles; but does it work?
by Bjorn Reese 19 Feb '16

19 Feb '16

On 02/19/2016 04:20 AM, Merrill Cornish wrote: > Can anyone tell me if this will work, or do I need to implement the > serialize() function? When you are doing different things for the input and output archives then it is better to split serialization into load and save: #include <boost/filesystem/path.hpp> #include <boost/serialization/split_free.hpp> namespace boost { namespace serialization { template <typename Archive> void serialize(Archive& ar, filesystem::path& p, const unsigned int version) { split_free(ar, p, version); } template<class Archive> void save(Archive & ar, const filesystem::path& p, unsigned int version) { ar << p.string(); } template<class Archive> void load(Archive & ar, filesystem::path& p, unsigned int version) { std::string data; ar >> data; p = data; } }}

2 1

[graph] Search algorithm using quality metric rather than distance
by rleigh＠codelibre.net 19 Feb '16

19 Feb '16

I have an adjacency_list graph (shown in attached dot file). Each edge has an attached "quality metric" as a bundled property. Similar to the dijkstra_shortest_paths algorithm, I'd like to determine the optimal path. However, this algorithm sums the distance along each edge, and finds the shortest path. What I'd like to do is *multiply* the quality metric for each edge in the path, and find the largest one. A perfect path will have a quality metric of 1.0, while suboptimal paths will have values tending towards zero, and the more "bad" edges the smaller the number. I'll likely then look at the number of edges and then select the shortest of the candidates. It seems like a simple algorithm that might already be included, but I just haven't found it yet not knowing its formal name. If anyone has any suggestions, I'd be very grateful. Many thanks, Roger

5 4

[Serialization] This compiles; but does it work?
by Merrill Cornish 19 Feb '16

19 Feb '16

mGraphFile is a data member of type boost:filesystem::path, which isn't (as I understand) handled natively by Boost Serialization. I could define template<class Archive> void serialize(Archive& ar, boost::filesystem::path& p, const unsigned int version); but it is needed in only one place. Below is an excerpt from an inline serialization function that I'm already using. While it has a redundant step not needed for loading and a different redundant step not needed for storing, it would seem to do what I need. (The minor inefficiency of the redundant statements is of no concern here.) ... std::string str = mGraphFile.string(); // redundant if loading ar & BOOST_SERIALIZATION_NVP(str); mGraphFile = str; // redundant if saving ... Can anyone tell me if this will work, or do I need to implement the serialize() function? Merrill Cornish

1 0

boost::msm usage: how to set properties of target states
by spiritwalker 18 Feb '16

18 Feb '16

States in my fsm has different properties. I define a event which will invoke a transition to a target state. I want to set properties of target by event data. My choices are: 1. set properties in the action or guard: but it is still in the source state. I fill not good if i set the target state properties at the time 2. set properties in the target entry: but the value of properties have been calculated in guard on receiving the event so i should recalculated again :( Any one can give me more ideas. Thanks ! -- View this message in context: http://boost.2283326.n4.nabble.com/boost-msm-usage-how-to-set-properties-of… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

SERIALIZE: Registering derived templete classes serialized via base ptr
by Unger, Jörg 17 Feb '16

17 Feb '16

I'm trying to serialize a derived class via a base ptr using boost serialize. The example to illustrate the problem (without templates) is as follows //****************** Main.cpp ********************** #include <fstream> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include "Derived.h" int main(int argc, char* argv[]) { std::string fileName = "Out.txt"; Derived myDerived; Base* myBasePtr = &myDerived; //myDerived.foo(); // serialize it as txt std::ofstream ofs(fileName.c_str(), std::ios_base::binary ); boost::archive::text_oarchive ota ( ofs, std::ios::binary ); //ota & boost::serialization::make_nvp(std::string("directly derived").c_str(), myDerived);; ota & boost::serialization::make_nvp(std::string("via base ptr").c_str(), myBasePtr);; return 0; } //*********************************************** //*************** Base.h ************************* #pragma once #include <boost/serialization/access.hpp> #include <boost/serialization/export.hpp> class Base { friend class boost::serialization::access; public: Base(){}; virtual ~Base(){}; template<class Archive> void serialize(Archive & ar, const unsigned int version) {}; }; BOOST_CLASS_EXPORT_KEY(Base) //*********************************************** //**************** Derived.h ********************** #pragma once #include <boost/serialization/access.hpp> #include <boost/serialization/export.hpp> #include "Base.h" class Derived : public Base { friend class boost::serialization::access; public: Derived(){}; void foo(); template<class Archive> void serialize(Archive & ar, const unsigned int version); }; BOOST_CLASS_EXPORT_KEY(Derived) //*********************************************** //**************** Derived.cpp ******************** #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include "Derived.h" //Derived::Derived() //{} void Derived::foo() { } // serializes the class template void Derived::serialize(boost::archive::text_oarchive & ar, const unsigned int version); template void Derived::serialize(boost::archive::text_iarchive & ar, const unsigned int version); template<class Archive> void Derived::serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Base); } BOOST_CLASS_EXPORT_IMPLEMENT(Derived) //*********************************************** When compiling the above code and linking the object files, everything works fine. When I combine everything in a library (in this example it is essentially only Derived.o) and link the main file with the library, I get an error what(): unregistered class - derived class not registered or exported The problem seems to be that the registration in the linked library is not activated. The problem is simplified here, because in our implementation, the derived class is essentially a template class that does not have any cpp-files. We have just added another otherwise empty cpp file with the registration of all possible instantiations of the class. There are several possibilities to solve the problem · The macro BOOST_CLASS_EXPORT_IMPLEMENT(Derived) could be moved to the main.cpp. This workaround is not my preferred options, since the registration has to be done in every main file we want to use the library for. · The macro BOOST_CLASS_EXPORT_IMPLEMENT(Derived) could be moved to the Base.cpp (the constructor for the base class has to be implemented in this file as well). This is another option, but this requires the header files of the derived classes to be included in Base.cpp, which is not convenient either. · Serialize one object of the derived class before serialization through the pointer, but that's only a workaround. (see the commented line in Main.cpp) · Call the foo method in Main.cpp. Surprisingly, this does not depend on whether the foo function is implemented in Derived.cpp, but also if it is called in Main.cpp. Surprisingly, if "myDerived.foo();" in Main.cpp is uncommented the program works fine, which is something I do not understand. It seems that the registration is only performed, if one of the functions in this cpp file is actually called, or am I wrong? · Implement the constructor of Derived in Derived.cpp. This approach works fine for the current example (somehow similar to the previous solution). However, in our case, Derived is a template and thus the constructor can't be implemented in the cpp file. · Another option is to always link the main file with the library and the object file Derived.o, but this is also not a convenient option. · Finally, a manual registration with register_type is possible. This could be moved to a separate subroutine that is always called in different main files. What is the recommended way of registering derived template classes that are serialized through a base ptr within a library. Best regards, Jörg F. Unger

2 1

[Timer] unresolved external symbol boost::chrono::time_point
by Aman Wardak 17 Feb '16

17 Feb '16

Env: Win7 32-bit running in VirtualBox on Macbook Pro Compiler: MS Visual Studio 14 It's my first time working with Boost. I've followed the instructions here: http://www.boost.org/doc/libs/1_60_0/more/getting_started/windows.html I've compiled Boost successfully: ============================ The Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: C:\Users\IEUser\Documents\boost_1_60_0 The following directory should be added to linker library paths: C:\Users\IEUser\Documents\boost_1_60_0\stage\lib ============================================== I've added the above paths in Visual Studio and was able to run the test in step 6 of the instructions linked above to verify my environment is set up correctly. MY PROBLEM: I'm trying to compile the very first sample code at this link: http://www.boost.org/doc/libs/1_60_0/libs/timer/doc/cpu_timers.html I get the following error: ------ Build started: Project: BoostExample, Configuration: Debug Win32 ------ Source.cpp libboost_timer-vc140-mt-gd-1_60.lib(cpu_timer.obj) : error LNK2019: unresolved external symbol "public: static class boost::chrono::time_point<class boost::chrono::steady_clock,class boost::chrono::duration<__int64,class boost::ratio<1,1000000000> > > __cdecl boost::chrono::steady_clock::now(void)" (?now@steady_clock @chrono@boost@@SA?AV?$time_point@Vsteady_clock@chrono@boost@@V?$duration@ _JV?$ratio@$00$0DLJKMKAA@@boost@@@23@@23@XZ) referenced in function __catch$??1auto_cpu_timer@timer@boost@@QAE@XZ$0 C:\Users\IEUser\Documents\Visual Studio 2015\Projects\CS2370\Debug\BoostExample.exe : fatal error LNK1120: 1 unresolved externals ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== Thanks, Aman

1 0

[Test] BOOST_CHECK_EXCEPTION error message still vague
by Merrill Cornish 17 Feb '16

17 Feb '16

In BOOST_1_59_0, I complained that the error message from BOOST_CHECK_EXCEPTION was indecipherable. In BOOST_1_60_0, things improved a lot. But it still leave you hanging. I use the function fail_msg() as the predicate argument to BOOST_CHECK_EXCEPTION. If it finds a specified substring in the exception message, it returns true. Otherwise, it returns false. Below is an error message from BOOST_CHECK_EXCEPTION when the predicate returned false: exception "std::runtime_error" raised as expected: validation on the raised exception through predicate "fail_msg" The first clause says my code raised the expected exception class. That part of the message is clear and unambiguous. The second clause, however, is a non-sequitur. It seems to only acknowledge that there was a predicate named "fail_msg" without saying whether it returned true or false. Overall, the whole message doesn't say whether BOOST_CHECK_EXCEPTION passed or failed. Since a message was output, the user can assume things did not go well, but it seems like the message could be more explicit. Merrill Cornish

2 2

multiprecision max and et_on
by Daniel Brake 16 Feb '16

16 Feb '16

Hi Boost, I would like to be able to use the Eigen linear algebra library with Boost.Multiprecision with et_on. However, as noted here: https://svn.boost.org/trac/boost/ticket/11149 for max, et_on isn't compatible out of the box. Aside from writing my own little overload for max for the particular form being produced in my line of code from within Eigen, does anyone have a fix for enabling max with expression templates on? MWE: { using mpfr = boost::multiprecision::mpfr_float; // et_on by default, which is what i want using std::max; mpfr a(1), b(2), c(4); auto q = b*b+c; mpfr r = max(a,q); } Thanks a lot, Daniel

1 0

[GIL] Why doesn't pixel assignment color-convert?
by Stonewall Ballard 16 Feb '16

16 Feb '16

I've just started using boost.gil, though I've been looking at it for a while. It seems odd to me that assignment doesn't do an implicit color_convert() when the pixels are of different types. Instead, it just copies matching channels. That's the wrong thing to do when assigning an rgba pixel to an rgb pixel, since the former is straight and the latter is premultiplied. It also seems wrong that you can assign an rgba pixel to an rgb pixel, but not vice-versa. It looks like this is caused by pixels_are_compatible in gil_concept.hpp, where it fails to check that both pixels have the same number of channels. Instead, it matches channels of the output pixel against the input pixel, ignoring any extra input pixel channels. It also ignores scoped_channel_value usage. This seems like an error waiting to happen. Comments? - Stoney

1 0

ASIO: add work and remove immed., will ignore further handler_requests???
by aj neu 16 Feb '16

16 Feb '16

Hi, below is some code where boost::asio::io_service::work is added, and then immediately removed. After that, I call async_wait on a steady_timer, but it does not work: io.run() RETURNS IMMEDIATELY, and IGNORES the async_wait. Is this intended? (I was rather surprised, because I thought that the async_wait would schedule new work, but it does not work). If I cange the code-line #define WEIRD_BEHAVIOUR to #undef WEIRD_BEHAVIOUR then I have my expected behaviour. Thanks, ajneu #include <iostream> #include <chrono> #include <experimental/optional> #include <boost/asio.hpp> #include <boost/asio/steady_timer.hpp> #define WEIRD_BEHAVIOUR int main() { boost::asio::io_service io; std::experimental::optional<boost::asio::io_service::work> work; #ifdef WEIRD_BEHAVIOUR work.emplace(io); work = std::experimental::nullopt; #endif boost::asio::steady_timer timer(io, std::chrono::milliseconds{1000}); timer.async_wait([](const boost::system::error_code &ec) { std::cout << ((!ec) ? "done" : "err") << std::endl; }); io.run(); }

1 0

Writing a stratum client using boost:asio
by Jan Willem Penterman 11 Feb '16

11 Feb '16

Hi, I'm trying to write a stratum client for a cryptocurrency mining application. The mining application connects to a stratum server to receive new work to mine on and submit solutions. The stratum protocol is a simple TCP based line protocol with JSON payload. Documentation here: https://mining.bitcoin.cz/help/#!/manual/stratum-protocol I've chosen to use boost::asio, as boost is already heavily used in the fork of the project I'm building the miner for. But I'm having difficulties to understand why my current implementation doesn't work. The basic flow is as follows: 1. connect to the server. this works 2. send subscribe method. this also works 3. authorize worker(s). doesn't work. 4. stratum server should start pushing new work periodically. doesn't work. 5. submit solution when found. not implemented yet. Without authorization, the server should still start pushing work. So I've skipped step 3 for now. The source code as I have it now is available here: https://github.com/Genoil/cpp-ethereum/blob/stratum/libstratum/ The output I get from this is as follows: i 12:19:14|<unknown> Connected to stratum server coinotron.com : 3344 i 12:19:15|<unknown> {"error": null, "id": 1, "result": [["mining.notify", "91d0025c5ea54509977e3475d065169e"], "080016D0", 4]} i 12:19:15|<unknown> Subscribed i 12:19:15|<unknown> { "id": null, "method": "mining.set_difficulty", "params": [32768]} i 12:19:15|<unknown> mining.set_difficulty i 12:19:15|<unknown> {"params": ["31065", "0xc09361c52e9dddd141040cc79c52eaed382e92c1dd350324c040482a4c4ac0fa","0x5a46dd85298b0beff65ccf3006c4b5d2f7fa6ca8a5885a7f2132714fe7a48602","0x0000000200000000000000000000000000000000000000000000000000000000", true], "id": null, "method": "mining.notify"} i 12:19:15|<unknown> mining.notify >From this I can conclude that the subscription call works. Then at the end of handleResponse, I simply queue up a new async_read_until to wait for the next line of JSON to come in from the server. This also kind of works, but the idea is that after a few seconds, new work should come in as a "mining.notify". This never happens. Can anybody explain what I'm doing wrong? Regarding the mining.authorize call on line 113. I've understood from the documentation that I can send that whenever I want, so I tried to do this immediately after the subscribe method returned. But if I do this, it a) doesn't return and b) all lines after "Subscribed" don't come in any longer. This is the second problem I'm trying to figure out. I'm using this as reference, but my Python is even worse than my C++ https://github.com/slush0/stratum-mining-proxy But when I run the binaries connecting to the same host (coinotron.com:3344), I do get new work coming in... Thanks for having a look at this.

1 0

[ASIO] Newbie question - Bidirectional communication example
by Davies, John 11 Feb '16

11 Feb '16

For a simple explanation I have two processes that run on the same computer. Process 1 sends messages to Process 2 by putting the messages into an Interprocess message queue that Process 2 created. Process 2 sends messages to Process 1 by putting the messages into an Interprocess message queue that Process 1 created. The messages can be sent at any time and are not in response to each other. Very symmetrical. Now I want to put Process 1 and Process 2 on separate computers. My intent is to transfer the messages over TCP to the opposite computer without changing Process 1 or 2. So I thought I'd create two connector programs. Connector 1 creates a message queue that pretends to be the Process 2 message queue. When it gets a message, it send it over TCP the Connector 2. Connector 2 gets the message and puts it into the real Process 2 message queue. And the reverse if Process 2 has an outgoing message. I just can't find a good example to steal from. Everything I can find are more like Process 1 makes a request and Process 2 responds. So I think I have a fundamental misunderstanding of how ASIO works. ________________________________ The information contained in this message may be confidential and legally protected under applicable law. The message is intended solely for the addressee(s). If you are not the intended recipient, you are hereby notified that any use, forwarding, dissemination, or reproduction of this message is strictly prohibited and may be unlawful. If you are not the intended recipient, please contact the sender by return e-mail and destroy all copies of the original message.

2 1

[Test] Funny Business with vector::at() out-of-range
by Merrill Cornish 11 Feb '16

11 Feb '16

I posted a question a couple of days ago: "Throws 'Escaping' both BOOST_CHECK_THROW and try{}". I found that BOOST_CHECK_EXCEPTION which is working for me elsewhere fails the same way. So, an out-of-range std::vector::at() seems to be the common element. In the definition of at(), the out-of-range response is handled by __throw_out_of_range_fmt(). When I looked up that one, I found void __throw_out_of_range_fmt(const char*, ...) __attribute__((__noreturn__)) __attribute__((__format__(__gnu_printf__, 1, 2))); in functexcept.h. To my admittedly less-than-expert eye, there doesn't seem to be an actual throw() here. On the other hand, the entire file are entries like this for various exceptions. There are a lot of Google hits for __throw_out_of_range_fmt, but they are for unresolved references in links, apparently caused by mixed version of libraries and object. Everything I've got is compiled linked for MinGW 64-bit, GCC 5.3.0, 64-bit --std=C++14, BOOST 1_60_1 64-bit so I get none of those errors. The problem I'm seeing with my test code is that wrapping a try{} around BOOST_CHECK_THROW shows that [1] the body of the try doesn't complete; but at the same time [2] not even a catch(...) can catch the presumed throw--as if a throw isn't actually being done. So, where did the throw go? Merrill Cornish

2 1

[TEST] Throws "Escaping" both BOOST_CHECK_THROW and try{}
by Merrill Cornish 11 Feb '16

11 Feb '16

I'm running Windows 10, 64-bit; MinGW 64-bit; GCC 5.3 64-bit; and BOOST 1_60_1 Here is the relevant test code: [319] BOOST_CHECK_THROW(throw std::out_of_range("BOOST_CK_THROW test"), std::out_of_range); [320] try { [321] std::cerr << "arcsSize()" << std::endl; [322] empty1.arcsSize(Operand::DEFAULT_ARC_SET+1); [323] std::cerr << "arcsSize() did not throw" << std::endl; [324] }//try [325] catch (const std::out_of_range& ex) [326] { std::cerr << "out_of_range caught=|" << ex.what() << "|" << std::endl; } [327] catch (...) { std::cerr << "something else caught" << std::endl; } [328] [329] BOOST_CHECK_THROW(empty1.arcsSize(Operand::DEFAULT_ARC_SET+1), std::out_of_range); The original code was just the last line, line [329]. [319]-[327] was added in an attempt to characterize the problem. The error [329] got by itself was: terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_range_check: __n (which is 1) >= this->size() (which is 1) This application has requested the Runtime to terminate it in an unusual way. Please contact the application's support team for more information. SIGABRT intercepted; converted to exit(EXIT_FAILURE). arcSize() is implemented with std::vector::at() and the index is out-of-range, so it's supposed to throw std::out_of_range. That's what was detected, so why did it terminate the program? (The last line comes from my SIGABRT handler. Without it, the test executable ends up locked and can't be deleted.) Adding in all of the test lines shown above gives; [319] Operand_Test.cpp(319): info: check 'exception "std::out_of_range" raised as expected' has passed [321] arcsSize() terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_range_check: __n (which is 1) >= this->size() (which is 1) This application has requested the Runtime to terminate it in an unusual way. Please contact the application's support team for more information. SIGABRT intercepted; converted to exit(EXIT_FAILURE). Notice the explicit throw in line [319] is detected and handled properly. However, the arcSize() call from inside the try block throws, but is not caught by even catch(...) {}. Can anyone help me see what's going on here? Merrill Cornish

2 6

[Container] Regarding Trac #11957, static_vector::max_size() is higher than the capacity
by Gagan Kumar 10 Feb '16

10 Feb '16

I tried a simple fix for https://svn.boost.org/trac/boost/ticket/11957 here https://github.com/boostorg/container/pull/37/files . Can someone please review it. Regards,Gagan Kumar

1 0

Boost Variant Type Interfaces
by Ali Nakipoglu 09 Feb '16

09 Feb '16

Hi, In our project we are using boost, boost.variant very extensively. We was using methods provided by the library to interface with Variant types. Mainly : get<T>( variant ) for accessing stored values and variant.which() == Index for checking currently stored type. Overtime we realized we can improve this as : variant.getT() for accessing stored values much more nicer to write and variant.isT() or variant.which() == WHICH_T for checking currently stored type which does not depend on order of template paramters in the Variant definition. Also in some cases we wanted to be able to add type specific methods for example in our case we are using subscript operator to access recursively stored Variants variant[ "a" ].isT() or variant[ 0 ].asT() We generalized this solution for our project and published at https://github.com/FictionIO/WrappedVariant I would like to hear your comments. Do you think its a correct approach or useful? Any suggestions are welcome! Kind Regards, Ali

1 0

[Multiprecision] Runtime assertion failure with clang++3.6.0 but not g++4.9.2
by mbw_bst＠mailbox.org 09 Feb '16

09 Feb '16

Dear all, this is my first post on this mailing list, so hopefully this will all be by the book. Executing the following minimal working example, which is supposed to calculate "3! == 6" via (1) a template function (2) a class template and save the result in a boost::multiprecision::mpz_int, results in unexpected behavior for clang++3.6.0, with the version of my boost library being 1.59.0. The program displays the correct result using g++4.9.2 however: #include <iostream> #include <boost/multiprecision/gmp.hpp> namespace bm = boost::multiprecision; template <std::size_t N> bm::mpz_int factorial() { return N * factorial<N-1>(); } template<> bm::mpz_int factorial<0>() { return 1; } template <std::size_t N> struct factorial2 { static const bm::mpz_int value; }; template<std::size_t N> const bm::mpz_int factorial2<N>::value = N * factorial2<N-1>::value; template<> struct factorial2<0> { static const bm::mpz_int value; }; const bm::mpz_int factorial2<0>::value = 1; int main () { std::cout << factorial<3>() << '\n'; std::cout << factorial2<3>::value << '\n'; return 0; } The output for clang, having been compiled via clang++ -std=c++14 -stdlib=libc++ -DNDEBUG -o main main.cpp -lgmp will result in: 6 0 However, omitting the NDEBUG flag will trigger an assertion failure: main: /usr/include/boost/multiprecision/gmp.hpp:1296: const mpz_t &boost::multiprecision::backends::gmp_int::data() const: Assertion `m_data[0]._mp_d' failed. Aborted (core dumped) Compiling the same program with g++4.9.2 (with or without "-DNDEBUG") yields the expected result: 6 6 What did I miss? Can this behavior indeed be traced down to Boost.Multiprecision, or does it have to do with the initialization order of static const class members? Or something else? Additionally, both variants work correctly with clang when using a built-in type like 'int'. Any help in understanding the problem on hand would be greatly appreciated! Best Regards, mbw

3 5

Re: [Boost-users] [Multiprecision] Runtime assertion failure with clang++3.6.0 but not g++4.9.2
by mbw_bst＠mailbox.org 09 Feb '16

09 Feb '16

Hello again and thanks for your replies! Taking the following two statements into account: > For type int, the values are computed recursively at compile time, for a > user-defined-type the values are computed at runtime and you hit > initialization-order issues. > Seems to be that Multiprecision relies on static data that haven't > (necessarily) been initialized before your own static members. Works > fine > if the members are made non-static: Does that mean that, since a) boost::multiprecision::number<gmp_int> is not constexpr enabled, and b) static initialization can't happen at compile-time for user-defined types, that there is no way for me to initialize a variable of this type at compile-time? Does b) follow logically from a) ? I (believe to have) confirmed runtime-initialization by running valgrind, which showed the presence of dynamic memory allocations (and also jumps depending on uninitialized variables, which probably corresponds to the assertion failure). I am mentioning this because initially my little test program looked somewhat like this: #include <iostream> #include <vector> #include <boost/multiprecision/gmp.hpp> namespace bm = boost::multiprecision; template<std::size_t N> struct factorial { static const bm::mpz_int value; static void add_values(std::vector<bm::mpz_int>& vec) { factorial<N-1>::add_values(vec); vec.push_back(value); } }; template<std::size_t N> const bm::mpz_int factorial<N>::value = N * factorial<N-1>::value; template<> struct factorial<std::size_t{0}> { static const bm::mpz_int value; static void add_values(std::vector<bm::mpz_int>& vec) { vec.push_back(value); } }; const bm::mpz_int factorial<0>::value = 1; int main () { std::vector<bm::mpz_int> fac_table{}; factorial<10'000>::add_values(fac_table); std::cout << "Enter a number between 0 and 10'000 to calculate factorial:"; std::size_t number; std::cin >> number; std::cout << '\n' << number << "! == " << fac_table[number] << '\n'; return 0; } This still includes the "unsafe" static initialization of a user-defined type. However it compiles and runs via g++ -ansi -std=c++14 -O3 -Wall -Wextra -pedantic -static -save-temps -ftemplate-depth-50000 -DNDEBUG -o main main.cpp -lgmp -pthread This was what made me believe in the compile-time computation of the factorials in the first place, since using this version, valgrind does not show any dynamic memory allocation at all. On the other hand, I don't understand what's going on here really, especially since std::vector<> is supposed to allocate memory at run-time. Now I'm not sure whether the last example has anything to do with Boost.Multiprecision anymore, so while it would really make my day if you could help me better understand this, I will understand if this is not the right place to ask these questions. Thanks again for your replies so far, they have been of great help! Cheers, Max

2 1

[gsoc16] ATTN: Project ideas deadline 19th Feb
by Niall Douglas 07 Feb '16

07 Feb '16

Tomorrow 8th February the application period for Google Summer of Code 2016 begins, and yet we have just *one* idea on the ideas page: https://svn.boost.org/trac/boost/wiki/SoC2016 We need *plenty* more if we are to be approved again this year as a Google Summer of Code org, the deadline for which is the 19th February. So if you have some project ideas and think you could mentor a student this summer, *please* consider adding a project idea to the ideas list or stepping forward with a list of Boost libraries or topics you'd be willing to mentor. Our thanks in advance. --- Boost C++ Libraries Google Summer of Code 2016 admin https://svn.boost.org/trac/boost/wiki/SoC2016

1 0

download from sourceforge?
by Dan Bloomquist 07 Feb '16

07 Feb '16

I followed the link form boost.org and then through sourceforge. But sourceforge directed me to: <http://downloadbud.com/?adprovider=sourceforge_fwint&source=fw36_300x250-do…> The link is an executable! I've never heard of 'downloadbud'. Not a big deal for now, I'm running with 1.58. But I'd like to get the latest of spirit x3 before I ask questions on the spirit list that may not need asking. Is there another source for boost? Or, is this executable actually a safe extractor? Sourceforge handing over an exe when it should be be a package seems just wrong... Thanks, Dan.

2 5

Boost and v8
by Daniel Burchardt 06 Feb '16

06 Feb '16

Hi, I try create v8 module to python used boost and i have problem: #include <iostream> using namespace std; #include <stdio.h> #include <stdlib.h> #include <string.h> #include "include/libplatform/libplatform.h" #include "include/v8.h" using namespace v8; const char* say_hello(const char* name) { return name; } #include <boost/python/module.hpp> #include <boost/python/def.hpp> #include <boost/python/class.hpp> using namespace boost::python; BOOST_PYTHON_MODULE(hello) { class_<V8, boost::noncopyable>("V8", no_init) .def("Initialize", &V8::Initialize).staticmethod("Initialize"); def("say_hello", say_hello); } compile process is ok but when i try import hello in python i see error: /hello.so: undefined symbol: _ZN2v82V810InitializeEv Thanks for help

2 1

[MSM][MPL] Can't compile FSM with > 20 transitions (solved)
by Carlos Santos 05 Feb '16

05 Feb '16

Hi there, I am using boost v1.59 and I am having trouble in compiling a MSM state machine with more than 20 transitions. I followed the Q&A and added the following lines BEFORE any boost include: #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #define BOOST_MPL_LIMIT_VECTOR_SIZE 30 // or whatever you need #define BOOST_MPL_LIMIT_MAP_SIZE 30 // or whatever you need but now instead of getting the previous error: error: wrong number of template arguments (21, should be 20) I get this one: /usr/local/include/boost/multi_index/tag.hpp:75:67: error: wrong number of template arguments (30, should be 20) mpl::vector<BOOST_PP_ENUM_PARAMS(BOOST_MULTI_INDEX_TAG_SIZE,T)>, I was just finishing this email when I found a solution. Adding only the following header #include "boost/mpl/vector/vector30.hpp" and explicitly declaring the transition table as a numbered mpl::vector (yep you have to count the rows...) struct transition_table : mpl::vector21< ... > solves the problem. Can you suggest me a better solution for this? Thanks! *Carlos Santos *

1 0

[Test] BOOST_CHECK_EQUAL can't compare scoped enumerations
by Merrill Cornish 05 Feb '16

05 Feb '16

I'm running Windows 10, 64-bit, MinGW64 with GCC 5.3 64-bit, and BOOST_1_60_0 64-bit. Here is the stripped down version of what's failing: enum class UsedFor { NOTIFY_INPUT, CONST_INPUT, VAR_INPUT, NOTIFY_RESULT, VAR_RESULT}; UsedFor mUse = UsedFor::NOTIFY_INPUT; BOOST_CHECK(mUse == Operand::UsedFor::NOTIFY_INPUT); // BOOST_CHECK_EQUAL(mUse, Operand::UsedFor::NOTIFY_INPUT); If BOOST_CHECK_EQUAL() is commented out, BOOST_CHECK() complies and executes without error. However, // BOOST_CHECK(mUse == Operand::UsedFor::NOTIFY_INPUT); BOOST_CHECK_EQUAL(mUse, Operand::UsedFor::NOTIFY_INPUT); If BOOST_CHECK() is comment out, BOOST_CHECK_EQUAL() gets a template barf with the general comment, " template argument deduction/substitution failed:". Here are some of the complaints: D:\Boost_1_60_0/boost/test/tools/detail/print_helper.hpp:50:14: note: cannot convert 't' (type 'const DiGSE::Operand_Class_Test_Suite::Operand_Default_Constructor_Test::test_method()::UsedFor') to type 'std::_Setw' ostr << t; ^ D:/Program Files/mingw-w64/x86_64-5.3.0-posix-seh-rt_v4-rev0/mingw64/x86_64-w64-mingw32/include/c++/iomanip:208:5: note: candidate: template<class _CharT, class _Traits> std::basic_ostream<_CharT, _Traits>& std::operator<<(std::basic_ostream<_CharT, _Traits>&, std::_Setprecision) operator<<(basic_ostream<_CharT, _Traits>& __os, _Setprecision __f) D:\Boost_1_60_0/boost/test/tools/detail/print_helper.hpp:50:14: note: cannot convert 't' (type 'const DiGSE::Operand_Class_Test_Suite::Operand_Default_Constructor_Test::test_method()::UsedFor') to type 'std::_Setprecision' ostr << t; ^ At this point, it seems to be complaining about every io manipulator in existence. D:\Boost_1_60_0/boost/test/tools/detail/print_helper.hpp:50:14: note: mismatched types 'const std::piecewise_linear_distribution<_RealType>' and 'const DiGSE::Operand_Class_Test_Suite::Operand_Default_Constructor_Test::test_method()::UsedFor' ostr << t; Then it gets to the point of, apparently, dragging out all of the error messages it doesn't get to use very often: mismatched types*'const std::chi_squared_distribution<_RealType>' *and 'const DiGSE::Operand_Class_Test_Suite::Operand_Default_Constructor_Test::test_method()::UsedFor' ostr << t; ^ For the time being, I can simply use the explicit == check, but it looks like there's a problem here. Merrill Cornish

2 3

[ANN] build2 - C++ build toolchain
by Boris Kolpackov 03 Feb '16

03 Feb '16

Hi, build2 is an open source, cross-platform toolchain for building and packaging C++ code. It includes a build system, package manager, and repository web interface. We've also started cppget.org, a public repository of open source C++ packages. This is the first alpha release and currently it is more of a technology preview rather than anything that is ready for production. We have tested this version on various Linux'es, Mac OS, and FreeBSD. There is no Windows support yet (but cross-compilation is supported). The project's page is: https://build2.org For those who need to see examples right away, here is the introduction: https://build2.org/build2-toolchain/doc/build2-toolchain-intro.xhtml Enjoy, Boris

1 0

BOOST_LOG_TRIVIAL destination change
by Marc Paschover 02 Feb '16

02 Feb '16

I am working on a native Excel add-in (using XLW+), and I have been using Boost.Logging to output some diagnostic information, using BOOST_LOG_TRIVIAL. I would like to see this information in the Output window of Visual Studio. It seems like I somehow need to change the destination to boost::logging::destination::dbg_window, but I haven't been able to figure out a way to do this globally. Is there a way to do this? Thanks, Marc.

1 0

Boost 1.60: boost::archive::iterators bug?
by Ernest Zaslavsky 02 Feb '16

02 Feb '16

Hi, Recently I've noticed that Base64 encoded data produced by implementation I use and implementation used by chromium project sometimes are not the same. It happened only once but it was enough for me to start worrying. The implementation is quite simple, and I guess borrowed it from somewhere, like SO or something. The code as following: using it_base64_t = bai::base64_from_binary<bai::transform_width<std::string::const_iterator, 6, 8>>; namespace bai = boost::archive::iterators; auto writePaddChars = (3 - input.length() % 3) % 3; std::string base64(it_base64_t(input.begin()), it_base64_t(input.end())); base64.append(writePaddChars, '='); simple and elegant. However, today I wrote a short test which takes a chapter from 'Alice's Adventures in Wonderland' and encodes it. As well, I used two different online encoder to encode the same text, both online encoders produce the same data. However above code produced the same code until character 1029 and then it is different from what it should be. Then later, it gets back to the same output as produced by online encoders. So my question is, any chance it is a bug in archive::iterators or it is something in the above code? Coliru is down, so, full code is here http://pastebin.com/JxMsMeV2 [Read More]<http://feeds.feedburner.com/~r/sizmek-blog/~6/1> [http://www.sizmek.com/Sizmek.png]<http://www.sizmek.com/>

1 0

Building Boost 1.60 with VS2015 - 32 bit compiler is always selected
by Tiago Gehring 01 Feb '16

01 Feb '16

Hi, I'm trying to build Boost 1.60 with Visual Studio 2015 Update 1 in 64-bit mode but it seems to be ignoring the address-model=64 parameter and always builds a 32-bit version (I called b2 from the VS2015 Native tools for x64 command prompt): -- C:\Users\Tiago\code\boost_1_60_0>*b2 --toolset=msvc-14.0 variant=release link=static threading=multi address-model=64 architecture=x86* Performing configuration checks *- 32-bit : yes* - arm : no - mips1 : no - power : no - sparc : no - x86 : yes .... C:\Users\Tiago\code\boost_1_60_0>*cl* Microsoft (R) C/C++ Optimizing Compiler *Version 19.00.23506 for x64* Copyright (C) Microsoft Corporation. All rights reserved. usage: cl [ option... ] filename... [ /link linkoption... ] --- I saw in some ond discussion mentions to explicitly select the compiler version (I also have VS2010 and VS2012 installed) and environment variables batch file (in the project-config.jam file) but this didn't help either. Any help is really appreciated. Best regards, Tiago Gehring

4 4

Re: [Boost-users] asio: implementing sock->receive like behavior eith async_read_some
by Bjorn Reese 01 Feb '16

01 Feb '16

On 01/28/2016 01:56 PM, Lloyd wrote: > I am using asio to read some data from SSL socket. asio tcp socket > implements a "receive" function, but ssl socket doesn't have an > implementation for "receive". In the code sample given below I wish to > implement this kind of behavior. > > eg > > { > ... > sock.async_read_some(...); > //continue the execution only after the above call finishes. > } Why are you using an asynchronous operation instead of simply calling ssl::stream::read_some()?

2 1

C++Now 2016 Registration is Open
by Jon Kalb 28 Jan '16

28 Jan '16

Boost Users, Registration is now open for this year¹s C++Now (put on by Boost). http://cppnow.org/2016-conference/announcements/2016/01/28/registration-is-o pen.html The conference has sold out the last three years and is expect to do say again this year. Do not put off registering. Note that session submitters should not register until they receive instructions from Marshall Clow, our conference registrar. See you in Aspen! Jon

1 0

asio: implementing sock->receive like behavior eith async_read_some
by Lloyd 28 Jan '16

28 Jan '16

Hi, I am using asio to read some data from SSL socket. asio tcp socket implements a "receive" function, but ssl socket doesn't have an implementation for "receive". In the code sample given below I wish to implement this kind of behavior. eg { ... sock.async_read_some(...); //continue the execution only after the above call finishes. } Whats the best way to do this? I tried "future" but the code blocks/dead locks some how, The I tried "spawn", but in this case also I don't know the method to wait for the coroutine to finish. Some tips are greatly appreciated. Thanks, Lloyd

1 0

[Boost.LexicalCast] problem with 1.59 in Solaris
by dariomt＠gmail.com 28 Jan '16

28 Jan '16

Trying to compile file libs/date_time/src/gregorian/greg_month.cpp I get an error related to Boost.LexicalCast. I have reduced the problem to a minimal test case: #include <string> #include <boost/lexical_cast.hpp> void f(const char* s) { std::string s1(boost::lexical_cast<std::string>(s)); } My feeling is that this compiler has problems in the specializations for boost::detail::is_stdstring and boost::detail::is_char_array_to_stdstring. If I remove all those specializations the error goes away. I assume this is not the perfect solution because I guess this will miss some optimization of lexical_cast, but at least I can compile it this way :( Is there a better solution for this? Has this problem been fixed in 1.60? Error message (full instantiation stack available if needed): "/ThirdPartyLibs/boost/1_59_0/boost/lexical_cast/try_lexical_convert.hpp", line 146: Error: Ambiguous partial specialization for boost::detail::is_char_array_to_stdstring<std::string, const char*>, boost::detail::is_char_array_to_stdstring<boost::container::basic_string<boost::detail::CharT, boost::detail::Traits, boost::detail::Alloc>, const boost::detail::CharT*> and boost::detail::is_char_array_to_stdstring<std::basic_string<boost::detail::CharT, boost::detail::Traits, boost::detail::Alloc>, const boost::detail::CharT*>. "/ThirdPartyLibs/boost/1_59_0/boost/lexical_cast.hpp", line 42: Where: While instantiating "boost::conversion::detail::try_lexical_convert<std::string, const char*>(const char*const&, std::string &)". "/ThirdPartyLibs/boost/1_59_0/boost/lexical_cast/try_lexical_convert.hpp", line 134: Error: Ambiguous partial specialization for boost::detail::is_stdstring<std::string>, boost::detail::is_stdstring<boost::container::basic_string<boost::detail::CharT, boost::detail::Traits, boost::detail::Alloc>> and boost::detail::is_stdstring<std::basic_string<boost::detail::CharT, boost::detail::Traits, boost::detail::Alloc>>. "/ThirdPartyLibs/boost/1_59_0/boost/lexical_cast.hpp", line 42: Where: While instantiating "boost::conversion::detail::try_lexical_convert<std::string, const char*>(const char*const&, std::string &)".

5 9

Regression with boost::python 1.60
by Emmanuel 28 Jan '16

28 Jan '16

Hello, I am not sure if this is the right place to do it, but I will try :-). I am having a regression in boost 1.60, I documented a small reproducer here: http://stackoverflow.com/questions/35056398/typeerror-when-iterating-over-a… Does anyone have a clue ? Cheers, Emmanuel

1 0

[Odeint] Stiff System of differential equations
by jules 25 Jan '16

25 Jan '16

Hi all, I am currently working with a very large set of differential equations; it is a disease model with 20160 classes depending on which vaccine has been admnistered, history of infection, and age. To solve this I have been using the runge_kutta_fehlber78 controlled stepper with the integrate_const function. There I need to set the absolute_error, relative_error and the step_size. My issue is that the results from the solver seems to depend highly on the step_size and whether or not an observer is provided. Since the solver is adaptive I feel like the results should not depend on step_size and they should definitely not depend on the presence of an observer. My question is why would the results be related to the step_size or the observer? How would it be possible to get the same results regardless of the step_size and the presence of an observer? Could this be related to the system being stiff and if so how would it be possible to solve it (The jacobian is too complicated to calculate because of the population dynamics)? Any help would be appreciated. Many thanks, Jules

3 5

BGL, shortest path between two nearby nodes in a huge graph
by Paolo Bolzoni 25 Jan '16

25 Jan '16

Dear list, I am a happy user of BGL, but recently I got stuck in a strange problem. I think I am missing the obvious, so I'll be happy to read the fine manual if it's the case. Just point me to the right direction. I need to find the shortest path between two nodes, for doing so I am using dijkstra with a custom visitor that stops the search (throwing an exception) when examine_vertex is called on the destination node. It worked fine, but it run strangely slow. After some profiling, it is clear that most of the time is used in the initialize_vertex function. The graph is fairly large, but the path I am looking for are fairly small (10 edges tops usually). It is possible to skip the initialize phase? Cheers, Paolo

3 5

Some help for betweenness centrality for undirected weighted graph
by Xinran Wang 25 Jan '16

25 Jan '16

Hi everyone, this is from Jason. I am a new user of Boost library. Nowadays, I am doing a research about betweenness centrality measure. I am very confused about how to use boost to calculate the betweenness centrality. I need to calculate the centrality score based on a undirected and weighted graph. The following code is what I tried to do. But this block of code can only be used for calculated for unweighted graph. Could anyone here can offer me examples? Thanks for any reply. #include <boost/graph/betweenness_centrality.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> typedef boost::property<boost::edge_weight_t, float> EdgeWeightProperty; typedef boost::adjacency_list < boost::listS, boost::vecS, boost::undirectedS, boost::no_property, EdgeWeightProperty > Graph; typedef boost::graph_traits < Graph >::vertex_descriptor vertex_descriptor; typedef boost::graph_traits < Graph >::edge_descriptor edge_descriptor; typedef std::pair<int, int> Edge; typedef std::map<Edge, int> StdEdgeIndexMap; void betweennessCentrality() { Graph g; Graph::vertex_descriptor a1 = boost::add_vertex(g); Graph::vertex_descriptor a2 = boost::add_vertex(g); Graph::vertex_descriptor a3 = boost::add_vertex(g); Graph::vertex_descriptor a4 = boost::add_vertex(g); Graph::vertex_descriptor a5 = boost::add_vertex(g); Graph::vertex_descriptor a6 = boost::add_vertex(g); Graph::vertex_descriptor a7 = boost::add_vertex(g); EdgeWeightProperty weight0 = 1; boost::add_edge(a1, a2, weight0, g); EdgeWeightProperty weight1 = 1; boost::add_edge(a1, a3, weight1, g); EdgeWeightProperty weight2 = 1; boost::add_edge(a2, a3, weight2, g); EdgeWeightProperty weight3 = 1; boost::add_edge(a3, a4, weight3, g); EdgeWeightProperty weight4 = 1; boost::add_edge(a4, a5, weight4, g); EdgeWeightProperty weight5 = 1; boost::add_edge(a5, a6, weight5, g); EdgeWeightProperty weight6 = 1; boost::add_edge(a5, a7, weight6, g); EdgeWeightProperty weight7 = 1; boost::add_edge(a6, a7, weight7, g); typedef boost::property_map< Graph, boost::vertex_index_t>::type VertexIndexMap; VertexIndexMap v_index = get(boost::vertex_index, g); std::vector< double > v_centrality_vec(boost::num_vertices(g), 0.0); boost::iterator_property_map< std::vector< double >::iterator, VertexIndexMap > v_centrality_map(v_centrality_vec.begin(), v_index); brandes_betweenness_centrality( g, v_centrality_map); }

1 0

[math/stat] generating t-distributed random numbers
by U.Mutlu 22 Jan '16

22 Jan '16

Hi, I've an old code that creates a normal-distributed random number between 0 and 1 (by using the polar method). Is it possible to convert this number to a t-distributed number (with v=5) using boost? Or, alternatively: how to generate t-distributed random numbers in the range 0 to 1 with v=5 (ie. degrees of freedom = 5) in boost?

1 1

[fusion] [mpl] binary MPL transform on empty fusion vectors
by Nathan Ridge 22 Jan '16

22 Jan '16

Hi, I've run into an error in code involving MPL and Fusion which I've reduced to the following: #include <boost/mpl/transform.hpp> #include <boost/fusion/container/vector.hpp> #include <boost/fusion/mpl.hpp> struct predicate { template <typename T, typename U> struct apply { typedef T type; }; }; typedef boost::mpl::transform< boost::fusion::vector<>, boost::fusion::vector<>, predicate> ::type Result; This simple piece of code tries to perform a binary MPL transform on two fusion vectors of size 0. It produces the error reproduced below, with both gcc 5.1 and clang 3.7. My boost version is 1.60. I'm quite sure that this used to work with an older boost and compiler version combination, though I don't recall which exactly (something in the vicinity of boost 1.54 / gcc 4.8). Did I run into a regression, or should I not be expecting this to work in the first place? Should I be special-casing zero-length vectors? Thanks, Nate In file included from test.cpp:2: In file included from boost/include/boost/fusion/container/vector.hpp:12: In file included from boost/include/boost/fusion/container/vector/vector.hpp:28: In file included from boost/include/boost/fusion/container/vector/detail/at_impl.hpp:12: boost/include/boost/fusion/container/vector/detail/value_at_impl.hpp:50:57: error: no matching function for call to 'value_at_impl' typedef typename mpl::identity<decltype(seq::template value_at_impl<N::value>(boost::declval<seq*>()))>::type::type type; ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ boost/include/boost/fusion/container/vector/detail/value_of_impl.hpp:30:61: note: in instantiation of template class 'boost::fusion::extension::value_at_impl<boost::fusion::vector_tag>::apply<boost::fusion::vector<>, mpl_::int_<0>>' requested here typedef typename value_at_impl<vector_tag>::template apply<vector, index>::type type; ^ boost/include/boost/fusion/iterator/value_of.hpp:52:15: note: in instantiation of template class 'boost::fusion::extension::value_of_impl<boost::fusion::vector_iterator_tag>::apply<boost::fusion::vector_iterator<boost::fusion::vector<>, 0>>' requested here : extension::value_of_impl<typename detail::tag_of<Iterator>::type>:: ^ boost/include/boost/fusion/iterator/mpl/fusion_iterator.hpp:47:45: note: in instantiation of template class 'boost::fusion::result_of::value_of<boost::fusion::vector_iterator<boost::fusion::vector<>, 0>>' requested here typedef typename fusion::result_of::value_of<Iterator>::type type; ^ boost/include/boost/mpl/iterator_category.hpp:27:22: note: in instantiation of template class 'boost::mpl::fusion_iterator<boost::fusion::vector_iterator<boost::fusion::vector<>, 0>>' requested here typedef typename Iterator::category type; ^ boost/include/boost/mpl/pair_view.hpp:152:20: note: in instantiation of template class 'boost::mpl::iterator_category<boost::mpl::fusion_iterator<boost::fusion::vector_iterator<boost::fusion::vector<>, 0>>>' requested here typename iterator_category<iter1_>::type ^ boost/include/boost/mpl/aux_/has_tag.hpp:20:1: note: in instantiation of template class 'boost::mpl::pair_view<boost::fusion::vector<>, boost::fusion::vector<>>' requested here BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_tag, tag, false) ^ boost/include/boost/mpl/has_xxx.hpp:245:65: note: expanded from macro 'BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF' , boost::mpl::aux::type_wrapper<BOOST_MSVC_TYPENAME U::name>* = 0 \ ^ boost/include/boost/mpl/aux_/has_tag.hpp:20:1: note: while substituting deduced template arguments into function template 'test' [with U = boost::mpl::pair_view<boost::fusion::vector<>, boost::fusion::vector<>>] BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_tag, tag, false) ^ boost/include/boost/mpl/has_xxx.hpp:253:18: note: expanded from macro 'BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF' sizeof(gcc_3_2_wknd::test(static_cast<t_*>(0))) \ ^ boost/include/boost/config/suffix.hpp:394:72: note: expanded from macro 'BOOST_STATIC_CONSTANT' # define BOOST_STATIC_CONSTANT(type, assignment) static const type assignment ^ boost/include/boost/mpl/sequence_tag.hpp:112:30: note: in instantiation of template class 'boost::mpl::aux::has_tag<boost::mpl::pair_view<boost::fusion::vector<>, boost::fusion::vector<>>, mpl_::bool_<false>>' requested here ::boost::mpl::aux::has_tag<Sequence>::value ^ boost/include/boost/mpl/O1_size.hpp:30:30: note: in instantiation of template class 'boost::mpl::sequence_tag<boost::mpl::pair_view<boost::fusion::vector<>, boost::fusion::vector<>>>' requested here : O1_size_impl< typename sequence_tag<Sequence>::type> ^ boost/include/boost/mpl/fold.hpp:34:25: note: in instantiation of template class 'boost::mpl::O1_size<boost::mpl::pair_view<boost::fusion::vector<>, boost::fusion::vector<>>>' requested here ::boost::mpl::O1_size<Sequence>::value ^ boost/include/boost/mpl/transform.hpp:75:7: note: in instantiation of template class 'boost::mpl::fold<boost::mpl::pair_view<boost::fusion::vector<>, boost::fusion::vector<>>, boost::fusion::vector<>, boost::mpl::bind2<boost::mpl::push_back<mpl_::na, mpl_::na>, mpl_::arg<1>, boost::mpl::bind2<predicate, boost::mpl::bind1<boost::mpl::first<mpl_::na>, mpl_::arg<2>>, boost::mpl::bind1<boost::mpl::second<mpl_::na>, mpl_::arg<2>>>>>' requested here : fold< ^ boost/include/boost/mpl/transform.hpp:114:1: note: in instantiation of template class 'boost::mpl::aux::transform2_impl<boost::fusion::vector<>, boost::fusion::vector<>, predicate, boost::mpl::back_inserter<boost::fusion::vector<>>>' requested here BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(4, transform2) ^ boost/include/boost/mpl/aux_/inserter_algorithm.hpp:52:7: note: expanded from macro 'BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF' : if_< has_push_back< typename clear<P1>::type> \ ^ boost/include/boost/mpl/eval_if.hpp:38:22: note: in instantiation of template class 'boost::mpl::transform2<boost::fusion::vector<>, boost::fusion::vector<>, predicate, mpl_::na>' requested here typedef typename f_::type type; ^ boost/include/boost/mpl/transform.hpp:138:1: note: in instantiation of template class 'boost::mpl::eval_if<boost::mpl::or_<boost::mpl::is_na<predicate>, boost::mpl::is_lambda_expression<boost::fusion::vector<>>, boost::mpl::not_<boost::mpl::is_sequence<boost::fusion::vector<>>>, mpl_::bool_<false>, mpl_::bool_<false>>, boost::mpl::transform1<boost::fusion::vector<>, boost::fusion::vector<>, predicate>, boost::mpl::transform2<boost::fusion::vector<>, boost::fusion::vector<>, predicate, mpl_::na>>' requested here AUX778076_TRANSFORM_DEF(transform) ^ boost/include/boost/mpl/transform.hpp:125:22: note: expanded from macro 'AUX778076_TRANSFORM_DEF' typedef typename eval_if< \ ^ test.cpp:13:17: note: in instantiation of template class 'boost::mpl::transform<boost::fusion::vector<>, boost::fusion::vector<>, predicate, mpl_::na>' requested here boost::mpl::transform< ^ boost/include/boost/fusion/container/vector/vector.hpp:275:30: note: candidate template ignored: could not match 'store' against 'vector' mpl::identity<U> value_at_impl(store<N, U>*); ^

2 2

Boost Log: Use of operator<<
by Florian Lindner 21 Jan '16

21 Jan '16

Hello, I want to put a custom object called DynamicVector on the BOOG_LOG_SEV stream. For that I defined an operator<< template<typename Vector> typename std::enable_if<tarch::la::IsVector<Vector>::value, std::ostream&>::Type operator<< (std::ostream & os, const Vector & vector); IsVector<Vector> will be true, since template<typename Scalar> struct IsVector<DynamicVector<Scalar> > { static const int value = true; }; The operator itself is working: // getCoords returns a DynamicVector<double> std::cout << inMesh->vertices()[j].getCoords(); // compiles just fine. but BOOST_LOG_SEV(_log, boost::log::trivial::severity_level::error) << inMesh->vertices()[j].getCoords(); gives an compile error: /usr/include/boost/log/utility/formatting_ostream.hpp:799:19: error: invalid operands to binary expression ('ostream_type' (aka 'basic_ostream<char_type, traits_type>') and 'const tarch::la::DynamicVector<double>') strm.stream() << value; str.stream() seems to be an ostream_type which is an basic_ostream<char_type, traits_type>. I wonder why this isn't convertible to std::ostream, like http://stackoverflow.com/questions/17269499/overloading-operator-for-boost-… and the comment at http://www.boost.org/doc/libs/1_54_0/boost/log/utility/formatting_ostream.h… suggest. Any help appreciated! Thanks, Florian

1 0

Re: [Boost-users] [boost] Boost.Operators issue: polluting namespace of caller through argument-dependent lookup
by John M. Dlugosz 21 Jan '16

21 Jan '16

On 1/20/2016 10:41 AM, Daniel Frey wrote: > In a way it makes library collections like Boost harder and I still think you should use > qualified lookup in your specific case, No, I specifically don't want to qualify every use, as explained originally. The code needs compatibility with some configurations that require the tr1 namespace and others that prohibit it. Qualifying every reference is bad; rather, import them in one place. You are basically saying that `using N::foo;` is never right because someone may happen to use the name foo in an unrelated library and ADL is a misfeature? I think that doesn't scale. It should be SOP to isolate classes that are meant to be used as base classes by library consumers, and treat unqualified lookup of names pulled in to the local scope via `using` as something that is a useful feature that ought to work. > but as I already said in another mail I’m willing to fix it. I just need to figure out > where to commit and merge stuff as the last time I worked on it we were still using svn > and the branching model was different. I hope to be able to find the time somewhere in > the next days. Regards, Daniel Looking forward to it in 1.62 or whatever. Thanks! —John

1 0

[locale] boost::locale::format number formatting on OS X and Windows
by Michael Smith 21 Jan '16

21 Jan '16

Using Boost.Locale from Boost 1.60.0 (installed via homebrew, so it uses icu) on Mac OS X 10.11.2, I seem to be getting unexpected behavior for some of the boost::format number formatting. A short example program #include <boost/locale.hpp> int main(int argc, char** argv) { boost::locale::format fmt("{1,number} should be 1,25."); fmt % 1.25; boost::locale::generator gen; std::cout << fmt.str(gen("fr-fr.UTF-8")) << std::endl; return 0; } That produces 1,25 on Linux, and 1.25 on Windows (using mingw-w64) and Mac. Any idea why they'd represent it differently?

1 0

Re: [Boost-users] Using Coroutines in the Visitor Pattern (use-case: BGL event visitor)
by alex 20 Jan '16

20 Jan '16

>-----Original Message----- >From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of >Daniel Hofmann >Sent: 17 November 2015 15:55 >To: boost-users(a)lists.boost.org >Subject: [Boost-users] Using Coroutines in the Visitor Pattern (use-case: BGL >event visitor) > >(Disclaimer: this is not only specific to BGL, I can think of similar >use-cases where the visitor pattern is used --- I will still explain it >in the BGL context, as it is probably easier to understand) > > >Suppose you have a BGL graph and want to implement s-t shortest path >queries. It is possible to do this by using a bi-directional approach, >that is starting a Dijkstra search [1] from the start and starting a >additional Dijkstra search from the target. As soon as they "meet in the >middle", you can unpack the two sub-paths. > >[snip] > >It then came to my mind that I could use Coroutines for cooperative >multitasking, without the downsides that come with threading. > >My idea was to invert the callbacks using Coroutines as it is shown in >the SAX parsing example [3], in order to get a lazy range of vertices >each visitor examines. I then could simply walk the two ranges, >terminating as soon as there is the same element in both. Jeremiah Willcock gave a good description of how this could work: http://lists.boost.org/Archives/boost/2012/07/195300.php The way he describes it is really using coroutines instead of the visitor pattern. > > >But due to way the dijkstra_shortest_path function adds an additional >level of indirection I failed to implement this, and I have strong >doubts that it is possible with Coroutines at all. I> >I'm mainly struggling with wrapping my head around stopping and resuming >the dijkstra_shortest_path function, when all I can modify is the >visitor it takes. That is, the reason I can not make it work is that I >can not launch two dijkstra_shortest_path functions asynchronously with >just Coroutines. > I think there are two options: 1. Let your visitor throw an exception to get out of the dijkstra shortest path function; use some version of the function that skips initialization to resume again (the existing dijkstra_shortest_path_no_init is not good enough, so you would have to make one). 2. Reimplement the dijkstra function as a coroutine. I have implemented both, but have only really used option 1; whereas option 2 remained a toy experiment. In both cases the tricky part was to properly initialize and keep track of(and not re-initialize on resume) all parameters that are input to the dijkstra function, i.e. color_map, queue, distance_map, etc. https://github.com/ahhz/resumable_dijkstra I used the lightweight stackless coroutine of Boost ASIO. http://www.boost.org/doc/libs/1_59_0/doc/html/boost_asio/reference/coroutine .html >The control flow I need would probably look like this: start the first >Dijkstra search, on its first vertex it visits, "jump back out" and >start the second Dijkstra visitor. From there on ping-pong between the >two visitors exclusively. And I'm not sure this is possible with the >Coroutine approach. > It depends how much you are willing to re-implement. It is possible in principle >I appreciate any tips in this regard, even if it's a "just use your 15 >lines of threading code instead of trying to be fancy" :) > I think it would be great to have a fancy solution for this in BGL.

3 14

boost serialization
by Виктория Доможакова 20 Jan '16

20 Jan '16

I use boost serialization in my project. I I conducted f an experiment: 1) I removed one line with the data in the boost archive file. 2) I started my project. 3) All variables initialized in the constructor. 4) Value of variables loaded from boost archive in order . 5) When queue comes to removing values , I get exeption (I handle exeption with try-catch ) and file didn't read to end and close. 6) But this variable is equal to the value next after removal . My question: why this variable is equal to the value next after removal . if this variable has value from constructor than it is more logic. -- Виктория Доможакова

1 0

[gsoc16] Attn: We need 2016 mentors and project ideas for Boost!
by Niall Douglas 20 Jan '16

20 Jan '16

Dear Boost community, We are now within one month of the beginning of Google Summer of Code 2016! Last year's GSoC was a particularly momentus one as we witnessed the approval by the community for Boost.Hana to enter Boost - congratulations to Louis and his mentor Joel for bringing to Boost a very exciting new C++ library which pushes C++ compilers to their limits. We have also seen greatly improved retention of GSoC students in the community thanks to the improved student selection procedures introduced last year, and the fresh blood brought into Boost has been very evident on the mailing list this year. As part of filling in our application for 2016, we must supply to Google a list of potential GSoC mentors and potential GSoC projects for summer 2016 in order to be approved as an organisation this year. Therefore a lengthy page of awesome project ideas at https://svn.boost.org/trac/boost/wiki/SoC2016 before *February 8th* would be an enormous help to getting us approved again this year and bringing to Boost another US$35,000 of Google funding. 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 had more slots awarded to us by Google than we had good combinations of student and mentor, so we had to return slots which I believe has not happened here at Boost GSoC in at least a decade. That means that your project ideas have a better chance than ever of receiving funding if you can find a good student, and that is best done by getting project ideas floated *early*. 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 or via gsoc-admin(a)boost.org. Thank you in advance for your time. --- Boost C++ Libraries Google Summer of Code 2016 admin https://svn.boost.org/trac/boost/wiki/SoC2016

2 1

Using Coroutines in the Visitor Pattern (use-case: BGL event visitor)
by Daniel Hofmann 19 Jan '16

19 Jan '16

(Disclaimer: this is not only specific to BGL, I can think of similar use-cases where the visitor pattern is used --- I will still explain it in the BGL context, as it is probably easier to understand) Suppose you have a BGL graph and want to implement s-t shortest path queries. It is possible to do this by using a bi-directional approach, that is starting a Dijkstra search [1] from the start and starting a additional Dijkstra search from the target. As soon as they "meet in the middle", you can unpack the two sub-paths. In terms of the BGL this would roughly look like the following (simplified, with synchronization and visitor omitted): Vertex middle; async(dijkstra_shortest_paths(g, start, visitor(v{middle}))); async(dijkstra_shortest_paths(g, target, visitor(v{middle}))); where the visitors single-step all vertices in their examine_vertex callback [2] and check if they met in the middle. While this is quite easy to implement with threading, is has its downsides, mainly in synchronization for this ping-pong play between the two visitors, resulting in contention on the synchronization locks. But also the overhead of using threads might be too high for smaller graphs. It then came to my mind that I could use Coroutines for cooperative multitasking, without the downsides that come with threading. My idea was to invert the callbacks using Coroutines as it is shown in the SAX parsing example [3], in order to get a lazy range of vertices each visitor examines. I then could simply walk the two ranges, terminating as soon as there is the same element in both. But due to way the dijkstra_shortest_path function adds an additional level of indirection I failed to implement this, and I have strong doubts that it is possible with Coroutines at all. I'm mainly struggling with wrapping my head around stopping and resuming the dijkstra_shortest_path function, when all I can modify is the visitor it takes. That is, the reason I can not make it work is that I can not launch two dijkstra_shortest_path functions asynchronously with just Coroutines. The control flow I need would probably look like this: start the first Dijkstra search, on its first vertex it visits, "jump back out" and start the second Dijkstra visitor. From there on ping-pong between the two visitors exclusively. And I'm not sure this is possible with the Coroutine approach. I appreciate any tips in this regard, even if it's a "just use your 15 lines of threading code instead of trying to be fancy" :) Cheers, Daniel J H [1] http://www.boost.org/doc/libs/1_59_0/libs/graph/doc/dijkstra_shortest_paths… [2] http://www.boost.org/doc/libs/1_59_0/libs/graph/doc/DijkstraVisitor.html [3] http://www.boost.org/doc/libs/1_59_0/libs/coroutine/doc/html/coroutine/moti…

2 4

Re: [Boost-users] boost.dll winapi compile error
by Elod G 18 Jan '16

18 Jan '16

I was missing the latest winapi module, duh. ElodG On 1/18/2016 19:00, boost-users-request(a)lists.boost.org wrote: > Message: 1 > Date: Sun, 17 Jan 2016 23:12:32 +0200 > From: Elod G <gyelod(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] boost.dll winapi compile error > Message-ID: <569C03BF.9030305(a)gmail.com> > Content-Type: text/plain; charset=utf-8 > > Hello All, > > I cloned origin/master of https://github.com/boostorg/dll and copied > include/ to the 1.60 release of boost to give boost.DLL a go. > > I am getting the following compile error when including: "boost/dll.hpp" > boost\dll\detail\windows\shared_library_impl.hpp:140: error: C2039: > 'get_proc_address' : is not a member of 'boost::detail::winapi' > > I am using VS2013. > > What am I missing? > > -- > ElodG

1 0

boost.dll winapi compile error
by Elod G 17 Jan '16

17 Jan '16

Hello All, I cloned origin/master of https://github.com/boostorg/dll and copied include/ to the 1.60 release of boost to give boost.DLL a go. I am getting the following compile error when including: "boost/dll.hpp" boost\dll\detail\windows\shared_library_impl.hpp:140: error: C2039: 'get_proc_address' : is not a member of 'boost::detail::winapi' I am using VS2013. What am I missing? -- ElodG

1 0