- Boost - lists.preview.boost.org

[bli] category page blank
by Michael Caisse 24 Nov '14

24 Nov '14

I went here: http://rrsd.com/blincubator.com/listed-by-category/ which is blank. As a user, I am going to try and find libraries by category before I use their names. michael -- Michael Caisse ciere consulting ciere.com

2 2

[review] Formal review period for Sort library begins today, November 10, and ends Wednesday, November 19
by Edward Diener 23 Nov '14

23 Nov '14

The formal review of the Sort library by Steven Ross starts today, November 10 and is scheduled to continue through November 19th. About the Sort library ================== The Sort library is a library which implements hybrid sorting algorithms based on a Spreadsort ( http://en.wikipedia.org/wiki/Spreadsort ), of which the author of the library, Steven Ross, is the inventor. The algorithm provides a sort that is faster than O(n*log(n)). The library provides a generic implementation of high-speed sorting algorithms that outperform those in the C++ standard in both average and worst case performance. These algorithms only work on random access iterators. They are hybrids using both radix and comparison-based sorting, specialized to sorting common data types, such as integers, floats, and strings. These algorithms are encoded in a generic fashion and accept functors, enabling them to sort any object that can be processed like these basic data types. Where to get it =============== The library is available on github at https://github.com/spreadsort/sort. The library is in modular Boost format and can be cloned to libs/sort under your local modular boost directory. I have provided as the review manager online documentation at: http://eldiener.github.io/sort Review guidelines ================= Reviews should be submitted to the developer list (boost(a)lists.boost.org) preferably with '[sort]' in the subject. Or if you don't wish to for some reason or are not subscribed to the developer list you can send them privately to me at 'eldiener at tropicsoft dot com'. If so, please let me know whether or not you'd like your review to be forwarded to the list. For your review you may wish to consider the following questions: - 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? And finally, every review should attempt to answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Even if you do not wish to give a full review any technical comment regarding the library is welcome as part of the review period and will help me as the review manager decide whether the library should be accepted as a Boost library. Any questions about the use of the library are also welcome. I encourage all programmers with an interest or knowledge of sorting algorithms to be part of the review or discussion of the Sort library as your time permits.

13 41

FW:ibbeekman
by Hartmut Kaiser 22 Nov '14

22 Nov '14

http://forum.incadigital.com/iuz/zdhbcmdqmamibsfwolsdjrima.nbhjkshxjngcjxlj… Hartmut Kaiser

1 0

[Boost.DLL] Formal Review request
by Antony Polukhin 21 Nov '14

21 Nov '14

Dear Boost, Some time passed since checking interest in plugin development library and now all the requested features are implemented (self loading, getting symbol location, better docs, automatic platform-specific library decorations append, much more examples, listing library exports and so on...). While there's still some room for minor improvements, library API is stable and the library will benefit greatly from a larger user base and more feedback. So unless someone thinks the library isn't ready or would get rejected right away in its current state for reason X, I am requesting a formal review for Boost.DLL. Library location: https://github.com/apolukhin/Boost.DLL Library Docs: http://apolukhin.github.io/Boost.DLL/index.html -- Best regards, Antony Polukhin

10 40

[review] Formal review period for Sort library continuing through November 19
by Edward Diener 20 Nov '14

20 Nov '14

The formal review of the Sort library by Steven Ross, which started November 10 and is scheduled to continue through November 19th, begins its last 5 days today. We have had some great discussions and reviews so far and I would like to thank everybody involved. I would like to encourage all interested programmers, whether Boost developers or Boost users, to comment on and/or review the library. About the Sort library ================== The Sort library is a library which implements hybrid sorting algorithms based on a Spreadsort ( http://en.wikipedia.org/wiki/Spreadsort ), of which the author of the library, Steven Ross, is the inventor. The algorithm provides a sort that is faster than O(n*log(n)). The library provides a generic implementation of high-speed sorting algorithms that outperform those in the C++ standard in both average and worst case performance. These algorithms only work on random access iterators. They are hybrids using both radix and comparison-based sorting, specialized to sorting common data types, such as integers, floats, and strings. These algorithms are encoded in a generic fashion and accept functors, enabling them to sort any object that can be processed like these basic data types. Where to get it =============== The library is available on github at https://github.com/spreadsort/sort. The library is in modular Boost format and can be cloned to libs/sort under your local modular boost directory. I have provided as the review manager online documentation at: http://eldiener.github.io/sort Review guidelines ================= Reviews should be submitted to the developer list (boost(a)lists.boost.org) preferably with '[sort]' in the subject. Or if you don't wish to for some reason or are not subscribed to the developer list you can send them privately to me at 'eldiener at tropicsoft dot com'. If so, please let me know whether or not you'd like your review to be forwarded to the list. For your review you may wish to consider the following questions: - 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? And finally, every review should attempt to answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Even if you do not wish to give a full review any technical comment regarding the library is welcome as part of the review period and will help me as the review manager decide whether the library should be accepted as a Boost library. Any questions about the use of the library are also welcome.

6 18

[optional] How to define boost::none?
by Andrzej Krzemienski 20 Nov '14

20 Nov '14

Hi Everyone. I am puzzled with a tough development task. I wonder if anyone is able to find a good solution. I want to re-implement tag boost::none. The current implementation is using a pointer to member which allows a harmful conversion from literal 0. Try this: boost::optional<boost::rational<int>> orat = 0; // this creates a disengaged optional. I want to rewrite the definition with the following goals in mind: 1. boost::none_t is not implicitly convertible from literal 0; 2. The solution works in C++98 3. The solution is implementable in a header-only library. (defining some member variable in a CPP file is not an option. The only solution I was able to find so far is this: [code] struct none_t { enum creator_t {creator}; none_t(creator_t){} }; namespace { none_t none (none_t::creator); } [/code] It works, but I feel uncomfortable defining boost::none in every translation unit. Any better ideas are welcome. Regards, &rzej

6 14

[BGL] [push_relabel_max_flow] multigraphs ?
by Pablo Madoery 20 Nov '14

20 Nov '14

I was wondering if the push_relabel_max_flow algorithm can be used in multigraphs. I mean, can I have two vertices joined by two edges: one in a direction an the other in the opposite direction with equal capacities ( 1000 for example ). It is clear in the documentation that the reverse edge must exist for each edge in the graph, so there must be 4 edges in the case I am describing. but the question is: does the algorithm works properly for this case ?

1 0

Re: [boost] [library-incubator vs Developer's list] was Ease commenting (Was: [safe_numerics] questioning the basic idea)
by Felix Uhl 19 Nov '14

19 Nov '14

Robert Ramey wrote: >> True, but it doesn't immediately raise a discussion - a message posted >> here gets seen by quite a few people, hopefully some of whom will be >> motivated to respond. > Damn - I just can't win here! As I said in a previous post, this is the problem of the incubator, a lack of community. I know that it would be a lot of work, but your best bet is to build on the large mailing list community that already exists. > a) Boost (I believe) was conceived as a way to support C++ with expanded > libraries > which would eventually enter the standard. > b) It has largely fulfilled that purpose. Making the standard a lot bigger > will make > it every more difficult for vendors to supply a conforming implementation. > So I don't > think the standard library can grow a lot more. Thoughts like that seem to be preliminary to me. We shouldn’t stop thinking about new facilities. But I agree that boost is not the “Soon on std” it was a long time ago, and I think this is the general consensus now. > c) But C++ still needs a lot of help. It needs a lot more libraries most of > which are > too special purpose to be suitable for inclusion in the standard. And the > number of > these libraries is large - on the order of 500. This has to be the goal of > Boost 2.0 This is a huge point of discussion, but probably not suited for this thread. The future of boost is a controversial topic, though. > d) This list can't do this job > 1) 500 libraries would drown this list. I agree that this mailing list is not suited for a larger number of libraries, it is already pretty crowded. I personally like the layout of forums, the ability to subscribe to threads and have subforums for different topics. We already have sublists for larger and more widely used libraries, so that’s something. However, I don’t think the incubator would handle that number of libraries well, either. Something prepared for that scale will probably be hard to implement in wordpress. For a plan this huge, you need to form a team of highly skilled professionals that can envision, plan and execute such a project. > 2) the discussions on the list are extremely useful and should be > preserved in an easily accessible way. Again, forums do that quite nicely. > 3) There needs a way to pay for this development - boost has no way to do > this. I’m not here since a long time, but from what I could tell, boost is not based on voluntary work entirely, is it? Still, you’re probably right in the way that boost encourages high quality libraries which are above the standard of many company-internal code, and that the countless hours of work for a library that is well documented, written and tested should be compensated for. For me, just the knowledge that other programmers, probably even companies, will use my code, is quite satisfying, but I’m only writing a small header-only library, something you could still consider a hobby. > 4) This needs a lot more library writers. > i) But most programmers don't know how to prepare a boost quality > library: code, tests, documentation, etc. I don’t think boost has to nor needs to train new programmers. There are good programmers out there, and some of them may have written code for their work that could become a good boost lib, if they had time to flesh it out. > ii) Most library writer need some hope of compensation to justify the > time spent. Yes. Especially considering that boost has high standards for code quality, you can’t just submit an interesting prototype and call it a boost library. > iii) All libraries need testers, critique, feedback, etc. Boost can > only do that for libraries in review - and we can't review the candidates we > already have. And we don't have a mechanism other than this list for > dealing with this outside of the review. In a nutshell, the developer's > list can't scale the way I think it has to. As noted previously, I agree with you there. --- Felix Uhl PS: Robert, you really like writing lists of stuff, don’t you? ;-)

2 1

[nowide] Add C++ 11 support
by Michael Smith 19 Nov '14

19 Nov '14

This is a library I'd like to see in Boost proper. I plan to use it in a current project. One enhancement that would make it easier to work with is supporting new C++11 interfaces for the adapters it implements. Things like explicit fstream (const string& filename, ios_base::openmode mode = ios_base::in | ios_base::out); Any plans to do that? I'm happy to do the work and share it on Github.

1 0

[fit] please respond
by Andrzej Krzemienski 19 Nov '14

19 Nov '14

Hi, Encouraged by Boost Library Incubator initiative I wanted to make a review of FIT library, but I found I had some questions to Paul - the author. I send my questions also here, in case you are not subscribed for the comments in Boost Library Incubator. Please see my comment here: http://rrsd.com/blincubator.com/bi_library/fit-3/?gform_post_id=1100 Regards, &rzej

1 0

Variant and visitation (was: [optional] Safe optional)
by Nevin Liber 19 Nov '14

19 Nov '14

On 18 November 2014 15:02, Matt Calabrese <rivorus(a)gmail.com> wrote: > > > > For a while I assumed exactly that, but he actually specifically voiced > > > that he does not like visitation on variant and thinks of it as a hack. > > > It's sad :/ > > > > > > > FWIW: I think he is (a) correct, but (b) we have nothing better to > replace > > it, so we still need it. > > > > We should really start a thread about this. I'm very curious to see an > actual objective rationale both for why visitation over a closed set of > types known at compile time is in any way a "hack," It's the inversion of control that people just don't like. > along with a realistic > alternative. As I already said, I don't know of one, and having it is better than not having it. The discussion in Urbana on n4218 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4218.pdf> (variant), which didn't propose visitation, basically amounted to we don't like visitation but we need it unless something better comes along. > It really is a fundamental operation of a discriminated union. > As someone who uses variants pretty much as the "default" for run-time > polymorphism in day-to-day coding, I have never seen an actual explanation > for what someone might consider bad about variant visitation, neither from > Bjarne nor anyone else. > While I don't want to speak for Bjarne, I believe he would rather have some form of Pattern Matching <http://www.stroustrup.com/OpenPatternMatching.pdf> and possibly variant as a language feature. That being said, no one has proposed it. -- Nevin ":-)" Liber <mailto:nevin@eviloverlord.com> (847) 691-1404

5 8

Re: [boost] [optional] Safe optional
by Felix Uhl 18 Nov '14

18 Nov '14

Matt Calabrese wrote: > I know that there are others (Eric?) who prefer to think of optional as a > container of size 0 or 1, so it could also make sense to provide an > accessor to a range. One interesting effect of this is that now > range-based-for sort of becomes a "visit if." There are probably other... > interesting uses of standard algorithms. I don’t know why, but I really like that idea; int f(optional<int> input){ int ret = 0; for(int opt : input){ ret = opt; } return ret; } It somehow seems like a really interesting Syntax, but to be honest, it doesn’t really offer any benefits, does it? You neither have any improvements on performance, nor any on code clarity. --- Felix Uhl Von: Matt Calabrese Gesendet: ‎Montag‎, ‎17‎. ‎November‎ ‎2014 ‎17‎:‎41 An: boost(a)lists.boost.org On Nov 17, 2014 1:25 AM, "Andrzej Krzemienski" <akrzemi1(a)gmail.com> wrote: > No, no exceptions. > The solution is based on the observation that there is a limited number of > things you can do with optional<T> > > optional<int> oi = ...; > > 1: > if (oi) doSomething(*oi); > else doSomethingElse(); // or nothing > > 2: > if (oi) doSomething(*oi); > else doSomething(-1); // use default value > > 3: > if (!oi) oi = (int)getIntByOtherMeans(); > doSomething(*oi); // now it is safe > > Now we simply provide a dedicated interface for each of these three usages: > > 1: > oi.use(&doSomething, &doSomethingElse); // or use lambdas > > 2: > doSomething(oi.value_or(-1)); > > 3: > doSomething(oi.value_or_eval(getIntByOtherMeans)); While I agree that we should be encouraging high order functions/visitation here, my personal experience is simply that many people do not like it. When given the choice to pass a lamda or to use an "if" or a range-based-for over high order function alternatives, programmers will generally opt for not using a lambda. The fact that Bjarne thinks visitation is somehow "bad" doesn't help. I agree that it's safer and I'd be in favor of it, but be aware that not everyone will like it. That said, I'd be in favor of this. If going with this approach, though, I'd say make optional a model of a variant and/or discriminated union concept that it and variant share, along with "expected" if it were to make it into boost (I.E. allow for apply_visitor of T and none, provide a "which"). I'd still like to see the other functions you mention as well for convenience. I know that there are others (Eric?) who prefer to think of optional as a container of size 0 or 1, so it could also make sense to provide an accessor to a range. One interesting effect of this is that now range-based-for sort of becomes a "visit if." There are probably other... interesting uses of standard algorithms. > I would rather not go that way. boost::optional is not unsafe. It is simply > something else than what some people think. Its conceptual model is more > like any value of T, plus one additional value. In this model implicit > conversions make perfect sense and are n fact desirable. I'm not sure I agree. These two templates aren't exactly complimentary in terms of the functionality that they provide, they really would just provide exactly the same functionality with the same internals. All that is different is the interface. Because of that, I say either it replaces optional or it doesn't exit as a part of boost. If people are convinced that this interface is less error prone, then it should be THE interface for optional. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

[config] [VC++ 14.0 aka 2015] Removing BOOST_MSVC_ENABLE_2014_JUN_CTP macro requirement.
by Beman Dawes 18 Nov '14

18 Nov '14

As of the moment, the BOOST_MSVC_ENABLE_2014_JUN_CTP macro must be defined to eliminate a bunch of macros that should not apply to the Visual Studio 2015 Preview: BOOST_NO_CXX11_ALIGNAS [no value] BOOST_NO_CXX11_CHAR16_T [no value] BOOST_NO_CXX11_CHAR32_T [no value] BOOST_NO_CXX11_INLINE_NAMESPACES [no value] BOOST_NO_CXX11_NOEXCEPT [no value] BOOST_NO_CXX11_REF_QUALIFIERS [no value] BOOST_NO_CXX11_UNICODE_LITERALS [no value] BOOST_NO_CXX11_USER_DEFINED_LITERALS [no value] In other words, the only CXX11 macros that should be defined are: BOOST_NO_CXX11_ADDRESSOF [no value] BOOST_NO_CXX11_CONSTEXPR [no value] Unless someone objects strongly in the next few hours, I'm going to remove the need for the BOOST_MSVC_ENABLE_2014_JUN_CTP macro; it is just causing confusion at this point. --Beman

6 11

noexcept(true) for ~noncopyable?
by Olaf van der Spek 18 Nov '14

18 Nov '14

Shouldn't ~noncopyable be noexcept? I'm seeing this error: class Cconnection : public Cclient, boost::noncopyable connection.h:5:7: error: looser throw specifier for ‘virtual Cconnection::~Cconnection()’ In file included from connection.h:3:0, from connection.cpp:2: client.h:10:10: error: overriding ‘virtual Cclient::~Cclient() noexcept (true)’ https://svn.boost.org/trac/boost/ticket/10698 -- Olaf

2 3

[BGL] [push_relabel_max_flow]
by Pablo Madoery 18 Nov '14

18 Nov '14

Hello, I am having trouble using the push_relabel_max_flow algorithm when i put std::numeric_limits<double>::max() as capacity attribute in some edges. is there a maximum value that I can use as capacities. which ?. This is the example I am using : #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/push_relabel_max_flow.hpp> #include <boost/graph/graphviz.hpp> using namespace std; using namespace boost; struct vertexInfo { }; struct edgeInfo { double capacity; double residualCapacity; double flow; adjacency_list_traits<vecS, vecS, bidirectionalS>::edge_descriptor rev; edgeInfo() { residualCapacity = 1000; } }; typedef adjacency_list<vecS, vecS, bidirectionalS, vertexInfo, edgeInfo> Graph; typedef Graph::edge_descriptor edge_d; const char* names[] = { "SV", "L1", "L2", "L3", "L4", "ET"}; template<typename Vertex> void create_edge(Graph& g, Vertex v0, Vertex v1, double capacity) { //the algorithm requires that for each edge u-v in the graph, the edge v-u also exists Graph::edge_descriptor ep0 = (add_edge(v0, v1, g)).first; Graph::edge_descriptor ep1 = (add_edge(v1, v0, g)).first; g[ep0].capacity = capacity; g[ep0].rev = ep1; g[ep1].capacity = 0; // the capacity of v-u needs to be 0 g[ep1].rev = ep0; } int main() { Graph graph; Graph::vertex_descriptor SV = add_vertex(graph); Graph::vertex_descriptor L1 = add_vertex(graph); Graph::vertex_descriptor L2 = add_vertex(graph); Graph::vertex_descriptor L3 = add_vertex(graph); Graph::vertex_descriptor L4 = add_vertex(graph); Graph::vertex_descriptor ET = add_vertex(graph); create_edge(graph, SV, L1, std::numeric_limits<double>::max()); create_edge(graph, SV, L2, std::numeric_limits<double>::max()); create_edge(graph, SV, L3, std::numeric_limits<double>::max()); create_edge(graph, SV, L4, std::numeric_limits<double>::max()); create_edge(graph, L3, ET, 1000); create_edge(graph, L4, L3, 1000); create_edge(graph, L2, L3, 1000); create_edge(graph, L1, L2, 1000); // arcos de vuelta create_edge(graph, L3, L4, 1000); create_edge(graph, L3, L2, 1000); create_edge(graph, L2, L1, 1000); std::cout << "Max flow: " << push_relabel_max_flow(graph, SV, ET, get(&edgeInfo::capacity, graph), get(&edgeInfo::residualCapacity, graph), get(&edgeInfo::rev, graph), get(boost::vertex_index, graph)) << std::endl; graph_traits<Graph>::vertex_iterator vi, vi_end; graph_traits<Graph>::out_edge_iterator ei, ei_end; cout.precision(20); for (tie(vi, vi_end) = vertices(graph); vi!= vi_end; ++vi) { for (tie(ei, ei_end) = out_edges(*vi, graph); ei != ei_end; ++ei) { graph[*ei].flow = graph[*ei].capacity - graph[*ei].residualCapacity; if (graph[*ei].capacity > 0) { std::cout << names[*vi] << " " << names[target(*ei, graph)] << " " << (graph[*ei].capacity - graph[*ei].residualCapacity) << "/" << graph[*ei].capacity << std::endl; } } } cout<<"end"<<endl; return 0; } ----------------------------------------------------------------------------------------------------------------------------- And this is the exception: /home/madoery/boost_1_55_0/boost/graph/push_relabel_max_flow.hpp:706: typename boost::property_traits<CapacityEdgeMap>::value_type boost::push_relabel_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, vertexInfo, edgeInfo>, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, double, double&, long unsigned int, edgeInfo, double edgeInfo::*>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, double, double&, long unsigned int, edgeInfo, double edgeInfo::*>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>&, long unsigned int, edgeInfo, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> edgeInfo::*>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<vertexInfo, long unsigned int>, typename boost::property_traits<CapacityEdgeMap>::value_type = double, typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]: Assertion `algo.is_flow()' failed. Thank You

1 0

gdb pretty printers
by Paul Fee 18 Nov '14

18 Nov '14

Hi all, On Linux, when using GDB to debug C++ programs that use Boost, it's difficult to get human readable values from variables. e.g. == Source == boost::optional<std::string> s("hello world"); == GDB == (gdb) print s $1 = {<boost::optional_detail::optional_base<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >> = {<boost::optional_detail::optional_tag> = {<No data fields>}, m_initialized = true, m_storage = {dummy_ = {data = "(0`\000\000\000\000", aligner_ = {<No data fields>}}}}, <No data fields>} ======== A set of python pretty printers that understand the internals of some Boost objects can be found here: https://github.com/ruediger/Boost-Pretty-Printer The resulting output is more useful: == GDB == (gdb) print s $2 = boost::optional<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > is initialized = {value = "Hello world"} ========= Some distros, e.g. Fedora, CentOS have STL pretty printers working out of the box. It would be great to also have Boost pretty printers widely available via Linux distros. Since the pretty printers are tightly coupled to the objects they're printing, it would be ideal if they were included with Boost. That way both the class definitions and python printers should stay in sync. Can someone provide guidance on how to get code in the above github repo into Boost? Thanks, Paul

1 0

Boost config macros for 'override' and 'final'?
by Nat Goodspeed 17 Nov '14

17 Nov '14

I don't find in Boost 1.57 any Boost macros to mediate use of the 'override' or 'final' C++11 specifiers. Would that be a reasonable addition?

6 7

RFC/patch: compile boost on Android for platform development
by Wagner, David 17 Nov '14

17 Nov '14

Hi, We are evaluating the pros and cons of using Boost for platform development on Android. We have successfully built and run Asio's "chat" server and client examples on an Android device running Lollipop. The C++ support seems to have been greatly improved since KitKat. Even though it is still early to say that all of Boost runs ok, all the Asio unit tests passed with "*** No errors detected" except the multicast test. I've attached a patch that adds Android makefiles to relevant libraries for compiling Boost.Asio. It's a first draft and it doesn't use the git submodules. The development of this patch has been made on top of the 1.56.0 tag. Platform development on android is different than native development ("NDK", used for JNI libraries). There seem to have been several efforts made for Boost support on NDK but we haven't found any for platform development (which is aimed at device support, e.g., HAL development, native tools). Is there an interest for maintaining a set of Android makefiles on vanilla Boost ? I understand someone would need to run the regression tests on Android; is there any other such requirement ? Kind Regards, -- David Wagner Intel Corp. --------------------------------------------------------------------- Intel Corporation SAS (French simplified joint stock company) Registered headquarters: "Les Montalets"- 2, rue de Paris, 92196 Meudon Cedex, France Registration Number: 302 456 199 R.C.S. NANTERRE Capital: 4,572,000 Euros This e-mail and any attachments may contain confidential material for the sole use of the intended recipient(s). Any review or distribution by others is strictly prohibited. If you are not the intended recipient, please contact the sender and delete all copies.

2 2

Re: [boost] Is there interest in a library for string-convertible enums?
by Jeffrey Bush 17 Nov '14

17 Nov '14

> > Jeffrey Bush wrote: > > > I have also offered a class for doing this as well, although it didn't > draw > > the interest that this one did. > > Here was my attempt at it with a test/example class: > > https://gist.github.com/coderforlife/6d8bac451d49dd1a0c81 > > > > > Looks good to me, and seems to be quite close to what I aim at. > > But the definition seems very user unfriendly. Is it correct that > > you always have to declare enums in the public namespace? > > --- > > Felix > Sorry for the delayed response. It does support being in a public namespace, even as a sub-class. However the definition does get uglier in sub-classes. The major problem I ran into was that the class could not be defined in a header file without getting multiple-definition or as a sub-class without running into problems. Mainly because of the constant arrays in the classes couldn't be defined in-line and in headers. Some C++11 features may help get around this. I do think that when these issues are ignored the declarations are pretty nice: BOOST_FLAGS_WITH_VALUES(MyFlags, std::uint8_t, A, 1, B, 2, AB, 3, C, 4); BOOST_FLAGS(MyDefaultFlags, AX, BX, CX, DX, EX, FX, GX, HX); namespace MyNS { BOOST_FLAGS(MyFlags, M, N, O, P, Q); } That makes 3 different enumerations, first with custom values and a custom base (uint8_t), the second with default values (powers of two) and selects the smallest base type, and the third is the same but in a non-public-namespace. All of these don't work in header files without getting multiple definitions. To avoid that problem you can do something like: // In H file: BOOST_FLAGS_DECL(MyFlags, M, N, O, P, Q); // In CPP file: BOOST_FLAGS_DEFN(MyFlags, M, N, O, P, Q); The same technique can be used to make sub-classes (as in the example file). If I remember correctly if the ability to go from string -> value and get list of values at runtime then the ugliness of the separate DECL/DEFN would be avoided. Jeff

1 0

Re: [boost] [review][sort] Formal review period for Sort library begins today, November 10, and ends Wednesday, November 19
by Niall Douglas 16 Nov '14

16 Nov '14

On 10 Nov 2014 at 0:39, Edward Diener wrote: > - What is your evaluation of the design? It's okay. I would prefer a design where there is a sorted_view which if std::copy gives an actually sorted copy. Obviously one would then specialise that scenario with a more directly optimised specialisation, and you'd also have the API presented here which looks like std::sort(). I'd also prefer to see fallback implementations for less than random iterators, right down to forward only iterators. > - What is your evaluation of the implementation? There seems to be an assumption that user supplied overloads and specialisations e.g. swap() don't throw exceptions. I think that unwise. BOOST_NOEXCEPT can test if something can throw. Explicit guarantees of what happens when something does throw needs to be in the documentation, per API. There seems to be a general lack of explicit C++ 11 support as well. In particular, I think all Boost libraries should use inline namespaces to implement ABI version management. Implementation isn't capable of dual build as standalone use without any dependency on Boost. I'd suggest my forthcoming Boost.BindLib library. > - What is your evaluation of the documentation? Lacks exception guarantees, one per API. Lacks scaling graphs near front so people can quickly evaluate usefulness compared to std::sort. I believe the author will fix this though. > - 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? No. > - How much effort did you put into your evaluation? A glance? A > quick reading? In-depth study? Glance. > - Are you knowledgeable about the problem domain? Author of a very popular open source indexing algorithm library. > And finally, every review should attempt to answer this question: > > - Do you think the library should be accepted as a Boost library? Yes with these conditions: 1. Either change its name to Boost.Spreadsort, or do a much better job at a general sort library e.g. sorted_view, more than one sort algorithm not in the STL, more than random access iterator support. 2. Exception safety is not obvious, and explicit exception guarantees need to be made and stated per API in the documentation. 3. Explicit ABI version management in C++ 11 using inline namespaces. Forthcoming Boost.BindLib can do this for you, or it can be done by hand. It would also be nice if this library were also capable of standalone build without Boost, but this is not a requirement. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

2 4

Re: [boost] How do I authenticate myself?
by Felix Uhl 14 Nov '14

14 Nov '14

Andrey Semashev wrote: > Note that you can have anonymous read-only access if you change the URL a little: > git://github.com/boostorg/boost.git > That should probably be mentioned in the docs. Thank you very much, that was exactly what I needed. Should've probably thought about that myself. I agree, that should be mentioned. Especially under the point "try out modular boost". --- Felix Uhl ________________________________ Von: Andrey Semashev<mailto:andrey.semashev@gmail.com> Gesendet: ‎14.‎11.‎2014 14:17 An: boost(a)lists.boost.org<mailto:boost@lists.boost.org> Betreff: Re: [boost] How do I authenticate myself? On Friday 14 November 2014 10:55:36 Felix Uhl wrote: > I want to clone the current develop branch > > to verify that a bugfix to a trac item I opened > > does actually fix the bug. > > > It seems like this information should be easy > > to find on the boost webpage or wiki, but neither > > of both explain how to authenticate myself > > when using “git clone --recursive git@ > > github.com:boostorg/boost.git modular-boost >clone.log”. > > The output of this is “Permission denied (publickey)”, > > which seems to mean to me that I need a > > ssh key the server actually knows about or that I have > > to upload my public key somehow. > > > Have I just missed something on the wiki? As Boost is hosted on GitHub, all the options it offers also work with Boost. See here: https://help.github.com/articles/which-remote-url-should-i-use/ Note that you can have anonymous read-only access if you change the URL a little: git://github.com/boostorg/boost.git That should probably be mentioned in the docs. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [boost] How do I authenticate myself?
by Felix Uhl 14 Nov '14

