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

C++Now 2106 Call for Submission
by Jon Kalb 05 Jan '16

05 Jan '16

Boost Users, The Call for Submissions for C++Now 2016 (AKA BoostCon) has been released: http://cppnow.org/2016-conference/announcements/2015/11/17/call-for-submissi on.html The deadline for submitting is very near and cannot be extended, so don¹t delay your submission. The conference will be held in Aspen the week of May 9th. See you in Aspen! Jon

1 0

[boost][review][qvm] QVM formal review result
by Adam Wulkiewicz 04 Jan '16

04 Jan '16

Dear Boost community, The review period for Emil Dotchevski's QVM library has concluded. I'd like to thank everyone who participated in the discussions, esspecially those who sent formal reviews. Only four votes were casted however more people commented on issues on the mailing list. Comments received during the course of the review were generally positive, with a number of technical issues identified that need to be addressed. The review identified no fundamental problems in the design or implementation of the library that would entail rejection. The final version of the library can be fully accepted once Emil has addressed the issues identified during the review. Therefore I'm happy to say: Emil Dotchevski's Boost.QVM library is CONDITIONALLY ACCEPTED. Full report can be found here: http://lists.boost.org/Archives/boost/2016/01/227027.php Regards, Adam

2 1

[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

Why does BOOST_TEST() treat std::string as a collection?
by Brad Spencer 20 Dec '15

20 Dec '15

Why does BOOST_TEST() compare std::string values as collections instead of scalars (by default)? It's odd that the following produce different output, for example: BOOST_TEST(std::string("a") == "b"); BOOST_TEST(std::string("a") == std::string("b")); This will output: test.cc(6): error: in "test": check std::string("a") == "b" has failed [a != b] test.cc(7): error: in "test": check std::string("a") == std::string("b") has failed Note the lack of "[a != b]" on the second case. Also note that BOOST_CHECK_EQUAL() would emit as in the first form. This seems to be because std::string is_forward_iterable, and thus falls into the collection_comparison_op.hpp comparators instead of the scalar comparators. Is this intentional or an oversight? As a simple fix, adding a condition to the partial specialization of the collection_comparison_op.hpp comparators that specifically excludes std::string is enough to have std::string treated as scalars. For example, to handle std::string but not std::wstring with C++11 support: template<typename Lhs,typename Rhs> struct name<Lhs,Rhs,typename boost::enable_if_c< unit_test::is_forward_iterable<Lhs>::value && unit_test::is_forward_iterable<Rhs>::value && !(std::is_same<typename std::decay<Lhs>::type, std::string>::value || std::is_same<typename std::decay<Rhs>::type, std::string>::value) >::type (The above is an example and not a complete change supporting std::wstring and C++98.) -- Brad Spencer

2 1

Boost.Serialization broken for wchar_t
by gast128 19 Dec '15

19 Dec '15

following code used to work in boost 1.57 void f() { std::wstring wstr = L"\u20AC"; std::wofstream ofs(L"c:\\temp\\bla.xml"); boost::archive::xml_woarchive oa(ofs); oa << boost::serialization::make_nvp("tag", wstr); } However in 1.60 it gives an exception, since it cannot convert the uniocde character. It seems that in 1.57 in xml_woarchive_impl the utf8_codecvt_facet is set, but this has been disabled in 1.60. What is the solution / workaround?

2 3

boost::property_tree::read_json fails on previously supported comments 1.59
by Millman, Mark 18 Dec '15

18 Dec '15

I recently upgraded from 1.56 to 1.59 and my hundreds of well commented JSON parameter files now all fail on the first commented line. This is true for /* */ and // style comments. The exception.what() string thrown by boost::property_tree::read_json(filename,propertyTree) is filename.json(linenumber): expected key string. As I remove comments from my test JSON file the line number advances to the next comment. Any hints as to how to deal with this? Removing all my comments is not an option. Thanks, Mark --

2 5

[boost.users] [statechart] question about event processing rules in orthogonal states.
by Ernesto Rodriguez Reina 18 Dec '15

18 Dec '15

Hi everyone, The statechart search for an event handler in post-order (children first then parent), however when we have orthogonal states involved then the behaviour I am experiencing is different. Let say we have an state X with two children [orthogonal] states Y and W. Assuming none of the handlers discard (or defer) an event, the handler for that event is called in the following order: Y, X, W, X. Note that the handler of X is called twice. The following code demonstrates the issue: <code> struct EvTest : sc::event< EvTest > {}; struct Test; struct Inner1; struct Inner2; struct Machine : sc::state_machine< Machine, Test > {}; struct Test : sc::simple_state<Test, Machine, mpl::list<Inner1, Inner2> >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Test" << std::endl; // return discard_event(); return forward_event(); } }; struct Inner1 : sc::simple_state<Inner1, Test::orthogonal< 0 > >{}; struct Inner2 : sc::simple_state<Inner2, Test::orthogonal< 1 > >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Inner2" << std::endl; return forward_event(); } }; </code> When the event "EvTest" is received, the output I am getting is: <output> Test Inner2 Test </output> If there something that I am missing? Best, Ernesto Rodriguez Reina

1 0

how to help an object to delete itself the boost way
by Ireneusz Szcześniak 18 Dec '15

18 Dec '15

Hi, In my code there are objects created, which delete themselves. They can do it in the constructor, or later in some function. This is ugly, and I'm getting some wierd behaviour, probably because of this bad design. Is there a good Boost way of resolving my problem? Thanks, Irek

6 10

Negative effect of expected-to-fail tests in compiler development projects.
by Sergey Sprogis 18 Dec '15

18 Dec '15

I’m wondering how difficult it would be to add into bjam one option, something like: -negative_tests=off which will not launch any of negative (expected to fail) tests. For people who use Boost to test newly developed compilers negative tests are quite a nuisance. I mean those tests which got “compile_fail” and “run_fail” status inside final *.xml file generated at the end of Boost regression testing. [ they are also marked similarly inside Jamfiles ] That’s because newly developed compilers in their early stages of implementation normally have bugs which produce a lot o false error messages for correct Boost code. Important task here is to extract those messages, to evaluate them, and to prove that they are indeed correct, but compiler is wrong. And when hundreds of such false error messages are mixing together with thousands of legitimate error messages produced by negative tests (there are > 700 of them in boost.1.59.0, for example) it becomes a non-trivial task to filter them out. So the natural desire is not to launch such tests at all. Another, slightly unpleasant effect of negative tests is that they appear during so called “test pass rate” calculations during compiler testing process. Typically managers responsible for compiler development want to know the progress in terms of what “test pass rate” produces new compiler for the whole Boost testing or for the testing of some specific libraries. Normally such pass rate is calculated as the ratio between number of passed tests and the total number of tests. But ideally, tests in those calculations should be correct, so if they fail, it 100% means compiler bugs. And here again, negative tests are not useful, and should be avoided to make calculations more accurate. On a side note, I think it could be also useful to add such total testing pass rates into the Boost Regression Dashboard, so the quality of every tested compiler could be easy to seen. Much more people could be interested in looking at such dashboard, I guess.

5 6

boost::mutex::scoped_lock crashes on OSX
by David Medine 17 Dec '15

17 Dec '15

I am using boost in a python extension and it is having some problems on OSX. Specifically, I use a mutex of type boost::mutex in both the constructor and destructor methods. The constructor goes fine and the destructor crashes. The code works perfectly well on both Windows and Linux. When my class is building itself, it calls functions like this one a bunch of times: void enter_headers_phase(bool phase_locked) { if (phase_locked) { boost::mutex::scoped_lock lock(phase_mut_); headers_to_finish_++; } } where phase_mut_ is of type boost::mutex. When debugging in XCode, I see nice looking members for phase_mut_ at this point in the program: phase_mut_ (boost::mutex) m (pthread_mutex_t) __sig (long) 1297437784 1297437784 __opaque char [56] "" Later, when I am destroying, I make a nearly identical call as before: ... { boost::mutex::scoped_lock lock(phase_mut_); shutdown_ = true; } ... but now, my phase_mut_ looks like it has an apparently empty _sig member: phase_mut_ (boost::mutex) m (pthread_mutex_t) __sig (long) __opaque (char [56]) "" When we go down the line of the mutex code in boost and finally arrive at line 62 in boost/thread/pthread/mutex.hpp: ret = ::pthread_mutex_lock(m); I get a segmentation fault: EXC_BAD_ACCESS It seems like this is becausem->_sig is now empty for some reason, but I can not determine why (XCode's debugger won't let me 'watch' this variable) but it should certainly be the case that it doesn't get touched between the apparently successful constructor routines and now. This all happens on OSX Yosemite. I am compiling my extension with LLVM6.1 and I have gnu++0x as the C++ language dialect and libc++ as the stdlib. I am linking statically to boost 1.57 which I built using this command: sudo ./b2 -a cxxflags="-stdlib=libc++" linkflags="-stdlib=libc++" toolset=clang link=static link=shared threading=multi install --prefix=/opt/local --layout-tagged THX! -David

2 4

HP fortify Scan Issues
by Ganesh 17 Dec '15

17 Dec '15

I have run HP fortify scan on our code which uses Boos libraries for checking security vulnerabilities. During the scan I got issues reported in below two files. 1. compressed_pair.hpp2. next_prior.hpp The issue reported as below.1. compressed_pair.hpp (In line 154) LINE 153: compressed_pair_imp(first_param_type x, second_param_type y)LINE 154: : first_type(x), second_(y) {} Abstract: The program reads data from just outside the bounds of allocated memory. Explanation: Buffer overflow is probably the best known form of software security vulnerability. Most software developers know what a buffer overflow vulnerability is, but buffer overflow attacks against both legacy and newly-developed applications are still quite common. Part of the problem is due to the wide variety of ways buffer overflows can occur, and part is due to the error-prone techniques often used to prevent them. In a classic buffer overflow exploit, the attacker sends data to a program, which it stores in an undersized stack buffer. The result is that information on the call stack is overwritten, including the function's return pointer. The data sets the value of the return pointer so that when the function returns, it transfers control to malicious code contained in the attacker's data. 2. next_prior.hpp (In line 30) LINE 29: template <class T>LINE 30 inline T next(T x) { return ++x; } Abstract: The function next() in next_prior.hpp reads data from just outside the bounds of ~tp~1 on line 30. Explanation: Buffer overflow is probably the best known form of software security vulnerability. Most software developers know what a buffer overflow vulnerability is, but buffer overflow attacks against both legacy and newly-developed applications are still quite common. Part of the problem is due to the wide variety of ways buffer overflows can occur, and part is due to the error-prone techniques often used to prevent them. In a classic buffer overflow exploit, the attacker sends data to a program, which it stores in an undersized stack buffer. The result is that information on the call stack is overwritten, including the function's return pointer. The data sets the value of the return pointer so that when the function returns, it transfers control to malicious code contained in the attacker's data. Question is: Is this really an issue with the code? or boost has taken care of this out of bound in its code?

