November 2012 - Boost - lists.preview.boost.org

[mpl] Strange error using boost::mpl::eval_if
by Edward Diener 12 Nov '12

12 Nov '12

No doubt I have had some sort of C++ brain blockage but the following code using boost::mpl::eval_if gives an error and I cannot see how this would be. This is a simplified case of a more serious problem. --------------------------------------------------------------- #include <boost/mpl/bool.hpp> #include <boost/mpl/eval_if.hpp> template<class T,class C> struct AAA { static const bool value=true; typedef boost::mpl::bool_<value> type; }; template<class T> struct CCC { static const bool value=true; typedef boost::mpl::bool_<value> type; }; template<class T> struct BBB : CCC<T> { }; template<class T1,class T2,class T3,class T4> struct DDD : boost::mpl::eval_if < boost::mpl::false_, BBB<T1>, AAA<int,int> > { }; template < class T1, class T2 = int, class T3 = int, class T4 = int > struct EEE : DDD<T1,T2,T3,T4> { }; int main() { bool result = EEE<int,int>::value; return(result ? 1 : 0); } ----------------------------------------------------------------------- Compiling with gcc 4.6.0 in MingW under Windows I get: test_has_mem_fun.cpp: In function 'int main()': test_has_mem_fun.cpp:50:17: error: 'value' is not a member of 'EEE<int, int>' "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -pedantic -g -Wno-variadic-macros -std=c++0x -DBOOST_ALL_NO_LIB=1 -I"..\..\.." -c -o "..\..\..\bin.v2\libs\tti\test\test_has_mem_fun.test\gcc-mingw-4.6.0\debug\test_has_mem_fun.o" "test_has_mem_fun.cpp" ----------------------------------------------------------------------- I must be overlooking something obvious but I cannot see it. Any help showing me what is wrong would be appreciated.

3 3

[iterator] [property_map] Enhancement proposals
by Louis Dionne 12 Nov '12

12 Nov '12

Dear boost, First of all, let me quickly introduce myself as this is my first post here: I am a 20 years old programming enthusiast with interest for metaprogramming, functional programming and library design. I also have a strong will to contribute to open source projects since I love the philosophy behind it and it is a great way to develop new skills and to work with talented people. The object of this message is to collect feedback on several enhancement proposals I have prepared for two existing libraries: [boost.iterator] [boost.iterator.accessor_iterator] The accessor_iterator is an iterator adaptor that returns a reference to a member of its pointee when dereferenced. I see it as another step in the direction of easier iterator composition, which has helped me writting less code in the past. [boost.iterator.chained_output_iterator] The chained_output_iterator is an iterator adaptor allowing to apply a functional transformation to a value before outputing it into another output iterator. It is much like a function_output_iterator that would forward its result to another output iterator. It allows for cool stuff like creating a pipeline of operations without having to create temporary storage. [boost.property_map] [boost.property_map.accessor_property_map] The accessor_property_map is a property map returning a reference to a member of the key it is given. It is much like the accessor_iterator for property maps. [boost.property_map.chained_property_map] The chained_property_map is a tool for property map composition. It takes two property maps and uses a value in the first one as a key in the second one to perform its put, get, and operator[] operations. [boost.property_map.property_traits] I feel like the boost/property_map/property_map.hpp header is a little bit bloated and not quite as modular as it could be. For now, I propose that we move the code dealing with property_traits into the boost/property_map/property_traits.hpp header and that we provide metafunctions to check for adherence to property map types. By providing an include in the boost/property_map/property_map.hpp header, backward compatibility is maintained and we simply increase modularity. All the code is available on github: https://github.com/ldionne/boost-submissions To see how each class can be used, you may look at the unit tests for the corresponding class. If anything is accepted, I will be pleased to write documentation and examples for the concerned feature and to integrate it into the existing documentation. Looking forward to your feedback, Louis Dionne

2 11

Re: [boost] hierarchy_tree container
by Morgan Freeberg 10 Nov '12

10 Nov '12

Okay thanks Jose, that helps. My search through the libraries did not pick up on these. By the time I did that I already had the application behavior I wanted, so on my end this has been a refactoring process; I can take a look at these and see if I did that the right way, or if perhaps these could've provided the functionality I need. >From skimming over the documentation, my initial impression is that they're both very cool implementations which might help me in future work, but some of what I did here is falling somewhat outside of that is provided by these. If you're still interested, I can provide an approximation of the challenges met here: 1. From a rather large not-quite-completely-standard XML file, I needed to parse from top to bottom, understanding the structure being created as containers are declared, sub-containers & leafs are added in, and each construct is eventually terminated. The process that does this would need to store not only the instantiation of the tree container, but a vector/array of references to the ancestors of some "current node" being built. That is so that, as it encounters terminating tags, the internal logic can say...this is ended, now this is ended, now this is ended...essentially so that it can "outdent" again. I can see with treetree and st_tree this is do-able if I write some level of intermediate code that builds such an array and maintains it, as I know lots of "standard" XML readers already do. (This I know from my attempts to find one I could actually use in my project.) The issue that would arise here is, I'd still need to write and test that code, and the result would in turn be redundant with what I did here...so it seems these two libraries recognize the same structure mine does, but the scope of purpose is a little bit different. My container internalizes all this parentage information so that when you're reading data sequentially in this way, the client code only needs to track the depth by way of counting the opening and closing tags, then make a call to the container that essentially says "add this, at this depth." Implication being: As a child of whatever. The container internally tracks the concept of "we are currently defining children of so-and-so." 2. In a configuration file of my own making, I needed to pre-declare what the tree should look like. This is not XML, it's a list of statements that say "that class we already defined on line 3, here on line 9 we are defining a class that is a child of that." The method described above that is good for reading these pseudo-XML files, it would not work for that. What is needed here is either a sequential or random-access search by name...In this case you need to write code on top of my container, as well as on top of treetree and s_tree. So in this requirement, all three provide the same functionality. 3. I chose an enumerator/callback interface that works by way of numeric return codes, because I needed it for a variety of commands to be executed on the trees -- some do searches, some validate, some filter (search without terminate after find), et al. The point to dynamically constructing a tree was to be able to do integrity checks on it, and then execute some different application behavior on each node within what I could be sure was the same tree as what I had seen before. So for my particular implementation this is a big benefit, because I can use a chain-of-responsibility design pattern to associate each command with a name, an invoker, some help text, and then a callback routine that defines the behavior. Again, it seems those other two containers can meet the requirement, after intermediate code has been written to adapt them to this application-specific purpose, which in turn has been internalized in my container. Much shorter version: Enum/callback pair for listing the contents of the tree, with numeric return codes; two distinctly separate methods for getting the data in at run-time, one method for reading a streaming mechanism such as XML, the other method for specifically identifying the parent of a new node -- "child of that guy, you made before, over there." The test program I provided mixes those two methods up, so that it is demonstrated they can both work on the same container once it is instantiated. I'll run some tests with these and, if you're interested, provide you with a more fully-informed report on where there may & may not be full redundancy.

