August 2005 - Boost - lists.preview.boost.org

[Boost-bugs] [ boost-Bugs-1255637 ] 1.33RC2: archive_pointer_[o/i]serializer assert problem
by SourceForge.net 10 Aug '05

10 Aug '05

Bugs item #1255637, was opened at 2005-08-10 02:36 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1255637&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: serialization Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Robert Ramey (ramey) Summary: 1.33RC2: archive_pointer_[o/i]serializer assert problem Initial Comment: Hello again, FYI .. i read the boost mailing list, so posting anwers there is ok for me ;-) I made some progress after reading "rationale" though some things still give headaches. I have polymorphic class hierarchy which gets serialized thru base ptrs (along with shared_ptr stuff). When using portable_binary_oarchive/iarchive (taken from boost example) an assert() triggers which raises some questions. oserializer.hpp: -------------- snip -------------- // sice true_type is valid, and this only gets made if the // pointer oserializer object has been created, this should never fail bpos_ptr = archive_pointer_oserializer<Archive>::find(* true_type); assert(NULL != bpos_ptr); if(NULL == bpos_ptr) boost::throw_exception( archive_exception(archive_exception::unregistered_class) ); -------------- snip -------------- "should never fail" seems to fail and i dont know why ;-( (long callstack omitted) > test_protocollayers.exe!boost::archive::detail::save_pointer_type<portable_binary_oarchive,xxx::ProtocolHeader const *>::polymorphic<xxx::ProtocolHeader>::save(portable_binary_oarchive & ar={...}, const xxx::ProtocolHeader & t={...}, const boost::archive::detail::basic_pointer_oserializer * bpos_ptr=0x00000000) Line 416 C++ test_protocollayers.exe!boost::archive::detail::save_pointer_type<portable_binary_oarchive,xxx::ProtocolHeader const *>::save<xxx::ProtocolHeader>(portable_binary_oarchive & ar={...}, const xxx::ProtocolHeader & t={...}, const boost::archive::detail::basic_pointer_oserializer * bpos_ptr=0x00000000) Line 438 + 0x11 C++ test_protocollayers.exe!boost::archive::detail::save_pointer_type<portable_binary_oarchive,xxx::ProtocolHeader const *>::invoke(portable_binary_oarchive & ar={...}, const xxx::ProtocolHeader * const t=0x00680698) Line 466 + 0x11 C++ test_protocollayers.exe!boost::archive::save<portable_binary_oarchive,xxx::ProtocolHeader const *>(portable_binary_oarchive & ar={...}, const xxx::ProtocolHeader * const & t=0x00680698) Line 535 + 0xf C++ The classes usually contain: "template<class Archive> void serialize( Archive & ar, const unsigned int /* version */)" stuff, along with explicit: "boost::serialization::void_cast_register<Derived, Base>(0,0);" in ctors (or it doesnt work). "this_type" = abstract base "true_type" = derived both classes are successfully retrieved via type info (registered class). The "vp = serialization::void_downcast(*true_type, *this_type, &t);" works too (because the void_cast_register). But it doesnt find appropriate basic_pointer_oserializer .... I placed a breakpoint at "basic_serializer_map::insert(const basic_serializer * bs)" to see what types get registered at startup (initterm ctors). There are indeed registrations but some (derived) types are missing. What gives? BTW ... could you make "portable_binary_oarchive" (and iarchive) included in available boost archive types? I find it useful because serialization is used in cross platform protocol stacks (little vs. big endian archs). Is there any chance to reduce binary overhead due to registration data (shared_ptr/type info ... binary size almost doubled due to contained type info in small payloads). Can stringified type info be omitted/shortened (i use hierachial namespaces which blow the length)? Regards, A. Focht ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1255637&group_… ------------------------------------------------------- SF.Net email is Sponsored by the Better Software Conference & EXPO September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

2 1

[serialization] two problems
by Vladimir Prus 10 Aug '05

10 Aug '05

