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

[Boost.Polygon] Bug in polygon_set_data, or are my expectations wrong?
by Patrick J. LoPresti 09 Oct '14

09 Oct '14

I have just submitted a bug report: https://svn.boost.org/trac/boost/ticket/10642 ...but I am wondering if the bug is in my understanding rather than in Boost.Polygon. The test case is very simple, so I am appending it to this message. My question is, should I expect polygon_set_data<int> to scramble such a simple figure? It almost looks like some (but not all) of the coordinates are being snapped to multiples of 2. Or something. Note that doubling all of the coordinates avoids the bug. Assuming it is a bug (?) Thanks! - Pat #include <boost/polygon/polygon.hpp> #include <iostream> #include <cstdlib> namespace bp = boost::polygon; using namespace bp::operators; typedef bp::polygon_set_data<int> PolygonSet; typedef bp::polygon_data<PolygonSet::coordinate_type> Polygon; typedef bp::polygon_traits<Polygon>::point_type Point; int main(int argc, char *argv[]) { // Small figure with a little hole. Area should be 32. const Point points[] = { Point(0,0), Point(6,0), Point(6,4), Point(4,6), Point(0,6), Point(0,0), Point(4,4), Point(5,4) }; Polygon poly1(&points[0], &points[sizeof(points)/sizeof(points[0])]); PolygonSet ps1; ps1 += poly1; std::cout << "poly1 area == " << area(poly1) << "\n"; // Boost.Polygon says the area of ps1 is 30. That is because its internal // representation is wrong, as you can confirm by manually // examining the result of ps1.get() or ps1.get_trapezoids(). std::cout << "ps1 area == " << area(ps1) << "\n"; // Doubling the coordinates avoids the bug. Polygon poly2(poly1); scale_up(poly2, 2); PolygonSet ps2; ps2 += poly2; std::cout << "poly2 area == " << area(poly2) << "\n"; std::cout << "ps2 area == " << area(ps2) << "\n"; assert(area(poly2) == area(ps2)); assert(area(poly1) == area(ps1)); }

1 0

[polygon] Incorrect output from get_trapezoids(..., HORIZONTAL)
by Patrick J. LoPresti 08 Oct '14

08 Oct '14

I apologize for sending this to the mailing list, but when I tried to file a bug report via Trac, it said "Trac thinks your submission might be Spam. To prove otherwise please provide a response to the following"... And then there was no "following". Please let me know if there is a better forum to report this sort of issue. I am using Boost 1.56. The following program uses boost::polygon to slice up a figure (with a "hole" cut out of it) into horizontal trapezoids. The output I get is: Output: polygon (4 3) (4 0) (0 0) (0 3) (4 3) ...which is clearly wrong. I am pretty sure my code is correct, because if I replace bg::HORIZONTAL with bg::VERTICAL, I get the correct output of a bunch of vertical trapezoids. For my application, I really want horizontal traps. I suppose I can just swap x and y on input and output... But this seemed worth reporting. Thanks. - Pat #include <boost/polygon/polygon.hpp> #include <iostream> namespace bp = boost::polygon; typedef bp::polygon_set_data<int> PolygonSet; typedef bp::polygon_data<PolygonSet::coordinate_type> Polygon; typedef bp::polygon_traits<Polygon>::point_type Point; std::ostream & operator<<(std::ostream &os, const Point &pt) { return os << "(" << bp::x(pt) << " " << bp::y(pt) << ")"; } std::ostream & operator<<(std::ostream &os, const Polygon &poly) { os << "polygon "; for (Polygon::iterator_type p = poly.begin() ; p != poly.end() ; ++p) os << " " << *p; return os; } std::ostream & operator<<(std::ostream &os, const PolygonSet &ps) { std::vector<Polygon> temp; ps.get(temp); os << "polygonset "; for (std::vector<Polygon>::const_iterator p = temp.begin() ; p != temp.end() ; ++p) os << " " << *p; return os; } int main(int argc, char *argv[]) { const Point points[] = { Point(2,0), Point(4,0), Point(4,3), Point(0,3), Point(0,0), Point(2,0), Point(2,1), Point(1,1), Point(1,2), Point(3,2), Point(3,1), Point(2,1) }; Polygon poly; bp::set_points(poly, &points[0], &points[sizeof(points)/sizeof(points[0])]); std::cout << "Input: " << poly << "\n"; PolygonSet ps; ps.insert(poly); std::cout << "ps = " << ps << "\n"; std::vector<Polygon> traps; // Note: bp::VERTICAL works fine bp::get_trapezoids(traps, ps, bp::HORIZONTAL); std::cout << "Output:\n"; for (std::vector<Polygon>::const_iterator p = traps.begin() ; p != traps.end() ; ++p) std::cout << *p << "\n"; }

2 2

program_options: Make PO not eat argc
by Florian Lindner 08 Oct '14

08 Oct '14

Hello, I have a couple of libraries (MPI, petsc) that also consume my applications argc and argv, which is parsed with boost::program_options before. po seems to eat up argv, i.e. removes all items that it handles. Can I disable that behavior somehow so that po does not touch argc/argv. Or do I need to recreate it, e.g. using collect_unrecognized? Thanks, Florian

2 2

program_options: How to best model two/three pos args
by Florian Lindner 08 Oct '14

08 Oct '14

Hello, my application has positional arguments like that: Run tests : ./app test ConfigurationName PathToSrc Run server : ./app server ParticipantName ConfigurationName Print XML reference: ./app xml Linewidth It has three (if first in [test, server]) or two (if first in [xml]) positional arguments. How to model and test this best using boost? I could add three options and declare them as positional arguments, named like "first", "second", "third". I could also use just one positional argument like: po::positional_options_description pos_dec; pos_dec.add("positionals", 3); and test the resulting vector. What do you think? Thanks, Florian

2 1

MSM to diagram
by Robert Bielik 08 Oct '14

08 Oct '14

Hi all, I want to use MSM in an application, however, for design documentation purposes I'd like to be able to express the state machine in a diagram. And preferably going the route from C++ code -> graphical diagram (i.e. not from UML -> C++ code). Has anyone looked at that, or know of resources on how to accomplish this ? TIA /Robert

1 0

[general] Advice from Bjarne Stroustrup
by legalize+jeeves＠mail.xmission.com 06 Oct '14

06 Oct '14

[Please do not mail me a copy of your followup] At the end of each chapter in "The C++ Programming Language", 4th edition, Bjarne Stroustrup has a list of advice. I found the advice very helpful and decided that the advice should be online somewhere. Initially I put this together as a PPT presentation, but oh my lord, it was too long. Instead, I made a page in my user space on the cppreference.com wiki: <http://en.cppreference.com/w/User:Legalize/Advice_from_Bjarne_Stroustrup> This let me link to other pages on the wiki describing specific language features where possible. Hopefully you will find it useful. -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

2 1

NT² eand Boost.SIMD release 3.1
by Joel FALCOU 06 Oct '14

06 Oct '14

NT2 is a Matlab inspired, high-level API for scientific computation in C++. Boost.SIMD is a candidate library for inclusion in Boost dealing with the portable encpsulation of SIMD instructions sets. This following releases updates NT2 and Boost.SIMD libraries to version 3.1 This new release of NT2 and Boost.SIMD focused on fixing performance issues and add some new support for architecture and parallel algorithms. The main new features include: - Linear Algebra functions can now use GPGPU through the MAGMA library whenever possible. - Reduction and Scan operations now works with more shared memory back-end - Altivec support is now complete for the VMX ISA We wish to thanks Ian Masliah for his work on MAGMA, Antoine Tran Tan for the shared memory support and Pierre Esterie participation to the Altivec ISA completion. Special thanks to Tim Blenchmann and khegeman for their help and patch submisisons throughout this development. The release Changelog is here : https://github.com/MetaScale/nt2/releases/tag/3.1.0 The files can be download from : http://nt2.metascale.org/downloads/ The Documentation (in progress) is here : http://nt2.metascale.org/doc/html/index.html **Next release announcment** This release is the last C++03 compliant version of both NT2 and Boost.SIMD. The next release - 4.0 - will be C++11 only. The new minimal version of supported compilers will be : - g++ 4.6 - Microsoft Visual Studio 12 (2013) - clang 3.4 - icc 12.1 The main reason for this change is to be able to properly fix the compile-time issue that one may experience. It'll also allow us to use some C++11 feature to simplify or streamline some of the user interface. * The NT2 Team

1 0

[bimap] Look ups on the vector_of collection type
by Arindam Mukherjee 05 Oct '14

05 Oct '14

Would it make sense to define a bimap like this: boost::bimap< boost::bimaps::set_of<std::string>, boost::bimaps::vector_of<std::string>> mymap; And then make the right view (vector_of) more amenable to lookups by performing a sort followed by a binary search on it? Thanks.

1 0

Flat multi set operation costs
by Paolo Bolzoni 03 Oct '14

03 Oct '14

Dear list, In a project of mine I am using a sorted vector as a multimap. The point was that insert, delete and retrieval operations arrived in batches (lots of inserts, lots of retrieval, lots of deletes...) so I essentially saved time sorting the vector when a new kind of operation arrived. I recently noticed boost has the flat multiset implementation, so I was wondering do it follows the same idea? If it does I would be nice to kick-out some code and use the library for ease of maintenance. Your faithfully, Paolo

2 1

boost python wrapping class with getter/setter with const string& arg and return type
by MM 03 Oct '14

03 Oct '14

Hi class C { public: const std::string& get_name() const; void set_name(const std::string&); private: std::string name_; }; given this class C, how would I expose it to python with the class property name? class_<C>("C"). .add_property("name", &C::get_name, &C::set_name); with the proper includes as in the tutorial, it fails to compile. MM

1 0

[Test] Global Fixtures
by Mauricio Carneiro 03 Oct '14

03 Oct '14

I am trying to use global fixtures in my tests but I may be misinterpreting the documentations. The following toy example doesn't work : #include <boost/test/unit_test.hpp> struct TruthFixture { int x = 3; int f (int a) { return a + 3; } }; BOOST_GLOBAL_FIXTURE( TruthFixture ) BOOST_AUTO_TEST_CASE(test_variable) { printf("x = %d\n", x); } BOOST_AUTO_TEST_CASE(test_function) { printf("f(2) = %d\n", f(2)); } the error message I get is the following: test/test.cpp:14:22: error: use of undeclared identifier 'x'; did you mean 'TruthFixture::x'? printf("x = %d\n", x); ^ TruthFixture::x test/test.cpp:4:7: note: 'TruthFixture::x' declared here int x = 3; ^ test/test.cpp:14:22: error: invalid use of non-static data member 'x' printf("x = %d\n", x); ^ test/test.cpp:18:25: error: use of undeclared identifier 'f'; did you mean 'TruthFixture::f'? printf("f(2) = %d\n", f(2)); ^ TruthFixture::f test/test.cpp:6:7: note: 'TruthFixture::f' declared here int f (int a) { ^ test/test.cpp:18:25: error: call to non-static member function without an object argument printf("f(2) = %d\n", f(2)); ^ 4 errors generated. clearly the BOOST_GLOBAL_FIXTURE declaration is not doing anything. But if I drop the global fixture declaration and revert to the per function declaration, it works: #include <boost/test/unit_test.hpp> struct TruthFixture { int x = 3; int f (int a) { return a + 3; } }; BOOST_FIXTURE_TEST_CASE(test_variable, TruthFixture) { printf("x = %d\n", x); } BOOST_FIXTURE_TEST_CASE(test_function, TruthFixture) { printf("f(2) = %d\n", f(2)); } then everything works perfectly as intended. Any input on what I am doing wrong with the *global* fixture declaration? Thank you! Mauricio Carneiro, Ph.D. http://www.broadinstitute.org/~carneiro/

2 1

[Boost] [DateTime] dividing a time_period in N time_periods
by Pablo Madoery 02 Oct '14

02 Oct '14

