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

[BGL] adjacency_list: edge_descriptor ordering
by Ded Panas 12 Feb '04

12 Feb '04

Hi boost! How to store edge descriptors in a sorted container? There is no operator< for this type. Is it considered useless? In my graph building code I first build graph structure, and than calculate properties. So I need to remember edge descriptors between that stages... Also, about the docs: there is no link from Table of Contents to AdjacencyMatrix.html, where edge() function is described. TIA dedpanas

1 0

VTL question (sorry if this is slightly off-topic)
by Matt Verona 11 Feb '04

11 Feb '04

Hello, I was reviewing the View Template Library (VTL) - see http://www.zib.de/weiser/vtl/ ... and have a few questions regarding Views as applied to STL Maps. I was also wondering if Boost was planning to eventually provide a VTL-like framework? I'm looking for a type of View that provides read-only access to an STL map, with only const iterators, but also provides limited insertion and removal access as well (as shown below): This new limited View-like map will only allow clients to iterate using const iterators, and also provides only one public insert(const key&) and one erase(const key&) method. These insert and erase member functions need to be implemented as "Template Method Functions", as follows: (see Design Patterns) * Note: these are shown using the latest SGI STL implementation (i.e., the _M_t.insert_unique and _M_t.erase calls) virtual bool preInsert(const value_type&) { return true; } pair<iterator, bool> insert(const value_type& x) { if(preInsert(x) { return _M_t.insert_unique(x); } return make_pair(end(), false); // make compiler happy } virtual bool preErase(const key_type&) { return true; } size_type erase(const key_type& x) { if(preErase(x) { return _M_t.erase(x); } return 0; // make compiler happy } The preInsert and preErase methods are virtual Hook Methods, and derived classes override these to add behavior to the (non-virtual) insert and erase functions.. Another nice addition to this map view would be a const _Tp& operator[](const key_type& k) const function, implemented something like this: const _Tp& operator[](const key_type& k) const { const_iterator i = lower_bound(k); if(i == end() || key_comp(k, (*i).first)) // if i->first is >= k throw SearchError(k); return (*i).second; } * Note: this simple implementation assumes that the key can be converted to a string in the constructor of the SearchError exception object. I have at least three Manager-like (Mediator) classes that can use this pattern (i.e., derived from this Map View class) as well as others that need a vector view with a similar filtered design... Thanks in advance, ~Matt Verona Houston, Texas USA

1 0

[BGL] adjacency_list: OutEdgeList and EdgeList
by Ded Panas 11 Feb '04

11 Feb '04

I'm somewhat unclear about the difference between OutEdgeListS and EdgeListS selectors of adjacency_list. My questions is: 1. Why EdgeListS defaults to listS, while OutEdgeListS to vecS (BTW, doc says that EdgeListS defaults to vecS also) ? 2. In the docs ("Choosing the Edgelist and VertexList"), what is Edgelist: OutEdgeListS or EdgeListS? It is unclear (seems it is OutEdgeListS). TIA dedpanas

2 1

RE: [Boost-users] Re: Re: Thread creation state
by Kutch, Patrick G 11 Feb '04

11 Feb '04

Looking at the code, by 1st guess would be that you have a race condition. tObj->runthread() is getting executed before tObj->createthead() has finished its business and the worker thread has actually entered the mutex. Meaning that tObj->runthread() calls the notify_one() BEFORE the actual worker thread does a wait. Thus when your threadproc does a lock and then a wait, it will wait forever because nothing will do the notify_one() again. Race conditions are funny things, may work perfectly on one box forever, then change one line of code, or take it to another system and bad things happen. May also behave differently under different OS's - mutexes are a prime examle of this, under Windows they seem to be recursive by default, but not under LINUX. A down and dirty way to see if my theory is correct, put in a delay between the tObj->createthread() and tObj->runthread() lines. Hope this helps - if it does praise me with thanx, if it doesn't it was a crackpot theory or I haven't had sufficient coffee yet to make an intelligent analysis - you pick. :-) good luck, - Patrick -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Michael Glassford Sent: Wednesday, February 11, 2004 7:40 AM To: Boost Users mailing list Subject: [Boost-users] Re: Re: Thread creation state What I meant was, can you post a complete sample that you have actually compiled and run and that has actually demonstrated the problem? That obviously isn't the case with the code you posted because it contains syntax errors and the main() function in your second post doesn't match the definition of the testCommand class in your first post. Having said that, I fixed the errors the best I could and don't see the problem. It would help if you could: 1) Tell me what compiler and compiler version you're using. 2) Tell me what Boost version you're using. 3) Post a complete code sample that demonstrates the problem. 4) Specify what compile and link options you're using (perhaps you could attach a make file or project file?) Sorry; I'm trying to help, but if you want me to be able to figure out the problem you'll have to help me out. Mike ----- Original Message ----- From: <janardhan.guptha(a)efi.com> Newsgroups: gmane.comp.lib.boost.user Sent: Tuesday, February 10, 2004 11:32 PM Subject: RE: Re: Thread creation state > > The rest of the applicatin is just creating the object and preparing it > for execution. I am using Win32 version of boost.Thread implementation. > > The creation code snipet is > > void main() { > testCommand *tObj = new testCommand(11); > tObj->createthread(); > tObj->runthread(); > } > > > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Michael > Glassford > Sent: Wednesday, February 11, 2004 12:17 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Re: Thread creation state > > > It would be a lot easier to help if you could post a complete, > compilable example that demonstrates the problem. Also, it would be > useful to know whether you are using the Win32, pthread, or Mac > implementation of Boost.Thread. > > Thanks, > > Mike > > > <janardhan.guptha(a)efi.com> wrote in message > news:433CFA26BCA852438922F929E3D07955AE53A7@blraddc02.efi.internal... > > I am creating a boost thread, how to know in which state it is > created. > > I have a code snippet that is waiting always in the thread creatin > functon > > istelf. Where as i tried with some boost samples, they are working > amazingly > > perfect. This is how my code snippet looks like > > > > typedef boost::mutex::scoped_lock lock; > > class testCommand { > > static void threadfunc() { > > testCommand *testObj = mMapCommand[mObjID]; > > testObj->processthread(); > > }; > > > > static map< int mObjID, testCommand*> mMapCommand; > > private: > > void createthread() { > > mThread = new boost::thread(&testCommand::threadfunc); > > } > > void processthread() { > > lock lk(mMutex); > > mCondition.wait(lk); > > //// Some Action > > }; > > > > void runthread() { > > lock lk(mMutex); > > mCondition.notify_one(); > > }; > > > > public: > > static int mObjID; > > boost::thread *mThread; > > boost::condition mCondition; > > boost::mutex mMutex; > > }; > > > > > > The newly created thread is waiting at the following location > forever, by > > the time > > i get a chance to execute the new thread is greatly delayed. > > > > NTDLL! 77f8856e() > > boost::detail::thread::lock_ops<boost::mutex>::unlock(boost::mutex & > {...}) > > line 49 > > boost::detail::thread::scoped_lock<boost::mutex>::unlock() line 85 + > 11 > > bytes > > > boost::detail::thread::scoped_lock<boost::mutex>::~scoped_lock<boost:: > mutex> > > () line 74 > > `anonymous namespace'::thread_param::started() line 47 + 15 bytes > > thread_proxy(void * 0x0012fd74) line 71 > > _threadstartex(void * 0x00961040) line 212 + 13 bytes > > KERNEL32! 7c57b382() > > > > It sounds like i am missing something here. The queries here are > > 1. why it is waiting at the above specified line forever ? > > 2. Where can i get few worth thread samples done using boost::thread > > > > Regards > > Janardhan > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] Re: Conversions between shared_ptr<Base>andshared_ptr<Derived>
by Ben Hutchings 11 Feb '04

11 Feb '04

Konstantin Baumann <boost(a)ks-baumann.de> wrote: > For performance reasons I would like to see something like the > following conversion operators in shared_ptr<T>: > > template<class T> > class shared_ptr { > public: > ... > template<class S> > operator shared_ptr<S>&() throw() { > BOOST_STATIC_ASSERT(T* is convertible to S*); > return reinterpret_cast<shared_ptr<S>&>(*this); > } > > template<class S> > operator const shared_ptr<S>&() throw() const { > BOOST_STATIC_ASSERT(T* is convertible to S*); > return reinterpret_cast<const shared_ptr<S>&>(*this); > } > > }; // class shared_ptr<T> > > This would mimic the standard conversion from T* to S* without any > performance penalty for shared_ptr<T>. <snip> Don't sacrifice correctness for performance. First, the reinterpret_cast results in undefined behaviour. If you think you know that the actual behaviour is OK, you are wrong. If S is a base class of T then the conversion of T* to S* generally requires changing the bits of the pointer, unless S is the first non-virtual base. Second, if we can create a reference of type shared_ptr<S> to an object of type shared_ptr<T>, then we can also modify that object to contain a pointer of type S* which may not be convertible to T*.

1 0

RE: [Boost-users] Re: Thread creation state
by janardhan.guptha＠efi.com 11 Feb '04

11 Feb '04

