- Boost - lists.preview.boost.org

Re: [boost] DCVS vs CVS: call for constructivism
by Gottlob Frege 23 Mar '12

23 Mar '12

I have a question for the git (or hg) people. Maybe the concrete situation will shed some light on some of the issues (or maybe I'll just get some help and stop pulling what's left of my hair out). I'm working on code.cpp and morecode.cpp. At the same time, I am writing scripts like review.sh (makes git work better with code collaborator) and, say, custom_make.bat. I am going back and forth on these as needed. In particular, as the cpp files get in shape I commit, and maybe post something for review. We leads me to change review.sh. Or as I get things working, I modify custom_build.bat. To me, once done, these are separate commits/branches/features/changelists (whatever you want to call them). But while working on them, I don't want to flip between branches - I find I'm always changing something in the wrong branch when I try separate branches. ie I change code.cpp while in the "scripts" branch. And it is often more than 2 things I am working on. And sometimes (not usually) they are at least somewhat related - ie code.cpp depends on yourstuff.h, and I need to make a small fix in yourstuff.h. In the end, that fix will be separate, but until i know it is correct, it tends to stay mixed with my other work. Now maybe the dependency case is different, I don't know. (obviously at the end of the day, the order of dependent changes needs to be pushed correctly). So basically, in something like perforce, I can group the files into changelists, and then forget about it until something is completely done and ready to commit. I understand I'm losing other features (small commits, being able to easily set it all aside, etc), but this is my common workflow. Should I do everything on a messy "work" branch and just sort it out when I am ready to push? Should I keep the features in separate branches, but pull from branch to branch all the time? (I don't think I want to spend that much time with the RCS. I like forgetting about it most of the time.) Am I just doing it wrong? (And did any of this make any sense?) Tony Sent from my portable Analytical Engine

5 4

[typeof] MSVC errors on PGI?
by lcaminiti 23 Mar '12

23 Mar '12

Hello all, I'm getting compiler errors when using Boost.Typeof on PGI (plus these errors seems to be from Boost.Typeof for MSVC?). It's the first time I try to use PGI... what am I doing wrong? // File: 01.cpp #include <boost/typeof/typeof.hpp> int main() { int x = 0; BOOST_TYPEOF(x) y = x; return y; } $ pgcpp -I ../../.. 01.cpp "../../../boost/typeof/msvc/typeof_impl.hpp", line 150: error: class "boost::type_of::msvc_extract_type<ID>::id2type [with ID=ID]" cannot be defined in the current scope struct base_type::id2type // This uses nice VC6.5 and VC7.1 bugfeature ^ "../../../boost/typeof/msvc/typeof_impl.hpp", line 160: error: incomplete type is not allowed typedef typename id2type::type type; ^ detected during instantiation of class "boost::type_of::msvc_typeid_wrapper<ID> [with ID=5]" at line 6 of "01.cpp" 2 errors detected in the compilation of "01.cpp". BTW, I'm trying to use PGI to get ScopeExit regression tests to all pass on this compiler. PGI users-- any help is welcome! --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-typeof-MSVC-errors-on-PGI-tp449921… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

René Eng möchte chatten
by René Eng 23 Mar '12

23 Mar '12

----------------------------------------------------------------------- René Eng möchte einige der neuen Google-Produkte verwenden, um mit Ihnen besser in Kontakt zu bleiben. Wenn Sie schon Google Mail oder Google Talk verwenden, besuchen Sie: http://mail.google.com/mail/b-4122791ae-68c38cb068-RejaciDzcqGQypwAD-y35NwA… Klicken Sie auf diesen Link, um mit René Eng chatten zu können. Um Google Mail - ein kostenloses E-Mail-Konto von Google mit mehr als 2800 Megabyte Speicherplatz - zu erhalten und mit René Eng zu chatten, besuchen Sie: http://mail.google.com/mail/a-4122791ae-68c38cb068-RejaciDzcqGQypwAD-y35NwA… Google Mail bietet: - Instant Messaging direkt in Google Mail - Leistungsstarken Spamschutz - Integrierte Suche nach E-Mails und praktische Möglichkeiten, E-Mails in "Konversationen" zu ordnen - Keine Pop-up-Anzeigen oder nicht zielgerichtete Banner - nur Textanzeigen und Informationen, die für den Inhalt Ihrer E-Mails relevant sind Alle diese Funktionen erhalten Sie kostenlos. Aber das ist noch nicht alles! Wenn Sie sich für ein Google Mail-Konto registrieren, erhalten Sie auch Zugriff auf Google Talk, den Instant Messaging-Dienst von: http://www.google.com/talk/intl/de/ Google Talk bietet: - Einen webbasierten Chat, den Sie überall verwenden können, ohne dass ein Download erforderlich ist - Eine mit Ihrem Google Mail-Konto synchronisierte Kontaktliste - Kostenlose, qualitativ hochwertige Sprachanrufe von Computer zu Computer, wenn Sie den Google Talk-Client herunterladen Von Zeit zu Zeit fügen wir immer wieder neue Funktionen zu Google Talk hinzu und nehmen weitere Verbesserungen vor, weshalb wir Sie möglicherweise regelmäßig um Kommentare und Vorschläge bitten. Wir danken Ihnen für Ihre Hilfe bei der Optimierung unserer Produkte! Vielen Dank! Ihr Google Team Weitere Informationen zu Google Mail und Google Talk erhalten Sie unter: http://mail.google.com/mail/help/intl/de/about.html http://www.google.com/talk/intl/de/about.html Wenn das Klicken auf die URLs in dieser E-Mail nicht funktioniert, kopieren Sie sie und fügen Sie sie in die Adressleiste Ihres Browsers ein.

1 0

Looking for some "real world" extended precision integer arithmetic tests
by John Maddock 23 Mar '12

23 Mar '12

Folks, I'm continuing to add to the multiprecision arithmetic library in the sandbox (under "big_number"), and I've just added a Boost licensed fixed-precision integer type which on Win32 at least looks to be very competitive with GMP for reasonable numbers of bits (up to about 1024), see http://svn.boost.org/svn/boost/sandbox/big_number/libs/multiprecision/doc/h… However, as we all know there are lies damn lies and performance stats ;-) Plus the test results I have above ignore the effect of memory allocations (needed by libtommath and GMP, but not the fixed_int code - which in theory should make it faster still). So I'd be really interested to put the type through it's paces with some real world code that really thrashes an extended precision integer type. Any suggestions? Anything in Boost? Thanks in advance, John.

5 38

[Context] Compile Broken for MSVC under x64 (r77477 Trunk)
by Joshua Boyce 23 Mar '12

23 Mar '12

r77477 has broken compilation of Boost.Context on trunk for me when using MSVC and targeting x64 (it spits out a "platform not supported" error). I believe this is because MSVC does not define any of the preprocessor directives that are being checked now (instead of _WIN64). I believe the fix for this is to check _M_AMD64 and/or _M_X64. http://msdn.microsoft.com/en-us/library/b0084kay(v=vs.110).aspx _M_X64: Defined for x64 processors. _M_AMD64: Defined for x64 processors. This patch fixes the issue for me: http://dl.dropbox.com/u/74751/cpp/boost/patches/context-msvc-x64-fix-201203… Thanks.

1 0

[algorithm] aesthetic question about cxx11
by lcaminiti 22 Mar '12

22 Mar '12

Hello all, I have an aesthetic question. Boost.Algorithm puts C++11 algorithms like all_of into a directory boost/algorithm/cxx11. Would the directory name boost/algorithm/cpp11 be preferred? I think for file names .cpp and .hpp are Boost choice over .cxx and .hxx. But for directory names instead cxx11 is Boost choice over cpp11? Similarly, shall macros that refer to C++11 be named BOOST_..._CPP11_... or BOOST_..._CXX11_...? In general, shall Boost refer to C++11 as cpp11/CPP11 or cxx11/CXX11? Given that .cpp/.hpp is Boost choice for file names over .cxx/.hxx, I'd think cpp11/CPP11 would be Boost choice over cxx11/CXX11... P.S. I have a similar situation in Boost.Contract where I want to put macros to parse C++11 keywords (override, final, etc) in a separated directory and I want to name that directory cxx11 or cpp11 consistently with other Boost libraries (so users don't have to remember different conventions). Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-algorithm-aesthetic-question-about… Sent from the Boost - Dev mailing list archive at Nabble.com.

10 21

[config] local types as template params
by Lorenzo Caminiti 22 Mar '12

22 Mar '12

Hello all, Is it possible to add a macro BOOST_CONFIG_LOCAL_TYPES_AS_TEMPLATE_PARAMS to Boost.Config to indicate if local types can be passed as template parameters? 1) Boost.Closure (formerly, Boost.Local) implements some optimizations when local types can be passed as template parameters. 2) C++11 always allows to pass local types as template parameters. 3) Local types cannot be passed as template parameters on C++03 instead but some C++03 compilers MSVC 8 (and older?) allow it anyway. // If it is possible to pass local types (classes, etc) as template parameters. // This is not possible in pure C++03 but it is possible in some C++03 // extensions (MSVC 8.0) and with C++11 (GCC >= 4.5.x -std=c++0x). #if (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 4)) && \ defined(__GXX_EXPERIMENTAL_CXX0X__) // From GCC 4.5.x when -std=c++0x specified. # define BOOST_LOCAL_TYPES_AS_TEMPLATE_PARAMS #elif defined(_MSC_VER) // For (all?) MSVC (tested on MVSC 8.0). # define BOOST_LOCAL_TYPES_AS_TEMPLATE_PARAMS #endif All, can you please try to compile the following example on different compilers/versions and let me know the outcome? If this example compiles successfully then the specific compiler supports local types as template parameters: #include <algorithm> #include <iostream> int main() { struct s { void operator()(int x) { std::cout << x << std::endl; } } l; int nums[] = {1, 2, 3}; std::for_each(nums, nums + 3, l); return 0; } For example, this compiles on GCC >= 4.5.x w/ C++0x extensions enabled and on MSVC 8.0- does it compile on all MSVC versions? Thanks. --Lorenzo

8 12

[config] missing BOOST_HAS_STDINT_H for PGI
by Oliver Kowalke 22 Mar '12

22 Mar '12

ticket: 6724 boost/config/compilers/pgi.h does not define BOOST_HAS_STDINT_H -> boost/cstdint.hpp does not include stdint.h Oliver

2 1

Re: [boost] [git] Mercurial?
by Jason Harris 22 Mar '12

22 Mar '12

> >>>>> Dave Abrahams <dave <at> boostpro.com> writes: > > > More attention from the community, more support, more tools work with it, > > more money behind it, more people will be familiar with it in the long run, > > etc., etc. > > Example: compare the number of commercial tools for working with Git, compared > to those available for working with Mercurial. On OS X along I can use: > SourceTree, Tower, GitHub, GitBox, GitDiary, QuickHub, Octopus, and that's > only the commercial tools! > > By contrast, if I search for "mercurial" in the AppStore, I can only use > SourceTree (which works with both). > Well, I am the author of MacHg a very fully featured multithreaded osx client for mercurial. There was murky and a few other clients around for OSX. But for now the scene seems to have settled into MacHg and SourceTree. I would also point out that I think the kiln team will soon have a nice port of TortiseHg to OSX. A partial listing of general tools is here: http://mercurial.selenic.com/wiki/OtherTools (Note I have not put MacHg on the AppStore since it is a bit of a pain trying to sand box the thing. I think Neil (the author of SourceTree) complained about the fact that he could not include compiled python file etc, in the app store version. Also a good GUI should have some command line drivers. Eg from the command line you should be able to enter "machg somerepo" and have it open in MacHg or something similar. (This has been on my to-do list for quite some time.) And such tools contravene the AppStore guidelines. Eg BBedit had to remove such tools from their application in order to get it onto the AppStore. Eg see http://www.barebones.com/store/macappstore.html and the section about the limitations of the AppStore version.)) I would think most developers would not be strictly limited to the AppStore version and a simple google of "OSX mercurial" will turn up MacHg... As to the whole discussion of Mercurial vs Git. I really have to say that both products are quite similar now in what they can do. However, the learning curve for me for git is just not good. Eg just for some simple comparisons do a: [salt:~] ⌘ hg help pull | wc 40 264 1753 [salt:~] ⌘ git help pull | wc 638 3624 29834 These are basically the same commands. Yet, the size of the help entry for pull for mercurial is 6% of the size of the git help entry. That says a lot about the understandability of one system to the other. (cf the size difference for other commands like pull, log, status, etc.) Git has **soo** many bells and whistles. Every so often as a real DVCS ninja git has something that mercurial doesn't have in my experience. Eg there is a feature in git when you are doing a total conversion of a repository you can run a filter over all of the files as you go. (eg imagine you want to convert all of say windows newlines to unix newlines in every version stored in history, or some other repetitive thing like this.) Up until a little while ago Mercurial didn't have that feature. So on the extreme cases there are definitely bits to git where git has more options. However these extra command switches in git are definitely a very sharp double edged sword in that for the average user the number of git options is just insanely huge. Thus I think the mercurial philosophy of trying to keep things clean, organized, and coherent is much better for at least 90% of users if not more like 98% of users. I am sure that each of you and each of your colleagues are gurus in a number of things, but do you want to require that they are gurus in DVCS systems? Even in Mercurial a lot of the users I encounter are sometimes woefully clued in to what is going on, and Mercurial is more streamlined, and cleanly organized than git (in my humble personal experience.) And it isn't all a bed of roses in Mercurial either. Eg there are things one should really watch out for, for example in using sub-repositories (these parallel sub-modules in git) one should use a thin super-repo layer. We got bitten by this at our work and it has caused problems. See eg http://mercurial.selenic.com/wiki/Subrepository#Recommendations Other points to consider: Those people who think you can't edit history in Mercurial or have many "branches" within a repo, their information is years out of date... I edit history and rebase, etc all of the time. It is part of my standard work flows. The arguments about popularity might have some weight but I think Mercurial and Git are definitely both large enough and will stick around. Besides converting one repo to the other in case one disappears is not that difficult. There are tools which interoperate between both formats (se hg-git.) Also, being a GUI writer I would say the number of differences once you are using a GUI is even smaller in day to day usage once you know what is going on. One, difference is with git you have to be careful to name *everything* or you get "detached heads". In mercurial you don't have to worry about this at all. You can happily update to any revision and start working right there without having to remember to name it / think up a name for it. (However, there are certain advantages to naming everything since then you can track revisions across all sorts of history edits, where-as in Mercurial you have to do some of this tracking manually...) (As a GUI writer I have thought about making the changes to MacHg to be able to release MacGit, but ever time I start playing with git it just... I don't know... I can go into details but the details would likely not be relevant here...) In any case, I use boost in my projects and think it's fantastic! Whether you all end up choosing git or hg a DVCS IMHO is much better than a centralized VCS. (However, I haven't used svn extensively since the company I worked for has skipped directly from cvs to mercurial & git.) Also whether you choose hg or git you might want to have an official mirror in the other system... So users can just use the system they want to. Best of luck, Jason

1 0

[accumulator] Problem with 'droppable_accumulator.hpp' (rev. 77432)
by sguazt 21 Mar '12

21 Mar '12

Hello, I have a problem when compiling with the current trunk version (rev. 77432) of Boost.Accumulator: In file included from projects/boost-trunk/boost/accumulators/framework/accumulator_set.hpp:28:0, from projects/boost-trunk/boost/accumulators/accumulators.hpp:12, ... projects/boost-trunk/boost/accumulators/framework/accumulators/droppable_accumulator.hpp: In copy constructor 'boost::accumulators::droppable_accumulator<Accumulator>::droppable_accumulator(const boost::accumulators::droppable_accumulator<Accumulator>&)': projects/boost-trunk/boost/accumulators/framework/accumulators/droppable_accumulator.hpp:173:54: error: expected type-specifier projects/boost-trunk/boost/accumulators/framework/accumulators/droppable_accumulator.hpp:173:54: error: expected '>' projects/boost-trunk/boost/accumulators/framework/accumulators/droppable_accumulator.hpp:173:54: error: expected '(' projects/boost-trunk/boost/accumulators/framework/accumulators/droppable_accumulator.hpp:173:82: error: expected ')' before 'const' My system is: OS: Fedora 14 x86_64 Compiler: GCC 4.6.1 Compiler's Flags: --ansi -pedantic -Wall -Wextra I think you need to change line 173: : droppable_accumulator::base(*static_cast<droppable_accumulator::base const *>(&that)) with the following (note the addition of "typename") : droppable_accumulator::base(*static_cast<typename droppable_accumulator::base const *>(&that)) After this addition all seems to work. Could you fix it, please? Thank you very much. Best, -- Marco

2 2

Please advise: Boost with LLVM Clang and 0x11 dialect ?
by John M. Dlugosz 21 Mar '12

21 Mar '12

Can someone please advise on how to get Boost headers to work when compiling using Clang (as found on Apple OSX/iOS development) when the 0x11 dialect is enabled? We're stuck at Boost 1.47 because 1.48 doesn't even work with the current settings (C++03 dialect). The Mac developers don't want to fiddle with 1.49 without knowing what the deal is. Is there someone who has used Boost on the Apple with Clang who can relate some tales of how it works and offer suggestions? I've had no luck on the Boost.Users mailing list, or a previous post here on Boost.Devel. Is there anyplace else I might ask? At this point, any scrap of wisdom would be appreciated. —John

2 1

Graph properties and GraphML
by Arthur Castonguay 21 Mar '12

21 Mar '12

I'm using 1.49.0 and am attempting to read a GraphML file that has graph attributes on it (example file below). My test program is below too. I've run into two issues. 1. The GraphML reader didn't quite handle them. There was some facilities put in place but it was never glued together. I added some code (patch below) and now it appears that that will do what I want... I'm getting "property not found" exception now. Great... onto item 2. 2. I cannot seem to wire the graph property into the dynamic properties. I've used the same syntax used for node and edge properties: props.property("gattr", get(&GraphProperty::gattr, g)); I've search examples and cannot find an instance of this to see if graph properties are handled differently. It's possible I've just written bad code for #2. I'm still working through the adjacency_list code to see if I can grok what's going on. Figured maybe someone more familiar with this could find the issue quickly. Once functionaly, I'll report a bug regarding item #1 but I want to ensure the writing of the GraphML works as well before doing that (the code appears to write graph attributes.. can't test yet due to item #2). For those that don't want to bother, this is the compile error I'm getting: boost/graph/adjacency_list.hpp: In function ‘typename boost::property_map<boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>, T Bundle::*>::type boost::get(T Bundle::*, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&) [with OutEdgeListS = boost::vecS, VertexListS = boost::vecS, DirectedS = boost::bidirectionalS, VertexProperty = NodeProperty, EdgeProperty = EdgeProperty, GraphProperty = GraphProperty, EdgeListS = boost::listS, T = std::string, Bundle = GraphProperty]’: ex.cpp:37: instantiated from here boost/boost/graph/adjacency_list.hpp:561: error: no matching function for call to ‘boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, NodeProperty, EdgeProperty, GraphProperty, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, EdgeProperty, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >::bundle_property_map(boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, NodeProperty, EdgeProperty, GraphProperty, boost::listS>*, std::string GraphProperty::*&)’ boost/boost/graph/properties.hpp:397: note: candidates are: boost::bundle_property_map<Graph, Descriptor, Bundle, T>::bundle_property_map(Graph*, T Bundle::*) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, NodeProperty, EdgeProperty, GraphProperty, boost::listS>, Descriptor = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, Bundle = EdgeProperty, T = std::basic_string<char, std::char_traits<char>, std::allocator<char> >] boost/boost/graph/properties.hpp:396: note: boost::bundle_property_map<Graph, Descriptor, Bundle, T>::bundle_property_map() [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, NodeProperty, EdgeProperty, GraphProperty, boost::listS>, Descriptor = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, Bundle = EdgeProperty, T = std::basic_string<char, std::char_traits<char>, std::allocator<char> >] boost/boost/graph/properties.hpp:390: note: boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, NodeProperty, EdgeProperty, GraphProperty, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, EdgeProperty, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >::bundle_property_map(const boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, NodeProperty, EdgeProperty, GraphProperty, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, EdgeProperty, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >&) Here's my compiler version: $ cc --version i686-apple-darwin11-llvm-gcc-4.2 (GCC) 4.2.1 (Based on Apple Inc. build 5658) (LLVM build 2336.1.00) Copyright (C) 2007 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Any ideas? Is item #2 a bug or dumbass programmer (aka me)? Regards, Arthur --- 8< Start ex.graphml 8< --- <?xml version="1.0" encoding="UTF-8"?> <graphml xmlns="http://graphml.graphdrawing.org/xmlns" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://graphml.graphdrawing.org/xmlns http://graphml.graphdrawing.org/xmlns/1.0/graphml.xsd"> <key id="key0" for="graph" attr.name="gattr" attr.type="string"/> <key id="key1" for="node" attr.name="nattr" attr.type="string"/> <key id="key2" for="edge" attr.name="eattr" attr.type="string"/> <graph id="G" edgedefault="directed"> <data key="key0">graphval</data> <node id="n0"> <data key="key1">nodeval0</data> </node> <node id="n1"> <data key="key1">nodeval1</data> </node> <edge source="n0" target="n1"> <data key="key2">edgeval</data> </edge> </graph> </graphml> --- 8< End ex.graphml 8< --- --- 8< Start ex.cpp 8< --- #include <iostream> #include <string> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphml.hpp> #include <boost/property_map/dynamic_property_map.hpp> struct GraphProperty { std::string gattr; }; struct NodeProperty { std::string nattr; }; struct EdgeProperty { std::string eattr; }; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, NodeProperty, EdgeProperty, GraphProperty> Graph; using namespace std; using namespace boost; int main() { Graph g; dynamic_properties props; props.property("nattr", get(&NodeProperty::nattr, g)); props.property("eattr", get(&EdgeProperty::eattr, g)); props.property("gattr", get(&GraphProperty::gattr, g)); // Fails to compile try { read_graphml(cin, g, props); write_graphml(cout, g, props); } catch (parse_error e) { cerr << e.what() << endl; } catch (bad_parallel_edge e) { cerr << e.what() << endl; } catch (directed_graph_error e) { cerr << e.what() << endl; } catch (property_not_found e) { cerr << e.what() << endl; } catch (...) { cerr << "Caught unhandled excption" << endl; } return EXIT_SUCCESS; } --- 8< Start ex.cpp 8< --- Patch to enable graph properties on GraphML files. Using 1.49.0. Index: libs/graph/src/graphml.cpp =================================================================== --- libs/graph/src/graphml.cpp (revision 1) +++ libs/graph/src/graphml.cpp (working copy) @@ -74,6 +74,15 @@ std::vector<const ptree*> graphs; get_graphs(gml, graphs); BOOST_FOREACH(const ptree* gr, graphs) { + // Search for graph attributes + BOOST_FOREACH(const ptree::value_type& attr, *gr) { + if (attr.first != "data") continue; + std::string key = attr.second.get<std::string>(path("<xmlattr>/key")); + std::string value = attr.second.get_value(""); + handle_graph_property(key, value); + } + } + BOOST_FOREACH(const ptree* gr, graphs) { // Search for nodes BOOST_FOREACH(const ptree::value_type& node, *gr) { if (node.first != "node") continue; @@ -183,6 +192,11 @@ } } + void handle_graph_property(const std::string& key_id, const std::string& value) + { + m_g.set_graph_property(m_key_name[key_id], value, m_key_type[key_id]); + } + void handle_node_property(const std::string& key_id, const std::string& descriptor, const std::string& value) { m_g.set_vertex_property(m_key_name[key_id], m_vertex[descriptor], value, m_key_type[key_id]);

1 0

[lambda] Can't get simple lambda working...
by Robert Dailey 21 Mar '12

21 Mar '12

Here is a basic function I have: bool MimeDocument::GetExistingAttachment( std::string const& filename, std::vector<MessageAttachment> const& attachments, MessageAttachment& attachment ) { using namespace boost::lambda; using boost::lambda::_1; std::vector<MessageAttachment>::const_iterator it = std::find_if( attachments.begin(), attachments.end(), bind( &MessageAttachment::name, _1 ) == filename ); if( it != attachments.end() ) { attachment = *it; return true; } return false; } MessageAttachment::name() has 2 overloads, one that takes 1 parameter and the other that takes no parameter. I'm attempting to call the version that accepts no parameters and returns a "char const*". I want to then compare this value to the local variable "filename". This should happen for each object in the vector (_1). I get various types of compiler errors on MSVC9. They all have to do with C2780: 1>c:\code\work\cmake-mds\server\gmmserver\domino\server\interface\dimime.cpp(287) : error C2780: 'const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<10,boost::lambda::function_action<10,T>>,detail::bind_tuple_mapper<const Arg1,const Arg2,const Arg3,const Arg4,const Arg5,const Arg6,const Arg7,const Arg8,const Arg9,const Arg10>::type>> boost::lambda::bind(const Arg1 &,const Arg2 &,const Arg3 &,const Arg4 &,const Arg5 &,const Arg6 &,const Arg7 &,const Arg8 &,const Arg9 &,const Arg10 &)' : expects 10 arguments - 2 provided 1> c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\lambda\detail\bind_functions.hpp(1743) : see declaration of 'boost::lambda::bind' Anyone have any idea what I'm doing wrong? --------- Robert Dailey

6 10

Re: [boost] [git] Mercurial?
by Steve Ramsey 21 Mar '12

21 Mar '12

On Mar 20, 2012, at 8:40 PM, Edward Diener <eldiener(a)tropicsoft.com> wrote: > I have never heard a single technical argument, in all the endless > mentions of Git among the people riding that bandwagon, why Git is > better than SVN, or even why any DVCS is better than a centralized SCCS. > I consider this whole move to Git and/or DVCS among "hip" programmers > little more than a move to conform with what others are doing and feel > "cool". > > I am perfectly willing to read well-chosen technical arguments but not > from people already sold on one side or the other. But I really despair > of anyone being able to present such arguments in the atmosphere created > by Git fanatics and DVCS fanatics. The only thing I have gotten from all > this is "I've tried it, I like it, and therefore its superior". > > Feel free, anyone, to point me to a purely technical discussion, > article, whatnot, explaining the practical reasons why using a DVCS, or > Git, is more productive and more pleasurable than using a centralized > SCCS like Subversion. For what it’s worth, here is a series of articles that sold me on DVCS (and Mercurial in particular, though that’s neither here nor there) after spending quite some time wondering whether to bother: <http://hginit.com/> It’s a typically breezy Joel Spolsky piece, but it does cover use cases nicely. Steve

2 1

[CRC][VC++] Can someone debug this?
by Daryle Walker 20 Mar '12

20 Mar '12

Are we still preparing for a release? If not (or afterwards), could someone check why the trunk's version of Boost.CRC, with more Boost.MPL usage, is choking on all versions of Visual C++. Only the latest version gives a specific error; previous versions just dump out. Daryle W.

3 3

BOOST_PP_ITERATE for huge mpl and fusion
by Hite, Christopher 20 Mar '12

20 Mar '12

"Not to 50!!!" - Princess Bride Things like mpl::vector and fusion::map have a configured limit like BOOST_MPL_LIMIT_VECTOR_SIZE. The documentation is dodgy and doesn't mention that while it is configurable you can't really configure it to be more than 50. Many people have stumbled here: http://boost.2283326.n4.nabble.com/msm-Boost-MPL-vector-limit-size-exceeded… http://lists.boost.org/Archives/boost/2004/08/70900.php http://comments.gmane.org/gmane.comp.lib.boost.user/55679 http://lists.boost.org/Archives/boost/2010/09/170443.php Appearantly there are some scripts to generate these headers, but they may not work anymore. I had to rush hack things in my code to make several containers go over 50 in one compilation scope. #define ULTIMATE_N 70 #include <boost/mpl/vector/vector50.hpp> namespace boost { namespace mpl { # define BOOST_PP_ITERATION_PARAMS_1 \ (3,(51, ULTIMATE_N, <boost/mpl/vector/aux_/numbered.hpp>)) # include BOOST_PP_ITERATE() }} I'd really like to fix this in boost. AFAICT all I have to do is find all *50.hpp files and replace the 50 with the appropriate config limit. I count 74 instances of this stuff going on! Mostly it's phoenix, mpl, and fusion. So to wrap it up my questions are: 1) Do the scripts still work? Does anyone use them? Are they regularly tested? 2) Does anyone see a problem with my simple fix? Chris

5 9

Possible bug in libs/context/src/asm/fcontext_ppc64_sysv_elf_gas.S
by Jeremiah Willcock 20 Mar '12

20 Mar '12

This code refers to registers r40 and r41 in several places; I think those should be r30 and r31. There are also many typos in the comments in that source file. -- Jeremiah Willcock

1 0

[mpl] +[fusion] + [phoenix] undocumented hard-coded limit=50
by Hite, Christopher 20 Mar '12

20 Mar '12

This is a re-post of " [boost] BOOST_PP_ITERATE for huge mpl and fusion". I think problem may be that I didn't target a particular library because it happens in three. There is an undocumented hard-coded limit of 50 in MPL, Fusion, and Phoenix. I count two impls 1) has 20 elements all generated boost_1_49_0/boost/mpl/aux_/preprocessed/gcc/vector.hpp 2) stops at 50 boost_1_49_0/boost/mpl/vector/vector50.hpp I don't know if there's a way to generate more. Probably you need python. If that's the case, IMHO this should be documented so users can do it. This doesn't work: #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #define BOOST_MPL_LIMIT_VECTOR_SIZE 60 #include <boost/mpl/vector.hpp> boost_1_49_0/boost/mpl/vector.hpp:36:73: fatal error: boost/mpl/vector/vector60.hpp: No such file or directory Can someone please help. I've upgraded my copy of boost. I've tried figuring out how these headers work. I'm pretty sure I could fix it if I really had to by replacing the 50 in the last file with the *_SIZE. I have this ugly hack in my code to keep things working. Would someone please help?!? Acknowledging the problem would be a start. Chris

4 3

[xpressive] Does '_' match newlines?
by Robert Dailey 19 Mar '12

19 Mar '12

I have the following static regex: sregex filename_re = icase("Content-Disposition:") >> -*_ >> "filename=" >> (s2=-+_) >> ';' ; I want the "*_" part to also match newline characters. I didn't see any flag to turn this on or off. Is this on by default? I see boost::xpressive::regex_constants::syntax_option_type::not_dot_newline, but not sure where you would (or wouldn't) specify this. I only recall the ability to specify flags for a regex when you compile a dynamic regex, not a static one. Help is appreciated! --------- Robert Dailey

2 1

new Overload library version
by Marco Cecchetti 19 Mar '12

19 Mar '12