Hi, I want to make a method which divides a time_period in N time periods, something like this: list<time_period> splitTimePeriod(time_period timePeriod, int n); I actually have made it and although it seems to work it results very inefficient regarding the time it took to divide a large time_period. The method I did is this: list<time_period> splitTimePeriod(time_period timePeriod, int n) { double secsTime = dateTime::diffSeconds(timePeriod.end(), timePeriod.begin()); // tiempo en segundos de cada período de tiempo double ti = secsTime / n; list<time_period> timePeriods; // tiempo de comienzo del primer período de tiempo ptime tpBegin = timePeriod.begin(); // tiempo de fin del último período de tiempo ptime tpLastEnd = timePeriod.end(); for (int i = 0; i < n; i++) { int tUnits = ti * time_duration::ticks_per_second(); // tiempo de comienzo del siguiente período de tiempo ptime tpNextBegin = dateTime::increment(tpBegin, tUnits); // tiempo de fin del período de tiempo ptime tpEnd; if (i == n - 1) { tpEnd = tpLastEnd; } else { tpEnd = dateTime::decrement(tpNextBegin, 1); // guarda para evitar que por cuestiones // de redondeo, el tiempo final de un período // sea mayor que el pasado inicialmente // como argumento de entrada if (tpEnd > tpLastEnd) { tpEnd = tpLastEnd; } } time_period p(tpBegin, tpEnd); // se inserta período de tiempo en la lista timePeriods.push_back(p); // se actualiza el comienzo del siguiente período de tiempo tpBegin = tpNextBegin; } return timePeriods; } Other methods I use are these: double diffSeconds(const ptime &dateA, const ptime &dateB) { time_duration diff = dateA - dateB; return diff.total_seconds(); } ptime increment(const ptime &date, int n) { time_iterator it(date, dateTime::unit); for (int i = 0; i < n; i++) { ++it; } return *it; } ptime decrement(const ptime &date, int n) { time_iterator it(date, dateTime::unit); for (int i = 0; i < n; i++) { --it; } return *it; } const time_duration unit = microseconds(1); ################################################# The question is: is there a better way to accomplish this?

3 6

[mpl] struct definition and mpl sequence in one shot?
by Adam Romanek 01 Oct '14

01 Oct '14

Hi! I have a problem and I'm not sure how to approach it. Currently my code looks like this: struct Definition { typedef boost::mpl::int_<5> A; typedef boost::mpl::int_<3> B; typedef boost::mpl::int_<6> C; typedef boost::mpl::int_<1> D; typedef boost::mpl::vector<A, B, C, D> Seq; }; Here, the number N in mpl::int_< N > denotes some arbitrary decimal number. Then some other code calculates the sum of these numbers up to the type defined by "key", e.g. for Definition::D, the sum is 5 + 3 + 6 (A + B + C). This needs to be done at compile-time. That's why I use mpl::vector and some appropriate meta-programming. I'm wondering whether it would be possible to provide such struct definition without the need to repeat type names in the mpl::vector for Seq type. In other words, I'd probably need a bunch of macros which would allow me to write code like this: struct Definition { FIELD(A, 5); FIELD(B, 3); FIELD(C, 6); FIELD(D, 1); GEN_SEQ() // if needed }; And then Definition::A would still refer to boost::mpl::int_<5>, or would at least allow me to access the boost::mpl::int_<5> somehow, and Definition::Seq would give me the appropriate MPL sequence. Of couse this is just my imagination. The code might look different, I'm just looking for options. Thanks in advance. Adam Romanek

1 0

[Build] -finline-functions no longer supported in clang 3.5
by Mauricio Carneiro 01 Oct '14

01 Oct '14

Hi all, turns out clang 3.5 is no longer supporting <http://llvm.org/klaus/clang/commit/6590426aeb5275ec33dac2877f9349bbbb2d4b2e…> -finline- <http://llvm.org/klaus/clang/commit/6590426aeb5275ec33dac2877f9349bbbb2d4b2e…> functions <http://llvm.org/klaus/clang/commit/6590426aeb5275ec33dac2877f9349bbbb2d4b2e…>, which it claims never did anything anyway, so this is their way to take it out of usage. My release builds (which are done solely through boost build) automatically add this parameter to the compilation command line, and thus is now failing (since I use -Werror). Is there a way to modify the "release" variant not to use that line anymore? Also, is there a way to extend the command line parameters that the release variant will use? Thank you, Mauricio Carneiro, Ph.D. http://www.broadinstitute.org/~carneiro/

1 0

boost::log native syslog sink.
by svante karlsson 01 Oct '14

01 Oct '14

I'm using ubuntu 14.04 with the included boost 1.54 and I'm trying to set up a syslog sink. I've cut this from the samples and added "ident". void init_syslog() { boost::shared_ptr< boost::log::core > core = boost::log::core::get(); // Create a backend boost::shared_ptr< sinks::syslog_backend > backend(new sinks::syslog_backend( keywords::facility = sinks::syslog::local0, keywords::use_impl = sinks::syslog::native, keywords::ident = "mqtt-proxy" )); // Set the straightforward level translator for the "Severity" attribute of type int backend->set_severity_mapper(sinks::syslog::direct_severity_mapping< int >("Severity")); // Wrap it into the frontend and register in the core. // The backend requires synchronization in the frontend. core->add_sink(boost::make_shared< sink_t >(backend)); } The logs end up in syslog but I cant prefix those by program name (and processnumber ) - I've expected the logs to be marked as 'mqtt-proxy' I get logs like Sep 29 03:47:40 ubuntu : ad569c57-780a-431b-bde3-7ede49e7c77f, bridge create but what I would like is similar to Sep 29 03:47:40 ubuntu mqtt-proxy: ad569c57-780a-431b-bde3-7ede49e7c77f, bridge create Am I missing something or is ident not supported? /svante

1 0

[Threads] and OpenMP
by Stephan Menzel 01 Oct '14

01 Oct '14

Hi all, I would like to ask around about a strategy on how to tacke the following threading problem: I am maintaining a boost intensive portable C++ client-server application and recently have included a highly complex 3rd party algorithm into my application that does CPU intense stuff. Long running stuff. Often in the range of days. While at the same time being heavy in OpenMP usage. Now of course requirements are that the user has to be able to cancel this. The algorithm runs in a boost threads controlled background thread. Now I began to place interruption points throughout the 3rd party code but soon had to realize that a lot of CPU time is being handled in OpenMP threaded code regions. So the question is: How can I more or less gracefully shut this down? How do interruption points work in an omp parallel for loop? Do I have a chance at all? My constraints here are a bit forgiving. Given the complexity of the 3rd party code I have already accepted the notion that this is gonna be a memleak monster. Luckily, there's no disk or other hardware access so I'm ready to live with a certain amount of mem not being cleaned up. Yet the backend thread communicates with the spawning class by calling a mutexed callback when it's ready so the user knows it's cancelled. This is protected by a boost mutex as well. And juding from the horrible threading "clogs" that I observed in my first trials I suppose this is gonna be a problem as well. And input is appreciated. And yes, I am aware that this is gonna be an ugly mess. Cheers, Stephan

3 3

Re: [Boost-users] choosing source ip on multihomed computer (Bjorn Reese)
by David Frank 01 Oct '14

01 Oct '14

I did, here is my relevant code segment, but the destination still shows that I sent from another ip than what I set here: tcp::resolver resolver(fIo_service); tcp::resolver::query query(tcp::v4(), host, port); tcp::resolver::iterator iterator = resolver.resolve(query); fpSocket = new tcp::socket(fIo_service); if (fpSocket == nullptr) return ; fpSocket->open(boost::asio::ip::tcp::v4()); fpSocket->bind(boost::asio::ip::tcp::endpoint(boost::asio::ip::address::from_string("<ip>"), 0)); boost::system::error_code errcode; boost::asio::connect(*fpSocket, iterator, errcode); On Tuesday, September 30, 2014 12:00 PM, "boost-users-request(a)lists.boost.org" <boost-users-request(a)lists.boost.org> wrote: Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Re: choosing source ip on multihomed computer (Bjorn Reese) 2. Re: [Threads] and OpenMP (Bjorn Reese) ---------------------------------------------------------------------- Message: 1 Date: Tue, 30 Sep 2014 15:58:37 +0200 From: Bjorn Reese <breese(a)mail1.stofanet.dk> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] choosing source ip on multihomed computer Message-ID: <542AB70D.6060807(a)mail1.stofanet.dk> Content-Type: text/plain; charset=windows-1252; format=flowed On 09/30/2014 03:04 PM, David Frank wrote: > I'm wondering how to make boost::asio::connect(<socket>, ...) > connect from the source interface/ip address I choose on a multihomed > computer. Call bind() before connect(). ------------------------------ Message: 2 Date: Tue, 30 Sep 2014 15:59:43 +0200 From: Bjorn Reese <breese(a)mail1.stofanet.dk> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [Threads] and OpenMP Message-ID: <542AB74F.4010303(a)mail1.stofanet.dk> Content-Type: text/plain; charset=windows-1252; format=flowed On 09/30/2014 11:24 AM, Stephan Menzel wrote: > So the question is: How can I more or less gracefully shut this down? > How do interruption points work in an omp parallel for loop? Do I have a > chance at all? One approach is to execute the tasks in a separate process. The process can easily be killed, and it takes care of the memory leaks. ------------------------------ Subject: Digest Footer _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ------------------------------ End of Boost-users Digest, Vol 3932, Issue 2 ********************************************

1 0

[bimap] Mapping a set into itself
by Arindam Mukherjee 30 Sep '14

30 Sep '14

Is there a way to represent a mapping from a set to itself using boost::bimap? Regards, Arindam

1 0

choosing source ip on multihomed computer
by David Frank 30 Sep '14

30 Sep '14

Hi, I'm wondering how to make boost::asio::connect(<socket>, ...) connect from the source interface/ip address I choose on a multihomed computer. Thanks, Dave

2 1

[serialization] serialize type-erasure
by oswin krause 30 Sep '14

30 Sep '14

Hi list, i am currently trying to serialize a type-erasure, but i am not sure how this should be done exactly. Before boost 1.56 we used the polymorphic archives and a base class to implement serialization, but since they are broken in 1.56 and a few users are nagging me (plus i can't compile the library myself any more after a mandatory upgrade...), i have to get it right. my setup looks like this class ErasureBase{ .... }; template<class T> class Erasure{ public: Erasure (T& foo):m_foo(foo){} template<class Archive> void serialize(Archive & ar, const unsigned int){ ar & m_foo; } private: T& m_foo; }; class MyClass{ public: template<class T> MyClass(T& foo):m_wrapper(new Erasure<T>(foo)){} template<class Archive> void serialize(Archive & ar, const unsigned int){ ar & *m_wrapper; } private: boost::scoped_ptr<ErasureBase> m_wrapper; }; in the usage of MyClass i assume that serialisation/deserialisation is only to be called on constructed objects of type MyClass, therefore i do not need capabilities to deserialize from pointers. The question is: how do I tell the archive which Erasure<T> exist? The solutions in the tutorial pages only look at the cases where Erasure<T> is serialized directly or where it is known which classes are to be serialized (and i don't assume my users to know which Erasure<T> are instantiated...). If there exists a solution for this: is the solution also stable wrt the order of registration of classes? Best, Oswin The ques

1 1

[multi_index] Couple of questions on multi-index containers
by Aaron Levy 29 Sep '14

29 Sep '14

If I erase elements in a multi_index_container, how are iterators invalidated? 1. For other than random_access index, only iterators to the deleted element? 2. For random_access index, potentially any iterator? What are the data structures used internally for this container and its indexes. -- Aaron Levy aaron.levy(a)yandex.com

4 5

[msm] & typeerasure / any
by Raj Sambasivan 28 Sep '14

28 Sep '14

HI Boost-users/christophe, I'm trying to make use of type erasure for fsm based on suggestion from an earlier mail thread http://boost.2283326.n4.nabble.com/msm-access-to-root-fsm-td4649632.html but hitting compilation errors. Can you pls help? while the any works as expected for push back e.g for vector (bottom of email) it doesnt work for MSM.. *Doesn't Work for MSM:* BOOST_TYPE_ERASURE_MEMBER((has_process_event), process_event, 1) typedef any<has_process_event<HandledEnum(Event1 const &)>, _self&> any_fsm; struct AnyFSM { AnyFSM(any_fsm afsm_) : _afsm(afsm_) {} void process(Event1& e) { _afsm.process_event(e); } any_fsm _afsm; }; TestFSM test; test.start(); AnyFSM(test); test.process(Event1()); *error:* *test.cpp:47:43: **error: **'Event1' does not refer to a value* typedef any<has_process_event<HandledEnum(Event1 const &)>, _self&> any_fsm; *Works for vector:* BOOST_TYPE_ERASURE_MEMBER((has_push_back), push_back, 1) typedef any<has_push_back<void(int)>, _self&> any_container; void append_many(any_container container) { for(int i = 0; i < 10; ++i) container.push_back(i); } struct AnyContainer { AnyContainer(any_container cont_) : _cont(cont_) {} void append() {append_many(_cont); } any_container _cont; }; AnyContainer m(v); m.append(); for(auto i : v) { std::cout << i << std::endl; } Thanks -Raj

1 1

[Log] [ASIO with ssl] windows service crash on windows server 2008
by Pritesh Acharya 27 Sep '14

27 Sep '14

Details: OS: Windows Server 2008 SP2 Boost 1.56.0 (shared library) OpenSSL: Win32OpenSSL-1_0_1i I have a windows service application written in C++. As a minimal test case, I have created a small demo code to show the problem. The service just log some information to a file and does nothing. The same code has no problem in my Development machine(windows7) and window Server 2003. Also on Windows Server 2008, when the service is run as LocalSystem privilege, it crashes, but when run as Administrator it works. Additionally, when I remove the asio ssl header from the code, it works. or when I remove the log header, it works. The problem seems to be related to when ASIO ssl and LOG are used together. Below I've included 1. Code 2. User Mode Crash dump 3. Call Stack obtained from running Crash Dump *1. Code:* *#include <boost/log/trivial.hpp>* *#include <boost/log/sources/severity_logger.hpp>* *#include <boost/asio/ssl.hpp>* *#include <windows.h>* *#include <stdio.h>* *#define SLEEP_TIME 5000* *#define LOGFILE "C:\\AASSLInstaller_D_56\\memstatus.txt"* *SERVICE_STATUS ServiceStatus; * *SERVICE_STATUS_HANDLE hStatus; * *void ServiceMain(int argc, char** argv); * *void ControlHandler(DWORD request); * *int InitService();* *int WriteToLog(char* str)* *{* * FILE* log;* * log = fopen(LOGFILE, "a+");* * if (log == NULL)* * return -1;* * fprintf(log, "%s\n", str);* * fclose(log);* * return 0;* *}* *//void ThreadFunction()* *//{* *// WriteToLog("at ThreadFunction");* *// //std::cout << "hello World " << std::endl;* *// //getchar();* *//}* *int main() * *{ * * using namespace boost::log::trivial; //for logging* * boost::log::sources::severity_logger_mt< boost::log::trivial::severity_level > lg;* * //WriteToLog("at main");* * //return 1;* * SERVICE_TABLE_ENTRY ServiceTable[2];* * ServiceTable[0].lpServiceName = "MemoryStatus";* * ServiceTable[0].lpServiceProc = (LPSERVICE_MAIN_FUNCTION)ServiceMain;* * ServiceTable[1].lpServiceName = NULL;* * ServiceTable[1].lpServiceProc = NULL;* * // Start the control dispatcher thread for our service* * StartServiceCtrlDispatcher(ServiceTable); * * return 0;* *}* *void ServiceMain(int argc, char** argv) * *{ * * int error; * * ServiceStatus.dwServiceType = SERVICE_WIN32; * * ServiceStatus.dwCurrentState = SERVICE_START_PENDING; * * ServiceStatus.dwControlsAccepted = SERVICE_ACCEPT_STOP | SERVICE_ACCEPT_SHUTDOWN;* * ServiceStatus.dwWin32ExitCode = 0; * * ServiceStatus.dwServiceSpecificExitCode = 0; * * ServiceStatus.dwCheckPoint = 0; * * ServiceStatus.dwWaitHint = 0; * * hStatus = RegisterServiceCtrlHandler(* * "MemoryStatus", * * (LPHANDLER_FUNCTION)ControlHandler); * * if (hStatus == (SERVICE_STATUS_HANDLE)0) * * { * * // Registering Control Handler failed* * return; * * } * * // Initialize Service * * //error = InitService(); * * error = 0;* * if (error) * * {* * // Initialization failed* * ServiceStatus.dwCurrentState = SERVICE_STOPPED; * * ServiceStatus.dwWin32ExitCode = -1; * * SetServiceStatus(hStatus, &ServiceStatus); * * return; * * } * * // We report the running status to SCM. * * ServiceStatus.dwCurrentState = SERVICE_RUNNING; * * SetServiceStatus (hStatus, &ServiceStatus);* * MEMORYSTATUS memory;* * // The worker loop of a service* * //boost::thread t(&ThreadFunction);* * while (ServiceStatus.dwCurrentState == SERVICE_RUNNING)* * {* * char buffer[16];* * GlobalMemoryStatus(&memory);* * sprintf(buffer, "%d", memory.dwAvailPhys);* * int result = WriteToLog(buffer);* * if (result)* * {* * ServiceStatus.dwCurrentState = SERVICE_STOPPED; * * ServiceStatus.dwWin32ExitCode = -1; * * SetServiceStatus(hStatus, &ServiceStatus);* * return;* * }* * Sleep(SLEEP_TIME);* * }* * return; * *}* *// Service initialization* *int InitService() * *{ * * int result;* * result = WriteToLog("Monitoring started.");* * return(result); * *} * *// Control handler function* *void ControlHandler(DWORD request) * *{ * * switch(request) * * { * * case SERVICE_CONTROL_STOP: * * WriteToLog("Monitoring stopped.");* * ServiceStatus.dwWin32ExitCode = 0; * * ServiceStatus.dwCurrentState = SERVICE_STOPPED; * * SetServiceStatus (hStatus, &ServiceStatus);* * return; * * case SERVICE_CONTROL_SHUTDOWN: * * WriteToLog("Monitoring stopped.");* * ServiceStatus.dwWin32ExitCode = 0; * * ServiceStatus.dwCurrentState = SERVICE_STOPPED; * * SetServiceStatus (hStatus, &ServiceStatus);* * return; * * default:* * break;* * } * * // Report current status* * SetServiceStatus (hStatus, &ServiceStatus);* * return; * *} * *2. Dump* *Dump Summary* *------------* *Dump File: with_ssl_56.exe.4208.dmp : C:\Dumps\with_ssl_56.exe.4208.dmp* *Last Write Time: 9/26/2014 11:59:38 AM* *Process Name: with_ssl_56.exe : C:\lpa_c\wix_for_service\build_win\src\with_ssl_56\Debug\with_ssl_56.exe* *Process Architecture: x86* *Exception Code: 0xC0000005* *Exception Information: The thread tried to read from or write to a virtual address for which it does not have the appropriate access.* *Heap Information: Not Present* *System Information* *------------------* *OS Version: 6.0.6002* *CLR Version(s): * *Modules* *-------* *Module Name Module Path Module Version* *----------- ----------- --------------* *with_ssl_56.exe C:\lpa_c\wix_for_service\build_win\src\with_ssl_56\Debug\with_ssl_56.exe 0.0.0.0* *ntdll.dll C:\Windows\System32\ntdll.dll 6.0.6002.18881* *kernel32.dll C:\Windows\System32\kernel32.dll 6.0.6002.19034* *advapi32.dll C:\Windows\System32\advapi32.dll 6.0.6002.18005* *rpcrt4.dll C:\Windows\System32\rpcrt4.dll 6.0.6002.18882* *boost_log-vc100-mt-gd-1_56.dll C:\boost_1_56_0_dyn\stage\lib\boost_log-vc100-mt-gd-1_56.dll 0.0.0.0* *boost_date_time-vc100-mt-gd-1_56.dll C:\boost_1_56_0_dyn\stage\lib\boost_date_time-vc100-mt-gd-1_56.dll 0.0.0.0* *MSVCP100D.dll C:\Windows\System32\MSVCP100D.dll 10.0.30319.1* *MSVCR100D.dll C:\Windows\System32\MSVCR100D.dll 10.0.30319.1* *boost_system-vc100-mt-gd-1_56.dll C:\boost_1_56_0_dyn\stage\lib\boost_system-vc100-mt-gd-1_56.dll 0.0.0.0* *boost_filesystem-vc100-mt-gd-1_56.dll C:\boost_1_56_0_dyn\stage\lib\boost_filesystem-vc100-mt-gd-1_56.dll 0.0.0.0* *boost_chrono-vc100-mt-gd-1_56.dll C:\boost_1_56_0_dyn\stage\lib\boost_chrono-vc100-mt-gd-1_56.dll 0.0.0.0* *boost_thread-vc100-mt-gd-1_56.dll C:\boost_1_56_0_dyn\stage\lib\boost_thread-vc100-mt-gd-1_56.dll 0.0.0.0* *psapi.dll C:\Windows\System32\psapi.dll 6.0.6000.16386* *ws2_32.dll C:\Windows\System32\ws2_32.dll 6.0.6001.18000* *msvcrt.dll C:\Windows\System32\msvcrt.dll 7.0.6002.18551* *nsi.dll C:\Windows\System32\nsi.dll 6.0.6001.18000* *user32.dll C:\Windows\System32\user32.dll 6.0.6002.18005* *gdi32.dll C:\Windows\System32\gdi32.dll 6.0.6002.19171* *3. Call Stack* * 00000000() * * user32.dll!76659ce4() * * [Frames below may be incorrect and/or missing, no symbols loaded for user32.dll] * * advapi32.dll!77b84158() * * advapi32.dll!77b840f6() * * advapi32.dll!77b8430d() * * ws2_32.dll!7670ab6d() * * ws2_32.dll!7670aa95() * * ws2_32.dll!7670a3b2() * * ws2_32.dll!7670ae3f() * * ws2_32.dll!7670ad7a() * * ws2_32.dll!7670acc3() * * ws2_32.dll!7670ac2b() * * boost_log-vc100-mt-gd-1_56.dll!boost::asio::detail::winsock_init_base::startup(boost::asio::detail::winsock_init_base::data & d, unsigned char major, unsigned char minor) Line 39 + 0x2d bytes C++* * boost_log-vc100-mt-gd-1_56.dll!boost::asio::detail::winsock_init<2,0>::winsock_init<2,0>(bool allow_throw) Line 57 + 0xe bytes C++* *> boost_log-vc100-mt-gd-1_56.dll!boost::asio::detail::`dynamic initializer for 'winsock_init_instance''() Line 116 + 0x1c bytes C++* * MSVCR100D.dll!_initterm(void (void)* * pfbegin, void (void)* * pfend) Line 873 C* * boost_log-vc100-mt-gd-1_56.dll!_CRT_INIT(void * hDllHandle, unsigned long dwReason, void * lpreserved) Line 284 + 0xf bytes C* * boost_log-vc100-mt-gd-1_56.dll!__DllMainCRTStartup(void * hDllHandle, unsigned long dwReason, void * lpreserved) Line 506 + 0x11 bytes C* * boost_log-vc100-mt-gd-1_56.dll!_DllMainCRTStartup(void * hDllHandle, unsigned long dwReason, void * lpreserved) Line 476 + 0x11 bytes C* * ntdll.dll!77a112f4() * * ntdll.dll!779f906b() * * ntdll.dll!77a016d2() * * ntdll.dll!779fbf5a() *

2 1

[thread] Specific old move semantics usage
by Vicente J. Botet Escriba 27 Sep '14

27 Sep '14

Hi all, I would like to remove the specific move semantics included in Boost.Thread as it was flawed. This has been replaced by the Boost.Move one long time ago. Is there someone still using it? Could I at least define by the default (even for BOOST_THREAD_VERSION 2) BOOST_THREAD_USES_MOVE for Boost 1.57? Best, Vicente

1 0

Using boost::xpressing on Windows Store
by Paula Stanciu 27 Sep '14

27 Sep '14

Hello, I'm trying to use boost::xpressive on Windows Store and I ran into the following problem: Because _WIN32 is defined BOOST_XPRESSIVE_HAS_MS_STACK_GUARD gets defined and that causes the use of _resetstkoflw() that is not defined for windows sore ( http://msdn.microsoft.com/library/windows/apps/jj606124.aspx ) and so I cannot compile the code that uses boost::xpressive. I think BOOST_XPRESSIVE_HAS_MS_STACK_GUARD should not be defined for Windows store since it does not support _resetstkoflw() ? Any idea how I can solve this issue? Would it be the right thing to undefine this for Windows Store ? Thanks, Paula

3 2

Re: [Boost-users] Using boost::xpressive on Windows Store
by Paula Stanciu 27 Sep '14

27 Sep '14

Thanks Eric. Yes, it's if the WINAPI_FAMILY is set to WINAPI_PARTION_APP. Should I submit a patch with the changes I think should be done in this case ? It's actually just adding and extra check in xpressive_fwd.hpp before BOOST_XPRESSIVE_HAS_MS_STACK_ GUARD is defined. ( e.g. (WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_APP)) ) Best regards, Paula On Fri, Sep 26, 2014 at 6:19 PM, Eric Niebler <eniebler(a)boost.org> wrote: > On 9/26/2014 8:03 AM, Paula Stanciu wrote: > > Hello, > > > > I'm trying to use boost::xpressive on Windows Store and I ran into the > > following problem: > > > > Because _WIN32 is defined BOOST_XPRESSIVE_HAS_MS_STACK_GUARD gets > > defined and that causes the use of _resetstkoflw() that is not defined > > for windows sore ( > > http://msdn.microsoft.com/library/windows/apps/jj606124.aspx ) and so I > > cannot compile the code that uses boost::xpressive. > > > > I think BOOST_XPRESSIVE_HAS_MS_STACK_GUARD should not be defined for > > Windows store since it does not support _resetstkoflw() ? Any idea how I > > can solve this issue? Would it be the right thing to undefine this for > > Windows Store ? > > Sure. Is there some #define a program can check to see if it's being > compiled for Windows Store? > > Eric > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