14 Nov '14

Adam Wulkiewicz wrote: >FYI, instead of preparing a patch and attaching it to a bug report you >could consider working directly on the development version of a library >and propose a pull request with the fix on GitHub. The fix is not mine, I have opened a ticket, the author has written a fix and I just wanted to clone to check if the fix has fixed the issue. Thanks for the link, though, I'll make sure to check it out. --- Felix Uhl ________________________________ Von: Adam Wulkiewicz<mailto:adam.wulkiewicz@gmail.com> Gesendet: ‎14.‎11.‎2014 14:48 An: boost(a)lists.boost.org<mailto:boost@lists.boost.org> Betreff: Re: [boost] How do I authenticate myself? Andrey Semashev wrote: > On Friday 14 November 2014 10:55:36 Felix Uhl wrote: >> I want to clone the current develop branch >> >> to verify that a bugfix to a trac item I opened >> >> does actually fix the bug. >> >> >> It seems like this information should be easy >> >> to find on the boost webpage or wiki, but neither >> >> of both explain how to authenticate myself >> >> when using “git clone --recursive git@ >> >> github.com:boostorg/boost.git modular-boost >clone.log”. >> >> The output of this is “Permission denied (publickey)”, >> >> which seems to mean to me that I need a >> >> ssh key the server actually knows about or that I have >> >> to upload my public key somehow. >> >> >> Have I just missed something on the wiki? > As Boost is hosted on GitHub, all the options it offers also work with Boost. > See here: > > https://help.github.com/articles/which-remote-url-should-i-use/ > > Note that you can have anonymous read-only access if you change the URL a > little: > > git://github.com/boostorg/boost.git > > That should probably be mentioned in the docs. FYI, instead of preparing a patch and attaching it to a bug report you could consider working directly on the development version of a library and propose a pull request with the fix on GitHub. Here is a tutorial showing how this could be done: https://github.com/boostorg/geometry/wiki/Contribution-Tutorial It was made for Geometry but the procedure looks the same for any other library. Regards, Adam _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

How do I authenticate myself?
by Felix Uhl 14 Nov '14

14 Nov '14

I want to clone the current develop branch to verify that a bugfix to a trac item I opened does actually fix the bug. It seems like this information should be easy to find on the boost webpage or wiki, but neither of both explain how to authenticate myself when using “git clone --recursive git@ github.com:boostorg/boost.git modular-boost >clone.log”. The output of this is “Permission denied (publickey)”, which seems to mean to me that I need a ssh key the server actually knows about or that I have to upload my public key somehow. Have I just missed something on the wiki? --- Felix Uhl

3 2

[sort] Review of the Sort library by Steven Ross
by Edward Diener 14 Nov '14

14 Nov '14

As review manager I am forwarding this review sent to me: - What is your evaluation of the design? - What is your evaluation of the implementation? Design an implementation look good to me. Spreadsort has a clean interface and the code is readable. I tried the algorithm out a few years ago in a project at work (our product in the EDA industry) for sorting 32-bit {x,y} coordinate data cast to a 64-bit integer, and for sorting 32-bit values within scanlines. The speedup was about 1.8x that of std::sort() for ~100M values. This translated into a 10-20% overall runtime reduction in that tool, with only a few lines of code changes. - What is your evaluation of the documentation? I haven't read through the documentation in detail, but I have read through the code and the comments so I feel I understand the basics of how the sorting algorithm works. - What is your evaluation of the potential usefulness of the library? I would say this library is very useful for specific tasks involving large datasets that need to be sorted, especially in cases where the data is already partially sorted and contains many duplicate values. For example, it could be useful for EDA applications, computational geometry, some types of databases, etc. It may be a fairly narrow user base but I think it could add significant value. - Did you try to use the library? With what compiler? Did you have any problems? I built and tested spreadsort on both linux/gcc and Windows/MSVC++. I was never successful in running the tests in Cygwin. It seemed to work as expected when I tried using it inside an EDA tool and caused no problems. - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? I spent some hours reviewing the algorithm a few years ago, and I provided Steve with feedback to improve the code. I was mostly interested in the integer sorting aspect at that time, but did experiment with floating-point numbers as well. I read through the code again recently to familiarize myself with it. - Are you knowledgeable about the problem domain? I would say that I'm knowledgeable of applications and uses of sorting large datasets, and algorithms in general. I don't have any specific experience in developing or testing sorting algorithms. - Do you think the library should be accepted as a Boost library? Yes, I believe Steve has put in enough work to make this a well designed, tested, and documented library. There are real numbers to show the performance improvements over other sorting algorithms. If this was part of Boost, I would probably use it in our product at my company. Frank Gennari

1 0

which submodule are boost headers in?
by Robert Ramey 13 Nov '14

13 Nov '14

This is making me feel really dumb. I want to remove a header in the /boost/ directory. This has been superseded by a header of the same name in the serialization library. boost/strong_typedef.hpp I expected to find a sub-module in modular boost which I can just select, get permission to make changes and upload my change - just remove this file. But I don't find a sub-module which seems to contain this header. So I need some help. Actually the simplest would be for someone who understands this and has appropriate privileges to just do the dirty work for me and remove the file. Failing that, someone can explain the procedure for finding the file, and getting the requisite privileges. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/which-submodule-are-boost-headers-in-tp4… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 2

[site] uBLAS documentation page link is broken
by Renato Florentino Garcia 13 Nov '14

13 Nov '14

The uBLAS documentation link[1] on Boost libs documentation page[2] is broken. The previous released version[3] is yet working nevertheless. Regards, Renato Garcia [1]: http://www.boost.org/doc/libs/release/libs/numeric/ublas/doc/index.htm [2]: http://www.boost.org/doc/libs/ [3]: http://www.boost.org/doc/libs/1_56_0/libs/numeric/ublas/doc/index.htm

2 1

[smart_ptr] explicit instantiation of boost::shared_ptr
by Petr Machata 12 Nov '14

12 Nov '14

Hi there, I got a bug report that the following code doesn't compile: #include <boost/tr1/memory.hpp> template class boost::shared_ptr<int>; int main(int, char**) {} The errors this gives under GCC 4.9 are as follows: In file included from /usr/include/boost/shared_ptr.hpp:17:0, from /usr/include/boost/tr1/memory.hpp:56, from foo3.cc:1: /usr/include/boost/smart_ptr/shared_ptr.hpp: In instantiation of 'typename boost::detail::sp_array_access<T>::type boost::shared_ptr<T>::operator[](std::ptrdiff_t) const [with T = int; typename boost::detail::sp_array_access<T>::type = void; std::ptrdiff_t = long int]': foo3.cc:2:23: required from here /usr/include/boost/smart_ptr/shared_ptr.hpp:663:22: error: return-statement with a value, in function returning 'void' [-fpermissive] return px[ i ]; This in particular is with boost 1.54. The problem is however present on master as well, where it also gives more errors relating to boost/core/demangle.hpp that I didn't look into. I went ahead to do some investigation in case the issue ends up being trivial. We can't use enable_if to disable a particular member function. Not unless it's a template. Making it a template would lead to a code like this: template <class U = T, class V = boost::disable_if <boost::is_void <boost::detail::sp_array_access< U >::type>, U>::type> boost::detail::sp_array_access< T >::type operator[] (etc. etc.); ... which is not C++98, and I don't have ideas how to C++98-ify it while also having it do what we want without breaking API. (The indirection through U may not be necessary, I'm not in fact sure, but that doesn't change anything.) One way that I can see is extracting element_type * px to a base class (say, boost::detail::sp_operator_at) that either does or does not define operator[] (which would then use the px). But that implies some amount of code motion, and not knowing what your position would be, I didn't want to blindly go ahead and start moving stuff around. So, would a patch to the effect described above be possibly acceptable? Thanks, Petr.

2 5

[Fusion] Lots of test failures on develop
by Louis Dionne 12 Nov '14

12 Nov '14

I'm getting a lot of test failures on the develop branch of Fusion on OS X. There are too many to paste the output here. Note that master is just fine. Are the unit tests being run automatically each time a pull request is merged? Louis

5 8

Boost.Build: new tutorial
by Vladimir Prus 12 Nov '14

12 Nov '14

Back in 2009, Boris Schäling wrote a Boost.Build tutorial that many deemed to be better than the tutorial in the official documentation. It took quite some time, but it's now part of Boost.Build, here: http://www.boost.org/build/tutorial.html I'd appreciate any comments. Note that previously, I planned to integrate this tutorial with the boostbook documentation. It's becoming clear that there's just no time for that, and the tutorial is added as HTML page. I haven't decided yet what to do with old tutorial in boostbook sources. -- Vladimir Prus CodeSourcery / Mentor Embedded http://vladimirprus.com

9 14

[multi_index] Doc suggestion.
by Mostafa 11 Nov '14

11 Nov '14

Not being able to mutate elements through non-const iterators is surprising enough that I forget about it every time I use Boost.MultiIndex. Part of the reason for this is that this information is buried under section "multi_index/doc/tutorial/basics.html#seq_indices". I suggest that the following paragraph: "That is, iterators of a sequenced index (of all types of indices, actually) point to constant elements. This limitation might come as a surprise, but it is imposed by the way multi_index_containers work; if elements were allowed to be changed in this manner, we could introduce inconsistencies in other ordered indices of the multi_index_container. Element modification can nevertheless be done by means of update operations." be moved under "multi_index/doc/tutorial/basics.html#iterator_access" as a call-out.

2 5

Boost Incubator Status Report
by Robert Ramey 11 Nov '14

11 Nov '14

Felix Uhl wrote > On 28/10/2014, Rob Stewart wrote: > > >Currently, I am documenting the first version of the library to make it >>available on the Boost Library Incubator website, > > I can hear Robert yelling, "Yes!" Yes! The experience so far with the incubator is very interesting. Here are couple of observations. a) I anticipated more submissions since the process seems so easy and the bar is very low. As a practical matter the requirements boil down to having code, tests, documentation which implies some examples. There are no restrictions of format of any of these things. But if you troll the net looking for libraries very few library ideas fulfill these requirements. It turns out that fulfilling even these modest (in my view) requirements is more than many people find necessary. b) The quality of the submissions is a lot better then I had anticipated. All of them are credible, serious efforts which are worthy of serious consideration for inclusion in Boost. That's not to say that all would eventually be accepted as I have only given them a cursory examination. c) There are very few comments on the pages of the website and on the library pages. So far there is only one formal review. I'm sort of disappointed in this. It goes to our problem in getting enough reviews in general. The one review (boost compute) was from one who downloaded and tested the library, liked it, and included it in production. Of course the review was very positive. I would hope to see more of this in the future. d) To support more reviews, I have on my todo list to keep track of who invokes the download/repo links and match them up with the users email address and send out a gentle reminder that if he spent the time to look at and consider the library, he should either comment or add a formal review. I would also like to see some of the posting on this list regarding library proposals to moved to the library comments page. Another alternative would be to link from the library comment page to the developer's list thread(s) which touch upon the library. In any case, I want to see more activity in this area. Any of these require good experience with wordpress and some available time - so I don't see these happening soon. e) I would like to see a little more support from Boost Steering Committee on this effort. Specifically I would like to see the Announcement that Boost endorses the Boost Library Incubator (www.blincubator) packaged and distributed as press release so that it would show up in places like Dr Dobbs Journal. (http://www.drdobbs.com) and isocpp.org (http://isocpp.org) It is a great disappointment to me that in spite of a fair amount of effort, I've been unable to get these sites (among others) to announce the Boost endorsement of Boost Library Incubator. Finally - By next monday, I'll have in place a new facility. This is support on the library page whereby companies which have interest in a particular library will be able to contact the library author in order to offer financial sponsorship for his efforts. Companies which do this will be able to ask for special features and/or extensions, custom versions, extra support or anything they want. Authors will have the option of placing sponsors logos and links on their library pages. This will offer developers of open source the first opportunity in history to be compensated as the rock stars we are. Thanks for everyone for help so far in promoting the Boost Library Incubator. Please continue your efforts. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Incubator-Status-Report-tp4668747.… Sent from the Boost - Dev mailing list archive at Nabble.com.

12 42

Please welcome Nevin Liber as a list moderator
by Beman Dawes 11 Nov '14

11 Nov '14

Nevin has been a long-time Boost Users list moderator, C++Now participant, and C++ committee member. He has graciously agreed to help moderate the Boost developers list. Please welcome Nevin as a list moderator! --Beman

6 5

[git][flyweight] something messed up with master and develop branch
by Joaquin M Lopez Munoz 11 Nov '14

11 Nov '14

Dear Git connoiseurs: I've realized that my master and develop branches at boostorg/flwight appear collapsed: https://github.com/boostorg/flyweight/network Yet I am seemingly able to treat them separately: commit to develop, test, merge to master etc. The only weird thing is the diagram above and the fact that the commit log in master doesn't have the usual "Merge branch 'develop'" commits: https://github.com/boostorg/flyweight/commits/master Any clue what's going on? Thank you! Joaquín M López Muñoz Telefónica

4 9

[release][1.58.0] Updating master and other business.
by Daniel James 10 Nov '14

10 Nov '14

Hello all, It's almost a week since the release, so unless there are any objections I'll restart automatically updating the master branch of the super project in a day or so. I'll also tag the submodules for the last two releases. Please can someone with the appropriate Trac permissions update the milestones and versions. Finally, if anyone has any new libraries that they want to include in the next release, please let us know soon. thanks, Daniel

4 5

VC14 CTP4 Atomic don't compile with boost::chrono durations which are not TriviallyCopyable
by Klaim - Joël Lamotte 10 Nov '14

10 Nov '14

I was testing my code with VC14 and found this issue. I'm just not sure what to do about it, should I consider it a bug of Boost.Chrono or not? This complete example does not compile in VC14 CTP4: #include <atomic> #include <boost/chrono.hpp> std::atomic<boost::chrono::milliseconds> ms; // error C2338: atomic<T> requires T to be trivially copyable. Using the standard library instead works as expected: #include <atomic> #include <chrono> std::atomic<std::chrono::milliseconds> ms; // no error The compiler is correct that boost::chrono::duration is not trivially copyable (as described on cppreference.com at least) but it seems (from looking at the code) that it's mostly concept check code used in constructors definitions that trigger the problem. So I'm not sure if it should be fixed or not or what to do with this info.

2 3

Boost library incubator problem
by Edward Diener 10 Nov '14

10 Nov '14

When I go to the Boost Library Incubator at http://rrsd.com/blincubator.com/, click on the libraries listed alphabetically, and then click on any library, I get: "Not Found Apologies, but the page you requested could not be found. Perhaps searching will help."

2 5

Re: [boost] Boost Incubator Status Report
by Felix Uhl 08 Nov '14

08 Nov '14

Rob Stewart wrote: > When interviewing C++ developers, I find those using Boost libraries, at least beyond shared_ptr, are rare. > The brand is known by relatively few, and it is used, to any significant extent, by fewer still. > That implies the need to grow our ranks through some form of advertising. I came to the observation that boost is well known in more experienced circles of programmers, but, as you said, not that frequently used. As it was previously mentioned, this issue could be solved by entering collaborations with compiler distributors to include boost, or at least a subset of it in their compiler. The only reason STL is used so heavily is because it is a pseudo part of the language, bundled with every compiler, a consistent, standardised foundation to rely on. If the inclusion of boost was as simple as the inclusion of the STL, more programmers would use it. This is what boost seemed like to me after reading herb sutters books: It is a less coherent extension of STL, an idea of what the future might hold. Imagine how well boost would be known if it was bundled with MSVC and gcc. --- Felix Uhl ________________________________ Von: Rob Stewart<mailto:robertstewart@comcast.net> Gesendet: ‎08.‎11.‎2014 11:48 An: boost(a)lists.boost.org<mailto:boost@lists.boost.org> Betreff: Re: [boost] Boost Incubator Status Report On November 7, 2014 5:35:02 PM EST, Edward Diener <eldiener(a)tropicsoft.com> wrote: >On 11/7/2014 11:23 AM, Robert Ramey wrote: >> Vladimir Prus-3 wrote > > The motivation behind the >> design of the incubator is to "make participation easier" by >decoupling the >> preparation of the review from a specific 1-2 week time frame. It >was also >> specifically designed to not alter the actual Boot Review process. > >Other than lengthening the formal review process to encourage more >people to participate I do not see any means to get people more >interested in reviewing Boost libraries. That is the notion behind the incubator: allow the review period to be open indefinitely, particularly in advance of the formal review period. > As far as the incubator is >concerned I feel it is a good idea but nobody is using it to comment on >libraries. Links from the review queue to the incubator page for each library could help people discover the incubator. > As far as Boost reviews it appears that most programmers are >afraid to even make comments about a potential library in which they >may be interested. Maybe the specter of C++ experts scares them away. Maybe >they feel that they might look foolish if they make a comment which is >based on just a partial understanding of the library involved. What leads you to that conclusion? There are multiple factors that prevent my commenting on a library: * No interest in the domain * No knowledge of the domain * Too busy I realize I'm not in the "too afraid because of experts" camp you describe, but I've not commented on any of the libraries and it isn't due to fear. >Finally there is a decided problem with the lack of people willing to >be >review managers for a library. I think it would be a good idea to >establish a pool of people, with their e-mail addresses, willing to be >review managers and then when a library is on the review queue one of >the review managers would send out e-mail to all people in the pool >asking each one if he would be willing to be the review manager for a >particular library. If no one at a given time in the pool will agree, >then after some pre-established time period the process repeats itself. I've offered to be a review manager a couple of times, but the libraries never went to review or another did the job. However, the last I looked there were multiple libraries I don't feel competent to judge. Being a review manager is more than verifying that examples compile, that documentation exists, etc. One must be able to judge comments and reviews to decide between opposite views, etc. That requires domain knowledge and experience, if not expertise. There are fewer general purpose libraries on tap now. Obviously, folks have more or less time at different periods of their lives, so one can go through periods of no or little participation. There's also the real issue of changes to the industry. As one seeks interesting and lucrative or stable employment, one may target new kinds of development which can mean new languages. Thus, one may retain a more nostalgic interest in C++, but no longer be interested to invest the time needed to be a review manager. To solve those problems requires finding and engaging new blood. When interviewing C++ developers, I find those using Boost libraries, at least beyond shared_ptr, are rare. The brand is known by relatively few, and it is used, to any significant extent, by fewer still. That implies the need to grow our ranks through some form of advertising. ___ Rob (Sent from my portable computation engine) _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [boost] Boost Incubator Status Report
by Felix Uhl 08 Nov '14

08 Nov '14

Robert Ramey wrote: > If you select the "Display Statistics" Button on the Safe Numerics and > display the last 60 days of activity, you can see that the library page has > 50 visits. This is not a huge number. A book on Amazon might > sell 1000 copies and get a couple of reviews (most of whom are > likely the author's relatives). So as the incubator becomes more > a "go to" place to look for libraries, the question of small number > of reviews would solve itself. (hopefully). It seems to me that the whole point that is missing from the incubator is actual usage of it. I like the concept a lot, but do you actually have any plans on how to increase the usage? Just adding features isn’t going to help as long as you haven’t reached a critical point in community size where people start spreading the word on new features. I think this is a very inherent problem to a programmers way of thinking: We envision a great platform, a great framework, a great tool, and set out to implement it, but after doing so, have no idea on how to do follow-up work: Financials, Community building and management, “marketing” or just garnering interest in your project in the first place. In short: What you want to do with the incubator is great, and if it gets going it will quite surely be a great addition to boost. But how will you get it going? --- Felix Uhl Von: Robert Ramey Gesendet: ‎Freitag‎, ‎7‎. ‎November‎ ‎2014 ‎23‎:‎57 An: boost(a)lists.boost.org Edward Diener-3 wrote > Other than lengthening the formal review process to encourage more > people to participate I do not see any means to get people more > interested in reviewing Boost libraries. As far as the incubator is > concerned I feel it is a good idea but nobody is using it to comment on > libraries. > > As far as Boost reviews it appears that most programmers are > afraid to even make comments about a potential library in which they may > be interested. Maybe the specter of C++ experts scares them away. Maybe > they feel that they might look foolish if they make a comment which is > based on just a partial understanding of the library involved. If you select the "Display Statistics" Button on the Safe Numerics and display the last 60 days of activity, you can see that the library page has 50 visits. This is not a huge number. A book on Amazon might sell 1000 copies and get a couple of reviews (most of whom are likely the author's relatives). So as the incubator becomes more a "go to" place to look for libraries, the question of small number of reviews would solve itself. (hopefully). And of course if one can make a review at the moment he's decided to use or discard the library, it's more likely that, being in a state of ecstasy or frustration, he'll display his feelings by making a review while the facts and emotion are fresh in his mind. > Finally there is a decided problem with the lack of people willing to be > review managers for a library. Again, if we had more "pre-reviews" getting a review manager would be a snap. a) a library with a large number of negative pre-reviews will likely not even be selected for review. b) a library with no reviews suggests that it's not getting enough usage to be useful so maybe it's not worth reviewing. b) a library with a large number of positive reviews - it's easy to be the review manager. c) for the rest - well, at least the manager knows what he's in for. That might make it easier. In short, I would hope if we can make the incubator a success, it will help with the shortage of review managers. If any library in the incubator ever gets enough reviews, and gets reviewed, and passes review, I intend to leave all the reviews on display indefinitely. In fact, I intend to allow anyone to post review in the future. Current boost libraries vary a lot in quality but our current setup doesn't make that visible. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Incubator-Status-Report-tp4668747p… Sent from the Boost - Dev mailing list archive at Nabble.com. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

pp
by Jan Boehme 07 Nov '14

07 Nov '14

Hello, the file boost/preprocessor/config/variadics.hpp doesn't exist but is referenced in the pp docs. Regards, Jan

2 2

Re: [boost] Boost Incubator Status Report
by Felix Uhl 06 Nov '14

06 Nov '14

Gordon Woodhull wrote: > We did update the formal review process and related pages to > invite people to use the Incubator to garner feedback before their library > is ready for a formal review. [*] That’s how I found out about it, so I would say the submission to the incubator is at least encouraged by Considering that, it seems a bit weird that the incubator has so little activity. > I don't think Robert ever intended the Incubator to replace the formal review or the role of the Wizards. > Instead, IMO it is better thought of as a replacement for the unscheduled > part of the review schedule (aka the Queue), and a better way to verify > the basic requirements for submitting a library. And reviews can be > submitted and responded to before the formal review, > without getting buried in the mailing list. That’s how I understood it, but from my - admittedly sparse - experience, the mailing list is an excellent place for feedback, because it is guaranteed that quite a few people will actually get the message. When I have my library ready for submission to the incubator, how is anyone going to notice it? Are enough people subscribed to the feeds that a library gets more attention than in the mailing list, or at least attention from different groups of people? It seems like the most fundamental element of the incubator is a dedicated community that is willing to participate, to test and review. And it is clearly missing exactly that. --- Felix Uhl

2 1

Boost on Google+
by Vladimir Prus 06 Nov '14

06 Nov '14

Hi, I've created a Google+ community for Boost, and everybody is welcome to join here: https://plus.google.com/communities/106814259809358442744 I don't have any great plan here, but a lot of tech people are active on G+, so why not? -- Vladimir Prus CodeSourcery / Mentor Embedded http://vladimirprus.com

1 0

Boost.Build 2014.10
by Vladimir Prus 05 Nov '14

05 Nov '14

New standalone release of Boost.Build is now available from: http://boost.org/build This one is effectively the same as what is bundled in Boost C++ Libraries 1.57 release. It has been a while since previous standalone release, and I know a few people were using nightly builds to conveniently get recent fixes, which is not a perfect arrangement. Turned out that github release system is fairly easy to use, so I should be able to push releases more often in future. Thanks, -- Vladimir Prus CodeSourcery / Mentor Embedded http://vladimirprus.com

2 1

Master open?
by Joaquin M Lopez Munoz 05 Nov '14

05 Nov '14

Hi, Is master open again for commits targeted at Boost 1.58? Thank you, Joaquín M López Muñoz Telefónica

2 1

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 05 Nov '14

05 Nov '14

Gavin Lambert wrote: > Features that I would expect of such a library: > - support for arbitrary non-contiguous values. > - enum value to string. > - string to enum value. That's done already. > - list of all valid values, either as strings or values. > - can indicate whether a given value (string or enum) is a member of > the enumeration. Easy, will do. > - can round-trip (enum -> string -> enum) values that are not members > of the enumeration; of course (string -> enum -> string) is not feasible > for non-members. What would a conversion from an enum that is not a member to a string look like? Should it just be converted to the string representation of the underlying type like “7”? Or something like “MyEnum::7”? Or would the string representation solve a term with bitwise OR like so: “one|two|four”? The latter would be very interesting for bitwise flag enums. > - can specify a custom string value that the enum value generates (not > just the BOOST_PP_STRINGIZE). Yeah I will implement that. Not sure why one would want it, it does nothing but induce confusion in my eyes, but I’m not the one to tell you what to do. > Features that would be nice, but not necessarily expected: > - enum to string and back for "bitwise flag" style enums (eg. CSV names). Not sure what you mean by that, because the regular string conversions work for those just as fine. Do you mean what I wrote above with the OR connected values in a string representation? > - some mapping to std::bitset or similar. That would be interesting! I’ve added it to the feature list, but it will probably take some time . > - can specify multiple string values that map to the same enum value. Hm. I’m not sure if I’d want that, or how that could even be implemented. If somebody wanted non-casesensitive behaviour, it would be better to use a std::string with custom char_traits, and that’s something I’ll definitely offer. > - can specify different conversion tables for the same enum type (for > use in different contexts, eg. serialisation vs. user output). I thought about that, too. I already give the option to choose between std::maps and a linear search for lookups, but I would really like to give the client more options. Those were good suggestions, thank you very much! You’ve given me quite some things to work on, but now I’ve got a pretty decent feature list. --- Felix Uhl Von: Gavin Lambert Gesendet: ‎Mittwoch‎, ‎29‎. ‎Oktober‎ ‎2014 ‎00‎:‎57 An: boost(a)lists.boost.org On 29/10/2014 00:09, Felix Uhl wrote: > So far, the only way to convert an enumeration value to a string is > a lot of boilerplate code consisting of switch case statements for > every single possible value of the enum. Not the only way. The method I use is to create a lookup table via a little macro magic. Granted that I'm then doing a linear scan through the table (whereas a switch statement could be more efficient, or knowledge that the enum is contiguous and could therefore do an index lookup), but having a table allows for other useful queries, and I wanted something that could be defined statically. As a side-benefit (that undoubtedly will horrify some people), the way the code was implemented also allows it to act as a string-to-member-pointer lookup table, which can be quite handy for typed property bags and the like with a string lookup key. > What features would you want from such a library? Features that I would expect of such a library: - support for arbitrary non-contiguous values. - enum value to string. - string to enum value. - list of all valid values, either as strings or values. - can indicate whether a given value (string or enum) is a member of the enumeration. - can round-trip (enum -> string -> enum) values that are not members of the enumeration; of course (string -> enum -> string) is not feasible for non-members. - can specify a custom string value that the enum value generates (not just the BOOST_PP_STRINGIZE). Features that would be nice, but not necessarily expected: - enum to string and back for "bitwise flag" style enums (eg. CSV names). - some mapping to std::bitset or similar. - can specify multiple string values that map to the same enum value. - can specify different conversion tables for the same enum type (for use in different contexts, eg. serialisation vs. user output). _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

3 2

Fit: C++ function utility library
by pfultz2 05 Nov '14

05 Nov '14