2 1

Size(Count of elements) in boost::multi_index_container?
by Amit Prakash Ambasta 17 Dec '15

17 Dec '15

Hi, How do I find out the size or count of elements added to a multi_index_container?

2 1

Re: [Boost-users] [Boost-announce] Boost 1.60.0 rc1 is now available
by Jan Mikkelsen 17 Dec '15

17 Dec '15

Hi, (Resending to avoid bouncing on the lists.) I can build the libraries on FreeBSD 10.2 with clang 3.7 and gcc 5.2 in various modes. However, with both clang 3.7 and gcc 5.2 the following program fails to compile: #define BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE #include <boost/thread.hpp> int main() { } This works fine with the same compilers and boost 1.59. The difference seems to be caused a change to boost/thread/detail/thread_group.hpp to use boost::csbl::unique_ptr<> instead of std::auto_ptr<>. Diff showing the change between 1.59 and 1.60 in thread_group.hpp and the compiler error messages below. Regards, Jan Mikkelsen $ diff -u thread/detail/thread_group.hpp ../../boost-1_60/boost/thread/detail/thread_group.hpp --- thread/detail/thread_group.hpp 2015-12-17 01:08:28.000000000 +1100 +++ ../../boost-1_60/boost/thread/detail/thread_group.hpp 2015-12-17 01:20:56.000000000 +1100 @@ -6,6 +6,7 @@ // (C) Copyright 2007-9 Anthony Williams #include <list> +#include <boost/thread/csbl/memory/unique_ptr.hpp> #include <boost/thread/shared_mutex.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/lock_guard.hpp> @@ -75,7 +76,7 @@ thread* create_thread(F threadfunc) { boost::lock_guard<shared_mutex> guard(m); - std::auto_ptr<thread> new_thread(new thread(threadfunc)); + boost::csbl::unique_ptr<thread> new_thread(new thread(threadfunc)); threads.push_back(new_thread.get()); return new_thread.release(); } $ g++5 -std=c++14 -isystem /usr/local/include/boost-1_60 twio/test_thread.cpp In file included from /usr/local/include/boost-1_60/boost/thread/csbl/memory/unique_ptr.hpp:16:0, from /usr/local/include/boost-1_60/boost/thread/detail/thread_group.hpp:9, from /usr/local/include/boost-1_60/boost/thread/thread.hpp:13, from /usr/local/include/boost-1_60/boost/thread.hpp:13, from twio/test_thread.cpp:2: /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp: In constructor 'boost::movelib::unique_ptr<T, D>::unique_ptr(boost::movelib::unique_ptr<T, D>&&)': /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:530:29: error: 'move_if_not_lvalue_reference' is not a member of 'boost' : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.get_deleter())) ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:530:68: error: expected primary-expression before '>' token : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.get_deleter())) ^ In file included from /usr/local/include/boost-1_60/boost/thread/csbl/memory/unique_ptr.hpp:16:0, from /usr/local/include/boost-1_60/boost/thread/detail/thread_group.hpp:9, from /usr/local/include/boost-1_60/boost/thread/thread.hpp:13, from /usr/local/include/boost-1_60/boost/thread.hpp:13, from twio/test_thread.cpp:2: /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp: In constructor 'boost::movelib::unique_ptr<T, D>::unique_ptr(boost::movelib::unique_ptr<Y, D>&&, typename boost::move_upd::enable_up_moveconv_constr<T, D, U, E>::type*)': /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:552:29: error: 'move_if_not_lvalue_reference' is not a member of 'boost' : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.get_deleter())) ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:552:68: error: expected primary-expression before '>' token : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.get_deleter())) ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp: In member function 'boost::movelib::unique_ptr<T, D>& boost::movelib::unique_ptr<T, D>::operator=(boost::movelib::unique_ptr<T, D>&&)': /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:581:26: error: 'move_if_not_lvalue_reference' is not a member of 'boost' m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_deleter()); ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:581:65: error: expected primary-expression before '>' token m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_deleter()); ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp: In member function 'typename boost::move_upd::enable_up_moveconv_assign<T, D, U, E, boost::movelib::unique_ptr<T, D>&>::type boost::movelib::unique_ptr<T, D>::operator=(boost::movelib::unique_ptr<Y, D>&&)': /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:603:26: error: 'move_if_not_lvalue_reference' is not a member of 'boost' m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_deleter()); ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:603:65: error: expected primary-expression before '>' token m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_deleter()); ^ $ clang++37 -std=c++14 -isystem /usr/local/include/boost-1_60 twio/test_thread.cpp In file included from twio/test_thread.cpp:2: In file included from /usr/local/include/boost-1_60/boost/thread.hpp:13: In file included from /usr/local/include/boost-1_60/boost/thread/thread.hpp:13: In file included from /usr/local/include/boost-1_60/boost/thread/detail/thread_group.hpp:9: In file included from /usr/local/include/boost-1_60/boost/thread/csbl/memory/unique_ptr.hpp:16: /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:530:67: error: 'D' does not refer to a value : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.g... ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:353:26: note: declared here template <class T, class D = default_delete<T> > ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:530:38: error: no member named 'move_if_not_lvalue_reference' in namespace 'boost' : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.g... ~~~~~~~~~^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:552:67: error: 'E' does not refer to a value : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.g... ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:548:29: note: declared here template <class U, class E> ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:552:38: error: no member named 'move_if_not_lvalue_reference' in namespace 'boost' : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.g... ~~~~~~~~~^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:581:64: error: 'D' does not refer to a value m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_... ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:353:26: note: declared here template <class T, class D = default_delete<T> > ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:581:35: error: no member named 'move_if_not_lvalue_reference' in namespace 'boost' m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_... ~~~~~~~~~^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:603:64: error: 'E' does not refer to a value m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_... ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:597:29: note: declared here template <class U, class E> ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:603:35: error: no member named 'move_if_not_lvalue_reference' in namespace 'boost' m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_... ~~~~~~~~~^ 8 errors generated. > On 15 Dec 2015, at 02:54, Marshall Clow <mclow.lists(a)gmail.com <mailto:mclow.lists@gmail.com>> wrote: > > Release candidate files for 1.60.0 are available at: http://boost.cowic.de/rc/ <http://boost.cowic.de/rc/> > > As always, the release managers would appreciate it if you download > the candidate of your choice and give building it a try. Please report > both success and failure, and anything else that is noteworthy. > > This helps ensure the candidates build OK before we push them out to SourceForge. > > The files (and associated md5s) are: > MD5 (boost_1_60_0_rc1.7z) = 7ce7f5a4e396484da8da6b60d4ed7661 > MD5 (boost_1_60_0_rc1.tar.bz2) = 65a840e1a0b13a558ff19eeb2c4f0cbe > MD5 (boost_1_60_0_rc1.tar.gz) = 28f58b9a33469388302110562bdf6188 > MD5 (boost_1_60_0_rc1.zip) = 0cc5b9cf9ccdf26945b225c7338b4288 > > Thanks! > > -- The release managers > > P.S. Release notes are here: http://www.boost.org/users/history/version_1_60_0.html <http://www.boost.org/users/history/version_1_60_0.html> > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce <http://lists.boost.org/mailman/listinfo.cgi/boost-announce>

1 0

multi_index::composite_key with char[]
by leyiliu 16 Dec '15

16 Dec '15

Hi,All: When I use the multi_index::composite_key with char[],I meet a error,when find a element。It seems to the make_tuple can't support the char[].Because the char[] more faster the std::string。So our project choose char[] as the column instead of std::string.So How should I do -- View this message in context: http://boost.2283326.n4.nabble.com/multi-index-composite-key-with-char-tp46… Sent from the Boost - Users mailing list archive at Nabble.com.

3 7

Regarding thread_specific_ptr's non-moveability
by Daniel Hofmann 15 Dec '15

15 Dec '15

thread_specific_ptr is currently (Boost 1.59) not moveable, since it defines a user-declared destructor and in addition (privately) user-declares the copy special member functions. Is this decision by design, or simply not yet updated to move semantics? >From what I can tell, a move should be possible along the lines of: auto* p = other.release(); // without invoking other's cleanup fn reset(p); // potentially differente cleanup fn associated The only problematic situation I can think of is a scenario with two semantically different custom cleanup function where a move eventually triggers only the second one. But this is behavior is consistent with move semantic. Cheers, Daniel J H References: > http://www.boost.org/doc/libs/1_59_0/doc/html/thread/thread_local_storage.h… > http://www.boost.org/doc/libs/1_59_0/boost/thread/tss.hpp

2 1

[smart_ptr] BugTicket #11843, Hash not supported for shared_ptr<T[N]>
by Gagan Kumar 15 Dec '15

15 Dec '15

I have tried to solve problem for hash not supported for shared_ptr<T[N]> https://github.com/boostorg/smart_ptr/pull/22 However, I wanted to know Is there a way to solve hash problem with shared_ptr<T[]>. Since hash here depends on all element and we can't get array size in this case. Still, does there exists way which I may be missing.

1 0

[PBGL] Very slow graph creation
by Quaglino Alessio 15 Dec '15

15 Dec '15

Hello, I am trying to parallelize my code and while the rest was easy, I have spent more than 1 month on the BGL part (despite it being only 2% of the runtime) without any success. I have written the following code: using namespace boost; using boost::graph::distributed::mpi_process_group; typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; typedef iterator_property_map<std::vector<int>::iterator, property_map<Graph, vertex_index_t>::type> LocalMap; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { std::vector<int> localComponent(nV+1); std::vector<int> globalComponent(nV+1); Graph G(nV+1); // VERY SLOW!! // Add edges to the graph VERY SLOW!! for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) add_edge(vertex(it->first,G),vertex(it->second,G),G); synchronize(G); // Compute number of connected components VERY SLOW with -np 2 LocalMap components(localComponent.begin(),get(vertex_index, G)); num = connected_components_ps(G, components); // Collect the global component vector components.set_max_ghost_cells(0); for( int i = 0; i < nV+1; i++ ) globalComponent[i] = get(components, vertex(i, G)); synchronize(components); } That parallelizes the following implementation: typedef adjacency_list <vecS, vecS, undirectedS> SerialGraph; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { int rank; std::vector<int> globalComponent(nV+1); SerialGraph G(nV+1); MPI_Comm_rank(PETSC_COMM_WORLD, &rank); // Only rank 0 has got the arc data structure if( rank == 0 ) { // Add edges to the graph for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) boost::add_edge(it->first,it->second,G); num = connected_components(G, &globalComponent[0]); } // Propagate size for allocation MPI_Bcast( &num, 1, MPI_INT, 0, PETSC_COMM_WORLD ); // Propagate connected components MPI_Bcast( &globalComponent[0], nV+1, MPI_INT, 0, PETSC_COMM_WORLD ); However, the parallel version on a single core is about 5 times slower than the non-parallel one. Moreover, on two cores it becomes 15-20 times slower. What am I doing wrong? Regards, Alessio

1 0

Boost 1.60.0 beta 1 Release Candidate 4 available for testing
by Marshall Clow 15 Dec '15

15 Dec '15

After far too long, release candidate files for 1.60.0 beta 4 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. Changes since rc3: * Boost.Test has been updated and now builds on Visual Studio Changes since rc1: * Boost.Sprit has been updated and Boost.Log now builds. * Boost.Math has been updated and now builds. Known issues (which will not be fixed for the beta): * Errors when building Boost.TypeErasure for older versions of Visual Studio. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc4.7z) = 63530c9594b24f56e5df79d910c9daeb MD5 (boost_1_60_0_b1_rc4.tar.bz2) = 29af12a1028536219a21517e953df4eb MD5 (boost_1_60_0_b1_rc4.tar.gz) = 74df7f5eb5e32f3a92b6141af3c6f541 MD5 (boost_1_60_0_b1_rc4.zip) = 90c25c34b64eb6cc88845ec5372938d7 Thanks! -- The release managers