The rest of the applicatin is just creating the object and preparing it for execution. I am using Win32 version of boost.Thread implementation. The creation code snipet is void main() { testCommand *tObj = new testCommand(11); tObj->createthread(); tObj->runthread(); } -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Michael Glassford Sent: Wednesday, February 11, 2004 12:17 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: Thread creation state It would be a lot easier to help if you could post a complete, compilable example that demonstrates the problem. Also, it would be useful to know whether you are using the Win32, pthread, or Mac implementation of Boost.Thread. Thanks, Mike <janardhan.guptha(a)efi.com> wrote in message news:433CFA26BCA852438922F929E3D07955AE53A7@blraddc02.efi.internal... > I am creating a boost thread, how to know in which state it is created. > I have a code snippet that is waiting always in the thread creatin functon > istelf. Where as i tried with some boost samples, they are working amazingly > perfect. This is how my code snippet looks like > > typedef boost::mutex::scoped_lock lock; > class testCommand { > static void threadfunc() { > testCommand *testObj = mMapCommand[mObjID]; > testObj->processthread(); > }; > > static map< int mObjID, testCommand*> mMapCommand; > private: > void createthread() { > mThread = new boost::thread(&testCommand::threadfunc); > } > void processthread() { > lock lk(mMutex); > mCondition.wait(lk); > //// Some Action > }; > > void runthread() { > lock lk(mMutex); > mCondition.notify_one(); > }; > > public: > static int mObjID; > boost::thread *mThread; > boost::condition mCondition; > boost::mutex mMutex; > }; > > > The newly created thread is waiting at the following location forever, by > the time > i get a chance to execute the new thread is greatly delayed. > > NTDLL! 77f8856e() > boost::detail::thread::lock_ops<boost::mutex>::unlock(boost::mutex & {...}) > line 49 > boost::detail::thread::scoped_lock<boost::mutex>::unlock() line 85 + 11 > bytes > boost::detail::thread::scoped_lock<boost::mutex>::~scoped_lock<boost:: mutex> > () line 74 > `anonymous namespace'::thread_param::started() line 47 + 15 bytes > thread_proxy(void * 0x0012fd74) line 71 > _threadstartex(void * 0x00961040) line 212 + 13 bytes > KERNEL32! 7c57b382() > > It sounds like i am missing something here. The queries here are > 1. why it is waiting at the above specified line forever ? > 2. Where can i get few worth thread samples done using boost::thread > > Regards > Janardhan _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

RE: [Boost-users] long compilation time of variant over long typelist with gcc
by Ben Hutchings 11 Feb '04

11 Feb '04

Graeme Lufkin <gwl(a)u.washington.edu> wrote: <snip> > When I compile code that declares a variable of this variant > type, the compilation takes unreasonably long (like, 1.5 hours on a > 2Ghz machine). For fewer types it goes much quicker, the transition > to unreasonably long happens around 14 types in the mpl::vector. <snip> > Something else I've noticed: the Intel compiler doesn't have the > compilation problem! I've attached sample case code that uses 16 > types, which takes less than 5 seconds to compile with Intel 8.0 and > almost 200 with GCC 3.2.2 (both on linux). > When I try the full 20 types I need, GCC chugs for several > hours, which is unacceptable for my project. Is there anything I can > do, or is this a GCC shortcoming that I need to wait for? I suggest you try newer versions of GCC (3.3 and 3.4 beta); if those still have the problem then report this as a bug at <http://gcc.gnu.org/bugs.html> with the keyword "compile-time-hog". Also check whether the poor performance is due to swapping, which indicates excessive use of memory and not necessarily excessive use of CPU time.

1 0

Spirit: pt_parse doesn't compile when using phrase_scanner_t for rules
by Steve Folly 11 Feb '04

11 Feb '04

Hi, I've read FAQ question number one about the free parse() function not compiling when and I've managed to get that to work by using rule<phrase_scanner_t> as suggested. However, I need to use the pt_parse method to create a parse tree. I'm obviously missing something really obvious because now pt_parse wont compile, even though I'm using a phrase_scanner_t because of the space_p skip parser. Any pointers most welcome. Thanks. Steve.

2 2

long compilation time of variant over long typelist with gcc
by Graeme Lufkin 10 Feb '04

10 Feb '04

I've recently become excited by the variant class and the apply_visitor technique. I've got a list of about 20 types that I want to handle in my variant (they're all related, so I won't need to supply 20 operator() to my visitors!). So I create a mpl::vector of the types, and then use make_variant_over to create my particular variant type. All this works fine (modulo a few days struggling to learn mpl stuff). When I compile code that declares a variable of this variant type, the compilation takes unreasonably long (like, 1.5 hours on a 2Ghz machine). For fewer types it goes much quicker, the transition to unreasonably long happens around 14 types in the mpl::vector. Side question: I finally found the macros BOOST_MPL_USE_PREPROCESSED_HEADERS and BOOST_MPL_LIMIT_VECTOR_SIZE that I had to suitably define to use such large mpl::vector-s. Are these documented anywhere, or am I missing the "suggested" way to do this? Something else I've noticed: the Intel compiler doesn't have the compilation problem! I've attached sample case code that uses 16 types, which takes less than 5 seconds to compile with Intel 8.0 and almost 200 with GCC 3.2.2 (both on linux). When I try the full 20 types I need, GCC chugs for several hours, which is unacceptable for my project. Is there anything I can do, or is this a GCC shortcoming that I need to wait for? -- - Graeme gwl(a)u.washington.edu "This sentence contains exactly threee erors."

1 0

Re: building boost with sunpro compilers
by King, William D 10 Feb '04

10 Feb '04

Thanks for your comments. The list sort problem is in the binary_search_test. binary_search_test.cpp in the utility library fails for sunpro 5.5 and 5.4, so sun needs to use the same workaround that begins in line 120 for DINKUMWARE and VC6. I will check my notes to find where the member template friends were an issue. It was something I found in 1.30.0, so, I am not sure if it will also be an issue in 1.31.0. So far, compiling 1.31.0 with sunpro is giving me much more trouble than either 1.30.0 or 1.30.2; sunpro doesn't like some of the iterator_facade code, which causes the filesystem library and several other tests to fail to compile. Davis King william.d.king(a)bankofamerica.com -----Original Message----- >From: boost-users-request(a)lists.boost.org >Message: 7 >Date: Tue, 10 Feb 2004 11:52:13 -0500 >From: Christopher Currie <christopher(a)currie.com> >Subject: [Boost-users] Re: building boost with sunpro compilers >To: boost-users(a)lists.boost.org >Message-ID: <c0b27u$luu$1(a)sea.gmane.org> >Content-Type: text/plain; charset=us-ascii; format=flowed >> The main fixes I have found so far is that for 5.5 and 5.4, >> BOOST_NO_LIST_SORT and BOOST_NO_MEMBER_TEMPLATE_FRIENDS need to be defined. >Can you point up which tests lead you to this conclusion? >Sun is supposed to be releasing an Early Access version of their next >compiler in the near future; I'll be focusing regressions and bugfixes >on that version once it's available. >Christopher ------------------------------

1 0

Thread creation state
by janardhan.guptha＠efi.com 10 Feb '04

10 Feb '04

I am creating a boost thread, how to know in which state it is created. I have a code snippet that is waiting always in the thread creatin functon istelf. Where as i tried with some boost samples, they are working amazingly perfect. This is how my code snippet looks like typedef boost::mutex::scoped_lock lock; class testCommand { static void threadfunc() { testCommand *testObj = mMapCommand[mObjID]; testObj->processthread(); }; static map< int mObjID, testCommand*> mMapCommand; private: void createthread() { mThread = new boost::thread(&testCommand::threadfunc); } void processthread() { lock lk(mMutex); mCondition.wait(lk); //// Some Action }; void runthread() { lock lk(mMutex); mCondition.notify_one(); }; public: static int mObjID; boost::thread *mThread; boost::condition mCondition; boost::mutex mMutex; }; The newly created thread is waiting at the following location forever, by the time i get a chance to execute the new thread is greatly delayed. NTDLL! 77f8856e() boost::detail::thread::lock_ops<boost::mutex>::unlock(boost::mutex & {...}) line 49 boost::detail::thread::scoped_lock<boost::mutex>::unlock() line 85 + 11 bytes boost::detail::thread::scoped_lock<boost::mutex>::~scoped_lock<boost::mutex> () line 74 `anonymous namespace'::thread_param::started() line 47 + 15 bytes thread_proxy(void * 0x0012fd74) line 71 _threadstartex(void * 0x00961040) line 212 + 13 bytes KERNEL32! 7c57b382() It sounds like i am missing something here. The queries here are 1. why it is waiting at the above specified line forever ? 2. Where can i get few worth thread samples done using boost::thread Regards Janardhan

2 1

How to export arrays from C(++) to python using boost
by Shukla, Nitin (Export) 10 Feb '04

10 Feb '04

I want to export an array of int and floats from C(++) to python using Boost but don't know how? Can anyone help me out? Is there any tutorials specifically on C(++)/Python interfacing using the Boost tool? I also want to export the BOOL type of C(++) to Python. How can I do that? --Nitin

2 1

building boost with sunpro compilers
by King, William D 10 Feb '04

10 Feb '04

Hello, I've been wondering if anyone else is trying to build boost on Solaris with recent sunpro compilers. In 1.31.0, the config files warn if you use any version later than 5.3, while the regression tests are running on 5.4, and Sun's latest release is 5.5. The main fixes I have found so far is that for 5.5 and 5.4, BOOST_NO_LIST_SORT and BOOST_NO_MEMBER_TEMPLATE_FRIENDS need to be defined. I would be interested in comparing notes and fixes with anyone else using Sunpro 5.5 (0x550). Thanks, Davis King william.d.king(a)bankofamerica.com

2 1

Re: [Boost-users] Problems with boost build setup
by Michael Buksas 10 Feb '04

10 Feb '04

On Sat, 31 Jan 2004 07:55:27 -0700, Jeff Garland wrote > First off, what version of bjam and boost are you using? I'm going to > assume version 1.30.2 of boost. It looks like boost-jam 3.1.7 from the rpm, and boost 1.30.2. > I think that bjam isn't that great at compiling outside of the boost > directory tree in the 1.30.2 version (I'm sure someone will correct me > if I'm offbase here :). This is a surprise. I had just assumed that the boost-jam would work the same way on user projects as in the library itself. Well, you know what they say about assuming... I'll ask about the install option at the jamboost list. Thanks for the pointer. In the meantime, is copying the libraries and using makefiles for application code typically what people do to link against boost libraries currently? Thanks again, Mike -- Michael Buksas <mb1(a)buksas.net>

1 0

how to expose the func like "print( char * str, ... )" ?
by iceryeah 09 Feb '04

09 Feb '04

hello, problem 1: i can expose the function like void a( void ) def( "a", a ); but there is anthor function like this: void DebugMessage( char *msg,... ); i don't know how to expose this function. problem 2: module test int num = 0; void set( int a ) { num = a; } then i expose set func , and do this in script: import test test.set( 10 ) and then in host app, i check the var num, it is not 10,why? thanks very much.

2 1

Spirit: a skip parser that counts newlines?
by Steve Folly 09 Feb '04

09 Feb '04

Hi, Before I launch into it, does anybody have an example of a parser that can count newlines. I would have thought this would be quite common, so I'm surprised to see it's not standard within Spirit? (Or maybe I didn't look hard enough?) I'm writing a parser which will parse multi-line files. I'd like to report an error along with a line number. I realise the error can't be detailed - e.g. what the parser expected, rather, just 'an error' - which why I'd like the line number to at least give the user a fighting chance. I assume the parser simply stops at the point where parsing failed, and thus I'd know the line number? I'm guessing I'd have to supply this as a custom skip parser to the parse method? Thanks for any clues. -- Regards, Steve.

2 1

RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C:
by Ben Hutchings 09 Feb '04

09 Feb '04

Someone using the wrong account to write email <Administrator(a)sbcltd.com> wrote: > Wayne, > > There might still be conflicts if the compiler can't place everything > into it's proper namespace. In addition, some sdk's force > everything into std namespace Really? That would be truly evil. > or into the global namespace. If you use "using namespace boost;", > you're basically doing the same thing. > > There are a couple of options that could be used separately. <snip> > 2. The second is wrap the offending sdk in it's own namespace. Here > is what I have come up with. I have three files here. c.h is the > original function. b.h wraps it in it's own namespace, and main.cpp > can only use it with the new namespace. Simple example, but hopefully > it illustrates what I'm trying to get across. <snip> That's all very well for inline code, but how about external code that's linked in later, that has been compiled without using the namespace? By the way, possessive "its" has no apostrophe.

1 0

[BGL] Removing vertices and internal properties
by Frédéric Mayot 09 Feb '04

09 Feb '04

Hi, I have a graph in the form of an adjacency_list with an internal property. I'm using vecS for both vertices and edges (and I don't want to use listS). When I remove a vertex with remove_vertex(), it seems that my property map is invalidated. Can I remove the property (from the map) which corresponds to the deleted vertex ? Is there any solution ? Thanks. Fred

2 1

Dynamic Multi Array Library
by RGProlog＠aol.com 09 Feb '04

09 Feb '04

Is anyone interested in dynamic_multi_array template library that offers user intuitive convenience of use as well as capacity to hone in upon any specific subset of a multi-dimensional array? As an example of usage, a dynamic_multi_array object can be constructed and then resized and then reshaped like this: size_t arrayShape = { 3, 7, 15}; dynamic_multi_array<double, 3> A(arrayShape); boost::array<size_t, 3> anotherArrayShape = {{ 5, 4, 22}}; A.resize(anotherArrayShape); boost::array<size_t, 5> yetAnotherArrayShape = {{ 440, 1, 1, 0, 0}} ; A.reshape(yetAnotherArrayShape); size_t stillAnotherArrayShape[4] = { 22, 10, 2, 11}; A.reshape(stillAnotherArrayShape); The library’s design owes a lot to Andrei Alexandrescu’s ideas. It is based on the data_table helper class template defined as follows: template<typename X> class data_table { … protected: std::vector<X> data_table_ ;}; template<> <value_type> class data_table { … protected: value_type* data_table_ ;}; Then, a sequence of the table class instantiation types is recursively defined and then given a name that is shared in different dimensional contexts as follows: typedef data_table<value_type> data_table_01; ……………………………………………. typedef data_table< data_table_49 > data_table_50 ; class Int2Type<int> { typedef data_table_01 data_table; } …………………………………………… class Int2Type<> <50> { typedef data_table_50 data_table; } Being a recursive template class, the data_table is implemented in a concise code that is mostly about stating a few recursive rules and implementing some access operators and is totally dimension independent. This is the central feature of the design since the user level wrapper class template by virtue of exporting a dimension appropriate data_table instantiation that uses its shared name template <T, size_t i, Allocator> class dynamic_multi_array { ………………………………………. typedef …. class Int2Type ::data_table; } is also implemented in a way that hides all the implementation details, is concise and dimension independent, thus providing user with a great deal of flexibility, syntax safety, and, in case of a new user, a flat learning curve. This is a std::vector based design. The dynamic_multi_array template class, the library’s main component, extends, where appropriate, std::vector capacities, replicates its exception safety guarantees and has std::vector as its back end storage device. The library’s code, documentation that includes a short tutorial and a few key tests and will be posted in Dynamic Multi Array Folder on boost Files once the issue of available space will be resolved.

1 0

(no subject)
by RGProlog＠aol.com 09 Feb '04

09 Feb '04

Is anyone interested in dynamic_multi_array template library that offers user intuitive convenience of use as well as capacity to hone in upon any specific subset of a multi-dimensional array? As an example of usage, a dynamic_multi_array object can be constructed and then resized and then reshaped like this: size_t arrayShape = { 3, 7, 15}; dynamic_multi_array<double, 3> A(arrayShape); boost::array<size_t, 3> anotherArrayShape = {{ 5, 4, 22}}; A.resize(anotherArrayShape); boost::array<size_t, 5> yetAnotherArrayShape = {{ 440, 1, 1, 0, 0}} ; A.reshape(yetAnotherArrayShape); size_t stillAnotherArrayShape[4] = { 22, 10, 2, 11}; A.reshape(stillAnotherArrayShape); The library’s design owes a lot to Andrei Alexandrescu’s ideas. It is based on the data_table helper class template defined as follows: template<typename X> class data_table { … protected: std::vector<X> data_table_ ;}; template<> <value_type> class data_table { … protected: value_type* data_table_ ;}; Then, a sequence of the table class instantiation types is recursively defined and then given a name that is shared in different dimensional contexts as follows: typedef data_table<value_type> data_table_01; ……………………………………………. typedef data_table< data_table_49 > data_table_50 ; class Int2Type<int> { typedef data_table_01 data_table; } …………………………………………… class Int2Type<> <50> { typedef data_table_50 data_table; } Being a recursive template class, the data_table is implemented in a concise code that is mostly about stating a few recursive rules and implementing some access operators and is totally dimension independent. This is the central feature of the design since the user level wrapper class template by virtue of exporting a dimension appropriate data_table instantiation that uses its shared name template <T, size_t i, Allocator> class dynamic_multi_array { ………………………………………. typedef …. class Int2Type ::data_table; } is also implemented in a way that hides all the implementation details, is concise and dimension independent, thus providing user with a great deal of flexibility, syntax safety, and, in case of a new user, a flat learning curve. This is a std::vector based design. The dynamic_multi_array template class, the library’s main component, extends, where appropriate, std::vector capacities, replicates its exception safety guarantees and has std::vector as its back end storage device. The library’s code, documentation that includes a short tutorial and a few key tests and will be posted in Dynamic Multi Array Folder on boost Files once the issue of available space will be resolved. P.S. The space issue is that I freed the space I previously occupied on boost Files and still cannot post the message. Need help here.

1 0

RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C:
by Dernoncourt, Wayne CTR NAVAIR 3184, ,10 09 Feb '04

09 Feb '04

Thanks much. I think the folks here have sent a message (I leave here a little after 1:30 on Friday and discussion sometimes takes a while) to the other SDK developers asking if they could put their SDK in a namespace and do this the "right" way instead of this round-about method. But yes this could work as well. Thanks much. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Administrator Sent: Friday, February 06, 2004 12:57 To: 'Boost Users mailing list' Subject: RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: Wayne, There might still be conflicts if the compiler can't place everything into it's proper namespace. In addition, some sdk's force everything into std namespace or into the global namespace. If you use "using namespace boost;", you're basically doing the same thing. There are a couple of options that could be used separately. 1. One is to not use "using namespace". Preface everything used from there with boost:: or std::. More typing, less pain, less chance for conflict. 2. The second is wrap the offending sdk in it's own namespace. Here is what I have come up with. I have three files here. c.h is the original function. b.h wraps it in it's own namespace, and main.cpp can only use it with the new namespace. Simple example, but hopefully it illustrates what I'm trying to get across. -------------------------------------------------- c.h ------------------------------------------------- #ifndef _C_H #define _C_H inline int garbage_method() { return 0; } #endif // -------------------------------------------------- b.h -------------------------------------------------- #ifndef _B_H #define _B_H namespace garbage_namespace { #include "c.h" } #endif // -------------------------------------------------- main.cpp -------------------------------------------------- #include "b.h" int main() { return garbage_namespace::garbage_method(); }

1 0

suspend/cancel thread
by janardhan.guptha＠efi.com 09 Feb '04

09 Feb '04

Hi, i working on an application using boost::thread. The application cretaes a thread, then put in wait state. Based on the user input i want the thread eitjer to move it to run state or cancel the thread. As i am newbie to boost thread, i couldn't find any documentation or working example that satisfies my requiremnt. So someone can help me out?? Rgds, Janardhan

3 2

std::map problem.
by Joshua Little 08 Feb '04

08 Feb '04

I'm working on making a factory class but have run into a problem. I think I'm trying to get the shared pointer out the wrong way. std::map<std::string, boost::shared_ptr<Logger> > LoggerFactory::loggers; boost::shared_ptr<Logger> LoggerFactory::getInstance(std::string& logger) { boost::shared_ptr<Logger> TheLogger; LoggerMap::iterator i = loggers.find(logger); if (!(*i).second.get()) { TheLogger.reset(new Logger()); loggers[logger] = TheLogger; } else { TheLogger = (*i).second; } return TheLogger; } I thought that the TheLogger = (*i).second line was the correct way to get any logger within the map but when I run it I get this segfault: Program received signal SIGSEGV, Segmentation fault. LoggerFactory::getInstance(std::string&) (logger=@0x22ff58) at e:/boost-1.30.2/boost/detail/shared_count.hpp:123 123 if(use_count_ == 0 && weak_count_ != 0) boost::throw_exception(boost::bad_weak_ptr()); if I comment out the 'TheLogger = (*i).second;' line everything seems to fine. Any ideas? Joshua.

2 2

Help with shared_ptrs please
by Steve Folly 08 Feb '04

08 Feb '04

Hi, I'd like some help trying to crack a problem I've got. Now, I am using shared pointers at the moment, and that might be part of my problem, or it might not, but I'll describe the situation and you can tell to go elsewhere if you like! :) Part of my application involves scripting - allowing the user to write file based scripts to execute within the context of an application. I've designed it so it also gives the ability for the application writer to create some 'scripts' by creating classes directly in the C++ code. The script has the ability to run in the main thread of the app, but some statements could potentially block, so each statement is run from a 'timer' event which gets scheduled immediately. Those that block wait for an event and continue on that event. This part is working well. The statements are classes constructed in a hierarchical manner with things like a block class (a statement itself) which has a list of statements in it, an if statement class - which has an expression evaluator, a statement for the 'then' part, and an optional statement for the 'else' part. You get the idea? After looking at boost::lambda I thought it would be nice if I could construct my script similar to how lambda does these sorts of control statements - the if_, switch_, for_ constructs. The idea I have is like: expression exp = ... If_statement s1 = if_( expr)->then_( s2 )->else_( s3 ); while_statement ws = while_( expr ).do_( s1 ); One of the things I decided early on was to use shared_ptrs. The while_ and if_ constructs are functions returning a shared pointer to the real if statement object. Now my problem: given the example above. The do_ method of a while_statement takes a shared pointer to a statement so I don't have to worry about deallocation. Constructing the if_ statement on it's own is no problem, but if I was to construct one directly within the do_ part of the while statement it wont compile: while_( expr ).do_( if_(expr)->then_(s2)->else_(s3) ); The problem is to be able to chain then_ and else_ together, I have to return a plain pointer because the if_ statement itself doesn't know about it's shared pointer. So now, the compiler complains that can't implicitly convert a plain if_statement pointer into a shared pointer. And even if it could, I don't have the original shared pointer to hand. Now, I hope you're all still listening at the back! :) My first thought was to somehow get the object to look after the shared pointer, but surely if the object has a reference to itself, the ref count of the shared pointer could never reach zero? As I said right at the beginning, I think is a problem I have with shared pointers, whether it be a misunderstanding about them or maybe I'm using them the wrong way? I could always go for scrapping the shared pointers all together, and make the classes responsible for their own (de)allocation, but I was rather hoping to avoid that. Any tips and suggestions on ways forward will be much appreciated. (Even if to say - "ha! it'll never work", or "try a another newsgroup"! :) TIA. -- Regards, Steve.

2 5

PreProcessor Library and Class Constructors
by Paul Grenyer 07 Feb '04

07 Feb '04

Hi All I fear I may be trying to get a square peg in a round hole, but here goes anyway... I'm trying to use the boost PreProcessor library to generate constructors with varying numbers of parameters. I've tried the following: #include <boost/preprocessor/arithmetic/inc.hpp> #include <boost/preprocessor/punctuation/comma_if.hpp> #include <boost/preprocessor/repetition.hpp> #ifndef MAX_CONCRETE_CONSTRUCTOR_PARAMS #define MAX_CONCRETE_CONSTRUCTOR_PARAMS 3 #endif #define CONCRETE_CONSTRUCTOR(Z, N, _) \ template<class R BOOST_PP_COMMA_IF(N) BOOST_PP_ENUM_PARAMS(N, class A)> \ explicit Concrete( BOOST_PP_ENUM_PARAMS(N, A) ) \ { } class Concrete { public: BOOST_PP_REPEAT(BOOST_PP_INC(MAX_CONCRETE_CONSTRUCTOR_PARAMS), CONCRETE_CONSTRUCTOR, _) }; int main() { Concrete a( 1, 2 ); return EXIT_SUCCESS; } But this gives me the following error: error C2660: 'Concrete::Concrete' : function does not take 2 arguments I have feeling I'm doing something very wrong or that can't be done. Regards Paul Paul Grenyer Email: paul(a)paulgrenyer.co.uk Web: http://www.paulgrenyer.co.uk Have you met Aeryn: http://www.paulgrenyer.co.uk/aeryn/? Version 0.3.0 beta now ready for download

1 0

RE: [Boost-users] How to export arrays from C(++) to python using boost
by Shukla, Nitin (Export) 06 Feb '04

06 Feb '04

Hi, I working on an application where an array of ints and floats are to exported from C++ to Python using boost::python. As I am newbie to boost python, I couldn't find any documentation or working example that satisfies the above requirement. Can someone help me out?? Nitin. -----Original Message----- From: Shukla, Nitin (Export) [mailto:nitin.shukla@pw.utc.com] Sent: Thursday, February 05, 2004 3:19 PM To: 'boost-users(a)lists.boost.org' Subject: [Boost-users] How to export arrays from C(++) to python using boost I want to export an array of int and floats from C(++) to python using Boost but don't know how? Can anyone help me out? Is there any tutorials specifically on C(++)/Python interfacing using the Boost tool? I also want to export the BOOL type of C(++) to Python. How can I do that? --Nitin _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] configuring boost on MS Visual Studio 6 where t he installation drive isn't C:
by Administrator 06 Feb '04

06 Feb '04

Wayne, There might still be conflicts if the compiler can't place everything into it's proper namespace. In addition, some sdk's force everything into std namespace or into the global namespace. If you use "using namespace boost;", you're basically doing the same thing. There are a couple of options that could be used separately. 1. One is to not use "using namespace". Preface everything used from there with boost:: or std::. More typing, less pain, less chance for conflict. 2. The second is wrap the offending sdk in it's own namespace. Here is what I have come up with. I have three files here. c.h is the original function. b.h wraps it in it's own namespace, and main.cpp can only use it with the new namespace. Simple example, but hopefully it illustrates what I'm trying to get across. -------------------------------------------------- c.h ------------------------------------------------- #ifndef _C_H #define _C_H inline int garbage_method() { return 0; } #endif // -------------------------------------------------- b.h -------------------------------------------------- #ifndef _B_H #define _B_H namespace garbage_namespace { #include "c.h" } #endif // -------------------------------------------------- main.cpp -------------------------------------------------- #include "b.h" int main() { return garbage_namespace::garbage_method(); } -----Original Message----- From: Dernoncourt, Wayne CTR NAVAIR 3184, ,10 [mailto:wayne.dernoncourt@navy.mil] Sent: Friday, February 06, 2004 5:43 AM To: Boost Users mailing list Subject: RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: Well that worked much better as far as it went (747 updated files out of 747 targets wth no skipped files and no failures). The version of the bjam binary was a little larger (~5k) than the one I compiled<scratches head>, but using this produced no errors. Unfortunately we still have at least a few problems. As I described originally we are using a highly specialized third party SDK. Part of this SDK redefines reverse_iterator (as well as min & max) evidently the MS Visual C++ reverse iterator is broken in some way. From a cursory examination of the two implementations, it appears that both the two are very similiar in functionality if not implementation. The issue with min/max could be eliminated by commenting out line 59 of boost/config/stllib/dinkumware.hpp (line defines BOOST_NO_STD_MIN_MAX). There doesn't appear to be a similiar line for the reverse iterator. One of the issues appears to be that this third party SDK doesn't seem to use namespaces for the SDK. From my limited understanding, for namespaces to be used effectively, the different libraries/SDK's would need to be in their own namespaces. If Boost had theirs and the third party used the global namespaces, there could still be conflicts. Is my understanding correct?

1 0

Conversions between shared_ptr<Base> and shared_ptr<Derived>
by Joshua Little 06 Feb '04

06 Feb '04

I've been using shared pointers for a few months now and just discovered I have been using them the wrong way, causing massive memory leaks. So I'm going back through my code and cleaning everything up and making the changes to correct all the mistakes I had been making. So now I've run into a bit of a problem. I'm using Boost 1.30.2 currently and I have function that takes in a Base class to place into a vector, but I have a number of Derived classes that will be going into the vector as well. From reading through the docs and the mailing lists everything seems to indicate that the conversion should be implicit and there shouldn't be a problem. I have the feeling I am missing something here so I was wondering if someone could point out my error. So I have something like this: std::vector<boost::shared_ptr<Base> > BaseVector; void add(boost::shared_ptr<Base>& newOne) { BaseVector.push_back(newOne); } and I call it like this usually : boost::shared_ptr<Derived> p(new Derived); add(p); I thought that it would work just like using raw pointers (which was working) but I get a compile time error that : no matching function call to add(boost::shared_ptr<Derived>&) canadites are add(boost::shared_ptr<Base>&).. ect. So I think I'm doing this the wrong way, about the only thing I can think of was something I saw in a few postings. Essentially creating a new pointer with the derived pointer then passing it into the function like this : boost::shared_ptr<Derived> p(new Derived); boost::shared_ptr<Base> q(p); add(q); Is that the preferred way of doing it? Or is there another step I'm missing when creating the shared_ptrs to allow them to be implicitly converted? Thanks, Joshua.

5 6

RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C:
by Dernoncourt, Wayne CTR NAVAIR 3184, ,10 06 Feb '04

06 Feb '04

Well that worked much better as far as it went (747 updated files out of 747 targets wth no skipped files and no failures). The version of the bjam binary was a little larger (~5k) than the one I compiled<scratches head>, but using this produced no errors. Unfortunately we still have at least a few problems. As I described originally we are using a highly specialized third party SDK. Part of this SDK redefines reverse_iterator (as well as min & max) evidently the MS Visual C++ reverse iterator is broken in some way. From a cursory examination of the two implementations, it appears that both the two are very similiar in functionality if not implementation. The issue with min/max could be eliminated by commenting out line 59 of boost/config/stllib/dinkumware.hpp (line defines BOOST_NO_STD_MIN_MAX). There doesn't appear to be a similiar line for the reverse iterator. One of the issues appears to be that this third party SDK doesn't seem to use namespaces for the SDK. From my limited understanding, for namespaces to be used effectively, the different libraries/SDK's would need to be in their own namespaces. If Boost had theirs and the third party used the global namespaces, there could still be conflicts. Is my understanding correct? -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Administrator Sent: Thursday, February 05, 2004 15:11 To: 'Boost Users mailing list' Subject: RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: Binaries of bjam are released separately. You can actually download a binary of bjam for nt at the bottom of the Sourceforge download page here: http://sourceforge.net/project/showfiles.php?group_id=7586 Also get the latest version (1.31.0) of boost as it has an easier install stage. The command-line should be: bjam "-sTOOLS=msvc" "-sMSVC_ROOT=D:\Progra~1\Micros~1" You can avoid all that if you execute vcvars32.bat and then do: bjam "-sTOOLS=msvc" That should si

1 0

Mac OS 10.3.2 Compiling Problems.
by Pierre-Michel Tremblay 06 Feb '04

06 Feb '04

Bonjour, I'm new to Boost. My platform is a PowerBook G4 running Mac OS X 10.3.2 with the following: [champignac:~] ptrembla% gcc -v Reading specs from /usr/libexec/gcc/darwin/ppc/3.3/specs Thread model: posix gcc version 3.3 20030304 (Apple Computer, Inc. build 1495) -downloaded boost-1.31.0.tar.gz -downloaded boost-jam-3.1.9.tgz -created a directory in ~/CVSROOTs and moved the two downloaded files there. -expanded downloaded boost-jam-3.1.7.tgz and ran build.sh -moved the executables created in ~/CVSROOTs/boost-jam-3.1.9/bin.macosxppc to /usr/bin -expanded boost-1.31.0.tar.gz and went to directory with jam files [champignac:~] ptrembla% cd /Users/ptremblay/CVSROOTs/boost_1_31_0 [champignac:~/CVSROOTs/boost_1_31_0] ptrembla% ls Jamfile boost.css people Jamfile.v2 c++boost.gif project-root.jam Jamrules doc rst.css LICENSE_1_0.txt google_logo_40wht.gif status README index.htm tools boost libs boost-build.jam more -set up my environment variables relating to Python within ~/.cshrc, i.e. set PYTHON_ROOT="/usr/bin/python" set PYTHON_VERSION="2.3" [champignac:~/CVSROOTs/boost_1_31_0] ptrembla% which python /usr/bin/python [champignac:~/CVSROOTs/boost_1_31_0] ptrembla% python -V Python 2.3 -ran bjam -sTOOLS=darwin [champignac:~/CVSROOTs/boost_1_31_0] ptrembla% which bjam /usr/bin/bjam [champignac:~/CVSROOTs/boost_1_31_0] ptrembla% cd /Users/ptremblay/CVSROOTs/boost_1_31_0 [champignac:~/CVSROOTs/boost_1_31_0] ptrembla% bjam -sTOOLS=darwin --------------------------------------------------------------------- skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "/System/Library/Frameworks/Python.framework/Versions/2.2/include/ python2.2" You can configure the location of your python installation by setting: PYTHON_ROOT - currently "/System/Library/Frameworks/Python.framework/Versions/2.2" PYTHON_VERSION - The 2-part python Major.Minor version number (e.g. "2.2", NOT "2.2.1") - currently "2.2" The following are automatically configured from PYTHON_ROOT if not otherwise set: PYTHON_LIB_PATH - path to Python library object; currently PYTHON_INCLUDES - path to Python #include directories; currently "/System/Library/Frameworks/Python.framework/Versions/2.2/include/ python2.2" --------------------------------------------------------------------- ...patience... ...found 4834 targets... ...updating 315 targets... {Output cut here} MkDir1 bin/boost/libs/test MkDir1 bin/boost/libs/test/build MkDir1 bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib MkDir1 bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin MkDir1 bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug MkDir1 bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/ shared-linkable-true darwin-C++-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/ shared-linkable-true/execution_monitor.o darwin-C++-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/ shared-linkable-true/cpp_main.o darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/ shared-linkable-true/libboost_prg_exec_monitor-d-1_31.dylib ld: Undefined symbols: cpp_main(int, char**) DYLD_LIBRARY_PATH=bin/boost/libs/test/build/ libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_31.lo" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ debug/shared-linkable-true/execution_monitor.o" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ debug/shared-linkable-true/cpp_main.o" \ && \ c++ -g -Wl,-dynamic -nostartfiles -Wl,-dylib -Wl,-ldylib1.o -o "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_31.dylib" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_31.lo" \ \ \ && \ rm -f "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_31.lo" ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/ shared-linkable-true/libboost_prg_exec_monitor-d-1_31.dylib... MkDir1 bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release MkDir1 bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true darwin-C++-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/execution_monitor.o darwin-C++-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/cpp_main.o darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/libboost_prg_exec_monitor-1_31.dylib ld: Undefined symbols: cpp_main(int, char**) DYLD_LIBRARY_PATH=bin/boost/libs/test/build/ libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/libboost_prg_exec_monitor-1_31.lo" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/execution_monitor.o" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/cpp_main.o" \ && \ c++ -Wl,-x -Wl,-dynamic -nostartfiles -Wl,-dylib -Wl,-ldylib1.o -o "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/libboost_prg_exec_monitor-1_31.dylib" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/libboost_prg_exec_monitor-1_31.lo" \ \ \ && \ rm -f "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/libboost_prg_exec_monitor-1_31.lo" ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/ release/shared-linkable-true/libboost_prg_exec_monitor-1_31.dylib... {Output cut here} ...failed updating 6 targets... ...updated 309 targets... QUESTIONS Are these failures "normal"? If not, what can I do to make it compile correctly? What should I do to make Boost.Python to compile correctly with 2.3? Where are the files I should rectify to solve these errors? Many thanks. Pierre-Michel

1 0

Errors with #include "boost/test/included/test_exec_monitor.hpp"
by Shawn Church 05 Feb '04

05 Feb '04

I am having problems compiling using the included form of the test execution monitor library. I have not tried building the library seperately and linking. The following test illustrates the problem: #include "boost/test/included/test_exec_monitor.hpp" int test_main(int argc, char *argv[]) { BOOST_CHECK("TEST ME"); } /* When used with boost 1.30.2 Building Makefile: "C:\Dev-Cpp\Local\sql\Mingw32\Makefile.win" Executing make... make.exe -f "C:\Dev-Cpp\Local\sql\Mingw32\Makefile.win" all g++.exe -c ../src/test_main.cpp -o ../src/test_main.o -I"C:/Dev-Cpp/include/c++" -I"C:/Dev-Cpp/include/c++/mingw32" -I"C:/Dev-Cpp/include/c++/backward" -I"C:/Dev-Cpp/include" -I"C:/Dev-Cpp/Local/boost-1.30.2" <<<<< The only change is here. -fexceptions -fmessage-length=0 g++.exe ../src/test_main.o -o "Sql.exe" -L"C:/Dev-Cpp/lib" ../../../lib/libodbc32.a Execution terminated Compilation successful Output: Platform: Win32 Compiler: GNU C++ version 3.2 (mingw special 20020817-1) STL : GNU libstdc++ version 20020816 Boost : 1.30.2 Entering test case "call_test_main" ../src/test_main.cpp(5): info: test "TEST ME" passed C:/Dev-Cpp/Local/boost-1.30.2/libs/test/src/test_main.cpp(40): error in "call_test_main": test test_main_result == 0 || test_main_result == boost::exit_success failed Leaving test case "call_test_main" Test case "call_test_main" failed with: 1 assertion out of 2 passed 1 assertion out of 2 failed When compiling with 1.31.0 Compiler: Default compiler Building Makefile: "C:\Dev-Cpp\Local\sql\Mingw32\Makefile.win" Executing make... make.exe -f "C:\Dev-Cpp\Local\sql\Mingw32\Makefile.win" all g++.exe -c ../src/test_main.cpp -o ../src/test_main.o -I"C:/Dev-Cpp/include/c++" -I"C:/Dev-Cpp/include/c++/mingw32" -I"C:/Dev-Cpp/include/c++/backward" -I"C:/Dev-Cpp/include" -I"C:/Dev-Cpp/Local/boost_1_31_0" <<< The only change is here !!!!! -fexceptions -fmessage-length=0 In file included from C:/Dev-Cpp/include/boost/test/included/test_exec_monitor.hpp:20, from ../src/test_main.cpp:1: C:/Dev-Cpp/Local/boost_1_31_0/libs/test/src/execution_monitor.cpp:185: no `int boost::execution_monitor::run_function()' member function declared in class `boost::execution_monitor' C:/Dev-Cpp/Local/boost_1_31_0/libs/test/src/execution_monitor.cpp: In member function `int boost::execution_monitor::run_function()': C:/Dev-Cpp/Local/boost_1_31_0/libs/test/src/execution_monitor.cpp:186: `m_custom_translators' undeclared (first use this function) C:/Dev-Cpp/Local/boost_1_31_0/libs/test/src/execution_monitor.cpp:186: (Each undeclared identifier is reported only once for each function it appears in.) .... I deleted 100+ lines of errors here .... C:/Dev-Cpp/include/boost/test/detail/unit_test_monitor.hpp:51: `target_test_case_' undeclared (first use this function) C:/Dev-Cpp/include/boost/test/detail/unit_test_monitor.hpp:51: only constructors take base initializers C:/Dev-Cpp/include/boost/test/detail/unit_test_monitor.hpp:51: confused by earlier errors, bailing out make.exe: *** [../src/test_main.o] Error 1 Execution terminated */ I rechecked the release notes for the test library and did not see any reason why the above should not work. Maybe i am just missing something simple. Guess I will try building and linking it to see what happens. -- Shawn Church sl_church(a)sbcglobal.net

1 1

RE: [Boost-users] configuring boost on MS Visual Studio 6 where t he installation drive isn't C:
by Administrator 05 Feb '04

05 Feb '04

Binaries of bjam are released separately. You can actually download a binary of bjam for nt at the bottom of the Sourceforge download page here: http://sourceforge.net/project/showfiles.php?group_id=7586 Also get the latest version (1.31.0) of boost as it has an easier install stage. The command-line should be: bjam "-sTOOLS=msvc" "-sMSVC_ROOT=D:\Progra~1\Micros~1" You can avoid all that if you execute vcvars32.bat and then do: bjam "-sTOOLS=msvc" That should si -----Original Message----- From: Dernoncourt, Wayne CTR NAVAIR 3184, ,10 [mailto:wayne.dernoncourt@navy.mil] Sent: Thursday, February 05, 2004 10:16 AM To: Boost Users mailing list Subject: RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: (I've been using MS Outlook for years and I still don't like the way it handles quoting like this!) Please pardon the newbieness, these are probably elmentary questions. It turns out the copy of Boost I have didn't have a bjam.exe (I don't know why) so I had to puzzle out how to build that (bad path, etc.) Now trying to figure out how to get Boost to build - done sort of. I don't see how this is going to examine the conflicts with the subset of RogueWave being used by the third party SDK. According to the results from the command "bjam" being executed in the D:\boost-1.30.2 directory: - failed updating 660 targets - skipped 234 targets - updated 260 targets (the actual number has scrolled off screen...) Looking back through the screens, there seem to be CALL "C:\Program Files\Microsoft\Visual Studio...", well that isn't right, it lives on D:, not C:. An earlier email suggested an S setting, so I tried: bjam "VC6_ROOT=D:\Progra~1\Micros~1" and it complains about not having Python (well, it hasn't been installed, we don't need it for this project, though it seems to be very popular) and then it complains about not knowning how to make VC6_ROOT=D:\same stuff. ...found 1 target ...can't find 1 target and it quits.

1 0

RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C:
by Dernoncourt, Wayne CTR NAVAIR 3184, ,10 05 Feb '04

05 Feb '04

Ahhhh, evidently vcvars32.bat wasn't being run to set some envrionment variables. Running this first makes a difference! Now 494 targets failed (there were 660 failing targets), 178 targets were skipped (there were 250). Of the failing targets most seem to be referencing mwcc (metro works c++ compiler?). Still not clear how some of this works. Trying to run the tests we came up with and now the complaining about missing boost/config.hpp... there it is, I can see it<jabbing my finger at the screen>. I'll fool with this some more in the AM... -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Administrator Sent: Wednesday, February 04, 2004 14:54 To: 'Boost Users mailing list' Subject: RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: Wayne, What configure script? Boost requires bjam.exe. If you follow the directions here: http://www.boost.org/more/getting_started.html you should have no problems. I have never had a problem with either MS Visual C++ 6.0 with regards to bjam, nor have I ever used a configure script with Boost. Cygwin is an alternative, but you shouldn't need it if you follow the getting started directions. Dale -----Original Message----- From: Dernoncourt, Wayne CTR NAVAIR 3184, ,10 [mailto:wayne.dernoncourt@navy.mil] Sent: Wednesday, February 04, 2004 9:17 AM To: Boost Users mailing list Subject: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: For a number of reasons we don't have MS Visual Studio installed on the C: drive. We also have another SDK installed that uses part of Rogue Wave. Both libraries try to define min, max and a reverse iterator (there are items, those are the ones we've come across in an afternoon of experimentation). As I understand things, the ./configure script will look for conflicts with other libraries and try to work around them. The ./configure script is a bourne shell script, but there is no obvious way of running that script in Windows. One approach I thought of was to install cygwin to run the script, but that would have to invoke the MS C++ compiler (invoking a Windows based tool from inside of a Linux like environment), I'm not sure that would actually work. Are there alternatives that need to be explored? Would the cygwin approach actually work? (we are currently using MS Visual Studio 6 because of requirement of the other SDK) _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Problem using new regex library
by John Eddy 05 Feb '04

05 Feb '04

Hello, I have just downloaded and installed 1.31.0. I am using MS VC7 and am having the following problem: The following code will not compile (whereas it did previously) #include <locale> using namespace std; #include <boost/regex.hpp> int main(int argc, char* argv[]) { return 0; } The error reported is as follows: regbase.hpp(120) : error C2955: 'std::collate' : use of class template requires template argument list The offending line of code is: collate = ::boost::regbase::collate, which is one member of an enumeration. The code looks fine to me so this seems to be a problem with the compiler. Has anyone already dealt with this? Thanks, John

1 0

RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C:
by Dernoncourt, Wayne CTR NAVAIR 3184, ,10 05 Feb '04

05 Feb '04

(I've been using MS Outlook for years and I still don't like the way it handles quoting like this!) Please pardon the newbieness, these are probably elmentary questions. It turns out the copy of Boost I have didn't have a bjam.exe (I don't know why) so I had to puzzle out how to build that (bad path, etc.) Now trying to figure out how to get Boost to build - done sort of. I don't see how this is going to examine the conflicts with the subset of RogueWave being used by the third party SDK. According to the results from the command "bjam" being executed in the D:\boost-1.30.2 directory: - failed updating 660 targets - skipped 234 targets - updated 260 targets (the actual number has scrolled off screen...) Looking back through the screens, there seem to be CALL "C:\Program Files\Microsoft\Visual Studio...", well that isn't right, it lives on D:, not C:. An earlier email suggested an S setting, so I tried: bjam "VC6_ROOT=D:\Progra~1\Micros~1" and it complains about not having Python (well, it hasn't been installed, we don't need it for this project, though it seems to be very popular) and then it complains about not knowning how to make VC6_ROOT=D:\same stuff. ...found 1 target ...can't find 1 target and it quits. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Administrator Sent: Wednesday, February 04, 2004 14:54 To: 'Boost Users mailing list' Subject: RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: Wayne, What configure script? Boost requires bjam.exe. If you follow the directions here: http://www.boost.org/more/getting_started.html you should have no problems. I have never had a problem with either MS Visual C++ 6.0 with regards to bjam, nor have I ever used a configure script with Boost. Cygwin is an alternative, but you shouldn't need it if you follow the getting started directions. Dale -----Original Message----- From: Dernoncourt, Wayne CTR NAVAIR 3184, ,10 [mailto:wayne.dernoncourt@navy.mil] Sent: Wednesday, February 04, 2004 9:17 AM To: Boost Users mailing list Subject: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: For a number of reasons we don't have MS Visual Studio installed on the C: drive. We also have another SDK installed that uses part of Rogue Wave. Both libraries try to define min, max and a reverse iterator (there are items, those are the ones we've come across in an afternoon of experimentation). As I understand things, the ./configure script will look for conflicts with other libraries and try to work around them. The ./configure script is a bourne shell script, but there is no obvious way of running that script in Windows. One approach I thought of was to install cygwin to run the script, but that would have to invoke the MS C++ compiler (invoking a Windows based tool from inside of a Linux like environment), I'm not sure that would actually work. Are there alternatives that need to be explored? Would the cygwin approach actually work? (we are currently using MS Visual Studio 6 because of requirement of the other SDK) _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Boost release 1.31.0 is available
by Beman Dawes 05 Feb '04

05 Feb '04

Boost release 1.31.0 is available. See the www.boost.org home page for latest news about what's in the release. Or go right to http://sourceforge.net/project/showfiles.php?group_id=7586 to download. Thanks to everyone who helped with this release. The folks that run the regression tests and review the release candidates get a special pat on the back. Due to compiler updates, three shipping and one soon-to-ship C++ compiler now pass almost all of Boost's regression tests. A year ago, no compilers could do that. --Beman

3 3

Problems with boost build with latest CVS head.
by Jeff Holle 05 Feb '04

05 Feb '04

I updated my CVS head of boost at Wed Feb 4 13:17:44 PST 2004. I am using gcc version 3.3. I've run into 2 types of problems which I have not experienced before. 1. There is some diff trible in boost/tools/build/v1/gcc-tools.jam starting at line 61. I solved it by commenting out three lines. 2. Compiler errors with boost/libs/date_time/src/gregorian/greg_month.cpp at line 18. Since I'm not using this part of boost, I haven't bothered fixing it. An example of the errors is: /boost/boost/date_time/date_parsing.hpp: In function ` date_type boost::date_time::parse_date(const std::string&, int)': /boost/boost/date_time/date_parsing.hpp:100: error: parse error before `>' token

3 3

Rationale on explicit shared_ptr constructor
by Aaron W. LaFramboise 05 Feb '04

05 Feb '04

Hi, (I can't beleive this wouldn't have been discussed already, but I haven't been able to find an answer in my searches [Google's search results into boost's web maillist seem to be incoherent.].) I recently converted a portion of a medium-sized project from loki::Smart_Ptr to boost::shared_ptr (primarily for weak_ptr support), and almost everything worked out of the box, except: boost: template<class Y> explicit shared_ptr <#constructors>(Y * p); loki: SmartPtr(const StoredType& p) In other words, code like this stopped working: some_smart_ptr<int> my_function() { return new int; // error: conversion from `int*' to non-scalar type `boost::shared_ptr<int>' // requested } Even when I adopt the convention to convert the return value to the smart pointer type such as with "return some_smart_ptr<int>(new int)", returning a null pointer as 'zero' doesn't work: some_smart_ptr<int> my_function() { return some_smart_ptr<int>(0); // error: no matching function for call to // `boost::shared_ptr<int>::shared_ptr(int)' } I've worked around this by simply using "return some_smart_ptr<int>();". However, I feel somewhat strongly that this sort of usage is unnecessarily ugly, and confuses the meaning of the code unnecessarily. More importantly, it causes smart pointers to behave differently from ordinary pointers, which is undesirable, as it requires the user (who may not know or care anything about the smart pointer, or even know that it is one, depending on a module's implementation and documentation) to have to learn and use and debug additional semantics. So my question follows. I understand that there are very good reasons for disallowing automatic conversion from a smart pointer, but why disallow automatic conversion to the smart pointer type also? If there are strong reasons for this, would it be reasonable to document this somewhere in the shared_ptr documentation? If not, is this particular aspect of shared_ptr possibly subject to discussion or change in the future? Thank you for your time, Aaron W. LaFramboise

2 1

regex_match error
by Vikrant Rathore 05 Feb '04

05 Feb '04

Hi, I am using the regex library and using the following expression. But it seems it is wrong. Since there is no compilation or linker error but runtime error. the expression is boost::regex e("*\\.exe") and the call to regex_match is if (boost::regex_match((*dir_itr).native_file_string(),e)) But as soon as I use * it throws some runtime error. If I remove "\\." and "*". It works fine. Does anyone have such issue. Thanks with best regards, Vikrant

3 3

Subgraph and internal properties
by Hugues Joly 04 Feb '04

04 Feb '04

Hi, I'm posting again a question that got confused due to mistakes from my part... I'd like to clarify a point about internal properties accessed through a subgraph. According to the documentation of the method "get(PropertyTag, subgraph& g)": "vertex and edge properties are shared by all subgraphs, so changes to a property through a local vertex descriptor for one subgraph will change the property for the global vertex descriptor, and therefore for all other subgraphs." (c.f. boost-1.30.2/libs/graph/doc/subgraph.html) Here, I'm sending you a small program inspired by the boost-1.30.2/libs/graph/example/subgraph.cpp example. >From its behavior, it seems that: 1) A property value is not shared between the global descriptor and its corresponding local descriptors. 2) we need to initialize property values for each of the subgraphs. For example, if I set a name "A" for the global vertex descriptor A, that property is not seen through the corresponding local vertex descriptors. Is this a case of misuse or is it a bug? __________________________________________________________ Lèche-vitrine ou lèche-écran ? magasinage.yahoo.ca /* Sample output: After initializing properties for G1: Global and local properties for vertex G0[C]... G0[C]= C G1[A1]= A1 Global and local properties for vertex G0[E]... G0[E]= E G1[B1]= B1 Global and local properties for vertex G0[F]... G0[F]= F G1[C1]= C1 After initializing properties for G2: Global and local properties for vertex G0[A] G0[A]= A G2[A2]= A2 Global and local properties for vertex G0[C]... G0[C]= C G1[A1]= A1 G2[B2]= B2 */ #include <boost/config.hpp> #include <iostream> #include <boost/graph/subgraph.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_utility.hpp> int main(int,char*[]) { using namespace boost; //typedef adjacency_list_traits<vecS, vecS, directedS> Traits;// Does nothing? typedef property< vertex_color_t, int, property< vertex_name_t, std::string > > VertexProperty; typedef subgraph< adjacency_list< vecS, vecS, directedS, VertexProperty, property<edge_index_t, int> > > Graph; const int N = 6; Graph G0(N); enum { A, B, C, D, E, F}; // for conveniently refering to vertices in G0 property_map<Graph, vertex_name_t>::type name = get(vertex_name_t(), G0); name[A] = "A"; name[B] = "B"; name[C] = "C"; name[D] = "D"; name[E] = "E"; name[F] = "F"; Graph& G1 = G0.create_subgraph(); enum { A1, B1, C1 }; // for conveniently refering to vertices in G1 add_vertex(C, G1); // global vertex C becomes local A1 for G1 add_vertex(E, G1); // global vertex E becomes local B1 for G1 add_vertex(F, G1); // global vertex F becomes local C1 for G1 property_map<Graph, vertex_name_t>::type name1 = get(vertex_name_t(), G1); name1[A1] = "A1"; std::cout << std::endl << "After initializing properties for G1:" << std::endl; std::cout << " Global and local properties for vertex G0[C]..." << std::endl; std::cout << " G0[C]= " << boost::get(vertex_name, G0, C) << std::endl;// prints: "G0[C]= C" std::cout << " G1[A1]= " << boost::get(vertex_name, G1, A1) << std::endl;// prints: "G1[A1]= A1" name1[B1] = "B1"; std::cout << " Global and local properties for vertex G0[E]..." << std::endl; std::cout << " G0[E]= " << boost::get(vertex_name, G0, E) << std::endl;// prints: "G0[E]= E" std::cout << " G1[B1]= " << boost::get(vertex_name, G1, B1) << std::endl;// prints: "G1[B1]= B1" name1[C1] = "C1"; std::cout << " Global and local properties for vertex G0[F]..." << std::endl; std::cout << " G0[F]= " << boost::get(vertex_name, G0, F) << std::endl;// prints: "G0[F]= F" std::cout << " G1[C1]= " << boost::get(vertex_name, G1, C1) << std::endl;// prints: "G1[C1]= C1" Graph& G2 = G0.create_subgraph(); enum { A2, B2 }; // for conveniently refering to vertices in G2 add_vertex(A, G2); // global vertex A becomes local A2 for G2 add_vertex(C, G2); // global vertex C becomes local B2 for G2 property_map<Graph, vertex_name_t>::type name2 = get(vertex_name_t(), G2); name2[A2] = "A2"; std::cout << std::endl << std::endl << "After initializing properties for G2:" << std::endl; std::cout << " Global and local properties for vertex G0[A]" << std::endl; std::cout << " G0[A]= " << boost::get(vertex_name, G0, A) << std::endl;// prints: "G0[A]= A" std::cout << " G2[A2]= " << boost::get(vertex_name, G2, A2) << std::endl;// prints: "G2[A2]= A2" name2[B2] = "B2"; std::cout << " Global and local properties for vertex G0[C]..." << std::endl; std::cout << " G0[C]= " << boost::get(vertex_name, G0, C) << std::endl;// prints: "G0[C]= C" std::cout << " G1[A1]= " << boost::get(vertex_name, G1, A1) << std::endl;// prints: "G1[A1]= A1" std::cout << " G2[B2]= " << boost::get(vertex_name, G2, B2) << std::endl;// prints: "G2[B2]= B2" return 0; }

2 4

RE: [Boost-users] configuring boost on MS Visual Studio 6 where t he installation drive isn't C:
by Administrator 04 Feb '04

04 Feb '04

Wayne, What configure script? Boost requires bjam.exe. If you follow the directions here: http://www.boost.org/more/getting_started.html you should have no problems. I have never had a problem with either MS Visual C++ 6.0 with regards to bjam, nor have I ever used a configure script with Boost. Cygwin is an alternative, but you shouldn't need it if you follow the getting started directions. Dale -----Original Message----- From: Dernoncourt, Wayne CTR NAVAIR 3184, ,10 [mailto:wayne.dernoncourt@navy.mil] Sent: Wednesday, February 04, 2004 9:17 AM To: Boost Users mailing list Subject: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: For a number of reasons we don't have MS Visual Studio installed on the C: drive. We also have another SDK installed that uses part of Rogue Wave. Both libraries try to define min, max and a reverse iterator (there are items, those are the ones we've come across in an afternoon of experimentation). As I understand things, the ./configure script will look for conflicts with other libraries and try to work around them. The ./configure script is a bourne shell script, but there is no obvious way of running that script in Windows. One approach I thought of was to install cygwin to run the script, but that would have to invoke the MS C++ compiler (invoking a Windows based tool from inside of a Linux like environment), I'm not sure that would actually work. Are there alternatives that need to be explored? Would the cygwin approach actually work? (we are currently using MS Visual Studio 6 because of requirement of the other SDK) _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C:
by Kutch, Patrick G 04 Feb '04

04 Feb '04

I believe you simply need to set VC6_ROOT environment variable to the location where you have MS Visual Studion 6 installed. Patrick Kutch Life is too short to drink bad coffee. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Dernoncourt, Wayne CTR NAVAIR 3184, ,10 Sent: Wednesday, February 04, 2004 9:17 AM To: Boost Users mailing list Subject: [Boost-users] configuring boost on MS Visual Studio 6 where the installation drive isn't C: For a number of reasons we don't have MS Visual Studio installed on the C: drive. We also have another SDK installed that uses part of Rogue Wave. Both libraries try to define min, max and a reverse iterator (there are items, those are the ones we've come across in an afternoon of experimentation). As I understand things, the ./configure script will look for conflicts with other libraries and try to work around them. The ./configure script is a bourne shell script, but there is no obvious way of running that script in Windows. One approach I thought of was to install cygwin to run the script, but that would have to invoke the MS C++ compiler (invoking a Windows based tool from inside of a Linux like environment), I'm not sure that would actually work. Are there alternatives that need to be explored? Would the cygwin approach actually work? (we are currently using MS Visual Studio 6 because of requirement of the other SDK) _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

configuring boost on MS Visual Studio 6 where the installation drive isn't C:
by Dernoncourt, Wayne CTR NAVAIR 3184, ,10 04 Feb '04

04 Feb '04

For a number of reasons we don't have MS Visual Studio installed on the C: drive. We also have another SDK installed that uses part of Rogue Wave. Both libraries try to define min, max and a reverse iterator (there are items, those are the ones we've come across in an afternoon of experimentation). As I understand things, the ./configure script will look for conflicts with other libraries and try to work around them. The ./configure script is a bourne shell script, but there is no obvious way of running that script in Windows. One approach I thought of was to install cygwin to run the script, but that would have to invoke the MS C++ compiler (invoking a Windows based tool from inside of a Linux like environment), I'm not sure that would actually work. Are there alternatives that need to be explored? Would the cygwin approach actually work? (we are currently using MS Visual Studio 6 because of requirement of the other SDK)

1 0

Re: [Boost-users] boost::bind throws exception with VisualStudio
by Cheenu Srinivasan 04 Feb '04

04 Feb '04

Douglas Gregor wrote: >Cheenu Srinivasan wrote: > > Peter Klotz wrote: > > >Cheenu Srinivasan wrote: > > > > The following program throws a bad_function_call exception when > > > > compiled with VisualStudio 7.1. It happens with both boost-1.30.2 > > > > and boost_1_31_0_rc2. No problems when compiled with g++ 2.95.1 > > > > on solaris. > > > > > >Tried it with VC++7.1 and Boost 1.30.2. > > > > > >Compiles and runs without problems. > > > > Hmm, tried it on someone else's PC with VisualStudio 7.1 and both 1.30.2 > > and boost_1_31_0_rc2 throw the exception there as well, so it isn't >simply > > something > > in my environment. > > > > "About" reports the following version info (on all three PCs I've tried >it > > on): > > > > Microsoft Development Environment 2003 -- Version 7.1.3088 > > Microsoft .NET Framework 1.1 -- Version 1.1.4322 > >Are you compiling it as Managed C++ or native C++? Some feedback on the >developer's list seems to say that it's a Managed C++ issue, which I can >fix in CVS but not for 1.31.0. You're right. If I build it using the IDE as a .NET project (created using "File | New | Projects | Visual C++ Projects | .NET | Empty Project (.NET)" then I have this problem. It works fine when I build it with my own makefile. Thanks. _________________________________________________________________ Find high-speed net deals comparison-shop your local providers here. https://broadband.msn.com

1 0

Re: [Boost-users] boost::bind throws exception with VisualStudio
by Cheenu Srinivasan 04 Feb '04

04 Feb '04

Peter Klotz wrote: >Cheenu Srinivasan wrote: > > > > The following program throws a bad_function_call exception when > > compiled with VisualStudio 7.1. It happens with both boost-1.30.2 > > and boost_1_31_0_rc2. No problems when compiled with g++ 2.95.1 > > on solaris. > >Tried it with VC++7.1 and Boost 1.30.2. > >Compiles and runs without problems. Hmm, tried it on someone else's PC with VisualStudio 7.1 and both 1.30.2 and boost_1_31_0_rc2 throw the exception there as well, so it isn't simply something in my environment. "About" reports the following version info (on all three PCs I've tried it on): Microsoft Development Environment 2003 -- Version 7.1.3088 Microsoft .NET Framework 1.1 -- Version 1.1.4322 Cheenu _________________________________________________________________ High-speed usersbe more efficient online with the new MSN Premium Internet Software. http://join.msn.com/?pgmarket=en-us&page=byoa/prem&ST=1

2 1

boost compile problem using dev-cpp 4.9.8.5
by Vikrant Rathore 04 Feb '04

04 Feb '04

Hi Everyone, Please help!!!! I am trying to compile boost library with dev-cpp. It does not compile and gives many errors. I can use the filesystem library as it does not require pre compilation. But I want to use regex and test suite library. Boost.Python error is fine. But other library also do not compile. I have followed the documentation and set the enviroment variables to C:\projects\boost> C:\projects\boost>set path=c:\dev-cpp\bin C:\projects\boost>set MINGW_ROOT_DIRECTORY=c:\dev-cpp C:\projects\boost>set MINGW_BIN_DIRECTORY=c:\dev-cpp\bin C:\projects\boost>set MINGW_INCLUDE_DIRECTORY=c:\dev-cpp\include C:\projects\boost>set MINGW_STDLIB_DIRECTORY=c:\dev-cpp\lib I receive more than 3000 lines in error some of them are attached: --------------------------------------------------------------------- skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "c:/tools/python/include" You can configure the location of your python installation by setting: PYTHON_ROOT - currently "c:/tools/python" PYTHON_VERSION - The 2-part python Major.Minor version number (e.g. "2.2", NOT "2.2.1") - currently "2.2" The following are automatically configured from PYTHON_ROOT if not otherwise set: PYTHON_LIB_PATH - path to Python library object; currently "c:/tools/python/libs" --------------------------------------------------------------------- ...found 5655 targets... ...updating 558 targets... gcc-C++-action bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\greg_month .obj c:\dev-cpp\bin\g++ -c -Wall -ftemplate-depth-100 - DBOOST_DATE_TIME_POSIX_TIME_STD_CONFIG - DBOOST_ALL_DYN_LINK=1 -g -O0 -fno-inline -mno-cygwin - I"bin\boost\libs\date_time\build" -I "C:\projects\boost" -I "c:\dev-cpp\include" -o "bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\greg_mont h.obj" "C:/projects/boost/libs/date_time/build/../src/gregorian/greg_month.cpp" ...failed gcc-C++-action bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\greg_month .obj... gcc-C++-action bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\greg_week day.obj c:\dev-cpp\bin\g++ -c -Wall -ftemplate-depth-100 - DBOOST_DATE_TIME_POSIX_TIME_STD_CONFIG - DBOOST_ALL_DYN_LINK=1 -g -O0 -fno-inline -mno-cygwin - I"bin\boost\libs\date_time\build" -I "C:\projects\boost" -I "c:\dev-cpp\include" -o "bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\greg_week day.obj" "C:/projects/boost/libs/date_time/build/../src/gregorian/greg_weekday.cpp" ...failed gcc-C++-action bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\greg_week day.obj... gcc-C++-action bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\date_gener ators.obj c:\dev-cpp\bin\g++ -c -Wall -ftemplate-depth-100 - DBOOST_DATE_TIME_POSIX_TIME_STD_CONFIG - DBOOST_ALL_DYN_LINK=1 -g -O0 -fno-inline -mno-cygwin - I"bin\boost\libs\date_time\build" -I "C:\projects\boost" -I "c:\dev-cpp\include" -o "bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\date_gener ators.obj" "C:/projects/boost/libs/date_time/build/../src/gregorian/date_generators.cpp" ...failed gcc-C++-action Thanks with best regards, Vikrant

3 5

RE: [Boost-users] boost::bind throws exception with VisualStudio 7.1
by Mark Loew 03 Feb '04

03 Feb '04

I noticed similar problems when using the boost::bind functions in my application with Visual Studio 7.1. If I turn off all optimizations it works fine. Whole program optimization seems to be the biggest culprit. Due to my projects time constraints I didn't real track it down any farther. Mark Loew, MCSD, MCSE Application Development Consultant Sagestone Consulting www.sagestone.com Grand Rapids, MI 616-954-9556 x149 Microsoft Gold Certified Partner mloew(a)sagestone.com -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Peter Klotz Sent: Tuesday, February 03, 2004 2:04 PM To: Boost Users mailing list Subject: Re: [Boost-users] boost::bind throws exception with VisualStudio 7.1 > The following program throws a bad_function_call exception when > compiled with VisualStudio 7.1. It happens with both boost-1.30.2 and > boost_1_31_0_rc2. No problems when compiled with g++ 2.95.1 on > solaris. Tried it with VC++7.1 and Boost 1.30.2. Compiles and runs without problems. Best regards, Peter. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

boost::bind throws exception with VisualStudio 7.1
by Cheenu Srinivasan 03 Feb '04

03 Feb '04

The following program throws a bad_function_call exception when compiled with VisualStudio 7.1. It happens with both boost-1.30.2 and boost_1_31_0_rc2. No problems when compiled with g++ 2.95.1 on solaris. ---- #include <boost/bind.hpp> #include <boost/function.hpp> using namespace boost; #include <iostream> using namespace std; double f(int i, double d) { cout << "int = " < bound_func = boost::bind(f, _1, 1.234); int i = 99; cout << bound_func(i) << endl; } ---- Peter Dimov wrote: >Could you please post a message to the developer's list >(or if that's a problem, post it here) with an appropriately alarming >subject :-) containing a complete program that demonstrates the problem? >(So >that we try to fix it before 1.31 goes out.) _________________________________________________________________ Get a FREE online virus check for your PC here, from McAfee. http://clinic.mcafee.com/clinic/ibuy/campaign.asp?cid=3963

3 2

RE: [Boost-users] newbie question about boost::regex and memory leaks
by Gregory, Matthew 03 Feb '04

03 Feb '04

Ben Hastings wrote: > The only memory allocation I can see is for the array that pclasses > points to and the strings in it. These are freed in do_free() which is > called by the destructor of the last instance of w32_traits_base. > Since each of the derived classes of w32_traits_base > (w32_regex_traits<char> and w32_regex_traits<wchar_t>) has a static > instance of itself as a member, the memory will not be freed until after > main() returns. So if you call _CrtDumpMemoryLeaks() at the end of > main() this memory will wrongly be reported as leaked. Ben, this was exactly my problem. Sorry for the bonehead and thanks for the help. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] newbie question about boost::regex and memory leaks
by Ben Hutchings 03 Feb '04

03 Feb '04

Gregory, Matthew <matt.gregory(a)oregonstate.edu> wrote: > Forgive the likely simple question ... > > I am using boost-1.30.2 regex library in a C++ console app and have > been using VC7 to debug memory leaks through the _CrtDumpMemoryLeaks() > function. Where is this called from? > It reports numerous memory leaks on the first time I use a > boost::regex object, albeit relatively small leaks. For example, if I > use > > boost::regex statsRe("^\\s+8\\s+ENVI\\s+AX4.*") > > there are a number of memory leaks from memory allocated in the > boost::re_detail::w32_traits_base::do_init() block. > > I am wondering if I am doing something wrong in that no destructor > gets called for these objects or if small memory leaks are to be > expected when using these objects. The only memory allocation I can see is for the array that pclasses points to and the strings in it. These are freed in do_free() which is called by the destructor of the last instance of w32_traits_base. Since each of the derived classes of w32_traits_base (w32_regex_traits<char> and w32_regex_traits<wchar_t>) has a static instance of itself as a member, the memory will not be freed until after main() returns. So if you call _CrtDumpMemoryLeaks() at the end of main() this memory will wrongly be reported as leaked.

1 0

[Date-Time] Issues
by Andrew V. Bronnikov 03 Feb '04

03 Feb '04

Hello, All! When I was familiarized with the great Boost Library one of the most inspiring part of it was the Date-Time Library. Date and time issues are very important in our project related with time series, so I immediately started to read docs, and tried to incorporate the lib as it became possible for us. As usual, problems hadn't kept waiting... :) Issues: 1. why gregorian::date and posix_time::ptime have no default constructors (possibly initializing them into some special value - good candidates are not_a_date_time, neg_inf or local_time (see next issue))? Lack of default ctors doesn't allow direct use of date-time objects in tuples and other containers requiring default-constructible classes. 2. why special_values enum has no "local_time" (or "now") item? It seems "special" enough, and - more important - it allows to pass the "initialize as current time" directive as a time initialization policy in templates. 3. why date, ptime, durations have no setters for their components (days, hours, minutes etc)? I guess it related with validity checking issues - am I right, or there are some other reasons? 4. why hours(), minutes() etc are classes, not simple time_duration factory functions? What the another level of inheritance for? Consider using a time_duration in lambda expressions (e.g. in the Spirit semantic actions): posix_time::time_duration dt; .... rule<> hours = uint_p [var(dt) += posix_time::hours(_1)] This will not compile because hours() is not a function. Instead, I must use something like a lazy constructor: rule<> hours = uint_p [var(dt) += bind(constructor<posix_time::hours>(), _1)] but it looks not so short as before. And - surprise! - it doesn't compile too, just because of the next problem: 5. neither of date, ptime or time_duration defines operator+=(). What is the reason for denying it? It seems quite natural to have a set of assignment operators for date_time classes, isn't it? 6. it would be great if GDTL classes will support explicit/implicit conversion functions/operators from/to older standard types like a time_t etc. It will allow smoother transition from old libraries to the GDTL. Thanx for the great work anyway! With best regards, Andrew V. Bronnikov.

2 2

newbie question about boost::regex and memory leaks
by Gregory, Matthew 02 Feb '04

02 Feb '04

Forgive the likely simple question ... I am using boost-1.30.2 regex library in a C++ console app and have been using VC7 to debug memory leaks through the _CrtDumpMemoryLeaks() function. It reports numerous memory leaks on the first time I use a boost::regex object, albeit relatively small leaks. For example, if I use boost::regex statsRe("^\\s+8\\s+ENVI\\s+AX4.*") there are a number of memory leaks from memory allocated in the boost::re_detail::w32_traits_base::do_init() block. I am wondering if I am doing something wrong in that no destructor gets called for these objects or if small memory leaks are to be expected when using these objects. Thanks, matt

1 0

RE: Boost-users Digest, Vol 118, Issue 2
by Cheenu Srinivasan 02 Feb '04

02 Feb '04

Peter Dimov wrote: >Cheenu Srinivasan wrote: > > > > With MSVC 7.1. the exception is thrown with both 'bound_func = > > bind(...)' and 'bound_func(bind(...))'. But I tried it with > > g++/solaris and it works. So it does look like a bug with the MS > > compiler. Thanks. > >It works for me in MSVC 7.1, but I'm using the CVS version of Boost. It may >be a bug in 1.30.2 (if that's what you are using). You may download 1.31 >release candidate 2 from > > http://www.esva.net/~beman/boost_1_31_0_rc2.zip > >to verify that the problem does not occur with the immininent 1.31 release. I tried VisualStudio 7.1 with boost_1_31_0_rc2 with the same results: a bad_function_call exception. I tried it on two different PCs (same version of VisualStudio, of course). _________________________________________________________________ Check out the new MSN 9 Dial-up fast & reliable Internet access with prime features! http://join.msn.com/?pgmarket=en-us&page=dialup/home&ST=1

2 1

Re: [Boost-users] return type of boost::bind
by Cheenu Srinivasan 02 Feb '04

02 Feb '04

[Reposting under corect subject.] Peter Dimov wrote: >Cheenu Srinivasan wrote: > > > > With MSVC 7.1. the exception is thrown with both 'bound_func = > > bind(...)' and 'bound_func(bind(...))'. But I tried it with > > g++/solaris and it works. So it does look like a bug with the MS > > compiler. Thanks. > >It works for me in MSVC 7.1, but I'm using the CVS version of Boost. It may >be a bug in 1.30.2 (if that's what you are using). You may download 1.31 >release candidate 2 from > > http://www.esva.net/~beman/boost_1_31_0_rc2.zip > >to verify that the problem does not occur with the immininent 1.31 release. I tried VisualStudio 7.1 with boost_1_31_0_rc2 with the same results: a bad_function_call exception. I tried it on two different PCs (same version of VisualStudio, of course). _________________________________________________________________ Let the new MSN Premium Internet Software make the most of your high-speed experience. http://join.msn.com/?pgmarket=en-us&page=byoa/prem&ST=1

1 0

cannot compile boost with dev-cpp 4.9.8.0
by Vikrant Rathore 02 Feb '04

02 Feb '04

HI, Anyone has compiled boost library successfully using dev-cpp the new version. I try compiling it and it gives many errors. I follow the following qway to compile: C:\projects\boost> C:\projects\boost>set path=c:\dev-cpp\bin C:\projects\boost>set MINGW_ROOT_DIRECTORY=c:\dev-cpp C:\projects\boost>set MINGW_BIN_DIRECTORY=c:\dev-cpp\bin C:\projects\boost>set MINGW_INCLUDE_DIRECTORY=c:\dev-cpp\include C:\projects\boost>set MINGW_STDLIB_DIRECTORY=c:\dev-cpp\lib C:\projects\boost>bjam -sTOOLS=mingw I tried many different option including usig MSYS with no luck. Thanks with best regards, Vikrant

1 0

Compliation speed of Boost.Signal in C++ Builder 5
by Ben Chan 02 Feb '04

02 Feb '04

Dear All, I'm new to boost and trying to use boost.signal in my BCB 5.0 project,everything works fine except my project compilation speed was horribly slow down.Once I included the <signal.hpp>,the compiler have to compile extra thousands line of code even my project is empty.I did put the signal.hpp file in my pre-compiled header and include the static lib, but seems it can't help much. Any suggestion to improve the compliation speed in BCB?VC7.0 seems compile pretty fast. Thx Ben _________________________________________________________________ Linguaphone : Learning English? Get Japanese lessons for FREE http://go.msnserver.com/HK/30476.asp

1 0

Re: [Boost-users] return type of boost::bind
by Cheenu Srinivasan 01 Feb '04

01 Feb '04

Peter Dimov wrote: > Cheenu Srinivasan wrote: > > Duane Murphy wrote: > >> The return type of boost::bind is fairly indeterminate. In order to > >> call a bound function at a later time, look at boost::function. It > >> does a nice job of holding on to a function that uses boost::bind. > > > > I looked at "Using bind with Boost.Function" in the boost::function > > docs. Mimicing that, for my example, I tried: > > > > boost::function<double (int)> bound_func = boost::bind(f, _1, 1.234); > > int i = 99; > > cout << bound_func(i) << endl; > > > > but it throws a bad_function_call exception when bound_func(i) is > > invoked. How do I use boost::function for this situation? > > Works for me; it's probably a compiler bug. Which compiler are you using? > > Try > > boost::function<double (int)> bound_func( boost::bind(f, _1, 1.234) ); > > instead. With MSVC 7.1. the exception is thrown with both 'bound_func = bind(...)' and 'bound_func(bind(...))'. But I tried it with g++/solaris and it works. So it does look like a bug with the MS compiler. Thanks.

2 1

return type of boost::bind
by Cheenu Srinivasan 01 Feb '04

01 Feb '04

I wish to store the return value of boost::bind in an intermediate object to invoke it at a later time. I only ever see examples which combine the call to boost:bind with the immediate invocation on the returned object such as: #include <boost/bind.hpp> using namespace boost; #include <iostream> using namespace std; double f(int i, double d) { cout << "int = " << i << endl; return d; } main() { int i = 99; cout << bind(f, _1, 1.234)(i) << endl; } Instead I'd like to postpone the call to the returned object. What's the type of obj? main() { int i = 99; WHAT_IS_MY_TYPE obj = bind(f, _1, 1.234); ... cout << obj(i) << endl; } Thanks, Cheenu _________________________________________________________________ What are the 5 hot job markets for 2004? Click here to find out. http://msn.careerbuilder.com/Custom/MSN/CareerAdvice/WPI_WhereWillWeFindJob…

3 4

Problems with boost build setup
by Michael Buksas 31 Jan '04

31 Jan '04

Hi all, I'm having newbie problems with linking against Boost libraries. Here's the situation: I can build the boost libraries without problem, and I'm using the default toolkit for my system, (Fedora Core 1) which is g++. Compiling is no problem, just linking. I can link the object files by hand, but not as part of using Boost.build. As a test, I grabbed an example program from the date_time library and it's corresponding build rule. This code compiles fine as part of Boost, but if I move it to my project space, I get linking errors. Here's my Jamfile: exe time_math : <lib>$(BOOST_ROOT)/build/boost_date_time time_math.cpp : <include>$(BOOST_ROOT) <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG ; and here's my Jamrules in the same directory: project-root ; path-global BOOST_ROOT : "/opt/boost-1.30.2" ; Here's the Jamfile from /opt/boost-1.30.2/libs/date_time/example/ exe time_math : <lib>../build/boost_date_time posix_time/time_math.cpp : <include>$(BOOST_ROOT) <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG ; And the environment variable is set: BOOST_BUILD_PATH=/opt/boost-1.30.2/tools/build When I run bjam from a clean build, here's what I get: gcc-C++-action bin/time_math/gcc/debug/runtime-link-dynamic/time_math.o gcc-Link-action bin/time_math/gcc/debug/runtime-link-dynamic/time_math bin/time_math/gcc/debug/runtime-link-dynamic/time_math.o(.gnu.linkonce.t._ZN5boost9date_time15month_formatterINS_9gregorian10greg_monthENS0_13simple_formatEE12format_monthERKS3_RSo+0x3a): In function `boost::date_time::month_formatter<boost::gregorian::greg_month, << edited for brevity >> In function `boost::date_time::month_formatter<boost::gregorian::greg_month, << edited for brevity >> collect2: ld returned 1 exit status export LD_LIBRARY_PATH g++ -g -o "bin/time_math/gcc/debug/runtime-link-dynamic/time_math" "bin/time_math/gcc/debug/runtime-link-dynamic/time_math.o" -Wl,-rpath-link,. ...failed gcc-Link-action bin/time_math/gcc/debug/runtime-link-dynamic/time_math... ...failed updating 1 target... So things are compiling, but not linking. I must not have the configuration for Boost.build correct, but I've tried everything I can think of. Any help would be appreciated. Thanks, Mike Buksas -- Michael Buksas -- michael(a)buksas.net -- www.buksas.net

2 1

Properties in a subgraph
by Hugues Joly 30 Jan '04

30 Jan '04

Hi, I'd like to clarify a point about the graph properties accessed through a subgraph. According to the documentation of get(PropertyTag, subgraph& g): vertex and edge properties are shared by all subgraphs, so changes to a property through a local vertex descriptor for one subgraph will change the property for the global vertex descriptor, and therefore for all other subgraphs (c.f. boost-1.30.2/libs/graph/doc/subgraph.html). Here, I'm sending you a small program inspired by the boost-1.30.2/libs/graph/example/subgraph.cpp example. >From its behavior, it seems that: 1) A property value is not shared between the global descriptor and its corresponding local descriptors. 2) we need to initialize property values for each of the subgraphs. For example, if I set a name "A" for the global vertex descriptor A, that property is not seen through the corresponding local vertex descriptors. Is this a case of misuse or is it a bug? __________________________________________________________ Lèche-vitrine ou lèche-écran ? magasinage.yahoo.ca

