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

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 <i>::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