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

[interprocess] Determine size of managed_shared_memory
by Kai Benndorf 12 Oct '19

12 Oct '19

Hi all, I want to create a managed_shared_memory in exactly the size I needed. Therefore I do something like this: size = sizeof( common_managed_shared_memory ); size += sizeof( MyClassInSharedMem ); managed_shared_memory segment(create_only, "name", size ); MyClassInSharedMem allocates itself some memory by segment->allocate(). I added this also to the size, but get a boost::interprocess::bad_alloc exception on allocating this additional memory. Are there some magic bytes I forgot to add? Many thanks in advance Kai

3 2

[Range, Phoenix] What am I missing...
by Robert Jones 25 Apr '17

25 Apr '17

Hi Folks Can anyone explain the output of this program... #include <iostream> #include <boost/range/algorithm/copy.hpp> #include <boost/range/counting_range.hpp> #include <boost/range/adaptor/reversed.hpp> #include <boost/range/adaptor/transformed.hpp> #include <boost/phoenix/bind/bind_function.hpp> #include <boost/phoenix/core/argument.hpp> int f( int i ) { return i * 2; } int main( ) { using boost::adaptors::reversed; using boost::adaptors::transformed; using boost::counting_range; using boost::copy; using boost::phoenix::arg_names::_1; copy( counting_range( 1, 5 ) | reversed | transformed( f ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; copy( counting_range( 1, 5 ) | reversed | transformed( bind( f, _1 ) ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; } Which is... 8 6 4 2 1768406272 1768406272 1768406272 1768406272 I'm using Gcc 4.6.2 & Boost 1.53 Thx All.

3 4

[statechart] Passing parameters from event to State Local Storage
by Christophe Bourez 16 Nov '16

16 Nov '16