1 0

filesystem::path passed to GTest's assertion leads to stack overflow because of infinite recursion
by Andrey Upadyshev 10 Nov '12

10 Nov '12

Hi all, I found an interesting bug with 'filesystem::path' used with GTest: https://svn.boost.org/trac/boost/ticket/7564 I just want to discuss the design of 'path' class which iterator contains the 'path' itself. Don't you think it's nice to fix thing? Best regards, Andrey Upadyshev P.S. Sorry if this is wrong mailing list. Just let me know and I'll repost the message to boost-users <boost-users(a)lists.boost.org> mailing list.

2 5

[type_traits] templated type traits?
by Lorenzo Caminiti 10 Nov '12

10 Nov '12

Hi, Is there a way to inspect if a type is a template instantiaton (is_templated) and the type of the instantiated template parameters (arg1_type)? is_templated< std::vector<int> >::value // true is_templated< int >::value // false template_traits< std::vector<int> >::arg1_type // int Thanks, --Lorenzo

5 5

[wave] add_macro_definition("TEST=") behaves different than #define TEST
by Klaus Gütter 10 Nov '12

10 Nov '12

Test1 posted below produces: INT SPACE EOF SPACE IDENTIFIER SEMICOLON NEWLINE EOF While Test2 produces: INT SPACE IDENTIFIER SEMICOLON NEWLINE EOF The EOF in the third line of Test1 output is produced by the TEST macro expansion. If this expected behaviour? I found this surprising. (MSVC10, Boost 1.51) Regards, Klaus ---- Code: typedef cpplexer::lex_token<> token_type; typedef context< string::iterator, cpplexer::lex_iterator<token_type> > lexer_context_type; void Test1() { string instring("int TEST x;\n"); lexer_context_type ctx(instring.begin(), instring.end(), ""); ctx.set_language(language_support(support_c99)); ctx.add_macro_definition("TEST="); for (lexer_context_type::iterator_type it = ctx.begin(); it != ctx.end(); ++it) cout << get_token_name(token_id(*it)) << endl; } void Test2() { string instring("#define TEST\nint TEST x;\n"); lexer_context_type ctx(instring.begin(), instring.end(), ""); ctx.set_language(language_support(support_c99)); for (lexer_context_type::iterator_type it = ctx.begin(); it != ctx.end(); ++it) cout << get_token_name(token_id(*it)) << endl; }

2 2

[type_traits] is_complete<T> possible realization
by Antony Polukhin 09 Nov '12

09 Nov '12

