September 2007 - Boost - lists.boost.org

Trac open bugs - by assignee
by Marshall Clow 10 Sep '07

10 Sep '07

[ 201 open bugs today, 204 on Friday ] If you are maintaining a library, and have not logged into the trac system at <http://svn.boost.org/trac/boost/>, please do so ASAP. Until you do that, no tickets can be assigned to you, and will remain under "None". Instructions on working with tickets can be found at: <http://svn.boost.org/trac/boost/wiki/TicketWorkflow> and a mapping of user names to "real names" can be found at: <http://svn.boost.org/trac/boost/report/16> Bug summary 16 doug_gregor 15 grafik 14 ramey 13 dgregor 12 az_sw_dude 10 rogeeff 10 None 9 djowel 8 dave 7 turkanis 7 jsiek 6 nesotto 6 agurtovoy 5 anthonyw 4 witt 4 vladimir_prus 4 shammah 4 samuel_krempp 4 pdimov 4 johnmaddock 4 <Blank> 3 jbandela 3 igaztanaga 3 fcacciola 3 danielw 3 bemandawes 2 urzuga 2 nasonov 2 jmaurer 2 hubert_holin 2 hkaiser 2 ebf 1 t_schwinger 1 speedsnail 1 samuel_k 1 pavol_droba 1 mistevens 1 dlwalker 1 aaron_windsor <Blank> 1033 iostreams::restrict doesn't work on an iostreams::file_source <Blank> 1070 [iostreams]boost\iostreams\copy.hpp line80 copy_impl <Blank> 823 Seekable file_descriptor_source /sink? <Blank> 824 BOOST_IOSTREAMS_HAS_LSEEK64 on Mac OS X None 1068 Mersenne twister disables streaming for Visual C++ None 1094 Finding the correct library to link (feature request for pkg-config support)h None 1184 property_tree assignment (operator) bug None 1187 bcp copy not needed files None 1222 lambda::ret<T> should declare result_type. None 1230 mbstate uninitialized None 1234 unbounded_array copy constructor does not compile with intel v 9.1 None 1237 Resizing symmetric matrices None 960 [random] lognormal_distribution problem None 991 [pool] aaron_windsor 778 top-level configure is broken agurtovoy 1001 gcc 4.1.2 segfaults on mpl/test/apply.cpp agurtovoy 1051 MPL header ordering triggers bug agurtovoy 1099 unable to iterate through a "non-explicitly-declared" mpl::set agurtovoy 1215 Boost 1.34.1_ mpl: Wrong workaround detection using MinGW32 (or.hpp_ line #33) agurtovoy 588 mpl::remove compile error with gcc 4.1.0 agurtovoy 640 documentation mistake anthonyw 1154 tss destruction segfaults in conjunction with dlopen/dlclose anthonyw 1168 [thread] tss crashes randomly anthonyw 1226 macro TEXT() in GetProcAddress() anthonyw 876 xtime documentation incomplete anthonyw 881 errors when build with Apache stdcxx az_sw_dude 1028 typo in boost header: date_time/time_defs.hpp az_sw_dude 1078 from_iso_string cannot read the output from to_iso_string az_sw_dude 1098 Urgent libboost-date-time1.33.1 : bugs on ia64 ? az_sw_dude 1147 date_time library contains global #define ERROR az_sw_dude 1160 warning: month_format shadows a member of this az_sw_dude 1162 warning: ticks shadows a member of this az_sw_dude 287 wrong usage of ios_base::narrow az_sw_dude 316 date_time type conversion warning az_sw_dude 604 from_ftime incorrectly processes FILETIME filled with zeros az_sw_dude 642 operator<< for gregorian::date_duration not found az_sw_dude 889 Insane Dependencies az_sw_dude 890 date_time library supports only the current dst rule bemandawes 559 linker error mingw 3.4.5 bemandawes 752 directory_iterator doesn't work with catch bemandawes 897 exists() throws exeption on existing but locked file on wind danielw 1044 Argument pack inaccessable in a functions return type danielw 1054 Parameter takes an "infinite" amount of time to compile with the Intel compiler. danielw 1097 keyword.hpp generates many warnings C4180: qualifier applied to function type has no meaning; ignored dave 1010 linking boost.python on freebsd dave 1019 iterator_facade::pointer should be the return type of operator-> (DR 445) dave 1085 Python rules for compiling in Mac OS X dave 1096 Tutorial needs updating for BBv2 dave 1179 [boost.python] can not export a union in VC2005sp1 dave 1181 [boost.python] can modify enum value dave 865 Use of C++0x keyword as identifier dave 910 gcc strict-aliasing problems with python dgregor 1002 [iostreams] close_impl<closable_tag> does not comply with spec dgregor 1003 [iostreams] copy-paste error in typedefs for wchar multichar_filters dgregor 1011 amd64: #error Boost.Numeric.Interval: Please specify rounding control mechanism. dgregor 1139 [iostreams] Regex filter segfaults when zero matches found dgregor 1140 boost::iostreams linked_streambuf bug dgregor 1149 Minor doc error in basic_null_device dgregor 1164 Floyd Warshall broken with unsigned edge weights dgregor 1185 iostreams::direct_streambuf<T_Tr>::is_open always returns false if output iterator is not null dgregor 1192 [boostbook] problem when two files have the same name dgregor 1199 configure doesn't work with path containing whitespaces (MacOS X) dgregor 1218 Boostbook error when generating documentation for a member typedef with a description dgregor 1232 mapped_file_source::is_open() is broken under windows dgregor 556 Bundled graph properties djowel 1170 Emit Warnings instead of # symbols in the syntax highlighter djowel 1171 Quickbook title output djowel 1172 non-utf djowel 1176 Space after inline code djowel 1206 Escaping from within code? djowel 1235 Admonitions produce invalid nested <para> in DocBook XML djowel 241 Miss " = ParserT()" djowel 314 spirit insert_key_actor.hpp djowel 664 crash in boost::spirit::parse dlwalker 613 boost/crc.hpp uses non-standard conforming syntax doug_gregor 1021 [Graph][reverse_graph] Problem using reverse_graph adapter with an adapted user defined graph doug_gregor 1067 Function needs to use pass-by-reference internally doug_gregor 1076 compile error: disconnecting struct with operator()() doesn't work in VS2005 SP1 doug_gregor 375 LEDA graph adaptors do not handle hidden nodes properly doug_gregor 402 random_vertex/random_edge are unnecessarily inefficient doug_gregor 403 Document copy_component doug_gregor 447 reverse_graph and constness of property maps doug_gregor 708 Dijkstra no_init version should not require VertexListGraph doug_gregor 732 Johnson All-Pairs needs better "no path" information doug_gregor 733 Numbered headers don't work with "preferred" syntax doug_gregor 735 Fruchterman-Reingold grid performance can be improved doug_gregor 736 Const correctness violation doug_gregor 738 Memory leaks with signal::connect? doug_gregor 829 Implicit graph not implement doug_gregor 852 Problem with Boost and GCC 4.1 doug_gregor 891 Bunch of compilation error reported while using function.hpp ebf 965 [doc] boost::variant tutorial - final example uses v1_v2 should be seq1_seq2 ebf 993 Variant should use least common multiple of alignments_ rather than maximum fcacciola 1217 value_initialized leaves data uninitialized_ when using MSVC fcacciola 617 Numeric Conversion Documentation minor bug fcacciola 818 No zero-argument in_place() grafik 1023 inspect grafik 1041 Cygwin requires PATH setting. grafik 1062 Cygwin install stage fails with combination of patches grafik 1128 boost-buil rule does not overrule BOOST_BUILD_PATH grafik 1135 bjam crashes grafik 1146 KAI Referenced in compiler status acknowledgements grafik 1233 Boost website still refers to CVS grafik 431 boost jam problem with parallel builds grafik 546 boost.build needs fixes for HP/UX grafik 616 Boost Jam_ and non english directorys grafik 721 Generated files "@()" don't work in regular expressions. grafik 896 <native-wchar_t>off does not work when build with vc-8.0 grafik 959 linking fails when Boost is compiled with STLport 5.1.* on Linux (names mismatch) grafik 977 bjam crashes when compiled with gcc 4.2 grafik 986 Problem building Python modules on boost 1.34.0 hkaiser 1077 Spirit integer parser does not always detect integer overflow hkaiser 1079 boost-1.34.0 fails to compile. concept checks not satisfied. hubert_holin 162 Cannot compile octonion_test.cpp because of bug in sinc.hpp hubert_holin 647 octonion documentation bug igaztanaga 1080 boost::interprocess win32 global file mapping issue igaztanaga 1210 interprocess::barrier hangs during second use under linux (boost 1.33.1) igaztanaga 1231 interprocess_condition (emulated) hangs after notify_all(). jbandela 283 Compiler error for tokenizer on Solaris jbandela 501 token_iterator::at_end() result is inversed jbandela 665 bug in char_separator jmaurer 351 Diff in state of mersenne_twister gen between GCC3.41 & CW9 jmaurer 819 uniform_int<> with type's maximum availaible range error johnmaddock 1081 Empty string rejected as perl-style regex johnmaddock 1083 boost_regex 1.34.0 uses ICU library without linking to it johnmaddock 1130 GCC -wundef warnings johnmaddock 1148 boost_1_34_1 regex library compile failure on aix with xlv jsiek 416 Spelling of Edmonds-Karp-Algorithm jsiek 575 Calling subgraph::global_to_local on a root graph jsiek 636 strange compiling problem for transitive_closure jsiek 813 concept_check.hpp unused variable warning jsiek 815 remove_edge core dumps on self-circle jsiek 875 No iterator based constructor for adjacency_matrix jsiek 900 graphml reader namespace handling is broken mistevens 688 ublas: bug in mapped_vector_of_mapped_vector nasonov 1220 lexical_cast requires RTTI nasonov 754 boost::any - typeid comparison across shared boundaries nesotto 1145 Small bugs in Boost.Range documentation nesotto 471 boost.range and "const char[]". nesotto 518 [Boost.Range]boost::const_begin calls non-qualified 'begin' nesotto 723 local_time_facet error in VS2005 Win2003 nesotto 730 The ptr_map iterator cannot be dereference to value type nesotto 807 boost::assignment documentation: mathematical "typo" pavol_droba 1152 rle_example fails pdimov 1106 shared_ptr<T> should not convert to shared_ptr<U> when T* doesn't convert to U* pdimov 1108 shared_ptr does not compile under g++ with -fno-rtti pdimov 1243 ODR violation by boost::detail::lightweight_mutex pdimov 997 error in boost::bind doc ramey 1036 assert failure in oserializer.hpp:418 ramey 1038 "<" and ">" should be excaped in xml_oarchive ramey 1086 Serialization of weak_ptr produces invalid XML ramey 1089 missing boost::serialization::make_nvp in pointer container library ramey 1121 xml_archive_exception is missing seperate header file_ and documentation mismatch ramey 1137 Virtual destructor is missing ramey 1141 Dangerious operator<< for wostream ramey 1142 boost/serialization/optional doesn't include necessary header ramey 1223 boost::serialization chokes on correcly formatted empty XML element ramey 757 xml serialization fails when using namespace ramey 878 error C2039: 'mbstate_t' : is not a member of 'std' ramey 961 boost::basic_binary_oprimitive not instantiated correctly ramey 968 xml_grammar - incorrect define char ramey 969 basic_binary_iprimitive::load_binary bug rogeeff 1030 execution_monitor.ipp #warning directive breaks compilation on MSVC 8.0 rogeeff 1032 typo in Boost.Test documentation rogeeff 1050 BOOST_CHECK_CLOSE_FRACTION documentation missing rogeeff 1060 no example sources in online docs for Boost::Test rogeeff 1212 Template fixtures rogeeff 607 Log level names wrong in documentation rogeeff 842 typo in auto_unit_test.hpp Revision 1.17 rogeeff 893 grammatical error in error message rogeeff 956 Doc error in test examples. rogeeff 962 Missing links in Test library documentation samuel_k 585 64 bit compile warning/error for boost::format samuel_krempp 1195 patch: boost/format/parsing.hpp does not compile if BOOST_NO_LOCALE_ISDIGIT is defined samuel_krempp 1196 Patch: when BOOST_NO_STD_LOCALE is not defined_ boost/format/internals.hpp fails to compile. samuel_krempp 704 format zero length string msvc-8 samuel_krempp 859 boost::format ignores a user defined locale shammah 284 pool::purge_memory() does not reset next_size shammah 290 perfomance: memory cleanup for pool takes too long shammah 386 boost::pool_allocator breaks with vector of vectors shammah 88 ct_gcd_lcm.hpp compilation error speedsnail 1138 Problems with TSS and static thread library t_schwinger 1100 Building boost.function_types fails cvs rev-1.1_ no chdir command in bash turkanis 525 problem with boost::iostreams when compiled with Visual C++ turkanis 699 Changing size of memory-mapped file on Windows turkanis 786 bug in iostreams/copy.hpp line 81 turkanis 791 iostreams::tee_filter is for output only turkanis 817 Performance problem in iostreams turkanis 822 Incorrect usage of bad_write()_ bad_seek() etc. turkanis 856 iostreams file_descriptor::write fails under Win32 urzuga 574 [boost::lambda] Compile error with libstdc++ debug mode urzuga 781 Lambda: (_1 + "y")(string("x")) Doesn't Compile vladimir_prus 1165 more quoting problems vladimir_prus 1228 bug in toolset gcc + HP/UX PA-RSIC vladimir_prus 469 multitoken broken vladimir_prus 689 [program_options] Endless loop with long default arguments witt 1046 Boost.Python quickstart instructions mention nonexistent target witt 834 Homepage regression links witt 957 The "Getting Started" page does not mention the stdlib option witt 973 zip_iterator has value_type == reference -- -- Marshall Marshall Clow Qualcomm, Inc. <mailto:mclow@qualcomm.com> The famous British scientist, Lord Kelvin, said: "When you measure what you are speaking about and express it in numbers, you know something about it, but when you cannot (or do not) measure it, when you cannot (or do not) express it in numbers, then your knowledge is of a meagre and unsatisfactory kind."