I need to maintain a parameter into the state local storage. This parameter is initially contained in the event that causes the transition to the target state. I give hereafter a small illustrative example. typename sc = boost::statechart; class EvTest : public sc::event<EvTest> { public: EvTest(std::size_t val) : value(val) {} std::size_t getValue() const { return this->value; } private: std::size_t value; }; class MyStateMachine; class StSource; class StTarget; class StSource : public sc::simple_state<StSource, MyStateMachine> { public: typedef sc::custom_reaction<EvTest> reactions; sc::result react(const EvTest &event) { // How to pass event.getValue() to the target state ? transit<StTarget>(); } }; class StTarget : public sc::simple_state<StTarget, MyStateMachine> { public: StTarget(std::size_t val) : val(value) {} private: std::size_t value; }; Thanks, Christophe

5 6

Re: [Boost-users] lexical_cast between double and string slow in Visual Studio 2013
by David Roberts 07 May '15

07 May '15

> That issue is unknown. I'd really appreciate the investigation. I have done some more investigation, and there are two factors that only cause the slowness when they both occur together. > Try excluding the lexical_cast from test, I have a feeling that this is only MSVC related issue: > > #include <sstream> > #include <string> > > int main (int, char **) > { > for (double count = 0.0; count < 1000000.0; count += 1.41) > { > std::stringstream ss; > ss << count; > std::string result = std::move(ss.str()); > ss.str(std::string()); > > ss << result; > ss >> count; > } > > return 0; > } > Running your test program does not exhibit the problem. It runs in around 3 seconds on my machine when built with either Visual Studio 2010 or Visual Studio 2013. However, changing it very slightly to match more closely what lexical_cast does internally does recreate the problem: #include <sstream> #include <string> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::stringstream ss; ss.unsetf(std::ios::skipws); ss.precision(17); ss << count; std::string result = std::move(ss.str()); ss.str(std::string()); ss << result; ss >> count; } return 0; } The effect of setting the precision to 17 is that lots of 9s appear in the string representations. (The number 17 is what boost::detail::lcast_get_precision(double*) chooses.) Without the precision call the contents of the string called result start off like this: 0 1.41 2.82 4.23 5.64 7.05 8.46 9.87 11.28 12.69 With precision set to 17 they start off like this: 0 1.4099999999999999 2.8199999999999998 4.2299999999999995 5.6399999999999997 7.0499999999999998 8.4599999999999991 9.8699999999999992 11.279999999999999 12.69 This happens for both Visual Studio 2010 and Visual Studio 2013. Then the next difference is that Visual Studio 2013 spends a lot longer handling all the extra 9s. Changing the program so that the double is converted to a string using std::stringstream without a precision call and then back to double using lexical_cast takes about 3 seconds for both Visual Studio 2010 and Visual Studio 2013. It is the combination of having all the extra 9s to parse and using Visual Studio 2013 that makes the test using lexical_cast to go both ways slow. Both Visual Studio 2010 and Visual Studio 2013 do the conversion by calling std::num_get<char,std::istreambuf_iterator<char,std::char_traits<char> > >::do_get() which then calls a function called _Stodx() which is implemented in xstod.c. This function is very different for the two versions. In Visual Studio 2010 it's a relatively thin wrapper around the C function strtod(). In Visual Studio 2013 _Stodx() has got a completely new implementation that's generated by #including xxstod.h with some macros defined. The original C function strtod() is much faster than the new _Stodx() when there are lots of 9s at the end of the strings being parsed. This modification to the program: #include <sstream> #include <string> #include <stdlib.h> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::stringstream ss; ss.unsetf(std::ios::skipws); ss.precision(17); ss << count; std::string result = std::move(ss.str()); ss.str(std::string()); ss << result; char *endptr; count = strtod(ss.str().c_str(), &endptr); } return 0; } has a runtime of about 3 seconds even though it's got to cope with all the 9s. I guess only someone from Microsoft or Dinkumware could comment on why _Stodx() was reimplemented. But the other thing is that by setting precision to 17 lexical_cast is bloating the string representations of the doubles with lots of 9s in both Visual Studio 2010 and Visual Studio 2013. Setting precision to 15 instead prevents this, and makes the original test run faster even with Visual Studio 2013 (about 4 seconds rather than 10). Regards, David

5 4

Statechart serialization
by mbrodeur65 04 Mar '15

04 Mar '15

Hi, I'm looking for a solution to serialize boost::statechart objects. I'm aware that this feature is on the statechart library todo list but was wondering if there are any workaround to achieve this with the latest boost release (1.34) ? thanks for your help ! mbrodeur65 -- View this message in context: http://www.nabble.com/Statechart-serialization-tf4131326.html#a11749139 Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

NT² 3.0 and Boost.SIMD - Stable release
by Joel Falcou 21 Nov '14

21 Nov '14

The first stable release of the 3.x series of MetaScale’s open-source software is available: NT² 3.0. It also includes its spin-off project, Boost.SIMD (not yet a Boost library). Many Issues have been closed since last beta. The main focus of this release cycle was to fix performances issues and to stabilize some parts of the API. Next step will be to separate NT2 and Boost.SIMD into separate repositories, thus making one more step toward Boost.SIMD submission into review. [ http://www.metascale.org/nt%C2%B2-3-0-and-boost-simd ] *Changes & Bug Fixes:* - Major performance improvements in both libraries - Added experimental support for the HPX runtime for parallelization on shared memory systems - Optimizations of many elemental functions, in particuler log/ex, frexp/ldexp and cbrt - More advanced shuffle pattern recognition for SIMD - Fixed issues with Visual Studio 2013 - More functions are force-inlined to ensure good performance - New functions for conversion between types and mixing of vectors of different sizes - Demo applications usable as benchmarks - Better handling of errors when an unsupported function is called - New API for custom memory allocators Full changelog is available at https://github.com/MetaScale/nt2/releases/tag/3.0.0. *How to get it ?* - Source and binary packages can be downloaded here: http://nt2.metascale.org/downloads - The release is also available on Github : https://github.com/MetaScale/nt2/releases - The main master branch is still under development : https://github.com/MetaScale/nt2

4 4

[Thread] Read-write locks
by lfrfly＠icqmail.com 18 Sep '14

18 Sep '14

I'm trying to create a standard read/write lock using Boost Threads, and I'm having a bit of difficulty mapping the Boost concepts onto the usual ones. A read/write lock should have several states: Locked for reading (multiple threads may lock at once), locked for writing (only one thread may lock, and no threads may be locked for reading at the same time), and unlocked. Ideally it would be nice if an RWL which is locked for reading may temporarily upgrade to locked for writing, then return to the locked for reading state. Boost supports several relevant notions of locking: shared locking, upgrade locking, and exclusive locking. This to me is a confusing distinction. In particular, a shared_mutex seems appropriate as the basis for a RWL, but is lock_upgrade() the equivalent of a write lock and lock_shared the equivalent of a read lock? This is unclear. If "upgrade locking" is not the same as "exclusive locking", then is an upgrade lock actually exclusive? Could someone please clarify this.

4 3

[Statechart] How to decide between post_event and process_event atrun time ?
by Philippe DAVID 22 Jul '14

22 Jul '14

Hi, I have a method in which I want to post/process an event. The thing is, this method can be called from outside the state machine (so I need to call process_event), or indirectly by a reaction of the state machine (in this case I must call post_event since process_event is not reentrant). I don't want to write 2 distinct methods to do this (one that calls post, and the other process), I would much rather prefer adding a 'if' in my method that tells me if I have to call process_event or post_event (if I'm being called indirectly by the state machine or not). Is there a way to do this with statechart ? regards, Philippe

3 3

[Log] Extract severity value
by Olivier Tournaire 17 Jul '14

17 Jul '14

Hi all, I am trying to extract severity level from a log record, but i seems that I am doing it the wrong way. Here is the code I use: void LogDockWidget::receiveLog(boost::log::record_view const& rec, const std::string& log) { logging::value_ref< logging::trivial::severity_level > level = logging::extract< logging::trivial::severity_level >("Severity", rec); // ... } Here level.get() always returns "info". All my logs are done with the BOOST_LOG_TRIVIAL(...) macro. The formatter whereas displays correctly the severity level. Here is how it is defined: void LogDockWidget::init_logging() { boost::shared_ptr< logging::core > core = logging::core::get(); typedef sinks::synchronous_sink< QTextEditFormattedSinkBackend > sink_t; boost::shared_ptr< sink_t > sink(new sink_t); // ... logging::add_file_log( keywords::file_name = logFilename, keywords::auto_flush = true, keywords::format = ( BUILD_LOG_FORMATTER() ) ); sink->set_formatter( BUILD_LOG_FORMATTER() ); core->add_sink(sink); // Add attributes that we will use logging::add_common_attributes(); core->add_global_attribute( "ThreadID", attrs::current_thread_id()); } #define BUILD_LOG_FORMATTER() \ expr::stream \ << "[" << expr::format_date_time< boost::posix_time::ptime >("TimeStamp", "%Y-%m-%d %H:%M:%S") << "] " \ << expr::attr<unsigned int>("LineID") << " " \ << ": <" << logging::trivial::severity << "> " \ << " [" << expr::attr<attrs::current_thread_id::value_type>("ThreadID") << "] " \ << expr::if_(expr::has_attr(scope_attribute)) \ [ \ expr::stream << "[" << scope_attribute << "] " \ ] \ << expr::message Could you please let me know what I am doing wrong? Regards, Olivier

2 2

Autobahn for C++: RPC and PubSub
by Tobias Oberstein 24 Jun '14

24 Jun '14

Hi, I'm happy to anounce Autobahn|Cpp - another subproject of Autobahn (http://autobahn.ws) this time for C++ 11 / Boost. Autobahn|Cpp allows remote procedure calls and publish & subscribe messaging for C++ application components and uses boost::future, continuations and Boost/ASIO as underlying network library. Here is how app code looks like: https://github.com/tavendo/AutobahnCpp/blob/master/README.md#show-me-some-c… Using Autobahn|Cpp, you can e.g. call your C++ code from JavaScript running in a browser. And much more. This is an early alpha version, things aren't fully hashed out, but there are a couple of examples included here: https://github.com/tavendo/AutobahnCpp/blob/master/README.md#examples Cheers, /Tobias

2 3

Fix for annoying bug / library maintenance
by Filip Konvička 30 May '14

30 May '14

Hi, https://svn.boost.org/trac/boost/ticket/4964 This is out there for years. To me this seems to be clearly explained and a fix is provided, but apparently all bugs assigned to 'bgubenko' aren't monitored (for years there has been no reaction). So is there a way of getting the fix ever applied? Or are such unmaintained libraries just doomed to eventually die, despite the efforts of the people reporting bugs and posting patches? Thanks, Filip

4 5

[test]Legacy support - Boost 1.34.1 with MSVC 6
by Kerry, Richard 29 May '14

29 May '14

I've just started trying to use Boost's Test module. Trouble is I'm still stuck with Visual Studio 6(SP6), so I believe I need to stick with Boost 1.34.1 as the last properly supported for VC6. I'm having trouble getting the examples even to compile (ie exec_mon_example.cpp). Does anyone have any pointers to known incompatibilities between Boost 1.34.1 and VC6SP6 ? Or whether there is a more recent version where the Test module will work with VC6 ? I am well aware of how old VC6 is and would like to move forward. The major aim of getting Boost.Test working with VC6 is to give some confidence that any port to VC12 is working satisfactorily. Regards, Richard. Richard Kerry BNCS Engineer, SI SOL Telco & Media Vertical Practice T: +44 (0)20 3618 2669 M: +44 (0)7812 325518 Lync: +44 (0) 20 3618 0778 Room G300, Stadium House, Wood Lane, London, W12 7TA richard.kerry(a)atos.net<mailto:richard.kerry@atos.net>

3 2

Boost test and openmpi
by Martin Vymazal 21 May '14

21 May '14

Hello, I have the following code: #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE mpi_functionality #include <boost/test/unit_test.hpp> #include "mpi.h" struct MPI_Functionality_Fixture { MPI_Functionality_Fixture() { m_argc = boost::unit_test::framework::master_test_suite().argc; m_argv = boost::unit_test::framework::master_test_suite().argv; } int m_argc; char** m_argv; }; BOOST_FIXTURE_TEST_SUITE( MPI_Functionality_TestSuite, MPI_Functionality_Fixture ) BOOST_AUTO_TEST_CASE( mpi_functionality_parenv_init ) { MPI_Init(&m_argc,&m_argv); } BOOST_AUTO_TEST_CASE( mpi_functionality_parenv_finalize ) { MPI_Finalize(); } BOOST_AUTO_TEST_SUITE_END() The code compiles fine, but I have the following problem when I try to run it. When I run as 'mpirun ./my_executable' or 'mpirun -np 3 ./my_executable' everything goes fine. On the other hand, when I run as ./my_executable I get the following error: unknown location(0): fatal error in "mpi_functionality_parenv_finalize": unrecognized signal Outside of Boost, it is perfectly possible to write a program which calls MPI_Init and MPI_Finalize and it does not have to be used with mpirun. I wonder if this (different) behavior of Boost test is normal. I did not find any remarks regarding Boost test and mpi in the tutorial. Best regards, Martin Vymazal

5 11

[Test] Boost.Test for Property Tree Issue
by Pritesh Acharya 19 May '14

19 May '14

Boost version: 1.55.0 OS: Windows 8 IDE: Visual Studio 2010 I have a small class which just parses a std::string using boost::property_tree::read_json. I'm trying to test my method with invalid input to make sure my method handles the exception. However, when I execute GetPropertyTreeFromJsonInValidInput2 (source code in attachment), I get exception in the visual studio itself and I have to break the execution. (snapshot is included in attachment). I'm a new user of boost, so don't know where to look for the solution.

2 1

"Trac thinks your submission might be Spam. To prove otherwise please provide a response to the following."
by Nico Schlömer 16 May '14

16 May '14

Hi all, I would like to make contributions to Boost on trac <https://svn.boost.org/trac/boost>, but whenever I would like to make comment a bug report, it gets recognized as spam, and I'm redirected to a captcha-page that I think should contain a captcha, but does _not_ <https://svn.boost.org/trac/boost/captcha#trac-add-comment>. Any hints? Cheers, Nico

5 8

[Date Time] time_period has not default constructor
by Pablo Madoery 30 Apr '14

30 Apr '14

I am using the library Date Time, in particular the object time_period. I was wondering why (if there is a good reason) this class has not a default constructor. the default constructor result usefull when using for example a map with the operator [] or when using serialization from Boost. ptime class has default constructor. If a time_period is formed by two ptime objects, why time_period has not its default constructor as well. Thanks

1 0

allocating shared memory fails beyond 8 GB
by vipin sachdeva 30 Apr '14

30 Apr '14

Hi, I am using managed_xsi_shared_memory to allocate memory as below: boost::interprocess::managed_xsi_shared_memory shmem(boost::interprocess::create_only, key, atol(argv[2])); For some reason, I cannot allocate more than 8 GB of memory. Both sysctl and ipcs have limits higher than that set (output below). ------ Shared Memory Limits -------- max number of segments = 1874919423 max seg size (kbytes) = 9765624999999 max total shared memory (kbytes) = 39999999999999996 min seg size (bytes) = 1 kernel.shmmax = 9999999999999999 kernel.shmall = 9999999999999999 kernel.shmmni = 1874919423 vm.hugetlb_shm_group = 0 Is there any reason why this allocation should fail ?

2 5

[typeindex v3.0] Peer review begins Mon 21st ends Wed 30th
by Niall Douglas 30 Apr '14

30 Apr '14

Dear Boost, A second round of community review begins for proposed Boost.TypeIndex on Mon 21st, lasting ten days. I should apologise as it's my fault for starting another peer review straight after Boost.Align ends, however I was busy as Google Summer of Code admin until today, and I will be preparing to talk at C++ Now straight after this review ends. I hope that this doesn't affect the community's willingness to contribute to the review. Reminder of the report from the last TypeIndex v2.1 review: https://groups.google.com/forum/#!topic/boost-list/TeiSdkRkUF0 Reminder of the original peer review announcement: http://boost.2283326.n4.nabble.com/TypeIndex-Peer-review-period-for-li brary-acceptance-begins-ending-Thurs-21st-Nov-td4654788.html Source code: https://github.com/apolukhin/type_index/zipball/master Github: https://github.com/apolukhin/type_index Documentation: http://apolukhin.github.com/type_index/index.html Changes in TypeIndex v3.0 since v2.1 (from my own review of it): 1. Documentation is hugely improved over v2.1, lots of side by side examples illustrating the differences and similarities. 2. You can now create your own custom type indices using an extensible framework. 3. boost::typeind::type_info now exports raw_name() and pretty_name() to maximise MSVC-GCC compatibility, and to solve point 1 but not point 2 in the v2.1 report. 4. The undefined behaviour trick used in v2.1 has been replaced with a cast via the placeholder type boost::typeind::detail::ctti_data which can be viewed in https://github.com/apolukhin/type_index/blob/master/include/boost/type _index/ctti_type_index.hpp. There is an explanation in the comments there about this technique's compatibility with the C++ standard. 5. TypeIndex now defines everything in the boost::typeind namespace instead of the boost namespace. So: 1. What is your evaluation of the design? 2. What is your evaluation of the implementation? 3. What is your evaluation of the documentation? 4. What is your evaluation of the potential usefulness of the library? 5. Did you try to use the library? With what compiler? Did you have any problems? 6. How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 7. Are you knowledgeable about the problem domain? And finally, every review should answer this question: 8. Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Thanks, Niall -- Currently unemployed and looking for work in Ireland. Work Portfolio: http://careers.stackoverflow.com/nialldouglas/

5 7

update cycle
by Philipp Kraus 30 Apr '14

30 Apr '14

Hello, I try to compile Boost myself under OSX and the thread library runs into compiler errors. I have seen that the fix is inserted into the repo, so I would like to wait to a new Boost release. The last Boost version (1.55.0) was released on November 2013, so my question is in which cycles are new releases created (half a year)? Thanks Phil

1 0

Boost::Interprocess - using variadic template args with managed_shared_memory::construct()
by james 28 Apr '14

28 Apr '14

Hi, I'm trying to write a wrapper over some of boost::interprocess and I want to have a function like this: template <typename T, typename... Args> T* Wrapper::createStruct(const std::string& name, Args&&... args) { return m_shm->construct<T>(name.c_str())(std::forward<Args>(args)...); } This fails to compile as it seems boost::interprocess uses its own varargs scheme when I try to create the following struct in the SHM through this wrapper function: struct Custom { Custom(int a, int b) : m_a(a), m_b(b) { } int a; int b; } int main() { ... Custom* c = shm->createStruct("Custom", 1, 2); } The error message: /usr/include/boost/interprocess/detail/named_proxy.hpp:79:7: error: no matching function for call to ‘test_sharedmemory::sharedmemory_custom::test_method()::Custom::Custom()’ { new((void*)mem)T(boost::forward<Args>(get<IdxPack>(args_))...); } ^ /usr/include/boost/interprocess/detail/named_proxy.hpp:79:7: note: candidates are: /home/james/dev/infinityplus/test/common/shm/sharedmemory/main.cpp:136:7: note: test_sharedmemory::sharedmemory_custom::test_method()::Custom::Custom(int, int) Custom(int one, int two) ^ /home/james/dev/infinityplus/test/common/shm/sharedmemory/main.cpp:136:7: note: candidate expects 2 arguments, 0 provided Is there any way I can get this to work? I'd rather my wrapper's interface used std only. boost 1.55 c++11 g++ 4.8.2 TIA, James

2 1

Announcing the student program for Meeting C++ 2014
by Jens Weller 28 Apr '14

28 Apr '14

Hello C++ and Boost Community, today I have the honor to announce the student program for Meeting C++ 2014: > The Meeting C++ Student program will enable 50 students to attend Meeting C++ 2014 plus 3 exclusive workshops organized by think-cell one day before the conference on December 4th. So, for students this will be a 3 day conference! After the workshops you will be invited to the student dinner by think-cell. Further details at http://meetingcpp.com/index.php/newsreader/items/meeting-cpp-2014-the-stude… kind regards, Jens Weller

1 0

[Coroutine 1.54] Compile error with bool return from coroutine-function
by Rob Desbois 27 Apr '14

27 Apr '14

(Caveat: I've been unable to find anything about this; hopefully haven't missed anything obvious.) (Apology: I'm aware Coroutine has a new interface as of 1.55; I haven't determined whether it is also affected.) Given the following code: #include <cassert> #include <boost/bind.hpp> #include <boost/coroutine/coroutine.hpp> using coro_t = boost::coroutines::coroutine< bool() >; void get_a_bool( coro_t::caller_type& yield ) { while (true) yield(true); } int main() { coro_t producer( boost::bind(&get_a_bool, _1) ); assert( producer ); } I get this error on compilation (g++ 4.8.2, Boost 1.54): rob{code 0} 839# clear && g++ boost-coroutine-bool-return.cpp -g -W -Wall --std=c++11 -L. -lboost_context -lboost_coroutine -o boost-coroutine-bool-return In file included from /usr/include/boost/coroutine/v1/detail/coroutine_base_resume.hpp:26:0, from /usr/include/boost/coroutine/v1/detail/coroutine_base.hpp:21, from /usr/include/boost/coroutine/v1/coroutine.hpp:30, from /usr/include/boost/coroutine/coroutine.hpp:13, from boost-coroutine-bool-return.cpp:11: /usr/include/boost/coroutine/detail/holder.hpp: In instantiation of ‘struct boost::coroutines::detail::holder<bool>’: /usr/include/boost/coroutine/v1/detail/coroutine_base_resume.hpp:103:28: required from ‘void boost::coroutines::detail::coroutine_base_resume<Signature, D, void, 1>::resume(boost::coroutines::detail::coroutine_base_resume<Signature, D, void, 1>::arg_type) [with Signature = void(bool); D = boost::coroutines::detail::coroutine_base<void(bool)>; boost::coroutines::detail::coroutine_base_resume<Signature, D, void, 1>::arg_type = bool]’ /usr/include/boost/coroutine/v1/detail/coroutine_op.hpp:268:9: required from ‘D& boost::coroutines::detail::coroutine_op<Signature, D, void, 1>::operator()(boost::coroutines::detail::coroutine_op<Signature, D, void, 1>::arg_type) [with Signature = void(bool); D = boost::coroutines::coroutine<void(bool), 1>; boost::coroutines::detail::coroutine_op<Signature, D, void, 1>::arg_type = bool]’ boost-coroutine-bool-return.cpp:29:13: required from here /usr/include/boost/coroutine/detail/holder.hpp:39:14: error: ‘boost::coroutines::detail::holder<Data>::holder(boost::coroutines::detail::coroutine_context*, bool) [with Data = bool]’ cannot be overloaded explicit holder( coroutine_context * ctx_, bool force_unwind_) : ^ /usr/include/boost/coroutine/detail/holder.hpp:35:14: error: with ‘boost::coroutines::detail::holder<Data>::holder(boost::coroutines::detail::coroutine_context*, Data) [with Data = bool]’ explicit holder( coroutine_context * ctx_, Data data_) : At a glance it looks like there's no way a coroutine-function could possibly return bool due to the overload collision. Is this right? Did I miss something completely obvious in the docs? It's easy enough to work around with a transparent bool wrapper, I just want to be sure I'm not being a muppet :-D TIA -- rob -- Rob Desbois http://theotherbranch.wordpress.com/

2 1

Boost PropertyTree: read_json() followed by write_xml produces invalid XML
by Marcel Loose 27 Apr '14

27 Apr '14

Hi all, I was quite surprised and disappointed to find out that I was unable to convert a simple JSON file into XML, using the Boost PropertyTree. As input I used the example JSON file from the documentation (see example.json below). I wrote a small program (see example.cc below) that reads in this JSON file, writes it to disk as XML file, and finally tries to read back this XML file. This last operation fails with an exception (see output below); the XML file that is produced (see example.xml below) is invalid, because it contains empty tags (<>). Am I doing something wrong? Best regards, Marcel Loose. $ cat example.json { "menu": { "foo": true, "bar": "true", "value": 102.3E+06, "popup": [ {"value": "New", "onclick": "CreateNewDoc()"}, {"value": "Open", "onclick": "OpenDoc()"} ] } } $ cat example.cc #include <boost/property_tree/ptree.hpp> #include <boost/property_tree/json_parser.hpp> #include <boost/property_tree/xml_parser.hpp> #include <fstream> using namespace std; using namespace boost::property_tree; int main() { ptree pt; { read_json("example.json", pt); ofstream ofs("example.xml"); write_xml(ofs, pt, xml_writer_make_settings(' ', 2)); } { ifstream ifs("example.xml"); read_xml(ifs, pt); } return 0; } $ ./example terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::property_tree::xml_parser::xml_parser_error> >' what(): <unspecified file>(7): expected element name Aborted $ cat example.xml <?xml version="1.0" encoding="utf-8"?> <menu> <foo>true</foo> <bar>true</bar> <value>102.3E+06</value> <popup> <> <value>New</value> <onclick>CreateNewDoc()</onclick> </> <> <value>Open</value> <onclick>OpenDoc()</onclick> </> </popup> </menu>

3 3

Library advice
by Mathew Benson 27 Apr '14

27 Apr '14

Is there a boost library that I can use to dynamically deserialize structures from untyped buffers? I need to write code that receives a buffer of data from another computer, with some data serialized with bitfield structs. Yes, I do understand the difficulty of doing this and that it would have been easier if the data was serialized properly before transmission. I have no control over the transmitted data, but I can get the data format defined accurately. I fully understand the numerous edge cases and pitfalls with doing this and don't take the task lightly. Therefore, I'm looking for libs and open source code to make it easier. The incoming data format can and frequently does change so I can't hard code the format, but the format is defined in an XML file. I wrote an internal database containing field type, offset, and bit lengths, and populated via the XML file. My XML file is auto generated to match the as built interface definition, bit for bit. I wrote code that deserializes most of the data, but I need to rewrite it as a general purpose function to work for all cases, including bitfield structs. For now, I can assume same CPU (little endian) and the same compiler (gcc). However, both source and destination CPUs and OS's might be 32 bit or 64 bit. In future versions, I would like to add support for endian conversion and differing compiler packing. Does boost have something that would help? Sent from my Packard Bell 386

3 3

[Range] Extending the library for a base class and all its derived - enable_if
by Albert Yiamakis 26 Apr '14

26 Apr '14

Hello, I am looking to make a class, whose definition I cannot touch, model a Range concept. To that end I use method 2, http://www.boost.org/doc/libs/1_55_0/libs/range/doc/html/range/reference/ex… However, I am unable to specialize the relevant metafunctions (range_const_iterator, range_mutable_iterator, range_iterator) since they do not have an additional template parameter that would permit me to employ enable_if. I have found this impossible without touching either the class' definition or the metafunctions. Perhaps there is some other trick I am not aware of, in which case I would greatly appreciate hearing about it. If such a trick does not exist, then should these metafunctions feature an additional template parameter? Given that this is one of the methods to extend the library, it would make sense that one wishes to do so on conditions that enable_if can check. Albert

4 9

[Interprocess] Named objects with 'Managed External Buffer' (newbie)
by Jorge Bellon 25 Apr '14

25 Apr '14

Good afternoon, First, I apologize if I'm asking something obvious or outside the acceptable topics. I'm starting to use Boost so I'm quite newbie. I'm interested in using the managed_external_buffer in order to perform buffer copies into a created buffer that was created previously. Therefore, I will be storing mostly raw data into that buffer. Basically, I'm trying to do the following: Suppose a program uses the following int array: int numbers[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; Eventually, I have to copy a chunk of that array into a pre-allocated buffer (i.e. the managed_external_buffer). Let the chunk be defined with: typedef struct { void* addr; size_t size; } chunk_t; However, these chunks can overlap, so I will sometimes merge two overlapping chunks into a bigger one. Example: // Chunk 1 chunk1_addr = (void*)&numbers[3]; chunk1_size = 3 * sizeof(int); // Chunk 2 chunk2_addr = (void*) &numbers[4]; chunk2_size = 4 * sizeof(int); The desired result is a single chunk containing {3, 4, 5, 6, 7}. The proposed problem is the merge, but how to find those chunks in the managed_external_buffer, so my question is the following: - Would it be possible to use named objects with another data type other than CharType and use managed_external_buffer::find to look for them? The thing is I could generate a hash or a numerical ID to identify the chunk. Generating a string using that number could be done but it would not be efficient. Otherwise, I guess I would have to keep a map (or other collection) with the <chunk ID, chunk pointer> pairs, define the managed_external_buffer with boost::interprocess::null_index (since I won't be using named objects) and use it through allocate and deallocate. Is this correct? Thanks in advance, Jorge WARNING / LEGAL TEXT: This message is intended only for the use of the individual or entity to which it is addressed and may contain information which is privileged, confidential, proprietary, or exempt from disclosure under applicable law. If you are not the intended recipient or the person responsible for delivering the message to the intended recipient, you are strictly prohibited from disclosing, distributing, copying, or in any way using this message. If you have received this communication in error, please notify the sender and destroy and delete any copies you may have received. http://www.bsc.es/disclaimer

2 1

[msm] compilation warning with boost-1.55.0
by samriti katoch 25 Apr '14

25 Apr '14

Hi, With boost-1.55.0 I see this warning from msm code: In file included from /build/boost/fusion/include/make_map.hpp:10, from /build/boost/msm/front/euml/common.hpp:40, from /build/boost/msm/front/euml/operator.hpp:15, from /build/abc.cc:15: cc1plus: warnings being treated as errors /build/boost/msm/back/fold_to_list.hpp:35: warning: 'boost::msm::back::states_' defined but not used What is a good way to remove this warning? Thanks! Samriti

2 2

Free Workshop: Test-Driven Development in C++ (Salt Lake City, UT)
by legalize+jeeves＠mail.xmission.com 25 Apr '14

25 Apr '14

[Please do not mail me a copy of your followup] This will be a practice run of my presentation for C++ Now! 2014. Workshop announcement: <http://bit.ly/RQgOtQ> Excerpt from the announcement: Test-Driven Development in C++, Wednesday, April 30, 2014 Have you heard about that new thing the kids are doing called test-driven development and wondered what it's all about? Is it about testing? Is it about design? Is it good or is it bad? Come join me for an evening workshop where I will show you what it's all about and you'll have a chance to try it out for yourself on a problem large enough to be interesting, but small enough that you can make progress on it during the workshop. The workshop will use the Boost.Test and Turtle libraries. Thanks to Fusion-io for the meeting facilities, WiFi access, food (pizza from The Pie) and refreshments. -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

1 0

circular buffer in a multithreaded program
by Sebastian Gesemann 24 Apr '14

24 Apr '14

Hello! I had some troubles with using boost::circular_buffer in a multithreaded application and I'm not really sure whether I actually ran into a bug or wether I expected just too much that wasn't promised in the thread-safety section. Anyhow, I wanted to share my story and a theory of what possibly went wrong. Maybe this posting even contains some ideas of how circular_buffer could be made a little more thread-safe without ading any mutex- or atomics-based synchronization. What I tried to do: I tried to grant one thread write access to a sub-range in a circular_buffer while another thread had read-access to a non-overlapping sub-range. At no time any capacity change was needed. Occasionally, in a reader thread I would "consume" some of the values that were already "committed" by a writer and make more room for the writer to store new data by - locking a mutex - calling cb.erase_first(n); - calling cb.resize(cb.capacity()); - notify writer that there is new free space to write stuff into - unlocking the mutex As for iterator invalidation, erase_first just invalidates iterators to the elements being removed. And resize in this case just increases the size again to the capacity which should not invalidate any iterators If I understand correctly. But the program did not work. The first thing that came to my attention was that the checked iterators of circular_buffer don't support this kind of multithreading as they register and unregister themselves into a linked list without any synchronization. But even after disabling the checked iterators via BOOST_CB_DISABLE_DEBUG, the program still did not work. I could not figure out why (with enough certainty) and eventually replaced circular_buffer with a custom vector-based data structure. My guess is that the iterators of a circular_buffer somehow depend on some part of the state of the buffer that is modifed by erase_first. Then, I would have a data race. But such a dependency does not really have to be there. In my own implementation, an iterator is "self-sufficient" in the sense that it does not need to access any of the buffer's state (indices, counters and whatnot) to access the right elements. And this way, erasing some unneeded elements from the buffer while some other thread still works on other values in the buffer via iterators does not cause a data race. In my opinion, it's reasonable to expect something like this to work using a circular_buffer. Maybe someone knows more about how circular_buffer iterators are implemented and/or wants to improve the circular_buffer implementation w.r.t. thread-safety to support this kind of use. Since I switched to a custom data structure that is able to deal with this situation, I did not investiage this issue with circular_buffer any further. I already lost about a day because of this. I hope, this is of interest to somebody who wants to avoid exessive copying in the standard "producer-consumer / bounded-buffer pattern". Cheers! Sebastian

5 10

Memory leak in boost::filesystems::parent_path()?
by B.W.H. van Beest 24 Apr '14

24 Apr '14

Hi, The following minimal program (only 7 lines) causes valgrind to report 2 errors, in line6: Some somebody point me to why it is wrong? a.cpp: 1 #include <boost/filesystem.hpp> 2 3 int main( int, char** ) 4 { 5 boost::filesystem::path path0( "/a/b/c" ); 6 boost::filesystem::path path1 = path0.parent_path(); 7 } Compiling and running with valgrind: g++ -g -lboost_system -lboost_filesystem a.cpp -o a.exe valgrind ./a.exe This gives the following output. Note the errors. ==13303== Memcheck, a memory error detector ==13303== Copyright (C) 2002-2012, and GNU GPL'd, by Julian Seward et al. ==13303== Using Valgrind-3.8.1 and LibVEX; rerun with -h for copyright info ==13303== Command: ./a.exe ==13303== ==13303== Invalid read of size 8 ==13303== at 0x5B0A5C8: wcscmp (in /lib64/libc-2.18.so) ==13303== by 0x52CA5C4: std::moneypunct<wchar_t, false>::~moneypunct() (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x52CA638: std::moneypunct<wchar_t, false>::~moneypunct() (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x52C1304: std::locale::_Impl::~_Impl() (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x52C143C: std::locale::~locale() (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x5AA775E: __cxa_finalize (in /lib64/libc-2.18.so) ==13303== by 0x503DD72: ??? (in /usr/lib64/libboost_filesystem.so.1.53.0) ==13303== by 0x400EE69: _dl_fini (in /lib64/ld-2.18.so) ==13303== by 0x5AA73D8: __run_exit_handlers (in /lib64/libc-2.18.so) ==13303== by 0x5AA7424: exit (in /lib64/libc-2.18.so) ==13303== by 0x5A90BEB: (below main) (in /lib64/libc-2.18.so) ==13303== Address 0x604c038 is 0 bytes after a block of size 8 alloc'd ==13303== at 0x4C284B7: operator new[](unsigned long) (in /usr/lib64/valgrind/vgpreload_memcheck-amd64-linux.so) ==13303== by 0x52CBC81: std::moneypunct<wchar_t, false>::_M_initialize_moneypunct(__locale_struct*, char const*) (in /usr/lib64/libstdc++.so.6 .0.18) ==13303== by 0x52C3807: std::locale::_Impl::_Impl(char const*, unsigned long) (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x52C42D1: std::locale::locale(char const*) (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x50451B1: boost::filesystem::path::codecvt() (in /usr/lib64/libboost_filesystem.so.1.53.0) ==13303== by 0x5046C7E: boost::filesystem::path::parent_path() const (in /usr/lib64/libboost_filesystem.so.1.53.0) ==13303== by 0x401843: main (a.cpp:6) ==13303== ==13303== Invalid read of size 8 ==13303== at 0x5B0A5C8: wcscmp (in /lib64/libc-2.18.so) ==13303== by 0x52CA4D4: std::moneypunct<wchar_t, true>::~moneypunct() (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x52CA548: std::moneypunct<wchar_t, true>::~moneypunct() (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x52C1304: std::locale::_Impl::~_Impl() (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x52C143C: std::locale::~locale() (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x5AA775E: __cxa_finalize (in /lib64/libc-2.18.so) ==13303== by 0x503DD72: ??? (in /usr/lib64/libboost_filesystem.so.1.53.0) ==13303== by 0x400EE69: _dl_fini (in /lib64/ld-2.18.so) ==13303== by 0x5AA73D8: __run_exit_handlers (in /lib64/libc-2.18.so) ==13303== by 0x5AA7424: exit (in /lib64/libc-2.18.so) ==13303== by 0x5A90BEB: (below main) (in /lib64/libc-2.18.so) ==13303== Address 0x604c268 is 0 bytes after a block of size 8 alloc'd ==13303== at 0x4C284B7: operator new[](unsigned long) (in /usr/lib64/valgrind/vgpreload_memcheck-amd64-linux.so) ==13303== by 0x52CB6B1: std::moneypunct<wchar_t, true>::_M_initialize_moneypunct(__locale_struct*, char const*) (in /usr/lib64/libstdc++.so.6. 0.18) ==13303== by 0x52C3854: std::locale::_Impl::_Impl(char const*, unsigned long) (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x52C42D1: std::locale::locale(char const*) (in /usr/lib64/libstdc++.so.6.0.18) ==13303== by 0x50451B1: boost::filesystem::path::codecvt() (in /usr/lib64/libboost_filesystem.so.1.53.0) ==13303== by 0x5046C7E: boost::filesystem::path::parent_path() const (in /usr/lib64/libboost_filesystem.so.1.53.0) ==13303== by 0x401843: main (a.cpp:6) ==13303== ==13303== ==13303== HEAP SUMMARY: ==13303== in use at exit: 0 bytes in 0 blocks ==13303== total heap usage: 483 allocs, 483 frees, 34,115 bytes allocated ==13303== ==13303== All heap blocks were freed -- no leaks are possible ==13303== ==13303== For counts of detected and suppressed errors, rerun with: -v ==13303== ERROR SUMMARY: 2 errors from 2 contexts (suppressed: 2 from 2)

3 4

cmake + CUDA 6 + clang + boost errors on OS X Mavericks
by John Owens 24 Apr '14

24 Apr '14

Greetings, I’m using boost (1.55) (installed via macports) on: - OS X Mavericks - using clang (5.1, the Xcode default version, LLVM 3.4) - with CUDA 6 - and cmake (2.8.12.2). It has a large number of compile errors, shown here: http://pastebin.com/Qg2V0UwM that begin with: /opt/local/include/boost/type_traits/is_abstract.hpp(72): error: identifier "__is_abstract" is undefined I’d be delighted to have any advice on how to do cmake + CUDA 6 + clang + boost on OS X! JDO

1 0

include error in OS X 10.9.2
by Freddy Martinez Garcia 22 Apr '14

22 Apr '14

Hi guys I’m trying to use mongodb in my develop. MongoDB use Boost library in its implementation… I had installed boost 1.55 with macport… the problem is when the mongo c++ driver import son files like: #include <boost/function.hpp> and this file does not exists in my system… How can I fix this in Mac ?? I’m new in os x, because in linux I don’t have this error… best regards freddy

1 0

[Boost][Graph] vf2 implementation question
by Marc Viala 20 Apr '14

20 Apr '14

Hi, Recently,I tried to use Boost.Graph's VF2 implementation and after having played few days with this module, I was wondering if this implementation supports "adjacency_matrix" model as explained by the documentation (cf. http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/vf2_sub_graph_iso.html) To demonstrate my point, you will find hereafter an C++ example extracted from the Boost.Graph's documentation. If the macro "ADJACENCY_LIST_STRUCT" is commented out, this code can't be compiled w/ VS2012 aka VC11 because the static assertion @line 837 of "boost/graph/vf2_sub_graph_iso.hpp" is triggered. My questions are: - Does this VF2 implementation supports "adjacency_matrix" model? - Is there any patch for supporting this model of graph? FYI: If I comment two static assertations in file "boost/graph/vf2_sub_graph_iso.hpp", at line 837 and line 843, the code compiles and runs correctly for "adjacency_matrix" model. #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_matrix.hpp> #include <boost/graph/vf2_sub_graph_iso.hpp> using namespace boost; //#define ADJACENCY_LIST_STRUCT int main() { #ifdef ADJACENCY_LIST_STRUCT typedef adjacency_list<vecS, vecS, undirectedS> graph_type; #else typedef adjacency_matrix<undirectedS> graph_type; #endif // Build graph1. const int num_vertices1 = 8; graph_type graph1(num_vertices1); add_edge(0, 6, graph1); add_edge(0, 7, graph1); add_edge(1, 5, graph1); add_edge(1, 7, graph1); add_edge(2, 4, graph1); add_edge(2, 5, graph1); add_edge(2, 6, graph1); add_edge(3, 4, graph1); // Build graph2. const int num_vertices2 = 9; graph_type graph2(num_vertices2); add_edge(0, 6, graph2); add_edge(0, 8, graph2); add_edge(1, 5, graph2); add_edge(1, 7, graph2); add_edge(2, 4, graph2); add_edge(2, 7, graph2); add_edge(2, 8, graph2); add_edge(3, 4, graph2); add_edge(3, 5, graph2); add_edge(3, 6, graph2); // Compute de subgraph isomorphing. vf2_print_callback<graph_type, graph_type> cb(graph1, graph2); vf2_subgraph_iso(graph1, graph2, cb); } Best regards, Marc

1 0

[Iostream] how to build iostream with zlib on windows
by Pritesh Acharya 18 Apr '14

18 Apr '14

Boost version: 1.55.0 OS: Windows 8 IDE: Visual Studio 2010 Is there a good tutorial on building boost iostream with zlib on windows. I looked over reference manual but with no solution. I did download zlib dll and source code and made reference in visual studio. I have link error on gzip_decompressor();

3 2

Using metric_tsp_approx with bundled properties
by Alexis Praga 18 Apr '14

18 Apr '14

Hi, I am trying to use metric_tsp_approx on a graph defined as : typedef adjacency_list<vecS, vecS, undirectedS, City, Road> Graph; City contains the vertex id and Road the edge weight. After reading the documentation, I arrived to : metric_tsp_approx(g_init, weight_map(get(&Road::length, g_init)). vertex_index_map(get(&City::id, g_init)), make_tsp_tour_visitor(back_inserter(c))); I have compilation errors however. The relevant part seems to be : /usr/include/boost/property_map/property_map.hpp:382:58: error: no type named ‘key_type’ in ‘struct boost::property_traits<boost::bgl_named_params<boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, City, Road>, long unsigned int, City, int>, boost::vertex_index_t, boost::no_property> >’ Any help appreciated, thanks. -- Alexis Praga, PhD Student (CERFACS) GPG key : AD4A AF6D BB5C 042F 9422 1223 06E1 C1BF E287 65D0

3 7

[asio]Does the function of async_read can find the tcp connection has closed?
by lx 18 Apr '14

18 Apr '14

hi all: I want to know async_read or async_write can detect the tcp connection has closed, or not? thank you

3 4

[container] header reference for most containers is unavailable in Boost 1.55
by Adam Romanek 17 Apr '14

17 Apr '14

Hi! there's a problem with the documentation of most containers from Boost.Container in Boost 1.55. The problem is that hyper-links seem to be missing, i.e. I can't click on deque, list or map. However, the links to the reference of vector or string are fine... WBR, Adam Romanek [1] http://www.boost.org/doc/libs/1_55_0/doc/html/boost_container_header_refere…

1 0

boost serialize issue when compile 64 bit application
by gary jiang 17 Apr '14

17 Apr '14

Hi all, I am compiling 64 bit application, and got lots of errors about boost serializer, but I don't have any issue when compile 32 bit application. Is there some attention when transform from 32 bit boost to 64 bit boost? Any advice would be appreciate, thanks in advance! PS: We used intel toolchain to compile boost, and tried with different boost version, still got same errors. Regards, Gary Main.o: In function `boost::archive::detail::iserializer<CMyText_iarchive, AtworkPathInfo>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const': Main.cpp:(.text._ZNK5boost7archive6detail11iserializerI16CMyText_iarchive15AtworkPathInfoE16load_object_dataERNS1_14basic_iarchiveEPvj[_ZNK5boost7archive6detail11iserializerI16CMyText_iarchive15AtworkPathInfoE16load_object_dataERNS1_14basic_iarchiveEPvj]+0x4b): undefined reference to `void AtworkPathInfo::serialize<CMyText_iarchive>(CMyText_iarchive&, unsigned int)' Schedule.o: In function `boost::archive::detail::iserializer<CMyText_iarchive, GERINFO>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const': Schedule.cpp:(.text._ZNK5boost7archive6detail11iserializerI16CMyText_iarchive11GERINFOE16load_object_dataERNS1_14basic_iarchiveEPvj[_ZNK5boost7archive6detail11iserializerI16CMyText_iarchive11GERINFOE16load_object_dataERNS1_14basic_iarchiveEPvj]+0x4b): undefined reference to `void GERINFO::serialize<CMyText_iarchive>(CMyText_iarchive&, unsigned int)' Images.o: In function `boost::archive::detail::iserializer<CMyText_iarchive, MNTINFO>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const': Images.cpp:(.text._ZNK5boost7archive6detail11iserializerI16CMyText_iarchive9MNTINFOE16load_object_dataERNS1_14basic_iarchiveEPvj[_ZNK5boost7archive6detail11iserializerI16CMyText_iarchive9MNTINFOE16load_object_dataERNS1_14basic_iarchiveEPvj]+0x4b): undefined reference to `void MNTINFO::serialize<CMyText_iarchive>(CMyText_iarchive&, unsigned int)' Images.o: In function `boost::archive::detail::iserializer<CMyText_iarchive, VOLUMEINFO>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const': Images.cpp:(.text._ZNK5boost7archive6detail11iserializerI16CMyText_iarchive13VOLUMEINFOE16load_object_dataERNS1_14basic_iarchiveEPvj[_ZNK5boost7archive6detail11iserializerI16CMyText_iarchive13VOLUMEINFOE16load_object_dataERNS1_14basic_iarchiveEPvj]+0x4b): undefined reference to `void VOLUMEINFO::serialize<CMyText_iarchive>(CMyText_iarchive&, unsigned int)' Info.o: In function `boost::archive::detail::oserializer<CMyText_oarchive, MAPPINGINFO>::save_object_data(boost::archive::detail::basic_oarchive&, void const*) const': Info.cpp:(.text._ZNK5boost7archive6detail11oserializerI16CMyText_oarchive14MAPPINGINFOE16save_object_dataERNS1_14basic_oarchiveEPKv[_ZNK5boost7archive6detail11oserializerI16CMyText_oarchive14MAPPINGINFOE16save_object_dataERNS1_14basic_oarchiveEPKv]+0x5a): undefined reference to `void MAPPINGINFO::serialize<CMyText_oarchive>(CMyText_oarchive&, unsigned int)' Info.o: In function `boost::archive::detail::iserializer<CMyText_iarchive, MAPPINGINFO>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const': Info.cpp:(.text._ZNK5boost7archive6detail11iserializerI16CMyText_iarchive14MAPPINGINFOE16load_object_dataERNS1_14basic_iarchiveEPvj[_ZNK5boost7archive6detail11iserializerI16CMyText_iarchive14MAPPINGINFOE16load_object_dataERNS1_14basic_iarchiveEPvj]+0x4b): undefined reference to `void MAPPINGINFO::serialize<CMyText_iarchive>(CMyText_iarchive&, unsigned int)' make[1]: *** [service] Error 1 make[1]: Leaving directory `/home/gary/product_100/CoreService' make: *** [all] Error 1

2 2

[container] vector::resize() - value-initialization vs default-initialization
by Adam Romanek 16 Apr '14

16 Apr '14

Hi! first, I'd like to focus on Boost 1.54. The documentation of boost::container::vector::resize(size_type) says the elements are *default constructed* [1]. The same applies to the respective constructor: boost::container::vector(size_type n). This is a significant deviation from what C++11 std::vector::resize(size_type) does as it *value-initializes* the new elements. Is the documentation of Boost.Container wrong in this case? Or the behavior of the container differs from the one defined by the standard? On the other hand in Boost 1.55 I see some changes related to the way elements are constructed (not mentioned in the release note). A new constructor and resize() method were added taking default_init_t to indicate default construction of new elements is desired. However, the documentation of boost::container::resize(size_type new_size, default_init_t) says the new elements are value initialized [2]. Note that the documentation of the respective constructor is correct and says the elements are default constructed. I also assume that the addition of the new constructor/resize method changed the behavior of the original constructor/resize method to be compliant with std::vector. Finally, @Ion: thanks for your good work on this library. I use it more and more often as it provides great features, useful especially in C++03 environments. If you want me to file any tickets on the above-mentioned issues please just say so. WBR, Adam Romanek [1] http://www.boost.org/doc/libs/1_54_0/doc/html/boost/container/vector.html#i… [2] http://www.boost.org/doc/libs/1_55_0/doc/html/vector.html#idp20954152-bb

2 4

Build boost on OSX 10.9 with GCC 4.8
by Jürgen Simon 16 Apr '14

16 Apr '14

Hello, I have a somewhat specific problem. I need to build Boost 1.55 with the GCC 4.8 compiler on the mac. I have installed gcc-4.8 using homebrew. Using the GCC compiler instead of clang is non-negotiable in my case, because I require OpenMP which is not implemented in clang yet. Given that, I tried to build boost this way: export CC=/usr/local/Cellar/gcc48/4.8.2/bin/gcc-4.8 export CXX=/usr/local/Cellar/gcc48/4.8.2/bin/g++-4.8 export LD=/usr/local/Cellar/gcc48/4.8.2/bin/g++-4.8 ./bootstrap.sh —with-toolset=gcc-4.8 gives an error: Building Boost.Build engine with toolset gcc-4.8... Failed to build Boost.Build build engine Consult 'bootstrap.log' for more details apparently it does not recognize the gcc-4.8 toolkit. Using gcc instead does create the b2 script, but running the script as is also created trouble: ./bootstrap.sh —with-toolset=gcc ./b2 common.mkdir bin.v2/libs/atomic/build/gcc-4.2.1 common.mkdir bin.v2/libs/atomic/build/gcc-4.2.1/release common.mkdir bin.v2/libs/atomic/build/gcc-4.2.1/release/threading-multi gcc.compile.c++ bin.v2/libs/atomic/build/gcc-4.2.1/release/threading-multi/lockpool.o In file included from libs/atomic/src/lockpool.cpp:3: In file included from ./boost/atomic.hpp:12: In file included from ./boost/atomic/atomic.hpp:17: In file included from ./boost/atomic/detail/platform.hpp:22: ./boost/atomic/detail/gcc-atomic.hpp:961:64: error: no matching constructor for initialization of 'storage_type' (aka 'boost::atomics::detail::storage128_type') explicit base_atomic(value_type const& v) BOOST_NOEXCEPT : v_(0) specifying the toolkit gcc-4.8 here does actually do something: ./bootstrap.sh —with-toolset=gcc ./b2 -d 2 toolset=gcc-4.8 but it results in linker errors, like the following two examples: "g++-4.8" -Wl,-R -Wl,"/System/Library/Frameworks/Python.framework/Versions/2.7/lib" -Wl,-R -Wl,"/System/Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/config" -o "stage/lib/libboost_iostreams.dylib" -Wl,-h -Wl,libboost_iostreams.dylib -shared -Wl,--start-group "bin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi/file_descriptor.o" "bin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi/mapped_file.o" "bin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi/bzip2.o" -Wl,-Bstatic -Wl,-Bdynamic -lbz2 -Wl,--end-group ld: unknown option: -R "g++-4.8" -o "bin.v2/libs/atomic/build/gcc-4.8/release/threading-multi/libboost_atomic.dylib" -Wl,-h -Wl,libboost_atomic.dylib -shared -Wl,--start-group "bin.v2/libs/atomic/build/gcc-4.8/release/threading-multi/lockpool.o" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group ld: unknown option: -h I tried for two days without success to get GCC-4.8 and Boost to play ball together on the Mac. What am I missing? Kind Regards, Jürgen

2 2

can not compile nearest neighbors in d dimensions
by Georgios Samaras 16 Apr '14

16 Apr '14

I can not create a point in d(in the code M is dimensions) dimensions. The error is this: error: the value of ‘M’ is not usable in a constant expression note: ‘int M’ is not const error: template argument 2 is invalid and the line is this: int M; .. typedef bg::model::point<float, M, bg::cs::cartesian> point; Then, I am trying to create an Rtree (I have already the data in a 2D array), like this: // create the rtree using default constructor bgi::rtree< point, bgi::quadratic<16> > rtree; point tmp; for ( unsigned i = 0 ; i < N ; ++i ) { // insert new value for(int j = 0 ; j < M ; ++j) { bg::set<M>(tmp, a[i][j]); } rtree.insert(tmp); } and I think the error is in insert(). I am attaching a file with the minimal code and one with the errors I receive (I receive another one too). I am struggling to achieve that all day long. :/

6 32

Interprenting nearest's neighbor's output
by Georgios Samaras 15 Apr '14

15 Apr '14

I am running the code found here http://www.boost.org/doc/libs/1_54_0_beta1/libs/geometry/doc/html/geometry/… (not the intersect query, only the nn). The output is this: " knn query point: POINT(0 0) knn query result: POLYGON((4 4,4 4.5,4.5 4.5,4.5 4,4 4)) - 4 POLYGON((3 3,3 3.5,3.5 3.5,3.5 3,3 3)) - 3 POLYGON((2 2,2 2.5,2.5 2.5,2.5 2,2 2)) - 2 POLYGON((0 0,0 0.5,0.5 0.5,0.5 0,0 0)) - 0 POLYGON((1 1,1 1.5,1.5 1.5,1.5 1,1 1)) - 1 " What are the integers on the right? Indices of the polygons? Actually is not really clear to me what are we inserting in the tree..I tried finding some documentation on these methods, but I only found info on how to call them... What I want, is simply inserting some points in the tree and then search for nn of a query point. Thanks in advance, George

2 5

[Boost-Interprocess] Suggested approach for message_queue with dynamically sized messages
by Rob Conde 14 Apr '14

14 Apr '14

I want to use boost::interprocess and message_queue...however, the need to specify a max message size is an inhibitor because my message data doesn't necessarily have a limit in size. What is the suggested approach for this scenario? The best I can think of at the moment is to have a "start object" and "stop object" message, and then a "data" message. Then I just send the object in chunks of max_msg_size and reconstitute on the other side. This is all quite possible of course, but if there was a prescribed way to handle this without opening myself to these complexities it would be nice. Thanks in advance, Rob Conde

1 0

Boost Universal Build
by •°o.O sαмι O.o°• 14 Apr '14

14 Apr '14

Hi, I am trying to build boost for all Mac platforms universally, I am having PPC and Intel architecture both. I am using this command to build boost 1_46_1. * ./bjam architecture=combined address-model=32_64 * and got following errors for almost every file: *./boost/python/detail/make_tuple.hpp:25: error: no matching function for call to \'91incref(<type error>)\'92\./boost/python/detail/make_tuple.hpp:25: error: \'91class boost::python::tuple\'92 has no member named \'91ptr\'92\ ./boost/python/detail/make_tuple.hpp:25: error: there are no arguments to \'91PyTuple_SET_ITEM\'92 that depend on a template parameter, so a declaration of \'91PyTuple_SET_ITEM\'92 must be available\* and "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -dynamic -no-cpp-precomp -gdwarf-2 -Wno-long-double -fPIC -arch i386 -arch ppc -arch x86_64 -DBOOST_ALL_NO_LIB=1 -DBOOST_PYTHON_SOURCE -DNDEBUG -I"." -I"/System/Library/Frameworks/Python.framework/Versions/2.6/include/python2.6" -c -o "bin.v2/libs/python/build/darwin-4.0.1/release/address-model-32_64/architecture-combined/threading-multi/object/stl_iterator.o" "libs/python/src/object/stl_iterator.cpp"\ \ *...failed darwin.compile.c++ bin.v2/libs/python/build/darwin-4.0.1/release/address-model-32_64/architecture-combined/threading-multi/object/stl_iterator.o...\* please help me out if I am doing anything wrong or there is any other way of doing this. kind regards;

1 0

Re: [Boost-users] Is selective header including supposed to work?
by Johannes Lorenz 14 Apr '14

14 Apr '14

Joel de Guzman wrote: > It should work, but the savings in compile time will be minimal. > If you want to reduce compile and build time, follow the example > in the compiler tutorial from calc7 up. The trick is to modularize > your grammars and put the definitions in separate cpp files (TUs). I think I start getting how it works. However, the dependency between statement and expression is not circular in calc7: expression seems to have no knowledge about statement. So if my dependency is circular (like e.g. expression and factor in calc2_ast), is it possible to separate them, as you suggest? Also, is there any documentation for calc7 or about TUs (what does TU mean?)? Again, many thanks for your kind answers.

1 0

Call for Papers for Meeting C++ 2014 - one more week
by Jens Weller 13 Apr '14

13 Apr '14

Hello boost community, there is one week left to submit your talk to Meeting C++ 2014: http://meetingcpp.com/index.php/submit-your-talk.html Newsentry at Meeting C++ http://meetingcpp.com/index.php/newsreader/items/call-for-papers-one-more-w… So far 20 talks are submitted, a few of them also cover boost, most C++11/Modern C++. I also could announce the keynotes yesterday: Opening Keynote - Scott Meyers Closing Keynote - Hartmut Kaiser thanks, Jens

1 0

phoenix bind vs boost bind?
by Robert Dailey 13 Apr '14

13 Apr '14

First of all, I'm using boost 1.55.0 on MSVC9. I've been using boost::phoenix in various places in my code base for easier usage of std::for_each and friends. However, I do not create lazy functions for a lot of the functions I bind to because they are only needed in one place most of the time. As a result, I use boost::phoenix::bind the same as I'd use boost::bind(). However I have read in various places that boost::bind is being deprecated. I'm not sure if there is truth to this, but is there a reason to choose one over the other? Is phx::bind() basically an "upgrade" to boost::bind? If I intermingle them, I have a lot of issues out of placeholder ambiguities that results in more boilerplate code (i.e. using boost::phoenix::placeholders::_1 everywhere). Any tips? I haven't used boost in a few years so I just want to make sure I'm not using it incorrectly. Thanks in advance.

5 6

Is selective header including supposed to work?
by Johannes Lorenz 12 Apr '14

12 Apr '14

Hello, I like Qi, but the compile times are terrible sometimes. My example is similar to this in [1], but it needs 3x as much time to compile. I thought this problem might be omitted by including selectively what is needed. So I went into [1] and replaced #include <boost/spirit/include/qi.hpp> by #include <boost/spirit/include/qi_action.hpp> #include <boost/spirit/include/qi_grammar.hpp> #include <boost/spirit/include/qi_uint.hpp> #include <boost/spirit/include/qi_char.hpp> . I got far, but then, there comes up a long error message, beginning like in [2]. My questions are: * is selectively including from "boost/spirit/include" supposed to work, or should this never be done? * if it should work, what is still left to be included in my case? My version of boost is 1.53. Many thanks on advance. Kind regards, Johannes [1] http://www.boost.org/doc/libs/1_41_0/libs/spirit/example/qi/calc2_ast.cpp [2] [...]/usr/include/boost/spirit/home/qi/nonterminal/rule.hpp:176:13: error: no matching function for call to ‘assertion_failed[...] /usr/include/boost/spirit/home/qi/nonterminal/rule.hpp:176:13: note: candidate is: /usr/include/boost/mpl/assert.hpp:79:5: note: template<bool C> int mpl_::assertion_failed(typename mpl_::assert<C>::type) int assertion_failed( typename assert<C>::type ); ^ /usr/include/boost/mpl/assert.hpp:79:5: note: template argument deduction/substitution failed:[...]

3 2

Re: [Boost-users] Is selective header including supposed to work?
by Johannes Lorenz 12 Apr '14

12 Apr '14

Hi, > #include <boost/spirit/include/qi_operator.hpp> sadly, it did not. It did for the AST example, but it does not for mine I uploaded the code on github [3 (mostly) and 4]. Can you please help me with this file? Is there any generic approach if you hit such errors? > BTW, if you care about the compile time, there's Spirit X3 in develope > which utilizes c++11/14 and it claims to compile faster. I am really looking forward to this Regards, Johannes [3] https://github.com/JohannesLorenz/sca-toolsuite/blob/master/src/res/equatio… [4] https://github.com/JohannesLorenz/sca-toolsuite/blob/master/src/res/equatio…

1 0

Building Boost from Modular Boost Repository
by Baptiste Wicht 11 Apr '14

11 Apr '14

Hi, I wanted to test some experimental features of Boost Spirit X3, so I tried to install Boost from the "Modular Boost" Git repository, but without success. I followed the instructions on https://svn.boost.org/trac/boost/wiki/TryModBoost and the b2 command failed: /home/wichtounet/src/modular-boost/tools/build/src/build/feature.jam:493: > in feature.validate-value-string from module feature > error: "none" is not a known value of feature <optimization> > error: legal values: "off" "speed" "space" > /home/wichtounet/src/modular-boost/tools/build/src/build/property.jam:273: > in validate1 from module property > /home/wichtounet/src/modular-boost/tools/build/src/build/property.jam:299: > in property.validate from module property > /home/wichtounet/src/modular-boost/tools/build/src/tools/builtin.jam:377: > in variant from module builtin > /usr/share/boost-build/site-config.jam:9: in modules.load from module > site-config > /home/wichtounet/src/modular-boost/tools/build/src/build-system.jam:249: > in load-config from module build-system > /home/wichtounet/src/modular-boost/tools/build/src/build-system.jam:351: > in load-configuration-files from module build-system > /home/wichtounet/src/modular-boost/tools/build/src/build-system.jam:524: > in load from module build-system > /home/wichtounet/src/modular-boost/tools/build/src/kernel/modules.jam:289: > in import from module modules > /home/wichtounet/src/modular-boost/tools/build/src/kernel/bootstrap.jam:139: > in boost-build from module > /home/wichtounet/src/modular-boost/boost-build.jam:17: in module scope > from module > I tried adding optimization=speed on the command line, but it didn't changed a thing. I tried the master and develop branches. Is there some configuration that is necessary ? Or is there another procedure to follow ? Thanks -- Baptiste Wicht, HES-SO University of applied Sciences My personal website - http://baptiste-wicht.com

2 4

nearest neighbors search with boost
by Georgios Samaras 11 Apr '14

11 Apr '14

I just find out that boost supports nearest neighbor searching, will amazes me. However, I do not want just to use the nearest() method, I want to study it and understand it. Is there any relevant documentation, specifically on how NNS is performed in R-tree? Are the code files that implement this method visible to the user? I downloaded the latest .tar file. Thank you in advance, Georgios PS - Hello Boost world! :)

2 1

possible bug with boost::is_convertible
by Matei David 11 Apr '14

11 Apr '14

Hi, I found a situation where (with gcc 4.8.2 & 1.55) I cannot compile a call to boost::is_convertible, but I can compile a similar call to std::is_convertible. I don't know yet if this is a bug. Is it undefined behaviour to pass is_convertible a type with a deleted or private copy ctor? Before I go into the details, I'd like to ask, which type_traits library should we prefer these days, post c++11? Intuition says std should be more stable/portable, is that wrong? If it is indeed std, is there a way (perhaps a macro?) to make boost mirror std (I'm talking about type_traits only). The reason for having such a mirror option is not for new code, but for other boost libraries which need type_traits. E.g, I came across this issue from boost::iterator. Here is the discordant code: #include <type_traits> #include <boost/type_traits/is_convertible.hpp> struct A { A() = default; A(const A&) = delete; // or private: A(const A&) = default; }; struct Ref_A { // proxy reference to A operator A& () { return *_ptr; } A* _ptr; }; int main() { (void)std::is_convertible< Ref_A, A >::value; (void)boost::is_convertible< Ref_A, A >::value; } I compile with: {g++|clang++} -std=c++11 -I${BOOST_INCLUDE} -Wall -Wextra -c With gcc 4.8.2, the call to boost::is_convertible fails, complaining that the copy ctor of A is deleted (or private.) The similar call to std::is_convertible compiles ok. With clang 3.4, both calls compile. The reason for the discrepancy is that boost/type_traits/intrinsics.hpp defines the macro BOOST_IS_CONVERTIBLE(T,U) for clang, but not for gcc. Because of that, at the bottom of boost/type_traits/is_convertible.hpp, clang uses the macro to implement is_convertible, whereas gcc uses is_convertible_impl_dispatch instead (which is the one that fails). A temporary fix I found is to define that macro to defer to std: #include <type_traits> #include <boost/type_traits/intrinsics.hpp> #ifndef BOOST_IS_CONVERTIBLE #define BOOST_IS_CONVERTIBLE(T, U) (std::is_convertible<T, U>::value) #endif #include <boost/type_traits/is_convertible.hpp> As I was asking above, is there a way to do that systematically for all type_traits? Thanks, M

1 0

[asio] Crash when posted handlers execute in one thread only?
by Sohail Somani 10 Apr '14

10 Apr '14

Hi, Not sure if there is a race condition in the code below, or if I am not stopping the service in a sanctioned manner but when run, the code consistently crashes on OSX 10.9 with Boost 1.55 and Clang. The only regular pattern was that the crash occurs when all the posted completion handlers execute in one thread only. When the completion handlers execute across both threads, there is no crash. This seems to me like there could be an initialization bug somewhere. I'll try and create a smaller test case. Thanks for any ideas or suggestions. The code: #define LOG(msg) { \ boost::mutex::scoped_lock lock(log_mutex); \ std::cout << "[" << boost::this_thread::get_id() \ << "] " << msg << std::endl; \ } void test() { boost::mutex log_mutex; LOG("Boost version: " << BOOST_LIB_VERSION); for(int ii = 0; ii < 100; ++ii) { LOG("Iteration: " << ii); boost::asio::io_service service; boost::asio::io_service::work work(service); boost::thread_group group; auto fun = [&](){ LOG("Starting service"); service.run(); LOG("Completing service"); }; group.create_thread(fun); group.create_thread(fun); int ntasks = 10; volatile int val = 2; std::vector<volatile int> ints(ntasks,val); for(int ii = 0; ii < ntasks; ++ii) { service.post([&ints,ii,&log_mutex]() { LOG("Task: " << ii); ints[ii] = 1; }); } service.post([&service,&log_mutex](){ LOG("Stopping service"); service.stop(); }); group.join_all(); for(int ii = 0; ii < ntasks; ++ii) { if(ints[ii] != 1) { LOG(ii << "->" << ints[ii]); } } } LOG("Done test"); } int main() { try { test(); } catch(...) { std::cout << "Exception in main()" << std::endl; } } The output + stack trace: ... [0x7fff7aeb9310] Iteration: 91 [0x104681000] Starting service [0x104704000] Starting service [0x104704000] Task: 0 [0x104704000] Task: 1 [0x104704000] Task: 2 [0x104704000] Task: 3 [0x104704000] Task: 4 [0x104704000] Task: 5 [0x104704000] Task: 6 [0x104704000] Task: 7 [0x104704000] Task: 8 [0x104704000] Task: 9 [0x104704000] Stopping service [0x104704000] Completing service [0x104681000] Completing service Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: KERN_INVALID_ADDRESS at address: 0x0000000104703c57 0x00007fff8b06cdf3 in _pthread_cond_updateval () (gdb) where #0 0x00007fff8b06cdf3 in _pthread_cond_updateval () #1 0x00007fff8b06c91e in _pthread_cond_signal () #2 0x00000001000048d0 in boost::asio::detail::posix_event::signal_and_unlock<boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex> > () at build/boost/include/boost/asio/detail/posix_event.hpp:62 #3 0x00000001000048d0 in boost::asio::detail::task_io_service::wake_one_idle_thread_and_unlock () at build/boost/include/boost/asio/detail/task_io_service.hpp:484 #4 0x00000001000048d0 in boost::asio::detail::task_io_service::wake_one_thread_and_unlock (this=<value temporarily unavailable, due to optimizations>, lock=<value temporarily unavailable, due to optimizations>) at posix_event.hpp:493 #5 0x0000000100004776 in boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex>::~scoped_lock () at task_io_service.ipp:278 #6 boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex>::~scoped_lock () at build/boost/include/boost/asio/detail/scoped_lock.hpp:52 #7 0x0000000100004776 in boost::asio::detail::task_io_service::post_immediate_completion (this=<value temporarily unavailable, due to optimizations>, op=<value temporarily unavailable, due to optimizations>, is_continuation=<value temporarily unavailable, due to optimizations>) at scoped_lock.hpp:279 #8 0x0000000100001952 in test () at task_io_service.hpp:70 #9 0x0000000100002ca0 in main () at app/exe/testcpp/main.cpp:64 (gdb) info threads 2 0x00007fff985fc662 in kevent64 () * 1 0x00007fff8b06cdf3 in _pthread_cond_updateval ()

3 5

Re: [Boost-users] [Graph] Questions and remarks
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Sun, Apr 6, 2014 4:14 AM PDT Albert Yiamakis wrote: >Hello, > >Some questions and remarks regarding Boost.Graph: > >i) Why does write_graphviz require a VertexEdgeListGraph? I was unable >to invoke it on an adjacency_list using sets as containers for vertices >and edges; instead I had to switch to vectors. However, the function is >meant to output - does the efficiency of the traversal really matter? The issue is more likely to be a missing vertex index map than that concept constraint. Graphs with setS as vertex container do not have that by default, and I believe the graphviz writer needs that. You can look online for how to create that map. >ii) Would it be possible to mutate the graph in the visitors of an >algorithm? For instance, generating the graph during a breadth-first >search, by adding vertices and edges. Presumably, it would be the user's >responsibility to color the vertices appropriately. (Interestingly, >visitors take a non-const reference to the graph - but compilation >failed at some other point). That would almost always be dangerous because of iterator and descriptor invalidation. The loop variables, current source vertex, etc. would often become invalid (and thus invalid to use) because of the structural modifications. > >iii) The documentation of the distance_recorder states that > >"A WritablePropertyMap where the key type and the value type are the >vertex descriptor type of the graph." > >which has to be a mistake. It seems this has already been pointed out in >the past >(http://boost.2283326.n4.nabble.com/BGL-distance-recorder-td2571349.html) > >but is yet to be corrected. Yes, that does appear to be a bug. -- Jeremiah Willcock