Hi everyone! I noticed that an overloaded function utility has appeared under boost/functional as a spin-off of Camiti's Boost.Local library. Indeed on 2007 I had begun implementing something similar. All started from a Joel de Guzman's post where he showed a proof of concept of a thin-wrapper of several Boost.Functions. See: http://lists.boost.org/Archives/boost/2007/09/127906.php On that code base, I designed Overload, a small library whose interface matches as much as possible Boost.Function interface. Some documentation was written down thanks to the help and support of Dean M. Berris. Due to lack of time and the small amount of use cases I stopped spending my time on such a project. Anyway lately I have been working on the Overload library again. I have performed a light re-design of the interface, added a few new features and a lot of more testing, finally I've got to improve documentation. I uploaded the new version on the sandbox. In case you are interested these are the links: - library: http://svn.boost.org/svn/boost/sandbox/overload/trunk/ - documentation: http://svn.boost.org/svn/boost/sandbox/overload/trunk/libs/overload/docs/ht… Please don't reply to me about the not so proper library name, I could change it but it is a secondary issue. Regards, -- Marco -- Using Opera's revolutionary e-mail client: http://www.opera.com/mail/

1 0

[chrono] [thread] Test names too long
by Steven Watanabe 19 Mar '12

19 Mar '12

AMDG When I try to run the tests for Boost.Thread or Boost.Chrono I get an error like: failed to write output file '..\bin.v2\libs\chrono\test\basic_stopwatch_reporter _laps_accumulator_set_pass_shared.test\msvc-10.0express\debug\asynch-exceptions- on\threading-multi\stopwatch\basic_stopwatch_reporter_laps_accumulator_set_pass. obj.rsp'! Could the names possibly be made shorter? I can get it to build using --hash, but they're still rather long. In Christ, Steven Watanabe

4 5

Re: [boost] size() type
by Olaf van der Spek 18 Mar '12

18 Mar '12

Hi, Any progress on these tickets? Would be nice to have a solution. size() return type should be size_type, not difference_type: https://svn.boost.org/trac/boost/ticket/5971 data() for iterator_range: https://svn.boost.org/trac/boost/ticket/5930 Greetings, -- Olaf

4 15

[git] git-repo?
by Oliver Kowalke 18 Mar '12

18 Mar '12

I'm wondering about Beman Dawes 'Moving Boost to Git' on C++ Now! - has boost an official git-repo? Could I use it instead of svn-trunk? regards, Oliver

2 1

[Range] Path for Bug 5993
by Julien Nitard 18 Mar '12

18 Mar '12

Hi All, Would it be possible to apply the patch I have just submitted to trac on bug 5993 ? It should be pretty harmless. https://svn.boost.org/trac/boost/ticket/5993 Many thanks, Julien

3 3

GSoC Proposal
by Subrata Biswas 18 Mar '12

18 Mar '12

Dear Sir/Madam, I want to design a new IPC for Linux(Which can be extended for windows and mac also) as a project in Google Summer of Code. I have already started it and developed its very basic prototype. I have also written the proposal according to your format. But I could not find the email id where I can send my proposal. I have used your irc but hardly anyone were available there. Can u kindly provide me the links where I can send my project proposal and direcly interact with the mentors. I hope my "Smart IPC" may enrich the smart boost c++ libraries towards smarter c++ libraries. -- Thanking You, Regards Subrata Biswas MTech (pursuing) Computer Science and Engineering Indian Institute of Technology, Roorkee Mob: +91 7417474559

1 0

C++ Now! Conference Program Highlights C++11
by Jon Kalb 17 Mar '12

17 Mar '12

C++ Now! (formerly BoostCon) is pleased to announce its 2012 program with 35+ inspiring C++ practitioners delivering more than fifty technical sessions. In honor of the release of the new C++11 standard, this May's conference will, for the first time, be offered in three tracks. In addition to the sessions that attendees have come to expecton topics like library design and usage, programming techniques, best practices, academic research, development tools, concurrency, reliability, and performancethis year's program includes a full track devoted to C++11 <http://cppnow.org/locations/c11/> and three keynotes by industry luminaries <http://cppnow.org/overview/> . For those eager to get on board with the new standard, the C++11 content features fifteen hours of tutorial material covering the most important new features and APIs, presented, in many cases, by the language designers themselves. C++ Now! is offering the most complete C++11 tutorial coverage of any conference this year! Conference speakers include book and library authors, academics, C++ Standard Committee members, tool builders, architects, and engineers. With our very high presenter-to-audience ratio, attendees will have ample opportunity for one-on-one interaction with leaders who are currently defining the state of the art in C++. Dave Abrahams, the conference co-chair, writes, "We planned for an expansion, but even I am surprised at the presenter response and the resulting depth of this year's program. I'm preparing for a flood of new attendees." Reserve your place today at http://cppnow.org/registration C++ Now! 2012, held May 13-18 in Aspen Colorado is hosted by Boost in cooperation with ACM. * Complete program: http://cppnow.org/schedule * Speakers: http://cppnow.org/participants * Registration: http://cppnow.org/registration Jon

4 5

[format] Mistake in documentation
by Yakov Galka 17 Mar '12

17 Mar '12

The current documentation ( http://www.boost.org/doc/libs/1_49_0/libs/format/doc/format.html) says: "In the Open-group specification, referring to the same argument several times (e.g. *"%1$d %1$d"*) has undefined behaviour." Perhaps it was right some time ago, but it's not longer true. The Open-group specification ( http://pubs.opengroup.org/onlinepubs/009695399/functions/fprintf.html) explicitly allows this: "In format strings containing the "%*n*$" form of conversion specification, numbered arguments in the argument list can be referenced from the format string as many times as required." Thank you, -- Yakov

1 0

Begin Contributing to Boost
by Sathyam Vellal 17 Mar '12

17 Mar '12

Hi. I would like to contribute to the Boost.Graph library. The issues and challenges are presented here < http://www.boost.org/doc/libs/1_49_0/libs/graph/doc/challenge.html> Can somebody please guide me how to begin? I'd really love to be a part of this community! -- Sathyam M Vellal

2 2

has_member_fnc?
by Neal Becker 17 Mar '12

17 Mar '12

It seems c++11 has a new way to spell enable_if, and this can be used to implement has_member_fnc, as in this example: http://pastebin.com/mH2cZ4NP I wonder if has_member_fnc would be a good addition to boost?

6 10

[range] adaptors and member functions pointers
by Yanchenko Maxim 17 Mar '12

17 Mar '12

Hi, While transforming and filtering sequences, it's pretty common to call the elements' member functions, so I think it's worth adding some syntactic sugar for range adaptors in order to achieve cleaner syntax. E.g. if we have a class struct Foo { std::string description() const; }; and we want to get all non-empty descriptions, we could just write this clean code: foo_list | transformed(&Foo::description) | filtered(&std::string::size) To enable this syntax, the attached patch should be applied to boost/range/adaptor/argument_fwd.hpp (diff against 1.47.0). Is there any interest to add this to Boost.Range? Thanks, Maxim

7 9

[thread] Jamfile issue
by Emil Dotchevski 16 Mar '12

16 Mar '12

Hello, In my own Jamfile targets, if I refer to Boost Thread as: alias thread : $(boost)//thread ; I get: error: No best alternative for boost_1_48_0/libs/thread/build/thread_sources next alternative: required properties: <threadapi>win32 <threading>multi not matched next alternative: required properties: <threadapi>pthread <threading>multi not matched I could do this instead: alias thread : $(boost)//thread/<threadapi>win32 ; But that clumsy, I'd be dispatching between POSIX and WIN32 configurations, which ideally should be done internally by Boost Thread's Jamfile. Is there a better way to refer to Boost Thread? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

3 6

[trunk] what is MSVC 9.0 STL port 5.2?
by lcaminiti 16 Mar '12

16 Mar '12

Hello all, The trunk regressions tests: http://beta.boost.org/development/tests/trunk/developer/summary.html Run on MSVC 9.0 "STL port 5.2" and "WM5 STL port 5.2" on VeecoFTC: msvc- 9.0~stlport5.2 msvc- 9.0~wm5~stlport5.2 What are those? How are they different from the tests that run on MSVC 9.0 "msvc-9.0" on RW_WinXP_VC? Specifically, would you know if the following macro will be #defined to 1 on msvc- 9.0~stlport5.2 and msvc- 9.0~wm5~stlport5.2? // MSVC 7.1=1300, 8.0=1400, 9.0=1500, 10.0=1600 (this workaround was tested at // MSVC 8.0 but it might work also for all MVSC >= 7.1). #if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400)) && \ !defined(BOOST_TYPEOF_EMULATION) /* doesn't work in typeof-emu mode */ # define BOOST_SCOPE_EXIT_AUX_TYPEOF_THIS_WORKAROUND_01 1 #else # define BOOST_SCOPE_EXIT_AUX_TYPEOF_THIS_WORKAROUND_01 0 #endif Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-trunk-what-is-MSVC-9-0-STL-port-5-… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[scope_exit] can MSVC lambdas capture data members?
by lcaminiti 16 Mar '12

16 Mar '12

Hello all, Can anyone try the following code on a MSVC compiler with lambdas (MSVC10?)? #include <vector> struct person {}; struct world { void add_person(person const& a_person) { bool commit = false; persons_.push_back(a_person); auto scope_exit = [&commit, &persons_]() mutable -> void { if(!commit) persons_.pop_back(); }; commit = true; scope_exit(); } private: std::vector<person> persons_; }; int main() { world w; person p; w.add_person(p); return 0; } This code compiles on GCC 4.5.3 with C++0x extensions (including lambdas) but based on some errors I'm seeing in trunk's ScopeExit regressions tests, I'm guessing it will fail using MSVC lambdas with errors similar to the followings: error C3480: 'world::persons_': a lambda capture variable must be from an enclosing function scope warning C4573: the usage of 'world::persons_' requires the compiler to capture 'this' but the current default capture mode does not allow it Unfortunately, I don't have a MSVC compiler with lambdas so thank you very much for trying my code! --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-scope-exit-can-MSVC-lambdas-captur… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 15

[Range] Derived from iterator_range and operator==
by Olaf van der Spek 16 Mar '12

16 Mar '12

Hi, Shouldn't this just work? Comparing two boost::iterator_range<const char*> works fine. #include <boost/range/iterator_range.hpp> class str_ref : public boost::iterator_range<const char*> { }; int main() { boost::iterator_range<const char*> a; a == a; str_ref b; b == b; // 12 } is.cpp: In function ‘int main()’: is.cpp:12:7: error: ambiguous overload for ‘operator==’ in ‘b == b’ is.cpp:12:7: note: candidates are: is.cpp:12:7: note: operator==(boost::iterator_range<const char*>::unspecified_bool_type {aka const char* boost::iterator_range<const char*>::*}, boost::iterator_range<const char*>::unspecified_bool_type {aka const char* boost::iterator_range<const char*>::*}) <built-in> /usr/include/boost/range/iterator_range_core.hpp:438:21: note: bool boost::operator==(const boost::iterator_range<IteratorT>&, const ForwardRange&) [with IteratorT = const char*, ForwardRange = str_ref] /usr/include/boost/range/iterator_range_core.hpp:431:21: note: bool boost::operator==(const boost::iterator_range<IteratorT>&, const boost::iterator_range<Iterator2T>&) [with Iterator1T = const char*, Iterator2T = const char*] /usr/include/boost/range/iterator_range_core.hpp:387:21: note: bool boost::operator==(const ForwardRange&, const boost::iterator_range<IteratorT>&) [with IteratorT = const char*, ForwardRange = str_ref] -- Olaf

1 0

[O/T git and workflows] A couple of questions
by Brian Schrom 16 Mar '12

16 Mar '12

This is slightly off topic, but with recent (and future ;) ) Git discussions, hopefully not too off topic... If Boost were to adopt Git, I believe Gitolite (https://github.com/sitaramc/gitolite, http://sitaramc.github.com/gitolite/ -- docs) or something similar would need to be used which provides some centralization features. Maybe github? Gerrit (http://code.google.com/p/gerrit/) is primarily a code review tool, though provides some centralized support. git flow (https://github.com/nvie/gitflow) has some nice wrappers for branch management. This looks especially appealing for gently introducing people to git. It provides structure and reduces the number of commands. My question is what the workflow, tools, and experience people have with combining all of these tools. I think this community will need something along these lines if it is to transition to Git anyway, so maybe this will get that part of the discussion started. ---- Just to keep the discussion on git going... In my "brain storming" world, there is the central boost repo (which currently exists), I clone it. (When can we start submitting to github? :) ) I use git flow locally for my own branch management. This allows me to work on multiple features independently. When a feature is completed locally, I send the patch (possibly via gerrit ) and that patch sits in the maintainers review queue. If accepted, the patch is applied and merged for the next release. Largely, I believe this is what exists right now. Admittedly, I've only ever submitted one patch to Boost. That was an email directly to the library author. What I want to understand is, if such tools were adopted, would it lower the burden on library maintainers enough to justify the change? Again, my perception of the way things currently are vs could be with git: centralized subversion server. centralized git server (gitolite?) svn checkout trunk git clone developer Use whatever local strategy for development use git flow + whatever local strategy for development create patch and attach to TRAC ticket git push to gerrit server (for instance) poke people on mailing list about patches (poke people on mailing list about pending reviews and such) maintainer applies patch and pushes to server An approved patch gets pushed to centralized server. * Where would build-bot/Jenkins interact in this process? It seems that there are a few places...1) Want to be able to test local branch during development, 2) then test during the patch review and approve process, and 3) finally test on the integrated branch. * Would the "better" localized development tools (git + git flow + more direct patch submission) facilitate more participation in the community over the current method? (my guess is not much, though the people that do contribute might appreciate the improvements. And some would consider them not improvements and stop contributing? * Would the review process save the maintainer's enough time and effort that they're more able to process more patches on a regular basis?

5 6

[random] uniform_01 not usable in backwards compatible mode
by John Maddock 15 Mar '12

15 Mar '12

Apologies for the minor flood of posts.... uniform_01 has a default constructor only (fine for the "new" interface), but for the old interface, the base class has a single arg constructor only and no default constructor. In other words there's no way to construct a uniform_01 in backwards compatibility mode (when the first template arg is a distribution). Also the traits selection class that switches between new and old interfaces should probably be documented (and not in detail{ namespace). Cheers, John.

2 2

[bind] Error C4430 in bind.hpp
by Robert Dailey 15 Mar '12

15 Mar '12

For some reason when I include <boost/bind.hpp> I get the following errors: 1>c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\bind\bind.hpp(1200) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\bind\bind.hpp(1201) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\bind\bind.hpp(1203) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\bind\bind.hpp(1204) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\bind\bind.hpp(1206) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\bind\bind.hpp(1207) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\bind\bind.hpp(1209) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\code\work\cmake-mds\build-vc9\third_party\boost\1.48.0\include\boost\bind\bind.hpp(1210) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int They point to this code in bind.hpp: BOOST_BIND_OPERATOR( ==, equal ) BOOST_BIND_OPERATOR( !=, not_equal ) BOOST_BIND_OPERATOR( <, less ) BOOST_BIND_OPERATOR( <=, less_equal ) BOOST_BIND_OPERATOR( >, greater ) BOOST_BIND_OPERATOR( >=, greater_equal ) BOOST_BIND_OPERATOR( &&, logical_and ) BOOST_BIND_OPERATOR( ||, logical_or ) Any idea why this is failing? If more info is needed please let me know. --------- Robert Dailey

4 9

boost.asio lib and CodeLite
by Teemu 15 Mar '12

15 Mar '12

hi group! I´m using CodeLite + MinGW+ Unit Test 1.3 on a Win7 system. Now I want to add the boost.asio library (boost_1_49_0) to CodeLite. I have already linked a few files like: "C:\boost_1_49_0\boost\asio" or "C:\MinGW\include\boost" and so on... But I still get some warnings like: "c:\mingw\bin\../lib/gcc/mingw32/4.4.1/../../../../include/boost/asio/detail/impl/win_object_handle_service.ipp: In member function 'void boost::asio::detail::win_object_handle_service::move_construct(boost::asio::detail::win_object_handle_service::implementation_type&, boost::asio::detail::win_object_handle_service::implementation_type&)': c:\mingw\bin\../lib/gcc/mingw32/4.4.1/../../../../include/boost/asio/detail/impl/win_object_handle_service.ipp:106: error: '::UnregisterWaitEx' has not been declared" I´m not sure, if I have add the boost.asio library correctly and ifI have to link some other libraries from the Windows system? I´ve read somewhere that adding Win-files is necessary to run the boost.asio lib correctly, is that right? and if, which files? I hope someone can help me... best regards Teemu sry for my bad english I´m from germany... -- View this message in context: http://boost.2283326.n4.nabble.com/boost-asio-lib-and-CodeLite-tp4474767p44… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 1

Contributing to Boost Graph Library
by Sathyam Vellal 15 Mar '12

15 Mar '12

Hello. I would like to contribute to Boost Graph Library. I went through the http://www.boost.org/doc/libs/1_49_0/libs/graph/doc/challenge.html which is also included as one of the projects of SoC 2012. How do I begin? Thank you

2 2

[xpressive] Concatenating two regular expressions into one?
by Robert Dailey 15 Mar '12

15 Mar '12

I have the following function: bool MimeDocument::GetMimeHeaderData( PMIMEENTITY entity, MimeHeaderData& header_data ) { bool success = false; std::string headers; GetMimeEntityData( entity, MIME_ENTITY_DATA_HEADERS, headers ); using namespace boost::xpressive; sregex content_disposition_re = icase("Content-Disposition:") >> +_s >> (s1=!as_xpr("inline;")) >> -*_ >> "size=" >> (s2=+_d) >> ';' ; sregex content_id_re = icase("Content-ID:") >> +_s >> '<' >> (s1=+_) >> '>' ; smatch what; if( regex_search( headers, what, content_disposition_re ) ) { header_data.is_inline = what[1] == "inline;"; header_data.size = boost::lexical_cast<unsigned>( what[2] ); success = true; } if( regex_search( headers, what, content_id_re ) ) { header_data.content_id = what[1]; success = true; } return success; } Right now I use 2 sregex objects and search the MIME headers twice to find 2 different lines. Ideally I'd like to just use 1 regex and combine them, but I need to then somehow make it search between all lines, and then the order in which Content-Distribution and Content-ID appear in the headers may vary. Is it best to keep them separated like this, or can I concatenate the regular expressions into 1? --------- Robert Dailey

2 1

[git] neglected aspects
by Steven Samuel Cole 14 Mar '12

14 Mar '12

Hi all, First post here, so please bear with me. A lot has been said in the last year on the subject of a possible migration from svn to git. However, after reading pretty much every message on the issue on this list (sic!), I have the impression that some of the most important aspects did not get the consideration they require. I would therefore like to add my outside perspective. SUMMARY: 1. an svn --> git migration does cause some major, but one-time disruption. However, svn right now causes minor, but continuous disruption on a daily basis - which often goes unnoticed. 2. git's distributed concept is nothing less than one generation ahead of centralized VCSs like svn. The benefits usually do not become apparent until git is actually used in practice. 3. at the moment, boost is significantly missing out on fresh enthusiasm that new contributors could bring into the project; svn and the policies it mandates are partly too blame for that. 4. svn trunk (i.e. boost library) maintainers are too limited by the svn concept in their decision which changes they merge at what point in time and may be pressured into rushing suboptimal decisions; this can make maintenance work painful and frustrating. git greatly alleviates that problem. 5. IMO, it's not 'if', it is 'when'. The longer a migration is delayed, the longer boost development will be slowed down without even noticing. DETAILS: I am aware that some of my points technically are mentioned on the boost git wiki page at https://svn.boost.org/trac/boost/wiki/Git/WhyGit, but they still seem somewhat neglected. This is probably not surprising as many participants in the discussion 1. presumably are established boost contributors and thus share a 'from the inside' view of the subject and 2. are only marginally affected by svn's conceptual problems This is what happened here in the last couple of days: I needed a tool for a job in my current project and I couldn't find one, so I thought about what components I need to build my own. A little web research - Boost.Iostreams looks perfect for the purpose. You have all been through what comes next, be it with boost or with other open source software: Download the latest release, install the libraries, start reading the docs, run some sample code, etc. While reading, I spot a typo in an HTML doc, then another in an include file comment, a third one in another file... the fourth one at the latest makes me think - this is open source, I should sync the latest sources, fix all those typos as I come across them while reading and contribute them back to the project. A quick read on submitting bugs on boost.org, svn co yadi yadi, fix the typos locally. Of course I don't have write privileges to the repo, so the best I can do for now is create a patch and attach that to a bug report. Within minutes, someone takes care of the bug, comments and takes ownership. Excellent! Smithers, money fight! I go back to reading, find more typos. My patch has not been committed to the trunk yet, so my local changes are still sitting there on my local hard drive. If I do another svn diff > file_2.patch, the patch will also contain the changes I have already attached to the bug report. What are my options now ? Revert my changes, base the new ones on the head revision and send another patch ? Create a new patch file and manually remove the diffs of the old changes I already sent ? How will the upstream maintainer know which changes are based on what version ? Also, I notice a few other things that in my opinion could be done better to facilitate adoption of the iostreams library. I would be willing to do the work and I would in the perfect position as I am walking in the shoes of an adopter right now - but these are separate from the typo fixes and they are larger issues; considering I can't check my changes in, would I really want to have them sit on my local harddrive, waiting possibly for months for someone upstream to review and hopefully merge them ? A couple of hours later: I get an email from boost bugs/svn; the upstream maintainer has committed my changes. However, I actually receive not one, but two emails, because the upstream guy chose to split my patch into changes on documentation and changes on source code (which presumably required extra work on his part). I do an svn up and now have to deal with conflicts between my local changes and the new commits: I make a note of my second set of changes and overwrite my local files with the new repo versions, then bring the second set back in. Uff! That's a lot of work just to fix some typos! And these are just cosmetic issues in discrete chunks that do not require any testing; contributing changes to source code would take even more effort and more caution - build and test on several platforms, peer review, etc. Also, the upstream maintainer jumped on the bug report right away and integrated my changes within hours. This is the ideal situation (thanks again Daniel, great job! :-) - usually, things don't happen so quickly - especially around major release time. HOW THIS IS DONE IN GIT: 1. google 'github iostreams' --> click first search result: https://github.com/boost-lib/iostreams (this can be even reduced to 'gh: iostreams' by integrating github into chrome search engines, but that's another story...) 2. on githup website, click 'fork', wait a few seconds --> this auto-creates my personal online github iostreams repo 3. on my local machine, open a shell, enter 'git clone ', copy & paste the repo .git url shown on the website in there and run e.g. 'git clone git(a)github.com:<username>/iostreams.git' --> this creates a local fork of my personal online iostreams repo + the mailing list probably changes the line above to 'hidden' + there is github/desktop integration and a plethora of gui clients 4. i change local files and commit to the local repo. once a set of changes is complete, i push them online into my personal online repo; once my work has reached some maturity, I send a pull request to the upstream maintainer of the official iostreams repo, aka the keeper of the trunk. disclaimer: I have omitted one-time steps to set up local git, github.com account, ssh keys, lastpass integration, yadi yadi. these steps are abundantly documented online, done in minutes and required only once. THE GIT ADVANTAGE: I don't have to wait for the first set of changes to be merged into the trunk before I resync, resolve conflicts and base the second set on the new head revision; I simply create a new branch for a new change set and send a new pull request once my work is complete. The upstream maintainer has no peer pressure to merge any changes in: He/she is sitting on the head revision and is looking at a number of pull requests for change sets in various personal forks like mine; these are more like 'change offers' the maintainer is free to merge in if he/she so chooses (cherry-picking) - or postpone if this is not the time because for example a major release is due and they seem too risky. I as a contributor do not really care so much: Of course I am stoked if my work actually makes it into the project eventually, but the point in time when this happens technically does not matter to me - pending changes will not get in my way if the merge takes a little longer. This is the major difference between svn and git - and I can not stress this advantage enough: I am decoupled from, but still connected to the official trunk. I can make arbitrary changes and group them in any way I see fit. I offer them to upstream and move on to new development. As a side effect, this also provides an overview impression of quality and continuity of the work of a potential new contributor. Of course it is technically correct that svn also supports the concepts of forks and branches, but in terms of tooling and mentality, they are considered much more heavy-weight than in git and might get created a couple of times a year - while in git, they might come and go a couple of times a day. Finally, the 'series of tubes' metaphor IMO does not really hit it. Subversion to me seems more like a freight train where the waggons move at different speeds, so they constantly bump into the car behind and in front of them; movement of the entire train is jerky. Git on the other hand is a bunch of space ships linked by hyperelastic tractor beams: Even if one travels out as far as the delta quadrant, the upstream connection will always make sure the collective does benefit from any new development it brings back from there. [snipped several paragraphs about cultural and other aspects; maybe some other time.] # ssc

24 81

[random] Use of make_unsigned/make_signed
by John Maddock 14 Mar '12

14 Mar '12

Several of the random number distributions use make_[un]signed internally. However, this trait is not intended as a customization point for UDT's - it's only supposed to be instantiated for integer or enum types - and yes that's a deliberate decision that's now enshrined in the standard ;-) Unfortunately this means that these distributions can't be instantiated on UDT's - big number types for example. Since it seems that these traits are only used to obtain a type that is large enough to store a difference between the endpoints of a range, would it be possible for these to change to use something like: namespace boost{ namespace random{ template <class T> struct range_type : public make_signed<T> { }; }} Then range_type could be [partially-] specialized for UDT's. Note that for some types, there might simply not be a corresponding unsigned type at all, but I'm assuming that doesn't foul up the logic, as long as the type is wide enough? Comments? Thanks, John.

2 1

[random] independent_bits_engine
by John Maddock 14 Mar '12

14 Mar '12

Am I correct in thinking that the independent_bits_engine produces a uniform distribution? I'm interested in using it with arbitrary precision integers to produce B-bit random numbers for the record, Thanks, John.

2 1

Is there interest in static code analysis?
by Antony Polukhin 14 Mar '12

14 Mar '12

Because of some interest on this topic, I would like to clarify some things: Of course you can have some trial version and use it by yourself, BUT more mature solution would be to find a "boost's liason contact". This contact will interact with the company, provide access to reports for developers. In that case all developers can get access to reports without downloading/installing the trial version and use static analysis tool for a longer time. That case will also require from a "boost's liason contact" to look carefully through the license for that tool and agree to it as a maintainer of a whole boost project (I am not permitted to take such solutions). Best regards, Antony Polukhin

3 6

As of 1.49, I am completely unable to build boost with PDB files using VS2010
by Michael Goldshteyn 14 Mar '12

14 Mar '12

Whatever changes were made in 1.49 made it impossible for me to build a debug version of the boost libraries with PDB files. I am using the following command line: ----- bootstrap b2 --without-mpi --without-python --build-dir=vc100-bld-64-bit --build-type=complete --toolset=msvc-10.0 --stagedir=64-bit-vc100 debug-symbols=on debug-store=database ----- I am getting errors like: libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2858: command-line option 'program database name (/Fde:\dev\devel\libs\boost\boost_1_49_0\vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\debug-store-database\link-static\runtime-link -static\libboost_math_tr1-vc100-sgd-1_49.pdb)' inconsistent with precompiled header, which used '/Fde:\dev\devel\libs\boost\boost_1_49_0\vc100.pdb' libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2859: e:\dev\devel\libs\boost\boost_1_49_0\vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\debug-store-database\link-static\runtime-link-static\libboost_math_tr1-vc100-sgd-1_49.pdb is not the pdb file that was used when this precompiled header was created, recreate the precompiled header. I've tried turning off precompiled headers using pch=off, but still get errors preventing me from building. I have to completely remove the debug-store=database build option to get a build, but then I have no PDB files at all for the boost libraries. Thanks for any help, Michael Goldshteyn

2 1

GSoC 2012
by Devashish Tyagi 14 Mar '12

14 Mar '12

Hello, I am Devashish Tyagi, an Undergraduate Student of Computer Science and Engineering at Indian Institute of Technology, Delhi. I am currently in my Third Year. I have a considerable experience of coding in C++ and strong background in the field of Algorithms. I would like to be part of Boost C++ Library for GSoC 2012. I went through the Ideas page here<https://svn.boost.org/trac/boost/wiki/SoC2012>. I would like to extend Boost.Graph by implementing the requests mentioned on this page<http://www.boost.org/doc/libs/1_49_0/libs/graph/doc/challenge.html>. Among the Challenges mentioned, I am particularly interested in implementing Dynamic Graph Algorithms and a minimum cost maximum flow Algorithm. Could someone guide me as to from where should I begin my research and Is there a priority order among the requests/challanges mentioned on this page<http://www.boost.org/doc/libs/1_49_0/libs/graph/doc/challenge.html>. Regards -- Devashish Tyagi 2nd Year Undergraduate Computer Science and Engineering Dept.

1 0

Boost.Build maintenance
by Bruno Santos 14 Mar '12

14 Mar '12

Hi, I been submitting some patches in trac, but I noticed there's no activity there for boost.build. Since I use boost.build extensively and I would like to volunteer as maintainer for it. Regards, Bruno

3 2

[xpressive] Compiler error; seems like normal usage?
by Robert Dailey 13 Mar '12

13 Mar '12

My regex is as follows: sregex re = "Content-Disposition:" >> +_s >> (s1=!"inline;") >> -*_ >> "size=" >> (s2=+_d) >> ';' ; This seems to be the part causing the compiler errors: (s1=!"inline;") When I change it to this: !(s1="inline;") It compiles just fine. I'm on VS2008 SP1. Anyone know why the former usage does not work? I still want the group to capture an empty string if the string "inline;" does not match, which is why I put the ! inside the capture group. Does this matter? --------- Robert Dailey

3 3

Boost 1.49 BOOST_PP_ITERATION_FLAGS(): causes build failures; would like a boost maintainer comment
by Steve M. Robbins 13 Mar '12

13 Mar '12

Would really appreciate if ticket 6631 is a Boost bug that I can patch for Debian, or whether it is just API breakage that boost-using packages (like luabind) must adapt to. Thanks, -Steve #6631: BOOST_PP_ITERATION_FLAGS(): error: missing binary operator before token "(" --------------------------------+------------------------------------------- Reporter: peter@??? | Owner: no-maintainer Type: Bugs | Status: new Milestone: To Be Determined | Component: preprocessor Version: Boost 1.49.0 | Severity: Regression Resolution: | Keywords: BOOST_PP_ITERATION_FLAGS --------------------------------+------------------------------------------- Changes (by Steve Robbins <smr@???>): * cc: smr@??? (added) Comment: I am currently investigating building all Debian packages with Boost 1.49 and "luabind" fails to build with very similar symptoms. Can the boost maintainer comment whether this is a bug in boost or a simple API break. Thanks, -Steve

2 4

Hi-Introduction
by Rhythm Gupta 13 Mar '12

13 Mar '12

Hi, I'm Rhythm Gupta. I am a first year student of Computer Science in IIT Delhi, India. I love coding and i have strong background in Maths and Science. Hence, BoostC++ looks like the perfect organisation for me. :-) Would like to apply for BoostC++ in GSoC. Could you help me get started with BoostC++?