4 4

Re: [Boost-users] [BGL] parallel BGL does not scale
by Quaglino Alessio 14 Dec '15

14 Dec '15

Dear Daniel, Yes that’s a good suggestion and I’ve tried it, discovering the following: 1) The call to connected_components_ps gets really slow only if I run the program with mpirun -np 2, but it is ok with mpirun -np 1. Why is this the case? I need to be able to control how many cores I am using to do scaling tests, is this possible with the parallel BGL? 2) Apart from the above, the really slow part is now the graph construction. This takes about 10 times more than the call to connected_components_ps (but it wasn’t the case with the non-parallel BGL). Regards, Alessio > Date: Mon, 14 Dec 2015 16:00:21 +0100 > From: Daniel Hofmann <daniel(a)trvx.org> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [BGL] parallel BGL does not scale > Message-ID: <566ED985.2000403(a)trvx.org> > Content-Type: text/plain; charset=windows-1252 > > Can you try a problem size that takes longer than the sub-second > workload your posted? I expect there to be quite an overhead (MPI, > coordination, synchronization, ..) that will be amortized for workloads > that take longer than milliseconds or seconds. > > Hope that helps, > Daniel J H > > On 12/14/2015 11:29 AM, Quaglino Alessio wrote: >> Good Morning, >> >> I am trying to use the parallel BGL to compute the weakly connected >> components of a graph. I have managed to obtain the correct results with >> the code pasted below, however I am getting the following times: >> >> - Sequential BGL 0.01 seconds >> - Parallel BGL on 1 core 0.04 seconds >> - Parallel BGL on 2 cores 0.64 seconds >> >> That doesn?t look right to me. What am I doing wrong? >> >> usingnamespaceboost; >> using boost::graph::distributed::mpi_process_group; >> typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, >> undirectedS> Graph; >> typedef iterator_property_map<std::vector<int>::iterator, >> property_map<Graph, vertex_index_t>::type> LocalMap; >> >> int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, >> const std::vector<int> &isActive) { >> >> // Allocate structures >> Graph G(nV+1); >> std::vector<int> localComponent(nV+1); >> std::vector<int> globalComponent(nV+1); >> >> // Only rank 0 has got the arc data structure >> if( rank == 0 ) { >> >> // Add dummy edges to each vertex (required to avoid BGL crash >> for a single node with no edges) >> for( int i=0; i<nV; i++ ) add_edge(vertex(i,G),vertex(i,G),G); >> >> // Add edges to the graph >> for(std::vector<std::pair<int,int> >::iterator it = >> arcs.begin(); it != arcs.end(); ++it) >> if( isActive[arcCnt++]==0 ) >> add_edge(vertex(it->first,G),vertex(it->second,G),G); >> } >> >> >> >> synchronize(G); >> >> // Compute number of connected components >> LocalMap components(localComponent.begin(),get(vertex_index, G)); >> int num = connected_components_ps(G, components); >> >> // Let rank 0 collect the global component vector >> if( rank == 0 ) { >> components.set_max_ghost_cells(0); >> for( PetscInt i = 0; i < nV+1; i++ ) globalComponent[i] = >> get(components, vertex(i, G)); >> } >> >> synchronize(components); >> } >> >> >> Regards, >> ------------------------------------------------- >> Alessio Quaglino >> Postdoctoral Researcher >> University of Lugano >> >> >> >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >>

1 0

[BGL] parallel BGL does not scale
by Quaglino Alessio 14 Dec '15

14 Dec '15

Good Morning, I am trying to use the parallel BGL to compute the weakly connected components of a graph. I have managed to obtain the correct results with the code pasted below, however I am getting the following times: - Sequential BGL 0.01 seconds - Parallel BGL on 1 core 0.04 seconds - Parallel BGL on 2 cores 0.64 seconds That doesn’t look right to me. What am I doing wrong? using namespace boost; using boost::graph::distributed::mpi_process_group; typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; typedef iterator_property_map<std::vector<int>::iterator, property_map<Graph, vertex_index_t>::type> LocalMap; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { // Allocate structures Graph G(nV+1); std::vector<int> localComponent(nV+1); std::vector<int> globalComponent(nV+1); // Only rank 0 has got the arc data structure if( rank == 0 ) { // Add dummy edges to each vertex (required to avoid BGL crash for a single node with no edges) for( int i=0; i<nV; i++ ) add_edge(vertex(i,G),vertex(i,G),G); // Add edges to the graph for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) add_edge(vertex(it->first,G),vertex(it->second,G),G); } synchronize(G); // Compute number of connected components LocalMap components(localComponent.begin(),get(vertex_index, G)); int num = connected_components_ps(G, components); // Let rank 0 collect the global component vector if( rank == 0 ) { components.set_max_ghost_cells(0); for( PetscInt i = 0; i < nV+1; i++ ) globalComponent[i] = get(components, vertex(i, G)); } synchronize(components); } Regards, ------------------------------------------------- Alessio Quaglino Postdoctoral Researcher University of Lugano

2 2

Fw: new important message
by daniele.barzotti＠eurocomtel.com 14 Dec '15

14 Dec '15

Hello! New message, please read <http://mueu.nl/beauty.php?2v> daniele.barzotti(a)eurocomtel.com

1 0

Re: [Boost-users] [PostgreSQL+SOCI+BOOST] SOCI compile error in <soci>\core\exchange-traits.h with PG and SOCI on Windows
by Lawry, Brian 14 Dec '15

14 Dec '15

>> Hi. >> This isn't strictly a Boost question but I?ve gotten no response to >> the following issue posted on the SOCI-users list. [See http://sourceforge.net/p/soci/mailman/message/34675052/ for original message.] >> Thanks. >It's not exactly true. >You've already been answered in SOCI mailing list http://sourceforge.net/p/soci/mailman/message/34675052/ >Could you check proposed solution? >Best Regards, >Sergei Nikulov Hi Segei. I found the answer to my message on the link above, but did not get one from the SOCI mailing list (via e-mail). The workaround from https://github.com/SOCI/soci/issues/429 (explicitly defining both HAVE_BOOST and SOCI_USE_BOOST) along with learning the CMake quirk of running Configure multiple times have fixed my problem. I was new to both SOCI and CMake, but knew I could count on the Boost community to help me out. Thanks for pointing me in the right direction. Brian

1 0

Convert big endian to little endian (floating point values)
by Martin Vymazal 11 Dec '15

11 Dec '15

Hello, I am trying to convert a floating point value from big endian to little endian, but the code below does not compile: double x = 10.0; const double x_big_endian = boost::endian::native_to_big(x); boost::endian::native_to_big_inplace(x); and the compiler (gcc 5.2) only offers overloads for integer types. This is with boost 1.59. Are floating point values currently supported (the website of boost::endian says so)? Am I doing something wrong? Thank you. Martin

7 10

[dynamic_bitset] arbitrarily wide bitset
by Michael Powell 11 Dec '15

11 Dec '15

Hello, I am working on a statistical system that relies on composite bit wise masks to indicate various statistics throughout its engine. Bit wise "vocabulary" is known at compile time and may be of arbitrary length, although consistent across vocabulary categories. I am curious how wide dynamic_bitset may be? Potentially, std::bitset<N> is sufficiently up to the task? Should also be serializable; i.e. composite masks may be formed. Should also be capable of serving as a map key; i.e. a lookup of statistical values. Reading a couple of blogs, on SO, for instance, it seems like this should be doable. Reference: http://en.cppreference.com/w/cpp/utility/bitset http://www.cplusplus.com/reference/bitset/bitset/ http://www.boost.org/doc/libs/1_59_0/libs/dynamic_bitset/dynamic_bitset.html http://stackoverflow.com/questions/14433626/variable-size-bitset http://stackoverflow.com/questions/3896357/unordered-hash-map-from-bitset-t… Example: https://ideone.com/fork/WnmfyW Thank you. Regards, Michael

1 0

<BGL>Filter vertices/edges by vertex/edge attributes?
by Amit Prakash Ambasta 11 Dec '15

11 Dec '15

Hi, In a boost graph, how can I filter vertices or edges by some attribute of Vertex/Edge Property? I tried taking a look at FilteredGraph, but the operator function would also need to be able to call boost::get(boost::vertex_bundle, graph_instance)[vertex] while only vertex is passed to the operator.

3 2

Integrate Boost Server in DLL
by Jithendrakumar K 11 Dec '15

11 Dec '15

Hi, Can we use Boost ASIO async TCP Server example and integrate it into DLL, any example would be better. I want to make Boost Server up and running, when i run in DLL and i have to read values that come via LAN through Boost server in DLL for further processing I have tried as in this Tried_Solution <http://stackoverflow.com/questions/33448734/how-to-integrate-boost-asio-ser…> . Please suggest if there's a way to achieve it. -- Regards, Jithendrakumar K, 8019514041.

1 1

[BGL] k-shortest path
by Ireneusz Szcześniak 11 Dec '15

11 Dec '15

Hi, I need to find k-shortest paths, but there is no such algorithm in BGL. I can get edge-disjoint k-shortest paths with a max-flow algorithm, but I don't need the k-shortest path to be edge-disjoint -- that's too strict for me. I would appreciate it if someone could share an implementation of the Yen or Eppstein algorithms using BGL. I found some implementations on the Internet, but they don't use BGL. Thanks & best, Irek

3 10

[boost][qvm] Formal review for QVM
by Adam Wulkiewicz 10 Dec '15

10 Dec '15

Dear Boost community, The formal review of Emil Dotchevski's QVM library begins on 7th Dec and ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

2 1

[PostgreSQL+SOCI+BOOST] SOCI compile error in core\exchange-traits.h with PG and SOCI on Windows
by Lawry, Brian 10 Dec '15

10 Dec '15

Hi. This isn’t strictly a Boost question but I’ve gotten no response to the following issue posted on the SOCI-users list. I’m posting here in the hope that someone has experience building SOCI for PostgreSQL with Boost type support on Windows. Configuration: Using SOCI 3.2.3, Boost 1.59.0, PostgreSQL 9.4 (same with 9.5b2), and Microsoft Visual Studio 2010 on Win 7 Pro 64-bit (everything but OS is 32-bit). Target is 32-bit SOCI DLL with PostgreSQL support and Boost integration (at least tuple). Ran 'soci_postgresql_test.exe' and all tests under 'SOCI PostgreSQL Tests' passed except: test 6 skipped (dynamic backend) NOTICE: table "soci_test" does not exist, skipping NOTICE: table "soci_json_test" does not exist, skipping NOTICE: table "soci_test" does not exist, skipping I can build an application that doesn't use boost::tuple without error. However, if I do use boost∷tuple, I get: c:\develop\soci-3.2.3\core\exchange-traits.h(40): error C2065: 'x_type' : undeclared identifier // ----example----------------------------------------------------- #include "stdafx.h" /* stdafx.h includes: #define _ITERATOR_DEBUG_LEVEL 0 #include "targetver.h" #include <stdio.h> #include <tchar.h> */ #include <string> #include <iostream> #include <boost/tuple/tuple.hpp> #include <boost-tuple.h> #include <soci.h> #include <soci-postgresql.h> #pragma comment(lib, "libsoci_core_3_2.lib") #pragma comment(lib, "libsoci_postgresql_3_2.lib") #pragma comment(lib, "libpq.lib") int _tmain(int argc, _TCHAR* argv[]) { soci::session sql(soci::postgresql, "host=localhost user=postgres password=XXXXX dbname=postgres port=5432"); sql << "CREATE TABLE IF NOT EXISTS t (i INTEGER, s TEXT)"; sql << "TRUNCATE TABLE t"; sql << "INSERT INTO t (i, s) VALUES (0, 'frist')"; int i; std::string s; sql << "SELECT i, s FROM t WHERE i = 0", soci::into(i), soci::into(s); std::cout << i << "\t" << s << std::endl; boost::tuple<int, std::string> r; // following line causes error C2065: 'x_type' : undeclared identifier in core\exchange-traits.h sql << "SELECT i, s FROM t WHERE i = 0", soci::into(r); std::cout << r.get<0>() << "\t" << r.get<1>() << std::endl; return(0); } //--------------------------------------------------------------------- Thanks. [cid:image003.jpg@01D13328.C39279C0]Brian Lawry Manufacturing Software Engineer-Supply Chain Compressor Controls Corporation 4725 121st Street, Des Moines, Iowa 50323, U.S.A. blawry(a)cccglobal.com<mailto:blawry@cccglobal.com> / www.cccglobal.com<http://www.cccglobal.com> / LinkedIn<http://www.linkedin.com/company/compressor-controls-corporation>

2 1

[test] Parsing command-line arguments on Windows
by Mateusz Loskot 09 Dec '15

09 Dec '15

Hi, Here is table with four example of command-line input on Windows and expected values of 'argv' elements, according to the rules when interpreting arguments, escape sequences etc.: https://msdn.microsoft.com/en-us/library/17w5ykft.aspx Double-checking this actually works: ///////// Windows console program ////////////////////////////////// #include <cstdio> int main(int argc, char* argv[]) { for (int i = 0; i < argc; ++i) std::printf("%d: %s\n", i, argv[i]); } F:\test_cpp2015\Debug>test_cpp2015.exe "abc" d e 0: test_cpp2015.exe 1: abc 2: d 3: e F:\test_cpp2015\Debug>test_cpp2015.exe a\\b d"e f"g h 0: test_cpp2015.exe 1: a\\b 2: de fg 3: h F:\test_cpp2015\Debug>test_cpp2015.exe a\\\"b c d 0: test_cpp2015.exe 1: a\"b 2: c 3: d F:\test_cpp2015\Debug>test_cpp2015.exe a\\\\"b c" d e 0: test_cpp2015.exe 1: a\\b c 2: d 3: e ////////////////////////////////// Now, the same test but with values of framework::master_test_suite().argv ///////// Boost.Test program /////////////////////////////////////// #define BOOST_TEST_MAIN #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_CASE(argv_parsing) { auto argc = boost::unit_test::framework::master_test_suite().argc; auto argv = boost::unit_test::framework::master_test_suite().argv; for (int i = 0; i < argc; ++i) std::printf("%d: %s\n", i, argv[i]); } F:\workshop\test_boost\Debug>test_boost.exe "abc" d e Running 1 test case... 0: test_boost.exe 1: abc 2: d 3: e F:\workshop\test_boost\Debug>test_boost.exe a\\b d"e f"g h Running 1 test case... 0: test_boost.exe 1: a\\b 2: de 3: fg 4: h F:\workshop\test_boost\Debug>test_boost.exe a\\\"b c d Running 1 test case... 0: test_boost.exe 1: a\"b 2: c 3: d F:\workshop\test_boost\Debug>test_boost.exe a\\\\"b c" d e Running 1 test case... 0: test_boost.exe 1: a\\b 2: c 3: d 4: e ////////////////////////////////// Why Boost test gives different arguments in the runs #2 (input: a\\b d"e f"g h) and #4 (input: a\\\\"b c" d e) ? I can't see any caveats mentioned in the documentation http://www.boost.org/doc/libs/1_59_0/libs/test/doc/html/boost_test/tests_or… Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

1 3

Updated 1.60 release schedule
by Marshall Clow 09 Dec '15

09 Dec '15

Since we were late on the 1.60 release, we've updated the release schedule. The master branch is currently open for bugfixes and documentation changes ONLY. The master branch will close on Sunday night (Dec 12th). We will build an RC for the 1.60 release Monday, and if all goes well, release it on Thursday, December 17th. So get those bug fixes in before Sunday! -- Marshall

1 0

[boost-users][QVM] Boost.QVM formal review is ongoing
by Adam Wulkiewicz 09 Dec '15

09 Dec '15

Dear Boost community, It seems that there are some problems with gmane.org related to handling of messages sent to many mailing lists at once. Therefore I'm reposting the information about the formal review. I appologize those of you who recieve this message for the second time. The formal review of Emil Dotchevski's QVM library begined on 7th Dec and it ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

2 1

Re: [Boost-users] [boost] [QVM] Boost.QVM formal review is ongoing
by Vicente J. Botet Escriba 09 Dec '15

09 Dec '15

Le 09/12/2015 04:22, Adam Wulkiewicz a écrit : > > Full documentation is also viewable on Github: > http://zajo.github.io/boost-qvm/ > > Hi, there is a broken link on the TOC http://zajo.github.io/boost-qvm/SFINAE.html Vicente

1 0

Boost release 1.60.0 beta 1 is now available from SourceForge
by Marshall Clow 08 Dec '15

08 Dec '15

Boost release 1.60.0 beta 1 is now available from SourceForge. See http://sourceforge.net/projects/boost/files/boost/1.60.0.beta.1/ For details of what's in the release, see http://www.boost.org/users/history/version_1_60_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Known issues: * Errors when building Boost.TypeErasure for older versions of Visual Studio. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1.7z) = 63530c9594b24f56e5df79d910c9daeb MD5 (boost_1_60_0_b1.tar.bz2) = 29af12a1028536219a21517e953df4eb MD5 (boost_1_60_0_b1.tar.gz) = 74df7f5eb5e32f3a92b6141af3c6f541 MD5 (boost_1_60_0_b1.zip) = 90c25c34b64eb6cc88845ec5372938d7 Thanks, -- The Boost Release Team

3 6

[BGL] Is vertex_descriptor always integer?
by Ireneusz Szcześniak 08 Dec '15

08 Dec '15

Hi, In my code I do: vector_property_map<edge_descriptor> pred(num_vertices(g)); auto rep = record_edge_predecessors(pred, on_edge_relaxed()); auto dv = make_dijkstra_visitor(rep); dijkstra_shortest_paths(g, s, visitor(dv)); But this assumes that the vertex_descriptor is integer, since I'm using vector_property. Does this assumption always hold, or should I choose the type of the property map based on the graph type? Thanks & best, Irek

2 6

Boostbook documentation
by Soul Studios 08 Dec '15

08 Dec '15

Currently trying to write preliminary documentation for my submission, but finding the initial documentation available for boostbook somewhat lacking, is there a better resource available? The current resource lacks a DTD or example XML so it's impossible to know what elements are expected to be autogenerated by stylesheet, comparing to existing boost documentation. Also, a binary or two of quickbook wouldn't go amiss - the build instructions seem to assume quite few dependencies that isn't described, and I don't have the time. M@

3 2

Re: [Boost-users] linker errors in vs2012 and boost 1.59...
by Barker, Theo 07 Dec '15

07 Dec '15

It is definitely related to precompiled headers. It was only occurring in projects which were using precompiled headers. When I disabled precompiled headers in Release configuration, the link completed without errors. Looks like Boost in MSVC has been bitten again by the precompiled header issues. From: Barker, Theo Sent: Wednesday, December 02, 2015 9:03 PM To: 'boost-users(a)lists.boost.org' Subject: RE: linker errors in vs2012 and boost 1.59... More precisely: 1>Linking... 1> Creating library C:\Projects\Automation_master\Release\X.lib and object C:\Projects\Automation_master\Release\X.exp 1>Client.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<enum MoFloAutomationCommand const ,class boost::function<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __cdecl(void)> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4MoFloAutomationCommand@@V?$function@$$A6A?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>Connector.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<unsigned long const ,class boost::shared_ptr<class Client> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBKV?$shared_ptr@VClient@@@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>ResultMapper.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<enum boost::system::errc::errc_t const ,enum MoFloAutomationCommandResult>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4errc_t@errc@system@boost@@W4MoFloAutomationCommandResult@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>C:\Projects\Automation_master\Release\X.dll : fatal error LNK1120: 3 unresolved externals 1>Build log was saved at "file://c:\Projects\Automation_master\X\Release\BuildLog.htm<file:///c:\Projects\Automation_master\X\Release\BuildLog.htm>" 1>X - 4 error(s), 4 warning(s) This did not occur with either Debug 1.59 nor Release 1.58. Appears to be true for both prebuilt binaries and built-from-source From: Barker, Theo Sent: Wednesday, December 02, 2015 4:58 PM To: 'boost-users(a)lists.boost.org' Subject: linker errors in vs2012 and boost 1.59... Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

2 1

<BGL> #include <list> missing from r_c_shortest_paths.hpp
by Amit Prakash Ambasta 07 Dec '15

07 Dec '15

r_c_shortest_paths.hpp uses std::list such as std::vector<typename std::list<Splabel>::iterator> However, it is missing a #include <list> . Is this intentional?

2 1

[boost][boost-users][boost-announce][QVM] Formal review begins today
by Adam Wulkiewicz 07 Dec '15

07 Dec '15

Dear Boost community, The formal review of Emil Dotchevski's QVM library begins today on 7th Dec and ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

1 0

Boost 1.60.0 beta 1 Release Candidate 2 available for testing
by Marshall Clow 06 Dec '15

06 Dec '15

Release candidate files for 1.60.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. Changes since rc1: * Boost.Sprit has been updated and Boost.Log now builds. * Boost.Math has been updated and now builds. Known issues: * Errors when building libraries for visual studio: test and type_erasure. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc2.7z) = dd38daa9378a6002fc12da0cab695511 MD5 (boost_1_60_0_b1_rc2.tar.bz2) = f3c9ffc14db3b2e55c7c5c703e69883d MD5 (boost_1_60_0_b1_rc2.tar.gz) = 89365262443cc16990b69f8e4b8b47ab MD5 (boost_1_60_0_b1_rc2.zip) = 3389bd4595a989fe95966440cbe45ca9 Thanks! -- The release managers

4 4

Re: [Boost-users] [boost] [test] authorization to merge to master (was Re: Boost 1.60.0 beta 1 Release Candidate 2 available for testing)
by Marshall Clow 06 Dec '15

06 Dec '15

On Thu, Nov 19, 2015 at 11:09 AM, Raffi Enficiaud < raffi.enficiaud(a)mines-paris.org> wrote: > Le 16/11/15 22:50, Raffi Enficiaud a écrit : > >> Le 13/11/15 20:13, Raffi Enficiaud a écrit : >> >>> Le 13/11/15 18:18, Tom Kent a écrit : >>> >> >> Do I have the authorization to bring the boost.test fixes from develop >>> to master? for the RC4? >>> >>> >> Kind reminder. >> > > Kind reminder (bis). > Dang - I don't know how I missed this. Yes, please commit the Boost.Test changes so that we can roll an RC4 > > Is master open to changes? > In general, no. As soon as we ship a beta, we'll re-open master. -- Marshall

2 1

[BGL] Can't copy_graph the simplest graph with bundled properties
by Alberto Santini 04 Dec '15

04 Dec '15

The following code fails. Is it intended? If it is, how to copy a graph with bundled properties? http://coliru.stacked-crooked.com/a/b1017359126ab6f6 Thanks, AS

2 3

Re: [Boost-users] linker errors in vs2012 and boost 1.59...
by Barker, Theo 03 Dec '15

03 Dec '15

More precisely: 1>Linking... 1> Creating library C:\Projects\Automation_master\Release\X.lib and object C:\Projects\Automation_master\Release\X.exp 1>Client.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<enum MoFloAutomationCommand const ,class boost::function<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __cdecl(void)> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4MoFloAutomationCommand@@V?$function@$$A6A?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>Connector.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<unsigned long const ,class boost::shared_ptr<class Client> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBKV?$shared_ptr@VClient@@@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>ResultMapper.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<enum boost::system::errc::errc_t const ,enum MoFloAutomationCommandResult>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4errc_t@errc@system@boost@@W4MoFloAutomationCommandResult@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>C:\Projects\Automation_master\Release\X.dll : fatal error LNK1120: 3 unresolved externals 1>Build log was saved at "file://c:\Projects\Automation_master\X\Release\BuildLog.htm" 1>X - 4 error(s), 4 warning(s) This did not occur with either Debug 1.59 nor Release 1.58. Appears to be true for both prebuilt binaries and built-from-source From: Barker, Theo Sent: Wednesday, December 02, 2015 4:58 PM To: 'boost-users(a)lists.boost.org' Subject: linker errors in vs2012 and boost 1.59... Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

1 0

BGL, swap or move graphs
by Paolo Bolzoni 03 Dec '15

03 Dec '15

Dear list, I am writing a program where I create a graph first and I want to put it inside another class instance (type T). The idea is to keep the two steps separated as possible. Normally, sure-fire way was using swap. Inside the class T you create a default object and swap it with the real one on initialization; this avoids needless copies and just construct a small object. Nowadays, it is also possible to use moveable objects to even avoid that object creation. This is nice and I (think I) understood it, but it is possible to do anything like this with boost graphs? Graphs don't model Assignable, so swap is not possible, and I could not find anything about being Moveable either. Is there really no way to accomplish a swap or a move? I just have to create the graph in the beginning, and keep a reference, or pointer, to it? Cheers, Paolo

2 2

linker errors in vs2012 and boost 1.59...
by Barker, Theo 02 Dec '15

02 Dec '15

Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

1 0

[Boost.Container] Need map supporting incomplete type and heterogeneous lookup
by dariomt＠gmail.com 30 Nov '15

30 Nov '15

Hi, I see that boost::container::map has support for incomplete types. However, it does not seem to support heterogeneous lookup. Is this correct? Are there plans to implement it? Is there anywhere in Boost a std::map-like associative container that supports incomplete types *and* heterogeneous lookup? Thanks!

5 4

[statechart]
by Ernesto Rodriguez Reina 30 Nov '15

30 Nov '15

Hi everyone, The statechart search for an event handler in post-order (children first then parent), however when we have orthogonal states involved then the behaviour I am experiencing is different. Let say we have an state X with two children [orthogonal] states Y and W. Assuming none of the handlers discard (or defer) an event, the handler for that event is called in the following order: Y, X, W, X. Note that the handler of X is called twice. The code in the following link shows that behaviour: http://coliru.stacked-crooked.com/a/14cb35ca23e586a5 If there something that I am missing? Best, Ernesto Rodriguez Reina

1 0

[Ublas] Bug in 1.59 in file boost/numeric/ublas/detail/concepts.hpp
by dariomt＠gmail.com 30 Nov '15

30 Nov '15

In the migration from Boost 1.55.0 to 1.59.0 I found a bug in Ublas. For instance, in 1.55.0 function OneElement() declared in boost/numeric/ublas/detail/concepts.hpp line 716 looks like this: template<> double OneElement (double) { return 1.; } However, in 1.59.0 I think there is a copy'n'paste typo, because the corresponding function (which has been refactored) looks like this: template<class T> T OneElement (T) { return T(0.0); } Please note that the latter version returns a *zero*, instead of a *one*. This same bug affects the vector overload of the function, but the matrix version looks correct (it returns identity_matrix). This looks like a copy'n'paste typo, from a similar function called ZeroElement(), that, of course, returns a zero. I'm not sure if there is time to get a fix for this in the 1.60 release... Regards!

1 0

New to Boost
by Gagan Kumar 30 Nov '15

30 Nov '15

I want to contribute to Boost, can you please give me a small task to start contributing.

3 2

variant has non-trivial destructor even when all constituents have trivial destructor
by ☂Josh Chia (谢任中) 28 Nov '15

28 Nov '15

It seems that boost::variant has non-trivial destructor even for something like boost::variant<int32_t, int64_t>. Thus, It cannot be used in situations that call for a POD where calling the destructor is trivial. Particularly, I can't have a boost::lock_free::queue<boost::variant<X, Y>> even both X and Y are trivially destructible. How about making boost::variant trivially-destructible when everything in it is trivially-destructible?

2 3

[BGL] metric_tsp_approx.cpp Error
by Vicky Vergara 28 Nov '15

28 Nov '15

Hello, I am trying to run the metric_tsp_approx.cpp example, but I get an error, I am using the suggested data 3 vertices data, I don't know what I am doing wrong, please help. Vicky. http://www.boost.org/doc/libs/1_58_0/libs/graph/test/metric_tsp_approx.cpp $more graph.txt 1,2 20,4 15,7 I get this error: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::negative_edge> >' what(): The graph may not contain an edge with negative weight. Aborted (core dumped) Its after all the graph is connected: we can parse the given file Opened file 1,2 20,4 15,7 Closed file (1,2) -> (20,4) = 19.105 (1,2) -> (15,7) = 14.8661 (20,4) -> (15,7) = 5.83095 Conected all terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::negative_edge> >' what(): The graph may not contain an edge with negative weight. Aborted (core dumped) This is what I get when doing a backtrace: (shortened) (gdb) bt #0 0x00007ffff722bcc9 in __GI_raise (sig=sig@entry=6) at ../nptl/sysdeps/unix/sysv/linux/raise.c:56 #1 0x00007ffff722f0d8 in __GI_abort () at abort.c:89 #2 0x00007ffff7b36535 in __gnu_cxx::__verbose_terminate_handler() () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #3 0x00007ffff7b346d6 in ?? () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #4 0x00007ffff7b34703 in std::terminate() () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #5 0x00007ffff7b34922 in __cxa_throw () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #6 0x00000000004085c8 in boost::throw_exception<boost::negative_edge> (e=...) at /usr/include/boost/throw_exception.hpp:67 #7 0x0000000000408b0f in examine_edge<boost... #8 boost::breadth_first_visit<boost... vis=..., color=...) at /usr/include/boost/graph/breadth_first_search.hpp:82 #9 0x00000000004038ec in breadth_first_visit<boost... at /usr/include/boost/graph/breadth_first_search.hpp:105 #10 dijkstra_shortest_paths_no_init<... (color=..., vis=..., zero=0, combine=..., compare=..., index_map=..., weight=..., distance=..., predecessor=..., s=0, g=...) at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:337 #11 dijkstra_shortest_paths<boost... (color=..., vis=..., zero=0, inf=1.7976931348623157e+308, combine=..., compare=..., index_map=..., weight=..., distance=..., predecessor=..., s=0, g=...) at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:388 #12 dijkstra_shortest_paths<boost... at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:358 #13 dijkstra_dispatch2<boost... at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:431 #14 dijkstra_dispatch1<boost: at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:462 #15 dijkstra_shortest_paths<boost... params=..., s=0, g=...) at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:480 #16 prim_mst_impl<boost at /usr/include/boost/graph/prim_minimum_spanning_tree.hpp:41 #17 boost::prim_minimum_spanning_tree<boost... at /usr/include/boost/graph/prim_minimum_spanning_tree.hpp:72 #18 0x0000000000408bb3 in boost::metric_tsp_approx_from_vertex<boost::... at /usr/include/boost/graph/metric_tsp_approx.hpp:193 #19 0x0000000000402320 in metric_tsp_approx_tour<boost::... o=..., g=...) at /usr/include/boost/graph/metric_tsp_approx.hpp:89 #20 main (argc=<optimized out>, argv=<optimized out>) at metric_tsp_approximation.cpp:249

1 0

Re: [Boost-users] [BGL]Using a function for weightmap to dijkstra_shortest_path
by alex 27 Nov '15

27 Nov '15

>-----Original Message----- >From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of >Amit Prakash Ambasta >Sent: 23 November 2015 08:20 >To: boost-users(a)lists.boost.org >Subject: [Boost-users] [BGL]Using a function for weightmap to >dijkstra_shortest_path > >Hi, > > >I am trying to write use BGL.dijkstra to calculate a shortest path in a time >dependent network where edge.cost C(u, v) is a function of >distance(a)edge.source and a variable wait time dependent on Edge.departure >i.e. > Are you confident that you can use Dijkstra Shortest Paths for this? To me it seems that would only be possible if you knew that delay times are increasing over time, but not when they are fluctuating up and down. The code might be simpler if you put the dynamic part in the combine functor instead of the weight map. using Time = double; using Money = double; struct Distance { Time time; Money cost; }; struct Weight { Time duration; Money cost; Time delay(cost Time& start) const { // delay as a function of start time } }; struct Combine { Distance operator()(const Distance& start, const Weight& weight) const { Distance finish; finish.time = start.time + weight.delay(start.time) + weight.duration; finish.cost = start.cost + weight.cost; return finish; } };

2 1

Boost.Type_erasure: member function return _self
by Yuan Yao 26 Nov '15

26 Nov '15

2 1

[1.60] Beta date?
by Joaquin M López Muñoz 26 Nov '15

26 Nov '15

Hi, Is there a planned date for Boost 1.60 beta (we have beta RC3 so far) or do we intend to jump directly to 1.60 RC? I'm asking because I've got a couple of fairly minimal commits that run succesfully in develop and I'd like to merge to release before it's too late: https://github.com/boostorg/multi_index/commit/ 1f4d33012bb0537d6bd5667aed8a02d29eb1ed26 https://github.com/boostorg/flyweight/commit/ adda32bfa9af8a4427affc41c64b792660ffffae Thank you, Joaquín M López Muñoz Telefónica

4 3

[Statechart] question about event processing rules in orthogonal states.
by Ernesto Rodriguez Reina 25 Nov '15

25 Nov '15

Hi everyone, The event processing order of a normal (non-orthogonal) state is first the innermost and if not handled (or forwarded) then it parent, and that behaviour is repeated upward until the event is discarded (or deferred). But when we are in the presence of orthogonal states, then the behaviour I am getting is a bit different, for example given the following statechart: <code> struct EvTest : sc::event< EvTest > {}; struct Test; struct Inner1; struct Inner2; struct Machine : sc::state_machine< Machine, Test > {}; struct Test : sc::simple_state<Test, Machine, mpl::list<Inner1, Inner2> >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Test" << std::endl; // return discard_event(); return forward_event(); } }; struct Inner1 : sc::simple_state<Inner1, Test::orthogonal< 0 > >{}; struct Inner2 : sc::simple_state<Inner2, Test::orthogonal< 1 > >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Inner2" << std::endl; return forward_event(); } }; </code> When received the event "EvTest" the output I am getting is: <output> Test Inner2 Test </output> That means that the handler in the state "Test" is called twice. If in the handler at test we discard instead of forwarding then we get that only the handler of "Test" is called. I thought that without taking into account if the children are orthogonal or not, the event will be processed first by the children (all of them in the case of orthogonal state until one discard or defer the event), and event is not discarded (or deferred) then the parent process the event. It is that OK? If so why I am getting that weird behaviour in my example? Any thoughts and comments are more than welcome. Best, Ernesto Rodriguez Reina

1 0

boostboost::filesystem::detail::copy_file undefined when using c++14
by ken 25 Nov '15

25 Nov '15

Hello I am building an application that uses boost libraries that I also complied. This is on a mac os x 10.9 system using gnu gcc 5.2 installed with mac ports. I built the boost 1.59.0 libraries as instructed and built the application without any problems (after a few tries). Then I changed the c++ language standard for the build of the application to -std=gnu++14 (the default is gnu++11). However, I now get the following error during the linking phase: g++ -std=gnu++14 -U_WIN32 -Dunix -DNDEBUG -O3 -DTIXML_USE_STL -DBOOST_FILESYSTEM_VERSION=3 -fmessage-length=0 -I[...] -lboost_date_time-mt -lboost_filesystem-mt -lboost_regex-mt -lboost_system-mt -lboost_locale-mt -lboost_thread-mt -lboost_chrono-mt [...] Undefined symbols for architecture x86_64: "boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::copy_option, boost::system::error_code*)", referenced from: [...] ... ld: symbol(s) not found for architecture x86_64 collect2: error: ld returned 1 exit status [...] I rebuilt the boost libraries with the -std=gnu++14 option and verified that they are using the same std library, but I still got the same error when linking those libraries to my application. I removed the c++14 option from the application build and the error went away. So next I took a look at the functions in libboost_filesystem-mt.a and for lib/libboost_filesystem-mt.a(operations.o) I found this function: 0000000000007720 T __ZN5boost10filesystem6detail9copy_fileERKNS0_4pathES4_NS1_11copy_optionEPNS_6system10error_codeE or boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::detail::copy_option, boost::system::error_code*) I see that this differs from what the linker is looking for in that copy_option (third parameter) is in the detail name space. Any ideas on where to go from here? Thanks