Hi, Yesterday I had a need to detect, is class forward declared or is it complete. Here are some thoughts: template <class T, int Misc> struct is_complete { typedef char false_type; typedef int true_type; template <class T1> static typename boost::enable_if_c<sizeof(T1), true_type>::type test(int); template <class T1> static false_type test(...); enum ENU { value = ( sizeof(test<T>(0)) == sizeof(true_type) )}; }; 'Misc' parameter is required to work around compilers one time instantiation: struct incomplete; template <int N> struct incomplete_template; struct complete{}; struct complete_abstract{ virtual void foo() =0; }; void test(); void foo1() { cout << is_complete<incomplete, __LINE__>::value << is_complete<incomplete_template<0> , __LINE__>::value << is_complete<incomplete_template<1> , __LINE__>::value << is_complete<complete, __LINE__>::value << is_complete<complete_abstract, __LINE__>::value << endl; } struct incomplete{}; template <> struct incomplete_template<0>{}; void foo2() { cout << is_complete<incomplete, __LINE__>::value // Without second template parameter it would be still returning 0 << is_complete<incomplete_template<0> , __LINE__>::value << is_complete<incomplete_template<1> , __LINE__>::value << is_complete<complete, __LINE__>::value << is_complete<complete_abstract, __LINE__>::value << endl; } int main() { foo1(); // Outputs 00011 foo2(); // Outputs 11011 return 0; } I was thinking of changing 'Misc' parameter definition to something like this: template <class T, class... Misc> struct is_complete ; Than it can be used in template functions/classes just like this: template <class T, class... SomeClasses> void test_function() { is_complete<T, SomeClasses..., boost::mpl::int_<__LINE__> >::value; } So, Is there interest in such metafunction? Can somebody give advices how to improve it? (I`m not sure that implementation is portable, I`ve tested it only on GCC-4.6 and CLANG-3.0, MSVC compiler will be available only tomorrow) -- Best regards, Antony Polukhin

6 10

Re: [boost] hierarchy_tree container
by Morgan Freeberg 09 Nov '12

09 Nov '12

> Subject: Re: [boost] hierarchy_tree container > On Tue, Nov 6, 2012 at 5:28 PM, Morgan Freeberg <mkfreeberg(a)hotmail.com> wrote: > > I have the logic for this nicely separated into a header that seems to meet all the Boost coding guidelines, although I know a peer review process would likely yield helpful improvements that aren't immediately obvious to me. The doc file I prepared goes into much greater detail how this all works...would there be interest in looking into such a thing? > > > yes, can you share the doc url ? > http://www.peekinthewell.net/boostsub/hierarchy_tree/

2 2

[datetime] IANA Time Zone Database
by Maxim Yegorushkin 09 Nov '12

09 Nov '12

Hi Boost, I have files with timestamps in various timezones. I would like to be able to convert these timestamps, no matter what timezone they are in (I know the names of the timezones) to UTC timestamps. I looked through datatime library documentation and found date_time_zonespec.csv database which doesn't seem to support the notion of different rules for the same timezone depending on the date. For example, Russia used to have summer time but not any more. Another method seems to be passing a timezone specification string manually, which requires the user to figure what it should be for a particular date. In other words, given a timestamp and its timezone, I would like to be able to convert that timestamp into a UTC timestamp using conversion rules in force at that particular date in the past. Ideally, this would use IANA Time Zone Database or something similar. Is there a facility in boost to do just that? -- Maxim

6 16

C++ announcements coming tomorrow
by Beman Dawes 09 Nov '12

09 Nov '12

Herb Sutter, the Convenor of the ISO C++ Standards Committee, will be making some announcements tomorrow likely to be of interest to C++ developers in general and Boosters in particular. The venue is a talk titled "The Future of C++" at the Microsoft Build Conference. While some of Herb's announcements will be specific to Microsoft, the key C++ initiatives involve Boost and the whole C++ community. Some of the ideas evolved from feedback Herb got at C++Now/BoostCon 2012 last May. I'll post a summary of the announcements tomorrow, but you can also watch the live stream at http://channel9.msdn.com at 12:45 PM Pacific time. For other time zones, see http://www.timeanddate.com/worldclock/fixedtime.html?iso=20121102T1945 --Beman PS: We don't usually post teasers like this on the Boost lists, but Herb asked that a notice be posted, and given the endless work he has put in on this over the summer, I couldn't say no.

22 63

★ Boost, Bruce left a message for you
by Badoo 08 Nov '12

08 Nov '12

Bruce left a message for you Only you can see the sender and content of your message, and you can delete it anytime. You can instantly reply using our message exchange system: http://eu1.badoo.com/tortoise74/in/3i4doZuulPE/?lang_id=3&m=21&mid=509c4330… If the link in this message does not work, try copying and pasting it into your browser. This email is part of our delivery procedure for the message sent by Bruce. If you have received this email by mistake, please ignore it. The message will be deleted soon. Have fun! The Badoo Team You have received this email from Badoo Trading Limited (postal address below). http://eu1.badoo.com/impersonation.phtml?lang_id=3&email=boost%40lists.boos… Badoo Trading Limited is a limited company registered in England and Wales under CRN 7540255 with its registered office at Media Village, 131 - 151 Great Titchfield Street, London, W1W 5BB.

1 0

[test]portability of data test cases and build issues
by Gennadiy Rozenal 08 Nov '12

08 Nov '12

Hi, I've been working on portability fixes for new features in boost.test. They now works fine with gcc 4.6 and 4.7 msvc-10.0 and msvc-11.0. My attempt with clang on linux lead to compiler crashing, but I see it passing in regression on darwin, so I am not sure on the status. I do still have some issues about portability and boost.build: 1. Boost.Build does not handle correctly target foo with sources residing in subdirectory foo under location of Jamfile. I had to rename directory boost/libs/test/test/test_datasets into test_datasets_src, because of that. 2. How do I tell that I want to pass compilation to gcc in toolset gcc-4.7 only? I've tried <toolset>gcc-4.7:<cxxflags>-std=c++11 and <toolset>gcc-4.7.2:<cxxflags>-std=c++11 and either one does not work. <toolset>gcc:<cxxflags>-std=c++11 does work, but I want to pass different options for different versions of gcc. 3. Question: Should I tell *unconditionally* in Boost.Test Jamfile in boost/libs/test/build that I want to pass -std=c++11/-std=c++0x depending on a version? If not, how do I test test_dataset target with this option? Also How do I disable for configurations which does not support it? 4. Issues with regression testers setup? If you look here: http://www.boost.org/development/tests/trunk/developer/test.html You will see that: a) clang linux columns are empty. Why is that? b) msvc-11.0 setup is broken because of: 'cl' is not recognized as an internal or external command, operable program or batch file. c) sun setup is broken because of: /bin/sh: line 2: CC: not found Can we fix these? 5. Portability for other compilers. I am not quite sure which is lowest version of gcc this feature works. Anyone who is interested in making it work with older/different compilers feel free to submit patches. Regards, Gennadiy

5 7

Release branch closed
by Marshall Clow 08 Nov '12

08 Nov '12

Boosters, The release branch is now closed for all commits, except by explicit permission of release managers. -- The Release Managers, Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus Marshall Clow

4 5

[thread] warning in trunk
by Gennadiy Rozental 08 Nov '12

08 Nov '12

Hi, Can anyone clean this one: boost/thread/future.hpp(378) : warning C4913: user defined binary operator ',' exists but no overload could convert all operands, default built-in binary operator ',' used Gennadiy

5 5

[OT] std::complex warts
by Neal Becker 08 Nov '12

08 Nov '12

std::complex doesn't seem to allow mixing of types in arithmetic operations. This is quite inconvenient for code that is generic on the base float type. For example: template<typename flt_t> flt_t some_function (std::complex<flt_t> z) { return 2. * z / 4.2 + ... } This will fail to compile when flt_t == float (but succeeds for double). casting every constant in a large computation is really not an acceptable option. Thoughts?

3 2

[type_traits] is_convertible<int, int&> inconsistent result
by TONGARI 08 Nov '12

08 Nov '12

Hi, I'd expect boost::is_convertible<int, int&>::value to be false, so I was surprised that it gives me "true" under g++ 4.7.1. Switch to std::is_convertible<int, int&> or using clang instead gives me the expected "false". After some search, I found: https://svn.boost.org/trac/boost/ticket/7251 Any plan to fix it?

2 1

[variant] static_visitor has no virtual destructor.
by Pierre Talbot 08 Nov '12

08 Nov '12

Hello, I have a compilation error with Boost (1.52) and g++ (4.7) with the flag -Weffc++: error: base class ‘class boost::static_visitor<std::basic_string<char> >’ has a non-virtual destructor [-Werror=effc++] And the static_visitor class is defined with a protected non-virtual destructor: template <typename R = ::boost::detail::static_visitor_default_return> class static_visitor : public detail::is_static_visitor_tag { public: // typedefs typedef R result_type; protected: // for use as base class only static_visitor() { } ~static_visitor() { } }; Is it normal ? And if it is, how to avoid this error ? Thank you for your help, Pierre Talbot.

3 3

Adding an option to set the name of a boost::thread
by david.hagood＠gmail.com 07 Nov '12

07 Nov '12

Has any thought been given to allowing a name to be set on a boost::thread, such that (if the underlying implementation supports it) that name would show up in things like top and ps? In Linux, you can name a thread via the prctl() call and it will show up in top - dandy for debugging which of the bazillion threads in my app has decided to suck up all the CPU. I don't know if Windows supports such a call, and IMHO it would be acceptable if the call did nothing in such a case. Ideally, I'd want to see it as a property, something like: void boost::thread::set_name(std::string name) std::string boost::thread::get_name() const;

6 11

[algorithm] Knuth-Morris-Pratt Search docs overly terse
by Jeff Flinn 07 Nov '12

07 Nov '12

I'm not sure if this is intentional but: http://www.boost.org/doc/libs/1_52_0/libs/algorithm/doc/html/the_boost_algo… contains only: Overview The header file 'knuth_morris_pratt.hpp' contains an an implementation of the Knuth-Morris-Pratt algorithm for searching sequences of values. I've created Ticket #7656. Jeff

1 0

[functional] Interested in can_be_called<F, Sig> metafunction?
by TONGARI 07 Nov '12

07 Nov '12

Hi there, I've used this metafunction for some time, and it just fitted my need. Recently, I make up my mind to complete it, willing to put it in public. Synopsis -------------- can_be_called<F, Sig> F Any callable type to test, even member-function ptr. Sig The desired calling signature, function-type only. Example ------------- struct X; struct F { void operator()(); }; can_be_called<void(int), void(char)>::type // mpl::true_ can_be_called<int(), void()>::type // mpl::true_, return val can always be discarded can_be_called<int(), int&()>::type // mpl::false_, cannot return as reference can_be_called<void(int&), void(int)>::type // mpl::false_, cannot accept rvalue can_be_called<void(), void(*)()>::type // compile error, "void(*)()" not a function-type can_be_called<F, void()>::type // mpl::true_ can_be_called<F const, void()>::type // mpl::false_, F::operator() is non-const can_be_called<void(X::*)(), void()>::type // mpl::true_, only the signature part is concerned can_be_called<void(X::*)(), void(X*)>::type // mpl::false_, implicit 'this' arg not accounted Repository ---------------- https://github.com/jamboree/boost.functional test files provided, compile well on g++ 4.7.1 & clang 3.2 No docs are written (yet), if you're interested, please let me know and I'll prepare for review or something... Comments are welcome :)

6 19

[1.52] PDF Documentation build available
by John Maddock 07 Nov '12

07 Nov '12

The PDF build of Boost docs is now available for 1.52 from: https://sourceforge.net/projects/boost/files/boost-docs/1.52.0/ John.

1 0

[qvm] scalar_cast
by Nikolay Mladenov 07 Nov '12

07 Nov '12

Hi Emil, I am trying qvm in a small project that uses complex numbers and have expressions of the kind : cv3 = c1*rv3_1 + c2*rv3_2 (the v3's are vectors, the c's are complex and the r's are real). I wrote it as : cv3 = scalar_cast<complex>(rv3_1)*c1 + scalar_cast<complex>(rv3_2)*c2; but this seems to invoke 6 complex constructors (unnecessarily) I have not tested to see if the constructors will be optimized away, but it seems to me that if : v_traits<vector_scalar_cast_>::scalar_type == complex , bit v_traits<vector_scalar_cast_>::r/ir return real the expression will compile and no complex constructors will be invoked. It seems to me that there is a need for another kind of scalar_cast that just adapts the v_traits<>:scalar_type but leaves the r() and ir() unchanged Another question I have is if there is a reason why vector*scalar works but scalar*vector does not? Thanks in advance, Nikolay PS I can send patches if you'd like.

2 3

[release][1.52.0] Release Notes
by Daniel James 06 Nov '12

06 Nov '12

Hello everyone, We're coming up to the beta release, so it's time to put together the release notes (although please don't feel you need to wait for me to start). As always you can send them to me, or if you want update them yourself in subversion. The files are at: https://svn.boost.org/svn/boost/website/public_html/live/feed/history/ The actual site won't get updated until I run the update script. You can see the release notes so far at: http://www.boost.org/users/history/version_1_52_0.html As usual, they're not finished yet, and some of the links might not work as the 1.52 documentation won't be uploaded until after the beta is released. thanks, Daniel

9 22

[clang] Windows toolset support?
by Beman Dawes 06 Nov '12

06 Nov '12

Cygwin has been shipping clang for six months or so. Has anyone gotten the cygwin/clang distribution (or any other clang distribution) to build boost? What toolset did you use? What does your user-config.jam file look like? Do you run bjam/b2 from the Windows command line or the bash command line? Thanks, --Beman

7 16

make_shared_array
by Peter Dimov 06 Nov '12

06 Nov '12

Hello, Glen Fernandes has kindly contributed an implementation of make_shared_array and allocate_shared_array. These are like make_shared and allocate_shared, except that they take a size_t argument N and allocate an array of N elements. Glen has made the functions return a shared_ptr, mostly because they are non-intrusive and it's not possible to return a shared_array without changes to shared_ptr and shared_array. But we can make such changes when we put the functions in Boost. So the question is, should we? It makes almost no sense to have a function called make_shared_array that does not, in fact, make a shared_array. On the other hand, Glen posits that some people may prefer to use shared_ptr instead of shared_array in their code for various reasons, one of which is that shared_array's default constructor can throw. Opinions?

9 40

hierarchy_tree container
by Morgan Freeberg 06 Nov '12

06 Nov '12

Ready to assess the level of interest and look into the possibility of a preliminary submission on my container library. I needed something to organize objects of type T, into a simple tree with parent-child relationships, which could then be filtered and listed. Also needed the container to maintain a "current add" position if you will, much like an output file stream, so I could feed tree structure data into it, for example as when reading from XML. I have the logic for this nicely separated into a header that seems to meet all the Boost coding guidelines, although I know a peer review process would likely yield helpful improvements that aren't immediately obvious to me. The doc file I prepared goes into much greater detail how this all works...would there be interest in looking into such a thing?

2 1

[type_traits] possible regression on is_function trait
by Vicente J. Botet Escriba 06 Nov '12

06 Nov '12

Hi, I don't know if this is a regression on Boost.TypeTraits or if I'm using incorrectly the is_function trait. John, could you confirm there is a bug in is_function? Best, Vicente Test output: Sandia-darwin-4.4 - thread - async__async_p / darwin-4.4 Rev 81191 / Mon, 5 Nov 2012 06:30:00 +0000 *Report Time: *Mon, 5 Nov 2012 14:19:58 +0000 Compile [2012-11-05 07:50:44 UTC]: fail "/opt/local/bin/g++-mp-4.4" -ftemplate-depth-128 -O0 -fno-inline -Wall -pedantic -g -dynamic -gdwarf-2 -fexceptions -fPIC -Wextra -Wno-long-long -fpermissive -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_DYN_LINK=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_POSIX -DBOOST_THREAD_THROW_IF_PRECONDITION_NOT_SATISFIED -DBOOST_THREAD_USE_DLL=1 -I".." -c -o "/Volumes/scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/async__async_p.test/darwin-4.4/debug/threading-multi/sync/futures/async/async_pass.o" "../libs/thread/test/sync/futures/async/async_pass.cpp" In file included from ../boost/type_traits/is_convertible.hpp:28, from ../boost/thread/detail/move.hpp:13, from ../boost/thread/future.hpp:20, from ../libs/thread/test/sync/futures/async/async_pass.cpp:28: ../boost/type_traits/is_function.hpp: In instantiation of 'boost::detail::is_function_chooser<false>::result_<boost::rv<boost::rv<boost::packaged_task<int()> > >&>': ../boost/type_traits/is_function.hpp:60: instantiated from 'boost::detail::is_function_impl<boost::rv<boost::rv<boost::packaged_task<int()> > >&>' ../boost/type_traits/is_function.hpp:102: instantiated from 'boost::is_function<boost::rv<boost::rv<boost::packaged_task<int()> > >&>' ../boost/type_traits/is_convertible.hpp:354: instantiated from 'const bool boost::detail::is_convertible_impl<boost::rv<boost::packaged_task<int()> >&, boost::rv<boost::rv<boost::packaged_task<int()> > >&>::value' ../boost/type_traits/is_convertible.hpp:480: instantiated from 'boost::is_convertible<boost::rv<boost::packaged_task<int()> >&, boost::rv<boost::rv<boost::packaged_task<int()> > >&>' ../boost/thread/future.hpp:2717: instantiated from 'boost::future<T> boost::async(boost::launch, R (*)()) [with R = int]' ../libs/thread/test/sync/futures/async/async_pass.cpp:117: instantiated from here ../boost/type_traits/is_function.hpp:52: error: forming pointer to reference type 'boost::rv<boost::rv<boost::packaged_task<int()> > >&'

3 5

[test] BOOST_TEST - universal testing tool
by Gennadiy Rozental 06 Nov '12

06 Nov '12

Hi, Based on a discussion on mini-review thread I make some changes to the universal testing tool interface and now it look as follows (similar interfaces on WARN and REQUIRE levels): BOOST_CHECK_ASSERTION(A) - new expression template based testing tool BOOST_TEST(A,M) := BOOST_CHECK_ASSERTION(A) if M is not supplied or BOOST_CHECK_MESSAGE(A,M) if M is supplied. BOOST_TEST (and it's siblings BOOST_TEST_WARN and BOOST_TEST_REQUIRE) is intended to become a primary (only?) testing tools from now on. It replaces and deprecates right away following tools: BOOST_CHECK BOOST_CHECK_MESSAGE BOOST_CHECK_EQUAL, BOOST_CHECK_NE, BOOST_CHECK_LT, BOOST_CHECK_LE, BOOST_CHECK_GT, BOOST_CHECK_GE There are still some tools which are not directly replaceable. I have some ideas how we can get there, but your input is appreciated: 1. BOOST_CHECK_THROW, BOOST_CHECK_EXCEPTION, BOOST_CHECK_NO_THROW We can probably leave these as is. Alternatively we'll need to postpone expression evaluation with separate BOOST_TEST_DELAYED tool. We also need to introduce special tags unit_test::throws, unit_test::no_throw: BOOST_TEST_DELAYED(foo(), unit_test::throws<my_exception>() ); BOOST_TEST_DELAYED(foo(), unit_test::throws<my_exception>(predicate) ); BOOST_TEST_DELAYED(foo(), unit_test::throws( my_exception(...) ) ); BOOST_TEST_DELAYED(foo(), unit_test::no_throw() ); Later form will match to exact exception value. We might be able to fit into BOOST_TEST interface, but that would require somehow we need to recognize executable entity as special case: BOOST_TEST( foo, unit_test::throws<my_exception>() ); Not quite sure if this is possible. 2. BOOST_CHECK_CLOSE, BOOST_CHECK_CLOSE_FRACTION, BOOST_CHECK_SMALL We can deal with these by introducing couple special tags: BOOST_TEST(a == 1.5, unit_test::tolerance(1e-6) ); BOOST_TEST(a == 0.003, unit_test::percent_tolerance(1e-6) ); BOOST_TEST(a, unit_test::small(1e-3) ); On a plus side we'll be able to use these in new previously unavailable way: BOOST_TEST(a > 1.1, unit_test::tolerance(1e-6) ); This would test that value of a either > 1.1 or within a fraction tolerance of it. 3. BOOST_CHECK_PREDICATE Similar to (1) we need to delay predicate execution. Might be easier to leave it be. 4. BOOST_CHECK_EQUAL_COLLECTIONS I think using overloading of equality comparisons we should be able to support this directly: BOOST_TEST( expr == std::vector<int>{1,2,3,4}); 5. BOOST_CHECK_BITWISE_EQUAL We can introduce yet another tag to deal with this: BOOST_TEST(a == 0xA1FB, unit_test::bitwise ); As usual any comments are welcome. Gennadiy

7 16

[locale] [filesystem] Windows local 8 bit encoding
by Thiel, Bjoern 06 Nov '12

06 Nov '12

Hi, developing platform independent code I really like the convenience functions conv::to_utf, conv::from_utf, and conv::utf_to_utf from locale. Why not add something like conv::local8bit_to_utf and conv::local8bit_from_utf following the rational from filesystem (path encoding conversions): template < typename CharType > std::basic_string< CharType > local8bit_to_utf ( std::string const & text, method_type how = default_method ) { char const * encoding = impl::local8bit_encoding() ; return to_utf< CharType >( text, encoding, how ) ; } template< typename CharType > std::string local8bit_from_utf ( std::basic_string< CharType > const & text, method_type how = default_method ) { char const * encoding = impl::local8bit_encoding() ; return from_utf< CharType >( text, encoding, how ) ; } with char const * local8bit_encoding() { #ifdef WIN32 UINT codepage = AreFileApisANSI() ? GetACP() : GetOEMCP() ; return windows_codepage_to_encoding( codepage ) ; #else return "UTF-8" ; #endif } and with (better using a map) char const * windows_codepage_to_encoding( int const codepage ) { switch (codepage) { case 874: return "windows-874" ; case 932: return "Shift_JIS" ; // but should be "Windows-31J" ; case 936: return "GB2312" ; case 949: return "KS_C_5601-1987" ; case 950: return "Big5" ; case 1250: return "windows-1250" ; case 1251: return "windows-1251" ; case 1252: return "windows-1252" ; case 1253: return "windows-1253" ; case 1254: return "windows-1254" ; case 1255: return "windows-1255" ; case 1256: return "windows-1256" ; case 1257: return "windows-1257" ; case 1258: return "windows-1258" ; case 20127: return "US-ASCII" ; case 20866: return "KOI8-R" ; case 20932: return "EUC-JP" ; case 21866: return "KOI8-U" ; case 28591: return "ISO-8859-1" ; case 28592: return "ISO-8859-2" ; case 28593: return "ISO-8859-3" ; case 28594: return "ISO-8859-4" ; case 28595: return "ISO-8859-5" ; case 28596: return "ISO-8859-6" ; case 28597: return "ISO-8859-7" ; case 28598: return "ISO-8859-8" ; case 28599: return "ISO-8859-9" ; case 28603: return "ISO-8859-13" ; case 28605: return "ISO-8859-15" ; case 50220: return "ISO-2022-JP" ; case 50225: return "ISO-2022-KR" ; case 51949: return "EUC-KR" ; case 54936: return "GB18030" ; case 65001: return "UTF-8" ; default: { std::ostringstream message ; message << "Unknown codepage " << codepage ; throw std::invalid_argument( message.str() ) ; } } } Best regards Bjoern.

5 10

[geometry] Can't build docs?
by John Maddock 06 Nov '12

06 Nov '12

I'm trying to build the PDF of the geometry docs for the 1.52 release, but the build is failing: warning: Tag `SHOW_DIRECTORIES' at line 162 of file Doxyfile has become obsolete. To avoid this warning please remove this line from your configuration file or upgrade it using "doxygen -u" warning: Tag `HTML_ALIGN_MEMBERS' at line 257 of file Doxyfile has become obsolete. To avoid this warning please remove this line from your configuration file or upgrade it using "doxygen -u" M:/data/boost/branches/release/boost/geometry/strategies/spherical/distance_haversine.hpp:106: warning: found </em> at different nesting level (7) than expected (4) M:/data/boost/branches/release/boost/geometry/strategies/spherical/distance_haversine.hpp:107: warning: found </em> at different nesting level (7) than expected (4) M:/data/boost/branches/release/boost/geometry/strategies/spherical/distance_haversine.hpp:113: warning: end of comment block while expecting command </em> M:/data/boost/branches/release/boost/geometry/strategies/spherical/distance_haversine.hpp:113: warning: end of comment block while expecting command </em> M:/data/boost/branches/release/boost/geometry/strategies/spherical/distance_haversine.hpp:106: warning: found </em> at different nesting level (7) than expected (4) M:/data/boost/branches/release/boost/geometry/strategies/spherical/distance_haversine.hpp:107: warning: found </em> at different nesting level (7) than expected (4) M:/data/boost/branches/release/boost/geometry/strategies/spherical/distance_haversine.hpp:113: warning: end of comment block while expecting command </em> M:/data/boost/branches/release/boost/geometry/strategies/spherical/distance_haversine.hpp:113: warning: end of comment block while expecting command </em> warning: mismatched versions of Boost.Build engine and core warning: Boost.Build engine (M:\data\boost\branches\release\b2.exe) is 2011.04.00 warning: Boost.Build core (at M:/data/boost/branches/release/tools/build/v2) is 2011.12-svn ...patience... ...found 318 targets... ...updating 3 targets... quickbook.quickbook-to-boostbook ..\..\..\bin.v2\libs\geometry\doc\msvc-10.0\debug\threading-multi\geometry.xml Generating Output File: ..\..\..\bin.v2\libs\geometry\doc\msvc-10.0\debug\threading-multi\geometry.xml generated/get.qbk:32: error: Syntax Error near column 2. generated/get.qbk:32: error: Syntax Error near column 3. generated/get.qbk:32: error: Syntax Error near column 3. generated/get.qbk:69: error: Syntax Error near column 2. generated/get.qbk:69: error: Syntax Error near column 3. generated/get.qbk:69: error: Syntax Error near column 3. Error: Error count: 6. Any ideas? BTW I see the same failures on Trunk and release branches. Thanks, John.

1 0

[array] compile-time checked access
by Tobias Loew 06 Nov '12

06 Nov '12

Hi, I was just rewriting some old code with hard coded indices for array access and though that compile-time checked access to array elements would be a nice thing. Maybe there are smart compilers out there that emit warnings or errors for a hard coded out-of-bounds access, but my compiler does not. So, code like compiles without warnings or erros. Now, adding the following functions to array would make it possible to write which results in the expected error messages. Tobias -- View this message in context: http://boost.2283326.n4.nabble.com/array-compile-time-checked-access-tp4638… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 8

shared_ptr<X[5]>
by Peter Dimov 06 Nov '12

06 Nov '12

Now that we (are going to) have shared_ptr<X[]>, what should shared_ptr<X[5]> do? >From user point of view, it seems obvious that this is as good a pointer to an array as shared_ptr<X[]> is, so it should behave similarly, having op[] and an element_type of X. >From a generic point of view, this could potentially break code that assumes that shared_ptr<T>::get() always returns a T*, even when T is X[5]. But how common is such a scenario? On the other hand, it will actually _fix_ generic code of the form shared_ptr<T> p( new T ); when T is X[5].

2 1

Re: [boost] C++ announcements coming tomorrow
by Brian Wood 05 Nov '12

05 Nov '12

From: Paul Mensonides > In that last announcement talk alone together with the follow-up Q & A > there are numerous "subtle" bits of marketing. The entire general trend > is one of attempting to turn a product (software) into a service. That > is an anti-consumer nickle-and-dime model which is just as anti-consumer > as trying to trick people that can't afford something into making > payments. It is just as anti-consumer as many other related things > occurring in the software industry nowadays--microtransactions being one > of them. I bet MS investors would think differently. Is there another option available to them than services? -- Brian Wood Ebenezer Enterprises -- so far G-d has helped us. http://webEbenezer.net

2 1

Boost mpi, serialization and shared_ptr
by Gabriel 05 Nov '12

05 Nov '12

Hello, Has this problem been solved? I have the same problems, I have a class with a shared_ptr member which does not compile with MPI skeleton and content. I receive the same error: *class boost::mpi::packed_skeleton_* *iarchive' has no member named 'reset' *and so on (I refere to the older posts) Thanks for any reply! BR Gabriel Nützi

1 0

[iterator] Library name (was [website] Wrong library name)
by Daniel James 04 Nov '12

04 Nov '12

On 4 November 2012 07:51, Michel Morin <mimomorin(a)gmail.com> wrote: > Boost.Iterator is listed as "Iterators" (note the plural form) in > > * http://www.boost.org/doc/libs/ > * trunk/boost/libs/libraries.htm > > But it should be "Iterator". I'll fix this in a sec, although 'libs/libraries' will only be updated in 1.53. I replied with an 'iterator' subject so that the appropriate people might see this.

2 2

Help! Detecting that two template aliases are equal.
by Matt Calabrese 04 Nov '12

04 Nov '12

In working on Boost.Generic I need, in multiple parts of the library, to detect if two template aliases are equivalent. For instance, this is required when comparing the compatibility of an automatically generated concept map of a less-refined concept with an explicitly created concept map for the less-refined concept when the concept in question has an associated class template. This seems like it shouldn't be too difficult, but apparently my understanding of template aliases is incomplete: //////////////////// // Create a template template< class > struct template_ {}; // Make a simple alias of the template template< class A > using template_alias = template_< A >; // Create a metafunction to determine if two unary type templates are the same template< template< class > class L, template< class > class R > struct templates_are_the_same { static bool constexpr value = false; }; template< template< class > class T > struct templates_are_the_same< T, T > { static bool constexpr value = true; }; // In Clang and GCC, the following static_assert will be triggered static_assert( templates_are_the_same< template_, template_alias >::value , "Templates are not the same." ); //////////////////// This behavior is observed in both Clang and GCC, though I haven't verified that it is correct behavior in the standard. Assuming that it is in fact standard, can anyone conceive of a way around this limitation? I've considered passing dummy arguments to the templates based on the template parameter list and checking that the resultant types are equal, but I'd like to avoid that if at all possible, since it seems like it would be difficult or impossible to support certain templates properly (I.E. consider the template parameter list of a template where one parameter type is dependent on another, like std::integral_constant). This type of detection is very important in making Boost.Generic work as closely to N2914 as possible so any workaround, however hairy, would be a huge help. -- -Matt Calabrese

5 8

[test] linking issues on trunk
by Vicente J. Botet Escriba 04 Nov '12

04 Nov '12

Hi, I have found some linking issues (see bellow) with Boost.Test ubuntu gcc-4.4.6,gcc-4.6.1.0(c++0x),intel-12.1.3.0(c++0x). I'm linking with boost_unit_test_framework. Should other libraries be added? Best, Vicente P.S. This worked well before. time bjam --build-dir=/tmp/bin.v2 toolset=gcc-4.4.6,gcc-4.6.1.0x,intel-12.1.3.0x -q -d2 gcc.link /tmp/bin.v2/boost/bin.v2/libs/thread/test/test_thread.test/gcc-4.4.6/debug/threading-multi/test_thread "g++-4.4" -Wl,-R -Wl,"/tmp/bin.v2/boost/bin.v2/libs/chrono/build/gcc-4.4.6/debug/threading-multi" -Wl,-R -Wl,"/tmp/bin.v2/boost/bin.v2/libs/system/build/gcc-4.4.6/debug/threading-multi" -Wl,-R -Wl,"/tmp/bin.v2/boost/bin.v2/libs/thread/build/gcc-4.4.6/debug/threading-multi" -Wl,-rpath-link -Wl,"/tmp/bin.v2/boost/bin.v2/libs/chrono/build/gcc-4.4.6/debug/threading-multi" -Wl,-rpath-link -Wl,"/tmp/bin.v2/boost/bin.v2/libs/system/build/gcc-4.4.6/debug/threading-multi" -Wl,-rpath-link -Wl,"/tmp/bin.v2/boost/bin.v2/libs/thread/build/gcc-4.4.6/debug/threading-multi" -o "/tmp/bin.v2/boost/bin.v2/libs/thread/test/test_thread.test/gcc-4.4.6/debug/threading-multi/test_thread" -Wl,--start-group "/tmp/bin.v2/boost/bin.v2/libs/thread/test/test_thread.test/gcc-4.4.6/debug/threading-multi/test_thread.o" "/tmp/bin.v2/boost/bin.v2/libs/chrono/build/gcc-4.4.6/debug/threading-multi/libboost_chrono.so.1.52.0" "/tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a" "/tmp/bin.v2/boost/bin.v2/libs/thread/build/gcc-4.4.6/debug/threading-multi/libboost_thread.so.1.52.0" "/tmp/bin.v2/boost/bin.v2/libs/system/build/gcc-4.4.6/debug/threading-multi/libboost_system.so.1.52.0" -Wl,-Bstatic -Wl,-Bdynamic -lrt -Wl,--end-group -g -pthread /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(unit_test_main.o): In function `boost::unit_test::unit_test_main(boost::unit_test::test_suite* (*)(int, char**), int, char**)': /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/unit_test_main.ipp:92: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(framework.o): In function `boost::unit_test::framework::impl::apply_filters(unsigned long)': /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:506: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:533: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:537: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:548: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(framework.o):/mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:603: more undefined references to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' follow /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(framework.o): In function `visit': /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:686: undefined reference to `boost::unit_test::decorator::for_test_unit::apply(boost::unit_test::test_unit&)' /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(framework.o): In function `boost::unit_test::framework::init(boost::unit_test::test_suite* (*)(int, char**), int, char**)': /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:691: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:698: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(framework.o): In function `boost::unit_test::framework::run(unsigned long, bool)': /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:1008: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:1045: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(framework.o): In function `boost::unit_test::ut_detail::label_filter::visit(boost::unit_test::test_unit const&)': /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:217: undefined reference to `boost::unit_test::test_unit::has_label(boost::unit_test::basic_cstring<char const>) const' /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(framework.o): In function `boost::unit_test::ut_detail::remove_disabled::visit(boost::unit_test::test_unit const&)': /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/framework.ipp:300: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(progress_monitor.o): In function `boost::unit_test::traverse_test_tree(boost::unit_test::test_unit const&, boost::unit_test::test_tree_visitor&, bool)': /mnt/boost/trunk/libs/thread/test/../../../boost/test/tree/traverse.hpp:46: undefined reference to `boost::unit_test::traverse_test_tree(boost::unit_test::test_case const&, boost::unit_test::test_tree_visitor&, bool)' /mnt/boost/trunk/libs/thread/test/../../../boost/test/tree/traverse.hpp:48: undefined reference to `boost::unit_test::traverse_test_tree(boost::unit_test::test_suite const&, boost::unit_test::test_tree_visitor&, bool)' /tmp/bin.v2/boost/bin.v2/libs/test/build/gcc-4.4.6/debug/link-static/threading-multi/libboost_unit_test_framework.a(results_reporter.o): In function `boost::unit_test::results_reporter::make_report(boost::unit_test::report_level, unsigned long)': /mnt/boost/trunk/libs/thread/test/../../../boost/test/impl/results_reporter.ipp:181: undefined reference to `boost::unit_test::traverse_test_tree(unsigned long, boost::unit_test::test_tree_visitor&, bool)' collect2: ld returned 1 exit status ...failed gcc.link /tmp/bin.v2/boost/bin.v2/libs/thread/test/test_thread.test/gcc-4.4.6/debug/threading-multi/test_thread... ...failed updating 1 target...

2 1

[website] Wrong library name
by Michel Morin 04 Nov '12

04 Nov '12

Boost.Iterator is listed as "Iterators" (note the plural form) in * http://www.boost.org/doc/libs/ * trunk/boost/libs/libraries.htm But it should be "Iterator". Regards, Michel

1 0

[variant] awkward recursion
by Dave Abrahams 03 Nov '12

03 Nov '12

I've been playing around with variant a bit and decided to try to build a data structure for storing json. I came up with several different approaches but none are super-satisfying. I'd like some feedback. (If you need a refresher on what's in json, the front page of http://json.org tells all). In the abstract, json looks like: struct null {}; typedef std::map<std::string, value> object; typedef std::vector<value> array; typedef variant< null, std::string, double, object, array, bool > value; Naturally, this code isn't legal C++, so I set about making it be. The first thing I tried was to use recursive_wrapper<>, as the documentation implies it is the most flexible way to do this sort of thing. Unfortunately, there's no clean way to reformulate this type in a way that allows recursive_wrapper work, because the type that needs to be wrapped in recursive_wrapper includes "value" in its name, and I can't forward-declare it. The only way to forward-declare a type X, as far as I know, is: struct X; // or class X; So to try to get recursive_wrapper to work, I tried a couple of formulations that started with that, but it turns out that when you do this, you end up not needing recursive_wrapper at all struct value; typedef std::map<std::string, value> object; typedef std::vector<value> array; typedef variant< null, std::string, double, object, array, bool > value_base; struct value : value_base { value() {}; template <class T> value(T const& x) : base(x) {} // no move; I'm in C++03-land value& operator=(value const& x) { base::operator=(x); return *this; } } }; I don't know if I've missed some things that should be in that "value" class. I know that a recursive variant, in principle, requires a pointer indirection somewhere, so I was wondering if, had I wrapped object and array in recursive_wrapper as below, I would have been adding an unnecessary inefficiency. typedef variant< null, std::string, double, reference_wrapper<object>, reference_wrapper<array>, bool > value_base; I also wondered whether that would give me different results from typedef std::map<std::string, value> object; typedef std::vector<value> array; typedef variant< null, std::string, double, std::map<std::string, reference_wrapper<value> >, std::vector<reference_wrapper<value> >, bool > value_base; and which one was better. Does anyone know? I think that should be in the docs. Using recursive_variant_ works out quite nicely, except that it doesn't allow me to separately declare "object" and "array" and re-use them in the definition of "value": typedef boost::make_recursive_variant< null , std::string , double , std::map<std::string, boost::recursive_variant_> , std::vector<boost::recursive_variant_> , bool >::type value; I also wonder if I'm getting an unnecessary inefficiency in that case. Lastly, what flexibility am I sacrificing by using this approach? -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

9 28

[1.52.0] Release candidates available
by Marshall Clow 03 Nov '12

03 Nov '12

Release candidate files for 1.52.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, -- Marshall

5 5

New Stepanov lecture videos released by A9
by Mat Marcus 02 Nov '12

02 Nov '12

http://www.youtube.com/user/A9Videos/videos?flow=grid&view=1

1 0

[string_algo] Documentation Complaint
by Dave Abrahams 02 Nov '12

02 Nov '12

Wow, I found this documentation hard to use! I wanted to translate various 1-character substrings into new strings, e.g. translate the TAB character ('\t') to its textual escaped representation "\\t", and I went looking for an algorithm to do it. After 5 minutes of searching, I *think* the algorithm isn't there, but I'm still not sure. I nearly went blind (well, not really, but it felt that way) looking at http://www.boost.org/doc/libs/1_51_0/doc/html/string_algo/reference.html#he… because there's no vertical whitespace. More importantly, there's *no description of what any of these algorithms actually do*! ... calming down ... Heh, very terse descriptions are in the "Quick Reference": http://www.boost.org/doc/libs/1_51_0/doc/html/string_algo/quickref.html These might be good enough for me, but I always figure I'm going to get complete detail from the non-quick reference, and this one is just a dump of all the declarations, so I had to go around in a big circle and begin writing this documentation complaint before I found it. Can this situation be improved? -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

2 2

[Variant] Documentation Questions/Notes
by Dave Abrahams 02 Nov '12

02 Nov '12

- What does this mean? Full value semantics, including adherence to standard overload resolution rules for conversion operations. Seems to me that it's impossible *not* to adhere to any standard rules. Is the part after the comma vacuous? - The "temporary heap backup" technique seems to have a hole: 1. Copy-construct the content of the left-hand side to the heap; call the pointer to this data backup. 2. Destroy the content of the left-hand side. 3. Copy-construct the content of the right-hand side in the (now-empty) storage of the left-hand side. 4. In the event of failure, copy backup to the left-hand side storage. 5. In the event of success, deallocate the data pointed to by backup. What happens in the event of a failure in step 4? - I note the section on motivation doesn't mention the new capabilities of C++11 unions. Now some of the constructs are possible... *if* you do all the bookeeping yourself. - I note that the implementation has at least some support for move semantics and yet the docs require all elements to be "bounded types", which in turn are required to be CopyConstructible. Is that accurate, or outdated? - "completeness at the point of template instantiation" is a rather odd thing to put in a concept. I suggest that that should be just part of the requirements on the variant template rather than on BoundedType. - Do the semantics for are_strict_equals at http://www.boost.org/doc/libs/1_51_0/doc/html/variant/tutorial.html differ from those of the built-in equality operator? - it might be worth making the point that recursive variants offer the ability to define complex linked data structures *as value types* in a type- and memory-safe manner. I.e. no explicit handling of pointers; copy construction and assignment "just work," etc. -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

3 5

[optional] Doc Nit
by Dave Abrahams 01 Nov '12

01 Nov '12

> A typical approach is to consider the existence of a > valid return value as a postcondition, so that if the > function cannot compute the value to return, it has > either undefined behavior (and can use assert in a > debug build) or uses a runtime check and throws an > exception if the postcondition is violated. This is a > reasonable choice for example, for function (A), This is possibly technically correct, but confusing. Undefined behavior results from precondition violations, not postcondition violations. I'd suggest: One approach is to make a non-negative argument a precondition, so when violated the function has undefined behavior (and can use assert in a debug build). Alternatively, one can use a runtime check and specify that an exception is thrown if the postcondition cannot be satisfied. These are a reasonable choice for example, for function (A), I'm not sure the first sentence is quite right for your needs, but I'm out of time to improve it further. -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

2 1

Re: [boost] make_shared_array and allocate_shared_array
by Glen Fernandes 01 Nov '12

01 Nov '12

On Thu Nov 1 2012 at 1:48 PM, Olaf van der Spek <ml(a)vdspek.org> wrote: > Does Glen's make_shared_array have variants for both initialized and uninitialized allocations (for builtin types)? Hi Olaf, I just updated the code to only have initialization for non POD types: https://github.com/glenfe/glenfern/commit/05ea1f429bddfe7f07e4bb392db248492… Glen

1 0

Review: Code Review: allocate_shared_array and make_shared_array
by Glen Fernandes 01 Nov '12

01 Nov '12

A big thank you to Peter Dimov who has been kind enough to review my code. The open question we both have is whether these functions should continue to return shared_ptr<T> or be changed to return shared_array<T> after some modification to shared_array (both to support construction from (or conversion to) a shared_ptr and to have things like a no-throw constructor). Updated code: https://github.com/glenfe/glenfern/tree/master/boost Original blog post: http://glenfernandes.wordpress.com/ Some context from our discussion: Peter Dimov wrote: > Providing two separate sets of functions doesn't appeal to me much. > make_shared_array should return whatever we decide they should return. You > are right about shared_array's default constructor though, and maybe we can > use this opportunity to fix it (and add move support), and perhaps provide a > way for people to get a shared_ptr from a shared_array, if they have to work > with other people who only use that in their APIs. :-) > > Let's see what the Boost list will say. > > Glen Fernandes wrote: > > 1. I keep the functions returning shared_ptr but rename them to > > allocate_shared_sequence and make_shared_sequence. I think they are still > > useful for people who would want to avoid shared_array in their APIs for > > various reasons (e.g. its default constructor can throw). > >

1 0