Hi, I developed a library called Fit, that provides a lot of utilites for dealing with function objects, here: https://github.com/pfultz2/Fit First, it provides a mechanism to construct function objects at compile time using lambdas, for example: const constexpr auto sum = FIT_STATIC_LAMBDA(auto x, auto y) { return x + y; }; Secondly, it provides lots of adaptors to provide "enhancements" to the function. For example, we could make the sum function pipable: const constexpr auto sum = pipable(FIT_STATIC_LAMBDA(auto x, auto y) { return x + y; }); Then call it like this: auto three = 1 | sum(2); Or we could make it an infix operator: const constexpr auto sum = infix(FIT_STATIC_LAMBDA(auto x, auto y) { return x + y; }); And then use it like this: auto three = 1 <sum> 2; Also, it provides the basic partial application and function composition: auto add_1 = partial(sum)(1); auto add_2 = compose(add_1, add_1); auto four = add_2(1); Now, the greatest benifit is being to do better overloading and even recursive functions using lambdas. So, for example, if we wanted to write a more sophisticated `print` function that iterated over ranges and fusion sequences recursively, and printed it all out, we can write this using the Fit library: // Some helpers for template constraints #define REQUIRES(...) typename std::enable_if<(decltype(__VA_ARGS__)()), int>::type = 0 template<template<class...> class Trait, class... Ts> constexpr auto trait(Ts&&...) { return std::integral_constant<bool, Trait<std::remove_reference_t<Ts>...>::value>(); } const constexpr auto print = fix(conditional( // Overload for strings FIT_STATIC_LAMBDA(auto, const std::string& x) { std::cout << x << std::endl; }, // Overload for fusion sequences FIT_STATIC_LAMBDA(auto self, const auto& seq, REQUIRES(trait<boost::fusion::traits::is_sequence>(seq))) { boost::fusion::for_each(seq, self); }, // Overload for ranges FIT_STATIC_LAMBDA(auto self, const auto& range, REQUIRES(trait<boost::has_range_const_iterator>(range))) { for(const auto& x:range) self(x); }, // Overload for anything else FIT_STATIC_LAMBDA(auto, const auto& x) { std::cout << x << std::endl; } )); The documentation for it can be found here: http://pfultz2.github.io/Fit/doc/html/ Any feedback would be appreciated. Also, I don't know if there would be any interest in incorporating this into boost. Thanks, Paul -- View this message in context: http://boost.2283326.n4.nabble.com/Fit-C-function-utility-library-tp4668629… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 5

[Spirit] Lex context and lexer states
by "Claas H. Köhler" 04 Nov '14

04 Nov '14

Hi! Reading the documentation regarding the context object passed by spirit lex I got a little confused: According to the quick ref for semantic actions, http://www.boost.org/doc/libs/1_57_0/libs/spirit/doc/html/spirit/lex/abstra… the context contains functions std::size_t get_state() const and void set_state(std::size_t state). So I presumed the state to be an object of type size_t. However, according to the reference section on lexer concepts http://www.boost.org/doc/libs/1_57_0/libs/spirit/doc/html/spirit/lex/refere… the Lexer state is specified in string form. So my question is: Do both representations exist (i.e. as string & size_t) and can be mapped to each other ? If so, how? Or do I control the desired type via a template parameter ? Are there any examples in the docs containing different lexer states, which could help me to understand the concept ? Any help would be appreciated. Regards Claas

1 0

Code review for bug no. 5702
by ullas srinivas 04 Nov '14

04 Nov '14

Hi, I have fixed bug no. 5702 Bug # 5702 : Filename isreturned within quotes instead without Description : In the reference (http://www.boost.org/doc/libs/1_47_0/libs/filesystem/v3/doc/reference.html#…) it issaid that for example the filename returned by filename() will be without thequotes: std::cout <<path("/foo/bar.txt").filename(); //outputs "bar.txt" (without the quotes) But actually I'm getting anoutput with the filename enclosed in quotes like: "bar.txt" I'm using Windows Vista. Root Cause : Thefilename within quotes are due to printing of os << delim ; statement in template <class Char, classTraits, class Alloc> std::basic_ostream<Char,Traits>& basic_string_inserter_imp(std::basic_ostream<Char, Traits>&os, std::basic_string<Char, Traits, Alloc> const& string, Char escape, Char delim) of boost\io\detail\quoted_manip.hpp Fix : I have commented/removed os << delim; statementin template <class Char, classTraits, class Alloc> std::basic_ostream<Char,Traits>& basic_string_inserter_imp(std::basic_ostream<Char, Traits>&os, std::basic_string<Char, Traits,Alloc> const & string, Char escape, Chardelim) of boost\io\detail\quoted_manip.hpp I kindly request you to please find the patch file attached and review the bug. Regards Ullas

1 0

[ANN] "The Boost C++ Libraries", 2nd edition available
by Boris Schäling 03 Nov '14

03 Nov '14

Just a quick announcement: The 2nd edition of my book "The Boost C++ Libraries" is available. - It introduces 72 Boost libraries. - It contains more than 430 examples. - The print version has about 570 pages. - There is also a Kindle, Epub and PDF version. - It's even online: <http://theboostcpplibraries.com/> A special "thank you" goes to Niall who handled this year's Google Summer of Code program so smoothly that I as a backup admin didn't need to do anything - and had enough time to work on the book. :) Boris

6 8

Boost 1.57.0 has been released
by Marshall Clow 03 Nov '14

03 Nov '14

Release 1.57.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains no new libraries and numerous enhancements and bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1.57.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.57.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

1 0

[gci2014] Calling for Google Code In 2014 tasks and mentors
by Niall Douglas 03 Nov '14

03 Nov '14

Dear Boost, Google Code In 2014 is nearly upon us, and we need bite sized tasks and mentors! Google Code In lasts between December and mid-January and is for 13 to 17 year olds to get involved with open source projects. Tasks need to be very short, maybe only three hours or so, but correspondingly the effort required to mentor/check these is very low. If you maintain a Boost library and could do with help in fixing up any of those items you keep putting off like replicating bug reports, fixing documentation errors, or configuring Continuous Integration, now is the time! More information is on the GCI ideas page at: https://svn.boost.org/trac/boost/wiki/gci2014 ... where you can add more tasks and also sign yourself up as a mentor. We need this page ready by Saturday 8th November, so please try to get it done before then. Thanks in advance! Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 0

Re: [boost] [ANN] "The Boost C++ Libraries", 2nd edition available
by Brian Wood 01 Nov '14

01 Nov '14

On Fri, 31 Oct 2014 12:14:33 +0100, Thorsten Ottosen <tottosen(a)dezide.com> wrote: > I'm very happy to see a small chapter on ptr_container. > It's good that you compare it with container<unique_ptr<T>>. > It looks like poly_collection is left out: http://bannalia.blogspot.com.es/2014/05/fast-polymorphic-collections.html There was discussion of this container on this list back in August. > Comment 1: I would prefer examples with unique_ptr to use make_unique. > I've compared these two lines: auto req=::std::unique_ptr<cmw_request>(::new cmw_request(localbuf)); auto req=::std::make_unique<cmw_request>(localbuf); On clang 3.3, the make_unique version increases the size of an executable's text segment by 112 bytes. I think I've tried it on a newer compiler and found similar results. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

1 0

[1.57.0] Release candidates available
by Marshall Clow 01 Nov '14

01 Nov '14

[ Please disregard previous message; apparently I am brain-dead this morning. The uploaded files are correct, though. ] Release candidate files for 1.57.0 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (./boost_1_57_0_rc1.7z) = 17c98dd78d6180f553fbefe5a0f57d12 MD5 (./boost_1_57_0_rc1.tar.bz2) = 1be49befbdd9a5ce9def2983ba3e7b76 MD5 (./boost_1_57_0_rc1.tar.gz) = 25f9a8ac28beeb5ab84aa98510305299 MD5 (./boost_1_57_0_rc1.zip) = 5e040e578e3f0ba879da04a1e0cd55ff Thanks! -- The release managers P.S. Release notes are here: http://www.boost.org/users/history/version_1_57_0.html

1 1

Enhancing regression tests summary
by Adam Wulkiewicz 31 Oct '14

31 Oct '14

Hi, Some time ago I was writing about regression summaries enhancements, that I'd be nice to see more meaningful list of errors, etc. I asked questions, even prepared a PR for regression, to no avail. So I developed a simple program downloading summaries, test logs and saving the enhanced result. You may check it out here: https://github.com/awulkiew/summary-enhancer Regards, Adam

5 8

[regression] [develop] OSError: [Errno 2] No such file or directory: any_test.test
by Suckow, Thomas J 31 Oct '14

31 Oct '14

# Running Boost.Build tests Traceback (most recent call last): File "run.py", line 83, in <module> runner(root) File "/Boost_Regression_Develop/tools_regression_src/regression.py", line 264, in __init__ self.main() File "/Boost_Regression_Develop/tools_regression_src/regression.py", line 650, in main getattr(self,action_m)() File "/Boost_Regression_Develop/tools_regression_src/regression.py", line 615, in command_regression self.command_test() File "/Boost_Regression_Develop/tools_regression_src/regression.py", line 394, in command_test self.command_test_boost_build() File “/Boost_Regression_Develop/tools_regression_src/regression.py", line 438, in command_test_boost_build "boost/bin.v2/libs/any/test/any_test.test")); OSError: [Errno 2] No such file or directory: ‘/Boost_Regression_Develop/results/boost/bin.v2/libs/any/test/any_test.test’ Looks like everyone but teeks is failing to build. - Thomas

3 4

[1.56.0] Release candidates available
by Marshall Clow 31 Oct '14

31 Oct '14

Release candidate files for 1.65.0 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (./boost_1_57_0_rc1.7z) = 17c98dd78d6180f553fbefe5a0f57d12 MD5 (./boost_1_57_0_rc1.tar.bz2) = 1be49befbdd9a5ce9def2983ba3e7b76 MD5 (./boost_1_57_0_rc1.tar.gz) = 25f9a8ac28beeb5ab84aa98510305299 MD5 (./boost_1_57_0_rc1.zip) = 5e040e578e3f0ba879da04a1e0cd55ff Thanks! -- The release managers P.S. Release notes are here: http://www.boost.org/users/history/version_1_57_0.html

1 0

[PropertyTree][variant] Reading JSON into a recursive variant.
by Arindam Mukherjee 31 Oct '14

31 Oct '14

I have a recursive variant definition that can handle JSON data. Is there a way to read JSON data using PropertyTree into a recursive JSON? Here is the variant defn. #define BOOST_VARIANT_NO_FULL_RECURSIVE_VARIANT_SUPPORT #include <boost/variant.hpp> JSONNullType {}; boost::variant<std::string, double, bool, JSONNullType> jsonToken; typedef boost::make_recursive_variant< std::string, double, JSONNullType, std::map<std::string, boost::recursive_variant_>, std::vector<boost::recursive_variant_> >::type JSONValue; Regards, Arindam

1 0

Re: [boost] Coming up on 1.57 release date - get your fixes in
by Felix Uhl 30 Oct '14

30 Oct '14

Edward Diener wrote: > Marshall Clow wrote: > > Just this morning we received a report of Boost.PP failing on VS 2013. > > It is not failing. It is just giving a warning. I don’t know for sure, but Marshall may be referring to this ticket: https://svn.boost.org/trac/boost/ticket/10686 On VS2013, VARIADICS and MSVC_VARIADICS don’t get defined despite the fact that they should, rendering some variadic macros useless. Von: Edward Diener Gesendet: ‎Donnerstag‎, ‎30‎. ‎Oktober‎ ‎2014 ‎04‎:‎10 An: boost(a)lists.boost.org On 10/29/2014 10:50 AM, Marshall Clow wrote: > We’ll be closing the master branch tomorrow (Thursday) for the 1.57.0 release. > Changes not in by then will not go into the release. > > Also, what issues in the beta have not been addressed? > >> Visual C++ 14 CTP 4 without BOOST_MSVC_ENABLE_2014_JUN_CTP: all libraries >> built successfully (but some are not usable, mostly because of missing >> noexcept) > >> >> All projects using Boost I tried (Debug 32-bit + 64-bit) compiled >> successfully with MSVC12. For MSVC14, TypeTraits 9de6a49 is missing in >> master. > > I believe that these have been merged. > >> Interprocess is broken for MinGW and there are some issues with Intrusive in GCC. I've committed fixes for both. > > I believe that this has been merged. > > Thread fixes have been merged. > > I do not know if the patches described in http://lists.boost.org/Archives/boost/2014/10/217257.php have been merged. > >> range/detail/any_iterator.hpp is broken because it expects >> postfix_increment_proxy and writable_postfix_increment_proxy to be in >> namespace boost::detail, but they are in boost::iterators::detail now. > > This does NOT appear to have been fixed > >> boost serialization is still broken(said so: http://article.gmane.org/gmane.comp.lib.boost.user/82715 ) and to date i do know no workaround to get my library to work on fx Arch Linux without telling users to rebuild with boost 1.55 (or sending them a saved package from my system…) > > I do not know what the status of this is; but there have been no commits to range/master in October. > > Just this morning we received a report of Boost.PP failing on VS 2013. It is not failing. It is just giving a warning. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

[testing] Compile failures on MSVC (teeks)
by Andrey Semashev 30 Oct '14

30 Oct '14

Hi, I'm seeing weird compilation failures on Teeks (MSVC 10 and 11): http://www.boost.org/development/tests/develop/developer/output/teeks99-08c… http://www.boost.org/development/tests/develop/developer/output/teeks99-08d… The weird part is this: D:\teeks99-08\d\boost_root\boost/fusion/support/detail/result_of.hpp(32) : error C2143: syntax error : missing ',' before '...' I cannot find the boost/fusion/support/detail/result_of.hpp file in git. Am I missing something or these test machines are broken somehow?

2 1

Coming up on 1.57 release date - get your fixes in
by Marshall Clow 30 Oct '14

30 Oct '14

We’ll be closing the master branch tomorrow (Thursday) for the 1.57.0 release. Changes not in by then will not go into the release. Also, what issues in the beta have not been addressed? > Visual C++ 14 CTP 4 without BOOST_MSVC_ENABLE_2014_JUN_CTP: all libraries > built successfully (but some are not usable, mostly because of missing > noexcept) > > All projects using Boost I tried (Debug 32-bit + 64-bit) compiled > successfully with MSVC12. For MSVC14, TypeTraits 9de6a49 is missing in > master. I believe that these have been merged. > Interprocess is broken for MinGW and there are some issues with Intrusive in GCC. I've committed fixes for both. I believe that this has been merged. Thread fixes have been merged. I do not know if the patches described in http://lists.boost.org/Archives/boost/2014/10/217257.php have been merged. > range/detail/any_iterator.hpp is broken because it expects > postfix_increment_proxy and writable_postfix_increment_proxy to be in > namespace boost::detail, but they are in boost::iterators::detail now. This does NOT appear to have been fixed > boost serialization is still broken(said so: http://article.gmane.org/gmane.comp.lib.boost.user/82715 ) and to date i do know no workaround to get my library to work on fx Arch Linux without telling users to rebuild with boost 1.55 (or sending them a saved package from my system…) I do not know what the status of this is; but there have been no commits to range/master in October. Just this morning we received a report of Boost.PP failing on VS 2013. Have I missed any of the beta issues? — Marshall

7 11

[fusion] Broken compilation on MSVC (was: [testing] Compile failures on MSVC (teeks))
by Andrey Semashev 30 Oct '14

30 Oct '14

On Thu, Oct 30, 2014 at 1:28 PM, Andrey Semashev <andrey.semashev(a)gmail.com> wrote: > Hi, > > I'm seeing weird compilation failures on Teeks (MSVC 10 and 11): > > http://www.boost.org/development/tests/develop/developer/output/teeks99-08c… > > http://www.boost.org/development/tests/develop/developer/output/teeks99-08d… > > The weird part is this: > > D:\teeks99-08\d\boost_root\boost/fusion/support/detail/result_of.hpp(32) > : error C2143: syntax error : missing ',' before '...' > > I cannot find the boost/fusion/support/detail/result_of.hpp file in > git. Am I missing something or these test machines are broken somehow? Oh, sorry, I was looking at the master local branch, and it fails on develop. Anyway, the header is there and it is broken for compilers not supporting variadic templates.

1 0

Re: [boost] 1.57.0 beta 1 is now available
by Felix Uhl 30 Oct '14

30 Oct '14

Edward Diener wrote: >John Doré wrote: >> Unfortunately this gives us the warning: >> >> warning C4003: not enough actual parameters for macro 'BOOST_PP_EXPAND_I' > > It is an expected warning from Boost PP, which can be ignored. The VC++ > preprocessor is not a C++ standard conforming preprocessor so it gives > warnings when none are necessary. There is virtually nothing that can be > done against such warnings except to attempt to turn them off completely > within Boost PP code. I will look into doing this but often it is > impossible to do since VC++ often does not honor where the preprocessor > warning actually takes place when an effort is made to eliminate the > warning at that place. Does that mean the regular >#pragma warning(disable : 4003) doesn’t work for pre-processor related warnings?

1 0

1.57.0 beta 1 is now available
by Marshall Clow 30 Oct '14

30 Oct '14

Boost release 1.57.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/boost-binaries/1.57.0.beta.1/ This release contains no new libraries. For details of what's in the release, see http://www.boost.org/users/history/version_1_57_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team P.S. There are a couple of known problems with this beta: * There are problems building with MSVC 8.0 * There are some problems with range/detail/any_iterator.hpp. These will be fixed before the release.

9 10

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 30 Oct '14

30 Oct '14

Artyom Tokmakov wrote: > Have you considered X-macro trick? Yes, and I heavily dislike the syntax. I played around with it a bit and it is absolutely not feasible for this use case. My goal is a simple, intuitive and easy to use syntax. With xmacros you’d have to define an enum in a separate file, Which only makes sense for really, really large enumerations.

1 0

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 29 Oct '14

29 Oct '14

Artyom Tokmakov wrote: >In addition to various useful suggestions on the list, I would ask for >implementation to support (almost) any large number of enum elements >(enumerators) within enum declaration.: >I have ad-hoc implementation of my own which uses Boost.Proprocessor's >sequence to define enum elements. Then I can generate whatever >parser/printer/other code I want (I find that very useful). >There's a disadvantage, however: obvious limitation of max 256 >elements (at least, by default) coming from Boost.Preprocessor. And that’s where the problem lies. To enable large numbers of enum values, I’d have to find a solution without using Boost.PP. Without C++ introducing argument number based macro overloading, that is not possible, short of defining my own macro sequences for more than 256 elements, which I would like to avoid. I am still thankful that you asked for this, because it uncovered a huge implementation problem which induces enormous compilation overhead (1 minute for 48 enum values on my laptop). I will do my best to make the library comprehend large enums, but I can’t guarantee anything larger than 256. --- Felix Uhl

2 1

Is there interest in a library for string-convertible enums?
by Felix Uhl 29 Oct '14

29 Oct '14

So far, the only way to convert an enumeration value to a string is a lot of boilerplate code consisting of switch case statements for every single possible value of the enum. I’ve written a small header-only library that uses Boost.Preprocessor and templates to ease the definition of named enumerations that are convertible to and from strings. Those can also be used with the std::cin and std::cout streams naturally, while maintaining all syntactic and semantic properties, regarding initialisation, assignment, type safety and conversion to underlying types. Currently, I am documenting the first version of the library to make it available on the Boost Library Incubator website, but I wanted to get some initial feedback from the developers mailing list, too. I would be glad to extend the library to a general extension of enumeration behaviour, like changing the generation of underlying values from a continuous increment to a continuous shift left by one, effectively making the underlying values binary flags. What features would you want from such a library? Is there even a chance that such a library would get included in boost (given that it satisfied the quality requirements), or is there too little interest in this functionality?

8 7

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 29 Oct '14

29 Oct '14

Pieter wrote: > Are you aware of the earlier effort by Frank Laub? Frankly (no pun intended), I am not. It would be interesting to see how he has implemented that and what caveats his implementation has. --- Felix

1 0

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 29 Oct '14

29 Oct '14

Jeffrey Bush wrote: > I have also offered a class for doing this as well, although it didn't draw > the interest that this one did. > Here was my attempt at it with a test/example class: > https://gist.github.com/coderforlife/6d8bac451d49dd1a0c81 Looks good to me, and seems to be quite close to what I aim at. But the definition seems very user unfriendly. Is it correct that you always have to declare enums in the public namespace? --- Felix

1 0

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 29 Oct '14

29 Oct '14

Rob Stewart wrote: > You should not add features because someone on this list asked for them. > If you're not convinced of the utility of something, push back > to understand the request better. This sounds like advice I should follow. I tend to forget that I’m not writing for a specific client. Also, I noticed that the library has too much compile time overhead already, which should be fixed before introducing any additional ground-breaking features. So I’ve gone through the features suggested and ordered them by priority, perhaps the requesters of the following ones could answer my questions about them and specify why they think these features would be a good addition to the library: By Damien Buhl: - Adaptation of enums after declaration with something like BOOST_ADAPT_ENUM Is this really worth the effort? If somebody knows they want to string-convert an enum (or enum class), why would they not define it as one in the first place? Or is this about enumerations that are already defined by other libraries? Would it be ok to instead define a new enum that has the “to adapted” one as its underlying type and can thus be converted to and from it? There are implementational problems with offering both namespace independent definition of those enums and adaptability. By Gavin Lambert: - Specify custom and multiple strings In which use cases would this actually be beneficial for anyone? Could those use cases be solved by using custom char_traits or even custom string classes? - Specify different conversion tables for use in different contexts What do you exactly mean by that? Conversion to different string values? Conversion by different algorithms? Again, if you could answer those questions, it would really help evaluation. --- Felix

1 0

[gsoc] Any interest in Google Code In?
by Niall Douglas 29 Oct '14

29 Oct '14

The application period for Google Code In 2015 has opened. This is a "tiny GSoC" programme for high school students where the tasks set might take the student three to five hours each. Stuff like writing documentation, improving unit testing, duplicating bug reports, making YouTube video tutorials, blogging about or writing an essay about getting a Boost development setup ready, even refactoring small segments of code if the student is up to it. The important part is the shortness of work item, and of course that you review it and give constructive feedback. More detail is at https://developers.google.com/open-source/gci/. Some example tasks from last year are at https://developers.google.com/open-source/gci/resources/example-tasks. Is there any interest from the Boost community in mentoring such high school student work? If so, now is the time to say. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

2 2

Re: [boost] Is there interest in a library for string-convertible enums?
by Artyom Tokmakov 29 Oct '14

29 Oct '14

> What features would you want from such a library? Hello, thanks for the proposal, it's very useful! In addition to various useful suggestions on the list, I would ask for implementation to support (almost) any large number of enum elements (enumerators) within enum declaration.: I have ad-hoc implementation of my own which uses Boost.Proprocessor's sequence to define enum elements. Then I can generate whatever parser/printer/other code I want (I find that very useful). There's a disadvantage, however: obvious limitation of max 256 elements (at least, by default) coming from Boost.Preprocessor. In fact, I hit some other limitations even before that. One of them was max 'if else' statements (I used them in parser implementation. Don't judge me, it was good enough!). When I fixed that, my VC compiler started complaining about some macro processor limitations around 220 enum elements (don't have details handy). Speed of parsing/printing implementation doesn't matter for me. PS: This is my first post in this DL, sorry if I broke some rules. -- Best regards, Artem Tokmakov

1 0

Re: [boost] Is there interest in a library for string-convertible enums?
by Jeffrey Bush 29 Oct '14

29 Oct '14

> > So far, the only way to convert an enumeration value to a string is a lot > of boilerplate code consisting of switch case statements for every single > possible value of the enum. > > > I?ve written a small header-only library that uses Boost.Preprocessor and > templates to ease the definition of named enumerations that are convertible > to and from strings. Those can also be used with the std::cin and std::cout > streams naturally, while maintaining all syntactic and semantic properties, > regarding initialisation, assignment, type safety and conversion to > underlying types. > > > Currently, I am documenting the first version of the library to make it > available on the Boost Library Incubator website, but I wanted to get some > initial feedback from the developers mailing list, too. I would be glad to > extend the library to a general extension of enumeration behaviour, like > changing the generation of underlying values from a continuous increment to > a continuous shift left by one, effectively making the underlying values > binary flags. > > > What features would you want from such a library? Is there even a chance > that such a library would get included in boost (given that it satisfied > the quality requirements), or is there too little interest in this > functionality? > I have also offered a class for doing this as well, although it didn't draw the interest that this one did. Here was my attempt at it with a test/example class: https://gist.github.com/coderforlife/6d8bac451d49dd1a0c81 Supports value to string and string to value, including multiple values with | between them, meaning all combinations can be round-tripped. Supports default power-of-two values and custom values, listing all valid values (as enum types, but each is easily convertible to integral and string values), Although you cannot specify custom string names for an enum value that is not the "STRINGIZE" name, however you can choose to have multiple enum entries with the same value and different names. Jeff

1 0

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 28 Oct '14

28 Oct '14

Marcel Raad wrote: >being able to specify the underlying >type, not being implicitly convertible >to any other type, and being able to >forward-declare them. Apart from forward-declaration, that’s what I’ve implemented. I want to stay as close to the stock enum class as possible. Forward declaration is added to the feature list :) --- Felix Uhl

1 0

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 28 Oct '14

28 Oct '14

On 28/10/2014, Rob Stewart wrote: >That sounds interesting. Ease of use and compilation overhead are concerns, of course. I’ll answer your ease of use concern with example code for definition of the enum class Zott: >BOOST_ADVANCED_ENUM_DEFINE( Zott, > zero, > one, > two, > three >); And now for the mentioned “flag” values: >BOOST_ADVANCED_ENUM_DEFINE_W_SUPPLY( > TwoToThePowerOf, > ::boost::advanced_enum::supplies:shiftL1::values, > zero, > one, > two, > three >); Seems easy enough. The second one could be shortened to another macro, of course. Arbitrary values have a bit strange syntax, though: >BOOST_ADVANCED_ENUM_DEFINE_W_SUPPLY( > BOOST_ADCANCED_ENUM_ARBITRARY(4, 8, 6, 20), > four, > eight, > six, > twenty >); I’ll see what I can do about that. Conversions to and from string are done via static_cast (not sure if that’s the ideal solution), in- and output work naturally like this: >Zott myZott = Zott:one; >std::cin >> myZott; //if input is not convertible, no changes are made >std::cout << myZott; I think that's as easy as it can get :) Compilation overhead indeed needs to be considered. >What about enum classes? My mistake, with “named enums” I meant “enum classes”, but now that you say it, I should try to implement string convertible regular enums as well. Thank you for your feedback! --- Felix Uhl Von: Rob Stewart Gesendet: ‎Dienstag‎, ‎28‎. ‎Oktober‎ ‎2014 ‎22‎:‎23 An: boost(a)lists.boost.org On October 28, 2014 7:09:35 AM EDT, Felix Uhl <felix.uhl(a)outlook.de> wrote: >So far, the only way to convert an enumeration value to a string is a >lot of boilerplate code consisting of switch case statements for every >single possible value of the enum. As Niall noted, most of us have done that before. >I’ve written a small header-only library that uses Boost.Preprocessor >and templates to ease the definition of named enumerations that are >convertible to and from strings. That sounds interesting. Ease of use and compilation overhead are concerns, of course. >Currently, I am documenting the first version of the library to make it >available on the Boost Library Incubator website, I can hear Robert yelling, "Yes!" > but I wanted to get >some initial feedback from the developers mailing list, too. I would be >glad to extend the library to a general extension of enumeration >behaviour, like changing the generation of underlying values from a >continuous increment to a continuous shift left by one, effectively >making the underlying values binary flags. That would certainly be useful. What about enum classes? ___ Rob (Sent from my portable computation engine) _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [boost] Is there interest in a library for string-convertible enums?
by Felix Uhl 28 Oct '14

28 Oct '14

