December 2001 - Boost-users - lists.preview.boost.org

Building nested FSM with BGL...
by Herman Bruyninckx 31 Dec '01

31 Dec '01

Has anyone already implemented a nested Finite State Machine with the Boost Graph Library? (Or a Petri net for that matter.) The thing that really puzzles me is how to implement the nesting, i.e., all nodes in a subset of the graph react to the same ``events'' from the ``outside world'', but I want to avoid making all the edges from the ``outside world'' nodes to the subset nodes... Herman

1 0

Re: new component, extent_set<>
by Nathan Myers 30 Dec '01

30 Dec '01

"David A. Greene" wrote: > Nathan Myers wrote: > > boost::extent_set<> implements a set of half-open ranges on a scalar > > type, with automatic splitting and merging, appropriate for managing > > ranges of disk blocks or video frames. In use it looks like: > > Cool! Why "extent_set" though? What about range_set or interval_set? "Extent" is the standard term of art when speaking of ranges of disk blocks, particularly as part of a file system. Also, since it's not really a set of ranges, range_set seemed inappropriate. > Any way this could be adapted to allow non-scalar ranges? What are > the requirements on the range element type? I would think anything > less-than-comparable should be useable but I didn't implement the > class. :) The current version uses closed ranges, BTW. The requirements are minimal: as listed in the header file, the Bound argument must be copyable, assignable, equality-comparable, comparable using the Compare argument, and incrementable and decrementable using the Succ and Pred arguments. It imposes no other requirements, so a non-scalar could work. Unfortunately I don't know how to define a useful decrement operator for a string, or a Compare operator for a complex number. Did you have some particular non-scalar in mind? The original version didn't need the increment and decrement operations, internally, but the client was still obliged to apply the equivalent of an increment operation. That made it slippery to use on strings. You could define increment to mean "append a space", so that a dictionary page might occupy the range "lost" to "love " (note the space). That assumes a lot about the character encoding, which the client (but not extent_set<>) is allowed to do. Unfortunately there is no simple equivalent for decrementing, so the trick doesn't work with closed ranges. It is conceivable that I might be able to continue storing half-open ranges internally, and thus avoid needing a decrement operation. It seems a bit fragile though. > Is there a way to control when ranges are combined (maybe sometimes > I want [10, 20) and [20, 30) to stay separate)? A policy for this > would be nice. It doesn't provide that in the current version. In fact, the presence of such a pair of extents would violate an invariant, breaking the insert and erase members as written. (They could probably be changed to accommodate it, at some cost in complexity.) How would you use such a feature? Nathan Myers ncm at cantrip dot org

1 0

Presentation Boost at Fosdem
by Toon Knapen 27 Dec '01

27 Dec '01

Dear Boost Developers, Currently, a presentation of Boost is scheduled at FOSDEM (www.fosdem.org) Fosdem is an anual free and open-source developer meeting in Brussels, Belgium that is gaining a lot of momentum, with an audience from all over europe and many international speakers of highly visible open-source projects. As has been discussed on the list before, Boost is well known to the standard commitee but need also be more visible to a wider public. That's also why I proposed to the Fosdem organiser (Raphael Bauduin) to schedule a Boost presentation. Boost developers and users that are planning to attend, contribute, ... please let me know. Toon

1 0

new component, extent_set<>
by Nathan Myers 27 Dec '01

27 Dec '01

I have uploaded to the Boost files section couple of archives containing an implementation of a class template extent_set; look in the folder "extent_set". The zip and tgz archives there are identical. Included in each is a header file and a test suite. boost::extent_set<> implements a set of half-open ranges on a scalar type, with automatic splitting and merging, appropriate for managing ranges of disk blocks or video frames. In use it looks like: boost::extent_set<int> set; set.insert(10, 20); // now contains [10,20) set.insert(30, 50); // now contains [10,20) [30,50) set.erase(40, 45); // now contains [10,20) [30,40) [45,50) set.insert(20, 30); // now contains [10,40) [45,50) std::cout << "(" << set.begin()->first << "," << set.begin()->second << ")" << std::endl; // writes "(10,40)" It is implemented using std::map. This is the initial submission. Please 'ave a look. (I am only subscribed to the -users list, so far.) Nathan Myers ncm at cantrip dot org

2 1

linker error with regex
by John Maddock 22 Dec '01

22 Dec '01

>By looking at the verbose progress messages from the linker, it >appears that the following libs (stl-port and regex only - others not >shown) are being linked against: > >Processed /DEFAULTLIB:vc6-stlport-re300m.lib >Processed /DEFAULTLIB:stlport_vc6_static.lib Those are the correct libs to link against for those options. >I am stumped as to why the linker fails from inside the IDE but works >when used from the command line! So am I, it works for me, but you are not alone in having problems with this. - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

1 0

lexiacal_cast and hex values
by rogeeff 21 Dec '01

21 Dec '01