1 0

[serialization][trunk] please bring us archive helpers back
by Joaquín Mª López Muñoz 10 Sep '07

10 Sep '07

Hello, Boost.Serialization 1.33-1.34 introduces the notion or "helpers" to the Archive interface by means of the member functions: void lookup_helper( const extended_type_info* const eti, shared_ptr<void>& sph); void insert_helper( const extended_type_info* const eti, shared_ptr<void>& sph); which allow the user to make an archive instance store arbitrary helper objects associated to any given type. This helper interface is used to implement serialization of boost::shared_ptr in a non-intrusive way, which was impossible for former versions of Boost.Serialization. This is a wonderful addition to the library because not only solves the old problem with serializating shared_ptr but also serves as a general utility for implementing complicated serialization schemes, notably those in which internal resources are serialized which cannot be directly manipulated from the class public interface. I have used archive helpers to good effect in implementing an otherwise unfeasible serialization algorithm for a library I'm writing, but when I moved from Boost 1.34 to the SVN trunk I discovered to my dismay that this (admittedly undocumented) feature has been removed in favor of an ad-hoc extension of the Archive interface (internally based on something resembling the former helper code) to specifically allow serialization of boost::shared_ptr. IMHO this is a step back because it singles out shared_ptr as a type receiving special attention (vg. what will happen with std::tr1::shared_ptr, will the interface be augmented again to cope with this?) and primarily because it deprives us developers from a very very powerful tool. Could the helper interface please please be brought back to Boost.Serialization? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 10