1 0

Iterating "root" vertices with boost::graph
by Isaac Lascasas 25 Nov '15

25 Nov '15

Hello I want to enumerate all vertices with zero input edge count in a graph, I am using DFS right now: struct vertex_visitor : public boost::default_dfs_visitor { std::vector<vertex_t> Output; void discover_vertex(vertex_t v, graph_t const& g) { graph_t::in_edge_iterator edgeIt, edgeEnd; tie(edgeIt, edgeEnd) = boost::in_edges(v, g); if (edgeIt==edgeEnd) Output.push_back(v); } }; vertex_visitor vis; boost::depth_first_search(g, boost::visitor(v)); However I don't know how to cleanly stop execution after depth 0 inside my visitor and I can't figure out a better way to archieve this. Since I am fairly new to boost graph I supose that I'm missing something. Thanks.

2 1

Extend boost binary serialization with varints encoding
by Ernest Zaslavsky 24 Nov '15

24 Nov '15

Is it feasible to provide boost binary serialization with varint encoding capabilities? How does one achieve that? Can one just create template overload of "save" and "load" for unsigned integrals? anything else should be changed? [Read More]<http://feeds.feedburner.com/~r/sizmek-blog/~6/1> [http://www.sizmek.com/Sizmek.png]<http://www.sizmek.com/>