BOOST_PP_ERROR(0x0003, BOOST_PP_REPEAT_OVERFLOW) with multiply nested BOOST_PP_REPEATS
by Colin Fowler 26 Sep '14

26 Sep '14

I'm having a problem with multiple nested repeats. I need to generate int x_0_0_0_0 to int x_a_b_c_d. Attempting to do so results in a BOOST_PP_ERROR. For readability, a few shorter defines #define TUPLE_ELEM BOOST_PP_TUPLE_ELEM #define REPEAT BOOST_PP_REPEAT and I also neglect the necessary BOOST_PP_CAT statements in DECL4D in this example #define DECL4D(z, n, text) TUPLE_ELEM(3, text) TUPLE_ELEM(0, text) TUPLE_ELEM(1, text) TUPLE_ELEM(2, text) n; #define DECL4C(z, n, text) REPEAT(TUPLE_ELEM(0, text), DECL4D, (TUPLE_ELEM(1, text), TUPLE_ELEM(2, text), n, TUPLE_ELEM(3, text))) #define DECL4B(z, n, text) REPEAT(TUPLE_ELEM(0, text), DECL4C, (TUPLE_ELEM(1, text), TUPLE_ELEM(2, text), n, TUPLE_ELEM(3, text))) #define DECL4A(z, n, text) REPEAT(TUPLE_ELEM(0, text), DECL4B, (TUPLE_ELEM(1, text), TUPLE_ELEM(2, text), n, TUPLE_ELEM(3, text))) #define decl4(a, b, c, d, text) REPEAT(a, DECL4A, (b, c, d, text)) decl4(1, 1, 1, 1, int x_) Am I hitting a nesting depth limit or something else? Is there a way around this? Ideally I want to write a decl5 macro and have successfully written a decl1, decl2 and decl3 so far Regards, Colin

2 3

[fusion] problem converting the result of a transform of a set into a map
by Christian Kerl 26 Sep '14

26 Sep '14

Hello everybody, I've a problem with the boost fusion library. I try to convert a fusion set into a map using the transform algorithm. Here is a example: typedef typename boost::fusion::result_of::as_map< typename boost::fusion::result_of::transform<BoundMembers, map_name_to_member>::type >::type Content; where BoundMembers is a boost::fusion::set and map_name_to_member is defined as: struct map_name_to_member { template <typename T> struct result; template <class F, typename T> struct result<F(T)> { typedef boost::fusion::pair<typename T::Name, typename T::Member> type; }; }; With boost 1.56 and gcc 4.8.1 I get the following compilation error: include/boost/fusion/iterator/key_of.hpp:36:16: error: invalid use of incomplete type ‘struct boost::fusion::extension::key_of_impl<boost::fusion::transform_view_iterator_tag>’ struct key_of ^ include/boost/fusion/iterator/key_of.hpp:21:16: error: declaration of ‘struct boost::fusion::extension::key_of_impl<boost::fusion::transform_view_iterator_tag>’ struct key_of_impl; However, this code used to work with Boost 1.48. I found a workaround to fix this, by converting the result of transform to a fusion list before coverting it to a map, i.e.: typedef typename boost::fusion::result_of::as_map< typename boost::fusion::result_of::as_list< typename boost::fusion::result_of::transform<BoundMembers, internal::map_name_to_member>::type >::type >::type Content; Am I doing something wrong or is this intended behavior? Thanks for your support. Best regards, Christian Kerl

1 0

Re: [Boost-users] boost logger architecture
by Savva Kuznetsov 26 Sep '14

26 Sep '14

Hi, Tony. It would be great to have an opportunity to know which file is currently being used for logging and set another, for example. Also, we want to control logs rotation and set conditions in which current file must be stored into collection, and create new file with the same name. It would be much easier task and I guess it would be the true boost-style, if boost\log\sinks\text_file_backend.cpp was not hiding a lot of definitions and class interfaces. S.K.

1 0

boost logger architecture.
by Savva Kuznetsov 25 Sep '14

25 Sep '14

Hello, guys. This post is almost the entire duplicate of my Ticket #10524. We're using boost logger in our application and it's really great boost library part. But, we need to change some of it's functionality. Actually, we need to add some lines of code in a method of collector class (for example, file_collector from boost\log\sinks\text_file_backend.cpp) I guess the right way to do this is inheritance from file_collector class and redefinition of it's members functions. But, since it's entire declaration and definition are in text_file_backend.cpp file in an anonymous namespace, it's impossible. Also, it would be cool to use some functions that this class uses (these functions are in text_file_backend.cpp file too for some unknown reason). The only solution I see is to copy-and-paste the entire file_collector class code from boost\log\sinks\text_file_backend.cpp and rewrite some of it's methods content, but, it's obviously wrong and not beautiful way (not boost-way). I guess boost must provide an extensible way to do things. Is there any reason that the entire class is in text_file_backend.cpp file or maybe I am missing something? My ticket have been closed by the author of logger with the comment: "file_collector in text_file_backend.cpp is not designed to be extensible because the interface for the extension is not clear. This made the implementation simpler." It's kinda strange reason, is it?

3 2

List of supported locales and time-zones
by niXman 25 Sep '14

25 Sep '14

Hi, Can somebody tell me please, how can I get a list of supported locale names and time-zones using boost.locale? Thanks. -- Regards, niXman ___________________________________________________ Dual-target(32 & 64-bit) MinGW-W64 compilers for 32 and 64-bit Windows: http://sourceforge.net/projects/mingw-w64/ ___________________________________________________ Another online IDE: http://liveworkspace.org/

1 0

boost.python built with VC2010
by Mohammed El-Afifi 25 Sep '14

25 Sep '14

Hello, I have successfully built boost.python with visual c++ 2010(dynamic library, 64-bit). I have python 2.7.8 64-bit installed on windows 7 64-bit. I've read here https://docs.python.org/2/distutils/apiref.html#module-distutils.msvccompil… that python extensions should be built with the same compiler that was used to build python itself. My question is, since python 2.7.8 was built with visual c++ 2008 64-bit compiler, can I have the following mix a) my python extension built with VC2008 64-bit(to match python itself) b) 64-bit boost.python dll built with VC2010 64-bit c) python 64-bit, built itself with VC2008 64-bit? I've noticed that boost.python dll depends on python dll and that's why I'm quite worried about the mix. Appreciating your insights.

1 0

[boost/config] BOOST_LIKELY argument requirements
by Stephan Bergmann 25 Sep '14

25 Sep '14

Looking at the definition of BOOST_LIKELY as #define BOOST_LIKELY(x) __builtin_expect(x, 1) in boost/config/compiler/{clang,intel,gcc}.hpp, and given that at lest the GCC and Clang __builtin_expect has a first parameter of type long, I wonder (1) whether it would be better to define it as #define BOOST_LIKELY(x) __builtin_expect(bool(x), 1) so that > $ cat test.cc > #include "boost/config.hpp" > #include "boost/logic/tribool.hpp" > int f(boost::tribool b1, boost::tribool b2) { > if (b1) return 1; > else if (BOOST_LIKELY(b2)) return 2; > else return 3; > } > > $ g++ -c test.cc > In file included from .../boost_1_56_0/boost/config.hpp:39:0, > from test.cc:1: > test.cc: In function ‘int f(boost::logic::tribool, boost::logic::tribool)’: > .../boost_1_56_0/boost/config/compiler/gcc.hpp:90:46: error: cannot convert ‘boost::logic::tribool’ to ‘long int’ for argument ‘1’ to ‘long int __builtin_expect(long int, long int)’ > #define BOOST_LIKELY(x) __builtin_expect(x, 1) > ^ > test.cc:5:14: note: in expansion of macro ‘BOOST_LIKELY’ > else if (BOOST_LIKELY(b2)) return 2; > ^ would not fail (effectively changing the requirement for the argument to BOOST_LIKELY from "[the] expression should result in a boolean value" to "it should be contextually convertible to bool"). (2) if not that, whether to at least wrap the expansion of x in parentheses, #define BOOST_LIKELY(x) __builtin_expect((x), 1) Stephan

1 0

[assign][ptr_container] Exception safety of ptr_list_of, ptr_push_back, ptr_map_insert, etc.
by Aaron Levy 25 Sep '14

25 Sep '14

I am trying to understand how ptr_list_of or ptr_push_back provide more exception safety. I can write something like: boost::ptr_vector<Foo> vec; push_back(vec)(new Foo)(new Foo); Is the order of evaluation of the two "new Foo" expressions indeterminate here? If not, then if the second new throws, the destructor of vec should be invoked. The Foo object allocated by the first new and now part of vec should also get released as part of that. -- Aaron Levy aaron.levy(a)yandex.com

3 3

[Log] reversed file rotation order...
by Ovanes Markarian 24 Sep '14

24 Sep '14

Hi *, We use file rotation with boost log, since I work more and with Python I use Python's logging as well. One interesting feature I observed was that Python's logger does reversed file rotation. Is that sort of feature implemented with boost::log library? In boost the rotation is: whatever_0.log < oldest file whatever_1.log whatever_2.log < newest file In Python the rotation order is: whatever_0.log < newest file whatever_1.log whatever_2.log < oldest file I think this is a very cool how Python does it, since I am able to endlessly "tail" in the shell the log file: tail -f whatever_0.log will not stop until I cancel the tail operation. With boot it is like, logger writes a new file and tail hangs with the file which is no longer written. This is a bit unusable and confusing. Would be great if that'd be possible in boost. Thanks, Ovanes

1 0

Problems Linking with Boost Serialization
by Isaac Lascasas 24 Sep '14

24 Sep '14

I have found this on boost 1.56 with msvc12: Error 119 error LNK2005: "bool __cdecl boost::archive::detail::is_whitespace<char>(char)" (??$is_whitespace@D @detail@archive@boost@@YA_ND@Z) already defined in libboost_wserialization-vc120-mt-1_56.lib(basic_text_wiprimitive.obj) C:\supernova\sb6\src\supernova_clr\libboost_serialization-vc120-mt-1_56.lib(basic_text_iprimitive.obj) Error 120 error LNK2005: "bool __cdecl boost::archive::detail::is_whitespace<wchar_t>(wchar_t)" (??$is_whitespace@ _W@detail@archive@boost@@YA_N_W@Z) already defined in libboost_wserialization-vc120-mt-1_56.lib(basic_text_wiprimitive.obj) C:\supernova\sb6\src\supernova_clr\libboost_serialization-vc120-mt-1_56.lib(basic_text_iprimitive.obj) This code used to link fine with previous boost versions. Now it looks like you can't use both archive and warchive at the same time. I'm using xml warchives for serializing in my code. Regards. Isaac Lascasas.

2 2

Boost::Locale jam file seems to be outdated for ICU ver. 53.1
by Caroline Beltran 24 Sep '14

24 Sep '14