2 2

Re: [Boost-users] Using boost::format with Lambda expressions
by Shawn Church 29 Jan '04

29 Jan '04

Jaakko Jarvi (jajarvi(a)cs.indiana.edu) wrote: > Lambda and format don't play well together, I noticed :( > Here's a code that works however, with some explanation. > Not pretty. > > Best, Jaakko > ... > format f("%-10s|") ; > for_each(Foos.begin(), Foos.end(), > cout << ret<format&>(var(f) % bind(&foo::name, _1))); > > } > > // format defines operator% as a member, which takes precedence over > // % defined by lambda. Therefore one must make the format object to > // be a lambda functor. var does that. > // Var, however, cannot take a temporary object (it holds a reference to > // the wrapped object). That's why the variable f. > // ret<format&> informs lambda about the return type of formats % operator. OK, that is just what I was looking for, thanks!!! I tried all of those things but not in the right combination. Is there any resources (i.e. example programs or additional documentation) available for the lambda library. I have read through the test code already. Thanks,

2 1

Using boost::format with Lambda expressions
by Shawn Church 29 Jan '04

29 Jan '04

I may be missing something simple here but I have tried everything I can think of and cannot get the following to work (simplified from a project I am working on): Given a class such as: class foo{ public: foo(const char* name): _name(name) {} const char* name() const {return _name.c_str();} private: std::string _name;}; I can do the following without any problems: std::vector<foo> Foos; ... for_each(Foos.begin(), Foos.end(),cout << bind(&foo::name, _1) << "|"); This prints a list of all the names in the vector of Foo objects by calling the Foo::name() method. It would be nice to be able to do something like the following: for_each(Foos.begin(), Foos.end(), cout << format("%-10s|") % bind(&foo::name, _1); I have tried everything I can think of including extending the return type deduction of the lambda library to include the "%" operator as used by format and binding directly to the basic_format::operator% method. In every case I get 40 or so compile errors explaining why my 30 character statement is wrong :-) Does anyone have an example of this usage that works? This is not a high priority as I can obviously just format the value returned by the Foo::name() method but it would be nice to have this technique available when the need arises. I adapated the code above from a test program that demonstrates the problem in detail. I can provide the test program if anyone is interested (just tell me what to do with it). Thankyou for any help you can provide, Shawn Church sl_church(a)sbc_global.net

