- Boost - lists.preview.boost.org

Re: [boost] [decimal] Proposed portable implementation of std::decimal
by Josh Quigley 27 Apr '12

27 Apr '12

As previously mentioned, the plan is to wire up existing (C interface) packages to a C++ std::decimal, raising licensing issues around the 3rd party code. I don't believe there is an issue, the licences are very short and read like plain English to me. Also, gcc includes both of these in it's implementation, and distributes under an open licence. I've copy-pasted below the relevant bits out of the EULAs. If anyone thinks there might be an issue, please let me know. INTEL EULA Copyright (c) 2011, Intel Corp. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, his list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Intel Corporation nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. IBM Licence Copyright (c) 1995-2012 International Business Machines Corporation and others All rights reserved. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, provided that the above copyright notice(s) and this permission notice appear in all copies of the Software and that both the above copyright notice(s) and this permission notice appear in supporting documentation.

3 3

Variadic to Head/Tail TMP List
by Fernando Pelliccioni 27 Apr '12

27 Apr '12

Hi, Is this piece of code useful ? http://pastebin.com/tRrqVHTw The purpose is to tranform code like the following: typedef cons<int, cons<float, cons<char, cons<string>>>> t0; // fusion::cons or similar data structures in typedef chain_generator<cons, nil> cons_gen; typedef cons_gen::gen<int, float, char, std::string>::type t1; I don't know if there is something similar in a library. I think it could be useful. Compiler tests: GCC 4.7 -> Compiler Error GCC 4.7.1 & Trunk -> OK http://gcc.gnu.org/bugzilla/show_bug.cgi?id=53108 Clang Trunk -> OK MSVC 11 beta -> has no Variadic Templates Regards, FP.

2 2

Boost.ntree_container (bi_tree, quad_tree, oct_tree, etc ptr containers) Is there any interest in this?
by Dan Walters 27 Apr '12

27 Apr '12

Hi all, I am proposing adding spacial containers for efficiently storing and accessing data of a spacial nature in fixed size trees. n-tree data structures would be useful where data relates to a 1D, 2D or 3D location, providing n-array searching of an n-array volume. N-tree data structures are commonly used in 3d applications, and are rarely particularly specialized. Their use is fundamental however they are frequently written by application programmers, due to a lack of free open source implementations (to the limit of my research). Their sophistication, like any container, is slim but easy to get wrong and beyond the ability and time contraints that should be assumed of the application programmer. It is a flexible and standard enough concept that a single implementation can be expected to meet a majority of requirements. I think there is the opportunity to create a solid implementation of templated n-tree pointer containers. The ntree container would be a tree representing an narray of elements with all dimensions being the same and being a power of two. The tree is memory efficient where areas within the volume are not occupied, and so "branches" and "leaves" are not created. The tree is well suited to geometrical operations such as ray picking or plane culling of the volume. An n-tree structure could be used in the place of any sparely populated n dimensional array where memory saving is the objective. The existing libraries I have found are licensed under GNU licenses. A ntree container should implement: get reset overloaded (array style) operators Optional implementations: views - a subset object representing an area or volume within the tree for accelerated access to a group of leaves that are positioned near to each other raycasting plane culling (getting leaves within a set of planes) etc. Is there interest in such a library? Many thanks, Dan

7 7

[interprocess] ppc compile error
by Tim Blechmann 27 Apr '12

27 Apr '12