1 0

Re: [Boost-users] [Graph] Run-time weight search
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Tue, Apr 8, 2014 5:38 AM PDT Sensei wrote: >Dear all, > >after many speculations and your previous advice I've come to the conclusion that I still need your help :) > >The setting is simple: I have an oriented graph, and I have two nodes. I wish to find all paths from one node to the other. > >Some restrictions apply: >- I *cannot* calculate weights except at run-time when needed, it's too costly; >- I can, if you say it's needed, restrict the path length to a certain threshold. > >What can I relax? The "all paths". Since weights are costly, I could set for just the best path, i.e., the one with the lowest weight. I don't think it would be possible to find the optimum path, in case I cannot search for all possible paths, but I can be easily wrong. > >I'm not that skilled with BGL, so any help would be quite appreciated! I've read the Table of Contents, but at first I cannot see if this can be done. > You might consider using A* search instead of a normal shortest path algorithm. You don't need a heuristic function (just use one that always returns zero). There is a function_property_map type that you can use to turn a weight-computing function into a property map. -- Jeremiah Willcock

1 0

the asio example which implement the tcp long connection
by lx 10 Apr '14

10 Apr '14

hi : I want to learn how to implement long connection by asio.But I can't find example. So, where I can find ? Thank you.

1 0

conflicting intmax_t definitions - Boost 1.53 and gcc 4.8 incompatibility?
by Nate Finch 09 Apr '14

