- Boost - lists.preview.boost.org

GSoC
by Utsav Tiwary 31 Jan '14

31 Jan '14

My idea for GSoC involves implementation of advanced maths libraries for boost which involve the solving of boundary value problems using finite difference method. Language to be used is C. Are there any existing implementations ?

2 2

boost::pool nextof method
by Gilbert Polo 31 Jan '14

31 Jan '14

I am currently learning how to use the boost pool library. However, I have a question regarding the nextof of method found in the class simple_segregated_storage.hpp. How does the increment of the void pointer work. How does it know how much to increment the void pointer by in order to get to the next chunk?

2 1

[type_traits] type_traits for types with operator().
by Anton Bikineev 31 Jan '14

31 Jan '14

Hello. Recently I looked for type_traits for callable classes. It so strange, I didn't find such traits. Most likely, I just missed them or something like them. I actually don't know is there a real need for them. Anyway I tried to write such traits at least for practice and metaprogramming training. I tested them with gcc, clang and msvc2010. I would appreciate if you looked at the code. Here is the link<https://github.com/AntonBikineev/is_functional/> to my github repository. It's cool that they can see hidden generated operator() of lambdas closure type. Best regards, Anton.

5 5

Trouble with constructors boost::graph::directed_graph from boost::adjacency_list in C++
by Matthias Beste 31 Jan '14

31 Jan '14

Dear Boost-Users, Related to: boost::graph::directed_graph I've trouble with the Constructors of above as a simple example shows: <<<<<<<<<<<<<<<<<<< using namespace boost; typedef directed_graph<> Directed_Graphtype; class Mywrapper { private: Directed_Graphtype g; public: Mywrapper() : g() {}; }; >>>>>>>>>>>>>>>>>> I got the following Error while compiling: <<<<<<<<<<<<<<<< HOME/svn_repos/collab_cntfet/trunk/STA_signalintegrity/circuitGraph.h|78| instanziiert von hier| /usr/include/boost/graph/directed_graph.hpp|96|Fehler: keine passende Funktion für Aufruf von »boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property<boost::edge_index_t, unsigned int, boost::no_property>, boost::no_property, boost::listS>::adjacency_list(const boost::directed_graph<>&)«| /usr/include/boost/graph/directed_graph.hpp|96|Anmerkung: Kandidaten sind:| /usr/include/boost/graph/adjacency_list.hpp|451|Anmerkung: template<class EdgeIterator, class EdgePropertyIterator> boost::adjacency_list::adjacency_list(EdgeIterator, EdgeIterator, EdgePropertyIterator, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edges_size_type, const GraphProperty&)| /usr/include/boost/graph/adjacency_list.hpp|443|Anmerkung: template<class EdgeIterator> boost::adjacency_list::adjacency_list(EdgeIterator, EdgeIterator, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edges_size_type, const GraphProperty&)| /usr/include/boost/graph/adjacency_list.hpp|435|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, const GraphProperty&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type = long unsigned int]| /usr/include/boost/graph/adjacency_list.hpp|435|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »long unsigned int«| /usr/include/boost/graph/adjacency_list.hpp|418|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(const boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property, boost::no_property, boost::listS>]| /usr/include/boost/graph/adjacency_list.hpp|418|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »const boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property<boost::edge_index_t, unsigned int, boost::no_property>, boost::no_property, boost::listS>&«| /usr/include/boost/graph/adjacency_list.hpp|414|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(const GraphProperty&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS]| /usr/include/boost/graph/adjacency_list.hpp|414|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »const boost::no_property&«| ||=== Build finished: 11 errors, 0 warnings ===| >>>>>>>>>>>>>>>>>>>>>>>>>> I would really like to know, where the problem is with this templates. The default constructor exists of course for boost::directed_graph and boost::adjacency_list a.s.o. ... however the compiler don't like them. This is confusing. Can someone help me out? Kind Regards Matthias -- Dipl.-Ing. Matthias Beste Wissenschaftlicher Mitarbeiter Lehrstuhl für Dependable Nano Computing (CDNC) Institute für technische Informatik (ITEC) Karlsruhe Institute of Technology (KIT) Haid-und-Neu Str.7 (Bldg 07.21) 76131 Karlsruhe, Germany Phone: +49 721 608-45009; Fax: +49 721 608-43962 Email: matthias.beste(at)kit.edu <mailto:matthias.beste@kit.edu> web: http://cdnc.itec.kit.edu/

1 0

[cmake] Plans/status
by Ruslan Baratov 31 Jan '14

31 Jan '14

Hello everyone! I want to ask few questions about this project: https://github.com/boost-cmake/boost-cmake I start with simple one, what is the current status of this project and are there any plans to apply it to the mainline?

1 0

Boost Phoenix 3.0.1 - version numbers and ChangeLog
by Fletcher, John P 31 Jan '14

31 Jan '14

Boost Phoenix 3.0.1 is now on master. I am fixing the bugs previously reported for Boost Phoenix. I have started a file libs/phoenix/ChangeLog (following the example in wave) to log changes made. I am incrementing the lowest number of the version when I merge changes to master and origin/master and also changing the version number in Phoenix and reporting this in the ChangeLog. I hope this will make it easier in the future to keep track of exactly which version it is which is causing a problem. I would welcome any comments on the TODO list in the ChangeLog, in particular where there are problems caused by phoenix for other libraries. I am aware that this applies to boost/log. I am hopeful that some fixes of early bug reports will help with later bugs as well. I have just fixed 5715 which related to the comma operator in statement blocks, and can be fixed with the addition of a header. This fixes a silent error in the execution as compared with phoenix V2 and may well fix other problems. That fix is still in develop and not master until some tests have been done. John Fletcher

1 0

Ownership of tickets for Boost Phoenix
by Fletcher, John P 31 Jan '14

31 Jan '14

I have taken over as maintainer of Boost Phoenix and have started to fix the reported bugs. How do I get to be the owner of the bugs so that I can change their status when they have been fixed and tested? Also how can I be sure to get notification of new bug reports? John Fletcher

1 0

[program_options] documentation for validators
by Alain Miniussi 30 Jan '14

30 Jan '14

Hi, I have a question regarding the validators namespace of program_options documentation. That namespace is referenced in the tutorial in http://www.boost.org/doc/libs/1_55_0/doc/html/program_options/howto.html and some of its functions are used but there is no documentation related with that namespace. Actually, it does not even appears in the reference manual of the lib. Is that intended ? Regards Alain

2 1

[spirit.lex] 9580
by Vyacheslav Andrejev 30 Jan '14

30 Jan '14

Hi All, Can somebody take a look at bug #9580? It's a C++ puzzle. Two as if equivalent expressions demonstrate different behavior. This one auto expr = (this->self("SOME_STATE") += someTokenDef); calls boost::proto::detail::exprns_::operator +=. However this auto lex_def = this->self("SOME_STATE"); auto expr = (lex_def += someTokenDef); calls boost::spirit::lex::detail::operator +=. My guess is that it changes templates instantiaon order, but still I can't explain it and thus can't fix it. -- -- Vyacheslav Andrejev

2 3

Help please with Boost Discussion Policy
by Fletcher, John P 30 Jan '14

30 Jan '14

It has been pointed out to me that I need to change my habits from top posting to be conformant to the Boost Discussion Policy http://www.boost.org/community/policy.html I accept this fully and I am seeking some guidance how to achieve this. At my place of work our email client is Microsoft Outlook 2010 and the normal practice is top posting. When I am at home I can access the same system via a web email client which does the same thing. The Boost policy document reffers to Quote-Fix (http://home.in.tum.de/~jain/software/oe-quotefix/ ) which was last updated in 2006 and does not work with current versions of Outlook. There is also this: http://sourceforge.net/apps/mediawiki/macros4outlook/index.php?title=QuoteF… I am doing most of my Boost work from home and want to be able to communicate freely. Ideally what I want to do is to switch between the styles so that only my Boost and related work is in quoted style. Any help will be much appreciated. Thank you John Fletcher

11 15

[config] Removing support for old compilers: do we have a consensus yet?
by John Maddock 30 Jan '14

30 Jan '14

Folks, As you know Boost.Config has had it's support for old compilers stripped out, and this is a controversial change. We're now at the point where I'd really like to get the routine changes/updates into release, but to do that we need a final decision on whether to keep (and release) Steven Kelly's changes in develop. So do we have a final decision? Thanks, John.

6 8

[fusion] preprocess target pull request
by Eric Niebler 29 Jan '14

29 Jan '14

https://github.com/boostorg/fusion/pull/1 I'm not sure who gets notified of pull requests, if anybody. Sending mail for good measure. -- Eric Niebler Boost.org http://www.boost.org

6 14

[offtopic] C++Now 2014 - hotel room available
by Hartmut Kaiser 29 Jan '14

29 Jan '14

I apologize for posting off-topic. Hey all, Unfortunately I will not be able to come to C++Now this year. However I already booked my hotel room at the Aspen Meadows (at the early bird rate!). If anybody is interested in using the hotel reservation, please get in contact with me offline. Thanks! Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

2 1

[git][predef] Pull fails
by Andrey Semashev 27 Jan '14

27 Jan '14

Hi, I checked out Boost on my Windows machine quite some time ago and today I tried to update it. I did: git submodule foreach git checkout develop git submodule foreach git pull The last command failed on Boost.Predef (log attached). I did not change it and I don't understand why there is conflict. I tried 'git reset --hard' and pull again, but it fails again the same way. How can I fix it?

7 10

Re: [boost] Interest in Base2/16/32/64 Encoding Library?
by PB 27 Jan '14

27 Jan '14

On Fri, Jul 6, 2012 at 9:13 PM, Thomas Kemmer <tkemmer(a)computer.org> wrote: > Dear Boost Developers, > > I would like to know if there is interest in incorporating a generic > Base2/16/32/64 encoding library into Boost. > > I am the author of such a libray, hosted at > > http://code.google.com/p/stlencoders/ > > and would be willing to contribute and make the effort of > "Boostifying" it, if the Boost community is interested in such a > thing. > > There have been several suggestions for a Base64 encoding library on > this mailing list in the past. Most of them have been dismissed, since > Boost already provides a Base64 implementation with > Boost.Serialization's "Dataflow Iterators". Though I appreciate the > dataflow iterator's design, from personal experience I think that for > the basic task of encoding/decoding, a higher-level interface, e.g. > one that takes padding and intermittent whitespace (MIME) into > account, would benefit many developers. > > Currently, the stlencoders library > > - implements the Base16, Base32 and Base64 encoding schemes as defined > in RFC 4648. Base2, i.e. binary encoding, is also supported. > - implements encoding and decoding operations as generic algorithms > that operate on STL-style iterators > - supports different encoding alphabets using custom traits classes > - supports different character types > - lets the user define if/which non-alphabet characters should be > ignored via predicates > - provides reasonable performance that matches most "plain C" > implementations > > stlencoders is currently designed as a stand-alone library with no > dependencies on Boost (or anything but C++03); it would therefore take > some effort and guidance from the community to properly integrate it > with the rest of Boost. I would therefore appreciate any feedback > regarding your interest in this. > > Kind Regards, > > Thomas > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost > I know this was over a year ago, but I need to do some base64 encoding/decoding and wish Boost offered it at the outer level (as opposed to using internals of a library). Regards, Pete

1 0

Boost candidate similar to asyncplusplus
by Rodrigo Madera 27 Jan '14

27 Jan '14

Hello, I was wondering if there is anything similar to asyncplusplus [1] here in Boost land. I just found out about the library and I specially liked the task chaining syntax [2]: --- async::spawn([] { return 42; }).then([](int result) { return result; }).then([](task<int> parent) { std::cout << parent.get() << std::endl; }); --- This is something I would love to see in Boost. So I ask: 1) Are there any similar Boost candidates for task scheduling? 2) If not, is ASIO up to this with some adaptation? I felt specially inclined to ask this here because of all the discussion taking place over the recently reviewed Fibers library and the fundamentals of asynchronous processing. Very interesting thoughts being discussed there. And something more higher level (but not necessarily IO bound) might be helpful. Best regards, Rodrigo Madera [1] https://github.com/Amanieu/asyncplusplus [2] https://github.com/Amanieu/asyncplusplus/wiki/Tutorial

4 4

[github] boostorg/boost not listed?
by Joaquin M Lopez Munoz 26 Jan '14

26 Jan '14

Hi, After some recent aesthetic changes to https://github.com/boostorg , the repository boostorg/boost does not get listed in either of https://github.com/boostorg https://github.com/boostorg?page=2 https://github.com/boostorg?page=3 https://github.com/boostorg?page=4 https://github.com/boostorg?page=5 https://github.com/boostorg?page=6 even though it certainly exists and can be searched and found through the "Find a repository..." editbox. Before these latest changes to the web, boostorg/boost usualliy appeared #1 in the list as it quickly autoupdated after any subproject did. Thank you, Joaquín M López Muñoz Telefónica Digital

2 1

[atomic] Probable documentation issue: how do we know atomic is safe and/or efficient?
by John Maddock 26 Jan '14

26 Jan '14

I'm looking to use Boost.Atomic for the double-checked-locking-idiom, but I'm having trouble discovering a) Whether the library is correctly implemented. b) How efficient (or otherwise) the library is on various platforms. I'm sure the answer to (a) is that it is correct, but I was surprised that atomic<int> relied on the volatile modifier for thread safe load/stores on MSVC, I had assumed that something more than that would have been required, but I know I'm out of date on this stuff! I can't help thinking that questions like this could be allayed by better documentation - specifically what operations are used to ensure correctness on each supported platform, plus rationale and/or link to reference material. My apologies if this has been covered already in the review, and I realize that documentation is a lot of work, but I can see no way to ensure correctness other than through code inspection, so proper documentation is essential in that case. Regards, John.

5 10

[predef] Suggestion for Boost itself to start using this.
by Fletcher, John P 25 Jan '14

25 Jan '14

I have started to use the Boost predef library. I think it will be a good idea for this to be used within Boost. This is actually contained in the Future Work section of the Boost predef manual. http://www.boost.org/doc/libs/1_55_0/libs/predef/doc/html/predef/introducti… * And obviously there's lots of work to do in reformulating the existing Boost libraries to use the Predef library once it's accepted. I have been attempting to make use of it and one of the problems is that BOOST_VERSION itself is not consistent with it. It would I think break a lot of existing code to change BOOST_VERSION. Instead I suggest having another define a longside it which is consistent with Boost predef. I wnt to make the following suggestions to go into the definition of the version. First check that the version of Boost is recent enough. 1.55.0 is the first to have Boost predef. #include <boost/version.hpp> #if BOOST_VERSION >= 105500 #include <boost/predef.h> #define BOOST_HAVE_BOOST_PREDEF #endif #include <iostream> #include <string> #include <sstream> Then if that is true then construct a new defintion: #ifdef BOOST_HAVE_BOOST_PREDEF #ifdef BOOST_VERSION // The following translates BOOST_VERSION to a BOOST_VERSION_NUMBER!! // BOOST_VERSION % 100 is the patch level // BOOST_VERSION / 100 % 1000 is the minor version // BOOST_VERSION / 100000 is the major version #define BV BOOST_VERSION #define BVN BOOST_VERSION_NUMBER(BV / 100000,BV / 100 % 1000,BV %100) #define BOOST_VERSION_VERSION BVN #undef BVN #undef BV #endif Other libraries can also construct new version codes. John Fletcher

1 1

Re: [boost] [Boost-testing] DrWeb regression test server is going down
by Beman Dawes 25 Jan '14

25 Jan '14

On Thu, Jan 23, 2014 at 5:24 PM, Sergey Cheban <s.cheban(a)drweb.com> wrote: > Dear subscribers, > > Unfortunately, DrWeb regression test server (Visual C++ 9-12, Windows > server 2012) is going down. > Sorry to hear that, but thanks for all your past runs! Is this permanent or will it come back up at some point? --Beman

2 1

inter thread communication with message queues
by Kenneth Adam Miller 25 Jan '14

25 Jan '14

I was reading about message queues with respect to inter thread communication, and I have a specific use case that I want to describe. It's rather complex, so I want to be careful that I design it so that there are no race conditions. Pool A is a buffer (of type 1) handle manager, that feeds buffer handles into thread set 1, and receives old handles from thread set 2. There is only one thread running pool A. Thread set 1 is a set of N threads that fill up buffers of type 1 with regular data. It pushes full buffers to thread set 2. Thread set 2 is a set of M threads that compress buffers of type 1 into data buffers of type 2. Once the buffer of type 1 has be used up, it is cleared and sent back to Pool A. It pulls fresh data buffers of type 2 from Pool B, and sends freshly filled compressed buffers to Pool C. Pool C does something with the buffer, clears it and hands it to Pool B. Can this be done safely using an implementation like what I see here: http://www.justsoftwaresolutions.co.uk/threading/implementing-a-thread-safe… ? Note 1: -= denotes a 1-to-N connect and =- a N-to-1 connect RR = Request reply relationship +--------------------------------------------------------------------+ | | v | Pool A RR Thread Set 1 Router X | PULL-PUSH --==> PULL-read-PUSH ==--> PULL-PUSH --==> PULL Thread Set 2 PUSH \ / +-compress-+ Pool B RR / \ PULL-PUSH --==> PULL PUSH ^ || | || +----------- PUSH-write-PULL <--==++ Pool C Questions: how do I have a separate thread poll on multiple shared message queues? Like, I have a thread pool that both receives requests for buffer handles and that receives old buffer handles to recycle.

2 1

boost condition_variable internals
by Kenneth Adam Miller 25 Jan '14

25 Jan '14

I need to know that boost does not use any kind of locking, mutex or semaphore mechanism within the boost::condition_variable class. I don't know where it is in source, or I would check to make certain. Can someone provide me a yes no verification?

2 1

Re: [boost] Compile time reflection for IPC using
by Brian Wood 25 Jan '14

25 Jan '14

> Ok. I would like to ask you about next > When we should use the RPC architect should we serrialize the call Oleg, Sorry, but I have no idea what you're talking about in your posts. I have some serialization related software on my website that you may be interested in. I'm available to talk on the phone if you like. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

1 0

Announcing the Boost Community Maintenance mailing list
by Marshall Clow 24 Jan '14

24 Jan '14

The Boost Community Maintenance mailing list (boost-maint) has been created, and you can sign up here: http://lists.boost.org/mailman/listinfo.cgi/boost-maint The goal of the Boost Community Maintenance team is to maintain those libraries whose creators no longer can. The initial proposal for the group is here: https://dl.dropboxusercontent.com/u/9897665/community-maintenance.html I will be posting status and working guidelines here and on the boost-maint mailing list over the weekend. I encourage everyone who wishes to participate to subscribe to the boost-maint mailing list, and we’ll get started by Monday. Thanks in advance! -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

[testing] How do you interpret the SHA1 revision (outdated results)?
by John Maddock 24 Jan '14

24 Jan '14

So... I'm looking into Boost.Regex and I'm seeing some failures which appear to refer to outdated sources (line numbers are all wrong for current source), for example: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… But how on earth do I check this? Reported run date is yesterday, but this was fixed/changed on Dec 20th: almost a month ago. And the revision listed on the page is a SHA1 which I can't seem to relate to anything useful? Thanks, John.

6 13

Compile time reflection for IPC using
by Oleg Labutin 24 Jan '14

24 Jan '14

Do you now about one approach (for two compilers (gcc 3.7, and MSVC (last)) emulate compile time reflection with difference scope? Like struct some { META_STRUCT(some); FLD(int, a); FLD(int, b); METH(int, call_0, (int, a)); METH(int, call_1, (int, b)); }; void in() { typedef hl::reflection_extract<some>::field_accessors acc; some s; s.*hl::at<acc, a_accessor>::get() = 5; } We can see here https://github.com/ol72/hl/tree/ And you can try to compile this attached demo Use __J_ACTIVE define to see as reflection worked in json oriented part of project. For which you should install json. Without this you can see ability take meta information by query. But global goal I think we understanding Our backend can be something else. Like client server , data base oriented structures in which we can use by SQL like C++ syntax We can make (and I made it ) database like structures struct human_tables { TABLE(names) { fields((int) index, (std::string) name, .... ); }; TABLE(country) { fields((names_table::index) name, ... ); }; TABLE(human) { indexes(names_table::index_field); fields((names_table::index_field) name, (country_table::index) country...); }; };

3 11

C++03 and C++11 ABI compatibility for compiled libraries
by Andrey Semashev 24 Jan '14

24 Jan '14

Hi, I would like to raise the issue of binary compatibility of compiled Boost libraries between C++03 and C++11. I faced this problem with gcc on Linux, but other compilers and platforms may be affected as well. To summarize the problem: * Most, if not all Linux distributions build packages in C++03 mode. This is also the default in gcc. * Some Boost libraries conditionally use C++11 features in their binary interfaces (see [1] as an example). This makes C++03 and C++11 versions of the library binary incompatible. * Given that, users are unable to use C++11 in their code that uses Boost because of linker failures. I don't have the complete list of the offending C++11 features that break ABI, but it would seem that at least scoped enums and rvalue references are among them. Are there any more? I would like to hear opinions on the possible course of action to tackle this problem. Currently, I see 2 choices: 1. Avoid using C++11 features in binary interfaces. This may also mean avoiding STL types in binary interfaces, if they differ between C++03 and C++11 (I didn't verify that). This is my suggested hotfix solution for Boost.Filesystem [1] and the approach I took in Boost.Log. Obviously, this cripples code and error prone, but it keeps a single binary that can be used from any flavor of C++ on the user's side. 2. Compile different versions of Boost libraries, for each supported C++ version. The C++ version should be encoded into the library file names, so that different versions can coexist. This would require changes in Boost.Build and autolinking support code, but I think this would be a better long-term solution. Opinions? [1] https://svn.boost.org/trac/boost/ticket/6779

12 27

Boost.Fiber review January 6-15
by Nat Goodspeed 23 Jan '14

23 Jan '14

Hi all, The review of Boost.Fiber by Oliver Kowalke begins today, Monday January 6th, and closes Wednesday January 15th. ----------------------------------------------------- About the library: Boost.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. Each fiber has its own stack. A fiber can save the current execution state, including all registers and CPU flags, the instruction pointer, and the stack pointer and later restore this state. The idea is to have multiple execution paths running on a single thread using a sort of cooperative scheduling (versus threads, which are preemptively scheduled). The running fiber decides explicitly when it should yield to allow another fiber to run (context switching). Boost.Fiber internally uses coroutines from Boost.Coroutine; the classes in this library manage, schedule and, when needed, synchronize those coroutines. A context switch between threads usually costs thousands of CPU cycles on x86, compared to a fiber switch with a few hundred cycles. A fiber can only run on a single thread at any point in time. docs: http://olk.github.io/libs/fiber/doc/html/ git: https://github.com/olk/boost-fiber src: http://ok73.ok.funpic.de/boost.fiber.zip The documentation has been moved to another site; see the link above. If you have already downloaded the source, please refresh it; Oliver has added some new material. --------------------------------------------------- Please always state in your review whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Nat Goodspeed Boost.Fiber Review Manager ________________________________

16 129

Volunteers needed to run regression test reporting
by Beman Dawes 23 Jan '14

23 Jan '14

