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

Windows 10 and VC14, fixing C2117 error when using Asio.
by Andrew Maclean 21 May '16

21 May '16

If you find that when using Asio in Windows 10 with the Windows 10 SDK and Visual Studio 2015 you get lots of C2177 errors in winnt.h and sdkdkver.h then this should fix it: Essentially, just add: #define WINVER 0x0A00 #define _WIN32_WINNT 0x0A00 before any header that includes SDKDDKVer.h either directly or indirectly. If using CMake, then in the CMakeLists.txt file just add these lines: if(WIN32) add_definitions(-DWINVER=0x0A00) add_definitions(-D_WIN32_WINNT=0x0A00) endif() The fix is documented at https://msdn.microsoft.com/en-us/library/6sehtctf.aspx I hope this helps others. Regards Andrew -- ___________________________________________ Andrew J. P. Maclean ___________________________________________

1 0

[test] Standalone use with multiple translation units?
by Adam Nielsen 20 May '16

20 May '16

Hi all, I am currently using Boost Test for my test code, however it is always an extreme headache trying to get Boost available on the target platforms I'm using. At the moment due to some environment restrictions it is just not possible to use a recent version of Boost, and since the Test library broke backwards compatibility with 1.59, my code will no longer compile on versions earlier than 1.59. So I am looking to see whether I can avoid the need to compile the full Boost, and just pull in the bits that I need. The Boost Test docs say that the library can be used in single-header mode, however this only works when there is one translation unit. Since my tests are spread across dozens of files, I don't think this will work for me. Is there any way to use this single-header mode, and flag one file as the "primary" one, and others as extras, so that you can use single-header mode across multiple translation units? This would remove the need to do battle with getting the Boost libraries installed on various platforms, which would make it much easier and allow me to spend more time on my code, and less time on writing build scripts. Many thanks, Adam.

2 2

[boost::compute] [OS X 10.11.5] [GeForce GT 750M] Segmentation fault
by Prashant 20 May '16

20 May '16

Hi, Example code to sort a vector on GPU (GeForce GT 750M) generates SEGV. However, it runs fine on Iris Pro (Intel(R) Core(TM) i7-4850HQ CPU). Having said that, it works as long as size of vector being sorted is small(<2 million). The code throws an exception if the size of the vector is less 9 million. Exception: boost/1_61_0/include/boost/compute/command_queue.hpp(453): Throw in function boost::compute::event boost::compute::command_queue::enqueue_write_buffer(const boost::compute::buffer &, size_t, size_t, const void *, const boost::compute::wait_list &) Dynamic exception type: boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector <boost::compute::opencl_error> > std::exception::what: Invalid Value Another observation: if the size of vector is 50 million the sorting works fine, though the timings are worse than Iris Pro. Regards, Prashant ----------------------------Cut here------------------------------------- #include <iostream> #include <vector> #include <algorithm> #include <boost/foreach.hpp> #include <boost/compute/core.hpp> #include <boost/compute/platform.hpp> #include <boost/compute/algorithm.hpp> #include <boost/compute/container/vector.hpp> #include <boost/compute/functional/math.hpp> #include <boost/compute/types/builtin.hpp> #include <boost/compute/function.hpp> #include <boost/chrono/include.hpp> #include <boost/exception/all.hpp> namespace compute = boost::compute; int main(int argc, char* argv[]) { if (argc != 2) { std::cout << "Usage: " << argv[0] << " <size> " << std::endl; return 0; } // generate random data on the host std::vector<float> host_vector(atoi(argv[1])); std::generate(host_vector.begin(), host_vector.end(), rand); std::cout << "===============CPU==================\n"; for (size_t k=0; k<5; k++) { std::vector<float> host_copy_vector(host_vector); auto start = std::chrono::high_resolution_clock::now(); std::sort(host_copy_vector.begin(), host_copy_vector.end()); auto duration = std::chrono::duration_cast<std::chrono::milliseconds> (std::chrono::high_resolution_clock::now() - start); std::cout << "time: iteration ("<< k << ") : " << duration.count() << " ms" << std::endl; } std::vector<compute::platform> platforms = compute::system::platforms(); for(size_t i = 0; i < platforms.size(); i++){ const compute::platform &platform = platforms[i]; std::cout << "Platform '" << platform.name() << "'" << std::endl; std::vector<compute::device> devices = platform.devices(); for(size_t j = 0; j < devices.size(); j++){ const compute::device &device = devices[j]; std::string type; if(device.type() & compute::device::gpu) type = "GPU Device"; else if(device.type() & compute::device::cpu) type = "CPU Device"; else if(device.type() & compute::device::accelerator) type = "Accelerator Device"; else type = "Unknown Device"; if (type != "GPU Device") { std::cout << "Ignoring non GPU devices.\n"; continue; } std::cout << "====\n"; std::cout << " " << type << ": " << device.name() << std::endl; std::cout << "====\n"; compute::context context(device); compute::command_queue queue(context, device); for (size_t k=0; k<5; k++) { compute::vector<float> device_vector(host_vector.size(), context); // copy data from the host to the device compute::copy( host_vector.begin(), host_vector.end(), device_vector.begin(), queue ); auto start = std::chrono::high_resolution_clock::now(); try { compute::sort(device_vector.begin(), device_vector.end(), queue); } catch (boost::exception & e) { std::cerr << diagnostic_information(e); break; } auto duration = std::chrono::duration_cast<std::chrono::milliseconds> (std::chrono::high_resolution_clock::now() - start); std::cout << "time: iteration ("<< k << ") : " << duration.count() << " ms" << std::endl; } std::cout << "====\n"; } } return 0; }

