July 2006 - Boost - lists.preview.boost.org

Re: [boost] [BGL] Graphviz
by Wang Weiwei 14 Jul '06

14 Jul '06

>On Fri, 14 Jul 2006 10:58:00 -0300, Wang Weiwei <wwwang(a)ccsdl.org> wrote: > >> I know BGL is compatible with Graphviz file format. >> and Graphviz is also an open source library. >> >> Is Graphviz ported to windows platform? > >Yes. > >http://www.graphviz.org/Download_windows.php > >Bruno > Thanks! I have downloaded the .src.tgz file and unzipped it. But can only get a .src file instead of an organised folder containing the C++ source files, which is what I expected. ??? More help needed. :-( Thanks again. Max

2 1

[BGL] Graphviz
by Wang Weiwei 14 Jul '06

14 Jul '06

hello, I know BGL is compatible with Graphviz file format. and Graphviz is also an open source library. Is Graphviz ported to windows platform? Thanks Max

2 1

Re: [boost] [asio] has anybody enabled SSL in a large project?
by Scott 14 Jul '06

14 Jul '06

Hey Chris, >Is your program single or multithreaded? Any chance you can boil >it down to a test program? What version of OpenSSL are you >using? It's multithreaded. On the client side, we have one thread that basically starts in the io_service::run() method. Before starting the thread, we attach a async_read() callback handler then start the thread. When the thread receives data, it stores all messages in a global map (locked from a mutex), that all threads have access to. Messages can be received by an application defined message id. After each message is received, it reattaches the async_read() callback handler so the io_service never runs out of work to do. Other threads in the client such as the UI thread share the same socket and can send requests thru the socket. However all replies are handled by the receiver thread. There are other threads as well, but they don't really interact with ASIO. Server The server creates multiple threads to listen for incoming connections. At the end of each ThreadEntry() func is a call to a shared global asio::io_service::run(). These threads do typical server things such as handle incoming requests and send back responses. We also have other threads that are constantly running. As an example, there's a thread that monitors CPU performance. Clients can request a monitor be placed on the CPU activity level and when it changes this thread will immediately send data to client on the change. This is not a typical request/response scenario as the data will be sent to the client at random intervals (as far as the client is concerned) without a corresponding request (other than the initial monitor request). Given some of the scenarios I've described above, do you seen any implementation issues? OpenSSL version is 0.9.8a. I'll attempt to modify the included ASIO SSL example program to better mimic some of the processes we have running. :) Thanks, Scott

2 1

Re: [boost] [asio] has anybody enabled SSL in a large project?
by EMalenfant＠interstarinc.com 14 Jul '06

14 Jul '06

From: viktor kougitko [mailto:klug@apriorit.com] > > From: "Scott" <cheesy4poofs(a)cox.net> > [snip] > > It all seemed great at first, because it seemed to > > seemlessly work. > > But eventually the communications break down. I either get > >asserts in > > my code from unexpected data in the stream, or the client hangs > > waiting for data that never appears or any of several > >different stream > > problems. It's rarely the exact same thing. But it > >eventually always > > fails. Especially on long sustained transfers. > > > > it seems that problem with buffer sizes try to change > asio/ssl/detail/openssl_stream_service.hpp > openssl_stream_service::create > ::BIO_new_bio_pair(&int_bio, 3*8192, &impl->ext_bio, 3*8192); > it helps in my case > I know next to nothing about asio's SSL implementation, but this reference to buffer sizes reminds me of a problem that we saw in a previous version of TAO: http://deuce.doc.wustl.edu/bugzilla/show_bug.cgi?id=1429 The fix in that case was to enable partial writes in open ssl, using SSL_set_mode to enable SSL_MODE_ENABLE_PARTIAL_WRITE and SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER. HTH, Éric

2 1

Interest in a small array count facility?
by Gennaro Prota 14 Jul '06

14 Jul '06