hi all, one of my users reported the following compile error when building my application for ppc/osx(10.5): /var/folders/+D/+DUo7PxAEgCfHTatXKIeMU+++TI/-Tmp-//ccPubDFs.s:5566:Unknown pseudo-op: .subsection /var/folders/+D/+DUo7PxAEgCfHTatXKIeMU+++TI/-Tmp-//ccPubDFs.s:5566:Rest of line ignored. 1st junk character valued 50 (2). /var/folders/+D/+DUo7PxAEgCfHTatXKIeMU+++TI/-Tmp-//ccPubDFs.s:5569:Unknown pseudo-op: .previous the specific part of the assembly is: -- 4010 L686: 4011 sync 4012 lwarx r8,0,r11 4013 cmpw r8, r3 4014 bne- 2f 4015 stwcx. r9,0,r11 4016 bne- 2f 4017 addi r2,0,1 4018 1:.subsection 2 4019 2: addi r2,0,0 4020 b 1b 4021 .previous 4022 4023 cmpwi cr7,r2,0 4024 mr r3,r8 4025 beq cr7,L686 4026 stw r8,20(r10) 4027 mulli r3,r8,12 4028 add r3,r3,r10 4029 addi r3,r3,28 4030 bl L__ZNK5boost12interprocess10offset_ptrIfimLm0EE14to_raw_pointerEv$stub 4031 addi r1,r1,96 4032 stw r3,4(r30) 4033 lwz r0,8(r1) 4034 nop 4035 lmw r30,-8(r1) 4036 mtlr r0 4037 blr -- this error occurs with boost-1.49.0 ... is this a known issue or some workaround? thanks, tim

2 2

[OT][RFC] standardized compile-time reflection
by Matus Chochlik 27 Apr '12

27 Apr '12

Dear members of the Boost community, (Sorry for being slightly off-topic here) In the last couple or years I've been working on the design and implementation of portable reflection in C++. I've written several reflection libraries (that are hopefuly gradually improving). For the latest incarnation see the Mirror reflection utilities written in C++11: http://kifri.fri.uniza.sk/~chochlik/mirror-lib/html/ Recently I've learned that the Standardization Committee has issued a call for proposals for additions to the standard to the wider community, so I've decided to write down my own ideas on how compile-time reflection should look like in C++. Afterwards I discussed it with several people including Dean Michael Berris, who is the co-author of n3340 "Rich pointers" and is also interested in adding run-time (and static) reflection to C++. We've decided that we merge the ideas from my paper into his proposal (which has not happened yet and will probably take a while). However, n3340 deals with more than just static reflection, so I would like to start a discussion and ask the members of the Boost community for their opinions about the compile-time-specific parts that are described in the following paper, before writing the final proposal: http://kifri.fri.uniza.sk/~chochlik/jtc1_sc22_wg21/std_cpp_refl.pdf It is a bit lengthy so you can skip sections 1., 2. and probably also section 3., if you are knowledgeable about the domain. The most important parts are: the whole section 4. "Technical specification" and also 5., 6. and 7. Section 7. "Unresolved issues" lists several important things that need to be worked out and 3. has some rationale for the design decisions. Note that the paper has the basic structure of a standard proposal, but is not written in standardese nor is it "polished" (since it will be merged into another paper and probably re-worded). It is my first attempt at a standard proposal and I'm not a member of the Committee so please bear with me :-). Dean and I have also independently decided to write proof-of-concept implementations - compiler extensions for clang and gcc respectivelly. The sources for the gcc plugin are hosted here: https://github.com/matus-chochlik/std_cpp_refl It's in a very early stage, but if someone has some tips or hints they'll be welcome. Thanks in advance for any (negative or positive) feedback. Best regards, Matus Chochlik

6 19

[assign] How to create a container wrapper for tuple_list_of
by Robert Dailey 26 Apr '12

26 Apr '12

I have a vector of boost::tuple objects that is a member variable in a class of mine. I want to be able to create an instance of my wrapper class and construct it off of a tuple_list_of(), and essentially forward those values to the container itself. I haven't seen a way to do this yet. An example is below. Note that my constructor in the class was my attempt to get this working, but instead it will not compile. For some reason boost.assign thinks that the EnumErrorInfo class is the container. template<class T> class EnumErrorInfo { public: typedef boost::tuple<T, char const*, char const*> Tuple; typedef std::vector<Tuple> TupleVector; EnumErrorInfo( TupleVector const& assignment ) : m_errorInfo( assignment ) {} Tuple const& getErrorInfo( T error_code ) { TupleVector::const_iterator it = std::find_if( m_errorInfo.begin(), m_errorInfo.end(), MatchErrorCodePred( error_code ) ); if( it != m_errorInfo.end() ) { return *it; } static Tuple const unknown_info( error_code, "????", "No error info available for this code" ); return unknown_info; } private: class MatchErrorCodePred { public: MatchErrorCodePred( T error_code ) : m_errorCode( error_code ) {} bool operator() ( Tuple const& t ) { return t.get<0>() == m_errorCode; } private: DomInterfaceErrors m_errorCode; }; TupleVector m_errorInfo; }; And here is how I'd like to initialize the class: EnumErrorInfo<DomInterfaceErrors> g_errorInfo = tuple_list_of ( GDE_OK, "GDE_OK", "DBL: Opeartion successfully completed" ) ( GDE_GDD_DIRUSERS, "GDE_GDD_DIRUSERS", "AQX: Unable to get directory users." ) ;

