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

List host change
by Jon Kalb 04 Sep '03

04 Sep '03

Boost Users, We are moving the Boost-Users mailing list from Yahoo! Groups to a mailman based system. This means that effective immediately mail for Boost Users should be send to boost-users(a)lists.boost.org. You can manage your own subscriptions at http://lists.boost.org/mailman/listinfo.cgi/boost-users . If you have been subscribed to this list receiving individual mail messages or digest messages, then we have subscribed you to the mailman list with the same settings. If you were subscribed with either "no email" or "special emails only" then you will need to re-subscribe to the list by visiting http://lists.boost.org/mailman/listinfo.cgi/boost-users . Note that in order to send messages to this list you must be subscribed to the list. This does not mean that you must receive email from the list. You can use the "no email" setting and read and reply by newsgroup, but you must be a subscriber or your messages will not be accepted. If you have any questions or problems please contact the list moderators at boost-users-owner(a)lists.boost.org. Please note that questions and problems related to the list are off topic on this list and should only be sent to the list moderators. -- Jon Kalb SmartFriends(TM) U: Languages and Libraries Kalb(a)LibertySoft.com Sept. 26-28 http://SmartFriends.com/U Keynote: STL Creator, Alexander Stepanov

1 0

Pb with threads on Mac OS X Carbon.
by degaine1966 03 Sep '03

03 Sep '03

Hi, I'd like to use shared pointers with CodeWarrior 8.3 in a Carbon application. I have some preprocessing errors, the first one being relative to a thread Macro being undefined: lightweight_mutex.hpp line 86 # error Unrecognized threading platform I read in boot/config/plateform/macos.hpp that Boost was thread safe under Carbon but apparently there is no macro to define the usable type of thread... Any help appreciated, Bruno

1 0

Filesystem Lib Feature Request
by Robert W. Johnstone 03 Sep '03

03 Sep '03

Hello, Has any thought been given to member functions for the path class for handling filename extensions? It should be easy to add code for most systems to extract or change the extension. Thanks, ------------------------------------------ Robert Johnstone Simon Fraser University http://www.sfu.ca/~rjohnsto/

2 1

ostream_iterator and std::copy - better solutions?
by Jeff Flinn 03 Sep '03

03 Sep '03

Before rolling my own, does boost have a facility to stream out an iterator range without the dangling delimiter at the end? For example std::ostream& operator<<( std::ostream& s, const MyClass& aC ) { const std::string lDelim( "," ); std::vector<int> lInts; lInts.push_back(1); lInts.push_back(2); lInts.push_back(3); std::ostream_iterator<int> lItr( s, lDelim.c_str() ); std::copy( lInts.begin(), lInts.end(), lItr ); } yields: 1,2,3, I'm thinking something like the following usage would be nice: s << range_streamer( lInts.begin(), lInts.end(), "{", "," "}" ); yielding: {1,2,3} Any thoughts? -- Jeff Flinn Applied Dynamics, International

1 0

RE: [Boost-Users] boost lambda examples
by Paul Grenyer 03 Sep '03

03 Sep '03

Hi Matt > > >for_each( v.begin(), v.end(), cout << *_1 << '\n' ); > > >I get the following errors: > That only makes sense with vector<int*>... as per the example, from > memory... > I think you meant vp.begin() etc. Yes, that's it! So what I actually wanted was: for_each( v.begin(), v.end(), cout << _1 << '\n' ); That'll teach me copy code from two different examples without applying my brain to it. Thanks, Matt! Regards Paul Paul Grenyer Email: pjgrenyer(a)iee.org Web: www.paulgrenyer.co.uk You cant buy time, but you can sell your soul and the closest thing to heaven is to Rock n' Roll.

1 0

boost lambda examples
by paulgrenyer 03 Sep '03

03 Sep '03

Hi MSVC 7.1, Windows 2000 I'm trying to get to grips with the boost lambda library. I've managed to get the first example to work: #include <boost/lambda/lambda.hpp> #include <iostream> #include <cstdlib> #include <list> #include <algorithm> int main() { using namespace std; using namespace boost::lambda; list<int> v(10); for_each(v.begin(), v.end(), _1 = 12 ); return EXIT_SUCCESS; } but when I add the following line (also from the docs): for_each( v.begin(), v.end(), cout << *_1 << '\n' ); I get the following errors: error C2039: 'reference' : is not a member of 'std::iterator_traits<int>' error C2146: syntax error : missing ';' before identifier 'type' error C2501: 'boost::lambda::detail::contentsof_type<A>::type' : missing storage-class or type specifiers error C2039: 'type' : is not a member of 'boost::lambda::detail::contentsof_type<A>' error C2146: syntax error : missing ';' before identifier 'type' I've tried including some the other Lambda headers but this didn't improve the situation. Regards Paul

2 1

RE: [Boost-Users] boost lambda examples
by Hurd, Matthew 03 Sep '03

03 Sep '03

>From: paulgrenyer [mailto:pjgrenyer@iee.org] >Subject: [Boost-Users] boost lambda examples >for_each( v.begin(), v.end(), cout << *_1 << '\n' ); >I get the following errors: That only makes sense with vector<int*>... as per the example, from memory... I think you meant vp.begin() etc. Cheers, Matt.

1 0

"invalid token pasting" macro bug
by James W. Walker 03 Sep '03

03 Sep '03

When I use Spirit with CodeWarrior 9 (just released), I get a bunch of warnings as shown below. The CodeWarrior release notes explain that "According to the language standard, the '##' token pasting operator can only generate other tokens. This warning indicates when a paste was found that did not result in a token. The code will still compile as it did previously, but it may be a useful hint if the compiler emits an error later on." Warning : invalid token pasting of 'BOOST_PP_LIST_FIRST_I' and '(' (included from: expanding macro 'BOOST_PP_LIST_FIRST' expanding macro 'BOOST_PP_LIST_FOR_EACH_I_M_D' expanding macro 'BOOST_PP_LIST_FOR_EACH_I_M' expanding macro 'BOOST_PP_FOR_1_C' expanding macro 'BOOST_PP_FOR_1' expanding macro 'BOOST_PP_LIST_FOR_EACH_I' type_traits.hpp:58 composite.ipp:16 composite.hpp:15 directives.hpp:27 numerics.hpp:19 core.hpp:34 spirit.hpp:30 ParseCalcLine.cp:5) type_with_alignment.hpp line 55 on_ptr, BOOST_PP_NIL)))))))))))) -- <http://www.jwwalker.com/>

