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

RE: [Boost-Users] Linking an Archive
by Tom Matelich 27 Feb '02

27 Feb '02

The first getting_started1.so contains all the symbols from all of the objects linked into it. The second one only contains the symbols from getting_started.o and the symbols from libboost_python.a which satisfy unsatified symbols of getting_started1.o. Linking shared library is like linking an executable, it only takes the symbols from archives that it needs to satisfy itself. The first question is why you want libboost_python.a. If it is a valid reason, then you need to find a way to get all the code you need out of it into the shared lib. The first would be to use ar to get all the objects out, then take those and put them into the shared library. The second would be to keep adding unsatified symbols to getting_started.o until getting_started1.so has everything it needs. Tom > -----Original Message----- > From: doak87508 [mailto:jdoak@lanl.gov] > Sent: Wednesday, February 27, 2002 10:21 AM > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] Linking an Archive > > > I am playing around with using an archive to created a shared library > (.so file) instead of linking all the individual objects. I have > success when I link individual objects: > > % g++ -shared classes.o conversions.o errors.o extension_class.o > functions.o init_function.o module_builder.o objects.o types.o > cross_module.o getting_started1.o -o getting_started1.so > > % python > 1;31mh[1] >>> import getting_started1 > 1;31mh[1] >>> getting_started1.greet() > 'hello, world' > > Now, I create an archive: > > % ar r libboost_python.a classes.o conversions.o errors.o > extension_class.o functions.o init_function.o module_builder.o > objects.o types.o cross_module.o > > Then, I link that archive into the shared library: > > % g++ -shared libboost_python.a getting_started1.o -o > getting_started1.so > > % python > 1;31mh[1] >>> import getting_started1.so > Traceback (most recent call last): > File "<stdin>", line 1, in ? > ImportError: ./getting_started1.so: undefined symbol: > add__Q35boost6python19module_builder_basePQ45boost > 6python6detail8functionPCc > > I have also tried linking as follows with no change in result: > > % g++ -shared -L. -lboost_python getting_started1.o -o > getting_started1.so > > Does someone know how to get linking working with an archive file? > > JD > > > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > >

2 1

in-place set_union/difference/etc ...
by ivan_dobrianov 27 Feb '02

27 Feb '02

Does anyone know of any existing standard tool [an insert iteartor or something equivalent] that can allow one to perform union, difference, etc on sets and maps in-place. E.g. instead of using set<MyClass> s1, s2, temp; set_union( s1.begin(), s1.end(), s2.begin(), s2.end(), inserter(temp, temp.begin())); temp.swap(s2); i'd like to do, say: copy(s1.begin(), s1.end(), my_unioner(s2, s2.begin())); which will do s2 = s1 + s2 in LINEAR time. It's pretty simple to write an inserter like that, but I am just wondering if there is one already ... or something similar. Thanks!

1 0

Bug in boost_1_27_0.tar.gz threads library
by Martin Brown 27 Feb '02

27 Feb '02

Hi There seems to be a missing '}' in libs/thread/src/once.cpp when compiling on gcc-3.04 on Redhat Linux 6.2. I added one and it seems to work. Not sure if it is in the right place. Context diff: *** once.cpp Thu Feb 7 15:33:15 2002 --- once.cpp.new Wed Feb 27 15:53:02 2002 *************** *** 55,62 **** --- 55,63 ---- { once_callback* cb = reinterpret_cast<once_callback*>(pthread_getspecific(key)); (**cb)(); } + } #elif defined(BOOST_HAS_MPTASKS) void *remote_call_proxy(void *pData) { std::pair<void (*)(), boost::once_flag *> &rData(*reinterpret_cast<std::pair<void (*)(), boost::once_flag *> *>(pData)); Thanks for some great libraries! Martin __________________________________________________ Do You Yahoo!? Everything you'll ever need on one web page from News and Sport to Email and Music Charts http://uk.my.yahoo.com

2 1

Linking an Archive
by doak87508 27 Feb '02

27 Feb '02

I am playing around with using an archive to created a shared library (.so file) instead of linking all the individual objects. I have success when I link individual objects: % g++ -shared classes.o conversions.o errors.o extension_class.o functions.o init_function.o module_builder.o objects.o types.o cross_module.o getting_started1.o -o getting_started1.so % python 1;31mh[1] >>> import getting_started1 1;31mh[1] >>> getting_started1.greet() 'hello, world' Now, I create an archive: % ar r libboost_python.a classes.o conversions.o errors.o extension_class.o functions.o init_function.o module_builder.o objects.o types.o cross_module.o Then, I link that archive into the shared library: % g++ -shared libboost_python.a getting_started1.o -o getting_started1.so % python 1;31mh[1] >>> import getting_started1.so Traceback (most recent call last): File "<stdin>", line 1, in ? ImportError: ./getting_started1.so: undefined symbol: add__Q35boost6python19module_builder_basePQ45boost 6python6detail8functionPCc I have also tried linking as follows with no change in result: % g++ -shared -L. -lboost_python getting_started1.o -o getting_started1.so Does someone know how to get linking working with an archive file? JD

1 0

autoconf+make
by josefsyk 26 Feb '02

26 Feb '02

I've been struggling to port parts of the boost libraries to Linux using gnu's automake, just to hit the wall every time. Anyone out there who has done this already? The files needed are: boost/smart_ptr.hpp boost/pending/ct_if.hpp boost/random.hpp boost/bind.hpp boost/function.hpp Would be nice to have the Makefile.am for BGL too. cheers.

2 1

boost::condition question
by svanechel 26 Feb '02

26 Feb '02

