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

Question on Posix timezone string
by Mats Webjörn/WIKAB 10 Mar '19

10 Mar '19

I'm using Boost 1.66 and use the following code to get a Posix string to set my uCLinux TZ environment variable to get a local time from an UTC time #include <boost/date_time/local_time/tz_database.hpp> #include <boost/date_time/local_time/local_time.hpp> tz_database tz_db; tz_db.load_from_file("./date_time_zonespec.csv"); time_zone_ptr nyc = tz_db.time_zone_from_region("Europe/Stockholm"); auto s = nyc->to_posix_string(); // "CET+01CEST+01,M3.5.0/02:00,M10.5.0/03:00" setenv("TZ", s.c_str(), 1); The odd thing is that my localtime becomes incorrect, and is actually 1 hr wrong on the opposite side of UTC. But, when I read https://www.gnu.org/software/libc/manual/html_node/TZ-Variable.html it says "The offset specifies the time value you must add to the local time to get a Coordinated Universal Time value". Not add to UTC time, which seems like the Boost Posix string assumes !!!!! Which explains why 16:00 UTC give 15:00 CET instead of 17:00 which is the correct value, when using localtime_r(). Am I missing something fundamentally, or what? Regards Mats Webjörn Webjörn IngenjörsKonsult AB Solhemsbackarna 75A SE-163 56 SPÅNGA Sweden

3 9

[Release] Boost 1.70.0 Beta 1 Release Candidate 2
by Marshall Clow 09 Mar '19

09 Mar '19

A new release candidates for the first 1.70.0 beta release are now available at: https://dl.bintray.com/boostorg/beta/1.70.0.beta1.rc2/source/ Changes since the last RC: * The Jamfile for Boost.Predef has been updated to allow running the tests from /status. Thanks to mike.dev(a)gmx.de for the report, and to Rene for the fix. The release notes are not yet available. The SHA256 checksums are as follows: 26dba8156ad08041c6da52c84a2654aefda292180afe3546a9a74dda0dfb3781 ./boost_1_70_0_b1_rc2.7z ee794d98429bc2bfae054f2fab6fde53ea95f7c5967d8b267e57c894a4d46e57 ./boost_1_70_0_b1_rc2.tar.bz2 bca5f189d87b26ab903838dee2fd4c54e9043bd35d27b8923cdef42651ae7261 ./boost_1_70_0_b1_rc2.tar.gz 6c8f3af4e64d3a04a3d3a5e98499d2f6bb460ad82c1f33ff7da800b5ab182b0b ./boost_1_70_0_b1_rc2.zip As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. -- The Boost Release Managers

1 0

SSL handshake error "The file handle supplied is not valid"
by Osman Zakir 09 Mar '19

09 Mar '19

@chris@kohlhoff.com<mailto:chris@kohlhoff.com> I also opened an issue about this on GitHub here: https://github.com/chriskohlhoff/asio/issues/376 and I tried to make sure to provide all of the necessary information. Except I've just now updated the line numbers in my .cpp file to document the errors meaning that now the error I have reads: " Lines 576 and 577: handshake: The file handle supplied is not valid " Aside from that and the fact that I changed the datatype of "doc_root" in main and do_session to std::string, it's the same. Source code is here: https://github.com/DragonOsman/currency_converter . If I should put all of the info I have in the issue opened on GitHub here as well, please let me know and I'll do it.

1 0

[release] Boost 1.70.0 Beta 1 Release Candidate 1
by Marshall Clow 09 Mar '19

09 Mar '19

The release candidates for the first 1.70.0 beta release are now available at: https://dl.bintray.com/boostorg/beta/1.70.0.beta.1.rc1/source/ The release notes are not yet available. The SHA256 checksums are as follows: a7c570d6307d05dc8d45a3b4c69a0afdcba2b22eac0c4da4d496559f53db7b89 ./boost_1_70_0_b1_rc1.7z 4b91b9a203cf12f6001cf39de83c7cc005fbc5390e2b4b2fc29ce7b19c0537a7 ./boost_1_70_0_b1_rc1.tar.bz2 460dd6499bba9df04c6bfa219b26097bad803b8758304ba45f2fc291aa42c96e ./boost_1_70_0_b1_rc1.tar.gz f209c9a086ed2c7882a0bc8755792f436eb141eaeb8c823ed57295ca9ce25b93 ./boost_1_70_0_b1_rc1.zip As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. -- The Boost Release Managers