We have had a long term problem with regression test reporting going offline unexpectedly. The process used XSLT processing was hard to configure, horribly slow, and very fragile, and those factors made it a pain to run. Last year, Steven Watanabe rewrote the report generation in C++, and those issues have pretty much disappeared, so the process is now far easier to run. It runs in five minutes or less. Hooray C++! Hooray Steven! And Hooray Tom Kent who runs the reports! The remaining reliability factors are local ones like system crashes. Since the reports run as cron jobs, it can be quite a while before anyone is inconvenienced enough to report it to the Boost list, and Murphy's Law ensures that it is always the day after the person running the reports left for a week-long back country hike. We can mitigate that by having several people running the reports. I've written some docs, so it shouldn't be too hard, although right now it does require a *nix-like system. I've been running them on a Windows host using a VirtualBox virtual Ubuntu system, and have found it to be easy. One possibility would be for Tom to continue to run the reports on the hour, a second person to run them twenty minutes after the hour, and a third to run forty minutes after the hour. Please volunteer to help make regression reporting more timely and reliable! --Beman

12 21

[phoenix] 7181
by Fletcher, John P 23 Jan '14

23 Jan '14

________________________________________ From: Boost [boost-bounces(a)lists.boost.org] on behalf of Mathieu Champlon [m.champlon(a)free.fr] Sent: 23 January 2014 12:11 To: boost(a)lists.boost.org Subject: Re: [boost] [phoenix] 9111 and 9113 > Hi John, >There is https://svn.boost.org/trac/boost/ticket/7181 which is also >about a warning albeit a different one. >Thanks for doing this ! >MAT. I have pushed to phoenix develop using the patch in 7181 John _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

[phoenix] 9111 and 9113
by Fletcher, John P 23 Jan '14

23 Jan '14

________________________________________ From: Boost [boost-bounces(a)lists.boost.org] on behalf of Mathias Gaunard [mathias.gaunard(a)ens-lyon.org] Sent: 21 January 2014 16:44 To: boost(a)lists.boost.org Subject: Re: [boost] [phoenix] New maintainer On 20/01/14 13:40, Fletcher, John P wrote: >> If you have any information on your problems with Phoenix, in particular any not already on the bug system, please let me know. >> > I filed bugs about warnings a while ago. (9111, 9113) > It shouldn't take much work to fix those and it would be great if I > could finally make my code compile without warnings. I have now pushed a fix for 9111 and some fixes for 9113 to the develop branch. The report on 9113 says there are others, so any other reports would be helpful. John _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

raw.github.com access from behind firewall
by Belcourt, Kenneth 22 Jan '14

22 Jan '14

Hi, When I try to run github hosted regression tests with run.py, access to raw.github.com times out even though it seems to be using the specified our proxy server. # Running regressions in /scratch/modular-boost... # Creating regression scripts at /scratch/modular-boost/tools_regression_src... # Dowloading regression scripts from https://raw.github.com/boostorg/boost/develop/tools/regression/src... --- http://wwwproxy.sandia.gov:80 What's interesting is that I'm able to clone from github.com just fine, as you can see here. -bash-4.1$ git clone https://github.com/boostorg/boost Initialized empty Git repository in /scratch/modular-boost/boost/.git/ remote: Counting objects: 180556, done. remote: Compressing objects: 100% (68339/68339), done. remote: Total 180556 (delta 111934), reused 180501 (delta 111879) Receiving objects: 100% (180556/180556), 68.21 MiB | 10.23 MiB/s, done. Resolving deltas: 100% (111934/111934), done. But we're not able to clone from raw. -bash-4.1$ git clone https://raw.github.com/boostorg/boost Initialized empty Git repository in /scratch/modular-boost/boost/.git/ error: The requested URL returned error: 403 while accessing https://raw.github.com/boostorg/boost/info/refs fatal: HTTP request failed which means this clone (https://raw.github.com/boostorg/boost/develop/tools/regression/src) will fail. Is this a known issue and / or is there a workaround for this? This is on RHE Linux with git 1.8.5.1. -- Noel Belcourt

3 9

[phoenix] bug 9111
by Fletcher, John P 22 Jan '14

22 Jan '14