3 8

[type_erasure] BOOST_TYPE_ERASURE_MEMBER within namespace?
by Nat Goodspeed 23 Nov '15

23 Nov '15

I find that using BOOST_TYPE_ERASURE_MEMBER within my own namespace fails with compilation errors: myprog.cpp:23:1: error: no template named 'concept_interface'; did you mean '::boost::type_erasure::concept_interface'? This is with Boost 1.57, compiled with Apple clang from Xcode 7.1.1. Moving BOOST_TYPE_ERASURE_MEMBER to the global namespace allows successful compilation. I would rather avoid putting my has_member names into the global namespace. How to achieve that?

2 1

Consistency when removing items from boost multi-index using an inner iterator
by Hovnatan Karapetyan 23 Nov '15

23 Nov '15

Hi, I already posted this same question on StackOverflow, since I have not gotten an answer yet reposting it here too. Suppose I am iterating over a boost::multi_index using one of the two indices. Then if I start iterating using the other index and erasing an element according some criteria, does that invalidate the upper iterator? E.g., struct person { string name; string last_name; string age;} typedef multi_index< person, index_by< ordered_non_unique<person, string, &person::name>, ordered_non_unique<person, string, &person::age> >> PersonCollection; PersonCollection pc; //insert some elements into pc auto index0 = pc.get<0>();auto range0 = index0.equal_range("John");while (range0.first != range0.second) { auto index1 = pc.get<1>(); auto range1 = index1.equal_range(34); while (range1.first != range1.second) { if (range1.first->last_name == "Smith") range1.first = index1.erase(range1.first); else ++range1.first; } ++range0.first;} So in this case, is the range0 iterator always valid? Thanks! Hovnatan