09 Apr '14

I recently upgraded to Ubuntu Trusty Tehr, and now the C++ project I'm working on won't build. It looks like the stdlib and Boost aren't working nicely together for some reason. A bunch of typedefs are conflicting between the two, below is one of the errors, where intmax_t is getting defined in two places. I'm not sure what changed, but I now have gcc (Ubuntu/Linaro 4.8.2-14ubuntu2) 4.8.2 and boost Version: 1.53.0.0ubuntu2 Here's an example error message: /usr/include/inttypes.h:290:8: error: reference to ‘intmax_t’ is ambiguous extern intmax_t imaxabs (intmax_t __n) __THROW __attribute__ ((__const__)); ^ In file included from /usr/lib/gcc/x86_64-linux-gnu/4.8/include/stdint.h:9:0, from /usr/include/inttypes.h:27, from src/uint256.h:11, from src/key.h:12, from src/crypter.h:8, from src/keystore.h:8, from src/script.h:14, from src/script.cpp:11: /usr/include/stdint.h:134:19: note: candidates are: typedef long int intmax_t typedef long int intmax_t; ^ In file included from /usr/include/boost/math_fwd.hpp:12:0, from /usr/include/boost/math/common_factor_ct.hpp:13, from /usr/include/boost/variant/variant.hpp:44, from /usr/include/boost/variant.hpp:17, from src/script.h:12, from src/script.cpp:11: /usr/include/boost/cstdint.hpp:306:50: note: typedef boost::long_long_type boost::intmax_t typedef ::boost::long_long_type intmax_t; Any help would be much appreciated. I'm fine with downgrading something, I'm just not sure what to downgrade.... or if there's an actual fix, that's cool too. -- View this message in context: http://boost.2283326.n4.nabble.com/conflicting-intmax-t-definitions-Boost-1… Sent from the Boost - Users mailing list archive at Nabble.com.