2 1

Boost B-Tree Library Status
by Joel 12 Mar '12

12 Mar '12

Beman et al, Is the Boost B-tree Library still on track to be proposed? The reception at BoostCON 2011 was quite warm, IIRC. http://github.com/boostcon/2011_presentations/raw/master/tue/proposed_b_tre… Activity on github seems to be dried up. https://github.com/Beman/Boost-Btree Also, how well do you think it would work with large keys and small payloads (512 byte keys, a few integers for payload). Thanks! Joel

3 3

[GIL] gil/metafunctions.hpp broken in 1.49?
by Andrew Hundt 12 Mar '12

12 Mar '12

I may be mistaken, but it looks like boost::mpl::vector_c may have been moved from <boost/mpl/vector.hpp> to <boost/mpl/vector_c.hpp> and it appears <boost/gil/metafunctions.hpp> has not been updated to reflect this change. Cheers! Andrew Hundt

2 1

[fusion] Fusion using varidiac templates
by paul Fultz 12 Mar '12

12 Mar '12

hi, I remember seeing that there was an initial port of fusion to use variadiac templates a while back. Is that code available somewhere? If so, where could a find that? Thanks, Paul

3 3

Using an element of a class A in a constructor of a class B (reflection with boost::python)
by christophe jean-joseph 12 Mar '12

12 Mar '12

Hello The situation is as follow. I have a C++ code that I haven't written and that I barely can modified. I am supposed to reflect this code in Python with boost. In the code, I have something looking like this: Class A_Base { A_Base(){}; ~A_Base(){}; Whatever virtual and pure virtual functions; } Class A_Derived{ A_Derived(Type1 arg1,...){whatever instructions;} ~A_Derived(){}; Whatever functions; } Class B { B(A_Base& aBase, double& x){}; ~B(){}; Whatever functions; } In the C++ main, at some point aDerived A_Derived is set, and then B(aDerived, x). I need to reflect that under python. Until now, I have been able, with a simple example, to reflect a function f, which is not a ctor, from a class B using A_Base& as argument type, but I can't figure out how to deal with it for a constructor. Based on: http://wiki.python.org/moin/boost.python/ExportingClasses I am declaring f under both its class B and A_Base as follow: .def("f", &B::f) But when I try this for a constructor as f, it refuse to compile. Anyone got a clue? Thank you very much in advance for any further help.

3 5

Keynotes for C++ Now!
by Jon Kalb 12 Mar '12

12 Mar '12

C++ Now! (formerly BoostCon) is pleased to announce its lineup of keynote speakers for the 2012 conference: Howard Hinnant, Sean Parent, and Daveed Vandevoorde. Howard Hinnant is the principal author of libc++, the standard C++ library implementation used by the Clang compiler. During the development of C++11, Howard served as chairman of the C++ Standards Committee¹s Library Working Group, and is largely responsible for the design of what Scott Meyers has called the language¹s ³flagship new feature:² rvalue references. His keynote will demonstrate how rvalue references are used in move semantics and perfect forwarding. Sean Parent is a principal scientist and software architect for Adobe¹s mobile digital imaging group and formerly managed Adobe¹s Software Technology Lab. He was also the keynote speaker for the very first BoostCon, where he gave one of the most inspiring and memorable talks we¹ve ever had. We¹re very pleased to welcome him back for an encore. He will be speaking on what¹s next for C++ programmers: how do we write beautiful code that truly exploits today¹s hardware and infrastructure? Daveed Vandevoorde is a compiler developer with Edison Design Group, the author (with Nicolai Josuttis) of ³C++ Templates: The Complete Guide,² a co-founder of comp.lang.c++.moderated, and one of the few C++ Committee Members who is equally comfortable working on library design, language evolution, or the arcana of core language issues. Daveed is currently a leader in the effort to add true modules to the C++ language. He¹ll be talking about the design of the C++ modules feature and what it would mean for the future of the language. ³We are thrilled to have such a powerhouse lineup in the first year of the new language standard,² said Dave Abrahams the conference founder and co-chair. ³C++Now! 2012 is truly shaping up to be a feast for the C++ enthusiast.² C++ Now! 2012 will be held May 13-18 in Aspen Colorado. Registration is now open at http://cppnow.org/registration/. Keynote details at http://cppnow.org/overview/. Jon

1 0

boost::algorithm::trim_copy() behaves like "strdup" in normal C, does it allocate a new string ?
by g.fanini＠gmail.com 11 Mar '12

11 Mar '12

Could I ask for a clarification whether boost::algorithm::trim_copy() behaves like "strdup" in normal C, i.e. does it allocate a new string ? or does it modify the passed string without allocating a new string ? It is not entirely clear from the documentation : http://www.boost.org/doc/libs/1_34_0/doc/html/boost/algorithm/trim_copy.html Because the argument passed has the modifier "const" I am led to believe it would leave the passed string unchanged, and return a newly allocated string. Possibly would you consider kindly updating the documentation reflecting the returned string is newly allocated.I am asking this becauseI am trying to work with preexisting boost code which uses boost::algorithm::trim_copy() profusely and I have severe leakage problems.Thank you for any information.

7 9

[bgl] Update on maximum adjacency search
by Fernando Vilas 11 Mar '12

11 Mar '12

Hi, Since the last round of feedback, I think the implementation is at least closer to being releasable. This is not quite a re-send because I attached the wrong patch last time, but I also forgot the subject tags to get the attention of the BGL folks. Changes: - All parameters other than the graph itself are available as named parameters - Visitor is not pass-by-value like other search algorithms - Documentation created Still potential todo: - Update documentation with graphical walkthrough on a small graph - Find a way to make the priority queue work without unwrap_ref() - Do not depend on one_bit_color_map internals in min_cut_mas_visitor - Other suggestions from Boost community -- Thanks, Fernando Vilas fvilas(a)iname.com

1 0

Re: [boost] Boost.ntree_container (bi_tree, quad_tree, oct_tree, etc ptr containers) Is there any interest in this?
by Dan Walters 11 Mar '12

11 Mar '12

Hi all, This is my current implementation of an oct tree that I am using on a project I am working on. It is a templated oct tree which serves as a pointer container. There is usage shown in the main() function at the bottom of the sample. http://codepad.org/yIAblSDN Please bear in mind it is not fully optimized or std compliant, just put together for a project but shows the intended basic functionality and method. Compatibility with boost geometry is a great suggestion. Again, I am mindful of defining the boundaries of this library, but if it makes sense then template specialization or utility code could be provided to use the libraries together easily and elegantly. k-d trees are very interesting, and if discussion found these potentially useful enough, they would certainly belong in the same library. I think, in any context, this should be thought of as a container library above all else and would be potentially useful not just in game or geometry programming, but open to use where ever useful, including as a memory efficient pointer container for sparsely populated multidimensional arrays. Best wishes, Dan On 10 March 2012 20:04, Daniel F. Savarese <dfs(a)savarese.org> wrote: > > In message <848178090.20120310163009(a)gmail.com>, pavel writes: > >by the way i have a ready implementation of kd trees (if anyone is > >interested): > > > > > http://programmizm.sourceforge.net/blog/2011/a-practical-implementation-of-… > >trees > > That's not exactly a generic implementation, nor one that is STL-friendly > (e.g., no iterators). For a more generic implementation that aims for STL > interoperability where possible, see the header-only libssrckdtree library: > http://www.savarese.com/software/libssrckdtree/ > > But this is off-topic for the thread, which--as I understand it--is > concerned > with fixed-size multidimensional spatial pointer containers oriented toward > 3D applications, not variable-sized multidimensional spatial value > containers > applicable to arbitrary domains. > > daniel > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost >

2 1

Re: [boost] Boost.ntree_container (bi_tree, quad_tree, oct_tree, etc ptr containers) Is there any interest in this?
by pavel 11 Mar '12

11 Mar '12

Daniel wrote on Sunday, March 11, 2012 at 0:04:28: > That's not exactly a generic implementation, nor one that is STL-friendly > (e.g., no iterators). you are perfectly right but i believe that this implementation can be almost trivially integrated with a generic (read: template) interface besides, i hardly see a kd tree or an octree as a (associative) container -- Pavel P.S. if you notice a grammar mistake or weird phrasing in my message please point it out

1 0

[filesystem.v3] v1.49 Path constructor issue in VS Debug configuration
by Fraser Hutchison 11 Mar '12

11 Mar '12