2 2

Boost 1.61.0 has been released
by Rene Rivera 19 May '16

19 May '16

Release 1.61.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains four new libraries and numerous enhancements and bug fixes for existing libraries. New Libraries * Compute: Parallel/GPU-computing library, from Kyle Lutz. * DLL: Library for comfortable work with DLL and DSO, from Renato Tegon Forti and Antony Polukhin * Hana: A modern C++ metaprogramming library, from Louis Dionne. * Metaparse: A library for generating compile time parsers parsing embedded DSL code as part of the C++ compilation process, from Abel Sinkovics. For details, including download links, see http://www.boost.org/users/news/version_1.61.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.61.0/ Tom Kent has made pre-built windows binaries, and they are available at: https://sourceforge.net/projects/boost/files/boost-binaries/1.61.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

5 8

DMARC and mailman
by James Sharpe 19 May '16

19 May '16

In June 2016 gmail is going to be changing its DMARC policy to reject any unaligned mail. This means that we will be seeing any mailing list responses from a gmail.com address to be considered spam by any mail server that enforces DMARC. For a while now yahoo.com has had this policy turned on which has meant that yahoo.com addresses have been considered spam. Mailman has released a workaround in version 2.1.18: https://www.mail-archive.com/mailman-users@python.org/msg64098.html The boost mailing list is currently on mailman 2.1.15. I'd strongly suggest that this should be updated as a matter of urgency else we'll find a lot of the conversations on this list will end up in the spam folder... Regards, James

1 0

[boost::python] cannot concatenate 'str' and 'property' objects
by sergei nazarenko 19 May '16

19 May '16

Hello! I have just simple question. python code: a = A() bla = "lala" + a.pp *Traceback (most recent call last):TypeError: cannot concatenate 'str' and 'property' objects* Why it is not work? How make it is work? boost c++ code: #include <boost/python/module.hpp> #include <boost/python/def.hpp> #include <boost/python/class.hpp> #include <boost/python/init.hpp> class A { public: std::string pp; A(): pp("babla") {}; }; using namespace boost::python; BOOST_PYTHON_MODULE (test1) { class_<A> ("A") .def(py::init<>()) .add_property ("pp", &A::pp) ; } Thanks, Sergiy

1 0

Documentation for Boost Range
by Christian Aichinger 19 May '16

19 May '16

Boost Range is a cool library, but it's sometimes hard to see how to actually use it: which headers to include, how to call it, what the return types are. To improve this situation, I wrote full, self-contained code examples for each function in Boost Range. They are available at: https://greek0.net/boost-range The examples also include links to the official docs and the into the library's source code, as well as a list of headers that give access to a specific function. I hope it's useful for other people as well. If you have any ideas for improvement, please let me know. Kind regards, Chris

6 13

Blocking sockets on Windows
by William Riancho 18 May '16

18 May '16

Hello all, I try to implement a simple http server with blocking sockets on Windows. Basically, I have a simple server that just write data to a socket when a network connection occurs before exit. The problem is that the last "socket.send" as no effect if I don't delay the process exit. Writing to this socket is supposed to block until all the data as been written. I have tried to use the completion condition of write, to use the non_blocking method of the socket. I still get the same problem. Note that the problem doesn't occur on Linux. Here is the code: ``` #include <boost/asio.hpp> int main(int argc, char *argv[]) { char *address = "0.0.0.0"; char *port = "8180"; boost::asio::io_service io_service; boost::asio::ip::tcp::acceptor acceptor(io_service); boost::asio::ip::tcp::resolver resolver(io_service); boost::asio::ip::tcp::resolver::query query(address, port); boost::asio::ip::tcp::endpoint endpoint = *resolver.resolve(query); acceptor.open(endpoint.protocol()); acceptor.bind(endpoint); acceptor.listen(); boost::asio::ip::tcp::socket sock(io_service); acceptor.accept(sock); std::string body("Hello, World!"); sock.send(boost::asio::buffer(std::string("HTTP/1.1 200 OK\r\n"))); sock.send(boost::asio::buffer(std::string("Content-Length: ") + std::to_string(body.size()) + "\r\n\r\n")); sock.send(boost::asio::buffer(body)); Sleep(1000); // The body would not be sent without this return 0; } ```