4 3

Storing vertex objects and edge objects in a BGL graph?
by Hugues Joly 29 Jan '04

29 Jan '04

Hi, I'd like to know if it's possible to create a BGL graph that uses custom-made classes for the nodes and the edges. While looking to your documentation, I came across the following: "Many graph representations (such as adjacency lists) do not store actual vertex objects, while others do (e.g., pointer-linked graphs)." (c.f. boost-1.30.2/libs/graph/doc/quick_tour.html) Is the pointer-linked graph implementation supplied from boost or do I have to create one and use external adaptation for using it with your library? Thanks in advance. __________________________________________________________ Lèche-vitrine ou lèche-écran ? magasinage.yahoo.ca

2 3

1.31.0??
by Phil Hornby 29 Jan '04

29 Jan '04

Hi all, Just wondering when a release of 1.31.0 is planned for? Thanks... -- Phil "Requirements - what are they I just hack something together that does what I think they want" ;)

2 3

RE: [Boost-users] Re: MultiArray questions
by Ben Hutchings 28 Jan '04

28 Jan '04

Dr Mark H Phillips <mark(a)austrics.com.au> wrote: > On Sun, 2004-01-25 at 04:47, garcia wrote: <snip> > > >Why can't you change the != into <? Ie, do: > > > > > > for(index i = 0; i < 3; ++i) > > > for(index j = 0; j < 4; ++j) > > > for(index k = 0; k < 2; ++k) > > > A[i][j][k] = values++; > > > > > >or can you? This would be more efficient I should think, and > > >requiring that index types be ordered shouldn't be too onerous > > >should it? > > > > > You can change the != into a < if you like. I don't see any > > good reason why one should be more efficient than the other. I > > personally use != because it more closely matches how I write > > for loops using iterators. > > So in short, that's a matter of personal preference. > > I would have thought < was more efficient. Isn't "i != j" > implemented, at machine level, more or less by "i > j || i < j". > So one compare would be cheaper than two. Or have I got this > wrong? <snip> A test for i != j typically compiles to an instruction sequence like: CISC: RISC: CMP j,i LD r1,i BEQ test_failed LD r2,j SUB. r0,r1,r2 BEQ test_failed (CMP is a subtraction which doesn't store its result but sets condition flags. BEQ is branch-if-equal. RISC processors need to have all arithmetic operands in registers, but generally they have a lot of registers so the variables may well be in registers already, making the LDs unnecessary.) A test for i < j (assuming i and j are unsigned) would be like: CISC: RISC: CMP i,j LD r1,i BCC test_failed LD r2,j SUB. r0,r2,r1 BCC test_failed (BCC is branch-if-carry-flag-clear. Order of arguments varies between assembly languages, so don't worry too much about that.) These instruction sequences usually have identical timing properties (the exact time taken depends on caching and branch prediction). Theoretically, an architecture which had a combined comparison and conditional branch could make != a little faster since it requires only bitwise comparison whereas < requires carrying between bits (longer signal propagation time). However, the world is moving away from such architectures - even x86 processors are designed to make the simple instructions run fast, not the complex ones. For a generic algorithm that uses iterators, comparing with < requires that the iterators be random-access. If this isn't essential to the algorithm, it would be better to use !=. So it's a good habit to use i != j as the loop condition if i can definitely never be greater than j.

2 1

Using boost::shared_ptr<> with G++'s -fno-rtti
by Jonathan Lennox 28 Jan '04

28 Jan '04

Is it possible to use boost::shared_ptr<> without RTTI being enabled? I'm trying to port some code to the Sharp Zaurus, and its GUI libraries are all compiled with the G++ flags -fno-exceptions -fno-rtti. Boost seems to support the former flag just fine, but has problems with the latter: g++ -g -O2 -Wall -fno-rtti -fno-exceptions -o sipua/main.o -c ../sipua/main.cpp In file included from ../libcine/boost/shared_ptr.hpp:27, from ../rtplib++/rtptypes.h:8, from ../rtplib++/rtpsession.h:14, from ../sipua/radio.h:11, from ../sipua/main.cpp:18: ../libcine/boost/detail/shared_count.hpp: In member function `virtual void* boost::detail::sp_counted_base_impl<P, D>::get_deleter(const std::type_info&)': ../libcine/boost/detail/shared_count.hpp:267: error: cannot use typeid with -fno-rtti In file included from ../rtplib++/rtptypes.h:8, from ../rtplib++/rtpsession.h:14, from ../sipua/radio.h:11, from ../sipua/main.cpp:18: ../libcine/boost/shared_ptr.hpp: In function `D* boost::get_deleter(const boost::shared_ptr&)': ../libcine/boost/shared_ptr.hpp:431: error: cannot use typeid with -fno-rtti What is the typeid call in the get_deleter functions doing? Is there any way to work around or disable this? Thanks. -- Jonathan Lennox lennox at cs dot columbia.edu

2 2

Disabling synchronization in Boost.Thread
by Aaron W. LaFramboise 28 Jan '04

28 Jan '04

Hi, Is there some easy way to disable all of the synchronization primatives in Boost.Thread, or in other words, make them all no-ops? I have written some generic code to be used in both singlethreaded and multithreaded environments, and it would be convenient for me to simply be able to 'switch off' synchronization when I know that I am in a singlethreaded environment, without having to uglify my code with ifdef's or similar. Simply disabling threads in Boost seems to cause synchronization primatives to fail to compile at all. Aaron

3 2

Re: MultiArray questions
by garcia 28 Jan '04

28 Jan '04

Dr Mark H Phillips <mark(a)austrics.com.au> wrote: >Hi, > >I've recently found out about the existence of MultiArray and I >am quite impressed! I was thinking of implementing something >similar myself but now hopefully I don't have to! However I have >a few questions that I'm hoping someone can answer. > > > Hi Mark. Thank you for the compliments on MultiArray. I hope that it meets your needs, and if not, I hope I can be of some service. >Question 1 >---------- > >In the user documentation there is an example which has >some example code: > > for(index i = 0; i != 3; ++i) > for(index j = 0; j != 4; ++j) > for(index k = 0; k != 2; ++k) > A[i][j][k] = values++; > >Why can't you change the != into <? Ie, do: > > for(index i = 0; i < 3; ++i) > for(index j = 0; j < 4; ++j) > for(index k = 0; k < 2; ++k) > A[i][j][k] = values++; > >or can you? This would be more efficient I should think, and >requiring that index types be ordered shouldn't be too onerous >should it? > > > You can change the != into a < if you like. I don't see any good reason why one should be more efficient than the other. I personally use != because it more closely matches how I write for loops using iterators. So in short, that's a matter of personal preference. >Question 2 >---------- > >If I use the built-in "no-frills" C array type to represent a >2-dimensional array in row-major order, then I would access >an element (i, j) by doing: > > a[ &a[0] + i*n + j ] > >where a is my m by n array. And if I wish to traverse a, in >row-major order, I can do: > > for (int* ip=&(a[0]); ip<&(a[n*m]); ip+=n) { > for (int* ijp=&(ip[0]); ijp<&(ip[n]); ++ijp) { > visit(ijp); > } > } > >These are a very efficient ways of doing things, but it lacks >somewhat in ease-of-generalization and in readbility. This is where >the MultiArray library is useful. But do I lose in efficiency by >going to MultiArray? Ie, in the simple case where base is 0, stride >is 1, and when we traverse in row-major order, is the MultiArray >library smart enough to do compile-time optimizations to generate >code which is as efficient as the above? > > > The MultiArray implementation doesn't currently do anything special for the case that the base is 0. I'm in the midst of doing some performance analysis on the library, and so far, to be honest, it looks like there is a performance hit. I'm investigating what is happening, and I hope to translate my findings into performance improvements. I would liket hose to be available by May of this year. >Is it possible to construct a new >multi_array/multi_array_ref/const_multi_array_ref from an array_view >by doing a deep copy of the view? > >A view is a nice way of looking at different parts of a MultiArray >object in a readable way, but sometimes you might wish to turn this >view into a more-efficiently represented object. Is this easy to do >in the MultiArray library? > > It is my intention that a new multi_array be constructible from an existing view, but on looking back through my code and test cases, the library does not currently support it. This is an oversight on my part. I hope to have this functionality available in CVS by the end of this coming week (which coincides with the end of the month). I'm afraid that the functionality won't make the upcoming Boost release however. >Question 4 >---------- > >Sometimes you might have an object starts off being mostly >accessed in row-major order, so you want a representation which works >efficiently for this use. But down the track you might wish to change >to mostly column-major access. Does MultiArray provide easy ways to >transform from one underlying representation to another? > > > There is no direct means to change the underlying representation of an existing array. The layout of an array is determined at construction. You can however assign a row-major multi_array to a column-major multi_array. >Thanks, > > > My pleasure. Thank you for your questions and comments. Incidentally, I am now subscribed to Boost-Users. I apologize for any discussion I have missed or inaccessibility resulting from my absence. Cheers, ron

2 1

Interfacing the .pyd with other .dll
by Shukla, Nitin (Export) 28 Jan '04

28 Jan '04

Hello, I am trying to build an application where my Python/C interface dynamic library (built using boost) is to call on function in another (windows) dll file containing the C function. I am using the 'bjam' tool to build the my Python/C interface (.pyd) file built it is giving me error. The C source file (which calls the function in another dll and used by boost to build the python/C interface ".pyd" files) gets compiled to generate the object file but linker fails to built the respective ".lib" and ".pyd" files as it doesn't get to link to the dll file defining a C function. I am fairly new to using bjam tool and my jamfile is a simple one. It looks like this: # Specify our location in the boost project hierarchy subproject libs/python/example/tutorial/nitin ; # Include definitions needed for Python modules import python ; extension world # Declare a Python extension called hello : main.cpp # source <dll>../../../build/boost_python # dependencies ; I do not know how can I specify bjam to compile and link with other dll for build the ".pyd" and ".lib" file. Can anyone help me how can I specify this in my jam file? It will be usefully for me if some one can tell where I can get documentation on writing jam files. I am using WinPython 2.3.2. I have built boost on Windows 2000 using MinGW compilers. Thanks in advance, Nitin

2 1

Test library fails to link on OS X 10.3 Panther
by Pierre-Michel Tremblay 27 Jan '04

27 Jan '04

Scott Lamb! I have the exact same set up as you have and I end up with the same error message as you do. Same as your earlier message: I've downloaded boost-1.30.2 and boost-jam-3.1.7 to my PowerBook running Mac OS X 10.3 (Panther). After installing boost-jam without problems, I'm attempting to build the boost test library as follows: $ uname -a Darwin spiff.local 7.2.0 Darwin Kernel Version 7.2.0: Thu Dec 11 16:20:23 PST 2003; root:xnu/xnu-517.3.7.obj~1/RELEASE_PPC Power Macintosh powerpc $ gcc_select Current default compiler: gcc version 3.3 20030304 (Apple Computer, Inc. build 1495) $ cd boost-1.30.2/libs/test/build $ bjam -sTOOLS=darwin ----- Same errors as you: ...failed darwin-Link-DyLib-action libs/test/build/bin/libboost_prg_exec_monitor.dylib/darwin/debug/ runtime-link-static/shared-linkable-true/ libboost_prg_exec_monitor.dylib... ... ...failed darwin-Link-DyLib-action libs/test/build/bin/libboost_test_exec_monitor.dylib/darwin/debug/ runtime-link-static/shared-linkable-true/ libboost_test_exec_monitor.dylib... ... ...failed darwin-Link-DyLib-action libs/test/build/bin/libboost_unit_test_framework.dylib/darwin/debug/ runtime-link-static/shared-linkable-true/ libboost_unit_test_framework.dylib... ... ...failed updating 6 targets... ...updated 283 targets... Have you or anyone successfully resolved the problem? Thanks. PM

1 0

compilation problem with property_map?
by lr 27 Jan '04

27 Jan '04

hello all, i was wondering if anyone could help me with this compilation error. gcc indicates that the error is in put(), specifically it cannot match the operator for [bool&] on property_map.hpp:316. the full output is included below. the origin of the error is caused in destructor code (when objects get out of scope in testgdlgraph.cpp). if i need to supply more information about the code i am writing let me know. i am hesitant because it is fairly complicated, as i am having trouble trying to replicate this problem in a simple example. thanks leonid ps. boost rocks, keep up the good work! the compiler error: /usr/include/boost/property_map.hpp: In function `void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*&, void*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag>, Reference = ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*&, K = bool, V = const ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*]': testgdlgraph.cpp:1488: instantiated from `void boost::put(Property, boost::adj_list_helper<Config, Base>&, const Key&, const Value&) [with Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>, boost::listS, boost::setS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>::config, Base = boost::bidirectional_graph_helper_with_property<boost::detail::adj_list_gen<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, st1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>, boost::listS, boost::setS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>::config>, Property = ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, Key = bool, Value = const ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*]' testgdlgraph.cpp:533: instantiated from `boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::edge_descriptor ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::add_edge(boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::vertex_descriptor&, boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::vertex_descriptor&) [with parameter_t = par_t, domain_value_t = dv_t, sr_element_t = test1()::ser_t]' testgdlgraph.cpp:104: instantiated from here /usr/include/boost/property_map.hpp:316: no match for `const boost::adj_list_edge_property_map<boost::bidirectional_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*&, void*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag>& [bool&]' operator /usr/include/boost/graph/detail/adjacency_list.hpp:2383: candidates are: Ref boost::adj_list_edge_property_map<Directed, Value, Ref, Vertex, Property, Tag>::operator[](boost::detail::edge_desc_impl<Directed, Vertex>) const [with Directed = boost::bidirectional_tag, Value = ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, Ref = ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*&, Vertex = void*, Property = boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, Tag = ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag] /usr/include/boost/property_map.hpp: In function `void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, const ngdl::domain_map<par_t, dv_t>*, const ngdl::domain_map<par_t, dv_t>*&, void*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag>, Reference = const ngdl::domain_map<par_t, dv_t>*&, K = bool, V = const ngdl::domain_map<par_t, dv_t>*]': testgdlgraph.cpp:1488: instantiated from `void boost::put(Property, boost::adj_list_helper<Config, Base>&, const Key&, const Value&) [with Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>, boost::listS, boost::setS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>::config, Base = boost::bidirectional_graph_helper_with_property<boost::detail::adj_list_gen<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, st1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>, boost::listS, boost::setS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>::config>, Property = ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, Key = bool, Value = const ngdl::domain_map<par_t, dv_t>*]' testgdlgraph.cpp:537: instantiated from `boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::edge_descriptor ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::add_edge(boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::vertex_descriptor&, boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::vertex_descriptor&) [with parameter_t = par_t, domain_value_t = dv_t, sr_element_t = test1()::ser_t]' testgdlgraph.cpp:104: instantiated from here /usr/include/boost/property_map.hpp:316: no match for `const boost::adj_list_edge_property_map<boost::bidirectional_tag, const ngdl::domain_map<par_t, dv_t>*, const ngdl::domain_map<par_t, dv_t>*&, void*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag>& [bool&]' operator /usr/include/boost/graph/detail/adjacency_list.hpp:2383: candidates are: Ref boost::adj_list_edge_property_map<Directed, Value, Ref, Vertex, Property, Tag>::operator[](boost::detail::edge_desc_impl<Directed, Vertex>) const [with Directed = boost::bidirectional_tag, Value = const ngdl::domain_map<par_t, dv_t>*, Ref = const ngdl::domain_map<par_t, dv_t>*&, Vertex = void*, Property = boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, Tag = ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag] make[2]: *** [testgdlgraph.o] Error 1 make[1]: *** [check-am] Error 2 make: *** [check-recursive] Error 1