2 1

[interprocess] Sharing shared_memory_object across processes?
by Joseph Van Riper 26 Apr '12

26 Apr '12

I either do not understand what I am seeing, or I may have stumbled upon a bug, at least in a Windows environment. Or, of course, my expectations may be unrealistic. The short of this is that when I create a boost::interprocess::shared_memory_object that isn't removed for the duration of the program's run, the reading program's run can't seem to open the shared_memory_object, despite creating a boost::interprocess::permissions object and calling 'set_unrestricted()'. I get an exception indicating that access is denied. If nothing else, the code I've provided is an interprocess version of the classic read-writer's problem, second version (writers preferred). It may be of use to someone with a little cleaning. Environment: Compiler: MSVC++ 10 OS: Win 7 Pro, 64-bit. Steps to reproduce: 1. In VC++ 10, create an empty command-line project. 2. Replace contents of your .cpp with the code in this e-mail. 3. Compile. 4. Run the executable twice, first with an argument, next without. Expected results: The executable run without arguments indicates how much data was transferred on the same line. Actual results: The executable run without arguments complains that access is denied. NOTE: If you #define BOLD_NEW_TEST and recompile, this program runs according to expectations. This causes the objects to be compiled in a way where the shared_memory_objects only last for as long as it takes to write or read the data. I suspect this shouldn't be necessary, but perhaps I'm wrong. The error is especially peculiar to me, as I can open the file itself with a text editor. It doesn't seem like it should be denied. - Trey

2 3

[result_of] Make `cpp0x_result_of_impl` public
by Michel Morin 26 Apr '12

26 Apr '12

There are two implementations of boost::result_of: a TR1-style implementation and a decltype-based implementation. While the TR1-style implementation has a public interface `boost::tr1_result_of`, decltype-based one doesn't have a public interface. By defining BOOST_RESULT_OF_USE_DECLTYPE, boost::result_of use decltype-based implementation. But this is not always a viable solution, since this breaks some Boost libraries. So how about adding `boost::cxx11_result_of` as public interface of the decltype-based implementation? Attached a patch to add `boost::cxx11_result_of`. (This patch also changes the name of `cpp0x_result_of_impl` to `cxx11_result_of_impl` to reflect the recent discussion on the cpp/cxx naming.) P.S. Is it worth trying to use this `boost::cxx11_result_of` in `boost::transform_iterator` code on trunk? Regards, Michel

7 40

[result_of] Regression: compilation errors on C++03 compilers when defining BOOST_RESULT_OF_USE_DECLTYPE
by Michel Morin 25 Apr '12

25 Apr '12

If we define BOOST_RESULT_OF_USE_DECLTYPE, boost::result_of tries to use decltype-based implementation even on C++03 compilers. This causes compilation errors and it is a regression on C++03 compilers. Is it intentional change? Regards, Michel

5 6

[utility][assert]
by Yechezkel Mett 25 Apr '12

25 Apr '12

I noticed that when BOOST_ENABLE_ASSERT_HANDLER is defined, BOOST_ASSERT calls boost::assertion_failed whether or not NDEBUG is defined, but BOOST_ASSERT_MSG calls boost::assertion_failed_msg only if NDEBUG is not defined. Is there a reason for this difference?

1 0

[exception] applying patch for issue #6349
by David Deakins 24 Apr '12

24 Apr '12

Hi Emil, Since the issue in item #6349 is disrupting the Windows CE test results for many libraries, do you mind if I go ahead and apply the patch attached to that item? Thanks, -Dave