2 1

Review Wizard Report for May 2016
by Ronald Garcia 18 May '16

18 May '16

============================================== Review Wizard Status Report for May 2016 ============================================== News ==== 1. Boost 1.58 Released April 2015. New Libraries: Endian, Sort 2. Metaparse Library Accepted 3. Hana Library Accepted 4. DLL Library Accepted 5. Http Library Rejected 6. Boost 1.59 Released August 2015. New Libraries: Coroutine2, Convert 7. AFIO Library Reviewed 8. Fiber Library Conditionally Accepted 9. Boost 1.60 Released December 2015. New Libraries: Variadic Macro Data 10. Quaternions, Vectors, Matrices Accepted 11. Fit Library Rejected 11. Boost 1.61 Released May 2016. New Libraries: Compute, DLL, Metaparse, Hana 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 reviewed and await reports from their review managers: * AFIO - reviewed August 2015; review manager: Ahmed Charles. The following libraries have been accepted to Boost, but have not yet been integrated into Boost Git: * Contract - accepted September 2012; author: Lorenzo Caminiti. * Quaternions,Vectors,Matrices - accepted December 2015; author: Emil Dotchevski The following libraries have been accepted and submitted to Boost Git, but have not yet appeared in a release: * none The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * none 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) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Boost.Range Extensions * Nowide (M) * Array (M) * STL Extensions (M) * Countertree (M) * Process (M) * Application (M) * Edit Distance (M) * Mixin (M) * Dependency Injection (M) * Segmented Tree * Fiber ``(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. 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) 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 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. Dependency Injection -------------------- :Author: :Download: https://github.com/krzysztof-jusiak/di :Documentation: http://krzysztof-jusiak.github.io/di/boost/libs/di/doc/html :Incubator: http://rrsd.com/blincubator.com/bi_library/di-dependency-injection/?gform_p… :Review Manager: Needed :Description: Boost.DI is a dependency injection library improving manual dependency injection by simplifying object instantiation with automatic dependencies injection. Using Boost.DI has many advantages over manual dependency injection. * Reduce boilerplate code (No factories, no objects creation in specific order) * Reduce cost of maintenance effort (Constructor signature change won't affect di configuration) * Reduce testing effort * Give better control of what and how is created (Policies, Providers) * Give better understanding about objects hierarchy (UML Dumper) Segmented Tree -------------- :Author: Chris Clearwater :Download: http://rrsd.com/blincubator.com/bi_library/segmentedtreeseq-2/?gform_post_i… :Repository: http://github.com/det/segmented_tree :Documentation: https://det.github.io/segmented_tree :Review Manager: Glen Fernandes :Description: SegmentedTreeSeq is a sequence data structure like vector and deque that supports efficient random access insert and erase. It is implemented using B+Trees and has an emphasis on speed and a low memory overhead. Fiber ----- :Author: Oliver Kowalke :Download: https://github.com/olk/boost-fiber :Documentation: http://olk.github.io/libs/fiber/doc/html/ :Review Manager: Nat Goodspeed :Description: Boost.Fit is a header-only C++11/C++14 library that provides utilities for functions and function objects. Libraries under development =========================== See The Boost Library Incubator Project at http://blincubator.com for discussion of libraries currently under development.

3 2

Memory deallocation concerning boost::bind, boost::asio and shared_ptr
by Norman Kradepohl 17 May '16

17 May '16

Hi there, my code is allocating memory and never freeing it, even though it should (at least in my opinion). The header looks like this: typedef boost::asio::ssl::stream<boost::asio::ip::tcp::socket> sslSocket_t; class Object { boost::asio::io_service ioService_; boost::asio::ip::tcp::acceptor acceptor_; boost::asio::ssl::context context_; void functionOne(); void functionTwo(shared_ptr<sslSocket_t>& sslSocket, const boost::system::error_code& error) } And my source like this: void Object::functionOne() { for (int i = 0; i < 10; i++) { shared_ptr<sslSocket_t> sslSocket(new sslSocket_t(ioService_, context_)); acceptor_.async_accept(sslSocket->lowest_layer(), boost::bind(&Object::functionTwo, this, sslSocket, boost::asio::placeholders::error)); } acceptor_.cancel(); boost::asio::io_service::work work(ioService_); ioService_.run(); } void functionTwo(shared_ptr<sslSocket_t>& sslSocket, const boost::system::error_code& err) { // Do nothing } So when i call *Object.functionOne()*, memory is getting allocated to the *Object.ioService_* object, in order to be able to call the bound asynchronous method. Then after the loop, all pending asynchronous actions on the acceptor are getting canceled. The appropriate handler is getting invoked as soon as *Object.ioService_.run()* is called (i've been testing that). BUT for some reason, the allocated memory does not get freed. I'm stuck on this problem for a while now, any hint or help would be really appreciated. Btw.: I'm working on debian and looking at "/proc/self/status" -> "VmRSS" to whatch the used memory.

6 14