Re: [boost] How to download Functional module of Fusion 2 ???
by dan marsden 10 Sep '07

10 Sep '07

>In particular I'm looking for >#include <boost/fusion/functional/invocation/invoke_procedure.hpp> You'll need to download the latest stuff from the boost svn trunk to get the functional library, and other enhancements to Fusion added since the review. <snip lots of problems finding the latest code> >Not exactly what you would call "user friendly".... Fusion is not in Boost 1.34.x as it was reviewed too late for that release. It will in incorporated in 1.35. As it's not yet officially in a boost release that may explain the difficulty finding it you had above. Hopefully we'll get more user friendly after that. Cheers Dan ___________________________________________________________ Want ideas for reducing your carbon footprint? Visit Yahoo! For Good http://uk.promotions.yahoo.com/forgood/environment.html

3 3

Release Team?
by Rene Rivera 09 Sep '07

09 Sep '07

Just catching up after a week vacation... I had a quick conversation on IRC with Volodya where he mentioned a rather appealing idea which happened to coincide with a similar idea I was having. He mentioned the idea of a "release team" to hammer out the specifics of the new release procedures. Now what I was thinking of... For a while now I've been considering volunteering to manage a release. But I came to some obvious observations, and others pointed out similar thoughts: * Being a release manager is a lot of work because of the size and scope of Boost. * There's a lot of learning involved for each new manager. In the form of learning the process and tools to get the release completed. * It seems we are expecting the manager to both manage releases, and to advance the development of the release procedures. This is not new to this release cycle. AFAICT most release managers have "fine tuned" the release process as part of their work. * If we are going to expect another Boost release, with something more than just patches, in the near future we have to start a release cycle now. * As a body of volunteers, no one person has enough "free time" to devote to managing a release. Particularly if that same person is also dealing with development of a Boost component. For 1.35 the release manager is going to face not just fine tuning the process, but overhauling it. The repository changed, the process is changing, and the tools are changing. Additionally, from my POV, the discussions about the new release process don't seem to be progressing at a quick enough pace. This made me realize it would be unrealistic for me to devote the need time that being a release manager would require. So the simple idea is to have a "Release Team" instead of a "Release Manager" to distribute the work and hopefully smooth out the attention a release gets. The dynamic would be: * A release team is composed of three people. Yes, it's an arbitrary number, hence it only feels right because of the expected amount of work 1.35 is likely to be. For later releases two people might be enough. * The goal is for the team to have a good spread in understanding of the release process. And hence we should prefer picking, when possible, people with knowledge of the management, building, and testing aspects of the process. * The members of the team are free to decide how they split up the work. But we should encourage working on all aspects to advance the spread of the release process know-how. * A member signs on for two consecutive releases, in a staggered order. The obvious exception being the first few releases where one or more would only do one release. This reduces the ramping up time a single release manager would go through, hence keeping the releases going smoothly. Does this sounds like an idea worth pursuing, i.e. running with for this release? Seeing as we really need to get moving on some process decisions if we want to see a release for 2008/01! -- -- 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