On 08/10/2014, Damien Buhl wrote: >What I would like to is to have a complete adapted enum for >Boost.Fusion, this was implemented at some point in some old version of >Boost.Fusion but I cannot find it anymore. Yes, interoperability with other boost libraries is a huge point to consider, and I like the concepts of Boost.Fusion a lot. I also thought about MPL, getting the names as compile time strings could be really useful. >And before all it's important I believe that it doesn't ask the user to >write the enums with macros, but that an additional call later to >something like BOOST_ADAPT_ENUM adds the boilerplate code. >It's naturally possible to offer both choice to the user like >BOOST_FUSION_ADAPT_STRUCT / BOOST_FUSION_DEFINE_STRUCT. I don’t think it is possible to offer an ADAPT_STRUCT macro without forcing the client to either rewrite every single value of the enumeration or define the enum with another macro in the first place. The former would could become problematic when clients change what values the enum actually contains but forget to change that in the macro. I would really want to enable the most natural syntax possible, but even a flexible language like C++ has boundaries where you can’t bend it anymore. So yes, I will offer both to the user. Thanks for your feedback! Felix Uhl Von: Damien Buhl Gesendet: ‎Dienstag‎, ‎28‎. ‎Oktober‎ ‎2014 ‎22‎:‎47 An: boost(a)lists.boost.org Hi Felix, Personally I'm interested, because so far I've been always using a silly macro for this, which doesn't make much : > #ifndef SWISSARMYKNIFE_ENUMS_ADAPT_ENUM_HPP > #define SWISSARMYKNIFE_ENUMS_ADAPT_ENUM_HPP > > #include <string> > #include <ostream> > #include <boost/preprocessor/cat.hpp> > #include <boost/preprocessor/stringize.hpp> > #include <boost/preprocessor/seq/for_each.hpp> > > > #define SWISSARMYKNIFE_ADAPT_ENUM_EACH_ENUMERATION_ENTRY_C( \ > R, unused, ENUMERATION_ENTRY) \ > case ENUMERATION_ENTRY: \ > return BOOST_PP_STRINGIZE(ENUMERATION_ENTRY); \ > break; > > #define SWISSARMYKNIFE_ADAPT_ENUM(ENUM_TYPE, ENUMERATION_SEQ) \ > inline std::string to_string(const ENUM_TYPE& enum_value) { \ > switch (enum_value) { \ > BOOST_PP_SEQ_FOR_EACH( \ > SWISSARMYKNIFE_ADAPT_ENUM_EACH_ENUMERATION_ENTRY_C, \ > unused, ENUMERATION_SEQ) \ > default: \ > return BOOST_PP_STRINGIZE(ENUM_TYPE); \ > } \ > } \ > \ > inline std::ostream& operator<<(std::ostream& os, const ENUM_TYPE& value) { \ > os << to_string(value); \ > return os; \ > } > > #endif What I would like to is to have a complete adapted enum for Boost.Fusion, this was implemented at some point in some old version of Boost.Fusion but I cannot find it anymore. Because if this had the extension struct_member_name or some other better named extension, then I could print out all the possible states with some generic code like I print struct member name with "boost::fusion::for_each_member(enumValue, *this);" > #ifndef BOOST_FUSION_FOR_EACH_MEMBER_HPP > #define BOOST_FUSION_FOR_EACH_MEMBER_HPP > > #include <functional> > > #include <boost/fusion/include/adapt_struct.hpp> > > #include <boost/fusion/sequence/intrinsic/begin.hpp> > #include <boost/fusion/sequence/intrinsic/end.hpp> > #include <boost/fusion/sequence/intrinsic/front.hpp> > #include <boost/fusion/iterator/equal_to.hpp> > #include <boost/fusion/iterator/next.hpp> > #include <boost/fusion/iterator/deref.hpp> > #include <boost/fusion/iterator/distance.hpp> > #include <boost/fusion/support/category_of.hpp> > #include <boost/mpl/bool.hpp> > > namespace boost { namespace fusion { > > namespace detail { > > template <typename First, typename Last, typename F> > inline void > for_each_member_linear(First const& first, > Last const& last, > F const& f, > boost::mpl::true_) {} > > template <typename First, typename Last, typename F> > inline void > for_each_member_linear(First const& first, > Last const& last, > F const& f, > boost::mpl::false_) { > > f( > extension::struct_member_name< > typename First::seq_type, First::index::value > >::call(), > *first > ); > > for_each_member_linear( > next(first), > last, > f, > result_of::equal_to< typename result_of::next<First>::type, Last>() > ); > } > > template <typename Sequence, typename F> > inline void > for_each_member(Sequence& seq, F const& f) { > > detail::for_each_member_linear( > fusion::begin(seq), > fusion::end(seq), > f, > result_of::equal_to< > typename result_of::begin<Sequence>::type, > typename result_of::end<Sequence>::type>() > ); > } > > } > > template <typename Sequence, typename F> > inline void > for_each_member(Sequence& seq, F f) { > detail::for_each_member(seq, f); > } > > }} > > #endif And before all it's important I believe that it doesn't ask the user to write the enums with macros, but that an additional call later to something like BOOST_ADAPT_ENUM adds the boilerplate code. It's naturally possible to offer both choice to the user like BOOST_FUSION_ADAPT_STRUCT / BOOST_FUSION_DEFINE_STRUCT. Cheers, -- Damien Buhl On 10/28/2014 12:09 PM, Felix Uhl wrote: > So far, the only way to convert an enumeration value to a string is a lot of boilerplate code consisting of switch case statements for every single possible value of the enum. > > > Iâ€™ve written a small header-only library that uses Boost.Preprocessor and templates to ease the definition of named enumerations that are convertible to and from strings. Those can also be used with the std::cin and std::cout streams naturally, while maintaining all syntactic and semantic properties, regarding initialisation, assignment, type safety and conversion to underlying types. > > > Currently, I am documenting the first version of the library to make it available on the Boost Library Incubator website, but I wanted to get some initial feedback from the developers mailing list, too. I would be glad to extend the library to a general extension of enumeration behaviour, like changing the generation of underlying values from a continuous increment to a continuous shift left by one, effectively making the underlying values binary flags. > > > What features would you want from such a library? Is there even a chance that such a library would get included in boost (given that it satisfied the quality requirements), or is there too little interest in this functionality? > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

[Lockfree] has_trivial_destructor and has_trivial_assign restrictions
by Dan Dillon 28 Oct '14

28 Oct '14

I've been doing some thinking about this, and to my untrained eye these restrictions do not seem to be a requirement of the lock-free structure. That is to say, they need not be atomic anyhow, so why does it matter if they are trivial or not? The question goes to making the data structures more globally useful. The more structures they can be used with, the better they are (at least in my opinion). Thanks, Dan

2 1

Custom logging backend difficulty
by Kenneth Adam Miller 28 Oct '14

28 Oct '14

So, I need malleable logging facilities, and so far I've identified boost's logging facilities as useful. I've read the docs on logging, and right now I'm having difficulty achieving what I want-basically, I have a custom backend, in order that when logging is done, it gets routed to an alternative destination - over the network namely. I extended from text_ostream_backend, and basically I'm having the following trouble: I don't understand the record_view visitation API. I'd like the ability to set formatters and what not to remain untouched, but have the final formatted result sent off else where. I can change this by sending the string received in the consume function that has to be overrode, but the values are lost in the record_view. void consume (const record_view & rec, std::string s); where I do { send(s); } for the body. What I think is necessary is just to retain the default behavior of accepting whatever formatter was specified... What is the best way to go about achieving what I want?

3 8

1.57.0 beta 1 is in a new location
by Marshall Clow 27 Oct '14

27 Oct '14

Tom Kent pointed out that I put the beta 1 files in a folder that we traditionally use for Windows binaries, so I have moved the beta files to https://sourceforge.net/projects/boost/files/boost/1.57.0.beta.1/ These are the same files as last Monday - merely in a new location. If you have already downloaded and tested the beta, thanks! - no need to do it again. — Marshall

1 0

Re: [boost] Non-allocating constexpr functional continuations-based future-promise
by Bjorn Reese 26 Oct '14

26 Oct '14

On 10/23/2014 11:00 PM, Niall Douglas wrote: > Given Hartmut's feedback from my previous attempt at a non-allocating > future-promise implementation, I now have a second, much more generic > demonstration prototype which is based on heterogenous sequences of > constexpr functional calls. I think this design may have huge potential. This is a very nice evolution of your previous promise-future framework. > template<class T> struct then_continuation > { > std::vector<std::function<void(T)>> _conts; > template<class U> auto then(U &&c) > { > typedef decltype(c(std::declval<T>())) result_type; > promise<result_type> p; > future<result_type> ret(p.get_future()); > // Unfortunately libstdc++'s std::function currently always tries to > copy lambda types > //_conts.emplace_back([p=std::move(p), c=std::forward<U>(c)](T > v){p.set_value(c(v));}); > _conts.push_back([p = > std::make_shared<promise<result_type>>(std::move(p)), > c=std::forward<U>(c)](T v){p->set_value(c(v));}); > return ret; > } > BOOST_CONSTEXPR T operator()(T v) const > { > for(auto &i : _conts) > i(v); > return v; > } > }; > > All this continuation does is provide a .then(callable) which stores those > callables into a std::vector and its operator() executes the previously > stored callables. Previously you defined callables as composed functions, but here you execute them sequentially. That is, then(f1).then(f2) gets executed as f1(v),f2(v) instead of f2(f1(v)). Or am I missing something?

2 1

[boost.lockfree] spsc_queue preallocated memory block
by Philip Bennefall 25 Oct '14

25 Oct '14

Hi all, I have a feature request for Boost.lockfree (spsc_queue in particular). When using the runtime sized version, could there possibly be a constructor that takes max_size as well as a T* that is then used as the memory buffer? This would remove the need for a specialized allocator if I want to quickly initialize the buffer with memory that does not come from the default std allocator. Kind regards, Philip Bennefall

2 2

Re: [boost] Applying Boost Phoenix to infinite sequence
by Aaron Levy 25 Oct '14

25 Oct '14

25.10.2014, 00:54, "Aaron Levy" <aaron.levy(a)yandex.com>: > Is there a way to use Boost Phoenix to define an infinite sequence and evaluate specific terms of it, compute partial sums, etc? I am looking for pointers to specific libraries or examples. > Indeed, what would are some examples of common programming problems that can be succinctly solved using Phoenix? Aaron.

2 1

Why is iterator_traits<unordered_map<K, M>>::pointer a detail::ptr_node type rather than value_type *?
by Alex Mohr 24 Oct '14

24 Oct '14

The iterator type looks like: template <typename NodePointer, typename Value> struct iterator : public boost::iterator< std::forward_iterator_tag, Value, std::ptrdiff_t, NodePointer, Value&> The NodePointer argument here (which is boost::unordered::detail::ptr_node<...>) becomes the iterator_traits<>::pointer type. But iterator's operator->() returns Value *: Value* operator->() const { return &node_->value(); } Why shouldn't iterator_traits<>::pointer be Value* here? This detail::ptr_node<> type seems intended to be completely internal. Thanks, Alex

3 2

Non-allocating constexpr functional continuations-based future-promise
by Niall Douglas 23 Oct '14

23 Oct '14

Dear Boost, Given Hartmut's feedback from my previous attempt at a non-allocating future-promise implementation, I now have a second, much more generic demonstration prototype which is based on heterogenous sequences of constexpr functional calls. I think this design may have huge potential. Consider some heterogenous sequence of callables C { f1, f2, f3, f4, ... } such that fN(... f4(f3(f2(f1(Args...))))) -> R i.e. if you call the heterogenous sequence with arguments Args..., f1(args...) will be called and fed to f2() which then is fed to f3() up to fN() whose return type is R. If I understand proposed Boost.Hana correctly, these potentially constexpr sequences of heterogeneous callables are the main bridge between pure compile-time heterogeneous type sequences and doing something with them in real code as they can decay on demand into actual code when needed. And for proposed Boost.Expected, its monadic programming sequences bind(), map() and then() all functionally operate on some expected<T, E>, consuming an instance and returning new instances, so these monadic sequences are also potentially constexpr sequences of heterogenous callables. Now, what new basic_future-basic_promise will do is to allow you to insert a suspend-resume of execution into some functional sequence C, so essentially: split<idx>(C) => [ basic_promise<X>, basic_future<Y> ] ... where X is some split front part of C and Y is some back part of C. You can now execute the first part of C via the call operator: basic_promise<X>(Args...) Execution of the C0...Cn making up X occurs, but instead of continuing into Y it stores the result of Cn and makes that available to the corresponding basic_future. At some later point you can resume the execution of C: basic_future<Y>() -> R ... and thus complete the execution of the functional sequence C, returning the same value R as invoking the original functional sequence C with the same input parameters. For those who prefer to understand theory via code, here is some example C++ 14 code: // Let this be an arbitrarily long sequence of functional callables auto ct=make_continuations([](auto x){return 5+x;}, [](auto x){ return x+6;}); { // Make a future promise pair for if we called c(int) auto fp=ct.suspend_resume<1, int>(); // Execute promise fp.first(1); // Execute future b=std::move(fp.second)(); } { // Make a future promise pair for if we called c(double) auto fp=ct.suspend_resume<1, double>(); // Execute promise fp.first(1.0); // Execute future d=std::move(fp.second)(); } // b=12, d=12.0 There are a multitude of uses for this very fundamental pattern. Let us try implementing something closely resembling the Concurrency TS's dynamic continuations support .then(launch, callable). Let us define this functional continuation: template<class T> struct then_continuation { std::vector<std::function<void(T)>> _conts; template<class U> auto then(U &&c) { typedef decltype(c(std::declval<T>())) result_type; promise<result_type> p; future<result_type> ret(p.get_future()); // Unfortunately libstdc++'s std::function currently always tries to copy lambda types //_conts.emplace_back([p=std::move(p), c=std::forward<U>(c)](T v){p.set_value(c(v));}); _conts.push_back([p = std::make_shared<promise<result_type>>(std::move(p)), c=std::forward<U>(c)](T v){p->set_value(c(v));}); return ret; } BOOST_CONSTEXPR T operator()(T v) const { for(auto &i : _conts) i(v); return v; } }; All this continuation does is provide a .then(callable) which stores those callables into a std::vector and its operator() executes the previously stored callables. Now let us define a std::promise lookalike, with its main deficiencies being a total lack of exception_ptr support (one would use expected<T, E> as the transport type for that) and of course any thread safety: template<class T> class promise : public basic_promise<detail::then_continuation<T>, T, detail::then_continuation<T>> ... basic_promise takes three template parameters, the type of the front split of the continuations, the transported type between the two halves of continuations, and the type of the back split of the continuations. Here, we are defining promise as transporting a type T, and two then_continuation continuations exist before and after the transport of the type T. To our future<T> lookalike we now add this: template<class U> auto then(launch policy, U &&c) { if(policy==launch::deferred) return Base::_after.then(std::forward<U>(c)); else if(Base::_other) return Base::_other->_before.then(std::forward<U>(c)); } So, if the .then() dynamic continuation is deferred, push it into the latter then_continuation, else push it into the former. And voila, you can now do this very similar to Concurrency TS code: promise<int> p; future<int> f(p.get_future()); future<double> f2(f.then(launch(), [](int a){return a+1.0;})); p.set_value(5); return f2.get(); And you get back 6.0, as expected. However here is where things get neato. How many instructions do you think GCC 4.9 generates for this sequence? promise<int> p; future<int> f(p.get_future()); p.set_value(5); return f.get(); In traditional future-promise, that is an operation perhaps consuming thousands of CPU cycles and at least one memory allocation and deallocation. Well, this is the assembler produced by the above by GCC 4.9: _Z19test_futurepromise4v: movq $0, -88(%rsp) movq $0, -80(%rsp) movl $5, %eax movq $0, -72(%rsp) movq $0, -48(%rsp) movq $0, -40(%rsp) movq $0, -32(%rsp) movl $5, -56(%rsp) movq $0, -64(%rsp) movq $0, -24(%rsp) ret Believe it or not, this is actually bad output - there is a bug in GCC's optimiser and it should in fact be outputting a single instruction rather than writing zeros into the stack for no purpose - it seems to get confused by the double declation of a std::vector which is never used, because having just one std::vector produces the ideal output but having two produces the above. However clang 3.4's optimiser does far worse, and a bug there with how non-immediately defined types are treated causes complete expansion of code in its entirety, even if you remove all std::vector's (supplying any type not immediately declared in the same function breaks the optimiser for some unknown reason. I haven't tried clang 3.5 yet, it may be fixed). Other very interesting policy continuations which can be statically mixed into custom future promise types include calling some application specific callback without needing to indirect via a pointer to a function. This lets you combine future promise with invoking callbacks, useful for legacy code. The idea behind this suite of future-promise fundamental parts is that they can be mixed at will into bespoke future-ish promise-ish application specific future promise types. Because they all share the same foundations, a when_any() or when_all() can accept heterogenous future types - and I don't mean future<int> with future<double>, rather I mean afio::future<> with qt::future<int>, that sort of heterogenity. Another very interesting idea is combining these with signals and slots, so via custom continuations you can keep slots and fire signals in sync with future promises. This design I think shows a lot of potential. Anyway, I feel very happy with this design, and something along these lines is where I shall proceed next. The eventual intention is for these future promises to become the default Boost.Thread future promises when C++11 is available, though this will be up to a year from now. I won't be able to support future-promise custom allocators, but I certainly should be able to completely avoid memory allocation and sometimes the generation of any code at all with this design. The demonstration prototype code is at https://github.com/ned14/boost.spinlock/blob/expected_future/test_constexpr_ future_promise2.cpp for anyone interested. It needs a C++ 14 compiler, so a minimum of libstdc++ 4.9 and either GCC 4.9 or clang 3.4 or better. Comments are welcome. Niall

1 0

Non-allocating constexpr functional continuations-based future-promise
by Niall Douglas 23 Oct '14

23 Oct '14

>

1 0

DTLS support in boost
by Indtiny S 22 Oct '14

22 Oct '14

Hi, Currently I am using boost for one of my cpp application ... now my application needs DTLS security support ... I currently have written using openssl APIs .. I want nowb...does boost asio has any APIs for DTLS handshake ? Rgds Indhra

1 0

[thread] linux.hpp, BOOST_HAS_PTHREAD_YIELD, BOOST_HAS_SCHED_YIELD
by Rob Conde 22 Oct '14

22 Oct '14

Reposting this here since I got no response on "users" but this list seems more appropriate: Using boost 1.55, Ubuntu 12.04, gcc 4.6 I'm building boost on linux using the lsb sdk (4.1.8) . I was getting the failure (paraphrased): pthread_yield not declared in libs/thread/src/thread.cpp 513 The documentation for pthread_yield (http://man7.org/linux/man-pages/man3/pthread_yield.3.html) says: This call is nonstandard, but present on several other systems. Use the standardized sched_yield(2)<http://man7.org/linux/man-pages/man2/sched_yield.2.html> instead. If I change boost/config/platform/linux.hpp to define BOOST_HAS_SCHED_YIELD instead of BOOST_HAS_PTHREAD_YIELD Then sched_yield is used instead and the build finishes properly. I'm posting this for two reasons: 1. To help others running into the same issue 2. To question whether linux.hpp should be updated officially as I did above 3. If not, why Thanks, Rob Conde

2 3

Help with boost spirit
by Theodore Papadopoulo 22 Oct '14

22 Oct '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Sorry, this is probably a beginner question, but I'm stuck on it for quite some time. I'm trying to write a small string like parser in which the size of the string is first given. Some thing like: int_ >> repeat(_1)[ char_ ] But I cannot figure out the right way of doing this. The natural: const bool result = boost::spirit::qi::parse(it,str.end(),int_ >> repeat(_1)[ char_ ]); fails to compile (and I tried many variations of val, etc) with no success. If I replace _1 by 10, everything works fine. Another question is that of the associated attribute. From the documentation, I would have expected it to be: typedef std::pair<int,std::vector<unsigned char>> Attribute; but that does not work. I have managed to work around this using a second rule, using an attribute std::vector<char>(int) but then again I do not know how to pass the parameter. 10 works but _1 does not. Any help will be appreciated. Some test code is attached, compile with: g++ -g -std=c++11 -dboost_spirit_use_phoenix_v3 Test.C. Variants are in comment. Thank's in advance for any help. Theo. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1 iEYEARECAAYFAlQ9GqgACgkQEr8WrU8nPV0b2gCeNFzQXwm1Uux4Eua2+jq8LcZk DW0AoKBKY9KN5kGxYoPbnxwncwFSyH3M =L0bR -----END PGP SIGNATURE-----

2 2

[1.57.0] Release Notes
by Daniel James 22 Oct '14

22 Oct '14

Hi, Sorry this is late, but if you haven't written your release notes, you should do so soon. You can create a pull request on github by clicking on the pencil icon on the toolbar on this page while logged in: https://github.com/boostorg/website/blob/master/feed/history/boost_1_57_0.q… Or if you prefer you can email me, and I'll add it for you. thanks, Daniel

3 2

Non-allocating future-promise
by Niall Douglas 21 Oct '14

21 Oct '14

Dear Boost, I have been working on non-allocating future-promise which when combined with proposed expected<T, E> (i.e. basic_promise<expected<T, E>>) will provide a close substitute to std::future/promise, except that it doesn't use an allocator and can reduce to pure constexpr when possible e.g. this code: __attribute__((noinline)) int test1() { promise<int> p; auto f(p.get_future()); p.set_value(5); return f.get(); } ... reduces to exactly: _Z5test1v: # @_Z5test1v .cfi_startproc # BB#0: # %_ZN7promiseIiJEED2Ev.exit2 movl $5, %eax ret The non-allocating future-promise is intended to be compatible with the Concurrency TS extensions (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4123.html) where futures can have continuations scheduled against them via a future.then(callable). However, this involves an unavoidable memory allocation, which while fine for dynamically assigned continuations is overkill for statically assigned continuations. There is no reason why one could not also have a method of statically adding continuations which uses type extension to store the additions. Let us say we have a template<class T, class... Continuations> class promise and that this promise also provides a .then(callable) like this: template<class F> promise<T, Continuations..., F> then(F &&c) { return promise<T, Continuations..., F>(std::move(*this), std::forward<F>(c)); } ... and therefore to statically add continuations to the future promise, one simply iterates .then(callable) on the promise like this: auto p=promise<int>().then([]).then([]) ...; auto f=p.get_future(); p.set_value(5); // executes all the continuations My first question to the Boost community is this: is there some less ugly way? I'm thinking maybe the promise's constructor could take a set of continuations, and then a make_promise(callable, callable, ...) could construct a statically continued future-promise? My second question to the Boost community is this: should static continuations be able to see the value being set? Or indeed, to modify it before it gets sent to future.get()? My thanks in advance. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

3 6

The master branch is now open for merging
by Marshall Clow 20 Oct '14

20 Oct '14

Please limit to changes that have been implemented in develop and whose tests have cycled. We will be closing the master branch again sometime next week (for the final release two weeks from today). The following problems were noted with the RC (and, I believe, have fixes ready): * Interprocess is broken for MinGW * Visual C++ 14 CTP 4 without BOOST_MSVC_ENABLE_2014_JUN_CTP * For MSVC14, TypeTraits 9de6a49 is missing in master * Thread fixes from Vicente Still needed to do: * Can someone take a look at http://lists.boost.org/Archives/boost/2014/10/217257.php, please? * MSVC 8.0 compilation failures * range/detail/any_iterator.hpp is broken because it expects postfix_increment_proxy and writable_postfix_increment_proxy to be in namespace boost::detail, but they are in boost::iterators::detail now. * There’s a few old Random fixes that need to be looked at. (and anything else we find) Thanks to everyone who tried out the RC, and please encourage people to try the beta! — Marshall

1 0

Re: [boost] [Boost-users] 1.57.0 beta 1 release candidates available for testing
by Marshall Clow 20 Oct '14

20 Oct '14

On Oct 20, 2014, at 7:06 AM, Marcel Raad <raad(a)teamviewer.com> wrote: > Marshall Clow <mclow.lists <at> gmail.com> writes: > >> Release candidate files for 1.57.0 beta 1 are available [...] >> As always, the release managers would appreciate it if you download the >> candidate of your choice and give building it a try. Please report both >> success and failure, and anything else that is noteworthy. > > range/detail/any_iterator.hpp is broken because it expects > postfix_increment_proxy and writable_postfix_increment_proxy to be in > namespace boost::detail, but they are in boost::iterators::detail now. > > Those errors are also visible in all of the type_erased_* regression tests > of range. I made an executive decision to push the beta out with this problem (and the MSVC 8.0 bugs, too), because I wanted to get a wider audience looking at the beta. Thanks for reporting this, and now let’s fix them. — Marshall

1 0

[intrusive] More features for treap?
by Phil Endecott 20 Oct '14

20 Oct '14

Dear All, I've been looking at Boost.Intrusive's treap, and finding that it doesn't quite do what I need. Here's an example: say I have data about earthquakes in the form (date, magnitude, description). I can store that in a treap with date as the key and magnitude as the priority. Now I'd like to be able to do operations like: - Find the strongest earthquake between dates A and B. - Iterate over all the earthquakes with magnitude > X in date order. - For each year (or month, or decade etc) find the strongest quake. The first two are straightforward in a treap, but the current Boost.Intrusive API doesn't (AFAICT) let me do it. (The third one is less obvious.) I have been wondering how the API could most easily be extended to support this sort of thing, and I'm coming to the conclusion that it is probably best to expose the actual tree structure so that the algorithms for these operations can be implemented explicitly by the user code. I have had similar thoughts in the past about other trees i.e. augmented trees to implement interval trees; the choice is either (a) implement these things inside Boost.Intrusive; (b) don't use Boost.Intrusive at all; (c) extend the intrusive API to expose the actual tree structure. In cases like these extensions to treap, the new operations are simple compared to the complexities of inserting and erasing elements; being able to use the existing implementations of those operations while adding other (non-mutating?) features would save a lot of work. Any thoughts anyone? (Is anyone else using treap?) Regards, Phil.

2 3

[random] Any news?
by Marco Guazzone 20 Oct '14

20 Oct '14

Hello, Do you have any news on lib mainteners? I and other have pull requests But all seems muted.

4 4

Re: [boost] [Boost-users] 1.57.0 beta 1 release candidates available for testing
by Marshall Clow 20 Oct '14

20 Oct '14

On Oct 20, 2014, at 3:52 AM, John Maddock <boost.regex(a)virgin.net> wrote: >>> For Boost.Config: >>> >>> a mostly minor update. >> >> Great, thanks! According to the feature table, auto return types >> (BOOST_NO_CXX14_RETURN_TYPE_DEDUCTION) are also supported. > > Confirmed - it passes our test case anyway, feature enabled. > >>> For TypeTraits: >>> >>> I suspect you're not going to like the latter as it basically disables >>> working versions of is_nothrow* for msvc-14. The reason is that is >>> appears that Boost.Log ends up using noexcept(non_compiling_expression) >>> which requires SFINAE expression support. >> >> I also think it's the best solution. You can also delete >> the "!::boost::is_const<T>::value" with it now. > > Done. > > Marshall - is it OK to merge these fixes after the beta is out? Absolutely. — Marshall

1 0

1.57.0 beta 1 release candidates available for testing
by Marshall Clow 20 Oct '14

20 Oct '14

Release candidate files for 1.57.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost_1_57_0_b1_rc1.7z) = 8633fbf5ebb7eaabcb0f309c14646ae3 MD5 (boost_1_57_0_b1_rc1.tar.bz2) = 8e76f98146793f0fbd2492a9151c405b MD5 (boost_1_57_0_b1_rc1.tar.gz) = d41ff3ffb36ac84ff5bf34f799308907 MD5 (boost_1_57_0_b1_rc1.zip) = 8a844dc36284247b2e936f2120e118b2 Thanks! -- The release managers

4 4

Re: [boost] [Boost-users] 1.57.0 beta 1 release candidates available for testing
by Marshall Clow 20 Oct '14

20 Oct '14

On Oct 19, 2014, at 2:22 PM, Vicente J. Botet Escriba <vicente.botet(a)wanadoo.fr> wrote: > Le 18/10/14 00:40, Marshall Clow a écrit : >> Release candidate files for 1.57.0 beta 1 are available at >> http://boost.cowic.de/rc/ >> >> > Hi, could I merge the following to the master branch? > > https://github.com/boostorg/thread/commit/3e28ea806c412c697f134fdaacbccc9b6… > https://github.com/boostorg/thread/commit/1029fa9c5937269c9a65848972da7d8bb… > https://github.com/boostorg/thread/commit/63dd439992cbc6d62f0af442f4669121e… > > > This fixes "deferred/ready futures on variadic when_all/when_any.” Vicente — I’d appreciate if you would merge those *after* we release the beta. There will be about a week where the master branch will be open again. — Marshall (who would like to get the beta out to a wide audience sooner, rather than later)

1 0

Performance characteristics of Boost mutex
by Philip Bennefall 18 Oct '14

18 Oct '14

Hi all, I am detecting some lock contention in my application, and while reading up on this I came across the concept of lightweight mutexes versus supposedly non-lightweight mutexes. I am wondering, can Boosts non-recursive mutex implementation be considered lightweight? In boost/detail I see lightweight_mutex. Should I be using that? I need no interprocess support here, and I want the lock to be as fast as possible. If I do decide to use lightweight_mutex, is it compatible with the regular non-recursive Boost mutex so that I can use it with higher level classes like lock guard, condition variables, barriers etc? Thanks in advance for any insight. Kind regards, Philip Bennefall

3 4

Re: [boost] [asio] RFC on new reliable UDP library
by Niall Douglas 17 Oct '14

17 Oct '14

On 17 Oct 2014 at 10:54, Juan Carlos Franzoy wrote: > > A long term dream of mine is for ASIO to become the standard event > > dispatch loop for all C++ programs, so other libraries simply hook > > into ASIO's dispatch and everything interoperates cleanly without > > lots of hassle and brittle boilerplate. I also feel a grievance > > against every single library firing up their own thread pools or > > worker threads when ASIO gives you that for free. > > We tried to use ASIO as an event dispatch, but it failed to scale in > multicore machines. Currently we are experimenting using one io_service > per core and manually managing the load balance migrating sockets between > io_services. If this is on Linux, then yes I have found this too. ASIO uses std::mutex as its lock, and the spin count on pthread_mutex in glibc is too short for modern CPUs. My proposed concurrent_unordered_map, which can do safe concurrent erase, would solve the need for ASIO needing a central mutex on Linux. > Maybe ASIO has to manage only io (only io threads) and has to delegate > to an external thread pool the execution of user handlers. Although I > don't know if it is technically possible. ASIO's present design is suboptimal in many regards. It's one of my biggest qualms in the present design being standardised as-is. I may, six months from now, be able to say in considerable detail what exactly to change if things pan out. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 0

Ticketspam
by Daniel Frey 17 Oct '14

17 Oct '14

One more to remove: <https://svn.boost.org/trac/boost/ticket/10560> Thanks, Daniel

10 18

NT² eand Boost.SIMD release 3.1
by Joel FALCOU 17 Oct '14

17 Oct '14

NT2 is a Matlab inspired, high-level API for scientific computation in C++. Boost.SIMD is a candidate library for inclusion in Boost dealing with the portable encpsulation of SIMD instructions sets. This following releases updates NT2 and Boost.SIMD libraries to version 3.1 This new release of NT2 and Boost.SIMD focused on fixing performance issues and add some new support for architecture and parallel algorithms. The main new features include: - Linear Algebra functions can now use GPGPU through the MAGMA library whenever possible. - Reduction and Scan operations now works with more shared memory back-end - Altivec support is now complete for the VMX ISA We wish to thanks Ian Masliah for his work on MAGMA, Antoine Tran Tan for the shared memory support and Pierre Esterie participation to the Altivec ISA completion. Special thanks to Tim Blenchmann and khegeman for their help and patch submisisons throughout this development. The release Changelog is here : https://github.com/MetaScale/nt2/releases/tag/3.1.0 The files can be download from : http://nt2.metascale.org/downloads/ The Documentation (in progress) is here : http://nt2.metascale.org/doc/html/index.html **Next release announcment** This release is the last C++03 compliant version of both NT2 and Boost.SIMD. The next release - 4.0 - will be C++11 only. The new minimal version of supported compilers will be : - g++ 4.6 - Microsoft Visual Studio 12 (2013) - clang 3.4 - icc 12.1 The main reason for this change is to be able to properly fix the compile-time issue that one may experience. It'll also allow us to use some C++11 feature to simplify or streamline some of the user interface. * The NT2 Team

5 7

Is there something like shared_array<T> but with iterators?
by david.hagood＠gmail.com 15 Oct '14

15 Oct '14

I am doing signal processing, and in order to avoid data copies I need something that: 1) can adopt a buffer of data (e.g. take ownership of a T*) 2) Release that buffer via an appropriate method (e.g. take a deallocator object). 3) Provide operator[] over that buffer 4) provide shared ownership semantics So far, that's shared_array<> to a T [sic] However, I need one more thing: 5) provide iterator support (begin(), end(), cbegin(), cend()) The current shared_array<> doesn't provide that - is there anything else that does?

