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

[multi_index] recursive declaration of MIC with a value which contains references of its kind
by Nick Stokes 26 Jan '15

26 Jan '15

I have a value type (Foo) which is supposed to contain references to some multi_index_container of its type, like so: struct Foo { int property1; int property2; FooMIC* other; // this (the pointer value) may or may not be indexed upon }; typedef multi_index_container< Foo, indexed_by < sequenced<> , ordered_unique< member<Foo, int, &Foo::property1> > , ... >> FooMIC; Due to recursive nature of this, I wasn't able to figure out how do declare such a thing (other than unsafely using void* references in Foo). Any ideas? Thanks many, Nick

2 2

Re: [Boost-users] [boost] [Review] Boost.Endian mini-review
by Beman Dawes 26 Jan '15

26 Jan '15

On Sun, Jan 25, 2015 at 6:12 PM, Jason Newton <nevion(a)gmail.com> wrote: > On Sun, Jan 25, 2015 at 8:21 AM, Beman Dawes <bdawes(a)acm.org> wrote: > >> On Sat, Jan 24, 2015 at 2:25 AM, Jason Newton <nevion(a)gmail.com> wrote: >> > I think the only thing that I have no interest in using - a kind way of >> > saying its probably unneeded bloat IMO is the arithmetic types. I prefer >> > native types and using conversion functions. But maybe they could >> improve >> > my code - its something I toss back and forth a little and haven't >> > attempted embracing. >> >> Because even the endian buffer and arithmetic types that appear most >> expensive generate only short sequences of code, the optimizing >> compilers often generate exactly the same instructions regardless of >> endian approach. On Intel machines, that often distills down to a >> single bswap instruction since the value is already in a register. >> >> That isn't always true, so you do need to measure performance of >> various approaches in the context of your actual application. But if >> use of the buffer or arithmetic types would otherwise improve your >> code, please don't reject them without actually testing performance >> first. >> > > Allow me to clarify: I meant code bloat, not speed. Sorry - your original post was clear, but I misinterpreted. I have not systematically measured code bloat. Maybe I can do that at least for some common use cases. Thanks, --Beman

1 0

Re: [Boost-users] [boost] [Review] Boost.Endian mini-review
by Beman Dawes 25 Jan '15

25 Jan '15

On Sat, Jan 24, 2015 at 2:25 AM, Jason Newton <nevion(a)gmail.com> wrote: ... > As a long time user of the Boost.Endian library (applying patches to the > distribution I maintain), I am happy to see it finally up for uh... > mini-review. Hoping to see it get to formal review and included... further > hoping it makes it into the next C++ standard! The library went through formal review in 2011, so will go into Boost as soon as the mini-review is over. And, yes, I do plan to propose it to the standards committee. > It is ready in my opinion. I've seen it go through some topical changes > over the years but the only thing I've used from it are the conversion > functions which have been great for implementing proper io in the range of > network socket io / serial with various protocols and stored data from > varies devices/sensors) if a specification enforces byte order. It > fullfills my needs and always did fairly well on performance with gcc/clang. Depending on what version you have been using, the performance may now be even better. > I think the only thing that I have no interest in using - a kind way of > saying its probably unneeded bloat IMO is the arithmetic types. I prefer > native types and using conversion functions. But maybe they could improve > my code - its something I toss back and forth a little and haven't > attempted embracing. Because even the endian buffer and arithmetic types that appear most expensive generate only short sequences of code, the optimizing compilers often generate exactly the same instructions regardless of endian approach. On Intel machines, that often distills down to a single bswap instruction since the value is already in a register. That isn't always true, so you do need to measure performance of various approaches in the context of your actual application. But if use of the buffer or arithmetic types would otherwise improve your code, please don't reject them without actually testing performance first. > > This library should not be looked at as fulfilling an uncommon need - and > should even be part of future C++ standards because the usual > macro/functions (e.g. htons) in the in arpa/inet.h are widely used outside > of inet related code (see above examples) and have the types encoded in the > name making them not easily usable/composable in contrast to something > template based which the library offers. Further IEEE 754 support - > especially for double floating point types. The library definitely fills > that gap and has for years IMO. Thanks for the kind words! --Beman

1 0

[thread] await hangs when using boost::promise/future
by TONGARI J 25 Jan '15

25 Jan '15

Hi, The sample code is here: https://gist.github.com/jamboree/3b8716ad1922749e77ae The boost::future adaption code is adapted from N4286. Tested with VS2015 preview. If std::promise is passed, the code works fine. Any clue why it hangs if boost::promise is passed? Thanks.

3 10

[Graph] source vertex colour at start of BFS or DFS
by Jeremy Murphy 24 Jan '15

24 Jan '15

