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

[Boost::Python]
by Eugenio Bargiacchi 03 Jan '16

03 Jan '16

Hello everyone, I have a member function with signature const Matrix2D & foo const (); Which returns an internal data structure. Matrix2D is using Matrix2D = Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor | Eigen::AutoAlign>; I have explicitly set a to_python converter for Matrix2D, and I have exported the function with a call policy of return_internal_reference. However, when this function is called from Python I get TypeError: No Python class registered for C++ class Eigen::Matrix<double, -1, -1, 1, -1, -1> This happens also if the reference is not const. At the same time, if I modify the call policy to return_value_policy<copy_const_reference>() Python can decode the matrix just fine. The same holds true if I return the Matrix2D by value. However I really need to have a reference to the matrix in order store it into other classes. How can I make Python see the data structure through the reference? The converter in case it is needed: boost::python::list toPythonList(const double * data, size_t num) { boost::python::list list; for (size_t i = 0; i < num; ++i) list.append(data[i]); return list;} struct Matrix2DToPython{ static PyObject* convert(Matrix2D const & m) { boost::python::list list; for (int i = 0; i < m.rows(); ++i) { list.append(toPythonList(m.row(i).data(), m.cols())); } return boost::python::incref(list.ptr()); }}; Thanks, Eugenio

1 0

[units] Adding two absolute units
by Itzik 03 Jan '16

03 Jan '16

Hello, <obligatory appreciation on first post> I started using Boost just for boost::units and I find new ways boost can help me almost every day. So thanks for the great stuff! </obligatory appreciation on first post> My question to the board is why two absolute quantities (si::temperature (K) in my case) can't be summed in boost::units? I realized that this is a rule enforced by-design (gmane.comp.lib.boost.user/71747), and I understand that it is probably not a very common case, but I wanted my code to solve a simple formula which requires adding up two absolute temperatures (quantity<absolute<temperature>>). Each temperature represents an Inlet temperature in a Heat Exchange system. So even if converting one temperature to a relative type (quantity<temperature>) might be a workaround, it seems like a forced misuse to me. Eventually it turned out that I was mistaken with the formula, and subtraction was required instead, so there's no problem there. Alas, there's also a much simpler use case: What if I want to average the temperature of the last N readouts? Shouldn't boost::units support this simple operation? I have no formal physics education, but intuitively, adding two absolute temperatures doesn't seem really like a mistake to me, even if it's an odd thing to do. Will appreciate your thoughts on the matter.

3 4

Modifying all matching elements in a Boost.MultiIndex Container
by Amit Prakash Ambasta 01 Jan '16

01 Jan '16

Hi, I am trying to modify members of all elements matching value for a given index in a boost.multiindex container index.modify( index.find(value), [](T& element) { ... } ) seems to update a singular element(first match) On the other hand, std::pair<index::iterator, index::iterator> iter = index.equal_range(value); while(iter.first != iter.second) { index.modify( iter.first, [](T& element) { ... } ); iter.first++; } leads to segfaults and unexpected behavior. What would be right way to approach this?

3 4

Pointer to objects in Boost.MultiIndex
by Amit Prakash Ambasta 01 Jan '16

01 Jan '16

Consider the following code snippet: #include <iostream> #include <boost/multi_index_container.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/member.hpp> using namespace std; using namespace boost::multi_index; struct LinkList; struct LinkList { size_t index; LinkList* parent; LinkList(size_t index, LinkList* parent) : index(index), parent(parent) {} }; struct llindex {}; typedef ordered_unique<tag<llindex>, member<LinkList, size_t, &LinkList::index> > LinkListIndex; typedef boost::multi_index_container<LinkList, indexed_by<LinkListIndex> > IndexedLinkList; template <typename T> void show(T& iterable) { for(auto const& element: iterable) { if(element.parent != nullptr) { std::cout << "Index<" << element.index << ">: " << element.parent->index << std::endl; } else { std::cout << "Index<" << element.index << ">: " << "NULL" << std::endl; } } } int main() { IndexedLinkList ill; auto &index_ll = ill.get<0>(); ill.insert(LinkList{0, nullptr}); ill.insert(LinkList{1, (LinkList*)(&(*index_ll.find(0)))}); ill.insert(LinkList{2, (LinkList*)(&(*index_ll.find(0)))}); ill.insert(LinkList{3, (LinkList*)(&(*index_ll.find(2)))}); show(ill); return 0; } Would (LinkList*)(&(*index__ll.find(value))) be the recommended way to fetch the pointer to parent?