3 2

[interprocess] BOOST_INTERPROCESS_SHARED_DIR_PATH from env variable
by Jakub Szymanski 11 Oct '14

11 Oct '14

Hi, Will it be possible to have shared_dir not hardcoded? Currently it is determine by some tricks (some involve event log parsing on windows, which fails a lot). The only practical solution for us was to use BOOST_INTERPROCESS_SHARED_DIR_PATH define. boost/interprocess/detail/shared_dir_helpers.hpp inline void get_shared_dir(std::string &shared_dir) { #if defined(BOOST_INTERPROCESS_SHARED_DIR_PATH) shared_dir = BOOST_INTERPROCESS_SHARED_DIR_PATH; #else get_shared_dir_root(shared_dir); #if defined(BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME) shared_dir += "/"; get_bootstamp(shared_dir, true); #endif #endif } That has limitations tough as it makes it very difficult to test software in isolation (it requires access to the same folder). Similarly it makes is difficult to run program of machines with different file structure. Can it be configurable by some environment variable ? cheers --jakub

2 3

[Modularization] master and develop on super project.
by Kohei Takahashi 10 Oct '14

10 Oct '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi all, Is there any policies for merging develop into master and sending pull-request on super project (boost.git)? Before 1.56.0 release, each libraries merged develop into master, though boost.git didn't. It caused to remain some defects in master (also release archive), which are already fixed in develop branch. e.g. - - https://svn.boost.org/trac/boost/ticket/5677 - -- https://svn.boost.org/trac/boost/ticket/6946 (dup of #5677) - - https://svn.boost.org/trac/boost/ticket/10507 and more tickets might exist... The wiki[1] describes about each libraries, but about super project is still absent. [1] https://svn.boost.org/trac/boost/wiki/StartModWorkflow Thanks, Kohei Takahashi -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQIcBAEBAgAGBQJUN8IGAAoJEGGyPxPRp/zoW3QP/RBWJ7dcmS8TEr7SpQW97QW4 17chTXKLkqHboHxCJuswXb1rlnmBxxooFItA5kFudEu7U1x5OekPfw+oroQP7v+C CgS5eHanitjprkijvJO2SS61a/YdF/1hMJuHUWzd62hI5ZXWQvNryeJtNl0K0hFb H9EhniJltvBxjOOdvjUsd9XCPby1afi5jOCUjC3J08X6WruRuI5BhCNElVQOSxMG yzaxuLeFDy8L9CICAU8RNEkBEjY1n5rYAVnbETX1WSSoDGEHblRUTOT7JQwSuWWx 0ymdz5cHisM+QoGuLUI0BQS9mayik3vAsre68Ve/xxTHU3LaRRVvaLJIH0YrRRwX fQmyJVGtIbUIhgfmdK8mq050wNOwdzefVfGDkq/XNo+wwlwA6vS4D5gqzfthNL6S HdXI8TIJtdRUYk66vFVcL5uf3PjoW4cZpWYceq1h1EOsIfXuzpr6uO0NDhqEFD+D I3vSmGPV1eAPYpQHP7jeOePMn1EPItU0sVqLk0f6ymafyqnaPU52zhcS45VMS85Q krk+ixO5bND6IU0EgYDn7QZHrTdACDcH5UGscBmxrSUwJ4DrgB6q8mAG/Ek0lZBK /UyXOu3k+ZtrYQIu5aayIyANp6p/EKGNgT7F7/4t0WZzxleskEPzKX9XKoPJnjQ9 aZrV3aXQSRrlEeBhU4fk =KrkS -----END PGP SIGNATURE-----

1 0

[config] Need some clang testing help...
by John Maddock 09 Oct '14

09 Oct '14

Folks there are persistent bug reports relating to clang with libstdc++ not correctly detecting the std lib feature set, see https://svn.boost.org/trac/boost/ticket/7473 for a lengthy discussion on the issue, and why it's been unsolvable. Anyhow, I've just committed a tentative patch in https://github.com/boostorg/config/commit/b36566fe04a89103b7ef5569c03e3a26e… and I'd be grateful if as many folks as possible can test this with their clang/linux/libstdc++/C++11 setups as they can. It works well for me locally, but that's only one possible clang configuration. BTW the easiest way to patch your Boost version is probably to download a replacement libstdcpp2.hpp from here: https://raw.githubusercontent.com/boostorg/config/b36566fe04a89103b7ef5569c… Many thanks in advance, John.

3 8

[range] How does remove_erase() work?
by Stephan T. Lavavej 08 Oct '14

08 Oct '14

Hi, I'm updating my Uniform Container Erasure proposal [1], and I was informed that Boost.Range has a similar-ish remove_erase(). I have a very simple question about its implementation, so I can describe it accurately in my revised proposal, but I don't really want to look at erase.hpp's guts. Does remove_erase() just use the erase-remove idiom, or does it contain special cases for the vector-like family, list-like family, and map-like family? (As N4009 explained, the erase-remove idiom is suboptimal for list, and won't compile for forward_list and the map-like family.) Thanks, STL [1] http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4009.htm

3 4

It's that time again already - Boost 1.57.0 schedule
by Marshall Clow 08 Oct '14

08 Oct '14

It’s that time again. Here’s the schedule for the upcoming 1.57 release. If you’ve got changes that you’ve been putting off making, now’s the time to get busy. * 13-Oct Last day for significant changes * 20-Oct Beta build * 27-Oct Automatic merging turned off, build an RC * 3-Nov Release Boost 1.57.0 Questions? Ask them here. — The Boost release managers. P.S. We’ll be updating the calendar on boost.org/development soon.

5 5

Update on status of C++ 11 only Boost fork/modular distro
by Niall Douglas 08 Oct '14

08 Oct '14

Dear all, You may remember me saying these past six months that I was working on the tools necessary to fork Boost into a C++ 11 only distro which also lets you use Boost libraries individually standalone without the rest of Boost. I have got a first alpha version of my clang AST based local bindings generator working, and you can see it at https://github.com/ned14/local-bind-cpp-library. This tool lets you generate a set of local namespace bindings for some implementation of some library such that your library implementation code need not care what the underlying implementation of dependent library facilities is. This way your Boost library could be using either Boost or the C++ 11 STL and you don't need to care (most of the time). Now I have the first alpha version working and generating a reasonable set of C++ 11 STL bindings (https://github.com/ned14/local-bind-cpp-library/tree/master/include/s tl11), I'll start with porting over my own Boost libraries to it, so Spinlock, Expected, non-allocating future-promise and AFIO will be the first, and with those AFIO should become capable of being completely standalone from Boost whilst still also able to compile against Boost. After that I'll try porting the entire of Boost.Thread over such that Boost.Thread no longer needs Boost. I think that would be hugely useful for people wanting to use potential C++ 17 threading functionality without needing to draw in all of Boost as a dependency, and that might greatly widen the empirical experience new threading facilities might get before the 17 standard. Once I've succeeded with that, if the present situation with Boost has not improved by then, I'll press ahead with a new Boost distro website which score ranks Boost modules according to the scoring manifest I outlined on this list some months ago, and lets you download standalone Boost distros of your choice. Obviously only libraries ported to be standalone capable would be available, so I would hope that if I can demonstrate an easy port with Boost.Thread, others may follow with their libraries. All this work occurs in my free time of a few hours per week, so progress will be slow but steady. Comments on the local namespace binding tool are welcome. Comments on the proposed C++11/14 good practice idiom of binding dependent library APIs into the local namespace are also welcome, because as far as I can tell no one here has discussed a formal set of conventions to make best use of inline namespaces for new libraries. I'll put it another way - local namespace binds are a poor man's version of Herb's proposed C++ ABI facility. As much as they aren't quite as good, they are probably good enough (relative to Herb's most recent proposal). Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

3 7

Fusion and constexpr, C++11 support entirely broken on develop
by Mathias Gaunard 07 Oct '14

07 Oct '14

Hi folks, I recently decided to move all of my code to C++11, and I usually use the develop version of each library so that I can have the latest developments and can easily contribute. However, Fusion appears to be fundamentally broken on develop whenever C++11 is enabled with GCC. It works fine with C++03. I don't think this is a situation that should ever happen; while develop is for libraries undergoing development, it shouldn't be totally broken either. In particular, the problem is that it uses BOOST_CONSTEXPR in contexts where C++11-constexpr is invalid, but where it is valid in C++14. Should there be a separate BOOST_CONSTEXPR14 macro?

3 3

[EXTERNAL] Tickets notifications
by Adam Wulkiewicz 07 Oct '14

07 Oct '14

Hi, AFAIU the notifications about new tickets and updates are sent only to the owner of the library. This is inconvenient since many libraries are developed by a group of people, e.g. Geometry. I'm aware that anyone can get updates if he's on the Cc list but people which are curious about development aren't added to this list automatically. Ideally it would be great if any user could subscribe to get notifications for any library like it's possible on GitHub. Or maybe moving to GitHub mentioned by John in one of the other threads would be the best solution? Anyway, is it somehow possible to receive notifications as a non-owner automatically? If the answer was no, would sending notifications to the library mailing list be a reasonable solution? AFAIU this could be done by adding a "fake" owner with a mailing list email. Regards, Adam

2 1

Submodules of Boost libraries
by Mathias Gaunard 07 Oct '14

07 Oct '14

Hi folks, I'd like to ready my library for inclusion into Boost. My library is made of several modules, and I'd like to keep that into Boost. How does Boost handles multiple submodules within a library submodule?

7 11

[modularization] LocalFunction and ScopedExit cycle
by Vicente J. Botet Escriba 06 Oct '14

06 Oct '14

2 3

[move] Macro for initializing base classes in move ctors.
by Mostafa 04 Oct '14

04 Oct '14

Initializing base classes in move constructors involves some boiler-plate code. Is there a reason why a macro is not provided for it? Something like: #define BOOST_MOVE_INITBASEMOVECTOR(baseclassname, rhs) \ baseclassname(::boost::move(static_cast<baseclassname &>(rhs)))

2 3

[mpl] struct definition and mpl sequence in one shot?
by Adam Romanek 03 Oct '14

03 Oct '14

Hi! This is a re-post from the boost-users mailing list. I have a problem and I'm not sure how to approach it. Currently my code looks like this: struct Definition { typedef boost::mpl::int_<5> A; typedef boost::mpl::int_<3> B; typedef boost::mpl::int_<6> C; typedef boost::mpl::int_<1> D; typedef boost::mpl::vector<A, B, C, D> Seq; }; Here, the number N in mpl::int_< N > denotes some arbitrary decimal number. Then some other code calculates the sum of these numbers up to the type defined by "key", e.g. for Definition::D, the sum is 5 + 3 + 6 (A + B + C). This needs to be done at compile-time. That's why I use mpl::vector and some appropriate meta-programming. I'm wondering whether it would be possible to provide such struct definition without the need to repeat type names in the mpl::vector for Seq type. In other words, I'd probably need a bunch of macros which would allow me to write code like this: struct Definition { FIELD(A, 5); FIELD(B, 3); FIELD(C, 6); FIELD(D, 1); GEN_SEQ() // if needed }; And then Definition::A would still refer to boost::mpl::int_<5>, or would at least allow me to access the boost::mpl::int_<5> somehow, and Definition::Seq would give me the appropriate MPL sequence. Of couse this is just my imagination. The code might look different, I'm just looking for options. Thanks in advance. Adam Romanek

1 0

[Boost] [DateTime] dividing a time_period in N time_periods
by Pablo Madoery 02 Oct '14

02 Oct '14

Hi, I want to make a method which divides a time_period in N time periods, something like this: list<time_period> splitTimePeriod(time_period timePeriod, int n); I actually have made it and although it seems to work it results very inefficient regarding the time it took to divide a large time_period. The method I did is this: list<time_period> splitTimePeriod(time_period timePeriod, int n) { double secsTime = dateTime::diffSeconds(timePeriod.end(), timePeriod.begin()); // tiempo en segundos de cada período de tiempo double ti = secsTime / n; list<time_period> timePeriods; // tiempo de comienzo del primer período de tiempo ptime tpBegin = timePeriod.begin(); // tiempo de fin del último período de tiempo ptime tpLastEnd = timePeriod.end(); for (int i = 0; i < n; i++) { int tUnits = ti * time_duration::ticks_per_second(); // tiempo de comienzo del siguiente período de tiempo ptime tpNextBegin = dateTime::increment(tpBegin, tUnits); // tiempo de fin del período de tiempo ptime tpEnd; if (i == n - 1) { tpEnd = tpLastEnd; } else { tpEnd = dateTime::decrement(tpNextBegin, 1); // guarda para evitar que por cuestiones // de redondeo, el tiempo final de un período // sea mayor que el pasado inicialmente // como argumento de entrada if (tpEnd > tpLastEnd) { tpEnd = tpLastEnd; } } time_period p(tpBegin, tpEnd); // se inserta período de tiempo en la lista timePeriods.push_back(p); // se actualiza el comienzo del siguiente período de tiempo tpBegin = tpNextBegin; } return timePeriods; } Other methods I use are these: double diffSeconds(const ptime &dateA, const ptime &dateB) { time_duration diff = dateA - dateB; return diff.total_seconds(); } ptime increment(const ptime &date, int n) { time_iterator it(date, dateTime::unit); for (int i = 0; i < n; i++) { ++it; } return *it; } ptime decrement(const ptime &date, int n) { time_iterator it(date, dateTime::unit); for (int i = 0; i < n; i++) { --it; } return *it; } const time_duration unit = microseconds(1); ################################################# The question is: is there a better way to accomplish this?

1 0

[static_if] Is there interest in a `static if` emulation library?
by Lorenzo Caminiti 01 Oct '14

01 Oct '14

Hello all, With C++14 generic lambdas, it is possible to implement a sort of `static if` (see also N3613): template< typename T > void assign ( T& x, T const& y ) { x = y; static_if<boost::has_equal_to<T>::value>( std::bind([] ( auto x, auto y ) { assert(x == y); std::cout << "asserted for: " << typeid(T).name() << std::endl; }, x, y) ).else_( [] ( ) { std::cout << "cannot assert for: " << typeid(T).name() << std::endl; } ); } The bind around the generic lambda is a bit verbose... but this code compiles, asserts when called on int, and does not assert when called on x_t (tested on clang 3.4.2): int i = 1; struct x_t { } x; assign(i, i); // asserts assign(x, x); // does not assert I have attached a reference implementation. Thank you. --Lorenzo P.S. I didn't do much background research... sorry if this topic has already been considered and discussed in Boost.

17 43

[uuid] Issue 9407: help required to merge fix
by Antony Polukhin 01 Oct '14

01 Oct '14

There is an issue with long history https://svn.boost.org/trac/boost/ticket/9407 That issue is annoying and can be easily fixed. There's even a pull request to fix that issue (https://github.com/boostorg/uuid/pull/2) Could someone take a look at the pull request, comment it and even merge to develop branch? -- Best regards, Antony Polukhin

1 0

Licensing issue (TestCmd.py)
by Polhodzik Peter (ext) 01 Oct '14

01 Oct '14

Hi all, Could anyone tell me, why the \boost_1_38_0\tools\build\v2\test\TestCmd.py (TestCmd version 0.02) file in Boost 1.38.0<http://www.boost.org/users/history/version_1_38_0.html> has Steven Knight's Python license reference, this: # Copyright 2000 Steven Knight # This module is free software, and you may redistribute it and/or modify # it under the same terms as Python itself, so long as this copyright message # and disclaimer are retained in their original form. # # IN NO EVENT SHALL THE AUTHOR BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, # SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OF # THIS CODE, EVEN IF THE AUTHOR HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH # DAMAGE. # # THE AUTHOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A # PARTICULAR PURPOSE. THE CODE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, # AND THERE IS NO OBLIGATION WHATSOEVER TO PROVIDE MAINTENANCE, # SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. __author__ = "Steven Knight <knight(a)baldmt.com<mailto:knight@baldmt.com>>" __revision__ = "TestCmd.py 0.D002 2001/08/31 14:56:12 software" __version__ = "0.02" while the original TestCmd 0.02<http://baldmt.com/Test-Cmd/Archive/Test-Cmd-0.02.tar.gz> is Perl licensed, this way: COPYRIGHT Copyright 1999-2000 Steven Knight. All rights reserved. This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself. ? It is also unclear which Python or Perl license it refers to ,since there are more licenses versions for both. I know 1.38.0 is an old release, but now I definitely need to have the information about this one. Updating to 1.56.0 is NOT an option to solve the problem this time. Thank you!! Üdvözlettel / Best Regards, Péter POLHODZIK OSS Expert [cid:image001.jpg@01CFDD70.90958F30] Phone: +36 (46) 5-17894 Fax: +36 (46) 5-17801 Peter.Polhodzik.ext(a)evosoft.com<mailto:Peter.Polhodzik.ext@evosoft.com> evosoft Hungary Kft. Arany János tér 1. H-3508 Miskolc www.evosoft.com<http://www.evosoft.com/> ---------------------------------------------------

2 1

[move] Build failures in develop
by Andrey Semashev 01 Oct '14

01 Oct '14

Hi, I'm seeing lots of build errors that originate from Boost.Move, such as: In file included from ../libs/log/src/text_file_backend.cpp:41: In file included from ../boost/filesystem/path.hpp:28: In file included from ../boost/iterator/iterator_facade.hpp:12: In file included from ../boost/iterator/interoperable.hpp:11: In file included from ../boost/mpl/or.hpp:23: ../boost/mpl/aux_/nested_type_wknd.hpp:27:10: error: no type named 'type' in 'boost::move_detail::is_rv<boost::rv<boost::log::v2_mt_posix::aux::light_function<void ()> > >' : T::type ~~~^~~~ See the full error logs: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… http://www.boost.org/development/tests/develop/developer/output/teeks99-08b… http://www.boost.org/development/tests/develop/developer/output/teeks99-tes… I didn't change Boost.Log for quite some time, so there seems to have been some breaking change. Could this be fixed?

3 7

[thread] Build failures in develop
by Andrey Semashev 01 Oct '14

01 Oct '14

Hi, Boost.Thread currently fails to build on MSVC, which affects other libraries: http://www.boost.org/development/tests/develop/developer/output/teeks99-08d… Could it be fixed?

4 6

[modularization] request for a new modularization status for develop branch
by Vicente J. Botet Escriba 01 Oct '14

01 Oct '14

Hi Peter, could you upload a new modularization status, as in http://www.pdimov.com/tmp/report-d53f656/module-levels.html ? Best, Vicente

4 7

[Modularization][optional][functional] boost::none - what do we want it to be?
by Andrzej Krzemienski 30 Sep '14

30 Sep '14

Hi Everyone, I know it may be premature to to think about removing every cycle in Boost, but while looking at the cycle reports I found that at least one library is using boost::none, for a purpose different than indicating an uninitialized boost::optional. It is in Boost.Functional: https://github.com/boostorg/functional/blob/master/include/boost/functional… It uses none_t as a default type for a template type parameter Allocator. My question is: what do we want boost::none_t to indicate, at least in Boost? 1. A value-semantic alternative to void, that anyone can use? 2. A tag indicating boost::optional<T> without a value? The answer to this question dictates how we should untie the cycle. I know it is too soon to care about small cycles right now, but my question is more about "the principles". Regards, &rzej

2 2

"Easy Build and Install" fails at bootstrap.sh
by Josh Juran 30 Sep '14

30 Sep '14

I'm building Boost from Git since there's no secured download option, only HTTP. josh@alice:~/src/boost$ git log --oneline -n1 43bb782 Update thread from master. josh@alice:~/src/boost$ ./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 josh@alice:~/src/boost$ cat bootstrap.log ./bootstrap.sh: 218: cd: can't cd to ./tools/build/src/engine Do I need to run git-submodule? It would be helpful if Getting Started covered this. Josh

4 3

[iostreams]Bugs in dual seekable mode
by Jorge Lodos 29 Sep '14

29 Sep '14

Currently there are no tests for dual seekable streams. New tests (dual_seekable_test.cpp in the ticket) uncover the following bugs: 1. The functions test_seekable_in_chars and test_seekable_in_chunks in test/detail/verification.hpp use seekp in several places where seekg should be used. This has no effect when there is a single head but does not work when the stream is dual seekable. 2. indirect_streambuf::seek_impl does not work for dual seeking. The problem is that both heads are modified for both input and output operations. Since the modification is the same (just resetting the pointers) everything works when there is a single head. This is a duplicate of https://svn.boost.org/trac/boost/ticket/7681. 3. The function shared_buffer() does not consider dual_seekable stream buffers as shared. 4. The function init_put_area() does not consider the existing input position. This is a duplicate of https://svn.boost.org/trac/boost/ticket/8572. With the attached (in the ticket) versions of verification.hpp and indirect_streambuf.hpp all previously existing tests passed. I recommend adding the new tests in dual_seekable_test.cpp. I have created the ticket https://svn.boost.org/trac/boost/ticket/10561 Best regards Jorge

1 0

[thread] Specific old move semantics usage
by Vicente J. Botet Escriba 27 Sep '14

27 Sep '14

Hi all, I would like to remove the specific move semantics included in Boost.Thread as it was flawed. This has been replaced by the Boost.Move one long time ago. Is there someone still using it? Could I at least define by the default (even for BOOST_THREAD_VERSION 2) BOOST_THREAD_USES_MOVE for Boost 1.57? Best, Vicente

2 1

[Modularization] Range and Spirit dependencies
by Stephen Kelly 27 Sep '14

27 Sep '14

Hello, Boost 1.55 has been out for some weeks. I repeat my recommendation to remove the Boost.Algorithm dependency from Boost.Range and the Boost.Serialization dependency from Boost.Spirit. http://thread.gmane.org/gmane.comp.lib.boost.devel/251966/focus=252090 http://thread.gmane.org/gmane.comp.lib.boost.devel/251966/focus=251968 http://thread.gmane.org/gmane.comp.lib.boost.devel/252250/focus=252293 Thanks, Steve.

3 7

questions regarding dependency reports(s)
by Robert Ramey 27 Sep '14

27 Sep '14

I've been looking at the question of "dependencies" and I would like to know a little more about how they are generated. I've looked at: a) http://www.pdimov.com/tmp/report-6d1f271/serialization.html b) http://www.steveire.com/boost/2014sept16_serialization.png c) bcp documentation And it doesn't seem that they all produce the same list of dependencies. a) doesn't include any *.cpp files. So I assume that it contains less than the true number of dependencies. That is if a *.cpp file includes a header as part of it's implementation and not it's interface, it wouldn't be included. b) produces a very intimidating graph. I'm not sure what the rules are for it's generation. I'm guessing that it uses dependencies at the library level rather than the *.cpp level which might make things look worse than they are. c) BCP seems pretty exhaustive in that it cans all the code in all the *.cpp libraries, tests, examples etc. For lots of applications - e.g. if I wanted to include a boost library with my application but not all the tests, It would generate a likely much larger subset than I need. But maybe not. If my application includes the boost library.dll then I guess I have to include it all. This raises an interesting question to me. Suppose I want to distribute my app with source and I include a CMake which just doesn't build the libraries but just includes the relevant *.cpp files in the application build itself? This would make my application depend upon the smallest subset of boost possible. What would it take to make a version of BCP which, given an arbitrary group of source files, returns a list of headers and *.cpp files which could be used to build the app? We know from an intuitive basis that we want to give the option of delivering a smaller boost, but we've always thought that that means delivering a library subset. Is this really what we want? What would users do with the smaller subset? (Besides complain that its not small enough?) How about if we tweaked BCP to deliver just a subset of files relevant to the target? Would that make them happier? Would it get us off the hook for trying to "solve" what the dependencies are? Just thinking out loud here. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/questions-regarding-dependency-reports-s… Sent from the Boost - Dev mailing list archive at Nabble.com.

7 8

Re: [boost] Stefanus Du Toit
by Hartmut Kaiser 26 Sep '14

26 Sep '14

http://emlakdanismanlari.com/izvusl/xqwkkozimojmnoisxjsllmsfkjpoaiycejluiocg

1 0

New C++14 config macros - opinions wanted
by John Maddock 25 Sep '14

25 Sep '14

There is a pull request to add new config macros for C++14 features (https://github.com/boostorg/config/pull/39) I have a few questions really, particularly for those more familiar with C++14 than me: * Do we need these? * Are these the correct names? * Are the proposed tests correct? Thanks, John.

8 9

TravisCI and Coverall usage policies in Boost
by Antony Polukhin 25 Sep '14

25 Sep '14

Hi, Motivation. I'd like to show some useful stuff using the Boost.Variant library as an example. Take a look at this link: https://coveralls.io/builds/1224886 It shows tests coverage and has a nice interface to get info about untested things. For example: * if we take a look at this https://coveralls.io/files/293662719 , we'll see that `polymorphic_get` was not tested for extracting type that is not in a variant variable * if we take a look at this https://coveralls.io/files/293662720 we'll see that swapping of recursive wrappers was not tested All that stuff was achieved by adding the https://github.com/apolukhin/variant/blob/travisci/.travis.yml file and turning a switch at coveralls.io site. Now let's take a look at the regression tests of variant: http://www.boost.org/development/tests/master/developer/variant.html . There we can see a indirect_travisci_tests tester. There's nothing special about that tester, except the fact that results are gathered using foreign TravisCI service. We can integrate foreign service to do regression reporting for us. We can even make this separately for each of the Boost libraries, triggering test run on every commit and reporting the results directly to README.md file (for example https://github.com/apolukhin/Boost.DLL#test-results) The problem. A few things make me nervous. First of all, TravisCI requires some access permissions to the repo. I'm not a github expert so I'm not 100% sure that this is safe. Second one, is that there is no policy in Boost about usage of foreign services like TravisCI and Coveralls. The questions. Is is OK to commit to Boost repos .travis.yml files without enabling TravisCI runs? Do we need a license note in .travis.yml file? Can we enable automated testing using TravisCI for a Boost repo? Can we enable automated tests coverage using Coverall for a Boost repo? -- Best regards, Antony Polukhin

5 9

[modularization] Extract xml_archive from serialization
by Stephen Kelly 25 Sep '14

25 Sep '14

Hi there, The biggest single problem of coupling in boost comes from the spirit dependency in the serialization library. This makes serialization itself very (and needlessly) heavy: http://www.steveire.com/boost/2014sept16_serialization.png Spirit is used only by the xml archiving classes. I recommend extracting an xml_archive library from serialization. That way, serialization no longer depends on spirit, which is already an improvement: http://www.steveire.com/boost/2014sept16_serialization-after-extract-xml_ar… Further, the serialization classes for boost::variant and boost::array are in the serialization library. This is not appropriate, as the serialization classes for all other types are in the libraries providing the types. Move the serialization classes to those libraries. mkdir ../variant/include/boost/serialization mv include/boost/serialization/variant.hpp ../variant/include/boost/serialization mkdir ../array/include/boost/serialization mv include/boost/serialization/array.hpp ../array/include/boost/serialization This is a large improvement: http://www.steveire.com/boost/2014sept16_serialization-after-type-move.png There is more that can be done. These things can be done now. I recommend doing them. Thanks, Steve.

8 23

[modularization] Are modular releases a goal or a non-goal?
by Stephen Kelly 25 Sep '14

25 Sep '14

Hello, I can download one monolithic tarball to get Boost 1.56: http://sourceforge.net/projects/boost/files/boost/1.56.0 And I get all of it. There are no separate 'modular Boost' tarballs so that I can download what I want and not what I don't. Compare to Qt which provides both monolithic source tarballs: http://download.qt-project.org/official_releases/qt/5.3/5.3.2/single/ and modular source tarballs: http://download.qt-project.org/official_releases/qt/5.3/5.3.2/submodules/ Is something similar to this a goal or a non-goal for 'Boost modularization'? Thanks, Steve.

10 32

[intrusive] Possible bug in bstree_algorithms.hpp
by Lars Hagström 25 Sep '14

25 Sep '14

Hi, I've just upgraded to boost 1.56 and I've run into a problem. I get an infinite loop inside insert_equal_lower_bound_check(...) in bstree_algorithms.hpp. I'm using that file indirectly through Boost.Interprocess. I've not been able to penetrate exactly what that function does or whether there is indeed a bug in it. But I did look at the version that was in 1.55 (called insert_equal_check_impl(...) there), and to me it looks like there is at least one unexpected change: A ! has been removed on the line where the branches are compared, which to me would mean that we put the wrong branch into x. Again, I don't really understand what is going on in that function, so I might well be completely wrong. Cheers Lars

2 22

[containers] Clarifications on incomplete type support?
by Mikael Persson 24 Sep '14

24 Sep '14

Hi all, I've been using Boost.Containers for some time now. As for many, the primary (and only) reason for using them (over STL ones) is that they support incomplete value types. Since the beginning, I have always assumed that support for incomplete value types meant that I could instantiate the container type and any indirect type, most notably, **iterators**. I cannot stress enough how important it is for data structure designs to be able to instantiate the iterators of containers of incomplete value types! And, in general, there is no inherent reason why, in general, incomplete type support could not extend to iterators as well. This is even more true in light of the SCARY iterator requirements (which boost containers purport to support, which cannot possibly be true given the compilation errors I have seen). So, my main question is this: Is the following code supposed to work when using Boost.Containers? boost::container::some_container<IncompleteType>::iterator it; The documentation only states that "all Boost.Containers containers [..] are designed to support incomplete types". This needs to be clarified when it comes to iterators, at least. If the above code is not guaranteed to work, then may I request that it be added to the requirements? Because in my view, not having iterator support for incomplete types sort of defeats the whole purpose of supporting incomplete types, except for the most trivial use-cases (like those "recursive containers" examples). And moreover, without this support, workarounds are so major that they won't benefit from the container's support for incomplete types any more (and therefore, might as well use the standard ones instead). >From experience, I know that most Boost.Container containers had working iterators for incomplete value types up to and including version 1.54 (and it's a kind of natural consequence of supporting incomplete types for the container itself). But recently, changes to the boost::container::list class have made it impossible to use of boost::container::list iterators for incomplete types (due to some convoluted new iterator scheme that I can barely understand myself). If iterators are supposed to be included in the incomplete type support, then this is a bug in the list container (and btw, boost::unordered_set also has the same problem), and I would also recommend adding this to the container unit-tests. Thanks, Mikael Persson

2 9

[modularization] What is a module? What is a sub-module?
by Vicente J. Botet Escriba 24 Sep '14

24 Sep '14

Hi all, After the long threads concerning the modularization it seems clear to me that we are in an impasse. While I guess breaking dependency cycles is a modularization goal for all of us, it seems that moving files from one module to a sub-module has not be well accepted, worst yet, could have some dramatic consequences (a lot of testers were broken with the MPL split) due to the way we build Boost. I'm wondering if we don't need an alternative definition of module/sub-module. This definition could be temporary, it would just be useful to identify the modules/sub-modules that would be the good ones. We could move the files when needed by some user oriented tools (install). Let me try it. A module or submodule is just a list of files. The first problem is how to identify this list. Currently, the boostdep tool request that a module is associated to the files in the directory include of a repository and a sub-module to the files in the directory include in a subdirectory of a repository. I don't remember which criteria Stephen Kelly is using in his tool. I propose to switch to a less restrictive and more explicit mapping that don't implies any change on how Boost is build/tested. The advantage is that we can change this mapping without any trouble on the regressions tests :) * If a repository don't have this explicit mapping, the module with the same name as the repository is composed of the files in the directory include, src and build of the repository. There could be other implicit modules for test, examples, benchmarks, ..., which are not user oriented. * If a repository has this explicit mapping, the module/sub-modules are the ones described in this mapping. Open points * Do we want/need to be able to define modules containing files in more than one repository? * Where the explicit mapping should be stored? * Should we track the build dependencies? How? * Should we rethink how Boost is build in a modularized world? * Do we want/need to take in account optional dependencies from the beginning? Note that this would not reduce the dependencies at the file level, but at least would help us to break the cycles. Peter, if we agree this is the way to exit from the impasse, would you like to adapt your tool to use an explicit mapping ? Any concrete proposal about how Boost could be installed in a modularized world would be welcome. Open point: Is anyone interested in working on this modular installation? Best, Vicente