2 1

vector_indexing_suite issue
by Jeff Holle 27 Jan '04

27 Jan '04

I am successfully using vector_indexing_suite in following code: class_<std::vector >("vector_B") .def(vector_indexing_suite<std::vector >()) ; However, I find that it requires that the B class conforms to the Equality Comparable concept where the STL standard only demands it to conform to the Assignable concept. I'm wondering if this is necessary, and if so how the operator== method should be coded. Can it simply always return true or false? Or compare "this" pointers?

2 1

CVS head build problem
by Jeff Holle 26 Jan '04

26 Jan '04

I downloaded the boost CVS head this morning and in attempting a re-build it, I found that my compiler, gcc v3.3, choked on the parmeter "-Wno-long-double". This problem was solved by changing line 61 of boost/tools/build/v1/gcc-tools.jam to: flags gcc CFLAGS : ; Suspect this wasn't a proper changed, but it worked for me.

2 1

boost::mpl:: operators ...power metafunction?
by Andy Little 26 Jan '04

26 Jan '04

Hi, I am implementing the mpl math operators for my physical_quantities type. Ideally I would like to declare a boost::mpl::power<A,B> metafunction. I would like to do: typedef Power_type<...> P ; pq_xx a; boost::mpl::power< pq_xx, P >::type b = run_time_power( a); OTOH: boost::mpl::power< P, pq_xx >::type b = run_time_power( a); (param order ... TBD) I am assuming it is ok to specialise plus, minus, multiplies etc in the boost::mpl namespace? I could of course put power (or whatever name) outside the boost::mpl namespace but that is not ideal. Any thoughts? regards Andy Little