Hi, I'm trying to create a mechanism that synchronizes access to shared data on a per-operation basis. The idea is that some operations (E.g. read operations) can proceed concurrently, while others (write operations) must block all other threads. I thought boost::condition would do the trick. Since I do not have that much experience in multithreaded programming it is entirely possible that I do not fully understand boost::condition or its allowable usage. I tried to put operations in an "Operation Group". All operations belonging to the same group are allowed to execute concurrently, while all others are blocked (E.g. all read operations are in the same group). It is also possible that an operation doesn't specify an Operation Group, in which case a temporary group is assigned to the operation for each thread that calls it. Write operations are constructed this way. Below is an example of what I mean (OperationLevelLockable is defined below): class SomeClass : private OperationLevelLockable { public: int ReadData() { Lock lock( this, READ_OP_GROUP ); return ( mData ); } void WriteData( int data ) { Lock lock( this ); // assign temp group to operation, // so each write // operation blocks all other accesses mData = data; } private: int mData; }; I'm developing on Windows 2000 on a multiprocessor machine. This is the code I use to test my idea: const int32 OPERATION_GROUP_1 = 1; const int32 OPERATION_GROUP_2 = 2; const int NUM_THREADS = 4; class TestOperationLevelLockable : public MTTestCase { public: TestOperationLevelLockable() : mShared( this ), mCurrentGroup( 0 ), mThreadCount( 0 ) { // Create two sets of threads, each performing a // different operation // When the TestOperationLevelLockable object is // constructed all // registered threads are created an start running RegisterThread( this, &TestOperationLevelLockable::Operation1Thread, NUM_THREADS ); RegisterThread( this, &TestOperationLevelLockable::Operation2Thread, NUM_THREADS ); } void CallFromGroup( int32 opGroup ) { boost::mutex::scoped_lock lock( mMutex ); if ( 0 == mCurrentGroup ) { mCurrentGroup = opGroup; } if ( ( mCurrentGroup != opGroup ) && ( mThreadCount < NUM_THREADS ) ) { ReportFailure( "OperationLevelLockable failed to lock out operations of different group", __FILE__, __LINE__ ); } ++mThreadCount; } protected: class MTObject : public OperationLevelLockable { public: MTObject( TestOperationLevelLockable* target ) : mTarget( target ) {} void CallFromGroup( int32 opGroup ) { mTarget->CallFromGroup( opGroup ); } private: TestOperationLevelLockable* mTarget; }; MTObject mShared; int32 mCurrentGroup; int mThreadCount; boost::mutex mMutex; void DoMTTest() { } void Operation1Thread() { MTObject::Lock lock( mShared, OPERATION_GROUP_1 ); mShared.CallFromGroup( OPERATION_GROUP_1 ); SleepThread( 30 ); // seconds, to keep the thread busy } void Operation2Thread() { MTObject::Lock lock( mShared, OPERATION_GROUP_2 ); mShared.CallFromGroup( OPERATION_GROUP_2 ); SleepThread( 30 ); // seconds, to keep the thread busy } }; And here is OperationLevelLockable: class OperationLevelLockable { class AccessCounter; public: OperationLevelLockable(){} typedef Internal::DefaultTMIntType IntType; template<typename T> struct MakeSharedType { typedef T volatile Type; }; class Lock; friend class Lock; class Lock { public: Lock( OperationLevelLockable& obj ) : mCounter( obj.mOpAccessCounter ) { mCounter.EnterOperation( Lock::TempOpGroup() ); } Lock( OperationLevelLockable& obj, int32 opGroup ) : mCounter( obj.mOpAccessCounter ) { mCounter.EnterOperation( opGroup ); } ~Lock() { mCounter.LeaveOperation(); } private: Lock( Lock const& ); Lock& operator=( Lock const& ); static IntType TempOpGroup() { static volatile IntType opGroup = Internal::kFIRST_AUTO_GROUP; IntType newGroup = OperationLevelLockable::AtomicIncrement( opGroup ); if ( newGroup >= Internal::kLAST_AUTO_GROUP ) { OperationLevelLockable::AtomicAssign( opGroup, Internal::kFIRST_AUTO_GROUP ); } return ( newGroup ); } AccessCounter& mCounter; }; static inline IntType AtomicIncrement( volatile IntType& lval ); static inline IntType AtomicDecrement( volatile IntType& lval ); static inline void AtomicAssign( IntType& lval, IntType rVal ); static inline void AtomicAssign( volatile IntType& lval, IntType rVal ); private: class AccessCounter : private boost::base_from_member<boost::recursive_mutex> { public: AccessCounter() : mLock( member ), mRefCnt( 0 ), mOpGroup( Internal::kANY_GROUP ) {} bool IsOpGroupActive( IntType opGroup ) const { return ( ( Internal::kANY_GROUP == mOpGroup ) || ( opGroup == mOpGroup ) ); } void LeaveOperation() { if ( 0 == OperationLevelLockable::AtomicDecrement( mRefCnt ) ) { SetOpGroup( Internal::kANY_GROUP ); mCanOpProceed.notify_all(); } } void EnterOperation( IntType opGroup ) { mCanOpProceed.wait( mLock, CanOpProceed( *this, opGroup ) ); SetOpGroup( opGroup ); OperationLevelLockable::AtomicIncrement( mRefCnt ); } private: AccessCounter( AccessCounter const& ); AccessCounter& operator=( AccessCounter const& ); struct CanOpProceed { CanOpProceed( AccessCounter const& counter, IntType opGroup ) : mOpGroup( opGroup ), mCounter( counter ) {} bool operator()() const { return ( mCounter.IsOpGroupActive( mOpGroup ) ); } private: CanOpProceed& operator=( CanOpProceed const& ); int32 mOpGroup; AccessCounter const& mCounter; }; void SetOpGroup( IntType opGroup ) { OperationLevelLockable::AtomicAssign( mOpGroup, opGroup ); } boost::recursive_mutex::scoped_lock mLock; boost::condition mCanOpProceed; volatile IntType mRefCnt; volatile IntType mOpGroup; }; OperationLevelLockable( OperationLevelLockable const& ); OperationLevelLockable& operator=( OperationLevelLockable const& ); AccessCounter mOpAccessCounter; }; The idea is that the first operation that is executed acquires the lock and blocks out all threads not belonging to the same Operation Group. The original blocking works fine. Only threads executing in the same Operation Group are allowed to continue. When the last thread of the group leaves the operation in OperationLevelLockable::AccessCounter::LeaveOperation it releases all waiting threads and a thread from the other group is allowed to run. However when this thread finishes no new threads are allowed to run anymore and the application hangs. Am I using boost::condition incorrectly. Should I use something else? It the test code wrong? Are there any other errors in the code that prevent it from behaving as expected. Should I use another technique to achieve the same? I hope there is someone out there who has the hart to read through the entire posting and help me. I hope I have given enough information. Thx. Sven Van Echelpoel.

2 4

Building regex with msvc6sp5 and stlport
by John Maddock 25 Feb '02

25 Feb '02

>I have succesfully built the regex library >under msvc6sp5, using the vc6-sltport.mak file. > >But I notice that the compiler gives me warnings >relating to the microsoft stl include directories: > >example: vc98\include\iterator: blah blah blah Then you aren't compiling / linking to STLport >Should it not be linking to the stlport include files? Yes. Did you either * update your INCLUDE and LIB environment variables to point to STLport. or * invoke the makefile using something like: nmake CXXFLAGS="-Ic:\STLport-4.5.1\stlport" -fvc6-stlport.mak - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

2 1

Thread support?
by John Maddock 24 Feb '02

24 Feb '02

>If I'm using Boost in a single threaded app, do I need to define >BOOST_DISABLE_THREADS to avoid Boost using locks, etc. internally? You don't need to, but it may remove some redundent code, if your app is single threaded *and* links to a multithreaded runtime. - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

4 4

Problem linking with regex on Win32
by John Maddock 23 Feb '02

23 Feb '02

>Run-time Library: Multithreaded DLL/Debug Multithreaded DLL > >I've got a couple of problems trying to get my app to link against regex. > >I've tried linking to the debug and release versions of both the DLL and >non-DLL versions of the regex library and in each case I get errors about >unresolved external symbols for w32_regex_traits. > >w32_regex_traits.obj has been produced by Jam. > >In addition the static version winges about lots of locally defined symbols. > >I've specified BOOST_REGEX_NO_LIB as the generated filenames are not what >Jam produces. There could be a number of problems: Where the libs compiled with STLport (even a small error in the STLport include path could have messed this up)? The debug STLport libs are probably compiled by jam with __STL_DEBUG defined, your source will need to set this also. If you want to check your jam compiled libs, get a dump of the symbols they contain - if they're using the Dinkumware std lib then you'll see them referencing std::basic_string, release STLport will reference _STL::basic_string, and debug STLport will reference _STLD::basic_string. Failing that just create a static lib project in your IDE and add the regex sources to that with the build setting you want (this is probably the quickest solution IMO). Finally define BOOST_REGEX_STATIC_LINK to suppress the import/export warnings - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

1 0

Building regex with msvc6sp5 and stlport
by boxerab 22 Feb '02

22 Feb '02

Hello, I have succesfully built the regex library under msvc6sp5, using the vc6-sltport.mak file. But I notice that the compiler gives me warnings relating to the microsoft stl include directories: example: vc98\include\iterator: blah blah blah Should it not be linking to the stlport include files? I have added the stlport directory location into the mak file, and I have it added to the list of include directories via the compiler gui. Thanks. Aaron Boxer boxerab(a)NOSPAMyahoo.com

1 0

Iterators
by Colin Fox 21 Feb '02

21 Feb '02

This isn't a boost specific message per se, I guess, but I thought someone here may know the answer. I have a list<> of smart_ptrs. Some of the elements in the list are ready for processing under various circumstances. What I'd like would be a custom iterator that when I say "++i" it checks the element to see if it's ready, and if not, advance to the next, and so on until it finds a ready element. If it doesn't find one, then i == list.end(). This would simulate having a list that contained only ready elements, without having to have multiple lists. I have a number of books on C++, but I can't figure out from them how to create a custom iterator. Can anyone help? -- Colin Fox CF Consulting Inc. cfox(a)crystalcherry.com

2 1

[BGL] BGL Book Erratum
by Eric Eide 21 Feb '02

21 Feb '02

Page 12, Figure 1.2: the edge (a,d) should be black, and (b,d) should be gray. ...unless `breadth_first_search' is using the `delay_map' in some way that is not obvious to me. Eric. -- ------------------------------------------------------------------------------- Eric Eide <eeide(a)cs.utah.edu> . University of Utah School of Computing http://www.cs.utah.edu/~eeide/ . +1 (801) 585-5512 voice, +1 (801) 581-5843 FAX

2 1

const smart pointers
by nckgl 21 Feb '02

21 Feb '02

how do I define const smart pointer? for example for "int" type 1. scoped_ptr<const int> 2. const scoped_ptr<int> If the latter then it may be better to re-define get() as follows T* get(){ return px; } // never throws const T* get()const { return px; } // never throws Now scoped_ptr::get() is defined as follows T* get() const { return px; } // never throws The same apply to other accessors (operator-> and so on)

2 1

Problem linking with regex on Win32
by Dale Peakall 21 Feb '02

21 Feb '02

I'll try and add some content before sending a message this time ;) Platform: 2K Compiler: VC6 SP5 Library: stlport-4.0 Boost: 1.27.0 Build Tool for Boost: Jam Run-time Library: Multithreaded DLL/Debug Multithreaded DLL I've got a couple of problems trying to get my app to link against regex. I've tried linking to the debug and release versions of both the DLL and non-DLL versions of the regex library and in each case I get errors about unresolved external symbols for w32_regex_traits. w32_regex_traits.obj has been produced by Jam. In addition the static version winges about lots of locally defined symbols. I've specified BOOST_REGEX_NO_LIB as the generated filenames are not what Jam produces. Here's the full details: --------------------Configuration: request_line_test - Win32 Debug-------------------- Linking... http_request_line.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: static void __cdecl boost::w32_regex_traits<char>::transform_primary(class _STL::basic_string<char,struct std::char_traits<char>,class _STL::allocator<c har> > &,class _STL::basic_string<char,struct std::char_traits<char>,class _STL::allocator<char> > const &)" (__imp_?transform_primary@?$w32_regex_traits@D@boost@@SAXAAV?$basic_string@D U?$char_traits@D@std@@V?$allocator@D@_STL@@@_STL@@ABV34@@Z) http_request_line.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: static bool __cdecl boost::w32_regex_traits<char>::lookup_collatename(class _STL::basic_string<char,struct std::char_traits<char>,class _STL::allocator< char> > &,char const *,char const *)" (__imp_?lookup_collatename@?$w32_regex_traits@D@boost@@SA_NAAV?$basic_string @DU?$char_traits@D@std@@V?$allocator@D@_STL@@@_STL@@PBD1@Z) http_request_line.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::bad_expression::bad_expression(class _STL::basic_string<char,struct std::char_traits<char>,class _STL::allocator<char> > const &)" (__ imp_??0bad_expression@boost@@QAE@ABV?$basic_string@DU?$char_traits@D@std@@V? $allocator@D@_STL@@@_STL@@@Z) http_request_line.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: static class _STL::basic_string<char,struct std::char_traits<char>,class _STL::allocator<char> > __cdecl boost::re_detail::w32_traits_base::error_strin g(unsigned int)" (__imp_?error_string@w32_traits_base@re_detail@boost@@SA?AV?$basic_string@DU ?$char_traits@D@std@@V?$allocator@D@_STL@@@_STL@@I@Z) http_request_line.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: static void __cdecl boost::w32_regex_traits<char>::transform(class _STL::basic_string<char,struct std::char_traits<char>,class _STL::allocator<char> > & ,class _STL::basic_string<char,struct std::char_traits<char>,class _STL::allocator<char> > const &)" (__imp_?transform@?$w32_regex_traits@D@boost@@SAXAAV?$basic_string@DU?$char_ traits@D@std@@V?$allocator@D@_STL@@@_STL@@ABV34@@Z) Debug/request_line_test.exe : fatal error LNK1120: 5 unresolved externals Error executing link.exe. request_line_test.exe - 6 error(s), 0 warning(s) Thanks, - Dale.

1 0

scoped_try_lock
by schalk_cronje＠nai.com 20 Feb '02

20 Feb '02

I was wondering about this line in boost::detail::thread::scoped_try_lock: if(m_locked) throw lock_error(); Since it is known that the lock attempt might fail and we do not want to block until the lock becomes available, is it not better to simply return false in the above case instead of throwing lock_error? ----------------------------------[ .signature ]--- Schalk W. Cronjé, Codernaut, Webshield Engineering, Network Associates. ++C or C++ ?

2 1

Permutation Iterator Adaptor Problem
by Jeff Flinn - wwnet 20 Feb '02

20 Feb '02

I'm trying to use the Permutation Iterator adaptor on MSV++ w/SP5 with boost_1_27_0. Below is a simplification of the example on the web site, which results in the compiler error found below function main: Any ideas? #include <list> #include <vector> #include <boost/permutation_iterator.hpp> int main(int argc, char* argv[]) { typedef std::vector < int > tElements; typedef tElements::iterator tEItr; typedef std::list < int > tIdxs; typedef tIdxs::iterator tIItr; typedef std::ostream_iterator< int > tOItr; tElements elements( 1, 1 ); tIdxs indices ( 1, 1 ); typedef boost::permutation_iterator_generator< tEItr, tIItr >::type tPItr; tPItr begin = boost::make_permutation_iterator( elements.begin(), indices.begin() ); int val = *begin; return 0; } error C2440: 'initializing' : cannot convert from 'struct boost::detail::iterator_traits_::undefined<void>' to 'int' Source or target has incomplete type

5 8

boost::regex compilation errors on RedHat 7.1/gcc 2.96
by John Maddock 19 Feb '02

19 Feb '02

>I'm new to boost and I'm primarily interested in the regex library but I get >some scary looking errors when trying to compile on RedHat. I imagine that >someone must have tried this already. >Thanks for any help you can offer. Unfortunately it's a known problem with gcc 2.96 (which was never officially released remember), gcc 2.95.x or gcc 3.x are both fine however. If anyone has a fix for redhat 2.96 gcc then I'd be happy to apply any patches - but it's not a gcc version I have access to. - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

1 0

boost.function as parameter of class template
by richielee616 19 Feb '02

19 Feb '02

I want to use boost.function object as a parameter of class template: template< function1<void,int> F > class foo { // ... }; but VC6 tells me "F : template parameter can never be initialized" why?

3 2

boost::regex compilation errors on RedHat 7.1/gcc 2.96
by Gerry Woods 18 Feb '02

18 Feb '02

Hi, I'm new to boost and I'm primarily interested in the regex library but I get some scary looking errors when trying to compile on RedHat. I imagine that someone must have tried this already. Thanks for any help you can offer. Gerry >uname -a Linux gloria.we.mediaone.net 2.4.2-2 #1 Sun Apr 8 20:41:30 EDT 2001 i686 unknown >gcc -v Reading specs from /usr/lib/gcc-lib/i386-redhat-linux/2.96/specs gcc version 2.96 20000731 (Red Hat Linux 7.1 2.96-81) >make -f gcc.mak g++ -o gcc/boost_regex/cregex.o -c -O2 -I../../../ ../src/cregex.cpp ../../../boost/regex.hpp: In function `iterator boost::re_detail::re_is_set_member (iterator, iterator, const boost::re_detail::re_set_long *, const boost::reg_expression<charT, traits_type, Allocator> &) [with iterator = boost::re_detail::mapfile_iterator, charT = char, traits_type = boost::regex_traits<char>, Allocator = allocator<char>]': ../../../boost/regex/detail/regex_match.hpp:600: instantiated from `boost::re_detail::query_match_aux (iterator, iterator, boost::match_results<iterator, Allocator> &, const boost::reg_expression<charT, traits, Allocator2> &, unsigned int, boost::re_detail::_priv_match_data<iterator, Allocator> &, iterator *) [with iterator = boost::re_detail::mapfile_iterator, Allocator = allocator<char>, charT = char, traits = boost::regex_traits<char>, Allocator2 = allocator<char>]' ../../../boost/regex/detail/regex_match.hpp:1177: instantiated from `boost::re_detail::reg_grep2 (Predicate, I, I, const boost::reg_expression<charT, traits, Allocator2> &, unsigned int, A2) [with Predicate = boost::re_detail::pred4, I = boost::re_detail::mapfile_iterator, charT = char, traits = boost::regex_traits<char>, A = allocator<char>, A2 = allocator<char>]' ../../../boost/regex/detail/regex_match.hpp:1836: instantiated from `boost::regex_grep (Predicate, iterator, iterator, const boost::reg_expression<charT, traits, Allocator2> &, unsigned int) [with Predicate = boost::re_detail::pred4, iterator = boost::re_detail::mapfile_iterator, charT = char, traits = boost::regex_traits<char>, Allocator = allocator<char>]' ../src/cregex.cpp:387: instantiated from here ../../../boost/regex.hpp:244: Internal compiler error in scan_region, at except.c:2809 Please submit a full bug report. See <URL:http://bugzilla.redhat.com/bugzilla/> for instructions. make: *** [gcc/boost_regex/cregex.o] Error 1

1 0

Threads and Smart Ptrs
by Colin Fox 16 Feb '02

16 Feb '02

Greetings, everyone. I'm currently having some trouble with a heavily multithreaded app which uses objects shared between threads via smart pointers. It's a multi-user application, where each user has a thread, and when one user sends a message to another (or broadcasts to all), a message object is created, and a smart pointer to that message is put into a queue for each thread. I'm using pthread_mutex for locking the queues for each thread. This program will sometimes work flawlessly for hours, and other times it will die within moments of starting. Pretty much every time it dies, it's because the message object has been freed while there are still smart pointers pointing to it. I know that the recent version of the smart pointer library was supposed to have added thread-safety to it, but I'm wondering if anyone else is having similar troubles. I'm using gcc 3.0.3 on Linux, and boost 1.27. I also discovered some things in the gcc documentation having to do with threads, (eg: when you compile the compiler, you have to tell it to build multi-threaded programs). And there are various threading flags that can be used during a compile, and I'm not sure which to use (or all of them?): -D_PTHREADS -D_REENTRANT -pthread : I'm using all those right now. Is that wrong? Any help would be greatly appreciated. It's driving me mad! :) Regards, Colin -- Colin Fox CF Consulting Inc. cfox(a)telus.net

3 8

Solaris CC version of Boost
by Kostas Kavoussanakis 15 Feb '02

15 Feb '02

Hello, I need to use boost with Solaris CC. Is this possible? Many thanks in advance, Kostas

4 3

Regex.hpp compile problem
by John Maddock 15 Feb '02

15 Feb '02

>I have some compile problems when I include regex.hpp from boost 1.27.0, >that seem to be internal to the interaction between my platform and >compiler. > >Are these known problems, and if so, what is the solution? > >ratts:~/cpp/classperf$ uname -a >Linux ratts 2.2.6 #46 Tue Apr 27 16:40:54 CDT 1999 i486 unknown >ratts:~/cpp/classperf$ gcc -v >Reading specs from /usr/lib/gcc-lib/i486-linux/2.7.2.3/specs >gcc version 2.7.2.3 Sorry, but I don't think that either boost or the regex lib has ever been testsed on a compiler that old (gcc 2.7?) You could try reading about boost's configuration options (libs/config/config.htm) and then running the configure script under libs/config. - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

1 0

The first question: How to build???
by olexander_shyrokov 15 Feb '02

15 Feb '02

Hello. Using: Windows 2000, MSVC 6, Stlport 4.5 I got a problem with building bost using jam. Actually what I need is regex, but I want to build all of them (for practice) :). I've downloaded jam, then I even built it from tools/build/jam_src, so it looks like I do have the correct version of the jam. So I'm making cd c:\src\boost then jam -sBOOST_ROOT=. -sTOOLS="msvc-stlport" And what I've got begins from: ./tools/build\boost-base.jam:1531: in subvariant-target *** argument error * rule dll-files ( module implib ? : sources * : target-type ? ) Can anyone help me with this? Thanks.

1 0

C++ socketstreams
by nils_ljunggren 14 Feb '02

14 Feb '02

This is not my favourite design but when using TCP/IP I belive this to be extra-ordinary: [lib.sockstream] The header <sockstream> defines four class templates and six types that associate stream buffers with sockets and assists reading and writing to and from sockets. In addittion <sockstream> defines three operators that extracts connection-oriented streams from connection-oriented server-streams. Header <sockstream> synopsis namespace sock { template <class charT, class traits= std::char_traits<charT> > class basic_socketbuf; typedef basic_socketbuf<char> socketbuf; typedef basic_socketbuf<wchar_t> wsocketbuf; template <class charT, class traits= std::char_traits<charT> > class basic_isocketstream; typedef basic_isocketstream<char> isocketstream; typedef basic_isocketstream<wchar_t> wisocketstream; template <class charT, class traits= std::char_traits<charT> > class basic_osocketstream; typedef basic_osocketstream<char> osocketstream typedef basic_osocketstream<wchar_t> wosocketstream; template <class charT, class traits= std::char_traits<charT> > class basic_socketstream; typedef basic_socketstream<char> socketstream; typedef basic_socketstream<wchar_t> wsocketstream; template <class charT, class traits> basic_isocketstream& operator >> (basic_isocketstream<charT, traits>& at, basic_isocketstream<charT, traits>& cs); template <class charT, class traits> basic_isocketstream& operator >> (basic_isocketstream<charT, traits>& at, basic_osocketstream<charT, traits>& cs); template <class charT, class traits> basic_isocketstream& operator >> (basic_isocketstream<charT, traits>& at, basic_socketstream<charT, traits>& cs); } Please reply to mailto:nlj@adr.dk [This is a Boost library proposal. - Mod]

1 0

Regex.hpp compile problem
by Dr. Ian McDonald 14 Feb '02

14 Feb '02

Hi, I have some compile problems when I include regex.hpp from boost 1.27.0, that seem to be internal to the interaction between my platform and compiler. Are these known problems, and if so, what is the solution? ratts:~/cpp/classperf$ uname -a Linux ratts 2.2.6 #46 Tue Apr 27 16:40:54 CDT 1999 i486 unknown ratts:~/cpp/classperf$ gcc -v Reading specs from /usr/lib/gcc-lib/i486-linux/2.7.2.3/specs gcc version 2.7.2.3 g++ performer.cpp In file included from /usr/local/include/boost/regex.hpp:44, from classperf.h:5, from performer.cpp:1: /usr/local/include/boost/regex/detail/regex_stack.hpp:47: parse error before `<' /usr/local/include/boost/regex/detail/regex_stack.hpp:52: `Allocator' was not declared in this scope /usr/local/include/boost/regex/detail/regex_stack.hpp:52: template argument 2 is invalid /usr/local/include/boost/regex/detail/regex_stack.hpp:52: `type' is not a class or namespace /usr/local/include/boost/regex/detail/regex_stack.hpp:52: warning: ANSI C++ forbids typedef which does not specify a type /usr/local/include/boost/regex/detail/regex_stack.hpp:52: confused by earlier errors, bailing out Thanks, Ian -- Dr. Ian McDonald Website Developer, No Fuss Websites.com T: +44 (0) 20 761 32110 F: +44 (0) 20 769 25461 -- Dr. Ian McDonald Website Developer, No Fuss Websites.com T: +44 (0) 20 761 32110 F: +44 (0) 20 769 25461

1 0

Distribution guidelines
by Edward Diener 12 Feb '02

12 Feb '02

I didn't see any guidelines for distributing the Boost header files in an implementation. Are there any ? As an example I may use only a small number of the header files for my distribution, so I assume I am not constrained to deliver all the header files nor am I constrained to deliver the full Boost distribution for any given version. While I can query the end-user during installation about having a specific version of Boost, and not install Boost files if the user does have a specific version, it does not seem as if I have to install the entire distribution, or even the entire set of header files if I am installing locally to my own directory structure. It would be nice if Boost actually had an install in its distribution because then , under Windows where I work, there would be a registry entry which I could read during the installation of any product which uses Boost. Has anyone ever suggested this, or is it seen as outside the boundaries of Boost ?

1 0

Regex questions
by Edward Diener 12 Feb '02

12 Feb '02

1) Support for Borland's C++ Builder 3 was dropped in moving the Regex++ implementation to Boost. Was this dropped because BCB3 can not support Boost, or Regex++, or was it just too much work to get it working with the Boost Regex++ version ? 2) Configuring Regex++ builds. Do I use user.hpp to configure the build, or is this used at the point of usage, or both ? If so, how do I know if BOOST_REGEX_NO_TEMPLATE_SWITCH_MERGE applies to a given compiler, and what does BOOST_REGEX_NO_W32 actually do. Finally what do the locale defines actually do ? Does defining the CPP or C locales constrain the Boost classes to use those locales or is it just setting a default locale which I can switch when instantiating the template classes ?

1 0

Poll results for Boost-Users
by Boost-Users＠yahoogroups.com 12 Feb '02

12 Feb '02

The following Boost-Users poll is now closed. Here are the final results: POLL QUESTION: Yahoo! groups can be configured so that only the moderators can view membership list, or so that membership lists can be viewed by anyone (email addresses are always munged for non-moderators; my email address would appear as something like jim.hyslop@.le...) Do you want the membership list to be freely available to be viewed by anyone, or do you want the membership list kept private so only the moderators can view the list? CHOICES AND RESULTS - I want only the moderators to be able to view the membership list, 0 votes, 0.00% - I want anyone to be able to view the membership list, 0 votes, 0.00% For more information about this group, please visit http://groups.yahoo.com/group/Boost-Users For help with Yahoo! Groups, please visit http://help.yahoo.com/help/us/groups/

2 2

Possible interest in select_by_predicate?
by Jonathan Brownell 11 Feb '02

11 Feb '02

I work in doing programming involving quite a bit of data analysis, and lately I've gotten sick and tired of doing routine searches on vectors and other linear containers to pull out maximum/minimum values. I ended up sitting down and writing a unary function object that retains a value based on any predicate. An example is worth a thousand words: int array[10] = { 5, 4, 6, 3, 9, 0, 7, 2, 8, 1 }; int maximum = std::for_each(&array[0], &array[10], select_by_predicate<int, std::greater>()); int minimum = std::for_each(&array[0], &array[10], select_by_predicate<int, std::less>()); assert(maximum == 9 && minimum == 0); Another example, using select_by_predicate independently: select_by_predicate<int, std::greater> max_error(0); for(loop through data samples) { double error; ... analyze data sample error ... max_error.compare(error); // same as max_error(error) } std::cout << "Maximum error: " << max_error; Is select_by_predicate something that boost users would be interested in? It's been helpful to me in all kinds of contexts. -Jonathan

3 4

Any use of a Singleton<> template
by sixfurdk 08 Feb '02

08 Feb '02

I currently working on a Singleton<> template, which currently has these features. 1) Supports the same interface/concepts as auto_ptr<> 2) One Line option to create a working singleton 3) Possible to use different Singletons of same type using names (simultaneously) 4) Possible to store different Singleton Objects under the same name (not simultaneously) 5) Possible to Release By Reference (Optional, Not Default) 6) Automatic Cleanup at program termination (Optional, Default) It can be used in the following manner: class SingletonObject { void someFunction(); ... }; Singleton<SingletonObject> singleton; singleton->someFunction(); Is there any interrest in such a class? Peter Sixhøj