Hi, can I you lexical_cast to convert string "0x16" to 22? Thanx, Gennadiy.

2 2

linker error with regex
by kchellap 21 Dec '01

21 Dec '01

Hi, Newbie question. I am using one of the latest versions of boost (not sure which version, but I downloaded it in Sept'00) and am using it with stlport ver 4.5. I've been successful in using the shared_ptr, shared_array, etc type of libraries with MSVC++ 6.0 (sp5) on a Win2K machine (sp2). However, recently I've been trying to get the regex library to work but seem to be getting linker errors. As indicated in the documentation, I set the env. using vcvars32, and used nmake to compile and install the regex libraries (both .lib and .dll files). As a sample I tried compiling snip1.cpp (in boost_libs\regex\demo\snippets) from the command line: D:\demo>cl /MT /D_MT -o snip1.exe -O2 -GX -GR snip1.cpp -link user 32.lib Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8168 for 80x86 Copyright (C) Microsoft Corp 1984-1998. All rights reserved. snip1.cpp Microsoft (R) Incremental Linker Version 6.00.8168 Copyright (C) Microsoft Corp 1992-1998. All rights reserved. /out:snip1.exe user32.lib snip1.obj and the compile succeeded. However, when I set up the same options in the MSVC++ IDE, I get the following linker errors: Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8168 for 80x86 Copyright (C) Microsoft Corp 1984-1998. All rights reserved. cl /MT /GR /GX /O2 /D "_MT" /Fo"Debug/" "D:\users\kumar\boost_libs\regex\demo\snippetsmsvc\snip1.cpp" snip1.cpp Microsoft (R) Incremental Linker Version 6.00.8168 Copyright (C) Microsoft Corp 1992-1998. All rights reserved. /out:snip1.exe Debug/snip1.obj snip1.obj : error LNK2001: unresolved external symbol "public: static class _STL::basic_string<char,class _STL::char_traits<char>,class _STL::allocator<char> > __cdecl boost::re_detail::w32_traits_base::error_string(unsigned int)" (? error_string@w3 2_traits_base@re_detail@boost@@SA?AV?$basic_string@DV? $char_traits@D@_STL@@V?$allocator@D@2@@_STL@@I@Z) snip1.obj : error LNK2001: unresolved external symbol "public: static void __fastcall boost::w32_regex_traits<char>::transform_primary (class _STL::basic_string<char,class _STL::char_traits<char>,class _STL::allocator<char> > &,class _STL::basic_stri ng<char,class _STL::char_traits<char>,class _STL::allocator<char> > const &)" (?transform_primary@?$w32_regex_traits@D@boost@@SIXAAV? $basic_string@DV?$char_traits@D@_STL@@V? $allocator@D@2@@_STL@@ABV34@@Z) snip1.obj : error LNK2001: unresolved external symbol "protected: static bool __fastcall boost::re_detail::w32_traits_base::do_lookup_collate(class _STL::basic_string<char,class _STL::char_traits<char>,class _STL::allocator<char> > &,char const *)" (?do_lookup_collate@w32_traits_base@re_detail@boost@@KI_NAAV? $basic_string@DV?$char_traits@D@_STL@@V?$allocator@D@2@@_STL@@PBD@Z) snip1.obj : error LNK2001: unresolved external symbol "public: static void __fastcall boost::w32_regex_traits<char>::transform(class _STL::basic_string<char,class _STL::char_traits<char>,class _STL::allocator<char> > &,class _STL::basic_string<char, class _STL::char_traits<char>,class _STL::allocator<char> > const &)" (?transform@?$w32_regex_traits@D@boost@@SIXAAV?$basic_string@DV? $char_traits@D@_STL@@V?$allocator@D@2@@_STL@@ABV34@@Z) vc6-stlport-re300m.lib(w32_regex_traits.obj) : error LNK2001: unresolved external symbol __imp__LoadStringA@16 vc6-stlport-re300m.lib(w32_regex_traits.obj) : error LNK2001: unresolved external symbol __imp__CharLowerW@4 snip1.exe : fatal error LNK1120: 6 unresolved externals Error executing cl.exe. By looking at the verbose progress messages from the linker, it appears that the following libs (stl-port and regex only - others not shown) are being linked against: Processed /DEFAULTLIB:vc6-stlport-re300m.lib Processed /DEFAULTLIB:stlport_vc6_static.lib I am stumped as to why the linker fails from inside the IDE but works when used from the command line! If anybody has an idea as to what is going on here or has a way to fix it, I'd really appreciate any help. Thanks, Kumar Chellapilla kumar(a)natural-selection.com

1 0

Using PREPROCESSOR to generate macros
by Gustavo Guerra 19 Dec '01

19 Dec '01

I use the following macros in my code: #define MAKE_FLAG_TYPE1(TYPE_NAME, F1) \ enum TYPE_NAME { F1 }; \ \ ::std::ostream& operator<<(::std::ostream& os, TYPE_NAME f) \ \ switch(f) \ { \ case F1: return os << #F1; \ } \ return os << "unknown"; \ } [2, 3 and 4 argument versions] #define MAKE_FLAG_TYPE5(TYPE_NAME, F1, F2, F3, F4, F5) \ enum TYPE_NAME { F1, F2, F3, F4, F5 }; \ \ ::std::ostream& operator<<(::std::ostream& os, TYPE_NAME f) \ { \ switch(f) \ { \ case F1: return os << #F1; \ case F2: return os << #F2; \ case F3: return os << #F3; \ case F4: return os << #F4; \ case F5: return os << #F5; \ } \ return os << "unknown"; \ } I wanted to try and do it with the Preprocessor library. It should be something like this: #include <boost/preprocessor/comma_if.hpp> #include <boost/preprocessor/repeat.hpp> #include <boost/preprocessor/repeat_2nd.hpp> #include <boost/preprocessor/inc.hpp> #include <boost/preprocessor/cat.hpp> #include <boost/preprocessor/enum_params.hpp> #ifndef MAX_MAKE_FLAG_TYPE_PARAMS #define MAX_MAKE_FLAG_TYPE_PARAMS 10 #endif BOOST_PREPROCESSOR_REPEAT(MAX_MAKE_FLAG_TYPE, MAKE_FLAG_TYPE_AUX, _) #define MAKE_FLAG_TYPE_AUX(N,_) \ #define MAKE_FLAG_TYPE##N(TYPE_NAME,BOOST_PREPROCESSOR_ENUM_PARAMS(N, F)) \ enum TYPE_NAME { BOOST_PREPROCESSOR_ENUM_PARAMS(N, F) }; \ ::std::ostream& operator<<(::std::ostream& os, TYPE_NAME f) \ { \ switch(f) \ { \ BOOST_PREPROCESSOR_REPEAT_2ND(N, MAKE_FLAG_TYPE_AUX2, _) \ } \ return os << "unknown"; \ } #define MAKE_FLAG_TYPE_AUX2(N,_) \ case F##N: return os << BOOST_PREPROCESSOR_CAT(#, F##N); #undef MAKE_FLAG_TYPE_AUX #undef MAKE_FLAG_TYPE_AUX2 But then I looked at my code and clearly saw this won't do it. One of the problems is that by preprocessing I'll get things like: #define MAKE_FLAG_TYPE2(TYPE_NAME, F1, F2) enum [...] That won't work because of the spaces between the commas. And also I doubt BOOST_PREPROCESSOR_CAT(#, F##N) will work So, does anyone has any suggestions on how to implement my MAKE_FLAG_TYPE<N> macros using the Preprocessor library? Or is it just not possible? Thanks Gustavo Guerra

3 3

Compile error with boost::tokenizer and Forte 6U2
by JULES D'ENTREMONT 18 Dec '01

18 Dec '01

Hi, I'm trying to use boost::tokenizer to tokenize colon-separated strings of the form "path1:path2:path3...". I wrote the following simple test program: #include <string> #include "boost/tokenizer.hpp" void func() { std::string s("abc:def:ghi"); boost::char_delimiters_separator<char> tokenizerFunc(false, "", ":"); boost::tokenizer<boost::char_delimiters_separator<char> > tokenizer(s, tokenizerFunc); } However, this fails to compile with the Sun Forte 6U2 compiler. It spews out the following error messages: "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/detail/ob_compressed_pair.hpp", line 416: Warning (Anachronism): Type names qualified by template parameters require "typename". "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/detail/ob_compressed_pair.hpp", line 416: Warning (Anachronism): Type names qualified by template parameters require "typename". "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/detail/iterator.hpp", line 382: Warning (Anachronism): Type names qualified by template parameters require "typename". "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/detail/iterator.hpp", line 382: Warning (Anachronism): Type names qualified by template parameters require "typename". "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/iterator_adaptors.hpp", line 922: Error: Invalid template parameter default. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/iterator_adaptors.hpp", line 925: Error: Invalid template parameter default. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/iterator_adaptors.hpp", line 1116: Warning (Anachronism): Type names qualified by template parameters require "typename". "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/iterator_adaptors.hpp", line 1133: Error: value is not a member of boost::is_convertible<boost::detail::reduce_to_base_class<std::forward_iterator_tag, boost::detail::iterator_traits<boost::detail::Iterator>::iterator_category>::type*, std::bidirectional_iterator_tag*>. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/token_iterator.hpp", line 90: Where: While specializing "boost::detail::non_bidirectional_category<const char*>". "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/token_iterator.hpp", line 90: Where: Specialized in boost::token_iterator_generator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/tokenizer.hpp", line 37: Where: Specialized in boost::tokenizer<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>. "boostTest.cc", line 10: Where: Specialized in non-template code. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/iterator_adaptors.hpp", line 1133: Error: An integer constant expression is required here. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/token_iterator.hpp", line 90: Where: While specializing "boost::detail::non_bidirectional_category<const char*>". "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/token_iterator.hpp", line 90: Where: Specialized in boost::token_iterator_generator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/tokenizer.hpp", line 37: Where: Specialized in boost::tokenizer<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>. "boostTest.cc", line 10: Where: Specialized in non-template code. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/iterator_adaptors.hpp", line 1134: Error: The type "boost::STATIC_ASSERTION_FAILURE<0>" is incomplete. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/token_iterator.hpp", line 90: Where: While specializing "boost::detail::non_bidirectional_category<const char*>". "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/token_iterator.hpp", line 90: Where: Specialized in boost::token_iterator_generator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>. "/nsm/rollsbuild/thirdparty/boost/boost_1_25_0/boost/tokenizer.hpp", line 37: Where: Specialized in boost::tokenizer<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>. "boostTest.cc", line 10: Where: Specialized in non-template code. 5 Error(s) and 7 Warning(s) detected. *** Error code 5 Am I using the class incorrectly, or is this a genuine problem? Jules d'Entremont -- Jules d'Entremont jules.dentremont(a)alcatel.com Alcatel Canada http://batai.ca.newbridge.com/~julesd 600 March Road 613-784-6633 Kanata ON, K2K 2E6

3 4

Re: [Boost-Users] Re: Compile error with boost::tokenizer and Forte 6U2
by George Heintzelman 18 Dec '01

18 Dec '01

(moved to boost developers list) [snip most of the changes for SunPro CC] > Also ifdef BOOST_STATIC_ASSERTs on is_input_or_output_iter and > forward_iter_with_real_reference (~lines 616-630). Whoa Nelly. I also found most of the changes you suggested, but I looked into these assert failures compiling on SunPro 5.3 -- and I found that they really were indicating that the compiler was doing something wrong with the typedefs inside the constructed iterator. Ignoring the problem by #ifdefing these out I think may cause problems with the iterator adaptors in some contexts, though I think they will probably work correctly for simple dereferencing and incrementing. To fix (at least partly) these, I found I needed to turn on some of the hacks for BORLANDC in the detail/named_template_params header, specifically the ones to use type_traits::yes_type instead of a bool specialization. I also needed to turn on BOOST_BUGGY_INTEGRAL_CONSTANT_EXPRESSIONS for the static_assert header; I suspect the BORLANDC #ifdefs I had to turn on are related to this same problem, and they ought to be unified in the config header. Once that was done, the compiler still got itself quite confused by the line in detail/named_template_params.hpp: typedef typename choose_arg_or_default<typename is_default<Arg> ::type>::type Selector; Splitting this up into typedef typename is_default<Arg>::type is_default; typedef typename choose_arg_or_default<is_default>::type Selector; seemed to keep the compiler from getting itself all screwed up. This got me part of the way there, but one of those two Static_asserts was still firing, and it seemed to me correctly so (that is, correctly in that the compiler was behaving incorrectly elsewhere). I came to the conclusion that it was still the same buggy integral constant specialization problem -- if I were to rewrite some of the selector code to use yes_type instead of a bool specialization, I believe I could get it to work, but given that that would have meant some wholesale changes to type_traits, I stopped there. George Heintzelman georgeh(a)aya.yale.edu

1 0

Compose/mem_fun/confusion
by dmoore99atwork 18 Dec '01

18 Dec '01

Hello, I'm trying to explore the compose, bind, and mem_fn libraries. I used a "real" problem I'm having. Given a vector<Trade>, I want to gather a sum of the return values of Trade::volume(). I wound up writing "accumulate_with_op" thusly: template <class _InputIterator, class _Tp, class _UnaryOperation> _Tp accumulate_with_op(_InputIterator first, _InputIterator last, _Tp Init, _UnaryOperation unary_op) { for ( ; first != last; ++first) Init = Init + unary_op(*first); return Init; } And I can call it like this: vector<Trade> li; // ..... sum = accumulate_with_op(li.begin(),li.end(),0,mem_fun_ref (&Trade::volume)) This gives me my sum pretty nicely, so I'm sort of happy... BUT... I tried for a long time to use combinations of for_each, compose_f_gx, and mem_fn to be able to do the Sum (to lead to other things like mean, stddev) into a stateful function object. Something like this: /* broken code, trying to convery my intentions */ MeanValue m1; m1 = for_each(l.begin(), l.end(),compose_f_gx(MeanValue(),mem_fun_ref (&Trade::volume)); cout << m1.result(); I wanted my MeanValue::operator() to be called with the return value from my member function, and I wanted to be able to "capture" the result in a function object i could interrogate afterwards. 1. Am I barking up the wrong tree? accumulate_with_op was pretty easy to write, but my problem seemed straighforward enough to be solved with standard c++ or Boost building blocks. 2. Or I am just using the wrong compiler (MSVC6 SP5)? Thanks, Dave

5 5

Compiler status: win32 question
by kelvinlao 18 Dec '01

18 Dec '01

Does a failure on the Compiler Status chart http://www.boost.org/status/cs-win32.html indicate that a certain compiler cannot use the boost libraries fully? Take for instance, the failure of Visual C++ reported against libs/concept_check/class_concept_fail_expected.cpp: What exactly does this failure mean to a user of the boost libraries? Does it render the boost library or some portion therein unusable by the VC++ programmer? Thanks! -k

2 1

RE: [Boost-Users] Compose/mem_fun/confusion
by Moore, Dave 18 Dec '01

18 Dec '01

Thanks very much for the informative response. Dave > -----Original Message----- > From: Douglas Gregor [mailto:gregod@cs.rpi.edu] > Sent: Friday, December 14, 2001 4:50 PM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] Compose/mem_fun/confusion > > > On Friday 14 December 2001 03:06 pm, you wrote: > > Hello, > > > > I'm trying to explore the compose, bind, and mem_fn libraries. I > > used a "real" problem I'm having. Given a vector<Trade>, I want to > > gather a sum of the return values of Trade::volume(). > [...] > > vector<Trade> li; > > // ..... > > sum = accumulate_with_op(li.begin(),li.end(),0,mem_fun_ref > > (&Trade::volume)) > > > > This gives me my sum pretty nicely, so I'm sort of happy... BUT... > > Here are two ways to compute the sum without defining your > own functions or > classes. Both methods use std::accumulate (which, of course, > is what you're > trying to do), but the difference is in the way that > Trade::volume() is > called. > > The first code snippet uses Boost.Bind only. We essentially > create a function > object that takes two arguments, x and y, and then performs > the operation x + > y.Volume(). We get '+' by using the standard library's > plus<int>, and we use > the fact that bind is composable to call Volume on the second > argument. The > code is thus: > > std::accumulate(li.begin(), li.end(), 0, > boost::bind<int>( > std::plus<int>(), > _1, > boost::bind(&Trade::Volume, _2))); > > The other option is philosophically different. Instead of > transforming he > values as we add them, we instead transform the sequence we > are adding using > the Boost Iterator Adaptors library. The transform_iterator adapts an > iterator by applying a function object to each element as it > is dereferenced. > Therefore, the sequence that accumulate "sees" is the result > of calling > Trade::Volume on each member of the underlying sequence. > Here's the code: > > std::accumulate( > boost::make_transform_iterator(li.begin(), > > boost::mem_fn(&Trade::Volume)), > boost::make_transform_iterator(li.end(), > > boost::mem_fn(&Trade::Volume)), > 0); > > I consider this version better (philosphically) because the > accumulation is > over things we can actually accumulate - integers. The > transform_iterator > version is also more reusable code, because now you have the > ability to > transform a sequence of Trade objects (or Trade object > pointers - see the > documentation of mem_fn) into their corresponding trade > volumes, and other > operations become simpler. > > Code was tested under GCC 2.95.3, but I expect it will work for MSVC5. > > Doug > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Unlimited PC-PC calling at Crystal Voice! - Only $1/Mo. > Download your free 30 day trial. Click here. > http://us.click.yahoo.com/Gb1xVB/GxbDAA/ySSFAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > >

1 0

Simple iterator adaptor example
by Duane Murphy 17 Dec '01

17 Dec '01

I have taken a quick look at iterator adaptor and it seems quite powerful. It seems that iterator_adaptor has two uses. First to adapt one iterator to another. It also seems like it should be able to be used as an interface to other information that has container like qualities that needs an iterator. For example files in directory. Does anyone have an example of how to build one of the later? Not specifically an iterator over files, but the general ability to build an iterator from something that's not an iterator? Thanks for the pointers, ..Duane

1 0

RE: [Boost-Users] MSVC6 and tuple
by Tom Matelich 17 Dec '01

17 Dec '01

Yeah, I also avoid any using in any header, but what are you going to do if you can't compile otherwise? > -----Original Message----- > From: Darin Adler [mailto:darin@bentspoon.com] > Sent: Monday, December 17, 2001 2:15 PM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] MSVC6 and tuple > > > On 12/17/01 12:36 PM, "Tom Matelich" <tmatelich(a)zetec.com> wrote: > > > Any suggestions? > > This may not be what you have in mind, but in my own code I prohibit: > > using namespace boost; > > But in code outside header files, I always use: > > using boost::tuple; > > And the like, except in cases where there are name conflicts. > So I have > includes at the top of my source files, followed by using statements, > followed by code. > > -- Darin > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Need new boots for winter? Looking for a perfect gift for > your shoe loving friends? > Zappos.com is the perfect fit for all your shoe needs! > http://us.click.yahoo.com/ltdUpD/QrSDAA/ySSFAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > >

1 0

MSVC6 and tuple
by Tom Matelich 17 Dec '01

17 Dec '01

I have a tuple as a member of one of my classes, and it appears, that MSVC 6 requires me to do a using boost::tuple, rather than declaring it with the boost namespace at the var. For this declaration in my header: boost::tuple<int, double> willis; I get the following error: file.h(161) : error C2059: syntax error : '<' file.h(161) : error C2238: unexpected token(s) preceding ';' If I add the using (which I would prefer not to do), the declaration: tuple<int, double> willis; works fine. Any suggestions?

2 1

transitive_closure_test.cpp
by Janos Murvai 17 Dec '01

17 Dec '01

Hi, I compiled this program: transitive_closure_test.cpp with: g++ -ftemplate-depth-30 -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ transitive_closure_test.cpp then I run: Created graph with 13 vertices. transitive_closure Segmentation fault (core dumped) Exit 139 What can I do in this case? Thank you, Janos

2 11

Why not "if (px != rpx) " ?
by Louis Lavery 17 Dec '01

17 Dec '01

Hello, The following is use by the boost shared_ptr assignment operators (see boost\smart_ptr.hpp)... void share(T* rpx, long* rpn) { if (pn != rpn) { // Q: why not px != rpx? A: fails when both == 0 ++*rpn; // done before dispose() in case rpn transitively // dependent on *this (bug reported by Ken Johnson) dispose(); px = rpx; pn = rpn; } } // share ...I curious to know what it means by "fails when both == 0". I mean, I can't see as the sky would fall in if the test was "if (px != rpx)". Am I missing something? Thanks, Louis.

3 7

preprocessor/min and MSVC
by Rodney.Schuler＠ing-dm.com 14 Dec '01

14 Dec '01

I saw the boost preprocessor library and I thought that BOOST_PREPROCESSOR_MIN might help solve a problem in some code that I am maintaining. This code has the naive implementation of MIN and MAX: #define MIN(a,b) ((a)<(b)?(a):(b)) This code also has many (tens of thousands!) of places where a function calls are used as arguments to MIN and MAX like this: foo=MIN(func(args1),func(args2)) The function called is a very long running function. The performance hit taken by three evaluations of the function is a problem I am working to fix. I know the best solution is to add some local variables, and store the results of the functions in them, then use MIN on the local vars. But I'd like to get some Idea of how much performance increase I am likely to get by crawling through the code and fixing all the occurrences of MIN(func(args1),func(args2)) Wondering if BOOST_PREPROCESSOR_MIN had a way to make only two evaluations of func I wrote: #include <iostream> #include <boost/preprocessor/min.hpp> using std::cout; using std::endl; int func(int i) { cout << " func called " << i << endl; return i; } int main () { cout << "result " << BOOST_PREPROCESSOR_MIN(func(1),func(2)) << "\n" << endl; cout << "result " << BOOST_PREPROCESSOR_MIN(func(4),func(3)) << "\n" << endl; return 0; } And my compilers (MSVC 5 sp3 and MSVC 6 sp5) responded thusly: C:\temp\boostminvc5\main.cpp(15) : error C2065: 'BOOST_PREPROCESSOR_IF_BOOLBOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_IF_BOOLBOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_NOR_BOOLBOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_ADDBOOST_PREPROCESSOR_SUBfunc' : undeclared identifier C:\temp\boostminvc5\main.cpp(15) : error C2065: 'BOOST_PREPROCESSOR_SUBfunc' : undeclared identifier C:\temp\boostminvc5\main.cpp(15) : error C2146: syntax error : missing ';' before identifier 'BOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_ADDBOOST_PREPROCESSOR_SUBfunc' C:\temp\boostminvc5\main.cpp(15) : error C2065: 'BOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_ADDBOOST_PREPROCESSOR_SUBfunc' : undeclared identifier C:\temp\boostminvc5\main.cpp(15) : error C2065: 'BOOST_PREPROCESSOR_NOR_BOOLBOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_SUBfunc' : undeclared identifier C:\temp\boostminvc5\main.cpp(15) : error C2146: syntax error : missing ')' before identifier 'BOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_SUBfunc' C:\temp\boostminvc5\main.cpp(16) : error C2146: syntax error : missing ';' before identifier 'BOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_ADDBOOST_PREPROCESSOR_SUBfunc' C:\temp\boostminvc5\main.cpp(16) : error C2146: syntax error : missing ')' before identifier 'BOOST_PREPROCESSOR_BOOLBOOST_PREPROCESSOR_SUBfunc' First, this is a bug report. Second, can anybody answer my question does BOOST_PREPROCESSOR_MIN get around the unnecessary evaluations problem? Thanks -Rodney Rodney.Schuler(a)ing-dm.com

2 1

run test programs...
by Janos Murvai 13 Dec '01

13 Dec '01

Hi, I'm one new user. I tried to run test programs in the : ..../boost_1_26_0/libs/graph/test When I try to compile: g++ -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ adj_matrix_cc.cpp I got many error message (some example from the error messages): What can I do in this case? /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/iterator_adaptors.hpp:817: instantiated from `boost::iterator_adaptor<boost::iterator_adaptor<char *,boost::detail::dir_adj_matrix_out_edge_iter_policies<unsigned int,char *,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int> *,boost::multi_pass_input_iterator_tag,int>,boost::filter_iterator_policies<boost::detail::does_edge_exist,boost::iterator_adaptor<char *,boost::detail::dir_adj_matrix_out_edge_iter_policies<unsigned int,char *,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int> *,boost::multi_pass_input_iterator_tag,int> >,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int> *,boost::multi_pass_input_iterator_tag,int>' /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/adjacency_matrix.hpp:326: instantiated from `boost::adjacency_matrix<boost::directedS,boost::no_property,boost::no_property,boost::no_property,allocator<bool> >' /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/graph_traits.hpp:38: instantiated from `boost::graph_traits<boost::adjacency_matrix<boost::directedS,boost::no_property,boost::no_property,boost::no_property,allocator<bool> > >' /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/graph_concepts.hpp:177: instantiated from `boost::VertexListGraphConcept<boost::adjacency_matrix<boost::directedS,boost::no_property,boost::no_property,boost::no_property,allocator<bool> > >' /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/concept_check.hpp:41: instantiated from `boost::function_requires<boost::VertexListGraphConcept<boost::adjacency_matrix<boost::directedS,boost::no_property,boost::no_property,boost::no_property,allocator<bool> > > >()' adj_matrix_cc.cpp:35: instantiated from here /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/type_traits/composite_traits.hpp:204: incomplete type `boost::is_member_pointer<char *>' does not have member `value' Thank you, Janos

2 1

run test programs..
by Janos Murvai 13 Dec '01

13 Dec '01

Hi, I'm one new user. I tried to run test programs in the : ..../boost_1_26_0/libs/graph/test When I try to compile: g++ -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ adj_matrix_cc.cpp I got many error message (some example from the error messages): What can I do in this case? /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/iterator_adaptors.hpp:817: instantiated from `boost::iterator_adaptor<boost::iterator_adaptor<char *,boost::detail::dir_adj_matrix_out_edge_iter_policies<unsigned int,char *,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int> *,boost::multi_pass_input_iterator_tag,int>,boost::filter_iterator_policies<boost::detail::does_edge_exist,boost::iterator_adaptor<char *,boost::detail::dir_adj_matrix_out_edge_iter_policies<unsigned int,char *,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int> *,boost::multi_pass_input_iterator_tag,int> >,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int>,boost::detail::matrix_edge_desc_impl<boost::directed_tag,unsigned int> *,boost::multi_pass_input_iterator_tag,int>' /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/adjacency_matrix.hpp:326: instantiated from `boost::adjacency_matrix<boost::directedS,boost::no_property,boost::no_property,boost::no_property,allocator<bool> >' /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/graph_traits.hpp:38: instantiated from `boost::graph_traits<boost::adjacency_matrix<boost::directedS,boost::no_property,boost::no_property,boost::no_property,allocator<bool> > >' /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/graph_concepts.hpp:177: instantiated from `boost::VertexListGraphConcept<boost::adjacency_matrix<boost::directedS,boost::no_property,boost::no_property,boost::no_property,allocator<bool> > >' /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/concept_check.hpp:41: instantiated from `boost::function_requires<boost::VertexListGraphConcept<boost::adjacency_matrix<boost::directedS,boost::no_property,boost::no_property,boost::no_property,allocator<bool> > > >()' adj_matrix_cc.cpp:35: instantiated from here /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/type_traits/composite_traits.hpp:204: incomplete type `boost::is_member_pointer<char *>' does not have member `value' Thank you, Janos

1 0

boost.regex and submatches
by John Maddock 13 Dec '01

13 Dec '01

>I'm trying to match strings of the form "a&b&c&d" with the following >expression: "(?:([^&]+)&)*([^&]+)". This nicely matches the whole >string but instead of giving me the submatches "a", "b", "c" and "d" >I just get "c" and "d". Could anyone tell me what I'm doing wrong? Look more closely at your expression: it has only *two* marked sub-expressions, $1 gets "overwritten" each time it matches. - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

2 1

boost.regex and submatches
by markus_schoepflin 13 Dec '01

13 Dec '01

Hi all, I'm trying to match strings of the form "a&b&c&d" with the following expression: "(?:([^&]+)&)*([^&]+)". This nicely matches the whole string but instead of giving me the submatches "a", "b", "c" and "d" I just get "c" and "d". Could anyone tell me what I'm doing wrong? Sample code, tested with MSVC6SP5 and Boost 1.26.0: #include <boost/regex.hpp> #include <string> #include <iostream> void main(void) { const char *input ="a&b&c&d"; const boost::regex syntax("(?:([^&]+)&)*([^&]+)"); boost::cmatch matches; if(boost::regex_match(input, matches, syntax)) { for (boost::cmatch::size_type i = 0; i < matches.size(); ++i) std::cout << static_cast<std::string>(matches[i]) << '\n'; } } Tia, Markus

1 0

try building graph library 1.25.1 with MSV6SP5
by acarsac＠yahoo.fr 13 Dec '01

13 Dec '01

Hi all, I' am trying to build the grap library with MSVC6SP5 (not with STLPORT 4.0, the FAQ said it does not work!). What I done: setting up MSVC vars remove space from directories upgrade jam. build boost. (everything ok exectpt ) changes %BOOST_ROOT%/jamfile //////////////////////////////// project-root ; subinclude libs/graph/build ; subinclude status ; //////////////////////////////// change %BOOST_ROOT%/libs/graph/build : //////////////////////////////// subproject libs/graph/build ; SOURCES = graphviz_graph_lex graphviz_digraph_lex graphviz_graph_parser graphviz_digraph_parser ; lib libbgl-viz : ../src/$(SOURCES).cpp : <define>GRAPHVIZ_GRAPH=boost::GraphvizGraph : <include>$(BOOST_ROOT) : debug <inlining>on ; //////////////////////////////// then: cd %BOOST_ROOT% jam -sBOOST_ROOT=. -sTOOLS="msvc" and getting soething like: msvc-Archive-action libs\graph\build\bin\libbgl- viz\msvc\debug\runtime-link-dynamic\libbgl-viz.lib Microsoft (R) Library Manager Version 6.00.8447 Copyright (C) Microsoft Corp 1992-1998. All rights reserved. graphviz_digraph_parser.obj : fatal error LNK1179: invalid or corrupt file: duplicate comdat "?get_v alue@?$property_value_end@U? $property@W4graph_graph_attribute_t@boost@@V?$map@V?$basic_string@DU? $ch ar_traits@D@std@@V?$allocator@D@2@@std@@V12@U?$less@V? $basic_string@DU?$char_traits@D@std@@V?$alloca tor@D@2@@std@@@2@V?$allocator@V?$basic_st2ff4a489" how to fix it, it is the right way to proceed ? Alex

7 15

RE: [Boost-Users] Polymorphic containers (was Re: shared_ptr and inheritance)
by Björn Karlsson 12 Dec '01

12 Dec '01

> From: rz0 [mailto:rz0@yahoo.com] > Hi Bjorn > > Thank you very much for the reply. > > Unfortunately these classes are provided to me and as part of the > requirements, I must be able to work with them. In re-thinking the > problem, it seems that I'm in desperate need of a polymorphic > container - i.e.: > > > Does boost have any polymorphic containers? > > Thanks very much in advance. > > I don't think that polymorphism is the cure - you'll always need to downcast the pointer as the signatures differ. However, there is support in Boost for what you're trying to do - through boost::any. Like I said before, the solution will not be very clean, but it will work. The code snippet below seems to do what you're asking for: #include <iostream> #include <algorithm> #include <vector> #include <Boost\Any.hpp> class A { public: virtual void func1() { std::cout << "A::func1()\n"; }; }; class B : public A { public: void func1() { std::cout << "B::func1()\n"; }; void funcB() { std::cout << "B::funcB()\n"; }; }; class C : public A { public: void func1() { std::cout << "C::func1()\n"; }; void funcC() { std::cout << "C::funcC()\n"; }; }; typedef std::vector<boost::any> AnyVector; void DoStuffWithAny(boost::any& a) { // Try with a B if ( B* pB = boost::any_cast<B>(&a) ) { pB->func1(); pB->funcB(); } // Try with a C else if ( C* pC = boost::any_cast<C>(&a) ) { pC->func1(); pC->funcC(); } // Try with an A else if ( A* pA = boost::any_cast<A>(&a) ) { pA->func1(); } } void DoStuffWithAnyPointer(boost::any& a) { // Try with a B if ( B** ppB = boost::any_cast<B*>(&a) ) { (*ppB)->func1(); (*ppB)->funcB(); } // Try with a C else if ( C** ppC = boost::any_cast<C*>(&a) ) { (*ppC)->func1(); (*ppC)->funcC(); } // Try with an A else if ( A** ppA = boost::any_cast<A*>(&a) ) { (*ppA)->func1(); } } int main(int argc, char* argv[]) { AnyVector aVector; A a; B b; C c; aVector.push_back(a); aVector.push_back(b); aVector.push_back(c); // Do interesting things std::for_each(aVector.begin(), aVector.end(), DoStuffWithAny); AnyVector anotherVector; anotherVector.push_back(new A); anotherVector.push_back(new B); anotherVector.push_back(new C); // Do interesting things std::for_each(anotherVector.begin(), anotherVector.end(), DoStuffWithAnyPointer); return 0; } Another approach would be to provide adapters, but I'm guessing that wouldn't be worth the trouble. HTH, Bjorn Karlsson [Non-text portions of this message have been removed]

2 1