8 20

Re: [Boost-users] [serialization] [multimap] change of element's order when deserialize
by Pablo Madoery 09 Apr '14

09 Apr '14

Thank you for your quick answer. I think I will use a map of vector instead of a multimap. On Wed, Apr 9, 2014 at 12:18 PM, Robert Ramey <robertmacleranramey(a)gmail.com > wrote: > > > On Wednesday, April 9, 2014 7:45:59 AM UTC-7, Pablo Madoery wrote: >> >> I have the following code: >> > > >> snip ... >> >> where you can see that the element's order is changed. >> >> When compiling it throw this warning: >> boost::mpl::print<boost::serialization::BOOST_ >> SERIALIZATION_STATIC_WARNING_LINE<98> > >> > > that I don't know what it means. > > You'll have to look into source code error stack to see the comment > associated with this warning. > > >> >> Is this a normal behavior of the serialization library? >> I am missing something ? >> > > This is a feature of the implementation of the serialization of multi map > as well as the implementation > of the std::multi map itself. The result is correct in that it's a valid > multimap but it is a different one that the original. > You could say it's an equivalent multimap. Should this have been done > differently? probably not. Trying > to guarantee this level of "equality" would couple the serialization > implementation to the > std::multimap implementation. This would add much work and never could be > entirely relied upon. > > If you want a specific order - don't use multi map. Expend your key size > and use map or set > > Robert Ramey > >