3 6

[boost::filesystem::path] removing components of a path
by Sean Farrow 08 Mar '19

08 Mar '19

Hi all, I'm revisiting boost::filesystem::path after not using it for a while and wondered whether there is a way to remove parts of a path deeper than a specific directory? By way of an example, assume I have the following path declared: boost::filesystem::path path ="d:\\test1\\test2\\test3.txt" what I want to do is determine whether test2 exists as part of the path and if it does remove everything after and including the found part of the path, so in this case \\test2\\test3.txt<file://test2/test3.txt> would be removed. I could do it by converting the path to a string, but wondered whether boost::filesystem could do this natively in some way. Any help appreciated. Kind regards Sean.

3 4

[Release 1.70] Master branch is now closed for the beta
by Marshall Clow 07 Mar '19

07 Mar '19

Except with explicit permission by a release manager. Do whatever you want on develop, just don't change master. We'll re-open master after the beta. As always, check the calendar at https://www.boost.org/development 6-Mar: Boost 1.70.0 closed for all changes 13-Mar: Boost 1.70.0 beta; master branch re-opened 2-Aug: Release closed for all changes, except by permission of a release manager. 3-Apr: Boost 1.70.0 closed for all changes 10-Apr: Boost 1.70.0 release -- The release managers

1 0

Using domain-based SSL certificate with Boost.Beast
by Osman Zakir 05 Mar '19

05 Mar '19

I looked at this example server certificate in the Boost.Beast repository: https://github.com/boostorg/beast/blob/develop/example/common/server_certif… . I have a free SSL certificate that I got for my Dynamic DNS subdomain name which doesn't have DH parameters but does have a certificate chain and a private key. I don't know what to put for ctx.set_options or ctx.set_password_callback. I tried asking at Let's Encrypt as well: https://community.letsencrypt.org/t/how-to-secure-dynamic-dns/87816/19 . I decided to ask here because they said they can't advise me on how to do it with Boost. I don't want to try a reverse proxy. My current web server code can be found here: https://github.com/DragonOsman/currency_converter/blob/master/currency_conv… . [https://avatars0.githubusercontent.com/u/18173932?s=400&v=4]<https://github.com/DragonOsman/currency_converter/blob/master/currency_conv…> currency_converter/currency_converter.cpp at master · DragonOsman/currency_converter · GitHub<https://github.com/DragonOsman/currency_converter/blob/master/currency_conv…> Application for Computer Science course. Contribute to DragonOsman/currency_converter development by creating an account on GitHub. github.com [https://discourse-cdn-sjc1.com/letsencrypt/uploads/default/original/3X/c/a/…]<https://community.letsencrypt.org/t/how-to-secure-dynamic-dns/87816/19> How to secure Dynamic DNS - Help - Let's Encrypt Community Support<https://community.letsencrypt.org/t/how-to-secure-dynamic-dns/87816/19> The acme.sh certs are generally in a domain folder where the acme.sh script lives (something like ~/.acme.sh/example.com). You don’t likely need to generate a new one. community.letsencrypt.org [https://avatars3.githubusercontent.com/u/3170529?s=400&v=4]<https://github.com/boostorg/beast/blob/develop/example/common/server_certif…> boostorg/beast<https://github.com/boostorg/beast/blob/develop/example/common/server_certif…> HTTP and WebSocket built on Boost.Asio in C++11. Contribute to boostorg/beast development by creating an account on GitHub. github.com

1 0

[MPL][MP11] Return value of at_c for out of range index
by Mateusz Loskot 05 Mar '19

05 Mar '19

Hi, While porting some code from MPL to MP11, the latter helped to find some bugs in the ported code [1] I looked closer at those and found 'behavioural' differences between MPL and MP11 when accessing sequences with index value that is out of range. Could anyone help me to understand the following? 1. Why this compiles? using R = at_c<range_c<int, 0, 1>, 100>::type; Tested in C++11 using GCC, clang, MSVC from VS2017/2019 2. Why this compiles in GCC and clang, but fails with MSVC? using V = at_c<vector3_c<unsigned, 1, 2, 3>, 100>::type::type; 3. For GCC and clang, why this compiles static_assert(std::is_same<R, integral_c<int, 100>>::value, ""); but this fails? static_assert(std::is_same<V, integral_c<unsigned int, 100>>::value, ""); Don't vector_c and range_c yield equivalent sequences? By the way, MP11's mp_at_c yield void, as expected, there also no ::type or ::value member, so diagnostics is clearer. [1] https://github.com/boostorg/gil/issues/249 Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 2