Hello, The changes made to filesystem/v3/src/path.cpp between v1.48 and v1.49 seem to be causing a crash if I initialise a path as e.g. a global variable or as a static class member, but only for a Debug build. (I'm using VS10 on 64-bit Win 7). The following program exhibits this behaviour: |#include "boost/filesystem/v3/path.hpp" boost::filesystem::path p("p"); int main() { return 0; } | In Debug, I can see that the third path constructor calls |codecvt()|, which calls |wchar_t_codecvt_facet()|, which returns |codecvt_facet|. However, |codecvt_facet| hasn't been initialised at this point. This appears to only be the case for Debug builds though. I'm unclear as to whether this is an MSVC bug though. I thought that the Standard required |codecvt_facet| to have been initialised before |wchar_t_codecvt_facet()| since it comes earlier in the same translation unit. Could someone please clarify whether I should file a bug report with boost please? Thanks, Fraser.

2 2

[range] MFC/ATL select_first / select_second specializations for map_keys and map_values adaptors
by Adam Walling 11 Mar '12

11 Mar '12

I enjoy using the range library, and also foreach. When dealing with legacy code, the MFC / ATL range adaptors are wonderful. Unfortunately, the CMap and CMapStringToString iterators return CPair objects rather than std::pair, hence causing the select_first / select_second_mutable / select_second_const metafunctions to fail. I added these specializations to allow them to work with the map_keys and map_values adaptors. Hopefully they will be of use to someone in the future or adapted to be included with the other MFC / ATL code. Would it be worthwhile to format this as a patch to the library? namespace boost { namespace range_detail { // CMap and CMapStringToString range iterators return CPair, // which has a key and value member. Other MFC range iterators // already return adapted std::pair objects. This allows usage // of the map_keys and map_values range adaptors with CMap // and CMapStringToString // specialization for CMap template<class KEY, class ARG_KEY, class VALUE, class ARG_VALUE> struct select_first<CMap<KEY, ARG_KEY, VALUE, ARG_VALUE>> { typedef BOOST_DEDUCED_TYPENAME CMap<KEY, ARG_KEY, VALUE, ARG_VALUE> map_type; typedef BOOST_DEDUCED_TYPENAME range_reference<const map_type>::type argument_type; typedef BOOST_DEDUCED_TYPENAME const KEY& result_type; result_type operator()( argument_type r ) const { return r.key; } }; template<class KEY, class ARG_KEY, class VALUE, class ARG_VALUE> struct select_second_mutable<CMap<KEY, ARG_KEY, VALUE, ARG_VALUE>> { typedef BOOST_DEDUCED_TYPENAME CMap<KEY, ARG_KEY, VALUE, ARG_VALUE> map_type; typedef BOOST_DEDUCED_TYPENAME range_reference<map_type>::type argument_type; typedef BOOST_DEDUCED_TYPENAME VALUE& result_type; result_type operator()( argument_type r ) const { return r.value; } }; template<class KEY, class ARG_KEY, class VALUE, class ARG_VALUE> struct select_second_const<CMap<KEY, ARG_KEY, VALUE, ARG_VALUE>> { typedef BOOST_DEDUCED_TYPENAME CMap<KEY, ARG_KEY, VALUE, ARG_VALUE> map_type; typedef BOOST_DEDUCED_TYPENAME range_reference<const map_type>::type argument_type; typedef BOOST_DEDUCED_TYPENAME const VALUE& result_type; result_type operator()( argument_type r ) const { return r.value; } }; // specialization for CMapStringToString template<> struct select_first<CMapStringToString> { typedef range_reference<const CMapStringToString>::type argument_type; typedef const CString& result_type; result_type operator()( argument_type r ) const { return r.key; } }; template<> struct select_second_mutable<CMapStringToString> { typedef range_reference<CMapStringToString>::type argument_type; typedef CString& result_type; result_type operator()( argument_type r ) const { return r.value; } }; template<> struct select_second_const<CMapStringToString> { typedef range_reference<const CMapStringToString>::type argument_type; typedef const CString& result_type; result_type operator()( argument_type r ) const { return r.value; } }; } } -- - Adam D. Walling

1 0

[Config] Meaning of BOOST_NO_CXX11_HDR_INITIALIZER_LIST
by Michel Morin 10 Mar '12

10 Mar '12

I noticed that BOOST_NO_INITIALIZER_LISTS was replaced by BOOST_NO_CXX11_HDR_INITIALIZER_LIST recently. I have a question related to this change: Does BOOST_NO_CXX11_HDR_INITIALIZER_LIST imply that initializer lists are supported by the compiler? (I guess that the compiler support is checked in a compiler config and the existence of <initializer_list> is checked in a std lib config.) If so, shouldn't the documentation be updated? Regards, Michel

4 17

Boost trunk on Solaris 10 sparc
by Maciej (Matchek) Bliziński 09 Mar '12

09 Mar '12

Hello, I've made an attempt to build Boost from subversion trunk on Solaris 10 on sparc, with gcc-4.6.2. The build didn't succeed, and I'll be looking into ways to make it pass. I've recorded the build in log file which includes all the setup: http://buildfarm.opencsw.org/~maciej/boost-2012-02-29-09-51.log Some highlights: error: No best alternative for libs/context/build/asm_context_sources var/tmp//ccU7e2QF.s: Assembler messages: /var/tmp//ccU7e2QF.s:401: Error: Architecture mismatch on "cas". /var/tmp//ccU7e2QF.s:401: (Requires v9|v9a|v9b; requested architecture is v8.) /opt/csw/lib/gcc/sparc-sun-solaris2.10/4.6.2/include-fixed/sys/feature_tests.h:341:2: error: #error "Compiler or options invalid for pre-UNIX 03 X/Open applications and pre-2001 POSIX applications" In file included from /opt/csw/lib/gcc/sparc-sun-solaris2.10/4.6.2/../../../../include/c++/4.6.2/bits/postypes.h:42:0, from /opt/csw/lib/gcc/sparc-sun-solaris2.10/4.6.2/../../../../include/c++/4.6.2/iosfwd:42, from /opt/csw/lib/gcc/sparc-sun-solaris2.10/4.6.2/../../../../include/c++/4.6.2/ios:39, from /opt/csw/lib/gcc/sparc-sun-solaris2.10/4.6.2/../../../../include/c++/4.6.2/ostream:40, from /opt/csw/lib/gcc/sparc-sun-solaris2.10/4.6.2/../../../../include/c++/4.6.2/iterator:64, from ./boost/next_prior.hpp:15, from ./boost/utility.hpp:17, from ./boost/python/instance_holder.hpp:10, from ./boost/python/object/pointer_holder.hpp:14, from ./boost/python/to_python_indirect.hpp:10, from ./boost/python/converter/arg_to_python.hpp:10, from ./boost/python/call.hpp:15, from ./boost/python/object_core.hpp:14, from ./boost/python/object/enum_base.hpp:8, from libs/python/src/object/enum.cpp:6: There were a couple of other errors, they are in the log file. What the current status of Solaris builds? Is there anyone else building Boost on Solaris 10? Are any of the problems that are in the log file know and possible to work around? Maciej

5 10

Re: [boost] Is there interest in a reusable stream-based console?
by Michael Hava 09 Mar '12

09 Mar '12

> I am interested in your library and seeing it become a part of Boost, > however I agree that history, search, auto-complete, etc being integrated > into the library would be key to making it a more useful addition. I'll look into that… > I can understand the header-only motivation, but have you considered > using SWIG (http://www.swig.org/) to wrap you C++ in your favorite > scripting language and then simply re-using the interactive shell > provided by that language? Honestly not, as providing a way to interop with a scripting language was not part of the original idea… (I'm not even that much a fan of scripting languages…) > (example: http://www.youtube.com/watch?v=VHFu6q1twtE ) Looks nice, but it seems you focused far more on the "programming language aspect" than my original design was. You see I developed my first design based on experience in a product I'm working on in my job, where we offer a console in addition to the GUI for faster input. That console is deeply integrated into the program and was never really designed from the ground up to be reusable… > About the interface, I'm not sure if a command should be defined only by a > simple std::function. I've tried it before but I > wasn't able to make it work as more information were required. Maybe I should have explained that a bit more: the command-class uses a std::function internally to store the callback that's to be executed, it's not a std::function.

2 1

Re: [boost] Is there interest in a reusable stream-based console?
by Michael Hava 09 Mar '12

09 Mar '12

@Julien: I haven't looked into boost::program_options yet, though I don't see a problem in integrating the current design in anything as it's merely a class that reads from a std::basic_istream and writes to a std::basic_ostream whilst calling registered callbacks based on the input… The parameters are currently instances of std::basic_string which are passed to the callback which can than operate on these parameters. On the list of commands thing: I thought about that for a while now and would say that something like Lua would be a perfect solution to be combined with the current design to allow that flexible scripting… @Artyom: I've never before heard about GNU Readline; does that mean that consoles like bash don't offer such a functionality to programs automatically (something that even cmd.exe does)? "Help" is meant to be a short help text on the command, similar to a man-page…

5 5

Is there interest in a reusable stream-based console?
by Michael Hava 09 Mar '12

09 Mar '12

I’ve recently started to design a header-only reusable console-class that’s based on std::iostream. It can be customized by adding a variable amount of “commands”. The implementation is currently based on std::stream and may support any compatible stream as input and output. A typical example of usage would be (excluding namespaces): console c(console::case_sensitive);//create case-sensitive console, that reads commands from std::cin and outputs to std::cout and std::cerr c += command(“Name of command”, “Description of command”, “Extended information on parameters of command”, function);//add command to console, whereas function is a std::function c();//execute console; console is executed until function to stop is called Is there any interest in adding such a library to boost? greetz Michael

4 3

[Config] Patch: clang implemented N3276 decltype
by Michel Morin 08 Mar '12

08 Mar '12

Clang implemented N3276 decltype (which does not require type-completeness of a function call expression) Attached a patch for boost/config/compiler/clang.hpp. BTW, BOOST_NO_DECLTYPE_N3276 needs to be a more descriptive name? Regards, Michel

5 13

workarounf for missing uintptr_t on PGI?
by Oliver Kowalke 08 Mar '12

08 Mar '12

Hi, the PGI compiler (pgi- 11.9) seams not to support intptr_t and uninptr_t. Does boost provide a workaround I'm not aware of? Is the PGI compiler relevant (== does it matter if unit-test fails for PGI but pass GCC, MSVC, INTEL)? Oliver -- Empfehlen Sie GMX DSL Ihren Freunden und Bekannten und wir belohnen Sie mit bis zu 50,- Euro! https://freundschaftswerbung.gmx.de

2 4

Using an element of a class A in a constructor of a class B (reflection with boost::python)
by christophe jean-joseph 07 Mar '12

07 Mar '12

Hello everyone, The situation is as follow. I have a C++ code that I haven't written and that I barely can modified. I am supposed to reflect this code in Python with boost. In the code, I have something looking like this: Class A_Base { A_Base(){}; ~A_Base(){}; Whatever virtual and pure virtual functions; } Class A_Derived{ A_Derived(Type1 arg1,...){whatever instructions;} ~A_Derived(){}; Whatever functions; } Class B { B(A_Base& aBase, double& x){}; ~B(){}; Whatever functions; } In the C++ main, at some point aDerived A_Derived is set, and then B(aDerived, x). I need to reflect that under python. Until now, I have been able, with a simple example, to reflect a function f, which is not a ctor, from a class B using A_Base& as argument type, but I can't figure out how to deal with it for a constructor. Based on: http://wiki.python.org/moin/boost.python/ExportingClasses I am declaring f under both its class B and A_Base as follow: .def("f", &B::f) But when I try this for a constructor as f, it refuse to compile. Anyone got a clue? Thank you very much in advance for any further help.

1 0

[move] [container] [unordered] version 1.49.0 and gcc 3.4.3
by Burt, David 07 Mar '12

07 Mar '12

Dear all I am trying to use boost on the LynxOS-SE 5.0.0 operating system. This has gcc 3.4.3 as the tool chain. To validate the library I am running the regression tests. Previously we have used boost 1.39.0 with some minor patches, 1.49.0 has required fewer patches. However I am stuck with the following problem, if someone could suggest a workaround or identify a patch to the toolchain that I can request to be included by LynuxWorks it would be very much appreciated. The technique used by the move, container & unordered libraries to generate specific implementations of methods based on type characteristics does not work on this compiler. I have included the compiler output from one of the tests. Both of the methods defined in move_helpers are generated for the push_back method even though they should be mutually exclusive and one of them should not be generated based on the SFINAE principal. Thanks David. move - move_algorithm - gcc-lynx Compiler output: ../boost/container/vector.hpp: In instantiation of `boost::container::vector<movable, std::allocator<movable> >': ../libs/move/test/move_algorithm.cpp:19: instantiated from here ../boost/container/vector.hpp:996: error: `template<class BOOST_MOVE_TEMPL_PARAM> typename boost::enable_if_c<(((! boost::is_class<BOOST_MOVE_TEMPL_PARAM>::value) || (! boost::move_detail::is_rv<BOOST_MOVE_TEMPL_PARAM>::value)) && (! boost::is_same<T,BOOST_MOVE_TEMPL_PARAM>::value)), void>::type boost::container::vector::push_back(const BOOST_MOVE_TEMPL_PARAM&) [with BOOST_MOVE_TEMPL_PARAM = BOOST_MOVE_TEMPL_PARAM, T = movable, A = std::allocator<movable>]' and `template<class BOOST_MOVE_TEMPL_PARAM> typename boost::enable_if_c<(( boost::is_class<T>::value && boost::is_same<T,BOOST_MOVE_TEMPL_PARAM>::value) && (! boost::has_move_emulation_enabled<BOOST_MOVE_TEMPL_PARAM>::value)), void>::type boost::container::vector::push_back(const BOOST_MOVE_TEMPL_PARAM&) [with BOOST_MOVE_TEMPL_PARAM = BOOST_MOVE_TEMPL_PARAM, T = movable, A = std::allocator<movable>]' cannot be overloaded ../boost/container/vector.hpp:1117: error: `template<class BOOST_MOVE_TEMPL_PARAM> typename boost::enable_if_c<(((! boost::is_class<BOOST_MOVE_TEMPL_PARAM>::value) || (! boost::move_detail::is_rv<BOOST_MOVE_TEMPL_PARAM>::value)) && (! boost::is_same<T,BOOST_MOVE_TEMPL_PARAM>::value)), boost::container::container_detail::vector_iterator<typename boost::container::allocator_traits<A>::pointer> >::type boost::container::vector::insert(boost::container::container_detail::vector_const_iterator<typename boost::container::allocator_traits<A>::pointer>, const BOOST_MOVE_TEMPL_PARAM&) [with BOOST_MOVE_TEMPL_PARAM = BOOST_MOVE_TEMPL_PARAM, T = movable, A = std::allocator<movable>]' and `template<class BOOST_MOVE_TEMPL_PARAM> typename boost::enable_if_c<(( boost::is_class<T>::value && boost::is_same<T,BOOST_MOVE_TEMPL_PARAM>::value) && (! boost::has_move_emulation_enabled<BOOST_MOVE_TEMPL_PARAM>::value)), boost::container::container_detail::vector_iterator<typename boost::container::allocator_traits<A>::pointer> >::type boost::container::vector::insert(boost::container::container_detail::vector_const_iterator<typename boost::container::allocator_traits<A>::pointer>, const BOOST_MOVE_TEMPL_PARAM&) [with BOOST_MOVE_TEMPL_PARAM = BOOST_MOVE_TEMPL_PARAM, T = movable, A = std::allocator<movable>]' cannot be overloaded ________________________________ Please consider the environment before printing this e-mail. The contents of this e-mail message (including any attachments) are confidential to and are intended to be conveyed for the use of the recipient to whom it is addressed only. If you receive this transmission in error, please notify the sender of this immediately and delete the message from your system. Any distribution, reproduction or use of this message by someone other than recipient is not authorized and may be unlawful.

1 0

Shit. Looks like I broke something
by Marshall Clow 07 Mar '12

07 Mar '12

When I run the status tests; I get the following error [ Revision 77175; gcc 4.2.1; Mac OS X 10.7.3; toolset darwin ] > cd $BOOST/trunk/status > ../b2 > MPI auto-detection failed: unknown wrapper compiler mpic++ > Please report this error to the Boost mailing list: http://www.boost.org > You will need to manually configure MPI support. > Performing configuration checks > > - has_icu builds : no > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:604: in object(main-target)(a)26280.add-alternative from module object(main-target)@26280 > error: default build must be identical in all alternatives > error: main target is ../libs/context/build/asm_context_sources > error: with > error: differing from previous default build <toolset>darwin > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:482: in build-main-targets from module object(project-target)@192 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:332: in main-target from module object(project-target)@192 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:397: in find-really from module object(project-target)@192 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:435: in object(project-target)(a)192.find from module object(project-target)@192 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:373: in find-really from module object(project-target)@2522 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:435: in object(project-target)(a)2522.find from module object(project-target)@2522 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:816: in resolve-reference from module targets > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:833: in targets.generate-from-reference from module targets > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:1217: in generate-dependencies from module object(alias-target-class)@2529 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:1266: in object(alias-target-class)(a)2529.generate from module object(alias-target-class)@2529 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:732: in generate-really from module object(main-target)@26276 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:704: in object(main-target)(a)26276.generate from module object(main-target)@26276 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:258: in object(project-target)(a)2522.generate from module object(project-target)@2522 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build/targets.jam:258: in object(project-target)(a)827.generate from module object(project-target)@827 > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/build-system.jam:736: in load from module build-system > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/kernel/modules.jam:283: in import from module modules > /Volumes/EyeFive/Marshall/Sources/boost/trunk/tools/build/v2/kernel/bootstrap.jam:142: in boost-build from module > /Volumes/EyeFive/Marshall/Sources/boost/trunk/boost-build.jam:17: in module scope from module I was building fine; I checked in r77115, which was a bunch of changes in libs/config/test; ran the tests there, all was well. Then I tried a full regression test, and got this. Maybe it was the other changes that were made to build (77190/91/92/93), but they look benign to me. Suggestions on the best way to debug this? -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

3 13

Re: [boost] [Boost-commit] svn:boost r77194 - in trunk: boost/config boost/config/compiler boost/config/stdlib libs/config/doc/html/boost_config libs/config/test libs/config/test/all
by Michel Morin 07 Mar '12

07 Mar '12

Hi Marshall, > Author: marshall > Date: 2012-03-03 22:00:49 EST (Sat, 03 Mar 2012) > New Revision: 77194 > […] > --- /trunk/libs/config/test/boost_no_0x_hdr_array.ipp (original) > +++ trunk/libs/config/test/boost_no_cxx11_hdr_array.ipp 2012-03-03 22:00:49 EST (Sat, 03 Mar 2012) > […] > -namespace boost_no_0x_hdr_array { > +namespace boost_no_0cxx11_hdr_array { `boost_no_0cxx11_hdr_array` should be `boost_no_cxx11_hdr_array` ;) Regards, Michel

2 1

[numeric] Applying trivial bugfix
by Antony Polukhin 06 Mar '12

06 Mar '12

Hi, There are a lot of feature requests to support compilation with disabled exceptions #5731, #5076, #5393, #5800. Fix is trivial and well known: replace throw x; with BOOST_THROW_EXCEPTION(x); in a converter_policies.hpp file. But the library maintainer does not like BOOST_THROW_EXCEPTION because of code bloat. Can I apply another trivial fix: struct def_overflow_handler { void operator() ( range_check_result r ) // throw(negative_overflow,positive_overflow) { #ifndef BOOST_NO_EXCEPTIONS if ( r == cNegOverflow ) throw negative_overflow() ; else if ( r == cPosOverflow ) throw positive_overflow() ; #else if ( r == cNegOverflow ) ::boost::throw_exception(negative_overflow()) ; else if ( r == cPosOverflow ) ::boost::throw_exception(positive_overflow()) ; #endif } } ; Adding this will fix all the tickets and allow some of the dependent libraries to build with disabled exceptions. Boost.Lexical_cast tests will cover Boost.Numeric usage cases with disabled exceptions. Best regards, Antony Polukhin

4 7

[msm]omitting region id at the entry pseudo state
by Takatoshi Kondo 05 Mar '12

05 Mar '12

Hello, Now, I'm using Boost.Msm (Version1.49.0). I have a question about a transition behavior when I omit a region id at the entry pseudo state. The document said that when we use the explicit entry, if the state machine satisfied the conditions below, we can omit the region id. http://www.boost.org/doc/libs/1_49_0/libs/msm/doc/HTML/ch03s02.html#d0e852 " Thanks to the mpl_graph library you can also omit to provide the region index and let MSM find out for you. The are however two points to note: - MSM can only find out the region index if the explicit entry state is somehow connected to an initial state through a transition, no matter the direction. - There is a compile-time cost for this feature. " Because of the discussion below, I believe that this rule can also be applied to entry pseudo states. http://boost.2283326.n4.nabble.com/msm-how-to-distinguish-region-ids-tt3612… However, when I omitted the region id, the state machine transitioned to the SubState1. struct Entry1:msmf::entry_pseudo_state<> {}; If I provided the region id, the state machine transitioned to the SubState2. struct Entry1:msmf::entry_pseudo_state<0> {}; See entry_pt_omit_rid.cpp (Attached file) As far as I can understand, Entry1 and SubState1, initial_state, are connected. (See fig.png) Is there any reason that I can't omit the region id in this case? Thanks, Takatoshi

2 3

[Thread] Dll Plugin depending from boost thread
by Keraval Yannick 05 Mar '12

05 Mar '12

Hi guys, An application developed in my company uses the concept of "plugin" which relies on the use of DLL (windows 7 box, Visual Studio 2005). We are using Boost v 1.43 and when loading a plugin with a call to LoadLibrary, application asserts with the following message Debug Assertion Failed! Program: C:\Windows\system32\regsvr32.exe File: f:\dd\vctools\vc7libs\ship\atlmfc\src\mfc\dllinit.cpp Line: 587 --> ASSERT(AfxGetModuleState() != AfxGetAppModuleState()); We could point out that this is due to the use of the boost thread library. A quick google search pointed us to an issue in the Boost.Thread library (e.g. http://stackoverflow.com/questions/5355931/adding-include-boost-thread-mutex -hpp-breaks-my-activex-control). One proposed solution is to build a DLL instead of a static lib but this is impossible in our company (only plugin can be compiled as dll). We also try to update boost to V1.49 but the debug assertion is still raised. Is there another way to fix this ? We could not find any ticket related to this problem (neither in the opened tickets nor in the closed tickets), is this behavior considered as normal ? Thanks -- View this message in context: http://boost.2283326.n4.nabble.com/Thread-Dll-Plugin-depending-from-boost-t… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Parts of linkflags are disappearing: $ISALIST gone
by Maciej (Matchek) Bliziński 05 Mar '12

05 Mar '12

My linkflags setting involves a dollar sign: linkflags='-R/opt/csw/lib/$ISALIST' The $ISALIST dynamic token tells the linker to iterate through supported instruction sets and pick the best one[1]. When the Boost binaries are built, the RPATH in the binaries is missing the dollar sign and everything after it: $ /usr/ccs/bin/dump -Lv work/solaris10-sparc/pkgroot/opt/csw/gxx/lib/sparcv9/libboost_iostreams.so.1.49.0 | grep RPATH [13] RPATH /opt/csw/lib/64:/opt/csw/gxx/lib/:/opt/csw/gxx/lib/64:/opt/csw/lib/ Do you see the /opt/csw/lib/ bit with the slash at the end? It could be explained by the contents of linkflags being interpolated by a shell. In my build, it's important to pass the dollar sign unchanged. Here's an example of correctly set RPATH: /usr/ccs/bin/dump -Lv /opt/csw/lib/libz.so.1 | grep RPATH [6] RPATH /opt/csw/lib/$ISALIST:/opt/csw/lib I need to pass the same flag to Boost libraries. Has anyone else seen this problem? Maciej [1] http://docs.oracle.com/cd/E19082-01/819-0690/appendixc-3/index.html

1 0

[context] Providing template class enumerate in context.hpp
by Julien Nitard 04 Mar '12

04 Mar '12

Hi all, I am trying to use the newly accepted boost.context and I am wondering why something as useful as the template enumerate is not diretly given when including "context.hpp" and not even in a separate header. Since it's in the doc it would be a good addition IMHO. Thanks, Julien PS: the link to boost.context doc is broken and the git repos seems to have moved.

5 14

bug in gcc.jam
by Oliver Kowalke 04 Mar '12

04 Mar '12

Hello, gcc.jam:451 applies always -m32 for 32bit systems. In the case of ARM architecture this is false because gcc on arm does not recognize -m32. In order to correct this issue I need to know how to test for ARM architecture at this code line (sorry I'm not that boost.build expert). Oliver

1 0

boost::adaptors::keys for mutable ranges of pairs
by Valentin Ziegler 04 Mar '12

04 Mar '12

Hello, map.hpp defines two overloads for adaptors::values, one for StdPairRange& and another for const StdPairRange const& rng. On the other hand, there is just a single adaptors::keys which takes StdPairRange const&. In particular, the code below will not compile: boost::find_if( boost::adaptors::keys(rng), SomePredicate() ).base()->second=NewValue(); Therefore, I would propose an adaptors::keys(StdPairRange& rng) overload similar to adaptors::values(StdPairRange&). Iterators of the returned range shall have a mutable base iterator. Further, iterators of the returned range should have a reference type of range_value<StdPairRange>::type::first_type& , so the elements in keys are mutable where StdPairRange admits this. Regards, Valentin -- Valentin Ziegler | vziegler(a)think-cell.com Software Engineer think-cell Software GmbH | Chausseestr. 8/E | 10115 Berlin | Germany http://www.think-cell.com | phone +49 30 666473-10 | US phone +1 800 891 8091 Amtsgericht Berlin-Charlottenburg, HRB 85229 | European Union VAT Id DE813474306 Directors: Dr. Markus Hannebauer, Dr. Arno Schoedl

2 1

[config] std::unique_ptr, std::ref detection?
by Peter Dimov 04 Mar '12

04 Mar '12

Suppose I want to implement a shared_ptr constructor taking std::unique_ptr. To avoid breaking pre-C++11 compilers, I need to, at least, know whether <memory> contains std::unique_ptr. (I'd also like to know if there's std::ref in <functional> because the specification of the constructor uses it.) But the config library doesn't seem to provide a way. There's no macro for std::unique_ptr, and there's no macro for "generic C++11 compiler and library".

9 23

Possible Bug in Boost Geometry's Huiller Algorithm
by Brian Ahr 03 Mar '12

03 Mar '12

Hi Folks. I was looking at the implementation of the huiller algorithm in boost, and it seems to be partially incorrect. See boost/geometry/strategies/spherical/area_huiller.hpp In the apply() function, we have if(lon2 < lon1){ E =-E;} which I believe should instead be calculation_type lon;if( lon2 < lon1 ) lon = lon1 - lon2;else lon = lon1 - lon2 + two_pi;if(2* half_pi < lon ) E =-E; according to Graphics Gems 5, pg 45 - 46. The comments at the top of the C++ file state that the code was derived from code in Graphics Gems 4, though the code was later corrected in Graphics Gems 5. I noticed this when trying to calculate areas of polygons on a sphere, where one of the points was (0, 0). In that case, it would always return a negative area, even though the polygon was defined counter-clockwise. Using a point other than (0,0) seemed to alleviate the problem, which got me wondering what was going on. Can anybody else confirm that this is an issue? Any suggestions for cleanly overriding boost's implementation until this is fixed? Thanks! - Brian

2 2

[predef] Thanks for all the comments..
by Rene Rivera 01 Mar '12

01 Mar '12

I would like to than everyone who reviewed and/or commented on my library. Instead of trying to respond individually to each point raised I will do a single post about all the points I've gathered, and will gather when I reread all the posts. Hopefully I can write that up by Monday. Needless to say there are a few changes I need to do, regardless of acceptance results :-) Again, thanks to all. And thanks to Joel for managing the review. Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

1 0

Adapting Polygon to work with point attributes
by Paul Miller 01 Mar '12

01 Mar '12

Boost::Polygon looks like exactly what I need to do some boolean operations on polygons but my polygons have additional attributes per point that I want to carry through the operation. But I can't figure out how to get polygon to create sensible values for the attributes other than X,Y, and I can't find an example that covers this scenario. It seems from the documentation that this is possible however. Can someone point me to an example, to say, adapt a polygon with this Point type? struct Point { int x, y; float r, g, b, a; }; Ideally it would average new r, g, b, a values together to make new points and polygon join points, but it could just copy one of the existing Points' attributes instead. I'm not picky. Cheers!

2 2

[TypeTraits] Patch: improving detectability of clang's intrinsics
by Michel Morin 01 Mar '12

01 Mar '12

Attached a patch to improve detectability of `__is_pod` and `__is_empty` intrinsics in clang. This is done by newly introduced `__has_feature(__is_pod__)` and `__has_feature(__is_empty__)` macros. (Clang trunk now accepts feature names with preceding and following double underscores.) Regards, Michel

2 1

Re: [boost] [git] neglected aspects
by Brian Wood 01 Mar '12

01 Mar '12

Dave Abrahams: > I don't see any advantage at all in having a "Boost supertree." If I > need a cluster of five libraries to get a job done, I don't see a reason > to mess around with anything more than those five. And with the > dependencies properly encoded, I won't even have to ask for all of those > explicitly. +1 for keeping things simple. This effort has been discussed for years. Is it close to being ready? Regards, Brian Wood Ebenezer Enterprises http://webEbenezer.net

1 0

[PREDEF] Review
by Ioannis Papadopoulos 29 Feb '12

29 Feb '12

> - What is your evaluation of the design? The design is straightforward and I find it nice, with some exceptions: - BOOST_ARCHITECTURE_* is too long (BOOST_ARCH_* is better) - BOOST_LANGUAGE_* is too long (BOOST_LANG_* is better) - BOOST_CXX would be better if called BOOST_COMPILER or BOOST_COMP - There has to be some macro for compilers that do emulation (for example Intel, PathScale etc appear also as gcc). - I do not like the fact that all macros are defined with a 0 when the compiler/arch/whatever is non-existant. I prefer to do # ifdef BOOST_CXX_GNU ... # endif rather than # if BOOST_CXX_GNU ... # endif - BOOST_VERSION_NUMBER allows only 3 numbers. I don't think that this is the case for all compilers/libraries. - There are some platforms that have unique features (for example Cray machines, IBM BlueGene etc). A BOOST_PLATFORM_* macro would be nice. > - What is your evaluation of the implementation? Including one file includes pretty much everything. It would be more straightforward if everything was in one file (for example merge everything in architecture/ in architecture.h). This also solves the issue of defining macros for things that don't exist. > - What is your evaluation of the documentation? No considerable problems with the documentation. Maybe it should be mentioned what the library supports. > - What is your evaluation of the potential usefulness of the library? I already have something similar in a lot of my codes. I would gladly remove them and use predef - especially if it detects also platforms. > - Did you try to use the library? With what compiler? Did you have any problems? Yes, PathScale is recognized as both gcc and pathscale. > - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? A quick reading of the documentation and the code. I ran a small test case. > - Are you knowledgeable about the problem domain? Yes. > - Do you think the library should be accepted as a Boost library? I think that it should be ACCEPTED with the requirement that all issues have been resolved; especially the compiler recognition.

1 0

Determining interest: Pure imaginary number library
by Matthieu Schaller 29 Feb '12

29 Feb '12

Dear all, I have recently been playing a lot on numerical analysis problems containing complex numbers and functions. I have been using the SL std::complex<> library and could observe that some of the algorithms weren't optimized in cases where complex numbers have to be multiplied by pure imaginary numbers (i.e. x*sqrt(-1)). I have implemented a class to represent these numbers and overloaded all relevant operators in a more optimized fashion thanks to the knowledge that the real part of these complex numbers is 0. I could observe an important speed-up in some calculations. As an example, this piece of code (1D Schroedinger equation using finite differences): for(size_t i(0); i<nbPoints; ++i) { Psi_new[i] = Psi_old[i] + ii * hbar * deltaT / (12.*m*deltaX*deltaX) * (-Psi_cur[i-2] + 16.*Psi_cur[i-1] - 30.*Psi_cur[i] + 16.*Psi_cur[i+1] - Psi_cur[i+2]) - 2. * ii * V(x[i]) / hbar * deltaT * Psi_cur[i]; } is more than 2 times faster (g++ 4.6.1 core i7 2820QM) when the imaginary unit (constant) variable ii is defined to be Imaginary<double> ii(1.); than when it is defined as std::complex<double> ii(0.,1.); Some other expressions also benefit from this improvement and can run faster. Expressions including square roots or exponentials of pure imaginary numbers are improved a lot. The range of application of such a class is quite narrow but it may be helpful to speed-up some simple numerical problems. The source code as well as a working example is available here: http://code.google.com/p/cpp-imaginary-numbers/ Thanks, Matthieu

8 21

How to build on VC11?
by Olaf van der Spek 29 Feb '12

29 Feb '12

Hi, How does one build Boost 1.49 on VC11? It keeps using VC10. -- Olaf

2 1

[assign] list_of ambiguous overload with C++11
by Kim Barrett 29 Feb '12

29 Feb '12

This thread http://lists.boost.org/boost-users/2011/06/68641.php mentions a problem encountered with boost::list_of with C++11 features. It was reported against boost 1.46, and Thorsten said in that thread that a fix was being developed and "should be there soon". It was mentioned in that thread that it was probably already too late for boost 1.47. This problem still seems to be present in boost 1.49. Wondering what happened to that fix. I can probably use the patch from that thread, but a real fix in boost would obviously be better. BTW, what happened to web-based svn browsing of the boost repository? That used to be available (there was a link on the downloads page), but seems to have disappeared. There doesn't seem to be an easy way for a casual observer like me to look at history to see if there's been any possibly relevant changes.

2 2

[PREDEF] Review
by Dan Price 29 Feb '12

29 Feb '12

Hi everyone, This is my first review of a boost library but I have been a long-time boost user. I am excited by this proposal because it is a library that I would use on the day that it is accepted and it fills the need for what is otherwise a hackish and inconsistent task. My review of the library is included below. Thank you, Dan Price **What is your evaluation of the design?** The macros are clear. The BOOST_ARCHITECTURE_ macros are a little too long to type; I would advocate for changing them to BOOST_ARCH_ to make it quicker to type. Note that the operating system macro is BOOST_OS_ and not BOOST_OPERATINGSYSTEM, and BOOST_CXX vs. BOOST_COMPILER, so there is already a precedent for shorter names. The other ones are easy to type and appropriate. Within the headers there are human-readable strings that are intended to be used with a built-in test. It seems as if these might be useful to make these available for other purposes such as debugging. I wanted to add a comment to a question that showed up prevalently on the mailing lists regarding NULL vs. zero for definitions. Before reading this thread, but after having read the documentation, I assumed that definitions took on a NULL (undef) value. That is to say that even after reading the documentation, I made a faulty assumption because of my previous experience with platform detection. I would therefore advocate that an #undef approach be used rather than the zero-based one in order to avoid any gotchas. **What is your evaluation of the implementation?** The design goals of minimal "weight" from the predef headers is a good one. I personally do not think there is much to worry about regarding the implementation as long as the user-facing features (names, completeness) are good. **What is your evaluation of the potential usefulness of the library?** This is a library that I would use on the day that it was introduced to boost and I would even consider patching the distribution of boost I have in version control with this library. **Did you try to use the library? With what compiler? Did you have any problems?** I compiled the tests on a 64-bit version of ubuntu Linux and they worked as expected. **How much effort did you put into your evaluation? A glance? A quick reading? In-depth study?** My effort consisted of reading through the documentation and exploring the headers. I also compiled the tests on one platform and they worked as expected. **What is your evaluation of the documentation?** The documentation is acceptable, but I think that version number description can be cleaned up a bit. Specifically, rather than repeating "Version number available as major, minor, and patch." over and over, perhaps a graphic or an abbreviation can be used? Alternatively this may be better laid out as a table. One error in the documentation (also in the source): "American Micro Devices" -> "Advanced Micro Devices" **Are you knowledgeable about the problem domain?** I am knowledgeable of the preprocessor symbols of the 3 compilers and 3 systems I typically use. My normal habit for systems I am unfamiliar with is to search for information at predef.sourceforge.net but this library would clean up and simplify that work considerably. Additionally, I can see my team members who are not as familiar with detection mechanisms finding this library very useful. **Summary** In summary, I think that this library should be *conditionally accepted* as a boost library, provided that the issue regarding the NULL vs. 0 values for preprocessor symbols be worked out. I am an advocate of the NULL-based approach because it best matches what my expectations are.

1 0

[PREDEF] Review for the Boost.Predef library by Rene Riviera
by Joel Falcou 29 Feb '12

29 Feb '12

The review of BOOST.PREDEF by Rene Riviera is scheduled between Monday, February 20th to February 29th. ================ Contents & Scope ================ BOOST.PREDEF defines a set of compiler, architecture, operating system, and library version numbers from the information it can gather of C++ predefined macros or those defined in generally available headers. The idea for this library grew out of a proposal to extend the Boost Config library to provide more, and consistent, information than the feature definitions it supports. What follows is an edited version of that brief proposal. =============== How to get it ? =============== Sources and documentation can be retrieved from http://tinyurl.com/73n6a3k ================ Writing a Review ================ The reviews and all comments should be submitted to the developers list, and the email should have "[PREDEF] Review" at the beginning of the subject line to make sure it's not missed. Please explicitly state in your review whether the library should be accepted. The general review checklist: - 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 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.

15 34

[PREDEF] Review ends today
by Joel Falcou 29 Feb '12

29 Feb '12

The review of Boost.PRedef by Rene Rivera is ending today, February 29th. I recall to all people wanting to submit a formal review to do so. Regards

1 0

[Predef] Pre-review comments
by Mathias Gaunard 28 Feb '12

28 Feb '12

Misc ==== - This stuff partially exists in Boost.Config. How will this be integrated? - AMD stands for Advanced Micro Devices, not American Micro Devices - The whole set of C and C++ standard libraries doesn't seem to be covered. Are we supposed to infer it from the compiler or operating system? Naming ====== - BOOST_ARCHITECTURE_ is maybe a bit long. Have you considered a shorter name like BOOST_ARCH_ALPHA ? Same comment for BOOST_LANGUAGE_ - BOOST_LANGUAGE_XXX uses a STD prefix for most languages except for Objective-C. How about dropping the STD prefix? Also why not use CXX instead of CPP? - Standard C library is identified by LIBC, but standard C++ library is identified by LIBSTD. I find that confusing, it should be orthogonal. I take it LIBCXX wasn't chosen due to possible confusion with libc++. It's their fault for choosing a ridiculously broad name. glibc is often just called libc as well, yet this is not a problem. - BOOST_CXX_GNUC might be better as BOOST_CXX_GNU or BOOST_CXX_GCC - BOOST_OS_DRAGONFLY_BSD might be better as BOOST_OS_BSD_DRAGONFLY to indicate that "macro refinement" goes left to right. It could be BOOST_OS_BSD_FREEBSD for FreeBSD. Compiler frontend vs backend ============================ The BOOST_CXX_ macros is used to define both frontends (BOOST_CXX_CLANG, BOOST_CXX_EDG) and backends (BOOST_CXX_LLVM) and things that can be both (BOOST_CXX_GNUC) As for BOOST_CXX_CYGWIN, I have no idea what it's doing there. Cygwin should be exclusively in BOOST_OS_CYGWIN. The compiler is a normal GCC. As such it might be hard to tell which set of flags might be defined at the same time. Maybe the solution would be to split the set of frontends and backends, with each value in each set being mutually exclusive. Most compilers do not decouple frontends and backends, so it will end up with a lot of unnecessary duplication though. Non-mutually exclusive macros ============================= Currently, the only macros that are not mutually-exclusive (outside of the CXX macros outlined above, since they cover two different things) are the BOOST_OS_BSD macros along with BOOST_OS_UNIX and BOOST_OS_SVR4. It might be a good idea to expand on that on the architecture side (i.e. any x86, 32 or 64 bit), and the compiler side (GCC-like compilers). There are many variants of ARM as well, and a new 64-bit ARM will be released soon. The design needs to be flexible enough to integrate this. It might be good as well to put a clear distinction between a set of mutually-exclusive macros and more global macros that can cover several configurations. My use-cases ============ Just a few real use cases for which I use custom code in my software today, and that I'd be glad to replace: - Work-around a bug in the GCC frontend - Use a feature present in GCC-like frontends - Work-around a bug in the GCC backend - Define special versions of functions for x86 both 32- and 64-bit - Define special versions of functions for x86-64 only - Use special code for Windows or POSIX operating systems (for that, I currently use BOOST_SYSTEM_WINDOWS_API / BOOST_SYSTEM_POSIX_API)

4 11

Re: [boost] [git] neglected aspects
by David A. Greene 28 Feb '12

28 Feb '12

> The only downside (I can see) with GIT is that it has a bit of a learning curve. It is a bit more complicated but I believe (and experienced myself) that a lot of that learning curve is unnecessarily steep due to the way many of the tutorials out there are written. For some reason most of them start out describing the guts and inner workings of git (blobs, trees, packs, etc.) rather than teaching workflows. The one great exception I've found to this is Scott Chacon's fabulous _Pro_Git_ (http://progit.org/book) It teaches you how to use git to manage sources. Reading that is what make it "click" for me. -Dave

17 42

Is there interest in portable integer overflow detection, with policy based handling?
by Ben Robinson 28 Feb '12

28 Feb '12

The implementation is complete, with 5 policies created (and users can always create and use more). The policies are: ignore_overflow throw_overflow assert_overflow saturate_overflow nan_overflow The implementation is fully portable, and it provides integer types which can be used like the builtin integers, except they will trigger their policy on an overflow. Also, this library will integrate seamlessly with the Boost Constrained Value Library (contributed by Robert Kawulak). Does this pique anyone's interest? Thank you, Ben Robinson

11 37

Please use BOOST_ASSERT_MSG(x, "message") instead of BOOST_ASSERT(x && "message")
by Mathias Gaunard 28 Feb '12

28 Feb '12

Several libraries, including Boost.Array, use things like BOOST_ASSERT( i < N && "out of range" ); This causes warnings with EDG-based compilers. It would be nice if library authors could replace this with something like BOOST_ASSERT_MSG( i < N, "out of range" ); Not only will it make those warnings disappear, it will also enable users to use those messages more efficiently in custom assert handlers. Thank you.

3 3

[test] Dynamic linking problem?
by Matthijs Möhlmann 28 Feb '12

28 Feb '12

Hello all, Attached a testcase how I use the boost test library. Compiling goes well, but when I try to run it I get a 'symbol lookup error': matthijs@hammer % ./main ./main: symbol lookup error: ./main: undefined symbol: _ZN5boost9unit_test9ut_detail24auto_test_unit_registrarC1ENS0_13basic_cstringIKcEE I compile my files with the following lines: g++ -o main.o -c -I/usr/src/boost_1_49_0 -g -Werror -Wall -std=c++0x main.cpp g++ -o test.o -c -I/usr/src/boost_1_49_0 -g -Werror -Wall -std=c++0x test.cpp g++ -o main -L/usr/src/boost_1_49_0/stage/lib main.o test.o -lboost_unit_test_framework This is done with a fresh install of boost 1.49. (Compiled with ./bootstrap.sh && ./b2 -j3) Compiler: gcc-4.6 If I use the most recent version of trunk (r77131) then everything works as expected. If more information is needed, please let me know. Regards, Matthijs Möhlmann

1 0

[uBLAS] array_adaptor, shallow_array_adaptor, interoperability and bugs
by Guillermo Ruiz Troyano 28 Feb '12

28 Feb '12

It is my first post. I still write worst in English than in C++. I hope don't mess it up… INTEROPERABILITY I'm been trying to use array_adaptor and shallow_array_adaptor to modify data with uBLAS. Yes, both classes are undocumented but it is useful (not this implementation) in some cases to have this kind of adaptor. For example: // Statistics accumulator for regression, correlation, etc. struct simple_regression { void operator()(double x, double y) { … } double mean_x; double var_x; double mean_y; double var_y; double covar; vector_wrapper<double> v() { … } // Return vector with a reference array adapter }; Now, you need (for example) to interpolate two accumulators. Then you should to be able to do: simple_regression sr, sr1, sr2; … double w = 0.5; sr.v() = sr1.v()*w+sr2.v()*(1-w); And you don't want that uBLAS copies data from you objects to inner containers continuously. UNDOCUMENTED ATTEMPT array_adaptor<T> has deep copy semantics. You can to construct an array_adaptor that use the external data, but vector call to copy constructor and this makes a copy: struct point { double x; double y; double z; }; point p = { 1, 2, 3 } array_adaptor<double> a(3, &p.x); // Ok, a holds p address vector<double, array_adaptor<double> > v(a); // v now holds a new address! Well, a bit confusing class. If the only purpose of this class template is to pass plain data as arguments. Why not to put that constructor in unbounded_array and bounded_array? unbounded_array(size_t size, T* data) : size_(size), data_(new value_type[size]) { std::copy(data, data+size, data_); } Then, I found shallow_adaptor_array, more dangerous and funny. It has shallow copy semantics and a dummy shared_array with reference counting... ¿? // Yes, I want troubles… #define BOOST_UBLAS_SHALLOW_ARRAY_ADAPTOR struct point { double x; double y; double z; }; void test() { point p = { 1, 2, 3 } shallow_array_adaptor<double> a(3, &p.x); // Ok, a holds p address vector<double, shallow_array_adaptor<double> > v(a); // Ok, v holds p address v += v; // Ok, now p = { 2, 4, 6 } v /= 2; // Ok, now p = { 1, 2, 3 } v = 2*v; // ¡¡¡What!!! p = { 1, 2, 3 } } // Dummy functor of shared_array in shallow_array_adaptor called, ok. When you assign v with an expression, this constructs a temporary and then swaps between the temporary and v. Here is the issue: class shallow_array_adaptor<T> : … { ... // Swapping BOOST_UBLAS_INLINE void swap (shallow_array_adaptor &a) { if (this != &a) { std::swap (size_, a.size_); std::swap (own_, a.own_); std::swap (data_, a.data_); // This is definitely infidelity } } ... }; This is not a good idea. This member function should have a dual behavior: class shallow_array_adaptor<T> : … { ... // Swapping BOOST_UBLAS_INLINE void swap (array_adaptor& a) { if (own_ && a.own_) { // If they own the data do wife-swapping if (this != &a) { std::swap(size_, a.size_); std::swap(own_, a.own_); std::swap(data_, a.data_); } } else if (&data_[0] != &a.data_[0]) std::swap_ranges(data_, data_+size_, a.data_); // Childs is another thing } ... }; Modifying this function I get: void test() { point p = { 1, 2, 3 } shallow_array_adaptor<double> a(3, &p.x); // Ok, a holds p address vector<double, shallow_array_adaptor<double> > v(a); // Ok, v holds p address v = 2*v; // Ok, now p = { 2, 4, 6 } and v holds p address } // 0kills of dynamic memory WHY NOT? 1. An unbounded_array and bounded_array constructor for C plain arrays and copy semantics. 2. To discontinue this adaptor_array (with a #ifndef) or modify. Its behavior can do it point nº1. 3. To fix, test and document shallow_array_adaptor (or another name). It should be useful. Yes, I know about memory leaks. But there are things like vector proxies, iterator ranges, etc. The problem comes when you have not a clear semantic. Regards, Guillermo Ruiz Troyano.

2 2

[exception] RFC: patch for printing stacktraces during exceptions.
by Brett Lentz 27 Feb '12

27 Feb '12

Hi folks! It's been a few months since I last mailed the list. I've been working on bringing some forked changes from the Passenger project into Boost due to their more general applicability. With some help, I've got a working patch against SVN trunk that enables one of Passenger's more useful features: obtaining exception stacktraces all the way through the stack. However, due to the size of the patch and some namespacing choices made by the Phusion people, I'd like to get some feedback on this patch to ensure it's suitable for being brought into Boost. First, there's some helper classes that Phusion has put in an "oxt" namespace that I'm not really sure where they should be put or if suitable analogues already exist within Boost. For the current version of the patch, these files are simply put into 'boost/oxt' until I have a better location for them. Second, the current patch uses boost::tracable_exception. I'd like to confirm whether that is acceptable or whether I should move this to a different location in the boost namespace. Finally, any other comments about this patch are welcome. I have attached both the patch, and some example code that will demonstrate the functionality. The patch and a simple example are available here: http://wakko666.fedorapeople.org/boost/ ---Brett.

5 9

Re: [boost] Is there interest in static code analysis?
by Ben Robinson 27 Feb '12

27 Feb '12

I would be interested in that static analysis tool. Thank you, Ben Robinson Sent from my Verizon Wireless smartphone Antony Polukhin <antoshkka(a)gmail.com> wrote: >Hi, > >I`ve recently found a tool and organization, that specializes on >static code analysis for C/C++. They already interact with some famous >open source projects and successfully find bugs. Looks like for >open-source projects they help for free. > >If someone is interested, I can send their web address in private >message (don`t want to ad on mailing list) > >Best regards, >Antony Polukhin > >_______________________________________________ >Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

vsix - template_profiler extension
by Brandon Kohn 27 Feb '12

27 Feb '12

Hello, I've put together a Visual Studio 2010 extension package which wraps the functionality of Steven Watanabe and Domagoj Saric's template_profiler to create a template profile tool. It also adds a command to profile the build time of a project or a single C++ file. Both functions are accessed from the context menu in the solution explorer tree-view. It's still fairly young and could use some kicking about. Are there any VC10 users here that would be interested in giving it a try? Cheers, Brandon

5 16

Is there interest in static code analysis?
by Antony Polukhin 27 Feb '12

27 Feb '12

Hi, I`ve recently found a tool and organization, that specializes on static code analysis for C/C++. They already interact with some famous open source projects and successfully find bugs. Looks like for open-source projects they help for free. If someone is interested, I can send their web address in private message (don`t want to ad on mailing list) Best regards, Antony Polukhin

1 0

[unicode] provide <boost/cuchar.hpp> header?
by Beman Dawes 27 Feb '12

27 Feb '12

The C++11 standard library provides a header <cuchar>, with a bit of Unicode support, based on C's <uchar.h>: Macros: __STDC_UTF_16__, __STDC_UTF_32__ Functions: mbrtoc16, c16rtomb, mbrtoc32, c32rtomb The functions provide conversion between char sequences and UTF-16/UTF-32. It would be useful to have a <boost/cuchar.hpp> header so that these functions could be used with existing compilers and standard libraries. Does anyone have an implementation of these functions they would be willing to contribute? --Beman

3 2

[mpl] ASSERT and other macros using unique IDs
by lcaminiti 26 Feb '12

26 Feb '12

Hello all, Currently BOOST_MPL_ASSERT_MSG cannot be expanded multiple times on the same line because (on GCC and alike) it uses __LINE__ to generate unique IDs. I have to program a macro that makes a bunch of static assertions when it expands so all these assertions made using BOOST_MPL_ASSERT_MSG are on the same line. I used BOOST_MPL_ASSERT_MSG_IMPL to pass the unique ID directly (which is generated by concatenating __LINE__ with the assertion counter which my macro keeps). However, this is not an ideal solution because BOOST_MPL_ASSERT_MSG_IMPL is part of a private API and it could change in the future. Is there any interest in making BOOST_MPL_ASSERT_IMPL part of the public API? (So I can directly pass the unique ID to use. I'd be best if the unique ID is not required to be numeric but just a concatenable token.) I had a similar issue with Boost.Concet's REQUIRES. #define CONTRACT_AUX_MPL_ASSERT_MSG_(counter, condition, message, types) \ /* unfortunately, need to use Boost.MPL implementation detail */ \ /* to pass unique ID (not just __LINE__) so this macro can be expanded */ \ /* multiple times on the same line if with different IDs */ \ BOOST_MPL_ASSERT_MSG_IMPL( \ BOOST_PP_CAT(BOOST_PP_CAT(message, _id_), counter), \ condition, message, types) // PUBLIC // // Allow to expand multiple assert macros on same line (without name clashes). #define CONTRACT_AUX_MPL_ASSERT_MSG(condition, message, types) \ CONTRACT_AUX_MPL_ASSERT_MSG_( \ BOOST_MPL_AUX_PP_COUNTER(), /* uses Boost.MPL impl detail */ \ condition, message, types) Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-mpl-ASSERT-and-other-macros-using-… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[gsoc] project ideas
by Andrew Sutton 26 Feb '12

26 Feb '12

Just a reminder: if you have project ideas for Google Summer of Code, please submit them, either to me or post them here https://svn.boost.org/trac/boost/wiki/SoC2012 (under "Projects"). I think that this, any project ideas are fair game. I'm not terribly concerned with completely finishing something over the course of a single summer or having a goal of getting something into the main Boost release. I'd like to foster long-term participation in the Boost community, and I'd like to see more ambition in the kinds of problems we want students to tackle. Proposals for XML, some aspects of a UI library (whatever that entails), user input library (mice, raw-mode key input, touch, and physical sensors?), networking and protocol standards, etc. should be fair game. We can always set reasonable summer-long expectations for more ambitious projects. Obviously, short-term projects are fine -- I'm linking to Feature Requests as a source of project proposals -- but I hope that won't be the only kind of project proposed. If you have ideas, please post them earlier rather than later.. Thanks, Andrew

1 0

Inconsistency between std::minmax and boost::minmax
by Marshall Clow 25 Feb '12

25 Feb '12

So, C++11 has been approved, and in the new standard library, there is: template <typename T> std::pair<const T&, const T&> minmax ( const T& a, const T& b ) but in Boost, we've got: template <typename T> tuple< T const&, T const& > minmax(T const& a, T const& b) { I can easily change boost minmax to return a pair instead of a 2-element tuple, but that's an interface change, and might break existing code. On the other hand, giving them the same interface will make it easier for people to move to C++11's library functions. Any opinions? ideas? -- Marshall P.S. boost::minmax_element, on the other hand, already returns a pair, not a two-element tuple. I'm pretty sure it doesn't satisfy the C++ complexity requirements, but that's easily fixed.

3 3

Fix docs for boost.fusion
by niXman 25 Feb '12

25 Feb '12

Hello list. Diff is attached. -- Regards, niXman

2 5

Boost 1.49.0 release notice
by Beman Dawes 24 Feb '12

24 Feb '12

Release 1.49.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 one new library (Heap) and numerous enhancements and bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_49_0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.49.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 Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

3 2

[1.49.0] Release candidate 2
by Beman Dawes 24 Feb '12

24 Feb '12

Another set of release candidate files is up at http://boost.cowic.de/rc/ Could someone please check that the doc files are now correct? Thanks, --Beman

4 4

[1.49] Release candidate PDF doc build available
by John Maddock 24 Feb '12

24 Feb '12

I've put a release candidate of the PDF documentation build for 1.49 here: https://sourceforge.net/projects/boost/files/boost-docs/1.49.0/ Let me know if there are any SNAFU's, Enjoy, John.

3 15

[integer] Bug in int_t<65>
by Vicente J. Botet Escriba 24 Feb '12

24 Feb '12

Hi, I was trying to instantiate a boost::int_t<65>::least and I didn't got an error. Unfortunately the size of the obtained type was 8. I think that there is an error in the meta-function class as there is a comparison without and with the sign bit in // ** template< int Bits > // bits (including sign) required struct int_t : public detail::exact_signed_base_helper<Bits> { typedef typename detail::int_least_helper < #ifdef BOOST_HAS_LONG_LONG (Bits-1 <= (int)(sizeof(boost::long_long_type) * CHAR_BIT)) + // ** #else 1 + #endif The same applies to uint_t. The fix of course consists in checking (Bits <= (int)(sizeof(boost::long_long_type) * CHAR_BIT)) + // ** Please could this be fixed in trunk? Best, Vicente

2 1

[spirit][qi] Fastest way to parse file
by Antony Polukhin 24 Feb '12

24 Feb '12

Hi, Boost.Spirit documentation advices to use multi_pass iterators for parsing files (or reading data to a STL container and then passing the begin and end of the container to Spirit.Qi). Much better solution would be to use a memory mapped file: boost::interprocess::file_mapping fm(filename.c_str(), boost::interprocess::read_only); boost::interprocess::mapped_region region(fm, boost::interprocess::read_only, 0, 0); const char* begin = reinterpret_cast<const char*>(region.get_address()); const char* const end = b + region.get_size(); Comparing to multi_pass iterator, mmap approach increased parsing speed more than 5 times, reduced memory usage and CPU load. Mmap approach is also a little bit faster than reading data to STL container and mmap sometimes requires less memory (depending on OS). I think, that such solution should be at least mentioned in Spirit documentation. May be mmap shall be wrapped in some class for tighter integration with Spirit and simpler usage: int main() { namespace spirit = boost::spirit; using spirit::ascii::space; using spirit::ascii::char_; using spirit::qi::double_; using spirit::qi::eol; spirit::file_parser first("multi_pass.txt"); // class that does mmap`ing std::vector<double> v; bool result = spirit::qi::phrase_parse(first , spirit::make_default_multi_pass(base_iterator_type()) , double_ >> *(',' >> double_) // recognize list of doubles , space | '#' >> *(char_ - eol) >> eol // comment skipper , v); // data read from file if (!result) { std::cout << "Failed parsing input file!" << std::endl; return -2; } std::cout << "Successfully parsed input file!" << std::endl; return 0; } Best regards, Antony Polukhin

3 4

Updated boost::base_from_member for C++2011
by Daryle Walker 22 Feb '12

22 Feb '12

This is in changeset 76982. I tried it on my system, with Apple-supplied GCC 4.0.1 and GCC-direct 4.6 (from MacPorts) on a Mac/PowerPC system. It just does the slam-dunk implementation of this concept that C++2011 allows (and therefore showing its power). The new code should be isolated to only systems that can handle it. Now the code is over the wall, and it's time to see who crashes & burns (hopefully no one) in the tests.... Daryle W.

4 15

Unsubscribe not working
by Ben Robinson 22 Feb '12

22 Feb '12

I have changed to a new email address for Boost and need to unsubscribe this one. The unsubscribe option here: http://lists.boost.org/mailman/options.cgi/boost-users is not working for me. Thanks in advance for your help. Ben Robinson

2 1

Boost BloomFilter Status
by Joel 22 Feb '12

22 Feb '12

Alej, How is progress going on your BloomFilter library? Back in August you were looking at being ready for proposal by EOY 2011. http://comments.gmane.org/gmane.comp.lib.boost.devel/222842 By any chance, have you looked at the NPS Bloom filter package? linked to from: http://afflib.org/ I'm very interested in your library and in your response to Phil's request for the ability to mmap in existing filters. Thanks! Joel

2 1

Re: [boost] TR2 is dead; multiple TR's coming instead
by Brian Wood 21 Feb '12

21 Feb '12

Beman Dawes : > The C++ committee met last week. There was lot's of discussion and > plans to markedly increase the size of the standard library. Boost has > an important part to play; Bjarne Stroustrup hoped for "doubling the > output of Boost." Sounds like Pharoah, but I'm sure he meant to be encouraging. > > Here are some of the process changes: > > * Library proposals will be taken on as "work Items". A decision as to > whether a work item ends up in a technical report, in the standard > itself, or even becomes a stand-alone international standard, will be > deferred until technical work is complete (I.E. full standardese > complete, polished, and ready to ship). > > * Domain specific "Study Groups" will replace the LWG's current > sub-groups. Study groups have official ISO standing, so can get more > work done between meetings than the old sub-groups, which were > unofficial. > > * Technical reports will likely be smaller than in the past, and may > be domain specific. How will they be named? I'm fine with multiple TRs, but calling the next one TR2 seems reasonable to me. > > These changes are intended to allow work on different libraries to > proceed in parallel. Medium to large libraries managed by study groups > will most likely end up as a TRs and will ship when ready rather than > being held waiting for a larger TR to become ready. > > The study groups set up so far: > > * SG1: Concurrency and Parallelism (chair: Hans Boehm). This is the > old Concurrency sub-group. > > * SG2: Modules (chair: Doug Gregor). A new sub-group of the > committee's evolution working group (EWG). I'm hoping there will be support for partial classes here. I don't think Vandevoorde's proposal takes this into account. Is there another modules proposal? > > * SG3: File System (chair: Beman Dawes). A LWG sub-group to handle the > Boost.Filesystem work item approved at the meeting. > > * SG4: Networking (chair: Kyle Kloepper). A LWG sub-group to handle > the Boost.Asio work item approved at the meeting. > It looks like cryptography is slipping through the cracks. If there are signs of life in the crypto lib you're using please let me know. > There should be a "Call for Library Proposals" in the committee's > post-meeting mailing in roughly 10 days. While C++ needs more libraries, I'd like to see it get rid of/improve some existing libraries. Herb mentioned valarray being little used. I think that's right. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net "Prepare your work without, and make it fit for yourself in the field; and afterward build your house." Proverbs 24:27

6 7

[1.49.0] Release candidates available
by Beman Dawes 21 Feb '12

21 Feb '12

Release candidate files for 1.49.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. Thanks, --Beman --PS: I tested the 7z version, and it built without errors on Win7/VC++ Express 2010 sp1

5 8

Review Calendar Update
by Ben Robinson 21 Feb '12

21 Feb '12

Hello, The GitHub repository for my submission of Singularity on the review calendar has moved. The new location is: https://github.com/cppmaven/Singularity Can this could be updated on the review calendar? Thank you kindly, Ben Robinson

2 1

Is there an equivalent to "bjam install-docs"?
by Steve M. Robbins 21 Feb '12

21 Feb '12

Hi, Is there a convenient way to install or copy the entire set of documents reachable from index.html? Since the docs are available on the web site [1], I suspect there might be, but I haven't found one. Thanks, -Steve P.S. I'm wondering about this because I need to copy the docs for the Debian package "libboost-doc". At the moment, I use a very inconvenient method that involves putting boost on a web server and using wget. [1] http://www.boost.org/doc/libs/1_48_0/

2 1

Update on maximum adjacency search implementation
by Fernando Vilas 21 Feb '12

21 Feb '12

Hi, I think I have finally fixed the maximum adjacency search... Since the last post: - All parameters other than the graph are available as named parameters - Visitor is now pass-by-value - Documentation written Still potential to-do: - Update documentation with graphical walkthrough on a small graph - Python interface? - Find a way to make the priority queue work without unwrap_ref() - Do not depend on one_bit_color_map internals in min_cut_mas_visitor - Other suggestions from Boost community -- Thanks, Fernando Vilas fvilas(a)iname.com

1 0

Discrete speedometer
by Justinas V. Daugmaudis 19 Feb '12

19 Feb '12

Currently Boost has date_time library and it especially has time_duration. However, what I find lacking is some means to track the number of discrete events that happen during some specified time_duration window. Something modelled after boost::progress. For example, consider that we are interested in how many files have been copied per five minutes, or how many packets have been received per ten minutes, etc. Obviously, the bigger the time window, the more stable the speedometer. I would like to do something like this: discrete_speedometer ds(posix_time::minutes(5)); // Tracks the events using the 5 minute window for( ... ) // Some inner loop { ds += number_of_events; } >From time to time I can do this: double events_per_second = speed_per_duration<double>(ds, posix_time::seconds(1)); or even more succinctly double events_per_second = speed_per_second(ds); I have implemented such a feature, and the code is here: http://people.binf.ku.dk/~jvd/discrete_speedometer.hpp Is there any interest in such a utility class? Regards, Justinas

3 3

[move] new rvalue reference emulation
by Jeffrey Lee Hellrung, Jr. 19 Feb '12

19 Feb '12

I've recently discovered (well, probably rediscovered) an alternate rvalue reference emulation, one which allows rvalues ***of any arbitrary (move-emulation-enabled) type*** to be captured in C++03 and identified as rvalues, rather than references-to-const (there is a drawback, though, which I'll get to below; as usual, there's no "free lunch"). This is in contrast to the current move emulation framework Ion has created in Boost.Move which, at best, allows you to capture rvalues of specific types. That is, if you can enumerate the types for which you want to enable rvalue capture, then you're good. For example, if you want to create a generic unary function some_fn, and you know you want to at least capture rvalues of type X, you could do: template< class T > void some_fn(T&); // captures (lvalue) references-to-non-const, explicitly created emulated rvalue references, *and* (lvalue) references-to-(X const) template< class T > typename boost::disable_if< boost::is_same<T,X> >::type void some_fn(T const &); // captures (lvalue) references-to-const *except* (lvalue) references-to-(X const) void some_fn(rv<X>&); // captures rvalues of X as emulated rvalue references However, if Y is any type other than X, the above overloads will capture an rvalue of Y as an (lvalue) reference-to-(Y const). This is one of the shortcomings of using the emulated rvalue reference rv<T>& as a function argument: it can't bind to rvalues in a context where the template parameter T is deduced. Now I don't know if the following proposition is a good idea or not, but I think it is worth considering. Again, we would like the emulated rvalue reference rv<T>& to bind to rvalues, but the problem is the deduction of the T template parameter. Instead of using rv<T>& to capture arbitrary rvalues, I'll use a kind of type-erased emulated rvalue reference, generic_rv<...> (for lack of a better name at the moment), which will just store a void pointer to the original, pre-type-erased object. Of course, we need some way to recover the object back from the void pointer, and that's what the "..." template parameters are for. This is where the (unfortunate) runtime overhead comes in, as some dispatching mechanism (e.g., function pointers) needs to be used to effect the recovery of the original, pre-type-erased object. The important difference between rv<T> and generic_rv<...> is that there's no T in the template parameter list "..." of generic_rv; more to the point, its template parameters are not deduced within the context of binding function arguments of some_fn, hence the compiler will be allowed to look for conversions from arbitrary rvalues to generic_rv<...>. Hopefully that gives enough of an introduction to the idea. Further details are probably best left to a code snippet. Comments? Specifically, should this be considered as an addition to Boost.Move's current emulation framework? Has anyone seen this technique before? ---------------- #include <iostream> #include <boost/type_traits/is_convertible.hpp> #include <boost/utility/enable_if.hpp> // rv<T>& emulates T&& template< class T > class rv : public T { rv(); rv(rv const &); rv& operator=(rv const &); }; template< class T > struct has_move_emulation : boost::is_convertible< T, rv<T>& > { }; // *** NEW EMULATED RVALUE REFERENCE *** // generic_rv< F, Result > also emulates an rvalue reference, but in a kind of // type-erased way. The actual object referred to is referenced by a void // pointer. To be able to cast the void pointer back to a pointer-to-object, we // need to package the void pointer together with some kind of dispatching // mechanism. We use a function pointer to an instantiation of cast_forward<T>. template< class F, class Result = void > struct generic_rv { typedef Result (*p_cast_forward_type)(F, void*); generic_rv(p_cast_forward_type p_cast_forward, void* p) : mp_cast_forward(p_cast_forward), m_p(p) { } Result cast_forward(F f) const { return (*mp_cast_forward)(f, m_p); } template< class T > static Result cast_forward(F f, void* const p) { return f(static_cast< rv<T>& >(*static_cast< T* >(p))); } private: p_cast_forward_type mp_cast_forward; void* m_p; }; // X is just a typical move-emulation-enabled class. struct X { X() { std::cout << "X::X()" << std::endl; } X(X const &) { std::cout << "X::X(X const &)" << std::endl; } X(rv<X>&) { std::cout << "X::X(rv<X>&)" << std::endl; } X& operator=(X) { std::cout << "X::operator=(X)" << std::endl; return *this; } X& operator=(rv<X>&) { std::cout << "X::operator=(rv<X>&)" << std::endl; return *this; } operator rv<X>&() { std::cout << "X::operator rv<X>&()" << std::endl; return *static_cast< rv<X>* >(this); } operator rv<X> const &() const { std::cout << "X::operator rv<X> const &() const" << std::endl; return *static_cast< rv<X> const * >(this); } // *** NEW CONVERSION OPERATOR *** // X provides an implicit conversion to generic_rv. template< class F, class Result > operator generic_rv< F, Result >() { std::cout << "X::operator generic_rv< F, Result >()" << std::endl; return generic_rv< F, Result >( &generic_rv< F, Result >::template cast_forward<X>, static_cast< void* >(this) ); } }; struct some_fn { template< class T > void operator()(T&) const { std::cout << "some_fn::operator()(T&) const" << std::endl; } template< class T > typename boost::disable_if< has_move_emulation<T> >::type operator()(T const &) const { std::cout << "some_fn::operator()(T const &) const" << std::endl; } // Notice that this overload requires template parameter deduction, hence // the compiler cannot apply an implicit conversion to rv<T>& from rvalues // of move-emulation-enabled types. In other words, this overload can only // bind to *explicitly* created emulated rvalue references, not to "real" // rvalues :( template< class T > void operator()(rv<T>&) const { std::cout << "some_fn::operator()(rv<T>&) const" << std::endl; } // *** NEW FUNCTION OVERLOAD TO CAPTURE RVALUES *** // Since this overload requires no template parameter deduction, the // compiler *can* apply an implicit conversion to generic_rv<...> from // rvalues of move-emulation-enabled types. Yes, there will be some runtime // overhead from the function pointer dispatching, but that will often be // preferable to copying x! void operator()(generic_rv< some_fn > const x) const { std::cout << "some_fn::operator()(generic_rv< some_fn >) const" << std::endl; return x.cast_forward(*this); } }; template< class T > T make() { return T(); } int main(int argc, char* argv[]) { int a = 0; int const b = 0; some_fn()(a); // some_fn::operator()(T&) const some_fn()(b); // some_fn::operator()(T const &) const some_fn()(make< int >()); // some_fn::operator()(T const &) const X x; // X::X() X const y; // X::X() some_fn()(x); // some_fn::operator()(T&) const some_fn()(y); // some_fn::operator()(T&) const some_fn()(make<X>()); // X::X() // X::operator generic_rv< F, Result >() // some_fn::operator()(generic_rv< some_fn >) const // some_fn::operator()(rv<T>&) const return 0; } ---------------- - Jeff

10 33

TR2 is dead; multiple TR's coming instead
by Beman Dawes 19 Feb '12

19 Feb '12

The C++ committee met last week. There was lot's of discussion and plans to markedly increase the size of the standard library. Boost has an important part to play; Bjarne Stroustrup hoped for "doubling the output of Boost." Herb Sutter is talking about an effort to shake libraries out of corporations and other large organizations. There seems be be a fresh infusion of energy, with quite a few new faces at the meeting. Plans have firmed and work begun on new C++ library work items. There are lots of changes in process, and these will affect Boost developers wishing to propose Boost libraries for technical reports or the standard itself. Here are some of the process changes: * Library proposals will be taken on as "work Items". A decision as to whether a work item ends up in a technical report, in the standard itself, or even becomes a stand-alone international standard, will be deferred until technical work is complete (I.E. full standardese complete, polished, and ready to ship). * Domain specific "Study Groups" will replace the LWG's current sub-groups. Study groups have official ISO standing, so can get more work done between meetings than the old sub-groups, which were unofficial. * Technical reports will likely be smaller than in the past, and may be domain specific. These changes are intended to allow work on different libraries to proceed in parallel. Medium to large libraries managed by study groups will most likely end up as a TRs and will ship when ready rather than being held waiting for a larger TR to become ready. The study groups set up so far: * SG1: Concurrency and Parallelism (chair: Hans Boehm). This is the old Concurrency sub-group. * SG2: Modules (chair: Doug Gregor). A new sub-group of the committee's evolution working group (EWG). * SG3: File System (chair: Beman Dawes). A LWG sub-group to handle the Boost.Filesystem work item approved at the meeting. * SG4: Networking (chair: Kyle Kloepper). A LWG sub-group to handle the Boost.Asio work item approved at the meeting. There should be a "Call for Library Proposals" in the committee's post-meeting mailing in roughly 10 days. --Beman

4 5

[regression-tests] run frequency
by lcaminiti 19 Feb '12

19 Feb '12

Hello all, Out of curiosity, I noticed that the trunk (and maybe also release) regression tests do not all run every day. http://www.boost.org/development/tests/trunk/developer/scope_exit.html Why is that? Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-regression-tests-run-frequency-tp4… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

Can we use SVG (Scalable Vector graphics) for HTML Boost docs?
by Paul A. Bristow 19 Feb '12

19 Feb '12

In adding new functions and distributions to Boost.Math, I've become dissatisfied with diagrams and equations using PNG. They are either large and/or fuzzy :-( And they get fuzzier if you expand them :-(( All browsers now support native display of SVG (Scalable Vector graphics) quite well *except* older versions of Microsoft Internet Explorer (IE9 displays SVG OK). So we are still producing HTML versions of the Boost.Math docs using embedded PNG equations and diagrams. So everyone has to endure poor quality diagrams and equations, just so that a few MS IE<9 users can see the diagrams. 1 I'd like to have views on when we can disregard the Luddites and use SVG throughout? We'd also like to use MathML to display equations, saving authors a lot of effort and much reduced file sizes. All current versions of browsers *except Microsoft IE - even IE9* also support MathML. 2 I'd like views on using MathML - with the downside that all IE users would not see equations displayed? (Everyone can view the PDF version - which uses SVG, so displays nicely even when magnified). Thank you. Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

3 3

[release, heap] bug fix merge request
by Tim Blechmann 18 Feb '12

18 Feb '12

i'd like to ask permission to merge one trivial fix for boost.heap from trunk into release [1]. it fixes an error that was reported on the boost-user list yesterday. i know it is pretty late, but as boost.heap is a new library it won't introduce a regression ... thanks, tim [1] https://github.com/ryppl/boost- svn/commit/65e619ffba40d3f2243cb235a906d4d75d9651c1

2 2

[graph] about subgraph
by Ernest Galbrun 18 Feb '12

18 Feb '12

Hello all, I would like to share my thoughts about the subgraph facility provided in the graph library. I have dived in it during the past few days because it looked nice, and it seemed to do what I was willing to do (that is, being able to work on various parts of the root graph while maintaining useful invariant). However, I have stumbled on surprising difficulties (I mean I would not have anticipated them from a boost component) : - The subgraph does not support serialization. In my opinion, it is a key feature for any kind of container. I found a broken version on the web and (as far as I can tell) fixed it, but it still seems to me that it is lacking from the original component. - The copy constructor is broken (see https://svn.boost.org/trac/boost/ticket/6564 but I see my comment on the second necessary patch was not sent, the bottom line is the original copy constructor led to errors when working on the copied graph). It is a central function, the fact that it has been broken without anyone but me noticing thus far leads me to think that a/ I am even less competent than I think I am in programming or b/ not many people use subgraph. - The remove_vertex is not implemented, and will not be (see https://svn.boost.org/trac/boost/ticket/4752 ). I was again very surprised when I discovered that, it was really an obvious function, the kind that justify for me the use of subgraph. And, reading further on the commentary for that "wont fix bug", the suggestion from jewillco of using a filtered_graph instead is perfectly relevant for my case. Nevertheless, I would rather have read such suggestion on the doc before chosing my component than at this quite late point. So I have one question and one suggestion to you boost (graph (subgraph)) developers : - Don't you think, given the lack of tests/users and the the missing features, that subgraph should leave the library ? - I think, if it stays, that the documentation should emphasize these points, and especially the last point : that filtered_graph is often a better solution. As a final note, I feel a little bit out of my place since I have absolutely no legitimacy criticizing the work of people who are by far more competent than me in computer sciences, so I won't feel offended if you point out that I am totally wrong. sincerey yours, -- Ernest Galbrun

1 0

unordered_map failing to compile on MSVC7.1 using STLport
by Robert Dailey 17 Feb '12

17 Feb '12

For some reason, I get the following compiler error on Visual Studio .NET 2003 when using STLport 5.2.1: boost\unordered\detail\allocator_helpers.hpp(318) : error C2039: 'select_on_container_copy_construction' : is not a member of 'stlpd_std::allocator<_Tp>' Any idea why this is happening? If not, what other information can I provide? --------- Robert Dailey

3 13

Move semantics for std::string?
by Robert Dailey 17 Feb '12

17 Feb '12

I'm using C++03 and would love some way to apply move semantics to a std::string. Can boost facilitate this in some way without using smart pointers? Consider an example like below (This is a contrived example, so assume NRVO does not apply): std::string GetInformation( int someNumber ) { // We use 'someNumber' to look up a string std::string myValue( "hello world" ); // Create the string here return myValue; } Above, the return value would result in a copy, I'd like to move it instead. --------- Robert Dailey

5 8

RFC: runtime-flexible arrays
by Bjoern Andres 17 Feb '12

17 Feb '12

Hi everyone, I have written a header for runtime-flexible multi-dimensional views and arrays and would love to get comments and feedback from the boost community: tutorial code : http://tinyurl.com/7hdldc9 main website : http://www.andres.sc/marray.html doxygen reference doc: http://www.andres.sc/marray/doc/index.html git repository : https://github.com/bjoern-andres/marray tech report : http://arxiv.org/pdf/1008.2909v1 Unlike in Boost.MultiArray, the dimension of arrays is not a template parameter in Marray. Other features include - runtime-flexible dimension, shape, size and indexing order (first or last coordinate major order) - arithmetic operators with automatic type promotion and expression templates. - access to entries via coordinates, scalar indices and STL-compliant random access iterators. - derived classes for matrices and vectors - support of exchangeable STL-compliant allocators. Thanks for your consideration Bjoern

4 11

boost thread rev 77005 fails on cygwin due SIGSTKSZ not defined
by Bernd Prager 17 Feb '12

17 Feb '12

All, Boost Thread no longer compiles on Cygwin 1.7.10 / g++ (GCC) 4.5.3 since SIGSTKSZ is not defined on this platform: cc.compile.c++ bin.v2/libs/context/build/gcc-4.5.3/release/threading-multi/stack_utils_posix.o libs\context\src\stack_utils_posix.cpp: In function ‘rlimit<unnamed>::stacksize_limit_()’: libs\context\src\stack_utils_posix.cpp:27:15: warning: unused variable ‘result’ libs\context\src\stack_utils_posix.cpp: In function ‘size_t boost::contexts::minimum_stacksize()’: libs\context\src\stack_utils_posix.cpp:52:10: error: ‘SIGSTKSZ’ was not declared in this scope libs\context\src\stack_utils_posix.cpp:52:20: warning: control reaches end of non-void function Any suggested workarounds? Thank you, -- Bernd

3 8

Can't build boost 1.48 with STLport 5.2.1
by Robert Dailey 17 Feb '12

17 Feb '12

I'm trying to get Boost 1.48 building using STLport 5.2.1. I am on Windows 7 x64. Here is what I've done: 1. Update tools/build/v2/user-config.jam with the following: using msvc : 7.1 ; using stlport : 5.2.1 : C:/Code/third_party_source/STLport-5.2.1/stlport : C:/Code/third_party_source/STLport-5.2.1/lib ; 2. Run the following command through the VS2003 command line tool: bootstrap.bat 3. This sets up the b2 executable and stuff, after that I run: b2 toolset=msvc link=shared threading=multi runtime-link=shared variant=debug stdlib=stlport --layout=tagged stage However, once it comes time to link the first library (boost filesystem), I get a ton of linker errors, mostly LNK2001 relating to unresolved STLport symbols. Here is one of the first ones: path.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpd _std::basic_string<wchar_t,class stlpd_std::char_traits<wchar_t>,class stlpd_std::allocator<wchar_t> >::basic_string<wchar_t,class stlpd_std::char_traits<wchar_t>,class stlpd_std::allocator<wchar_t> > (class stlpd_std::basic_string<wchar_t,class stlpd_std::char_traits<wchar_t>,class stlpd_std::alloca tor<wchar_t> > const &)" (__imp_??0?$basic_string@_WV?$char_traits@ _W@stlpd_std@@V?$allocator@_W@2@@ stlpd_std@@QAE@ABV01@@Z) Anyone have any idea how I can get this working? --------- Robert Dailey

4 19

Boost.Asio documentation needs to be updated
by Bernd Prager 17 Feb '12

17 Feb '12

All, The documentation states that Boost.Asio requires __USE_W32_SOCKETS must be defined when using Cygwin. That doesn't seem to be true any longer. When I define __USE_W32_SOCKETS compilation of several components (e.g. ./boost/test/impl/debug.ipp) fail with "error: '::select' has not been declared". Without that definition compilation works apparently fine. Regards, -- Bernd

1 0

[Block Pointer] Questions?
by Phil Bouchard 17 Feb '12

17 Feb '12

Hi, I was wondering if anybody had any question regarding Block Pointer. It might be hard to convince Java and C# authors garbage collectors are nonsense but we do not have that burden here. Thank you, -Phil Author of "Finite Theory of the Universe, Dark Matter Disproof and Faster-Than-Light Speed": http://bookstore.authorhouse.com/Products/SKU-000539350/Finite-Theory-of-th…

1 0

[exception] warning about non-virtual destructor - resolution?
by Nathan Ridge 16 Feb '12

16 Feb '12

Hello, GCC 4.7 introduces a new warning [1] that warns about calling "delete" on a pointer of a type that has virtual functions but a nonvirtual destructor. This warning is enabled with -Wall. As a result, even something as trivial as the following: #include <boost/thread/future.hpp> when compiled with -Wall, produces a warning like this: In file included from boost/boost/smart_ptr/shared_ptr.hpp:30:0, from boost/boost/shared_ptr.hpp:17, from boost/boost/date_time/time_clock.hpp:17, from boost/boost/thread/thread_time.hpp:9, from boost/boost/thread/future.hpp:13, from Source/timetable.cpp:1: boost/boost/checked_delete.hpp: In instantiation of 'void boost::checked_delete(T*) [with T = boost::error_info<boost::tag_original_exception_type, const std::type_info*>]': boost/boost/smart_ptr/detail/shared_count.hpp:95:13: required from 'boost::detail::shared_count::shared_count(Y*) [with Y = boost::error_info<boost::tag_original_exception_type, const std::type_info*>]' boost/boost/smart_ptr/shared_ptr.hpp:177:50: required from 'boost::shared_ptr<T>::shared_ptr(Y*) [with Y = boost::error_info<boost::tag_original_exception_type, const std::type_info*>; T = boost::error_info<boost::tag_original_exception_type, const std::type_info*>]' boost/boost/exception/info.hpp:171:69: required from 'const E& boost::exception_detail::set_info(const E&, const boost::error_info<Tag, T>&) [with E = boost::unknown_exception; Tag = boost::tag_original_exception_type; T = const std::type_info*]' boost/boost/exception/info.hpp:192:46: required from 'typename boost::enable_if<boost::exception_detail::derives_boost_exception<E>, const E&>::type boost::operator<<(const E&, const boost::error_info<Tag, T>&) [with E = boost::unknown_exception; Tag = boost::tag_original_exception_type; T = const std::type_info*; typename boost::enable_if<boost::exception_detail::derives_boost_exception<E>, const E&>::type = const boost::unknown_exception&]' boost/boost/exception/detail/exception_ptr.hpp:182:13: required from 'void boost::unknown_exception::add_original_type(const E&) [with E = std::exception]' boost/boost/exception/detail/exception_ptr.hpp:161:32: required from here boost/boost/checked_delete.hpp:34:5: warning: deleting object of polymorphic class type 'boost::error_info<boost::tag_original_exception_type, const std::type_info*>' which has non-virtual destructor might cause undefined behaviour [-Wdelete-non-virtual-dtor] Note that the same code compiled without warnings with GCC 4.6. I've read this thread [2] about this issue, but it's not clear what the agreed-upon resolution was. In light of this new warning, can the code be revised to avoid it? Or is it the position of the library maintainers that GCC is in error to give a warning in this case, in which case I should file a GCC bug? Or is there some other recommended resolution? Thanks, Nate [1] http://gcc.gnu.org/gcc-4.7/changes.html#cxx [2] http://boost.2283326.n4.nabble.com/boost-exception-detail-error-info-base-d…

2 2

fix links in boost.container docs
by niXman 16 Feb '12

16 Feb '12

Hello list! Diff file is attached. niXman.

1 0

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 16 Feb '12

16 Feb '12

> > FYI I'm currently working closely with Andrzej Krzemienski on a std proposal which, among other things, involves the long awaited update to the Boost implementation. > > Could you give a use case for optional<T&>. When reading the doc about I completely understand the other use cases: > * return types > * parameters > * locals > * members > * expensive unnecessary default construction > We could be having the same conversation about optional<bool>. Here the documentation is clear: it works as expected but is the user probably should be using tri-state. > We could optimize optional<bool> to store ~0 to indicate unset. I personally don't think it's worth doing that, since use case is questionable. > As far as I can tell optional<T&> is a type which can be easily confused with optional<T>, but is really equivalent to T*. It also allows for debates about the meaning of reassignment. > I'm not dead set against this optimization. I'm just wondering if anyone will really benefit and if it's worth adding a specialization + tests. Speaking for myself, I do not have a need for optional reference. I have been using Boost.Optional for many years, I find it extremely useful; and I never had a use case for optional reference. On the other hand, others seem to be in need of optional references.Andrey said in this thread that that he wants to use it. The only two motivating use cases that triggered the addition of optional references (that I am aware of) is the interface of Boost.Variant (see http://lists.boost.org/Archives/boost/2003/02/44585.php) and the use case for Boost.Spirit (see http://lists.boost.org/Archives/boost/2003/10/55584.php) I would be reluctant to just discard these use cases. On the other hand, if they are allowed, the controversy of assignment arises. One thing to note is the requirement for optional references is not motivated by optimization opportunities, but additional behavior. > Side question: is streamablity going to be in your proposal? It is not currently. The reason for that is that there is no clear way how it should be implemented (a similar issue applies to pairs, tuples, variant, any, etc...) See http://lists.boost.org/Archives/boost/2005/03/81619.php for discussion. I believe that the problem is with the streaming itself. For instance, should streaming out and then streaming the result back in produce the same value? Some people expect that, but even std::string could not provide this behavior. Regards, &rzej

12 20

Boost Graph Library - serialization of subgraph
by Ernest Galbrun 16 Feb '12

16 Feb '12

Dear fellow boost member, I am currently using the boost graph library, and especially the subgraph features. As there is no serialization feature for subgraphes, I have developped my own, by modifying the one developed by Rakuto that was broken, probably due to some changes in the graph library ( http://rakuto.blogspot.com/2008/12/c-library-for-serialazation-of.html ). If you think it would be useful, I could do the remaining work (that is thorough testing and debugging, and providing automated test case, maybe I am forgetting something ?). The bottom line is that I am new to this kind of project, and I will probably need some kind of guidance about the way to contribute. sincerely yours, -- Ernest Galbrun

1 0

how to search this list efficiently ?
by Steven Samuel Cole 16 Feb '12

16 Feb '12

i have a few questions about boost that might have been discussed and answered on this list before. there seems a convention to add the topic in square brackets to the subject as e.g. [thread], [preprocessor] or [review], etc. how do i search the list archive by these topics ? i see there is http://search.gmane.org/ but that only supports search by keywords in the entire message and seems to ignore [square brackets]. there is also custom google search on the boost homepage which i can further filter down to the mailing lists by adding site:lists.boost.org, but it also ignores square brackets, even when put in double quotes and does not seem to allow sorting by date or support a threaded display. lists.boost.org/Archives/boost/ doesn't support searching at all. is there a trick how to search the mailing list archives properly ?

5 7

[intrusive] advanced lookup/insertion suggestion
by Rei Thiessen 16 Feb '12

16 Feb '12

Something that has bothered me with the advanced lookup and insertion functions is that I have to specify the hash/equality functors at every invocation site: c.find(key,key_hash(),key_equality()); c.insert_check(key,key_hash(),key_equality(),cd); If we don't consistently use the same (key_hash,key_equality) pair for a given (element_type,key_type) pair, the container invariant will likely be broken. Thus, I think it's very un-"C++ like" to have to specify these two types at every invocation site. Assuming that we don't want to embed (key_type,key_hash,key_equality) directly into the type of a container, the library could use a type operator to automatically deduce the appropriate hash/equality functions given an element/key type pair at the find/insert member function instantiation point: // library template<typename ElementType, typename KeyType> struct element_key_info {}; // different name to avoid overload confusion. // instantiation succeeds only when // element_key_info is properly specialized template<typename KeyType> iterator unordered_set::find_key( KeyType const& k ) {...} ... // user namespace intrusive{ template<> struct element_key_info<element_type,key_type> { typedef key_hash hash_type; typedef key_equality equality_type; }; } element_type e(...); c.insert( e ); key_type k(...); ... = c.find_key( k ); These new signatures do not allow non-default-constructible hash/equality functors, but the original signatures that do are still available. I think this makes the code simpler and safer in exchange for some additional type declarations. Would this be a worthwhile addition to the intrusive associative containers?

2 2

Offering sorted_vector for Boost, any interest?
by Frank Birbacher 15 Feb '12

15 Feb '12

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi! I've come across lots of code that uses std::set where I think a sorted vector would perform better. Those places a characterized by: 1. fills the set only once, 2. just wants to drop duplicates or 3. calls set::find very often. Facing such code I often wished there was a ready to use sorted_vector implementation. I think a new container that stores elements in a vector instead of a tree offers strong advantages: a. one call to std::sort instead of managing a red-black-tree b. less memory overhead c. better data locality for lookup Possible things that I currently consider: - - offer one-time initialization read-only sorted container? - - offer mutable container with std::set-like interface (complexity changes)? - - offer taking contents from std::vector for init without copying - - offer equivalent to std::map also? - - provide a pointer container, too? Is there general interest in such a container? I'd like to develop an implementation and offer it to Boost. Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG/MacGPG2 v2.0.17 (Darwin) Comment: GPGTools - http://gpgtools.org Comment: keyserver x-hkp://pool.sks-keyservers.net iEYEARECAAYFAk87/wQACgkQhAOUmAZhnmqVdQCggs40nPsT7wXvoEuO3TsSWlqS Wt4An06uRHECRercybiKC0Jq/ZKobEsu =zAK6 -----END PGP SIGNATURE-----

7 14

Adding support for auto in Boost.Foreach
by paul Fultz 15 Feb '12

15 Feb '12

I have a macro that I use on older compiers that let's me use auto inside of a foreach loop using the typeof operator. My original implementation relies on variadiac macros, but it can be rewritten without requiring variadiac support(possibly using the new keyword facility from Lorenzo Caminiti). Here is examples of some foreach loops it would support: BOOST_FOREACH(auto x, range) {} BOOST_FOREACH(auto& x, range) {} BOOST_FOREACH(const auto& x, range) {} BOOST_FOREACH(volatile auto x, range) {} Also, on compilers that support variadiac macros, it would be nice to add support for commas in the type, such as: BOOST_FOREACH(pair<string, string> p, range) {} This would work by poping off the back of the sequence in order to get the container. Now, you could only have commas in the type and not the container, so this wouldn't work: //Won't work BOOST_FOREACH(auto x, get_some_range<A, B>()) {} However, 1) We can place parenthesis around the container, like this: BOOST_FOREACH(auto x, (get_some_range<A, B>())) {} 2) Almost 95% of the gotchas with the foreach seemed to be with using commas in the type. So ultimately, I think it would reduce the number of gotchas drastically. Is there interest in adding something like this? Or maybe just part of it? Also if there interest, what kind of process would I go through to get them submitted and reviewed? -paul

6 8

[trunk] test compilation fails on Cygwin
by Bernd Prager 15 Feb '12

15 Feb '12

I am getting following error with g++ (GCC) 4.5.3 on Cygwin 1.7.20: In file included from libs\test\src\debug.cpp:16:0: ./boost/test/impl/debug.ipp: In function ‘bool boost::debug::attach_debugger(bool)’: ./boost/test/impl/debug.ipp:899:9: error: ‘::select’ has not been declared

1 0

[Format] Making a change
by John M. Dlugosz 15 Feb '12

15 Feb '12

I'd like to make a change to the Boost Format library, to add a conversion operator to the matching string class. It appears to have not been worked on in a number of years. Reading through the web site, I find details on how to submit new libraries, and how to edit the web page, but nothing on submitting updates to existing libraries. How would I go about doing that, for this library in particular? —John

8 15

Vector quantity?
by sultana rashid 15 Feb '12

15 Feb '12

Hello all, I was finding something on Vector quantity in Boost library, as: Vector decomposition ,cross product,absolute value of a vector quantity ,projection of a vector etc. I am afraid whether I could not find or Boost missing it. Thanking you, Sultana rashid.

2 1

FW: Snobol4 matching in C++
by Steven Kibler 15 Feb '12

15 Feb '12

I have an implementation of Snobol4 patterns and pattern matching that runs in C++. All of the Snobol4 patterns and replacements are implemented in addition to numerous extensions that have proven useful over the years. The patterns are built with overloaded operators and building patterns is simple, straight forward, easy to read and test. In many cases, I find that Snobol4 patterns and its matching algorithm is clearer, more intuitive, and more useful than regular expressions. I have been able to typically cut the required lines of code to accomplish pattern matching by half or a third over using regular expressions. The package is well integrated into C++ and its data types. For post circa 1980 'newbies' unaware of the power of Snobol4, a description of Snobol4 can be seen in a copy of several Snobol4 manuals at ftp://ftp.snobol4.com/spitman.pdf and ftp://ftp.cs.arizona.edu/snobol/gb.pdf. I would like the package to be published under the auspices of Boost. I would like to know if this package would be something that the users of the Boost community would be interested in. This package was originally written in Ada by Robert Dewar and AdaCore, translated to C/C++ by Philip Budne, and cleaned up and expanded by me. The Philip Budne version may be found at http://www.snobol4.org/ (Look for the SPIPAT link) along with many other references for SNOBOL and SPITBOL. Thanks Steven Kibler Facet Soft Tech, Inc.

1 0

[local_function] trunk commit
by lcaminiti 15 Feb '12

15 Feb '12

Hello all, I have committed Boost.LocalFunction (and related libraries) to trunk. This is my first commit to Boost trunk :) . I will monitor this ML closely and I will be ready to make any fix in real-time in case I have broken something. However, I have ran all regressions tests of what I committed using MSVC 8.0 and GCC 4.5.3 (with and without C++0x features) and they all pass. I also have ran Boost's inspect on all files I committed. Boost.LocalFunction (new) boost/local_function[.hpp] libs/local_function Boost.ScopeExit (improved) boost/scope_exit.hpp libs/scope_exit Boost.Functional/OverloadedFunction (new) boost/functional/overloaded_function[.hpp] libs/functional/overloaded_function Boost.Utility/IdentityType (new) boost/utility/identity_type.hpp libs/utility/identity_type Thanks for your support and understanding. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-local-function-trunk-commit-tp4389… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Re: [boost] [filesystem] operations.hpp Won't Compile with VC10 using Boost 1.47
by Stewart, Robert 14 Feb '12

14 Feb '12

Stephan T. Lavavej wrote: > [Robert Stewart] > > When I try to include boost/filesystem/operations.hpp, my > > code won't compile on MSVC 10 (Visual Studio 2010). > > The error is from boost/filesystem/v3/config.hpp:49: > > # if defined( BOOST_NO_STD_WSTRING ) > > # error Configuration not supported: Boost.Filesystem V3 > and later requires std::wstring support > > # endif > > First, check your command line. If it isn't defining the > macro, preprocess with /P /d1PP . The second option is > undocumented and unsupported, but extremely useful - it > preserves #define directives, so you can see where macros are > coming from. I was looking for such an option! BOOST_NO_STD_WSTRING didn't appear in the output. This was a false alarm. Why does VC print #error messages that are conditionally compiled and don't apply! In this case, BOOST_NO_STD_WSTRING is *not* defined, yet the #error still appears in the output: In file included from D:/.../Boost/boost_1_47/include/boost-1_47/boost/filesystem/operations.hpp:31, from controller.cpp:22: D:/.../Boost/boost_1_47/include/boost-1_47/boost/filesystem/v3/operations.hpp:21:5: #error Configuration not supported: Boost.Filesystem V3 and later requires std::wstring support Emacs' compilation-mode dutifully marks that as an error and I didn't realize that the build progressed past that point. Arrrggghhh! Thanks for your help. _____ Rob Stewart robert.stewart(a)sig.com Software Engineer using std::disclaimer; Dev Tools & Components Susquehanna International Group, LLP http://www.sig.com ________________________________ IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

2 2

[bjam] command for release/debug
by lcaminiti 14 Feb '12

14 Feb '12

Hello all, How can I program a Jamfile to execute the following on `bjam debug`: compile-fail const_block_err.cpp ; But the following on `bjam release`? run const_block_err.cpp ; Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-bjam-command-for-release-debug-tp4… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

[filesystem] operations.hpp Won't Compile with VC10 using Boost 1.47
by Stewart, Robert 14 Feb '12

14 Feb '12

When I try to include boost/filesystem/operations.hpp, my code won't compile on MSVC 10 (Visual Studio 2010). The error is from boost/filesystem/v3/config.hpp:49: # if defined( BOOST_NO_STD_WSTRING ) # error Configuration not supported: Boost.Filesystem V3 and later requires std::wstring support # endif I found only the following places where BOOST_NO_STD_WSTRING is defined, and none should apply, so I'm at a loss to understand why my build fails. What have I missed? ./config/platform/amigaos.hpp:12:#define BOOST_NO_STD_WSTRING ./config/platform/symbian.hpp:85:# define BOOST_NO_STD_WSTRING ./config/stdlib/libstdcpp3.hpp:23:# define BOOST_NO_STD_WSTRING ./config/stdlib/modena.hpp:22:#define BOOST_NO_STD_WSTRING ./config/stdlib/sgi.hpp:100:# define BOOST_NO_STD_WSTRING ./config/stdlib/stlport.hpp:109:# define BOOST_NO_STD_WSTRING _____ Rob Stewart robert.stewart(a)sig.com Software Engineer using std::disclaimer; Dev Tools & Components Susquehanna International Group, LLP http://www.sig.com ________________________________ IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

2 1

[config] Flags for default/delete special member functions?
by Daryle Walker 14 Feb '12

14 Feb '12

Can we add macro constants to boost/config.hpp that indicate if marking (special) member functions as "= default" or "= delete" is supported? Daryle W.

2 1

[trunk] compilation errors on MSVC 8
by lcaminiti 14 Feb '12

14 Feb '12

Hello all, I get the errors below if I run bootstrap from the latest trunk checkout using MSVC 8 on Windows 7... (the trunk seems instead to work with GCC 4.5.3 on Cygwin). Thanks. --Lorenzo Setting environment for using Microsoft Visual Studio 2005 x86 tools. ### ### Using 'vc8' toolset. ### C:\Users\lorcam\Desktop\code\boost-trunk\tools\build\v2\engine>if exist bootstrap rd /S /Q bootstrap C:\Users\lorcam\Desktop\code\boost-trunk\tools\build\v2\engine>md bootstrap C:\Users\lorcam\Desktop\code\boost-trunk\tools\build\v2\engine>cl /nologo /RTC1 /Zi /MTd /Fobootstrap/ /Fdbootstrap/ -DNT -DYYDEBUG -wd4996 kernel32.lib advapi32.lib user32.lib /Febootstrap\jam0 command.c compile.c constants.c debug.c execnt.c filent.c function.c glob.c hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c object.c option.c output.c parse.c pathunix.c regexp.c rules.c scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c md5.c pwd.c class.c w32_getreg.c native.c modules/set.c modules/path.c modules/regex.c modules/property-set.c modules/sequence.c modules/order.c command.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' compile.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' constants.c debug.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' execnt.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' filent.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' function.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' glob.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' hash.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' hdrmacro.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' headers.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' jam.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' jambase.c jamgram.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' lists.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' make.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' make1.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' object.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' option.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' output.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' Generating Code... Compiling... parse.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' pathunix.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' regexp.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' rules.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' scan.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' search.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' subst.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' timestamp.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' variable.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' modules.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' strings.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' filesys.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' builtins.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' md5.c pwd.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' class.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' w32_getreg.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' native.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' set.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' path.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' Generating Code... Compiling... regex.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' property-set.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' sequence.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' order.c c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2016: C requires that a struct or union has at least one member c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(466) : error C2061: syntax error : identifier 'pid_t' c:\users\lorcam\desktop\code\boost-trunk\tools\build\v2\engine\jam.h(468) : error C2059: syntax error : '}' Generating Code... -- View this message in context: http://boost.2283326.n4.nabble.com/boost-trunk-compilation-errors-on-MSVC-8… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 3

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 14 Feb '12

14 Feb '12

> > But even that appears like a non-obvious thing to me. Would other people > > here in the list, and also developers in general agree that it is ok that > > you have output operation but no input operation? I think that in the > > standard library they always go in pairs. (I am not sure, though). > > In my own code I often find myself defining only output operators. For things > more complex than enums or numerics I usually handle input with specialized > solutions, with tools line Boost.Spirit. As for the standard library, I'm not > sure but dos thread::id have an input operator? > > Also, how would you implement it? what should an uninitialized optional > > print? Nothing? but how is having printed an uninitialized optional<int> > > different that not having printed anything? A question mark? but how would > > the following two be different: > > FWIW, boost::optional provides both input and output. > > If you propose to provide only output operation, then it looks like you > > want this for some sort of logging. But perhaps it is better to have some > > overloaded function toString() that converts all the types to strings. > > Usually the string format that works for one program does not work for the > > other. And there appears to be no natural/intuitive way of representing any > > type (like optional) as text. > > I usually dislike toString and alike methods. I think, manipulators are more > flexible and modularized approach. Do you think it would be possible to > provide different manipulators to fulfill different IO requirements? I have checked the standard and indeed thread::id provides operator<< without the matching operator>>, so this asymmetry would not be a precedent in the standard. Although the situation with thread::id is speciffic. ID's are assigned by the OS and trying to assign them by other means would definitely be an error. I also checked boost::optional and it provides both (I learned two new things today). Uninitialized optional of any type renders "--" (two dashes); whereas initialize optional always prepends a space. I am not sure if this does not look like hack; but people already said this would not be much of a problem. Certainly, there ways to make the output of optional configurable. I am not sure manipulators would be my preference. An alternative would be the approach that Boost.Date_time has adopted: you set your preference per stream (plus one global setting) by means of locale mechanism. However, when it comes to proposing stuff in front of the ISO committee, there is one other factor, which I failed to mention yet. It is the "fragility" of the process. I am concerned that if anything turns out to be controversial, the whole Optional would be at risk of being rejected. This might be an exaggeration (I have never gone through the process of proposing something and then pushing it through), but Optional has already been proposed by Fernando (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1878.htm) and rejected; primarily for two things: operators -> and * and the semantics for optional reference assignment (see http://lists.boost.org/Archives/boost/2005/10/95079.php) I would much like to avoid the situation where Optional (which I believe is very useful to wide variety of programmers) would be rejected because of one additional, however tiny, controversy of streaming operator. Regards, &rzej

3 2

Re: [boost] [optional] generates unnessesary code for trivial types
by Hite, Christopher 14 Feb '12

14 Feb '12

From: Domagoj Saric <domagoj.saric(a)littleendian.com> > > Maybe I'm missing something, but I don't see the justification. > IMO it seems that, yes, you are making the same mistake as Lucanus, thinking > about "The Universe" only as/through your POV of your personal problem domain: > a) (optional models optionally holding an object) + (objects can be held by > value and by reference) = optional<T&> perfectly logical I'm really not. Give me a use case. Do they make sense being passed as parameters/returns? Do they make sense being stored? I just see some corner case of optional being turned into a replacement for regular pointer. Why not just make dumb_ptr<T>? If you want you can make it streamable and give it clean construction. What is it you really want from optional<T&>? Does anyone use it a lot? Is it like std::vector<bool>? > b) creating special cases (e.g. for T&) creates special problems in generic code My point exactly. I'd make it work for completeness but not bother to optimize. Chris

4 6

Discovering C++11 lambda argument and result types to construct boost::function
by Frank Birbacher 14 Feb '12

14 Feb '12

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi! On comp.lang.c++.moderated I talked to Daniel Krügler about how to discover argument and result types from C++11 lambdas in a template context. The thread has the title "How to discover argument and result types from lambda for constructing std::function?" https://groups.google.com/d/topic/comp.lang.c++.moderated/qaMECIUlJp0/discu… The task is to provide a function template "make_function" that takes a C++11 lambda expression and returns a boost::function with the correct signature to call the lambda. This may be extended to accept any other callable type. Is there such a thing already in Boost? I'd like to add it. Would it go to Boost.Function alone? Or would parts fit into TypeTraits? Does Doug still maintain Boost.Function? Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG/MacGPG2 v2.0.17 (Darwin) Comment: GPGTools - http://gpgtools.org Comment: keyserver x-hkp://pool.sks-keyservers.net iEYEARECAAYFAk80RsMACgkQhAOUmAZhnmr5gACdGI6q9Xi1SbtpHs23GlAhU9uu Y3kAnjCpiZFGJp+IpnFVS3gmtZOqZp42 =GGdI -----END PGP SIGNATURE-----

6 8

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 13 Feb '12

13 Feb '12

> I use optional references in my code, in cases like the following: > I have an operation, which processes some elements, and some of the > elements constitute special cases. The caller of the operation may or may > not want to know about the special cases that arose, so they can optionally > pass in a container which will be populated with the special cases: > void some_operation(inputs, optional<vector<case>&> special_cases = none) > { > for (...) > { > ... > if (special_case) > { > ... > if (special_cases) > special_cases->push_back(current_case); > } > } > } > Before I discovered optional, I used a plain reference, but that was annoying > because I had to create a dummy vector to be used as the default argument. > (The other alternative would have been to use a pointer, but then the caller > has to use the uglier syntax of passing in "&special_cases" rather than > "special_cases"). Nathan, going back to the same question I asked Andrey ( http://groups.google.com/group/boost-developers-archive/msg/704971a1eb63b3d2) it looks like your use case would still work if we disabled any sort of assignment for optional references (even the assignment from boost::none for resetting). Am I correct? Regards, &rzej

2 1

Re: [boost] [optional] generates unnessesary code for trivial types
by Brian Wood 13 Feb '12

13 Feb '12

Andrzej Krzemienski: > But even that appears like a non-obvious thing to me. Would other people > here in the list, and also developers in general agree that it is ok that > you have output operation but no input operation? I think that in the > standard library they always go in pairs. (I am not sure, though). I haven't followed this closely, but don't see a problem with not being symmetrical here. The C++ Middleware Writer (CMW) has asymmetric support for Boost Range types: @out (boost::sub_range<std::vector<int32_t> >) If you omit the @out or write @in on that line, the CMW gives you an error message that ranges don't support receive (input) functionality. It only made sense to me to output via a range so that's all that's supported for now. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net I'm happy Adele won all those Grammys. She deserves them them I think.

1 0

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 13 Feb '12

13 Feb '12

> >> Side question: is streamablity going to be in your proposal? > > It is not currently. The reason for that is that there is no clear way how > > it should be implemented (a similar issue applies to pairs, tuples, > > variant, any, etc...) See > > http://lists.boost.org/Archives/boost/2005/03/81619.php<http://www.google.com/url?sa=D&q=http://lists.boost.org/Archives/boost/2005…>for discussion. I > > believe that the problem is with the streaming itself. For instance, should > > streaming out and then streaming the result back in produce the same value? > > Some people expect that, but even std::string could not provide this > > behavior. > > I'd do only << and forget about >> But even that appears like a non-obvious thing to me. Would other people here in the list, and also developers in general agree that it is ok that you have output operation but no input operation? I think that in the standard library they always go in pairs. (I am not sure, though). Also, how would you implement it? what should an uninitialized optional print? Nothing? but how is having printed an uninitialized optional<int> different that not having printed anything? A question mark? but how would the following two be different: optional<string> o1; // uninitialized optional<string> o2 = "?"; cout << o1; cout << o2; If you propose to provide only output operation, then it looks like you want this for some sort of logging. But perhaps it is better to have some overloaded function toString() that converts all the types to strings. Usually the string format that works for one program does not work for the other. And there appears to be no natural/intuitive way of representing any type (like optional) as text. Regards, &rzej

3 2

[1.48.0] Trouble building boost with debug-store=database option (Visual C++ 2010 SP1 64-bit)
by Michael Goldshteyn 13 Feb '12

13 Feb '12

I have always built boost (up to 1.47.0) using the following command line: bjam -j 8 --without-mpi --without-python --build-dir=vc100-bld-64-bit --build-type=complete --toolset=msvc-10.0 architecture=x86 address-model=64 --stagedir=64-bit-vc100 debug-symbols=on debug-store=database stage Now, when I specify the debug-store=database option in the command line above, the build fails and gives me errors as can be seen at the bottom of the following build output excerpt: ----------------------------------------------------------------------------------------------------------------- ...patience... ...patience... ...patience... ...patience... ...found 9190 targets... ...updating 3251 targets... common.mkdir 64-bit-vc100 common.mkdir 64-bit-vc100\lib common.mkdir vc100-bld-64-bit\boost\bin.v2\libs\math\build common.mkdir vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0 common.mkdir vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug common.mkdir vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64 common.mkdir vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86 common.mkdir vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store-database common.mkdir vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store-database\link-static common.mkdir vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store-database\link-static\runtime-link-static compile-c-c++-pch vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store-database\link-static\runtime-link-static\pch.pch pch.pch.cpp compile-c-c++ vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store-database\link-static\runtime-link-static\assoc_laguerre.obj assoc_laguerre.cpp libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2858: command-line option 'program database name (/Fde:\dev\devel\libs\boost\boost_1_48_0\vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store -database\link-static\runtime-link-static\libboost_math_tr1-vc100-sgd-1_48.pdb)' inconsistent with precompiled header, which used '/Fde:\dev\devel\libs\boost\boost_1_48_0\vc100.pdb' libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2859: e:\dev\devel\libs\boost\boost_1_48_0\vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store-database\link-static\runtime-link-static\libbo ost_math_tr1-vc100-sgd-1_48.pdb is not the pdb file that was used when this precompiled header was created, recreate the precompiled header. call "c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\vcvarsall.bat" amd64 >nul cl /Zm800 -nologo @"vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store-database\link-static\runtime-link-static\assoc_laguerre.obj.rsp" ...failed compile-c-c++ vc100-bld-64-bit\boost\bin.v2\libs\math\build\msvc-10.0\debug\address-model-64\architecture-x86\debug-store-database\link-static\runtime-link-static\assoc_laguerre.obj... ----------------------------------------------------------------------------------------------------------------- Is the debug-store=database option no longer supported? Is something else wrong with my build command?

1 1

copy a graph (adjacency_list) to another one
by ShNaYkHs ShNaYkHs 13 Feb '12

13 Feb '12

How can I copy a graph of type adjacency_list to another one graph of type adjacency_list ? Look at the flowing code example: typedef adjacency_list<setS, setS, undirectedS, NodeDataStruct, EdgeDataStruct> MyGraph; MyGraph g1, g2; // processing g1: adding vertices and edges ... // processing g2: adding some vertices and edges ... g1.clear(); g1 = g2 // this gives an execution error (exception) g1 = MyGraph(g2); // this also gives an execution error g2.clear(); Note that to use of copy_graph(...) it is said that the graph type must be a model of VertexListGraph. In my case it is an adjacency_list ... Thanks,

1 0

Re: [boost] [optional] generates unnessesary code for trivial types
by Hite, Christopher 13 Feb '12

13 Feb '12

> On 1.2.2012. 17:53, Hite, Christopher wrote: > > As for the debugger the new C++ allows for a union to contain a > > class. So if a placeholder implemention using such a union would show the data in debug. > But the pointer approach would also work with "real world" compilers > ;) This isn't for science fiction. Gcc says they support n2544 since 4.6. http://gcc.gnu.org/projects/cxx0x.html http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2544.pdf I just tried it out: template<typename T> union placeholder{ T v; placeholder() {} ~placeholder (){} }; ... placeholder<std::string> ps; std::string s("hi"); new(&ps.v) std::string(s); < Uninited happens to contain null. > (gdb) print ps $2 = {v = {static npos = 18446744073709551615, _M_dataplus = {<std::allocator<char>> = {<__gnu_cxx::new_allocator<char>> = {<No data fields>}, <No data fields>}, _M_p = 0x0}}} < Initied: > (gdb) print ps $3 = {v = {static npos = 18446744073709551615, _M_dataplus = {<std::allocator<char>> = {<__gnu_cxx::new_allocator<char>> = {<No data fields>}, <No data fields>}, _M_p = 0x602028 "hi"}}} I don't know what platform you're using, but it seems completely reasonable to #ifdef a version of the placeholder in that does this so people can debug easily. Does that remove the main reason you wanted a pointer? BTW I did look at your code some. The deconstructor mixin, it's the same technique I used! For the ctor I just define a intermediate class with either default copy and operator= or impled ones. Chris

1 0

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 13 Feb '12

13 Feb '12

> > I am > > thinking of disabling the assignment not because I think it does not belong > > to references, but because there are two ways of implementing it, and > > implementing it either way would surprise a different group of > > programmers. > > And this would be a "run-time surprise". Instead my choice (not necessarily > > the best one) is to provide a "compile-time surprise". > > If value semantics are achievable for this kind of optional, I think > it's better to supply that and let the people who don't expect value > semantics be surprised at runtime. It is very difficult to provide a non-surprising/non-controversial behavior. While I am not happy with my solution, I would also have concerns about "run-time surprise" because: First, there are two ways of implementing optional reference assignment (rebinding or not rebinding) and it seams (from the past discussions in this group) that either is equally counter-intuitive, and it is not clear which one to choose. It would have to be an absolutely arbitrary choice. People are strongly convinced about their views and it is not possible to come up with a reasonable compromise. In fact it is the optional reference assignment that prevented the addition of Optional to ISO C++ the first time (http://lists.boost.org/Archives/boost/2005/10/95120.php) Second, it is difficult to say about value semantics here. References themselves are not really value semantic (at least according to my understanding of the term): they have shallow copy constructor and deep copy assignment. Even if it is disputable for native references, it is more so for optional references, which removes the "special" aspects of references, like extending the life-time of a temporary, reference semantics, or no-storage requirement. We would be building value semantics on a non-value-semantic type. Or in other words, I am concerned that we would only be providing "value-semantics syntax" but not "value-semantics semantics". But we would violate the axioms of value semantic types (like the "separation of the value"). Regards, &rzej

1 0

Boost.Application (Pre Alpha) Release 2 available
by Renato Tegon Forti 13 Feb '12

13 Feb '12

Hi All! There is a new version of "Boost.Application" available in SF (http://sourceforge.net/projects/boostapp/) >> Boost.Application_pre_alpha_2.zip (http://sourceforge.net/projects/boostapp/files/Boost.Application_pre_alpha_ 2.zip/download) This version is based on received comments ! Please, install it: 1) Copy: Boost.Application_pre_alpha_2\boost\application To: boost_1_48_0\boost and, Boost.Application_pre_alpha_2\libs\application To: boost_1_48_0\libs 2) Build (bjam link=shared) . 3) And, to see what has changed, please see the tutorial in help (doc): boost_1_48_0\libs\application\doc\html\application\tutorial.html I will wait for comments! Thanks Renato

2 2

[iostreams] output_filter works only once
by Steven Samuel Cole 13 Feb '12

13 Feb '12

i am trying to use an boost::iostreams output filter to add a string to the beginning and the end of whatever i stream out. my code below works, but only the first time; the second time, the output seems to get lost somewhere, the write method doesn't even seem to get called. i thought at first i'm sending something to the stream that triggers its fail bit, but the stream seems good. the same problem occurs on mac and linux, with latest boost release (1.48) and svn trunk, with cout and a file sink as device. is that a bug ? or am i doing something wrong in my code ? #include <iostream> #include <sstream> #include <boost/iostreams/concepts.hpp> #include <boost/iostreams/device/file.hpp> #include <boost/iostreams/filtering_stream.hpp> #include <boost/iostreams/operations.hpp> using std::cout; using std::endl; using std::streamsize; using std::string; using std::stringstream; class add_string_output_filter : public boost::iostreams::multichar_output_filter { public: template<typename Sink> streamsize write(Sink& sink, const char* s, streamsize n) { string out_string = string(s); // remove trailing '\0' to prevent line break if (out_string[out_string.size()-1] = '\0') out_string = out_string.substr(0, out_string.size()-1); string pre_string("prepended string - "); string app_string(" - appended string"); stringstream sstrm; sstrm << pre_string << out_string << app_string << endl; // TODO: char* to string, back to char* ?!? return boost::iostreams::write(sink, sstrm.str().c_str(), sstrm.str().length()); } }; int main() { boost::iostreams::filtering_ostream out; out.push(add_string_output_filter()); out.push(cout); // string #01 is printed, // string #02 gets lost out << "string #01" << endl; out << "string #02" << endl; }

2 1

BoostCon/C++Now! Talk: How I Code and Why
by Gottlob Frege 13 Feb '12

13 Feb '12

I talked about this last year, and this year I've submitted the proposal, so If you volunteered last year (and are still interested) and/or are interested in helping with a particular/peculiar talk at BoostCon/C++Now this year, then read on, and contact me offline: I'm planning on giving a talk, entitled "How I Code and Why". It is not meant to be presumptuous and tell you how *you* should code, but instead just explains how I code - day-to-day - and how I came to these patterns/conclusions. But who cares just about how *I* code, people want to hear how other members of the Boost community - people they've come to know and respect via the boost lists - code. So I'm hoping to have a few co-conspirators on stage with me, and have each explain a fundamental guiding principle that they follow in their every day code, how they came to adopt this principle and why they find it valuable. For example, I will tell the simple story ('epiphany') of why my favourite comment word is 'otherwise', and how this relates to advice you may have heard or read before. I like the flavour of [ simple, real world, specific ] ---> [ general principle ] The goal is to bring a more real world down to earth picture to the sometimes lofty fundamentals found in books and lectures. Instead of a book explaining how a guiding principle makes sense *in theory*, it would be great (I think) to hear how respected members of the community apply these principles in real life. So, if you want to participate, email me, and we will see what we can figure out. (And/or I might just have to track you down based on promises made last year!) Not sure how many people we need. I'm thinking 5-15 mins per 'principle', and I think you only need to present one (I think the weight of picking *just one* principle makes it all the more interesting). Anyhow, we can work out the details as we go along. Tony PS. this is not (yet?!) an accepted talk, but I have a bit of chicken/egg thing here: ie it would help to have a few people on board to show that the talk is viable, and thus be accepted.

1 0

PCL - Portable C++ Library
by Fernando Pelliccioni 12 Feb '12

12 Feb '12

Hi all, ( Maybe it's an OFF-TOPIC (Sorry) ) At the GoingNative2012 conference, Herb Sutter said that the main disadvantage of C++ today is the lack of a standard library (like dotNet or Java frameworks) He called people to propose additions, like REST Webservices, Async I/O, XML/JSON, ... On the other hand, a member of the public claimed for a desired feature for C++. The answer (can't remember if it was Herb or Bjarne) was to send the paper to WG21 and attend committee meetings to defend his proposal. This is what almost everyone already know about the way WG21 works. I'm not a member of the Committee, or of any company/organization that has an interest in it (Boost, Google, Microsoft, Apple,...) The question is, how I can do to attend meetings? I have no time available or money to pay me the trip myself. Consequently, I see no possibility to attend meetings, then, I have no possibility to defend an idea. Am I wrong? Perhaps this question is for the Committee members (Beman, Dave, Andrew ...) Is there a way to send a proposal and defend it without having to attend meetings? On the other hand, I would like to have access to the discussions (mailing list). or... Is it just for members? Thanks and best regards, Fernando Pelliccioni.

10 24

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 12 Feb '12

12 Feb '12

> I see your point but, IMHO, optional<T&> is too different from normal > references to attempt to draw this association. After all, > optional<T&> is an object in the sense it has internal state and you > can take its address while T& is not (one may call it an alias of an > object). It is therefore logical that optional<T&>::operator= operates > on the object (i.e. on the optional contents) and hypothetical > T&::operator= operates on the referred object. > > Note that if you store a normal reference to int as class member, you > > already have to write your assignment yourself. changing a normal reference > > to an optional reference should not come as something irregular. > > Again, I tend to see optional<T&> as an object, with no apparent > reason why it cannot be assigned to. I understand (I think) your point of view. Let me clarify one thing. I am thinking of disabling the assignment not because I think it does not belong to references, but because there are two ways of implementing it, and implementing it either way would surprise a different group of programmers. And this would be a "run-time surprise". Instead my choice (not necessarily the best one) is to provide a "compile-time surprise". With your view of optional reference (if I got it right it is a pointer with a somewhat different syntax) your expectation of rebinding assignment comes as natural. With a different model of optional reference a non-rebinding assignment comes as more natural. I believe that optional<reference_wrapper<T>> would serve your purpose best. Or would it also introduce the lack of uniformity?

3 3

[optional] generates unnessesary code for trivial types
by Hite, Christopher 12 Feb '12

12 Feb '12

When decompiling my code I noticed a bunch of unnessesary code caused by boost::optional. 1) deconstruction typedef boost::optional<int> optional_int; void deconstruct_boost_optional(optional_int& o){ o.~optional_int(); } One would expect this to do nothing. Instead gcc 4.6.0 with O3 generates: if(m_initialized){ // do nothing m_initialized = false; } 00000000 <deconstruct_boost_optional(boost::optional<int>&)>: 0: 8b 44 24 04 mov 0x4(%esp),%eax 4: 80 38 00 cmpb $0x0,(%eax) 7: 74 03 je c <deconstruct_boost_optional(boost::optional<int>&)+0xc> 9: c6 00 00 movb $0x0,(%eax) c: f3 c3 repz ret This one could be easily fixed by removing the bit that sets m_initialized to false, since we're deconstructing anyway. 2) assignment also generates these problems: void assign_boost_optional(optional_int& o){ o=13; } Here there's a semantic issue: we have to decide to use the copy constructor or operator=. This is also wasteful for POD types or any type which has_trivial_copy<>. 3) Even more expensive is if we want to copy an optional<int> void assign_boost_optional(optional_int& a,optional_int& b){ a=b; } 00000000 <assign_boost_optional(boost::optional<int>&, boost::optional<int>&)>: 0: 8b 44 24 04 mov 0x4(%esp),%eax 4: 8b 54 24 08 mov 0x8(%esp),%edx 8: 80 38 00 cmpb $0x0,(%eax) b: 74 0b je 18 <assign_boost_optional(boost::optional<int>&, boost::optional<int>&)+0x18> d: 80 3a 00 cmpb $0x0,(%edx) 10: 75 16 jne 28 <assign_boost_optional(boost::optional<int>&, boost::optional<int>&)+0x28> 12: c6 00 00 movb $0x0,(%eax) 15: c3 ret 16: 66 90 xchg %ax,%ax 18: 80 3a 00 cmpb $0x0,(%edx) 1b: 74 09 je 26 <assign_boost_optional(boost::optional<int>&, boost::optional<int>&)+0x26> 1d: 8b 52 04 mov 0x4(%edx),%edx 20: c6 00 01 movb $0x1,(%eax) 23: 89 50 04 mov %edx,0x4(%eax) 26: f3 c3 repz ret 28: 8b 52 04 mov 0x4(%edx),%edx 2b: 89 50 04 mov %edx,0x4(%eax) 2e: c3 ret Three possible branches! Theoretically single 64 bit copy do the job. I'm tempted to say: it would be best if for any T has_trivial_copy< optional<T> > iff has_trivial_copy<T>. It might make a sense to make an exception for huge T, where the copying an unused T is more expensive than the branching. 4) has_trivial_destructor<T> should impl has_trivial_destructor< optional<T> > , but this is hard to implement without specialization of optional. Checking has_trivial_destructor might take care of the complexity of optional<T&> since has_trivial_destructor< T& >. I'd be willing to fix #1. The other issues need some discussion. Chris

14 39

Re: [boost] Discovering C++11 lambda argument and result types to construct boost::function
by Andrzej Krzemienski 11 Feb '12

11 Feb '12

> On comp.lang.c++.moderated I talked to Daniel Krügler about how to > discover argument and result types from C++11 lambdas in a template > context. The thread has the title "How to discover argument and result > types from lambda for constructing std::function?" > https://groups.google.com/d/topic/comp.lang.c++.moderated/qaMECIUlJp0...<http://www.google.com/url?sa=D&q=https://groups.google.com/d/topic/comp.lan…> > The task is to provide a function template "make_function" that takes > a C++11 lambda expression and returns a boost::function with the > correct signature to call the lambda. This may be extended to accept > any other callable type. The task you are attempting to solve looks very unusual to me. All the usages of a lambda I encountered so far are that you know the type of a callback in advance and define the lambda so that it matches the signature of the targeted callback. Sorry if this question is silly, but could you give me an example of where this deduction mechanism could be used? Regards, &rzej

2 1

Release testing failures for "tools/build"
by Steve M. Robbins 11 Feb '12

11 Feb '12

Hi, Build/branches/release [1] is failing almost all tests on almost all platforms. I checked several reports and they all point to the following, which should be trivial to fix. reason {{{ unexpected status returned by bjam }}} STDOUT {{{ /Volumes/scratch/kbelco/boost/boost/tools/build/v2/build/project.jam:266: unbalanced parentheses }}} [1] http://www.boost.org/development/tests/release/developer/build.html

1 0

[filesystem.v3] possible bug in replace_extension
by Frédéric Bron 10 Feb '12

10 Feb '12

replace_extension seems to have the wrong behaviour if the provided new extension does not start with a dot. The following program: #include <iostream> #include <boost/filesystem.hpp> int main() { boost::filesystem::path p("foo.bar"); std::cout<<p<<'\n'; p.replace_extension("foo"); std::cout<<p<<'\n'; return 0; } built with the following command line on linux 64 (with boost 1.48.0): $ g++-4.6.2 -DBOOST_DISABLE_ASSERTS -DBOOST_FILESYSTEM_VERSION=3 -DBOOST_FILESYSTEM_NO_DEPRECATED -o toto -I/soft/bal/usr/gcc-release/boost/include toto.cc -L/soft/bal/usr/gcc-release/boost/lib -lboost_filesystem -lboost_system produces the following output: "foo.bar" "foo" but should produce: "foo.bar" "foo.foo" as read from the documentation path& replace_extension(const path& new_extension = path()); Postcondition: extension() == replacement, where replacement is new_extension if new_extension.empty() || new_extension[0] == the dot character, otherwise replacement is the dot character followed by new_extension. Adding the dot before foo makes the program work: p.replace_extension(".foo"); This seemed to work with filesystem v2. Frédéric Bron

3 5

Re: [boost] [optional] generates unnessesary code for trivial types
by Hite, Christopher 10 Feb '12

10 Feb '12

I think paul Fultz wrote: > Actually, you could just take the optional_traits as the first parameter. So you define > optional<T> or optional<optional_traits<my_traits<T> > >. Then optional would be > specialized for optional_traits that will get the user-defined traits. That new optional might break old code: template<typename T> void print(const optional<T>& o){ if(o){ T copy=*o; std::cout<<copy; } } That copy is going to be a optional_traits<>. My method would also force you to add traits to the signature, but at least you wouldn't need to write two specializations: template<typename T,typename Traits> void print(const optional_with_traits<T, Traits >& o); Se have to ask ourselves if configuration is worth it. I think sometimes you don't find that out until it's too late and someone wants a option. Things I can think of making configurable: * bool type - a word might be faster on risk machines * use_trivial_destruction - there might be a case for overridding this * use_trivial_copy - cann't see a case for overriding this * bool_first * alignment - maybe 4 byte alignment is legal but 8 byte is faster * enable_assertions Chris

1 0

How to make tests building faster?
by Mateusz Łoskot 10 Feb '12

10 Feb '12

Hi, I'm trying to figure out if there is anything I could do to improve compile/link-time for tests of Boost.Geometry library. Currently, the tests follow fairly canonical approach in Boost: 1) Each .cpp file defines a single test program and all local test routines are executed from test_main() // test_feature_x.cpp void test1() {} // make use of BOOST_CHECK_* macros void test2() {} int test_main(int, char* []) { test1(); test2(); return 0; } 2) Jamfile per testing project builds and runs each program separately # features/Jamfile.v2 test-suite test-features : [ run test_feature_x.cpp ] [ run test_feature_y.cpp ] ; 3) Root mylib/test/Jamfile.v2 defines testing projects to build and run import testing ; project boost-mylib-test : ; build-project features ; build-project algorithms ; build-project abc ; In total, there are nearly 170 test programs in Boost.Geometry. Obviously, running the whole set of tests (b2 command issued in libs\geometry\test) is time consuming process. I'm wondering if there is any way to reorganise the tests to cut down the build (linking) time. My first idea is to decrease number of run entries (e.g. [ run test_feature_y.cpp ] ) in Jamfiles, by building related tests as single test suite program. Conceptually: [ run test_feature_x.cpp test_feature_y.cpp ] Currently, there is no use of Boost.Test features for tests organisation like BOOST_AUTO_TEST_CASE BOOST_TEST_SUITE etc. I wonder if use of any of the above would help in restructuring tests and decreasing number of programs to build. Another aspect of Boost.Geometry tests I'd like to improve is to improve tests report output. Currently, it is reported as *Passed* or *Failed*. I presume that using Boost.Test to group tests in suits with test cases would improve test report providing details about location of failure (which suite, which case, or even better). I'm looking for any piece of advice on the issues discussed above: - How to cut down build time of tests? - How to improve test output report (and keep it suitable for Boost regression testing framework)? - Is it advised to switch to use Boost.Test features to manage suites and test cases? (I tried to figure it out browsing tests of other libs, but it doesn't indicate any preferred practice). I'd be thankful for any insights. Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

10 34

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 10 Feb '12

10 Feb '12

> > int i = 1; > > int j = 2; > > optional<int&> oi = i; > > optional<int&> oj = j; > > i = j; > > The effect here is that i remains 1, j remains 2 and oi and oj both hold a > > reference to j. You may find it less surprising but if you think of > > optional reference as a regular reference that is initialized a bit later, > > the behavior is not what you would expect. > > Huh? How does oi come to hold a reference to j? Apologies, I meant to say int i = 1; int j = 2; optional<int&> oi = i; optional<int&> oj = j; oi = oj; Boost.Optional documentation explains it better: http://www.boost.org/doc/libs/1_48_0/libs/optional/doc/html/boost_optional/… Regards, &rzej

1 0

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 10 Feb '12

10 Feb '12

> I have a question though. Why prohibit opt = opt assignment? It looks > quite safe and has a fairly obvious behavior. If I have an optional > reference as a member of my class, the lack of assignment in optional > would force me to define a custom assignment operator for my class. > This seems to be an unnecessary requirement. Also, in the source code > I dealt with I often saw people writing something like opt = > optional<T>() to clear the value. This would break with references for > no apparent reason. First, let me show why opt = nval; is controversial. Current semantics for boost::optional<T&> is to rebind on assignment, which means that in the following code: int i = 1; int j = 2; optional<int&> oi = i; oi = j; The effect of this program is that i remains 1, j remains 2 and oi holds a reference to j. This is surprising to those that think of optional as delayed initialization. I lean towards disabling opt = opt because it is very similar to opt = nval; int i = 1; int j = 2; optional<int&> oi = i; optional<int&> oj = j; i = j; The effect here is that i remains 1, j remains 2 and oi and oj both hold a reference to j. You may find it less surprising but if you think of optional reference as a regular reference that is initialized a bit later, the behavior is not what you would expect. Note that if you store a normal reference to int as class member, you already have to write your assignment yourself. changing a normal reference to an optional reference should not come as something irregular.

3 2

Re: [boost] [git] neglected aspects
by David A. Greene 09 Feb '12

09 Feb '12

Thomas Heller <thom.heller(a)googlemail.com> writes: > On 02/08/2012 07:30 AM, Steven Samuel Cole wrote: >> A quick read on submitting bugs on boost.org, svn co yadi yadi, fix the >> typos locally. Of course I don't have write privileges to the repo, so >> the best I can do for now is create a patch and attach that to a bug >> report. Within minutes, someone takes care of the bug, comments and >> takes ownership. Excellent! Smithers, money fight! > > Great! Now with something like github you create your own fork, push > to that and eventually create a pull request and wait until it gets > applied ... as you described. The process didn't change. You just > named the steps differently. No. The fundamental part you're missing is that the source control utility (git in this case) handles it for you. There is no need to go outside the sournce control utility to make additional changes. >> What are my options now ? Revert my changes, base the new ones on the >> head revision and send another patch ? Create a new patch file and >> manually remove the diffs of the old changes I already sent ? How will >> the upstream maintainer know which changes are based on what version ? > > Simple. Update the bug you already filed with the patch containing all > fixes. What would be the options with git? Update the pull request? > Again, same thing, different name. No, not the same thing. Again, this is all happening within the source control utility. Steven is relating real issues with svn. I have encountered them many times. I have found that git eliminates them. >> Also, I notice a few other things that in my opinion could be done >> better to facilitate adoption of the iostreams library. > So with git you pushed them to your personal fork. Over time, your > fork and the upstream version eventually diverge. You have to maintain > your changes. Same thing when the changes lurk on your local svn > working. There are several advantages to a git fork over an svn local workarea. - You can make a new branch for each feature, keeping the code for logical features separate. You can submit them whenever you want, in whatever order you want. - You can share the forks and branches with others. - You can massage the fork/branch over time to respond to review feedback, all supported directly by the source control utility. IME, git rebase -i and git add -i are killer features for the code review process. >> A couple of hours later: I get an email from boost bugs/svn; the >> upstream maintainer has committed my changes. However, I actually >> receive not one, but two emails, because the upstream guy chose to split >> my patch into changes on documentation and changes on source code (which >> presumably required extra work on his part). > > Frankly, I don't see how this would change with git. Actually, git would make things easier for the maintainer here. Either he/she could request the submitter to break up the patch, which is easily done with rebase -i/add -i or the maintainer could use the same tools to do it him/herself. >> I do an svn up and now have to deal with conflicts between my local >> changes and the new commits: I make a note of my second set of changes >> and overwrite my local files with the new repo versions, then bring the >> second set back in. > > Same again. How is this significantly different to what you'd do with git? It's all within the utility. There's no need to back out patches (the second set of changes in this case) manually from the source and re-apply them manually after update. Because each feature is in its own (local) branch, updates of one branch don't conflict with unrelated features in other branches. Yes, you'll need to resolve conflicts but it's much less messy with this kind of separation. >> Uff! That's a lot of work just to fix some typos! And these are just >> cosmetic issues in discrete chunks that do not require any testing; >> contributing changes to source code would take even more effort and more >> caution - build and test on several platforms, peer review, etc. > > Right, all that wouldn't change with having git as the tool of choice. It does, dramatically. git actually directly supports workflows that developers use when working on large projects. svn does not and there are all sorts of hacks out there to work around those problems. I've written a fair number myself. I don't need any of them with git. >> I don't have to wait for the first set of changes to be merged into >> the trunk before I resync, resolve conflicts and base the second >> set on the new head revision; I simply create a new branch for >> a new change set and send a new pull request once my work is complete. > > Errm ... you can still do that with svn. just continue working. Make a > new patch, update the patch in the bug report you filed, yes trac can > do that. There really is no need to wait for anything. But now you're conflating multiple features. Many times I have a feature in-progress and another feature I'd like to work on that's unrelated to the first feature. I don't want to disturb the source tree of the first feature because I might have to update it (respond to feedback, etc.). I need to be able to test both features in isolation. >> The upstream maintainer has no peer pressure to merge any changes in: >> He/she is sitting on the head revision and is looking at a number of >> pull requests for change sets in various personal forks like mine; > > So, how is it really different from the current trac system? svn doesn't support distributed operation so it can't support cherry-picking from multiple developers. You have to go outside the tool (manual diff/patch) to do it. That is painful. > I think i miss something fundamental here. Yes, you are. You're missing that every operation Steven is talking about is directly supported in git. You use the source control tool to manage source changes, always. There's no need to ever do a manual diff/patch. git manages multiple changes for you and organizes them in a logical way. It is easy to change among them, apply some, test them, revert some of them and so on. It's incredibly easy and productive compared to doing the same in svn. > While there are shortcomings in the current process, they won't be > solved by changing tools. Many will be. -Dave

4 3

[thread] wrong guard for explicit bool operators (c++11)
by Juergen Hunold 09 Feb '12

09 Feb '12

Hi Vicente, your commit New Revision: 76951 URL: http://svn.boost.org/trac/boost/changeset/76951 Thread: Added explicit to operator bool for locks (11 hours ago) leads to the following errors when using gcc-4.6.1 in non-c++11 mode: $BOOST_ROOT/boost/thread/locks.hpp:1323:34: warning: explicit conversion operators only available with -std=c++0x or -std=gnu++0x [enabled by default] It seems that the guards checking for explicit conversion operators are wrong. -#ifndef BOOST_NO_EXPLICIT_CONVERSION_OPERATORS +#if defined(BOOST_NO_EXPLICIT_CONVERSION_OPERATORS) Patch attached. Ok to commit? Yours, Jürgen -- Dipl.-Math. Jürgen Hunold | IVE mbH Software-Entwickler | Lützerodestraße 10 Tel: +49 511 897668 33 | 30161 Hannover, Germany Fax: +49 511 897668 29 | http://www.ivembh.de juergen.hunold(a)ivembh.de | | Geschäftsführer: Sitz des Unternehmens: Hannover | Univ.-Prof. Dr.-Ing. Thomas Siefer Amtsgericht Hannover, HRB 56965 | PD Dr.-Ing. Alfons Radtke

3 2

IDL to C++11 Language Mapping
by Johnny Willemsen 09 Feb '12

09 Feb '12

Hi, Last year I posted a question on this list related to the IDL to C++11 Language Mapping for CORBA. We are currently working on creating such a new mapping and maybe there are people on this list that are interested in giving feedback. All details about this effort are online at http://osportal.remedy.nl (example code and a draft OMG specification) and http://www.orbzone.org for a discussion forum. Best regards, Johnny Willemsen Remedy IT http://www.theaceorb.nl

1 0

quickbook abuse without boostbook
by Andreas Pokorny 09 Feb '12

09 Feb '12

Hi, My company is using docbook for end user documentation and to some degree also for design documentation. Since docbook is nothing anyone seems to be fond of writing, I now started looking into quickbook. The features that attract me the most are the neat syntax and programmability. The docbook environment that I am supposed to use is based on a different docbook version, than the one referenced in boostbook. So at the moment I have an xml file containing the book and booinfo header containing our corporate design foobar and disclaimer stuff. Then each chapter is referenced. The chapters are written in quickbook as chapter documents. When running the toolchain, it complains that it could not find the boostbook dtd - probably because downloading of dtd is disable, or fails because of our proxy. Is there a way to surpress the DOCTYPE tag within the chapter xml output files? regards Andreas Pokorny

6 7

GSoC 2012
by sultana rashid 09 Feb '12

09 Feb '12

Hello all, I am Sultana Rashid,a CSE student.As a computer engineering student I have good programming skills and am familiar with many new tools and technologies.I keep an eye on Boost libraries for almost last one year. Boost libraries are very useful and rich.But I found some new things can be added to it while exploring the libraries as Graph,Math,Geometry etc. I saw that Boost'd like to participate again in GSoC and I wish to work with the organization as a developer.Can I propose my ideas here just now? Thanking you, Sultana rashid. [1] http://lists.boost.org/Archives/boost/2012/02/190176.php

3 2

[interest] Type Aspects and compile-time constraints
by Beren Minor 09 Feb '12

09 Feb '12

Hi everyone, I would like to introduce a project I'm working on and a mechanism that emerged from the projects needs and, as far as I could feel, may be useful in a general case. By lack of words (let say), I named this Type Aspects, as an analogy to Type Traits. The project I'm working on, for quite a while now, is about creating a statically, strongly typed, compile-time checked and heavily simplified interface to OpenGL. I know that "Boost.OpenGL" is a subject that has been discussed many times on this list and that every time the outcome of the discussion is that Boost is not going to support a mere wrapper around some existing API. Well, I perfectly understand this and I'm not looking for the possibility to have this included in Boost. The project itself and its functional goal isn't actually the subject of my post, but it is a good introduction to type aspects, as it is what led me writting this as a general supporting mechanism. So, to introduce the idea, if some people do not know OpenGL, it is a typical C API, full of enumerations (well not even enumerations, integers preprocessor constants), loosely typed, and full of bloated function names with fixed number of parameters of various flavors. Obviously, every single function call takes an average of two of those constants as parameters. And obviously most combinations of values are leading to undefined operations, whithout having anyone complaining about anything, except a black window on your screen and a poor-man error code whenever there is one. Probably the most hideous nightmare you could ever have to use as a programmer. That was my observation. So I decided to take all these constants, that any OpenGL programmer is usually giving directly to feed the function calls, as parameters, to take all these functions, wrapp them all, rename related functions to use nice C++ overloading... but above all, convert these constants as types. This way I was able to write compile time constraints, checking the combination of constants provided to these functions. The goal was (and I must admit that it's working pretty much fine), that I would certainly be able to write the constraints described in the OpenGL specifications in term of templated C++ type constraints, making good use of static assertions with nice messages referring to the spec itself, and of metaprogramming techniques to achieve this. Then it appeared, after struggling a while trying to abstract all the data in use in OpenGL, that I could extract some fundamental properties of all these types and that the constraints described in the specifications would be experessed as simple and clear constraints on these properties. That's what I defined as Type Aspects. Let say OpenGL is able to handle 10 different type of textures. These types are different by the way color components are packed together, by their order, by their precision or numeric type (floating point or integral). All these are aspects of the texture type. Some OpenGL function might then be used to load data to a given texture, but depending on the texture type, it will only accept a certain type of source data. For example, integral textures only accept integral data, whereas floating point textures accept any data. This would be implemented as a simple constraint checking that the "Numeric" aspect of the source data type is compatible with the "Numeric" aspect of the texture type. Moreover, this also allows the user to provide a limited set of these aspects that he desires to have, and not others that he doesn't care of, and the compiler would be able to resolve the more relevant type to use depending on the use case. Type Aspects, as I defined it for the use in my projects, are like axises describing a type, every axis taking a value in a given set of possible values. This is not limited: as these values are types as well, they can also have aspects and be described. As an example that's what I did to describe the "Numeric" aspects of OpenGL data. Numeric aspect takes a value in a given set of predefined numeric archetypes. Every single archetype then has some values the three aspects describing a number type: its signness (signed, unsigned, any), its integralness (floating, fixed point, integral, boolean, any), and its width (number of bits/bytes, any). Well to conclude, I can see that this is certainly not related to OpenGL anymore and that this is a general mechanism that can be used to describe types and create relationships between types. I don't know if it is a subject that already has been discussed or if there's anything like that in Boost already (I don't think so but I don't know all the Boost libraries by heart). Do you see any interest in this kind of thing? Do you think that this could be something that worth working on deeper? TL;DR: 1. OpenGL sucks, I implemented compile-time constraints wrapping the functions calls. 2. Thinking about compile-time constraints made me qualify the types in use with a general mechanism describing the type's "aspects". 3. Aspects are axises and a given set of predefined values on these axises using which a type and its properties can be described. 4. Constraints can then be easily written as MPL checks on aspects axises and values as long as type aspects are formalized. 5. Does it already exist? Is that interesing? Should I try to go deeper in the abstraction? Kind regards, -- Beren Minor

3 7

Re: [boost] [optional] generates unnessesary code for trivial types
by Hite, Christopher 09 Feb '12

09 Feb '12

On Tuesday, February 07, 2012 17:00:04 Andrey Semashev wrote: > Do I understand it correctly that optional_with_traits is an advanced > replacement for optional? If so, will the good old optional be optimized? No, optional will be ("isA") optional_with_traits. It's just a work around. I'd prefer to redefine optional: template<typename T, typename Traits=optional_traits<T> > class optional; That might in rare cases it could break user code like: mpl::quote1<optional> Personaly I doubt that this is such an issue, but have the best of both worlds I can define a temporary "optional_with_traits" which when boost goes to 2.0 we could deprecate and add the parameter to optional. template<typename T, typename Traits=optional_traits<T> > class optional_with_traits; template<typename T> class optional : public optional_with_traits<T> {...}; Do we gurantee boost users that templates will never add default parameters? > BTW, I would really like to see optional< T& > optimized to store T* > internally. I'm going to say something provacative here. I agree with Lucanus. I see no reason for optional<T&>. As far I can tell you could use a T*. The only justification I can think of is on system without memory protection you can build checks into operator*(). Maybe if you're mixing code with old libraries where T* might imply ownership you might use optional<T&> to imply no ownership and some temporary validity. Perhaps we should define a new "smart pointer" called dumb_ptr<T> which can't be assigned into auto_ptr,unique_ptr,shared_ptr, or any pointer type which implies ownership. Maybe I'm missing something, but I don't see the justification. Chris

5 4

Re: [boost] [optional] generates unnessesary code for trivial types
by Andrzej Krzemienski 09 Feb '12

09 Feb '12

> optional< T& > is a useful thing when you want to apply operators (such as > relation operators or streaming) to the referred value. In generic code you > don't have to specialize for pointers to do the right thing. I'm going to use > this property in my Boost.Log library. Andrey, would you mind giving us a short example of how you want to use an optional reference? I am in the middle of designing the new optional interface for TR2, and came to the conclusion that in order to avoid counter-intuitive semantics for optional reference assignment, I had better remove it at all; that is, optional references are to be limited: they should provide no assignment. You could still use optional values and optional references in generic code but with reduced interface: template <typename T> // T is a ref or a value void use( std::tr2::optional<T> opt, T nval ) { if (opt) { std::cout << *out; // fine *opt = nval; // fine, assigning T's not optionals opt = nval; // invalid if T is a ref opt = opt; // invalid if T is a ref } if (needToRebindAReference()) { opt.emplace(nval); // valid - always rebinds } }; Would such a limited interface as I described above be enough for your generic usage of optional? Regards, &rzej

2 1

Simple boost polygon boolean OR doesn't work: help needed
by Praveen Vs 09 Feb '12

09 Feb '12

Hi, Below is code for doing a boolean OR operation. I'm not sure of the mistake I'm doing here. The output generated is wrong. I'm not using the operator+() becaue of the compile issue on MSVC2010. #include <boost/polygon/polygon.hpp> namespace gtl = boost::polygon; using namespace gtl; using namespace boost::polygon::operators; using namespace std; typedef gtl::polygon_set_data<double> CPolygonSet; typedef gtl::polygon_data<double> CPolygon; static void test_boost_polygons() { CPolygonSet polyset1, polyset2, rset; CPolygon polygon1, polygon2; typedef gtl::polygon_traits<CPolygon>::point_type CPoint; vector<CPoint> poly1Points, poly2Points; poly1Points.push_back(gtl::construct<CPoint>(0.0000, 0.0000)); poly1Points.push_back(gtl::construct<CPoint>(50.0000, 50.0000)); poly1Points.push_back(gtl::construct<CPoint>(100.0000, -50.0000)); poly1Points.push_back(gtl::construct<CPoint>(50.0000, -50.0000)); poly2Points.push_back(gtl::construct<CPoint>(50.0000, 0.0000)); poly2Points.push_back(gtl::construct<CPoint>(100.0000, 50.0000)); poly2Points.push_back(gtl::construct<CPoint>(150.0000, -50.0000)); polygon1.set(poly1Points.begin(), poly1Points.end()); polygon2.set(poly2Points.begin(), poly2Points.end()); vector<CPolygon> polygonArray1, polygonArray2; polygonArray1.push_back(polygon1); polygonArray2.push_back(polygon2); polyset1.insert(polygonArray1.begin(), polygonArray1.end()); polyset2.insert(polygonArray2.begin(), polygonArray2.end()); gtl::arbitrary_boolean_op<CPolygonSet::coordinate_type> bop; bop.execute(rset, polyset1.begin(), polyset1.end(), polyset2.begin(), polyset2.end(), 0); vector<CPolygon> polys; rset.get(polys); for(unsigned int i = 0; i < polys.size(); ++i) { CPolygon::iterator_type it = polys[i].begin(); for(; it != polys[i].end(); ++it) { cout<<"("<<(*it).x()<<", "<<(*it).y()<<")"<<endl; } } } void main() { test_boost_polygons(); } -- -praveen

2 6

GSoC idea on Geometry library
by sultana rashid 08 Feb '12

08 Feb '12

Hello, I have several ideas on some libraries.Today I present on Geometry library. *1.Conics:* I did not found *conics* in Geometry library.Ellipse,parabola,hyperbola concept is very useful in geometry.Can Boost add some functionality of conics? as: 1.Area determination of conics 2.Foci determination 3.Major-minor axis 4.Determine whether a point on a conic 5.Focal length,center determination etc... etc... Or at least add something on Conic in Concept section? If this idea seems useful to you,please let me know.I will describe details on what I want to do about Conic section in Geometry library. *2. **Convex HUll: *There is only one algorithm implemented .We can implement *Gift wrapping*<http://en.wikipedia.org/wiki/Gift_wrapping_algorithm> *O*(*nh*) ; *Divide and conquer* *O*(*n* log *n*) or *Chan's algorithm*<http://en.wikipedia.org/wiki/Chan%27s_algorithm> *O*(*n* log *h*). Jarvis march ,Chan's algo are output sensitive.These are useful when we can assume that the result will not be too large. Thanking you, Sultana

3 2

Manually marking noexcept for a constructor
by Daryle Walker 08 Feb '12

08 Feb '12

I realized that my proposed C++11 update for base_from_member should propagate noexcept. But how do I manually specify the noexcept status of an inner constructor? (Beta versions of C++11 may just have core language changes but not the library changes, so I shouldn't rely on is_nothrow_XXX_constructible just like not relying on std::forward.) I originally thought of: class MyType{ MyInnerType x;public: MyType() noexcept( noexcept(MyInnerType()) );}; This expression includes the inner default constructor call, but it also secretly includes a destructor call (for MyInnerType), and therefore includes it in the calculations! But how about: class MyType2{ MyInnerType x;public: MyType2() noexcept( noexcept(new (std::nothrow) MyInnerType()) );}; Hopefully this, or something like it, includes the constructor call, without calling a destructor. I think the C++11 version of nothrow_t-new is marked noexcept, and I hope the complete new call doesn't hide the constructor call. Daryle W.

1 0

MSVC 2010 Compile error for polygon_set_data
by Praveen Vs 08 Feb '12

08 Feb '12

Hi, Below code gives a compile error in MSVC2010. Any ideas whats the issue? #include <boost/polygon/polygon.hpp> namespace gtl = boost::polygon; using namespace gtl; using namespace boost::polygon::operators; using namespace std; typedef gtl::polygon_set_data<double> CPolygonSet; static void test_boost_polygons() { CPolygonSet polyset1, polyset2, rset; rset = polyset1 + polyset2; } void main() { test_boost_polygons(); } Error: ===== \boost\polygon\polygon_45_set_data.hpp(1458): error C2825: 'iT': must be a class or namespace when followed by '::' 1>\boost\polygon\polygon_45_set_data.hpp(1524) : see reference to function template instantiation 'void boost::polygon::get_error_rects_shell<cT,const boost::polygon::point_data<T>*>(cT &,cT &,iT,iT)' being compiled 1>with 1>[ 1> cT=stlp_std::vector<boost::polygon::rectangle_data<Unit2>>, 1> T=double, 1> iT=const boost::polygon::point_data<double> * 1>] 1>\boost\polygon\polygon_45_set_data.hpp(1621) : see reference to function template instantiation 'void boost::polygon::get_error_rects<stlp_std::vector<_Tp>,boost::polygon::polygon_45_with_holes_data<T>>(cT &,cT &,const pT &)' being compiled 1>with 1>[ 1> _Tp=boost::polygon::rectangle_data<Unit2>, 1> T=double, 1> cT=stlp_std::vector<boost::polygon::rectangle_data<Unit2>>, 1> pT=boost::polygon::polygon_45_with_holes_data<double> 1>] 1>\boost\polygon\detail/polygon_set_view.hpp(102) : see reference to function template instantiation 'void boost::polygon::polygon_45_set_data<Unit>::applyAdaptiveBoolean_<0>(boost::polygon::polygon_45_set_data<Unit> &,const boost::polygon::polygon_45_set_data<Unit> &) const' being compiled 1>with 1>[ 1> Unit=double 1>]

1 1

[utility] Don't mind if I "change" base_from_member?
by Daryle Walker 08 Feb '12

08 Feb '12

Since the suggested trick of using GCC (4.6) from MacPorts as a Darwin GCC worked, I've tried out my first C++11 update: base_from member. It's very straightforward. //$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$Index: boost/utility/base_from_member.hpp===================================================================--- boost/utility/base_from_member.hpp (revision 76917)+++ boost/utility/base_from_member.hpp (working copy)@@ -1,6 +1,6 @@ // boost utility/base_from_member.hpp header file --------------------------// -// Copyright 2001, 2003, 2004 Daryle Walker. Use, modification, and+// Copyright 2001, 2003, 2004, 2012 Daryle Walker. Use, modification, and // distribution are subject to the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or a copy at // <http://www.boost.org/LICENSE_1_0.txt>.)@@ -10,6 +10,7 @@ #ifndef BOOST_UTILITY_BASE_FROM_MEMBER_HPP #define BOOST_UTILITY_BASE_FROM_MEMBER_HPP +#include <boost/config.hpp> #include <boost/preprocessor/arithmetic/inc.hpp> #include <boost/preprocessor/repetition/enum_binary_params.hpp> #include <boost/preprocessor/repetition/enum_params.hpp>@@ -68,12 +69,19 @@ protected: MemberType member; +#if defined(BOOST_HAS_RVALUE_REFS) && defined(BOOST_HAS_VARIADIC_TMPL)+ template <typename ...T>+ explicit BOOST_CONSTEXPR base_from_member( T&& ...x )+ : member( static_cast<T&&>(x)... ) // some libs don't have std::forward+ {}+#else base_from_member() : member() {} BOOST_PP_REPEAT_FROM_TO( 1, BOOST_PP_INC(BOOST_BASE_FROM_MEMBER_MAX_ARITY), BOOST_PRIVATE_CTR_DEF, _ )+#endif }; // boost::base_from_member //$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ I don't use std::forward because I've heard that some beta C++11 modes implement the core-language ideas needed (r-value references) but not the library changes (i.e. std::move and std::forward), and I didn't want to find (and conditionally?) #include another header. What I got will work just fine, right? Do the constructors need any marking besides "explicit" and "constexpr"? (I believe the "constexpr" will be safely ignored if the forwarded constructor isn't "constexpr" itself without a compile-time error. It was designed that way, right?) I'll just update the documentation and commit the change, then. Daryle W.

1 0

docs on new build system?
by Neal Becker 07 Feb '12

07 Feb '12

I am testing 1_49_0_beta1. I see my usual build failed, saying 'warning: mismatched versions of Boost.Build engine and core'. Taking a wild guess, tried cd tools/build/v2 sh ./bootstrap.sh sudo ./b2 install --prefix=/usr/local I see I now have a new bjam, and something called 'b2'. Should I be reading some new docs on how to use this stuff? Are there some docs? My old build procedure: bjam -sHAVE_ICU=1 -sEXPAT_INCLUDE=/usr -sEXPAT_LIBPATH=/usr/lib64 -- layout=tagged threading=single,multi stage Seems to be proceeding normally (so far)

2 1

[hash] regular behaviour of hash function for double values
by Kai Schroeder 07 Feb '12

07 Feb '12

Hi, the following code: double fStart = 31337; double fEnd = 65536; double fStep = fStart - fEnd; fStep /= 512; for (int i = 0; i < 512; i++) { std::cout << std::hex << boost::hash<double>()(fStart + i * fStep) << std::endl; } leads to the output of surprisingly regular hash values (see end of mail). This seems to occur mainly if a power of two number of points is sampled equidistantly within an interval. Especially since some hash table implementations (e.g. intel's threading building blocks) only use the last few bits to determine the bucket, this can lead to very bad caching behaviour for the rather common case of regularly sampled points (equidistant samplings of power of 2 are e.g. common in computer graphics and numerical algorithms). Are you aware of this? Would you consider it a bug? Best regards, Kai Schroeder Output of code using Boost 1.48 (similar behaviour can be observed for other start and end values and other power of 2 step counts): ff9f20000000000f e5042f900000000f 52f13f200000000f 297ac8b00000000f 48721e400000000f 2f9b8dd00000000f 3df0b1600000000f d19cf2f00000000f 9201c800000000f 9409aa100000000f 7cb3fba00000000f d7a42b300000000f b15982c00000000f 5f7900500000000f e0ba85e00000000f 255ee5700000000f cec119000000000f 955bd6900000000f 6a58f4200000000f 843a37b00000000f 590797400000000f 7e8db4d00000000f 1721b6600000000f 37acf9f00000000f df5f65800000000f 88b1a5100000000f 494a0a00000000f bb1082300000000f 1ea62bc00000000f ...

11 43

unordered_map 32bit VS 64bit
by Avikam Bara-nes 07 Feb '12

07 Feb '12

Hi, I'm porting a project from Linux 32bit to Linux 64bit. While doing so I notice that I have a dramatic performance degradation with unordered_map. My platform is Ubuntu 10.4.3 64bit running on Intel Xeon X3220 but, I tested similar program on WindowsXP SP2 64bit which running on Intel i5 and I get the same degradation. My boost version is 1_46_1. I use the following program in order to test unordered_map - Hop I didn't make any copy mistakes :-). #include <stdio.h> #include <sys/time.h> #include <boost/unordered_map.hpp> int main(int argc, char *argv[]) { struct timeval tv_before, tv_after; boost::unordered_map<boost::int_32_t, boost::int32_t> boost_map; boost_map[1] = 2; boost_map[3] = 4; gettimeofday(&tv_before, NULL); for(int i = ; i < 100000; i++) boost_map.find(1); gettimeofday(&tv_after, NULL); printf("Boost time is %f \n", (double)(((tv_after.tv_sec - tv_before.tv_sec) * 1000000 + (double)(tv_after.tv_usec - tv_before.tv_usec)) / 100000)); return 0; } I use the following compile commands: 64bit - g++ -O3 perf_test -o perf_test_64bit 32bit - g++ -m32 -O3 perf_test -o perf_test_32bit When I run the 32bit program I get 0.5 sec When I run the 64bit program I get 1.54 sec Any ideas ???

6 16

[MPI]: All tests failing -- branch and trunk
by Steve M. Robbins 07 Feb '12

07 Feb '12

Hi, I have been running a daily test of the Boost release branch for a long time. It normally takes an hour or so. However, two days ago (rev 76868), the build time shot up to over 9 hours. The same thing happened for testing the Boost trunk branch. Others on the boost-test list have experienced the same and Jurgen Hunold pointed out that all the MPI tests are failing. According to http://www.boost.org/development/tests/trunk/developer/mpi.html this is true for about half the tester machines. Should probably be fixed before 1.49 is released! -Steve

1 0

[functional] adding overload
by Lorenzo Caminiti 06 Feb '12

06 Feb '12

Hello all, During Boost.Local review, it was proposed to move the overload template out of Local and in Boost.Functional. What would the best name for it? 1) boost::overload_function (my preference) 2) boost::overloaded_function 3) boost::function_overload 4) boost::functional::overload (Boost.Functional seems to use boost:: directly and not boost::functional-- to mimic C++11 <functional>). For example: void print_text(char const* text) { std::cout << text << std::endl; } void print_add(int x, int y = 10) { std::cout << (x + y) << std::endl; } boost::function<void (int, int)> f = print_add; boost::overload_function< void (char const*) , void (int, int) , void (int) > print(print_text, f, print_add); print("abc"); // abc print(1, 2); // 3 print(1); // 11 Docs: https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/html/boost/loc… Thanks. --Lorenzo

8 18

[filesystem] windows/posix inconsistencies.
by Thorsten Ottosen 06 Feb '12

06 Feb '12

Hi Beman, I noticed the following in v3 whie hunting down a bug in my unit test: # ifdef BOOST_WINDOWS_API const std::string string() const { return string(codecvt()); } const std::string string(const codecvt_type& cvt) const; // string_type is std::wstring, so there is no conversion const std::wstring& wstring() const { return m_pathname; } const std::wstring& wstring(const codecvt_type&) const { return m_pathname; } # else // BOOST_POSIX_API // string_type is std::string, so there is no conversion const std::string& string() const { return m_pathname; } const std::string& string(const codecvt_type&) const; const std::wstring wstring() const { return wstring(codecvt()); } const std::wstring wstring(const codecvt_type& cvt) const # endif I can understand, that it is more efficient to return a reference when a referenec can be formed. However, consider const std::string& ext = iter->path().extension().string(); This is fine on windows, as a temporary is returned, and its lifetime is extended; on linux, extension() returns a temp path object, from where we get a reference. I'm not a 100% sure, but I think the C++ standard does not guarantee that this path object be kept alive. The net efffect is a crash on linux. I'm not sure its a great idea to have different reference-ness on the return types here. It could lead to other subtle differences. kind regards -Thorsten

9 14

[mpl] Nested Scopes w/Placeholders
by Kitten, Nicholas 06 Feb '12

06 Feb '12

I've recently been doing a lot mpl::folding (in boost 1.47), and I was disappointed when I realized that a nested fold wouldn't work with a lambda expression passed to the inner call, as in this example which extracts elements of sequences: using namespace mpl; using namespace mpl::placeholders; typedef vector< vector<char>, vector<int> > vec_of_vecs; typedef vector< char, int > expected_result; typedef fold< vec_of_vecs, vector<>, fold< _2, _1, *push_back< _1, _2 >* // wrong - refers to outer arguments > >::type result; BOOST_MPL_ASSERT(( equal<result, expected_result> )); After looking around for a solution I came across an old thread<http://lists.boost.org/boost-users/2004/12/9269.php> on the same subject, where it was suggested using mpl::protect might work. Indeed, the following modification does what I want, without any changes to the library: typedef fold< vec_of_vecs, vector<>, fold< _2, _1, *protect< lambda< push_back< _1, _2 > >::type >* // correct > >::type result; Of course, this is a little on the verbose side. In the old thread, Daniel Wallin suggested suggested changing the definition of lambda to yield syntax more in line with the runtime version of boost::bind, but that would apparently break other code. What about instead adding a specialization to protect for placeholder expressions? Indeed, the source in protect.hpp seems to indicate such a thing might've been in the works at one point, but I didn't see any more references to it: template< typename BOOST_MPL_AUX_NA_PARAM(T) * , int not_le_ = 0 // not lambda expression?* > struct protect : T { ... typedef protect type; }; What about changing it to something like this? template< typename BOOST_MPL_AUX_NA_PARAM(T) * , typename not_le_ = typename is_lambda_expression< T >::type* > struct protect : T { ... typedef protect type; }; *template< typename T >* *struct protect< T, mpl::true_ > : lambda<T>* *{* *...* *typedef protect type;* *};* Doing so would remove the inner lambda<...>::type expression, yielding the expected syntax. Could that be done without messing up everything else? Thanks, *Nick Kitten* Software Engineer Center for Video Understanding Excellence ObjectVideo, Inc.

3 6

[gsoc] Summer of Code 2012
by Andrew Sutton 05 Feb '12

05 Feb '12

Has it been a year already? Google has just announced the 2012 Summer of Code program, and we'd like to participate again. I think last year was particularly successful. We reviewed and accepted two new libraries and moved several more into a state where they can be reviewed. This year should be interesting. We have a new C++ programming language, several libraries in the standard, and we want more. Many, many more. If you didn't get a chance to watch Herb Sutter's keynote talk at GoingNative 2012, you should. It will be available on-demand from this site some time in the next few days. http://channel9.msdn.com/Events/GoingNative/GoingNative-2012 [Spoiler alert] Herb wants libraries -- and not just tools for programmers. C++ wants UI libraries, graphics, database connectivity, cryptography, XML, network protocols, SMS support, back office support, etc. I would love to see some of these libraries developed through Boost. In C++11. Bjarne Stroustrup said he hadn't seen this much energy around C++ in a decade. People are excited to be writing C++11 -- and they're younger people for the first time in a long time. We should be capitalizing on this. If you have library ideas, please email me here: andrew.n.sutton -at- gmail.com. I will collect these and put them on the idea page. Some comments for mentors: I'm not concerned with summer-long time constraints this year. I'd really like to establish long-term relationships with our students. I'm not strictly concerned with backwards compatibility support. I think we should be encouraging students (and people in general) to write in C++. Hiding new language features behind compatibility macros isn't exciting. It might be fine for when time comes for releases, but let's not require students to build release-ready software. This year, I'd like to see proposals for *new* libraries to be written in C++11. Andrew

1 0

[bgl] Maximum Adjacency Search
by Fernando Vilas 04 Feb '12

04 Feb '12

Hi, Well, it took me longer than "a few days" to make time to clean up the code, but here is a patch against today's SVN-trunk. It will probably need more cleanup before it is ready, but it should be at a point where public review will help. -- Thanks, Fernando Vilas fvilas(a)iname.com

2 1

1.49.0 Beta 1 Release Candidate
by Steve M. Robbins 04 Feb '12

04 Feb '12

Hi, I'm starting a build (using the Debian package configuration) and noticed several known bugs still present: These two bugs are patched on the trunk but not release. Can these be moved over, please? https://svn.boost.org/trac/boost/ticket/4657 https://svn.boost.org/trac/boost/ticket/6338 This issue has a simple patch that works around the problem for gcc versions prior to 4.6.3: https://svn.boost.org/trac/boost/ticket/5538 This issue has a patch that works (is used in Debian), though a jam expert could likely find a better fix: https://svn.boost.org/trac/boost/ticket/6286 Regards, -Steve (Boost maintainer for Debian)

5 9

[random] Determining interest in Pseudo-Random Functions and Counter Based Random Number Generators
by John Salmon 03 Feb '12

03 Feb '12

I am co-author of "Parallel Random Numbers, as Easy as 1, 2, 3". which recently won the best paper award at the IEEE/ACM SC'11 conference. I'm also co-author of the related Random123 library: http://deshawresearch.com/resources_random123.html My colleagues and I would like to contribute a similar library to Boost as well. This isn't just a "port" of the Random123 library. Boost's focus on C++ allows for both simplification and clarification of the ideas in the paper and the original library. I've done a preliminary draft of some code that fits nicely into the existing Boost Random library. It's incomplete, but I think there's enough for folks to look at and gauge further interest. A zip file with a boost-like layout is here: http://thesalmons.org/john/random123/prf_boost/prf_boost.zip The README from the zip file is appended. I look forward to your comments and suggestions. John Salmon -------------- README ------------------- This extension of the Boost Random library adds "Pseudo-Random Functions" (PRFs) as an alternative to conventional "Uniform Random Number Generators" and "Random Number Engines". It is an incomplete draft, intended to start a conversation. It is not ready-to-use library. The case for using PRFs in Monte Carlo and statistical simulation is given in the paper, "Parallel Random Numbers -- As Easy as 1, 2, 3", by Salmon, Moraes, Dror & Shaw, in the Proceedings of SC'11: http://dl.acm.org/citation.cfm?doid=2063405 also available at http://www.thesalmons.org/john/random123/papers/random123sc11.pdf PRFs have been known for many years, but either their advantages were unrecognized or they were thought to have poor performance with respect to conventional URNGs. The paper shows that PRFs exist with excellent statistical properties, and highly desirable space and time characteristics. Also, note that the terminology in the paper, is slightly different from that used here. In the paper they're called "Counter Based Random Number Generators". PRFs are well-known in cryptography, but the PRFs here (except for AES) are *not* cryptographically strong. Nevertheless, they have satisfied extensive tests of statistical quality and should satisfy the needs of Monte Carlo simulation and other fields that routinely use random numbers. PRFs are pure functions (functors in C++) with the property that they return "random" values, even when presented with highly regular inputs (see the paper for a discussion of how randomness is empirically established). The user of a PRF assembles the input, calls the function and obtains a "random" result which can then be used in the same way as a value obtained from a conventional URNG or Engine. In contrast, a conventional Random Number Engine has a much more limited API: the caller is restricted to seeding the engine, once and for all, and then repeatedly asking for the "next" random value. PRFs eliminate the sequential dependence inherent in conventional RNGs. With a PRF, one can compute the "n-th" value in O(1) time, without stepping through earlier values. In fact, with a PRF, the notion of an "n-th" value loses its significance. One simply obtains a random value. Eliminating sequential dependence can be especially useful for parallel, multi-threaded applications. For example, one can assemble a PRF's input from application-level data, e.g., object id, voxel number, user-supplied seed value, timestep, iteration number, etc. This kind of application data is unchanged when the application is parallelized, and is generally invariant as more or fewer threads become available. The resulting random value is thus invariant to the parallelization as well. This can be enormously helpful when correctness dictates that separate "parallel" threads should use the same "random" value, or when trying to reproduce results on different platforms with different levels of parallelism. Four PRFs are implemented: threfry, philox, ars and aes, each implemented in its own header file, e.g., boost/random/ars.hpp. The file boost/random/counter_based_urng.hpp implements the counter_based_urng adapter class, which creates a Uniform Random Number Generator from a PRF, allowing programmers to use the PRF APIs together with Boost or C++1x Random Number Distributions. The file boost/random/counter_based_engine.hpp implements the counter_based_engine adapter class, which creates a Uniform Random Number Engine from a PRF, allowing PRFs to be used with software that relies on the Uniform Random Engine concept. For better or worse, wrapping a PRF in a counter_based_engine adapter completely obscures the PRF's API and reintroduces sequential dependence. The zip file also contains a copy of the candidate Boost Endian library copied from boost sandbox. Endian-swapping is required by the AES engine on bigendian machines, and the library meets our needs. Concepts -------- All PRFs have a domain_type and a range_type and with d a "permissible" object of the domain type, the expression: prf(d) is of the range_type. In many cases, every possible value of domain_type will be "permissible", but we leave open the possibility that the prf may place restrictions on the values of domain_type that produce "random" results. The values returned by the prf should be "random", a concept that is difficult to make both precise and achievable. Roughly, for most sequences, including highly "regular" sequences, of distinct, permissible domain_type values, d1, d2, d3, ..., the sequence: prf(d1), prf(d2), prf(d3), ... is statistically indistinguishable from a sequence of independent, uniformly distributed random variables sampling the range_type. In most cases, the output of the prf will uniformly sample all possible values of the range_type, but we leave open the possibility that it may only sample a subset and that the output is only uniform over the subset. Keyable PRFs have a key_type, a corresponding constructor, and setkey() and getkey() member functions. Keyable PRFs constructed with different keys must also be statistically independent. I.e., even for highly regular sequences of distinct (key, domain) pairs: (k1, d1), (k2,d2), ... the sequence: Prf(k1)(d1), Prf(k2)(d2), ... is statistically indistinguishable from a sequence of independent random uniformly distributed samples of the range_type Keyable PRFs may also be Seedable in which case they also have seed() member functions and corresponding constructors similar to those of Random Number Engines. Seeding a PRF is equivalent to setting its key to some value corresponding to the output of sseq.generate(). A PRF has a Countable Domain if its domain_type has member functions begin(), end(), and back() with semantics identical to that of boost::array<Uint, N> for some unsigned integral type Uint and some N. It must also have member functions domain_array_min() and domain_array_max() that specify the permissible domain values. Any array, da, whose members, da[i], satisfy: prf.domain_array_min() <= da[i] <= prf.domain_array_max[] must be "permissible". A PRF has an Integer Array Range if its range_type has member functions begin(), end(), and size() with semantics identical to boost::array<RangeInt, N>, for some integral type, RangeInt and constant N. It must also have static constexpr member functions, range_array_min() and range_array_max() that specify the subset of range values sampled by the PRF. For any sequence of permissible domain value, d1, d2, ..., the integers: prf(d1)[i], prf(d2)[i] must be statistically indistinguishable from independent uniformly distributed RangeInts from range_array_min() up to and including range_array_max(). If a PRF has a Countable Domain and an Integer Array Range, then: counter_based_urng<Prf> satisfies the requirements of a Uniform Random Number Generator. If, in addition, the PRF is Seedable, Streamable and Equality Comparable, then: counter_based_engine<Prf> satisfies the requirements of a Random Number Engine. A PRF is a Pseudo-Random Bijection if it is one-to-one and onto. I.e., if it has an inverse. It is not necessary for the inverse to have a practical implementation. It is sufficient that the inverse exist mathematically. A PRF is a Pseudo-Random Permutation if it is a Bijection and its domain_type is the same as its range_type. The four implemented PRFs are CopyAssignable, EqualityComparable, Streamable, Keyable, Seedable, Pseudo-Random Permutations with Integer Array ranges and Countable domains. Hence, they satisfy the requirements of counter_based_engine and counter_based_urng. Differences from Random123 -------------------------- This code is inspired by the Random123 library, but there are significant differences. New terminology: threefry<2, uint64_t> is a "Pseudo-Random Function" (PRF). PRFs take a key_type as a constructor argument, and are bijections on their ctr_type. Thus, instead of: typedef r123::Threefry2x64 r123_t; r123_t::ctr_type c; r123_t::key_type k r123_t::ctr_type r = r123_t(c, k) You now say: typedef boost::random::threefry<2, uint64_t> prf_t; prf_t::key_type k; prf_t myprf(k); prf_t::domain_type c; prf_t::range_type r = myprf(c); // Or alternatively, (more reminiscent of Random123) prf_t::range_type r2 = prf_t(k)(c); AESNI ----- Use of AESNI is tricky because we want both compile-time and runtime control over whether AESNI is used. The compile-time control is determined by BOOST_HAS_AESNI, which we assume will be set by some config file based on compiler-specific symbols (__AES__, __x86_64__, __ICC, __GNUC__) and possible user-overrides. But even if AESNI support is compiled in, we have to detect it and fall back to a software implementation at runtime if it's not available. The check requires either an asm with GCC-compatible compilers or an intrinsic with MSVC-compatible compilers. Endianness is another complication. The AESNI implementation only works on x86_64 platforms, so it is not endian-sensitive. In fact, it *defines* how multi-byte quantities are to be interpreted. In contrast, the software implementation has to be endian-aware. The current implementation has not been tested with other endians, and hence is almost certainly broken. And finally, the AESNI intrinsics are *very* fast. We don't want to weigh them down with lots of runtime checks. With AESNI enabled, the runtime overhead should cost no more than a single conditional at the top of operator()(c). The choice between hardware and software AES is controlled by a member data field, useAESNI, of the prf class. If hw AES is compiled in, useAESNI is initialized by a runtime check of the CPU capabilities. It can be changed with a mutator method. If hw AES is not compiled in, useAESNI is initialized false and it is an error to try to set it to true. In detail/aes_impl.hpp, we implement two classes: detail::hw128 detail::sw128 with a common interface that minimally meets the needs of AES and ARS. The interface includes +=, ^= constructors from array<uintW, N>, aesenc, and aeskeygenassist primitives, etc. The crucial functions in AES and ARS are then written with a template parameter that is assumed to provide the interface. An idiom like: #if BOOST_HAS_AESNI if( useAESNI ) method<detail::hw128>(args); else #endif method<detail::sw128>(args); gives the desired compile-time and runtime control.

7 10

Use macro varargs within BOOST_NOEXCEPT_IF
by Daryle Walker 03 Feb '12

03 Feb '12

I was going to ask about adding a BOOST_NOEXCEPT, but I just checked that the trunk already has it: //---#ifdef BOOST_NO_NOEXCEPT# define BOOST_NOEXCEPT# define BOOST_NOEXCEPT_IF(Predicate)# define BOOST_NOEXCEPT_EXPR(Expression) false#else# define BOOST_NOEXCEPT noexcept# define BOOST_NOEXCEPT_IF(Predicate) noexcept((Predicate))# define BOOST_NOEXCEPT_EXPR(Expression) noexcept((Expression))#endif//--- If the compiler supports varargs in macros, should we have: //===# define BOOST_NOEXCEPT_IF(...) noexcept(__VA_ARGS__)# define BOOST_NOEXCEPT_EXPR(...) noexcept(__VA_ARGS__)//=== (I think that's the right syntax.) instead so comma expressions can be used within a noexcept without the extra parentheses? But I doubt that it makes a difference here, since anything within the noexcept must be interpretable as a single expression. (I think it does for decltype, though. Extra parentheses turn a value type into a reference type(?).) Daryle W.

1 0