2 2

[BGL]Using a function for weightmap to dijkstra_shortest_path
by Amit Prakash Ambasta 23 Nov '15

23 Nov '15

Hi, I am trying to write use BGL.dijkstra to calculate a shortest path in a time dependent network where edge.cost C(u, v) is a function of distance(a)edge.source and a variable wait time dependent on Edge.departure i.e. Cost(Edge(u,v), D(u)) = Wait(Edge(u, v).departure, D(u)) + Edge(u, v).delay The cost function ( and edge property is defined as): struct Eonnection { Eonnection(const Vertex source, const Vertex destination, const double departure, const double duration, const double cost) { this->source = source; this->destination = destination; this->departure = departure; this->duration = duration; this->cost = cost; }; Vertex source; Vertex destination; double departure; // Time of departure double duration; // Duration of traversing edge double cost; // Actual cost of traversing Edge std::pair<double, double> dyn_cost(std::vector<std::pair<double, double> > distances, double t_max) { std::pair<double, double> d_parent = distances[this->source]; double t_parent = d_parent.first; double c_parent = d_parent.second; double t_time_of_day = fmod(t_parent, 24 * 3600); double t_delay = t_time_of_day <= this->departure ? this->departure - t_time_of_day: this->departure + (24 * 3600 - t_time_of_day); double t_total = t_parent + t_delay + this->duration; if(t_total < t_max) { std::cout << "Edge usable with cost " << c_parent + this->cost << ", " << t_total << std::endl; return std::pair<double, double>(c_parent + this->cost, t_total); } else { std::cout << "Edge unusable" << std::endl; return std::pair<double, double>(std::numeric_limits<double>::infinity(), std::numeric_limits<double>::infinity()); } }; }; I'm trying to call dijkstra as dijkstra_shortest_paths_no_color_map( g, source, boost::make_iterator_property_map(pred.begin(), get(boost::vertex_index, g)), boost::make_iterator_property_map(distances.begin(), get(boost::vertex_index, g)), boost::make_transform_value_property_map( boost::bind<std::pair<double, double> >(&Eonnection::dyn_cost, _1, _2, distances, 24 * 3600 * 3), get(boost::edge_bundle, g) ), get(vertex_index, g), smaller, combiner, std::pair<double, double>(std::numeric_limits<double>::infinity(), std::numeric_limits<double>::infinity()), std::pair<double, double>(0, 0), vis ); However, this does not seem to work. How can I pass the weights as a dynamic function to dijkstra_shortest_paths?

1 0

Levelization of DAG in Boost graph -- trying again
by bhattach 20 Nov '15

20 Nov '15

Not sure why my previous attempt to post a new topic didn't succeed -- page kept showing a note that the post was not accepted by the mailing list. Trying one more time. ------------------------ Although I've been using graphs for 30+ years, I'm new to Boost Graph Library. I'd like to do "classical levelization" of a DAG -- as is commonly used in applications like digital logic simulation, etc -- whereby level(v) = max_level(set of predecessors of v) + 1 I used record_distances() with breadth_first_search() and suitably defined property map, but I suspect that's returning level(v) = min_level(set of predecessors of v) + 1 Is there a simple way to use breadth_first_search() to get the level numbers I want, or do I need to write my own levelization routine? Thanks in advance for comments/suggestions/pointers. Debashis Bhattacharya -- View this message in context: http://boost.2283326.n4.nabble.com/Levelization-of-DAG-in-Boost-graph-tryin… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

Asymmetry between function_input_iterator and function_output_iterator
by Daniel Hofmann 20 Nov '15

20 Nov '15

I experienced some issues and asymmetric behavior in the function input and output iterator interfaces [1] [2]. See the following small self-contained example: const auto two = make_function_input_iterator([]{ return 2; }, infinite{}); copy_n(two, 3, ostream_iterator<int>(cout, "\n")); This does not compile --- but it should, in my opinion. The problem is that make_function_input_iterator has two overloads, one that takes a Function& and one that takes a Function*. Shouldn't this rather take a Function by-values as the stdlib does, and let the user pass a std::ref if needs be? Then we could also pass lambdas, making this a viable feature in C++11 and later. Without being able to pass lambdas, I see almost no value in the input iterator. On a related note, the documentation does not say that the make_function_iterator always needs an Input state. In addition, the link to the function input iterator PDF on the overview page [3] 404s. Now to the function output iterator: const auto dummy_out = make_function_output_iterator([](int) {}); copy_n(nums, 3, dummy_out); Surprisingly this compiles since make_function_output_iterator takes its functor by const-ref (with a defaulted functor argument, which does not really make sense in my opinion, since the reason for the make_* function is type inference through the passed parameter). Note, though, how the function output iterator lives in the same iterators namespace as the functio input iterator, but is not inside the iterator directory. The respective headers are located at: boost/function_output_iterator.hpp boost/iterator/function_input_iterator.hpp I would love to understand the design decisions behind these, and if it would be possible to "modernize" them without breaking much of the interfaces. Cheers, Daniel J H [1] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/function_input_itera… [2] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/function_output_iter… [3] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/index.html

1 0

boost interprocess named_mutex: race condition at creation?
by Liwei Peng 20 Nov '15

20 Nov '15

Hi, I am using named_mutex for synchronization among multiple processes. If all of the processes try to open_or_create the same-name named_mutex: named_mutex mutex(open_or_create, "somename"); 1) Is there any race condition for mutex creation? Or the API will guarantee one will create and all others will open? 2) If there is race condition, what are the work-arounds for this on Linux? Thanks, Liwei