2 2

how to create fixtures in unit test framework
by eli＠ce.berkeley.edu 25 Jan '04

25 Jan '04

1 0

bind1st and bind2nd together
by Hossein Haeri 25 Jan '04

25 Jan '04

Dear all, I've got a ternary function (which is std::find), and want to bind the first and second parameters (to the begining and the end of a std::vector). Then send the result to compose2 to check the equality for the end of the vector. Here is what I did: copy_if(istream_iterator<Terminal>(cin), istream_iterator<Terminal>(), back_inserter(temp), compose2(equal<set<Terminal>::iterator>(), bind1st(bind1st_3(ptr_fun(f), V_.begin()), V_.end()), V_.end()))); (I've prepared any goodie needed by ternary functions for the above statement: ptr_fun, bind1st_3, ...) Dev-C++ 4.9.8.0 (GCC 3.3.2 I think), gives me several errors (including "Reference to Reference" problem), and I'm nearly convinced not to continue it this way. Now, how do you, boost guys, do that? TIA, --Hossein __________________________________ Do you Yahoo!? Yahoo! SiteBuilder - Free web site building tool. Try it! http://webhosting.yahoo.com/ps/sb/

2 2

MPL Issue in apply.hpp in CVS
by Martin Ecker 25 Jan '04

25 Jan '04