7 8

[atomic_count] Discrepancy between gcc and solaris implementation
by Corrado Zoccolo 09 Sep '07

09 Sep '07

Hi boosters, when performance tuning a really tight loop in a simple program, I found that reading the value of an atomic count is unexpectedly slow on a gcc platform. I checked the code, and the implementation used, (I have a checkout of some month ago of boost HEAD, when there was still the cvs in place), is: operator long() const { return __exchange_and_add(&value_, 0); } I checked other implementations, and for example solaris has the much lighter: operator uint32_t() const { return static_cast<uint32_t const volatile &>( value_ ); } Is there a compelling reason to use the locked operation with gcc, or a simpler volatile access can serve the same purpose? A simple test program shows a large overhead for the locked operation. #include <boost/timer.hpp> #include <boost/detail/atomic_count.hpp> #include <iostream> namespace cz { using __gnu_cxx::__atomic_add; using __gnu_cxx::__exchange_and_add; class atomic_count { public: explicit atomic_count(long v) : value_(v) {} void operator++() { __atomic_add(&value_, 1); } long operator--() { return __exchange_and_add(&value_, -1) - 1; } operator long() const { return static_cast<_Atomic_word volatile const &>(value_); } private: atomic_count(atomic_count const &); atomic_count & operator=(atomic_count const &); mutable _Atomic_word value_; }; } int main(int argc, char **argv) { { boost::timer t; for(boost::detail::atomic_count i(0);i<10000000;++i); std::cout<<t.elapsed()<<std::endl; } { boost::timer t; for(cz::atomic_count i(0);i<10000000;++i); std::cout<<t.elapsed()<<std::endl; } } Compiled with g++ -O3, and run on a Linux box equipped with Pentium IV 2.8GHz (HT disabled), I obtain the following result: [corrado@et2 test]$ ./a.out 1.4 0.75 i.e. the "for" that uses the volatile access is almost twice as fast than the other one. Do you see any drawback in changing the access to the counter to a simple volatile access, at least when the platform is known to be an IA32? Corrado -- __________________________________________________________________________ dott. Corrado Zoccolo mailto:zoccolo@di.unipi.it PhD - Department of Computer Science - University of Pisa, Italy --------------------------------------------------------------------------