Hi, I'm wondering, why do the BFS and DFS algorithms not inspect the colour of the source vertices given to them? If a source vertex is already black, shouldn't the search effectively be a no-op? Currently the source vertex is 'discovered' and coloured grey regardless of its previous colour. I know it might seem weird to pass a black vertex as the source, but I guess I see it as similar to passing an empty range to an algorithm: it's valid but nothing happens. Thanks, cheers. Jeremy

1 0

Re: [Boost-users] unit test BOOST_CHECK_CLOSE absolute
by Dave Gomboc 24 Jan '15

24 Jan '15

Gennadiy Rozental <rogeeff <at> gmail.com> writes: > > Paul A. Bristow <pbristow <at> hetp.u-net.com> writes: > > FWIW I've also wanted the *values* in a message (rather > > than just a test fail). > > I do not follow this comment. Which message and which tool do you refer to? Perhaps he meant that he'd like the error message when a BOOST_CHECK_CLOSE fails to show the value that was rejected, and also the range of values that would have been accepted? Dave

2 1

[Review] Boost.Endian mini-review
by Joel FALCOU 23 Jan '15

23 Jan '15

The mini-review of Boost.Endian starts today and runs through Sunday, February 1. The library repository is available on GitHub at https://github.com/boostorg/endian The docs for the library can be viewed online at https://boostorg.github.io/endian/ The objective of the mini-review is to verify that the issues raised during the formal review have been addressed. Those issues are documented at https://boostorg.github.io/endian/mini_review_topics.html which also describes the resolution of each issue. Comments and suggestions unrelated to the mini-review issues are also welcome, but the key question the review manager needs your opinion on is this: Is the library ready to be added to Boost releases? -- Joel Falcou, Endian Review Manager

1 0

Review Wizard Status Report for January 2015
by Ron Garcia 23 Jan '15

23 Jan '15

============================================== Review Wizard Status Report for January 2015 ============================================== News ==== 1. Boost 1.56 Released November 2014. New Libraries: none 2. Sort Accepted. November 2014. 3. Compute Accepted. December 2014. 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. * Sort - accepted November 2014: author: . * Compute - accepted December 2014: author: . 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: * Endian - accepted provisionally September 2011; author Beman Dawes. * 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) * Dependency Injection (M) * DLL (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. 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) DLL --- :Author: Antony Polukhin :Download: https://github.com/apolukhin/Boost.DLL :Documentation: http://apolukhin.github.io/Boost.DLL/index.html :Review Manager: Needed :Description: This library was designed to simplify plugin development using C++ in a portable cross-platform manner. Library provides a portable across platforms way to: * load libraries * import any native functions and variables * make alias names for C++ mangled functions and symbols * query libraries for sections and exported symbols * self loading and self querying * getting program and module location by exported symbol Libraries under development =========================== See The Boost Library Incubator Project at http://blincubator.com for discussion of libraries currently under development.

2 1

problems building Boost-1.55.0 in 32b machines with c++11
by Patricia Mendez Lorenzo 22 Jan '15

22 Jan '15

Dear Boost experts, since a while I am trying to compile Boost from the source in a 32b linux machine with c++11 enabled. The compiler version used is gcc4.8.1 This is performed through cmake as follows: --> Configuration: bootstrap.sh --with-python=<path to /bin/python> --with-toolset=gcc --> Build: /b2 -j4 variant=release --layout=versioned --debug-configuration --toolset=gcc --user-config=<path to a user-config.jam> Where user-config.jam contains the following information: using gcc : : : <linkflags>-m32 <compileflags>-m32 -std=gnu++0x also tested it with -std=c++11 And finally installed which basically contains the same options as the build adding --prefix=<installation dir> The libraries built following this procedure does not seem to have been created with c++11. If I compare the signatures of the same library build in 64 against 32 the result are In 64: nm --defined-only --demangle libboost_filesystem-gcc48-mt-1_55.so | grep copy_file boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::copy_option, boost::system::error_code*) In 32, the same produces: boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::copy_option::enum_type, boost::system::error_code*) The difference seems to come from wrong i686 build options. Could you please help me to find the good options to build these libs in 32b with c+=11 enabled? Thank you so much,

2 2

Question about subgraph isomorphism function
by Shouwei Li 20 Jan '15

20 Jan '15

Hi Guys, I am using boost graph library in my research project about graph theory. One object is testing whether graph G1 has a subgraph isomorphic to another graph G2. I only care about the result, "yes" or "no", and don't expected to find out a isomorphism pattern. I use the library function vf2_subgraph_iso(), but the third parameter is a callback function which will print out the isomorphic pattern all the time. Is there any way to omit this parameter or eliminate the output pattern. Here is my code snippet: ----------------------------------------------------- vf2_print_callback<Graph, Graph> callback(C4, g); if (!vf2_subgraph_iso(C4, g, callback) { // something; } else { // something; } __________________________________ Thanks for you attention! Best Regards! Shouwei

1 0