1 0

[serialization] [multimap] change of element's order when deserialize
by Pablo Madoery 09 Apr '14

09 Apr '14

I have the following code: #include <utility> #include <vector> #include <string> #include <fstream> #include <iostream> #include <map> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/map.hpp> using namespace std; void print(multimap<pair<string, string>, int> &m) { multimap<pair<string, string>, int>::iterator it1 = m.begin(); multimap<pair<string, string>, int>::iterator it2 = m.end(); for(; it1!=it2; ++it1) { cout<<"key = "<<(it1->first).first<<(it1->first).second<<"\t\t"; cout<<"value = "<<(it1->second)<<endl; } cout<<endl; } int main() { multimap<pair<string, string>, int> m1; pair<string, string> par1("A", "B"); pair<string, string> par2("A", "B"); pair<string, string> par3("E", "F"); pair<string, string> par4("E", "F"); m1.insert(pair<pair<string, string>, int>(par1,10)); m1.insert(pair<pair<string, string>, int>(par2,20)); m1.insert(pair<pair<string, string>, int>(par3,30)); m1.insert(pair<pair<string, string>, int>(par4,40)); ofstream ofs("filename"); boost::archive::text_oarchive serial1(ofs); serial1 << m1; ofs.close(); ifstream ifs("filename"); boost::archive::text_iarchive serial2(ifs); multimap<pair<string, string>, int> m2; serial2 >> m2; cout<<"map1 = "<<endl; print(m1); cout<<endl; cout<<"map2 = "<<endl; print(m2); cout << "end" << endl; return 0; } What I am trying to do is serialize a multimap and then deserialize it. The problem i that the order of the elements is not conserved. This program gives as result the following: map1 = key = AB value = 10 key = AB value = 20 key = EF value = 30 key = EF value = 40 map2 = key = AB value = 20 key = AB value = 10 key = EF value = 40 key = EF value = 30 end where you can see that the element's order is changed. When compiling it throw this warning: boost::mpl::print<boost::serialization::BOOST_SERIALIZATION_STATIC_WARNING_LINE<98> > that I don't know what it means. Is this a normal behavior of the serialization library? I am missing something ?

1 0

shared_lock owner
by shada 09 Apr '14

09 Apr '14

did shared_lock has a member like visual c++ critical_section's owner? i use shared_lock in a game server, it has several hundred threads. if has owner, it more easy resolve deadlock.

2 2

After install, ld finds some boost libs, but not others. All are present.
by Devon Oslund 09 Apr '14

09 Apr '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Can find boost_regex, can't find boost_system. Both right there. _________________________________________________________________________________________________________ ./bootstrap.sh --prefix=/usr ./b2 sudo ./b2 install /usr/lib$ ls -la /usr/lib/libboost_regex.* - -rw-r--r-- 1 root root 3022020 Apr 8 14:29 /usr/lib/libboost_regex.a lrwxrwxrwx 1 root root 24 Apr 8 14:29 /usr/lib/libboost_regex.so -> libboost_regex.so.1.55.0 - -rwxr-xr-x 1 root root 1453274 Apr 8 14:29 /usr/lib/libboost_regex.so.1.55.0 ls -la /usr/lib/libboost_system.* - -rw-r----- 1 root root 32482 Apr 8 14:29 /usr/lib/libboost_system.a lrwxrwxrwx 1 root root 25 Apr 8 14:29 /usr/lib/libboost_system.so -> libboost_system.so.1.55.0 - -rwxr-x--- 1 root root 20461 Apr 8 14:29 /usr/lib/libboost_system.so.1.55.0 **** Build of configuration Release for project TCCore_Batchd **** make all Building target: libTCCore_Batchd.so Invoking: GCC C++ Linker g++ -L/home/devonerik/workspace/tclink-4.0.1-C -L/home/devonerik/workspace/nacl-20110221/build/shalebridge/lib/amd64 - -L/home/devonerik/workspace/scrypt/Release -Xlinker -rpath . -shared -o "libTCCore_Batchd.so" {snip filenames} -lboost_system -lboost_regex -lscrypt -lpqxx /usr/bin/ld: cannot find -lboost_system collect2: error: ld returned 1 exit status make: *** [libTCCore_Batchd.so] Error 1 **** Build of configuration Release for project TCCore_Batchd **** make all Building target: libTCCore_Batchd.so Invoking: GCC C++ Linker g++ -L/home/devonerik/workspace/tclink-4.0.1-C -L/home/devonerik/workspace/nacl-20110221/build/shalebridge/lib/amd64 - -L/home/devonerik/workspace/scrypt/Release -Xlinker -rpath . -shared -o "libTCCore_Batchd.so" {snip filenames} -lboost_regex -lscrypt -lpqxx -lboost_system /usr/bin/ld: cannot find -lboost_system collect2: error: ld returned 1 exit status make: *** [libTCCore_Batchd.so] Error 1 **** Build Finished **** -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.11 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iQEcBAEBAgAGBQJTRHG1AAoJEAy07rHw4yivheoH/jRaeucvmZhDAossFEAfiqkJ 8BPzoyGxzX+7aIZXFy9m8HlOo6CEWIAh20XB7iq31vYIq9NLaahcegZgzYX1SmGL T0y0LpmJgUlipcQHbLl0o0E3RWHk7olqCALNy2OBOHLgMYHxDF4tGRMQ6jnbo3xV JLMex5ai5TQwWNmciv7bLuHG/INnVEHVn/UVW2G/fgn7m9j8puhTcWmgbJIq6GAd Gusqqd8P4UZN5Umm1N4PmDtOoIuu2OLD6QvUoP3pM+QvJ5ZVY0nRPx/RDcrzdhoY 7WUDo2anrZiEaPFENUFnCJFBTf3pn7D+JJFeljoAhnqgNuShUjheuUMWsUV2/28= =hc+I -----END PGP SIGNATURE-----

3 3

BOOST_PP_REPEAT to repeat comma-containing text
by Igor R 08 Apr '14

08 Apr '14

Hello, I'm trying to repeat a group of actual parameters (passed to some 3d party plain-C "variadic" function). The function call looks like this: func(count, param1, param2, arr1[0], arr2[0], param1, param2, arr1[1], arr2[1], param1, param2, arr1[2], arr2[2] /* etc */); So essentially, I'd like to repeat (param1, param2, arr1[n], arr2[n]) group. What is the right way to invoke BOOST_PP_REPEAT in this case? Thanks.

2 3

[Graph] Run-time weight search
by Sensei 08 Apr '14

08 Apr '14

Dear all, after many speculations and your previous advice I've come to the conclusion that I still need your help :) The setting is simple: I have an oriented graph, and I have two nodes. I wish to find all paths from one node to the other. Some restrictions apply: - I *cannot* calculate weights except at run-time when needed, it's too costly; - I can, if you say it's needed, restrict the path length to a certain threshold. What can I relax? The "all paths". Since weights are costly, I could set for just the best path, i.e., the one with the lowest weight. I don't think it would be possible to find the optimum path, in case I cannot search for all possible paths, but I can be easily wrong. I'm not that skilled with BGL, so any help would be quite appreciated! I've read the Table of Contents, but at first I cannot see if this can be done. Thanks!

1 0

Problems calling make_reversed_graph in a call to dijkstra from version 1.48
by Berit Dangaard Brouer 08 Apr '14

08 Apr '14