Hi, after "cvs up" is run into two new problems with serialization. First is missing include, patch attached. The second is this: gcc.compile.c++ ../../../src/runtime/bin/gcc/debug/threading-multi/runtime_standalone.o In file included from /space/NM/boost/boost/archive/detail/iserializer.hpp:47, from /space/NM/boost/boost/archive/basic_binary_iarchive.hpp:36, from /space/NM/boost/boost/archive/binary_iarchive.hpp:21, from ../../../src/runtime/runtime_standalone.cpp:14: /space/NM/boost/boost/serialization/is_abstract.hpp:30: error: redefinition of `struct boost::is_abstract<T>' /space/NM/boost/boost/type_traits/is_abstract.hpp:130: error: previous definition of `struct boost::is_abstract<T>' The second patch addresses this problem, but I'd also suggest to remove boost/serialization/is_abstract.hpp to avoid further problems. This happens in CVS HEAD, but I suspect the same problems might be present on release branch, and so should be merged there. - Volodya

2 5

[format] Inconsistency with printf
by martin.ecker＠tab.at 10 Aug '05

10 Aug '05

1 0

Re: [boost] alignment problem in proposed any alternative
by Martin Bonner 10 Aug '05

10 Aug '05

----Original Message---- From: christopher diggins [mailto:cdiggins@videotron.ca] Sent: 10 August 2005 06:30 To: Boost mailing list Subject: [boost] alignment problem in proposed any alternative > The question I have is whether in practice though are there are any > compilers which have stricter alignment requirements on small types > (<= sizeof(void*)) than a void pointer. I don't know of any such compilers, but I /can/ conceive of such. A (16-bit) word addressed machine where sizeof(int*) is 4 but sizeof(void*) is 6 might have the required alignment of int be 4, but the required alignment of void* only be 2 :-( On the other hand, it might be acceptable to say "boost::any" is not supported on such machines. -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 441434

1 0

Re: [boost] Improved boost::any
by felipe 10 Aug '05

10 Aug '05