2 3

[BGL] Are normal and reverse undirected edges the same or different?
by Ireneusz Szcześniak 01 Jan '16

01 Jan '16

Hi, In an undirected graph, we create an undirected edge: add_edge(a, b, g); We get the reverse of that edge: edge(b, a, g); Now, are these two edges the same or different? vIf I compare them with the == operator, they are equal, but they have different source and target vertexes. Can I count on this behavior? Will it stick? I'm asking because I couldn't find it in the documentation. Please find attached my unit test. On Debian Jessie, I'm compiling it with: g++ test.cc -l boost_test_exec_monitor -l boost_unit_test_framework -o test Thanks & best, Irek

1 0

[Boost.Serialization][Boost.Iterators] Problem with Boost 1.59.0 in Solaris with SunCC
by dariomt＠gmail.com 30 Dec '15

30 Dec '15

Hi all, I have found a problem compiling Boost, in libs/serialization/src/basic_text_oprimitive.cpp the usage of boost::iterator::iterator_facade is problematic. I have reduced it to a two line minimal case: #include <boost/archive/iterators/ostream_iterator.hpp> boost::archive::iterators::ostream_iterator<char> it; Trying to compile this with SunCC 5.10 (Sun Studio 12.1) in Solaris I get the following error: "boost/iterator/iterator_facade.hpp", line 779: Error: value is not a member of boost::iterators::detail::is_traversal_at_least<std::output_iterator_tag, boost::iterators::bidirectional_traversal_tag>. "boost/archive/iterators/ostream_iterator.hpp", line 40: Where: While specializing "boost::iterators::iterator_facade<boost::archive::iterators::ostream_iterator<char>, char, std::output_iterator_tag, boost::archive::iterators::ostream_iterator<char>&, int>". "boost/archive/iterators/ostream_iterator.hpp", line 40: Where: Specialized in boost::archive::iterators::ostream_iterator<char>. "fail.cpp", line 2: Where: Specialized in non-template code. I guess it must be some bug in the compiler, because if I try to instantiate directly the template mentioned in the error message it works fine. (i.e. value is indeed a member). #include <boost/iterator/iterator_facade.hpp> const bool value = boost::iterators::detail::is_traversal_at_least< std::output_iterator_tag, boost::iterators::bidirectional_traversal_tag >::value; For reference, this problem was *not* present in Boost 1.55.0. Thanks! PS: I have mentioned both libraries in the subject because I don't know if this is a problem with Boost.Iterator code, or with the usage of that library from Boost.Serialization.

3 2

[iostreams] Fix for Ticket #11860
by Gagan Kumar 28 Dec '15

28 Dec '15