Hi, First of all thank you for providign the boost BGL library. I use it extensively. I am having some problems with some code, that works just fine using boost version 1.46, but cannot compile using version 1.48 and higher. I have a Bidirectional Graph using bundled properties defined as: struct Port { Port(int index=-1, int type=-1, int port_code=0, string UN="NN", string name="NN", int service_id=-1 ): m_index(index), m_type(type), m_port_code( port_code), UNLOCODE(UN), m_name(name), m_service_id(service_id) {} int m_index; int m_type;//0 port, 1 port call int m_port_code; string UNLOCODE; string m_name; int m_service_id; }; struct Edge { Edge( int id=-1, int type=-1, double weight=0.0, double cost=0.0, double dual_cost=0.0, double util=0.0, double cap=0.0, double r_cap=0.0 ) : m_idx(id), m_type(type), m_weight(weight) , m_cost(cost), m_dual_cost(dual_cost), m_utilization(util), m_capacity(cap), m_res_cap(r_cap) {} unsigned int m_idx; int m_type;//0 is load edge, 1 is voyage edge, 2 forfeited edge (commodity link) double m_weight; //distance double m_cost; //cost - only on load/unload/transhipment edges double m_dual_cost; double m_utilization; double m_capacity; double m_res_cap; //residual capacity }; //Graph typedef adjacency_list< vecS , vecS , bidirectionalS, Port, Edge> mcf_graph; I am trying to make a call to dijkstra on a reversed graph as follows: (the reversed graph is also a filtered graph, but I do not think this is an issue: dijkstra_shortest_paths (make_reverse_graph(fg), before_p, predecessor_map ( &p[0] ).distance_map ( &d[0] ).weight_map ( get ( &Edge::m_weight, fg) ).vertex_index_map ( get ( vertex_index,fg ) ) ); which works fine in 1.46, but it seems in 1.48 I can no longer use make_reverse_graph(<mcf_graph&>) (returning a reverse graph) with the bundled properties from fg. and I get the error (compressed summary - full details attached) usr/include/boost/property_map/property_map.hpp:354:56: error: no match for 'operator[]' in '((const boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, Edge, double>&)pa)[k]' /usr/include/boost/property_map/property_map.hpp:354:56: note: candidate is: In file included from /usr/include/boost/graph/adjacency_list.hpp:44:0, from /home/chrkr/git/lsndp/include/ipheuristic.h:36, from /home/chrkr/git/lsndp/src/ipheuristic.cpp:29: /usr/include/boost/graph/properties.hpp:399:15: note: T& boost::bundle_property_map<Graph, Descriptor, Bundle, T>::operator[](boost::bundle_property_map<Graph, Descriptor, Bundle, T>::key_type) const [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge>; Descriptor = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>; Bundle = Edge; T = double; boost::bundle_property_map<Graph, Descriptor, Bundle, T>::reference = double&; boost::bundle_property_map<Graph, Descriptor, Bundle, T>::key_type = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>] /usr/include/boost/graph/properties.hpp:399:15: note: no known conversion for argument 1 from 'const boost::detail::reverse_graph_edge_descriptor<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >' to 'boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, Edge, double>::key_type {aka boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>}' From various sources I understand that as of 1.48 reverse graph is no longer an image of the graph, but another object, where I need the actual property maps and the property maps of the reversed graph, but I did not get much wiser on how to call dijkstra with the reversed graph given these new description. I tried defining the reverse graph as a separate object reverse_graph<mcf_graph> r_fg=reverse_graph(fg); dijkstra_shortest_paths (r_fg), before_p, predecessor_map ( &p[0] ).distance_map ( &d[0] ).weight_map ( get ( &Edge::m_weight, r_fg) ).vertex_index_map ( get ( vertex_index, r_fg ) ) ); indicating that I am not getting the right properties for the reverse graph: equired from here /usr/include/boost/graph/properties.hpp:420:44: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:421:42: error: no type named 'edge_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:425:7: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:429:7: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:432:70: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:434:7: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /home/chrkr/git/lsndp/src/ipheuristic.cpp:939:132: error: no matching function for call to 'get(double Edge::*, boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >&)' /home/chrkr/git/lsndp/src/ipheuristic.cpp:939:132: note: candidates are: In file included from /usr/include/boost/graph/adjacency_list.hpp:36:0, from /home/chrkr/git/lsndp/include/ipheuristic.h:36, from /home/chrkr/git/lsndp/src/ipheuristic.cpp:29: /usr/include/boost/property_map/property_map.hpp:179:19: note: template<class T> const T& get(const T*, std::ptrdiff_t) /usr/include/boost/property_map/property_map.hpp:179:19: note: template argument deduction/substitution failed: /home/chrkr/git/lsndp/src/ipheuristic.cpp:939:132: note: mismatched types 'const T*' and 'double Edge::*' In file included from /usr/include/boost/graph/graphviz.hpp:25:0, from /home/chrkr/git/lsndp/include/data.h:19, from /home/chrkr/git/lsndp/include/ipheuristic.h:46, from /home/chrkr/git/lsndp/src/ipheuristic.cpp:29: /usr/include/boost/property_map/dynamic_property_map.hpp:322:1: note: template<class Key> std::string boost::get(const string&, const boost::dynamic_properties&, const Key&) /usr/include/boost/property_map/dynamic_property_map.hpp:322:1: note: template argument deduction/substitution failed: Is the problem the bundled properties from the original graph or ? -- Best Regards, Ph.D. Berit Dangaard Brouer Post Doc. DTU Management Engineering, Management Science Technical University of Denmark Department of Management Engineering Produktionstorvet, Bygning 426 2800 Kgs. Lyngby blof(a)dtu.dk <mailto:blof@man.dtu.dk> www.ms.man.dtu.dk <http://www.ms.man.dtu.dk> http://www.maersk.com/innovation/leadingthroughinnovation/enerplan/ Please read about the ENERPLAN project here <http://www.maersk.com/innovation/leadingthroughinnovation/enerplan/>

2 3

Boost Parallel Graph Library: remove_vertex gives unexpected results.
by Alok Kumbhare 06 Apr '14

06 Apr '14

Hi All, i need some help with parallel boost graph library. In particular, i am trying to modify the structure of the graph (distributed adjacency list) after it is loaded. The code snippet is at http://pastebin.com/erizQ0Sf. The problem is that clear_vertex(v,g) and remove_vertex(v,g) does not seem to operate on the same vertex in the graph. Here is a sample graph in metis format: http://pastebin.com/qxy2w6aw (I use the default distribution for this example) The graph_viz output is available here for different scenarios: https://onedrive.live.com/redir?resid=C3CDB6EFBD31B4A8!20818&authkey=!AJqEF…<https://onedrive.live.com/redir?resid=C3CDB6EFBD31B4A8!20818&authkey=!AJqEF…> As you can see in the above figure: The first image is the original graph split into two partitions (mpirun -np 2 ./test) The second image is after clear_vertex is called for one of the vertices. Notice vertex "0". All the edges are removed as expected. The third image is after remove_vertex is called (which is called after clear_vertex, as mentioned in the documentation here: http://www.boost.org/doc/libs/1_55_0/libs/graph_parallel/doc/html/distribut…) Notice here that the vertex "2" is removed instead of vertex "0" even when using the same vertex descriptor for both calls. I tried putting synchronize(g) after each call, or at the end of both calls. but both gives the same results. Is this a bug or am i doing something wrong. Your help will be greatly appreciated. Thanks, Alok Kumbhare

1 0

Mac & Boost::Locale from_utf error Undefined symbols for architecture x86_64
by NoRulez 06 Apr '14

06 Apr '14

Hello, I've used the following command to build boost on a mac: ./b2 -a toolset=darwin architecture=x86 macosx-version=10.5 macosx-version-min=10.5 threading=multi link=static address-model=32_64 --without-mpi stage When i link the following source: bool runJavascript(const char * jscode) { std::string javaScriptCode; try { javaScriptCode = boost::locale::conv::from_utf<char>(jscode, "ISO-8859-15"); } catch(...) { javaScriptCode = jscode; } } Then i get the following error message, on windows this work just fine: Undefined symbols for architecture x86_64: "std::basic_string<char, std::char_traits<char>, std::allocator<char> > boost::locale::conv::from_utf<char>(char const*, char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, boost::locale::conv::method_type)", referenced from: ProxyMethod(char const*, char const*, void*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)in JavaScriptRunner.cpp.o ld: symbol(s) not found for architecture x86_64 collect2: ld returned 1 exit status Does anyone have an idea on how to solve that? Thanks in advance

1 0

[Graph] Questions and remarks
by Albert Yiamakis 06 Apr '14

06 Apr '14

Hello, Some questions and remarks regarding Boost.Graph: i) Why does write_graphviz require a VertexEdgeListGraph? I was unable to invoke it on an adjacency_list using sets as containers for vertices and edges; instead I had to switch to vectors. However, the function is meant to output - does the efficiency of the traversal really matter? ii) Would it be possible to mutate the graph in the visitors of an algorithm? For instance, generating the graph during a breadth-first search, by adding vertices and edges. Presumably, it would be the user's responsibility to color the vertices appropriately. (Interestingly, visitors take a non-const reference to the graph - but compilation failed at some other point). iii) The documentation of the distance_recorder states that "A WritablePropertyMap where the key type and the value type are the vertex descriptor type of the graph." which has to be a mistake. It seems this has already been pointed out in the past (http://boost.2283326.n4.nabble.com/BGL-distance-recorder-td2571349.html) but is yet to be corrected. Albert -- kojirion.github.io

1 0

Find out which build options were used
by NoRulez 05 Apr '14

05 Apr '14

Hello, is there somewhere in the boost directory a log file or something else where I can find out how the boost libraries where build? The problem is the following, a college of mine build an old version of boost. The college is not longer in our company and I want to update the library to 1.55.0, but I don't know the preprocessor variables and/or options he used. Any help would be great. Thanks so much

2 4

Compilation errors after upgrading from 1.38 to 1.55
by Normand Mongeau 04 Apr '14

04 Apr '14

Hi, I'm trying to change our boost version from 1.38 to 1.55, and am getting these compilation errors: 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): warning C4002: too many actual parameters for macro 'trunc' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2027: use of undefined type 'boost::math::tools::promote_args' 1> D:\RootReferences\boost_1_55_0\boost/math/tools/promotion.hpp(120) : see declaration of 'boost::math::tools::promote_args' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2226: syntax error : unexpected type 'T' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2988: unrecognizable template declaration/definition 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2059: syntax error : '-' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(26): error C2065: 'T' : undeclared identifier 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(26): error C2988: unrecognizable template declaration/definition 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(26): error C2059: syntax error : '-' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(26): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): warning C4002: too many actual parameters for macro 'round' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2027: use of undefined type 'boost::math::tools::promote_args' 1> D:\RootReferences\boost_1_55_0\boost/math/tools/promotion.hpp(120) : see declaration of 'boost::math::tools::promote_args' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2226: syntax error : unexpected type 'T' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2143: syntax error : missing ';' before '+' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2065: 'T' : undeclared identifier 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2374: 'boost::math::floor' : redefinition; multiple initialization 1> D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_fwd .hpp(42) : see declaration of 'boost::math::floor' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2143: syntax error : missing ';' before '+' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2059: syntax error : ')' The code doesn't matter as the errors occur as soon as I have an include for lexical_cast, i.e. #include <boost/lexical_cast.hpp> This is using Visual Studio 2010. Any ideas as to what the problem is? Thanks, Normand

2 2

Re: [Boost-users] [Serialization] good practice for serialization with private default constructors
by David Rajaratnam 04 Apr '14

04 Apr '14

On 05/04/14 03:46, Robert Ramey wrote: > > Note that subject is treated in the manual. I forget where. You'll > have to > look for it. boost/libs/serialization/doc/index.html > > And there are two tests which explicitly test this. see. > > https://github.com/boostorg/serialization/blob/develop/test/test_non_defaul… > Sorry, I couldn't find the reference in the manual addressing private default constructor good/bad practice. I am undoubtedly misunderstanding something, but I'm not sure the part on non-default constructors is relevant. In any case... > > never do ar & *x. This will evade certain code which the library > requires. Trust > the source luke! > this answers my question. Regards, Dave PS. Thanks for the great library!

1 0

[Serialization] Polymorphic portable binary archive error
by Szymon Gatner 04 Apr '14

04 Apr '14

Hi, I am trying to use polymorphic_portable_binary_archive in Visual Studio 2012 but adding relevant *.cpp(s) (from examples directory) to the project yields: 1>c:\users\bravo\documents\visual studio 2012\projects\polymorphic_serialization_test\polymorphic_portable_binary_oarchive.hpp(19): fatal error C1083: Cannot open include file: 'boost/archive/detail/polymorphic_oarchive_dispatch.hpp': No such file or directory 1>c:\users\bravo\documents\visual studio 2012\projects\polymorphic_serialization_test\polymorphic_portable_binary_oarchive.cpp(18): fatal error C1083: Cannot open include file: 'boost/archive/impl/archive_pointer_oserializer.ipp': No such file or directory Error 2 error C1083: Cannot open include file: 'boost/archive/detail/polymorphic_iarchive_dispatch.hpp': No such file or directory c:\users\bravo\documents\visual studio 2012\projects\polymorphic_serialization_test\polymorphic_portable_binary_iarchive.hpp 19 polymorphic_serialization_test Indeed, none of those files exists in my boost release, I am using boot 1.54. Also: what is the status of Portable Binary Archives? From forum posts It would seem that ony unsupported things is floating point numbers? Is that correct? Other that that, is everything else production ready? Regards, Szymon Gatner -- Szymon Gatner Bravasoft / The Lordz Games Studio Twitter: @sgatner

1 0

boost::regex_replace problem
by Илья 04 Apr '14

04 Apr '14

Greetings everyone! My name is Ilya and i have such problem with boost::regex_replace : I want to process some text messages to find and replace with * swears there. I wrote regular expressions, this is an example of one of them: "([[:punct:]]|[[:space:]]|[[:digit:]]|^)(?:a)(?:[[:punct:]]|[[:space:]]|[[:digit:]])*(?:b)(?:[[:punct:]]|[[:space:]]|[[:digit:]])*(?:c)([[:punct:]]|[[:space:]]|[[:digit:]]|$)". The format string i used is: "$1***$2" Then i run boost::regex_replace() and it works almoust correctly, except one case: when i have message with abc's standing next to each other with one separator beetween them, like this: "abc abc", "--abc-abc--" etc. So i need to run boost::regex_replace() twice to process corectly such messages. Are there any other ways to solve this problem? Thank you for answers. Ilya Bindiug

2 2

[Serialization] good practice for serialization with private default constructors
by David Rajaratnam 04 Apr '14

04 Apr '14

I am interested to know what is good practice when dealing with serializable classes with private default constructors. In particular it is not clear what is the cleanest way to deserializing these objects. Explaining with reference to the example from: http://stackoverflow.com/questions/7123613/boost-serialization-does-the-def… The answer to this stackoverflow question shows how to serialize/deserialize an object with a private default constructor. Summarizing: class Colour { friend class boost::serialization::access; // private default constructor // template serialize function public: boost::shared_ptr<Colour> test() { // returns new object; } }; int main(){ boost::shared_ptr<Colour> c = Colour::test(); std::stringstream str; boost::archive::text_oarchive oa(str); oa & c; // ... c.reset(); boost::archive::text_iarchive ia(str); ia & c; } However, it is important to observe that it is not just serializing/deserializing the object itself but also the shared pointer to the object! So for example: replacing "ao & c;" with "oa & *c;" will compile and properly serialize (only) the object, but will throw an exception when it tries to deserialize because it is expecting a shared pointer to the object. My solution to this is to provide a constructor that takes an archive object: class Colour { // other stuff public: template<typename Archive> Colour(Archive& ar) { ar >> *this; } }; // some explicit specializations where there are // other single argument constructors The example main then becomes: int main(){ boost::shared_ptr<Colour> c = Colour::test(); std::stringstream str; boost::archive::text_oarchive oa(str); oa & *c; // ... boost::archive::text_iarchive ia(str); Colour c2(ia); } The above works and is clean in that only the Colour object is being serialized/deserialized. However, I'm not sure if it is good practice. In particular: - I presume there will be an intermediate copy of the Colour object being created by the archive object. - Passing *this to a function that takes an object of type Object from within the constructor seems like a bad thing. - In general template based constructors seems like they should be avoided. So, my question is whether my solution is reasonable or is there a better option. Regards, Dave R.

1 0

[wave] fail to parse variadics macro
by gag maker 03 Apr '14

03 Apr '14