4 3

how to create fixtures in unit test framework
by Anders Moe 03 Sep '03

03 Sep '03

Hi all. The boost unit test framework seems to lack the xUnit buildUp/tearDown (whatever) methods meant to faciliate the creation of fixtures. Does that mean there is an alternative idiom to achieve the same effect ? Constructing new class-test-cases for each test seems a bit overkill. Regards, Anders.

7 14

Lambda operator= question
by Rodolfo Lima 02 Sep '03

02 Sep '03

Hi people, That's the first time I'm using lambda and I'm stuck with something that can be resumed to: struct A { int Test() { return 0; } }; int x; A a; (var(x)=bind(&A::Test,_1))(a); In other words, I want to make a functor that calls a member function and stores its return value in some variable. I'm compiling with VC7.1 and it returns error C2440: '=' : cannot convert from 'const boost::tuples::cons<HT,TT>::stored_head_type' to 'int' Is there something I can do to get rid of this error and compile successfully? I'm appending the whole compiler output in the end of the post. Thanks, rod //--------- Whole compiler output c:\RodSoft\lib\boost\boost\lambda\detail\operator_lambda_func_base.hpp(242) : error C2440: '=' : cannot convert from 'const boost::tuples::cons<HT,TT>::stored_head_type' to 'int' with [ HT=const boost::lambda::detail::parameter_traits_<const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>,const boost::lambda::detail::IF<false,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>> &,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>>::RET>::type, TT=boost::tuples::detail::map_tuple_to_cons<boost::tuples::null_type,boost:: tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::t uples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tu ples::null_type,boost::tuples::null_type,boost::tuples::null_type>::type ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called c:\RodSoft\lib\boost\boost\lambda\detail\lambda_functors.hpp(153) : see reference to function template instantiation 'RET boost::lambda::lambda_functor_base<Act,Args>::call<boost::lambda::lambda_fun ctor_base<Act,Args>::sig<SigArgs>::type,A,const boost::tuples::null_type,const boost::tuples::null_type,const boost::tuples::null_type>(A &,B &,C &,Env &) const' being compiled with [ RET=boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::la mbda::assignment_action>,boost::tuples::tuple<boost::lambda::lambda_functor< boost::lambda::identity<int &>>,const boost::lambda::detail::parameter_traits_<const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>,const boost::lambda::detail::IF<false,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>> &,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>>::RET>::type,boost::tuples::null_type,boost: :tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost:: tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::t uples::null_type>>::sig<boost::tuples::tuple<A &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type, boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>> ::type, Act=boost::lambda::other_action<boost::lambda::assignment_action>, Args=boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::ident ity<int &>>,const boost::lambda::detail::parameter_traits_<const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>,const boost::lambda::detail::IF<false,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>> &,const boost::_bi::bind_t<int,boost::_mfi::mf 0<int,A>,boost::_bi::list1<boost::_bi::list_av_1<boost::arg<1>>::B1>>>::RET> ::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null _type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_ type,boost::tuples::null_type,boost::tuples::null_type>, SigArgs=boost::tuples::tuple<A &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type, boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, A=A, B=const boost::tuples::null_type, C=const boost::tuples::null_type, Env=const boost::tuples::null_type ] c:\RodSoft\pessoal\TstConsole\TstConsole.cpp(49) : see reference to function template instantiation 'boost::lambda::lambda_functor_base<Act,Args>::sig<SigArgs>::type boost::lambda::lambda_functor<T>::operator ()<A>(A &) const' being compiled with [ Act=boost::lambda::other_action<boost::lambda::assignment_action>, Args=boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::ident ity<int &>>,const boost::lambda::detail::parameter_traits_<const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>,const boost::lambda::detail::IF<false,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>> &,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>>::RET>::type,boost::tuples::null_type,boost: :tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost:: tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::t uples::null_type>, SigArgs=boost::tuples::tuple<A &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type, boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, T=boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lamb da::assignment_action>,boost::tuples::tuple<boost::lambda::lambda_functor<bo ost::lambda::identity<int &>>,const boost::lambda::detail::parameter_traits_<const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>,const boost::lambda::detail::IF<false,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>> &,const boost::_bi::bind_t<int,boost::_mfi::mf0<int,A>,boost::_bi::list1<boost::_bi: :list_av_1<boost::arg<1>>::B1>>>::RET>::type,boost::tuples::null_type,boost: :tuples::null _type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_ type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_t ype>>, A=A ] Build log was saved at "file://c:\RodSoft\pessoal\TstConsole\Debug\BuildLog.htm" TstConsole - 1 error(s), 0 warning(s)

3 2

CodeWarrior PS2, Boost, & STL
by Yohann DOS SANTOS 02 Sep '03

02 Sep '03

Hello Boost Users, When i try to compile a class that use a vector with CodeWarrior for PS2 R3.03, i have this error message : Error : illegal use of incomplete struc/union/class 'Metrowerks::compile_assert<0>' (instantiating: 'std::vector<int, std::allocator<int>>') (instantiating: 'std::__vector_imp<int, std::allocator<int>, l>') vector line 729 ompile assert<bool(sizeof(T) == sizeof(typename Metrowerks::strore_as<T>;;type))> And just above the error line, in the vector file : // Error : illegal use of incomplete struct/union/class 'Metrowerks::compile_assert<0>' // This means that the store_as table in <msl_utility> is not set correctly. // sizeof(T) == sizeof(typename Metrowerks::store_as<T>::type must be true. The code compiles and works perfectly with VC6 sp5 on PC and XBOX. Thanks for any help.

2 1

[BGL] Adding one graph to another
by Tarjei Knapstad 02 Sep '03

02 Sep '03

I need to add/copy one graph into another, both completely connected, and then create an edge between one vertex in the original graph and a vertex in the one copied into it. The edge/vertex properties needs to be copied as well, and this needs to be fairly efficient. The new edge is straightforward, but is there any functionality for the copy/add operation? (Something like an "add_component" algorithm I guess...) To my understanding both the copy_graph and copy_component algorithms both replace all the content in the target graph. If not, what would be the most efficient way to solve this sort of problem? Cheers, -- Tarjei Knapstad