2 1

A few ICL questions.
by Stephen Hewitt 19 Nov '15

19 Nov '15

I'm new to ICL and have a few questions and a problem. Here is my test code which demonstrated (Windows, MSVC 2012): > // "icl_question.cpp" > > >> #include "precomp.hpp" > > #include <iostream> > > #include <utility> > > #include <functional> > > #include <boost/cstdint.hpp> > > #include <boost/icl/closed_interval.hpp> > > #include <boost/icl/interval_map.hpp> > > >> typedef boost::icl::closed_interval<boost::uint16_t> interval_t; > > >> // Based on the in "boost/icl/functors.hpp". > > template <typename Type> struct inplace_assign > > : public boost::icl::identity_based_inplace_combine<Type> > > { > > typedef inplace_assign<Type> type; > > >> void operator()(Type& object, const Type& operand) const > > { > > object = operand; > > } > > }; > > >> // Why is the 7 template parameter not a template template parameter? > > // The code in "boost/icl/detail/design_config.hpp" does not define the > > // ICL_USE_INTERVAL_TEMPLATE_TYPE macro (I assume intentionally) which, if > > // defined, would make it so. > > typedef boost::icl::interval_map > > < > > boost::uint16_t, > > const char*, > > boost::icl::partial_absorber, > > std::less, > > inplace_assign, > > boost::icl::inter_section, > > interval_t > > > map_t; > > >> int main(int argc, char *argv[]) > > { > > using namespace std; > > >> map_t mem; > > // The commented line two down is what I intend, but it asserts at >> runtime. > > // This one works. > > mem += make_pair(interval_t(0, 0xfffe), "RAM"); > > //mem += make_pair(interval_t(0, 0xffff), "RAM"); > > mem += make_pair(interval_t(0xa000, 0xbfff), "Basic ROM"); > > >> cout << hex << mem << endl; > > >> return 0; > > } > > The first question is about the aggregate on collision functionality. I would just like to replace. I have implemented *inplace_assign *which does this but it seems strange that this isn't included. Am I missing something here (I fear I may well be)? The second question is why* interval_map*'s 7th template parameter ( *Interval*) is not a template template parameter. The code in "boost/icl/detail/design_config.hpp" does not define the *ICL_USE_INTERVAL_TEMPLATE_TYPE *macro (I assume intentionally) which, if defined, would make it so. The third question is about a runtime error I'm getting in the above code. The comment in *main *shows the scenario. Basically if I use *0xffff *as the end of the first range I get an ASSERT at runtime whereas 0xfffe works fine. Finally, the documentation seems a little sparse on the function of the *Section* template parameter. Any clarification on that would be appreciated.

2 2

[ICL] seems not to handle sets that contain the maximum element of the domain type.
by Stephen Hewitt 18 Nov '15

18 Nov '15

ICL seems not to handle sets that contain the maximum element of the domain type. I sent a similar mail a day ago, but I've simplified my example. Here's the code: Windows 7 Boost 1.59.0 ----BEGIN CODE--- using namespace std; typedef boost::icl::closed_interval<boost::uint16_t, std::less> interval_t; typedef boost::icl::split_interval_set<boost::uint16_t, std::less, interval_t> set_t; set_t s; s += interval_t(0x0000, 0xffff); s += interval_t(0xa000, 0xbfff); cout << "BAD: " << hex << s << endl; s.clear(); s += interval_t(0x0000, 0xfffe); s += interval_t(0xa000, 0xbfff); cout << "GOOD: " << hex << s << endl; ----END CODE--- ---BEGIN OUTPUT--- BAD: {[0,9fff][a000,ffff]} GOOD: {[0,9fff][a000,bfff][c000,fffe]} ---END OUTPUT--- The bad example seems to fail because the set contains 0xffff. In the good example I use 0xfffe.

2 1

libboost_system-vc110-XXXX_54.lib: Why can't I use the static boost library?
by Andreas Kopeinig 17 Nov '15

17 Nov '15

Hello everybody, I try to use the boost libraries libboost_filesystem.lib and libboost_system.lib, both version 54, in a project about image processing using the Xbox kinect sensor. I want to use the prebuild windows binaries from the following link: http://sourceforge.net/projects/boost/files/boost-binaries/ I referenced the static libs correctly in visual studio in the project properties under "Linker->General->Additional Library Directories" and "Linker->Input->Additional Dependencies" and I also set the path to the headers under "C/C++ -> General-> Additional Include Directories". But when I want to build my code, I get the following linker error: " LNK1181: cannot open file 'libboost_system.obj' ". Why is this happening? Is this object file missing in the archive? If yes, why? In particular I want to use libboost_filesystem-vc110-mt-1_54.lib, libboost_filesystem-vc110-mt-gd-1_54.lib, libboost_system-vc110-mt-1_54.lib and libboost_system-vc110-mt-gd-1.lib Thank you very much, Andy

4 4

help using async_wait
by Lane 17 Nov '15

17 Nov '15

I'm trying to have a file automatically close when a deadline_timer is expired. Seeing that a file is no longer open, another file will get created and a timer started. But I'm having some issues understanding deadline_timer. I believe the io.run() in start_timer blocks (thinking that async_wait shouldn't block), so I tried to put it on it's own thread so that my main would continue to loop and write to the file while a timer is running in the background which would eventually close the file. Anyone see where I'm going wrong? --- void MyFileTimer::start_timer() { ba::deadline_timer timer(io, boost::posix_time::seconds(10)); timer.async_wait(boost::bind(&MyFileTimer::timer_expired, this, _1)); t_thread = unique_ptr<boost::thread>( new boost::thread(boost::bind(&ba::io_service::run, &io))); io.run(); } void MyFileTimer::timer_expired(const boost::system::error_code& e) { // Closing file my_file.flush(); my_file.close(); io.reset(); t_thread->join(); } bool MyFileTimer::create_file() { // ... string filename = my_unique_file_name; my_file.open(filename, ios::out); start_timer(); return true; } --- snip of main --- while (true) { if (!my_file.is_open()) { create_file(); } my_file->write(str); }

2 1

[Algorithm] Boyer-Moore Search - Does it use The Galil Rule?
by Vidya Wasi 14 Nov '15

14 Nov '15

Hi, I've been fiddling with search algorithms and am now relearning Boyer-Moore. From the documentation I cannot tell if the algorithm is using The Galil Rule. Since I'm still inexperienced in understanding the algorithm I'm wondering if the boost implementation do use The Galil Rule? Regards, Boost casual user

1 0

Boost 1.60.0 beta 1 Release Candidate 3 available for testing
by Marshall Clow 14 Nov '15

14 Nov '15

Release candidate files for 1.60.0 beta 3 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. Changes since rc1: * Boost.Sprit has been updated and Boost.Log now builds. * Boost.Math has been updated and now builds. [ Note: The RC2 files that I posted yesterday were incorrectly produced. RC3 is identical to what RC2 should have been -- end note ] Known issues: * Errors when building libraries for visual studio: test and type_erasure. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc3.7z) = cfac18348700d0e6c1a0e4418a57e9aa MD5 (boost_1_60_0_b1_rc3.tar.bz2) = d3cb5a59e5b38555096814a6bfbcb441 MD5 (boost_1_60_0_b1_rc3.tar.gz) = db9b011547b8933454d0dfe31f7b8551 MD5 (boost_1_60_0_b1_rc3.zip) = 216c7cd0c15c096ece24d2649a272b51 Thanks! -- The release managers

2 3

linker errors in vs2012 and boost 1.59...
by TUELLER, SHAYNE R CIV USAF AFMC 519 SMXS/MXDEC 12 Nov '15