Hello, I wanted to use boost::variant, so I got the Boost libraries from CVS. While developing a small test program I discovered an issue in the MPL header file apply.hpp that prevented successful compilation on MSVC 7.1. In particular, starting on line 245 in boost/mpl/apply.hpp it says // ISO98 C++, with minor concession to vc7 template< typename F, AUX_APPLY_N_PARAMS(i, typename T) > struct BOOST_PP_CAT(apply,i) { // Metafunction forwarding confuses vc7 typedef typename F::template apply< AUX_APPLY_N_PARAMS(i, T) >::type BOOST_MPL_AUX_LAMBDA_SUPPORT( BOOST_PP_INC(i) , BOOST_PP_CAT(apply,i) , (F, AUX_APPLY_N_PARAMS(i,T)) ) }; The first typedef in that struct should be // Metafunction forwarding confuses vc7 typedef typename F::template apply< AUX_APPLY_N_PARAMS(i, T) >::type type; Regards, Martin ---------------------------------------------------------------- Visit my pages on the Web: XEngine Project Page: http://xengine.sourceforge.net Private homepage: http://members.liwest.at/GroovingArts

2 2

Interval Library?
by David Brownell 25 Jan '04

25 Jan '04

I think I am looking for functionality that is contained with the Interval library, but am having a hard time digesting the documentation for this particular library. I would like an Interval that goes from a min_value to a max_value, where each value is the previous value + N. For example, the interval {2, 6, 10, 14, 18} has a minimum value of 2, a maximum value of 18, and increments by 4. Given this interval, I would like a function, Foo, that works as follows: Interval(2, 18, 4) i; i.Foo(2) == 2 i.Foo(6) == 2 i.Foo(0) == 2 i.Foo(18) == 18 i.Foo(20) == 18 i.Foo(5) == 6 i.Foo(3) == 6 Is this something that can be done with the Interval library, or am I missing the point? :) Thanks in advance for your help! David Brownell

3 3

Import Error: DLL load Failed
by Shukla, Nitin (Export) 24 Jan '04

24 Jan '04

Hello, I fairly new to the Boost tool. I have just build the Boost.Python 1.30.2. To get started I used the examples "getting_started1.cpp and getting_started2.cpp." and build the required DLLs using the bjam tool. I get following error when I try to import the module "getting_started1" into python : "ImportError: DLL load failed: The specified module could not be found." Can someone help me resolve this error? I am using PythonWin 2.2.1. Nitin

3 2

RE: [Boost-users] MultiArray questions
by Neil Mackie 23 Jan '04

23 Jan '04

I'm responding to Mark Phillips series of questions about MultiArray. I began using MultiArray last year and quickly realised I was unclear how to use the library. Posting to this list did not help and I resorted to emailing the developer. He had not responded, as he is not subscribed to this list. However he was helpful in answering my questions. My advice is to follow the same procedure as I did, contact details are available at http://www.boost.org/libs/multi_array/doc/index.html although the email address I used was garcia at cs dot indiana .edu. Please post your replies back to the list as I too wonder about the efficiency of MultiArray. It is nice to see a well formed set of questions and I look forward to seeing an equally clear set of answers. Regards, Neil (J Mackie). *********************************************************************************** Ofcom is the regulator for the UK communications industry, with responsibilities across television, radio, telecommunications and wireless communications services. Ofcom exists to further the interests of citizen-consumers as the communications industries enter the digital age. Ofcom has taken over the responsibilities and assumed the powers of the five former regulators it has replaced - the Broadcasting Standards Commission, the Independent Television Commission, Oftel, the Radio Authority and the Radiocommunications Agency. This email and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this email in error please notify the originator of the message. This footer also confirms that this email message has been scanned for the presence of computer viruses. Any views expressed in this message are those of the individual sender, except where the sender specifies and with authority, states them to be the views of Ofcom. ***********************************************************************************

1 0

jweb
by Emre Turkay 21 Jan '04

21 Jan '04

Hi All, I was trying to compile the boost-graph library documentation (pdf) and I've done the following, and got the error shown. -bash-2.05b$ pwd /home/emre/boost/boost-1.30.2/libs/graph/doc -bash-2.05b$ make jweb -np isomorphism-impl-v3.w make: jweb: Command not found make: *** [isomorphism-impl-v3.tex] Error 127 -bash-2.05b$ Can someone tell me what this "jweb" is ? Thanks, emre

2 1

RE: [Boost-users] tuple problems 2
by Ben Hutchings 19 Jan '04

19 Jan '04

Programmer_blabla <Programmer_blabla(a)hotmail.com> wrote: > Ok thank you, I will post this on microsoft.public.vc.language. > > About the other thing, I originally thinked about that. But what to > specifiy, using the typedef's won't work either (see below): > > int i; > boost::tuple<int> data(27); > > i = boost::tuples::get<0, boost::tuple<int>::head_type, > boost::tuple<int>::tail_type>(data); //ok > i = boost::bind(&boost::tuples::get<0, boost::tuple<int>::head_type, > boost::tuple<int>::tail_type>, _1)(data); //error <snip> Yes, I see, there's ambiguity as to whether this means template<int N, class HT, class TT> typename access_traits<typename element<N, cons<HT, TT> >::type> ::non_const_type get(cons<HT, TT> & c); or template<int N, class HT, class TT> typename access_traits<typename element<N, cons<HT, TT> >::type> ::const_type get(const cons<HT, TT> & c); You can resolve the ambiguity by writing: typedef const int & const_int_getter( const boost::tuple<int>::inherited &); i = boost::bind(static_cast<const_int_getter *>(&boost::get<0>), _1) (data);

2 1

Converting from const to non-const with iterator_adaptor
by Keith MacDonald 19 Jan '04

19 Jan '04

Hi, I'm stuck trying to use iterator_adaptor from the CVS head. I simply want to derive a non-const iterator from a const one derived from iterator_facade, as shown in the code below. When I compile it with VC7.1, the line marked "/* *ERROR* */" generates one of those impenetratable error messages that starts with: cannot convert from 'const Node' to 'boost::iterator_facade<Derived,Value,CategoryOrTraversal,Reference,Differen ce>::reference' If I delete that line, so the default is used, dereferencing a non-const iterator returns a const Node. This seems such a simple requirement that there must be an easy way to do it. What am I doing wrong? Thanks, Keith MacDonald /* ========================= Code Begins ========================= */ #include <boost/iterator/iterator_facade.hpp> #include <boost/iterator/iterator_adaptor.hpp> class Node { // ... // Iteration: public: class iterator; class const_iterator; // Read-only, bidirectional iterator: typedef boost::iterator_facade< const_iterator, const Node, std::bidirectional_iterator_tag > boost_const_iterator; class const_iterator : public boost_const_iterator { public: const_iterator() {} const_iterator(const iterator& it) : m_pNode(it.base().m_pNode) {} explicit const_iterator(const Node* pNode) : m_pNode(pNode) {} friend class iterator; friend class boost::iterator_core_access; private: // Interface required by iterator_facade: reference dereference() const { return *m_pNode; } void increment() { m_pNode = m_pNode->next(); } void decrement() { m_pNode = m_pNode->prev(); } bool equal(const_iterator it) const { return m_pNode == it.m_pNode; } protected: const Node* m_pNode; }; // Read-write, bidirectional iterator, // adapted from const_iterator: typedef boost::iterator_adaptor< iterator, const_iterator, Node /* *ERROR* */ > iterator_base; class iterator : public iterator_base { public: iterator() {} explicit iterator(Node* pNode) : iterator_base(const_iterator(pNode)) {} }; const_iterator begin() const { return const_iterator(m_pChild); } const_iterator end() const { return const_iterator(NULL); } iterator begin() { return iterator(m_pChild); } iterator end() { return iterator(NULL); } private: Node* m_pChild; Node* m_pPrev; Node* m_pNext; }; /* ========================= Code Ends ========================= */

4 27

re: BGL: BOOST_DEF_PROPERTY, BOOST_INSTALL_PROPERTY
by Vikram Anantha 18 Jan '04

18 Jan '04