2 3

spirit list_p example
by Larry 02 Sep '03

02 Sep '03

From boost-1.30.2 I built the list_parser.cpp example using MSVC++7.1. In the CSV list I added ",,2" to the end of the line to be parsed. The program ran but the neither of the added elements were included in the output vector. Having used the tokenizer before I know it will generally gobble up adjacent delimiters without any output. You can get the empty token if you ask for the delimiters as well and then just discard the delimiters (sort of). But I was surprised that the 2 didn't make it to the output vector. I expected the empty list entry would not make the output vector. I tried adding ~anychar_p to the rule but that didn't help. If I change the input list to add ",\"\",2" I get "" and 2 in the output vector. Applications like spreadsheets do not put missing column values for numeric columns as "" items generally. Maybe I am missing something because it certainly isn't the behavior I would expect (either from the parser or the tokenizer).

4 9

adjancency propoerty iterator
by sashan 02 Sep '03

02 Sep '03

Hi Is there an adjancency iterator for property types. You can get an iterator for property types like this: typedef graph_property_iter_range<GraphType, vertex_name_t>::iterator VNameIterator; .... tie(It, ItEnd) = get_property_iter_range(m_Graph, vertex_name); I'd like to know if there is something similar for adjacency iterators. Thanks [Non-text portions of this message have been removed]

1 0

RE: [Boost-Users] Given std::map<ID,struct>, efficient way to access std::vector<struct.member>?
by Sam Partington 01 Sep '03

01 Sep '03

Well, I've trimmed you're example down some more, as to me it didn't seem to be important that the struct was a member of CFilter. So I think your question boils down to : struct A { int a; }; typedef std::map<int, A> my_map; void do_something_on_a_slice(int a) { // whatever } void f(const my_map& map_) { std::for_each(map_.begin(), map_.end(), /*what goes here*/); } You could use iterator_adaptors for this, but I think that is complicating things unnecessarily, something like this would work (untested) : struct select_a : std::unary_function<my_map::value_type, int> { const result_type& operator()(const argument_type& arg) const { return arg.second.a; } // similar non const operator here }; void f(const std::map<int, A>& map_) { boost::projection_iterator_generator<select_a, my_map::const_iterator>::type first(map_.begin()), last(map_.end()); std::for_each(first, last, do_something_on_a_slice); } See http://www.boost.org/libs/utility/projection_iterator.htm But I think bind in this situation is a better solution. (Partly because the interface to iterator_adaptors will be changing in the next release, possibly to the point of breaking the above code - Jeremy?) void f(const my_map& map_) { using boost::bind; std::for_each(map_.begin(), map_.end(), bind(do_something_on_a_slice, bind(&A::a, bind(&my_map::value_type::second, _1) ) ) ); } Though at this point I would consider writing a function object, any expression involving three bind's is getting close to (or some might say past) write-only code. As to efficiency, if this is a bottleneck it is mostly likely the iteration over the map that is causing the problem, or the actual 'doing' code. Most of the binding code should be optimised away by the compiler to a bare mimimum. It may be that you are better changing container, a sorted vector perhaps. HTH Sam (PS Apologies if I did miss a point somewhere and oversimplify your code) Chris Russell <> wrote: > Hello folks, I've got an interesting little design problem > and I'm looking > for some advice on how best to implement an efficient solution. (snip) > Here's a simplified statement of the problem that I believe > outlines the > relevant details: > > I've got a class declared as follows: > > --- begin example class ---- > In English: CFilter declares some structure with some number > of data members > of arbitrary types. Internally CFilter allocates a std::map of these > structures using some key_t. Effectively this defines a table > of data whose > rows are of type sRow_t, and whose columns can be conceptualized as > std::vector<A_t>, std::vector<B_t> where > std::vector<sRow_t.some_member>.size() == mapData<key_t, > sDataRow_t>.size(). > > At runtime, CFilter.ProcessRow is called std::map<key_t, > sRow_t>.size() times followed by a single call to CFilter.ProcessData. > > I'm trying to figure out how to _efficiently_ access the > column vectors in > the implementation of CFilter.ProcessData.

1 0

[BGL] Installing a property
by sashan 31 Aug '03

31 Aug '03

Hi I have a mass spring system where the particles are mapped to the vertex name property of the vertex. Now I've read (in the BGL red book) that one can install a custom property using an enumerated type. However it says that the enum must be a unique number. How do I enforce this in my code? Do I have to manually track the numbers myself? Thanks sashan [Non-text portions of this message have been removed]

2 1

Given std::map<ID,struct>, efficient way to access std::vector<struct.member>?
by Chris Russell 31 Aug '03

31 Aug '03

