October 2014 - Boost-users - lists.boost.org

[make_shared] How to use boost::make_shared with more than 9 arguments
by dariomt＠gmail.com 10 Oct '14

10 Oct '14

I could patch my local copy with several more overloads (I need up to 12 parameters) but, is there a better way? I cannot change the constructor of the class to group parameters (as recommended in StackOverflow). Of course this is for C++03 Regards

2 1

Re: [Boost-users] Flyweight: wrapping shared_ptr
by Joaquin M Lopez Munoz 10 Oct '14

10 Oct '14

> De: Boost-users [mailto:boost-users-bounces@lists.boost.org] > En nombre de Akim Demaille > Enviado el: martes, 07 de octubre de 2014 18:27 > Para: Boost Users List > Asunto: Re: [Boost-users] Flyweight: wrapping shared_ptr > > Le 7 oct. 2014 à 18:18, Joaquín Mª López Muñoz <joaquin(a)tid.es> a écrit : > > > An alternative would be to use some sort of cloning smart pointer to > > spare the reference count, but it's not clear to me this would be > > faster than > > shared_ptr: > > > > * element exists: shared_ptr creation is slower than clone_ptr > > creation > > * element does not exist: shared_ptr creation and copy is probably > > faster than clone_ptr creation and cloning. > > Yes, indeed. A slightly smarter approach involves a cloning class that accepts a const Base& and does only clone on copy, thus avoiding dynamic memory allocation when the element already exists. This can be nicely wrapped up as follows: template<typename Base> class poly_holder { public: poly_holder(const Base& x):p(&x),dlt(false){} poly_holder(const poly_holder& x):p(x.p->clone()),dlt(true){} poly_holder& operator=(const poly_holder& x) { Base* q=x.p->clone(); if(dlt)delete p; p=q; dlt=true; return *this; } ~poly_holder(){if(dlt)delete p;} operator const Base&()const {return *p;} private: const Base* p; bool dlt; }; template<typename Base> class poly_flyweight:public boost::flyweight<poly_holder<Base>> { public: using super=boost::flyweight<poly_holder<Base>>; using super::super; const Base& operator*() const{return base();} const Base* operator->()const{return &base();} private: const Base& base()const{return this->get();} }; template<typename Base> std::size_t hash_value(const poly_flyweight<Base>& x) { return boost::hash<const Base*>()(&*x); } template<typename Base> bool operator==( const poly_flyweight<Base>& l,const poly_flyweight<Base>& r) { return static_cast<boost::flyweight<poly_holder<Base>>>(l)== static_cast<boost::flyweight<poly_holder<Base>>>(r); } template<typename Base> bool operator!=( const poly_flyweight<Base>& l,const poly_flyweight<Base>& r) { return !(l==r); } I've rewritten your test case to take advantage of this poly_flyweight thing, cleaning up some unnecessary hash and operator== overloads along the way and without resorting to the intermediate Exp_ type; see: http://coliru.stacked-crooked.com/a/76e87531b65d44f9 > Is there anyway Flyweight could have supported the operator-> natively? > It seems that with some SFINAE under the hood, it would work, don't you think? Yep, that would be possible, the only reason I didn't do it is to not clutter the interface. Also, some std classes such as (C++17) std::optional implement operator* differently, without the extra dereference required by smart pointer semantics. Joaquín M López Muñoz Telefónica

3 20

Boost.Geometry, probable bug in point_on_surface
by Petr Doubrava 10 Oct '14

10 Oct '14

#include <boost/geometry.hpp> #include <boost/geometry/geometries/point_xy.hpp> #include <boost/geometry/geometries/polygon.hpp> void test_point_on_surface() { typedef boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> Point; boost::geometry::model::polygon<Point> poly; boost::geometry::read_wkt("POLYGON((1074699.93 703064.65, 1074702.10 703054.62, 1074704.53 703061.40, 1074703.90 703064.58, 1074699.93 703064.65))",poly); boost::geometry::correct(poly); Point point; boost::geometry::point_on_surface(poly,point); //computed point isn't on the surface of polygon //[0] 1074839.1013086310 double //[1] 703154.77900308778 double bool res = boost::geometry::within(point,poly); // res is false }

2 2

[property_tree] Failure with Boost 1.56
by beet 10 Oct '14

10 Oct '14

Dear all, with the release of Boost 1.56, on Ubuntu 14.04 (g++ 4.8.2, 64 bit), code like the following suddenly fails to compile: pt::xml_writer_settings<char> settings('\t', 1); pt::write_xml(someFileName, ptr_out, std::locale(), settings); "pt" is obviously an alias for boost::property_tree. The error message I'm getting is /opt/boost156/include/boost/property_tree/detail/xml_parser_writer_settings.hpp:38:35: error: 'char' is not a class, struct, or union type typedef typename Str::value_type Ch; I can see the following possibly relevant change in property_tree: In Boost 1.55, from xml_parser.hpp: ----------------------------------- template<typename Ptree> void write_xml( const std::string & , const Ptree & , const std::locale & = std::locale() , const xml_writer_settings<typename Ptree::key_type::value_type >& = xml_writer_settings<typename Ptree::key_type::value_type >() ); In Boost 1.56, same header: --------------------------- template<typename Ptree> void write_xml( const std::string & , const Ptree & , const std::locale & = std::locale() , const xml_writer_settings<typename Ptree::key_type > & = xml_writer_settings<typename Ptree::key_type >() ); So xml_writer_settings is now given a Ptree::key_type instead of a Ptree::key_type::value_type which I assume is the reason for the above error. Is there a portable way to specify the type of indention character in write_xml ? Best Regards, Beet

2 1

[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