I'm using Boost::Locale (and ICU) for the first time but I strongly believe that the jam file is referencing old ICU dll filenames. Current ICU dlls: icuucd53.dll icudt53.dll icuind53.dll icuin53.dll Relevant snippet from jam file (Boost 1.56): searched-lib icuuc : : <toolset>msvc <variant>debug <name>icuucd <search>$(ICU_PATH)/lib <link>shared <runtime-link>shared ; To me it appears that the snippet above is referring to icuucd when it should be referring to icuucd53. I've been trying really hard to get Boost::Locale going on my system. I updated all references to dlls and this is the result of the config test. As you can see, I am not linking with ICU (even though ICU was installed correctly and ICU test results were successful). I think that the jam file may need further changes. Please advise. D:\boost_1_56_0\stage\lib>test_config - Backends: std winapi - Without iconv - Environment LANG= LC_ALL= LC_CTYPE= TZ= - C locale: English_United States.1252 - C++ locale: English_United States.1252 - Testing locales availability on the operation system: locale C C++ en_US.UTF-8 No No en_US.ISO8859-1 No No English_United States.1252 Yes Yes he_IL.UTF-8 No No he_IL.ISO8859-8 No No Hebrew_Israel.1255 Yes Yes ru_RU.UTF-8 No No Russian_Russia.1251 Yes Yes tr_TR.UTF-8 No No Turkish_Turkey.1254 Yes Yes ja_JP.UTF-8 No No ja_JP.SJIS No No Japanese_Japan.932 Yes Yes - Testing timezone and time Local Time :%c=09/23/14 15:18:07; %Z=Central Daylight Time (Mexico); %z=Central Daylight Time (Mexico) Universal Time:%c=09/23/14 20:18:07; %Z=Central Standard Time (Mexico); %z=Central Standard Time (Mexico) - Boost.Locale's locale: en_US.UTF-8

2 1

Adding more than 20 rows in transition table for Boost::MSM
by Yechiel Levi 23 Sep '14

23 Sep '14

Hi, I tried defining: #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #define BOOST_MPL_LIMIT_VECTOR_SIZE 30 // or whatever you need #define BOOST_MPL_LIMIT_MAP_SIZE 30 // or whatever you need /// Boost-MSM Includes // back-end #include "boost/mpl/vector/vector30.hpp" #include <boost/msm/back/state_machine.hpp> //front-end #include <boost/msm/front/state_machine_def.hpp> #include <boost/msm/front/functor_row.hpp> #include <boost/any.hpp> // for And_ operator #include <boost/msm/front/euml/operator.hpp> And i still get the following errors: builder1: In file included from /usr/local/include/boost/mpl/erase.hpp:19, builder1: from /usr/local/include/boost/fusion/mpl/erase.hpp:10, builder1: from /usr/local/include/boost/fusion/mpl.hpp:20, builder1: from /usr/local/include/boost/fusion/include/mpl.hpp:11, builder1: from /usr/local/include/boost/msm/back/state_machine.hpp:30, builder1: from File_Meta_FSM.h:18, builder1: from Open_Files_Mng.h:5, builder1: from Open_Files_Mng.cpp:1: builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:56: error: ‘_’ was not declared in this scope builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:56: error: ‘_’ was not declared in this scope builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:56: error: template argument 1 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:56: error: template argument 2 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:57: error: template argument 3 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:62: error: ‘_’ was not declared in this scope builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:62: error: ‘_’ was not declared in this scope builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:62: error: template argument 1 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:62: error: template argument 2 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:63: error: template argument 3 is invalid and more of the same errors.. -- Kind regards, Yechiel Levi

5 7

Graph concepts for Dijkstra shortest-path searches
by Clayton Davis 22 Sep '14

22 Sep '14

Hi, I am somewhat uncertain on which concepts are required for the Dijkstra searches in the BGL and parallel BGL. For the sequential BGL, documentation at http://www.boost.org/doc/libs/1_56_0/libs/graph/doc/dijkstra_shortest_paths… would seem to indicate that a VertexListGraph is required, even when the no_init version is used. Looking at the code, I think that is accurate - use of the index map at https://github.com/boostorg/graph/blob/master/include/boost/graph/dijkstra_… seems to require vertex list traversal - but I would also think that defeats the purpose of the no_init option. Conversely, for the parallel BGL documentation at http://www.boost.org/doc/libs/1_56_0/libs/graph_parallel/doc/html/dijkstra_… says only that DistributedGraph is required, which is a refinement of Graph but not VertexListGraph or IncidenceGraph. However, just a little bit of searching seems to show that the parallel Dijkstra search requires both, along with perhaps PropertyGraph (see for instance https://github.com/boostorg/graph_parallel/blob/master/include/boost/graph/… and https://github.com/boostorg/graph_parallel/blob/master/include/boost/graph/…) I won't pretend to understand the code; but I would expect these functions to require something stronger than the documentation indicates. Could someone please clarify what the requirements are for these functions? Any help is greatly appreciated. Thanks, Clayton

1 0

BOOT_PP_REPEAT simple nesting problem
by Colin Fowler 22 Sep '14

22 Sep '14

Hi all, I'm trying to use BOOST_PP to generate some code. I can generate the sequence int x_0 to int x_4 using the code below. #include <boost/preprocessor/repetition/repeat.hpp> #define DECL1(z, n, text) text ## _ ## n = n; #define decl1(text, count) BOOST_PP_REPEAT(count, DECL1, text) decl1 (int x, 5) What I'd like to do is write a decl2 that can be used something like this: decl2 (int x, 5, 2) to generate int x_0_0 to int x_4_1 I've tried nesting BOOST_PP_REPEAT but so far I've been unable to produce the desired behaviour unless I hardcode one of the iteration counts. I'd like to also eventually write a decl3(int x, 5, 3, 4) when I understand how a decl2 would work. Any help much appreciated! Regards, Colin

4 6

[assign][cref_list_of] Creating anonymous list of pairs
by Aaron Levy 22 Sep '14

22 Sep '14

Is there a way to generate a list of value pairs using ref_list_of or cref_list_of. Maybe such a list could be assigned to a map. Something like: ref_list_of<size, std::pair<std::string, std::string>>("foo", "bar")("foo1", "bar1")...; or std::map<string, string> names = ref_list_of<size, std::pair<std::string, std::string>>("foo", "bar")("foo1", "bar1")...; -- Aaron Levy aaron.levy(a)yandex.com

3 2

[ptr_container][ptr_map]
by Aaron Levy 22 Sep '14

22 Sep '14

Consider the following code: class Base { public: virtual ~Base() = 0 {}; virtual double get() = 0; }; class D1 : public Base { public: D1(double n) : val_(n) {} double get() const { return val_; } private: double val_; }; class D2 : public Base { D2(double n) : val_(n) {} double get() const { return val_; } private: double val_; }; bool operator < (const Base& left, const Base& right) { return (left.get() < right.get()); } I can create a ptr_set of Base like this: boost::ptr_set<Base> set; But I can't create a ptr_map with Base as key, like this: boost::ptr_map<Base, Base> map; The problem is that Base is abstract and so the key cannot be instantiated by ptr_map. What is the cause for this distinction between ptr_set and ptr_map. -- Aaron Levy aaron.levy(a)yandex.com

2 1

Boost.Test multiple linkage question
by Rob Harris 22 Sep '14

22 Sep '14

All, I've been ripping out my hair all day, and I can't seem to determine a straight answer from the Googles. Can I link _multiple_ boost unit test dynamic libraries into a single binary and have all of them detected? For instance... src lib liba foo.cpp liba_unittests.cpp libb bar.cpp libb_unittests.cpp libd baz.cpp libd_unittests.cpp lib liba.so liba_ut.so libb.so libb_ut.so libd.so libd_ut.so bin ut unittest_driver When I build this infrastructure out, everything compiles. I've checked the compilation command and it looks like everything is on the command line, but there's explicit indication that unittest_driver actually read or linked any of the lib*_ut.so files. If I make individual unit test drivers in, say, liba, the driver works fine. If I link everything into a single unittest_driver binary, I keep getting the dreaded empty test tree. I have -DBOOST_ALL_DYN_LINK set in my CXXFLAGS so that shouldn't be the problem. And I only have BOOST_TEST_MAIN set in the driver; still no joy. Any help (or a definitive, "no you idiot, you can't do that!") would be greatly appreciated. Thanks. -RMH

2 1

Utah C++ User Group started
by legalize+jeeves＠mail.xmission.com 22 Sep '14

22 Sep '14

[Please do not mail me a copy of your followup] I'm booting up a C++ User Group in Utah. We're bootstrapping out first meeting to decide a regular meeting time and location. Join the Utah C++ Programmers MeetUp group to hear about meetings: <http://www.meetup.com/Utah-Cpp-Programmers/> Follow related evens on the Utah C++ Users Group blog: <http://utahcpp.wordpress.com> -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

1 0

[lockfree] stack needs undocumented trivial assignment
by Norbert Wenzel 21 Sep '14

21 Sep '14

I'm trying to replace some computation intensive loops in legacy code with parallel loops and thus tried to store the results in a lockfree stack. I've chosen stack over queue because of the requirements stated in the documentation, where stack only needs a copy ctor and queue additionally needs trivial assignment and trivial dtor. My result struct I want to store in the stack is *not* trivially assignable. When trying to compile the code containing my lockfree::stack the static assertion in line 75 of stack.hpp because it requires trivial assignment and trivial dtor. My question would be if this is simply an error in the documentation ie. if the requirements section should be copied over from lockfree::queue or if these static assertions should only be checked in some special case, eg. where the stack is of fixed size? thanks, Norbert

1 0

[context] How to set stack pointer in a platform-independent way?
by TONGARI J 21 Sep '14

21 Sep '14

Hi, The problem had been discussed here: https://groups.google.com/forum/#!topic/boost-devel-archive/cl8B1oUPrVM But it's still not clear how to set the stack pointer portably, even after examining the code of Boost.Coroutine. For now, Boost.Context only supports downward stack, and Boost.Coroutine, which happened to be written by the same author, just assumes that the stack always grows downward, which is not really a portable implementation, if future Boost.Context supports upward stack, Boost.Coroutine has to be changed as well. Even than that, what does "beginning of the stack" really means? Suppose we have a stack of size 3, starting at [s]: [s-1][s][s+1][s+2][s+3] Why the beginning of a downward stack is [s+3], not [s+2]? If it's a upward stack, is beginning [s] or [s-1]? Thanks.

5 12

from: giridhar
by giridhar 20 Sep '14

20 Sep '14

Salutations boost http://ariasking.com/morning.php/ttqhx3144vcfnpry/ giridhar

1 0

[ASIO] [SSL] [SOCKS4] Layers
by Maciej Miszczak 19 Sep '14

19 Sep '14

Hello, I have been successfully using ASIO for a long time, but recently I try to use SSL over SOCKS 4 and I'm struggling with short read while asynchronous SSL handshaking. I have come across this: http://stackoverflow.com/questions/9943541/boost-asio-how-to-read-write-on-…] but it's only partially helpful. I haven't find any good explanation, what the layers really are (ex. I can't assign next_layer and lowest_layer to any of OSI layers). Could someone explain the meaning of next_layer and lowest_layer and how to use SSL stream with SOCKS 4 proxy. Best regards, Maciej Miszczak

2 2

Re: [Boost-users] Boost XML Serialization
by Manasi Deshpande 19 Sep '14

19 Sep '14

Hello All, Currently I am working on DB Driven C++ API, where it also involves XML processing functionalities. That's where I came across Boost Serialization. We have a very peculiar story here, and it goes like this: We have 2 identical APIs. One in C# and another in C++. Both are DB driven similar APIs. There are instances, where any XML data serialized on C++ platform needs to be de serialized on C# and vice versa. In C# life is straight forward; one needs no bothering about serialization and de serialization. I think in boost you can de serialize the XML document only if it is built using Boost Serialization. I think it is the case in C# also. Is there any way out, where Boost Serialization can be customized? Please forgive me if I am not clear in stating my problem statement! -------------------------------------------------------------------------------------------------- This email and any attachments are confidential and are for the use of the addressee only. If you are not the addressee, you must not use or disclose the contents to any other person. Please immediately notify the sender and delete the email. Statements and opinions expressed here may not represent those of the company. Email correspondence is monitored by the company. This information may be subject to export control regulation. You are obliged to comply with such regulations. Renishaw plc (company number 1106260) and Wotton Travel Limited (company number 01973158) are companies registered in England and Wales with a registered office at New Mills, Wotton-under-Edge, Gloucestershire, GL12 8JR, United Kingdom, Telephone +44 1453 524524. --------------------------------------------------------------------------------------------------

2 1

[logging+unittest]
by Witold E Wolski 19 Sep '14

19 Sep '14

Hi, I need to integrate some loggin into my unit to some extend bein integration tests (hardware). How best to call this function which sets up boost logging void init() { boost::log::add_file_log("sample.log"); boost::log::core::get()->set_filter ( boost::log::trivial::severity >= boost::log::trivial::info ); } if I have a test Runner looking like: #define BOOST_TEST_MODULE MasterTestSuite #include <boost/test/unit_test.hpp> Is there a way not have to add the suites manually Thanks. -- Witold Eryk Wolski

1 1

[thread] memory synchronization multiple mutexes
by firespot 19 Sep '14

19 Sep '14