From: Boost [boost-bounces(a)lists.boost.org] on behalf of Mathias Gaunard [mathias.gaunard(a)ens-lyon.org] Sent: 21 January 2014 16:44 To: boost(a)lists.boost.org Subject: (was Re: [boost] [phoenix] New maintainer > I filed bugs about warnings a while ago. (9111, 9113) > It shouldn't take much work to fix those and it would be great if I > could finally make my code compile without warnings. I have looked at the code for no 9111 and it looks like this: template <int M, typename RhsRT, typename RhsFP> bool operator==(function_ptr<M, RhsRT, RhsFP> const & rhs) const { return false; } For some reason that specialized case is always returning false, which is why rhs is unused. I need to look into why that is the case, or else do some dummy operation on rhs which will suppress the warning. John

2 2

[config] BOOST_NOINLINE on nvcc
by Mathias Gaunard 22 Jan '14

22 Jan '14

Hi, I noticed that I had some problems with some nvcc (NVIDIA CUDA) versions and BOOST_NOINLINE. The logic for defining BOOST_NOINLINE seems to be the same as that of BOOST_FORCEINLINE, which does work correctly, so it seems to be a nvcc bug that's not fully compatible with GCC despite claiming to be. What would be the correct way to fix that?

3 4

[git] boost + git flow
by Oliver Kowalke 22 Jan '14

22 Jan '14

does boost follows the git-flow schema, e.g. merging the changes from branch develop into master is not required by the library developer (this is done by the release manager)?! Oliver

5 4

[testing] Reports that lead nowhere?
by John Maddock 22 Jan '14

22 Jan '14

While we're updating and fixing testing issues, I notice the report generator is still creating content-free failures, for example this one: http://www.boost.org/development/tests/develop/developer/marshall-mac-regex… Ultimately leads nowhere :-( Thanks, John.

4 4

[regex] Need some help with msvc-11/12
by John Maddock 22 Jan '14

22 Jan '14

Can anyone with access to msvc-11 or 12 tell me what's causing this failure: http://www.boost.org/development/tests/develop/developer/output/DrWeb_vc12_… You will probably need to build and run under the debugger to find out I suspect... Many thanks in advance, John.

3 4

Support for Android
by Vicente J. Botet Escriba 22 Jan '14

22 Jan '14

Hi, I see that there are some trouble with Boost and Android: https://svn.boost.org/trac/boost/ticket/9082 http://www.boost.org/development/tests/develop/developer/output/apolukhin-A… Could someone state what is the Boost approach to support Android? Should the user build with NDK r8e? Does bjam supports a specific android platform? Best, Vicente

4 11

[wave] preprocessor directives in output
by Eric Niebler 22 Jan '14

22 Jan '14

I'm looking at automating the regeneration of Fusion's preprocess headers with the wave tool. Currently, it's impossible because of stuff like this (from container\vector\vector.hpp): #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) vector(vector&& rhs) : vec(std::forward<vector_n>(rhs.vec)) {} #endif When the wave driver is run, either BOOST_NO_CXX11_RVALUE_REFERENCES is defined, in which case the block of code gets left out, or else it isn't, in which case the block of code is left in. Both are wrong. What should happen is that the #if and #else directives should be present in wave's output. I can keep wave from expanding certain named macros with the -N switch, but there doesn't seem to be a way to selectively keep wave from evaluating #if/#else directives. Or is there? Any help appreciated. Eric

8 18

[variant] Breaking change introduced by variadic support
by Agustín K-ballo Bergé 22 Jan '14

22 Jan '14

The recent changes to introduce variadic support to `variant` introduce breaking changes in the documented macros. When variadic support is detected, `BOOST_VARIANT_LIMIT_TYPES` is not defined and `BOOST_VARIANT_ENUM_[SHIFTED_]PARAMS` uses variadic templates instead of enumerating parameters. This is a breaking change in the documented interface, and one that requires all but the simplest use cases to be rewritten. For instance, this breaks _Boost.Spirit_ support of `variant` (https://svn.boost.org/trac/boost/ticket/9238) requiring two different implementations to be provided. Is this the preferred path to take? I would suggest instead to keep the macros as documented at all times, and let the user handle the variadic case manually. This would allow users to support both variadic and non-variadic `variant`s up to a certain limit with a single code case (without breaking the documented interface), and result in cleaner code for those cases that only target compilers with variadic support. There's no point in using a macro if it won't work for both cases. Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

3 8

[phoenix] New maintainer
by Fletcher, John P 21 Jan '14

21 Jan '14

I have just agreed to play a part in the maintenance of Boost Phoenix. I am working with a lot of help from Joel, Thomas and Eric. I have been looking at the bugs logged on the system and it seems as though there are a number of reported problems which need to be tackled, in particular 9362 and 9363. Please bear with me as I learn the modular-boost system and look for fixes for the problems. If you have any information on your problems with Phoenix, in particular any not already on the bug system, please let me know. Best wishes John

3 3

Reboot the CREST server machines
by DongInn Kim 21 Jan '14

21 Jan '14

Dear All, The current CREST servers need to reboot to kick in a new kernel and to mount a NFS server with a new IP address. If things are not too critical nowadays, I would like to reboot the following server machines next Tuesday (Jan 21st). - lion.crest.iu.edu - tiger.crest.iu.edu - wowbagger.crest.iu.edu - leopard.crest.iu.edu - jaguar.crest.iu.edu Date: Jan 21st, Tuesday Time: 6:00am-6:30am Pacific US time 7:00am-7:30am Mountain US time 8:00am-8:30am Central US time 9:00am-9:30am Eastern US time 12:00pm-12:30pm GMT The list of services that may not be available: - NFS - Web services www.crest.iu.edu www.open-mpi.org www.boost.org svn.crest.iu.edu/svnmanager ... - Mailing lists - Subversion - LDAP authentication (login to the Linux workstations and cutter cluster) Please let me know if you have any questions or concerns about this booting schedule. Regards, -- - DongInn

1 1

bjamming that used to work before modular-boost
by Paul A. Bristow 20 Jan '14

20 Jan '14

I have a jamfile.v2 in a sandbox project that used to work before. I have started using modular-boost, and after some fumbling, I'm using that OK-ish. The message is: Unable to find the Boost source tree in the locations searched. Try setting the environment variable BOOST to point to your Boost tree, or else invoke bjam with the --boost=path option. The Boost include path will not be automatically set. The paths searched were I:\boost-sandbox\guild/../boost I:\boost-sandbox\guild/../Trunk But the file LICENSE_1_0.txt was not found in any of them Unable to find the Boost.Build source tree in the locations searched. Try setting the environment variable BOOST_BUILD to point to your Boost.Build tree, or else invoke bjam with the --boost-build=path option. The paths searched were i:\modular-boost\tools\build\v2 But bootstrap.jam was not found in any of these More failures will very likely follow... (And they did ;-( ) I've tried some guesses at parameters including b2 --boost=i:\modular-boost --boost-build=i:\modular-boost\tools\build -a html without success. I have boost-build.jam at I:\modular-boost Suggestions please. Paul PS I'd like to change environment variables if possible to avoid changing lots of .bat files that call b2. --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

4 8

Forthcoming Boost.Fiber review
by Nat Goodspeed 20 Jan '14

20 Jan '14

Hi all, The review of Boost.Fiber by Oliver Kowalke is scheduled from Monday, January 6th to January 12th. ----------------------------------------------------- About the library: Boost.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. Each fiber has its own stack. A fiber can save the current execution state, including all registers and CPU flags, the instruction pointer, and the stack pointer and later restore this state. The idea is to have multiple execution paths running on a single thread using a sort of cooperative scheduling (versus threads, which are preemptively scheduled). The running fiber decides explicitly when it should yield to allow another fiber to run (context switching). Boost.Fiberinternally uses coroutines from Boost.Coroutine <http://ok73.funpic.de/boost/libs/coroutine/index.html>; the classes in this library manage, schedule and, when needed, synchronize those coroutines. A context switch between threads usually costs thousands of CPU cycles on x86, compared to a fiber switch with a few hundred cycles. A fiber can only run on a single thread at any point in time. docs: http://ok73.funpic.de/boost/libs/fiber/doc/html/index.html<http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/> git: https://github.com/olk/boost-fiber src: http://ok73.ok.funpic.de/boost.fiber.zip<http://ok73.ok.funpic.de/boost.coroutine.zip> --------------------------------------------------- Naturally, you need not wait until the review formally opens to start reviewing the Fiber library. Please always state in your review whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Nat Goodspeed Boost.Fiber Review Manager ------------------------------

6 8

GSoC 2014
by Bjorn Reese 20 Jan '14

20 Jan '14

Deadline for registring as a mentoring organization for GSoC 2014 is 14 Feb 2014. Should we start collecting ideas?

13 20

[build] referring to a tool from an external project
by Eric Niebler 20 Jan '14

20 Jan '14

I'm trying to write a jamfile in an external project that uses boost. The jamfile should invoke the wave tool to preprocess some code as a build action. I have this: actions do_wave { $(>[2]) -o- --config-file wave.cfg $(>[1]) } W = /boost/libs/wave/tool/build//wave ; make preprocess : preprocess.cpp $(W) : do_wave ; I get: > error: Unable to find file or target named > error: '/boost/libs/wave/tool/build//wave' > error: referred to from project at > error: '.' > error: could not resolve project reference '/boost/libs/wave/tool/build' If I use this instead: W = /boost//wave ...it builds the wave dlls, not the command-line tool. So how do I tell it to build the tool? -- Eric Niebler Boost.org http://www.boost.org

3 5

[Math] Permutations?
by Vee Kay 19 Jan '14

19 Jan '14

Hello, Would it be useful for Boost to provide a permutation class? The standard provides a couple of relevant functions (is_permutation, next_permutation) and Boost.Iterator offers a permutation_iterator adaptor. But as far as I can tell, no class that can be manipulated similarly to the mathematical object, something like this: https://gist.github.com/Kojirion/8503800 I admit I do not have many use cases in mind, just the impression this is a useful tool. As an example, once in a gui application I wished to animate the rearranging of a table; writing a permutation class made it easy to get the sequence of transpositions of rows and columns that would yield the desired result. (note though the above api doesn't include an asTranspositions() because I 'm not sure what is the most useful way to represent a transposition). I 'd be happy to hear your thoughts, Albert

2 1

STL::MAP: Printing values only once ..
by Rahul Mathur 18 Jan '14

18 Jan '14

Hi, I have a input.txt file seperator by pipe '|' as - 40147|181|ORANGE|MIKE|XX||1000397900|3500 40148|373|ORANGE|BOB|XX||1078889400|4500 40149|673|ORANGE|TREY|XX||1095159900|5500 I only wish to have all the FIRST(ID=40147) and LAST FIELD(PRICE=3500) to be printed for three lines as given above. I am reading as - -- #include <iostream> #include <fstream> #include <sstream> #include <string> #include <boost/algorithm/string.hpp> using namespace std; struct FILE_INPUT { int ID; int Asset_ID; char T_Name[]; char Symbol[]; char Series[]; char Gap; int Date; int price; }; int main() { typedef std::map<int, int> unordmap; unordmap ask; FILE_INPUT fl_inp; memset( &fl_inp, 0, sizeof(fl_inp) ); ifstream in ("input.txt"); string s; const char delimiter = '|'; while ( getline (in, s) ) { trim( s ); if ( !s.empty() ) { stringstream strm( s ); string item; getline( strm, item ); stringstream stra( item ); string tmp; getline( stra, tmp, delimiter ); { stringstream strb( tmp ); strb >> fl_inp.ID; } getline( stra, tmp, delimiter ) { stringstream strb( tmp ); strb >> fl_inp.price; } ask.insert( std::make_pair((fl_inp.ID),(fl_inp.price)) ); unordmap::iterator pos = ask.begin(); for (pos = ask.begin(); pos != ask.end(); ++pos) { std::cout << "ID: " << pos->first << "\t" << "Price: " << pos->second << std::endl; } std::cout << " " << endl; } } } -- The map is being inserted with both ID as key and price as value but while printing it prints the values thrice as - ID: 40147 Price: 3500 ID: 40147 Price: 4500 ID: 40148 Price: 5500 ID: 40147 Price: 3500 ID: 40148 Price: 4500 ID: 40149 Price: 5500 The MAP should print all values together only once as - ID: 40147 Price: 3500 ID: 40148 Price: 4500 ID: 40149 Price: 5500 -- Can I maintain some checks to print all values simply once. Thanks.

5 4

Re: [boost] Request for comments on super-project workflow doc
by Peter Dimov 18 Jan '14

18 Jan '14

Robert Ramey wrote: > John Maddox brought up the question of "bridge libraries" (?) . An > example would be the serialization library includes tests for boost > variant but doesn't use boost variant itself. So if one includes just the > modules which the serialization library uses to build - you'll get one set > of modules which won't include the ability to run the test set. If you > include all the modules which test set requires, you're going to include > half of boost. Yes, in general, there are three sets of dependencies: what the library headers depend on, what the library sources depend on, and what the library tests depend on, each a superset of the previous one. This doesn't make such a tool worthless or impossible though. And - FWIW - bridge libraries are something else, I think. The problem there is that, f.ex. a library X may not depend on the serialization library but making X's types serializable would. A bridge library XS could solve this by depending on both X and serialization and providing the necessary support. In principle, I've always argued that libraries should be designed in such a way so that adding support should not require including a header, but that's not the path of least resistance and if one doesn't specifically keep that requirement in mind, it's rare to see it satisfied. (And it's not always possible.) For example, here's how the smart pointers provide hash support without including anything: namespace boost { // hash_value template< class T > struct hash; template< class T > std::size_t hash_value( boost::intrusive_ptr<T> const & p ) { return boost::hash< T* >()( p.get() ); } } // namespace boost and this is how a type may be specified to be a (boost::bind) placeholder, again without any inclusions: namespace boost { template<class T> struct is_placeholder; template<int I> struct is_placeholder< my_placeholder > { BOOST_STATIC_CONSTANT( int, value = I ); }; } // namespace boost

3 3

Prefix Trie
by Michael Conlen 18 Jan '14

18 Jan '14

I recently discovered that there seems to be a lack of good Prefix Tries in C++. There are many basic ones and I think a C implementation ran all of 12 lines of code, but something with a nice interface and iterator seemed lacking. (Stop me if I'm missing something here) So I'm interested in developing Prefix (and possibly a Radix) Trie containers in C++. I could see a use for both sequence and map containers; however this would be a learning experience for me. If there's interest in such a creature I'm happy to go through the review process as necessary. Having said that, is there interest in having such a library and if so what are the pointers on what would be expected (particularly any boost-isms)? -- Mike

3 2

[lockfree] Faster ring-buffer queue implementation
by Alexander Krizhanovsky 16 Jan '14

16 Jan '14

Hello, some time ago I've implemented lock-free multi-producer multi-consumer queue on ring buffer and recently I've compared it's performance with current (Boost 1.55.0) boost::lockfree::queue - it shows 50% better performance. I've made just a quick glance on the Boost implementation and noticed that it uses CAS operations which is basically slower than simple RMW (atomic increment in our case) on modern x86-64 hardware. Maybe I've made some mistake in boost::lockfree::queue usage. If so then I'll be obliged for pointing me out the problem in my benchmark. Otherwise I'm wondering if it has sense to integrate the queue implementation into boost::lockfree? The algorithm description is available at http://www.linuxjournal.com/content/lock-free-multi-producer-multi-consumer… The source code of the queue with the benchmark for boost::lockfree::queue: https://github.com/krizhanovsky/NatSys-Lab/blob/master/lockfree_rb_q.cc And the benchmark results are available here: http://natsys-lab.blogspot.ru/2014/01/natsys-lock-free-queue-in-comparison.… Thanks! -- Alexander Krizhanovsky NatSys Lab. (http://natsys-lab.com) tel: +7 (916) 717-3899, +7 (499) 747-6304 e-mail: ak(a)natsys-lab.com

3 4

[Fibers] asio handler not respecting scheduler
by Eugene Yakubovich 16 Jan '14

16 Jan '14

While working on factoring out the scheduling algorithm, I noticed that when fibers are used with asio, the completion handler manually invokes the fiber: boost-fiber/include/boost/fiber/asio/detail/yield.hpp: In yield_handler<T>: void operator()( T t) { * ec_ = boost::system::error_code(); * value_ = t; fiber_->set_ready(); boost::fibers::detail::scheduler::instance()->spawn( fiber_); boost::fibers::detail::scheduler::instance()->run(); } Why does it call spawn? Shouldn't the scheduler (run method that follows) decide which fiber to run next? What happens if there's another fiber with a higher priority that's ready? A similar issue also comes up when launching a new fiber. The documentation supports the implementation in that the control immediately is transferred to the new fiber. However, shouldn't the scheduling algorithm decide when the new fiber should run? As an unrelated issue, I think this maybe a bug -- it's setting the active fiber to ready instead of waiting: void round_robin::yield() { <snip> // set active fiber to state_waiting active_fiber_->set_ready(); <snip> } Same issue in round_robin_ws and asio/round_robin. Regards, Eugene

3 4

[Boost.Sync] no master branch?
by Eric Niebler 16 Jan '14

16 Jan '14

What is Boost.Sync and why doesn't its repository have a master branch? -- Eric Niebler Boost.org http://www.boost.org

7 14

1.56 release schedule?
by Tim Blechmann 15 Jan '14

15 Jan '14

hi all, according to the website, the 1.56 beta was scheduled on dec 31st and the release date is feb 3rd ... maybe the release managers could update the release schedule? shifting the dates by a month could be realistic, or what do other people think? cheers, tim

5 7

Re: [boost] [Fibers] Performance
by Brian Wood 15 Jan '14

15 Jan '14

Oliver Kowalke wrote: 2014/1/13 Hartmut Kaiser <hartmut.kaiser(a)gmail.com> >> >> Ping? Any news? I'd make my vote depend on the outcome of the performance >> tests. >> > > I'll add performance tests but I doubt that I could finish to implement the > tests till Wednesday. > I've to look through the tests provided by the HPX-project, select some and > try to understand > what they are doing. Maybe a few weeks could be given to Oliver to do the testing. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1

[graph][BGL][PBGL] Proposed patches
by bminano 15 Jan '14

15 Jan '14

Hi, I found two problems using the graph library, concretely using it in parallel. Swimming into the code I think I found possible solutions to that. I proposed two patches in boost Trac at tickets #9549 and #8250, but I had no response. I am afraid the tickets were not revised, so I think publishing here would be a good idea. Maybe the maintainers of the library want to apply that patches for future releases. I hope so, as I am working in a project that will select boost graph as a masterpiece of graph simulations. I the responsible wants to ask me about the bugs I'll be glad to answer. -- View this message in context: http://boost.2283326.n4.nabble.com/graph-BGL-PBGL-Proposed-patches-tp465789… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Re: [boost] GSoC 2014
by Christopher Kormanyos 15 Jan '14

15 Jan '14

> hi sir, > i m deepak, i want to apply for GSOC 2014 . i am good in c++, mathematics > and having proficient knowledge of algorithms. > i have a special interest for following boost libraries > - Boost.Math Generalized Hypergeometric Functions Well, that's a cool one for sure :-) Thank you for your interest, deepak. It's still a bit early in the game because we have not yet found an organization administrator. Nor have we formally applied as an organization for GSoC 2014. So keep an eye on the progress and base your actions accordingly. > Boost.Multiprecision > new data structures and algorithms I do not believe that we will be working on Multiprecision in this year's GSoC. Some of the things are already done, and others, quite honestly have too much novel research character for GSoC. This is an area for independent research at the moment. > i want to know if i could start early or work with boost trac or you tell me what to do As I mentioned, keep an eye on our progress. If Boost applies, and if Boost gets nominated for GSoC, then you may apply. It is a worldwide competition, so it always helps to apply early, ask questions on the board, write a good proposal, and generally do your best. Good luck. Chris. On Tuesday, January 14, 2014 8:45 PM, deepak goel <deepakgoel7514(a)gmail.com> wrote: On Monday, January 13, 2014 2:08:39 AM UTC+5:30, Christopher Kormanyos wrote: >> I have just added a page for GSoC 2014 here >> https://svn.boost.org/trac/ boost/wiki/SoC2014 > >Thank you Vicente. > >I have added "Boost.Math Generalized Hypergeometric Functions". > >Sincerely, Chris. > > > > > >On Sunday, January 12, 2014 6:45 PM, Vicente J. Botet Escriba <vicent...(a)wanadoo.fr> wrote: > >Le 12/01/14 18:20, Christopher Kormanyos a écrit : > >>> Deadline for registering as a mentoring organization for GSoC 2014 is 14 >>> Feb 2014. >>> Should we start collecting ideas? >> I believe we have several good ideas. We need to get moving. >> >> Does anyone know how to put up the skeleton of this kind >> of page? (Or can anyone point me in the right direction on >> how to do it?) >> >> https://svn.boost.org/trac/ boost/wiki/SoC2013 >> >> The hard part, I believe, will be finding one or more org admins. >> The guys did a great job last year, and set the bar pretty high. >> >> * I can probably mentor a student. >> * I can help collecting and writing the ideas on SVN trac. >> * I could also help writing the GSoC 2014 proposal and with recruiting. >> >> But org admin would potentially be too much of a commitment for me. >> >> Is anyone interested in being org admin for GSoC 2014? >> >Hi, > >I have just added a page for GSoC 2014 here >https://svn.boost.org/trac/ boost/wiki/SoC2014. > >Be free to add your projects and ideas. >Vicente > > hi sir, i m deepak, i want to apply for GSOC 2014 . i am good in c++, mathematics and having proficient knowledge of algorithms. i have a special interest for following boost libraries - Boost.Math Generalized Hypergeometric Functions Boost.Multiprecision new data structures and algorithms i want to know if i could start early or work with boost trac or you tell me what to do ______________________________ _________________ >Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost > > >______________________________ _________________ >Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost >

2 1

Regression test results starting to become available
by Beman Dawes 15 Jan '14

15 Jan '14

http://beta.boost.org/development/tests/master/developer/summary.html http://beta.boost.org/development/tests/develop/developer/summary.html Only a few of the testers have cycled. Some testers are only reporting results for 15 or so libraries. That's an artifact of getting started; these testers cycle the full tests will appear. --Beman

5 6

[git] annotated SVN synchronization for boost.test (example only)
by Peter A. Bigot 15 Jan '14

15 Jan '14

Below is an annotated sequence of (bash) command-line git operations that I used in a local copy of Boost.Test to understand what was happening in it, with no intention of proposing this be what the maintainers actually do with the module. Boost.Test is particularly interesting because master has been essentially unchanged for four years, while there are significant modifications pending in develop. A few of the changes on master make the SVN synchronization step tricky. People who want to hone their git-fu might find it workwhile to follow these steps in a local workspace to see how they work. I make no claim that they're the only way the same goal could be reached. I also have not used this for further development, so there the resulting structure may be flawed or contrary to strict git-flow expectations. WARNING: DO NOT paste the entire sequence into a shell window: at a couple of places you must manually do what the comment says (e.g., edit the contents of files to resolve conflicts) in order to reach a successful state. # Revert to a clean state where local branches match the origin, and the # working branches from any previous run of the script have been # removed. git fetch origin git checkout master git reset --hard origin/master git checkout develop git reset --hard origin/develop git branch -D synch/master synch/develop basis # git-merge-base identifies the commit to be used when merging things. # We're looking for something better, so no need to go beyond that one. MERGE_BASE=$(git merge-base develop master) # 635b1e38dd643af264c2ea8f0ba08dfb58337e37 echo ${MERGE_BASE} # Examine the history along master and develop, finding the most recent # SVN revision merged from develop into master. This only works if all # previous SVN revisions were also merged; if only select ones were # merged, it's probably best to skip them and keep looking. For # example, master on Boost.Test merged 81913, 63640, 62426, and a couple # others, but the last version that incorporated most prior fixes was # 57993 merged in ${MST_MP_SHA1}. git log ${MERGE_BASE}..master MST_MP_SHA1=2e4f64197956ccb94b24be4ed32abf25ee4b9dd1 # Now find the develop commit that most recently preceded that one in # SVN history. Basically, this is reviewing the log of differences # for the last commit with a SVN revision less than the one selected in # the previous step. BEWARE: If the revision you picked above doesn't # correspond to a develop branch change (e.g., if you picked 81913 which # didn't go into develop until 82756) you will create pain for yourself. git log ${MERGE_BASE}..develop # Here it's commit 57864 in ${DEV_MP_SHA1} DEV_MP_SHA1=fd8d9b3e4e4ab9656b0d880e8c519eabd134638a # Now take a look at what's different between those versions. That's # what'll get lost in a "-s ours" merge if it subsequently appeared in # develop. git diff ${DEV_MP_SHA1}..${MST_MP_SHA1} # There's some whitespace differences, some casts and error messages, # file permission changes, and two small changes from r81913 that we'll # talk about later. # Here's where my technique differs: You could do an "-s ours" merge # from the selected develop commit into master's HEAD as recommended at # https://svn.boost.org/trac/boost/wiki/StartModMaint#Firstpost-svnconversion… # but if you do you might lose cherry-pick commits on master that are # also on develop. Instead, we'll create a new merge point on master at # the synchronization point, and merge from develop. git checkout -b basis ${MST_MP_SHA1} git merge -s ours -m 'SVN merge basis preserving master' ${DEV_MP_SHA1} # Verify that the differences are the ones we accepted earlier: git diff basis..${DEV_MP_SHA1} # Now, let's do some cleanup, and get master and develop branches that # actually fork at the merge point, rather than simply assume the merge # point is identical. This indirectly helps manage the differences that # we threw away with "-s ours". git checkout -b synch/master master git rebase basis # This should show no differences, because we just inserted a commit # that records parentage but changes no content. git diff master synch/master # Do the same at develop. Here we're going to have to resolve any # conflicts between the selected merge point git checkout -b synch/develop develop git rebase basis # 66 patches in we hit one of the differences: git stat # (MANUAL STEP) There's whitespace at the end of build/Jamfile.v2. Edit # the file to remove the diff markers, stage the changes, and tell # rebase to continue. git add -u git rebase --continue # After 204 patches there's another. git stat # (MANUAL STEP) Here you'll see everything is clean except # include/boost/test/impl/framework.ipp. Search for <<<<<< and edit to # keep the one with the upper-case TUT_SUITE. git add -u git rebase --continue # And we're done. Now let's see what changed: git diff develop synch/develop # Some of the differences between master and develop at the SVN merge # point have gone away; these are the ones I suspect but have not # confirmed would have been lost had we merged to master's HEAD instead # of to the base version. A few changes remain that were in master but # not in develop. # You have a choice at this point. If the repository wasn't already # public, I'd reset master (develop) to synch/master (synch/develop) and # move on. But since they were public, merge them; keeps history, # and makes future actions cleaner. git checkout master git merge -m 'Merge in rebased master' synch/master git checkout develop git merge -m 'Merge in rebased develop' synch/develop # Finally, what would happen if we merged develop into master now? git checkout -b test master git merge develop # Very nearly a clean merge. See what's not staged: git stat -u | grep '^.[^ ]' # ## test # UU include/boost/test/utils/runtime/cla/parameter.hpp # UU include/boost/test/utils/runtime/env/variable.hpp # # Again, open the files and look for the diff markers: one uses m!=0 and # the other !!m. Which is right? Use git-blame: git blame origin/master include/boost/test/utils/runtime/cla/parameter.hpp # The master change came in 954d3ab6 which was SVN commit r81913 by # Vicente J. Botet Escriba. Show the change: git log -p 954d3ab6^! git blame origin/develop include/boost/test/utils/runtime/cla/parameter.hpp # The develop change came in 4f7fc06c which was SVN commit r82756 by # Gennadiy Rozental. Show the change: git log -p 4f7fc06c^! # Note that if, back when selecting the SVN merge point, we'd gone with # r81913 things would be completely bolluxed at this point since the # corresponding change didn't come from the develop branch. # (MANUAL STEP) It's Rozental's project, so pick the develop solution # (!!m). Then stage the changes and commit, editing the message to # indicate how you resolved the conflict. git add -u git commit

5 7

[any] Equality
by Bjorn Reese 15 Jan '14

15 Jan '14

I noticed that boost::any does not have an operator== for comparing two boost::any objects. Is this a deliberate choice? Currently I have to (1) compare the types, and (2) convert the values with any_cast (and probably catch bad_any_cast exceptions) and compare them.

4 4

[context] compile failure
by Jürgen Hunold 15 Jan '14

15 Jan '14

Hi Oliver, Boost.Context fails to compile since commit 5f52abd82fb6fb32d7d79575e48b3f26bfff6d27 Author: Oliver Kowalke <oliver.kowalke(a)gmx.de> Date: Thu Jan 9 17:39:59 2014 +0100 add support for 'combined' architeture on MacOS X with error message: - 32-bit : no - 64-bit : no error: at /ive/hunold/src/devel/boost/tools/build/src/kernel/modules.jam:107 error: Unable to find file or target named error: '/boost/architecture//combined' error: referred to from project at error: '/ive/hunold/src/devel/boost/libs/context/build' It seems that config/ is missing the combined.cpp needed for the architecture check. Could you please add it? Tip: Use git config --global status.showuntrackedfiles all to always show new file with "git status". This is from http://qt-project.org/wiki/Setting-up-Gerrit but maybe should be in our wiki,too. Thanks! Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

2 4

Re: [boost] Prefix Trie
by Arash Partow 14 Jan '14

14 Jan '14

On Wed, Jan 15, 2014, Michael Conlen wrote: > > I recently discovered that there seems to be a lack of good Prefix Tries in C++. blah blah blah. > I highly doubt your assertion. In fact I'd go so far as to say, the only language one can find decent-to-excellent implementations of the various algorithms is C++. eg: https://code.google.com/p/patl/

1 0

Adding cstdfloat.hpp - wheres the best place?
by John Maddock 14 Jan '14

14 Jan '14

Folks, Christopher Kormanyos has coded up a version of cstdfloat.hpp for Boost.Math: https://github.com/boostorg/math/blob/bernoulli-tgamma/include/boost/math/t… This header is proposed for C++14, and the C language folks are doing something similar: it provides similar functionality for floating point types that <cstdint> does for integer types: Typedefs: floatN_t float_leastN_t float_fastN_t floatmax_t Macros: BOOST_FLOATN_C(x) // floating point constant of width N. BOOST_FLOAT_N_MIN BOOST_FLOAT_N_MAX BOOST_FLOAT_FASTN_C(x) BOOST_FLOAT_LEASTN_MIN BOOST_FLOAT_FASTN_MIN BOOST_FLOAT_LEASTN_MAX BOOST_FLOAT_FASTN_MAX BOOST_FLOATMAX_C(x) BOOST_FLOATMAX_MIN BOOST_FLOATMAX_MAX Where N is one of 16, 32, 64, 128 and correspond to the IEEE half, single, double and quad types respectively. So... the question is where to best place this? Does anyone object if it goes under boost/cstdfloat.hpp to sit alongside cstdint.hpp? Where should it best be documented and tested? We can obviously add it under the Math lib, but is there a better more "discoverable" place? cstdint.hpp is under integer BTW so it can't go there ;-) Thanks in advance, John.

2 1

[TortoiseGit] New release fixes submodule problem bothering some Boosters
by Beman Dawes 14 Jan '14

14 Jan '14

TortoiseGit release 1.8.7.0 fixes the Submodule Update... crash that was one of the few problems that forced TortoiseGit users to switch to the command line. Thanks to the TortoiseGit folks for jumping on the Boost bug report immediately, and the libgit2 folks who in turn fixed a problem with their library. --Beman

1 0

The Community Maintenance Team proposal accepted
by Beman Dawes 14 Jan '14

14 Jan '14

The Steering Committee has voted to accept the Community Maintenance Team proposal, and Marshall Clow has volunteer to act as the team's fearless leader. See https://dl.dropboxusercontent.com/u/9897665/community-maintenance.htmlfor the actual proposal. Thanks to everyone who contributed ideas and discussion. I tried to capture contributors names in the Acknowledgements section of the proposal. Apologies if I missed anyone. --Beman

14 23

[git] nit in library release documentation
by Peter A. Bigot 14 Jan '14

14 Jan '14

At https://svn.boost.org/trac/boost/wiki/StartModMaint#Lightweightlibraryrelea… there is: git tag -a mylib-1.2.0 git push --tags mylib-1.2.0 # specific tag pushed to avoid pushing all local tags As discussed in a thread on module tagging, --tags should never be used with git push as it pushes all local tags to the remote repository (adding those that did not exist there). There are cases where you might want to do that, but for the specific situation of releasing a tagged library a sufficient and less risky command is: git push mylib-1.2.0 # specific tag pushed to avoid pushing all local tags Peter

2 1

Re: [boost] Is there interest in a collection of call stack utilities?
by Aurelian Melinte 14 Jan '14

14 Jan '14

Hello, To follow up on the discussion https://groups.google.com/forum/#!topic/boost-developers-archive/PSwTBEEe0Ao I was not clear if there is interest for it or not. I went ahead and the first cut of the code is now at https://github.com/melintea/Boost-Call_stack Please feel free to take a look and comment. Regards, Aurelian

6 7

Getting Started with Modular Boost Library Maintenance
by Gly Marvellou 14 Jan '14

14 Jan '14

1 0

Removing support for old compilers
by Joaquin M Lopez Munoz 14 Jan '14

14 Jan '14

Hi Stephen As part of your initiative of removing support for old compilers, are you building somewhere a change log in the form of either a list of compiler deficiencies or compiler versions no longer supported? I understand this should be inserted in a prominent place on the Boost 1.56 release notes and can serve as a reference for lib maintainers reviewing your patches (tracking changesets is harder and commit messages are not always completely illuminating). Thank you, Joaquín M López Muñoz Telefónica Digital

16 51

[Thread] Doc bug?
by Alexander Lamaison 14 Jan '14

14 Jan '14

The docs [1] for the `scoped_thread` and `strict_scoped_thread` says > "While thread call std::terminate() on the destructor is the thread is > joinable, strict_scoped_thread<> or scoped_thread<> join the thread if > joinable. Several other places on the page say something similar. I was under in the impression that Boost.Thread had toyed with adopting this behaviour to match `std::thread` but decided against it after complaints on this list. Am I wrong? [1] http://www.boost.org/doc/libs/1_55_0/doc/html/thread/ScopedThreads.html Alex -- Swish - Easy SFTP for Windows Explorer (http://www.swish-sftp.org)

3 3

[range] flat_array_view feature request.
by Mostafa 14 Jan '14

14 Jan '14

I think having a flat_array_view adapter in boost would be helpful. Something along the lines of https://github.com/m-w-a/sandbox/blob/master/flat_array_view.cc What do the maintainer(s) of Range and others think? Mostafa

5 7

[block_ptr] & Java
by Phil Bouchard 14 Jan '14

14 Jan '14

Hello everyone, In a quest to speed up my Android applications and knowing Java is written in C++, I decided to discuss with the OS community openjdk.java.net to try to introduce them block_ptr. But the conversation was dead in the water probably due to the lack of developers. So I just have questions: - Does anybody know if Java uses Boost? - block_ptr hasn't been reviewed yet but memory management is an important subject. Are there unanswered questions about it? Sincerely, -Phil Experiment proposal to refute Special Relativity for the interested: http://finitetheory.com/files/experiment.pdf

11 39

[predef] [rfc] Mutually exclusive definitions?
by Rene Rivera 13 Jan '14

13 Jan '14

After going back and re-reading various commentaries for the review of Boost.Predef and some after the review I'm questioning a design choice of Boost.Predef. Currently Boost.Predef will define multiple symbols when, for example, a compiler "emulates" another compiler. The current common occurrence of this is the GCC compiler which many other compilers emulate by defining the GCC version macros. This is no longer the case for the OS definitions though. The OS definitions are mutually exclusive. And hence in order to make for a more consistent behavior I am considering changing the library to make not just OS defs mutually exclusive. But also making compiler, library, and architecture mutually exclusive. And I'm asking for some general feedback as to what the most useful approach, from using Boost.Predef, is likely to be. In particular I'm considering the following choices: 1. Simple mutual exclusion of BOOST_ARCH_*, BOOST_COMP_*, BOOST_LIB_C_*, BOOST_LIB_STD_*, and of course BOOST_OS_* definitions. 2. Mutual exclusion of the base/real definitions with the addition of *_EMULATED definitions when multiple defs detected. For example for GCC we would have BOOST_COMP_GCC_EMULATED indicated the version of the GCC being emulated. 3. No mutual exclusion of base definitions but with the addition of a "flag" definition when multiple defs are detected. For example with GCC it would have the usual BOOST_COMP_GCC but also have a "#define BOOST_COMP_GCC_IS_EMULATED". 4. Do nothing and live with multiple definitions and the current discrepancy in behavior for BOOST_OS definitions. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

3 2

[TypeTraits] propose new callable-type call traits
by Hui Li 13 Jan '14

13 Jan '14

I've implemented a few traits classes (code attached below) that, for a given callable-type T, and a set of Args..., detects whether the function call T::operator()(Args...) would be (1) valid, (2) ambiguous, or (3) none is viable. where T is allowed to have arbitrary overloaded operator()'s. This could be useful for programmers who want to (1) make the function call only when it's valid, (2) generate customized error/warning messages when it's ambiguous, or handle/redirect it without getting an ambiguous compiler error, and (3) redirect non-viable calls to some default behavior, which can be different than how it's handled when the call is ambiguous. If people are interested, I suppose this could be a useful addition to TypeTraits. I would appreciate any feedback! For clarity, the implementation and demonstration attached below is written in c++11. It can be easily ported to c++98/03 compilers by using TypeTratis to replace the std type traits, BOOST_TYPEOF_KEYWORD to replace decltype, and Boost.Preprocessor to generate code for arbitrary arity. - Hui Li #include <utility> #include <type_traits> template < typename T > struct is_callable; template < typename Signature > struct has_valid_call; template < typename Signature > struct has_ambiguous_call; template < typename Signature > struct has_no_viable_call; template < typename T > struct is_callable { struct yes {}; struct no {}; struct ambiguate_seed { void operator()(); }; template < typename U, bool=std::is_class::value > struct ambiguate : U, ambiguate_seed {}; template < typename U > struct ambiguate<U,false> : ambiguate_seed {}; template < typename U, typename = decltype(&U::operator()) > static constexpr no test(int); template < typename > static constexpr yes test(...); static bool constexpr value = std::is_same<decltype(test< ambiguate<T> >(0)),yes>::value ; typedef std::integral_constant<bool,value> type; }; template < typename T, typename... Args > struct has_valid_call< T(Args...) > { struct yes {}; struct no {}; template < typename U, bool = is_callable::value > struct impl { template < typename V, typename = typename std::result_of<V(Args...)>::type > struct test_result { using type = yes; }; template < typename V > static constexpr typename test_result<V>::type test(int); template < typename > static constexpr no test(...); static constexpr bool value = std::is_same<decltype(test(0)),yes>::value; using type = std::integral_constant<bool, value>; }; template < typename U > struct impl<U,false> : std::false_type {}; static constexpr bool value = impl<T>::value; using type = std::integral_constant<bool, value>; }; template < typename T, typename... Args > struct has_ambiguous_call< T(Args...) > { struct ambiguate_seed { void operator()(...); }; template < class U, bool = is_callable::value > struct ambiguate : U, ambiguate_seed { using ambiguate_seed::operator(); using U::operator(); }; template < class U > struct ambiguate<U,false> : ambiguate_seed {}; static constexpr bool value = not has_valid_call< ambiguate<T>(Args...) >::value; using type = std::integral_constant<bool, value>; }; template < typename T, typename... Args > struct has_no_viable_call< T(Args...) > : std::integral_constant<bool, not (has_valid_call<T(Args...)>::value or has_ambiguous_call<T(Args...)>::value)> {}; #include <string> #include <vector> struct test { void operator()(int); void operator()(double); void operator()(int,double); template < typename T > typename std::enable_if< not std::is_integral<T>::value >::type operator()(const T&, int=0){} template < typename T > typename std::enable_if< std::is_integral<T>::value >::type operator()(const std::vector<T>&, T*){} template < typename T > int operator()(const std::string&, int){} }; int main(int argc, const char * argv[]) { static_assert( is_callable<test>::value , ""); static_assert( not is_callable<int>::value , ""); static_assert( has_valid_call<test(char const*,long)>::value , ""); static_assert( has_valid_call<test(std::string&,long)>::value , ""); static_assert( has_valid_call<test(std::vector<int>, int*)>::value , ""); static_assert( has_no_viable_call<test(std::vector<double>, double*)>::value , ""); static_assert( has_valid_call<test(int)>::value , ""); static_assert( has_valid_call<test(int,double)>::value , ""); static_assert( not has_valid_call<test(int,double,int)>::value , ""); static_assert( not has_ambiguous_call<test(double)>::value , ""); static_assert( has_ambiguous_call<test(unsigned)>::value , ""); static_assert( not has_no_viable_call<test(unsigned)>::value , ""); static_assert( not has_no_viable_call<test(int)>::value , ""); static_assert( has_no_viable_call<test(void)>::value , ""); return 0; }

5 16

[Macro]Test Case grouping using Traits
by Hemanth Choudary M V (RBEI/ETA1) 13 Jan '14

13 Jan '14

Hello, I have observed that in native unit test framework(c++), there is an option to group test cases using attributes which are reflected as traits in the Test Explorer window in MS VS2012. Following is a an example of the same: BEGIN_TEST_METHOD_ATTRIBUTE(TestMethod3) TEST_OWNER(L"SuperMan") TEST_PRIORITY(2) TEST_METHOD_ATTRIBUTE(L"Category",L"Slow") END_TEST_METHOD_ATTRIBUTE() TEST_METHOD(TestMethod3) { Assert::AreEqual(2,6); } How can this be achieved via Boost Unit Test Library? Are there macros to achieve the same? Mit freundlichen Grüßen / Best Regards, Hemanth Choudary MV RBEI/ETA1

2 1

[Test] Problems with debug::break_memory_alloc
by Fredrik Orderud 13 Jan '14

13 Jan '14

I have a problem with the memory-leak detection logic in boost.test. What happens when unit_test::framework::init starts up on Windows is that memory-leak detection is first explicitly activated. Secondly, debug::break_memory_alloc is called with a value (default is 1). Activation of leak detection is great, but to always override the allocation number to break on is not necessary a good idea if the user has already set a value from a debugger. In my case I am investigating a leak from a static member allocated prior to main and/or boost.test being invoked. In that case, I need to break the program early to be able to set the allocation number to break on. This works well by itself, but it's _very_ confusing when boost.test afterwards replaces my allocation number with a default value. Could it be possible to modify boost.test, so that it only modifies the allocation number to break on if the user has explicitly requested to break on a given allocation? Thanks in advance, Fredrik Orderud

2 4

[test] broken (fails to compile) with boost.timer since 1.48
by Jamie Allsop 13 Jan '14

13 Jan '14

Boost.Test fails to compile since 1.48 when Boost.Timer is included. I find that often I want to use timers when testing. I reported this back in 2012 along with a comprehensive patch that fixes the issue. On the eve of 1.55 I see the patch has still not been applied, despite an original agreement to do so. Unfortunately I don't have commit privileges so I am unable to do this myself. The original discussion from here: http://lists.boost.org/Archives/boost/2012/09/196811.php went as follows: > On 25/09/12 18:14, Gennadiy Rozental wrote: >> Jamie Allsop<ja11sop<at> yahoo.co.uk> writes: >> >>> >>> These are patches we've been using for some time locally, the recent >>> discussions highlighted the importance of pushing patches like these to >>> a wider audience. >>> >>> In summary the key changes are: >>> >>> * https://svn.boost.org/trac/boost/ticket/7410 >>> * https://svn.boost.org/trac/boost/ticket/7397 >> >> These are fine. I'll try to check it in on a weekend > > Excellent thanks! Yet https://svn.boost.org/trac/boost/ticket/7397 was never applied. With changes to Boost.Test since then it is likely that the patch needs modified to be applied but that should not be too hard. Apart from that I'd like to see the suite of 4 patches applied as a whole. So far only https://svn.boost.org/trac/boost/ticket/7410 has been applied but the patches address severe use-case short-comings in Boost.Test that make it viable for broader testing use. I've summaried them below. * https://svn.boost.org/trac/boost/ticket/7397 * https://svn.boost.org/trac/boost/ticket/7410 (applied) * https://svn.boost.org/trac/boost/ticket/7417 (small) * https://svn.boost.org/trac/boost/ticket/7419 (small) Original discussion that didn't really get very far was in these threads: * http://lists.boost.org/Archives/boost/2012/09/196811.php * http://lists.boost.org/Archives/boost/2012/09/196828.php For those who are interested I've pasted my original motivations from the year old thread below as a reminder. Basically the patches allow Boost.Test to: * compile with Boost.Timer (so not broken) * output test progress on the fly in a format other tools could parse * allows Boost.Test to be used for live test diagnostics in running systems in a 'test' mode Jamie * https://svn.boost.org/trac/boost/ticket/7410 (applied) * all test cases/suites have file and line information captured so that external tools can use the Boost.Log output to create links into the source tree, answering questions like, "What is this test case?". It is possible to simply follow the link and see. * https://svn.boost.org/trac/boost/ticket/7417 * update the Boost.Test log output to include summary status information when a test case or suite is completed. This includes the test status, assertions passed and total assertions. This allows live test status to be viewed and nicer tools to be built around this. For example each test can be shown starting, in progress and then complete with the resulting status in detail. I should note that Boost.Test reports currently output this additional test status but this is done only on *completion of all tests* and so *cannot* be used to show live progress. * this additional test status as part of the log can be easily captured using regular expressions if HRF is used and many IDEs will allow colourisation, autolinking and so on using similar approaches. * https://svn.boost.org/trac/boost/ticket/7397 * update Boost.Test to use the new Boost.Timer classes introduced in Boost 1.48. This can be suppressed through the use of a macro should the old timers be preferred. The new Boost.Timer provides much better timing information than the old Boost.Timer library. You should refer to the library itself for an explanation of why the previous timer library was deprecated: http://www.boost.org/doc/libs/1_51_0/libs/timer/doc/index.html * https://svn.boost.org/trac/boost/ticket/7419 Essentially the patch does two things: * It allows boost::unit_test_framework::init() to be called more than once. The result is to reset the test status and master test suite so that new tests can be added and new reports generated through multiple calls. The CLA parsing is also reset. Recent changes to this code may make my call to clear() redundant. I'll let Gennadiy be the judge of that. * This first change then allows the framework setup and teardown to be encapsulated in a helper class (not provided in the patch but one could be). In our systems we use a helper class that exposes a simple API that allows the user to implement a method where test units can be added directly to the master test suite - see the ticket for an example. As I said the patch focuses solely on enabling the possibility of writing such a class, not the class itself. * It provides scoped Boost.Test arguments for the commandline when BOOST_TEST_USE_QUALIFIED_COMMANDLINE_ARGUMENTS is defined. All command line arguments are then called --boost.test.<argument> for example --boost.test.log_level instead of --log_level. This of course means that all Boost.Test related arguments will not clash with any program arguments. On its own this is a generally useful feature as it allows custom main() functions to pass arguments down to other components during simple unit testing.

2 1

Boost unit test with BOOST_NO_EXCEPTIONS
by driscoll 13 Jan '14

13 Jan '14

I work on a team that uses compiles with exception support disabled. (That... is not my decision, and no value judgments on that, please. :-)) I'd kind of like to use the unit test library. However, at a surface level it has lots of uses of raw try/catch/throw instead of BOOST_TRY/BOOST_CATCH/BOOST_THROW. At a deeper level, I suspect what's doing is throwing an exception on an EXPECT or ASSERT failure -- and thus that disabling exceptions will basically mean that a test failure will cause an immediate abort in the program. (I guess I can hack around that in an ugly but somewhat-reasonable way.) How hopeless is using the library with BOOST_NO_EXCEPTIONS? Evan

3 2

(no subject)
by Gly Marvellou 13 Jan '14

13 Jan '14

Hi, I'm a CS major and new to this list. I want to contribute to Boost C++ libraries under GSOC 14. Can someone guide me through? Gly

1 0

Data-Structures, Ideas. GSoC 2014
by Ankit Vadehra 12 Jan '14

12 Jan '14

Hi, I'm Ankit Vadehra, and i was contacting to ask whether Boost is considering participation in GSoC 2014, and if it is, then are there some new ideas of some priority Data Structures Classes that are to be introduced in Boost ?? For Example, previously have worked on Trie Data Structure as well as Boom Filters and so on, but none of these advanced data-structures were merged in the main library, anyways.. Anyways, are there any new ideas?? GSoC, ain't that far away now, and Idea Page is till not up.. ?? Is someone working on it, by any chance ? Thanks.! -- Ankit.Vadehra "The Code Is free, But its Priceless" "Exactly, which way is Forward ?"

1 0

[trac] where is david_abrahams?
by Eric Niebler 11 Jan '14

11 Jan '14

Dave is still listed as the primary maintainer of several libraries, but Trac won't let me assign a new bug to him. "david_abrahams" isn't one of the choices in the Owner drop down. Where'd he go? -- Eric Niebler Boost.org http://www.boost.org

2 2

[multi_index][ann] Boost.MultiIndex 1.56 preview: major update with new hashed index implementation
by Joaquín Mª López Muñoz 11 Jan '14

11 Jan '14

Hi, Those interested can already download the preview of Boost.MultiIndex as it'll be shipped in Boost 1.56: https://github.com/boostorg/multi_index/archive/master.zip Full release notes can be read at https://rawgithub.com/boostorg/multi_index/master/doc/release_notes.html#bo… The most important change is a complete reimplementation of the internals of hashed indices, so that erasure of elements is constant-time regardless of the level of occupancy of the internal bucket array (previously, performance degraded as the bucket was being depleted.) A full description of the new data structure as compared with other popular implementations of unordered associative containers is given at: http://bannalia.blogspot.com/2013/10/implementation-of-c-unordered.html http://bannalia.blogspot.com/2013/10/implementation-of-c-unordered_25.html Along with some performance results: http://bannalia.blogspot.com/2013/11/measuring-insertion-times-for-c.html http://bannalia.blogspot.com/2013/11/measuring-insertion-times-for-c_16.html http://bannalia.blogspot.com/2013/11/measuring-erasure-times-for-c-unordere… http://bannalia.blogspot.com/2013/11/measuring-lookup-times-for-c-unordered… The new data structure has been thoroughly tested but some pre-shipping feedback is always welcome, so if you test this please report back. Thank you, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

3 5

Re: [boost] Call for Review: Boost.Test documentation rewrite
by Brian Wood 10 Jan '14

10 Jan '14

Gennadiy Rozental: > I am all for working with Richard on new docs. I am just not sure this > particular version worth time people will need to spent to get used to it. > What Boost.Test really need is to document new release. And this is what we > should be targeting. New features and new docs look and feel will make it > all worth while. I'm not using this library, but I agree with Gennadiy. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

1 0

Fumbling with modular Boost and GIT
by Paul A. Bristow 10 Jan '14

10 Jan '14

I have recently been fumbling with Modular Boost to do some routine maintenance and update of documentation on Boost.Math, with generally most unhappy results. Although this is partly from my general modest familiarity with GIT, I feel that the documentation of the process of doing things is woefully thin. There are far too many vital details assumed or unsaid. I'm posting this in the hope that someone will produce a fully documented and illustrated blow-by-blow (preferably using Tortoise GIT and including its displays) description of how to work cooperatively on the develop branch, and a specific library development sub-branch. This should cover (at least) getting changes to headers in /boost and /libs made by others, making a change to a header file, making a change to tests, testing it using an IDE, and making a change to an example (containing some embedded Quickbook) in and IDE and running it, and to changing Quickbook files in the /library/doc folder, and finally pushing. And now, for a change, I'm off for a little quiet alligator wrestling ;-) Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 2

Re: [boost] [Removing support for old compilers]
by Michael H. Cox 09 Jan '14

09 Jan '14

1 0

Proposed -> Boost.Application : Article -> How to Extend Application Modes
by Renato Forti 09 Jan '14

09 Jan '14

Hi Richard, Thanks for your reviews. Based on them, You be interested in help me improve the library? You seem to have great knowledge on the side windows and your help would be great! What are the best practices to follow? In your opinion how do you think the API should be encapsulated? Thanks a lot

1 0

[Program Options] fix for #6797 breaks compilation
by Jürgen Hunold 09 Jan '14

09 Jan '14

Hi Volodya, the fix for #6797 in 4ae33ce15e5b6345e6eefa19466fdf7cd28a7bbd breaks compilation if Boost.ProgramOptions on msvc-11.0 and -12.0. See full error log with msvc-11.0 attached. It seems that the export macros changes the template evaluation somehow, so msvc now needs "decrement" and "advance" member. The short error is: E:\dev\devel\boost\boost/iterator/iterator_facade.hpp(402) : error C2039: 'decrement' : is not a member of 'boost::program_options::detail::common_config_file_iterator' E:\dev\devel\boost\boost/iterator/iterator_facade.hpp(420) : error C2039: 'advance' : is not a member of 'boost::program_options::detail::common_config_file_iterator' I'm not sure how to implement at least empty stubs or if this can be otherwise worked around. Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

4 3

Once accepted, when does a library undergo further review?
by legalize+jeeves＠mail.xmission.com 08 Jan '14

08 Jan '14

[Please do not mail me a copy of your followup] Boost has a good peer review process for accepting a new library. However, once a library has been accepted, it doesn't seem to go through any more peer review. Is the maintainer just trusted to embrace the spirit of Boost's peer review acceptance process for all further changes to a library? -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

8 11

Proposed -> Boost.Application : Article -> How to Extend Application Modes
by Renato Forti 08 Jan '14

08 Jan '14

Hi All, I want to share one simple article about proposed Boost.Application! In the current version of Boost.Application, its officially supports 2 types of application: --------------------------------------------------- * Common Application [This kind of application is a usual Interactive Terminal application] * Server Application [This kind of application generates a Service (Windows), or a background process/Daemon (Unix)] In this article I try to show how user can extend the Boost.Application to support new application mode/type: --------------------------------------------------- * A Simple 'Apache Content Generator Module' http://www.codeproject.com/Articles/695937/Creating-a-New-Application-Mode Others Boost.Application Resources: --------------------------------------------------- [code] https://github.com/retf/Boost.Application [docs] http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/index.html Please, let me know what you think about Boost.Application! -- Renato

2 1

[git] Some headers are executable
by Andrey Semashev 08 Jan '14

08 Jan '14

Hi, I've just checked out git and ran b2 headers and noticed that some headers have executable attribute. For example: $ find boost -executable -type f boost/pointee.hpp boost/assign.hpp boost/graph/vf2_sub_graph_iso.hpp boost/indirect_reference.hpp boost/parameter.hpp boost/detail/indirect_traits.hpp boost/detail/is_xxx.hpp boost/range.hpp This was not the case with svn. Is this the result of the transition? Can this be fixed?

2 4

[github] default PR destination
by Tim Blechmann 08 Jan '14

08 Jan '14

hi all, any opinion to change the default branch from "master" to "develop"? with the boost branching model all contributions via github's pull requests apparently have to go to "develop" rather than going directly into "master", so this should be the default destination for pull requests. github allows to set the default branch [1] ... not sure if this has any other side effects, but i'd vote for changing the default to "develop". thoughts? tim [1] https://help.github.com/articles/setting-the-default-branch

10 14

[ANN] Registration for C++Now 2014 is Open
by Boris Kolpackov 07 Jan '14

07 Jan '14

Hi, Registration is now open for the eighth annual C++Now conference (formerly BoostCon) which will be held in Aspen, Colorado, USA, May 12th to 17th, 2014. C++Now is a general C++ conference for C++ experts and enthusiasts. It is not specific to any library/framework or compiler vendor and has three tracks with presentations ranging from hands-on, practical tutorials to advanced C++ design and development techniques. In particular, one of the tracks is dedicated exclusively to tutorials. Last year the conference sold out pretty quickly and we expect it to happen again this year. As a result, we encourage anyone interested in attending to register early. Additionally, early bird hotel reservations end January 10th. For more information on registering, visit: http://cppnow.org/2014/01/2014-registration-is-open/ For early bird hotel reservations, visit: http://cppnow.org/location/lodging/ For general information about the conference, visit: http://cppnow.org/about/ Boris

1 0

[git] An ignore file for the top-level repository?
by Daryle Walker 07 Jan '14

07 Jan '14

I cloned a copy of the git version of the top-level Boost repository, which recursively added the individual libraries. The directions added two commands to run boot-strapping and build scripts. I had to set up an ".gitignore" file so the GUI GitHub app won't complain about those synthesized files. Shouldn't there already be an ignore file there that does this? (You only list the top-level files & directories; nested files automatically get ignored too.) I couldn't sync (i.e. upload) the ignore-file since I don't have write access for the top-level repository. So I'll get a conflict once someone does add an ignore file for everyone? Daryle W.

4 3

[build] Broken in develop?
by Andrey Semashev 07 Jan '14

07 Jan '14

Hi, I tried to update and recreate links to headers today and stumbled into this: $ b2 headers Unable to load Boost.Build: could not find build system. --------------------------------------------------------- /home/lastique/src/boost/boost-build.jam attempted to load the build system by invoking 'boost-build tools/build/src ;' but we were unable to find "bootstrap.jam" in the specified directory or in BOOST_BUILD_PATH (searching /home/lastique/src/boost/tools/build/src, /usr/share/boost-build). Please consult the documentation at 'http://www.boost.org'. Also, bootstrap.sh also seems to be not working: $ ./bootstrap.sh ./bootstrap.sh: 1: ./bootstrap.sh: ./tools/build/src/engine/build.sh: not found Building Boost.Build engine with toolset ... Failed to build Boost.Build build engine Consult 'bootstrap.log' for more details bootstrap.log contains: ./bootstrap.sh: 218: cd: can't cd to ./tools/build/src/engine I remember there were discussions about moving Boost.Build somewhere, and it appears that some scripts were updated for that but the actual Boost.Build code is still in tools/build/v2. I did 'git pull' in the Boost root, it's up to date.

3 3

[git] Did the user assignments carry over?
by Daryle Walker 07 Jan '14

07 Jan '14

What I mean is if the Subversion-to-Git transfer also mapped user accounts. Did any change in the Subversion repository that is blamed on me (on my Subversion/Trac account) get mapped to a change in the Git version that still blames me (on my GitHub account)? Or did all that blame information get purged? (Of course, assuming that it's possible, how would the converters know the mapping? And what happens when a Subversion user has dropped out or otherwise hasn't gotten a GitHub account (yet)?) Daryle W.

2 1

Proposed patch for Ticket #8250
by Borja Miñano 07 Jan '14

07 Jan '14

Good afternoon, I have proposed a patch for Ticket #8250 that is attached in the trac system. As I am new, I post to inform to take it into account for following versions. Hope this could help. -- Un saludo, Borja Miñano IAC3 - Universitat de les Illes Balears Mateu Orfila Building. Office F-213. Cra. Valldemossa km. 7,5 E-07122 Palma de Mallorca. Balears. Spain. Phone: +34 971 173 000 ext. 1318

4 3

[timer] conflict between tools/inspect and libs/timer
by Peter A. Bigot 06 Jan '14

06 Jan '14

A recent merge to master libs/timer includes support for inspect in the test suite, but the invocation requires support for a search-root argument in inspect. That support is not present in tools/inspect's master branch, causing the libs/timer tests to fail. The following process could help detect inter-module dependencies like this: * Initiate your workspace with the superproject checked out on branch master and all modules on the resulting commit (ignore branches). * Checkout the develop branch only for the module(s) you're working on. * Use "git submodule summary" at the superproject level to determine how your workspace differs from what would be expected in the master branch. If multiple modules show changes, there's a risk of coupling, and it might not be appropriate to push any of them to their master branch. * Use "git submodule update" to reset things when switching development between modules. Peter

6 16

graph_theory_review.html patch
by Mads Jensen 05 Jan '14

05 Jan '14

Hi, The link for the TOC of Introduction to Algorithms is broken. I've attached a patch to fix this; it now points to the page for the 3rd edition where the TOC and a sample chapter about multi-threaded algorithms can also be found. Also, the fourth author (Stein) is added. What are the rules for submission and inclusion of patches? I consider this quite trivial, but I have in mind to implement a couple of graph algorithms in order to learn the library, and get more acquainted with C++. Please CC when responding; I'm not yet a member of this mailing list. Thank you. -- Med Venlig Hilsen / Kind Regards, Mads Jensen Never laugh at live dragons. -- Bilbo Baggins [J.R.R. Tolkien, "The Hobbit"]

2 1

[develop] quickbook compile failure
by Tim Blechmann 05 Jan '14

05 Jan '14

hi all, trying to compile quickbook with apple's clang gives me the following error: > tim@moka-mac:~/dev/boost/tools/quickbook$ ../../b2 > Performing configuration checks > > - symlinks supported : yes > - hardlinks supported : yes > ...patience... > ...patience... > ...found 3129 targets... > ...updating 6 targets... > common.mkdir ../../dist > common.mkdir ../../dist/bin > darwin.compile.c++ ../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/files.o > src/files.cpp:129:47: error: implicit instantiation of undefined template 'std::pair<boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::__1::pair<const boost::filesystem::path, boost::intrusive_ptr<quickbook::file> > > >, bool>' > boost::tie(pos, inserted) = files.emplace( > ^ > ../../boost/detail/container_fwd.hpp:145:42: note: template is declared here > template <class T1, class T2> struct pair; > ^ > src/files.cpp:257:14: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section> mapped_sections; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:287:18: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section>::const_iterator section, > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:348:14: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section>::const_iterator find_section( > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:269:39: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > original_pos, source().size(), > ^~~~~~ > src/files.cpp:276:51: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > pos - original->source().begin(), source().size())); > ^~~~~~ > src/files.cpp:282:51: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > pos - original->source().begin(), source().size(), > ^~~~~~ > src/files.cpp:351:18: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section>::const_iterator section = > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:375:14: error: too few template arguments for class template 'list' > std::list<mapped_file> mapped_files; > ^ > ../../boost/detail/container_fwd.hpp:134:47: note: template is declared here > template <class T, class Allocator> class list; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:401:18: error: no viable conversion from 'intrusive_ptr<struct quickbook::mapped_file>' to 'intrusive_ptr<struct quickbook::file>' > file_ptr r = data->new_file; > ^ ~~~~~~~~~~~~~~ > ../../boost/smart_ptr/intrusive_ptr.hpp:66:5: note: candidate constructor not viable: no known conversion from 'boost::intrusive_ptr<mapped_file>' to 'quickbook::file *' for 1st argument > intrusive_ptr( T * p, bool add_ref = true ): px( p ) > ^ > ../../boost/smart_ptr/intrusive_ptr.hpp:90:5: note: candidate constructor not viable: no known conversion from 'boost::intrusive_ptr<mapped_file>' to 'const boost::intrusive_ptr<quickbook::file> &' for 1st argument > intrusive_ptr(intrusive_ptr const & rhs): px( rhs.px ) > ^ > ../../boost/smart_ptr/intrusive_ptr.hpp:76:5: note: candidate template ignored: substitution failure [with U = quickbook::mapped_file]: no type named 'type' in 'boost::detail::sp_enable_if_convertible<quickbook::mapped_file, quickbook::file>' > intrusive_ptr( intrusive_ptr const & rhs, typename boost::detail::sp_enable_if_convertible<U,T>::type = boost::detail::sp_empty() ) > ^ ~~~~ > ../../boost/smart_ptr/detail/operator_bool.hpp:52:5: note: candidate function > operator unspecified_bool_type() const BOOST_NOEXCEPT > ^ > src/files.cpp:413:16: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > return data->new_file->source().empty(); > ^~~~~~~~~~~~~~ > src/files.cpp:418:16: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > return data->new_file->source().size(); > ^~~~~~~~~~~~~~ > src/files.cpp:447:18: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section>::const_iterator start = > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:457:20: error: reference to non-static member function must be called > for (++start; start != x.data->new_file->mapped_sections.end() && > ^~~~~ > src/files.cpp:458:21: error: reference to non-static member function must be called > start->our_pos < end; ++start) > ^~~~~ > src/files.cpp:458:45: error: reference to non-static member function must be called > start->our_pos < end; ++start) > ^~~~~ > src/files.cpp:461:21: error: reference to non-static member function must be called > start->original_pos, start->our_pos - begin + size, > ^~~~~ > In file included from src/files.cpp:12: > In file included from ../../boost/unordered_map.hpp:17: > ../../boost/unordered/unordered_map.hpp:295:35: error: implicit instantiation of undefined template 'std::pair<boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::__1::pair<const boost::filesystem::path, boost::intrusive_ptr<quickbook::file> > > >, bool>' > std::pair<iterator, bool> emplace( > ^ > src/files.cpp:129:47: note: in instantiation of function template specialization 'boost::unordered::unordered_map<boost::filesystem::path, boost::intrusive_ptr<quickbook::file>, boost::hash<boost::filesystem::path>, std::__1::equal_to<boost::filesystem::path>, std::__1::allocator<std::__1::pair<const boost::filesystem::path, boost::intrusive_ptr<quickbook::file> > > >::emplace<boost::filesystem::path, quickbook::file *>' requested here > boost::tie(pos, inserted) = files.emplace( > ^ > ../../boost/detail/container_fwd.hpp:145:42: note: template is declared here > template <class T1, class T2> struct pair; > ^ > In file included from src/files.cpp:12: > In file included from ../../boost/unordered_map.hpp:17: > ../../boost/unordered/unordered_map.hpp:299:20: error: no viable conversion from 'emplace_return' (aka 'pair<iterator, bool>') to 'std::pair<iterator, bool>' > return table_.emplace( > ^~~~~~~~~~~~~~~ > fatal error: too many errors emitted, stopping now [-ferror-limit=] > 20 errors generated. > > "g++" -ftemplate-depth-300 -O3 -finline-functions -Wno-inline -Wall -gdwarf-2 -fexceptions -g0 -DBOOST_ALL_NO_LIB=1 -DBOOST_DETAIL_CONTAINER_FWD -DBOOST_FILESYSTEM_NO_DEPRECATED -DBOOST_FILESYSTEM_STATIC_LINK=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DNDEBUG -I"../.." -c -o "../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/files.o" "src/files.cpp" > > ...failed darwin.compile.c++ ../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/files.o... > darwin.compile.c++ ../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/id_generation.o > src/id_generation.cpp:29:18: error: too few template arguments for class template 'vector' > typedef std::vector<id_placeholder const*> placeholder_index; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:33:13: error: expected a class or namespace > placeholder_index::iterator, placeholder_index::iterator, > ^ > src/id_generation.cpp:33:42: error: expected a class or namespace > placeholder_index::iterator, placeholder_index::iterator, > ^ > src/id_generation.cpp:34:18: error: too few template arguments for class template 'vector' > std::vector<std::string>& generated_ids); > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:36:10: error: too few template arguments for class template 'vector' > std::vector<std::string> generate_ids(document_state_impl const& state, boost::string_ref xml) > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:38:14: error: too few template arguments for class template 'vector' > std::vector<std::string> generated_ids(state.placeholders.size()); > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:44:22: error: too few template arguments for class template 'vector' > typedef std::vector<id_placeholder const*>::iterator iterator; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:45:35: error: member reference base type 'placeholder_index' (aka 'int') is not a structure or union > iterator it = placeholders.begin(), end = placeholders.end(); > ~~~~~~~~~~~~^~~~~~ > src/id_generation.cpp:45:63: error: member reference base type 'placeholder_index' (aka 'int') is not a structure or union > iterator it = placeholders.begin(), end = placeholders.end(); > ~~~~~~~~~~~~^~~~ > src/id_generation.cpp:55:41: error: indirection requires pointer operand ('iterator' (aka 'int') invalid) > while (group_end != end && (*group_end)->num_dots == (*it)->num_dots) > ^~~~~~~~~~ > src/id_generation.cpp:55:67: error: indirection requires pointer operand ('iterator' (aka 'int') invalid) > while (group_end != end && (*group_end)->num_dots == (*it)->num_dots) > ^~~ > src/id_generation.cpp:74:14: error: too few template arguments for class template 'vector' > std::vector<unsigned>& order; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:76:34: error: too few template arguments for class template 'vector' > placeholder_compare(std::vector<unsigned>& order) : order(order) {} > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:95:14: error: too few template arguments for class template 'vector' > std::vector<unsigned>& order; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:99:22: error: too few template arguments for class template 'vector' > std::vector<unsigned>& order) > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:124:14: error: too few template arguments for class template 'vector' > std::vector<unsigned> order(state.placeholders.size()); > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:128:30: error: non-const lvalue reference to type 'quickbook::xml_processor::callback' cannot bind to a value of unrelated type 'quickbook::get_placeholder_order_callback' > processor.parse(xml, callback); > ^~~~~~~~ > src/document_state_impl.hpp:143:48: note: passing argument to parameter here > void parse(boost::string_ref, callback&); > ^ > src/id_generation.cpp:131:28: error: member reference base type 'placeholder_index' (aka 'int') is not a structure or union > sorted_placeholders.reserve(state.placeholders.size()); > ~~~~~~~~~~~~~~~~~~~^~~~~~~~ > src/id_generation.cpp:133:52: error: member reference base type 'placeholder_index' (aka 'int') is not a structure or union > if (order[p.index]) sorted_placeholders.push_back(&p); > ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ > fatal error: too many errors emitted, stopping now [-ferror-limit=] > 20 errors generated. > > "g++" -ftemplate-depth-300 -O3 -finline-functions -Wno-inline -Wall -gdwarf-2 -fexceptions -g0 -DBOOST_ALL_NO_LIB=1 -DBOOST_DETAIL_CONTAINER_FWD -DBOOST_FILESYSTEM_NO_DEPRECATED -DBOOST_FILESYSTEM_STATIC_LINK=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DNDEBUG -I"../.." -c -o "../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/id_generation.o" "src/id_generation.cpp" > > ...failed darwin.compile.c++ ../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/id_generation.o... > ...skipped <p../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static>quickbook for lack of <p../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static>files.o... > ...skipped <p../../dist/bin>quickbook for lack of <p../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static>quickbook... > ...failed updating 2 targets... > ...skipped 2 targets... > ...updated 2 targets... compiler: > tim@moka-mac:~/dev/boost/tools/quickbook$ g++ -v > Configured with: --prefix=/Applications/Xcode.app/Contents/Developer/usr --with-gxx-include-dir=/usr/include/c++/4.2.1 > Apple LLVM version 5.0 (clang-500.2.79) (based on LLVM 3.3svn) > Target: x86_64-apple-darwin13.0.0 > Thread model: posix is this a known issue? thanks, tim

4 5

[regex] diagnosis and fix for #9544
by Peter A. Bigot 05 Jan '14

05 Jan '14

Trac rejected my comment because it has links in it, so here's the relevant information. This issue arose as of [http://gcc.gnu.org/viewcvs/gcc?view=revision&revision=197248 GCC SVN commit 197248] which implements [http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3582.html N3582]. It occurs because the [http://gcc.gnu.org/viewcvs/gcc/trunk/gcc/cp/parser.c?r1=197248&r2=197247&pa… change on line 4109] preserves parentheses at the front end (with that change reverted, gcc works correctly). This is now [http://gcc.gnu.org/bugzilla/show_bug.cgi?id=59681 PR C++/59681]. The fix in GCC is not trivial, so I've just made [https://github.com/boostorg/regex/pull/1 pull #1] so the trivial fix for boost (remove the parens) can be applied.

1 0

Request for comments on super-project workflow doc
by Beman Dawes 04 Jan '14

04 Jan '14

The release managers with help from Peter Dimov have been developing super-project workflow documentation. See https://svn.boost.org/trac/boost/wiki/SuperProjectWorkflow Comments welcome! Thanks, --Beman

6 11

Removing _1 from the global namespace (again)
by Peter Dimov 04 Jan '14

04 Jan '14

If we're going to call the next release 2.0, we'll be allowed some latitude with respect to breaking changes, so maybe this is the right time to finally remove the Bind placeholders from the global namespace. This will, however, break many things all around Boost (to say nothing about the outside world), as a quick grep can readily reveal. And, consequently, it will generate a certain amount of work for the maintainers of the affected libraries that, from their point of view, can appear unnecessary. So I'll need a certain amount of community consensus before going ahead and breaking everyone's code. :-)

14 15

[git] How to create a new submodule from existing submodule components?
by Beman Dawes 04 Jan '14

04 Jan '14

The release managers with help from Peter Dimov have been developing super-project workflow documentation. See https://svn.boost.org/trac/boost/wiki/SuperProjectWorkflow In that discussion, Peter wrote: >Hi everyone, > >As a first step of moving Boost.Assert out of Utility and into its own submodule, >I've extracted its files (along with the history) into a test repository of mine: > > https://github.com/pdimov/assert > >If you consider its contents acceptable, please let me know what should the procedure >be for moving this repository into boostorg and making it a proper submodule. I've take the liberty of moving this discussion to the main list for wider input on three questions. Please respond on this thread to the question asked in the subject line, and comment on the Proposed assert submodule and Super-project workflow on their threads. Thanks, --Beman

3 5

[git-help] Doc. Suggestion: How to setup a custom boost "distribution"
by Klaim - Joël Lamotte 04 Jan '14

04 Jan '14

This is a suggestion for documentation, that "could" not be a good idea, I'm not totally sure. The goal would be to provide a simple recipe to setup a boost super-repo fork that would contain only a specific set of libraries, chosen by the user. I believe it would be of interest to a lot of companies that consider using boost but don't want to have to use the whole package. As Ryppl isn't ready yet, I was thinking that just providing a way to do it using the fork would already be helpful. It would also allow some people to provide a well tested custom distribution that would be easy to keep up to date. I expect people to experiment such things (I think I will at some point). The goal is NOT to resolve dependencies, or detect dependencies issues. It would be only to show that you can strip down the count of libraries if you wish in your own fork. The user will have to deal with dependency issues on his own, which is ok in a lot of cases, I assume. However, I'm not a specialist and I will not have time to try my idea immediately so I would like to ask if the following process is enough to do achieve the goal: 1. fork boost super-repo (clone locally, clone on your own server, or use the github fork button); 1.1. optionally, switch to a company or project-specific branch name; 2. in the fork, to remove libraries you don't want: 2.1. go in the root directory and edit the '.gitmodules' file 2.2. in this file, you will see each library module defined as follow: [submodule "any-library"] path = libs/any-library url = ../any-library.git fetchRecurseSubmodules = on-demand 2.3. locate and remove these declarations of each library you want to remove from the fork. 2.4. save the file. 3. commit the change 4. [git pull ?] 5. compile boost as usual. I'm not sure about the 4th point, but I think an operation is necessary so that git removes the library directories in the local clone. If these instructions are correct (once 4 is confirmed) and complete and are considered useful, maybe putting them somewhere in the doc would be worthwhile. Thoughts?

3 3

[git] mode and whitespace changes remaining between develop and master
by Nathan Ridge 04 Jan '14

04 Jan '14

Hello, I am trying to follow the instructions for "Establishing a merge point after SVN Conversion" [1] for the Boost.Range library. After cherry-picking all the commits to develop that have not been merged to master, onto master (all locally, I have not pushed anything yet), I am finding that there are still some mode and whitespace differences between master and develop (see the diff at the bottom of the message). I cannot find the commits that are responsible for these changes - is it safe to just ignore them? Thanks, Nate [1] https://svn.boost.org/trac/boost/wiki/PostCvtMergePoint diff --git a/include/boost/range.hpp b/include/boost/range.hpp old mode 100755 new mode 100644 diff --git a/include/boost/range/adaptor/strided.hpp b/include/boost/range/adaptor/strided.hpp old mode 100644 new mode 100755 diff --git a/include/boost/range/adaptor/transformed.hpp b/include/boost/range/adaptor/transformed.hpp old mode 100644 new mode 100755 diff --git a/include/boost/range/algorithm_ext/is_sorted.hpp b/include/boost/range/algorithm_ext/is_sorted.hpp old mode 100644 new mode 100755 diff --git a/include/boost/range/detail/demote_iterator_traversal_tag.hpp b/include/boost/range/detail/demote_iterator_traversal_tag.hpp old mode 100644 new mode 100755 diff --git a/include/boost/range/detail/implementation_help.hpp b/include/boost/range/detail/implementation_help.hpp old mode 100644 new mode 100755 index 1f7d163..ca12fa4 --- a/include/boost/range/detail/implementation_help.hpp +++ b/include/boost/range/detail/implementation_help.hpp @@ -21,13 +21,13 @@ #include <wchar.h> #endif -namespace boost +namespace boost { namespace range_detail { template <typename T> inline void boost_range_silence_warning( const T& ) { } - + ///////////////////////////////////////////////////////////////////// // end() help ///////////////////////////////////////////////////////////////////// @@ -36,7 +36,7 @@ namespace boost { return s + strlen( s ); } - + #ifndef BOOST_NO_CWCHAR inline const wchar_t* str_end( const wchar_t* s, const wchar_t* ) { @@ -51,7 +51,7 @@ namespace boost ; return s; } -#endif +#endif template< class Char> inline Char* str_end( Char* s ) @@ -64,7 +64,7 @@ namespace boost { return boost_range_array + sz; } - + template< class T, std::size_t sz> inline const T* array_end( const T BOOST_RANGE_ARRAY_REF()[sz] ) { @@ -74,7 +74,7 @@ namespace boost ///////////////////////////////////////////////////////////////////// // size() help ///////////////////////////////////////////////////////////////////// - + template< class Char> inline std::size_t str_size( const Char* const& s ) { @@ -96,7 +96,7 @@ namespace boost } } // namespace 'range_detail' - + } // namespace 'boost' diff --git a/include/boost/range/iterator.hpp b/include/boost/range/iterator.hpp index 4ba9122..2966bdf 100644 --- a/include/boost/range/iterator.hpp +++ b/include/boost/range/iterator.hpp @@ -25,46 +25,46 @@ namespace boost { -#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) - - namespace range_detail_vc7_1 - { - template< typename C, typename Sig = void(C)> - struct range_iterator - { - typedef BOOST_RANGE_DEDUCED_TYPENAME - mpl::eval_if_c< is_const<C>::value, - range_const_iterator< typename remove_const<C>::type>, - range_mutable_iterator<C>>::type type; - }; +#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) - template< typename C, typename T> - struct range_iterator< C, void(T[])> - { - typedef T* type; - }; - } - -#endif + namespace range_detail_vc7_1 + { + template< typename C, typename Sig = void(C)> + struct range_iterator + { + typedef BOOST_RANGE_DEDUCED_TYPENAME + mpl::eval_if_c< is_const<C>::value, + range_const_iterator< typename remove_const<C>::type>, + range_mutable_iterator<C>>::type type; + }; + + template< typename C, typename T> + struct range_iterator< C, void(T[])> + { + typedef T* type; + }; + } + +#endif template< typename C> struct range_iterator { #if BOOST_WORKAROUND(BOOST_MSVC, == 1310) + + typedef BOOST_RANGE_DEDUCED_TYPENAME + range_detail_vc7_1::range_iterator<C>::type type; + +#else - typedef BOOST_RANGE_DEDUCED_TYPENAME - range_detail_vc7_1::range_iterator<C>::type type; - -#else - - typedef BOOST_RANGE_DEDUCED_TYPENAME - mpl::eval_if_c< is_const<C>::value, + typedef BOOST_RANGE_DEDUCED_TYPENAME + mpl::eval_if_c< is_const<C>::value, range_const_iterator< typename remove_const<C>::type>, range_mutable_iterator<C>>::type type; - -#endif + +#endif }; - + } // namespace boost #endif

2 1

[MPL] true_type,false_type versus true_,false_
by Erik Erlandson 04 Jan '14

04 Jan '14

I've been using true_type and false_type in some of my interfaces, for example: https://github.com/erikerlandson/edit_distance/blob/master/include/boost/al… However it seems as though true_ and false_ are more compatible with MPL logic functions. Is there any particular reason to use one over the other? Would it be preferable to use true_ and false_?

2 1

[regression] OK to merge? Should tools/regression be a submodule?
by Beman Dawes 04 Jan '14

04 Jan '14

* The directory tools/regression/src/report was missing from svn branches/release, so it is also missing from modular boost master. Although I haven't checked, that probably means the are other unmerged changes in develop. OK to merge develop to master (after suitable testing?) * Should tools/regression be a submodule? Does anyone remember why it remains a part of the super-project? If we are going to convert tools/regression to a submodule, should we do it now or wait until the dust settles? --Beman

5 11

Re: [boost] [AFIO] Callback API
by Bjorn Reese 03 Jan '14

03 Jan '14

Moving the discussion from boost-users to boost-dev, and thus the full context is quoted. On 12/21/2013 01:53 AM, Niall Douglas wrote: > On 20 Dec 2013 at 19:16, Bjorn Reese wrote: > >>> Can you suggest something? I honestly can't think of anything simpler >>> which also provides strong write ordering guarantees. >> >> I have not given this much thought so consider the following a >> brainstorm. > > We really ought to move this off boost-users ... but we'll see how it > goes. > >> I am thinking about an API that uses handles that looks more like Asio >> sockets. Write ordering can be handled, not by batching operations >> together, but rather calling the next write operation from the callback >> of the previous operation (Asio-style.) This will not always yield good >> performance, but oftentimes that is less relevant. If you need >> performance, then the "advanced" dispatcher API is available. >> >> So there could be a file handle (and directory handle) class for file >> (directory) manipulation calls, which hides all the details of the >> dispatcher etc. >> >> class file_handle >> { >> public: >> void read(buffer, read_callback); >> void write(buffer, write_callback); >> // and so on >> }; >> >> class directory_handle >> { >> public: >> void create(name, create_callback); // uses file(single) or dir(single) >> void remove(name, remove_callback); // uses rmdir(single) >> void watch(name, watch_callback); // directory monitoring >> // and so on >> }; > > I'm struggling to see the merit in such an approach - it would be > incredibly verbose and complex to write even simple solutions, > because i/o on files is not like sockets, *especially* that you > almost never must strongly order i/o across a sequence of multiple > sockets, but that is a very common case with files e.g. during ACID. First, it follows a pattern that is familiar to Asio users. So rather than you being the only one who can write applications on top of Afio, you get a broader community who are already familiar with the callback approach. Second, you can more easily combine it with Asio socket code to create compound services that mixes socket and file access. For instance, a peer-to-peer file distribution mechanism. > AFIO tries to help users to not write callbacks except when > necessary, but if you do want a user defined callback you simply > chain a call() or completion() operation to the item whose completion > you want called back upon. > > The idea is, you see, that you subclass the async_io_dispatcher class > with additional completion handlers, and use those as building blocks > for further subclasses of async_io_dispatcher. That hopefully gets > people to break up their callbacks into reusable completion handlers, > and saves people writing and debugging code. > Before you say "this should be in the documentation", yes it should > and will be after Paul gets his directory monitoring implementation > working. I'm thinking that will form the fourth section in the > beginner's tutorial - how to modularise and make reusable the > normally bespoke glue code which makes up traditional callbacks. It > might actually be worth adding a section 3b which shows how the naïve > approach in 3a is a very stupid idea :) > > As much as this sort of operation dependency graph based design works > well for its niche, I agree there is a swathe of code which ends up > looking like the find in files implementation, and for that hopefully > fibers will make look much more sane. I am not arguing against the current API. Instead, I am arguing for the addition of a more familiar Asio-style callback API. I have no trouble with a fiber-enchanced API (similar to Asio with coroutines.)

3 5

[MSM] Additional template arguments for process_event
by Juan Carlos Franzoy 03 Jan '14

03 Jan '14

The short question is: Would it be possible/convenient that boost::msm::back::state_machine::process_event receive more template parameters? template< class Event, typename... ARGS > process_event( const Event& event, ARGS&&... args ); args been forwarded to transition actions? I've been searching in boost.development mailing list archives and didn't see this question before. The need of additional template parameters is based on the fact that ARGS may not be defined at the moment of the state_machine isntantiation. Note: I would love to notice that I am wrong, and all this is an unnecessary complication, please let me know if that is the case. Thanks for reading. The long story follows: I am trying to use MSM for the first time. I am evaluating the factibility and convenience of a library to try to make easier the construction of protocol stacks over Boost.Asio. Protocol stack layers are often Finite State Machines. The idea is that the user of the library would program reusable 'layers' and use a library facility called LayerLinker to links the layers. For example this is a simplified pseudocode: template< typename STACK, int POSITION > class LayerLinker { typedef ... layer_t; typedef LayerLinker<STACK,POSITION+1> upper_linker_t; typedef LayerLinker<STACK,POSITION-1> lower_linker_t; layer_t layer_; upper_linker_t *up_; lower_linker_t *low_; public: LayerLinker( boost::asio::io_service& ios ) : layer_{ios} {} template<class EVENT> void processUpstreamEvent( const EVENT& ev ) { layer_.processUpstreamEvent( *this /* let the layer know my type */, ev ); } // similar for processDownstreamEvent() // Called by layer_ to send an event to the upper layer template<class EVENT> void sendUpstreamEvent( const EVENT& ev ) { if ( up_ ) { up_->processUpstreamEvent( ev ); } } // similar for sendDownstreamEvent() }; struct MyTopLayer { typedef ... my_fsm_t; my_fsm_t myFsm_; public: template<class LINKER, class EVENT> void processUpstreamEvent( LINKER& linker, const EVENT& ev ) { // in transition actions the FSM can send events to upper layers. myFsm.process_event( ev, linker /* additional parameter here */ ); } // similar to processDownstreamEvent }; // similar for MyMiddleLayer and MyBottomLayer int main() { typedef boost::mpl::vector<MyTopLayer,MyMiddleLayer,MyBottomLayer> stack_t; boost::asio::io_service ios; LayerLinker<stack_t, 0> topLinker{ios}; LayerLinker<stack_t, 1> middleLinker{ios}; LayerLinker<stack_t, 2> bottomLinker{ios}; topLinker.setLowerLinker( middleLinker ); middleLinker.setUpperLinker( topLinker ); middleLinker.setLowerLinker( bottomLinker ); bottomLinker.setUpperLinker( middleLinker ); topLinker.processDownstreamEvent( InitEvent{} ); ios.run(); } // from asio callbacks borromLinker.processUpstreamEvent( ReadEvent{...} ); Although I could make it without extra parameters to process_event, it is basically a workaround. THANKS A LOT for reading 95 lines. Juan Carlos Franzoy

2 1

[assert] Proposed assert submodule
by Beman Dawes 02 Jan '14

02 Jan '14

The release managers with help from Peter Dimov have been developing super-project workflow documentation. See https://svn.boost.org/trac/boost/wiki/SuperProjectWorkflow In that discussion, Peter wrote: >Hi everyone, > >As a first step of moving Boost.Assert out of Utility and into its own submodule, >I've extracted its files (along with the history) into a test repository of mine: > > https://github.com/pdimov/assert > >If you consider its contents acceptable, please let me know what should the procedure >be for moving this repository into boostorg and making it a proper submodule. I've take the liberty of moving this discussion to the main list for wider input on three questions. Please respond on this thread to the question asked in the subject line, and comment on "How to create a new submodule from existing submodule components" and Super-project workflow on their threads. Thanks, --Beman

1 0

[Trac] Captcha not working - blocking contributions
by Alexander Lamaison 02 Jan '14

02 Jan '14

I tried to include some code in a ticket (#9531, to be precise) and Trac tried to make me complete a captcha to prove I'm not spam. However, the captcha doesn't appear: https://drive.google.com/file/d/0B-RwWpWIiF0VRXVjTE5nM0VHekE/edit?usp=shari… Any ideas? Alex -- Swish - Easy SFTP for Windows Explorer (http://www.swish-sftp.org)

1 1

[Boost.Container] documentation problems
by John M. Dlugosz 01 Jan '14

01 Jan '14

A slightly old version of the flat_map documentation <http://www.boost.org/doc/libs/1_49_0/doc/html/boost_container_header_refere…> defines flat_map's Pred wrong: template<typename Key, typename T, typename Pred = std::less< std::pair< Key, T> >, typename A = std::allocator<T> > class flat_map; It should be std::less<Key>. Why do I care about a slightly old version, you might ask? Well, the current version doesn't seem to document it at all! If I go to the "latest version" link, <http://www.boost.org/doc/libs/1_55_0/doc/html/boost_container_header_refere…> doesn't show any definition for flat_map itself, just for comparison operators and other non-member templates. I can't find any means of navigating into the actual documentation for the class members, assuming it still exists. This is generally true for the other containers on that web page.

2 1

[git] Bumping git version requirement to 1.7.10
by Beman Dawes 01 Jan '14

01 Jan '14

https://svn.boost.org/trac/boost/wiki/Git/GitHome documents Boost's version requirement for Git, currently at 1.7.3. The regression scripts are using the clone --single-branch option, which became available at git 1.7.10, so we are planning to bump the version requirement. Done anyone have a problem with this? --Beman

6 11

[urgent] Testing help needed..
by Rene Rivera 31 Dec '13

31 Dec '13

I finally have the changes to the regression scripts sufficiently complete that I've managed to do a few minimal cycles of regression testing from the git repos. I now need some help in various ways: 1. General testing.. I need some of the regular testers to do runs with their setups with the new scripts. To test I suggest starting from a new testing location. And follow the usual instructions except get the run.py script from < https://raw.github.com/boostorg/boost/develop/tools/regression/src/run.py>. The options are exactly the same as the SVN version of the scripts (the --tag is mapped to master or develop as needed). If you run patch scripts you will have to adjust paths for the new arrangement. In particular the boost tree is now checked out to <testing-root>/boost_root. 2. Non-nix testing.. I don't have the time or resources available to check if the scripts and git invocations work on Windows. I need one person to test and likely make changes to the regression script to do the right things on Windows. Testing should be the same as above. But doing changes locally and testing them is challenging. The procedure I use is (as shell commands): > mkdir testing-dev > cd testing-dev > link <BOOST_DEVELOP>/tools/regression/src/run.py run.py > ln -s < BOOST_DEVELOP>/tools/regression/xsl_reports xsl_reports > ln -s < BOOST_DEVELOP>/tools/regression/src tools_regression_src > ./run.py --runner=<RUNNER_NAME> --skip-script-download --use-local That lets you edit the regression.py and run.py scripts in your local develop checkout. The options make it skip most of the run.py code, but otherwise make it behave as the regular testing except using your local changes. If you need to test changes to run.py in the normal use case you will have to commit+push the changes and then test. 3. Report generation.. It seems that the reports are failing to get generated for some reason. I suspect that the new scripts putting the git commit SHAs as the tested version number are messing up the results generation. I need someone familiar with the result generation to fix this. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

4 6

[Boost][Proto] BOOST_PROTO_USE_NORMAL_RESULT_OF seems incorrectly defined
by Hui Li 31 Dec '13

31 Dec '13

In proto/proto_fwd.hpp, based on how the macro BOOST_PROTO_USE_NORMAL_RESULT_OF is used, it's meant to be defined when the compiler supports c++11 decltype and implements N3276, for example, BOOST_PROTO_RESULT_OF is boost::result_of when BOOST_PROTO_USE_NORMAL_RESULT_OF is defined. However, its definition seems incorrect, and is inconsistent with the comments next to it. #ifdef BOOST_NO_CXX11_DECLTYPE_N3276 ^^^^^^ should this be #ifndef ? # // Proto can only use the decltype-based result_of if N3276 has been # // implemented by the compiler. # // See http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2011/n3276.pdf # ifndef BOOST_PROTO_USE_NORMAL_RESULT_OF # define BOOST_PROTO_USE_NORMAL_RESULT_OF # endif #endif Am i missing something here? Hui

2 2

Versioning of individual modules
by Peter A. Bigot 31 Dec '13

31 Dec '13

Forked from Re: [boost] [git] tagging in modules Context below. Guided questions follow the quoted context. On 12/30/2013 11:02 AM, Beman Dawes wrote: > On Thu, Dec 26, 2013 at 7:24 PM, Peter A. Bigot <pab(a)pabigot.com> wrote: > >> Not relevant to the original thread, but since I just noticed it: >> >> git-push by default does not push tags: you need to specifically ask for >> the tag to be pushed (by name), or use --tags. So this sequence does >> nothing visible: >> >> git tag -a 1.2 >> git push >> >> Personally I'd prefer if tag symbols were a little more informative than >> "1.2", and followed a pattern that places them in a namespace reserved for >> the module, such as timer-1.2. Because tags aren't normally pushed, >> they're useful for individual developers to use as markers. However, >> git-pull will automatically retrieve tags attached to commits that are >> fetched unless --no-tags is given, so if a repository (from boostorg, or >> another developer) defines (or moves) a tag it might overwrite your local >> tag without warning. So it's important to know what tags you can expect >> might conflict with those in a remote repository to avoid conflicts. >> > Updated: > > https://svn.boost.org/trac/boost/wiki/StartModWorkflow#Releasetags > <https://svn.boost.org/trac/boost/wiki/StartModMaint#Lightweightlibraryrelea…> > https://svn.boost.org/trac/boost/wiki/StartModMaint > #Lightweightlibraryrelease<https://svn.boost.org/trac/boost/wiki/StartModMaint#Lightweightlibraryrelea…> > > >> I'd also really like to see any module that uses internal versioning also >> provide a mechanism by which code can determine which version is being >> used. E.g., for the above there ought to be a <boost/timer/version.hpp> >> header which has: >> >> #define BOOST_TIMER_VERSION_MAJOR 1 >> #define BOOST_TIMER_VERSION_MINOR 2 >> >> Otherwise I'm not seeing any value for module-level version tags in the >> repository. Matter of taste, though. >> > While I'm sympathetic, we should get comments and buy in from library > maintainers before recommending this. Are a lot of libraries already doing > something similar? If so, what? And do we follow Rene's suggestion and > recommend Predef? Could you please start a separate discussion with a > subject that let's maintainers know this is affects them? Thanks! > > There is a tangentially related issue: The git and modular boost related > docs are being developed without any reference to or updating of existing > developer documentation. We need to get that underway. Ditto web site > changes. > > >> I would expect, on superproject release, that each module would continue >> to receive a boost-X.Y tag marking the module commit that corresponds to >> the submodule SHA1 used for the release. This is another reason to make >> sure module-level tags are clearly distinguished (lest somebody think the >> tag corresponds to a boost version rather than a module version). >> > Sounds about right, but we would need to work out the mechanics. Who does > the tagging? A script release managers run? General questions related to this topic: *) When a module pushes to master, must all commits that appear directly on the master branch be considered "stable" or is it only necessary that the HEAD always be stable? The context for this is actually in "[git] avoiding fast forward merges" at http://lists.boost.org/Archives/boost/2013/12/210110.php. It's primarily a superproject decision but module maintainers should be aware of it. *) Should all modules be assigned version numbers, or may module "releases" be unversioned master commits that "inherit" the Boost version when incorporated into a release? My opinion: Don't bother unless there's clear evidence that the module will be shipped or used outside of a versioned Boost installation. *) If a module has a module-specific version number, should it be expected to provide that version number in a standard location and name so that preprocessor directives interrogate and adapt user code based on it? What mechanism should be used for this? My opinion: Absolutely. If the module is named timer (sorry I keep picking on that module), then I would like to see: #include <boost/timer/version.hpp> define a macro BOOST_TIMER_VERSION which has an ordinal integer value that may be used in comparisons in preprocessor conditionals to select available features. I support Rene Rivera's suggestion to use the BOOST_VERSION_NUMBER macro from Boosts.Predef to accomplish this. Of course, if no modules need module-level versioning, this won't be necessary. *) What syntactic format should be used for git tags that record version numbers? My opinion: If the module is named timer, and the version number is 1.2, the tag timer-1.2 would be created and pushed to the boostorg timer repository by the timer maintainer. *) By what process is the superproject version associated with the commit on the master branch that is selected for a given Boost release? My opinion: If the Boost release is 1.56, every module incorporated into that release has a boost-1.56 tag created, identifying the master branch commit that is incorporated into the release. This tag would be added by the release manager when the superproject is tagged using a trivial "git submodule foreach git tag boost-1.56" in the superproject master branch followed by "git submodule foreach push origin boost-1.56" after sanity checks. Other inputs? Peter

2 3

[git-help] clone asks for passphrase for every library
by Nathan Ridge 30 Dec '13

30 Dec '13

Hello, I'm trying out git + modular boost for the first time. When I try to clone the repository as described here [1], I run into a problem where the recursive clone process asks me for my SSH key's passphrase for every submodule (library) that it is checking out. Is there a way to avoid this? Thanks, Nate [1] https://svn.boost.org/trac/boost/wiki/TryModBoost

4 4

[GIL] Pixel Layout Padding?
by TONGARI J 30 Dec '13

30 Dec '13

Hi there, The current gil::pixel design has a deficiency that you can't specify the align of pixel, for example, you can't have an RGBX pixel in GIL where X is padding. An alternative is to introduce a dummy channel for X, but that doesn't seem to be a good idea as we don't want to mess up the color space. So, maybe it'd be better to extend the current design, say, pixel<ChannelValue, Layout>, to something like pixel<ChannelValue, Layout, Align>. Then we can specify RGBX as pixel<uint8_t, rgb_layout_t, 4>, or XRGB as pixel<uint8_t, rgb_layout_t, -4> where minus means left justify. Ideas?

3 11

[git-help][urgent] How do I ignore an upstream change to one file?
by Rene Rivera 30 Dec '13

30 Dec '13

When I attempt to do an update of the boost superproject I get and error: Froggy:develop grafik$ git pull error: Your local changes to the following files would be overwritten by merge: tools/regression/src/regression.py Please, commit your changes or stash them before you can merge. Aborting Froggy:develop grafik$ I know I've made changes. I also know I don't want to throw away my changes. I also know that I don't want to merge the upstream changes to that one file. Hence.. How do I do a pull and have git ignore the upstream of only that file? (i.e. throw away the upstream changes because I know that my changes supersede them) Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

8 13

[git] New doc page: Cautions and Suggestions
by Beman Dawes 30 Dec '13

30 Dec '13

https://svn.boost.org/trac/boost/wiki/GitCautions\ Corrections, comments, and suggestions welcome. --Beman

2 2

[git] Post svn conversion merge point instructions moved
by Beman Dawes 30 Dec '13

30 Dec '13

The post svn conversion merge point instructions have been moved to a separate page. See https://svn.boost.org/trac/boost/wiki/PostCvtMergePoint A set of preparatory steps suggested by Peter Dimov have been added. I'm unsure how Peter's prep steps interact with the actual merge point instructions. Particularly, what SHA is used for the merge point? Please take a look, and then suggest corrections or clarifications. Thanks, --Beman

2 2

[range] Should html docs be checked in?
by Mostafa 30 Dec '13

30 Dec '13

Can the maintainer(s) of range answer this question that came up in the documentation ML: On Sat, 28 Dec 2013 02:09:06 -0800, Daniel James <daniel(a)calamity.org.uk> wrote: > On 28 December 2013 00:15, Mostafa <mostafa_working_away(a)yahoo.com> > wrote: >> >> If html files, or any other files for that matter, are auto-generated >> then >> why are they included in the repo? The reason I ask because this >> difference >> in boostbook version causes a lot of extraneous noise when I do a git >> status. Instead of the three html files I was expecting to be modified >> when >> I changed a qbk file there are 153 extra html files that show up as >> modified. > > For many libraries they aren't. It's up to the library maintainer how > they're managed. What you can do is rebuild the documentation from a > clean checkout and commit that, then later edits shouldn't result in > so many changes.

5 9

[test] still broken in release
by Tim Blechmann 30 Dec '13

30 Dec '13

hi all, i've reported an issue before that boost.test in the release branch is pretty broken. *all* tests of the boost.heap testsuite segfault like this: --Program received signal SIGSEGV, Segmentation fault. 0x00000000005f4975 in boost::unit_test::test_suite::add (this=0x8cefa0, tu=0x9, expected_failures=0, timeout=0) at ../../../boost/test/impl/unit_test_suite.ipp:139 139 m_members.push_back( tu->p_id ); (gdb) bt #0 0x00000000005f4975 in boost::unit_test::test_suite::add (this=0x8cefa0, tu=0x9, expected_failures=0, timeout=0) at ../../../boost/test/impl/unit_test_suite.ipp:139 #1 0x00000000005fda9c in boost::unit_test::ut_detail::test_init_caller::operator() (this=0x8d4e08) at ../../../boost/test/impl/framework.ipp:96 #2 0x00000000006031a2 in boost::unit_test::ut_detail::invoker<int>::invoke<boost::unit_test::ut_detail::test_init_caller> (this=0x7fffffffc36f, f=...) at ../../../boost/test/utils/callback.hpp:42 #3 0x0000000000603071 in boost::unit_test::ut_detail::callback0_impl_t<int, boost::unit_test::ut_detail::test_init_caller>::invoke (this=0x8d4e00) at ../../../boost/test/utils/callback.hpp:89 #4 0x000000000060e03d in boost::unit_test::callback0<int>::operator() (this=0x7fffffffcfc0) at ../../../boost/test/utils/callback.hpp:118 #5 0x000000000060de8a in boost::detail::do_invoke<boost::scoped_ptr<boost::detail::translate_exception_base>, boost::unit_test::callback0<int> > (tr=..., F=...) at ../../../boost/test/impl/execution_monitor.ipp:281 #6 0x000000000060d1a8 in boost::execution_monitor::catch_signals (this=0x7fffffffcfd0, F=...) at ../../../boost/test/impl/execution_monitor.ipp:885 #7 0x000000000060d262 in boost::execution_monitor::execute (this=0x7fffffffcfd0, F=...) at ../../../boost/test/impl/execution_monitor.ipp:1211 #8 0x00007ffff7b0bf33 in boost::unit_test::framework::init (init_func=0x4e3f30 <init_unit_test()>, argc=1, argv=0x7fffffffd198) at ../../../boost/test/impl/framework.ipp:268 #9 0x00007ffff7b22267 in boost::unit_test::unit_test_main (init_func=0x4e3f30 <init_unit_test()>, argc=1, argv=0x7fffffffd198) at ../../../boost/test/impl/unit_test_main.ipp:177 #10 0x00000000004e3f62 in main (argc=1, argv=0x7fffffffd198) at ../../../boost/test/unit_test.hpp:59 -- boost.test in trunk works fine, though ... i wonder, will it eventually be merged to release? tim

7 28

[test] Interest in 'hamcrest'-style checks?
by Jared Grubb 29 Dec '13

29 Dec '13

I recently read "Modern C++ Programming with Test-Driven Development", and I really enjoyed this book and highly recommend it. One of the styles I saw for the first time was "hamcrest"-style assertions. ("Hamcrest" is an anagram of "matchers"; also see http://en.wikipedia.org/wiki/Hamcrest.) For a quick idea, imagine there is a BOOST_CHECK_THAT macro that looks like this: (excuse my choice of names here, we can pick better ones if people like the idea) BOOST_CHECK_THAT( str, IsEqualTo(expStr) ); BOOST_CHECK_THAT( str, HasSubstring(needleStr) ); BOOST_CHECK_THAT( str, Not(HasSubstring(badStr)) ); BOOST_CHECK_THAT( vec, Contains(42) ); Comparing them to current boost::test assertions, usually the two are directly equivalent, and it's just a matter of style. At first, I was unconvinced of a need for this. However, there are a few scenarios where the hamcrest-style actually are really helpful: BOOST_CHECK_THAT(vec, Any(Contains(42), Contains(-42)) ); BOOST_CHECK_THAT(str, All(StartsWith("abc"), HasSubstring("lmnop"), EndsWith("xyz")) ); BOOST_CHECK_THAT(count, All(GE(0), LT(10)) ); BOOST_CHECK_THAT(vec, HasSubsequence(otherVec) ); BOOST_CHECK_THAT(vec, Sorted(IsEqualTo({1, 2, 3})) ); BOOST_CHECK_THAT(optionalStr, Any(IsEqualTo(boost::none), Deref(IsEqualTo("str"))); Sure, almost all of this is already doable: BOOST_CHECK_EQUAL_COLLECTIONS( /* sorry, but I really dislike this one :) */ ); BOOST_CHECK( std::count(vec.begin(), vec.end(), 42) && std::count(vec.begin(), vec.end(), -42) ); And, yes, you can create a helper functors today: BOOST_CHECK( Contains(vec, 42) && Contains(vec, -42) ); But hamcrest still gives these advantages over even that: * Dont repeat yourself: -- the value under test appears only once in the check expression; this is really helpful if you want to test an expression ("future.get()") that can only be called once * Better diagnostics: -- when something fails, you can get a detailed error (eg: "blah does not contain the element blah" or "str does not start with blah") -- when you have "Any" conditions, "errors" get squashed if some other condition passes, but all are shown if none pass -- composed tests can provide nested diagnostics; eg: for All(A, Any(B,C)), you'd get something like "'...A...' is true, but none of { '...B...' , '...C...' } are true", but spread over many lines -- and even with indentation if we want * Intentional Asymmetry: Is it BOOST_CHECK_EQ(expected, actual) or (actual, expected)? It really doesnt matter in the end, but a message like "expected 34, got 33" is actually kinda nice. Putting the value under test at the start creates an asymmetry that helps guide the user to put the values in the "right" order. * Composability * Extendibility: once the facility is there, its actually really easy to write more ("CanLockMySemaphoreType(timeout)") I wasnt able to find any discussion on boost's list for this, so I thought I'd bring it up. As for difficulty, implementing the examples above is actually already quite easy using boost::test predicates, and the extra macro would be fairly simple to implement. Almost all the work would be in creating the library of matchers, which is the fun part :) What do you think? Jared

5 11

[TortoiseGit] Screen shots becoming available + submodule update bug
by Beman Dawes 29 Dec '13

29 Dec '13

I've started to post screen shots of TortoiseGit performing the various operations described in "Getting Started with Modular Boost Library Maintenance". See https://svn.boost.org/trac/boost/wiki/TortoiseGitLibMaint Since each screen shot takes a bit of time and effort, I'd like to hear the opinions from some from TortoiseGit users as to whether or not the screen shots seem worthwhile. I particularly wanted to get a screen shot of a submodule update, but hit a bug in TG's "Submodule update...". It was reported yesterday, and the TG folks have already identified the problem as a bug in a library named libgit2, and reported that to the libgit2 folks, citing the boost super-project as the test case. The libgit2 folks have already created a pull request with a patch, so let's hope the fix reaches us reasonably soon. --Beman

2 1

[boost.test] Correct usage?
by Philip Bennefall 29 Dec '13

29 Dec '13

Hello, I just started writing unit tests for a large project that I am involved in, and boost.test has been absolutely fantastic to work with so far. True the documentation could be clearer, but as far as functionality I am very much impressed with the library. I have a question though. I read the following: http://lists.boost.org/Archives/boost/2011/10/186439.php This concerns me. What is the status here? When I build boost_1_54_0, in my stage/lib directory I see: libboost_test_exec_monitor-vc100-mt-s-1_54.lib My test cases look as follows: #define BOOST_TEST_MODULE MyProgram #include <boost/test/unit_test.hpp> BOOST_FIXTURE_TEST_SUITE(basic_operations, basic_memory_logger) BOOST_AUTO_TEST_CASE( some_test ) { // ... // Using BOOST_REQUIRE_EQUAL, BOOST_CHECK_EQUAL, BOOST_CHECK, BOOST_REQUIRE_EQUAL_COLLECTIONS and friends here. } BOOST_AUTO_TEST_SUITE_END() My questions are: 1. Are all these macros still supported and not depricated? 2. Is the structure correct? Am I depending on something depricated? Am I including the right header? I am linking with the library mentioned above (via auto-linking), which is why I am concerned about deprication. Thanks in advance for any clarification on this. Kind regards, Philip Bennefall

3 2

[phoenix] how do i achieve this type of extension of phoenix
by Hui Li 28 Dec '13

28 Dec '13

I want to extend the phoenix library with my own expressions in a specific way. Would appreciate any help!! Thanks! The code below is what i want to achieve, with the intended behavior specified in the comments. The goal is to first build an expression (the expr0), and later bind some value to certain nodes and turn them into different types of nodes with internal states (expr1) but preserve the structure of the expression tree, and also be able to modify the internal states of those nodes. My question is, how to define myplus, mymult, myinit, and myreset to make it work? using boost::phoenix::arg_names::arg1; using boost::phoenix::arg_names::arg2; using boost::phoenix::arg_names::arg3; // how should i define myplus, mymult and myinit, so that // expr1 is arg1 + myplus_f<double>(3.0)(1,arg2) + mymult_f<double>(3.0)(2,arg3) auto expr0 = arg1 + myplus(1,arg2) + mymult(2,arg3); auto expr1 = myinit( expr0, 3.0 ); // evaluate expr1 with actual arguments double r = expr1(1,2,3); // modify the internally held values of myplus_f<double>(3.0) and mymult_f<double>(3.0) // so that expr1 becomes equivalent to arg1 + myplus_f<double>(5.0)(1,arg2) + mymult_f<double>(5.0)(2,arg3) myreset(expr1, 5.0); // evaluate with new value members of myplus_f and mymult_f double r2 = expr1(1,2,3); myplus_f and mymult_f are defined as follows: template < typename T > struct myplus_f { T value; explicit myplus_f(const T& v):value(v){} void reset(const T& new_value) { value = new_value; } template < typename Lhs, typename Rhs > auto operator()(const Lhs& lhs, const Rhs& rhs) const -> decltype(value+lhs+rhs) { return value + lhs + rhs; } }; template < typename T > struct mymult_f { T value; explicit mymult_f(const T& v):value(v){} void reset(const T& new_value) { value = new_value; } template < typename Lhs, typename Rhs > auto operator()(const Lhs& lhs, const Rhs& rhs) const -> decltype(value*lhs*rhs) { return value * lhs * rhs; } };

2 1

Getting Started with Modular Boost Library Maintenance
by Beman Dawes 27 Dec '13

27 Dec '13

I've been pecking away at "Getting Started with Modular Boost Library Maintenance". See https://svn.boost.org/trac/boost/wiki/StartModMaint I'd appreciate comments and corrections. One of the questions that came up was how to number releases for individual libraries. Say Boost.System wants to do a release before the next full Boost release ships. What do I call it? How do I document it? How do I tag it? Strawman proposal ------------------------ * Call it "Boost.System 1.55.1 Point Release". * Document it via the "readme" file that GitHub pesters you to add. Contents would give the title of the release and the release notes. * Create a gh-pages branch with the same release notice. * Tag it 1.55.1 Comments? --Beman

11 26

[Config] Failure with Clang-3.4 in C++14 mode
by Ben Pope 27 Dec '13

27 Dec '13

"clang++-3.4" -c -x c++ -std=c++1y -stdlib=libc++ -O0 -g -fno-inline -Wall -g -fPIC -DBOOST_ALL_NO_LIB=1 -I".." -o "/home/ben/development/boost/test/build/results/boost/bin.v2/libs/config/test/config_test.test/clang-linux-3.4~c14_libc++/debug/config_test.o" "../libs/config/test/config_test.cpp" In file included from ../libs/config/test/config_test.cpp:76: ../libs/config/test/boost_no_constexpr.ipp:37:3: error: no viable conversion from 'const boost_no_cxx11_constexpr::A' to 'int' X<a> xx; // OK: unique conversion to int ^ ../libs/config/test/boost_no_constexpr.ipp:27:14: note: candidate function not viable: 'this' argument has type 'const boost_no_cxx11_constexpr::A', but method is not marked const constexpr operator int() { return val; } ^ ../libs/config/test/boost_no_constexpr.ipp:28:14: note: candidate function not viable: 'this' argument has type 'const boost_no_cxx11_constexpr::A', but method is not marked const constexpr operator long() { return 43; } ^ In file included from ../libs/config/test/config_test.cpp:231: ../libs/config/test/boost_no_cxx11_user_lit.ipp:64:15: error: invalid operands to binary expression ('const boost_no_cxx11_user_defined_literals::my_literal' and 'boost_no_cxx11_user_defined_literals::my_literal') return ((a == my_literal(0x23)) && (b == my_literal(9))) ? 0 : 1; ~ ^ ~~~~~~~~~~~~~~~~ ../libs/config/test/boost_no_cxx11_user_lit.ipp:22:19: note: candidate function not viable: 'this' argument has type 'const boost_no_cxx11_user_defined_literals::my_literal', but method is not marked const constexpr bool operator==(const my_literal& a) { return val == a.val; } ^ ../libs/config/test/boost_no_cxx11_user_lit.ipp:64:42: error: invalid operands to binary expression ('const boost_no_cxx11_user_defined_literals::my_literal' and 'boost_no_cxx11_user_defined_literals::my_literal') return ((a == my_literal(0x23)) && (b == my_literal(9))) ? 0 : 1; ~ ^ ~~~~~~~~~~~~~ ../libs/config/test/boost_no_cxx11_user_lit.ipp:22:19: note: candidate function not viable: 'this' argument has type 'const boost_no_cxx11_user_defined_literals::my_literal', but method is not marked const constexpr bool operator==(const my_literal& a) { return val == a.val; } ^ ^ 6 warnings and 3 errors generated. Looks like a simple fix of marking the members const. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3598.html http://www.boost.org/development/tests/trunk/developer/output/BP%20x86_64%2… Ben

2 2

[boostbook] Unsupported doc elements.
by Mostafa 27 Dec '13

27 Dec '13

I was perusing Robert Ramey's very informative blincubator.com when I ran across this: "Though BoostBook specifies a large collection of tags to characterize documentation elements, the large majority of these are not used by Boost library documentation It seems that that they've been included in the hopes of being available for future use. This would be OK except for the fact that the attaching all these tags to one's documentation would be a huge job - which would yield no benefit with the current document preparation system. It's not clear from the BoostBook documentation which tags are used/useful and which should not be bothered with. This leaves one with questions about under what circumstances each tag should be used." Is the situation involving unsupported documentation elements still true? If so, can someone knowledgeable with the issue in the least identify which elements are supported and which are not? Any clarification appreciated, Mostafa

2 1

[PATCH Boost.smart_ptr] Add intrusive_ptr<>::release()
by Avi Kivity 26 Dec '13

26 Dec '13

This provides a way to escape from automatic reference counting, and taking manual control of the reference. Useful when interfacing to a C API that expects a pointer with an elevated reference count. Similar to std::unique_ptr<>::release(). --- include/boost/smart_ptr/intrusive_ptr.hpp | 7 +++++++ intrusive_ptr.html | 23 ++++++++++++++++++----- test/intrusive_ptr_test.cpp | 7 +++++++ 3 files changed, 32 insertions(+), 5 deletions(-) diff --git a/include/boost/smart_ptr/intrusive_ptr.hpp b/include/boost/smart_ptr/intrusive_ptr.hpp index a855a10..8c73fe2 100644 --- a/include/boost/smart_ptr/intrusive_ptr.hpp +++ b/include/boost/smart_ptr/intrusive_ptr.hpp @@ -151,6 +151,13 @@ public: return px; } + T * release() BOOST_NOEXCEPT + { + T * ret = px; + px = 0; + return ret; + } + T & operator*() const { BOOST_ASSERT( px != 0 ); diff --git a/intrusive_ptr.html b/intrusive_ptr.html index 562d27a..ef6238b 100644 --- a/intrusive_ptr.html +++ b/intrusive_ptr.html @@ -71,6 +71,7 @@ T & <A href="#indirection" >operator*</A>() const; // never throws T * <A href="#indirection" >operator-></A>() const; // never throws T * <A href="#get" >get</A>() const; // never throws + T * <A href="#release" >release</A>(); // never throws operator <A href="#conversions" >unspecified-bool-type</A>() const; // never throws @@ -174,11 +175,23 @@ intrusive_ptr & operator=(T * r);</pre> Throws: nothing. </blockquote> <h3><a name="get">get</a></h3> - <pre>T * get() const; // never throws</pre> - <blockquote> - Returns: the stored pointer. - Throws: nothing. - </blockquote> + <pre>T * get() const; // never throws</pre> + <blockquote> + Returns: the stored pointer. + Throws: nothing. + </blockquote> + <h3><a name="release">release</a></h3> + <pre>T * release(); // never throws</pre> + <blockquote> + Returns: the stored pointer. + Throws: nothing. + Postconditions: <code>get() == 0</code>. + Notes: The returned pointer has an elevated reference count. This + allows conversion of an intrusive_ptr back to a raw pointer, + without the performance overhead of acquiring and dropping an extra + reference. It can be viewed as the complement of the + non-reference-incrementing constructor. + </blockquote> <h3><a name="conversions">conversions</a></h3> <pre>operator unspecified-bool-type () const; // never throws</pre> <blockquote> diff --git a/test/intrusive_ptr_test.cpp b/test/intrusive_ptr_test.cpp index 614a9cb..90248fe 100644 --- a/test/intrusive_ptr_test.cpp +++ b/test/intrusive_ptr_test.cpp @@ -330,6 +330,13 @@ void test() BOOST_TEST(get_pointer(px) == px.get()); } + + { + boost::intrusive_ptr<X> px(new X); + X* released = px.release(); + BOOST_TEST(released->use_count() == 1); + delete released; + } } } // namespace n_access -- 1.8.3.1

7 15

Project for developing Binary Indexed Tree
by Arpit Mittal 26 Dec '13

26 Dec '13

Hi All, I am new to the group. I am interested to know that if developing a Binary Indexed Tree for Boost C++ will be a good project. Thanks and Regards Arpit Mittal

1 0

[quickbook] Broken link in repo.
by Mostafa 26 Dec '13

26 Dec '13

boost/tools/quickbook/index.html redirects to boost/doc/html/quickbook.html which redirects to http://boost-sandbox.sourceforge.net/doc/html/quickbook.html. The latter does not exist.

2 4

[git][multi_index] help merging from develop
by Joaquin M Lopez Munoz 26 Dec '13

26 Dec '13

Hi, I've tried following the instructions on https://svn.boost.org/trac/boost/wiki/StartModMaint but I obviously screwed up something. After creating my first merge point https://github.com/boostorg/multi_index/ commit/802543fd948b5cf41460addf2260693f08cf7f8d a subsequent merge from develop doesn't change any code: https://github.com/boostorg/multi_index/ commit/3239677c40b6e15d1bb49675cabb077460333538 even though branch develop is indeed different from (and more recent than) the code in master (it contains changes from about one month or so intended for Boost 1.56 that weren't published when the branch master was originally created) Heeeelp! Thanks for bearing with an incompetent Git user. Joaquín M López Muñoz Telefónica Digital

6 29

STL MAP Insertion and Updates ..!!
by Rahul Mathur 25 Dec '13

25 Dec '13

Hi, Looking for clue for below. Having a code which has to be inserted and updated with following status - 1. Insert with unique ID and initially with two values (viz . v1[1100] & v2[1000]) 2. If v1 [viz 1100] is NOT accepted exit. 3. Else value v2[1000] is accepted. With v2 being accepted, further insert with same unique ID on which v2 was accepted but now either with three values of v3[1001] or v4[1002] or v5[1003] and UPDATE the STL MAP. 4. Print the FINAL value (v2 or v3 or v5) of STL MAP with given unique ID. Did wrote below lines which works until value v1 [1000] insertion - --- #include <iostream> #include <algorithm> #include <map> #include <iterator> using namespace std; struct TBag { int UnqID; short value_code; TBag():UnqID(1234),value_code(1000){} }; TBag ms_var1; typedef std::map<int, short> map1; class Apple { map1 abc; public: void TypeInsert ( TBag *ms_var ); }; void Apple::TypeInsert ( TBag *ms_var ) { // Insert the 'UnqID' with messages of either TC = 1000 or 1100 only. typedef std::pair <map1::iterator, bool> itr; itr it1 = abc.insert( std::make_pair( ms_var->UnqID, ms_var->value_code ) ); typedef std::pair <map1::iterator, bool> itr; //Searching for value of Value Code = 1000 if (ms_var->value_code == 1100) { std::cout << "Value Error." << endl; exit (1); } if (it1.second) { // Checking correct insertion happened with 1000 std::cout << "Unq ID (" << it1.first->first << ") => " << "Value Code (" << it1.first->second << ")" << endl; std::cout << "The Status is .." << it1.first->first << " & " << it1.first->second << endl ; // INSERT now with Value code of either 1001 or 1002 or 1003 & finally UPDATE the STL MAP std::cout << "Final Status:" << endl ; for( map<int, short>::iterator iter = map1.begin(); iter != map1.end(); ++iter ) std::cout << iter->first << " " << iter->second << endl ; std::cout << "All Status successful." << endl; } else std::cout << "Status Error." << endl; } int main () { Apple ms; ms.TypeInsert( &ms_var1 ); return 0; } --- Any help is well appreciated ..:) ~ XoXo

2 1

[git] avoiding fast-forward merges
by Peter A. Bigot 25 Dec '13

25 Dec '13

Forked from Re: [boost] [git][multi_index] help merging from develop On 12/25/2013 06:03 AM, Daniel James wrote: > On 25 December 2013 11:57, Daniel James <daniel(a)calamity.org.uk> wrote: >> >> You can, but you don't need "-s ours": >> >> git checkout develop >> git merge master >> >> It should be a fast-forward merge. > > Oh sorry, I just remembered why I didn't suggest merging into develop. > The recommended work flow is not to do fast forward merges in order to > keep the two branches separate. Is this (keeping the two branches separate) the right rationale? I take "separate" to mean having no commit (SHA1) that is present on both branches (other than, for new modules, an initial master/develop branch fork which serves as the first merge base). A fast-forward merge necessarily places the same commit on both branches. git-flow recommends avoiding fast-forward merges to branch develop so the historical feature branch is preserved and to bundle the merge effect into a single commit, simplifying reversion. But this is more of a per-module traceability policy in the selected workflow than something that has a material effect on overall Boost process. In contrast, for Boost modules it's important not to do fast-forward merges to master, because a maintenance plan or email somewhere said super-project release managers may choose to select an earlier version on a module master branch to resolve integration failures.[*] To achieve that it must be possible for the manager to identify stable releases on the master branch, which would not be the case if a fast-forward merge added a commit series that did not stabilize until the final commit. The simplest derived requirement is that every commit on the master branch must represent a stable module, enforced by --no-ff. This I understood to be a strict requirement for the module master branch regardless of the module maintainers' chosen workflow within the module, but it does not affect workflow for develop. The effect of adopting these two practices may be that develop and master are kept separate. But that's not necessarily true if the develop branch itself is always kept at a releasable state, or if I misconstrued the strict requirement that stable release points on the module master branch be recognizable. If only master HEAD must be kept releasable the simplest work flow is to do a fast-forward merge from develop to master and push the results at any time where develop is considered stable enough to release. If there's an another rationale for keeping the branches separate I'd like to hear it to better my understanding of how git is expected to be used in Boost. Peter [*] I can't find the super-project release plan text about selecting non-HEAD module master branch contents from which this requirement is derived. https://svn.boost.org/trac/boost/wiki/ModBigPicture has a more lax requirement that pushes to master only be done when the content is stable, which will work in the more common case where there are no interoperability issues. The strict requirement makes sense, though, and I'm sure I read it somewhere.

1 0

[git-help] Clone / fetch specific submodule SHA?
by Rene Rivera 25 Dec '13

25 Dec '13

Does anyone know of a way to do a submodule update and clone that only fetches a specific SHA? In particular the SHA referenced in the superproject? Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

3 6

Reminder about links when running b2 headers
by Edward Diener 25 Dec '13

25 Dec '13

There was already a discussion about why the creation of hard links to individual files in the boost directory is inferior to the creation of symbolic links when the ability to create symbolic links is supported by the OS. As a reminder, if a hard link is created and the submodule file is replaced by git, the hard link will still refer to the old file contents. Thus testing, when it refers to any of the hard linked header files in the boost subdirectory, will go awry if this happens. Can we please have this updated at the module boost superproject level by some Boost Build guru so that symbolic links are created when allowed by the OS ? Even if, as on Windows, administrator rights are needed to create symbolic links it seems we could have some b2 headers alternative, aka 'b2 headers_wadmin', which would create symbolic links on Windows for users who have administrator rights. Of course on Linux this is not a problem. I realize this might not be easy to do even by a Boost Build expert but unless we want to hear squawks and complaints from Boost developers/end-users using our git/modular boost setup we need to change to symbolic links when possible.

3 6

[range]slicing any_range
by Takatoshi Kondo 25 Dec '13

25 Dec '13

Hello, I'm using the Boost.Range library (Version:1.55.0). When I use any_range with sliced adaptor, slicing operation doesn't return. Is my code something wrong? If it is a bug, I will create a ticket. Here is the minimized code that reproduces the situation: #include <vector> #include <iostream> #include <cassert> #include <boost/range/any_range.hpp> #include <boost/range/adaptor/sliced.hpp> typedef boost::any_range<int, boost::random_access_traversal_tag, int, std::ptrdiff_t> int_range; int main() { std::vector<int> v; v.push_back(0); v.push_back(1); v.push_back(2); { // works fine std::cout << "slice vector" << std::endl; int_range ir1 = v | boost::adaptors::sliced(0,2); std::cout << "slice vector finished" << std::endl; assert(ir1[0] == 0); assert(ir1[1] == 1); assert(ir1.size() == 2); } { int_range ir2(v); std::cout << "slice any_range" << std::endl; int_range ir3 = ir2 | boost::adaptors::sliced(0,2); // never return... std::cout << "slice any_range finished" << std::endl; assert(ir3[0] == 0); assert(ir3[1] == 1); assert(ir3.size() == 2); } } Takatoshi Kondo

1 2

[string_ref] degree of conformance to standard proposal
by Peter A. Bigot 24 Dec '13

24 Dec '13

(Background: I need a string_view with features in N3762 that aren't in N3442 (viz., pos parameters to the string methods). I'm trying to determine how much effort I should put into a set of patches to update the Boost implementation to the latest draft proposal.) The default constructor for Boost.string_ref produces an object which returns a null pointer from data(). N3442 and its successor N3762 both require the return value from data() to be non-null (http://isocpp.org/files/papers/N3762.html#h5o-5) GCC's libstdc++ folks solved this by adding a constexpr unit length string to serve as the base referenced object (http://gcc.gnu.org/ml/libstdc++/2013-11/msg00104.html) But for Boost I don't see how this can be changed without introducing a link dependency. In a cases like this, how closely does Boost want to track the standard proposals? Similarly, the standard proposal has settled on *string_view instead of *string_ref. Would Boost rename the library/class, or just introduce an alias? Peter

2 3

Re: [boost] [git] Effects of git submodule update
by Beman Dawes 24 Dec '13

24 Dec '13

On Mon, Dec 23, 2013 at 2:17 PM, Robert Ramey <robertmacleranramey(a)gmail.com > wrote: > > > On Monday, December 23, 2013 8:47:21 AM UTC-8, Beman Dawes wrote: > <snip ..> > > Comments welcome, >> > > Beman. > > This is beyond awesome !!!! (I can't believe I used the word "awesome") > > I've been dabbled with git on my own machine (now a new machine) for a few > months > and it's been OK but I never really "got" the branching/merging, etc..... > Mainly this > is because I didn't really have to yet. I've also been lurking around > waiting for > the smoke to clear with boost modularization - a cowardly position I know, > but expedient in my particular circumstances right now. The work you've > done > is getting this organized AND well explained is incredible. I'm aware > that the dust has to settle some. But this looks to me like it's going to > support a whole new trajectory for boost. It makes me very, optimistic > about future of boost and C++ in general. > > Personally, I don't think that it's too much to say that boost saved C++. > > And I don't think it's too much to say that you're saving boost right now. > Robert, thank you very much for the kind words. Knowing that work is appreciated is a strong motivation to continue! But do remember this is a long process with a lot of people contributing, both now and in the past. Dave Abrahams and Daniel Pfeifer deserve special mention for several years of work on the git and modular boost conversion implementation. The release managers and boost.build team are working on infrastructure. The testers will soon be doing their part. And mailing list participants are providing the ideas and feedback that drive the whole process. Thanks to all, --Beman

1 0

[Proposal] Boost Community Maintenance Team Goals and Guidelines
by Marshall Clow 24 Dec '13

24 Dec '13

Start here: https://dl.dropboxusercontent.com/u/9897665/community-maintenance.html I have contacted the authors of the libraries listed in Beman’s proposals. Some have responded affirmatively; the rest have not responded. So, I thought I would put down some thoughts about how the Boost Community Maintenance Team (Boost.CMT) should work. Goals (in priority order): 1. Keep things building on all the supported compilers (and as many others as possible) 2. Get the test matrix “all green” and keep it that way. 3. Fix the accumulated bugs; drive the bug count to zero, and keep it there. 4. Add new features. How I see this working: 0) We’ll set up a separate Boost.CMT mailing list. (the main developer list has too much traffic already) 1) People would pick a problem and post a note to the list that they were working on it. 2) {Optional] discussion ensues about the way to solve the problem. 3) A potential solution is implemented (and tested!) 4) A pull request is posted to the mailing list (with tests) 5) Discussion ensues. Repeat steps 3/4/5 as needed. 6) The pull request is merged to ‘develop’ 7) After test cycles, the change is merged to ‘master' Notes: 1) All of this should happen on the Boost.CMT ML. 2) Discussions _about_ the CMT should happen on the main Boost ML. 3) The person who lands the patch is responsible for checking the test results and merging to “master” (and closing out the bug report, if any). 4) The goal of the CMT will be the same as the Boy Scouts - “Leave the code cleaner than when you found it” Comments? -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

2 2

Re: [boost] [atomic] Probable documentation issue: how do we know atomic is safe and/or efficient?
by Pete Bartlett 24 Dec '13

24 Dec '13

> On 24 Dec 2013, at 13:43, "John Maddock" <john(a)johnmaddock.co.uk> wrote: > > This message has no content.

1 0

Ominous Warning — should I be worried?
by John M. Dlugosz 23 Dec '13

23 Dec '13

I'm compiling with VS10, and using Boost 1.49.0 “reference member is initialized to a temporary that doesn't persist after the constructor exits” That does not sound good, and browsing through the mailing list archives I see discussions of regressions in 2010 that cite C4413 and use of emplace. I can't read the source code because it's just a ball of preprocessor stuff. Is this a real problem or a warning that can be ignored? I would think that if Boost.Container was broken on VS10, it would be mentioned somewhere where it's easy to spot. Thanks, —John E:\boost_1_49\boost/preprocessor/iteration/detail/local.hpp(37): warning C4413: 'boost::container::container_detail::advanced_insert_aux_non_movable_emplace1arg<A,Iterator,P0>::m_p0' : reference member is initialized to a temporary that doesn't persist after the constructor exits with [ A=std::allocator<std::tr1::shared_ptr<MyTypeA>>, Iterator=std::tr1::shared_ptr<MyTypeA> *, P0=std::tr1::shared_ptr<MyTypeA> ] E:\boost_1_49\boost/preprocessor/iteration/detail/local.hpp(37) : see declaration of 'boost::container::container_detail::advanced_insert_aux_non_movable_emplace1arg<A,Iterator,P0>::m_p0' with [ A=std::allocator<std::tr1::shared_ptr<MyTypeA>>, Iterator=std::tr1::shared_ptr<MyTypeA> *, P0=std::tr1::shared_ptr<MyTypeA> ] E:\boost_1_49\boost/preprocessor/iteration/detail/local.hpp(37) : while compiling class template member function 'boost::container::container_detail::advanced_insert_aux_non_movable_emplace1arg<A,Iterator,P0>::advanced_insert_aux_non_movable_emplace1arg(A &,P0 &&)' with [ A=std::allocator<std::tr1::shared_ptr<MyTypeA>>, Iterator=std::tr1::shared_ptr<MyTypeA> *, P0=std::tr1::shared_ptr<MyTypeA> ] E:\boost_1_49\boost/preprocessor/iteration/detail/local.hpp(37) : see reference to class template instantiation 'boost::container::container_detail::advanced_insert_aux_non_movable_emplace1arg<A,Iterator,P0>' being compiled with [ A=std::allocator<std::tr1::shared_ptr<MyTypeA>>, Iterator=std::tr1::shared_ptr<MyTypeA> *, P0=std::tr1::shared_ptr<MyTypeA> ] E:\boost_1_49\boost/preprocessor/iteration/detail/local.hpp(37) : see reference to class template instantiation 'boost::container::container_detail::advanced_insert_aux_emplace1arg<A,Iterator,P0>' being compiled with [ A=std::allocator<std::tr1::shared_ptr<MyTypeA>>, Iterator=std::tr1::shared_ptr<MyTypeA> *, P0=std::tr1::shared_ptr<MyTypeA> ] mysourcefile.cpp(172) : see reference to function template instantiation 'void boost::container::vector<T>::emplace_back<std::tr1::shared_ptr<_Ty>>(P0 &&)' being compiled with [ T=std::tr1::shared_ptr<MyTypeA>, _Ty=MyTypeA, P0=std::tr1::shared_ptr<MyTypeA> ]

2 1

Beginner
by prabhdeep singh 23 Dec '13

23 Dec '13

I want to start contributing to the open source community, but I do not where to begin. Your community's cause seems great! So I would love to start but I am absolutely clueless as to where to begin. I have a background in C++ and algorithmic operations. Any help would be appreciated!

2 1

[git] Effects of git submodule update
by Beman Dawes 23 Dec '13

23 Dec '13

There has been a lot of concern expressed about updating submodules, so I've updated the applicable section of "Getting Started with Modular Boost Library Maintenance" to include reassurance that uncommitted changes will not be overwritten. See https://svn.boost.org/trac/boost/wiki/StartModMaint A table has been added describing the effects of git submodule update. Actual tests were run to determine the effects, using git 1.8.2.msysgit.0. See https://svn.boost.org/trac/boost/wiki/StartModMaint#Effectsofgitsubmoduleup… In looking at the table, a couple of things stand out: * git submodule update, like git checkout, will not normally overwrite uncommitted changes, regardless of whether the working copy is detached or on a branch. See the table for the specific error message. From the error message it appears checkout may actually be being called. * The case of an update applied to a submodule that is on branch master and at a commit behind the super-project's commit for that submodule just does a pull without a detach. That is the only case where a" checkout --detach" isn't done before a pull. I'm unsure whether this is a feature or a bug. Comments welcome, --Beman

1 0

generating documentation in modular boost
by Peter A. Bigot 23 Dec '13

23 Dec '13

I'm trying to update documentation in lib/utility but can't see how to regenerate the html files. Generalizing from the fact I can run the tests by invoking b2 within the module test subdirectory, I invoked b2 from within the doc subdirectory. This produced an error about an unknown feature "<format>" in Jamfile.v2. When I comment out those lines I do get xml files generated in a subdirectory of the superproject, but I expected html, matching what's been checked in. Is there documentation on building documentation that I haven't been able to find? Peter

3 3

Serializing a Graph Structure Using Boost
by Nouf M. 23 Dec '13

23 Dec '13

Hi, I would like to use boost to serialize my graph (it's in the boost adjacency list format)... I couldn't do it... I managed to serialize an array and some other structures as follows: int I[5] = {0,1,2,3,4}; boost::archive::text_iarchive ia(file), ia << I; but that doesn't work with graph data in the boost adjacency list format... when I write: ia << g //g is my graph I get the following compilation error: 'serialize' is not member of 'VertexProperties' 'VertexProperties' is a structure that I wrote as follows: struct VertexProperties { int id; int weight; }; I don't know how to add 'serialize' as a member function... I also tried "SavingArchieve" template but couldn't do it... Any idea's please? or references?

1 0

Access is denied for the "bootstrap" command
by Nouf M. 23 Dec '13

23 Dec '13

Hi, In order to use the serialization files... I need to build them... I have to go to the BGL directory from the command prompt and enter the "bootstrap" command... It works on some machines... But on my machine it gives me: "Building Boost.Build engine Access is denied. Failed to build Boost.Build engine. Please consult bootstrap.log for further diagnostics" My machine is an HP Workstation and I'm using Windows 7 professional edition... Why do you think I'm getting Access is denied?

1 0

[type_traits] is_empty fails on final classes.
by yuri kilochek 22 Dec '13

22 Dec '13

Hi. It seems boost::is_empty uses Empty Base Optimisation to detect whether a class type is stateless or not. This predictably fails on final types, as they cannot be inherited from: #include <iostream> #include <boost/type_traits.hpp> class Test final {}; int main() { std::cout << boost::is_empty<Test>::value; return 0; } Fails on gcc 4.8.1 with In file included from /usr/local/include/boost/type_traits.hpp:54:0, from main.cpp:2: /usr/local/include/boost/type_traits/is_empty.hpp: In instantiation of 'struct boost::detail::empty_helper_t1<Test>': /usr/local/include/boost/type_traits/is_empty.hpp:79:5: required from 'const bool boost::detail::empty_helper<Test, true>::value' /usr/local/include/boost/type_traits/is_empty.hpp:88:5: required from 'const bool boost::detail::is_empty_impl<Test>::value' /usr/local/include/boost/type_traits/is_empty.hpp:220:1: required from 'struct boost::is_empty<Test>' main.cpp:7:39: required from here /usr/local/include/boost/type_traits/is_empty.hpp:52:8: error: cannot derive from 'final' base 'Test' in derived type 'boost::detail::empty_helper_t1<Test>' struct empty_helper_t1 : public T ^ Yet std::is_empty works just fine (al least in gcc), and appears to be implemented via an intrinsic: template<typename _Tp> struct is_empty : public integral_constant<bool, __is_empty(_Tp)> {}; Now, is it at all possible to implement conforming is_empty without resorting to compiler magic that are intrinsics?

3 3

[git] How the blazes are you supposed to update all the submodules?
by John Maddock 22 Dec '13

22 Dec '13

OK.... so I do a Git pull at the top level (note: using TortoiseGit), and I see lots of messages in the log indicating which libraries have updates, and judging by the time taken they seem to be downloaded (?), but I don't actually see any changes in the libraries themselves. BTW I have every library set explicitly to either "develop" or "master". If I do a "git pull" on an individual library then the changes do come through OK. So what's the right way to do this? I assume it's not a "submodule update" as that seems to leave everything in a detached head state which I take it is a bad idea? I'm also seeing a lot of negative comments about Git submodules on the web, for example: http://codingkilledthecat.wordpress.com/2012/04/28/why-your-company-shouldn…, seems like there's a lot of potential to shoot yourself in the foot/head/chest here? Thanks, John.

16 33

Storing an adjacency list
by Nouf M. 22 Dec '13

22 Dec '13

Hi, I have a very large graph data (150000 node and 450000 edges) in two text files... first one: contains the vertices and their weights. second one: contains the edges and their weights. I need to retrieve a small subgraph from this big graph data...it's easier to do that if the graph is stored in an adjacency list format... I managed to write some code that reads from the files and creates a graph in an adjacency list format... Now, I would like to store the graph (the one in the adjacency list format) for next uses because it takes long time to convert my graph text files into the adjacency list format... I couldn't figure out how to do it... I saw the section about graph I/O in the BGL documentation: Graphviz, Max-flow, and GraphML but I don't think they will do what I need... I looked also on Serialization, I'm not sure about it... will serialization work well to store very large graphs and then retrieve then very fast ... Is this possible? Best regards, Nouf

1 0

[ASIO] example clarification (how to)
by Gaetano Mendola 21 Dec '13

21 Dec '13

In the asio chat example http://www.boost.org/doc/libs/1_55_0/doc/html/boost_asio/example/cpp11/chat… the class chat_server implements the async_accept handler with a lambda without use the shared_from_this pattern, isn't an error destroy the class while the handler is running? Maybe is not a problem looking at how is used inside the main but without having knowledge on how is it going to be used which can be the best way to destroy the chat_server (or similar code) safely? Is something like the following correct? chat_server::~chat_server() { //Call dispatching a cancel operation //in order to be sure to not chain another async_accept acceptor_.get_service().dispatch( [this](){ acceptor_.cancel(); }); } here I'm supposing a single thread is running io_service.run() otherwise the strand has to be used. Regards Gaetano Mendola --- This email is free from viruses and malware because avast! Antivirus protection is active. http://www.avast.com

1 0

[github] Admin access for move/container/interprocess/intrusive
by Ion Gaztañaga 21 Dec '13

21 Dec '13

Hi, Following indications explained in [https://svn.boost.org/trac/boost/wiki/ModAdmin] I requested admin access to Move, Container, Interprocess & Intrusive several days ago. The issue is still open, so have I missed something? Thanks to all working on this, Ion

1 0

[git][testing] regression testing?
by Joaquín Mª López Muñoz 21 Dec '13

21 Dec '13

There's been some unanswered questions around this. I understand that regression tests, which are critical to ensure clean develop->master merges, will be eventually updated to work against git rather than the abandoned SVN, but I can't find any info on the progress of this. FWIW, I see some authors are going ahead and merging their libs anyway, which will bring breakages etc if changes are not properly validated through regression testing. Any indication on how this is progressing much appreciated. Best, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

2 1

sidenote about guis (Re: [git] How the blazes are you supposed to update all the submodules?)
by Mateusz Loskot 20 Dec '13

20 Dec '13

(Please, adjust subject line for changed topic!) On 20 December 2013 11:15, Klaim - Joël Lamotte <mjklaim(a)gmail.com> wrote: > These days I only use SourceTree for both git and hg. It's cross platform, It's not cross platform, but Windows and Mac only https://answers.atlassian.com/questions/149631/sourcetree-for-linux?page=1#… A note on my own experience: 0. First, I aim to be comfy with git command, if not, then I will never understand git really. 1. Then, I use SourceTree where I can to complement git command (branches visualisation, etc.) 2. I use Qt Creator with its Git plugin which is nothing more than git command proxy, hence equivalent to git command. BTW, I'd like to do a bit of propaganda about Boost.Build support for Qt Creator: https://github.com/mloskot/qt-creator-plugin-boostbuild Best regards, -- Mateusz Łoskot, http://mateusz.loskot.net

4 5

[typeof] Non-static data member
by Bjorn Reese 20 Dec '13

20 Dec '13

Consider the following example: void foo(int value) {} struct alpha { int value; typedef BOOST_TYPEOF(foo(value)) return_type; }; This example compiles just fine with g++, but with clang++ it only works if compiled with -std=c++11, otherwise it gives the error message below. I believe that clang is correct (this diagnostics was added in clang 3.1 [1].) https://llvm.org/viewvc/llvm-project?view=revision&revision=154073 Is this a bug in Boost.Typeof or is it expected behavior? Is there a workaround for it? The error message is: /home/breese/src/treediff/treediff/main.cpp:17:30: error: invalid use of non-static data member 'value' typedef BOOST_TYPEOF(foo(value)) return_type; ^~~~~ /usr/local/include/boost/typeof/native.hpp:41:76: note: expanded from macro 'BOOST_TYPEOF' #define BOOST_TYPEOF(expr) BOOST_TYPEOF_KEYWORD(boost::type_of::ensure_obj(expr)) ^ 1 error generated.

1 1

Re: [boost] [Locale] translate() couples key and output character widths
by Artyom Beilis 20 Dec '13

20 Dec '13

That was a loooooong and painful discussion during the boost.locale review. Such a change was asked by the reviewers that wanted to be able to use wide strings as keys. For example translate(L"© All Rights Are Reserved") Where "©" is non-ASCII character. This change was mostly required to support non-ascii characters in keys. To be honest I was strongly against the change but finally had to accept it. See: http://thread.gmane.org/gmane.comp.lib.boost.devel/218543 Also you can search boost lists the locale review comments... Artyom Beilis -------------- CppCMS - C++ Web Framework: http://cppcms.com/ CppDB - C++ SQL Connectivity: http://cppcms.com/sql/cppdb/ -------------------------------------------- On Fri, 12/20/13, Alexander Lamaison <awl03(a)doc.ic.ac.uk> wrote: Subject: [boost] [Locale] translate() couples key and output character widths To: boost(a)lists.boost.org Date: Friday, December 20, 2013, 1:01 PM I've finally gotten round to changing from the pre-release version of Boost.Locale (v2.92) to the version now in Boost, and I was quite surprised by one change. Previously, I could do the following: void function_takes_wide_string(std::wstring message); function_takes_wide_string(boost::locale::translate("My translation key")); However, with the new version, the key must be passed in as a wide string if I am to be able to get a wide string out. This means changing `translate("blah")` to `translate(L"blah")` throughout. The change itself is no big deal, but the problem is that it feels like a change for the worse. The character width of the key is now coupled to the character width of the output, when the two are separate concepts and should be allowed to vary independently. The old class `message` coeerced the string to whichever width was required. The new class `basic_message<T>` coerces only to `basic_string<T>` and, worse than that, doesn't provide a method to explicitly convert to a different width string. My question, I suppose, is why was this change made? What makes the new API better? Alex -- Swish - Easy SFTP for Windows Explorer (http://www.swish-sftp.org) _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

[Locale] translate() couples key and output character widths
by Alexander Lamaison 20 Dec '13

20 Dec '13

I've finally gotten round to changing from the pre-release version of Boost.Locale (v2.92) to the version now in Boost, and I was quite surprised by one change. Previously, I could do the following: void function_takes_wide_string(std::wstring message); function_takes_wide_string(boost::locale::translate("My translation key")); However, with the new version, the key must be passed in as a wide string if I am to be able to get a wide string out. This means changing `translate("blah")` to `translate(L"blah")` throughout. The change itself is no big deal, but the problem is that it feels like a change for the worse. The character width of the key is now coupled to the character width of the output, when the two are separate concepts and should be allowed to vary independently. The old class `message` coeerced the string to whichever width was required. The new class `basic_message<T>` coerces only to `basic_string<T>` and, worse than that, doesn't provide a method to explicitly convert to a different width string. My question, I suppose, is why was this change made? What makes the new API better? Alex -- Swish - Easy SFTP for Windows Explorer (http://www.swish-sftp.org)

1 0

[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

Project
by Utsav Tiwary 15 Dec '13

15 Dec '13

I am a third year engineering under graduate from India in interested in Open MPI Programming. Could you please furnish some basic details about the project involving Open MPI done under GSoC 2013,like pre requisites ,basic idea behind the project etc. ?

1 0

Re: [boost] [serialization] new portable binary archive based, on HDF5
by Daniel Koester 15 Dec '13

15 Dec '13

On Fri, 13 Dec 2013 22:39, Mateusz Loskot <mateusz(a)loskot.net> wrote: >> My suggestion would be for Robert Ramey and >> other interested developers to consider the inclusion of my work in the >> official serialization code. I am not sure about the exact procedure in >> this case. > > I *guess*, it may qualify for the Fast Track Review: > http://www.boost.org/community/reviews.html I will check out the procedure. >> I have forked from the Git serialization archive. All supplied tests >> have passed for gcc on Linux and MSVC 10 on Windows. My work can be >> pulled from >> >> https://github.com/dk1978/serialization/tree/development > > Hmm, have you updated the development branch with the upstream lately, > as well as the master in your fork? > > AFAICT it is a few months behind the current upstream, the master too, > it seems impossible to generate a diff usable enough to review your additions. You are right, I have neglected to synchronize with the upstream master, and mostly ignored my own master branch. Please try again now. Best regards, Daniel Koester

2 1

[git] Getting set up to test?
by Beman Dawes 15 Dec '13

15 Dec '13

Before making changes to, say, the develop branch of a library, I want to set the super-project to the latest master so tests run in the most realistic environment, as Robert Ramey has advocated for years. Presumably that means doing something like this: cd modular-boost git checkout master git pull --recurse-submodules cd modular-boost/libs/mylib git checkout develop Is "git pull --recurse-submodules" the correct command to update the submodules? Do I also need to do "git submodule update" or possibly "git submodule update --remote"? Thanks, --Beman

2 1

[conversion] try_lexical_cast and 200$
by Antony Polukhin 15 Dec '13

15 Dec '13

There is a bounty for implementing a `try_lexical_cast` from Facebook: https://www.bountysource.com/issues/1352296-exceptionless-lexical_cast Because of that three questions arise: * Is there some official policy for "feature implementation sponsorship"? * `try_lexical_cast` must be added or not? And if yes, what signature is preffered: bool try_lexical_cast<Out, In>(Out&, const In&) bool try_lexical_cast<Out, In>(const In&, Out&) boost::optional<Out> try_lexical_cast<Out, In>(const In&) * Is there a bank account "for Boost's needs" that is used to do hosting payments, conference room rental payments and other support stuff (to were those 200$ may be transfered)? -- Best regards, Antony Polukhin

13 25

Splitting/rearranging Boost.Utility
by Peter Dimov 14 Dec '13

14 Dec '13

Currently, Boost.Utility is something of a mixed bag and consequently, a dependency knot. Nearly everything in Boost depends on Utility via (say) boost/assert.hpp, while at the same time Utility itself depends on much of Boost via Iterator (and others). Something Must Be Done. At minimum, assert.hpp, current_function.hpp, ref.hpp, checked_delete.hpp and addressof.hpp need to be moved out. I suspect that call_traits.hpp, compressed_pair.hpp, enable_if.hpp also don't belong. assert.hpp and current_function.hpp should probably go into their own library, Boost.Assert. ref.hpp might go to Boost.Bind. checked_delete.hpp might perhaps go to SmartPtr. No idea where addressof.hpp needs to go. These are just suggestions. I'm open to any resolution, as long as the dependency (and, to a lesser extent, maintenance) problem is resolved to everyone's satisfaction.

8 23

Any interest in a framework for memoization?
by Giacomo Drago 14 Dec '13

14 Dec '13

Hi, I would like to submit a small framework for memoization I am working on (http://projects.giacomodrago.com/c++memo/) At the moment, it is still in a beta stage and does not comply with Boost guidelines. I would like to know if you might be interested. The idea is to have a tool for rapid prototyping of software components implementing dynamic programming algorithms or, anyhow, requiring memoization. I paste here a simple "fibonacci" example: ---------------------- int fibonacci(int i, std::function<int(int)> prereqs) { if (i == 0) return 0; if (i <= 2) return 1; return prereqs(i-1) + prereqs(i-2); } cppmemo::CppMemo<int, int> cppMemo; std::cout << cppMemo.getValue(30, fibonacci) << std::endl; ---------------------- The code will print 832040, without recursive calls to the "fibonacci" function. A stack is managed "under the hood" and appropriate calls are made to the "fibonacci" callback to gather pre-requirements and then call the function again when they are available. This is just a toy example. There is more to know about, including important caveats (if you are interested, please read the documentation carefully): some defaults for template and method parameters are useful for conciseness but are EVIL if you don't know about them. The framework also provides automatic parallelization (when possible). It is important to remark that at this moment the framework relies on fcmm (fast concurrent memoization map), a custom hashmap that is optimized for this very purpose. This can be changed quite easily, as fcmm is not exposed to the client. A C++11 compliant compiler is needed. Thanks for your attention. Giacomo

3 6

Re: [boost] [serialization] new portable binary archive based on HDF5
by Daniel Koester 14 Dec '13

14 Dec '13

In reply to Hartmut Kaiser: >> I would like to share a contribution to the boost::serialization module. >> It provides an answer to the challenge of supporting portable binary >> archives by using the well-known and stable HDF5 library >> (http://www.hdfgroup.org/HDF5) After first signals of interest by other >> users I have decided to fully integrate my work with the current >> boost::serialization module. My suggestion would be for Robert Ramey and >> other interested developers to consider the inclusion of my work in the >> official serialization code. I am not sure about the exact procedure in >> this case. > Two questions: > > 1) What license do you use for your contribution? The source files don't > mention it. I plan to use the Boost Software License, and document this and the archive interface later when the future of this project is decided. > 2) Do you have performance data comparing the new archive with the existing > ones? I'd be very interested to use this archive for HPX > (https://github.com/STEllAR-GROUP/hpx) as an alternative for our homegrown > derivative of the original portable binary archive available as an example > in Boost.Serialization. But for this I'd like to known what performance > advantages/disadvantages this might cause. I do not have performance data. Do you have suggestions for an interesting benchmark, and a link to your own binary archive implementation? I will be happy to get back to you on this point. Best regards, Daniel Koester

2 1

[build] duplicate files in converted history
by Vladimir Prus 14 Dec '13

14 Dec '13

I am getting this: $ git ls-tree 49ba2cf8dd415c100fef66f35e6686b362abe6ee:jam_src <snip> 100644 blob 92965f3a17e1439dc322b555a2c17c5cf03ffa2e jam.c $ git ls-tree 49ba2cf8dd415c100fef66f35e6686b362abe6ee:historic/jam/src <snip> 100644 blob 92965f3a17e1439dc322b555a2c17c5cf03ffa2e jam.c So, we appear to have this file at two locations in the converted history. The tree I am examined is the one where jam sources were imported to svn trunk. Is this the way things are supposed to be. If not, are there other implications of this bug? Now, I already have my toolbox ready, and will probably change rewrite script to fix this, no problem, but still. - Volodya

1 1

[git] Write permission to branch
by Edward Diener 13 Dec '13

13 Dec '13

For a Boost submodule repository is write permission for that repository needed to create a new branch ?

6 20

[serialization] new portable binary archive based on HDF5
by Daniel Koester 13 Dec '13

13 Dec '13

Dear Boost developers, I would like to share a contribution to the boost::serialization module. It provides an answer to the challenge of supporting portable binary archives by using the well-known and stable HDF5 library (http://www.hdfgroup.org/HDF5) After first signals of interest by other users I have decided to fully integrate my work with the current boost::serialization module. My suggestion would be for Robert Ramey and other interested developers to consider the inclusion of my work in the official serialization code. I am not sure about the exact procedure in this case. I have forked from the Git serialization archive. All supplied tests have passed for gcc on Linux and MSVC 10 on Windows. My work can be pulled from https://github.com/dk1978/serialization/tree/development To compile the new archive code, define the paths to the HDF5 installation using the variables HDF5_INCLUDE_PATH, HDF5_LIB_PATH, and HDF5_BIN_PATH either as environment variables or in "project-config.jam". An example using the new archive is also provided in the "example" subdirectory. Motivation for this work: The hdf5_archive project provides a new serialization archive format based on HDF5 to complement the ones already included in the boost::serialization library: plain text, XML, and native binary. By building on the established and well-known boost::serialization framework, application code can use HDF5 or switch to any of the other established archive formats with only minimal changes to the code involved. HDF5 has become a popular format to store scientific data. It is open and well-documented. Further advantages of HDF5 are the following: - the format is self-describing and portable across computing platforms - efficient storage of large arrays, parallel IO using MPI is possible (though not yet implemented) - hierarchical description of stored data - several low-level storage drivers, including single file or multiple-directory layouts - APIs to C, C++, and Fortran Best regards, Daniel Koester

3 2

[git] Git id for automated commits
by Daniel James 13 Dec '13

13 Dec '13

Hi, I'm currently using a script to update the super project, so I'd rather not use my email address for the commits. Is there an email that I should use for things like this? Daniel

1 0

Equivalent of "svn update"?
by Peter Dimov 13 Dec '13

13 Dec '13

I've followed the instructions at https://svn.boost.org/trac/boost/wiki/TryModBoost and everything worked fine. I then switched to branch develop in libs/bind and libs/smart_ptr, did developmental things there. Switched to master, did a merge, switched back to develop, did more things, git pushed the changes. This also worked fine. Now, what do I need to do to achieve the equivalent of "svn update", that is, to update all other libraries to reflect changes that others might have done in the meantime? When I do "git status" at the "modular-boost" directory (which I've named "boost"), I get: C:\Projects\boost-git\boost>git status # On branch master # Changes not staged for commit: # (use "git add <file>..." to update what will be committed) # (use "git checkout -- <file>..." to discard changes in working directory) # (commit or discard the untracked or modified content in submodules) # # modified: libs/bind (new commits) # modified: libs/smart_ptr (new commits) # modified: tools/build (untracked content) # # Untracked files: # (use "git add <file>..." to include in what will be committed) # # b2.exe # bin.v2/ # bjam.exe # boost/ # bootstrap.log # project-config.jam no changes added to commit (use "git add" and/or "git commit -a") That looks correct. Now, what do I need to do to update the master and all submodules to their latest state? Is it "git submodule update --init", "git pull", or something else? And would I then need to again checkout develop (or master, if I happen to be on that branch) in libs/bind and libs/smart_ptr?

4 8

A proposal for superproject structure and testing
by Peter Dimov 12 Dec '13

12 Dec '13

To expand on what I said in a previous message, I suggest the following structure for the superproject: - branch "latest": automatically tracks "develop" of submodules (scripted). - branch "develop": automatically tracks "master" of submodules (scripted). - branch "master": contains either the last release or the current release candidate. (This naming reflects a gitflow model. An alternative would be to use the more traditional unstable/stable for latest/develop.) Test runners test all three, in sequence. Release preparation starts with a gitflow release branch from boostorg:develop. The release manager then runs local tests and, if necessary, applies fixes on the branch by downgrading submodules to an earlier version or asking the submodule maintainer to resolve a problem and then upgrading the submodule to the later version. Ideally, this release branch should be tested non-locally. However, in the past switching branches for testing has proved a problem. Therefore, the procedure continues instead with: When the release manager is satisfied with the local test results for the release branch, he merges it to master. This becomes a release candidate. If tests prove satisfactory, the release candidate is tagged as an official release and the release branch is deleted. If not, work continues on the release branch.

11 36

Branch names?
by Beman Dawes 12 Dec '13

12 Dec '13

I've been working on Modular Boost Library Workflow Overview. See https://svn.boost.org/trac/boost/wiki/StartModWorkflow In addition to the requirement for "master" and "develop", there is strong encouragement for naming conventions if several other branches are present: * feature/descriptive-name for feature branches. For example, feature/add-roman-numeral-math. * bugfix/descriptive-name for bug-fix branches, including hotfixes. For example, bugfix/ticket-1234-crash-if-result-negative * release.n.n.n for release staging branches. For example, release.1.56.2. Should "bugfix/..." be changed to "hotfix/...", since that's the name given in the Git Flow blog posting? While I see lots of advantages to following Git Flow naming, I've never been sure what "hotfix" means. It seems weird to call a low-priority cosmetic fix a "hotfix". What is the usual practice for description names? Can they include spaces? Is there any reason to recommend spaces vs underbars vs hypthens? Are there any other branches we should recommend names for? --Beman

5 7

[git] The any library does not pull cleanly because of a forced update on develop and master.
by Cox, Michael 12 Dec '13

12 Dec '13

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. Michael

10 40

[githelp] Merging two repositories
by Edward Diener 11 Dec '13

11 Dec '13

I have two separate local repositories cloned from the same other repository and I have made different changes to both. How do I merge those changes together using git ? Or do I have to do it manually ?

4 6