2 2

tokenizer compilation problem with gcc 3.0.3 and stlport
by fintaeph 07 Feb '02

07 Feb '02

Hi all, I have been having trouble getting the tokenizer examples to compile using gcc 3.0.3 and stlport. I am using the example code from http://www.boost.org/libs/tokenizer/escaped_list_separator.htm, with the following compiler output: test.cpp: In instantiation of `::boost::::boost::iterator_ada ptor<::boost::detail::::boost::detail::token_iterator_base<co nst char *>,::boost::detail::::boost::detail::tokenizer_polic y<::_STL::::_STL::basic_string<char,::_STL::::_STL::char_trai ts<char>,::_STL::::_STL::allocator<char> >,::boost::::boost:: escaped_list_separator<char,::_STL::::_STL::char_traits<char> > >,::_STL::::_STL::basic_string<char,::_STL::::_STL::char_t raits<char>,::_STL::::_STL::allocator<char> >,const ::_STL::: :_STL::basic_string<char,::_STL::::_STL::char_traits<char>,:: _STL::::_STL::allocator<char> > &,const ::_STL::::_STL::basic _string<char,::_STL::::_STL::char_traits<char>,::_STL::::_STL ::allocator<char> > *,::_STL::forward_iterator_tag,int>': test.cpp:11: instantiated from here test.cpp:11: `sizeof' applied to incomplete type `::boost:::: boost::STATIC_ASSERTION_FAILURE<false>' If anyone has encountered and solved this problem before, I would greatly appreciate knowing what I'm doing wrong. Thanks, Chris. P.S. I get similar results with all the tokenizer examples.

3 3

modifed boost::stringtok
by hicks 06 Feb '02

06 Feb '02