Hi, How does memory synchronization and visibility behave when multiple mutexes are involved? I have two groups of threads (boost::thread_group) and two mutexes (boost::mutex m1, boost::mutex m2) + associated condition variables, with each thread group being responsible to write to some variables (here Ptr, run) and consistently using "its" mutex for locking. However there is a piece of code that looks - much simplified - like this: void f() { { boost::unique_lock<boost::mutex> Lock(m1); Ptr = someAddress; // set the Ptr from 0 to some memory address } { boost::unique_lock<boost::mutex> Lock(m2); run = 1; // was 0, inform that execution can proceed condVar2.notify_all(); } ... // wait until Ptr has been reset to 0 { boost::unique_lock<boost::mutex> Lock(m1); while (Ptr != 0) condVar1.wait(Lock); } } and another function: void g() { { boost::unique_lock<boost::mutex> Lock(m2); while (run == 0) condVar2.wait(Lock); } // run the execution, e.g. std::copy(Ptr, Ptr + 100, Target); // finally all finished, signal back that Ptr is not needed any more { boost::unique_lock<boost::mutex> Lock(m1); Ptr = 0; condVar1.notify_all(); } } f() is only invoked from a thread of the first group, and g() only from a thread of the second group. Whenever Ptr might get changes the first mutex (m1) and its associated condition-variable is used, and whenver run might get changed the second mutex and its associated conditional variable is used. The control flow guarantees that run is not set to 1 prior to Ptr being set, and thus in g() the "running" itself (here the std::copy) cannot commence earlier. However, what puzzles me now: I used a different mutex for setting Ptr and setting/checking run. Does this have any impact whatsoever on memory visibility across the threads in the two thread-groups? Specifically, is it always guaranteed that when g() continues its execution (because run == 1) that it must see the correct value of Ptr (a non-NULL value)? Or is it possible that it still sees 0 and I'd have to make a separate locking involving m1 to guarantee a proper read for Ptr as anything written under a lock of m1 is also only guaranteed to be later properly read if the locking also used m1? thanks!

2 1

[mpl] simple mpl::transform with placeholder?
by Andrew King 19 Sep '14

19 Sep '14

Hi, Lets say I have an mpl vector defined as : template <typename Traits> struct A { }; template <typename Traits> struct B { }; typedef mpl::vector<A<mpl::_>, B<mpl::_> > MyVec; struct MyTraits {}; How do I 'apply' or transform MyVec with MyTraits? ie. I want the mpl::vector ... boost::mpl::vector<A<MyTraits>, B<MyTraits>>; I realise I can do mpl::apply<A<mpl::_>, MyTraits> to get A<MyTraits> but I can't work out how to do the equivalent to the entire vector. mpl::transform seems like what I should be using. Transform seems to do apply internally, but I can't work out the syntax to do something like: using substituted = typename boost::mpl::transform<MyVec, boost::mpl::apply<boost::mpl<_>, MyTraits> >::type; (This isn't right!) It may be I am confused because inside the transform, boost::mpl::_1 is the item in the vector, not the 'inner' placeholder. Sorry if this is a basic question ... Regards, Andrew

1 0

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

18 Sep '14

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

4 3

Numeric Cast from integer to floating point
by dariomt＠gmail.com 17 Sep '14

17 Sep '14

Hi, Quoting the docs for boost::numeric_cast: "There are several situations where conversions are unsafe: [...] Conversions from floating point types to integral types." What about conversions from integral types to floating point types? E.g. from 64bit int to double. The following example shows what I mean: #include <iostream> #include <cmath> #include <boost/numeric/conversion/cast.hpp> int main() { const uint64_t i = 123445678911188878; std::cout << "i=" << i << std::endl; const double d = i; std::cout << "d=" << std::fixed << d << std::endl; std::cout << "next=" << std::fixed << std::nextafter(d, std::numeric_limits<double>::max() ) << std::endl; std::cout << "prev=" << std::fixed << std::nextafter(d, -std::numeric_limits<double>::max()) << std::endl; // I'd expect the following cast to fail const double dd = boost::numeric_cast<double>(i); std::cout <<"dd=" << std::fixed << dd << std::endl; return 0; } prints i=123445678911188878 d=123445678911188880.000000 next=123445678911188896.000000 prev=123445678911188864.000000 dd=123445678911188880.000000 because that integer cannot be represented in double precision Is there something in Boost to help here? Thanks in advance

5 4

value_type in Typed In Place Factory
by Adam Badura 17 Sep '14

17 Sep '14

According to header file boost/utility/typed_in_place_factory.hpp (as linked from documentation: http://www.boost.org/doc/libs/1_55_0/boost/utility/typed_in_place_factory.h…) typed_in_place_factory has member type value_type which is the constructed type. Yet documentation ( http://www.boost.org/doc/libs/1_55_0/libs/utility/in_place_factories.html) fails to mention it. Why? Is it not part of the interface (I would assume so based on not mentioning it in documentation...)? Or was it just forgotten? I find such value_type quite useful... And since I'm already writing let me note that the mentioned documentation has also another minor issue. In Specification section the sample in_place_factory and typed_in_place_factory should be named in_place_factory1 and typed_in_place_factory1. As this is how they are really named. Or it should be stated explicitly that the actual name is implementation dependent. Adam Badura

1 0

Boostlog and ASIO crash in shared library
by Ray Cheng 17 Sep '14

17 Sep '14

Hi, My project use a simple main using dlopen to "run" the real main function in target shared library. I use both Boost Log and ASIO (for threadpool) in the project. In Linux I found the ASIO got weird behavior with some un-initialized variables and crashing all the time. I am able to trim down my problem into a small program as below: // *** threadpool.cpp *** #include <iostream> #include <memory> #include <boost/asio/io_service.hpp> #include <boost/bind.hpp> #include <boost/thread/thread.hpp> void print() { std::cout << "print" << std::endl; } struct ThreadPool { void start() { boost::asio::io_service ioService; boost::thread_group threadpool; std::unique_ptr<boost::asio::io_service::work> work = std::make_unique<boost::asio::io_service::work>(ioService); threadpool.create_thread(boost::bind(&boost::asio::io_service::run, &ioService)); for (int i=0; i<100; ++i) { ioService.post(&print); } std::cout << "Post all calculation tasks" << std::endl; work.reset(); threadpool.join_all(); ioService.stop(); std::cout << "Finished all calculation tasks" << std::endl; } }; extern "C" void createthreadpool() { ThreadPool pool; pool.start(); } // *** threadpool.cpp *** g++ -O0 -std=gnu++1y -fPIC -c -g -DLinux -DGNU_GCC -I${BOOST_HOME}/include threadpool.cpp g++ -shared -o libthreadpool.so threadpool.o -L${BOOST_HOME}/lib -lboost_system -lboost_date_time -lboost_thread -lboost_filesystem -lboost_regex -lboost_chrono -ldl -lstdc++ // *** main.cpp *** #include <dlfcn.h> #include <iostream> int main(int argc, char** argv) { typedef void* createProcess(); auto service = dlopen("libthreadpool.so", RTLD_LAZY); createProcess* make = reinterpret_cast<createProcess*>(dlsym(service, "createthreadpool")); std::cout << "dlsym" << std::endl; make(); return 0; } // *** main.cpp *** g++ -O0 -std=gnu++1y -fPIC -c -g -DLinux -DGNU_GCC main.cpp // Link against boost_log to simulate my problem (although it is not using any boost_log). This version will crash g++ -o main.bad main.o -L${BOOST_HOME}/lib -lboost_system -lboost_date_time -lboost_thread -lboost_filesystem -lboost_regex -lboost_chrono -lboost_log -ldl -lstdc++ // it works fine If link against libthreadpool, surprising me g++ -o main main.o -L/home/sysmmbuild/dev/boost -lthreadpool -L${BOOST_HOME}/lib -lboost_system -lboost_date_time -lboost_thread -lboost_filesystem -lboost_regex -lboost_chrono -lboost_log -ldl -lstdc++ One more finding is, if compile boost_log without thread support, the main.bad also working fine. I have attached the code and make.sh as make script. Software version Redhat enterprise 6.5 g++ 4.9.1 Boost 1.56.0 Rgds, Ray

2 2

[Thread] thousands of spurious wakeups from timed_wait() per second
by Steven Clark 15 Sep '14

15 Sep '14

I've been trying to get useful behavior out of condition_variable::timed_wait() with little success. Depending on the platform, I'm getting about 3000 or nearly 100000 spurious wakeups per second. I'm working on a few different Linux platforms with different versions of Boost: 1.46, 1.48, and another in the high 40's. The eventual target is 1.48. I've looked for bug reports and haven't found any, and I have no evidence yet that suggests the different versions are significant to this problem. Because of the lack of problem reports, I figure I'm doing something wrong. That's my question: "What am I doing wrong here?" I have a test program that sets up a typical producer/consumer example. The main program spawns a thread, the producer, that notifies the main thread via a condition_variable once a second for a few seconds, then ends. The main thread, the consumer, waits efficiently for notifications with a 2-second timeout. When the producer thread finishes, the main (consumer) thread eventually times out, joins the spawned thread, and exits. At least, that's what is supposed to happen. If I don't bother with timeouts and use condition_variable::wait(), it works perfectly - except for the timeout, join, and exit. This is as expected. So far I have seen no spurious wakeups at all with this test. There is an ominous yet ambiguous remark in the documentation "The duration overload of timed_wait is difficult to use correctly. The overload taking a predicate should be preferred in most cases." Due to that remark I stopped experimenting with relative timeouts before I got anything to work. Using absolute timeouts, I get very high numbers of spurious wakeups as mentioned above - 3000 and about 100000 per second depending on the platform. I see no difference between timed_wait with a predicate and without a predicate. I'm also having trouble with the return value of timed_wait(). The documentation carefully states that timed_wait() returns "false if the call is returning because the time specified by abs_time was reached, true otherwise". This seems to mean that spurious wakeups return true -- and if you think about it, the return value is useless if spurious wakeups could return false. You'd have to add your own check for timeout. I was quite surprised to find that every spurious wakeup of timed_wait() that I've ever seen returns false. That just doesn't make sense to me. Here is the version of my test program that uses timed_wait without a predicate, followed by its output. #include <boost/thread.hpp> #include <boost/date_time.hpp> #include <iostream> boost::condition_variable gCond; boost::mutex gMutex; bool gGotData; unsigned gValue; void threadfn() { for (unsigned i = 0; i < 7; i++) { std::cerr << "hello from threadfn(), #" << i << std::endl; { boost::lock_guard<boost::mutex> guard(gMutex); gGotData = true; gValue = i; } gCond.notify_one(); boost::this_thread::sleep(boost::posix_time::seconds(1)); } } int main() { std::cerr << "******* Using timed_wait()" << std::endl; gGotData = false; gValue = 999; boost::thread t(threadfn); while (true) { boost::system_time deadline( boost::posix_time::microsec_clock::local_time()); std::cerr << "now is " << deadline << std::endl; deadline += boost::posix_time::seconds(2); std::cerr << "deadline is " << deadline << std::endl; boost::unique_lock<boost::mutex> lock(gMutex); unsigned nWakeups = 0; while(!gGotData) { bool ret = gCond.timed_wait(lock, deadline); nWakeups++; if (ret) std::cerr << "timed_wait() returned true on wakeup #" << nWakeups << std::endl; } std::cerr << "main() exited inner loop with " << nWakeups << " wakeups; gGotData is " << (gGotData ? "true" : "false") << std::endl; if (gGotData) { std::cerr << "main(), notified, gValue is " << gValue << std::endl; gGotData = false; } } // not reached in this incarnation of the code t.join(); std::cerr << "main(), after joining" << std::endl; } ******* Using timed_wait() now is 2014-Sep-09 20:48:12.183781 deadline is 2014-Sep-09 20:48:14.183781 hello from threadfn(), #0 timed_wait() returned true on wakeup #1451 main() exited inner loop with 1451 wakeups; gGotData is true main(), notified, gValue is 0 now is 2014-Sep-09 20:48:12.215471 deadline is 2014-Sep-09 20:48:14.215471 hello from threadfn(), #1 timed_wait() returned true on wakeup #96864 main() exited inner loop with 96864 wakeups; gGotData is true main(), notified, gValue is 1 now is 2014-Sep-09 20:48:13.216511 deadline is 2014-Sep-09 20:48:15.216511 hello from threadfn(), #2 timed_wait() returned true on wakeup #95911 main() exited inner loop with 95911 wakeups; gGotData is true main(), notified, gValue is 2 now is 2014-Sep-09 20:48:14.216805 deadline is 2014-Sep-09 20:48:16.216805 hello from threadfn(), #3 timed_wait() returned true on wakeup #97526 main() exited inner loop with 97526 wakeups; gGotData is true main(), notified, gValue is 3 now is 2014-Sep-09 20:48:15.217191 deadline is 2014-Sep-09 20:48:17.217191 hello from threadfn(), #4 timed_wait() returned true on wakeup #104710 main() exited inner loop with 104710 wakeups; gGotData is true main(), notified, gValue is 4 now is 2014-Sep-09 20:48:16.217453 deadline is 2014-Sep-09 20:48:18.217453 hello from threadfn(), #5 timed_wait() returned true on wakeup #102404 main() exited inner loop with 102404 wakeups; gGotData is true main(), notified, gValue is 5 now is 2014-Sep-09 20:48:17.217685 deadline is 2014-Sep-09 20:48:19.217685 hello from threadfn(), #6 timed_wait() returned true on wakeup #97906 main() exited inner loop with 97906 wakeups; gGotData is true main(), notified, gValue is 6 now is 2014-Sep-09 20:48:18.217291 deadline is 2014-Sep-09 20:48:20.217291 ^C Thank you very much, Steven Clark

4 9

[fusion] BOOST_FUSION_DEFINE_STRUCT with user defined methods
by Tobias Loew 15 Sep '14

15 Sep '14

Hi, I often use BOOST_FUSION_DEFINE_STRUCT not to generate a fusion-sequence per se, but to get a struct with - default initialisation for all members - a reasonable set of constructors - equality-check - all above without additional code But sometimes I would like to have additional methods in those structs, but deriving from those or fusion-adapting them loses at least one of the nice properties above. After looking at the BOOST_FUSION_DEFINE_STRUCT implementation I though about splitting the makro BOOST_FUSION_DEFINE_STRUCT_IMPL an inject my code in-between. Now my questions are: - Is there anything I've overseen and might detroy some fusion-mechanism? - Is there any chance to get macros like BOOST_FUSION_DEFINE_STRUCT_[BEGIN|END] (and also for the other BOOST_FUSION_DEFINE_... macros? Tobias -- View this message in context: http://boost.2283326.n4.nabble.com/fusion-BOOST-FUSION-DEFINE-STRUCT-with-u… Sent from the Boost - Users mailing list archive at Nabble.com.

4 8

WG: [atomic] can it bechecked that boost::atomic<T> *v = reinterpret_cast<boost::atomic<T>*>(var); is safe?
by Tim Odenthal 15 Sep '14

15 Sep '14

On 15 Sep 2014, at 18:00, boost-users-request(a)lists.boost.org<mailto:boost-users-request@lists.boost.org> wrote: On Monday, September 15, 2014 07:31 PM, Tim Odenthal wrote: Dear experts, essentially, I use this type of reinterpret_cast for doubles, and it __seems__ to work fine. I compile-time check that the sizeof(boost::atomic<T>) == sizeof( T ), but is that enough to ensure that this will always work? Should/could I check alignment issues as well? Even if the "atomic_cast" function has a (small) run-time overhead, it would be very much worth it in my setting, where I actually want to safely add to a double at some location in memory. Obviously, I want to use boost::atomic to be system/compiler agnostic, since it's supposed to eventually run with clang, gcc, (linux, OS X) as well as MS compilers, and so far we didn't see the need to move to C++11... I'm not sure I can figure out what problem you're trying to solve. Well, essentially, I have an array of doubles that at exactly one point in the code needs to be added to where I cannot ensure that each thread only adds to its own part of the array, so I want to ensure that each addition there is executed atomically. I think the cast is probably "safe", but far less can be said of it when it's dereferenced. That would depend entirely on the type of var. Is *var actually a boost::atomic<T> in the first place? If it is, why are you erasing its type? No, as I was saying, it’s a double *. How can you be sure there is nobody else aliasing var or *var and then reading or writing it? That is actually a problem, but since I completely control that part of the code, I hope to not make that mistake ;-). If *var is not a boost::atomic<T>, reinterpret_cast isn't going to magically convert it, you have undefined behaviour. Of course, one effect of UB is that it __seems__ to work, until, presumably, it doesn’t. But what, then, is the difference between an atomic<double>* and a normal double*, if the sizes (and possibly alignments) are the same? Hmmm, I just read up on what a reinterpret_cast<> is supposed to be good for, which is very little indeed, so it seems that the behaviour is undefined - but then there is no way to solve that problem? (So far I only ever used it to print the address of a pointer...) Since openMP allows for a pragma atomic, somehow, it seems that there should be a way. Using a simple spin_lock is way too slow (tested), since it doesn’t lock a specific memory location, but essentially everything, and I suspect that more complicated locking schemes will be also more expensive, just for different reasons. Ben Thanks for your insight! Tim

2 1

[atomic] can it bechecked that boost::atomic<T> *v = reinterpret_cast<boost::atomic<T>*>(var); is safe?
by Tim Odenthal 15 Sep '14

15 Sep '14

Dear experts, essentially, I use this type of reinterpret_cast for doubles, and it __seems__ to work fine. I compile-time check that the sizeof(boost::atomic<T>) == sizeof( T ), but is that enough to ensure that this will always work? Should/could I check alignment issues as well? Even if the "atomic_cast" function has a (small) run-time overhead, it would be very much worth it in my setting, where I actually want to safely add to a double at some location in memory. Obviously, I want to use boost::atomic to be system/compiler agnostic, since it's supposed to eventually run with clang, gcc, (linux, OS X) as well as MS compilers, and so far we didn't see the need to move to C++11... Thanks for any advice in advance Tim

2 1

program_options Parsing Suboptions
by Robert 15 Sep '14

15 Sep '14

Hi, I am trying to use program_options to parse suboptions: Command –S “-a 1 –b test –c 1.2” (the suboptions in –S are to be passed into other programs) Using the example source code, I tried something like the code below, but get the following error The argument (‘ 1’) for option ‘—TestA’ is invalid. Apparently the space between –a and 1 is treated as part of the argument and thus will not convert to an integer. I tried at the top argument level (e.g. command –M 1) and it works as expected, so something about creating the vector of suboptions is confusing program_options. Any suggestions? Thanks very much. options_description desc("Allowed options"); desc.add_options()("subopt,S",value<string>(),"Sub Options"); variables_map vm; store(command_line_parser(ac, av).options(desc).run(), vm); vm.notify(); if (vm.count("subopt")) { string substring=vm["subopt"].as<string>(); boost::regex re("\\s+(?=-)"); boost::sregex_token_iterator i(substring.begin(), substring.end(), re, -1); boost::sregex_token_iterator j; vector<string> splitResults; copy(i,j,back_inserter(splitResults)); int ta; string tb; float tc; options_description subopt_desc("Suboptions"); subopt_desc.add_options() ("TestA,a", value<int>(&ta)->default_value(0), "integer") ("TestB,b",value<string>(&tb),"string") ("TestC,c",value<float>(&tc), "float") ; variables_map subopt_vm; store(command_line_parser(splitResults).options(subopt_desc).run(), subopt_vm); subopt_vm.notify(); cout<<"a="<<ta<<endl; cout<<"b="<<tb<<endl; cout<<"c="<<tc<<endl; } -- http://www.fastmail.fm - Choose from over 50 domains or use your own

1 1

[graph] how to find all vertices reachable from one edge of a starting vertex
by Michael Marcin 14 Sep '14

14 Sep '14

How can I find all vertices reachable by following one specified out-edge? Is there already an algorithm that does this? If not I think I could do it by: - marking all vertices white - mark starting vertex gray - depth_first_visit the target of the specified edge Does this work?

2 2

[container][slist] constant time splice_after
by Aaron Levy 14 Sep '14

14 Sep '14

What happens if I call slist::splice_after(this_iter, that_list, that_begin, that_end, nelems) with an nelems value that does not match std::distance(that_begin, that_end). In other words, is there any kind of validations performed on nelems and is it just used to update the size of the list? Aaron

2 1

how to construct an iterator_archetype<single_pass_traversal_tag>
by Peter Johansson 13 Sep '14

13 Sep '14

Hi, I'm writing tests using the iterator_archetype [http://www.boost.org/doc/libs/1_55_0/libs/iterator/doc/iterator_archetypes.…] and get confused how to use a single_pass_iterator such as e.g. iterator_archetype<int, readable_iterator_t, single_pass_iterator> The default constructor does not work as expected (since single_pass_iterators are not necessarily default constructible). The copy constructor is not very useful and that is all can find. I noticed the detail::ctor_arg and was hoping there were a constructor thaing that struct as argument - but no. How am I supposed to construct this class if I e.g. wanna passed it to a function that I intend to test. Thank you, Peter

1 0

[container][flat_map] Internal storage for flat_maps / flat_sets
by Aaron Levy 13 Sep '14

13 Sep '14

What is the type of the underlying contiguous storage used by the flat_map / flat_set containers? Does the following code make sense: flat_map<T> container; ... if (container.size() > 0) { const T& elem = *(container.begin()); const T& elem_1 = *(container.begin() + 1); assert(&elem_1 == &elem + 1); } Aaron

2 1

Problem linking with boost::program_options with clang 3.5 (OSX)
by Jürgen Simon 12 Sep '14

12 Sep '14

Hello, I require OpenMP on OSX and had to build OpenMP/Clang to that end. The compiler reads as clang 3.5. For some reason, the compiler seems to have a problem linking executables with boost. I tried boost version 1.55 but got a compilation error. Boost 1.56 compiles with this warning: clang-3.5: warning: argument unused during compilation: '-finline-functions' but other than that compiles through and installs just fine. When trying to link an executable with program_options however, I get the following linker error: Undefined symbols for architecture x86_64: "__ZN5boost15program_options11to_internalERKSs", referenced from: __ZN5boost15program_options11to_internalISsEESt6vectorISsSaISsEERKS2_IT_SaIS5_EE in radolan2cf.cpp.o "__ZN5boost15program_options19options_descriptionC1ERKSsjj", referenced from: _main in radolan2cf.cpp.o "__ZN5boost15program_options20invalid_option_valueC1ERKSs", referenced from: __ZN5boost15program_options8validateIfcEEvRNS_3anyERKSt6vectorISbIT0_St11char_traitsIS5_ESaIS5_EESaIS9_EEPT_l in radolan2cf.cpp.o "__ZN5boost15program_options22error_with_option_nameC2ERKSsS3_S3_i", referenced from: __ZN5boost15program_options16validation_errorC2ENS1_6kind_tERKSsS4_i in radolan2cf.cpp.o "__ZN5boost15program_options6detail7cmdline21set_additional_parserENS_9function1ISt4pairISsSsERKSsEE", referenced from: __ZN5boost15program_options25basic_command_line_parserIcE12extra_parserENS_9function1ISt4pairISsSsERKSsEE in radolan2cf.cpp.o "__ZN5boost15program_options6detail7cmdlineC2ERKSt6vectorISsSaISsEE", referenced from: __ZN5boost15program_options25basic_command_line_parserIcEC2EiPKPKc in radolan2cf.cpp.o "__ZN5boost15program_options8validateERNS_3anyERKSt6vectorISsSaISsEEPSsi", referenced from: __ZNK5boost15program_options11typed_valueISscE6xparseERNS_3anyERKSt6vectorISsSaISsEE in radolan2cf.cpp.o "__ZN5boost15program_optionslsERSoRKNS0_19options_descriptionE", referenced from: _main in radolan2cf.cpp.o "__ZNK5boost15program_options22abstract_variables_mapixERKSs", referenced from: __ZNK5boost15program_options13variables_mapixERKSs in radolan2cf.cpp.o "__ZNK5boost15program_options22error_with_option_name23substitute_placeholdersERKSs", referenced from: __ZTVN5boost16exception_detail10clone_implINS0_19error_info_injectorINS_15program_options20invalid_option_valueEEEEE in radolan2cf.cpp.o __ZTVN5boost16exception_detail19error_info_injectorINS_15program_options20invalid_option_valueEEE in radolan2cf.cpp.o __ZTVN5boost15program_options20invalid_option_valueE in radolan2cf.cpp.o __ZTVN5boost15program_options16validation_errorE in radolan2cf.cpp.o __ZTVN5boost16exception_detail10clone_implINS0_19error_info_injectorINS_15program_options16validation_errorEEEEE in radolan2cf.cpp.o __ZTVN5boost16exception_detail19error_info_injectorINS_15program_options16validation_errorEEE in radolan2cf.cpp.o "__ZNK5boost15program_options29value_semantic_codecvt_helperIcE5parseERNS_3anyERKSt6vectorISsSaISsEEb", referenced from: __ZTVN5boost15program_options11typed_valueIfcEE in radolan2cf.cpp.o __ZTVN5boost15program_options11typed_valueISscEE in radolan2cf.cpp.o ld: symbol(s) not found for architecture x86_64 clang-3.5: error: linker command failed with exit code 1 (use -v to see invocation) I’m a little stumped as to how to fix this problem. Can someone help me out? Kind Regards, Jürgen

1 0

[Range] Strange!
by Robert Jones 10 Sep '14

10 Sep '14

Can anyone explain why my last output line is garbage? #include <iostream> #include <boost/range/algorithm/copy.hpp> #include <boost/range/counting_range.hpp> #include <boost/range/adaptor/reversed.hpp> #include <boost/range/adaptor/transformed.hpp> #include <boost/phoenix/bind/bind_function.hpp> #include <boost/phoenix/core/argument.hpp> int doubled( int i ) { return i * 2; } template <typename Range> void print_it( const Range & range ) { boost::copy( range, std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; } int main( ) { using boost::adaptors::reversed; using boost::adaptors::transformed; using boost::counting_range; using boost::phoenix::arg_names::_1; print_it( counting_range( 1, 5 ) ); print_it( counting_range( 1, 5 ) | reversed ); print_it( counting_range( 1, 5 ) | transformed( doubled ) ); print_it( counting_range( 1, 5 ) | reversed | transformed( doubled ) ); print_it( counting_range( 1, 5 ) | transformed( bind( doubled, _1 ) ) ); print_it( counting_range( 1, 5 ) | reversed | transformed( bind( doubled, _1 ) ) ); } Output is 1 2 3 4 4 3 2 1 2 4 6 8 8 6 4 2 2 4 6 8 -711713824 -711713824 -711713824 -711713824 Compiling with gcc-4.9.1, Boost 1.56 on Fedora 20 64-bit. Thx, Rob.

6 16

[filesystem] directory_iterator and filter in 1.56.0
by Braden McDaniel 10 Sep '14

10 Sep '14

This sort of thing worked in Boost 1.55.0: #include <boost/filesystem.hpp> #include <boost/range.hpp> #include <boost/range/adaptor/filtered.hpp> struct pred { bool operator()(const boost::filesystem::directory_entry & dirent) const { return true; } }; int main() { const auto dirent_range = boost::make_iterator_range(boost::filesystem::directory_iterator("/"), boost::filesystem::directory_iterator()); const auto filtered_dirent_range = boost::adaptors::filter(dirent_range, pred()); } Not so in 1.56.0 [output from Apple's clang 3.4]: boost/concept_check.hpp:210:9: error: no viable conversion from 'boost::single_pass_traversal_tag' to 'boost::forward_traversal_tag' Y y = x; ^ ~ The full error output is much more verbose and I can provide it if desired; but the above is the gist of the situation, as I understand it: directory_iterators are SinglePass iterators; filter operates on ForwardTraversal iterators; and the SinglePass iterator cannot be converted to the ForwardTraversal one. Is this situation deliberate or an unintended side effect? Is there some similarly succinct means of filtering a file/directory listing? -- Braden McDaniel <braden(a)endoframe.com>

1 0

Re: [Boost-users] [context] Compiling error with context and bind
by José 10 Sep '14

10 Sep '14

3 2

[context] Compiling error with context and bind
by José 09 Sep '14

09 Sep '14

2 1

[msm] extending msm::back::state_machine
by Manuel Schiller 09 Sep '14

09 Sep '14

Hi, I tried to enhance the backend of boost::msm by inheriting from boost::msm::back::state_machine. When doing so, I cannot access members of my subclass in the states. When compiling the attached example, I get this error message: *error: ‘class boost::msm::back::state_machine<fsm_, boost::parameter::void_, boost::parameter::void_, boost::parameter::void_, boost::parameter::void_>’ has no member named ‘test’* How can I "inject" extended_back_machine as the type being passed as "FSM" to the state? Bye Manuel #################################### template<typename FrontMachine> struct extended_back_machine : public boost::msm::back::state_machine<FrontMachine> { void test() { std::cout << "test" << std::endl; } }; struct fsm_ : public boost::msm::front::state_machine_def<fsm_> { struct State : public boost::msm::front::state<> { template <class Event,class FSM> void on_entry(Event const&, FSM& fsm) { fsm.test(); } }; typedef State initial_state; }; int main() { typedef extended_back_machine<fsm_> fsm; fsm m; m.start(); return 0; } ####################################

3 3

[boost][container][static_vector] Stack or heap?
by Aaron Levy 08 Sep '14

08 Sep '14

Does the boost::container::static_vector allocate its memory on the stack or heap. From what I could make of the code, it seems to allocate on the stack. What happens if the requested size exceeds the stack size limits? Aaron

2 1

[boost][assign][bimap] Assign support for bimap
by Aaron Levy 08 Sep '14

08 Sep '14

Are there any Boost.Assign overloads available for Boost.Bimap? Aaron

2 2

linking with Intel compiler to Boost libs compiled with Visual Studio
by Damien 05 Sep '14

05 Sep '14

Hi, I'm trying to link to Boost 1.56 libs that I built with VS2013. We compile with both Intel and VS. We build Boost with layout=tagged (e.g. boost_serialization-mt-gd.lib), and these link fine with VS2013. When linking with Intel 2015 the linker complains about a missing library, looking for the layout=versioned lib name (e.g. libboost_serialization-iw-mt-gd-1_56.lib). Even if you specify the library name directly on the link line, it still complains. I'm sure this is just an include or #define issue but I don't know where to look. If anyone can point me in the right direction I'd be grateful. Cheers, Damien

2 2

Testers required
by Antony Polukhin 05 Sep '14

05 Sep '14

Hi, There is a big need in testers that have access to exotic platforms(zArch, MIPS) and compilers (Cray, IBM xlc ...). Could you please run `b2` in `boost/libs/type_index/test` and report results. This will help to test Boost.TypeIndex library and other libraries that depend on `demangle.hpp` I'll appreciate any help. Thanks in advance! -- Best regards, Antony Polukhin

1 0

[graph] Vertex order and VertexList type changes boykov_kolmogorov_max_flow result
by Michael J Iatauro 04 Sep '14

04 Sep '14

In the code below, using listS to store vertices results in vertex instantiation order changing the amount of flow computed by boykov_kolmogorov_max_flow. As given, it computes a flow of 0. If I move the instantiation of "T-" to be before "t-" or switch the VertexList parameter of adjacency_list to vecS, it computes the correct flow of 1000. Stepping through the code, it looks like when the max_flow function iterates over vertices that are targets of out-edges from the source, the call to get(m_in_active_list_map, v) at boykov_kolmogorov_max_flow.hpp:528 returns true for the second vertex, preventing it from getting added to m_active_nodes. I tested this using g++ 4.4.7 and with Boost 1.55 and 1.56. Has anybody else seen anything like this? Code follows: #include <boost/graph/adjacency_list.hpp> #include <boost/graph/boykov_kolmogorov_max_flow.hpp> #include <boost/graph/properties.hpp> #include <boost/graph/graph_traits.hpp> #include <iostream> #include <limits> using namespace boost; typedef adjacency_list_traits<vecS, listS, directedS> Traits; typedef Traits::vertex_descriptor Vertex; typedef Traits::edge_descriptor Edge; typedef adjacency_list<vecS, listS, directedS, property<vertex_name_t, std::string, property<vertex_index_t, long, property<vertex_color_t, default_color_type, property<vertex_distance_t, long, property<vertex_predecessor_t, Edge > > > > >, property<edge_flow_t, double, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, Edge > > > > > Graph; void addEdge(Graph& g, const Vertex& source, const Vertex& target, const double capacity, const double reverseCapacity) { property_map<Graph, edge_reverse_t>::type rev = get(edge_reverse, g); Edge e1 = add_edge(source, target, g).first; Edge e2 = add_edge(target, source, g).first; put(edge_capacity, g, e1, capacity); put(edge_capacity, g, e2, reverseCapacity); rev[e1] = e2; rev[e2] = e1; } int main(void) { Graph g; property_map<Graph, vertex_name_t>::type nameMap = get(vertex_name, g); Vertex source = add_vertex(g); nameMap[source] = "source"; Vertex sink = add_vertex(g); nameMap[sink] = "sink"; Vertex tminus = add_vertex(g); nameMap[tminus] = "t-"; addEdge(g, source, tminus, 1, 0); Vertex Tminus = add_vertex(g); nameMap[Tminus] = "T-"; addEdge(g, source, Tminus, 1000, 0); Vertex Tplus = add_vertex(g); nameMap[Tplus] = "T+"; addEdge(g, Tplus, sink, 1000, 0); addEdge(g, Tplus, Tminus, 0, std::numeric_limits<int>::max()); double flow = boykov_kolmogorov_max_flow(g, source, sink); std::cout << flow << std::endl; return 0; } -- ------------------ Michael J. Iatauro Software Engineer QTS, Inc. NASA Ames Research Center Office: 650-604-0662 Mail stop: 269-2 P.O. Box 1 Moffett Field, CA 94035-0001

1 0

Batch job processing with Boost Spirit parser
by Michael Levine 04 Sep '14

04 Sep '14

I have been using Boost Sprit as a parser for a project that I have been working on lately. At this point, I have been trying to expand the software and, in doing so, have had the nagging feeling that there is something wrong with my overall design. In the best case, I am not making the best use of my tools, and in the worst case, I am concerned that the design/code is becoming overly brittle. As an aside, I don’t have a huge amount of programming experience with this type of application. A word of background / context : Essentially, the program performs batch ‘jobs’ which are specified in a text file (not dissimilar in that sense from a scheduler like Condor). Spirit parses these ‘Job Description’ files into ‘specification objects’ (my vocabulary) that are used with a builder pattern and factories to create the appropriate objects. I have some concerns about this which I will describe later. The job description (henceforth: JD) file should have 3 parts: 1. Data 2. Tools 3. Operations The Data section is just a list of data that is to be operated on. At this stage, this is just a vector of std::pair<std::string, std::string> containing an identifier and the path of the file. The ‘Tools’ and ‘Operations’ sections are likely composed of nested specifications (the resulting objects use either a decorator pattern or composite pattern – depending on the type of tool) – which was the main reason that I started using Spirit altogether. My question is really a request for some guidance – to better utilize the tools available: I have just received the requirement for section #3 (Operations), to be included in the JD file (previously it was assumed that this would be provided in a different manner). So – at this time, I have a working parser for the Data and Tools portions. I have concerns with the ‘Tools’ portion that I would like to correct and not duplicate in the ‘Operations’ section that I am to be working on next. At present, I am parsing the JD file mostly into strings, and vectors of boost::variant<int,double> -- the latter being a list of parameters in a completely arbitrarily imposed order. As I’ve previously mentioned, I have a few problems with this approach. - The parameters are required to be input in an arbitrary order. - Different ‘Tool’s and ‘Operation’s have different parameters that are required and/or optional. For the past weeks (I only work on this project on a very part-time basis), I have been going in circles trying to figure out a better way to do this. I have a strong suspicion that Fusion can be used for this. I am also concerned about over-complicating the design, but am weary of leaving the design too simplistic. I.e., I know that I can treat the parameters as a std::pair<std::string, boost::variant<int, double>> and then parse key-value pairs with a given delimiter. I am just not convinced that this is the best way to do this. I am able to use any Boost Library, and have no restrictions about compilers (I’m using a recent version of Clang, primarily, right now). The following is a selection of the data structures and Spirit grammar that I am using here: struct Tool_Spec; typedef std::vector<boost::variant<int, double> > Tool_Options_t; typedef std::vector<Tool_Spec > Children_Tool_t; typedef std::pair<std::string, std::string> Data_Spec; struct Job_Request { Data_Spec data_spec; Tool_Spec model_spec; Operation_Spec operation_spec; boost::optional<std::string> description; }; struct Tool_Spec{ std::string type; std::string data_designation; Tool_Options_t; options; Children_Tool_t children; boost::optional<std::string> designation; }; struct Operation_Spec{ /* Unknown at this time. Need help */ }; Datafile %= lit("@START") >> *Data_Description >> Tool_Description >> Operation_Description >> lit("@END") ; Data_Description %= lit('%') >> Datasource >> lit(';') ; Datasource = Designator >> lit(':') >> Designator ; Designator %= +(char_("0-9a-zA-Z/._") | char_('-') ); Comment_Designator %= +(char_("0-9a-zA-Z/._, ()") | char_('-')); Tool_Description %= Designator >> ':' >> ('@' >> Designator) >> '[' >> +Options >> ']' >> -('{' >> *Child_Tool >> '}') >> -qi::lexeme[Comment_Designator] >> ';' ; Child_Tool %= Designator >> ':' >> ('@' >> Designator) >> '[' >> +Options >> ']' >> -('{' >> *Child_Tool >> '}') >> -qi::lexeme[Comment_Designator] >> ';' ; Options %= (int_ | double_ ) % '|';

1 0

[graph] filtered graph and num_vertices
by Miklós Tóth 03 Sep '14

03 Sep '14

Hi All, I have a graph, and I use a filter like this. struct FilteredGraph : public boost::filtered_graph<SomeGraph, SomeFilter > { FilteredGraph(SomeGraph g) : boost::filtered_graph<SomeGraph, SomeFilter>(g, SomeFilter(g)) {} }; I want to use in this function. template <class Graph>void some_graph_function(const Graph& g) { const size_t vertex_num = boost::num_vertices(g); //... } Like this: FilteredGraph fg(g) some_graph_function(fg); And I get: > error: no matching function for call to 'num_vertices(const FilteredGraph&)' > const size_t vertex_num = boost::num_vertices(g); > ^ >From the boost 1.55 documentation: > The num_vertices <http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/filtered_graph.html#num…> and num_edges <http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/filtered_graph.html#num…> functions do not filter > before returning results, so they return the number of vertices or > edges in the underlying graph, unfiltered [2] <http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/filtered_graph.html#2>. So it should work. What am I missing? Regards, Miklós

1 0

Re: [Boost-users] [graph] Unique vertices using setS
by Nicholas Dahm 03 Sep '14

03 Sep '14

> On Tue, Sep 2, 2014 11:29 AM MDT Jeremiah Willcock wrote: > >> >> >>On Sun, Aug 31, 2014 10:53 PM MDT Nicholas Dahm wrote: >> >>>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: >>> >>>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) >>> >>>Not that I know of. >>> >>>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. >>> >>>Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. >>> >>>No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know >> >>Please look at https://github.com/wpm/Boost-Implicit-Graph-Example for a simple example. You only need to do the incident edge iterator and property parts from that example, and can skip the other iterator types. There is also an A*-specific example at https://github.com/wpm/Astar-Maze-Solver, but it stores more of the data explicitly and uses existing BGL graph types. >> >>-- Jeremiah Willcock >> > >There is also http://www.boost.org/doc/libs/1_56_0/libs/graph/example/knights-tour.cpp as an example, but you'll probably need the BGL book for its documentation. > >-- Jeremiah Willcock Ok I'm getting the hang of it now. Thanks for all your help Jeremiah :)

1 0

problem with asio signal_set and consecutive signals
by Lutz Schneider 02 Sep '14

02 Sep '14

Hi, I have a program and would like to stop it by sending SIGINT for writing some data to a file instead of exiting immediately. However, if the user of the program sends SIGINT again then the program should quit immediately and forget about writing data to a file. For portability reason I would like to use boost::asio for this purpose. My initial (simplified) approach (see below) did not work. Is this not possible or am I missing something? handler seems to be called only once (printing out the message) and the program always stops when the loop has reached the max iteration number. void handler( const boost::system::error_code& error, int signal_number) { if (!error) { static bool first = true; if(first){ std::cout << " A signal(SIGINT) occurred." << std::endl; // do something like writing data to a file first = false; }else{ std::cout << " A signal(SIGINT) occurred, exiting...." << std::endl; exit(0); } } } int main(){ // Construct a signal set registered for process termination. boost::asio::io_service io; boost::asio::signal_set signals(io, SIGINT); // Start an asynchronous wait for one of the signals to occur. signals.async_wait(handler); io.run(); size_t i; for(i=0;i<std::numeric_limits<size_t>::max();++i){ // time stepping loop, do some computations } std::cout << i << std::endl; return 0; } Cheers, LS

2 3

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 02 Sep '14

02 Sep '14

On Tue, Sep 2, 2014 11:29 AM MDT Jeremiah Willcock wrote: > > >On Sun, Aug 31, 2014 10:53 PM MDT Nicholas Dahm wrote: > >>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: >> >>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) >> >>Not that I know of. >> >>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. >> >>Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. >> >>No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know > >Please look at https://github.com/wpm/Boost-Implicit-Graph-Example for a simple example. You only need to do the incident edge iterator and property parts from that example, and can skip the other iterator types. There is also an A*-specific example at https://github.com/wpm/Astar-Maze-Solver, but it stores more of the data explicitly and uses existing BGL graph types. > >-- Jeremiah Willcock > There is also http://www.boost.org/doc/libs/1_56_0/libs/graph/example/knights-tour.cpp as an example, but you'll probably need the BGL book for its documentation. -- Jeremiah Willcock

1 0

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 02 Sep '14

02 Sep '14

On Sun, Aug 31, 2014 10:53 PM MDT Nicholas Dahm wrote: >>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: >> >>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) >> >>Not that I know of. >> >>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. >> >>Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. > >No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know Please look at https://github.com/wpm/Boost-Implicit-Graph-Example for a simple example. You only need to do the incident edge iterator and property parts from that example, and can skip the other iterator types. There is also an A*-specific example at https://github.com/wpm/Astar-Maze-Solver, but it stores more of the data explicitly and uses existing BGL graph types. -- Jeremiah Willcock

1 0

Very interesting problem with TCP sockets
by Igor Mironchik 02 Sep '14

02 Sep '14

Hi guys, I was trying to connect Qt TCP Socket with Boost Asio TCP socket. And what I found. Qt writes simple 12 bytes message to the Boost and in most situations Boost reads garbage. Even more Boost can crash. And my question is: who is so bad guy, Boost or Qt? You can find simple implementation of the problem in the attachment. Thanks. P.S. Problem is on Windows 7, on Linux or Mac OS I have no possibility to test...

2 2

Boost MPI Collective
by Nolen, Steven Douglas 02 Sep '14

02 Sep '14

In boost/mpi/collectives/reduce.hpp The template function specialization for reduce-ing a std::vector, should probably be modified. Ffrom template<typename T, typename Op> void reduce(const communicator & comm, std::vector<T> const & in_values, std::vector<T> & out_values, Op op, int root) { out_values.resize(in_values.size()); reduce(comm, &in_values.front(), in_values.size(), &out_values.front(), op, root); } To template<typename T, typename Op> void reduce(const communicator & comm, std::vector<T> const & in_values, std::vector<T> & out_values, Op op, int root) { if( comm.rank() == root ) out_values.resize(in_values.size()); reduce(comm, &in_values.front(), in_values.size(), &out_values.front(), op, root); } This will save an extraneous allocation on the non-root nodes. -steve

2 1

[MSM] eUML compilation fails with gcc and -std=c++11
by caligano 01 Sep '14

01 Sep '14

Hi, I tried to compile some of the eUML MSM samples (e.g. http://www.boost.org/doc/libs/1_56_0/libs/msm/doc/HTML/examples/SimpleTimer…) using gcc 4.8 and with C+11 support enabled. However, I always get errors like the following one: error: ‘BOOST_PP_REPEAT_FROM_TO_M_1’ has not been declared I did not find anything about C++11 being not supported by Boost MSM, so I would like to know if I am doing anything wrong? Bye Manuel

3 2

[spirit,units] Linker problem on msvs platform
by Johannes Brunen 01 Sep '14

01 Sep '14

Hello, I have created two little helper functions for parsing strings with respect to unit length values: OptLengthQuantityT parse_length_quantity(...) PairOptLengthQuantityT parse_dbl_length_quantity(...) My problem is that my implementation based on the spirit and units libraries does compile fine, but fails on linking on 32Bit Debug with the following error message: Quantity.obj : fatal error LNK1179: invalid or corrupt file: duplicate COMDAT '?value@?$result_@U?$member_variable@$$A6E?AUlength_quantity_t@Quantitie s@@XZP8?$length_quantity_grammer@V?$_String_const_iterator@DU?$char_trai ts@D@std@@V?$allocator@D@2@@std@@U?$expr@Uterminal@tag@tagns_@proto@boos t@@U?$term@U?$char_code@Uspace@tag@spirit@boost@@Uiso8859_1@char_encodin g@34@@tag@spirit@boost@@@argsns_@45@$0A@@exprns_@proto@boost@@@2@AE?AU12 @XZ@detail@phoenix@boost@@@?$is_mem_fun_pointer_select@$0A@@detail@boost @@2_NB' I'm working with the msvc 2010Sp1 compiler from microsoft on windows 7. I have tried to shorten the symbol names but I could not get it to work. Does anyone has experience with this kind of errors? Is there something wrong with the implementation of the two functions? You can find the implementation in the attached files. Best, Johannes

1 0

[Boost.Log] translate 3rd party log entries
by Olaf Peter 01 Sep '14

01 Sep '14

Hello, from 3rd party lib I have to integrate the logging message - incorporating into boost.log. But I run into the problem with scopes: main.cpp: In function 'int main(int, char**)': main.cpp:55:5: error: no matching function for call to 'boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const char [6], const char*&, int&)' main.cpp:55:5: note: candidates are: /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:88:5: note: boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const string_literal&, const string_literal&, unsigned int) /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:88:5: note: no known conversion for argument 2 from 'const char*' to 'const string_literal& {aka const boost::log::v2s_mt_posix::basic_string_literal<char>&}' /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:63:8: note: boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const boost::log::v2s_mt_posix::attributes::named_scope_entry&) /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:63:8: note: candidate expects 1 argument, 3 provided The problem rises on string_literal of __FILE__ entry. How can I get this working?? Thanks, Olaf

1 2

Trouble with compiling/linking the unit test library
by Christoff Kok 01 Sep '14

01 Sep '14

Hi, I am struggling to compile a simple test with the Unit test library. It seems to be a linker error when trying to link the unit_test_framework library. I have tried diffrerent options but to no avail. I have tried to link it with a visual studio library as well, but I am still receiving the same error. clang++.exe -o bin\Debug\QuickTest.exe obj\Debug\functions.o obj\Debug\functionsTest.o obj\Debug\maintest.o *C:\boost_1_55_0\stage\lib\libboost_unit_test_framework-mgw48-mt-1_55.a* obj\Debug\functionsTest.o: In function `_cxx_global_var_init2': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:4: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24auto_test_unit_registrarC1EPNS0_9test_caseEm' obj\Debug\functionsTest.o: In function `ZN8Multiply11test_methodEv': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to * `_imp___ZN5boost9unit_test15unit_test_log_t14set_checkpointENS0_13basic_cstringIKcEEjS4_' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultC1Eb' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to * `_imp___ZN5boost10test_tools9tt_detail10check_implERKNS0_16predicate_resultERKNS_9unit_test12lazy_ostreamENS5_13basic_cstringIKcEEjNS1_10tool_levelENS1_10check_typeEjz' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to* `_imp___ZN5boost10test_tools16predicate_resultD1Ev' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' obj\Debug\functionsTest.o: In function `_dtor__ZZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEvE8the_inst': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:38: *undefined reference to* `_imp___ZN5boost9unit_test15unit_test_log_tD1Ev' obj\Debug\functionsTest.o: In function `ZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEv': C:\boost_1_55_0\boost/test/utils/trivial_singleton.hpp:38: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_tC1Ev' obj\Debug\functionsTest.o: In function `ZN5boost9unit_test14make_test_caseERKNS0_9callback0INS0_9ut_detail6unusedEEENS0_13basic_cstringIKcEE': C:\boost_1_55_0\boost/test/unit_test_suite_impl.hpp:255: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24normalize_test_case_nameENS0_13basic_cstringIKcEE' C:\boost_1_55_0\boost/test/unit_test_suite_impl.hpp:255: undefined reference to `_imp___ZN5boost9unit_test9test_caseC1ENS0_13basic_cstringIKcEERKNS0_9callback0INS0_9ut_detail6unusedEEE' obj\Debug\maintest.o: In function `main': C:\boost_1_55_0\boost/test/unit_test.hpp:59: undefined reference to `_imp___ZN5boost9unit_test14unit_test_mainEPFbvEiPPc' obj\Debug\maintest.o: In function `_cxx_global_var_init2': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:5: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24auto_test_unit_registrarC1EPNS0_9test_caseEm' obj\Debug\maintest.o: In function `ZN29SimpleTestInMainTestingModule11test_methodEv': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_t14set_checkpointENS0_13basic_cstringIKcEEjS4_' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultC1Eb' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools9tt_detail10check_implERKNS0_16predicate_resultERKNS_9unit_test12lazy_ostreamENS5_13basic_cstringIKcEEjNS1_10tool_levelENS1_10check_typeEjz' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:8: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' obj\Debug\maintest.o: In function `_dtor__ZZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEvE8the_inst': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:38: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_tD1Ev' collect2.exe: error: ld returned 1 exit status clang++.exe: error: linker (via gcc) command failed with exit code 1 (use -v to see invocation) Kind Regards, Christoff

1 0

A* search on Implicit graph (search tree)
by Nicholas Dahm 01 Sep '14

01 Sep '14

Hi All, I'm trying to run an A* search using boost's astar_search, but I'm running into issues with 'const'. I'm trying to add the examine_vertex(my_vdesc_type &v, my_graph_type &g) function, but of course boost says that I need to make it const like examine_vertex(my_vdesc_type &v, const my_graph_type &g) However since I'm searching an implicit graph, I need to call add_vertex(g) within this function. But then I of course get an error because i'm trying to do add_vertex(const my_graph_type &g) which is invalid. I've read the example astar_maze.cpp which CLAIMS to be implicit but certainly doesn't appear to be. I've also seen the pdf at http://cs.krisbeevers.com/research/astar_bgl04.pdf which says you need to basically create non-const versions of a bunch of functions. Considering that http://www.boost.org/doc/libs/1_56_0/libs/graph/doc/astar_search.html says that "A* is particularly useful for searching implicit graphs", I'm assuming that boost ALREADY HAS some way of actually searching implicit graphs. Any ideas? cheers Nick

1 0

Re: [Boost-users] [graph] Unique vertices using setS
by Nicholas Dahm 01 Sep '14

01 Sep '14

>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: > >>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) > >Not that I know of. > >>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. > >Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know cheers Nick

1 0

Review Wizard Status Report for August 2014
by Ron Garcia 30 Aug '14

30 Aug '14

============================================== Review Wizard Status Report for August 2014 ============================================== News ==== 1. Fiber Accepted Provisionally. January 2014. 2. Align Accepted. April 2014. 3. TypeIndex Accepted. May 2014. 4. Convert Accepted. June 2014. 5. Boost 1.56 Released -- New Libraries: Align, TypeIndex Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been accepted to Boost, but have not yet been integrated into Boost Git: * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to Boost Git, but have not yet appeared in a release: * Convert - accepted June 2014; author: Vladimir Batov. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Fiber - accepted provisionally January 2014; author Oliver Kowalke. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot ubc dot ca" and "johnphillipsithica at gmail dot com" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Boost.Range Extensions * Nowide (M) * Array (M) * STL Extensions (M) * Countertree (M) * Process (M) * Asynchronous File I/O (M) * Application (M) * Edit Distance (M) * Mixin (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Countertree ----------- :Author: Francisco Jose Tapia :Review Manager: Needed :Download: https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip :Description: This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. COUNTERTREE This kind of trees have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. With unordered information we have a vector with the same speed inserting and deleting in any position (O(log N)). With ordered information, we have the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract them. SUBALLOCATOR The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator replace to the allocator in the allocation of equal size elements. It provides speed, return the unused memory and decrease the memory used by the program and improve the cache performance due to the data locality improvement ( 30% of improvement of speed respect the std::allocator with GCC 4.7) Process ------- :Author: Boris Schaeling :Review Manager: Needed :Download: http://www.highscore.de/boost/process0.5/process.zip :Description: Boost.Process is a library to manage system processes. It can be used to: * create child processes * setup streams for child processes * communicate with child processes through streams (synchronously or asynchronously) * wait for processes to exit (synchronously or asynchronously) * terminate processes Asynchronous File I/O --------------------- :Author: Niall Douglas and Paul Kirth :Review Manager: Needed :Download: https://github.com/BoostGSoC/boost.afio/archive/boost-peer-review.tar.gz :Description: Boost.AFIO is a linear scalable, batch, chainable, asynchronous closure execution engine with an almost wait free implementation extending Boost.ASIO and Boost.Thread specialised as a portable asynchronous file i/o implementation library. Implementation of this first version has been kept as simple as possible (~ 1000 active LOC) at the cost of some performance, though with a good compiler you can expect 25-50% of the performance of using raw Boost.ASIO. Application ----------- :Author: Renato Tegon Forti :Review Manager: Needed :Download: https://github.com/retf/Boost.Application :Documentation: http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/index.html :Description: Application provides an application environment, or start point to any people that want a basic infrastructure to build an system application on Windows or Unix Variants (e.g. Linux, MacOS). Application uses behaviours modeled using 'aspects' concept proposed by 'Vicente J. Botet Escriba', that allow easy extension and customization of library components. The application modes uses these components internally to achieve the user desirable behaviours. Application provide many useful ready-to-use features, e.g: * Run application as Windows Service; * Run application as UNIX/POSIX Daemon; * Plugin extension system; * Process(executable) Single instance Instantiation support; * Application SIGNAL/Callbacks customization; * Windows Service Setup feature; * And many others. Edit Distance ------------- :Author: Erik Erlandson :Review Manager: Needed :Download: https://github.com/erikerlandson/algorithm/tree/edit_distance/sequence :Description: The edit distance is the length of the shortest (or least-cost) edit script from one sequence to another, where an edit script is defined as a sequence of insertion, deletion and (optionally) substitution operations. The function implementing the edit distance is named edit_distance. This function will return the edit distance between two sequences, where sequences may be any valid range object supporting forward iteration. The edit_distance function will also, if requested, return the edit script. Mixin ----- :Author: Borislav Stanimirov :Download: https://github.com/iboB/boost.mixin :Documentation: http://ibob.github.io/boost.mixin/ :Review Manager: Needed :Description: Boost.Mixin is a library that allows the composition and modifications of polymorphic types at run time. Types and objects are constructed out of building blocks called mixins. The library uses the type boost::mixin::object as a placeholder, whose instances can be extended with existing classes (mixins), thus providing a particular instance with the functionality of all those types. Accessing the newly formed type's interface is made through messages: stand-alone functions generated by the library, which can be thought of as methods. This is given while also having full abstraction between the interface and the definition of types. An existing feature in another language similar to Boost.Mixin and also an inspiration for the library are the mixins in Ruby. The library also has similarities with the pattern entity-component-system. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

2 1

[msm] forward declaration of state machine with non-default constructor
by caligano 29 Aug '14

29 Aug '14

Hi, I want to forward declare a state machine which has a non-default constructor. I found this example here: http://stackoverflow.com/a/10922799/678093 But I can't call the non-default constructor of the state machine. I either get - "error: call of overloaded ‘fsm(int)’ is ambiguous" (if inheriting constructors using C++11) or - "error: no matching function for call to ‘wrapper::fsm::fsm(int)" What can I do about it? Thanks, Manuel Example: ------------------------ // wrapper.h #include <boost/msm/front/state_machine_def.hpp> #include <boost/msm/back/state_machine.hpp> #include <boost/shared_ptr.hpp> class wrapper { wrapper(); struct fsm; boost::shared_ptr<fsm> player_fsm; }; ------------------------ // wrapper.cpp #include "wrapper.h" struct player_ : public boost::msm::front::state_machine_def<player_> { player_(int some_value) {} }; struct wrapper::fsm : public boost::msm::back::state_machine<player_> { using boost::msm::back::state_machine<player_>::state_machine; }; wrapper::wrapper() : player_fsm(new fsm(100)) { } ------------------------

3 2

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 29 Aug '14

29 Aug '14

On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: >Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) Not that I know of. >My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. -- Jeremiah Willcock

1 0

Cannot use Boost.Croutines with range based for
by Mueller-Roemer, Johannes Sebastian 29 Aug '14

29 Aug '14

Hi, I am (again) having issues with the Boost.Coroutines library. Aside from yet another new API, the coroutines no longer work with range based for. Even though the examples include range based for! With the following code (taken directly from the documentation and added the includes and main): #include <boost/coroutine/asymmetric_coroutine.hpp> #include <iostream> int main() { boost::coroutines::asymmetric_coroutine<int>::pull_type source( [&](boost::coroutines::asymmetric_coroutine<int>::push_type& sink){ int first=1, second=1; sink(first); sink(second); for(int i=0;i<8;++i){ int third=first+second; first=second; second=third; sink(third); } } ); for(auto i : source) std::cout << i << " "; } I get this error: D:\projects\combinators\coro_test.cpp: In function 'int main()': D:\projects\combinators\coro_test.cpp:20:15: error: 'begin' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2255:1: note: 'std::begin' begin( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:18:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' D:\projects\combinators\coro_test.cpp:20:15: error: 'end' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2260:1: note: 'std::end' end( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:19:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' mingw32-make[2]: *** [CMakeFiles/coro-test.dir/coro_test.cpp.obj] Error 1 mingw32-make[1]: *** [CMakeFiles/coro-test.dir/all] Error 2 mingw32-make: *** [all] Error 2 For completeness sake: I am using MinGW-w64 with GCC 4.9.1 and the -std=c++11 flag Regards, Johannes S. Mueller-Roemer -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de | www.igd.fraunhofer.de

5 20

[filesystem] : How to get a parametrized basic_string from filesystem::path
by Vincent R. 28 Aug '14

28 Aug '14

Hi, I am trying to modify an existing code to keep the possibility to use string or wstring, so I have changed the definition to parametrize it as shown below (Path inherits from path): template <class TChar> bool GetFileList(const std::basic_string<TChar>& i_strBaseDir, std::vector<std::basic_string<TChar> >& o_FileList) { boost::system::error_code ec; Path thePath(i_strBaseDir); boost::filesystem::directory_iterator iter(thePath, ec); if (! ec) { boost::filesystem::directory_iterator iter_end; for (; iter != iter_end; ++ iter) { boost::system::error_code ec; // This is to avoid an exception in case of any error if(!boost::filesystem::is_directory(iter->path(), ec)) //find file and not directory { std::basic_string<TChar> strFile = iter->path().????); // HOW TO DO IT o_FileList.push_back(strFile); } } } return (o_FileList.size() != 0); } My problem is with the following line : std::basic_string<TChar> strFile = iter->path().??????; I have solved like that (without testing it) : template <typename CharT, typename T> std::basic_string<CharT> string_cast(const T& r) { std::basic_ostringstream<CharT> stream; stream.imbue(std::locale::classic()); stream << r; return stream.str(); } std::basic_string<TChar> strFile = string_cast<TChar>(iter->path()); but since it uses some stream we might loose some performance. I have found another string_cast here : http://codereview.stackexchange.com/questions/1205/c-string-cast-template-f… that might be better in terms of performance. Do you have some other suggestion ? Wouldn't be interesting to add a boost::string_cast that would allow to convert from templated methods from/to string/wstring ? Thanks

1 0

[graph] Unique vertices using setS
by Nicholas Dahm 27 Aug '14

27 Aug '14

Hi All, I'm trying to create a graph with unique vertices using setS for vertices, but it doesn't seem to be working. To test it I've made a simple example simply using int's for the vertex properties: typedef boost::adjacency_list<boost::setS, boost::setS, boost::undirectedS, int, int> gtype; typedef boost::graph_traits<gtype>::vertex_descriptor gvd; gtype gr; int v1 = 4; gvd vd1 = add_vertex(v1, gr); gvd vd2 = add_vertex(v1, gr); printf("vd1: %ld, gr[vd1]: %d\n", vd1, gr[vd1]); printf("vd2: %ld, gr[vd2]: %d\n", vd2, gr[vd2]); printf("num_vertices: %d\n", num_vertices(gr)); Output: vd1: 17473168, gr[vd1]: 4 vd2: 17473248, gr[vd2]: 4 num_vertices: 2 So my graph has two vertices represented by the int 4, suggesting it's not a set! Any idea what I'm missing? Is the set for vertex descriptors, but the vertices themselves stored elsewhere? cheers Nick

1 1

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 27 Aug '14

27 Aug '14

On Wed, Aug 27, 2014 2:47 AM EDT Nicholas Dahm wrote: >Hi All, > >I'm trying to create a graph with unique vertices using setS for vertices, but it doesn't seem to be working. > >To test it I've made a simple example simply using int's for the vertex properties: > > typedef boost::adjacency_list<boost::setS, boost::setS, boost::undirectedS, int, int> gtype; > typedef boost::graph_traits<gtype>::vertex_descriptor gvd; > > gtype gr; > int v1 = 4; > gvd vd1 = add_vertex(v1, gr); > gvd vd2 = add_vertex(v1, gr); > printf("vd1: %ld, gr[vd1]: %d\n", vd1, gr[vd1]); > printf("vd2: %ld, gr[vd2]: %d\n", vd2, gr[vd2]); > printf("num_vertices: %d\n", num_vertices(gr)); > >Output: > > vd1: 17473168, gr[vd1]: 4 > vd2: 17473248, gr[vd2]: 4 > num_vertices: 2 > >So my graph has two vertices represented by the int 4, suggesting it's not a set! Any idea what I'm missing? Is the set for vertex descriptors, but the vertices themselves stored elsewhere? There is a difference between vertex descriptors and properties. There are no requirements that property values are unique for any graph type; those are up to you to set however you want. If gr[vd1] and gr[vd2] had the same address, that would be a problem. However, you initialized both of those property slots with the same value 4, and the graph type has no issue with you doing that. One reason for this is that the same graph can have multiple vertex and edge properties, and so you might want some of them to be unique and some not, so the graph type would not know where to enforce uniqueness. -- Jeremiah Willcock > >cheers > >Nick >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[geometry] Buffer (with strategy) to offset polygons
by Olivier Tournaire 27 Aug '14

27 Aug '14

Dear all, I have used successfully the buffering algorithm to offset a shapefile of 2D polygons. However, there are 4 polygons (amongst nearly 4000) in my SHP does are not successfully processed. They do not have topology or orientation errors. I use GDAL 1.9 to read the SHP, boost 1.56 precompiled binaries from sourceforge on a 64bit windows 7. If someone is willing to have a look at the problem, I can share the files and the code I use. Here is a quick overview: typedef double coordinate_type; typedef boost::geometry::model::d2::point_xy<coordinate_type> point_xy_type; typedef boost::geometry::model::polygon<point_xy_type> polygon_type; boost::geometry::strategy::buffer::end_flat end_strategy; boost::geometry::strategy::buffer::point_square point_strategy; boost::geometry::strategy::buffer::side_straight side_strategy; boost::geometry::strategy::buffer::distance_symmetric<coordinate_type> distance_strategy(buffer_distance); boost::geometry::strategy::buffer::join_miter join_strategy(buffer_distance); polygon_type p; boost::geometry::model::multi_polygon<polygon_type> result; // Build a polygon_type from OGRPolygon OGRLinearRing* exteriorRing = polygon->getExteriorRing(); for(int i=0;i<exteriorRing->getNumPoints();++i) { OGRPoint pt; exteriorRing->getPoint(i,&pt); p.outer().push_back( point_xy_type(pt.getX(), pt.getY()) ); } for(int i=0;i<polygon->getNumInteriorRings();++i) { OGRLinearRing* interiorRing = polygon->getInteriorRing(i); polygon_type::ring_type ring; for(int j=0;j<interiorRing->getNumPoints();++j) { OGRPoint pt; interiorRing->getPoint(j,&pt); ring.push_back( point_xy_type(pt.getX(), pt.getY()) ); } p.inners().push_back(ring); } boost::geometry::buffer(p, result, distance_strategy, side_strategy, join_strategy, end_strategy, point_strategy); if(result.size() == 0) { int indexID = feature->GetFieldIndex("ID"); cout << "No result build for polygon with ID " << feature->GetFieldAsString(indexID) << endl; } else { typedef boost::geometry::strategy::distance::pythagoras<coordinate_type> pythagoras_distance_strategy; typedef boost::geometry::strategy::distance::projected_point<coordinate_type, pythagoras_distance_strategy> projected_point_strategy; boost::geometry::strategy::simplify::douglas_peucker<point_xy_type, projected_point_strategy> dp; OGRPolygon poly; for(size_t i=0;i<result.size();++i) { polygon_type result_i = result[i]; polygon_type result_i_simplified; boost::geometry::simplify(result_i, result_i_simplified, 0.1, dp); { OGRLinearRing ring; for(size_t j=0;j<result_i_simplified.outer().size();++j) ring.addPoint( result_i_simplified.outer()[j].x(), result_i_simplified.outer()[j].y() ); poly.addRing(&ring); } { OGRLinearRing ring; for(size_t j=0;j<result_i_simplified.inners().size();++j) { for(size_t k=0;k<result_i_simplified.inners()[j].size();++k) { ring.addPoint( result_i_simplified.inners()[j][k].x(), result_i_simplified.inners()[j][k].y() ); } poly.addRing(&ring); } } } Note that I use a simplification algorithm after buffering to remove colinear points. Hope you could help. Best regards, Olivier

3 9

Re: [Boost-users] Cannot use Boost.Croutines with range based for
by Mueller-Roemer, Johannes Sebastian 27 Aug '14

27 Aug '14

Adding the following namespace boost { namespace coroutines { using boost::begin; using boost::end; } } solves the problem, however this would seem to indicate that the provided begin and end are in the wrong namespace and therefore do not take part in ADL. Should I report this as a bug? Doesn't seem to be intended. -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de | www.igd.fraunhofer.de From: Mueller-Roemer, Johannes Sebastian Sent: Wednesday, August 27, 2014 12:57 To: 'boost-users(a)lists.boost.org' Subject: Cannot use Boost.Croutines with range based for Hi, I am (again) having issues with the Boost.Coroutines library. Aside from yet another new API, the coroutines no longer work with range based for. Even though the examples include range based for! With the following code (taken directly from the documentation and added the includes and main): #include <boost/coroutine/asymmetric_coroutine.hpp> #include <iostream> int main() { boost::coroutines::asymmetric_coroutine<int>::pull_type source( [&](boost::coroutines::asymmetric_coroutine<int>::push_type& sink){ int first=1, second=1; sink(first); sink(second); for(int i=0;i<8;++i){ int third=first+second; first=second; second=third; sink(third); } } ); for(auto i : source) std::cout << i << " "; } I get this error: D:\projects\combinators\coro_test.cpp: In function 'int main()': D:\projects\combinators\coro_test.cpp:20:15: error: 'begin' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2255:1: note: 'std::begin' begin( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:18:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' D:\projects\combinators\coro_test.cpp:20:15: error: 'end' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2260:1: note: 'std::end' end( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:19:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' mingw32-make[2]: *** [CMakeFiles/coro-test.dir/coro_test.cpp.obj] Error 1 mingw32-make[1]: *** [CMakeFiles/coro-test.dir/all] Error 2 mingw32-make: *** [all] Error 2 For completeness sake: I am using MinGW-w64 with GCC 4.9.1 and the -std=c++11 flag Regards, Johannes S. Mueller-Roemer -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de<mailto:johannes.mueller-roemer@igd.fraunhofer.de> | www.igd.fraunhofer.de<http://www.igd.fraunhofer.de>

1 0

[Smart Pointer] Reference counting when you don't want to manage memory [Honeywell Internal]
by Hickman, Steve (AdvTech) 26 Aug '14

26 Aug '14

Classification: Honeywell Internal Smart pointers (as in http://www.boost.org/doc/libs/1_56_0/libs/smart_ptr/smart_ptr.htm ) assume that the action you want to perform when the count goes to zero is to free the memory pointed to. That isn't the only use for reference counting. Why doesn't the Smart Pointer library decouple the reference counting from the action to be taken and provide a generic reference counting mechanism that will call an arbitrary function when the count goes to zero? The default can be "delete" to provide the expected memory management capability but it would provide a robust mechanism for those who need other capabilities. Reviewing the <boost/shared_ptr.hpp> code, it appears this decoupling already exists - through the use of boost::checked_delete and boost::checked_deleter (<boost/checked_delete.hpp>). It just doesn't appear to be documented. Why not document this so others know how to use it? Steve Hickman System Architect, Flight Deck of the Future 480-236-8367 ============================================================================================================================================================================================================ This message classified as Honeywell Internal by Hickman, Steve (AdvTech) on Tuesday, August 26, 2014 at 12:35:32 PM. The above classification labels are in accordance with the Honeywell Corporate Classification Policy. The information contained in this electronic message is confidential and intended only for the use of the individual/entity named above, and the information may be privileged. If you, the reader of this message, are not the intended recipient or an employee or agent responsible to deliver this message to the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please immediately notify the sender and delete the original message. ============================================================================================================================================================================================================

3 3