Hello folks, I've got an interesting little design problem and I'm looking for some advice on how best to implement an efficient solution. [ I posted this message to comp.lang.c++.moderated yesterday. I'm reposting here because this _seems_ like a job for some type of iterator adaptor and I'm thinking that perhaps one of the Boost libraries might be useful in this context. But which (if any)? Would uBLAS help me here perhaps? Or am I way off base? ] Here's a simplified statement of the problem that I believe outlines the relevant details: I've got a class declared as follows: --- begin example class ---- class CFilter { public: typedef struct tag_sRow { A_t A; B_t B; C_t C; .. .. .. // some number of structure members... } sRow_t; typedef std::map<key_t/*type unimportant*/, sDataRow_t> mapData_t; typedef mapDataSet_t::iterator mapiterData_t; typedef mapDataSet_t::const_iterator mapconstiterData_t; private: mapData_t m_mapData; public: void ProcessRow(const sRow_t& sRow) { // process a single row of data } // end method ProcessRow void ProcessData(const mapData_t& mapData) { // algorithm needs fast access to: // std::vector<A_t>, std::vector<B_t>, std::vector<C_t> .... } // end method ProcessData }; // end class declaration CFilter --- end example class --- In English: CFilter declares some structure with some number of data members of arbitrary types. Internally CFilter allocates a std::map of these structures using some key_t. Effectively this defines a table of data whose rows are of type sRow_t, and whose columns can be conceptualized as std::vector<A_t>, std::vector<B_t> where std::vector<sRow_t.some_member>.size() == mapData<key_t, sDataRow_t>.size(). At runtime, CFilter.ProcessRow is called std::map<key_t, sRow_t>.size() times followed by a single call to CFilter.ProcessData. I'm trying to figure out how to _efficiently_ access the column vectors in the implementation of CFilter.ProcessData. Any suggestions would be greatly appreciated. Thanks in advance - Chris Russell

1 0

Inconvenience in time_parsing.hpp - uninit variables
by Larry Knain 30 Aug '03

30 Aug '03

I was trying to use the date_time ptime functions with ISO syle input (boost 1.30.2 with MSVC++6 SP5). The function parse_undelimited_time_duration in time_parsing has three short variables hours, min, and sec that are uninitialized which lead to unpredictable results. These are at line 99. I stumbled on to this when I passed a string "20011027T0202" to ptime(from_iso_string()). To my surprise when I printed the value out it came back as 20011026T222345! The code works OK as is if you always pass a full HHMMSS. This must have been found in parse_delimited_time_duration as it has unsigned shorts that are intialized to zero.

2 1

[BGL] adjancency iterators for property types
by sashan 30 Aug '03

30 Aug '03

Hi Is there an adjancency iterator for property types. You can get an iterator for property types like this: typedef graph_property_iter_range<GraphType, vertex_name_t>::iterator VNameIterator; .... tie(It, ItEnd) = get_property_iter_range(m_Graph, vertex_name); I'd like to know if there is something similar for adjacency iterators. Thanks -- sashan http://www.cs.auckland.ac.nz/~sgov008/

1 0

boost::function syntax
by shyamemani 29 Aug '03

29 Aug '03

Hello everyone, I was looking at the boost::function preferable syntax. boost::funcion<float (int,int) > I also see that this has also been accepted by the standard for future STL implementation. The C++ grammar for template declaration is as stated below: template-argument-list: template-argument template-argument-list , template-argument template-argument: assignment-expression type-id id-expression None of the 'declaration' rules also seem to parse the tokens 'float (int,int) (I know I am missing something here). I could not figure out why the string 'float (int,int)' is accepted by the compiler and what type it is assigned? Is it just a extension of the standard by GCC? Can somebody help me figure this out? Thanks, Shyam

5 21

Broken link on boost.org/libs page
by Sam Partington 29 Aug '03

29 Aug '03

http://www.boost.org/libs/hdr_depend.html Is giving a HTTP 404 error. Cheers Sam

1 0

Re: Lambda shortcut?
by Daryle Walker 27 Aug '03

27 Aug '03

On Tuesday, August 26, 2003, at 10:05 AM, Jaakko Jarvi wrote: > In our last exciting episode Stephen Love wrote: >> operator-> *is* overloadable. > > It is, but not freely. The return type cannot be arbitrary, say a > lambda_functor type, making it not very useful for the LL. Specifically, the right side of "->" must be the NAME of a class' member or member function. It cannot be any kind of actual object (including pointers-to-member). This restricts the left side to: 1. A pointer to a (class/struct/union) data object (conventional C usage) 2. A class object with an "operator ->()" that returns a pointer to a data object 3. A class object with an "operator ->()" that returns an object that follows rules [2] or [3]. No matter what, "operator ->()" eventually leads to the standard C usage. All you can do is delay the event and build proxy objects to obtain the data. Daryle

1 0

Link errors
by Ken Crismon 26 Aug '03

26 Aug '03

To all, I am a new user to the BOOST community and am putting together some test code to get a handle on what BOOST is and how it works. Am using .NET 2003 and am getting the following link errors. error LNK2019: unresolved external symbol "__declspec(dllimport) public: class std::_Ptrit<char,int,char *,char &,char *,char &> __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::end(void)" Thanks in advance for the help, Ken Crismon

2 1

First Boost installation under Windows and Borland
by Matías Nicolás Bossa 26 Aug '03

26 Aug '03

Hello, I'm a new Boost user and I need to install it (v. 1.30.0) under Windows 2000, with Borland C++ Builder 6. I've succeed in correctly installing and using it under linux, but I couldn't install it under Windows. I downloaded and unpacked boost_1_30_0.zip. I set the following variables: BOOST_ROOT=d:\proyect\boost_1_30_0 TOOLS=borland BCCROOT=c:\archiv~1\borland\cbuilder6 PYTHON_ROOT=c:\win\python I compiled bjam.exe by running tools\build\jam_scr\build.bat, and put it somewhere in the path. (but I also tried downloading a precompiled version) I run bjam from the boost_1_30_0 directory and the following message appeared: /****************************************************/ /****************************************************/ ...found 5339 targets... ...updating 573 targets... borland-C++-action libs\python\build\bin\boost_python.dll\borland\debug\runtime-link-dynamic\numeric.obj libs\python\build\../src\numeric.cpp: Error E2401 D:\project\boost_1_30_0\boost/python/object/inheritance.hpp 69: Invalid template argument list Error E2040 D:\project\boost_1_30_0\boost/python/object/inheritance.hpp 69: Declaration terminated incorrectly Error E2231 D:\project\boost_1_30_0\boost/python/object/inheritance.hpp 130: Member cast_generator<Source,Target>::is_upcast cannot be used without an object Error E2401 D:\project\boost_1_30_0\boost/python/object/inheritance.hpp 131: Invalid template argument list Error E2040 D:\project\boost_1_30_0\boost/python/object/inheritance.hpp 132: Declaration terminated incorrectly Error E2228 D:\project\boost_1_30_0\boost/python/object/inheritance.hpp 132: Too many error or warning messages *** 6 errors in Compile *** /****************************************************/ /****************************************************/ For the moment I just need ublas and random libraries, I need boost in order to compile another library which use it, called Bayes++. I wil be very grateful if someone could help me, and I'm sorry for the length of the mail. Regards, Matías ___________________________________________________ Yahoo! Messenger - Nueva versión GRATIS Super Webcam, voz, caritas animadas, y más... http://messenger.yahoo.es

2 3

Lambda shortcut?
by Hurd, Matthew 26 Aug '03

26 Aug '03

Hi, Is there a short cut for bind(&class::method_name, this, _1)? I could wrap it in a macro, as I use it enough, but is there something nicer I'm missing? I often just do the for loop as it is a little more readable, maybe... For example, for( some_collection::iterator i = check_list.begin(); i!= check_list.end(); ++i ) { turn_off_calcs(*i); } Is hopefully the same as for_each( check_list.begin(), check_list.end(), lambda::bind(&instrument_store::turn_off_calcs,this,lambda::_1) ); Regards, Matt.

3 3

How to use boost::bind
by Darren Cook 26 Aug '03

26 Aug '03

Hi, I have a project with many occurences of while loops iterating through a container, and operating on the data. I'd like to use for_each() and turn them into one-liners, but I don't like writing one-off functor classes. I was hoping boost::bind could help, but I've read the docs, scratched my head, and failed to work out how the examples apply to my case. Maybe they don't and I'm trying to use it for something it cannot do? See an example below. My function currently looks something like grab_keys() and I want it to look like grab_keys2(). Could some kind soul show me how to write this? (or explain why it cannot be written). Thanks, Darren ------------------------- class Info{ public: int key; std::set<int> points; }; class InfoContainer{ public: Info* get(int); }; void grab_keys(const InfoContainer &cs,const Info *c){ std::set<int> list; std::set<int>::const_iterator i=c->points.begin(); while(i!=c->points.end()){ Info *ec=cs.get(*i++); list.add(ec->key); //Previous two lines could be written: list.add(cs.get(*i++)->key); } //Do something with list here. } void grab_keys2(const AllInfo &cs,const Info *c){ Points list; std::for_each(c->points.begin(),c->points.end(), boost::bind( /* what goes here? */ ) ); //Do something with list here. }

3 4

newbie: comand line for g++
by Ruslan Talpa 26 Aug '03

26 Aug '03

how to staticaly link a boost library (regex) to a project (what is the g++ command line for that) Thanks PS i have only used VC till now.

2 1

XML output from Boost test framework.
by Jarl Friis 26 Aug '03

26 Aug '03

Hi. The release notes on Boost test framework says: XML log format is introduced XML report format is introduced I would like to know how I use those features, the documentation says nothing about it, at least I can't find it. Thanks in advance. Jarl

2 3

ClearCase and Boost
by Matt Trentini 26 Aug '03

26 Aug '03

Heya, The best way I've found to import Boost into ClearCase is by using "clearfsimport". If anyone wants a hand in setting up the parameters (it's a bit tricky - please make sure you don't use the mklabel and preview options together, otherwise you'll lock the VOB!) let me know. Cheers, Matt

1 0

filesystem in CVS differs from 1.30.x ?
by Anders Moe 26 Aug '03

26 Aug '03

Hi all. I'm somewhat confused about how to use filesystem, since it appears that the CVS version differs from 1.30.x. In particular, the following simple snippet suddenly wouldn't compile on 1.30.2 using MSVC 7.1: boost::filesystem::path p("dd"); boost::filesystem::ofstream os("dd"); It works, however, with the current CVS version. In fact, I have failed to compile any variant of the above under 1.30.2. Regards, Anders Moe.

2 1

mem mapping containers
by spam_me_da 25 Aug '03

25 Aug '03

I'd like to know if there is any available implementation of a memory mapped linear array. (Linux) Thanks -K

1 0

boost::lambda how to question
by Eric Twietmeyer 25 Aug '03

25 Aug '03

Hello, I'm been having great fun getting to know and starting to use the lambda library over the past month or so. I can't believe how well the optimizing compiler I have (Vc7.1) is able to convert these lambda expressions used in for_each or find_if into tight loops. However, there I things I'm certain are possible, but I haven't been able to figure out. More examples of using the library than are found in the doc would be extremely useful. For instance, how do I do the equivalent of the following using a single for_each with suitable lambda expression as operator? using namespace boost::lambda; std::vector<int> vec1; std::vector<int> vec2; struct tOp { std::vector<int>& m_vec; tOp( std::vector<int>& vec ) : m_vec( vec ) {} void operator()( int entry ) { std::vector<int>::iterator it = std::find_if( m_vec.begin(), m_vec.end(), _1 == entry ); if ( it != m_vec.end() ) m_vec.erase( it ); } }; // How to use lambda expression here for third arg? std::for_each( vec1.begin(), vec1.end(), tOp( vec2 )); Basically, I have two lists (vectors) that overlap. I want to erase all elements from the one vector from the other vector, i.e. determine if the element from vec1 exists in vec2, and if so erase it from vec2. If this is possible and relatively straight forward using a lambda expression, I would love to see an example. Thanks in advance, Eric Twietmeyer PS It looks like something of this sort can be done with std::set_difference if one outputs into a third vector, but for argument's sake, let's assume I don't want to introduce a third vector. --------------------------------- Do you Yahoo!? Yahoo! SiteBuilder - Free, easy-to-use web site design software [Non-text portions of this message have been removed]

2 1

boost.thread, DEC C++ (OpenVMS)
by Johan Nilsson 25 Aug '03

25 Aug '03

Hi, I've just tried to compile boost.thread under OpenVMS and got it working mostly fine, with a few quirks. I'm using Boost 1.30.2 and DEC C++ 6.5 under OpenVMS Alpha 7.1-1H1. OpenVMS provides a compliant(?) pthreads implementation. Note that I did _not_ use Boost.jam (I did try, but couldn't get it going). Compiling the .cpp files under BOOST_ROOT/libs/thread/src works pretty fine, once having defined BOOST_HAS_THREADS, BOOST_HAS_PTHREADS and BOOST_HASTIMEOFDAY on the compiler's commandline. But not for tss.cpp - I get the following error: ------------------------------------------------------------------------- res = pthread_key_create(&m_key, cleanup); .....................................^ %CXX-E-INCOMPATIBLEPRM, argument of type "void (*)(void *)" is incompatible with parameter of type "void (*)(void *) C" at line number 192 in file DISK$USER1:[COMMON.BOOST.LIBS.THREAD.SRC]TSS.CPP;1 ---------------------------------------------------------------------------- --- After some digging around I found out that the error only appears when using the compiler switch "/standard=strict_ansi", which is what I'm using all the time. Now to me it looks like the DEC C++ compiler believes that name mangling isn't the only thing that differs between "C" and "C++" linkage - does anyone here have any comments on that? See below for a small example (and possible way to work around this in the boost.thread implementation): ------ sample.cpp ------- extern "C" { typedef void (*c_linkage_cb_t)(void*); void c_linkage(void (*pfn)(void*)); } inline void cpp_linkage_using_c_typedef(c_linkage_cb_t pfn) { c_linkage(pfn); } inline void cpp_linkage(void (*pfn)(void*)) { c_linkage(pfn); } ---------------- end sample.cpp ------------------- And here's the output from the compiler: $ cxx /standard=strict_ansi t.cpp c_linkage(pfn); ..................^ %CXX-E-INCOMPATIBLEPRM, argument of type "void (*)(void *)" is incompatible with parameter of type "void (*)(void *) C" at line number 19 in file DISK$USER1:[COMMON.BOOST.LIBS.THREAD.SRC]T.CPP;11 I don't know if this is a compiler bug or not, but in order to work around this in boost.thread, wouldn't it be feasible to provide a similar fix to the tss implementation to avoid the compilation problem - e.g. ---- tss.hpp ----- ... extern "C" { typedef int (*pthread_<something>_cb_t)(void*); } ... class tss { ... ... tss(pthread_<something>_cb_t cb) ... --- end tss.hpp ---- Comments appreciated // Johan

2 3

out of core property map and constant property map
by Joel Young 24 Aug '03

24 Aug '03

Has anyone created property maps that operate out of core? either against a database or a flat file? Would you like to share? Also has anyone created a property map that, once create returns a constant value for all queries (writable is nice, it doesn't do anything with the write of course)? This might be useful for compactly representing constant edge capacities. Finally, an out of core BasicMatrixConcept implementation for use with all-pairs shortest path on largish (n=1.6M, e=10*n) graphs would be handy. Thanks, Joel

1 0

graph adapter from bidirectional to undirected
by Joel Young 24 Aug '03

24 Aug '03

Has anyone created a graph adapter to make a bidirectional graph appear as an undirected graph? If not, is the difficulty in making an edge iterator across both the in and out links? I particular I would like to compute a weak connected components on a bidirectional graph. So if you have a modified connected components alg for that it would be great. Thanks, Joel

1 0

bjam exe for cygwin on win98
by Fernando Cacciola 23 Aug '03

23 Aug '03

Hi, The link on http://www.boost.org/tools/build/index.html#Jam states that bjam executables can be found at: http://sourceforge.net/project/showfiles.php?group_id=7586 but I don't know which of the bjams there is an executable for cygwin on win98 TIA Fernando Cacciola

3 5

Parent-Child Object Relationships with shared_ptr
by Martin Ecker 23 Aug '03

23 Aug '03

Hello, I've been thinking of switching one of my projects to use boost::smart_ptr and I'm currently investigating this option a bit. In my project there are a lot of cases where an object acts as factory/parent object to create other child objects. These child objects must keep the parent object alive as long as one of them still exists. Or in other words, even if the client does not hold a pointer to the parent object anymore, the parent must continue to exist as long as there is still a child object. Also the child objects sometimes need to have access to the parent object that created them. Therefore, I thought I'd have them hold a shared_ptr to the parent object. So the situation looks something like this, where both Parent and Child objects are only allocated on the heap and should only be passed around as shared_ptr. class Parent { public: boost::shared_ptr<Child> CreateChild() const { boost::shared_ptr<Child> child(new Child(this)); return child; } }; class Child { friend class Parent; protected: Child(const boost::shared_ptr<Parent> parent) : m_parent(parent) {} private: boost::shared_ptr<Parent> m_parent; }; As far as I understand it I can't do new Child(this) because Child expects a shared_ptr, so I'd have to derive Parent from enable_shared_from_this. However, in my project there are a number of classes in a rather complicated class hierarchy to which the above pattern applies and I'd thus like to avoid having to (multiply) derive them from enable_shared_from_this. Is there another, possibly better way of achieving what I want to do (keep the parent alive as long as there are still child objects) that I haven't discovered yet? Or do I really have to derive all these classes from enable_shared_from_this? Do I have to derive each class in a class hierarchy from enable_shared_from_this, if each of them needs to give out a shared_ptr-managed this pointer? Thanks for any help, Martin

3 2

newbie trying to make a dll
by schmitty9812003 22 Aug '03

22 Aug '03

This is my very first experience with Boost. I am actually trying to use the SDTS++ libraries (if anyone is familiar with them) which use Boost. Anyway, I successfully built the library using the Jamfile that was included with the download which looks something like this: lib sdtsxx : ... : <include>$(BOOST_ROOT) <include>$(TOP) <include>. <include>$(TOP)/Windows # to get bogus "unistd.h" <rtti>on <exception-handling>on <msvc><*><cflags>-TP # force to compile as C++ <gcc><*><cflags>"-x c++" # force to compile as C++ <gcc><*><define>VECTOR_ITERATOR_POINTER_NOT_EQUIVALENT : debug release ; However, what I need is for the library to be a dll. So I changed the Jamfile to look something like this: SOURCES = ...; dll sdtsxx : $(SOURCES) : <include>$(BOOST_ROOT) <include>$(TOP) <include>. <include>$(TOP)/Windows # to get bogus "unistd.h" <rtti>on <exception-handling>on <msvc><*><cflags>-TP # force to compile as C++ <gcc><*><cflags>"-x c++" # force to compile as C++ <gcc><*><define>VECTOR_ITERATOR_POINTER_NOT_EQUIVALENT : debug release ; Unfortunately this gives me linking errors like this: sb_Accessor.obj : error LNK2001: unresolved external symbol "public: class boost::filesystem::path __thiscall boost::filesystem::path::branch_path(void)const "(? branch_path@path@filesystem@boost@@QBE?AV123@XZ) Now I don't know that this is a Boost problem or if I should go to the SDTS people. Since the unresolved externals are from the Boost libraries I figured it was a Boost issue. So am I doing something wrong with the Jamfile, or is there a problem with Boost? Or is it something completely different? Oh, I'm using msvc on an XP machine, if that matters... -ms

2 1

Compiler help
by Henry ?? 22 Aug '03

22 Aug '03

I'm trying to try out the thread library on HP-UX and SGI Irix using GNU GCC and have not been able to run them succesfully. I noticed that on the "Boost Regression Tests" the compiler Status for both my platforms and compilers have failed with messages similar to what I am getting. Do I have any options or is it just not possible to try the thread library for my systems. Thanks

4 3

request: complete list of output files of build?
by Li Lirong 22 Aug '03

22 Aug '03

Is it possible for the boosters to provide a complete list of the lib and dll files (include debug and release versions) that the build system produces? Thanks. Best regards, Lirong

1 0

RE: [Boost-Users] Re: Re: boost::intrusive_ptr and Managed C++?
by Ferdinand Prantl 22 Aug '03

22 Aug '03

Hi Holger, > -----Original Message----- > From: Holger Grund [mailto:yg-boost-users@gmane.org] > Sent: Thursday, August 21, 2003 14:50 > To: boost-users(a)yahoogroups.com > Subject: [Boost-Users] Re: Re: boost::intrusive_ptr and Managed C++? > > > "Ferdinand Prantl" <ferdinand.prantl(a)ixos.de> wrote > > > The second option (as Holger says) is to make a simple facade to the > c++ > > library (all you might use), which will not have templates (here > smart > > pointers) on the interface, and to use this facade instead. > > > Did I say that? Anyway, I absolutely agree. Oops, sorry, I thought a bit further... :-) > > I just want to point out that IMHO the best solution is to > _not_ export instrusive_ptr_add_ref and _release. If you do > new and delete are called from different modules which works > only if the same CRT instance is used. And that works only if > both link against the exact same version of the CRT dll (that > is both linking against a static CRT still yields to > instances => two heaps => error). The generally safest solution yes, but not always the simpliest and most understandable. With a pile of C++ libraries with templates and STL on interface to use, I would not be very keen on writing facades for each and every... Every such a wrapper also increases the complexity of the solution. > > While we're at it, it's almost always a bad thing to export > classes or functions that rely on classes from a DLL. DLLs > are a run time concept. They don't have any clue which > version of the compiler a consumer is built with. > > E.g. say you export a function > void foo( std::string& s ) > { > s = "Hello World!"; > } Oh yeah, that's terrible constraint - if releasing binary library, one must support more compilers and also create different binary names (e.g. boost_regex). It is not needed if you release sources of the library (not the case of commercial APIs). If STL is widely used in the dependency tree of libraries, it is a pity to abandon it from their interfaces, building special marshalling structures or serializing into streams or return pointers. In this situation I broke the general recommendation (no templates on iface), preferred simplier solution and went on with STL on interfaces. It is cheaper and runs faster too. I moved the task of creating a facade without STL to the person, who needs it. As long as everybody are happy with usage of the same STL on interface, such a facade does not need to be borned (for managed .net assemblies it is also not necessary)... > > The DLL is built with the version A of the compiler and STL > and the consuming application is built with version B. There > is no guarantee for a binary compatibility between the two > version. And indeed the code above will break if version 6 & > 7 of VC are used (The former used a COW scheme while the > second uses a short string optimization). This must not happen. It is responsibility of the build configuration to use the belonging import libraries. It can be checked and forced by pragmas in msvc. Ferda > > Also, do note that the DLL CRT now supports side by side sharing. > > While I am in rant mode the catch(...) thing is also a very > bad idea in VC. This currently catches (this will be fixed in > 8.0) structured exception that are not C++ exception. That > way serious error conditions are silently ignored. > > -hg > > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> Buy Ink Cartridges or Refill Kits > for Your HP, Epson, Canon or Lexmark Printer at Myinks.com. > Free s/h on orders $50 or more to the US & Canada. > http://www.c1tracking.com/l.asp?cid=5511 > http://us.click.yahoo.com/l.m7sD/LIdGAA/qnsNAA/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

boost::python - double vs. int - unexpected behavior
by cavok＠filibusta.crema.unimi.it 21 Aug '03

21 Aug '03

hi, i attached a simple example that shows the following behavior: $ python Python 2.2.3+ (#1, Aug 10 2003, 10:11:23) [GCC 3.3.1 (Debian)] on linux2 Type "help", "copyright", "credits" or "license" for more information. >>> import test >>> a=test.A() >>> a.f(3) double >>> a.f(3.8) double >>> a.f(int(3)) double >>> $ well, doesn't it look weird? any idea on how i can get the correct c++ method called? cheers dom -----[ Domenico Andreoli, aka cavok --[ http://filibusta.crema.unimi.it/~cavok/gpgkey.asc ---[ 3A0F 2F80 F79C 678A 8936 4FEE 0677 9033 A20E BC50 [Non-text portions of this message have been removed]

2 3

[BGL] How to destroy a subgraph?
by Stefan Slapeta 21 Aug '03

21 Aug '03

Hi, is it possible to destroy a subgraph child? I didn't find nothing on this in the documentation. Is there any other way to free the subgraph's resources? Thanks, Stefan

2 2

RE: [Boost-Users] Re: boost::intrusive_ptr and Managed C++?
by Ferdinand Prantl 21 Aug '03

21 Aug '03

Hello Drew, I implement managed assembly in mc++. I use c++ library with smart pointers and stlport on the interface to implement a functionality in unmanaged c++, even if it is exposed to .net through managed classes. So this scenario in general works. Holger has already answered you, I see also the problem in different heaps/runtime versions. You must ensure the same versions of the runtime (not only debug/release but also version of msvs - 6, 7, 7.1) and of the templated libraries used (in my case stlport for 6, 7, 7.1, which also must use the same runtime). I use msvcrt/msvcrtd everywhere and link everything automatically using pragmas to prevent strange errors from manual configuration. It can look complex but in reality it is pretty simple. The second option (as Holger says) is to make a simple facade to the c++ library (all you might use), which will not have templates (here smart pointers) on the interface, and to use this facade instead. Good Luck, Ferda P.S. with the first option you will come to problems if you register the assembly for CCW but that's another story... -----Original Message----- From: Holger Grund [mailto:yg-boost-users@gmane.org] Sent: Wednesday, August 20, 2003 18:18 To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: boost::intrusive_ptr and Managed C++? "Drew" <drewtenn(a)yahoo.com>, > I originally posted this to microsoft.public.dotnet.languages.vc, > but they referred me back to here. > > Has anyone used boost's intrusive_ptr with Managed C++ extensions? > Mmh, not really. And it actually doesn't (currently ?) sound like a very compelling idea to me. > I have a small project where the executable (managed) is linked to a > native C++ dll. > > The code looks like: > > int _tmain() > { > boost::intrusive_ptr<Unmanaged> pUn = __nogc new Unmanaged(); > > return 0; > } > > when I exit out of main, boost::intrusive_ptr_release() throws an > exception. The last known method called is: > > UnmanagedLib.dll!_CrtIsValidHeapPointer(...) Line 1807 > This probably is not related to the managed extensions. It's more likely that intrusive_ptr's dtor calls into the DLL to free the pointer which is only possible if both modules use the DLL version of the CRT. The message indicates that the pointer to be freed is bogus or more likely from another heap. This is caused by a mismatch of the CRTs used by the main program and the DLL. You could use the /MD[d] option for both projects, so that both modules share a common CRT heap. I'd prefer to move intrusive_ptr_add_ref/release functions to the program that uses the instrusive_ptr. Don't export these functions from the DLL. Rather include these functions at build time. That way you ensure, that operator delete is called from the same module as operator new and everything should be fine. > Unmanaged* pUm = new Unmanaged(); > delete pUm; > Yep. Same module. No problem. hth -hg ------------------------ Yahoo! Groups Sponsor ---------------------~--> Buy Ink Cartridges or Refill Kits for Your HP, Epson, Canon or Lexmark Printer at Myinks.com. Free s/h on orders $50 or more to the US & Canada. http://www.c1tracking.com/l.asp?cid=5511 http://us.click.yahoo.com/l.m7sD/LIdGAA/qnsNAA/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/

3 3

[BGL] single pair problem with bfs
by Jérémie Leguay 21 Aug '03

21 Aug '03

Hi everybody! I really need to perform the single-pair problem. I have begin to implement it as it is written in some mail of the mailing list. I do a breadth first search and I want to use both a visitor recor_distances and a visito of my own which throws an exception to stop the algorithm when the destination is found. My problem is that I did'nt found the way to mix theses two visitors. Can you help me? regards, Jérémie ___________________________________________________________ Do You Yahoo!? -- Une adresse @yahoo.fr gratuite et en français ! Yahoo! Mail : http://fr.mail.yahoo.com

2 1

boost::intrusive_ptr and Managed C++?
by Drew 20 Aug '03

20 Aug '03

I originally posted this to microsoft.public.dotnet.languages.vc, but they referred me back to here. Has anyone used boost's intrusive_ptr with Managed C++ extensions? I have a small project where the executable (managed) is linked to a native C++ dll. The code looks like: int _tmain() { boost::intrusive_ptr<Unmanaged> pUn = __nogc new Unmanaged(); return 0; } when I exit out of main, boost::intrusive_ptr_release() throws an exception. The last known method called is: UnmanagedLib.dll!_CrtIsValidHeapPointer(...) Line 1807 but when I replace my code with: Unmanaged* pUm = new Unmanaged(); delete pUm; no exception is thrown. Please help! -Drew

2 1

lambda&MSVC7.0 problem
by GIE 20 Aug '03

20 Aug '03

Hello! While trying to compile empty test prog (only #include "boost/lambda/lambda.hpp" and main) i've got following errors: ...\lambda\detail\arity_code.hpp(66) : error C2065: 'T' : undeclared identifier ...\boost\lambda\detail\arity_code.hpp(66) : error C2687: cannot define a nested UDT of a template class out of line ...\boost\lambda\detail\arity_code.hpp(66) : fatal error C1903: unable to recover from previous error(s); stopping compilation Can this be helped? (boots version 1.30.0) -- With best regards, GIE.

2 1

[bgl] question to induced subgraphs
by Stephan Höfer 20 Aug '03

20 Aug '03

Hello, I use an induced subgraph of a graph with additional user defined properties like coordinates and so on. Do I have access to this properties via the get and put functions using the indices of the subgraph or do I have to access these properties via the parent (if it is the root) resp. root of the subgraph? I tried both without the demanded success. Using the second way the results were a little bit more accurate than using the first way, but they were wrong in either case. I created the subgraph as Graph& tSubgraph = g.create_subgraph; where g is a before initialized graph. Maybe it works copying the properties to the subgraph, but that wouldn't be efficient in my opinion. Thanks in advance for your answers, Stephan

1 0

PC-Lint reports errors for VC6-specific implementation in is_same.hpp
by stefan_felkel2000 20 Aug '03

20 Aug '03

Hi all, Since I have included boost\dynamic_bitset.hpp in my project, PC-Lint reports many thousands of redefinitions of symbol 'is_same_part_1<<1>>::part_2<<1>> for the following code in type_traits\is_same.hpp. #ifdef BOOST_MSVC // the following VC6 specific implementation is *NOT* legal // C++, but has the advantage that it works for incomplete // types. template< typename T1 > struct is_same_part_1 { template<typename T2> struct part_2 { enum { value = false }; }; template<> struct part_2<T1> { enum { value = true }; }; }; If I replace #ifdef BOOST_MSVC with #if (defined BOOST_MSVC) && (BOOST_MSVC < 1300) The code compiles with Visual Studio .NET 2003 and PC-Lint doesn't report any error. Stefan Felkel

2 2

ClearCase and Boost
by Matt Trentini 20 Aug '03

20 Aug '03

Heya Everyone, We use Rationals ClearCase for our source code control here at work and I'm trying to figure out how to best integrate Boost into the ClearCase VOB's. I understand that this probably isn't the ideal forum but I felt certain that someone else out there has a similar configuration! My issue has to do with the different versions of boost. I don't need to maintain a complete source history (don't need every change to every file, just regular releases) but I do want to have multiple versions located at the same place (ie ie want there to be only one boost directory, not boost_1_30, boost_1_30_2 etc) with labels to specify the version. This way our build environment can always look at the one place in the VOB's and we use our config spec to specify which version we're using. Should be simple. ;) Now, I can download a version of boost, extract the files, export them (with clearexport_ffile) then import (clearimport) to the VOB. Then I can label those files. Unfortunately, if any files (or directories) have been deleted I won't know about it - they'll just remain there. I had a quick scan through the attic files and it seems like deleting files is not particularly uncommon. I don't want those old files (which could have been deprecated or buggy or whatever) just lying around waiting for bugs to creep in. So does anyone know of a better way? How are other people doing this? Cheers, Matt PS I've thought of 'hacky' solutions, like telling clearexport_ffile to create a unique branch for every new version of boost and just leaving each new version on the branch...or creating a branch and then running a script over everything, determining if anything needs removing. But, as I said, these are hacky! :)

1 0