Bug Ticket ( https://svn.boost.org/trac/boost/ticket/11860 ) says "Using iostreams causes lots of messages about deprecated header template_arity_spec.hpp". Thus to reduce messages about deprecated header, I created a pull request here https://github.com/boostorg/iostreams/pull/24 . Regards Gagan

1 0

Implementation Of Natural Sort for C++
by Gagan Kumar 27 Dec '15

27 Dec '15

In Boost Trac, I found Natural Sort as Ticket #11021 (new Feature Requests). I too think it will be good for C++ to have it too. Thus I tried to make my Implementation on Natural Sort. Here, https://github.com/scopeInfinity/NaturalSort Can this be included in Boost extensions, or can you please guide me to make it better so that It can be included. Regards Gagan Kumar Natural Sort Example - Inputs : Hello 100 Hello 34 Hello 9 Hello 25 Hello 10 Hello 8 Normal Sort Output : Hello 10 Hello 100 Hello 25 Hello 34 Hello 8 Hello 9 Natural Sort Output : Hello 8 Hello 9 Hello 10 Hello 25 Hello 34 Hello 100 | | | | | | | | | | | scopeInfinity/NaturalSortNaturalSort - C++ Implementation of Natural Comparision and Natural Sort | | | | View on github.com | Preview by Yahoo | | | | |

1 0

[multi_index] do erase() call key extractors?
by Nick Stokes 25 Dec '15

25 Dec '15

This is probably rather obvious, but I wasn't able to locate this guarantee in MIC docs. Take, struct Foo { explicit Foo(Bar* b = nullptr) : bar(b) {} Bar* bar; }; int getBarValue (const Foo& f) { assert( f.bar ); return f.bar->getValue(); } boost::multi_index< Foo, indexed_by< < hashed_unique < member<Foo, Bar* , &Foo::bar > >> , hashed_non_unique < global_fun<const Foo&, int, &getBarValue >> >> FooIndex; void grill() { FooIndex fooIndex; Bar* b; { auto bWork = make_unique<Bar>(); // ... fooIndex.emplace( bWork.get() ); b = bWork.get(); } fooIndex.erase(b); // ... } Please ignore the fact that raw-pointers are potentially dangerous etc. The question is does erase() call getBarValue() despite the fact I am using the first index? More generally, do key extractors get called *at all* except at the point of insertion? Thanks, Nick

2 4

template error when using multi_index_container
by John M. Dlugosz 25 Dec '15

25 Dec '15

I'm getting a strange template instantiation error with a simple and reasonable use of multi_index_container, which I've written up in detail with a minimal program to reproduce here: http://stackoverflow.com/questions/34450642/why-is-this-member-function-a-d… This showed up in Visual Studio 2015, and has worked just fine for years on VS10 and on other platforms. I've tried updating Boost and new versions don't make any difference. This example was prepared using Boost 1.59, and I see the same thing with 1.60. —John

2 1

[container] Boost 1.60 Release link error
by Hickman, Steve (AdvTech) 24 Dec '15

24 Dec '15

Getting a linker error with the Windows version of Boost on release only (not debug) using v 1.60. This did not show up with 1.58 (I skipped 1.59 so I have no comment on it). I'm using the prebuilt libraries: 8> Creating library D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.lib and object D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.exp 8>MockDevice.lib(Mock.obj) : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<char> >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@D@container@boost@@@container_detail@container@boost@@QAEXXZ) 8>MockDevice.lib(Mock.obj) : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<class boost::container::basic_string<char,struct std::char_traits<char>,class boost::container::new_allocator<char> > const ,struct boost::interprocess::ipcdetail::ref_count_ptr>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$new_allocator@D@container@boost@@@container@boost@@Uref_count_ptr@ipcdetail@interprocess@3@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 8>D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.exe : fatal error LNK1120: 2 unresolved externals Steve Hickman System Architect, Human Machine Collaboration Honeywell | Aerospace Office: 480-236-8367 steve.hickman(a)honeywell.com https://in.honeywell.com/sites/aero/Pages/Home.aspx

3 2

Boost 1.60 causes argument-dependent-lookup issues.
by John M. Dlugosz 24 Dec '15

24 Dec '15

See http://stackoverflow.com/questions/34449254/how-is-argument-dependent-looku… I found that code that has worked OK on previous versions of Boost (and does not have this issues with 1.59) is getting unexpected ambiguities in 1.60. Using boost::totally_ordered et al. (even as a private base) appears to be polluting the namespace in which the client class appears. Something like this: class C : boost::totally_ordered<C> { ⋯ } ; using std::make_shared; ⋮ auto p= make_shared<C>(args); this complains that it finds boost::make_shared via argument-dependent lookup, as well as the expected std::make_shared.

1 0

Re: [Boost-users] Race in boost::condition_variable::wait
by Éric Malenfant 23 Dec '15

23 Dec '15

Not sure I understand your question. Unless I'm missing something, the guard in condition_variable::wait does not release the mutex, it is simply there to ensure that it is reacquired on exit. The mutex is released by pthread_cond_wait (atomically with the wait on the condition). Éric Malenfant Le 2015-12-22 8:30 PM, "Chris Stankevitz" <chrisstankevitz(a)gmail.com> a écrit : Hi, Regarding boost::condition_variable::wait (listed below with an obvious modification), It seems to me that there is a race condition because the following operations are not atomic: 1) unlocking of "m" 2) waiting on "cond". Can someone explain to me why boost::condition_variable::wait is not racing the user code in the example below? Thank you, Chris === inline void condition_variable::wait(unique_lock<mutex>& m) { int res=0; { thread_cv_detail::lock_on_exit<unique_lock<mutex> > guard; detail::interruption_checker check_for_interruption(&internal_mutex,&cond); guard.activate(m); #ifdef ENCOURAGE_DEADLOCK boost::this_thread::sleep_for(boost::chrono::seconds(100)); #endif do { res = pthread_cond_wait(&cond,&internal_mutex); } while (res == EINTR); } } === #define ENCOURAGE_DEADLOCK #include <boost/thread.hpp> int main() { boost::mutex Mutex; boost::condition_variable Condition; bool Quit = false; boost::thread Thread([&] { boost::unique_lock<boost::mutex> Lock(Mutex); while (!Quit) { Condition.wait(Lock); } }); boost::this_thread::sleep_for(boost::chrono::seconds(1)); boost::lock_guard<boost::mutex> Lock(Mutex); Quit = true; Condition.notify_all(); return 0; } _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 3

[boost][iterator] Regarding Ticket #11847
by Gagan Kumar 23 Dec '15

23 Dec '15

Hi, I am new and I wanted to contribute. The ticker #11847 says,"reference typedef no longer available in parent class of iterator_facade" but actually I think reference is available in class iterator_facade itself(boost/iterator/iterator_facade.hpp). But still we are not able to use reference in class simple_iterator : public boost::iterator_facade<simple_iterator<T>, T, boost::forward_traversal_tag> and then after a while I saw this http://stackoverflow.com/questions/1643035/propagating-typedef-from-based-t… >From my side I can only solve this kind of problem by using typename boost::iterators::iterator_facade<simple_iterator<T>, T, boost::iterators::forward_traversal_tag>::reference; or using alternative of reference as T& dereference() const { return *m_iter; } //T& instead of reference, as stated in Ticket Can somebody please tell me or guide me to a better way to solve this problem. Regards Gagan Kumar

2 1

Boost 1.60.0 has been released
by Marshall Clow 23 Dec '15

23 Dec '15

Release 1.60.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains one new library and numerous enhancements and bug fixes for existing libraries. New Libraries * VMD: Variadic Macro Data library, from Edward Diener For details, including download links, see http://www.boost.org/users/news/version_1.60.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.60.0/ Tom Kent has made pre-built windows binaries, and they are available at: https://sourceforge.net/projects/boost/files/boost-binaries/1.60.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

4 4

Race in boost::condition_variable::wait
by Chris Stankevitz 23 Dec '15

23 Dec '15

Hi, Regarding boost::condition_variable::wait (listed below with an obvious modification), It seems to me that there is a race condition because the following operations are not atomic: 1) unlocking of "m" 2) waiting on "cond". Can someone explain to me why boost::condition_variable::wait is not racing the user code in the example below? Thank you, Chris === inline void condition_variable::wait(unique_lock<mutex>& m) { int res=0; { thread_cv_detail::lock_on_exit<unique_lock<mutex> > guard; detail::interruption_checker check_for_interruption(&internal_mutex,&cond); guard.activate(m); #ifdef ENCOURAGE_DEADLOCK boost::this_thread::sleep_for(boost::chrono::seconds(100)); #endif do { res = pthread_cond_wait(&cond,&internal_mutex); } while (res == EINTR); } } === #define ENCOURAGE_DEADLOCK #include <boost/thread.hpp> int main() { boost::mutex Mutex; boost::condition_variable Condition; bool Quit = false; boost::thread Thread([&] { boost::unique_lock<boost::mutex> Lock(Mutex); while (!Quit) { Condition.wait(Lock); } }); boost::this_thread::sleep_for(boost::chrono::seconds(1)); boost::lock_guard<boost::mutex> Lock(Mutex); Quit = true; Condition.notify_all(); return 0; }

1 0

Not for publishing
by Soul Studios 22 Dec '15

22 Dec '15

To whoever it is that's been blocking my posts to the mailing list - with the exception of this email, please stop. I have chronic fatigue syndrome, and I feel like I'm fighting an uphill battle against the lack of documentation around actually doing documentation for boost. I would've understood if I'd said anything reasonably offensive, but I don't think I did.

1 0

Software Freedom Conservancy Support
by Jon Kalb 22 Dec '15

22 Dec '15

This is not a technical message, but instead focuses on Boost Administration. Software Freedom Conservancy in a Financial Fight for its Life Software Freedom Conservancy, the non-profit home of Boost is facing an existential threat. Historically, Conservancy has been funded by corporate donations. This works great when it works, but a management shake-up, change in priorities, or a bad quarter at a large donor can derail the organization¹s programs. It has become obvious that Conservancy must move to a Supporter-driven funding model, where individuals who believe in Conservancy¹s mission of supporting open source projects, such as Boost, make a personal commitment to support that effort. Conservancy's fundraiser, found at https://sfconservancy.org/supporter/, is centered around asking individuals who care about the work that Conservancy does to donate $120/year, or just $10/month, to support the organization. Conservancy seeks about 2,500 Supporters to continue its current work, and 750 Supporters to continue a ³bare minimum² of services to its projects. What does this mean to Boost? Boost receives a myriad of important services (see https://sfconservancy.org/members/services/ ) from Conservancy. We¹ve relied on Conservancy since 2007 to provide them. Here are some of the things that Conservancy does for Boost that are in the ³bare minimum² category: * Dealing with all the financial and contractual details regarding our annual C++ Now conference. It was BoostCon that brought Boost and Conservancy together. C++Now 2016 will the the tenth annual BoostCon and it is a tribute to what we¹ve accomplished working together. * Handle our Google Summer of Code payments and travel, including handling all financial transactions with Google to receive and then disperse the money. * Coordinating travel reimbursements for Boost contributors (both developers and students) to attend conferences. * Receiving and tracking all donations to Boost. * Keeping the non-profit status for us so that we don't have to form our own org and file our own paperwork. As the Chair of the Boost Steering Committee, I cannot overstate how important this is to our existence as an organization. Here are some of the services Boost has received in the wider category: * Dealing with questions from the community (including license-governing bodies like OSI) about Boost's license. * Discussing the issue of copyright governance and contributions with large corporations who want their employees to contribute to Boost but need legal assurances or have questions relating to Boost's license or contribution policies. * Reviewing and handling licensing terms of third-party software that relate to Boost in some way, and giving us feedback and answers about issues related to it. * General legal consulting on issues that we run into as an open source non-profit. As you can see, Boost really relies on the important work of Conservancy. Support from Boost Boost, like all of Conservancy¹s projects, contributes 10% of our revenue to Conservancy¹s general fund. (The other 90% is maintained and administered by Conservancy at the direction of the Boost Steering Committee to advance the Boost project.) But that 10% of revenue from all Conservancy¹s member projects doesn¹t add up to enough to even employee one full time person, let alone the already overworked staff of three that Conservancy has. Donors must make up the difference. When Conservancy launched its fundraising effort, I sent out a request to past BoostCon/C++Now attendees asking for support and I¹m proud and delighted to say that a number of Boost community members have already stepped up. One told me that her company will be matching her support. Boost is one of Conservancy¹s oldest and largest projects, so it is right that Boost community members make up a fair proportion of its supporters. I encourage you to choose Conservancy as one of your charitable gifts this holiday season. (Conservancy is a 501(c)(3) charity incorporated in New York, and donations are typically deductible on U.S. taxes.) Please visit: https://sfconservancy.org/supporter/ If you are able to join the others from the Boost community that are making this gift, please let me know. I¹d like to personally thank you. Jon Kalb Chair, Boost Steering Committee

1 0

boost.test: Run multiple tests
by Udo Steinbach 22 Dec '15

22 Dec '15

Hello, boost:test is a great tool. Now I have boost updated to v1.60 and can't run more than one tests at once. System is MinGW on Windows. Given suite_1 test_1_1 suite_1_2 test_1_2_1 and many more, all enabled by default, with v1.59 I could run these both test and exclude all others with --run_test=suite_1/test_1_1,suite_1/suite_1_2/test_1_2_1 respectively BOOST_TESTS_TO_RUN, but with v1.60 the result is "Test setup error: no test cases matching filter or all test cases were disabled". With --run_test=suite_1/test_1_1,suite1_2/test_1_2_1 only test_1_2_1 is executed. Same result with BOOST_TEST_RUN_FILTERS=suite_1/test_1_1,suite1_2/test_1_2_1 . With multiple --run_test= all is fine. But how do I execute multiple tests via variable? bye Udo -- Fahrradverkehr in Deutschland: http://radwege.udoline.de/ GPG: A245 F153 0636 6E34 E2F3 E1EB 817A B14D 3E7E 482E

2 2

Johnson all pair shortest path and output in a C array
by Paolo Bolzoni 22 Dec '15

22 Dec '15

Dear list, I need to get the all pair shortest path in a C array, to pass it to a java program. However johnson all pair shortest path[1] requires a BasicMatrix[2] as output, so a simple array won't do. At the moment I used few classes (see Matrix and MatrixR[3]) as wrapper around a std::vector and it works fine, but I was wondering if I am missing a simpler solution. Is there? Yours faithfully, Paolo [1]http://www.boost.org/doc/libs/release/libs/graph/doc/johnson_all_pairs_sh… [2]http://www.boost.org/doc/libs/release/libs/graph/doc/BasicMatrix.html [3] struct Matrix { Matrix(std::vector<int64_t>& storage, size_t rows, size_t columns) : m_(storage), columns_(columns) { m_.clear(); m_.resize(rows * columns_, int64_t{0}); } int64_t& get(size_t row, size_t column) { return m_[row * columns_ + column]; } std::vector<int64_t>& m_; size_t columns_; }; struct MatrixR; struct MatrixRR { MatrixRR(MatrixR const& m, size_t column) : m_(m), column_(column) {} int64_t& operator[] (size_t row) const; MatrixR const& m_; size_t column_; }; struct MatrixR { MatrixR(Matrix& m) : m_(m) {} MatrixRR operator[] (size_t column) const { return MatrixRR(*this, column); } Matrix& m_; }; int64_t & MatrixRR :: operator[] (size_t row) const { return m_.m_.get(row, column_); }

1 0

Re: [Boost-users] [container] Boost 1.60 Release link error
by Hickman, Steve (AdvTech) 21 Dec '15

21 Dec '15

I'm using VS2012 on Win 7 64bit building 32bit executables. --- Steve H. From: Hickman, Steve (AdvTech) Sent: Monday, December 21, 2015 11:14 AM To: 'boost-users(a)lists.boost.org' <boost-users(a)lists.boost.org> Subject: [container] Boost 1.60 Release link error Getting a linker error with the Windows version of Boost on release only (not debug) using v 1.60. This did not show up with 1.58 (I skipped 1.59 so I have no comment on it). I'm using the prebuilt libraries: 8> Creating library D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.lib and object D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.exp 8>MockDevice.lib(Mock.obj) : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<char> >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@D@container@boost@@@container_detail@container@boost@@QAEXXZ) 8>MockDevice.lib(Mock.obj) : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<class boost::container::basic_string<char,struct std::char_traits<char>,class boost::container::new_allocator<char> > const ,struct boost::interprocess::ipcdetail::ref_count_ptr>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$new_allocator@D@container@boost@@@container@boost@@Uref_count_ptr@ipcdetail@interprocess@3@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 8>D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.exe : fatal error LNK1120: 2 unresolved externals Steve Hickman System Architect, Human Machine Collaboration Honeywell | Aerospace Office: 480-236-8367 steve.hickman(a)honeywell.com<mailto:steve.hickman@honeywell.com> https://in.honeywell.com/sites/aero/Pages/Home.aspx

1 0

segfault using boost::thread_specific_ptr
by Michael P. Soulier 21 Dec '15

21 Dec '15

Hello, I’m trying to implement a thread-safe logger that uses a boost::thread_specific_ptr to a std::stringstream as a logging buffer. static boost::thread_specific_ptr<std::stringstream> tls_buffer; class MLoggerHandler { public: MLoggerHandler(boost::mutex& mutex, std::ostream& ostream); ~MLoggerHandler(); void setLevel(int level); template <class T> // For handling << from any object. MLoggerHandler& operator <<(T input) { std::cerr << "Adding to buffer" << std::endl; if (m_start) { *tls_buffer << localDateTime() << " " << input; <================= SEGFAULT m_start = false; } else { *tls_buffer << input; } std::cerr << "On buffer: " << tls_buffer->str() << std::endl; return *this; } // For handling std::endl std::ostream& operator <<(std::ostream& (*f)(std::ostream&)) { std::cerr << "Flushing buffer" << std::endl; m_start = true; std::ostream& rv = f(m_ostream); m_mutex.lock(); m_ostream << tls_buffer->str(); m_mutex.unlock(); tls_buffer->str(""); return rv; } private: // A flag to indicate the beginning of a new line. bool m_start = true; // A mutex passed in from the main logger for synchronization. boost::mutex& m_mutex; // The logging level. int m_level; // The output stream. std::ostream& m_ostream; // Return the current date and time as a localized string. const std::string localDateTime(); }; The initial idea, was to flush the buffer and write when a terminating std::endl was encountered. But, just trying to dereference the pointer and write to the std::stringstream is crashing. Do I need to initialize the std::stringstream, or is it initialized in constructor? Thanks, Mike

2 3

Problems building with Windows 10.0.10586.0 SDK
by Isaac Lascasas 21 Dec '15

21 Dec '15

I have just downloaded boost 1.60 for a regular update, I have found some kind of build problem with my environment (vs2015 update 1 with Windows SDK 10.0.10586.0). I usually just do this to get a build: call bootstrap b2 headers bjam --build-type=complete --toolset=msvc-14.0 -j13 address-model=64 stage I have never required vcvarsall.bat as boost build allways finds its way. However today it wasn't able to find my windows headers so I manually did this: %comspec% /k ""C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\vcvarsall.bat"" x86_amd64 10.0.10586.0 Even so I found that boost was looking for sdk 10.0.10240.0 (an older one). In my system I still had that sdk directory, however it only contained some UCRT stuff. I uninstalled deliberately that version with my visual studio setup some days ago to upgrade to the new SDK. Until now I didn't found any problems. Maybe you should check this out a bit, I can't figure out if this is a problem of my environment, microsoft or boost build. Bringing 10240 back allows me to build boost 1.60 without any problems. My biggest concern is that boost is building against 10240 when 10586 is available and both are installed, even after an explicit vcvars call to stick to 10586. Best, Isaac Lascasas.

1 0

Duplicate function in composite_key.hpp ?
by John M. Dlugosz 21 Dec '15

21 Dec '15

I'm getting E:\C++Libs\boost_1_59_0\boost/multi_index/composite_key.hpp(638): error C2535: 'boost::multi_index::composite_key_result<boost::multi_index::composite_key<const vst::Foo1::Bar2::Baz3,boost::multi_index::const_mem_fun<vst::Foo1::Bar2::Baz3,UID,UID vst::Foo1::Bar2::Baz3::owner(void) const>,boost::multi_index::member<vst::Foo1::Bar2::Baz3,const uint32_t,pointer-to-member(0x18)>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>> boost::multi_index::composite_key<const vst::Foo1::Bar2::Baz3,boost::multi_index::const_mem_fun<vst::Foo1::Bar2::Baz3,UID,UID vst::Foo1::Bar2::Baz3::owner(void) const>,boost::multi_index::member<vst::Foo1::Bar2::Baz3,const uint32_t,pointer-to-member(0x18)>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>::operator ()(const boost::reference_wrapper<const Class> &) const': member function already defined or declared with [ Class=vst::Foo1::Bar2::Baz3 ] (compiling source file Bar2\Delta.cpp) (actual names from my code have been sanitized) Using Boost 1.59 and VS2015. The function it points to is result_type operator()(const reference_wrapper<value_type>& x)const but the error message looks like it is duplicating the previous function in the file, result_type operator()(const reference_wrapper<const value_type>& x)const and the chain of instantiation comes through composite_key.hpp, detail/ord_index_args.hpp(46), mpl/eval_if.hpp(41), detail/ord_index_args.hpp(70), ordered_index.hpp(65) with [ Arg1=boost::multi_index::tag<UID,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na>, Arg2=boost::multi_index::composite_key<const vst::Foo1::Bar2::Baz3,boost::multi_index::const_mem_fun<vst::Foo1::Bar2::Baz3,UID,UID vst::Foo1::Bar2::Baz3::owner(void) const>,boost::multi_index::member<vst::Foo1::Bar2::Baz3,const uint32_t,pointer-to-member(0x18)>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, Arg3=boost::mpl::na ] What's going on here? This worked previously with Boost 1.55 and VS2010.

1 0

[serialization] How to serialize an atomic<> value?
by Merrill Cornish 20 Dec '15

20 Dec '15

I am running Boost_1_60_0 on Windows 10 64bit on MinGW64: I have this class data member I want to serialize: std::atomic< std::time_t > mUpdate; Since I'm on a 64-bit machine, serialization recognizes that as atomic< long long int >. However, given ar & mUpdate; serialization says it does not know how to serialize atomic< long long int >. My solution, which compiles cleanly, is std::time_t updateTime = mUpdateTime.load(); ar & updateTime; mUpdateTime = updateTime; // assign is atomic My reasoning is that on load (ar => mUpdateTime), the first line is useless, but harmless. Similarly, on save (ar <= mUpdateTime), the last line is redundant, but also harmless. Of course, the application is not executing during serialization and de-serialization. As I said, this compiles without error or warning; but I worry that I have missed something. Any thoughts? Merrill Cornish Once I see how to get the above working, my next project will be std::atomic< std::shared_ptr< boost::variant<...> > mValue;

2 2