Hi guys, a while ago there was some discussion about incorporating a compile-time array count facility in boost. I also provided an implementation for multidimensional arrays. Is there still interest for this? The benefits over the classical sizeof(array)/sizeof(array[0]) idiom are not overwhelming but at least there's a fair syntactical convenience and, of course, the advantage of unit test integration. If there's interest I can add it, to the utility subdirectory I guess (better suggestions are welcome; I really don't like using utility/ as a sort of repository for anything we have no better place for). --Gennaro.

8 32

Interest in super string class?
by Jeff Garland 14 Jul '06

14 Jul '06

I've been working on a little project where I've had to doing lots of string processing, so I decided to put together a string type that wraps up boost.regex and boost.string_algo into a string type. I also remember a discussion in the LWG about whether the various string algorithms should be built in or not -- well consider this a test -- personally I find it easier built into the string than as standalone functions. You can download from the string/text processing part of the vault: http://tinyurl.com/dbcye Below is the summary and motivating code example. Enjoy, Jeff -------------------------------------------------------------------------- Souped up string class that includes fancy query, replacement, and conversion functions. This type has the following main goals: * Is a drop-in replacement convertable to std::string and std::wstring * Provide case conversions and case insensitive comparison * Provide white space triming functions * Provide a split functions to parse a string into pieces base on string or regex * Provide sophisticated text replacement functions based on strings or regex * Provide append and insert functions for types Overall, this class is mostly a convience wrapper around functions available in boost.string_algo and boost.regex. This is best illustrated with some code: super_string s(" (456789) [123] 2006-10-01 abcdef "); s.to_upper(); cout << s << endl; s.trim(); //lop of the whitespace on both sides cout << s << endl; double dbl = 1.23456; s.append(dbl); //append any streamable type s+= " "; cout << s << endl; date d(2006, Jul, 1); s.insert_at(28, d); //insert any streamable type cout << s << endl; //find the yyyy-mm-dd date format if (s.contains_regex("\\d{4}-\\d{2}-\\d{2}")) { //replace parens around digits with square brackets [the digits] s.replace_all_regex("\$([0-9]+)\$", "__[$1]__"); cout << s << endl; //split the string on white space to process parts super_string::string_vector out_vec; unsigned int count = s.split_regex("\\s+", out_vec); if (count) { for(int i=0; i < out_vec.size(); ++i) { out_vec[i].replace_first("__",""); //get rid of first __ in string cout << i << " " << out_vec[i] << endl; } } } //wide strings too... wsuper_string ws(L" hello world "); ws.trim_left(); wcout << ws << endl; Expected output is: (456789) [123] 2006-10-01 ABCDEF (456789) [123] 2006-10-01 ABCDEF (456789) [123] 2006-10-01 ABCDEF1.23456 (456789) [123] 2006-10-01 2006-Jul-01 ABCDEF1.23456 __[456789]__ [123] 2006-10-01 2006-Jul-01 ABCDEF1.23456 0 [456789]__ 1 [123] 2 2006-10-01 3 2006-Jul-01 4 ABCDEF1.23456 hello world

22 95

Re: [boost] [Boost-users] bug in documentation
by Daryle Walker 14 Jul '06

14 Jul '06

On 7/11/06 4:40 PM, "Ovanes Markarian" <om_boost(a)keywallet.com> wrote: > there is currently a bug in boost::lambda documentation > (<http://www.boost.org/doc/html/lambda/s03.html>). > > Current version: > > template <class T> : public binary_function<T, T, T> > struct plus { > T operator()(const T& i, const T& j) const { > return i + j; > } > }; > > should be: > > template <class T> > struct plus : public binary_function<T, T, T> > { > T operator()(const T& i, const T& j) const { > return i + j; > } > }; Fixed. (Hopefully; this HTML page is generated. There are two possible files it could come from. The first one, $ROOT/libs/lambda/doc/lambda.xml, was already OK. I fixed the second file at $ROOT/libs/lambda/doc/detail/lambda_doc.xml in the trunk as revision 1.15. Please undo this if changing this file was inappropriate. I don't know which of the two Lambda XML doc files is important.) -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com

1 0

STLPort 5.0 configuration
by Robert Ramey 14 Jul '06

14 Jul '06

I'm trying to tweak a couple of tests so that they pass with STLPort 5.0. A part of the test has to be run differently for this platform and I want to detect which version of STLPort I'm running on. Here is the part of the test. This works for STL 4.5.3 but for STLPort 5.0 it doesn't. When I look in config it looks like I should be using // at least one library - MSL notes: it doesn't make much sense // to implement the == operator for hash collections - but goes ahead // does it anyway even though it doesn't seem to work. So sort into // vectors and then compare. Currently, it seems that STLPort versions // greater than 5.0 don't support the == operator on hashed sets #if !defined(_STLPORT_VERSION) || (_STLPORT_VERSION < 0x500) BOOST_CHECK(ahash_map == ahash_map1); #else std::vector< std::pair<random_key, A> > tvec, tvec1; std::copy(ahash_map.begin(), ahash_map.end(), std::back_inserter(tvec)); std::sort(tvec.begin(), tvec.end()); std::copy(ahash_map1.begin(), ahash_map1.end(), std::back_inserter(tvec1)); std::sort(tvec1.begin(), tvec1.end()); BOOST_CHECK(tvec == tvec1); #endif When I look at config infoSTLPort standard library version 0x510 I see __SGI_STL_PORT =0x510 __STL_DEBUG =1 _STLP_DEBUG =1 _STLP_DEFAULT_TYPE_PARAM =1 _STLP_IMPORT_VENDOR_CSTD =1 _STLP_LONG_LONG =long long _STLP_OWN_IOSTREAMS [no value] _STLP_USE_NEW_C_HEADERS [no value] _STLP_USE_OWN_NAMESPACE =1 __GLIBCXX__ =20051201 _GLIBCXX_USE_LONG_LONG =1 _GLIBCXX_USE_C99_MATH =1 _GLIBCXX_USE_C99 =1 _GLIBCXX_USE_LFS =1 _GLIBCXX_HOSTED =1 _GLIBCXX_SJLJ_EXCEPTIONS =1 So it looks like I should have something like: #if !defined__SGI_STL_PORT) || (__SGI_STL_PORT < 0x500) But I'm not sure how this would work with STLPort 4.5.3 What should I be doing. Robert Ramey

1 0

Re: [boost] [BGL] Help Needed
by Wang Weiwei 14 Jul '06

14 Jul '06

Hello Enage, Thank you so much for your help and sample code. One more question is: :-) If MyVPropType and MyEPropType are 2 user-defined typenames already exist that I want the vertex/edge descriptors to map into. e.g. class MyVPropType { std::vector<int> v; std::map<int, std::string> m; } class MyEPropType { double weight; std::string path_name; } And I also need two user types as the vertex/edge descriptors, e.g. -vertex descriptor type class MyVDescriptor { std::pair<int, std::string>; // sth else } -edge descriptor type class MyEDescriptor { std::string name; boost::array<int, 10> array; } (all of the above user types are somewhat complex intentionally but I think this does not matter, is it?) Additionally, while using these user maps, I want also retain the default color map for the vertices. How to write the code (using an adjacency_list graph class)? Thanks again. Max >--- Wang Weiwei wrote: >> > Thanks for your help. Would you pls give me an >> > example showing the usage of internal property >> > map for the vertices and edges? >> >> or, to make the question simpler, how to declare >> an adjacency_list type graph object with internal >> vertex/edge property maps as follows: >> >> vertex descriptor -> MyVpmType >> edge descriptor -> MyEpmType > >struct elem_id_t >{ > typedef boost::vertex_property_tag kind; >}; > >struct edge_id_t >{ > typedef boost::edge_property_tag kind; >}; > >typedef boost::property<elem_id_t, char> > MyVpmType; >typedef boost::property<edge_id_t, std::string> > MyEpmType; >typedef boost::adjacency_list< > boost::listS > , boost::vecS > , boost::directedS > , MyVpmType > , MyEpmType > > > Graph; > >Graph g; > >> And how to access the internal maps to do sum >> get/put operation? > >boost::property_map<Graph, elem_id_t>::type > vertex_map = boost::get(elem_id_t(), g); >boost::property_map<Graph, edge_id_t>::type > edge_map = boost::get(edge_id_t(), g); > > Cromwell D. Enage > > >__________________________________________________ >Do You Yahoo!? >Tired of spam? Yahoo! Mail has the best spam protection around >http://mail.yahoo.com >_______________________________________________ >Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > = = = = = = = = = = = = = = = = = = = = 　　　　　　　　致礼！　　　　　　　　Wang Weiwei 　　　　　　　　wwwang(a)ccsdl.org 　　　　　　　　　　2006-07-14

1 0

Re: [boost] Please don't define a fake"operator<"just for ordered containers
by Sean Parent 13 Jul '06

13 Jul '06

Christoph Ludwig posted the correct reason why std::complex should not have an operator < () defined - sorry, my follow up using addition was poorly constructed. What I am proposing is that std::less should be defined for std::complex. > >> std::less is ambiguous. It could be that you wanted merely the > >> function object representation of operator<, or it could be that > you > >> wanted the default map/set ordering relation. It is not clear which > >> of the two std::less is supposed to be. > > > > If shared_ptr doesn't support operator< it's not a problem, is it? > > The context is: > > - If we had a separate relation for set/map we would use that for > settable/mappable objects. > - Why is a separate relation better than just using less<>? > - Because it is evident from the design of the standard library > that less<> > isn't meant for that, not consciously, at least. > > "What should shared_ptr do" is a separate question. Under the > current status > quo, it defines operator< to order pair< shared_ptr<>, int > as > well. Under > a revised standard, it may well need to do something else, > depending on how > the standard is changed. Why would we have a separate default relation for set/map then std::less? std::less is intended to map to operator <() on the type _or_ to a total ordering for the type if operator <() is not defined. That's what the standard says - it is intentional (Alex would have had operator <() defined even for types such as complex - but couldn't get that through the standard - he was especially concerned with pointer comparisons to separate containers because this is very useful. Not being able to change the language he at least got the change for std::less (not being there this is probably a misrepresentation of history - but the Alex's intent was that a total ordering should be present nearly everywhere) - he was using operator <() even in the cases he new it was "wrong", because there is no operator [glyph for < with a loop at the small end]. I convinced him that std::less<> is a reasonable way to spell [glyph for < with a loop at the small end.] For pair<shared_ptr<>, int> - what makes shared_ptr special? This doesn't work pair<T*, int> today - I don't see why we should special case shared_ptr - especially in a way which should likely change in the future. Rather I'd recommend specializing std::less - note that you could also specialize std::less<> for std::pair<shared_ptr<>, T> (and the two other variants) if this is _really_ a big concern. I haven't run across a need to order pairs with shared_ptr (nor a pair with pointers for that matter). As for what I expect std::greater<> et al. to do - I had that in my earlier 6 point note - they _better_ be defined consistently with std::less. std::less is supposed to be operator <, unless operator < is not defined in which case std::less provides a total ordering. It isn't ambiguous. Sean

4 3

Solaris versions of sp_counted_base and atomic_count by Michael van der Westhuizen
by Peter Dimov 13 Jul '06

13 Jul '06

Michael van der Westhuizen has generously contributed Solaris versions of atomic_count and sp_counted_base. You can find them in the CVS HEAD and as attachments to this message. I haven't applied his patch (also attached) to atomic_count.hpp and sp_counted_base.hpp that would enable them yet, but I plan do so in a couple of days if there are no objections. If you have any suggestions or comments, please let me know; in particular, if you have a better idea how to detect SunOS 5.10 or later, or if you know what memory synchronization guarantees the Solaris atomics are supposed to provide. :-) Thanks in advance for any help or interest, and of course, big thanks to Michael for his contribution.

4 36

iterator_facade and InputIterators
by Richard Smith 13 Jul '06

13 Jul '06

The Standard's table of InputIterator requirements (table 72 in section 24.1) says that, amongst other things, an InputIterator must support the following two expressions: *a Convertible to T, the iterator's value_type a->m Equivalent to (*a).m The same language is present in the "New Iterator Concepts", N1550, documentation in the definition of ReadableIterator. In particular, InputIterators are allowed to, and often do, have operator* returning by value: template <typename T> class my_iterator { public: typedef T value_type; T operator*() const; // ... }; Because it is legal to call non-const member functions on temporary objects, it is legal to call non-const member functions on the value returned from operator*: struct foo { void non_const(); }; my_iterator<foo> i; (*i).non_const(); My reading of Table 72 documentation suggests that this means that for my_iterator<foo> to be a Readable Iterator, it must also be legal to write: i->non_const(); If so, this means that operator-> should return T* instead of T const* (possibly via a proxy class). In the current implementation of boost::iterator_facade, operator-> returns a proxy that acts as a T const*: template <class T> struct operator_arrow_proxy { operator_arrow_proxy(T const* px) : m_value(*px) {} const T* operator->() const { return &m_value; } operator const T*() const { return &m_value; } T m_value; }; Is there a reason not to change this to have operator-> returning a T*? That would seem closer to the defintion of an InputIterator. (I supposed that if operator* returns by const value, it would be necessary to resurrect the constness in the proxy, but assuming the iterator's reference typedef is also a const-qualified value, this should be easy enough.) I had a look at the current concept-based iterator proposal, N2039, to see whether that shed any light on this and it also seems to require this behaviour from an InputIterator. It formal concept only requires operator->'s return to be convertible to T const* (which T*, or a proxy to T*, is): concept InputIterator<typename X> { where /*...*/ Convertible<pointer, value_type const*>; pointer operator->(X); // } And in it's definition of operator->, it requires (*a).m to be well-formed and then defines a->m to be equivalent to it. Have I misunderstood some aspect of this, or does the Standard really all require that a generic input iterator adaptor, such as boost::iterator_adaptor (and by impliciation boost::iterator_facade) should support this? -- Richard Smith

2 3

[BGL] Search Algrorithms' Behavior
by Wang Weiwei 13 Jul '06

13 Jul '06

Hello, I have an undirected graph with several isolated (unconnected) sub-graphs. For example Vertex {1, 2, 3, 4, 5} Edge {(1,2), (1,3) (4, 5)} I want to know what will be the behavior of the search algorithms (such as DFS, BFS, or undirected_DFS) when I submit a search call with a specified beginning vertex. As a result, all of the verteces will be visited, or just those topologically connected to the input vertex? Any help will be appreciated. Max

2 1

[signals] slots bug?
by Bruno Martínez 13 Jul '06

13 Jul '06

Hello. Investigating a problem Elisabeth Benoit was having at the users mailing list I've come to this code, that doesn't work as I would expect: #include <boost/signal.hpp> #include <iostream> void func() { std::cout << "pp\n"; } int main() { boost::signal0<void> signal1; boost::signal0<void> signal2; boost::signal0<void>::slot_type slot = &func; boost::signals::connection conn = signal1.connect(slot); signal2.connect(slot); conn.disconnect(); signal2(); } The func() free function is only called once, because disconnect() removes the slot from both signals. I'm not sure if this is a bug, but I would expect slot_type to work as boost::function. Regards, Bruno

1 0

boost.org and www
by Gennaro Prota 13 Jul '06

13 Jul '06

Just out of curiosity, I verified that boost.org qualifies as a "class A" domain name for http://no-www.org/index.php. I wonder: is it intentional that we always use "www" in our url references? -- [ Gennaro Prota, C++ developer for hire ] [ resume: available on request ]

2 3

[signals] Bug in documentation
by Bruno Martínez 13 Jul '06

13 Jul '06

Hi. There's a bug in the tutorial. It says sig.connect(&print_sum); sig.connect(&print_product); sig.connect(&print_difference); sig.connect(&print_quotient); prints The sum is 8 The difference is 2 The product is 15 The quotient is 1.66667 when in fact it prints The sum is 8 The product is 15 The difference is 2 The quotient is 1.66667 because slots are called in FIFO order. Regards, Bruno

1 0

Tuples and Bind problem
by Arash Partow 13 Jul '06

13 Jul '06

Hi all, I'm having some difficulties getting the following piece of code to compile: #include <iostream> #include <vector> #include <boost/utility.hpp> #include <boost/bind.hpp> #include <boost/tuple/tuple.hpp> class AClass { public: AClass(){} void b(int i, int j, int k) { std:: cout << "a::b() - " << i << "\t" << j << "\t" << k << std::endl; } }; template <typename T,int i> class select { public: typedef typename boost::tuples::element<i,T>::type result_type; template <typename U> result_type operator()(const U& u) const { return u.get<i>(); } }; int main(int argc, char* argv[]) { typedef boost::tuples::tuple<AClass,int,int,int> param_set; std::vector<param_set> list; list.push_back(param_set(AClass(),1,2,3)); list.push_back(param_set(AClass(),2,3,4)); list.push_back(param_set(AClass(),3,4,5)); list.push_back(param_set(AClass(),4,5,6)); list.push_back(param_set(AClass(),5,6,7)); std::for_each( list.begin(), list.end(), boost::bind(&AClass::b, boost::bind(select<param_set,0>(),_0), boost::bind(select<param_set,0>(),_1), boost::bind(select<param_set,0>(),_2), boost::bind(select<param_set,0>(),_3))); return true; } Basically the "select class" is a code snippet I found on this list, the compilation errors I believe exist in how I'm calling bind, but I cant tell whats going wrong. Also I'm wondering is there a better way of doing what I'm trying to do, is there already a class or something in boost that will allow one to bind a function and a tuples of parameters. Also I'm wondering if it will be possible to derive AClass from boost::noncopyable and still be able to instantiate class instances as part of method parameters. Any help would be very much appreciated. Arash Partow ________________________________________________________ Be one who knows what they don't know, Instead of being one who knows not what they don't know, Thinking they know everything about all things. http://www.partow.net

2 1

Boost regression notification (2006-07-13 [RC_1_34_0])
by Douglas Gregor 13 Jul '06

13 Jul '06

Boost Regression test failures Report time: 2006-07-13T09:58:57Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 537 failures in 31 libraries algorithm/string (2) concept_check (1) conversion (1) date_time (1) filesystem (5) graph (6) integer (3) io (1) iostreams (61) iterator (1) lambda (2) mpl (20) numeric/conversion (4) numeric/interval (2) numeric/ublas (7) optional (2) parameter (33) pool (3) program_options (19) python (92) random (1) rational (5) serialization (177) signals (16) spirit (12) test (8) tr1 (39) typeof (9) utility (2) utility/enable_if (1) wave (1) |algorithm/string| regex: borland-5_6_4 replace: vc-7_1-stlport |concept_check| class_concept_check_test: vc-7_1-stlport |conversion| lexical_cast_test: sun-5.8 |date_time| testgreg_serialize_dll: mingw-3_4_2 |filesystem| fstream_test: sun-5.8 mbcopy: sun-5.8 operations_test: vc-7_1-stlport operations_test_dll: vc-7_1-stlport wide_test: sun-5.8 |graph| adjacency_matrix_test: vc-7_0 bidir_remove_edge: vc-7_0 csr_graph_test: sun-5.8 graphviz_test: msvc-8.0 msvc-8.0 vc-7_1-stlport |integer| integer_traits_test: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |io| ios_state_unit_test: gcc-4.1.0_linux_x86_64 |iostreams| array_test: vc-6_5 auto_close_test: sun-5.8 vc-6_5 buffer_size_test: sun-5.8 vc-6_5 bzip2_test: msvc-7.1 msvc-8.0 sun-5.8 code_converter_test: sun-5.8 vc-6_5 component_access_test: sun-5.8 vc-6_5 compose_test: borland-5_6_4 sun-5.8 vc-6_5 copy_test: vc-6_5 counter_test: sun-5.8 vc-6_5 direct_adapter_test: vc-6_5 example_test: vc-6_5 vc-6_5-stlport file_descriptor_test: vc-6_5 file_test: vc-6_5 filtering_stream_test: sun-5.8 vc-6_5 vc-7_1-stlport finite_state_filter_test: cw-9.4 sun-5.8 flush_test: sun-5.8 vc-6_5 gzip_test: msvc-7.1 msvc-8.0 sun-5.8 invert_test: vc-6_5 line_filter_test: sun-5.8 vc-6_5 mapped_file_test: vc-6_5 newline_test: sun-5.8 vc-6_5 null_test: vc-6_5 pipeline_test: sun-5.8 vc-6_5 positioning_test: vc-6_5 regex_filter_test: sun-5.8 vc-6_5 restrict_test: sun-5.8 vc-6_5 seekable_file_test: sun-5.8 vc-6_5 seekable_filter_test: sun-5.8 vc-6_5 stdio_filter_test: sun-5.8 vc-6_5 symmetric_filter_test: sun-5.8 vc-6_5 tee_test: sun-5.8 vc-6_5 wide_stream_test: sun-5.8 vc-6_5 zlib_test: msvc-7.1 msvc-8.0 |iterator| is_lvalue_iterator: sun-5.8 |lambda| extending_rt_traits: sun-5.8 operator_tests_simple: sun-5.8 |mpl| apply: gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc sun-5.8 count: sun-5.8 count_if: sun-5.8 equal: sun-5.8 erase: sun-5.8 find: sun-5.8 insert: sun-5.8 insert_range: sun-5.8 lambda_args: sun-5.8 multiset: gcc-3.4.5_linux_x86_64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 partition: sun-5.8 stable_partition: sun-5.8 vector_c: sun-5.8 |numeric/conversion| converter_test: borland-5_8_2 traits_test: borland-5_8_2 udt_example_0: borland-5_8_2 udt_support_test: borland-5_8_2 |numeric/interval| det: sun-5.8 test_float: vc-7_1-stlport |numeric/ublas| concepts: vc-7_1-stlport vc-7_1-stlport test1: vc-7_1-stlport test2: vc-7_1-stlport test4: vc-7_1-stlport test5: vc-7_1-stlport vc-7_1-stlport |optional| optional_test: sun-5.8 optional_test_ref: sun-5.8 |parameter| basics: borland-5_6_4 borland-5_8_2 sun-5.8 duplicates: borland-5_6_4 borland-5_8_2 earwicker: borland-5_6_4 borland-5_8_2 macros: borland-5_6_4 borland-5_8_2 sun-5.8 maybe: vc-6_5 vc-6_5-stlport vc-7_0 mpl: borland-5_6_4 borland-5_8_2 preprocessor: borland-5_6_4 borland-5_8_2 sun-5.8 vc-6_5 vc-6_5-stlport python-parameter-test: vc-6_5 vc-6_5-stlport vc-7_0 sfinae: borland-5_6_4 borland-5_8_2 vc-6_5-stlport singular: borland-5_6_4 borland-5_8_2 unnamed: borland-5_6_4 borland-5_8_2 unnamed_fail: vc-6_5 vc-6_5-stlport vc-7_0 |pool| test_pool_alloc: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp |program_options| cmdline_test: sun-5.8 cmdline_test_dll: cw-9.4 sun-5.8 options_description_test: sun-5.8 options_description_test_dll: cw-9.4 sun-5.8 parsers_test: sun-5.8 parsers_test_dll: cw-9.4 sun-5.8 positional_options_test: sun-5.8 positional_options_test_dll: cw-9.4 sun-5.8 unicode_test_dll: borland-5_8_2 cw-9.4 variable_map_test: sun-5.8 variable_map_test_dll: borland-5_8_2 cw-9.4 sun-5.8 winmain_dll: cw-9.4 |python| andreas_beyer: sun-5.8 args: sun-5.8 auto_ptr: sun-5.8 back_reference: sun-5.8 bases: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux sun-5.8 ben_scott1: sun-5.8 bienstman1: sun-5.8 bienstman2: sun-5.8 bienstman3: sun-5.8 borrowed: sun-5.8 callbacks: sun-5.8 const_argument: sun-5.8 crossmod_exception: sun-5.8 data_members: sun-5.8 defaults: sun-5.8 dict: sun-5.8 docstring: sun-5.8 enum: sun-5.8 exception_translator: sun-5.8 exec: cw-9.4 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp sun-5.8 extract: sun-5.8 implicit: sun-5.8 indirect_traits_test: sun-5.8 injected: sun-5.8 iterator: sun-5.8 keywords: sun-5.8 list: sun-5.8 long: sun-5.8 minimal: sun-5.8 multi_arg_constructor: sun-5.8 nested: sun-5.8 numpy: sun-5.8 object: sun-5.8 object_manager: sun-5.8 opaque: sun-5.8 operators: sun-5.8 pearu1: sun-5.8 pickle1: sun-5.8 pickle2: sun-5.8 pickle3: sun-5.8 pickle4: sun-5.8 pointee: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux sun-5.8 pointer_type_id_test: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux sun-5.8 pointer_vector: sun-5.8 polymorphism: sun-5.8 polymorphism2: sun-5.8 polymorphism2_auto_ptr: sun-5.8 properties: sun-5.8 raw_ctor: sun-5.8 return_arg: sun-5.8 select_arg_to_python_test: sun-5.8 select_from_python_test: darwin-4.0.1 qcc-3.3.5_cpp qcc-3.3.5_gpp sun-5.8 select_holder: sun-5.8 shared_ptr: sun-5.8 slice: sun-5.8 staticmethod: sun-5.8 stl_iterator: sun-5.8 str: sun-5.8 string_literal: sun-5.8 test_pointer_adoption: sun-5.8 try: sun-5.8 tuple: sun-5.8 upcast: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux sun-5.8 vector_indexing_suite: sun-5.8 virtual_functions: sun-5.8 voidptr: sun-5.8 wrapper_held_type: sun-5.8 |random| random_test: intel-linux-9.0 |rational| rational_test: borland-5_6_4 sun-5.8 vc-6_5 vc-6_5-stlport vc-7_0 |serialization| test_array_binary_archive_dll: mingw-3_4_2 test_array_text_archive_dll: mingw-3_4_2 test_array_xml_archive_dll: mingw-3_4_2 test_binary_binary_archive_dll: mingw-3_4_2 test_binary_text_archive_dll: mingw-3_4_2 test_binary_xml_archive_dll: mingw-3_4_2 test_class_info_load_binary_archive_dll: mingw-3_4_2 test_class_info_load_text_archive_dll: mingw-3_4_2 test_class_info_load_text_warchive: vc-6_5 test_class_info_load_xml_archive_dll: mingw-3_4_2 test_class_info_save_binary_archive_dll: mingw-3_4_2 test_class_info_save_text_archive_dll: mingw-3_4_2 test_class_info_save_xml_archive_dll: mingw-3_4_2 test_codecvt_null: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_contained_class_binary_archive_dll: mingw-3_4_2 test_contained_class_text_archive_dll: mingw-3_4_2 test_contained_class_xml_archive_dll: mingw-3_4_2 test_cyclic_ptrs_binary_archive_dll: mingw-3_4_2 test_cyclic_ptrs_text_archive_dll: mingw-3_4_2 test_cyclic_ptrs_xml_archive_dll: mingw-3_4_2 test_delete_pointer_binary_archive_dll: mingw-3_4_2 test_delete_pointer_text_archive_dll: mingw-3_4_2 test_delete_pointer_xml_archive_dll: mingw-3_4_2 test_demo_auto_ptr_dll: mingw-3_4_2 test_demo_dll: mingw-3_4_2 test_demo_exception_dll: mingw-3_4_2 test_demo_fast_archive: sun-5.8 test_demo_fast_archive_dll: mingw-3_4_2 sun-5.8 test_demo_pimpl_dll: mingw-3_4_2 test_demo_polymorphic_dll: mingw-3_4_2 test_demo_portable_archive_dll: mingw-3_4_2 test_demo_shared_ptr_dll: mingw-3_4_2 test_demo_xml_dll: mingw-3_4_2 test_demo_xml_load_dll: mingw-3_4_2 test_demo_xml_save_dll: mingw-3_4_2 test_deque_binary_archive_dll: mingw-3_4_2 test_deque_text_archive_dll: mingw-3_4_2 test_deque_xml_archive_dll: mingw-3_4_2 test_derived_binary_archive_dll: mingw-3_4_2 test_derived_class_binary_archive_dll: mingw-3_4_2 test_derived_class_ptr_binary_archive_dll: mingw-3_4_2 test_derived_class_ptr_text_archive_dll: mingw-3_4_2 test_derived_class_ptr_xml_archive_dll: mingw-3_4_2 test_derived_class_text_archive_dll: mingw-3_4_2 test_derived_class_xml_archive_dll: mingw-3_4_2 test_derived_text_archive_dll: mingw-3_4_2 test_derived_xml_archive_dll: mingw-3_4_2 test_diamond_binary_archive_dll: mingw-3_4_2 test_diamond_text_archive_dll: mingw-3_4_2 test_diamond_xml_archive_dll: mingw-3_4_2 test_exported_binary_archive_dll: mingw-3_4_2 test_exported_text_archive_dll: mingw-3_4_2 test_exported_xml_archive_dll: mingw-3_4_2 test_list_binary_archive_dll: mingw-3_4_2 test_list_ptrs_binary_archive_dll: mingw-3_4_2 test_list_ptrs_text_archive_dll: mingw-3_4_2 test_list_ptrs_xml_archive_dll: mingw-3_4_2 test_list_text_archive_dll: mingw-3_4_2 test_list_xml_archive_dll: mingw-3_4_2 test_map_binary_archive_dll: mingw-3_4_2 test_map_text_archive_dll: mingw-3_4_2 test_map_xml_archive_dll: mingw-3_4_2 test_mi_binary_archive_dll: mingw-3_4_2 test_mi_text_archive_dll: mingw-3_4_2 test_mi_xml_archive_dll: mingw-3_4_2 test_mult_archive_types_dll: mingw-3_4_2 test_multiple_ptrs_binary_archive_dll: mingw-3_4_2 test_multiple_ptrs_text_archive_dll: mingw-3_4_2 test_multiple_ptrs_xml_archive_dll: mingw-3_4_2 test_no_rtti_binary_archive_dll: mingw-3_4_2 test_no_rtti_text_archive_dll: mingw-3_4_2 test_no_rtti_xml_archive_dll: mingw-3_4_2 test_non_default_ctor2_binary_archive_dll: mingw-3_4_2 test_non_default_ctor2_text_archive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_archive_dll: mingw-3_4_2 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_xml_archive_dll: mingw-3_4_2 test_non_default_ctor_binary_archive_dll: mingw-3_4_2 test_non_default_ctor_text_archive_dll: mingw-3_4_2 test_non_default_ctor_xml_archive_dll: mingw-3_4_2 test_non_intrusive_binary_archive_dll: mingw-3_4_2 test_non_intrusive_text_archive_dll: mingw-3_4_2 test_non_intrusive_xml_archive_dll: mingw-3_4_2 test_null_ptr_binary_archive_dll: mingw-3_4_2 test_null_ptr_text_archive_dll: mingw-3_4_2 test_null_ptr_xml_archive_dll: mingw-3_4_2 test_nvp_binary_archive_dll: mingw-3_4_2 test_nvp_text_archive_dll: mingw-3_4_2 test_nvp_xml_archive_dll: mingw-3_4_2 test_object_binary_archive_dll: mingw-3_4_2 test_object_text_archive_dll: mingw-3_4_2 test_object_xml_archive_dll: mingw-3_4_2 test_optional_binary_archive_dll: mingw-3_4_2 test_optional_text_archive_dll: mingw-3_4_2 test_optional_xml_archive_dll: mingw-3_4_2 test_polymorphic_binary_archive_dll: mingw-3_4_2 test_polymorphic_text_archive_dll: mingw-3_4_2 test_polymorphic_xml_archive_dll: mingw-3_4_2 test_primitive_binary_archive_dll: mingw-3_4_2 test_primitive_text_archive_dll: mingw-3_4_2 test_primitive_xml_archive_dll: mingw-3_4_2 test_private_ctor_dll: mingw-3_4_2 test_recursion_binary_archive_dll: mingw-3_4_2 test_recursion_text_archive_dll: mingw-3_4_2 test_recursion_xml_archive_dll: mingw-3_4_2 test_registered_binary_archive_dll: mingw-3_4_2 test_registered_text_archive_dll: mingw-3_4_2 test_registered_xml_archive_dll: mingw-3_4_2 test_reset_object_address: vc-7_0 test_reset_object_address_dll: mingw-3_4_2 vc-7_0 test_set_binary_archive_dll: mingw-3_4_2 test_set_text_archive_dll: mingw-3_4_2 test_set_xml_archive_dll: mingw-3_4_2 test_shared_ptr_132_binary_archive: sun-5.8 test_shared_ptr_132_binary_archive_dll: mingw-3_4_2 sun-5.8 test_shared_ptr_132_text_archive: sun-5.8 test_shared_ptr_132_text_archive_dll: mingw-3_4_2 sun-5.8 test_shared_ptr_132_text_warchive: sun-5.8 test_shared_ptr_132_text_warchive_dll: sun-5.8 test_shared_ptr_132_xml_archive: sun-5.8 test_shared_ptr_132_xml_archive_dll: mingw-3_4_2 sun-5.8 test_shared_ptr_132_xml_warchive: sun-5.8 test_shared_ptr_132_xml_warchive_dll: sun-5.8 test_shared_ptr_binary_archive_dll: mingw-3_4_2 test_shared_ptr_text_archive_dll: mingw-3_4_2 test_shared_ptr_xml_archive_dll: mingw-3_4_2 test_simple_class_binary_archive_dll: mingw-3_4_2 vc-6_5 test_simple_class_ptr_binary_archive_dll: mingw-3_4_2 test_simple_class_ptr_text_archive_dll: mingw-3_4_2 test_simple_class_ptr_xml_archive_dll: mingw-3_4_2 test_simple_class_text_archive_dll: mingw-3_4_2 vc-6_5 test_simple_class_text_warchive_dll: vc-6_5 test_simple_class_xml_archive_dll: mingw-3_4_2 vc-6_5 test_simple_class_xml_warchive_dll: vc-6_5 test_split_binary_archive_dll: mingw-3_4_2 test_split_text_archive_dll: mingw-3_4_2 test_split_xml_archive_dll: mingw-3_4_2 test_tracking_binary_archive_dll: mingw-3_4_2 test_tracking_text_archive_dll: mingw-3_4_2 test_tracking_xml_archive_dll: mingw-3_4_2 test_unregistered_binary_archive_dll: mingw-3_4_2 test_unregistered_text_archive_dll: mingw-3_4_2 test_unregistered_xml_archive_dll: mingw-3_4_2 test_utf8_codecvt: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_variant_binary_archive_dll: mingw-3_4_2 test_variant_text_archive_dll: mingw-3_4_2 test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 mingw-3_4_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 test_vector_binary_archive_dll: mingw-3_4_2 test_vector_text_archive_dll: mingw-3_4_2 test_vector_xml_archive_dll: mingw-3_4_2 test_void_cast_dll: mingw-3_4_2 |signals| dead_slot_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp trackable_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |spirit| bug_fixes: sun-5.8 bug_fixes_debug: sun-5.8 char_strings_test: sun-5.8 char_strings_test_debug: sun-5.8 epsilon_tests: sun-5.8 epsilon_tests_debug: sun-5.8 file_iterator_tests: sun-5.8 file_iterator_tests_debug: sun-5.8 if_p_as_parser_tests: sun-5.8 mix_and_match_trees: sun-5.8 scanner_value_type_tests: intel-linux-9.0 while_p_as_parser_tests: sun-5.8 |test| basic_cstring_test: sun-5.8 boost_check_equal_str: sun-5.8 foreach_test: sun-5.8 ifstream_line_iterator_test: sun-5.8 output_test_stream_test: sun-5.8 parameterized_test_test: vc-6_5 vc-6_5-stlport token_iterator_test: sun-5.8 |tr1| run_random: sun-5.8 std_run_complex_overloads: sun-5.8 std_run_random: sun-5.8 std_test_bind: darwin-4.0.1 sun-5.8 std_test_complex: sun-5.8 std_test_function: sun-5.8 std_test_hash: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp sun-5.8 std_test_mem_fn: sun-5.8 std_test_random: sun-5.8 std_test_reference_wrapper: sun-5.8 std_test_result_of: sun-5.8 std_test_shared_ptr: sun-5.8 std_test_tuple: sun-5.8 std_test_tuple_tricky: sun-5.8 std_test_type_traits: sun-5.8 test_bind: darwin-4.0.1 test_boost: vc-7_1-stlport test_hash: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp vc-7_1-stlport test_random: sun-5.8 vc-7_1-stlport test_regex: vc-7_1-stlport test_type_traits: sun-5.8 tr1_extent_test: sun-5.8 tr1_is_abstract_test: sun-5.8 tr1_is_empty_test: sun-5.8 tr1_is_function_test: sun-5.8 tr1_is_member_func_test: sun-5.8 tr1_is_member_obj_test: sun-5.8 tr1_is_object_test: sun-5.8 tr1_is_reference_test: sun-5.8 tr1_rank_test: sun-5.8 tr1_tricky_function_type_test: sun-5.8 |typeof| function_binding_emulation: sun-5.8 function_binding_native: vc-6_5 vc-6_5-stlport vc-7_0 nested_typedef_emulation: cw-9.4 odr_no_uns: vc-6_5 vc-6_5-stlport vc-7_0 template_tpl_emulation: sun-5.8 |utility| addressof_test: sun-5.8 operators_test: gcc-3.4.5_linux_x86_64 |utility/enable_if| lazy: sun-5.8 |wave| test_re2c_lexer: sun-5.8

1 0

SuperString v2 in the vault
by Jeff Garland 13 Jul '06

13 Jul '06

Thanks all for the discussion/suggestions on the first version. As usual Boosters have very helpful suggestions. I've uploaded version 2 of super_string to the vault and put an improved set of documentation online: http://www.crystalclearsoftware.com/libraries/super_string/index.html Vault location: http://tinyurl.com/dbcye Probably the biggest thing in this version is an immutable version using the proposed boost::const_string. http://www.crystalclearsoftware.com/libraries/super_string/classbasic__cons… After using it a bit, it seems to me that the immutable approach is likely viable for most applications. To see the impact, I wrote a little performance test. On mutating operations const_super_string is clearly slower. The benefit on non-mutating operations is minimal. However, this version is probably not as optimized as possible and it under emphasizes allocation, so I expect in actual practice the mutable version may better than these tests demonstrate. Your mileage may vary. 10 trials 500000 iterations/trial const append test --> total elapsed: 00:00:25.071687 mutable append test --> total elapsed: 00:00:21.904486 10 trials 1000000 iterations/trial const trim test --> total elapsed: 00:00:14.977803 mutable trim test --> total elapsed: 00:00:11.693688 10 trials 100000 iterations/trial const contains regex test --> total elapsed: 00:00:27.044718 mutable contains regex test --> total elapsed: 00:00:27.633608 10 trials 100000 iterations/trial const split regex test --> total elapsed: 00:00:16.517079 mutable split regex test --> total elapsed: 00:00:17.582708 Other notable changes in this version: * Make modification functions chainable -- thanks Mark Mutz * Add append_file function -- Thx to suggestion by Pavel Vozenilek super_string data; data.append_file("data1.txt").append_file(data2.txt); * Type conversion with user supplied stringstream std::ostringstream ss; s.setprecision( super_string s; ss << std::setprecision(3); double dbl = 1.987654321; int i = 1000; s.append(dbl, i, i, " stuff", dbl, ss); //s == "1.99 1000 1000 1.99 stuff 1.99" //ss -- has been modified * Add boost.format capabilities -- Thx to suggestion by Pavel Vozenilek super_string s; double d = 1.123456789; int i = 1000; s.append_formatted(d, i , d, i, "a string", "%-7.2f %-7d %-7.2f %-7d %s"); //s == "1.12 1000 1.12 1000 a string" * Removed all const _copy overloads in mutable string to reduce the api size. * Add additional template overloads to support multi-append cases like double double d = 1.54; int i = 25; s.append("double: ", d, " is ", i); Currently up to 5 parameters Enjoy, Jeff

6 8

[asio] has anybody enabled SSL in a large project?
by Scott 13 Jul '06

13 Jul '06

We've been using ASIO for a while now in a large project and it's been great. I've recently been tasked to add optional SSL support between our client and server. Since there are some SSL classes in ASIO I started with the ASIO SSL example code and got that working. I then pretty much copied the relevant pieces from the sample code over to our project to see if it would work there. Using the same certificates and key files from the sample code, I added the handshaking and got our client and server to communicate. It all seemed great at first, because it seemed to seemlessly work. But eventually the communications break down. I either get asserts in my code from unexpected data in the stream, or the client hangs waiting for data that never appears or any of several different stream problems. It's rarely the exact same thing. But it eventually always fails. Especially on long sustained transfers. I have no idea what I might be doing wrong. There's really no documentation at all on ASIO and SSL. For all I know, it might be a problem with the SSL implementation in ASIO. Which brings me to my question - has anybody successfully used the SSL classes in ASIO on complex projects? If so, that would point to a problem in my code somewhere. Perhaps I need to do more than just add the initial SSL handshake (aside from using the SSL stream beyond that point)? Thanks, Scott

3 4

[mpl][patch] begin fails to compile with integral constant, safe to apply to RC?
by Tobias Schwinger 13 Jul '06

13 Jul '06

Hi, It's a few months since I applied that patch to the HEAD and I haven't seen it cause any regressions. Dave asked me to apply it to the RC as well, but there has been comparatively little testing on the HEAD so I wonder whether it's safe to apply it to the RC now. Did anyone encounter any problems in this area? If there are no objections I'll apply the patch within the next couple of days. Regards, Tobias

1 0

[BGL] Help Needed
by Wang Weiwei 13 Jul '06

13 Jul '06

> > >>I have yet to be able to use edge descriptors as keys >>to external property maps. Try using internal >>property maps. >> >> Cromwell D. Enage >> > >Thanks for your help. Would you pls give me an example >showing the usage of internal property map for the vertices >and edges? or, to make the question simpler, how to declare a adjacency_list type graph object with internal vertex/edge property maps as follows: vertex descriptor -> MyVpmType edge descriptor -> MyEpmType And how to access the internal maps to do sum get/put operation? > >Thanks again. > >max

2 1

[Boost-bugs] [ boost-Bugs-1521741 ] Constness in iterator_facade::operator->
by SourceForge.net 13 Jul '06

13 Jul '06

Bugs item #1521741, was opened at 2006-07-13 11:21 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=1521741&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: iterator Group: None Status: Open Resolution: None Priority: 5 Submitted By: Richard Smith (ras52) Assigned to: David Abrahams (david_abrahams) Summary: Constness in iterator_facade::operator-> Initial Comment: The C++ standard states (table 72) that for an input iterator, a->m is equivalent to (*a).m. If operator* returns a value_type by non-const value, it is possible to call a non-const member function on the temporary returned from the function. However, the operator_arrow_proxy class acts as a proxy to T const* rather than T*, this that you can do (*i).non_const_method(); but not i->non_const_method(); for certain input iterators. See discussion here: http://lists.boost.org/Archives/boost/2006/07/107713.php http://lists.boost.org/Archives/boost/2006/07/107740.php http://lists.boost.org/Archives/boost/2006/07/107756.php ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1521741&group_… ------------------------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[lamba] typo in lambda docs
by Gennaro Prota 13 Jul '06

13 Jul '06

Hi guys, I'm forwarding this from the users list. It may easily get unnoticed there, the more so considering it has a very generic subject. --------------------------------------------------------- On Tue, 11 Jul 2006 22:40:34 +0200, "Ovanes Markarian" <om_boost(a)keywallet.com> wrote: >Hi! > >there is currently a bug in boost::lambda documentation ( ><http://www.boost.org/doc/html/lambda/s03.html> >http://www.boost.org/doc/html/lambda/s03.html) > >Current version: > >template <class T> : public binary_function<T, T, T> >struct plus { > T operator()(const T& i, const T& j) const { > return i + j; > } >}; >should be: > >template <class T> >struct plus : public binary_function<T, T, T> > >{ > > T operator()(const T& i, const T& j) const { > > return i + j; > > } > >}; > > >With Kind Regards, >Ovanes -- [ Gennaro Prota, C++ developer for hire ] [ resume: available on request ]

1 0

[config] Macro proposal
by Gennaro Prota 13 Jul '06

13 Jul '06

Hi guys, could we please add something like this to the config system? #if defined(__GNUC_PATCHLEVEL__) # define <choose_a_name> ( __GNUC__ * 10000 \ + __GNUC_MINOR__ * 100 \ + __GNUC_PATCHLEVEL__ ) #else # define <choose_a_name> ( __GNUC__ * 10000 \ + __GNUC_MINOR__ * 100) #endif PS: of course it's possible to "share" the common part of the replacement-lists: ( __GNUC__ * 10000 + __GNUC_MINOR__ * 100) or (100 * ( __GNUC__ * 100 + __GNUC_MINOR__)) The decision is up to John :) --Gennaro.

4 19