<Rant> Is there really a need for using Macros (really evil macros with ## at that too) in a C++ library that espouses type safe generic programming. I wasted a couple of hours searching for the definition of vertex_name_t and edge_name_t. C'mon guys. No more gotchas. OK?? Friends dont let friends use ## macros. </Rant> Vik

1 0

RE: [Boost-users] tuple problems
by Ben Hutchings 17 Jan '04

17 Jan '04

programmer blabla <programmer_blabla(a)hotmail.com> wrote: > Dear Booster's Booster's what? > I have a problem compiling a tuple containing an enum in a > namespace. For example: > > namespace TestTuple > { > enum ETestTuple > { > eTestTuple0 = 0, > eTestTuple1 = 1 > }; > } > > void Testtuple5() > { > typedef boost::tuple<TestTuple::ETestTuple> Tuple; > Tuple tpl; > } > > does not compile. I am using MSVC 2003.net (7.1 version), > just native code. Is this a M$ problem or is tuple broken? Looks like a compiler bug to me. > Also I get problem with > the combination > of boost::bind and tuple, for example: > > int i; > boost::tuple<int> data; > > i = data.get<0>(); //ok > i = boost::tuples::get<0>(data); //ok > i = boost::bind(&boost::tuples::get<0>, _1)(data); //error > > Has anyone a clue? boost::tuples::get has three template parameters - index, head type and tail type. Usually the type arguments can be deduced, but since you're passing the address to another template function you need to specify all three arguments. > Btw searching lists.boost.org is very hard, because google > is out of sync with the list. Try <http://news.gmane.org/index.php?prefix=gmane.comp.lib.boost> instead.

2 1

[BGL] Custom edge-removing visitor.
by Kili2x＠netscape.net 17 Jan '04

17 Jan '04

Hello, all. I'm working on an algorithm that takes a graph and two path iterators (begin and past-the-end) as input, and removes "cross edges" (is that the right term in this case?) from the graph until the path described by the iterators is the only simple path between those two vertices. The implementation I have so far consists of a function template and three visitor class templates built on top of the boost::depth_first_visit function template. I'm still improving on it (too many out-edges from the path itself are being removed), but for now the function works as it should. Now, the graph reference passed to the operator() member function in the boost::base_visitor class template (from which I inherited) must be a constant reference, so I can't pass it to the boost::remove_edge function. Furthermore, looking at the source code included in <boost/graph/depth_first_search.hpp> (both 1.30.2 and CVS versions), the edge passed to vis.forward_or_cross_edge cannot be removed without invalidating the out_edge_iterator used in the depth-first traversal. I've worked around the first issue by keeping a non-constant reference to the graph as a member of my custom visitor class and passing that reference to boost::remove_edge, and I'm using the boost::on_finish_vertex event filter instead of boost::on_forward_or_cross_edge (adjusting the code as appropritate) in order to overcome the second issue. The workarounds look rather kludgey in code, so removing the const modifier and/or adding an extra iterator to store the current edge while incrementing the traversing iterator might enable me to come up with a more elegant solution. Would such changes to <boost/graph/depth_first_search.hpp> break compatibility with older code? Or are there other particular issues in play? BTW, Is this the appropriate list for seeking such help? TIA! Cromwell Enage __________________________________________________________________ New! Unlimited Netscape Internet Service. Only $9.95 a month -- Sign up today at http://isp.netscape.com/register Act now to get a personalized email address! Netscape. Just the Net You Need.

1 0

question about mpl::list
by Istvan Buki 16 Jan '04

16 Jan '04

Hi all, I'm using the mpl::list template in one of my aplications but I just hit what seems to be a limit. list compile fine with 10 parameters but not with 11. I saw in the documentation that there are several header files like : #include "boost/mpl/list/list50.hpp" Are they meant to be used in cases like mine and if it is the case could someone point me to a short example ? Thanks for your help, Istvan

2 2

interest in a glob_iterator? (directory_iterator with regex)
by Rich Johnson 16 Jan '04

16 Jan '04

Folks-- Is there general interest in a "globbing" iterator? If so I've got one I'm willing to re-package for submission. (Or at least discuss with folks for improvement) If you're interested, read on: glob_iterator aggregates a directory_iterator and regex to provide shell-style "*", "?", "{....}", "[....]" and "[^...]" wildcarding. boost components used: filesystem::directory_iterator filesystem::path filter_iterator reg_expression c_regex_traits Usage example: //...do something to all .cpp and .c files glob_iterator start( "*.{c,cpp}" ); glob_iterator end; while( start != end ){ std::string filename( start->leaf() ); //...do something with/to filename ++start; }

8 11

Boost.Python Feature Request
by Jenna Louis 16 Jan '04

16 Jan '04

Are there any patches or plans to add the following features to Boost.Python/Pyste? 1. A major usability problem of Boost generated proxies is that IDEs are not able to show any details about the expected parameters. Since Boost already knows everything about the function then it makes sense to at least make some information known about it via a docstring and then these tools can at least show that. 2. Another feature would append a docstring with the descriptive text to the specified Class, Function, or Method. 3. I often generate modules that require a very specific order of initialization for the proxies it contains. I often have to rearrange the _main.cpp's BOOST_PYTHON_MODULE code as depicted below to get my module to work. This: BOOST_PYTHON_MODULE(Sim) { Export_SzCoordPos(); Export_SzCoordAng(); Export_SzCoord(); Export_SzMath(); Export_SzPolyUtils() } To This: BOOST_PYTHON_MODULE(Sim) { Export_SzCoord(); Export_SzMath(); Export_SzPolyUtils() Export_SzCoordPos(); Export_SzCoordAng(); } It would be nice if this list would be generated in the order in which the pyste files are specified on the command line. 4. I would like a way to add pickling code to my class from pyste. I realize its not practical to generate this code automatically but I would at least like to be able to inline this in my pyste file. I can already insert code into the proxy with the declaration_code() feature to handle the pickle struct but I also need to be able to add a pickle method i.e.(".def_pickle(world_pickle_suite())" to the class definition I specify. Thanks, Jenna --------------------------------- Do you Yahoo!? Yahoo! Hotjobs: Enter the "Signing Bonus" Sweepstakes

2 1

RE: [Boost-users] Re: interest in a glob_iterator? (directory_ite rator with regex)
by Jim.Hyslop 15 Jan '04

15 Jan '04

Angus Leeming [mailto:angus.leeming@btopenworld.com] wrote: > Jeff Flinn wrote: > > And a more descriptive, less jargon-ish name. > > Why? Rich is proposing something that would iterate over the files > returned by the unix 'glob' function. As much as you might hate to admit it, you must recognize that the world does not revolve around UNIX (and before anyone claims otherwise, nor does the world revolve around Windows). To my knowledge, "glob" is not a standard computer term, nor a standard C++ term, it is a standard UNIX term. Now, I could be wrong, but my understanding of the ISO standardization process is make everything platform-independent (and keep in mind that one of the original goals of Boost was to be included in the Standard). The *concept* of the "glob" is pretty much platform independent, but the term is not, so it should have (to paraphrase Jeff) a more descriptive, less platform-specific name. -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. (<http://www.leitch.com/>) Columnist, C/C++ Users Journal (<http://www.cuj.com/experts>)

3 2

boost::scoped_ptr and std::auto_ptr interoperability
by Sam Partington 15 Jan '04

15 Jan '04

Hi all, Is there any reason why boost::scoped_ptr::reset doesn't provide a std::auto_ptr overload? Take the following code : class A {}; std::auto_ptr<A> factory(); // ... boost::scoped_ptr<A> a; a.reset(factory().release()); wheras a.reset(factory()); would be neater. (Trivial difference I know, but it does add to readability) Sam --LongSig ****************** This e-mail has been sent from Imagination Technologies Limited. PowerVR, Metagence, Ensigma and PURE Digital are divisions of Imagination Technologies Limited. The information contained in this e-mail, including any attachment, is confidential and may be legally privileged. It is intended solely for the addressee(s) and access to this e-mail by anyone else is unauthorised. If you are not the intended recipient, any disclosure, copying or distribution or use of the information contained in this e-mail, is prohibited and may be unlawful. If you have received this e-mail in error, please notify the sender by return e-mail and then delete it from your system. Internet communications cannot be guaranteed to be secure, error or virus-free. The sender does not accept liability for any errors or omissions which arise as a result. Any views expressed in this message are those of the author, except where the author specifies and, with authority, states them to be the views of Imagination Technologies Ltd.

1 0

boost on Mac OS X 10.3 (Panther)
by Vineet Mehta 15 Jan '04

15 Jan '04

Has anyone been able to successfully build and install boost on Mac OS X 10.3 (panther). I am using gcc 3.3, the latest xcode. The python variables were configured to: export PYTHON_ROOT=/System/Library/Frameworks/Python.framework/Versions/2.3 export PYTHON_VERSION=2.3 I have bjam installed. I used bjam "-sTOOLS=darwin" in the boost root directory. However at the yields a number of warning and error messages, and ends with : ...failed updating 70 targets... .. .. Any suggestions ? -Vineet

8 9

Problems with Reverse Cuthill-Mckee?
by Kris Vorwerk 14 Jan '04

14 Jan '04

Hello, I'm a fairly new Boost user, so please forgive me if I'm completely out of whack here. I'm presently using Boost's reverse Cuthill-Mckee ordering to reduce the bandwidth of some very large symmetric, positive definite sparse matrices that I'm investigating. Generally, the cuthill_mckee_ordering() has worked quite well, although a short while ago, I began noticing that it occasionally gave an invalid ordering (i.e., the permutations spit out by the algorithm would have multiple vertexes all the same, which, when used to permute my matrices, would destroy my problem). It took me a while to figure out what was going on, but I've finally distilled a small enough example that exhibits the problem. Consider the following matrix: Matrix: 6x6 [ [3.66667,0,-0.5,0,0,0], [0,2.66667,0,-0.222222,0,0], [-0.5,0,1.66667,0,0,-0.222222], [0,-0.222222,0,3.33333,-2.22222,0], [0,0,0,-2.22222,4.66667,0], [0,0,-0.222222,0,0,4.66667] ] Using fairly straightforward code, I loop through the non-zeros, and add edges to an undirected Boost graph (basically the same as the cuthill_mckee_ordering.cpp example in the docs). Here is the graph that gets created for the above problem, in Graphviz format: graph G { 0; 1; 2; 3; 4; 5; 0--0 ; 0--2 ; 1--1 ; 1--3 ; 2--2 ; 2--5 ; 3--3 ; 3--4 ; 4--4 ; 5--5 ; } And, if I run this example using the cuthill_mckee_ordering technique (or if I modify cuthill_mckee_ordering.cpp to use these vertices and edges), I get the following permutation (using the pseudo-peripheral heuristic): Inv_perm: 0 0 0 0 2 5 You can see, from the Graphviz output, that this graph has two disconnected sets of vertices, which is where I think the problem lies. It may be a problem in my understanding of how to setup the Boost graph, or perhaps a problem in the reordering technique. You'll notice that, in my example, I've eliminated the duplicate edges (such as 2-5 being the same as 5-2) -- I've tried adding them in, too, but it hasn't changed the result. I've noticed that, if one of my matrices produces a graph in which there are no disconnected sets of vertices, the RCM ordering works fine. It's only when the graph is disconnected in this fashion that the ordering fails. I've also noticed that, when using this kind of disconnected graph, if I sometimes select a random starting vertex (instead of the pseudo-peripheral pair heuristic), the cuthill_mckee_ordering segfaults. I've attached some sample code below that seems to exhibit the problem. I'm certainly open to the possibility that it's a problem in my understanding of how to use the library. Also, my Boost version is: 1.30.2 (Redhat RPM) Any thoughts would be appreciated. regards, Kris ============================================================== (borrowed and slightly modified from cuthill_mckee_ordering.cpp) #include <boost/config.hpp> #include <vector> #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/cuthill_mckee_ordering.hpp> #include <boost/graph/properties.hpp> #include <boost/graph/bandwidth.hpp> int main( int, char *[] ) { using namespace boost; using namespace std; typedef adjacency_list < vecS, vecS, undirectedS, property < vertex_color_t, default_color_type, property < vertex_degree_t, int > > > Graph; typedef graph_traits < Graph >::vertex_descriptor Vertex; typedef graph_traits < Graph >::vertices_size_type size_type; typedef std::pair < std::size_t, std::size_t > Pair; //graph G {0;1;2;3;4;5;0--0 ;0--2 ;1--1 ;1--3 ;2--2 ;2--5 ;3--3 ;3--4 ;4--4 ;5--5 ;} Pair edges[] = { Pair( 0, 0 ), Pair( 0, 2 ), Pair( 1, 1 ), Pair( 1, 3 ), Pair( 2, 2 ), Pair( 2, 5 ), Pair( 3, 3 ), Pair( 3, 4 ), Pair( 4, 4 ), Pair( 5, 5 )}; Graph G( 6 ); for( int i = 0; i < 10; ++i ) { std::cout << edges[i].first << ", " << edges[i].second << std::endl; add_edge( edges[i].first, edges[i].second, G ); } graph_traits < Graph >::vertex_iterator ui, ui_end; property_map < Graph, vertex_degree_t >::type deg = get( vertex_degree, G ); for( boost::tie( ui, ui_end ) = vertices( G ); ui != ui_end; ++ui ) { deg[*ui] = degree( *ui, G ); } property_map < Graph, vertex_index_t >::type index_map = get( vertex_index, G ); std::cout << "original bandwidth: " << bandwidth( G ) << std::endl; std::vector < Vertex > inv_perm( num_vertices( G ) ); std::vector < size_type > perm( num_vertices( G ) ); // reverse cuthill_mckee_ordering cuthill_mckee_ordering( G, inv_perm.rbegin(), get( vertex_color, G ), make_degree_map( G ) ); cout << "Reverse Cuthill-McKee ordering:" << endl; cout << " "; for( std::vector < Vertex >::const_iterator i = inv_perm.begin(); i != inv_perm.end(); ++i ) { cout << index_map[*i] << " "; } cout << endl; for( size_type c = 0; c != inv_perm.size(); ++c ) { perm[index_map[inv_perm[c]]] = c; } std::cout << " bandwidth: " << bandwidth( G, make_iterator_property_map( &perm[0], index_map, perm[0] ) ) << std::endl; return 0; }

2 3

Re:[Boost-users] interest in a glob_iterator? (directory_ite
by rlyon＠comgroup.net.au 14 Jan '04

14 Jan '04

I can use it. Hopefully you will use regex++ from boost to handle the regular expressions. Regards ... ____________________Reply Separator____________________ Subject: [Boost-users] interest in a glob_iterator? (directory_iterat Author: Rich Johnson <rjohnson(a)dogstar-interactive.com> Date: 13/01/2004 6:45 PM Folks-- Is there general interest in a "globbing" iterator? If so I've got one I'm willing to re-package for submission. (Or at least discuss with folks for improvement)

1 0

tuple problems
by programmer blabla 14 Jan '04

14 Jan '04

Dear Booster's I have a problem compiling a tuple containing an enum in a namespace. For example: namespace TestTuple { enum ETestTuple { eTestTuple0 = 0, eTestTuple1 = 1 }; } void Testtuple5() { typedef boost::tuple<TestTuple::ETestTuple> Tuple; Tuple tpl; } does not compile. I am using MSVC 2003.net (7.1 version), just native code. Is this a M$ problem or is tuple broken? Also I get problem with the combination of boost::bind and tuple, for example: int i; boost::tuple<int> data; i = data.get<0>(); //ok i = boost::tuples::get<0>(data); //ok i = boost::bind(&boost::tuples::get<0>, _1)(data); //error Has anyone a clue? Btw searching lists.boost.org is very hard, because google is out of sync with the list. With kind regards, Me.

1 0

int64_t in boost/cstdint.h with GCC -std=c++98 or -ansi
by Aaron W. LaFramboise 14 Jan '04

14 Jan '04

Hi, I noticed that boost/cstdint.h does not define int64_t when GCC is in strict mode (-ansi or -std=c++98) on MinGW, Cygwin, and probably other major platforms. This seems to be because boost/cstdint.h refuses to define the type if ULLONG_MAX (or ULONG_LONG_MAX or ULONGLONG_MAX) is not defined, even if BOOST_HAS_LONG_LONG is defined. GCC, quite correctly, will not define these macros in strict mode. However, the library still probably should be defining this type. Ideally, there would be a GCC-specific work-around to prevent warnings on the use of long long in strict mode. In particular, I am using the date_time library which depends on int64_t. It would be very unfortunate and a little silly if I could not use date_time in GCC's strict mode. How would it be best to fix this? Aaron

2 2

d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(31) : error C2039: 'item' : is not a member of 'Node'
by pixellent＠stodge.net 14 Jan '04

14 Jan '04

Hi, I'm trying to use Luabind in my application, and Luabind uses BOOST. I'm getting the following error: d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(31) : error C2039: 'item' : is not a member of 'Node' d:\development\ogre\ogrenew\ogremain\include\ogrenode.h(50) : see declaration of 'Node' d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(31) : error C2146: syntax error : missing ';' before identifier 'type' d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(31) : error C2208: 'struct boost::type' : no members defined using this type d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(32) : error C2039: 'next' : is not a member of 'Node' d:\development\ogre\ogrenew\ogremain\include\ogrenode.h(50) : see declaration of 'Node' d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(32) : error C2146: syntax error : missing ',' before identifier 'next' d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(32) : error C2065: 'next' : undeclared identifier d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\development\ogre\ogrenew\plugins\ogrelua\luabind\luabind\detail\primitives.hpp(91) : fatal error C1506: unrecoverable block scoping error Error executing cl.exe. Nature.obj - 7 error(s), 0 warning(s) Is this a bug in BOOST or am I doing something silly? Thanks Mike

1 0

Seeking permission to include Boost with book CD
by Matthew Wilson 13 Jan '04

13 Jan '04

Hi chaps / chappettes I am interested in including the latest released copy of Boost with the CD for my forthcoming book, Imperfect C++, to be published by Addison-Wesley this year. I have two questions: 1. Is Boost redistributable in this form? If so, from whom do I get written permission to do so? 2. What is the likely latest version of Boost that will be available around the end of Feb / beginning of March? Thanks in advance -- Matthew Wilson Director, Synesis Software (www.synesis.com.au) STLSoft moderator (http://www.stlsoft.org) Contributing editor, C/C++ Users Journal (www.synesis.com.au/articles.html#columns) -----------------------------------------------------

2 2

re: API documentation ?
by Vikram Anantha 13 Jan '04

13 Jan '04

Is there any place where I can look at the complete API documentation for the boost libraries. Something generated by doxygen or doc++ or something like that. Thanks Vik

2 1

cross compiling boost libs
by Uwe Sander 12 Jan '04

12 Jan '04

Hi, I would like to compile the boost libs for the Win32 platform using mingw on Linux. I have the required stuff installed and I know how to do such a cross compilation if I have a 'configure' based project but I do not know how to tell bjam what I am trying to achieve. Any hint? Thanks Uwe

2 1