Hi, I'm using wave library from boost 1.53.0. Library compiled with default settings, meaning BOOST_WAVE_SUPPORT_VARIADICS_PLACEMARKERS is set to 1 in wave_config.cpp Wave driver is also compiled to support variadics. However, when I try to feed translation unit to wave driver it reports following error: .../compiler.h:32:1: error: ill formed preprocessor directive: #define __builtin_warning(x, y...) (1) And btw, wave driver was called with --variadics option What went wrong here? Thank you, --Alex

6 9

[preprocessor] Undeclared identifier BOOST_PP_IIF_0 under Clang only
by Pierre Talbot 03 Apr '14

03 Apr '14

Hi, I defined a macro using Boost.Preprocessor that compiles and works fine under gcc but fails to compile under Clang. The macro is defined here: https://github.com/ptal/Boost.Expected/blob/master/include/boost/functional… And the error message follows this message, the file using the macro is https://github.com/ptal/Boost.Expected/blob/master/example/monadic_calculat… Thanks for any helps, Pierre Talbot Boost.Expected/example/monadic_calculator$ b2 ...patience... ...found 1246 targets... ...updating 2 targets... clang-linux.compile.c++.without-pth bin/clang-linux-3.5.0/debug/monadic_calculator.o monadic_calculator.cpp:141:15: error: use of undeclared identifier 'BOOST_PP_IIF_0' etokens = DO( ^ ../../include/boost/functional/do_yield.hpp:100:17: note: expanded from macro 'DO' #define DO(...) DO_SEQ(BOOST_PP_VARIADIC_TO_SEQ(__VA_ARGS__)) ^ ../../include/boost/functional/do_yield.hpp:97:3: note: expanded from macro 'DO_SEQ' BOOST_PP_SEQ_FOR_EACH_I(DO_ELEM, seq, seq) \ ^ /usr/local/boost_1_55_0/boost/preprocessor/seq/for_each_i.hpp:27:55: note: expanded from macro 'BOOST_PP_SEQ_FOR_EACH_I' # define BOOST_PP_SEQ_FOR_EACH_I(macro, data, seq) BOOST_PP_FOR((macro, data, seq (nil), 0), BOOST_PP_SEQ_FOR_EACH_I_P, BOOST_PP_SEQ_FOR_EACH_I_O, BOOST_PP_SEQ_FOR_EACH_I_M) ^ /usr/local/boost_1_55_0/boost/preprocessor/repetition/for.hpp:27:23: note: expanded from macro 'BOOST_PP_FOR' # define BOOST_PP_FOR BOOST_PP_CAT(BOOST_PP_FOR_, BOOST_PP_AUTO_REC(BOOST_PP_FOR_P, 256)) ^ /usr/local/boost_1_55_0/boost/preprocessor/cat.hpp:22:32: note: expanded from macro 'BOOST_PP_CAT' # define BOOST_PP_CAT(a, b) BOOST_PP_CAT_I(a, b) ^ /usr/local/boost_1_55_0/boost/preprocessor/cat.hpp:29:34: note: expanded from macro 'BOOST_PP_CAT_I' # define BOOST_PP_CAT_I(a, b) a ## b ^ <scratch space>:130:1: note: expanded from here BOOST_PP_FOR_1 ^ /usr/local/boost_1_55_0/boost/preprocessor/repetition/detail/for.hpp:22:37: note: expanded from macro 'BOOST_PP_FOR_1' # define BOOST_PP_FOR_1(s, p, o, m) BOOST_PP_FOR_1_C(BOOST_PP_BOOL(p(2, s)), s, p, o, m) ^ /usr/local/boost_1_55_0/boost/preprocessor/repetition/detail/for.hpp:279:42: note: expanded from macro 'BOOST_PP_FOR_1_C' # define BOOST_PP_FOR_1_C(c, s, p, o, m) BOOST_PP_IIF(c, m, BOOST_PP_TUPLE_EAT_2)(2, s) BOOST_PP_IIF(c, BOOST_PP_FOR_2, BOOST_PP_TUPLE_EAT_4)(BOOST_PP_EXPR_IIF(c, o)(2, s), p, o, m) ^ /usr/local/boost_1_55_0/boost/preprocessor/control/iif.hpp:18:37: note: expanded from macro 'BOOST_PP_IIF' # define BOOST_PP_IIF(bit, t, f) BOOST_PP_IIF_I(bit, t, f) ^ /usr/local/boost_1_55_0/boost/preprocessor/control/iif.hpp:25:39: note: expanded from macro 'BOOST_PP_IIF_I' # define BOOST_PP_IIF_I(bit, t, f) BOOST_PP_IIF_ ## bit(t, f) ^ <scratch space>:136:1: note: expanded from here BOOST_PP_IIF_0 ^

2 4

problems with nested boost::bind and boost::asio
by Marco 03 Apr '14

03 Apr '14

Hi, I use async_read of boost::asio to receive network data. After a complete 'packet' was read (which needs 2 async read calls) I want to call a user defined handler. Therefore, I introduced a new templater parameter in my callback methods. Unfortunately, my code ends in a compile error. If I outcomment the handler call, than it compiles fine. But with the call of the handler object, I got a conversion error. At first I want to describe my code on some excerpts: ---------------------------------------------------------------------------------------- In 'startProcessing' I use perfect forwarding for the callback object. template<typename T> void startProcessing(T&& handler,bool activateNoDelay = true) { // m_socket.set_option(asio::ip::tcp::no_delay(activateNoDelay )); // startAsyncRead(std::forward<T>(handler)); } ---------------------------------------------------------------------------------------- 'startAsynRead' has two overloads. One for boost::bind objects and one for all other. The boost bind objects are encased with boost::protect to prevent an evaluation of boost::bind in the later binds. // template<typename T> void startAsyncRead(T handler) { startAsyncReadImpl(handler); } //overload for boost bind objects necessary template<typename R, typename F, typename L> void startAsyncRead(boost::_bi::bind_t<R, F, L> handler) { startAsyncReadImpl(boost::protect(handler)); } ---------------------------------------------------------------------------------------- 'startAsyncReadImpl' calls asio::async_read and uses boost::bind to commit the handler object as a third parameter. // template<typename T> void startAsyncReadImpl(T&& handler) { //at first we need to read the header information auto& buf = m_headerInBuffer.getBuffer(); boost::asio::async_read( m_socket, boost::asio::buffer(buf.begin(), buf.size()), boost::asio::transfer_exactly(buf.size()), boost::bind(&CMessageChannel::handleAsyncReadHeader<T>, this,_1, _2, std::forward<T>(handler)) ); } ---------------------------------------------------------------------------------------- 'handleAsyncReadHeader' does some stuff and than calls asio::async_read with another method. // template<typename T> void handleAsyncReadHeader(const boost::system::error_code& error, std::size_t bytes_transferred, T handler) { . . . boost::asio::async_read( m_socket, boost::asio::buffer(buf.begin(), buf.size()), boost::asio::transfer_exactly(size), boost::bind(&CMessageChannel::handleAsyncReadBody<T>, this, _1, _2,handler) ); } ---------------------------------------------------------------------------------------- Finally, 'handleAsyncReadBody' has to do the wished call of the handler. // template<typename T> inline void CMessageChannel::handleAsyncReadBody(const boost::system::error_code& error, std::size_t bytes_transferred, T handler) { ... handler(Packet(m_headerInBuffer.getShort(4), bytes_transferred, m_currReadBuffer)); } ---------------------------------------------------------------------------------------- And here a call of start process: void testPacket(Packet& packet) {} . . . conn->startProcessing(boost::bind(&CMessageServer::testPacket, this, _1)); ---------------------------------------------------------------------------------------- I use Visual Studio 2013 and got the following error message: 1>D:\libraries\cpp\boost\boost_1_55_0\boost/bind/bind.hpp(313): error C2664: 'void boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>::operator ()(T *,A1) const' : Konvertierung von Argument 2 von 'const tuc::nw::Packet' in 'tuc::nw::Packet &' nicht möglich -> can't convert argument 2 'const tuc::nw::Packet' to tuc::nw::Packet & I never use const in my call chain. It seems that boost::protect introduces the const for the parameter. And I have no idea how to fix it :( ---------------------------------------------------------------------------------------- Here is the complete error message: 1>------ Erstellen gestartet: Projekt: network, Konfiguration: Release Win32 ------ 1> MessageChannel.cpp 1> MessageServer.cpp 1>D:\libraries\cpp\boost\boost_1_55_0\boost/bind/bind.hpp(313): error C2664: 'void boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>::operator ()(T *,A1) const' : Konvertierung von Argument 2 von 'const tuc::nw::Packet' in 'tuc::nw::Packet &' nicht möglich 1> with 1> [ 1> T=tuc::nw::CMessageServer 1> , A1=tuc::nw::Packet & 1> ] 1> Durch die Konvertierung gehen Qualifizierer verloren 1> D:\libraries\cpp\boost\boost_1_55_0\boost/bind/bind_template.hpp(47): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>::operator ()<F,boost::_bi::list1<const A1 &>>(boost::_bi::type<void>,F &,A &,int)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , F=boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &> 1> , A1=tuc::nw::Packet 1> , A=boost::_bi::list1<const tuc::nw::Packet &> 1> ] 1> D:\libraries\cpp\boost\boost_1_55_0\boost/bind/bind_template.hpp(47): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>::operator ()<F,boost::_bi::list1<const A1 &>>(boost::_bi::type<void>,F &,A &,int)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , F=boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &> 1> , A1=tuc::nw::Packet 1> , A=boost::_bi::list1<const tuc::nw::Packet &> 1> ] 1> D:\libraries\cpp\boost\boost_1_55_0\boost/bind/protect.hpp(60): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>::operator ()<A1>(const A1 &)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , A1=tuc::nw::Packet 1> ] 1> D:\libraries\cpp\boost\boost_1_55_0\boost/bind/protect.hpp(60): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>::operator ()<A1>(const A1 &)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , A1=tuc::nw::Packet 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(196): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>>::operator ()<tuc::nw::Packet>(const A1 &)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , A1=tuc::nw::Packet 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(196): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>>::operator ()<tuc::nw::Packet>(const A1 &)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , A1=tuc::nw::Packet 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(179): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::handleAsyncReadBody<T>(const boost::system::error_code &,size_t,T)". 1> with 1> [ 1> T=boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<tuc::nw::CMessageServer *>,boost::arg<1>>>> 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(127): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::handleAsyncReadHeader<T>(const boost::system::error_code &,size_t,T)". 1> with 1> [ 1> T=boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<tuc::nw::CMessageServer *>,boost::arg<1>>>> 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(117): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::startAsyncReadImpl<boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>>>(boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>> &&)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(76): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::startAsyncRead<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>(boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> ] 1> MessageServer.cpp(43): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::startProcessing<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>>(boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>> &&,bool)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> ] ========== Erstellen: 0 erfolgreich, 1 fehlerhaft, 0 aktuell, 0 übersprungen ==========

2 1

installing boost getting error "ld: symbol(s) not found for architecture x86_64" on OSX 10.9.2
by Corentin Hamel 02 Apr '14

02 Apr '14

Hi everyone, I hope this is the right place to ask my question. I'm trying to build boost 1.55.0 for python on OSX 10.9.2 but i'm encountering the following error "ld: symbol(s) not found for architecture x86_64" and I'm really blocked. I read it might be related to the standard c++ library which changed with maverick to be libc++ by default. But even adding cxxflags="-stdlib=libstdc++" when executing ./b2 didn't help. Here is what I did following the boost tutorial: download boost_1_55_0.tar ./bootstrap.sh --with-libraries=python toolset=darwin ./b2 include="/Library/Frameworks/Python.framework/Versions/2.7/include/python2.7/" And I get the following error: link.jam: No such file or directory Building the Boost C++ Libraries. error: No best alternative for /python_for_extensions next alternative: required properties: <python>2.7 <target-os>darwin matched next alternative: required properties: <python>2.7 <target-os>darwin matched error: No best alternative for /python_for_extensions next alternative: required properties: <python>2.7 <target-os>darwin matched next alternative: required properties: <python>2.7 <target-os>darwin matched Component configuration: - python : building darwin.link.dll bin.v2/libs/python/build/darwin-4.2.1/release/threading- multi/libboost_python.dylib Undefined symbols for architecture x86_64: "_PyFile_FromString", referenced from: boost::python::exec_file(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o "_PyFile_AsFile", referenced from: boost::python::exec_file(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o "_PyEval_GetGlobals", referenced from: boost::python::eval(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o boost::python::exec(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o boost::python::exec_statement(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o boost::python::exec_file(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o "_PyRun_StringFlags", referenced from: ........ "_PyExc_StopIteration", referenced from: boost::python::objects::stop_iteration_error() in iterator.o "_PyNumber_InPlaceAdd", referenced from: boost::python::api::operator+=(boost::python::api::object&, boost::python::api::object const&) in object_operators.o "_PyUnicodeUCS2_FromEncodedObject", referenced from: _encode_string_unaryfunc in builtin_converters.o "_PyErr_NoMemory", referenced from: boost::python::handle_exception_impl(boost::function0<void>) in errors.o "_PyDict_New", referenced from: boost::python::detail::dict_base::dict_base() in dict.o boost::python::detail::dict_base::dict_base() in dict.o _instance_get_dict in class.o ld: symbol(s) not found for architecture x86_64 clang: error: linker command failed with exit code 1 (use -v to see invocation) "g++" -dynamiclib -Wl,-single_module -install_name "libboost_python.dylib" -o "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/libboost_python.dylib" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/numeric.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/list.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/long.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/dict.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/tuple.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/str.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/slice.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/from_python.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/registry.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/type_id.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/enum.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/class.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/function.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/inheritance.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/life_support.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/pickle_support.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/errors.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/module.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/builtin_converters.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/arg_to_python_base.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/iterator.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/stl_iterator.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object_protocol.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object_operators.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/wrapper.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/import.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/exec.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/function_doc_signature.o" -headerpad_max_install_names -Wl,-dead_strip -no_dead_strip_inits_and_terms ...failed darwin.link.dll bin.v2/libs/python/build/darwin-4.2.1/release/threading- multi/libboost_python.dylib... ...skipped <pstage/lib>libboost_python.dylib for lack of <pbin.v2/libs/python/build/darwin- 4.2.1/release/threading-multi>libboost_python.dylib... ...failed updating 1 target... ...skipped 1 target... Thanks for your help! Corentin Hamel Software Engineer Rocketboots Level 11, 189 Kent Street Sydney NSW 2000

2 5