2 1

Re: [boost] [intrusive] Looking for a non-recursive structural tree cloning algorithm
by Steven Watanabe 09 Sep '07

09 Sep '07

AMDG Ion Gazta?aga <igaztanaga(a)gmail.com> wrote: > So if you are a tree expert, I need your help to get a tree cloning > function, that: > > * Does not use the comparison predicate or calls any function that uses > it (e.g.: insert()) > > * Can destroy all constructed nodes in a non-recursive form if > node-copying throws an exception. > > * It's pretty efficient ;-) > > Willing to help? > > Ion > > warning untested: node* current = root; node* new_root = 0; node* insertion_point = 0; insertion_point = new_root = copy_node(*current); // sets the links to zero try { while(true) { if(current->left != 0 && insertion_point->left == 0) { current = current->left; node* temp = insertion_point; insertion_point = copy_node(*current); insert_at_left(temp, insertion_point); } else if(current->right != 0 && insertion_point->right == 0) { current = current->right; node* temp = insertion_point; insertion_point = copy_node(*current); insert_at_right(temp, insertion_point); } else { if(current == root) break; current = current->parent; insertion_point = insertion_point->parent; } } } catch(...) { destroy_tree(new_root); throw; } In Christ, Steven Watanabe

2 2

[proto] Calculator Arity Transform and function varargs
by Felipe Magno de Almeida 08 Sep '07