12 Nov '15

All, I'm trying to compile my application which uses boost 1.59 prebuilt binaries for vs2012. Things compile and link just fine in debug mode but I'm having the following linker errors when I try to build in release mode... GRTXserver.obj : error LNK2001: unresolved external symbol "public: void __cdecl boost::container::container_detail::has_member_function_named_construct<clas s 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@@QEAAXXZ) 1>GRTXserver.obj : error LNK2001: unresolved external symbol "public: void __cdecl boost::container::container_detail::has_member_function_named_construct<clas s 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_allo cator@D@container@boost@@@container@boost@@Uref_count_ptr@ipcdetail@interpro cess@3@@std@@PEAX$0A@$00@container_detail@container@boost@@@container@boost@ @@container_detail@container@boost@@QEAAXXZ) 1>C:\GRTXserver\x64\Release\GRTXserver.exe : fatal error LNK1120: 2 unresolved externals I've tried everything but I just can't get it to work. Any ideas or is anyone else having this problem? Thanks, -Shayne

1 0

Boost 1.60.0 beta 1 Release Candidates available for testing
by Marshall Clow 11 Nov '15

11 Nov '15

Release candidate files for 1.60.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. IMPORTANT NOTE: The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc1.7z) = ac6b2128d951ad688421fde2d878c2a7 MD5 (boost_1_60_0_b1_rc1.tar.bz2) = 2fc232f255f1ce8868315da207c05b6b MD5 (boost_1_60_0_b1_rc1.tar.gz) = d594e10f2761abaf957a67c6a223d2a4 MD5 (boost_1_60_0_b1_rc1.zip) = 16a2d512fca7995d5fa421d13f841b0f Thanks! -- The release managers

6 15

[coroutines2] Building coroutines2 examples
by Adi Shavit 10 Nov '15

10 Nov '15

Hi, I'm trying to build the Boost 1.59 coroutine and coroutine2 examples. I built boost with b2 (complete build) and am using CMake to generate a VC2015 project to build the samples. All the coroutine samples build and run just fine, but I get *linking* errors with the coroutine2 samples. My CMakeLists.txt file is straightforward, just find boost, include the headers and link to the boost libs: project (coroutines-samples) cmake_minimum_required(VERSION 2.8) find_package(Boost REQUIRED) include_directories(${Boost_INCLUDE_DIR}) link_directories(${Boost_LIBRARY_DIRS}) add_executable(chaining.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/chaining.cpp) add_executable(echo.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/echo.cpp) add_executable(exception.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/exception.cpp) add_executable(fibonacci.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/fibonacci.cpp) add_executable(layout.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/layout.cpp) add_executable(parallel.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/parallel.cpp) add_executable(power.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/power.cpp) add_executable(same_fringe.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/same_fringe.cpp) add_executable(segmented_stack.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/segmented_stack.cpp) add_executable(simple.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/simple.cpp) add_executable(unwind.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/unwind.cpp) add_executable(dice_game.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/dice_game.cpp) add_executable(merge_arrays.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/merge_arrays.cpp) add_executable(segmented_stack1.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/segmented_stack.cpp) add_executable(simple1.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/simple.cpp) add_executable(unwind1.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/unwind.cpp) add_executable(await_emu.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/await_emu.cpp) add_executable(fibonacci11.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/fibonacci.cpp) add_executable(iterator_range.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/iterator_range.cpp) add_executable(layout11.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/layout.cpp) add_executable(same_fringe11.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/same_fringe.cpp) add_executable(merge_arrays1.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/merge_arrays.cpp) add_executable(simple2.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/simple.cpp) # coroutines2 add_executable(coro2_fibonacci /some/path/boost_1_59_0/libs/coroutine2/example/fibonacci.cpp) add_executable(coro2_layout /some/path/boost_1_59_0/libs/coroutine2/example/layout.cpp) add_executable(coro2_parser /some/path/boost_1_59_0/libs/coroutine2/example/parser.cpp) add_executable(coro2_same_fringe /some/path/boost_1_59_0/libs/coroutine2/example/same_fringe.cpp) add_executable(coro2_segmented /some/path/boost_1_59_0/libs/coroutine2/example/segmented.cpp) add_executable(coro2_simple /some/path/boost_1_59_0/libs/coroutine2/example/simple.cpp) target_link_libraries(chaining.cpp ${Boost_LIBRARIES}) target_link_libraries(echo.cpp ${Boost_LIBRARIES}) target_link_libraries(exception.cpp ${Boost_LIBRARIES}) target_link_libraries(fibonacci.cpp ${Boost_LIBRARIES}) target_link_libraries(layout.cpp ${Boost_LIBRARIES}) target_link_libraries(parallel.cpp ${Boost_LIBRARIES}) target_link_libraries(power.cpp ${Boost_LIBRARIES}) target_link_libraries(same_fringe.cpp ${Boost_LIBRARIES}) target_link_libraries(segmented_stack.cpp ${Boost_LIBRARIES}) target_link_libraries(simple.cpp ${Boost_LIBRARIES}) target_link_libraries(unwind.cpp ${Boost_LIBRARIES}) target_link_libraries(dice_game.cpp ${Boost_LIBRARIES}) target_link_libraries(merge_arrays.cpp ${Boost_LIBRARIES}) target_link_libraries(segmented_stack1.cpp ${Boost_LIBRARIES}) target_link_libraries(simple1.cpp ${Boost_LIBRARIES}) target_link_libraries(unwind1.cpp ${Boost_LIBRARIES}) target_link_libraries(await_emu.cpp ${Boost_LIBRARIES}) target_link_libraries(fibonacci11.cpp ${Boost_LIBRARIES}) target_link_libraries(iterator_range.cpp ${Boost_LIBRARIES}) target_link_libraries(layout11.cpp ${Boost_LIBRARIES}) target_link_libraries(same_fringe11.cpp ${Boost_LIBRARIES}) target_link_libraries(merge_arrays1.cpp ${Boost_LIBRARIES}) target_link_libraries(simple2.cpp ${Boost_LIBRARIES}) target_link_libraries(coro2_fibonacci ${Boost_LIBRARIES}) target_link_libraries(coro2_layout ${Boost_LIBRARIES}) target_link_libraries(coro2_parser ${Boost_LIBRARIES}) target_link_libraries(coro2_same_fringe ${Boost_LIBRARIES}) target_link_libraries(coro2_segmented ${Boost_LIBRARIES}) target_link_libraries(coro2_simple ${Boost_LIBRARIES}) The linked does not seem to be able to find boost::system::system_category. This is my error log: 11>------ Build started: Project: coro2_fibonacci, Configuration: Debug x64 ------ 2>------ Build started: Project: coro2_layout, Configuration: Debug x64 ------ 3>------ Build started: Project: coro2_parser, Configuration: Debug x64 ------ 4>------ Build started: Project: coro2_same_fringe, Configuration: Debug x64 ------ 5>------ Build started: Project: coro2_segmented, Configuration: Debug x64 ------ 6>------ Build started: Project: coro2_simple, Configuration: Debug x64 ------ 1>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 1>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_fibonacci.exe : fatal error LNK1120: 1 unresolved externals 4>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 4>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_same_fringe.exe : fatal error LNK1120: 1 unresolved externals 6>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 2>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 3>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 5>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 6>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_simple.exe : fatal error LNK1120: 1 unresolved externals 2>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_layout.exe : fatal error LNK1120: 1 unresolved externals 3>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_parser.exe : fatal error LNK1120: 1 unresolved externals 5>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_segmented.exe : fatal error LNK1120: 1 unresolved externals 7>------ Skipped Build: Project: ALL_BUILD, Configuration: Debug x64 ------ 7>Project not selected to build for this solution configuration ========== Build: 0 succeeded, 6 failed, 25 up-to-date, 1 skipped ========== What am I doing wrong? Thanks, Adi

1 0

Using boost on AIX with GCC
by Chris Franz 10 Nov '15

10 Nov '15

I'm trying to get started using boost on AIX with GCC. What I seem to be running into is that GCC has a "feature" on AIX such that system headers are wrappered with an implicit 'extern "C"'. I'm not finding a good way to include the boost headers because of this feature. As an example, using about the simplest boost header I could find: $ echo "#include <boost/function_equal.hpp>" > fe.cpp $ g++ fe.cpp -c -isystem/usr/local/include/boost-1_59 In file included from fe.cpp:1:0: /usr/local/include/boost-1_59/boost/function_equal.hpp:15:1: error: template with C linkage template<typename F, typename G> ^ /usr/local/include/boost-1_59/boost/function_equal.hpp:22:1: error: template with C linkage template<typename F, typename G> ^ $ One obvious possibility is to use -I instead of -isystem, but not treating boost headers as system headers results in a multitude of warnings using the verbosity we like to use (I've even run into some boost headers that emit errors if -pedantic-errors is specified). Do I need a different version of gcc and/or boost? How do other people configure this?

2 1

Newbie not able to compile mini_c example
by Dezai G 09 Nov '15

09 Nov '15

Hi boost usersIm newbye in using boost spirit.I have recenly downloaded boost 1.59 library. Im tryng than to compile the mini_c example both on windows with visual studio 2008 and on linux with gcc 4.4.6Im walking throught plenty of errors and didnt found in the documentation what is going wrong.I ve tryed several things throuh search in google but nothing seems to walk An example of error is for linux/gcc : boost_1_59_0/boost/utility/result_of.hpp:190: error: wrong number of template arguments (1, should be 3) Are my compilers incompatible with boost 1.59. In this case what should i use And what are the correct version of library should i use to be fully compliant with visual studio 2à08 or gcc 4.4.6 Best regardsDZ

1 0

[BGL] Connected components of a distributed graph with few edges
by Quaglino Alessio 06 Nov '15

06 Nov '15

Hello, I am trying to compute the number of connected components of a graph with only few edges (i.e. many vertices do not have edges). This works OK for a non-distributed graph. The simplest example of the issue I could come up with is the following: typedef adjacency_list <vecS, vecS, undirectedS> SerialGraph; typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; typedef iterator_property_map<std::vector<int>::iterator, property_map<Graph, vertex_index_t>::type> LocalMap; #ifdef PARALLEL_GRAPH Graph G(nV+1); synchronize(G); std::vector<int> localComponent(nV+1); LocalMap components(localComponent.begin(),get(vertex_index, G)); num = connected_components_ps(G, components); #else SerialGraph G(nV+1); std::vector<int> globalComponent(nV+1); num = connected_components(G, &globalComponent[0]); #endif The distributed version causes a seg fault when calling connected_components_ps, while the non-distributed works fine and correctly finds nV+1 components. If I populate the graph connecting all vertices with edges, both do work fine. What am I doing wrong? Thank you in advance. Regards, Alessio

2 8