8 16

Re: [boost] [Boost.Config] variadic templates availiable with GCC 5 in C++03 mode
by Lars Gullik Bjønnes 24 Sep '14

24 Sep '14

(resent due to missing membership on boost list) On 23 September 2014 22:43, Lars Gullik Bjønnes <larsbj(a)gullik.org> wrote: > Hi, > > It seems that the checking to define BOOST_NO_CXX11_VARIADIC_TEMPLATES or not > is slightly wrong when __GNUC__ > 4 (in this case __GNUC__ == 5) > > This was tried fixed in [SVN r70019], but it looks like the fix was > wrong for __GNUC__ > 4. > > (git 050da29d47ce43b1dca6bed03d54c40d5e3d315e) > > > This is the current code: > > // Variadic templates compiler: > // http://www.generic-programming.org/~dgregor/cpp/variadic-templates.html > # if defined(__VARIADIC_TEMPLATES) || (__GNUC__ > 4) || ((__GNUC__ == > 4) && \ (__GNUC_MINOR__ >= 4) && defined(__GXX_EXPERIMENTAL_CXX0X__)) > # define BOOST_HAS_VARIADIC_TMPL > # else > # define BOOST_NO_CXX11_VARIADIC_TEMPLATES > # endif > #endif > > > This is my proposed fix: > > diff --git a/functional/boost/boost/config/compiler/gcc.hpp > b/functional/boost/boost/config/compiler/gcc.hpp > index ef6b07e..736e8ba 100644 > --- a/functional/boost/boost/config/compiler/gcc.hpp > +++ b/functional/boost/boost/config/compiler/gcc.hpp > @@ -157,7 +157,7 @@ > > // Variadic templates compiler: > // http://www.generic-programming.org/~dgregor/cpp/variadic-templates.html > -# if defined(__VARIADIC_TEMPLATES) || (__GNUC__ > 4) || ((__GNUC__ > == 4) && (__GNUC_MINOR__ >= 4) && defined(__GXX_EXPERIMENTAL_CXX0X__)) > +# if defined(__VARIADIC_TEMPLATES) || ((__GNUC__ > 4 || (__GNUC__ == > 4 && __GNUC_MINOR__ >= 4)) && defined(__GXX_EXPERIMENTAL_CXX0X__)) > # define BOOST_HAS_VARIADIC_TMPL > # else > # define BOOST_NO_CXX11_VARIADIC_TEMPLATES > > > (I'll post a none-damaged diff if wanted.) > > -- > Lgb -- Lgb

3 2

[iterator] Support other tuple implementations with zip_iterator
by Kohei Takahashi 24 Sep '14

24 Sep '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi all, Here is my proposal [1] for supporting other tuple implementations (e.g. std::tuple) with zip_iterator, which discussed at the issue [2]. This PR will reimplement zip_iterator as a fusion based one, because current implementation is tightly coupled with Boost.Tuple. Of course, Boost.Tuple should be accepted via Boost.Fusion. [1] https://github.com/boostorg/iterator/pull/2 [2] https://svn.boost.org/trac/boost/ticket/7526 Thanks, Kohei Takahashi -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.22 (MingW32) iQIcBAEBAgAGBQJUIi7FAAoJEGGyPxPRp/zof5IQAMFjfB1q3yhXXEvoXOZGedhn 8S6hCWsar0MA42Wn/PIG1cMxgb4oc9cZFv6KBieDAn38QJu44NYDFhxhRlMPDMrs cgNQDbvYROWzakzUX93DstzSwvUwqIjWg4bFFYbE5cmK1MbmCWZODs5TQFKQDxxO KfrUEsttoMlbklFa5Rw9JdM3bP2NMUlmJZ9M/8/rBhAf/AvgLiSK9f7qXjoWoMaZ DwZKEztQB2ZRL+iwtCeNJU0OSJ3/KCsS45xYKY9tsE25RGWU8vdryKEqt/eeHe/d dfVpMWMLKZ3g7PoLc73ntxX+C0B/Zj96rhqurt3Z6gtWmSiYFxct/0oDqfu9JKCn hG4p+g70m1nW47Kfvc8p3ZiWABvOOghPT9CEyyATh4nMzJTYLwawD00uRUtdATT9 siTIH2AeEHUnUuNHMMdbr7kJMq/6aubt0RFz04TgIZJ0EmrkjbuxfeiemoiZhyeN JNE9ubujqMiAcyeLpCWAbnogLWMgn8duvIKYc0pvFlYIkGWKrAMSd46RaCd47g4x alYh7vlLE8nqdmAwe2is5PfFIw8qzJj1zn+Kj+CFkXouJ9eObiOXTbTdQNPhFplT gAxYLdcmz23goQzAQ9xTMySmuGFzHKZn+uTQ3gpzDABC6zGCXhGA/Hu+JER/KmTY 3Ty2EoDqWdsu/bp9mY+/ =wJsr -----END PGP SIGNATURE-----

1 0

Boost.Hana - Type Classes, data types and categories (tags).
by Vicente J. Botet Escriba 23 Sep '14

23 Sep '14

Hi Louis, There is a lot of very good work on your library. I have some comments in relation on how I have implemented Type Classes in my prototype. About datatype<T>. The library proposes type classes and data types. The name datatype_t<> is confusing as the datatype<T> meta-functions must not return one of the defined data types. I see it much more as a category, which is used to map the data type to a category used as parameter of the instantiation TC::Instance<datatype_t<T>>. In addition, I wonder if the category associated shouldn't depend on the type class we want to map. TC::Instance<category_t<T, TC>> About naming: Haskell doesn't have namespaces and all the functions are at the same scope. Your library makes use of a lot of non-member functions, and so name clashing must be avoided. What about moving all the non-member functions of the Type Class to a specific namespace? E.g. struct Monad { ... }; namespace monad { using namespace applicatives; ... bind() }; The use would need to use the type class namespace explicitly auto x = monad::bind(m, f) or introduce the namespace of the type class using namespace monad; auto x = bind(m, f); Best, Vicente

4 10

CMake module for compile-time benchmarks
by Louis Dionne 22 Sep '14

22 Sep '14

Hi, While working on Hana, I have developped a couple of tools to generate compile-time benchmarks. I have now made this easier to use for anyone who wishes to do the same by writing a CMake module which does the dirty work for you. The module is available at [1]. Basically, you drop this in your CMake tree, install a couple of dependencies and then you can create targets to run the compile-time benchmarks. The gist of it is explained in the module, and you can find a lot of examples in [2]. This is still a work in progress. For example, the module still does not support runtime benchmarking even though the documentation says it does. Also, it only works with Clang and GCC for now. There are probably a ton of glitches and ways to improve it; feel free to send pull requests! Regards, Louis [1]: https://github.com/ldionne/hana/blob/master/cmake/Benchmarks.cmake [2]: https://github.com/ldionne/hana/tree/master/benchmark

1 0

Boost.Hana - Maybe and Either data types design
by Vicente J. Botet Escriba 21 Sep '14

21 Sep '14

Hi Louis, I have some concerns with the design of the Maybe and Either data types (maybe the other data types have the same design, I have not taken a look at). There are somethings that I don't understand, sorry I have not changed yet my mind to then new C++ way. If I want to define a function that takes an Either string int, how can I define it? void f(??? p) {} I see that there is a maybe_detail::maybe<bool,class>, however I don't think this is the data type of Maybe, is it? Anyway, I don't see a either_detail::either<bool, class, class>. I have the impression that I must use always auto with lambdas auto f = [](auto p) {...}; But I don't know what I can put in the body. It is to clear neither how can I declare a variable of type Either string int. I see that I can declare a Left string and a Right int BOOST_HANA_CONSTEXPR_LAMBDA auto left_value = left("x"); BOOST_HANA_CONSTEXPR_LAMBDA auto right_value = right(1); I have the impression that the variables are initialized only once and can not be reassigned,or at least we can not assing a Left value to a variable initialized with a Right value. Is this by design? A last concern related to the applicative lift function. I suspect that it corresponds to the Haskell return function and the more general unit Monad function. As there is a lift function in Haskell, this is a little bit confusing. I have named this function make :) In Haskell, the template parameter is a type constructor. This Monad(Applicative) type constructor should be Either E, not Either. Is the type-constructor feature missing from your design? How wan I create an Either string int with a call to auto x =lift<Either>(123); I would expect something like auto x = lift<Either<string>>(123); In my prototype I have auto x = make<expected<holder, string>>(123); where expected<holder, string> is the Monad type constructor for expected<T, string>. Sorry the argument of expected and Either are in interchanged. The string type is the Error. Best, Vicente

2 1

[GSoC] [Boost.Hana] Formal review request
by Louis Dionne 21 Sep '14

21 Sep '14

Dear Boost, It has been a while since I've given news about my GSoC project, Boost.Hana[1]. Things are going very well and I uploaded the library to the Boost Incubator. I think it is time to push the library forward for review. As the author, I know everything that's left to be done and polished before I can be fully satisfied. Still, I believe the library is worthwhile in its current state as it implements a superset of the functionality found in the Boost.MPL and Boost.Fusion. I also think the library will benefit greatly from a larger user base and more feedback. Here are some caveats: - The library requires a full C++14 compiler, so only Clang 3.5 can compile the unit tests right now. However, compilers will eventually catch up. Also, pushing cutting edge libraries forward might motivate compilers to support C++14 ASAP, which is probably a good thing. - The library is not fully stable yet, so interface changes are to be expected. I don't see this as a problem as long as this is documented, especially since I expect Hana to be used mostly for toying around for at least a while. I could be mistaken. So unless someone thinks the library isn't ready or would get rejected right away in its current state for reason X, I am requesting a formal review for Boost.Hana. Regards, Louis [1]: http://github.com/ldionne/hana

22 110

Re: [boost] proposal a movable_initializer_list
by 何子杰Hzj_jie 19 Sep '14

19 Sep '14

No body interests in it? I trust if the initializer_list is movable, it would be great helpful to construct a class with a set of lambda expressions. And we can use these lambda expressions to define a procedure, and provide a better solution for asynchronous programming. .Hzj_jie ________________________________ From: 何子杰Hzj_jie<mailto:hzj_jie@hotmail.com> Sent: ‎16/‎9/‎2014 10:35 To: boost(a)lists.boost.org<mailto:boost@lists.boost.org> Subject: Re: [boost] proposal a movable_initializer_list sorry, my fault of the mistake of for-range usage, you are correct, I am using iterator in my implementation. The efficiency I am taking care is the difference between copy-construction and move-construction. It will be significant if we are using lambda expression. Surely we still have something else to improve, say, provide the size of the vector at construction. The way using movable_initializer_list in the test case is not typical, indeed I am trying another not related issue. <the order of the move-constructions are not expected, i.e. line 46 will throw errors by g++, but no problem by msvc> Usually if a class A accept movable_initializer_list<T> as the parameter of a constructor, we only need A({T(), T()}), i.e. same as initializer_list. You properly would like to have a look at the event class, which is the typical scenario of movable_initializer_list, at https://github.com/Hzj-jie/osi/blob/master/delegates/event.hpp, with a test at https://github.com/Hzj-jie/osi/blob/master/utt_cases/delegates/event_test.h…. briefly it uses movable_initializer_list to avoid a copy of std::function instances, but can provide a way to call constructor with { } syntax. .Hzj_jie From: Sebastian Redl Sent: ‎Monday‎, ‎September‎ ‎15‎, ‎2014 ‎8‎:‎09‎ ‎PM To: boost(a)lists.boost.org On 15 Sep 2014, at 9:39, 何子杰Hzj_jie <hzj_jie(a)hotmail.com> wrote: > hi, all, > > So I proposal a movable_initializer_list, it accepts two ways to construct, with an initializer_list<T*> or initializer_list<T>, the prototype is, > > The implementation of T* overloads is something like > > movable_initializer_list<std::initializer_list<T*> x) > > { > > for(auto it : x) > > { > > assert((*it) != nullptr); > > v.push_back(std::move(**it)); > > delete *it; > > } > } Should be for (auto p : x) { v.push_back(std::move(*p)); delete p; } because of how for-range works. Seems an incomplete manual change from your published source. However, this is highly problematic because: - There is absolutely no way to make this exception-safe. The intended usage is obviously: SomeType st = { new Foo(123), new Foo(456), new Foo(789) }; But if any constructor here throws, a lot of memory is leaked, and destructors are not called. - If efficiency is your goal, I somehow doubt that an additional dynamic allocation per element for the initial list, then building a vector element by element, is the best way to achieve it. - The interface to this is just horrible. Looking at your test case, there is an absurd amount of boilerplate. Here’s what we really want: SomeType st{ Foo(123), Foo(456), Foo(789) }; Here’s what your thing forces me to do: auto pointers = { new Foo(123), new Foo(456), new Foo(789) }; SomeType st(pointers); // Absolute best case: no ambiguity in overload resolution - actually rather doubtful. If you do it that way, you might as well do it this way: Foo[] foos = [ Foo(123), Foo(456), Foo(789) }; // No dynamic allocation SomeType st(make_move_iterator(begin(foos)), make_move_iterator(end(foos))); More efficient, and you could make helpers that combine the make_move_iterator and begin/end calls to reduce boilerplate. > > While the implementation of T overloads is something like > > moveable_initializer_list<std::initializer_list<T> x) > { > > for(auto it : x) v.push_back(move(*it)); > } Again, that’s not how for-range works. What you want is for (auto&& e : x) v.push_back(std::move(e)); But that doesn’t actually work, because a std::initializer_list never gives you non-const access to its elements. I notice that your test case doesn’t test this constructor. Sebastian _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Boost incubator milestone
by Robert Ramey 19 Sep '14

19 Sep '14

The boost library incubator (www.blincubator.com) has received it's first Boost quality review for one of its submitted libraries. See the review here: http://rrsd.com/blincubator.com/reviews/?library_post_id=669 Hopefully this will motivate more people to submit their own reviews in advance of some formal review period. BTW - this review of this library (Compute) is very positive. Hopefully this will motivate other potential users to try out the library and make their own review. If the number of reviews reaches 5 I'll ask that the formal review for this library be expedited since, given such a head start, the review should be much simpler than starting from scratch. So I'm encouraging people who want to get the review process on a faster track to submit their own reviews as soon as they can find time. The Incubator has been progressing more slowly than I would hope. But progress is being made. Hopefully, this will continue to the point where it becomes and "overnight" success. Thanks to Denis Demidov for breaking the ice here. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-incubator-milestone-tp4667761.html Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Re: [boost] TravisCI and Coverall usage policies in Boost
by Marek Kurdej 19 Sep '14

19 Sep '14

Hi, > If we ever get Windows on Travis, I was surprised how good the MSVC > static analyser has become, and we should have a pass with that too. > FYI, there is a CI similar to Travis running MSVC-12.0, see https://ci.appveyor.com/. I've used it for a personal project, you can have a look at a sample configuration file using Boost libraries at https://github.com/mkurdej/bft/blob/develop/appveyor.yml. The only problem, there is only a 30-day free trial... Cheers, Marek Kurdej -- Ph.D. candidate

1 0

Trac spam report
by Joaquín M Lopez Munoz 19 Sep '14

19 Sep '14

https://svn.boost.org/trac/boost/ticket/10502 Thank you Joaquín M López Muñoz Telefónica

2 1

[regression] Debian-sid
by Suckow, Thomas J 18 Sep '14

18 Sep '14

Someone has been running regression tests on develop with the name “Debian-sid”, I believe they have a space in the path to the regression suite, which is causing it to fail. The job gets run like clockwork, shame that it isn’t uploading any useful results. Either the operator of this builder should change the path so that it does not have a space, or the regression suite should be updated to tolerate it. I tried once to figure out where in the test suite the path got mangled, but was unsuccessful, maybe someone more familiar with it could take a look? - Thomas

2 3

[type_traits] Modularization proposal
by Andrey Semashev 17 Sep '14

17 Sep '14

Hi, Boost.TypeTraits is used in lots of other Boost libraries, and it currently unnecessarily pulls MPL and TypeOf. The dependencies are introduced by just these two public headers: floating_point_promotion.hpp and common_type.hpp. I'd like to avoid these dependencies. I propose to extract common_type.hpp (and its implementation and tests) into a sublib within type_traits (e.g. type_traits/common_type). As for floating_point_promotion.hpp, it is used in promote.hpp, which is using integral_promotion.hpp. I can see two ways of tackling it: 1. Extract all promotion traits into a sublib (e.g. type_traits/promotion). This includes floating_point_promotion.hpp, integral_promotion.hpp and promote.hpp, as well as their tests. 2. Change floating_point_promotion.hpp to not use MPL. MPL is used only to workaround BOOST_NO_CV_SPECIALIZATIONS, which is defined for Borland 5.51 and older and MPW 8.90 and older. The simplest way is to drop the workaround, but at a quick glance it should be possible to retain it. I'm currently leaning towards the option 2, although we obviously don't test those compilers and there is no way of knowing if the code will still work after the change. So I'm interested to know others' opinion, both with regard to the general idea and the way of proceeding with floating_point_promotion.hpp in particular. PS: TypeTraits dependencies can be seen in the report Peter graciously uploaded: http://www.pdimov.com/tmp/report-d5ca5be/type_traits.html After the modularization efforts TypeTraits should only depend on Config, Core, Preprocessor, MPL.Core and StaticAssert. Don't mind that MPL.Core depends on MPL - the pull request fixing it has already been created.

8 23

[mpl] Modularization pull request
by Andrey Semashev 17 Sep '14

17 Sep '14

Hi, I've created this pull request: https://github.com/boostorg/mpl/pull/11 to separate core components of Boost.MPL to a sub-library. The intent of this pull request is to reduce dependencies added by MPL to its dependent libraries, when only the basic MPL components are required. In particular, it should help resolving circular dependency between MPL and TypeTraits. Please, have a look at the list of moved components and let me know if you have any comments.

4 18

[testing] mpl/core tests not visible
by Andrey Semashev 17 Sep '14

17 Sep '14

Hi, I can see a few testers have cycled since MPL.Core was extracted into a sublibrary, but there is no mpl/core page in the test matrix. The sublibs file and core/test directory are present in the mpl submodule. Is there something I should do to make the tests appear?

3 21

[TR1] Reming TR1? [was: Libraries failing across the board.]
by Beman Dawes 16 Sep '14

16 Sep '14

On Wed, Jul 9, 2014 at 8:13 AM, John Maddock <boost.regex(a)virgin.net> wrote: > > > On 08/07/2014 22:07, Beman Dawes wrote: > >> Marshall is just a few days away from being able to put out a beta release >> candidate. (And that is very good news!) >> >> But we still have too many libraries failing across the board on master: >> >> accumulators >> interprocess >> numeric/ublas >> pool >> proto >> spirit/repository >> spirit/test >> tr1 >> > > TR1 is now deprecated, and again hasn't been changed in a long time - the > main failures seem to be caused by changes to Boost.Random (or possibly > std::random) so that it is now no longer TR1 compliant. Someone would have > to rewrite it to use TR1-compatible random number classes perhaps culled > from an old version of Boost, frankly I just don't see the point. The lib > should probably be removed from Boost at some point. > We went back and forth a bit, and decided to remove TR1 after 1.56.0 shipped. What exactly needs to be done? * Remove the .gitmodules entry. * Remove the status/Jamfile.v2 entry. * Remove the libs/maintainer.txt entry. * Update http://www.boost.org/doc/libs/ Anything else? --Beman

5 4

[modularization] mplcore depends on mpl
by Stephen Kelly 16 Sep '14

16 Sep '14

Hi there, libs/mpl/core/include/boost/mpl/aux_/include_preprocessed.hpp from mplcore includes boost/mpl/aux_/config/compiler.hpp which is in mpl. mpl depends on mplcore. This is a circular dependency. I thought the point of the split was to resolve that in part. If so, then I recommend you go ahead and resolve the cycle in the obvious way. Thanks, Steve.

2 1

Re: [boost] proposal a movable_initializer_list
by 何子杰Hzj_jie 16 Sep '14

16 Sep '14