hello and good day to all, Well, I posted earlier about this, but yes, if you are going make a decent "any" with stack-allocation, you should let the maximum buffer size be variable. I didn't go into details about alignment or exceptions because I think it's pretty much old news. (In his article "Discriminated Unions", Andrei Alexandrescu considers all of this, however I don't totally agree with his implementation--too hairy for the 9-to-5 programmer.) My own recommendation is that both alignment and buffer size be adjustable. By default they should have sensible values. For example, 8 for both gives decent results on a lot of platforms, although you could do better with the help of sizeof and alignment_of. Besides simplifying the class definition, letting the programmer tweak alignment can be useful for types that can benefit from extra alignment. An example might be a character array--it only "needs" byte alignment, but maybe all of the string operations are tweaked for 32-bit alignment. Somebody made a rather interesting question, whether an object having size less than void * might need alignment greater than void *. Well, about the only maxim the C/C++ standards give is that alignment is platform dependent. In practice, I've never seen such a strange case. I think that sizeof(X) <= sizeof(Y) is a pretty good indicator that alignment(X) <= alignment(Y). (But remember, "minimum-acceptable" alignment is not the same as "optimum" alignment--my pentium lets me store and fetch a double at 0xDEADBEEF, but these operations aren't cheap!) Also, be careful with alignment_of: I remember it giving me some strange values on some illegal but idiomatic structures (e.g. zero-length arrays). If it gives you zero, put 8 or something you think is sensible. hope this helps On Tue, 09 Aug 2005 18:07:06 +0200, <boost-request(a)lists.boost.org> wrote: > Date: Tue, 09 Aug 2005 10:17:48 -0400 > From: christopher diggins <cdiggins(a)videotron.ca> > Subject: Re: [boost] Improved boost::any > To: boost(a)lists.boost.org > Message-ID: <026101c59ced$1ee4a3d0$2b792518@heronnest> > Content-Type: text/plain; format=flowed; charset=iso-8859-1; > reply-type=original > ----- Original Message ----- > From: "Vladimir Prus" <ghost(a)cs.msu.su> >> >> If the trick is to use "void*" pointer to data for storing data when >> it's >> small, then: >> >> - it's interesting to see performance comparison for any<string>, or >> any<some_other_large_class> > Another part of the optimization, is to avoid reallocating when > reassigning > any a different value with the same type. > On a related note: several people have suggested that a buffer should be > used with an arbitrary size set at compile time, which would help > significantly for container types. > >> - can't this be just patch to boost::any, as opposed to completely >> different >> class? > What does submitting a patch entail? Is that the way to go if the > implementation is completely different? > - Chriostopher Diggins -- Using Opera's revolutionary e-mail client: http://www.opera.com/m2/

1 0

[Boost-bugs] [ boost-Bugs-1254062 ] 1.33 RC2: polymorphic stuff broken further??
by SourceForge.net 10 Aug '05

10 Aug '05

Bugs item #1254062, was opened at 2005-08-08 03:12 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1254062&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: serialization Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Robert Ramey (ramey) Summary: 1.33 RC2: polymorphic stuff broken further?? Initial Comment: Hello again, i just downloaded 1.33 RC2 and noticed polymorphic serialization doesnt work for my projects anymore. These errors are new and different from RC1 (which didnt work too, but 1.32 works). I cant get it compile anymore (static compile time asserts and others)... I even loaded up the provided sample boost ser. projects and notice there are similar errors too (from libs\serialization\vc7ide\*.sln) ---- demo_exception demo_exception.cpp e:\SDK\Boost\boost_1_33_0_RC2\libs\serialization\vc7ide\..\..\..\boost\archive\detail\oserializer.hpp(566) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] e:\SDK\Boost\boost_1_33_0_RC2\libs\serialization\vc7ide\..\..\..\boost\archive\detail\oserializer.hpp(566) : see reference to class template instantiation 'boost::STATIC_ASSERTION_FAILURE<x>' being compiled with [ x=false ] e:\SDK\Boost\boost_1_33_0_RC2\libs\serialization\vc7ide\..\..\..\boost\archive\basic_text_oarchive.hpp(78) : see reference to function template instantiation 'void boost::archive::save<Archive,T>(Archive &,T & )' being compiled with [ Archive=boost::archive::text_oarchive, T=School * ] e:\SDK\Boost\boost_1_33_0_RC2\libs\serialization\vc7ide\..\..\..\boost\archive\detail\interface_oarchive.hpp(85) : see reference to function template instantiation 'void boost::archive::basic_text_oarchive<Archive>::save_override<T>(T & ,int)' being compiled with [ Archive=boost::archive::text_oarchive, T=School * ] \SDK\Boost\boost_1_33_0_RC2\libs\serialization\example\demo_exception.cpp(219) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_oarchive<Archive>::operator <<<School*>(T & )' being compiled with [ Archive=boost::archive::text_oarchive, T=School * ] (iserializer is same problem:) Boost\boost_1_33_0_RC2\libs\serialization\vc7ide\..\..\..\boost\archive\detail\iserializer.hpp(544) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' (similar to error in my projects) These errors go away if i make objects to be serialized "const" e.g. (for the sample) school* const .. ???? This "constness" constraint didnt show up in 1.32. It is especially difficult to enforce it if you serialize members with "ar & m1 & m2 .. " notation. ----- demo_shared_ptr: Boost\boost_1_33_0_RC2\libs\serialization\example\demo_shared_ptr.cpp(138) : error C2039: 'sp_counted_base_impl' : is not a member of 'boost::detail' Boost\boost_1_33_0_RC2\libs\serialization\example\demo_shared_ptr.cpp(138) : error C2061: syntax error : identifier 'sp_counted_base_impl' .... There are some errors with invalid project references and library names at all (linker errors, tries to link with wrong libs). It seems the project files are out of sync for long time. ---------------- Additionally: boost\boost\archive\detail\interface_iarchive.hpp(73) : error C2039: 'basic_iarchive' : is not a member of 'boost::archive::polymorphic_iarchive' boost\boost\archive\polymorphic_iarchive.hpp(52) : see declaration of 'boost::archive::polymorphic_iarchive' boost\boost\archive\detail\interface_iarchive.hpp(72) : while compiling class-template member function 'void boost::archive::detail::interface_iarchive<Archive>::lookup_helper(const boost::serialization::extended_type_info *const ,boost::shared_ptr<T> &)' boost\boost\archive\detail\interface_iarchive.hpp(73) : error C2662: 'boost::archive::detail::basic_iarchive::lookup_basic_helper' : cannot convert 'this' pointer from 'boost::archive::polymorphic_iarchive' to 'boost::archive::detail::basic_iarchive &' Reason: cannot convert from 'boost::archive::polymorphic_iarchive' to 'boost::archive::detail::basic_iarchive' Conversion requires a second user-defined-conversion operator or constructor This is my include list (i use precompiled header): ... #include "boost/archive/polymorphic_oarchive.hpp" #include "boost/archive/polymorphic_iarchive.hpp" #include "boost/serialization/shared_ptr.hpp" #include "boost/serialization/serialization.hpp" #include "boost/serialization/utility.hpp" #include "boost/serialization/list.hpp" #include "boost/serialization/version.hpp" #include "boost/serialization/map.hpp" #include "boost/serialization/vector.hpp" #include "boost/serialization/string.hpp" #include "boost/serialization/split_member.hpp" (i had to move "boost/serialization/shared_ptr.hpp" backwards after "archive" headers in contrast to 1.32) These 1.33 poly serialization bugs are big showstoppers for us because we extensively use serialization. If they remain, 1.33 will have to be skipped... Regards, A. Focht ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1254062&group_… ------------------------------------------------------- SF.Net email is Sponsored by the Better Software Conference & EXPO September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

3 4

Custom allocator for shared_ptr
by Dave 10 Aug '05

10 Aug '05

Hello all, I assume that the reference count object pointed to by shared_ptr objects is on the heap. Is there a way that I can specify a custom allocator for shared_ptr to use for this purpose? Thanks, Dave

4 3

[mpl] sort algorithm complexity
by Felipe Magno de Almeida 10 Aug '05

10 Aug '05

In the page it is informed that sort has an average complexity of O(nlog n), but I'm writing this: template <typename T, typename U> struct sort_hierarchy_pred : mpl::not_< boost::is_base_and_derived<T, U> >::type { }; typedef mpl::back_inserter< mpl::vector<> > aux_in; template <typename SequenceT> struct sort_hierarchies : public mpl::sort<SequenceT, typename mpl::lambda<sort_hierarchy_pred<mpl::_, mpl::_> >::type , aux_in> {}; and for a sequence of 5 or more, the compile time and memory usage gets too huge. To became unuseable. What I'm trying to achieve is a sequence of types that are sorted with the bases first... Could anybody shed some light why and if there's some workaround this? thanks in advance, Felipe. -- Felipe Magno de Almeida Developer from synergy and Computer Science student from State University of Campinas(UNICAMP). Unicamp: http://www.ic.unicamp.br Synergy: http://www.synergy.com.br "There is no dark side of the moon really. Matter of fact it's all dark."

3 10

Problem with writing a dijkstra_visitor
by Fabian Buske 09 Aug '05

09 Aug '05

Hi, I'm trying to write a dijkstra visitor, that sets the weight of an egde to the maximum value after assigning it to a minimum spanning tree. The visitor is created according to the bacon sample: template <typename WeightMap> class special_dijkstra_visitor : public boost::default_dijkstra_visitor { public: special_dijkstra_visitor(WeightMap& w):default_dijkstra_visitor(),weight_map_(w){}; template <typename Edge, typename Graph> void edge_relaxed(Edge e, Graph& g) { weight_map_[e] = DBL_MAX; } template <class Edge, class Graph> void edge_not_relaxed(Edge e, Graph& g) { weight_map_[e] = DBL_MAX; } private: WeightMap weight_map_; }; // Convenience function template <typename WeightMap> special_dijkstra_visitor<WeightMap> visit_special_dijkstra(WeightMap w) { return special_dijkstra_visitor<WeightMap>(w); } The graph based on an adjacency matrix with property<edge_weight_t, double> The visitor is called by: property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g); prim_minimum_spanning_tree(g, root, &p[0], distance, weightmap, indexmap, visitor(visit_special_dijkstra(weightmap))); The linux gnu 3.4.4 compiler gives the following error messages *snip template instance error messages* /zeug/study/OpenMSLibs/CGAL-3.1-gcc-3.4.4/include/boost/graph/dijkstra_shortest_paths.hpp:120: error: ` edge_relaxed' undeclared (first use this function) /zeug/study/OpenMSLibs/CGAL-3.1-gcc-3.4.4/include/boost/graph/dijkstra_shortest_paths.hpp:122: error: ` edge_not_relaxed' undeclared (first use this function) /zeug/study/OpenMSLibs/CGAL-3.1-gcc-3.4.4/include/boost/graph/dijkstra_shortest_paths.hpp:143: error: ` finish_vertex' undeclared (first use this function) ... I'm wondering, cause I thought deriving from default_dijkstra_visitor ensures that finish_vertex is allready implemented. Compiling the bacon sample on the same graph works fine. So I'm really confused. Any hints for debugging the code? Thanks a lot. Regards Fabian

2 1

Boost regression notification (2005-08-09)
by Douglas Gregor 09 Aug '05

09 Aug '05

Boost regression test failures ------------------------------ Report time: 2005-08-09T14:43:35Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_33_0/developer/i… 0 failure in 0 library:

1 0

Re: [boost] Improved boost::any
by Eyal Farago 09 Aug '05

09 Aug '05

I read the code project article and I have few comments: 1. why optimize only for types smaller than void*? you can specify a different max size (bigger than sizeof(void*) and probably a product of it with another integer) to achieve even better results. 2. the implementation is pretty messy and quite dangerous, I'm quite sure it wouldn't compile/work on multimple platforms, and the first one that pops into my mind is solaris which enforce proper alighnment... 3. it is possible to borrow some of the tricks boost::variant uses to achieve correct allignment. i.e. using a boost::variant<void*, char[/*buffer size here*/]> and when the buffer is used store the actual alignment in a member variable of the class. 4. if 3 isn't possible, look at boost::function implementation, but I'm not sure if they're using a buffer or a simple union with a void* and few other types... eyal. -----Original Message----- From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org]On Behalf Of christopher diggins Sent: Tuesday, August 09, 2005 12:49 AM To: Boost mailing list Subject: [boost] Improved boost::any I have developed a type very similar to boost::any which requires less memory and significantly reduces the number of allocations / deallocations. If anyone is interested I have posted a brief article about it at CodeProject http://www.codeproject.com/useritems/dynamic_typing.asp and I have uploaded the source to the vault ( http://boost-sandbox.sourceforge.net/vault/index.php ). Is there any interest? Christopher Diggins http://www.cdiggins.com _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

Re: [boost] Improved boost::any
by felipe 09 Aug '05

09 Aug '05

hello and good day, Yes, this is actually not unlike the my own implementation of "any". But rather than limit myself to objects that fit in sizeof(void *) bytes, I keep an aggregate member whose size is governed by a template parameter with a default value of sizeof(void *). This way I can arbitrarily specify the mininum size at which objects are heap-allocated. I think this is probably the way to go for discriminant unions.. the typelist solution is just to messy for my tastes, and boost::any is too consumptive. Anyone interested? sincerely, Phillip On Tue, 09 Aug 2005 01:49:45 +0200, <boost-request(a)lists.boost.org> wrote: > Message: 19 > Date: Mon, 08 Aug 2005 18:48:39 -0400 > From: christopher diggins <cdiggins(a)videotron.ca> > Subject: [boost] Improved boost::any > To: Boost mailing list <boost(a)lists.boost.org> > Message-ID: <016001c59c6b$51e3e250$2b792518@heronnest> > Content-Type: text/plain; format=flowed; charset=iso-8859-1; > reply-type=original > I have developed a type very similar to boost::any which requires less > memory and significantly reduces the number of allocations / > deallocations. > If anyone is interested I have posted a brief article about it at > CodeProject http://www.codeproject.com/useritems/dynamic_typing.asp and I > have uploaded the source to the vault ( > http://boost-sandbox.sourceforge.net/vault/index.php ). Is there any > interest? > Christopher Diggins > http://www.cdiggins.com > ----------------------------- -- Using Opera's revolutionary e-mail client: http://www.opera.com/m2/

1 0

Re: [boost] cross_iterator
by BARTLETT, Peter, FM 08 Aug '05

08 Aug '05

>Alex wrote: >[cross_iterator] >Please take a look and let me know what you think. A great start but, if I understand correctly, there is a significant difference with how zip_iterator works. The zip_iterator's dereference method returns a tuple of references to the underlying values, whereas your cross_iterator just returns the tuple of iterators themselves. Thus to use cross_iterator with standard algorithms, the user would have to provide a function object that acts on iterators rather than values which is unusual and unintuitive. Thus to me it seems like cross_iterator needs to borrow much of the TMP code from the detail of zip_iterator (assuming the community is happy with how that class works). Conceptually the two classes only differ in the ++ and -- operators. Pete Bartlett *********************************************************************************** The Royal Bank of Scotland plc. Registered in Scotland No 90312. Registered Office: 36 St Andrew Square, Edinburgh EH2 2YB. Authorised and regulated by the Financial Services Authority This e-mail message is confidential and for use by the addressee only. If the message is received by anyone other than the addressee, please return the message to the sender by replying to it and then delete the message from your computer. Internet e-mails are not necessarily secure. The Royal Bank of Scotland plc does not accept responsibility for changes made to this message after it was sent. Whilst all reasonable care has been taken to avoid the transmission of viruses, it is the responsibility of the recipient to ensure that the onward transmission, opening or use of this message and any attachments will not adversely affect its systems or data. No responsibility is accepted by The Royal Bank of Scotland plc in this regard and the recipient should carry out such virus and other checks as it considers appropriate. Visit our websites at: http://www.rbs.co.uk/CBFM http://www.rbsmarkets.com ********************************************************************************

2 1

cross_iterator
by Alex Mendes da Costa 08 Aug '05

08 Aug '05

Hi folks, A cross_iterator is to a zip_iterator as a cross_product is to a dot_product. For example, given two sequences { a, b }, { 1, 2 }, the sequence of tuples generated by a cross_iterator would be { ( a, 1 ), ( b, 1 ), ( a, 2 ), ( b, 2 ) }. I've put my implementation of cross_iterator in the sandbox (cross_iterator.zip @ http://boost-sandbox.sourceforge.net/vault/) There's no documentation yet, but I've included a sample file that demonstrates how to use the new iterator. Please take a look and let me know what you think. Alex

2 2

[Range] Doc typo [in 1.33.0 RC2]
by Pablo Aguilar 08 Aug '05

08 Aug '05

In the FAQ page, the first answer says: "... that a sub_range do propagate const-ness" ^^ I believe it should say "does" Pablo

2 1

Boost regression notification (2005-08-08)
by Douglas Gregor 08 Aug '05

08 Aug '05

Boost regression test failures ------------------------------ Report time: 2005-08-08T14:56:20Z This report lists all regression test failures on release platforms. WARNING: The following libraries have failing regression tests but do not have a maintainer on file. Once a maintainer is found, add an entry to libs/maintainers.txt to eliminate this message. pool Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_33_0/developer/i… 19 failures in 4 libraries: lambda (15) pool (1) rational (2) wave (1) |lambda| algorithm_test: vc-7_1 bind_tests_advanced: vc-7_1 bind_tests_simple: vc-7_1 bind_tests_simple_f_refs: vc-7_1 bll_and_function: vc-7_1 constructor_tests: vc-7_1 control_structures: vc-7_1 exception_test: vc-7_1 extending_rt_traits: vc-7_1 is_instance_of_test: vc-7_1 lambda_cast_test: vc-7_1 member_pointer_test: vc-7_1 operator_tests_simple: vc-7_1 phoenix_control_structures: vc-7_1 switch_construct: vc-7_1 |pool| test_pool_alloc: vc-7_1 |rational| rational_example: vc-7_1 rational_test: vc-7_1 |wave| testwave: vc-7_1

3 2

Boost Library with Socket++ Library :
by Mottengte, Rajeev Kumar 08 Aug '05

08 Aug '05

Hi I tried to use boost library along with Socket++ for network serialization. I have created a socket++ class osockinet which is derived from iostream. I have given this class to boost archive constructor instead of the normal fstream class for archive to redirect to network. Rest of the code is same. I am getting segmentation fault. Can anybody help me on this. It is in Fedora Linux. ThanX & Rgds Rajeev

1 0

Error in Boost.MultiIndex Examples documentation
by Michael Goldshteyn 08 Aug '05

08 Aug '05

Example 6: complex searches and foreign keys See source code. This program illustrates some advanced techniques that can be applied for complex data structures using multi_index_container. Consider a car_model class for storing information about automobiles. On a first approach, car_model can be defined as: struct car_model { std::string model; std:string manufacturer; int price; }; This definition has a design flaw that any reader acquainted with relational databases can easily spot: The manufacturer member is duplicated among all cars having the same manufacturer. --- This definition also has a syntax error that any C++ programmer can easily spot! :) Mike

2 1

[filesystem] path normalization?
by Vladimir Prus 08 Aug '05

08 Aug '05

Hello, suppose I have this: path p = .........; p /= "../../../a/b/c" ; with current CVS version of filesystem I get paths like: bin/gcc/debug/threading-multi/../../../../bin/nm/debug/threading-multi/print_and_set.map which are correct, but it has reduntant elements. Say first ".." undoes "threading-multi" and next ".." undoes "debug" and the path is the same as bin/nm/debug/threading-multi/print_and_set.map which is much smaller, and so better for things like error diagnostic. Any change that filesystem perform such path normalization either during operator/= or as a separator function? TIA, Volodya

2 2

Re: [boost] [intel-9.0] --arg_dep_lookup, BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL and__EDG _VERSION__=304
by JOAQUIN LOPEZ MU?Z 08 Aug '05

08 Aug '05

----- Mensaje original ----- De: John Maddock <john(a)johnmaddock.co.uk> Fecha: Domingo, Agosto 7, 2005 11:39 am Asunto: Re: [boost] [intel-9.0] -- arg_dep_lookup,BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL and__EDG _VERSION__=304 > >Could it be that Intel compilers under Linux also necessitate > >the --arg_dep_lookup compiler switch (which is currently not > >set)? This looks like the only sensible conslusion from > >the facts described. > > Unfortunately *not* setting that switch has no effect on the Win32 > compiler > (at least not as far as this bug is concerned). I have a test > case for this > bug sitting in my "bug-reports" directory so it looks this has > been > submitted to Intel before, as soon as I can boot up Linux again, > I'll verify > that I can reproduce it and have a play around with the command > line > switches. > Thank you! Would you mind reporting your findings back to the list when you get something? Best, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 3

[mpl]suggested addition in vault/cppljevans/mpl/child_i_depth_j.zip
by Larry Evans 08 Aug '05

08 Aug '05

child_i_depth_j allows the traversal of a tree of applications. It's useful for accessing, for example, the i-th superclass of the results of mpl/fold, as demonstrated by the test file: libs/mpl/test/child_i_depth_j_test.cpp included in the zip file mentioned in the subject line. Could this be added to mpl? Is there something I could do to facilitate this addition? -regards Larry

4 9

SF CVS outage, fyi...
by Rene Rivera 07 Aug '05

07 Aug '05

( 2005-08-04 10:34:06 - Project CVS Service ) Starting on 2005-08-09 at 09:00 Pacific, developer CVS service will be offline for a expected period of up to 36 hours to facilitate significant hardware upgrades. Developer CVS service is moving from its current home on a 4 x 700MHz PIII, 500GB RAID5, 4GB RAM host to a new host that has roughly quadruple the I/O performance: a 2 x 2.8GHz Xeon, 1TB RAID5 striped, 8GB RAM host. Further announcements of CVS service improvements will occur in the weeks following this hardware upgrade (CVS sync delay is not yet eliminated, but that is on our list to complete). -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - Grafik/jabber.org

1 0

[1.33.0] Unintentional dependency
by David Abrahams 07 Aug '05

07 Aug '05

I just realized that Boost.Parameter contains a dependency on boost/python/detail/is_xxx.hpp that I meant to fix before release by moving is_xxx.hpp into boost/detail. I'm certainly willing to wait until after 1.33.0 to fix this, but people complained bitterly about dependencies on boost/python/detail/indirect_traits.hpp before I did the same refactorization there. Doug, what do you think? -- Dave Abrahams Boost Consulting www.boost-consulting.com

2 2

Boost regression notification (2005-08-07)
by Douglas Gregor 07 Aug '05

07 Aug '05

Boost regression test failures ------------------------------ Report time: 2005-08-07T15:09:19Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_33_0/developer/i… 0 failure in 0 library:

1 0

Boost regression notification (2005-08-06)
by Douglas Gregor 06 Aug '05

06 Aug '05

Boost regression test failures ------------------------------ Report time: 2005-08-06T15:20:18Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_33_0/developer/i… 12 failures in 1 library: serialization (12) |serialization| test_list_binary_archive: cw-9_5-darwin test_list_binary_archive_dll: cw-9_5-darwin test_list_ptrs_binary_archive: cw-9_5-darwin test_list_ptrs_binary_archive_dll: cw-9_5-darwin test_list_ptrs_text_archive: cw-9_5-darwin test_list_ptrs_text_warchive: cw-9_5-darwin test_list_ptrs_xml_archive: cw-9_5-darwin test_list_ptrs_xml_warchive: cw-9_5-darwin test_list_text_archive: cw-9_5-darwin test_list_text_warchive: cw-9_5-darwin test_list_xml_archive: cw-9_5-darwin test_list_xml_warchive: cw-9_5-darwin

3 2