Hello, I have created a modifed version of boost::stringtok() (the template function in boost\pending) with the aim of proving a more convient programmer interface. (It is called stringtok_2() below, but the interface is identical to stringtok()). The present version expects a container of objects which can be assigned a std::string. The modifed version is designed to accept a container of objects which can be converted to from std::string, at present "int" and "float" in addition to "std::string". E.g. char ac[] = "1 2 3 4 5"; std::vector<int> vi; boost::stringtok_2(vi,ac); std::vector<float> vf; boost::stringtok_2(vf,ac); std::vector<std::string> vs; boost::stringtok_2(vs,ac); As you can see in the cases for "int" and "float", the programmer can avoid having to create a vector of std::string and then convert them to int (or float) after calling stringtok. The implementation is achieved through template specialization. Behind the interface is an overloaded stringtok_2, template<typename Container, class Cvt> stringtok_2(Container l, Cvt cvt, const std::string s, const std::string ws) which takes a functor argument cvt which does the string to type conversion. The hithertoe used interface template<typename Container> stringtok_2(Container l, const std::string s, const std::string ws) calls the overloaded stringtok_2 with a converting functor string_cvt_ftr<Container::value_type>. string_cvt_ftr has a default declaration and two specializations, one for "int" and one for "float". template <class T> struct string_cvt_ftr { T operator()(const std::string& s) { return s; } }; template <> struct string_cvt_ftr<int> { int operator()(const std::string& s) { return std::atoi(s.c_str()); } }; template <> struct string_cvt_ftr<float> { float operator()(const std::string& s) { return std::atof(s.c_str()); } }; That is the partial specialization. Note that a vector of std::string can still be passed as the container argument. Since the interface semantics of are a superset of boost::stringtok(), I wonder if this could be substituted as a version-up, and use the same name. However, judging from the mail I see on this list, it is possible that some compilers might not handle it, so maybe that wouldn't be a good idea. I am sending this to boost-users since I do not currently recieve plain boost mail. I include the full code (including test code) below. Craig Hicks Engineer, KGK Tokyo //////////////////////////////////////////////////////////////////// // stringtok_2.h //--------------------------------------------------------------------------- #ifndef stringtok_2H #define stringtok_2H //--------------------------------------------------------------------------- #include <string> #include <cstring> // for strchr /***************************************************************** // modified with partial template specialization for int, float containers 2002.2.6 // Craig Hicks /***************************************************************** * This is the only part of the implementation that I don't like. * It can probably be improved upon by the reader... */ namespace stringtok_2_ns { inline bool isws (char c, char const * const wstr) { using namespace std; return (strchr(wstr,c) != NULL); } } namespace boost { /***************************************************************** * Simplistic and quite Standard, but a bit slow. This should be * templatized on basic_string instead, or on a more generic StringT * that just happens to support ::size_type, .substr(), and so on. * I had hoped that "whitespace" would be a trait, but it isn't, so * the user must supply it. Enh, this lets them break up strings on * different things easier than traits would anyhow. */ template <typename Container, typename Cvt> void stringtok_2 ( Container &l, Cvt cvt, std::string const &s, char const * const ws = " \t\n" ) { using namespace stringtok_2_ns; typedef std::string::size_type size_type; const size_type S = s.size(); size_type i = 0; while (i < S) { // eat leading whitespace while ((i < S) && (isws(s[i],ws))) ++i; if (i == S) return; // nothing left but WS // find end of word size_type j = i+1; while ((j < S) && (!isws(s[j],ws))) ++j; // add word l.push_back(cvt(s.substr(i,j-i))); // set up for next loop i = j+1; } } template <class T> struct string_cvt_ftr { T operator()(const std::string& s) { return s; } }; template <> struct string_cvt_ftr<int> { int operator()(const std::string& s) { return std::atoi(s.c_str()); } }; template <> struct string_cvt_ftr<float> { float operator()(const std::string& s) { return std::atof(s.c_str()); } }; template <typename Container> void stringtok_2 ( Container &l, std::string const &s, char const * const ws = " \t\n" ) { string_cvt_ftr<Container::value_type> cvt; stringtok_2(l, cvt, s, ws); } } // namespace boost #endif /////////////////////////////////////////////////////////////////// // test code void test_stringtok_2(std::ostream& os) /* Expected output:: int 1, 2, 3, 4, 5, float 1, 2, 3, 4, 5, string 1, 2, 3, 4, 5, */ { char ac[] = "1 2 3 4 5"; os << "int" << std::endl; std::vector<int> vi; boost::stringtok_2(vi,ac); std::copy(vi.begin(), vi.end(), std::ostream_iterator<int,char>(os,", ")); os << std::endl; os << "float" << std::endl; std::vector<float> vf; boost::stringtok_2(vf,ac); std::copy(vf.begin(), vf.end(), std::ostream_iterator<float,char>(os,", ")); os << std::endl; os << "string" << std::endl; std::vector<std::string> vs; boost::stringtok_2(vs,ac); std::copy(vs.begin(), vs.end(), std::ostream_iterator<std::string,char>(os,", ")); os << std::endl; }

2 2

Tokenizer question
by Edward Diener 06 Feb '02

06 Feb '02

Two tokenizer questions 1) I do not understand the constructor parameters to the char_delimits_separator class which is the default TokenizerFunction model. I assume the constructor would enable one to specify the delimiters for each token. I assume that the "returnable" parameter is a string literal of delimiters which are also returned as tokens and that "nonreturnable" is a string literal of delimiters which are not returned as tokens. I assume that the intersection of these string literals consists of all the delimiters. Given these assumptions, what is the purpose of the bool "return_delims" first parameter ? If "returnable" specifies a non-empty string literal, then why shouldn't these be the delimiters returned as tokens irregardless of the setting of "return_delims". If "returnable" specifies an empty string literal, then no delimiters will be returned as tokens once again irregardless of the setting of "return_delims". Would someone please explain why "return_delims" exists as a parameter in conjunction with the meaning of the "returnable" parameter ? It seems utterly redundant and unnecessary. 2) How does one create one own's TokenizerFunction to be plugged into the tokenizer class template as the first template type ? The documentation on TokenizerFunction concept leaves me utterly confused on a practical level. I assume I am creating a template class here despite the name which suggests it is a function, but the documentation never explains what it is. Maybe someone from Boost or John Bandela should consider updating it.

2 2

Another Tokenizer question
by s1imshady86 06 Feb '02

06 Feb '02

How do you specify that a white space is a returnable delimiter? The obvious, char_delimiters_separator<char> func (true, " "); Doesnt work. I know it's rather newbish question, but please help. A little more documentaion on token_iterator and TokenizerFunction concept (and perhaps the three specialized ones) would help greatly! Thanks, Ray

1 0

[Fwd: Re: [Boost-Users] Four Questions on boost::shared_ptr]
by hicks 05 Feb '02

05 Feb '02

-------- Original Message -------- Subject: Re: [Boost-Users] Four Questions on boost::shared_ptr Date: Tue, 05 Feb 2002 10:08:25 +0900 From: hicks <hicks(a)kgk.co.jp> To: Boost-Users(a)yahoogroups.com, Duane Murphy <duanemurphy(a)mac.com> References: <B8838630.133F2%darin(a)bentspoon.com> <20020204170343.12718(a)mail.murphyslogic.com> Hi >>You should normally use std::vector unless you have some special reason to >>use boost:: scoped_array and boost::shared_array. Those classes are provided >>both for completeness, and because occasionally there are such special >>reasons. But not often. > >I consider user vector<> often. However there is a cost. For a fixed size >allocation of a buffer there is only the data allocated. If you use a >vector<> the vector also includes (for most implementations) the current >capacity, the current size, and the allocator. There is another sometimes very big overhead incurred by std::vector, and not incurred by by new T[]/ delete[]. Most implementions of std::vector will enter a loop and call a destructor on each element of the array, even if there is no machine code associated with that destructor. At least Borlands implemention of delete[] automatically detects this condition and does not insert a loop to call the destructors. This could be avoided if std::vector used a traits type to determine whether to enter a loop calling destructors. Craig Hicks KGK Tokyo Duane Murphy wrote: >--- At Mon, 4 Feb 2002 00:28:32 -0800, Darin Adler wrote: > >>On 2/3/02 11:54 PM, "Jon Wang" <webmaster(a)boost.100ok.com> <mailto:webmaster@boost.100ok.com> wrote: >> >>>1. Mr Stroustrup said that there wasn't a need for auto_array, for "a >>> >better > >>>solution is to use a vector". So, should we use vector or >>>scoped_array/shared_array? >>> >>You should normally use std::vector unless you have some special reason to >>use boost:: scoped_array and boost::shared_array. Those classes are provided >>both for completeness, and because occasionally there are such special >>reasons. But not often. >> > >I consider user vector<> often. However there is a cost. For a fixed size >allocation of a buffer there is only the data allocated. If you use a >vector<> the vector also includes (for most implementations) the current >capacity, the current size, and the allocator. > >I would be interested in finding a class that is somewhere between >allocating my own buffers and vector<>. Low overhead for simple >allocations; no resizing or growing. Even in this case, in order to >support iterator semantics the size is going to be needed. > >Sigh. > >I suppose a case like this might be when scoped_array would be used? > > ...Duane > > > > >Info: <http://www.boost.org> >Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> >Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > >Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ > > > > >

1 0

Re: [Boost-Users] Four Questions on boost::shared_ptr
by Darin Adler 05 Feb '02

05 Feb '02

On 2/3/02 11:54 PM, "Jon Wang" <webmaster(a)boost.100ok.com> wrote: > 1. Mr Stroustrup said that there wasn't a need for auto_array, for "a better > solution is to use a vector". So, should we use vector or > scoped_array/shared_array? You should normally use std::vector unless you have some special reason to use boost:: scoped_array and boost::shared_array. Those classes are provided both for completeness, and because occasionally there are such special reasons. But not often. > 2. In the document, four implementations are said to have been discussed: > Direct detached, Indirect detached, Embedded detached and Placement detached. > I've tried to describle them (Are I right? See the attached file), but I don't > understand the Placement detached. Could someone please tell me what it's > like? The concept here is that the object is allocated in a special way, which require use of placement, so the count is in a header before the object. This is a form of the "embedded attached" scheme that does not require changes to the original object's class, but it does require a special form of new, so you couldn't just call the normal "new" and then give the object to such a smart pointer. [Note: There was no attached file.] > 3. In the file smart_ptr.hpp, we can see the private function > shared_ptr::share. > > I'm sorry that I don't understand that reason why ++*rpn should be done before > dispose(). Would someone please give me an example? Or is it like this? This function is gone from the latest implementation of shared_ptr slated for the next boost release, so it's probably not worthwhile to discuss this particular aspect of the old implementation in detail. The code you enclosed looks something like the kind of code that caused trouble -- the key is that deleting the old object pointed to can end up deleting the new shared pointer in some cases, and this must not happen before incrementing the reference count. The new implementation avoids this issue by using the well-known "copy and swap" idiom for implementing assignment, and is easier to understand. > 4. Why not use policies? I'm afraid that the word "parameterization will > discourage users" might not be always true, for we can use default parameters. We'll probably be using policies in future version, if we can work out all the issues. Andrei Alexandrescu is considering submitting his smart pointer class template from his Loki library to Boost for formal review, which is the most likely candidate for a Boost policy-based smart pointer. If it turns out well enough, it may replace all the existing smart pointer class templates. -- Darin

3 3

Re: [Boost-Users] Four Questions on boost::shared_ptr
by Jon Wang 04 Feb '02

04 Feb '02

>[Note: There was no attached file.] Oh, sorry! Here is the attached code. Am I right? Thanks very much. But still I haven't understand placement attached:-) #ifndef COUNTED_PTR_HPP #define COUNTED_PTR_HPP #include <cstring> #include <boost/config.hpp> // counted_ptr --------------------------------------------------------------// template <typename T> class RefLinking { protected: RefLinking(T* p) { init(p); } ~RefLinking() { dispose(); } template<typename Y> RefLinking(const RefLinking<Y>& r) { insert(&r); } // never throws RefLinking(const RefLinking& r) { insert(&r); } // never throws public: template<typename Y> void operator=(const RefLinking<Y>& r) { share(&r); } void operator=(const RefLinking& r) { share(&r); } void reset(T* p=0) { if ( px == p ) return; // fix: self-assignment safe dispose(); init(p); } // reset T* get() const { return px; } // never throws long use_count() const { long i = 0; const RefLinking* p = prev; while(p){ p = p->prev; ++i; } p = this; while(p){ p = p->next; ++i; } return i; } // never throws #if ( defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) ) || !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS ) private: #endif T* px; RefLinking *prev, *next; // Don't split this line into two; that causes problems for some GCC 2.95.2 builds #if !defined( BOOST_NO_MEMBER_TEMPLATES ) && !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS ) template<typename Y> friend class RefLinking; #endif void init(T* p) { px = p; prev = 0; next = 0; } void dispose() { if(prev) prev->next = next; else if(next) next->prev = prev; else delete px; } template <class Y> void insert(Y* rr) { RefLinking* r = (RefLinking*)rr; px = r->px; prev = (r); next = r->next; r->next = this; if(next) next->prev = this; } template <class Y> void share(Y* r) { if ((void*)this != (void*)r) { dispose(); insert(r); } } // share }; //*/ template <typename T> class EmbeddedAttached { protected: EmbeddedAttached(T* p) { init(p); } ~EmbeddedAttached() { dispose(); } template<typename Y> EmbeddedAttached(const EmbeddedAttached<Y>& r) : ptr(r.ptr) { // never throws if(ptr) ++(ptr->pn); } EmbeddedAttached(const EmbeddedAttached& r) : ptr(r.ptr) { if(ptr) ++(ptr->pn); } // never throws public: template<typename Y> void operator=(const EmbeddedAttached<Y>& r) { share(r.ptr); } void operator=(const EmbeddedAttached& r) { share(r.ptr); } void reset(T* p=0) { if ( ptr == p ) return; // fix: self-assignment safe dispose(); init(p); } // reset T* get() const { return ptr; } // never throws long use_count() const { return (ptr)? ptr->pn: 0; } // never throws #if ( defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) ) || !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS ) private: #endif T* ptr; // Don't split this line into two; that causes problems for some GCC 2.95.2 builds #if !defined( BOOST_NO_MEMBER_TEMPLATES ) && !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS ) template<typename Y> friend class EmbeddedAttached; #endif void init(T* p) { ptr = p; if(ptr) ++(ptr->pn); } void dispose() { if(ptr&&--(ptr->pn)== 0) delete ptr; } void share(T* r) { if (ptr != r && r) { // Q: why not px != rpx? A: fails when both == 0 ++(r->pn); // done before dispose() in case rpn transitively // dependent on *this (bug reported by Ken Johnson) dispose(); ptr = r; } } // share }; template <typename T> class IndirectDetached { protected: IndirectDetached(T* p) { init(p); } ~IndirectDetached() { dispose(); } template<typename Y> IndirectDetached(const IndirectDetached<Y>& r) : ptr(r.ptr) { // never throws ++(ptr->pn); } IndirectDetached(const IndirectDetached& r) : ptr(r.ptr) { ++(ptr->pn); } // never throws public: template<typename Y> void operator=(const IndirectDetached<Y>& r) { share(r.ptr); } void operator=(const IndirectDetached& r) { share(r.ptr); } void reset(T* p=0) { if ( ptr->px == p ) return; // fix: self-assignment safe dispose(); init(p); } // reset T* get() const { return ptr->px; } // never throws long use_count() const { return ptr->pn; } // never throws #if ( defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) ) || !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS ) private: #endif struct IDHelper{ T* px; long pn; IDHelper(T* p): px(p), pn(1) {} ~IDHelper() { delete px; } }; IDHelper* ptr; // Don't split this line into two; that causes problems for some GCC 2.95.2 builds #if !defined( BOOST_NO_MEMBER_TEMPLATES ) && !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS ) template<typename Y> friend class IndirectDetached; #endif void init(T* p) { try { ptr = new IDHelper(p); } catch (...) { delete p; throw; } } void dispose() { if(--(ptr->pn) == 0) delete ptr; } template <class Y> void share(IDHelper* r) { if ((void*)ptr != (void*)r) { // Q: why not px != rpx? A: fails when both == 0 ++(r->pn); // done before dispose() in case rpn transitively // dependent on *this (bug reported by Ken Johnson) dispose(); ptr = r; } } // share }; //*/ template <typename T> class DirectDetached { protected: DirectDetached(T* p) : px(p) { try { pn = new long(1); } catch (...) { delete p; throw; } } ~DirectDetached() { dispose(); } template<typename Y> DirectDetached(const DirectDetached<Y>& r) : px(r.px) { // never throws ++*(pn = r.pn); } DirectDetached(const DirectDetached& r) : px(r.px) { ++*(pn = r.pn); } // never throws public: template<typename Y> void operator=(const DirectDetached<Y>& r) { share(r.px, r.pn); } void operator=(const DirectDetached& r) { share(r.px, r.pn); } void reset(T* p=0) { if ( px == p ) return; // fix: self-assignment safe if (--*pn == 0) { delete px; } else { // allocate new reference counter try { pn = new long; } // fix: prevent leak if new throws catch (...) { ++*pn; // undo effect of --*pn above to meet effects guarantee delete p; throw; } // catch } // allocate new reference counter *pn = 1; px = p; } // reset T* get() const { return px; } // never throws long use_count() const { return *pn; } // never throws // Tasteless as this may seem, making all members public allows member templates // to work in the absence of member template friends. (Matthew Langston) // Don't split this line into two; that causes problems for some GCC 2.95.2 builds #if ( defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) ) || !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS ) private: #endif T* px; // contained pointer long* pn; // ptr to reference counter // Don't split this line into two; that causes problems for some GCC 2.95.2 builds #if !defined( BOOST_NO_MEMBER_TEMPLATES ) && !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS ) template<typename Y> friend class DirectDetached; #endif void dispose() { if (--*pn == 0) { delete px; delete pn; } } void share(T* rpx, long* rpn) { if (pn != rpn) { // Q: why not px != rpx? A: fails when both == 0 ++*rpn; // done before dispose() in case rpn transitively // dependent on *this (bug reported by Ken Johnson) dispose(); px = rpx; pn = rpn; } } // share }; template<typename T, class Storage = DirectDetached<T> > class counted_ptr: public Storage { public: typedef T element_type; explicit counted_ptr(T* p = 0) : Storage(p) {} template<typename Y, typename S> counted_ptr(const counted_ptr<Y, S>& r) : Storage(r) {} // never throws template<typename Y, typename S> counted_ptr& operator=(const counted_ptr<Y, S>& r) { *static_cast<Storage*>(this) = static_cast<const S&>(r); return *this; } counted_ptr(const counted_ptr& r) : Storage(r) {} // never throws counted_ptr& operator=(const counted_ptr& r) { *static_cast<Storage*>(this) = static_cast<const Storage&>(r); return *this; } T& operator*() const { return *get(); } // never throws T* operator->() const { return get(); } // never throws bool unique() const { return use_count() == 1; } // never throws void swap(counted_ptr& other) // never throws { using std::memcpy; const int size = sizeof(counted_ptr); char temp[size]; memcpy(temp, &other, size); memcpy(&other, this, size); memcpy(this, temp, size); } }; // counted_ptr #endif // COUNTED_PTR_HPP Jon Wang 2002-02-04

1 0

Re: [Boost-Users] Four Questions on boost::shared_ptr
by Darin Adler 04 Feb '02

04 Feb '02

On 2/4/02 12:51 AM, "Jon Wang" <webmaster(a)boost.100ok.com> wrote: > [Non-text portions of this message have been removed] I should have been more clear. This list doesn't allow attached files. -- Darin

1 0

Re: [Boost-Users] Four Questions on boost::shared_ptr
by Jon Wang 04 Feb '02

04 Feb '02

>[Note: There was no attached file.] Oh, sorry! Here is the attached file. Am I right? Jon Wang 2002-02-04 [Non-text portions of this message have been removed]

1 0

Unable to compile thread example on the document.
by 御風只配做笨木頭 04 Feb '02

04 Feb '02

Hi, I cannot compile the thread example listed on the document: http://www.boost.org/libs/thread/doc/thread.html#Example I'm using g++ 2.95.3 on a FreeBSD 4.x box. Here are the exact environment and compile error messages: % uname -a FreeBSD XXX.foo.bar 4.5-PRERELEASE FreeBSD 4.5-PRERELEASE #0: Tue Jan 8 03:14:40 CST 2002 root@XXX.foo.bar:/usr/src/sys/compile/kernel.XXX i386 % g++ -v Using builtin specs. gcc version 2.95.3 20010315 (release) [FreeBSD] % cat test_thread0.cpp #include <boost/thread/xtime.hpp> #include <boost/thread/thread.hpp> #include <iostream> struct thread_alarm { thread_alarm(int secs) : m_secs(secs) { } void operator()() { boost::xtime xt; boost::xtime_get(&xt, ::boost::TIME_UTC); xt.sec += m_secs; boost::thread::sleep(xt); std::cout << "alarm sounded..." << std::endl; } int m_secs; }; void run() { int secs = 5; std::cout << "setting alarm for 5 seconds..." << std::endl; boost::thread thrd(thread_alarm(secs)); std::cout << "main()" << std::endl; thrd.join(); } int main() { run(); } % g++ -I/usr/local/include test_thread0.cpp test_thread0.cpp: In function `void run()': test_thread0.cpp:28: request for member `join' in `thrd', which is of non-aggregate type `boost::thread ()(thread_alarm)' The boost library is installed through FreeBSD's ports collection which the boost version is 1.26.0. I've tried to figure out where the problem is and failed to find the definition of class thread. Do I miss something? Or, is it just a freebsd porting problem? ps. The example seems lack of a xtime inclution. So I add the #include at the first line: #include <boost/thread/xtime.hpp> -- Chien-Chou Hung / Jeff Hung / 洪健洲 (Big5) National Chiao Tung University Institute of Information Management 交通大學資訊管理所碩士生 http://www.jeffhung.idv.tw/ mailto:jeffhung.iim90g@nctu.edu.tw

2 1

Four Questions on boost::shared_ptr
by Jon Wang 04 Feb '02

04 Feb '02

Hi, I've got several questions about the former version of boost::shared_ptr. Would someone please help me? 1. Mr Stroustrup said that there wasn't a need for auto_array, for "a better solution is to use a vector". So, should we use vector or scoped_array/shared_array? 2. In the document, four implementations are said to have been discussed: Direct detached, Indirect detached, Embedded detached and Placement detached. I've tried to describle them (Are I right? See the attached file), but I don't understand the Placement detached. Could someone please tell me what it's like? 3. In the file smart_ptr.hpp, we can see the private function shared_ptr::share. void share(T* rpx, long* rpn) { if (pn != rpn) { ++*rpn; // done before dispose() in case rpn transitively // dependent on *this (bug reported by Ken Johnson) dispose(); px = rpx; pn = rpn; } } // share I'm sorry that I don't understand that reason why ++*rpn should be done before dispose(). Would someone please give me an example? Or is it like this? #include <boost/smart_ptr.hpp> struct A { boost::shared_ptr<A> v; }; int main() { A* pa = new A; boost::shared_ptr<A> ptr(pa); ptr = pa->v; } 4. Why not use policies? I'm afraid that the word "parameterization will discourage users" might not be always true, for we can use default parameters. Jon Wang 2002-01-31

1 0

Fw: Warning to all list owners and moderators
by Ihsan Ali Al Darhi 04 Feb '02

04 Feb '02

I don't know if this is true, but I received it on another group.... > > > > > > I don't know how valid this is but those of you > who belong to yahoo groups > might > want to pass it along to your list owners. > > > > I just got this from another group owner. I have > > heard of this happening, > > > and in one case banned a guy that made a similar > > attempt with one of my > > > groups. > > > Someone has been joining communities with the > nickname YAHOO COMMUNITY > MONITOR, and then posting the following: Yahoo > Community Monitor says: > Yahoo Group Managers have been receiving a few > complaints about your > group.I am required to join your site and monitor > it for about one month.I > will not do anything to damage or ruin your site,I > am only required to > monitor it.The only thing required of you is to > accept my application and > make me a Manager of your group for the time I am > there. If you cannot > meet > these requirements,Yahoo will have to shut your > group down. > DO NOT!! make this person a manager! SHE/HE is a fake, and has been deleting groups once made a manager. BAN the member immediately. Please let other groups know about this problem. I just wanted to let ya'll know. Wouldn't want anything to happen to your groups. Mohammed

1 0

Re: [Boost-Users] Suggestion -- Boost Building
by John Maddock 02 Feb '02

02 Feb '02

>> I used to be able to build this, but since the boost.build stuff came along, > I've been completely unable to build anything at all. The documentation is > worse than useless because it's so self-contradictory.... Don't forget that the regex makefiles are still there if you want them, there is nothing that says that you have to use Jam if you don't want to... - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

1 0

boost python and smart pointers
by Martin Strubel 01 Feb '02

01 Feb '02

Hello, I've lately experimented with Boost.Python and found it pretty useful. Though I've run into one thing which I couldn't figure out by the documentation, I hope someone can give me a hint there: I have a function returning a pointer to an 'owned' structure, i.e. its container takes care of creation and deletion. In Python, I want to wrap this pointer into a direct reference to the struct, i.e. no copying. To guard the access and make sure the object can't be accessed after the deletion, I want to wrap the smart pointer AS a python object. for example, a C++ function returning an 'owned' face from a mesh: FaceSmartPtr Mesh::addFace() { .. } should be wrapped for access in Python like: f = mesh.addFace() with subsequent calls for face manipulation like: f.addVertex((0.0, 0.0, 0.0)) where this should again call something like if (f_sptr.isValid()) f_sptr->addVertex(...); else throw_pyException_ptrInvalid(); Does Boost support this automatically ? Or do I have to wrap all these functions myself ? Greetings, - Strubi -- Martin Strubel, Software Hooligan strubi(a)blender.nl www.blender.nl Not a Number - 3D Enabling Technology tel. +31 40 2501231 Eindhoven, The Netherlands

1 0

RE: [Boost-Users] Suggestion -- Boost Building
by Wismar, John 01 Feb '02

01 Feb '02

In my case (the most recent how-can-I-build-this question) I'm trying (unsuccessfully) to use the regex library, which requires compiling.... I used to be able to build this, but since the boost.build stuff came along, I've been completely unable to build anything at all. The documentation is worse than useless because it's so self-contradictory.... -------------------------- John Wismar mailto:jwismar@alldata.com > -----Original Message----- > From: Duane Murphy [mailto:duanemurphy@mac.com] > Sent: Saturday, January 26, 2002 12:15 AM > To: Boost Users > Subject: [Boost-Users] Suggestion -- Boost Building > > > It seems a lot of questions come up on the list about > "building" the boost libraries. > > I wonder how many of these people realize that most of the > functionality of the Boost "libraries" is completely > encapsulated in the header files? There are significant > portions like regex and the graph library (?) that do require > compiling, but much of it does not. > > Is there anything that can be done to make it more clear that > compiling is often not necessary? > > I'm just trying to relieve some stress from people who may > very well not require compiling. And I have compassion for > those that do and are having trouble. > > I'm not sure exactly what can be done, but it might be worth > some thought. > > ...Duane > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> Sponsored by VeriSign - The Value > of Trust Pinpoint the right security solution for your > company - FREE Guide from industry leader VeriSign gives you > all the facts. > http://us.click.yahoo.com/lWSNbC/WdiDAA/yigFAA> /EbFolB/TM > > > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > >

2 1

Cannot find regular expression symbols in Solaris debug
by phlasnicek 31 Jan '02

31 Jan '02

Hi, I am using Solaris Workshop 5.0 and I am using boost libraries for regular expressions. Everything builds fine and runs ok except when I try to attach to the process and run the debugger. I get the following error: warning: cannot demangle '__1c9uX__unnamed_6ofsRKVdR8zYNQre_get_error_str6FI_pkc_' Anyone have any suggestions, I would appreciate it very much. Thanks Paul

1 0

RE: [Boost-Users] Digest Number 81
by Anthony Kolarik 31 Jan '02

31 Jan '02

> Date: Tue, 29 Jan 2002 20:22:32 -0500 (EST) > From: Jeremy Siek <jsiek(a)cs.indiana.edu> > Subject: RE: RE: Dependencies for tokenizer? > > On Tue, 29 Jan 2002, Jeff Garland wrote: > jeff> > jeff> I'm sure there is. It is a matter of getting the "25 lines of > jeff> actual code" (my guess) in those 47 headers that tokenizer > jeff> really needs into a small header. I'm sure with a small > jeff> effort you could do it. Perhaps you could even find a way to > jeff> improve the overall design in the process. > > Well, it could get a little messy. The iterator adaptors use > some stuff > from the type_traits headers, which have lots of workarounds > for different > compilers, etc., etc. > > For a super simple C++ stringtok see the header > > boost/pending/stringtok.hpp > > It's not an official boost library, but you might find it fits > your needs. > > Cheers, > Jeremy Thank you for pointing out the pitfalls of reworking tokenizer and for pointing out boost/pending/stringtok.hpp, it serves fine for my purposes. -- Tony K.

1 0

1_26_0: regex/thread on W32 build via jam?
by John Maddock 31 Jan '02

31 Jan '02

>that's what I'm doing now. >I just want to fully understand the new jam way of building/using boost, >and eg to see what is neccessary to use the 'new way'. >Will the 'old way' be deprecated someday? Probably not any time soon. >Does/will the new way support static libs? It does for regex, can't comment on anything else though. - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

1 0

RE: [Boost-Users] Re: boost::pool + shared memory
by Tom Matelich 30 Jan '02

30 Jan '02

I've been using the ACE_Malloc framework from ACE (http://cs.wustl.edu/~schmidt/ACE.html) to solve a similar problem (sharing statics between DLL's). It takes a little while to figure out because the documentation is a little slim, but once you do it pays off pretty quickly. Doxygen documentation for ACE_Malloc is at: http://doc.ece.uci.edu/Doxygen/Current/html/ace/classACE__Malloc__T.html and the shared_mem memory pool is at: http://doc.ece.uci.edu/Doxygen/Current/html/ace/classACE__Shared__Memory__Po ol.html I ended up not having to write an STL allocator using ACE_Malloc, but I don't think it would be too difficult. If you get it right, a lot of ACE users would be your friend :) Tom Matelich > -----Original Message----- > From: xpav_2000 [mailto:alex@pavloff.net] > Sent: Tuesday, January 29, 2002 6:01 PM > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] Re: boost::pool + shared memory > > > --- In Boost-Users@y..., Tom Matelich <tmatelich@z...> wrote: > > Looks like pool may not be what I need, darn. I like > > to weasel as many boost classes into my project as possible. > > I've got a similar question -- I've got a whole pile of strings that > I want to share between processes, and I was thinking a reference- > counted string implementation with the actual data in shared memory > would be a good way to do that. > > Do you think a memory pool placed in shared memory, with the string > class modified to allocate/deallocate there would work? > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Tiny Wireless Camera under $80! > Order Now! FREE VCR Commander! > Click Here - Only 1 Day Left! > http://us.click.yahoo.com/nuyOHD/7.PDAA/yigFAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

1_26_0: regex/thread on W32 build via jam?
by Bruno.Voigt＠ic3s.de 30 Jan '02

30 Jan '02

> Date: Tue, 29 Jan 2002 07:55:46 -0500 > From: John Maddock <john_maddock(a)compuserve.com> > Subject: 1_26_0: regex/thread on W32 build via jam? > > >But how do I have to change my project settings for a static executable? > >I just changed the the lib search path to this new monster path and it > >does not work > >The linker is missing the vc7-re300dm.lib then. > > why not carry on using the libs you built from the makefiles? Hi John, that's what I'm doing now. I just want to fully understand the new jam way of building/using boost, and eg to see what is neccessary to use the 'new way'. Will the 'old way' be deprecated someday? Does/will the new way support static libs? > >And how to link the boost thread stuff? > >Is it supported for statically linked apps at all? > Build threadmon.cpp into a dll, and the rest of the source into a static > lib with the options you want. Okay, thanks, I will try this combination. bye, Bruno

1 0

RE: [Boost-Users] boost::pool + shared memory
by Tom Matelich 30 Jan '02

30 Jan '02

Looks like pool may not be what I need, darn. I like to weasel as many boost classes into my project as possible. > -----Original Message----- > From: Tom Matelich [mailto:tmatelich@zetec.com] > Sent: Monday, January 07, 2002 2:49 PM > To: 'boost-users(a)yahoogroups.com' > Cc: 'shammah(a)voyager.net' > Subject: [Boost-Users] boost::pool + shared memory > > > I need to build a system for having miscellaneous objects in > a shared memory > segment. Essentially, we need a few inter-process singletons. These > classes have STL containers, so I was looking at using > pool_allocator and > writing a UserAllocator to use ACE_Mem_Map ( > http://doc.ece.uci.edu/Doxygen/Current/html/ace/classACE__Mem_ > _Map.html#_det > ails ) or something. I just wanted to see if anyone had done anything > resembling this and could give me any pointers or tips. > > Thanks, > > Tom Matelich > > PS Why can't I see who is a member of this group? I wanted > to check to see > if Steve Cleary was a member. Sorry if you are Steve. > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Tiny Wireless Camera under $80! > Order Now! FREE VCR Commander! > Click Here - Only 1 Day Left! > http://us.click.yahoo.com/WoOlbB/7.PDAA/ySSFAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > >

2 1

RE: Dependencies for tokenizer?
by Anthony Kolarik 30 Jan '02

30 Jan '02

> > > Any ideas about how to get this functionality w/o all the headers? Thanks, > > > -- Tony K. > > > In order to use the tokenizer classes I end up requiring 47 files, which > > What's wrong with 47 files? How much longer does it take to compile? It actually does slow things down noticeably, since it's a small project. > He might be sub setting boost and only wants to include the needed files. Exactly. I have 47 more files checked into source control that everybody else has to download (and have the tool check every time they refresh) so that I can parse a command line. I suppose I could check in the whole boost library, (~2000 files in the download I got,) but I'd rather just take what I need for now. > Anyway, this was brought up during the review, but at the time only 20 files > were needed (the very first tokenizer only need 2 boost headers). It was the > switch to iterator_adaptors that caused the include explosion at the time... Evidently reviewers thought 20 was reasonable, and I assume that some major problems are solved by the 47 headers that weren't by 20. I just wondered if there was a lighter weight way in boost to do my little tokenizing task. Is there? -- Tony K.

4 3

1_26_0: regex/thread on W32 build via jam?
by John Maddock 29 Jan '02

29 Jan '02

>But how do I have to change my project settings for a static executable? >I just changed the the lib search path to this new monster path and it >does not work >The linker is missing the vc7-re300dm.lib then. why not carry on using the libs you built from the makefiles? >And how to link the boost thread stuff? >Is it supported for statically linked apps at all? Build threadmon.cpp into a dll, and the rest of the source into a static lib with the options you want. - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

1 0

object_pool, O(N) destroy?
by kevin_godden＠agilent.com 29 Jan '02

29 Jan '02

Hi, I am considering using boost::object_pool for fast allocation and deallocation of likkle container/token objects. I need to make this as fast as possible, to this end I wonder why object_pool seems to use boost::pool::ordered_free() (O(N)) rather than the faster free() (O(1))? There must be a reason, but I can't seem to find it in the Lib's documentation. I would be interested in hearing if peoples experiences/comments on using object_pool. Thanks for reading! Kevin\

2 1

RE: [Boost-Users] RE: object_pool, O(N) destroy?
by kevin_godden＠agilent.com 29 Jan '02

29 Jan '02

I agree, it does sound like a job for a Policy whatsit. If I get a chance I could try a few things and see if anything works out and let you know. Although, if time constraints work out the way I think they will, I might have to stick with a cut&paste solution! Kevin\ -----Original Message----- From: scleary(a)jerviswebb.com [mailto:scleary@jerviswebb.com] Sent: Tuesday, January 29, 2002 5:13 AM To: Boost-Users(a)yahoogroups.com Cc: shammah(a)voyager.net Subject: [Boost-Users] RE: object_pool, O(N) destroy? > -----Original Message----- > From: hicks [mailto:hicks@kgk.co.jp] > > It sounds like a case where a type trait, identifying the need for the > pool to responsible for deletion, > would be appropriate. Then objects which did not need to be destroyed > (e.g. ptrs, "plain" structs) > could be handled by optimized code. But that's more work than cut and > paste. Actually, the difference is in how the pool is used, not on the type of object being allocated. So it sounds more like a case for a policy-based design. Too bad, I just don't have time to do that right now... :( -Steve Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

RE: object_pool, O(N) destroy?
by scleary＠jerviswebb.com 29 Jan '02

29 Jan '02

> -----Original Message----- > From: hicks [mailto:hicks@kgk.co.jp] > > It sounds like a case where a type trait, identifying the need for the > pool to responsible for deletion, > would be appropriate. Then objects which did not need to be destroyed > (e.g. ptrs, "plain" structs) > could be handled by optimized code. But that's more work than cut and > paste. Actually, the difference is in how the pool is used, not on the type of object being allocated. So it sounds more like a case for a policy-based design. Too bad, I just don't have time to do that right now... :( -Steve

1 0

Dependencies for tokenizer?
by Anthony Kolarik 29 Jan '02

29 Jan '02

In order to use the tokenizer classes I end up requiring 47 files, which seems a little steep for my purposes. All I really need is to tokenize strings based on a couple of single char delimiters. Kind of a C++ step above strtok() was what I had in mind. Any ideas about how to get this functionality w/o all the headers? Thanks, -- Tony K.

3 2

RE: [Boost-Users] object_pool, O(N) destroy?
by kevin_godden＠agilent.com 29 Jan '02

29 Jan '02

Thanks for the Info Steve, In this case, I am less interested in the pool's destructor as I _should_ have a 1 to 1 on malloc()ing and destroying the individual objects (if all goes well...). The pool will only be destroyed once during the lifetime of the application so I could probably suffer a O(N^2) pool destructor. I will try what you recommend in your postscript. Thanks again.. Kevin\ -----Original Message----- From: scleary(a)jerviswebb.com [mailto:scleary@jerviswebb.com] Sent: Monday, January 28, 2002 2:10 PM To: Boost-Users(a)yahoogroups.com Cc: shammah(a)voyager.net Subject: RE: [Boost-Users] object_pool, O(N) destroy? > From: kevin_godden(a)agilent.com [mailto:kevin_godden@agilent.com] > > I am considering using boost::object_pool for fast allocation and > deallocation of likkle container/token objects. I need to make this as fast > as possible, to this end I wonder why object_pool seems to use > boost::pool::ordered_free() (O(N)) rather than the faster > free() (O(1))? > > There must be a reason, but I can't seem to find it in the Lib's > documentation. The object_pool keeps its free list ordered because of the requirements of its destructor. Its destructor steps through the free list, calling the destructor for any objects that weren't freed. The current algorithm is O(N) because the free list is ordered; if it wasn't ordered, it would be O(N^2). I'll document this in the code. -Steve P.S. An object_pool without the destructor behaviour may be what you want. Boost.Pool doesn't provide one, but you could just cut & paste the object_pool, remove the destructor, and change ordered_malloc/ordered_free to the regular malloc/free (you also won't need nextof). Just note that if you ever construct something from that pool and don't destruct it, you enter the fun realm of undefined behaviour... :) Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

2 1

1_26_0: regex/thread on W32 build via jam?
by Bruno.Voigt＠ic3s.de 28 Jan '02

28 Jan '02

Hi! For my statically linked application (w32/sol8/linux) I was up to now using only the boost regex library. I build the regex lib the oldstyle way going to the build path and calling nmake -f vc7.mak, etc. In the project settings I included the regex/build/vc7 path as an additional lib search path. The buld step works as expected this way. boost::thread does provide only the newstyle jam build way. So I downloaded the boost::winbuild stuff and tried to build the whole boost via jam -sBOOST_ROOT=. -sTOOLS=msvc. It shows some errors for some pytho stuff but builds the regex and thread lib part. So I get for example a path boost_1_26_0\libs\regex\build\bin\libboost_regex.lib\msvc\release\runtime-link-dynamic with a libboost_regex.lib But how do I have to change my project settings for a static executable? I just changed the the lib search path to this new monster path and it does not work The linker is missing the vc7-re300dm.lib then. And how to link the boost thread stuff? Is it supported for statically linked apps at all? Any suggestions on how to make use of the jam build stuff in the right way ae really appreciated. TIA, Bruno PS: will there be a working suncc-tools.jam file in the next release? -- Bruno.Voigt(a)ic3s.de # IC3S AG # Tel. +49.4106.655.105 # Fax. +49.4106.655.55 http://www.ic3s.de # Mobile +49.700.686.00.686 [Non-text portions of this message have been removed]

2 1

RE: [Boost-Users] object_pool, O(N) destroy?
by scleary＠jerviswebb.com 28 Jan '02

28 Jan '02

> From: kevin_godden(a)agilent.com [mailto:kevin_godden@agilent.com] > > I am considering using boost::object_pool for fast allocation and > deallocation of likkle container/token objects. I need to make this as fast > as possible, to this end I wonder why object_pool seems to use > boost::pool::ordered_free() (O(N)) rather than the faster > free() (O(1))? > > There must be a reason, but I can't seem to find it in the Lib's > documentation. The object_pool keeps its free list ordered because of the requirements of its destructor. Its destructor steps through the free list, calling the destructor for any objects that weren't freed. The current algorithm is O(N) because the free list is ordered; if it wasn't ordered, it would be O(N^2). I'll document this in the code. -Steve P.S. An object_pool without the destructor behaviour may be what you want. Boost.Pool doesn't provide one, but you could just cut & paste the object_pool, remove the destructor, and change ordered_malloc/ordered_free to the regular malloc/free (you also won't need nextof). Just note that if you ever construct something from that pool and don't destruct it, you enter the fun realm of undefined behaviour... :)

1 0

MacCVS Pro hints
by voidampersand 27 Jan '02

27 Jan '02

I'm trying to get with the program here, so I just got the boost sources from CVS, using MacCVS Pro. The main thing that tripped me up was the instructions on the SourceForge page have command lines that are word wrapped. Anyway, here are some MacCVS session settings that work for me: Remote Host Information Server Hostname: cvs.boost.sourceforge.net CVS Root: /cvsroot/boost CVS User Name: anonymous CVS Password: [+] Save Password Also, in "File Translation and Encoding" you will want to add these mappings before you check out: .hpp TEXT CWIE .cxx TEXT CWIE .jam TEXT CWIE .pdf TEXT CARO MacCVS Pro is available at <http://sourceforge.net/projects/maccvspro/>. Regards, Tom

2 1

Re: [Boost-Users] memcmp, strlen, strcmp not found in string.h?
by Steven Woolgar 27 Jan '02

27 Jan '02

> My question: Why aren't they in STLPort's string.h? > Is it a voluntary omission, and if so, why? > Should I talk to the guys who created Boost instead? > Should I be asking this on the developer's mailing list?? =) If I am not mistaken, the standard C functions would be in the the standard C include files, not the C++ files. So: strlen would be in <cstring> the string class would be in <string> Note that the new include style does not have the .h at the end. HTH Woolie

1 0

Suggestion -- Boost Building
by Duane Murphy 26 Jan '02

26 Jan '02

It seems a lot of questions come up on the list about "building" the boost libraries. I wonder how many of these people realize that most of the functionality of the Boost "libraries" is completely encapsulated in the header files? There are significant portions like regex and the graph library (?) that do require compiling, but much of it does not. Is there anything that can be done to make it more clear that compiling is often not necessary? I'm just trying to relieve some stress from people who may very well not require compiling. And I have compassion for those that do and are having trouble. I'm not sure exactly what can be done, but it might be worth some thought. ...Duane

1 0

Compiling with VC7
by Wismar, John 25 Jan '02

25 Jan '02

I wonder if someone can help me get up and running with Boost using VC7. I've tried to follow the Boost Build documentation, and am running into problems. A description of different things I've tried is below. Thanks in advance for any help anyone can provide! So far I've downloaded the Windows version of Boost.Build, and have run boost-build.exe (I couldn't tell if it did anything.) I added the boost-build directory to my PATH by hand, along with the VC7/bin directory. I also remember some discussion about how jam couldn't handle VC's default install dir (which is, for the purposes of this discussion, where mine is) because it has spaces in it, so I've used SUBST to define Z: as my VS.NET path. When I run jam from the boost_1_26_0 dir, using: jam -sBOOST_ROOT=. -sTOOLS="msvc" I get errors that look like: msvc-C++-action libs\regex\build\bin\libboost_regex.lib\msvc\debug\runtime-link- dynamic\c_regex_traits.obj c_regex_traits.cpp c1xx : fatal error C1108: unable to find DLL: 'mspdb70.dll' Z:\vc7\bin\cl /Zm400 -nologo -GX -c -I"libs\regex\build" -Fo"libs\reg ex\build\bin\libboost_regex.lib\MSVC\debug\c_regex_traits.obj" -Tp"libs\regex\b uild\../src\c_regex_traits.cpp" ...failed msvc-C++-action libs\regex\build\bin\libboost_regex.lib\MSVC\debug\c_regex_traits.obj ... msvc-C++-action libs\regex\build\bin\libboost_regex.lib\MSVC\debug\c_regex_traits_common.obj c_regex_traits_common.cpp c1xx : fatal error C1108: unable to find DLL: 'mspdb70.dll' So I added VC7's common7/IDE/ directory to my path, because that's where mspdb70.dll lives, but it didn't resolve the issue. Delving deeper into the docs, I found the suggestion that I do: set TOOLS=msvc jam instead of what the top level docs say, but then I get a message that I didn't set the toolset, and I should use: set VISUALC=<path> set JAM_TOOLSET=VISUALC jam When I do that, I get: Compiler is Microsoft Visual C++ warning: unknown rule project-root warning: unknown rule subinclude warning: unknown rule subinclude warning: unknown rule subinclude warning: unknown rule subinclude ...found 7 targets... Etc. -------------------------- John Wismar mailto:jwismar@alldata.com

1 0

mem_fn and references?
by Duane Murphy 25 Jan '02

25 Jan '02

I am trying to make a member function call to all objects returned by an iterator. mem_fn is giving me an error when trying to call get_pointer() for a reference object. There is no overload for get_pointer of a reference object. Is there some reason or should I be doing this differently. The long description is that I am iterating over a container of objects. I would like to make a member function call on each of these objects. Then I get an error that there is no matching function for get_pointer( obj ). I have solved this by providing my own get_pointer() overload specifically for obj to prevent any bad things from happening until I can found out what the real problem is. Here is some pseudo code to get things in the right orientation. class obj { public: void method(); }; class obj_iterator { public: obj& iterator::operator*() const { return obj_; } }; class obj_container { public: obj_iterator begin(); obj_iterator end(); } { ... obj_container c; foreach( c.begin(), c.end(), mem_fn( method ) ); } Thanks, ...Duane

3 5

Solaris/sparcWorks 5.0
by sebmarc 24 Jan '02

24 Jan '02

Does anybody know how to compile boost with Solaris 7 and sparcWorks 5.0. Looking at http://www.boost.org/tools/build/index.html, there is no place for this compiler. Any help appreciated. Thanks, Seb.

2 3

RE: [Boost-Users] Subject: Poll results for Boost-Users
by Tom Matelich 24 Jan '02

24 Jan '02

I asked the original question that sparked this, and its because (at the root) I want to know whether feature requests need to be mirrored on the main boost list. So if I can be sure that the author of the library is at least listening to my boost-users message, I don't have to CC him/her or spam both lists. That is why I wanted access to the members, and as a support mechanism, why I thought it was important for boost-users. I realize membership != reading the messages, so perhaps my point is moot. > -----Original Message----- > From: Jim.Hyslop [mailto:jim.hyslop@leitch.com] > Sent: Wednesday, January 23, 2002 7:20 AM > To: 'Boost-Users(a)yahoogroups.com' > Subject: RE: [Boost-Users] Subject: Poll results for Boost-Users > > > Chris Little [SMTP:clittle@renlearn.ca] wrote: > > When the question first came up of allowing members to view > the membership > > list, one of the moderators started a poll (around the beginning of > > January). > That'd be me. > > > Unfortunately polling in this group is limited to moderators. > > The moderators then decided to discuss the issue amongst > themselves and > they > > haven't reported back. > > Hoo, boy, I seem to have dropped the ball on several counts here. > > First, my apologies for not cancelling the poll after > discovering polling > was limited to moderators. > > Second, my apologies for not reporting back to the group on > the results of > our discussion (I'm taking responsibility for this, since I'm > the one who > opened the can of worms in the first place). > > We identified a potential problem with spam email harvesting. > Granted, in > the public pages emails are hidden, so that only the first > letter of the > domain appears (my address, for example, would appear as > "jim.hyslop@l..." > One of the moderators pointed out: > > > About half of the email addresses on > > the first page start with either an a, h, or y. > > ... the problem is that when harvesting email addresses you > > don't need 100% accuracy. Just assume that a's are aol, all b's are > > bigfoot, all e's are earthlink, all h's are hotmail.com, > and all y's > > are yahoo.com. These letters are going to be [greater than] > half the list > and you > > will be correct [greater than] half the time. > > We could not come up with any compelling arguments in favour > of opening the > list. I believe the best summary was: > > > I'm not sure what the benefits of public membership would be. > > Arguments such as "I need to know if X is a member of > > the group" seem empty - this is a *mailing list* after all. > > To access individuals, you should get hold of them in > > other ways. If they are active members of the list, you'll > > still know they're members. > > No moderators actually spoke out in favour of opening the > list up, so the > status quo remains. > > We moderators are, of course, open to suggestions, and if a reasonably > strong argument comes up, then we will re-examine the issue. > If anyone feels > strongly about it, you can either post your rationale here or > email the > moderators at boost-users-owner(a)yahoogroups.com (the > 'boost-users-owner' > name is a bit misleading - email goes to all moderators, not > just to the > owner). > > Similarly, on the topic of polls themselves, the general > consensus was that > if or when we identify a good reason to run a poll, then we > will open up the > feature. Until then, there's no reason to change the status quo. > > -- > Jim > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Tiny Wireless Camera under $80! > Order Now! FREE VCR Commander! > Click Here - Only 1 Day Left! > http://us.click.yahoo.com/nuyOHD/7.PDAA/yigFAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

3 2

Re: [BGL] BFS and copy problem (was Re: [boost] Compilation)
by Jeremy Siek 24 Jan '02

24 Jan '02

Again, Luca, we can't help you unless you post the code (the complete C++ file). I can't just guess what is going wrong. You're probably forgetting to do something, and there's no way I can tell what that is based on what you've written below. On Thu, 24 Jan 2002, lucatoldo wrote: luca.t> I think there is something I do not know, rather important, about the luca.t> process of adding edges to the graph object. Infact, even in the luca.t> simple example/bfs.cpp if I swap the start with the ends, I get luca.t> different results. Namely: luca.t> luca.t> If I change the code from this luca.t> luca.t> boost::add_edge(0,2,G); luca.t> boost::add_edge(1,1,G); luca.t> boost::add_edge(3,1,G); luca.t> ... luca.t> boost::add_edge(4,1,G); luca.t> luca.t> to luca.t> luca.t> boost::add_edge(2,0,G); luca.t> boost::add_edge(1,1,G); luca.t> boost::add_edge(1,3,G); luca.t> ... luca.t> boost::add_edge(1,4,G); luca.t> luca.t> then I get luca.t> luca.t> the graph OK but the distances and the parent vectors are screwed: luca.t> luca.t> I get luca.t> luca.t> distances: 0 2 2 2 1 luca.t> instead of luca.t> distances: 0 2 1 2 2 luca.t> luca.t> and luca.t> luca.t> parent[0] = 0 luca.t> parent[1] = 4 luca.t> parent[2] = 4 luca.t> parent[3] = 4 luca.t> parent[4] = 0 luca.t> luca.t> instead of luca.t> luca.t> parent[0] = 0 luca.t> parent[1] = 2 luca.t> parent[2] = 0 luca.t> parent[3] = 2 luca.t> parent[4] = 2 luca.t> luca.t> I feel I am missing some basic knowledge on how to appropriately use luca.t> this powerful and amazingly fast system. I would love to learn the luca.t> missing bit. luca.t> luca.t> Looking forward your advice and sorry again for the dumminess of this luca.t> question. luca.t> luca.t> luca.t> Info: http://www.boost.org Send unsubscribe requests to: <mailto:boost-unsubscribe@yahoogroups.com> luca.t> luca.t> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ luca.t> luca.t> ---------------------------------------------------------------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek(a)osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ----------------------------------------------------------------------

2 4

RE: [Boost-Users] Subject: Poll results for Boost-Users
by Jim.Hyslop 24 Jan '02

24 Jan '02

Tom Matelich [SMTP:tmatelich@zetec.com] wrote: > I asked the original question that sparked this, and its because (at the > root) I want to know whether feature requests need to be mirrored on the > main boost list. So if I can be sure that the author of the library is at > least listening to my boost-users message, I don't have to CC him/her or > spam both lists. The moderators have agreed that one of our duties will be to ensure appropriate cross-pollination of messages. In other words, if a discussion here in Boost-Users raises an issue that is appropriate to the main Boost list (such as a feature request or a bug report), we will ensure it gets forwarded to that forum. Similarly, if someone posts a message to Boost that is more appropriate to this list, we will encourage the original poster to switch to this forum. -- Jim

1 0

Adding edges to a graph. Problems.
by lucatoldo 24 Jan '02

24 Jan '02

I think there is something I do not know, rather important, about the process of adding edges to the graph object. Infact, even in the simple libs/graph/example/bfs.cpp if I swap the start with the ends, I get different results. Namely: If I change the code from this boost::add_edge(0,2,G); boost::add_edge(1,1,G); boost::add_edge(3,1,G); ... boost::add_edge(4,1,G); to boost::add_edge(2,0,G); boost::add_edge(1,1,G); boost::add_edge(1,3,G); ... boost::add_edge(1,4,G); then I get the graph OK but the distances and the parent vectors are screwed: I get distances: 0 2 2 2 1 instead of distances: 0 2 1 2 2 and parent[0] = 0 parent[1] = 4 parent[2] = 4 parent[3] = 4 parent[4] = 0 instead of parent[0] = 0 parent[1] = 2 parent[2] = 0 parent[3] = 2 parent[4] = 2 I feel I am missing some basic knowledge on how to appropriately use this powerful and amazingly fast system. I would love to learn the missing bit. Looking forward your advice and sorry again for the dumminess of this question.

1 0

A tip from the Dr.
by jackthompson99 23 Jan '02

23 Jan '02

Hey guys, I sent an e-mail to Dr. Stroustrup a couple nights ago, and he replied, "Have a look at boost.org. They exist specifically to provide better libraries in the context of the C++ standard library and to act as a test bed for new library ideas". So, here I am. I've installed and built my boost libraries, and I'm trying to figure out how to dig in. Anyway, here's what I was telling the Dr. I've been using C for about a decade, and C++ for about 7 yrs. I'm a huge fan of your invention, and I honestly feel like your name should eventually be as well known as Tesla and Edison. And the Standard Template Library is an incredibly well engineered system. I have a way to use it that is generic enough that it may be a candidate to be another standard. I know that's a lot to say. I'd like to explain it briefly, but first I should explain why I find it useful. Since I started working with assembler, I've always felt like the language I was using was missing something. I've used an assortment of languages, and it seems like they are all missing the same thing. The main part isn't really missing from C++, it's just not commonly understood. The concept of virtual construction is the core of the issue. Now I know that this problem is solved, but it really could stand for just one more thing to wrap it up into something usable for any ordinary C++ developer. Using a virtual constructor by way of a template, a developer can easily create any kind of object based on any type of identifier, but what good is that when the developer has exhausted all of his efforts on just building a simple system to dynamically create objects. The developer needs a way to organize these objects, without building another data warehouse. And I have never heard of a complicated database that shouldn't be fully hierarchical. So, the system should be one hundred percent re-entrant. Well, I have such a beast. I'm not done with it yet. I'm just now finishing up a project for Textron, where some of this concept was cultivated into my skill set. I am having a rough time explaining the system to my boss, and I'm in a real bind, but that's another story. The main thing that I've learned from this job is that the world needs to come together on one simple international standard for dealing with data and persistent C++ objects. I've used my ClassFactory / DataStore system as a foundation for another library that I call the WinFactory. This system simply uses the ClassFactory / DataStore as a database manager. The objects held in the database are simply graphical user interface components. This worked out really well, `till by boss took it apart. But I have a version of it that I'm re-writing at home that is much better. The database can be held either in a simple text format, resembling hypertext, or a binary file. The system relies heavily on the memory manager, so fast memory allocation is required. I have also populated an MFC user interface with data held in these objects. The system seems to be able to flex with just about anything, and I feel like it could at least contribute to discussions about new standards that are based on your standards. By the way, I need to find a team that I can work with who has good work ethics and integrity. Suggestions would be much appreciated. ..... So, I've looked at the library list in Boost, and haven't recognized anything like what I've built. I would love to explain this system. But, again, this one belongs to Textron, and all of the documentation too. I need to find some time to build this system for Boost.org. The main concept behind the system is a warehouse environment. The warehouse hase isles of goods. Each isle is any length, and each isle contains exactly one type of product. And every product contains a single pointer which is initally NULL. This makes it so that when you pull the product off the shelf and open it, you will see whatever the product is ( characters, integers, strings, etc. ), and you will find one more thing. It's called the nest. Now, until you try to use the nest, it's empty (NULL). But when you need it, it is created. What is this nest you ask? It's another warehouse. Just like the one that it is contained within. So, the entier concept is one hundred percent re-entrant. This makes it easy to build hierarchical infrastructures. The objects can be virtually any C++ thing. They persist with the greatest of ease to simple IO objects. User interfaces are easy to build with this system. Content editors view it as a script. C++ programmers view the script as C++ objects. Again, I need to finish re-writing the system, and I need to document it. But I feel like it is a candidate to become another Boost library. What do you think?????

2 1

RE: [Boost-Users] Subject: Poll results for Boost-Users
by Jim.Hyslop 23 Jan '02

23 Jan '02

Chris Little [SMTP:clittle@renlearn.ca] wrote: > When the question first came up of allowing members to view the membership > list, one of the moderators started a poll (around the beginning of > January). That'd be me. > Unfortunately polling in this group is limited to moderators. > The moderators then decided to discuss the issue amongst themselves and they > haven't reported back. Hoo, boy, I seem to have dropped the ball on several counts here. First, my apologies for not cancelling the poll after discovering polling was limited to moderators. Second, my apologies for not reporting back to the group on the results of our discussion (I'm taking responsibility for this, since I'm the one who opened the can of worms in the first place). We identified a potential problem with spam email harvesting. Granted, in the public pages emails are hidden, so that only the first letter of the domain appears (my address, for example, would appear as "jim.hyslop@l..." One of the moderators pointed out: > About half of the email addresses on > the first page start with either an a, h, or y. > ... the problem is that when harvesting email addresses you > don't need 100% accuracy. Just assume that a's are aol, all b's are > bigfoot, all e's are earthlink, all h's are hotmail.com, and all y's > are yahoo.com. These letters are going to be [greater than] half the list and you > will be correct [greater than] half the time. We could not come up with any compelling arguments in favour of opening the list. I believe the best summary was: > I'm not sure what the benefits of public membership would be. > Arguments such as "I need to know if X is a member of > the group" seem empty - this is a *mailing list* after all. > To access individuals, you should get hold of them in > other ways. If they are active members of the list, you'll > still know they're members. No moderators actually spoke out in favour of opening the list up, so the status quo remains. We moderators are, of course, open to suggestions, and if a reasonably strong argument comes up, then we will re-examine the issue. If anyone feels strongly about it, you can either post your rationale here or email the moderators at boost-users-owner(a)yahoogroups.com (the 'boost-users-owner' name is a bit misleading - email goes to all moderators, not just to the owner). Similarly, on the topic of polls themselves, the general consensus was that if or when we identify a good reason to run a poll, then we will open up the feature. Until then, there's no reason to change the status quo. -- Jim

1 0

RE: [Boost-Users] Subject: Poll results for Boost-Users
by Chris Little 23 Jan '02

23 Jan '02

When the question first came up of allowing members to view the membership list, one of the moderators started a poll (around the beginning of January). Unfortunately polling in this group is limited to moderators. The moderators then decided to discuss the issue amongst themselves and they haven't reported back. Chris > -----Original Message----- > From: James Curran/MVP [mailto:jamescurran@mvps.org] > Sent: Wednesday, January 23, 2002 8:29 AM > To: Boost-Users(a)yahoogroups.com > Subject: RE: [Boost-Users] Subject: Poll results for Boost-Users > > > How long was that poll open for? > > Truth, > James Curran > > > -----Original Message----- > From: Boost-Users(a)yahoogroups.com > [mailto:Boost-Users@yahoogroups.com] > Subject: Poll results > for Boost-Users > > > The following Boost-Users poll is now closed. Here are the > final results: > > > CHOICES AND RESULTS > - I want only the moderators to be able to view the > membership list, 0 votes, 0.00% > - I want anyone to be able to view the membership list, 0 > votes, 0.00% > [Non-text portions of this message have been removed]

1 0

RE: [Boost-Users] Subject: Poll results for Boost-Users
by James Curran/MVP 23 Jan '02

23 Jan '02

How long was that poll open for? Truth, James Curran -----Original Message----- From: Boost-Users(a)yahoogroups.com [mailto:Boost-Users@yahoogroups.com] Subject: Poll results for Boost-Users The following Boost-Users poll is now closed. Here are the final results: CHOICES AND RESULTS - I want only the moderators to be able to view the membership list, 0 votes, 0.00% - I want anyone to be able to view the membership list, 0 votes, 0.00%

1 0

Ann: Forward lookahead asserts now supported by regex lib
by John Maddock 23 Jan '02

23 Jan '02

The regex lib, now has experimental support for perl style forward lookahead assertions, using the syntax extensions: (?=exp) positive zero width forward assertion on exp. (?!exp) negative zero width forward assertion on exp. I'm currently looking for anyone willing to test these, and for real world test cases to add to the regression tests, before documenting the extensions and making them "official". Many thanks. - John Maddock http://ourworld.compuserve.com/homepages/john_maddock/

1 0

error with thread.hpp
by thrashmodule 19 Jan '02

19 Jan '02

I got this message: c:\boost_1_26_0\boost\thread\thread.hpp(17) : fatal error C1189: #error : Thread support is unavailable! I use VC++ on Win98 so now what??????????

2 1

Class destructor invocation - possible by hand?
by Jonathan Brownell 19 Jan '02

19 Jan '02

I have a question for all you C++ gurus. I'm writing a class that I would like to use the following technique in, and I'm not sure if it's portable or even legal, although VC++6 and VC++.NET, which I'm compiling in, work beautifully with it. Consider the following class, a very simplified example that I wrote to demonstrate: class House { public: explicit House(const int rooms) : m_rooms(rooms) { } ~House() { } private: const int m_rooms; }; Pretty straightforward. I'd like m_rooms to remain const to protect it from accidental modification by member functions, since it will *never* be changed during operation. Now, the first problem that arises is that this is illegal: House housingComplex[100]; Because, obviously, the constructor requires that the number of rooms be passed to it. (Yes, we could create it as an array of House pointers and create them dynamically, but in my case that will require inconveniences by everybody using my class.) So, we make it a default parameter and add an assignment operator: class House { public: explicit House(const int rooms = -1) : m_rooms(rooms) { } ~House() { } House& operator =(const House& source); private: const int m_rooms; }; When rooms == -1, the House is considered to be uninitialized. Now, we can do the following: House housingComplex[100]; housingComplex[0] = House(5); housingComplex[1] = House(4); (etc) The question is, how to implement the assignment operator? This is my method: House& House::operator =(const House& source) { assert(m_rooms == -1); this->~House(); new(this) House(source); return *this; } Yikes! I know this looks weird. First, assert verifies in debug mode that the object is in its uninitialized state. Then, the destructor is called manually to destruct the class and its contents. (In the actual class I'm working on, there are numerous member variables that must be appropriately destructed, and all of them are - I've checked.) Simply calling ~House(); will not compile, because the compiler assumes I'm trying to use the ~ operator illegally, so I have to call it through the 'this' pointer. Then, the placement new operator is used to create a new House in exactly the same space in memory as the old one, using the default copy constructor so that all the const variables are (re)initialized. Finally, a technicality for all assignment operators, a reference to the object is returned. (This is so C-style expressions like "var1 = var2 = var3 = 5;" can be used.) Now, this works beautifully on my VC++. But... is it legal C++?? Am I entering the realm of "undefined behavior", or is this a perfectly legitimate technique? Is there an obviously better solution to my problem? Are there caveats that I should be looking out for? Please, someone with more knowledge of the C++ standards, give me a hand here. Thanks! -Jonathan

6 6

RE: [Boost-Users] Class destructor invocation - possible by hand ?
by Tom Matelich 17 Jan '02

17 Jan '02

> > > > Also, I would recommend that you either reconsider > > > having the constant member variable, or use a > > > vector<>. > > > > Using a vector<T> won't work in this case, because the STL uses > > T::operator = in order to copy vector contents into new > locations during > > memory reallocation. And there's no logical way to > implement operator = > > when a const data member is present, which is the cause of this > > conversation. > > I could use std::list, since it doesn't do reallocation, but clients > > using this class in containers will most likely need random access > > iterators. > > > > Any other ideas? > > Easy option: Use a vector<shared_ptr<T> >. This will give you > basically > the behavior you want, with the ability to initialize the elements > directly. The drawback is that the data will be dynamically allocated. Another drawback is the interface is now pointers, not references. If you don't mind the dynamic allocation, the vector<shared_ptr<T> > can be contained by another class, overloading operator[], etc. The Boost Iterator Adapter library works very nicely for providing vector<T>::iterator behavior from a vector<shared_ptr<T> >::iterator. I can send you our vector-like class which uses adapted iterators if you would like. Re: the moderation. Yes, this is not a boost question, but it is a question boost can provide good solutions for, so where do you draw the line?

1 0

regex_match doesn't match in an embedded string
by soleani 17 Jan '02

17 Jan '02

Hi there, not sure how I could write that Subject line. Sorry :-) Here's the thing, I have a file with the following: KEY1 = ${short_localhost} KEY2 = bbbf<control2.cfg:OTHER_SECTION:${long_localhost}>aaaf:<he I need to extract the value between the {} when it starts with a $. My expression works ok for KEY1 (the value part, the string to the right of the equal sign), however it doesn't match for the value for KEY2. This is what I have: static const boost::regex expression( "\\$\\{(.*?)\\}" ); boost::cmatch what; if ( boost::regex_match( input, what, expression ) ) { cerr << "GOT IT!" << endl; } else { cerr << "NOPE" << endl; } where input is a std::string with the value described above. Why does it work for KEY1 and not KEY2? Interestingly enough, if I do the following: KEY1 = dd${short_localhost} it doesn't match either. This same expression in Perl works fine though. thanks, -Anibal

2 1

RE: [Boost-Users] boost tokenizer
by Jim.Hyslop 17 Jan '02

17 Jan '02

Peter Dimov [SMTP:pdimov@mmltd.net] wrote: > From: "hicks" <hicks(a)kgk.co.jp> > > Do you know why the compiler places precedence on that interpretation, > > rather than on one giving an instatiation of a local variable? > > The C++ standard says that a function declaration takes precedence. Don't > ask me why. :-) (At the risk of sliding seriously off topic...) I suspect it's something along these lines. Given this function: void f() { int WhatIsThis(); } Is "WhatIsThis" intended to be a declaration of a function, or is it intended to be a definition and default-initialization of an int variable? A C++ compiler cannot know, so the C++Standards committee had several choices: 1) require the compiler to flag the statement as an ambiguous statement 2) require the compiler to interpret the statement as a declaration of a function 3) require the compiler to interpret the statement as a definition of an int If we examine the same syntax in C, there is no question what it is: 'WhatIsThis' is a declaration of a function. That effectively eliminates #3 from consideration because you don't want one statement to have different meanings in C and in C++. I suspect the Committee then either flipped a coin (or some used other democratic means, such as debating and voting on the issue, thumb-wrestling, or playing paper-rock-scissors) to decide between #1 and #2, or choose to adapt the well-worn guideline "When in doubt, do as the ints do" to "When in doubt, do as C does". -- Jim

1 0

boost tokenizer
by hicks 17 Jan '02

17 Jan '02

Dear boost users I am trying to use the boost tokenizer with Borland Builder C++ 5 compiler. This far compiles fine: boost::tokenizer<> tok(std::string(ac0)); All further references to tok such as tok.assign(std::string(ac0)) or tok.begin() result in an error message " Structure requires on the left side of . or .*" Any advice would be welcome. Craig Hicks Engineer, KGK, Tokyo Japan

2 3

Boost Array Question
by Duane Murphy 16 Jan '02

16 Jan '02

Below is a simple example that I cannot get to compile. I would like to create a subclass of boost::array in order to give it some additional functionality (I would like a associative array like interface). When I compile this, I get an "illegal initialization" error for test. I am using Metrowerks Codewarrior 7 on Mac OS X. Is there some special incantation required? I suspect that I am in some kind of specialized area and I cant get there from here. template < class T, std::size_t N > struct test_array : public boost::array< T, N > { }; static boost::array< char,1 > array_test = {{ 'a' }}; static test_array< char, 1 > test = {{ 'a' }}; It appears that if I aggregate instead of inherit that this might work (at least it compiles :-) template < class T, std::size_t N > struct test_array { boost::array< T, N > array_; }; static boost::array< char,1 > array_test = {{ 'a' }}; static test_array< char, 1 > test = {{ 'a' }}; // The funny thing is this works also: static test_array< char, 1 > test2 = { 'a' }; TIA, ...Duane

2 6

tokenizer
by rradh 16 Jan '02

16 Jan '02

Hi, I have string line("a_1 = b_1 ( c_2 )") tokenizer< > tok(line); for (tokenizer<>::iterator beg=tok.begin(); beg!=tok.end();++beg) { cout << *beg << endl; } gives me a 1 b 1 c 2 I want to be able to specify delimiters like in strtok so that I get a_1, b_1 and c_2 but couldn't figure out how to specify the tokenizer function. Any suggestions? Regards Rajesh

3 3

graph: depth first search
by tobi_schuele 15 Jan '02

15 Jan '02

Hi, I'd like to use depth_first_search to check whether a particular vertex is reachable from the root vertex. Is there a way to stop the search when the vertex is found? In other words, can a visitor be used to cut the search tree? Sorry, if this is a newbie question. Thank you very much in advance for your help. Tobias

2 1

[newbie] segmentation fault on running dijkstra example on RedHat 7.2
by Mohammad M. Purbo 15 Jan '02

15 Jan '02

Dear All, I'm new to BOOST. I tried to compile the [BOOST_HOME/libs/graph/example/dijkstra-example.cpp] provided on the distribution with the following comand: gcc -I/home/purbo/include -lstdc++-3-libc6.2-2-2.10.0 -o dijkstra-example dijkstra-example.cpp no error on compiling/linking, but when i ran it, i got: Segmentation fault I used: RedHat 7.2 gcc 2.96 Anybody knows the problem? Thank you in advance, M. Purbo

1 0

A Static Map?
by Duane Murphy 14 Jan '02

14 Jan '02

I have learned a lot about templates and library programming from reading and using the Boost code. Recently I have been finding myself doing something that I would call Static Maps. Basically I would like to use an array of structs as if it were a map or associative array. Does boost have anything like this or can anyone recommend something like that? Here is a simple example: struct entry { const char* key; const char* value; }; const entry entries[] = { { "one", "Hello" }, { "two", "World" }, { "three", "!" } }; { some_type the_map = make_static_map( entries ); const char* word = the_map[ "one" ]; } This is a real poor example, but shows the idea. The struct could be any types that are less-than comparable; maybe there is some special arrangment of key and type. But the idea is there. I would like to be able to lookup items in a static array of items using array notation (other than numerically indexed). For extra credit, the interface would be writeable also; aka a fixed array space map. Any idea? Comments? Suggestions? ..Duane

2 2

Any interest in a weak pointer?
by wayneconrad 14 Jan '02

14 Jan '02

Is there any interest in a weak pointer that plays well with shared_ptr and its friends? Wayne Conrad

5 14

RE: [Boost-Users] Any interest for a parser class?
by Bjorn Karlsson 14 Jan '02

14 Jan '02

> From: Patrick Guio [mailto:patrick.guio@fys.uio.no] > > > Dear all, > I have written a parser class and I wanted to know whether it > could be of > any interest to be included in the boost system. Here is a > short description > of it. > This class is meant to be used in two ways, either to be > included in another > class as an inherited class and/or to be included in the main routine. > [snip] > > This is brief example to show how the class Parser can be used. > it can be used to handle more complex inherited classes. > If it can be of any interest, let me know and I will provide > you with more > details. > > Sincerely, > Patrick > I suggest that you also post this message to the Boost mailing list (http://groups.yahoo.com/group/Boost/) While Boost-Users certainly is a good place to get insightful opinions and reflections, the focus is to handle issues related to using existing Boost libraries. Also, library submissions and reviews are performed by the Boost list, so you'll need to go there sooner or later. Regards, Bjorn [Non-text portions of this message have been removed]

1 0

Any interest for a parser class?
by Patrick Guio 14 Jan '02

14 Jan '02

Dear all, I have written a parser class and I wanted to know whether it could be of any interest to be included in the boost system. Here is a short description of it. This class is meant to be used in two ways, either to be included in another class as an inherited class and/or to be included in the main routine. The first use is for classes containing fields to be initialised with some values. So far it handles intrinsic C++ types and STL vectors of intrinsics. As an example, the class Parser can be used in the class Foo as class Foo : public Parser { Foo::Foo(int nargs, char *args[]); private: enum { var1_enum, ... }; int var1; .... }; The Foo constructor that uses the Parser feature looks like Foo::Foo(nargs, args, ....) : Parser(nargs, args), var1(default_var1), ... { // Register class Parser::RegisterClass("Foo"); Parser::RegisterPackage(package, version, copyright); // Insert options and aliases to parse a value to var1 // the Any constructor is used to register the default value Parser::InsertOption(var1_enum,"var1","var1_type","var1_comment", Any(var1)); // Insert alias to option Parser::InsertOptionAlias(var1_enum, "var1_alias1"); Parser::InsertOptionAlias(var1_enum, "var1_alias2"); .... // Possibility to add a "debug level option" that takes an int argument, // the default value is 0 Parser::ParseLevelDebugOption("debug_level_option_name"); // the member function int Parser::DebugLevel() can be used thereafter to // check the this value if (Parser::DebugLevel() > 50) cout << "Debug level is " << Parser::DebugLevel() << endl; } Then a member function Foo::ParseParameters() method could look like void Foo::ParseParameters() { // The ParseOption family member functions return a boolean indicated // whether the var1 has been parsed if (Parser::ParseOption(var1_enum,var1)) cout << "var1 = " << var1 << " parsed." << endl; // Other ParseOption member functions are // * Parser::ParseOption(var1_enum,var1,"filename") // parse the filename "filename" instead of the command line // * Parser::ParseOptioninFileonCmdLine(var1_enum,var1) // if the option -i/--input[=]paramter_file is on the command line then // parse first the parameter_file, thereafter the command line. // * Parser::ParseOptiononCmdLineinFile(var1_enum,var1) // if the option -i/--input[=]paramter_file is on the command line then // parse first the command line, thereafter the parameter_file // * Parser::ParseHelp() // if the option -h/--help is parsed, print to standard output a message // with class_name information and a list of all the registered/inserted // options for that class in the predefined format : // option_name[,option_aliases] option_type option_comment // and return a true boolean // * Parser::ParseVersion() // if the option -v/--version is parsed, print to standard output a // message containing information package, version, copyright for the class // * Parser::ParseTemplate() // if the option --create-template is parsed, print to standard output a // message with class_name information and a list of all the // registered/inserted options for that class in a format to be used // later with the -i/--input containing information about variable and // aliases, type of the variable, comment/description and default value } The second way of using is from the main routine and is very similar to the first way int main(int nargs, char *args[]) { try { Parser parser(nargs, args); parser.RegisterProgram(args[0]); parser.RegisterPackage(package, version, copyright); Foo foo(nargs, args); // Insert options if necessary ... // Parse defaults if (parser.ParseHelp()) { foo.ParseHelp(); return EXIT_SUCCESS; } if (parser.ParseVersion()) { foo.ParseVersion(); return EXIT_SUCCESS; } if (parser.ParseTemplate()) { foo.ParseTemplate(); return EXIT_SUCCESS; } // Parse option for program if necessary ... // Parse class option foo.ParseParameters(); ... return EXIT_SUCCESS; } catch(ParseException &x) { cerr << x.what() << endl; return EXIT_FAILURE; } } The try/catch is used to handle potential errors at parsing and uses a class ParseException. This is brief example to show how the class Parser can be used. it can be used to handle more complex inherited classes. If it can be of any interest, let me know and I will provide you with more details. Sincerely, Patrick ====================================================================== Patrick Guio Institute of Physics, University of Oslo P.O. box 1048, Blindern, N-0316 Oslo Tel : (+47) 22 84 40 60 - Fax : (+47) 22 85 56 71 E-mail : patrick.guio(a)fys.uio.no URL : http://folk.uio.no/~patricg

3 2

iterator_adaptors Comment
by Duane Murphy 14 Jan '02

14 Jan '02

There is a comment in iterator_adaptors: public: // implementation details (too many compilers have trouble when these are private). Policies& policies() { return m_iter_p.second(); } const Policies& policies() const { return m_iter_p.second(); } Base& iter() { return m_iter_p.first(); } const Base& iter() const { return m_iter_p.first(); } This seems to imply that iter() and policies() ought to be private. I would like to suggest that having access to the underlying iterator is valuable. This is especially true of transform and projection iterators which allow you to locate a record by searching on a field. Access to the underlying iterator gets access to the rest of the record. Is there some other way of accomplishing the same thing without using iter()? Thanks, ...Duane

2 2

iterator_adaptor const iterator question
by Duane Murphy 14 Jan '02

14 Jan '02

I have now built a couple of iterators using boost::iterator_adaptor. These are not adapted iterators but rather iterators developed to iterate over interfaces that have not iterators. I havent found a good example of how to declare the equivalent of a const_iterator like in vector. What would the declartion look like? If the definition of an iterator is: typedef boost::iterator_adaptor< Base, Policy > iterator; What would the declartion for a const_iterator look like? Thanks for the help. ..Duane

2 1

[newbie]compiling 'regex_split example: split a string into tokens' failed
by pr275116 11 Jan '02

11 Jan '02

Hello, compiling the 'regex_split example: split a string into tokens' failed with an 'undefined symbols' message (see below). I am using Project Builder 1.1.1 the following compiler: Apple Computer, Inc. version gcc-934.3, based on gcc version 2.95.2 19991024 (release) on MacOSX 10.1.2 (Unix BSD 4.4). Any help would be much appreciated. Philippe de Rochambeau /usr/bin/jam -d1 JAMBASE=/Developer/Makefiles/pbx_jamfiles/ProjectBuilderJam base JAMFILE=- build ACTION=build TARGETNAME=Boost2 NATIVE_ARCH=ppc BUILD_STYLE=Development CPP_HEADERMAP_FILE=/Users/philippe/Documents/Projets_ ProjectBuilder/Boost2/build/intermediates/Boost2.build/Header maps/Boost2.hmap DSTROOT=/ OBJROOT=/Users/philippe/Documents/Projets_ProjectBuilder/B oost2/build/intermediates SRCROOT=/Users/philippe/Documents/Projets_ProjectBuilder/ Boost2 SYMROOT=/Users/philippe/Documents/Projets_ProjectBuilder/ Boost2/build ...updating 9 target(s)... BuildPhase Boost2 Completed phase <CopyHeaders> for Boost2 CompileCplusplus /Users/philippe/Documents/Projets_ProjectBuilder/Boost2/build/ intermediates/Boost2.build/Objects/ppc/main.o BuildPhase Boost2 Completed phase <DeriveAndCompileSources> for Boost2 MasterObjectFile.Combine /Users/philippe/Documents/Projets_ProjectBuilder/Boost2/build/ intermediates/Boost2.build/master.o StandaloneExecutable /Users/philippe/Documents/Projets_ProjectBuilder/Boost2/build/ Boost2 /usr/bin/ld: warning prebinding disabled because of undefined symbols /usr/bin/ld: Undefined symbols: __._Q25boost11bad_pattern __._Q25boost14bad_expression __Q35boost9re_detail13c_traits_base.class_map __Q35boost9re_detail13c_traits_base.lower_case_map __Q35boost9re_detail13c_traits_base.syntax_map ___Q25boost14bad_expressionRCt12basic_string3ZcZt18strin g_char_traits1ZcZt24__default_alloc_template2b0i0 ___Q25boost7regbase ___vt_Q25boost11bad_pattern ___vt_Q25boost14bad_expression _do_lookup_class__Q35boost9re_detail13c_traits_basePCc _do_lookup_collate__Q35boost9re_detail13c_traits_baseRt12 basic_string3ZcZt18string_char_traits1ZcZt24__default_alloc_t emplate2b0i0PCc _error_string__Q35boost9re_detail13c_traits_baseUi _init__Q25boostt14c_regex_traits1Zc _m_free__Q25boostt14c_regex_traits1Zc _toi__Q25boostt14c_regex_traits1ZcRPCcPCci _toi__Q25boostt14c_regex_traits1Zcc _transform__Q25boostt14c_regex_traits1ZcRt12basic_string3Z cZt18string_char_traits1ZcZt24__default_alloc_template2b0i0R CB1 _transform_primary__Q25boostt14c_regex_traits1ZcRt12basic _string3ZcZt18string_char_traits1ZcZt24__default_alloc_templa te2b0i0RCB1 _update__Q25boostt14c_regex_traits1Zc /usr/bin/cc -o "/Users/philippe/Documents/Projets_ProjectBuilder/Boost2/buil d/Boost2" "-L/Users/philippe/Documents/Projets_ProjectBuilder/Boost2/bu ild" "-F/Users/philippe/Documents/Projets_ProjectBuilder/Boost2/bu ild" -filelist "/Users/philippe/Documents/Projets_ProjectBuilder/Boost2/buil d/intermediates/Boost2.build/Objects/LinkFileList" "-arch" "ppc" "-prebind" "-lstdc++" ...failed StandaloneExecutable.LinkUsingFileList /Users/philippe/Documents/Projets_ProjectBuilder/Boost2/build/Boost2 ...

1 0

tuple I/O trouble
by s1imshady86 11 Jan '02

11 Jan '02

When my test program gets to the cout << a; line i get a external error. As far as i can tell the library is setup right. I had no problem using tuples in other programs but cant seem to print them. The documentation doesn't list this feature as broken on my compiler or any compiler for that matter. Im using MSVSC++ btw. #include <iostream> #include <boost/tuple/tuple_io.hpp> using namespace std; using namespace boost; int main () { tuple<int,int> a (23,42); cout << a; return 0; } heres the error verbatim: --------------------Configuration: Tuple - Win32 Debug---------------- ---- Compiling... Test.cpp Linking... Test.obj : error LNK2001: unresolved external symbol "private: static int const * const boost::tuples::detail::format_info::stream_index" (?stream_index@format_info@detail@tuples@boost@@0QBHB) Debug/Tuple.exe : fatal error LNK1120: 1 unresolved externals Error executing link.exe. Creating browse info file... Tuple.exe - 2 error(s), 0 warning(s)

1 0

Using boost::thread under Visual C++
by cadenzajon 10 Jan '02

10 Jan '02

Hi all, I'm starting to use boost for the first time now, but I'm having problems linking to the thread library (libboost_thread.lib) from within Visual C++. Using my main compiler, VC++ 6.0, I get the following linker error: libboost_thread.lib(exceptions.obj) : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::basic_string<char,struct std::char_traits<ch ar>,class std::allocator<char> >(char const *)" I checked the compiler compatibility tables online at the boost site, but they're not recent enough to include any details on the thread library. When I use Visual C++ .NET (feel free to shrink away in horror) to test it, I get about 8 linker errors complaining that a handful of standard library functions (most dealing with the basic_string and exception classes) are being redefined by libboost_thread.lib. Does anybody have any experience with this or ideas on what I could be doing wrong? I'm just starting to do multi-platform software design, and boost::thread would be a godsend! Thanks, Jonathan

7 13

MacOSX
by pr275116 10 Jan '02

10 Jan '02

Hello, I am currently trying to build Boost on MacOSX 10.1.2. I 'made' Jam for MacOSX then typed jam -sBOOST_ROOT=. -sTOOLS="gcc" to build Boost. As a result, I got many failures: ..... g++ -c -Wall -ftemplate-depth-100 -DNDEBUG -DBOOST_RE_BUILD_DLL=1 -O4 -finline-functions -Wno-inline -fPIC -I"libs/regex/build" -I"." -o "libs/regex/build/bin/libboost_regex.so/gcc/release/runtime-link- dynamic/shared-linkable-true/w32_regex_traits.o" "libs/regex/build/../src/w32_regex_traits.cpp" ...failed gcc-C++-action libs/regex/build/bin/libboost_regex.so/gcc/release/runtime-link- dynamic/shared-linkable-true/w32_regex_traits.o ... gcc-C++-action libs/regex/build/bin/libboost_regex.so/gcc/release/runtime-link- dynamic/shared-linkable-true/wide_posix_api.o zsh: command not found: g++ g++ -c -Wall -ftemplate-depth-100 -DNDEBUG -DBOOST_RE_BUILD_DLL=1 -O4 -finline-functions -Wno-inline -fPIC -I"libs/regex/build" -I"." -o "libs/regex/build/bin/libboost_regex.so/gcc/release/runtime-link- dynamic/shared-linkable-true/wide_posix_api.o" "libs/regex/build/../src/wide_posix_api.cpp" ...failed gcc-C++-action libs/regex/build/bin/libboost_regex.so/gcc/release/runtime-link- dynamic/shared-linkable-true/wide_posix_api.o ... ...skipped <libs!regex!build/libboost_regex.so/gcc/release/runtime-link- dynamic/shared-linkable-true>libboost_regex.so for lack of <libs!regex!build/libboost_regex.so/gcc/release/runtime-link- dynamic/shared-linkable-true>c_regex_traits.o... ...failed updating 78 targets... ...skipped 8 targets... Has anyone in this group managed to build Boost on MacOS 10.1.2? If so, what configuration did you use? Could you please send me your ProjectBuilder project file? Many thanks. Philippe de Rochambeau

1 0

RE: [Boost-Users] New poll for Boost-Users
by Bjorn Karlsson 10 Jan '02

10 Jan '02

> From: Ken Hagan [mailto:k.hagan@thermoteknix.co.uk] > > Well I tried but I got an error message saying "Oops. You are > not a moderator." Is Yahoo based in Florida, or Zimbabwe? > We (the confused moderators) made a mistake - sorry about that. The moderating force is currently discussing the question of membership visibility, and the poll is, at least for now, off. Suggestions and comments can (of course) be sent to the moderators or to the list. Bjorn [Non-text portions of this message have been removed]

1 0

New poll for Boost-Users
by Boost-Users＠yahoogroups.com 10 Jan '02

10 Jan '02

Enter your vote today! A new poll has been created for the Boost-Users group: Yahoo! groups can be configured so that only the moderators can view membership list, or so that membership lists can be viewed by anyone (email addresses are always munged for non-moderators; my email address would appear as something like jim.hyslop@.le...) Do you want the membership list to be freely available to be viewed by anyone, or do you want the membership list kept private so only the moderators can view the list? o I want only the moderators to be able to view the membership list o I want anyone to be able to view the membership list To vote, please visit the following web page: http://groups.yahoo.com/group/Boost-Users/polls Note: Please do not reply to this message. Poll votes are not collected via email. To vote, you must go to the Yahoo! Groups web site listed above. Thanks!

2 1

RE: [Boost-Users] Viewing membership (was: boost::pool + shared m emory)
by Jim.Hyslop 08 Jan '02

08 Jan '02

Chris Little [SMTP:clittle@renlearn.ca] wrote: > Jim, > > Polls are limited to Moderators in this group. i.e. only moderators can > respond to the poll. Doh! I never even thought to check that. Jon, can we lighten that restriction slightly, to "limited" (Moderators can create polls, members can vote)? -- Jim

1 0

RE: [Boost-Users] Viewing membership (was: boost::pool + shared m emory)
by Chris Little 08 Jan '02

08 Jan '02

Jim, Polls are limited to Moderators in this group. i.e. only moderators can respond to the poll. Chris > -----Original Message----- > From: Jim.Hyslop [mailto:jim.hyslop@leitch.com] > Sent: Tuesday, January 08, 2002 10:17 AM > To: 'Boost-Users(a)yahoogroups.com' > Subject: RE: [Boost-Users] Viewing membership (was: > boost::pool + shared m emory) > > > Tom Matelich [SMTP:tmatelich@zetec.com] wrote: > > PS Why can't I see who is a member of this group? I > wanted to check > > to > see > > if Steve Cleary was a member. Sorry if you are Steve. > Because that's the way the group was set up. Only moderators > can view the membership list. > > It can be changed easily enough, if people want it changed. > Hey, here's a great opportunity to take advantage of Yahoo! > Group's poll feature. > > -- > Jim [Non-text portions of this message have been removed]

1 0

RE: [Boost-Users] Viewing membership (was: boost::pool + shared m emory)
by Jim.Hyslop 08 Jan '02

08 Jan '02

Tom Matelich [SMTP:tmatelich@zetec.com] wrote: > PS Why can't I see who is a member of this group? I wanted to check to see > if Steve Cleary was a member. Sorry if you are Steve. Because that's the way the group was set up. Only moderators can view the membership list. It can be changed easily enough, if people want it changed. Hey, here's a great opportunity to take advantage of Yahoo! Group's poll feature. -- Jim

1 0