- Boost - lists.preview.boost.org

[Filesystem] Hidden overloaded virtual function
by Ben Pope 20 Dec '13

20 Dec '13

./boost/detail/utf8_codecvt_facet.hpp:171:17: warning: 'boost::filesystem::detail::utf8_codecvt_facet::do_length' hides overloaded virtual function [-Woverloaded-virtual] virtual int do_length( ^ /usr/include/c++/v1/__locale:952:17: note: hidden overloaded virtual function 'std::__1::codecvt<wchar_t, char, __mbstate_t>::do_length' declared here: type mismatch at 1st parameter ('state_type &' (aka '__mbstate_t &') vs 'const std::mbstate_t &' (aka 'const __mbstate_t &')) virtual int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const; ^ I suspect that's not intentional. Ben

4 5

Review Wizard Report for December 2013
by Ron Garcia 20 Dec '13

20 Dec '13

============================================== Review Wizard Status Report for December 2013 ============================================== News ==== 1. Boost 1.54.0 Released. New Libraries: Log, TTI, Type Erasure. 2. Boost 1.55.0 Released. New Libraries: Predef. 3. Type Index Accepted Provisionally. November 2013. 4. Boost repository moves to Git and GitHub. December 2013. 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 submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to SVN, 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: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Type Index - accepted provisionally November 2013; author: Antony Polukhin 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) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Range Extensions * Nowide (M) * Array (M) * STL Extensions (M) * Countertree (M) * Process (M) * Asynchronous File I/O (M) * Application (M) * 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. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. 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. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. 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. Fiber ----- :Author: Oliver Kowalke :Review Manager: Nat Goodspeed :Download: https://github.com/olk/boost-fiber :Documentation: http://ok73.funpic.de/boost/libs/fiber/doc/html/index.html :Description: Fiber provides a framework for micro-/userland-threads (fibers) scheduled cooperatively. The API contains classes and functions to manage and synchronize fibers similar to boost.thread.' Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

2 3

[git] Why are we using Github (was: The any library does not pull cleanly because of a forced update on develop and master)
by Cox, Michael 19 Dec '13

19 Dec '13

On Tue, Dec 10, 2013 at 7:40 AM, Dave Abrahams <dave(a)boostpro.com> wrote: > "Cox, Michael" <mhcox(a)bluezoosoftware.com> writes: > > > I tried to update my local repositories to the latest changes in each > > submodule: > > > > git pull; git submodule foreach --recursive git pull > > > > When it got to the libs/any submodule, I got the following message: > > > > remote: Counting objects: 27, done. > > remote: Compressing objects: 100% (2/2), done. > > remote: Total 6 (delta 2), reused 6 (delta 2) > > Unpacking objects: 100% (6/6), done. > > From https://github.com/boostorg/any > > + 3f0b981...e3e5da6 develop -> origin/develop (forced update) > > + 38039b3...d35b2d6 master -> origin/master (forced update) > > * [new tag] 20131209-develop -> 20131209-develop > > * [new tag] 20131209-master -> 20131209-master > > > > and my editor popped up with a merge commit message to edit. I think > > that's because the develop and master branches were force updated, > > re-writing history in develop and master. > > If there is not already a policy in place to prevent history rewriting > in public branches, we should have one. And if there's a GitHub > mechanism for denying the privilege, it should be enabled. > There may be a policy, but as far as I can tell, Github has no easy interface to allow you to enforce it, i.e. set the receive.denyNonFastForwards=true and receive.denyDeletes=true (for all branches) or branch.name>.mergeoptions=--ff-only (setting up fast forward only per branch). Maybe via plugin (like I assume the trac plugin is being used to integrate boost's trac web-site)? >From the git-config man page: receive.denyNonFastForwards If set to true, git-receive-pack will deny a ref update which is not a fast-forward. Use this to prevent such an update via a push, even if that push is forced. This configuration variable is set when initializing a shared repository. receive.denyDeletes If set to true, git-receive-pack will deny a ref update that deletes the ref. Use this to prevent such a ref deletion via a push. branch.<name>.mergeoptions Sets default options for merging into branch <name>. The syntax and supported options are the same as those of git-merge(1), but option values containing whitespace characters are currently not supported. The last one I'm not sure if it works on the server side. It may be a client side only configuration item. I have seen examples of adding hooks to enforce such restrictions. Which brings me to a question I've been wanting to get answered: why was Github chosen in the first place? I know it's the 900-lb gorilla in public git repository hosts, but I think Bitbucket allows so much more flexibility in configuring your repositories: - Individual branches and wild-card refs can be configured with who is allowed to commit (which can be a group). - Individual branches can be designated as not deletable. - Individual branches can be designated as not rewritable. See Take control with branch restrictions<http://blog.bitbucket.org/2013/09/16/take-control-with-branch-restrictions/> for more info. If we are still in the acceptance phase of the git conversion (based on some of the comments in the thread this was taken from), maybe we should reconsider Github? What were the advantages of Github vs. other public repositories like Bitbucket? Michael > > -Dave > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost >

14 25

Getting Started Testing with Linux virtual machine on Windows host
by Beman Dawes 19 Dec '13

19 Dec '13

I'm primarily a Windows developer, but like to be able to test locally on both Windows and Linux so I don't have to wait for Boost's regression tests to cycle. For several years I've done that on a Linux virtual machine. I just rebuilt my virtual machine and kept a log so I could share how it is done. Such a virtual machine is free and is easy enough that most Boost library maintainers who use Windows could do the setup in an afternoon, most of which is just downloading files, and can be overlapped with other work. See https://svn.boost.org/trac/boost/wiki/StartTestingLinuxOnWindows Corrections or other comments appreciated. Enjoy! --Beman PS: The process would work in the other direction too, but it would require a Windows license (I.E. not free) and I don't have experience going in that direction so can't write about it.

10 21

Gsoc Participation
by Pulkit Mendiratta 19 Dec '13

19 Dec '13

Is Boost sending an application for participation in GSOC-2014? -- Cheers, Pulkit Mendiratta

6 5

[git] Submodule's readme and logo
by Adam Wulkiewicz 19 Dec '13

19 Dec '13

Hi, In Boost.Geometry we recently added a readme file (currently only in develop branch http://github.com/boostorg/geometry/tree/develop) and some basic wiki. From one of the discussions (by Mateusz Loskot): What I'd suggest is to create README.{md|markdown} file in root directory of geometry repo: have big heading on top [LOGO] Boost.Geometry The readme could also explain briefly what's around, what is include folder, what is example, test folder. and link to the main documentation and wiki pages. GitHub has somewhat 'trained' people there always is a README file (seehttp://tom.preston-werner.com/2010/08/23/readme-driven-development.html) so many users expect to use it as a first contact with a project. I believe having those files in all submodules would have a positive impact on the GitHub community and the users. Furthermore the style of those files could be more or less unified. Therefore I've prepared semi-consistent set of logos for some of the libraries: http://github.com/awulkiew/boost-logos. I decided to achieve the consistency by using the Boost logo as a base. Let me know what do you think about it. And don't hesitate to write about your ideas or propose changes. Regards, Adam

11 46

C++11 variant of the gcc toolset?
by Peter Dimov 19 Dec '13

19 Dec '13

Currently, when I want to test under g++ in C++11 mode, I use b2 toolset=gcc cxxflags=-std=c++11 This works, but (a) prevents me from combining this with other toolsets, (b) prevents me from testing both 03 and 11 at once, and (c) boost.build doesn't treat the two modes of the gcc toolset as distinct and uses the same directory for both. Am I missing something simple, or if not, shouldn't we have a separate gcc11 toolset that is exactly the same as the gcc toolset, but with -std=c++11 applied?

4 7

[Container] Priority Deque - Refinement
by Nathaniel McClatchey 19 Dec '13

19 Dec '13

Hi. I've recently made a double-ended priority queue (priority deque) publicly available at https://github.com/nmcclatchey/Priority-Deque , with the intent of submitting it to Boost (more specifically, I wish to make it part of Boost.Container). I would appreciate any comments, discussion, or refinements. Goals of the project: * Provide an efficient double-ended priority queue, with interface similar to std::priority_queue. * Keep requirements to a minimum. In particular, require nothing except what is already required by std::priority_queue. * Make it fast. Performance should be competitive with std::priority_queue. How goals are met: * The priority deque is implemented as a single class template, mimicking std::priority_queue * The interface of priority_deque is a strict superset of the interface of std::priority_queue. New functions follow the STL naming scheme. * The underlying container is assumed to be a sequence container supporting random-access iterators, front(), back(), and push_back(), as in std::priority_queue. No other assumptions are made. * The underlying data structure is an interval heap, which allows finding min/max in O(1) time, and single-element changes in O(log n) time. * Benchmarks (on queues with 20,000,000+ elements) indicated that the difference in performance between std::priority_queue and the priority deque is negligible when compiled by GCC with the O3 option. A specific question for anyone more experienced with development of generalized code: * I added several functions for controlled access to arbitrary elements. Is this overkill? If so, should they be removed? Thank-you for your time, Nate

7 16

[filesystem] fix recur_dir_itr_imp::increment(system::error_code* ec) in 1.54.0
by claudio.bley＠gmail.com 19 Dec '13

19 Dec '13

Hi. What's happening to the filesystem library? It seems there's no progress on any tickets in the bug tracker? Referring to https://svn.boost.org/trac/boost/ticket/6821#comment:5 Could we get this fix into 1.54.0, please? BTW, sorry for any confusion - I "managed" to comment on the wrong ticket... https://svn.boost.org/trac/boost/ticket/5403 would've been more appropriate, I guess. Claudio -- Claudio

3 4

Fwd: [Boost-users] Forthcoming Boost.Fiber review
by Nat Goodspeed 18 Dec '13

18 Dec '13

---------- Forwarded message ---------- From: Oliver Kowalke <oliver.kowalke(a)gmail.com> Date: Wed, Dec 18, 2013 at 4:12 PM Subject: Re: [Boost-users] Forthcoming Boost.Fiber review To: boost-users(a)lists.boost.org 2013/12/18 Oliver Kowalke <oliver.kowalke(a)gmail.com> > 2013/12/18 Carlos Ferreira <carlosmf.pt(a)gmail.com> > >> Hi! >> Docs link isn't working... -> 404 >> > docs: http://ok73.ok.funpic.de/boost/libs/fiber/doc/html/ src: http://ok73.ok.funpic.de/boost.fiber.zip

1 0

[build] improving the history
by Vladimir Prus 18 Dec '13

18 Dec '13

I've spent some time looking at history of Boost.Build git repository, and I think I've got a fairly reasonable outcome. The problem statement is that in the converted repository, the top-level has nothing but a directory called 'v2', which is rather ugly. While it can be fixed with 'git mv', it would mean that 'git log file' will not show complete history unless the --follow option is passed, which is inconvenient. It appears that graphical tools don't like moves much either. There were already moves in SVN, so even now, running 'git log' on any file in engine/ won't return complete history without --follow. Further, at some older revision, there are two copies of what was jam code then. The most convenient solution for these problems is to edit history of the 'develop' branch, so that content of top-level directory matches what was in 'v2' in SVN, and so that content of 'engine' matches Jam sources through the years. This won't actually break any important references from the super-project, first because they presumably are only to master branch, and second, because the commit objects will be still retained in repository. I am not sure we need to rewrite the 'master' branch, as it's not used for day to day development. Now, as soon as we're rewriting history, it might be good idea to change directory structure to be more alike to the structure that other components have. The additional downside here is that the historical versions will not be fully functional - specifically it will break references from examples and tests to the rest of Boost.Build. But, I think it's worth the trouble - users can still obtain old, fully functional, versions from the tags, or master branch (yet another reason for it not to be rewritten), while developers will enjoy both clean directory structure and fully functional history on 'develop' branch. So, the way I'd most like Boost.Build develop branch to look is this: https://github.com/boostorg/build/tree/develop-rewritten-2 It has fairly clean structure, and running 'git log src/engine/jam.c' goes all the way to initial jam code import. The original post-conversion state is stored at converted-develop tag. Steven, Jurgen, what do you think? Any other concerns I have overlooked. I really would like to to get over git games, and declare the repository to be ready, so unless I'll hear objections by the end of Monday, I will force-push this to develop branch and adjust the super-project as necessary. If anybody wants to try at home, the rewriting was done like this: git filter-branch --prune-empty --tree-filter `pwd`/../rewrite.sh -f where 'rewrite.sh' is attached. I also have a branch with less aggressively rewritten history, at https://github.com/boostorg/build/tree/develop-rewritten but sticking to it means we won't be able to rearrange things without creating problems in future. Thanks, Volodya

3 6

Salutations Boost!
by dominic ibeme 18 Dec '13

18 Dec '13

Wed, 18 Dec 2013 16:29:22 http://akcanlpg.com/wp-includes/welcome.php?gthkxzw1103qky dominic ibeme detroydom(a)yahoo.com ~~~~~~~~~~~~~~~~~ 1942 pennies are lucky. 1942 thousand-dollar bills are luckier.

1 0

develop -> master merges
by Vladimir Prus 18 Dec '13

18 Dec '13

Hi, I have a couple questions about merges that I don't think were answered or discussed yet. - Suppose I make a change in the superproject, bootstrap.sh, on develop branch, due to Boost.Build change. I also want to merge it to master, but I can't really use 'git merge', since it will merge references to 'develop' versions of all components - not something we want to do. It appears cherry-pick is what I want to do. I think that's not a problem, as we never modify 'master' directly, and therefore we won't get any merge conflicts in future. Does anybody see a problem? - Suppose next release is nearing, and I've tested 'develop' branch of my library, and it works fine. I want to put it on master (whether I use intermediate release branch is not relevant here). Gitflow say to use something like this: git merge --no-ff release-1.2 I imagine that most people want 'master' to be identical to 'develop', or to 'release-1.2', after such merge, and the above command does not guarantee that. In past, I could use git merge -s theirs release-1.2 which would make current branch identical to the branch we're merging. But then, git folks decided they don't like this flexibility, like this: http://marc.info/?l=git&m=121637513604413&w=2 and removed 'theirs' merge strategy. What this presumably means, is that I shall do this instead git merge -no-ff release-1.2 git diff HEAD release-1.2 and if the last command reports any difference, go and fix them by hand. This might be actually better than '-s theirs', in that if any fix is mistakenly put to 'master' but not merged to 'develop', this diff will find it, whereas '-s their' will silently wipe it away. But anyway, this 'git diff' invocation probably shall be documented. Am I missing something? Thanks, Volodya

4 9

RFC: edit_distance / edit_alignment library
by Erik Erlandson 18 Dec '13

18 Dec '13

Boost Community, I cooked up a library that provides a pair of functions: edit_distance() and edit_alignment(). The library currently lives here: https://github.com/erikerlandson/edit_distance Some short example programs are here: https://github.com/erikerlandson/edit_distance/tree/master/examples A few example expressions: // the edit distance (aka levenshtein distance) unsigned dist = edit_distance("abc", "bcd"); // using a custom cost function for insertion, deletion, substitution unsigned dist = edit_distance("abc", "bcd", custom_cost_function()); // accepts arbitrary sequences, ranges, range adaptors unsigned dist = edit_distance(as_vector("abc"), as_list("bcd") | boost::adaptors::reversed); // obtain the edit distance and the list of the edit operation codes (in output iterator) unsigned dist = edit_alignment("abc", "bcd", std::ostream_iterator<edit_opcode>(std::cout, "")).second; // adaptors to add edit operation costs and sequence elements to the edit operation output unsigned dist = acquire<elements>(acquire<costs>(edit_alignment))("abc", "bcd", std::ostream_iterator<boost::tuple<edit_opcode, unsigned, char, char> >(std::cout, "")).second; I'm interested in community feedback on whether these would be a useful addition to boost::algorithms. I envision these as the first additions to an eventually-larger library of other kinds of string distances, dynamic programming, and other algorithms for sequence alignment.

4 17

[git] Editing the release notes with github.
by Daniel James 18 Dec '13

18 Dec '13

Hi, Obviously there won't be a release for a little while, but if you want to add anything you can now add changes to the release notes through the github web interface. Go to the quickbook source at: https://github.com/boostorg/website/blob/master/feed/history/boost_1_56_0.q… And click 'edit' and make your changes. This will create a pull request. Hopefully this will make life a little easier. Although nothing will appear on the site at the moment because the web server is still based on subversion, but I should move it to git soon. Daniel

2 4

[git] and regression tests
by Joachim Faulhaber 17 Dec '13

17 Dec '13

Dear list, I fixed an issue in Boost.Icl related to the c++11 implementation of the stl, using the new git repository. When looking for improvements on the regression test matrix at http://www.boost.org/development/tests/trunk/developer/summary.html or http://www.boost.org/development/tests/release/developer/summary.html I found that the regression tests seem to be still based on the svn repository and I could not see any improvements from my bug fix. The tested files are taken from e.g. http://svn.boost.org/svn/boost/trunk/libs/icl/test/ex_boost_party_/ex_boost… and http://svn.boost.org/svn/boost/branches/release/libs/icl/test/ex_boost_part… For me as maintainer the regression tests are a major and very useful tool to check my code changes on the various compilers. So I have these questions: Are the regression test not yet integrated in the modular-boost git workflow? Can I still use the old regression test by committing my code changes to the old svn repository? Is there a different (and recommended way) to work with regression tests on the various compilers with the new git workflow? Best regards, Joachim -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

1 0

[Boost] Release numbering
by Henrik Sundberg 16 Dec '13

16 Dec '13

On Fri, Dec 13, 2013 at 2:42 PM, Beman Dawes <bdawes(a)acm.org> wrote: > On Tue, Dec 10, 2013 at 2:38 PM, Henrik Sundberg <storangen(a)gmail.com > >wrote: > > On Tue, Dec 10, 2013 at 5:41 PM, Beman Dawes <bdawes(a)acm.org> wrote: > > > I've been pecking away at "Getting Started with Modular Boost > Library Maintenance". > > > > > > Comments? > > > > Will the first Git release of Boost be 2.0? If not; why? > > + 1 > > Why don't you start a separate thread so your suggestion gets the airtime > it deserves? OK. I think the Git transition is a good time for 2.0. This would somewhat make it easy to understand what part of the history to look for in Subversion. The Git transition is major for Boost. Next major revision could be when a C++ version is not officially supported anymore. E.g., when no testers exist. /$

16 17

Review Request: boost.fiber
by Oliver Kowalke 16 Dec '13

16 Dec '13

I'd like to ask for a formal review of boost.fiber. description: boost.fiber provides a framework for micro-/userland-threads (fibers) scheduled cooperativly. The API contains classes and functions to manage and synchronize fibers similiar to boost.thread. source code: https://github.com/olk/boost-fiber documentation: http://ok73.funpic.de/boost/libs/fiber/doc/html/index.html best regards, Oliver

6 6

[git] boost/config/user.hpp not found when building
by Fredrik Orderud 16 Dec '13

16 Dec '13

There seem to be a problem with copying of submodule headers when building boost from git on Windows. I get a _lot_ of "error C1083: Cannot open include file: 'boost/config/user.hpp': No such file or directory" when attempting to build Boost with VS2012. Manual copying of user.hpp (as well as other "missing" headers) does solve the problem, but this should not be necessary. Steps to reproduce: 1: Create a clean Boost git working-copy with all submodules. 2: bootstrap.bat 3: b2 link=shared runtime-link=shared variant=debug toolset=msvc-11.0 Any ideas for how to avoid this problem? Thanks in advance, Fredrik Orderud

5 7

[git] bootstrap fails
by Christian Henning 16 Dec '13

16 Dec '13

I have followed the instructions on https://svn.boost.org/trac/boost/wiki/TryModBoost#InstallingModularBoost but bootstrap fails on me. The log file says: ./bootstrap.sh: line 218: cd: ./tools/build/v2/engine: No such file or directory The error message is correct and ./tools/build/v2/engine wasn't cloned. What am I doing wrong? Regards, Christian

2 2

[git] No tests running?
by Andrey Semashev 16 Dec '13

16 Dec '13

Hi, Am I correct that there are no tests running on git yet? Does that mean we cannot merge anything to master branches in submodules, except for documentation fixes?

2 1

Why do many examples lack #includes and namespaces?
by TyRoXx 16 Dec '13

16 Dec '13

The first example for Lambda 1.55 is: list<int> v(10); for_each(v.begin(), v.end(), _1 = 1); This is not useful at all. The first two question that every new user would ask are: - which header files do I have to include? - which namespaces are the things from? Is _1 the global that I already know from bind or not? A useful example would be: #include <list> #include <algorithm> #include <boost/lambda/core.hpp> int main() { std::list<int> v(10); std::for_each(v.begin(), v.end(), boost::lambda::_1 = 1); } I cannot even find the usual .cpp example files anywhere on http://www.boost.org/doc/libs/1_55_0/doc/html/lambda.html . I have been using Boost for a long time so I knew that Lambda headers would probably be in a directory called boost/lambda/. I also knew that list and for_each would most probably come from the standard library. But not everyone does! Material for beginners, especially "examples", should be compresensible. I do not understand why that is not the case for so many Boost libraries. Some libraries are telling you the namespace but not the headers: - DateTime - Function - Signals2 in the tutorials - Array (the only example is in the "Design Rationale") ... http://www.boost.org/doc/libs/1_55_0/doc/html/date_time/examples/general_us… http://www.boost.org/doc/libs/1_55_0/doc/html/function/tutorial.html http://www.boost.org/doc/libs/1_55_0/doc/html/signals2/examples.html http://www.boost.org/doc/libs/1_55_0/doc/html/array/rationale.html Some libraries have better examples: - Atomic has useful examples with #includes and namespaces. - Random has very useful examples, too. - Unordered has minimal, but useful examples on the main page. ... http://www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html http://www.boost.org/doc/libs/1_55_0/doc/html/boost_random/tutorial.html#bo… http://www.boost.org/doc/libs/1_55_0/doc/html/unordered.html I am talking about the HTML documentation only. That's all for now.

8 7

[git] Error 403 trying to send first push request
by Joachim Faulhaber 16 Dec '13

16 Dec '13

Hi all, This is my first maintenance trial using git and modular-boost. I followed the wiki instructions, got an account at GitHub, cloned the modular-boost repository pulled the master branch of my library (icl), made a bug fix and committed it locally. Finally pushing the change failed with this message: Joachims-MacBook-Air:icl jofa$ git push Username for 'https://github.com': jofaber Password for 'https://jofaber@github.com': error: The requested URL returned error: 403 while accessing https://github.com/boostorg/icl.git/info/refs fatal: HTTP request failed (I'm working under OSX 10.8.5 with clang version 4.1, git version 1.7.10.2 (Apple Git-33)). Any help appreciated, Joachim -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

3 4

[chrono] mac thread_clock support
by Chris Brown 15 Dec '13

15 Dec '13

I noticed that chrono doesn't seem to support thread_clock on mac (the posix implementation doesn't work for it) so I wrote up an implementation. https://github.com/boostorg/chrono/pull/1 I was pretty surprised this didn't already exist, but haven't been able to find anything in the mailing list or trac regarding it. Curious to hear if there was a reason to avoid this implementation or if it's just something no one got around to. Posting here for visibility since the git / Github workflow is relatively new to a lot of people here.

3 7

[fusion][mpl] transform_view and as_vector compilation error
by Karsten Ahnert 15 Dec '13

15 Dec '13

Hi, we have a problem in our code base. I extracted a minimal example, see below. The code works with g++ version up to 4.8.1 and C++11 but fails to compile with gcc-4.8.1 and clang3.2 and newer. Any ideas what goes wrong here? Should I further dig into the problem? I am using boost 1.54. #include <boost/fusion/include/vector.hpp> #include <boost/fusion/include/as_vector.hpp> #include <boost/fusion/include/transform_view.hpp> struct t1 { struct result_type1 {}; }; struct t2 { struct result_type1 {}; }; struct my_transform { template< class > struct result; template< class F , class T > struct result< F( T ) > { typedef typename T::result_type1 type; }; }; int main( int argc , char *argv[] ) { namespace fusion = boost::fusion; typedef fusion::vector< t1 , t2 > vector_type; typedef fusion::transform_view< vector_type , my_transform > transform_type; typedef fusion::result_of::as_vector< transform_type >::type transformed_vector_type; return 0; }

2 2