08 Sep '07

Hi, I can't make it out how to do the arity transformation for proto::functions varargs too. Could anybody shed some light? Thanks and best regards, -- Felipe Magno de Almeida

2 3

boost::any visitor of known types
by Christian Holmquist 08 Sep '07

08 Sep '07

Hello all, Is there any visitor mechanism somewhere in boost that allows one to introspect the contained type of a boost::any? I've been using boost::variant frequently and I love the way its visitor works, but it's not always practical to know all possible types at compile time (library dependencies, compilation time etc..). I thought something similiar for boost::any, and I put together a small test: any_variant<T0, T1, T2> any_of_type_T0_T1_T2; It allows visitation of the types given as template parameters. A trivial example would be struct print_visitor { template<class T> void operator()(const T& x) const { std::cout << x <<std::endl; } }; void test() { typedef any_variant<int, float, std::string> any_types; boost::any a; any_types v(a); a = (int) 35; v(print_visitor()); a = std::string("str"); v(print_visitor()); a = (double) 45.0; v(print_visitor()); } // prints 35 str Also the example from boost::any docs, class consumer { public: virtual void notify(const any &) = 0; ... }; could be implemented like class my_consumer : public consumer { virtual void notify(const any &a) { any_variant<msg0, msg1> av(a); av(*this); } void operator()(const msg0&); void operator()(const msg1&); } The implementation is very basic, it just iterates over the types and compares typeids. If a match is found it calls the visitor and returns true, otherwise false. Does anyone else have a use for this, or have another solution at hand? Best regards, Christian #include <boost/any.hpp> #include <boost/mpl/begin.hpp> #include <boost/mpl/end.hpp> #include <boost/mpl/deref.hpp> #include <boost/mpl/vector.hpp> #include <boost/preprocessor/cat.hpp> #include <boost/preprocessor/control/expr_if.hpp> #include <boost/preprocessor/repetition/enum.hpp> #include <boost/preprocessor/repetition/enum_params.hpp> namespace detail { template<bool done = true> struct typeitr_loop { template<typename Iterator, typename LastIterator, typename Visitor> static bool invoke(boost::any&, Visitor) { return false; } }; template<> struct typeitr_loop<false> { template<typename Iterator, typename Last, typename Visitor> static bool invoke(boost::any& a, Visitor v) { typedef boost::mpl::deref<Iterator>::type type; if(typeid(type) == a.type()) { v(*boost::unsafe_any_cast<type>(&a)); return true; } else { typedef boost::mpl::next<Iterator>::type itr; return typeitr_loop<boost::is_same<itr, Last>::value>::invoke <itr, Last>(a, v); } } }; template<class Types, class Visitor> inline bool visit_any_type(boost::any& a, Visitor f) { typedef typename boost::mpl::begin<Types>::type first; typedef typename boost::mpl::end<Types>::type last; return detail::typeitr_loop<boost::is_same<first, last>::value>::invoke <first, last>(a, f); } } // // Preprocessor code copied from <boost/multi_index/indexed_by.hpp> // #ifndef ANY_VISITOR_LIMIT_TYPES #define ANY_VISITOR_LIMIT_TYPES 10 #endif #define ANY_VISITOR_TEMPLATE_PARM(z,n,var) \ typename BOOST_PP_CAT(var,n) BOOST_PP_EXPR_IF(n,=boost::mpl::na) template < BOOST_PP_ENUM( ANY_VISITOR_LIMIT_TYPES, ANY_VISITOR_TEMPLATE_PARM,T) > class any_variant { boost::any& any_; public: typedef boost::mpl::vector<BOOST_PP_ENUM_PARAMS(ANY_VISITOR_LIMIT_TYPES,T)> types; any_variant(boost::any& a) : any_(a) {} typedef bool result_type; template<class Visitor> bool operator()(Visitor v) const { return detail::visit_any_type<types>(any_, v); } }; #undef ANY_VISITOR_TEMPLATE_PARM #undef ANY_VISITOR_LIMIT_TYPES