Installing multiple versions of Boost libraries on Linux: Ubuntu & Debian.
by Stephen Gray 05 Mar '19

05 Mar '19

Please could someone advise how to install multiple releases of the Boost libraries on a Linux (Ubuntu & Debian) system and set the system paths to permit switching between them; so that a compiler refers to the desired version and the relevant runtime components are available to an application; e.g. the .so file for boost serialization. Thanks.

1 0

Spatial search with boost r tree
by Bozo Vazic 01 Mar '19

01 Mar '19

Hi all, I'm trying to create a boost r tree with packing algorithm that will store 2D or 3D geometric points. This will be applied in side my peridynamic software for what we call "family search". Family search is basically a simple spatial search where each point of the peridynamic mesh (cloud of geometric points) needs to find all points inside it's horizon (horizon is for 2D a circle with a specific radius and for 3D it's a sphere with a specific radius). What I've found so far were examples for distance search using a random point (not the point that is a r-tree member). I did a distance and index check using bg::index::satisfies by passing a method that checks if the index is different and is distance smaller than radius. Also I use within(box) to constrain my search, but I'm not sure that is the correct way to use r tree spatial search for the point that is a member of the same r tree. Because as far as I understand the point in the r-tree knows has the information of boxes in which it is contained, so wouldn't there be a way to query the tree member using using only the horizon value? The reason why I'm asking this question is because I need to define most optimal spatial search so that query times don't take to long. This is important as I can have several million points that need to be constantly queried. Thnx in advance for all the help. Best Regads Bozo Here is my code for 2D search of only one point #include "stdafx.h" #include <boost/function_output_iterator.hpp> #include <boost/geometry/index/rtree.hpp> #include <boost/geometry.hpp> #include <boost/geometry/geometries/point.hpp> #include <boost/geometry/geometries/box.hpp> #include <vector> #include <iostream> namespace bg = boost::geometry; namespace bgi = bg::index; typedef bg::model::point <double, 2, bg::cs::cartesian> point; typedef std::pair<point, std::size_t> pointI; typedef bg::model::box<point> box; typedef std::pair<point, unsigned> value; bool CheckIndexAndDist(pointI i, pointI j, size_t dist); std::vector<uint64_t> res; struct StoreDataCallback { template <typename Value> void operator()(Value const& v) { res.push_back(v.second); } }; int _tmain(int argc, _TCHAR* argv[]) { std::vector<point> contourCenters; // has some value std::vector<pointI> cloud; double length = 2000; double width = 2000; double dX = length/1000.0; double horizon = 3.015*dX; for(int i = 0; i < length; i++) { for(int j = 0; j < width; j++) { point p; p.set<0>((-1.0 * length / 2.0) + dX + j * dX); p.set<1>((-1.0 * width / 2.0) + dX + i * dX); contourCenters.push_back(p); } } size_t id_gen = 0; std::transform( contourCenters.begin(), contourCenters.end(), back_inserter(cloud), [&](point const& p) { return std::make_pair(p, id_gen++); } ); bgi::rtree<pointI, bgi::quadratic<16> > rtree(cloud); // spatial search box query_box(point(cloud[10].first.get<0>() - 3.2*dX, cloud[10].first.get<1>() - 3.2*dX),point(cloud[10].first.get<0>() + 3.2*dX, cloud[10].first.get<1>() + 3.2*dX)); StoreDataCallback callback; rtree.query( bgi::within(query_box) && bgi::satisfies([&](value const& v) {return CheckIndexAndDist(v, cloud[10],3.015*dX);}), boost::make_function_output_iterator(callback)); return 0; } bool CheckIndexAndDist(pointI i, pointI j, size_t dist) { if( i.second != j.second && (bg::distance(i.first, j.first) < dist)) return true; else return false; }

2 3