sorry, my fault of the mistake of for-range usage, you are correct, I am using iterator in my implementation. The efficiency I am taking care is the difference between copy-construction and move-construction. It will be significant if we are using lambda expression. Surely we still have something else to improve, say, provide the size of the vector at construction. The way using movable_initializer_list in the test case is not typical, indeed I am trying another not related issue. <the order of the move-constructions are not expected, i.e. line 46 will throw errors by g++, but no problem by msvc> Usually if a class A accept movable_initializer_list<T> as the parameter of a constructor, we only need A({T(), T()}), i.e. same as initializer_list. You properly would like to have a look at the event class, which is the typical scenario of movable_initializer_list, at https://github.com/Hzj-jie/osi/blob/master/delegates/event.hpp, with a test at https://github.com/Hzj-jie/osi/blob/master/utt_cases/delegates/event_test.h…. briefly it uses movable_initializer_list to avoid a copy of std::function instances, but can provide a way to call constructor with { } syntax. .Hzj_jie From: Sebastian Redl Sent: ‎Monday‎, ‎September‎ ‎15‎, ‎2014 ‎8‎:‎09‎ ‎PM To: boost(a)lists.boost.org On 15 Sep 2014, at 9:39, 何子杰Hzj_jie <hzj_jie(a)hotmail.com> wrote: > hi, all, > > So I proposal a movable_initializer_list, it accepts two ways to construct, with an initializer_list<T*> or initializer_list<T>, the prototype is, > > The implementation of T* overloads is something like > > movable_initializer_list<std::initializer_list<T*> x) > > { > > for(auto it : x) > > { > > assert((*it) != nullptr); > > v.push_back(std::move(**it)); > > delete *it; > > } > } Should be for (auto p : x) { v.push_back(std::move(*p)); delete p; } because of how for-range works. Seems an incomplete manual change from your published source. However, this is highly problematic because: - There is absolutely no way to make this exception-safe. The intended usage is obviously: SomeType st = { new Foo(123), new Foo(456), new Foo(789) }; But if any constructor here throws, a lot of memory is leaked, and destructors are not called. - If efficiency is your goal, I somehow doubt that an additional dynamic allocation per element for the initial list, then building a vector element by element, is the best way to achieve it. - The interface to this is just horrible. Looking at your test case, there is an absurd amount of boilerplate. Here’s what we really want: SomeType st{ Foo(123), Foo(456), Foo(789) }; Here’s what your thing forces me to do: auto pointers = { new Foo(123), new Foo(456), new Foo(789) }; SomeType st(pointers); // Absolute best case: no ambiguity in overload resolution - actually rather doubtful. If you do it that way, you might as well do it this way: Foo[] foos = [ Foo(123), Foo(456), Foo(789) }; // No dynamic allocation SomeType st(make_move_iterator(begin(foos)), make_move_iterator(end(foos))); More efficient, and you could make helpers that combine the make_move_iterator and begin/end calls to reduce boilerplate. > > While the implementation of T overloads is something like > > moveable_initializer_list<std::initializer_list<T> x) > { > > for(auto it : x) v.push_back(move(*it)); > } Again, that’s not how for-range works. What you want is for (auto&& e : x) v.push_back(std::move(e)); But that doesn’t actually work, because a std::initializer_list never gives you non-const access to its elements. I notice that your test case doesn’t test this constructor. Sebastian _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Darwin Clang Config failures.
by John Maddock 15 Sep '14

15 Sep '14

Does anyone understand why these all fail: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… Is <functional> really broken on that platform? Surely not? Thanks, John.

4 3

proposal a movable_initializer_list
by 何子杰Hzj_jie 15 Sep '14

15 Sep '14