2 1

How to download Functional module of Fusion 2 ???
by Marco Costalba 08 Sep '07

08 Sep '07

It seems is not included in the files you can download from http://spirit.sourceforge.net/dl_more/fusion_v2/ In particular I'm looking for #include <boost/fusion/functional/invocation/invoke_procedure.hpp> BTW fusion 2 is not bundled with the boost_1_34_1.tar.bz2 you get from sourceforge, so to be able to have a complete fusion library an user is supposed to walk: boost.org --> download boost_1_34_1.tar.bz2 from sourceforge --> (surprise! fusion is not in) --> google ---> spirit.sourceforge.net/dl_more/fusion_v2/ ---> (surprise! functional module is not in) ---> google again ----> pain!! -> ask to mailing list ---> ??? Not exactly what you would call "user friendly".... Interesting enough the corresponding documentation is much easier to find: http://spirit.sourceforge.net/dl_more/fusion_v2/libs/fusion/doc/html/index.… Thanks for any help to find this well hidden link. Marco

1 0

[test] BOOST_CHECK_NOT_EQUAL wanted
by Kevin Sopp 08 Sep '07

08 Sep '07

Hello, I found this old thread http://lists.boost.org/boost-users/2006/06/20028.php where it said bring up the issue again after 1.34 is released. I intuitively expected a BOOST_CHECK_NOT_EQUAL to exist and typed it in, but it wasn't there! So, here's one more person requesting macros for all comparison operators for the test tools. regards, Kevin Sopp

6 9