2 1

[Iterator] Fixing the default reference type of transform_iterator (#5127)
by Michel Morin 24 Apr '12

24 Apr '12

The default reference type of transform_iterator should be boost::result_of<const UnaryFunction(Iterator::reference)> rather than boost::result_of<UnaryFunction(Iterator::reference)> since the dereference operator of transform_iterator is a const member function. Ticket #5127 describes this bug https://svn.boost.org/trac/boost/ticket/5127 and the ticket has a patch. Jeff, could you apply the patch, if it looks OK? Regards, Michel

3 7

[contract] assertion requirements as meta-functions or not?
by lcaminiti 24 Apr '12

24 Apr '12

Hello all, Boost.Contract allows to specify "assertion requirements": /assertion-condition/, requires /assertion-requirement/ If the requirement is not met then the assertion condition is neither compiled nor checked at run-time. Question: Shall the assertion-requirement be a nullary boolean meta-function or just a static boolean value? For example: CONTRACT_FUNCTION( template( typename T ) requires( boost::LessThanComparable<T> ) (T const&) (min) ( (T const&) x, (T const&) y ) postcondition( auto result = return, x < y ? result == x : result == y, requires boost::has_equal_to<T>::value // static boolean ) ) { return x < y ? x : y; // OK: T is less than comparable `<`. } For now, the assertion requirement is a static boolean value so it can be more easily manipulated (using !, &&, ||, etc instead of mpl::not, mpl::and, mpl::or, etc). However, is there any strong reason for marking the assertion requirement a nullary boolean meta-function instead like the following code? x < y ? result == x : result == y, requires boost::has_equal_to<T> // meta-function Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-contract-assertion-requirements-as… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 5

[Fusion] Patch: fixing some test failures on clang
by Michel Morin 24 Apr '12

24 Apr '12

The following tests of Boost.Fusion fail on clang trunk in a C++11 mode with libc++. * io.test * deque_construction.test * deque_misc.test * std_tuple_iterator.test * invoke.test Attached a patch for fixing two failures (io.test and std_tuple_iterator.test) of them. Regards, Michel

2 1

Search a vector of tuples?
by Robert Dailey 23 Apr '12

23 Apr '12

Is there a method in the boost library to iterate a vector of boost::tuple objects, comparing the 1st element in the tuple of each tuple to a value that I specify? My tuple is setup like so: typedef boost::tuple<int, int, char const*> Tuple; typedef std::vector<Tuple> ErrorStringMap; ErrorStringMap mystrings = tuple_list_of (10, "10", "ten") (20, "20", "twenty") (30, "30", "thirty") (10, "10", "ten"); I want to search the vector of tuples and do something with every tuple that has the number 10 as the first element in the tuple.

7 15

[concept_check] addable
by lcaminiti 23 Apr '12

23 Apr '12

Hello all, Does this Addable concept definition make sense to you? Is there any error? #include <boost/concept_check.hpp> template<typename T> struct Addable { // User-defined concept. BOOST_CONCEPT_USAGE(Addable) { return_type(x + y); // Check addition `T operator+(T x, T y)`. } private: T x; T y; void return_type(T const&); // Used to check addition returns type `T`. }; It's not making Sun's linker happy: "/opt/sunstudio12.1/bin/CC" -g -library=stlport4 -features=tmplife -features=tmplrefstatic -library=stlport4 -m64 -KPIC -o "/scratch2/kbelco/boost/results/boost/bin.v2/libs/local_function/test/typeof_seq.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/typeof_seq" "/scratch2/kbelco/boost/results/boost/bin.v2/libs/local_function/test/typeof_seq.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/typeof_seq.o" -Bdynamic -lrt -Bstatic -Bdynamic Undefined???first referenced symbol ??? in file void Addable<int>::return_type(const int&) /scratch2/kbelco/boost/results/boost/bin.v2/libs/local_function/test/typeof_seq.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/typeof_seq.o ld: fatal: Symbol referencing errors. No output written to /scratch2/kbelco/boost/results/boost/bin.v2/libs/local_function/test/typeof_seq.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/typeof_seq But the error might also be somewhere else in the program that checks the concept, I'm still debugging... Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-concept-check-addable-tp4572138p45… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 5

[filesystem] #6521 Directory listing using C++11 range-based for loops
by Beman Dawes 23 Apr '12

23 Apr '12

Ticket #6521 requests adding: class directory{ path p_; public: inline directory(path p):p_(p){} directory_iterator begin(){ return directory_iterator(p_); } directory_iterator end(){ return directory_iterator(); } }; so that that a range-based for loop can be used: for (auto itr : directory(".")) { cout << itr.path() << endl; } The above works as expected on GCC 4.6 and VC++ 11 beta. Is that the best way for filesystem directory iteration to support range-based for? Provide a class directory_tree for recursive iteration? --Beman

4 13

1.50 release calendar
by Vicente J. Botet Escriba 23 Apr '12

23 Apr '12

Hi, I would like to know the 1.50 release calendar so that I can plan with Anthony Williams the merge to release of Boost.Thread of version 3. Which is the last day to merge to release a big change? Thanks for all, Vicente

3 3

[range] Question about adapted range safety given C++11 auto
by Beman Dawes 22 Apr '12

22 Apr '12

http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3350.html claims: "Boost's range library focuses on defining a set of Range concepts that allow Containers to be Ranges. Because Containers are heavy-weight, this forces Boost to use references for all of their uses of Ranges, including Ranges that are captured by Range Adapters. This worked fine in C++98, where users couldn't name the types of the Range Adapters in order to declare local variables, but with C++11's auto keyword, users can now save adapted ranges. Since Boost's adapted ranges capture references to their arguments, which can be temporaries, this is no longer a safe design." Is this claim correct? If so, what's the real-world impact? --Beman

4 3

[context] [windows] Intel C++ and GCC Support?
by Joshua Boyce 22 Apr '12

22 Apr '12

I notice that Boost.Context only seems to support MSVC under Windows, and attempts to compile it under GCC or Intel C++ will fail because it's not correctly assembling fcontext_i386_ms_pe_masm/fcontext_x86_64_ms_pe_masm. e.g. Under Intel I get: intel-win.compile.asm > C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\intel-win\debug\address-model-64\architecture-x86\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.obj '-c' is not recognized as an internal or external command, operable program or batch file. > -c -Zp4 -Cp -Cx -DBOOST_ALL_NO_LIB=1 -DWINVER=_WIN32_WINNT_VISTA > -D_WIN32_WINNT=_WIN32_WINNT_VISTA -DBOOST_ALL_NO_LIB=1 > -DWINVER=_WIN32_WINNT_VISTA -D_WIN32_WINNT=_WIN32_WINNT_VISTA /Zi /Zd /W3 > -Fo > "C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\intel-win\debug\address-model-64\architecture-x86\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.obj" > "C:\Users\Josh\Documents\code\boost-trunk\libs\context\src\asm\fcontext_x86_64_ms_pe_masm.asm" > ...failed intel-win.compile.asm > C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\intel-win\debug\address-model-64\architecture-x86\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.obj... Whilst under GCC (via MinGW-w64) I get: Jamfile</C:/Users/Josh/Documents/code/boost-trunk/libs/context/build>.masm64 C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\gcc-mingw-4.7.0\release\address-model-64\architecture-x86\debug-symbols-on\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.o 'ml64' is not recognized as an internal or external command, operable program or batch file. ml64 /c /Fo"C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\gcc-mingw-4.7.0\release\address-model-64\architecture-x86\debug-symbols-on\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.o" "C:\Users\Josh\Documents\code\boost-trunk\libs\context\src\asm\fcontext_x86_64_ms_pe_masm.asm" ...failed Jamfile</C:/Users/Josh/Documents/code/boost-trunk/libs/context/build>.masm64 C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\gcc-mingw-4.7.0\release\address-model-64\architecture-x86\debug-symbols-on\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.o... This occurs for both 64-bit and 32-bit compilation. Is this a known issue with a planned fix? Or is MSVC the only compiler supported under Windows? (I know it's a pain because GCC afaik uses a different assembly syntax... Not sure about Intel.) As an aside, Boost.Context does not yet seem to have an entry in Trac. Thanks.

3 9

[Proto] Errors due to narrowing conversions in matches.hpp
by Michel Morin 22 Apr '12

22 Apr '12

Some tests of Boost.Phoenix fail on clang trunk in a C++11 mode due to narrowing conversions of non-type template arguments, which are prohibited in C++11. Specifically, the narrowing conversions occur at Line 354 and 363 in boost/proto/matches.hpp. They can be simply resolved using `static_cast<bool>(...)`. Regards, Michel

2 3

[thread] Do we need thread_group now?
by Vicente J. Botet Escriba 21 Apr '12

21 Apr '12

Hi, now that we have Boost.Container and Boost.Thread (trunk) uses Boost.Move, boost::thread_group has less sense. I was thinking on replacing it by some generic algorithms as join_all, interrupt_all that work with generic containers so that the user can use the best containers adapted to her own needs. typedef boost::container::vector<boost::thread> thread_vector; { thread_vector threads; for (int i = 0; i < 10; ++i) { threads.push_back(boost::thread(&increment_count)); } join_all(threads); } { thread_vector threads; for (int i = 0; i < 10; ++i) { threads.push_back(boost::thread(&increment_count)); } interrupt_all(threads); } Could boost::thread_group be deprecated once these generic algorithm are released? Or, is there something really useful on the thread_group class that needs to be preserved or even improved? Best, Vicente

7 13

[iterator] iterator-category logic
by Jeffrey Lee Hellrung, Jr. 21 Apr '12

21 Apr '12

I'd like to ask Boosters' opinions on this. boost::iterator_facade determines the iterator_category via the logic outlined in http://www.boost.org/doc/libs/1_49_0/libs/iterator/doc/iterator_facade.html… In particular, if (a) CategoryOrTraversal is a Boost traversal tag; and (b) Reference is not a "real" C++ reference (i.e., a proxy reference); then iterator_category is at best convertible to std::input_iterator_tag. This ends up being surprising to users who use boost::iterator_adaptor (note that, by default, iterator_adaptor passes the Boost traversal tag of the adapted iterator down to iterator_facade) to adapt, say, a pointer, define their adapted iterator to return a proxy reference, and find out that their standard library functions don't recognize their adapted iterator as a random access iterator. The usual workaround tends to be to just override the iterator_facade logic yourself to use a more refined iterator_category and hope your standard library functions don't barf. For better or for worse, the present logic in iterator_facade is strictly (more or less) correct given the C++03 iterator requirements, but I just looked up the N3290 draft of C++11 and it appears that any requirements that *i return a real reference have been dropped, thus allowing for proxy references in all iterator categories. (a) Am I interpreting the C++11 iterator requirements correctly? (b) If so, should iterator_facade's iterator-category logic be reworked to account for the new requirements? (c) If so, how should it be determined when to use the C++03 requirements and when to use the C++11 requirements? Thanks, - Jeff

3 3

[review schedule] Broken link to Coroutine documentation
by Mateusz Loskot 21 Apr '12

21 Apr '12

Hi, There is Coroutine library by Oliver Kowalke proposed for review. The link to Documentation points to...the review schedule at http://www.boost.org/community/review_schedule.html Is there any chance to have it fixed? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 2

Boost.Variant swap performance
by David Sankel 21 Apr '12

21 Apr '12

It seems as though Boost.Variant doesn't take advantage of pointer swaps when it comes to use of recursive variants. In the attached file I declare a simple int list type and include two implementations of a function that adds an int to the front of a list. The first implementation, I would expect to be O(N) on the size of the list and the second implementation to be O(1) on the size of the list. Unfortunately, the output I get is: unoptimized ilPushFront: 129 unoptimized ilPushFront w/ larger list: 363 optimized ilPushFront: 211 optimized ilPushFront w/ larger list: 653 Any ideas why this might be happening? David -- David Sankel Sankel Software www.sankelsoftware.com 585 617 4748 (Office)

2 3