hi, all, the initializer_list in c++11 does not support the inner objects to be moved, so in some scenarios the performance will be significant impacted. say, an event class, which stores several std::function objects, and execute them later. the prototype is template <typename Args…> class event { private: std::vector<std::function<void(Args…)>> v; public: event(std::initializer_list<std::function<void(Args…)>>); void bind(std::function<void(Args…)>&&); }; When calling the constructor of event with a set of lambda expressions, the std::function objects will be copied instead of moved, and cause performance impact. Though pointer can resolve the issue, the syntax is not friendly, and the user needs to delete the instances manually. So I proposal a movable_initializer_list, it accepts two ways to construct, with an initializer_list<T*> or initializer_list<T>, the prototype is, template <typename T> class movable_initializer_list { private: std::vector<T> v; public: movable_initializer_list(std::initializer_list<T*>); movable_initializer_list(std::initializer_list<T>); // other functions same as initializer_list }; The implementation of T* overloads is something like movable_initializer_list<std::initializer_list<T*> x) { for(auto it : x) { assert((*it) != nullptr); v.push_back(std::move(**it)); delete *it; } } While the implementation of T overloads is something like moveable_initializer_list<std::initializer_list<T> x) { for(auto it : x) v.push_back(move(*it)); } Surely end-users need to aware the implementation of movable_initializer_list will move the objects instead of copy. The full implementation is at https://github.com/Hzj-jie/osi/blob/master/formation/movable_initializer_li…, and the test is at https://github.com/Hzj-jie/osi/blob/master/utt_cases/formation/movable_init…. Please feel free to give me some suggestions about this proposal. Thank you in advanced. .Hzj_jie

2 1

[vmd] Library Review
by Paul Mensonides 15 Sep '14

15 Sep '14

(apologies for the late review) -- Design -- Many of the utility components of the library have decent design. There are, however, a couple of aspects of the design that I dislike, and they touch on a large chunk of the library. These concerns all revolve around the registration, recognition, parsing, and limitations of various "v-types" and "v-sequences". I do not yet see a strong use case for the "v-key"/"v-identifier" recognition scenario, as opposed to just registering a "v-identifier". For example, #define BOOST_VMD_MAP_<v-key><v-identifier> // ... BOOST_VMD_IS_IDENTIFIER(<v-seq>, <tuple-of-v-keys>) Perhaps Edward can enlighten me about the use-cases for which this is ideal. I do see some use-cases, but in most cases it requires dispatch based on what the particular "v-identifier" it is anyway. One could do better for this low-level part with registrations such as (without a BOOST_VMD_ prefix for brevity) #define IDENTIFIER_CIRCLE (CIRCLE), #define IDENTIFIER_SQUARE (SQUARE), #define IDENTIFIER_TRIANGLE (TRIANGLE), #define IDENTIFIER_RECTANGLE (RECTANGLE), These definitions don't allow one to directly test for specific "v-identifiers", but they do allow one to extract registered "v-identifiers" from a "v-sequence". If all such registrations are required to be the same, there is no need for separate per-library prefixes. Macros can be defined multiple times if they are defined the same way. Similarly, the "v-numbers" could be pre-registered by the library as #define NUMBER_0 (0), #define NUMBER_1 (1), #define NUMBER_2 (2), // ... Tests for specific "v-identifiers" can be done via extraction from the above and using macro definitions such as #define COMPARE_CIRCLE_CIRCLE () #define COMPARE_SQUARE_SQUARE () // ... In many cases this sort of comparison is not needed, as one would directly dispatch off of the "v-identifier" itself. In any case, one could "parse" a "v-sequence" into "v-types" without many of the limitations of the current design. The following example uses Chaos, but I do not think there is anything in the design that fundamentally cannot be made to work on (e.g.) VC++. #include <chaos/preprocessor.h> #define NUMBER_1 (1), #define NUMBER_2 (2), #define NUMBER_3 (3), #define NUMBER_4 (4), #define NUMBER_5 (5), // ... // parser implementation... #define PARSE(vseq) PARSE_S(CHAOS_PP_STATE(), vseq) #define PARSE_S(s, vseq) \ CHAOS_PP_SPLIT(0, CHAOS_PP_EXPR_S(s)(CHAOS_PP_WHILE_S( \ s, PARSE_P, PARSE_O,, vseq \ ))) \ /**/ #define PARSE_P(s, seq, vseq) \ CHAOS_PP_COMPL(CHAOS_PP_IS_EMPTY_NON_FUNCTION(vseq)) \ /**/ #define PARSE_O(s, seq, vseq) \ seq CHAOS_PP_IIF(CHAOS_PP_IS_VARIADIC(vseq))( \ PARSE_O_A, PARSE_O_B \ )(vseq) \ /**/ #define PARSE_O_A(vseq) PARSE_O_A_A vseq #define PARSE_O_A_A(...) (3, (__VA_ARGS__)), #define PARSE_O_B(vseq) \ CHAOS_PP_IIF(CHAOS_PP_IS_VARIADIC(NUMBER_ ## vseq))( \ PARSE_O_B_A, \ CHAOS_PP_IIF(CHAOS_PP_IS_VARIADIC(IDENTIFIER_ ## vseq))( \ PARSE_O_B_B, PARSE_O_B_C \ ) \ )(vseq) \ /**/ #define PARSE_O_B_A(vseq) \ (1, CHAOS_PP_REM_CTOR( \ CHAOS_PP_SPLIT(0, NUMBER_ ## vseq) \ )), \ CHAOS_PP_SPLIT(1, NUMBER_ ## vseq) \ /**/ #define PARSE_O_B_B(vseq) \ (2, CHAOS_PP_REM_CTOR( \ CHAOS_PP_SPLIT(0, IDENTIFIER_ ## vseq) \ )), \ CHAOS_PP_SPLIT(1, IDENTIFIER_ ## vseq) \ /**/ #define PARSE_O_B_C(vseq) (0, vseq), // registrations... #define IDENTIFIER_CIRCLE (CIRCLE), #define IDENTIFIER_SQUARE (SQUARE), #define IDENTIFIER_TRIANGLE (TRIANGLE), #define IDENTIFIER_RECTANGLE (RECTANGLE), PARSE( CIRCLE RECTANGLE (a, b, c) TRIANGLE 3 (xyz) UNREGISTERED SQUARE ) (Apologies for any mistakes in the above. I wrote it up quickly.) This particular example results in key-value pairs of the form: (0, <unrecognized>) (1, <v-number>) (2, <registered-identifier>) (3, <tuple>) (2, CIRCLE) (2, RECTANGLE) (3, (a, b, c)) (2, TRIANGLE) (1, 3) (3, (xyz)) (0, UNREGISTERED SQUARE) There are a number of things that could be done instead of producing a binary sequence like this (which Boost.Preprocessor cannot handle). One could fold the results via a user-supplied macro, for example. Aside from the massive amount of clutter introduced by workarounds, many of the pieces of the above are already available either in Boost.Preprocessor or in other parts of the VMD library. For example, BOOST_VMD_IS_EMPTY is essentially CHAOS_PP_IS_EMPTY_NON_FUNCTION. -- Implementation -- I have not looked closely at the implementation, but I do know what a herculean effort it is to get this type of stuff working with VC++ in particular. -- Documentation -- There are few inaccuracies in the documentation related to motivations for various Boost.Preprocessor things, but those could be fixed. The documentation for BOOST_VMD_IS_EMPTY is decent except that essentially any input that ends with a function-like macro name will cause weird results or errors. So much so that the documentation should just disallow input that ends with a function-like macro name across the board. Other than that, the documentation needs some clean-up and organization (particularly of definitions), but does a reasonable job of documenting the library. I do feel that a lot of documentation complexity comes from the way that v-keys/v-identifiers (etc) are handled. -- Usefulness -- There is a definite use-case for many of the utilities in the library, and the fundamental concept v-sequence parsing. -- Testing -- I tested the library with GCC and everything functioned as advertised. -- Effort -- I did a fairly significant study of the design and interface of the library. -- Domain Familiarity -- I had my skull opened up and had "preprocessor metaprogramming" tattooed directly onto my brain. -- There are many good parts of the library--including the herculean effort to make it work on sub-par preprocessors such as VC++. However, at this point I would be hesitant to recommend acceptance based on the design of the v-type recognition and v-sequence parsing part. I am open to argument about why the current design is superior based on use-cases or technical limitations introduced by (e.g.) VC++ or, if it is not superior, a further review at a later date after a redesign because the underlying concept is sound. -- Regards, Paul Mensonides

3 14

Intel C++ Linux non-commercial software development license updated information
by Edward Diener 15 Sep '14

15 Sep '14

Just a quick note to tell anyone interested that evidently Intel has discontinued their free Intel C++ Linux compiler for developers based on their non-commerical software development license. If you look at their non-commercial software development license page at https://software.intel.com/en-us/non-commercial-software-development you will see that it only potentially offers a license for academics and the response I received on their online forum for Intel C++ is that they have discontinued their non-commercial software development license for developers, although they seem loth to make an announcement about it or publicize it. I have some recent versions of Intel C++ Linux with which I can still test but I will not be able to test the latest version(s) of Intel C++ on Linux. The isocpp Get Started page at https://isocpp.org/get-started still mentions the free Intel C++ version, but this evidently is no longer the case.

1 0

[process] [sorting] [singularity] [compute] [others] Who needs review manager?
by Antony Polukhin 14 Sep '14

14 Sep '14

Hi, Library authors that have no review manager and feel ready for review please contact me via this mailing list. -- Best regards, Antony Polukhin

7 14

[serialization] [libstdc++] [detail] utf8_codecvt_facet fixes broke serialization test_array_xml_warchive
by Beman Dawes 13 Sep '14

13 Sep '14

The specific crash message is: *** Error in `../../../bin.v2/libs/serialization/test/test_array_xml_warchive.test/clang-linux-libstdcpp/debug/test_array_xml_warchive': double free or corruption (!prev): 0x00000000015f6f90 *** It occurs for clang, gcc, and intel compilers, using libstdc++. It does not occur with clang using libc++. It does not occur with msvc 10.0, 11.0, or 12.0. None of the other libraries (filesystem, log, program_options, property_tree) that use utf8_codecvt_facet are failing on develop. This is mainly a heads up to let people know that the serialization problem in develop is being worked on, but it may be a day or two before I have a fix. --Beman

4 10

[asio] RFC on new reliable UDP library
by Niall Douglas 12 Sep '14

12 Sep '14

Dear Boost and ASIO users, CC: boost(a)lists.boost.org, asio-users(a)lists.sourceforge.net I am writing to ask for comments on the design of and interest in a generic reliable messaging library based on ASIO. Such a library could bring to ASIO very considerably improved data transfer performance over TCP, plus the ability to ignore NAT firewalls. The design imperatives for such a library are proving tricky to reach consensus upon, so perhaps the community might be able to help. Firstly, what features should such a reliable messaging library have? Here are some for you to consider: * Should it have wire transport backends with an abstraction from wire transports, so a UDT backend could be interchangeable with TCP for example with just a recompile needed? Upper level code need therefore not consider what format the wire transport takes, just that messages are reliably delivered or we are told of the connection failure. Some mechanism for dealing with out of order messages, and message expiry in case congestion control excessively delays outbound messages would also be included. You should be aware that congestion control for a reliable messaging library means one has no choice but to pace message construction (i.e. block/EWOULDBLOCK handing out new message send templates), otherwise one ends up buffering more data for sending than potentially can ever be delivered. This is because we cannot drop reliable messages, nor can we pace writes, so pacing new message construction is the only alternative. * Should it be zero copy for both receipt and send? If so, we'll have to break with the existing ASIO API somewhat - namely that MutableBufferSequence will need to now become MutableFileOffsetBufferSequence so one can supply scatter/gathers of user space buffers and kernel side buffers. We'll also have to templatise the buffer management so client code can supply the virtualisation (e.g. an iterator) which remaps inbound message fragments into apparently contiguous regions. By the time we have done these, the API looks quite different. * Should it be written using C++ 14 idioms instead of the existing 03 idioms ASIO uses? If so, basing read and write handlers on the C++ 17 proposed experimental::expected<T, E> (http://www.hyc.io/boost/expected-proposal.pdf) makes much more sense than the fixed ASIO handler prototype void (*handler)(const boost::system::error_code& ec, std::size_t bytes_transferred) - it is more powerful, more expressive, optionally integrates cleanly with no-alloc future-promise and the rest of the C++ 11/14 STL, and lets handlers use any mix of error reporting mechanism they choose. It also opens the door to a much cleaner and tighter integration of the future C++ 17 Networking TS with Concurrency TS. Equally, especially if combined with the earlier changes, it goes further and further away from the present ASIO design. * How concurrent should it be capable of? Unlike TCP where it makes not much sense to have concurrent writers, UDP allows enormous parallelism, potentially into queue depths of thousands on decent NICs, sufficiently so where a strand based design may simply not scale. We believe that with some effort a completely lock free design which can make full use of the batch datagram send and receive APIs on Linux and Windows is possible - we believe that such a design would scale close to linearly to CPU cores available. Unfortunately, as batch datagram send/receive is not supported by ASIO and on POSIX the main dispatcher appears to be locked by a mutex, this would require a custom code path and i/o service. If combined with all of the above, it starts to look like a rewrite of the core of ASIO which seems very big just to implement reliable messaging. I guess that is good for now for starting discussion. My thanks for your time in advance. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

9 17

[core/noncopyable][test/boost::unit_test::singleton] massive test failures
by Joaquin M Lopez Munoz 11 Sep '14

11 Sep '14

Hi, There's a problem with noncopyable and boost::unit_test::singleton in Intel 13 for Linux in C++11 compatibility mode that's rippling through many Boost libs. To list a few: date_time: http://tinyurl.com/lkeakab geometry: http://tinyurl.com/n3rajyn regex: http://tinyurl.com/kxkqo4c tuple: http://tinyurl.com/oz3vlct The error messages go like protected function "boost::noncopyable_::noncopyable::noncopyable()" [...] is not accessible through a "boost::noncopyable_::noncopyable" pointer or object[...] protected function "boost::unit_test::singleton<Derived>::singleton()" [...] is not accessible through a "boost::unit_test::singleton<boost::unit_test::unit_test_log_t>" pointer or object[...] which are manifestations of the following compiler bug: https://software.intel.com/en-us/forums/topic/404755 The report also indicates a simple workaround consisting of replacing BOOST_CONSTEXPR noncopyable() = default; with noncopyable() {} (seemingly, this would also fix boost::unit_test::singleton automatically.) Maybe the maintainer of boost:noncopyable can try a fix for ICC 13 along these lines? This can potentially clear a ton of yellow cells. I'd volunteer a pull request but alas I don't have local access to that compiler. Thank you, Joaquín M López Muñoz Telefónica

8 38

[build] clang objective c support?
by Emil Dotchevski 11 Sep '14

11 Sep '14

Hello, It seems like building with the clang-darwin toolset silently ignores .m and .mm files What is the status of Objective C support in this toolset? Is this a configuration problem on my part or is it just not supported? -- Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

3 6

ICL space and running complexity
by Kenneth Adam Miller 11 Sep '14

11 Sep '14

With regards to the ICL data structure, can anybody tell me what the space and time complexity is of the various interval_map types (split and regular)? http://www.boost.org/doc/libs/1_56_0/libs/icl/doc/html/index.html

2 1

[git] Problem after deleting submodule
by Edward Diener 10 Sep '14

10 Sep '14

Git is starting to get to me. I did a git pull from the latest master only to get a bunch of conflicts from the latest align submodule. I have never touched the align submodule locally so having conflict errors with it is absurd. After trying to straighten out the errors via a 'git reset --hard' for the align submodule, and still getting conflicts, I deleted the submodule locally just so I could get the latest master. Now I can't seem to get back the submodule. No matter what I do the submodule is no longer recognized at the top level. What do I do ? Yes git is powerful but it is also a VCS from hell. About the only intelligent thing I have ever heard Linux Torvalds say.

1 1

Trac spam report
by Joaquin M Lopez Munoz 09 Sep '14

09 Sep '14

I got this one: https://svn.boost.org/trac/boost/ticket/10437 Joaquín M López Muñoz Telefónica

5 6

_MSVC_VER - variadic_slot_invoker.hpp
by Anders Dalvander 09 Sep '14

09 Sep '14

There appears to be two predefined macro spelling mistakes in signals2/detail/variadic_slot_invoker.hpp. It says _MSVC_VER where it should say _MSC_VER. #if defined(_MSVC_VER) // <-- Here # pragma warning(push) # pragma warning(disable:4100) // unreferenced formal parameter #endif ... #if defined(_MSVC_VER) // <-- ... and here # pragma warning(pop) #endif Regards, Anders Dalvander

1 0

[range] Interest in range_call function?
by Arthur Rosenstein 09 Sep '14

09 Sep '14

Hi, I'm checking to see if there's interest in a range_call function that makes calling iterator-based algorithms with ranges a little less painful. Simply put, range_call takes a function and an argument list and forwards the arguments to the function while expanding ranges into begin/end iterator pairs. For example: range_call(std::sort, vec, std::greater<int>()); It can also transform the result a la Boost.Range: range_call(std::copy, range_call<return_begin_found>(std::unique, range_call<return_begin_end>(std::sort, vec) ), std::ostream_iterator<int>(std::cout, " ") ); Obviously, Boost.Range provides a cleaner interface for most standard algorithms. range_call, however, works with arbitrary functions and has a smaller surface area. Is there any interest in this (possibly as part of Boost.Range)? -- Cheers, Arthur

1 0

Re: [boost] [process] [sorting] [singularity] [compute] [others] Who needs review manager?
by Antony Polukhin 09 Sep '14

09 Sep '14

2014-09-08 22:52 GMT+04:00 Kyle Lutz <kyle.r.lutz(a)gmail.com>: > On Mon, Sep 8, 2014 at 9:03 AM, Antony Polukhin <antoshkka(a)gmail.com> > wrote: > > Hi, > > > > Library authors that have no review manager and feel ready for review > > please contact me via this mailing list. > > Hi Antony, > > The Boost.Compute library [1] is in need of a review manager. Also, > would it be possible to add it to the review queue listed at [2]? > > Thanks, > Kyle > > [1] https://github.com/kylelutz/compute > [2] http://www.boost.org/community/review_schedule.html > I took a quick glance at the library and it looks really interesting and promising. I'm not an expert in a problem domain, but at least I have some experience with CUDA. I'll need a few weeks to look through the sources and ask questions. If no one objects, after that we could discuss a review date and put it to the schedule. -- Best regards, Antony Polukhin

1 0

How to respond to mailing list
by Kirk Liberty 08 Sep '14

08 Sep '14

Hello, I'm sorry to have to ask this, but I've googled all around and can't figure it out. My email is set up to receive periodic digests of the mailing list. If I want to respond to an email thread, how would I do that? Thanks, Kirk

4 3

NTCTS Iterator [was: Interest in is_iterator type trait?]
by Beman Dawes 08 Sep '14

08 Sep '14

On Tue, Aug 19, 2014 at 1:56 PM, Peter Dimov <lists(a)pdimov.com> wrote: > Beman Dawes wrote: > > Source can be a iterator to a NTCTS or a container. >> > > An iterator to an NTCTS? That's an interesting invention. :-) > See http://beman.github.io/ntcts_iterator/ or https://github.com/Beman/ntcts_iterator --Beman

9 18

[Boost-users] Testers required
by Antony Polukhin 08 Sep '14

08 Sep '14

Hi, There is a big need in testers that have access to exotic platforms(zArch, MIPS) and compilers (Cray, IBM xlc ...). Could you please run `b2` in `boost/libs/type_index/test` and report results. This will help to test Boost.TypeIndex library and other libraries that depend on `demangle.hpp` I'll appreciate any help. Thanks in advance! -- Best regards, Antony Polukhin

2 2

Help identify the conversion bug in MSVC
by Andrzej Krzemienski 08 Sep '14

08 Sep '14

Hi, I found a bug in MSVC 10.0 that causes a bug in Boost.Optional. I will be trying to find a workaround for the compiler. I would like to ask people with the access to MSVC 11.0 and 12.0 to check if the bug also persist in these newer releases. The following code is expected to compile: struct A { A(int) {} A(A &&) {} }; struct B { operator A() { return A(1); } operator int() { return 0; } }; int main() { A t = B(); } The following code is expected *NOT *to compile: struct A { A(int) {} }; struct B { operator int() { return 0; } }; int main() { A t = B(); } Please let me know what your compiler says. Thanks, &rzej

2 2

Re: [boost] Finite state machine
by arcolight 07 Sep '14

07 Sep '14

> Hi, > I don't know if you're using msm or statechart but msm uses no dynamic > memory, except if you choose to use the event queue or deferred events. And > even this can be avoided by providing as template argument you own queue. > If you don't require these features, you can disable them. > > Cheers, > Christophe I'm using MSM. Yes I tried this, but I could not do so. Perhaps, I doing something wrong. Problem in that i've no OS, and even no full C library, I'm using newlib-nano. I was trying to disable everything, that I can, but this didn't help. I understand, that this situation is special and boostmust count on something. May be you can advise me how to use (and, may be,build?)boost with arm-none-eabi compiler.I've read docs and trying to build boost for arm-none-eabi, but compilation fails. Do I understand correctly, that MSM doesn't need to compile something - this is only .hpp files and it doesn't use libs, so I can try to use it without compilation? -- arcolight

2 1

[git][align][litre] git submodule update failure.
by Mostafa 07 Sep '14

07 Sep '14

$ git submodule update libs/align fatal: reference is not a tree: d32353ea7d39c0237202e3e460f3248f226db274 Unable to checkout 'd32353ea7d39c0237202e3e460f3248f226db274' in submodule path 'libs/align' $ git submodule update tools/litre fatal: reference is not a tree: 564d4d8d30b7e03ac5e25d78e14d2c19fa321c83 Unable to checkout '564d4d8d30b7e03ac5e25d78e14d2c19fa321c83' in submodule path 'tools/litre' According to this: http://stackoverflow.com/questions/13425298/git-submodule-update-fatal-erro… , this is most likely a maintainer's bug. From the above: "This is the most common problem with submodules. The commit that you are on in the outer repository has a reference to a commit in the submodule that someone did not push up yet. It's a dependency problem. Always push from the inside-out. This is most likely not something you did wrong, but someone else that's working in the repository. They were sloppy and forgot to issue push on the submodule and just pushed the containing repository. Stuff works on their machine because they made the change and those commits exist there." Is this true?

3 3

Re: [boost] Finite state machine
by arcolight 07 Sep '14

07 Sep '14

> Are you using Statechart or MSM? > -- Michael Caisse ciere consulting ciere.com I tried to use both. -- arcolight

1 0

Re: [boost] Finite state machine (arcolight)
by arcolight 07 Sep '14

07 Sep '14

> This is something that would be very interesting to me, but I wonder if the > memory allocation can be factored out in the current boost library by using > allocators or something. I'm not terrible familiar with the libraries > internals, but I'd be willing to take a look at my next free cycle. To be > clear, is there another state machine lib in boost besides > boost.statechart? That's the only one I'm familiar with from a user > perspective. > > -Greg Yes, custom allocator doesn't solve the problem, especially because current FSM-s includes many other libraries. In any case, I can't afford to use even custom allocator in my project, if I would use it, I must have sufficient size heap, it's risky in embedded system. I already have third-party code, that uses heap, and I couldn't do anything with it. :) Another FSM implementation - Boost.MSM(Meta state machine), I tried to use it in different ways, but i've failed. MSM based on MPL boost library. If you interested in code, I have small repo on github: https://github.com/arcolight/ecl, there are several small classes, one of them, in fsm.hpp - state machine. There are simple test with cd-player like in boost lib.

1 0

Finite state machine
by arcolight 07 Sep '14

07 Sep '14

Hi all. I have a question about participation in boost libraries. In my embedded project I'm using finite state machine and I tried to use one of the boost implementations of FSM, but they are too big and complex. Main disadvantage of them is usage of dynamic memory allocation, that I can't afford on my CPU and many dependencies, that I can't use on my CPU. CPU is ARM Cortex-M4 with 128K memory, I've no operating system in my project. I have write my own FSM implementation without dynamic memory and dependencies, it's more simple, than boost libraries, but, of course, not so powerful. I've used C++11 standard, specifically variadic templates. My question - Is there some interest in such FSM implementation for boost developers? I'll be very grateful for advice. P.S.: I'm sorry for my english, it's not my native language.

4 3

Autolinking broken in master
by Agustín K-ballo Bergé 06 Sep '14

06 Sep '14

There's a report that autolinking is broken for a fresh recursive checkout of master, due to b2 generating 1.57 libraries while boost/version.hpp still reports the version as 1.56. This commit setting BOOST_VERSION in Jamroot made it to master: https://github.com/boostorg/boost/commit/d9cf98c2074cf8a27017170375c5c825e4… While the corresponding commit for boost/version.hpp didn't: https://github.com/boostorg/config/commit/34e1c7416be2ede7d86f3dcc093a84580… Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

1 0

[iterator] Merge to master
by Andrey Semashev 06 Sep '14

06 Sep '14

Hi, There were lots of changes to Boost.Iterator develop in the last few months. The tests look green for quite some time now. Could these changes be merged to master? I need those changes to merge next/prior in Boost.Utility.

2 1

sqlpp11, 3rd iteration
by Roland Bock 04 Sep '14

04 Sep '14

Dear Boosters, Quite a bit has happened since last I reported about sqlpp11 in this forum [1,2]. I have incorporated a lot of the feedback you gave me, hopefully bringing the library closer to a reviewable state. Source: https://github.com/rbock/sqlpp11 Doku: https://github.com/rbock/sqlpp11/wiki (not at all formal yet) I am hoping for more feedback both here and live at CppCon (http://sched.co/1r4lue3) Here are some noteworthy changes: _Restructuring:_ The code has undergone a major restructuring, leading to a much simpler and thereby much more flexible way to define the structure of SQL statements. As a result, it would now be quite simple to add vendor specific features sqlpp11 connector libraries. Dominique Devienne mentioned array binding for inserts, Johan Baltié mentioned hierarchical searches (both features of Oracle). If you are interested in writing a connector and adding such features, please let me know, I'll walk you through it. _NULL handling:_ Enabled by the restructured code and spurred by the library quince by Michael Shepanski, sqlpp11 can now calculate which result fields can or cannot be NULL. Speaking of which, handling NULL for result values has been discussed a lot. The library now has compile-time configurable behavior, you can choose between an std::optional-like interface and mapping NULL to the trivial value of the result type, e.g. 0 for numbers or "" for strings, see also https://github.com/rbock/sqlpp11/wiki/NULL _Connectors:_ Matthijs wrote a new postgresql connector from scratch, see https://github.com/matthijs/sqlpp11-connector-postgresql The sqlite3 connector received a bunch of corrections, thanks to dirkvdb _Compilers:_ Known to compile with clang>=3.1 and gcc>=4.8. I currently cannot test with MSVC or Intel or others, but if you happen to have the latest top notch version of any of those, I'd be interested in what they have to say about sqlpp11. Cheers, Roland [1]: http://lists.boost.org/Archives/boost/2013/11/208388.php [2]: http://lists.boost.org/Archives/boost/2014/02/211206.php

7 43

[move][unique_ptr] c++14 unique_ptr comes to town
by Ion Gaztañaga 03 Sep '14

03 Sep '14

Hi to all, We've discussed about a boostified version of std::unique_ptr several times in later years. I decided we could not continue with this hole in the Boost toolset and implemented in Boost.Move a unique_ptr that follows the C++14 interface. Commit here: SHA-1: e1da7c5ca1162841f643331af891a9a730eba118 http://github.com/boostorg/move/commit/e1da7c5ca1162841f643331af891a9a730eb… This implementation is also usable from C++03, and apart from the general limitations of the Boost.Move machinery, it should be really uesful for C++03 users. I would like to make this implementation the official boost::unique_ptr implementation, but until the community approves this, it's in boost::movelib namespace (boost::move it's a function so I needed to tweak the namespace name). I would like to thank Howard Hinnant for his great public implementation of the emulated unique_ptr published here: http://home.roadrunner.com/~hinnant/unique_ptr03.html I've ported and refactored Howard's extensive testsuite to implement boost test cases. Really useful to detect many implementation errors and details. I've found unique_ptr much harder to write than I expected. The standard text is really detailed and helps implementors, but things like allowed conversion between pointers and deleters and several ICEs and different SFINAE parties on many compilers made the work quite entertaining. The API is taken from the draft n3797 and the implementation has some differences with the standard. The main reason for this is that I wanted to make unique_ptr as lightweight as possible avoiding external dependencies, as it's interesting to implement idioms like PIMPL. Main attributes and differences with the standard: -> Implemented in two headers: <boost/move/unique_ptr.hpp> and <boost/move/make unique.hpp>. -> <boost/move/unique_ptr.hpp>: Boost.Move is the only heavyweight dependency. Not even that, as unique_ptr.hpp only uses boost/move/utility_core.hpp, that does not depend on any external library excepct BoostConfig and StaticAssert. No TypeTraits, MPL and others. Only Boost.Config, BOOST_STATIC_ASSERT and BOOST_ASSERT are used in the implementation. No standard library headers used (no pointer_traits, memory or other utilities). -> <boost/move/make unique.hpp>: Boost.PP is used in compilers without variadic templates. This is the main reason to have a separate make_unique.hpp header and avoid pulling Boost.PP for c++03 users that only want to have C++11 unique_ptr. -> unique_ptr's "operator <" is implemented as x.get() < y.get() instead of std::less<CT>(). std::less requires <funcional>. std::common_type requires C++11 standard library or some partial emulation based on Boost.TypeOf. I don't think 99,99% of users will notice the difference. For raw pointers, in all our platforms comparisons provide strict weak ordering. If a smart pointer writer specializes std::less for its smart pointer, it should be a law against that. -> It's assignable from literal 0. I found some problems in some compilers trying to write a constructor for that. -> nullptr support is conditional on !defined(BOOST_NO_CXX11_NULLPTR) but I think really should have a Boost nullptr for C++03 compilers. Let's put Meyer's nullptr (http://en.wikibooks.org/wiki/More_C%2B%2B_Idioms/nullptr) in Boost for BOOST_NO_CXX11_NULLPTR compilers. -> unique_ptr<T[]> is convertible to other types when conversion is considered safe. This means that unique_ptr<T[]> is convertible to unique_ptr<const volatile T[]>. Conversion from T[] to U[] is considered safe if remove_cv<T> is the same type as remove_cv<U> and unique_ptr<T[]>::pointer is convertible to unique_ptr<U[]>::pointer. This is a feature that might go to C++17 (http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#2118) Safe conversions in reset() and constructors from pointers are also implemented in unique_ptr<T[]>. I tested the implementation in GCC{4.4, 4.6, 4.7, 4.8} Clang3.4 and MSVC{7.1, 8.0, 9.0, 10.0, 11.0, 12.0} in 32/64 bits, debug/release and C++03/C++11 modes (where applicable). The class documentation is generated with Boost.Move documentation and the most part of it is taken from the standard. I haven't added a tutorial to Boost.Move but I plan to it based on Howard's c++03 unique_ptr tutorial. I hope you find this addition to Boost.Move useful. If you think the implementation is good enough to be the official boost::unique_ptr implementation living in Boost.SmartPtr, porting should be easy, except for the documentation part. That would require either combining somehow handwritten and Quickbook produced documentation or writing new docs for unique_ptr. Best, Ion

6 30

Default documentation settings
by Glen Fernandes 03 Sep '14

03 Sep '14

What is the value of chunk.section.depth used, for those Boost libraries whose documentation is supplied only in QBK form (not the generated HTML from the QBK)? It appears to be 1, i.e. my sections-within-sections are not broken into separate pages. If so, could we make the default <xsl:param>chunk.section.depth=2? Glen

2 4

Can't file issues on trac with Chrome
by legalize+jeeves＠mail.xmission.com 03 Sep '14

03 Sep '14

[Please do not mail me a copy of your followup] Attempting to file a bug report gives me this message: "Captcha Error Submission rejected as potential spam (StopForumSpam says this is spam (username)) Trac thinks your submission might be Spam. To prove otherwise please provide a response to the following." ...but there is no captcha displayed in Chrome. If I attempt again in IE, then the captcha is displayed and I can enter the number and proceed. -- "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>

1 0

[fusion] Help co-maintaining Fusion modules
by Joel de Guzman 03 Sep '14

03 Sep '14

Hi Y'all, I need help in maintaining Fusion modules, especially those that are co-authored by someone else. For example, the Fusion Invoke module was authored by Tobias Schwinger who is unfortunately inactive now. I need help in maintaining the code, for instance, to adapt to C++11 and C++14. Case in point: https://svn.boost.org/trac/boost/ticket/10443 For that matter, I'd also like to take this opportunity to invite folks here to help out in some more aspects of the libraries I am involved with: Spirit, Fusion and Phoenix. If anyone is interested, please email me privately. THANKS! Regards, -- Joel de Guzman http://www.ciere.com http://boost-spirit.com http://www.cycfi.com/

1 0

[spinlock] concurrent_unordered_map is ready for review
by Niall Douglas 02 Sep '14

02 Sep '14

Dear Boost, CC: Howard, Jonathan for N3645 enhancements It has taken me far longer than I expected, however I believe that proposed boost::concurrent_unordered_map is ready for community feedback, with its unit test suite passing all green on the thread sanitiser and 92% coverage including exception safety tests. The main documentation page with the API and a lengthy explanation of the caveats in this design can be viewed at https://ci.nedprod.com/view/Boost%20Thread-Expected-Permit/job/Boost.S pinlock%20Test%20Linux%20GCC%204.8/doxygen/classboost_1_1spinlock_1_1c oncurrent__unordered__map.html Performance improves linearly to CPU cores at a slope of about 0.9. I only have four core hardware available to me, if someone could tell me how it scales to eight cores or more I would be very interested. Source code is at https://github.com/ned14/boost.spinlock. Tested on GCC 4.8, clang 3.4 and VS2013. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

6 13

Unable to find the boost.fsm library and turnstile example
by Aniket Pugaonkar 02 Sep '14

02 Sep '14

Hi, I wanted to implement a simple fsm using boost. i read the boost fsm doc http://boost-extension.redshoelace.com/docs/boost/fsm/doc/state_machine.html http://boost-extension.redshoelace.com/docs/boost/fsm/doc/reference.html but I couldnt locate the header files. Are the fsm library and other template classes located in boost statechart folder ? When I did a find in the subdirectories, I found this: boost version: 1.55 find . -name state_machine.hpp ./boost/msm/back/state_machine.hpp ./boost/spirit/home/support/detail/lexer/state_machine.hpp ./boost/statechart/state_machine.hpp ./libs/mpl/example/fsm/state_machine.hpp (1) Which one should I use to implement a simple FSM? (2) Also I couldnt find the turnstile example which they said is supposed to be in libs/fsm/examples/Turnstile folder. Can anyone please tell me the correct path and location ? [1]: http://boost-extension.redshoelace.com/docs/boost/fsm/doc/state_machine.html Regards Aniket -- Thanks and regards, Aniket Pugaonkar

2 3

Checking interest in DynamicLoad/DLL/DSO/Plugin library
by Antony Polukhin 02 Sep '14

02 Sep '14

Hi, There is a basic implementation of a header only Plugin library: https://github.com/apolukhin/Boost.Plugin Documentation with examples could be found here: http://apolukhin.github.io/Boost.Plugin/index.html Is there an interest in such library in Boost community? What features are missing in the library? Looking forward to hearing from you. Any feedback is more than welcomed. -- Best regards, Antony Polukhin

11 32

Review Wizard Status Report for August 2014
by Ron Garcia 02 Sep '14

02 Sep '14

============================================== Review Wizard Status Report for August 2014 ============================================== News ==== 1. Fiber Accepted Provisionally. January 2014. 2. Align Accepted. April 2014. 3. TypeIndex Accepted. May 2014. 4. Convert Accepted. June 2014. 5. Boost 1.56 Released -- New Libraries: Align, TypeIndex Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been accepted to Boost, but have not yet been integrated into Boost Git: * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to Boost Git, but have not yet appeared in a release: * Convert - accepted June 2014; author: Vladimir Batov. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Fiber - accepted provisionally January 2014; author Oliver Kowalke. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot ubc dot ca" and "johnphillipsithica at gmail dot com" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Boost.Range Extensions * Nowide (M) * Array (M) * STL Extensions (M) * Countertree (M) * Process (M) * Asynchronous File I/O (M) * Application (M) * Edit Distance (M) * Mixin (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Countertree ----------- :Author: Francisco Jose Tapia :Review Manager: Needed :Download: https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip :Description: This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. COUNTERTREE This kind of trees have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. With unordered information we have a vector with the same speed inserting and deleting in any position (O(log N)). With ordered information, we have the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract them. SUBALLOCATOR The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator replace to the allocator in the allocation of equal size elements. It provides speed, return the unused memory and decrease the memory used by the program and improve the cache performance due to the data locality improvement ( 30% of improvement of speed respect the std::allocator with GCC 4.7) Process ------- :Author: Boris Schaeling :Review Manager: Needed :Download: http://www.highscore.de/boost/process0.5/process.zip :Description: Boost.Process is a library to manage system processes. It can be used to: * create child processes * setup streams for child processes * communicate with child processes through streams (synchronously or asynchronously) * wait for processes to exit (synchronously or asynchronously) * terminate processes Asynchronous File I/O --------------------- :Author: Niall Douglas and Paul Kirth :Review Manager: Needed :Download: https://github.com/BoostGSoC/boost.afio/archive/boost-peer-review.tar.gz :Description: Boost.AFIO is a linear scalable, batch, chainable, asynchronous closure execution engine with an almost wait free implementation extending Boost.ASIO and Boost.Thread specialised as a portable asynchronous file i/o implementation library. Implementation of this first version has been kept as simple as possible (~ 1000 active LOC) at the cost of some performance, though with a good compiler you can expect 25-50% of the performance of using raw Boost.ASIO. Application ----------- :Author: Renato Tegon Forti :Review Manager: Needed :Download: https://github.com/retf/Boost.Application :Documentation: http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/index.html :Description: Application provides an application environment, or start point to any people that want a basic infrastructure to build an system application on Windows or Unix Variants (e.g. Linux, MacOS). Application uses behaviours modeled using 'aspects' concept proposed by 'Vicente J. Botet Escriba', that allow easy extension and customization of library components. The application modes uses these components internally to achieve the user desirable behaviours. Application provide many useful ready-to-use features, e.g: * Run application as Windows Service; * Run application as UNIX/POSIX Daemon; * Plugin extension system; * Process(executable) Single instance Instantiation support; * Application SIGNAL/Callbacks customization; * Windows Service Setup feature; * And many others. Edit Distance ------------- :Author: Erik Erlandson :Review Manager: Needed :Download: https://github.com/erikerlandson/algorithm/tree/edit_distance/sequence :Description: The edit distance is the length of the shortest (or least-cost) edit script from one sequence to another, where an edit script is defined as a sequence of insertion, deletion and (optionally) substitution operations. The function implementing the edit distance is named edit_distance. This function will return the edit distance between two sequences, where sequences may be any valid range object supporting forward iteration. The edit_distance function will also, if requested, return the edit script. Mixin ----- :Author: Borislav Stanimirov :Download: https://github.com/iboB/boost.mixin :Documentation: http://ibob.github.io/boost.mixin/ :Review Manager: Needed :Description: Boost.Mixin is a library that allows the composition and modifications of polymorphic types at run time. Types and objects are constructed out of building blocks called mixins. The library uses the type boost::mixin::object as a placeholder, whose instances can be extended with existing classes (mixins), thus providing a particular instance with the functionality of all those types. Accessing the newly formed type's interface is made through messages: stand-alone functions generated by the library, which can be thought of as methods. This is given while also having full abstraction between the interface and the definition of types. An existing feature in another language similar to Boost.Mixin and also an inspiration for the library are the mixins in Ruby. The library also has similarities with the pattern entity-component-system. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

2 3

[quickbook] miss-generated headings?
by John Maddock 01 Sep '14

01 Sep '14

I have a problem with quickbook code that has [h6 ...] elements in it - these end up being larger in both html and pdf output than [h5 ] blocks which is not so good :-( From what I can tell, [h5 ] actually produces html <h6> and [h6 ] produces html <h5>. BTW I realise [h6 ] is a lot of nesting, but the current stylesheet make <h6> quite a bit larger than surrounding text, so <h7> seems to be not beyond the realms of possibility? Thanks, John.

3 2

[build] b2 headers don't work for sublibs
by Andrey Semashev 01 Sep '14

01 Sep '14

Hi, I'm trying to move some headers of Boost.MPL to a sublib Boost.MPL.Core. I've reorganized the repository as follows: libs mpl book core include boost <- here and below are core headers test index.html doc example include boost <- here and below are the rest headers meta preprocessed test .git .gitattributes README.md index.html sublibs The problem is when I run 'b2 headers' the command creates a symlink boost/mpl pointing to libs/mpl/include/boost/mpl, which leaves out all headers from libs/mpl/core/include/boost/mpl. How do I instruct Boost.Build to create links to the core headers?

6 12

Re: [boost] [graph] strong_components & depth_first_visit feature proposal
by Jeremiah Willcock 31 Aug '14

31 Aug '14

On Wed, Aug 27, 2014 2:39 AM EDT Alexander Lauser wrote: >> * Another minor question: Why are not all events of a >> DFS-visitor optional (like finish_edge is)? I think this would make >> implementing a partial DFS-visitors easier (by not having to derive from >> dfs_visitor in order to provide events that one is not interested in). >> >> Have you tried deriving from default_dfs_visitor? > >Yes, but why only make finish_edge optional? I think it would make >user-code (slightly) clearer if all events were optional. It's no big >deal, of course, and that's why it's a minor question. > >Alex > > >PS: For the background, I'm quite new to Boost and for me it is somewhat >arbitrary that everything is mandatory but finish_edge. The reason, >however, seems to be historical: I recently saw that, at least in Boost >version <= 1.39, there was no finish_edge-event. That is why it is (or at least is trying to be) optional. Visitors from before that event was added would become incorrect if it was not optional, leading to compatibility problems. Making all of the events optional would be possible as long as Boost.TTI could detect all of the signatures that are in use for them currently. -- Jeremiah Willcock

2 1

[vmd] Library review
by Matt Calabrese 31 Aug '14

31 Aug '14

Design: As a set of utility macros, there is not too much to be said. The macros that are presented are generally useful and fill some needs that are encountered when doing preprocessor metaprogramming. Implementation: I admittedly haven't examined the implementation itself too closely, but I have used the library in practice with both clang and gcc without problems on a considerably large preprocessor project (~50k lines preprocessor programming), albeit a few years ago. Documentation: I read through the entirety of the documentation and it is fairly good at describing some of the problems faced when doing preprocessor metaprogramming, such as the lack of truly being able to detect emptiness and the implementation weaknesses of certain non-compliant preprocessors. That said, I feel like it focuses a lot on the hairiness of the preprocessor and not enough on the functionality that the library itself provides. For example, the tuple-related macros (being able to deal with something that is a tuple with more tokens after the tuple, for instance) are very useful in preprocessor metaprogramming, but the documentation doesn't do much to explain why. As well, while what to expect from expansion of the macros is described, examples are absent. To be more specific, take these two bits of the documentation: BOOST_VMD_BEGIN_TUPLE http://htmlpreview.github.io/?https://raw.githubusercontent.com/eldiener/va… BOOST_VMD_AFTER_TUPLE http://htmlpreview.github.io/?https://raw.githubusercontent.com/eldiener/va… Although the macros are described, a set of examples could go a long way. For instance something as simple as the following can go quite a long way: BOOST_VMD_AFTER_TUPLE( (int a, float b, char c) const ) // yields: const The above both more directly shows what you can expect from the macro and also may better explain the usefulness. To people experienced with [ab]using the preprocessor, why you want to use these macros is often obvious, but most people are not very familiar with preprocessor metaprogramming and I think the docs sort of need to be aware of that. Examples and a motivation explaining why the particular set of macros provided is important. Perhaps what might be best is to start the documentation with a tutorial that takes the user through the uses that come up in practice when I.E. designing a simple EDSL through preprocessor metaprogramming. Usage: Years ago I used the VMD library when developing [not a boost lib] Boost.Generic. Prior to VMD being around, I had hand-rolled much of the functionality into Boost.Generic that VMD provides, though I very quickly stopped caring about VC++ support. When VMD was in the boost sandbox, I swapped out everything I could with invocations to VMD's macros and it freed me of the maintenance burden of trying to support noncompliant compilers. Needless to say, VMD "just worked" and I find it likely that other people who use the preprocessor in these ways would find VMD just as useful as I have. For my project I was testing with both GCC and Clang and had no problems with anything that VMD provided. Domain familiarity: I've done an embarrassingly large amount of preprocessor metaprogramming and, again, I find this library useful. ===== Overall, I'd say that this library should make it into boost. The biggest thing that it lacks is motivation in documentation, lack of examples, and a practical tutorial, but these should be able to be added before the library would make it into a release. Other than that, I do think there might be some way to roll this into Boost.Preprocessor, but I have no strong feelings on the matter and it's really up to Paul. So this a +1 from me, as long as the documentation gets some improvement. -- -Matt Calabrese

2 1

[conceptcheck] Document using namespace boost.
by Mostafa 31 Aug '14

31 Aug '14

I'm not unfamiliar with Boost.ConceptCheck, though I've used it very infrequently. So, like all familiar but infrequently used libraries I skip to the examples to jog my memory as to their usage. Invariably, if the examples or the tutorial are not complete then I end up repeating past mistakes. This is the case with Boost.ConceptCheck library. All the examples on this page: http://www.boost.org/doc/libs/1_56_0/libs/concept_check/using_concept_check… (which is the quick 5 minute introduction on how to use ConceptCheck) assume some previous "using namespace boost;" declaration, yet that is not documented on that particular page or any previous page. Can this be fixed to save new and infrequent users of the library unneeded head-scratching and wasted time? (I can open a trac ticket if that helps.) Thanks.

1 0

[config] BOOST_NO_CXX11_HDR_FUNCTIONAL and VC++10
by Edward Diener 31 Aug '14

31 Aug '14

While BOOST_NO_CXX11_HDR_FUNCTIONAL is not defined for VC++10 my tests show that std::ref in VC++10 is broken in a very simple case. Here is the code for that case: // test_vc10_refwrapper.cpp #include <functional> class p_functor_class_char { public: p_functor_class_char() : data('A') {} char operator()() { return data; } private: char data; }; void main() { p_functor_class_char pfcc; std::function<char ()> sf(std::ref(pfcc)); } which for VC++10 gives: > c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\INCLUDE\xxcallobj(13) : error C2440: 'return' : cannot convert from 'void' to 'char' > Expressions of type void cannot be converted to other types > c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\INCLUDE\xxfunction(65) : see reference to function template instantiation '_Ret std::tr1::_Callable_obj<_Ty>::_ApplyX<_Rx>(void)' being compiled > with > [ > _Ret=char, > _Ty=std::tr1::reference_wrapper<p_functor_class_char>, > _Rx=char > ] > c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\INCLUDE\xxfunction(64) : while compiling class template member function 'char std::tr1::_Impl_no_alloc0<_Callable,_Rx>::_Do_call(void)' > with > [ > _Callable=_MyWrapper, > _Rx=char > ] > c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\INCLUDE\xxfunction(386) : see reference to class template instantiation 'std::tr1::_Impl_no_alloc0<_Callable,_Rx>' being compiled > with > [ > _Callable=_MyWrapper, > _Rx=char > ] > c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\INCLUDE\xxfunction(369) : see reference to function template instantiation 'void std::tr1::_Function_impl0<_Ret>::_Reset0o<_Myimpl,_Fty,std::allocator<_Ty>>(_Fty,_Alloc)' being compiled > with > [ > _Ret=char, > _Fty=std::tr1::reference_wrapper<p_functor_class_char>, > _Ty=std::tr1::_Function_impl0<char>, > _Alloc=std::allocator<std::tr1::_Function_impl0<char>> > ] > c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\INCLUDE\functional(126) : see reference to function template instantiation 'void std::tr1::_Function_impl0<_Ret>::_Reset<std::tr1::reference_wrapper<_Ty>>(_Fty)' being compiled > with > [ > _Ret=char, > _Ty=p_functor_class_char, > _Fty=std::tr1::reference_wrapper<p_functor_class_char> > ] > test_vc10_refwrapper.cpp(15) : see reference to function template instantiation 'std::tr1::function<_Fty>::function<p_functor_class_char>(std::tr1::reference_wrapper<_Ty>)' being compiled > with > [ > _Fty=char (void), > _Ty=p_functor_class_char > ] With VC++11 and VC++12 this has been fixed. Using boost::function and boost::ref there are no problems in VC++10. I realize that this might not really be an issue in Boost but I was still wondering if this is a known problem with any Boost developers. I ran into it during tests, where I was letting BOOST_NO_CXX11_HDR_FUNCTIONAL determine whether to use std or boost versions of the functionality in the C++11 <functional> header.

1 0

[review] [vmd] Last day of review period - reviewers needed
by Steven Watanabe 30 Aug '14

30 Aug '14

AMDG The limited amount of feedback has been generally positive, but I haven't seen any full reviews, yet. If anyone is planning to review the library, please let me know. In Christ, Steven Watanabe

3 2

Trac getting spammed
by John Maddock 30 Aug '14

30 Aug '14

We seem to be getting more than the usual amount of spam on the Trac recently, I've deleted quite a few, but I bet there are others I haven't seen. Latest is https://svn.boost.org/trac/boost/ticket/10358 Anyone any ideas for blocking these guys? Thanks, John.

9 13

Problem with BOOST_NO_CXX11_VARIADIC_TEMPLATES in gcc.hpp
by Richard Hadsell 30 Aug '14

30 Aug '14

I think I found a problem in config/compiler/gcc.hpp in Boost 1.56.0. I was trying to come up with a workaround for a bug having to do with variadic templates, when compiling with g++ 4.5.1 (on Linux Fedora 14). Modifying line 160 to turn on BOOST_NO_CXX11_VARIADIC_TEMPLATES for g++ versions earlier than 4.7 had not effect. I discovered that the version test in line 160 has no effect, because it is in a block (lines 153-164) that only pertains to g++ 4.2 or earlier, if compiled with -std=c++0x. The block for versions 4.3 and later (lines 145-151) always define BOOST_HAS_VARIADIC_TMPL and never BOOST_NO_CXX11_VARIADIC_TEMPLATES. I think that is a mistake, at least partially, because proposal N2555 is only supported in version 4.4. At any rate, someone should look at these lines and make some sense of them. The GCC support table shows general support for variadic templates in 4.3 and support for N2555 (with a long name) in 4.4. Furthermore, the bug that produces a message like this: "sorry, unimplemented: cannot expand 'Args ...' into a fixed-length argument list" was only fixed in g++ 4.7.0 (according to a bug report). That issue could also use a guard macro, as was done in one of the boost libraries ( BOOST_CONTAINER_UNIMPLEMENTED_PACK_EXPANSION_TO_FIXED_LIST). -- Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studioshttp://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560

4 8

[exception] Demangling support not merged to master?
by Andrey Semashev 30 Aug '14

30 Aug '14

Hi, Sadly, I discovered that the support for type name demangling in Boost.Exception did not make it into 1.56. It's still not merged to master. The tests look green, could this change be merged to master?

2 3

[move] boost::move incorrect documentation?
by Mostafa 30 Aug '14

30 Aug '14

Here http://www.boost.org/doc/libs/1_56_0/doc/html/boost/move_idp159681920.html it states: "This function provides a way to convert a reference into a rvalue reference in compilers with rvalue references. For other compilers converts T & into ::boost::rv<T> & so that move emulation is activated." But in <boost/move/utility.hpp> I see: template <class T> inline typename ::boost::move_detail::enable_if_c < enable_move_utility_emulation<T>::value && !has_move_emulation_enabled<T>::value, T&>::type move(T& x) { return x; } Therefore shouldn't the above be: "This function provides a way to convert a reference into a rvalue reference in compilers with rvalue references. For other compilers if T is Boost.Move enabled type then it converts T & into ::boost::rv<T> & so that move emulation is activated, else it returns T &."

2 1

Boost Build and -Wall
by Emil Dotchevski 29 Aug '14

29 Aug '14

I see that in Boost Build <warnings>on translates to -Wall. What value do I specify for <warnings> to get the compiler-default warnings level? -- Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

3 4

Boost Build Qt5 support on MACOSX?
by Emil Dotchevski 29 Aug '14

29 Aug '14

Hello, I downloaded Qt and installed it into its default location on mac os x, then tried to initialize it with: using qt5 : /users/<user_name>/Qt/5.3/clang_64 ; I don't know if the above is the correct way to initialize the qt5 support, but I get bad include directories, e.g. #include <QtGui/QWindow> won't work. Searching the Qt directories reveals that the file QWindow is found under Qt/5.3/clang_64/lib/QtGui.framework/Versions/5/Headers. So what is the right way to do this? -- Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

1 0

[units] Interest in UDLs (e.g. _kg) for units?
by Curdeius Curdeius 28 Aug '14

28 Aug '14

Hi all, I was wondering if there is any interest in adding User-Defined Literals (UDLs) to Boost.Units. IMO, it could simplify some code and improve code readability in some cases. For example instead of writing (it's a somehow artificial example) 5.34 * si::milli * si::kilogram; 1234 * si::kilogram; one would write 5.34_g; 1234_kg; I propose to add this feature for compatible compilers (where BOOST_NO_CXX11_USER_DEFINED_LITERALS is not defined). The user would have to pull corresponding namespace (let's call it `udl`) to use it, for example using namespace boost::units::systems::si::udl; // bring _kg, _km, ... into scope What are your feelings about it? In the first place, I would go for `operator ""` taking as arguments `unsigned long long` and `long double`. Later, one could think about the one taking a `const char *` argument which would provide a quantity with an underlying type of arbitrary precision (like boost::multiprecision::cpp_int). Regards, Marek Kurdej -- Ph.D. candidate

5 5

Re: [boost] [units] Interest in UDLs (e.g. _kg) for units?
by Marek Kurdej 28 Aug '14

28 Aug '14

Looks much nicer! > Will reduce the user resistance to using Boost.Units - it's a bit verbose > for mere engineers and scientist's taste ;-) > But have you implemented it yet? > (and are there any hidden gotchas? - the proposed C++ time literals > suffixes proved to be a can of worms :-( > Paul I have a partial implementation for mass and length units. You can have a look at it : https://github.com/mkurdej/units/tree/feature/user-defined-literals You guess right, there are some problems to solve with output of quantities created with literals. See lines with FIXME in test/test_literals.cpp For those who were sceptic about "megagrams" and so on: that was just an example. Actually, I implemented tonnes (t), kilotonnes (kt), Gt and so on. Still, someone could possibly use Mg, Gg for uniformity... (but I haven't found such a person yet). Marek Kurdej -- Ph.D. candidate

1 0