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

RE: [Boost-users] RE: Boost thread problem
by Sliwa, Przemyslaw (London) 14 Apr '05

14 Apr '05

Well, I have tried it on three systems: 1 multiprocessor Win XP -> fails, some problems with the heap, 2. single processor Win 2000 -> works fine, no problems at all, all the treads exit properly, 3. single processor Linux Suse 9.1, gcc 3.3 -> fails, segmentation fault. I am also using the boost 1.32 library. Similar compilation on Linux except -lc_r. What is it for? How to check if I am linking against thread safe libraries? On Windows the NET 2003 compiler was used, the multithreaded support was on, so I have no idea how to link against tread safe libs. Can you advise? Thanks in advance Pshemek -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of C. Michailidis Sent: 14 April 2005 07:26 To: boost-users(a)lists.boost.org Subject: [Boost-users] RE: Boost thread problem > All, > > I have got a problem with the boost::thread package. > My idea was to facilitate the multiprocessor ability of my computer and > write a program which creates 10 threads which firstly write to the disk > certain amount of information and then they read it back and push back > certain objects. I am getting some memory access problems when pushing > back the objects to the global vector. Can anyone of you understand why > there is a problem? I really do not get it since the mutex is locked and > the access to the vector is exclusively guaranteed to the active thread. > > > Can you help? I tried your code on my system and it seems to work as expected. No exceptions were thrown, there was a file called 'file.txt' in the pwd, and TradeVector.size was 80000 after the run. Of course I needed to remove the include of proprietary code - it was replaced with a dummy/stub class like this one: class CFXTrade { public: CFXTrade() { }; CFXTrade( int id, string name, double amt ) { m_TradeID = id; m_Name = name; m_Amount = amt; }; int m_TradeID; string m_Name; double m_Amount; }; My system looks like this: FreeBSD medea.digitalescorts.net 5.4-PRERELEASE FreeBSD 5.4-PRERELEASE #0: Thu Mar 31 02:47:38 EST 2005 root@medea.digitalescorts.net:/usr/obj/usr/src/sys/MEDEA i386 and I have boost-1.32.0_2 libraries installed. I built the program from the command-line using the following command: "gcc hello.cpp -ggdb -I/usr/local/include -L/usr/local/lib -lboost_thread -lc_r" The problem may be platform specific. Are you linking against a thread-safe CRT? Can you provide details regarding your operating system? Which version of the boost library do you have installed? My suspicion is that you may not be using a thread-safe CRT. Of course the boost_thread library may be broken for your specific platform (but I doubt it). Sincerely, Constantino Michailidis Balston Research LLC _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

1 0

RE: [Boost-users] Re: MultiIndexSet invariant test failure
by Manges, Ross G 14 Apr '05

14 Apr '05

> OK, this is a different story. Yes, unfortunately. > 2. The comparison predicate you're passing is not correct (i.e. it > does not implement a strict weak ordering.) OK, this is possible. I'm using a function object. What exactly does it mean to implement strict weak ordering? I need to search the documentation again... > 3. Elements are dynamic (pointers to objects) and you did > a premature delete on one or some of them. I'm using boost::shared_ptr types, so they shouldn't get cleaned up while they are contained by the MultiIndexSet. However, I'm starting to suspect that the shared_ptrs are not behaving well. > 5. You're running out of memory and new() does not throw bad_alloc > (this can happen in MSVC++ 6.5 and, maybe, 7.0.) I'm using gcc on RHEL3; I don't believe this is happening. > 6. You haven't > selected a multithreaded version of the runtime library. I need to investigate this; what 'runtime library' are you referring to? > 7. You > guarded write access to an index but *not* to other indices of the > same container. I gaurded ~everything~ ;) > Questions: > > 1. I'd like to analyze this. I can run tests in GCC/Cygwin. Could your > test be run on this platform? If not, could you at least disclose the > code so that I can take a look at it? We're developing on the linux platform, so that's not a barrier, but unfortunately, it will be very difficult to convince my employer to allow me to disclose any code. Thank you, however, for offering to analyze it. > 2. Does your > debugging environment allow you to peek at the variables when the > assert happens? I'm using some acient version of gdb/ddd. I could try, although I'm not sure how to do that yet. > Thank *you* for reporting the problem. Sure, although it's probably something I'm doing wrong. I really do appreciate your help. This MultiIndexSet is perfect for my needs; I just need to get it working right!

2 1

RE: Boost thread problem
by C. Michailidis 14 Apr '05

14 Apr '05

> All, > > I have got a problem with the boost::thread package. > My idea was to facilitate the multiprocessor ability of my computer and > write a program which creates 10 threads which firstly write to the disk > certain amount of information and then they read it back and push back > certain objects. I am getting some memory access problems when pushing > back the objects to the global vector. Can anyone of you understand why > there is a problem? I really do not get it since the mutex is locked and > the access to the vector is exclusively guaranteed to the active thread. > > > Can you help? I tried your code on my system and it seems to work as expected. No exceptions were thrown, there was a file called 'file.txt' in the pwd, and TradeVector.size was 80000 after the run. Of course I needed to remove the include of proprietary code - it was replaced with a dummy/stub class like this one: class CFXTrade { public: CFXTrade() { }; CFXTrade( int id, string name, double amt ) { m_TradeID = id; m_Name = name; m_Amount = amt; }; int m_TradeID; string m_Name; double m_Amount; }; My system looks like this: FreeBSD medea.digitalescorts.net 5.4-PRERELEASE FreeBSD 5.4-PRERELEASE #0: Thu Mar 31 02:47:38 EST 2005 root@medea.digitalescorts.net:/usr/obj/usr/src/sys/MEDEA i386 and I have boost-1.32.0_2 libraries installed. I built the program from the command-line using the following command: "gcc hello.cpp -ggdb -I/usr/local/include -L/usr/local/lib -lboost_thread -lc_r" The problem may be platform specific. Are you linking against a thread-safe CRT? Can you provide details regarding your operating system? Which version of the boost library do you have installed? My suspicion is that you may not be using a thread-safe CRT. Of course the boost_thread library may be broken for your specific platform (but I doubt it). Sincerely, Constantino Michailidis Balston Research LLC

1 0

RE: Re: MultiIndexSet invariant test failure
by Manges, Ross G 13 Apr '05

13 Apr '05

> Date: Wed, 13 Apr 2005 06:58:01 +0000 (UTC) > From: Joaquin M Lopez Munoz <joaquin(a)tid.es> > Subject: [Boost-users] Re: MultiIndexSet invariant test failure > To: boost-users(a)lists.boost.org > Message-ID: <loom.20050413T084751-297(a)post.gmane.org> > Content-Type: text/plain; charset=utf-8 > > So, once you have mutex-guarded your code, the problem > does not show? Please confirm. The invariant test fails (asserts) on a call to 'insert()' regardless of my mutex gaurds. I have even gone as far as to wrap 'read' methods such as calls to 'size()' and 'empty()' with mutexes. > Other than that, you'll have to guard your code with > mutexes like you say you're doing now. Yes, I understand this, but it seems that the invariant assertion is happening and it may not (?) necessarily be related to a threading issue. According to my backtrace, it appears that I do not have a thread contention issue. There is only one thread that is performing a call to any of the container methods (the other threads are waiting on a mutex release), and that call is 'insert()', and it is causing the aforementioned invariant assert. The invariant assert does not happen during every test run, but it does happen frequently. What are the kinds of things that could cause the invariant assert? The documentation doesn't go into any great detail in this area. > Hope this helps. Best regards, Any help is most welcome; thanks!

2 1

uBLAS compatible to OpenGL?
by Malte Clasen 13 Apr '05

13 Apr '05

Hi, is the uBLAS library memory compatible to OpenGL vector and matrix operations? I'd like to use a single representation for both internal maths and the rendering interface of my application. OpenGL expects a pointer to a float or double C-array. For example 4x4 matrices are stored linearly as 16 values. When using std::vector<T> or bounded_array<T> as storage, is there a guarantee that m(0,0) is a reference to the first element of an array of (at least) 16 values that equal the linearized matrix elements? Or is there another way to get access to the low-level storage if it has a compatible memory layout? If there isn't, is it possible customize the uBLAS library by an additional "storage organization" or "adapted array" class? best regards, Malte

2 1

serializing abstract base class
by Alex Olivas 13 Apr '05

13 Apr '05

I'm trying to serialize an abstract base class. I used the BOOST_IS_ABSTRACT macro, but the compile fails with the following error... public/dataclasses/I3Particle.h:225: syntax error before `namespace' public/dataclasses/I3Particle.h:225: syntax error before `}' token line 225 of I3Particle is... BOOST_IS_ABSTRACT(I3Particle); Is is not as simple as adding this one line? I'm using gcc 3.2.3. Thanks, Alex.

3 2

Boost thread problem
by Sliwa, Przemyslaw (London) 13 Apr '05

13 Apr '05

All, I have got a problem with the boost::thread package. My idea was to facilitate the multiprocessor ability of my computer and write a program which creates 10 threads which firstly write to the disk certain amount of information and then they read it back and push back certain objects. I am getting some memory access problems when pushing back the objects to the global vector. Can anyone of you understand why there is a problem? I really do not get it since the mutex is locked and the access to the vector is exclusively guaranteed to the active thread. Can you help? Thank you in advance Pshemek #include "FXTrade.h" #include <string> #include <fstream> #include <vector> #include <iostream> #include <cmath> #include <exception> #include <boost/random.hpp> #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/bind.hpp> using namespace std; using namespace boost; namespace write_namespace { mutex file_mutex; ofstream out; const size_t dimension(10000); const size_t size(10); const unsigned int number_of_threads(8); } vector<CFXTrade> TradeVector; namespace read_namespace { mutex in_file_mutex; ifstream in; } void write_to_disk(const vector<CFXTrade>& nVector) { using namespace write_namespace; mutex::scoped_lock lock(file_mutex); for(vector<CFXTrade>::const_iterator i_ptr=nVector.begin(); i_ptr!=nVector.end(); ++i_ptr) { out << i_ptr->m_TradeID << ";" << i_ptr->m_Name << ";" << i_ptr->m_Amount << endl; } } auto_ptr<CFXTrade> getTradeFromString(string& c_tmp) { int i_TradeID; string c_Name, c_sub; string::size_type pos; double d_Amount(0.0); pos = c_tmp.find(";"); c_sub = c_tmp.substr(0, pos); i_TradeID = atoi(c_sub.c_str()); c_sub = c_tmp.substr(++pos, 3); c_Name = c_sub; c_sub = c_tmp.substr(pos+4, 3); d_Amount = atof(c_sub.c_str()); d_Amount = 100.; return auto_ptr<CFXTrade>(new CFXTrade(i_TradeID, c_Name, d_Amount)); } void read_from_disk(vector<CFXTrade>& nTradeVector) { using namespace write_namespace; using namespace read_namespace; string c_tmp; try { for(size_t i=0; i<dimension; ++i) { mutex::scoped_lock lock(in_file_mutex); getline(in, c_tmp); TradeVector.push_back(*getTradeFromString(c_tmp) ); } } catch(exception& e) { cout << "A standard exception caught from " << __LINE__ << endl; cout << e.what() << endl; } } bool generate_file() { using namespace write_namespace; vector< thread* > ThreadVector(number_of_threads); mt19937 mt2; random_number_generator<mt19937> std_rng(mt2); int TradeIDVector[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; char* NameVector[] = {"ABC", "BCD", "CDE", "DEF", "EFG", "FGH", "GHI", "HIJ", "IJK", "JKL"}; double AmountVector[] = {10., 20., 30., 40., 50., 60., 70., 80., 90., 11.}; vector< vector<CFXTrade> > TradeVector(number_of_threads); for(int i=0; i<number_of_threads; ++i) { for(int j=0; j<dimension; ++j) { TradeVector[i].push_back(CFXTrade(TradeIDVector[std_rng(size)], string(NameVector[std_rng(size)]), AmountVector[std_rng(size)])); } } out.open("file.txt"); for(int i=0; i<number_of_threads; ++i) { ThreadVector[i] = new thread(bind(&write_to_disk, TradeVector[i])); } for(int i=0; i<number_of_threads; ++i) { ThreadVector[i]->join(); } out.close(); for(int i=0; i<number_of_threads; ++i) { delete ThreadVector[i]; } return true; } bool read_trades() { using namespace write_namespace; using namespace read_namespace; vector<thread*> ReadThreadVector(number_of_threads); in.open("file.txt"); try { for(int i=0; i<number_of_threads; ++i) { ReadThreadVector[i] = new thread(bind(&read_from_disk, TradeVector)); } for(int i=0; i<number_of_threads; ++i) { ReadThreadVector[i]->join(); } in.close(); for(int i=0; i<number_of_threads; ++i) { delete ReadThreadVector[i]; } } catch(exception& e) { cout << "A standard exception caught from " << __LINE__ << endl; cout << e.what() << endl; return false; } return true; } int main() { using namespace read_namespace; try { generate_file(); read_trades(); } catch(exception& e) { cout << e.what() << endl; exit(EXIT_FAILURE); } catch(...) { cout << "Unknown exception occured" << endl; } cout << TradeVector.size() << endl; } -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

1 0

boost::variant and operator<<
by Matt Hortman 13 Apr '05

13 Apr '05

Hello, I feel almost silly asking this but: I can only get the code listed below to compile if I remove the comments on the namespace statements, placing my custom operator<< in the boost::detail::variant namespace. Otherwise I get the error c:\Boost\include\boost-1_32\boost\variant\detail\variant_io.hpp(64) : error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'const T1' (or there is no acceptable conversion) from VC++ 7.1 and a similar error from both gcc 3.3 and 3.4. I'm using boost 1.32 on both WinXP and FreeBSD. Looking at the code in variant_io.hpp, I see no reason why it should not work without the namespace statements. Is there something fundamental about namespaces that I don't understand? Thanks, -Matt #include <vector> #include <string> #include <iostream> #include <boost/variant.hpp> typedef std::vector<std::string> strlist; typedef boost::variant<int, strlist> ConfigItem; //namespace boost { namespace detail { namespace variant { inline std::ostream& operator<< (std::ostream& os, const strlist& slist) { strlist::const_iterator it; for (it=slist.begin(); it!=slist.end(); ++it) os << *it << ", "; return os; } //}}} //using namespace boost::detail::variant; void main (void) { strlist sl; std::cout << sl << std::endl; //compiles fine ConfigItem v; std::cout << v << std::endl; // error no operator found }

3 2

MultiIndexSet invariant test failure
by Manges, Ross G 13 Apr '05

13 Apr '05

I'm running into an invariant test failure (I have BOOST_MULTI_INDEX_INVARIANT_ASSERT defined). Specifically, the trace that follows indicates that the assert fails during a MultiIndexSet "insert" operation. Additionally, I only see this happen when I'm running multi-threaded tests. I have the call to insert() wrapped by a mutex to prevent multiple threads from calling it at the same time. Has anyone else had trouble like this? Searching the users list for multi_index and invariant doesn't turn up much. I'm using the boost library version 1_32 on RHEL3. Thanks for any help.

2 1

A-Star in BGL?
by Vivid Yang 13 Apr '05

13 Apr '05

Hi, I wonder if there is A-Star algorithms implemented in BGL? I could not find it..... Or is it hard to implement (Say, hard to implement the heuristics functor)? Is there a way to implement A-Star based on what we have in BGL? Thanks a lot! Vivid

2 1

Using sparse matrix
by Golan Green 12 Apr '05

12 Apr '05

Hello, I have just started using Boost libraries, and I have 2 questions regarding use of sparse matrix: 1. The matrix should be large (about 3000 * 1500), and I need to make the insertion very efficient. When I use the regular insert function, it seems to work very slow. Is there a better way to insert objects into the sparse matrix? 2. I want to know if there is an efficient way to multiply the matrix with a vector. Regards, Golan.

2 1

Simple question: How to verify two types are the same?
by Stephen Gross 12 Apr '05

12 Apr '05

Hi all... I know this is a simple question, but I can't figure out which boost function to use. How do I find out if two types are the same type? For example: template<C1, C2> void compare() { if(boost::types_are_the_same<C1, C2>::result == true) ... } Thanks! --Steve Stephen Gross Case Western School of Medicine Cleveland, OH "The large print giveth and the small print taketh away." - Tom Waits

3 4

RE: [Boost-users] Re: sun sparc g++ filesystem build error
by Naeem ahmad 12 Apr '05

12 Apr '05

Hi, I am using g++ 2.96 version, It is fail with many libraries of boost. Should I get latest version of g++ compiler, does it will work with all boost libraries. Thanks, Naeem -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Rene Rivera Sent: 12 April 2005 15:47 To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: sun sparc g++ filesystem build error Rene Rivera wrote: > Naeem ahmad wrote: >> /usr/local/boost_1_32_0/bjam "-sBUILD=g++" > > Hence you should do: > > /usr/local/boost_1_32_0/bjam "-sTOOLS=gcc" PS. What Markus said also applies. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - Grafik/jabber.org _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users AIRCOM to present our integrated OSS Solution at the TeleMangement World, Nice 2005, held May 16th - 19th, in Nice, France at the Acropolis Convention Centre. Visit us at booth 107. www.tmforum.org Disclaimer: The information contained in this e-mail, including any attachments to it, is confidential and intended only for the person(s) to whom it is addressed. Any examination, distribution, disclosure, printing, or copying of this information, or reliance upon this information by any person other than the intended recipient(s) is strictly prohibited. If this e-mail has been misdirected and you are not the intended recipient, please notify the sender immediately and delete this e-mail from your system. The views and opinions contained in this transmission represent those of the author and do not necessarily reflect those of AIRCOM International. AIRCOM International may monitor incoming and outgoing e-mails. By replying to this message, you consent to this monitoring. This e-mail has been scanned by McAfee Group Shield prior to transmission. However, recipients are advised to apply their own antivirus detection measures to this e-mail and any attachments upon receipt. AIRCOM International does not accept liability for any damage or losses arising as a result of receiving this e-mail.

2 1

sun sparc g++ filesystem build error
by Naeem ahmad 12 Apr '05

12 Apr '05

Cd /usr/local/boost_1_32_0/libs/filesystem/test When I try to buld using below command /usr/local/boost_1_32_0/bjam "-sBUILD=g++" I get below error ...found 795 targets... ...updating 36 targets... MkDir1 ../../../bin/boost/libs/filesystem/build/libboost_filesystem.a/gcc/g++ gcc-C++-action ../../../bin/boost/libs/filesystem/build/libboost_filesystem.a/gcc/g++/e xception.o gcc-C++-action ../../../bin/boost/libs/filesystem/build/libboost_filesystem.a/gcc/g++/o perations_posix_windows.o gcc-C++-action ../../../bin/boost/libs/filesystem/build/libboost_filesystem.a/gcc/g++/p ath_posix_windows.o gcc-C++-action ../../../bin/boost/libs/filesystem/build/libboost_filesystem.a/gcc/g++/c onvenience.o gcc-Archive-action ../../../bin/boost/libs/filesystem/build/libboost_filesystem.a/gcc/g++/l ibboost_filesystem-gcc-1_32.a ar: creating ../../../bin/boost/libs/filesystem/build/libboost_filesystem.a/gcc/g++/l ibboost_filesystem-gcc-1_32.a MkDir1 ../../../bin/boost/libs/filesystem/test/path_test.test/gcc/g++ gcc-C++-action ../../../bin/boost/libs/filesystem/test/path_test.test/gcc/g++/path_test .o gcc-Link-action ../../../bin/boost/libs/filesystem/test/path_test.test/gcc/g++/path_test Chmod1 ../../../bin/boost/libs/filesystem/test/path_test.test/gcc/g++/path_test MkDir1 ../../../bin/boost/libs/filesystem/test/default_name_check_test.test/gcc /g++ gcc-C++-action ../../../bin/boost/libs/filesystem/test/default_name_check_test.test/gcc /g++/default_name_check_test.o gcc-Link-action ../../../bin/boost/libs/filesystem/test/default_name_check_test.test/gcc /g++/default_name_check_test Chmod1 ../../../bin/boost/libs/filesystem/test/default_name_check_test.test/gcc /g++/default_name_check_test MkDir1 ../../../bin/boost/libs/filesystem/test/operations_test.test/gcc/g++ gcc-C++-action ../../../bin/boost/libs/filesystem/test/operations_test.test/gcc/g++/ope rations_test.o gcc-Link-action ../../../bin/boost/libs/filesystem/test/operations_test.test/gcc/g++/ope rations_test Chmod1 ../../../bin/boost/libs/filesystem/test/operations_test.test/gcc/g++/ope rations_test MkDir1 ../../../bin/boost/libs/filesystem/test/fstream_test.test/gcc/g++ gcc-C++-action ../../../bin/boost/libs/filesystem/test/fstream_test.test/gcc/g++/fstrea m_test.o In file included from /usr/local/boost_1_32_0/libs/filesystem/test/fstream_test.cpp:10: /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:27: parse error before `<' /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:33: `traits' was not declared in this scope /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:33: syntax error before `*' /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:42: syntax error before `;' /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:47: parse error before `<' /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:53: parse error before `&' /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:55: ANSI C++ forbids declaration `basic_ifstream' with no type /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:55: only constructors can be declared `explicit' /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp: In function `int basic_ifstream(...)': /usr/local/boost_1_32_0/boost/filesystem/fstream.hpp:55: confused by earlier errors, bailing out set -e "g++" -c -Wall -ftemplate-depth-255 -DBOOST_ALL_NO_LIB=1 -g -O0 -fno-inline -I"../../../bin/boost/libs/filesystem/test" -I "/usr/local/boost_1_32_0" -o "../../../bin/boost/libs/filesystem/test/fstream_test.test/gcc/g++/fstre am_test.o" "/usr/local/boost_1_32_0/libs/filesystem/test/fstream_test.cpp" ...failed gcc-C++-action ../../../bin/boost/libs/filesystem/test/fstream_test.test/gcc/g++/fstrea m_test.o... ...skipped <@boost!libs!filesystem!test/fstream_test.test/gcc/g++>fstream_test for lack of <@boost!libs!filesystem!test/fstream_test.test/gcc/g++>fstream_test.o... MkDir1 ../../../bin/boost/libs/filesystem/test/convenience_test.test/gcc/g++ gcc-C++-action ../../../bin/boost/libs/filesystem/test/convenience_test.test/gcc/g++/co nvenience_test.o gcc-Link-action ../../../bin/boost/libs/filesystem/test/convenience_test.test/gcc/g++/co nvenience_test Chmod1 ../../../bin/boost/libs/filesystem/test/convenience_test.test/gcc/g++/co nvenience_test MkDir1 ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++ gcc-C++-action ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.o gcc-Link-action ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test Chmod1 ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test execute-test ../../../bin/boost/libs/filesystem/test/path_test.test/gcc/g++/path_test .run **passed** ../../../bin/boost/libs/filesystem/test/path_test.test/gcc/g++/path_test .test execute-test ../../../bin/boost/libs/filesystem/test/default_name_check_test.test/gcc /g++/default_name_check_test.run **passed** ../../../bin/boost/libs/filesystem/test/default_name_check_test.test/gcc /g++/default_name_check_test.test execute-test ../../../bin/boost/libs/filesystem/test/operations_test.test/gcc/g++/ope rations_test.run **passed** ../../../bin/boost/libs/filesystem/test/operations_test.test/gcc/g++/ope rations_test.test ...skipped <@boost!libs!filesystem!test/fstream_test.test/gcc/g++>fstream_test.run for lack of <@boost!libs!filesystem!test/fstream_test.test/gcc/g++>fstream_test... execute-test ../../../bin/boost/libs/filesystem/test/convenience_test.test/gcc/g++/co nvenience_test.run **passed** ../../../bin/boost/libs/filesystem/test/convenience_test.test/gcc/g++/co nvenience_test.test execute-test ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.run ====== BEGIN OUTPUT ====== The operating system is using an integer type to report file sizes that can not represent file sizes greater that 2 gigabytes (31-bits). Thus the Filesystem Library will not correctly deal with such large files. If you think that this operatiing system should be able to support large files, please report the problem to the Boost developers mailing list. EXIT STATUS: 1 ====== END OUTPUT ====== ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test > ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.output 2>&1 status=$? echo >> ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.output echo EXIT STATUS: $status >> ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.output if test $status -eq 0 ; then cp -f ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.output ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.run fi verbose=1 if test $status -ne 0 ; then verbose=0 fi if test $verbose -eq 0 ; then echo ====== BEGIN OUTPUT ====== cat ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.output echo ====== END OUTPUT ====== fi exit $status ...failed execute-test ../../../bin/boost/libs/filesystem/test/large_file_support_test.test/gcc /g++/large_file_support_test.run... ...failed updating 2 targets... ...skipped 4 targets... ...updated 30 targets... AIRCOM to present our integrated OSS Solution at the TeleMangement World, Nice 2005, held May 16th - 19th, in Nice, France at the Acropolis Convention Centre. Visit us at booth 107. www.tmforum.org Disclaimer: The information contained in this e-mail, including any attachments to it, is confidential and intended only for the person(s) to whom it is addressed. Any examination, distribution, disclosure, printing, or copying of this information, or reliance upon this information by any person other than the intended recipient(s) is strictly prohibited. If this e-mail has been misdirected and you are not the intended recipient, please notify the sender immediately and delete this e-mail from your system. The views and opinions contained in this transmission represent those of the author and do not necessarily reflect those of AIRCOM International. AIRCOM International may monitor incoming and outgoing e-mails. By replying to this message, you consent to this monitoring. This e-mail has been scanned by McAfee Group Shield prior to transmission. However, recipients are advised to apply their own antivirus detection measures to this e-mail and any attachments upon receipt. AIRCOM International does not accept liability for any damage or losses arising as a result of receiving this e-mail.

3 3

to build on sun sparc with g++ compiler fails
by Naeem ahmad 12 Apr '05

12 Apr '05

Hi all, I did these steps to build whole boost library, but I am getting errors when I build , can some body point any error in steps step 1: Using the configure script If you know that boost is incorrectly configured for your particular setup, and you are on a UNIX like platform, then you may want to try and improve things by running the boost configure script. >From a shell command prompt you will need to cd into <boost-root>/libs/config/ and type: on command prompt: sh ./configure step 2: On Unix type platforms do: on command prompt: cd <jam source location> sh ./build.sh copy bjam from /usr/local/boost_1_32_0/tools/build/jam_src/bin.solaris to /usr/local/boost_1_32_0/ cd /usr/local/boost_1_32_0/ bjam "-sBUILD" AIRCOM to present OSS, Planning & Optimization products and services at the IIR Performance Measurement Conference, April 4-7th 2005, Budapest. Visit us at Booth 12. www.iir-conferences.com Disclaimer: The information contained in this e-mail, including any attachments to it, is confidential and intended only for the person(s) to whom it is addressed. Any examination, distribution, disclosure, printing, or copying of this information, or reliance upon this information by any person other than the intended recipient(s) is strictly prohibited. If this e-mail has been misdirected and you are not the intended recipient, please notify the sender immediately and delete this e-mail from your system. The views and opinions contained in this transmission represent those of the author and do not necessarily reflect those of AIRCOM International. AIRCOM International may monitor incoming and outgoing e-mails. By replying to this message, you consent to this monitoring. This e-mail has been scanned by McAfee Group Shield prior to transmission. However, recipients are advised to apply their own antivirus detection measures to this e-mail and any attachments upon receipt. AIRCOM International does not accept liability for any damage or losses arising as a result of receiving this e-mail.

1 0

How to build boost whiole library on sun solaris with g++ compiler
by Naeem ahmad 12 Apr '05

12 Apr '05

So I can get static link libraries. Thanks, Naeem. AIRCOM to present OSS, Planning & Optimization products and services at the IIR Performance Measurement Conference, April 4-7th 2005, Budapest. Visit us at Booth 12. www.iir-conferences.com Disclaimer: The information contained in this e-mail, including any attachments to it, is confidential and intended only for the person(s) to whom it is addressed. Any examination, distribution, disclosure, printing, or copying of this information, or reliance upon this information by any person other than the intended recipient(s) is strictly prohibited. If this e-mail has been misdirected and you are not the intended recipient, please notify the sender immediately and delete this e-mail from your system. The views and opinions contained in this transmission represent those of the author and do not necessarily reflect those of AIRCOM International. AIRCOM International may monitor incoming and outgoing e-mails. By replying to this message, you consent to this monitoring. This e-mail has been scanned by McAfee Group Shield prior to transmission. However, recipients are advised to apply their own antivirus detection measures to this e-mail and any attachments upon receipt. AIRCOM International does not accept liability for any damage or losses arising as a result of receiving this e-mail.

1 0

(no subject)
by Martin Jynge 11 Apr '05

11 Apr '05

Well, the previous text sounded confused.. :) i was soo tired from my project and i didnt know what to do. But, in fact, it *is* genetic programming I'm babling about, and its all based on the boost lib. Basically I was wondering if anybody knew anything about it. regards, -- Martin Jynge

1 0

RE: [Boost-users] Re: SUN sparc GNU 2.95.3 build fail
by Naeem ahmad 11 Apr '05

11 Apr '05

thanks -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Rene Rivera Sent: 11 April 2005 19:50 To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: SUN sparc GNU 2.95.3 build fail Naeem ahmad wrote: > Hi Thanks, > Can I able to get source code of boost compitable for unix OS. > With lines will have CR/LF at the end from boost.org http://prdownloads.sourceforge.net/boost/boost_1_32_0.tar.bz2?download Or.. http://prdownloads.sourceforge.net/boost/boost_1_32_0.tar.gz?download -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - Grafik/jabber.org _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users AIRCOM to present OSS, Planning & Optimization products and services at the IIR Performance Measurement Conference, April 4-7th 2005, Budapest. Visit us at Booth 12. www.iir-conferences.com Disclaimer: The information contained in this e-mail, including any attachments to it, is confidential and intended only for the person(s) to whom it is addressed. Any examination, distribution, disclosure, printing, or copying of this information, or reliance upon this information by any person other than the intended recipient(s) is strictly prohibited. If this e-mail has been misdirected and you are not the intended recipient, please notify the sender immediately and delete this e-mail from your system. The views and opinions contained in this transmission represent those of the author and do not necessarily reflect those of AIRCOM International. AIRCOM International may monitor incoming and outgoing e-mails. By replying to this message, you consent to this monitoring. This e-mail has been scanned by McAfee Group Shield prior to transmission. However, recipients are advised to apply their own antivirus detection measures to this e-mail and any attachments upon receipt. AIRCOM International does not accept liability for any damage or losses arising as a result of receiving this e-mail.

1 0

RE: [Boost-users] SUN sparc GNU 2.95.3 build fail
by Naeem ahmad 11 Apr '05

11 Apr '05

Hi Thanks, Can I able to get source code of boost compitable for unix OS. With lines will have CR/LF at the end from boost.org How to build the boost.org all libraries on SUN solaris machine. Thanks, Naeem -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Peter Dimov Sent: 11 April 2005 18:51 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] SUN sparc GNU 2.95.3 build fail Naeem ahmad wrote: > Hi all, > > I am getting this error when try to build on solaris, using g++, I am > only using > > Class shared_ptr > > > > > > g++ -c -I/opt/sfw/lib/g++-include -I/usr/local/include > -I/opt/sfw/lib/gcc-lib/sparc-sun-solaris2.8/2.95.3/include > -I/usr/local/boost_1_32_0 console_app.cpp > In file included from /usr/local/boost_1_32_0/boost/config.hpp:44, > from /usr/local/boost_1_32_0/boost/shared_ptr.hpp:17, > from console_app.cpp:7: > /usr/local/boost_1_32_0/boost/config/stdlib/sgi.hpp:29: Invalid token > in _expression > In file included from > /usr/local/boost_1_32_0/boost/config/platform/solaris.hpp:17, > from /usr/local/boost_1_32_0/boost/config.hpp:53, > from /usr/local/boost_1_32_0/boost/shared_ptr.hpp:17, > from console_app.cpp:7: > /usr/local/boost_1_32_0/boost/config/posix_features.hpp:51: Invalid > token in _expression Check your line endings. If you moved Boost from a Windows machine to the Solaris box, the lines will have CR/LF at the end, not LF. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users AIRCOM to present OSS, Planning & Optimization products and services at the IIR Performance Measurement Conference, April 4-7th 2005, Budapest. Visit us at Booth 12. www.iir-conferences.com Disclaimer: The information contained in this e-mail, including any attachments to it, is confidential and intended only for the person(s) to whom it is addressed. Any examination, distribution, disclosure, printing, or copying of this information, or reliance upon this information by any person other than the intended recipient(s) is strictly prohibited. If this e-mail has been misdirected and you are not the intended recipient, please notify the sender immediately and delete this e-mail from your system. The views and opinions contained in this transmission represent those of the author and do not necessarily reflect those of AIRCOM International. AIRCOM International may monitor incoming and outgoing e-mails. By replying to this message, you consent to this monitoring. This e-mail has been scanned by McAfee Group Shield prior to transmission. However, recipients are advised to apply their own antivirus detection measures to this e-mail and any attachments upon receipt. AIRCOM International does not accept liability for any damage or losses arising as a result of receiving this e-mail.

3 2

Using shared_ptr slightly different
by Daniel Lidström 11 Apr '05

11 Apr '05

Hello, I want to use the shared_ptr with objects that are allocated using a factory. The problem is the deallocation. It has to be done with a ``manager'' class. For example, here is how the allocation and deallocation has to be done: PxyFileData& geo_file = dynamic_cast<PxyFileData&>(fileMan.New("geo")); fileMan.Close(geo_file); I would like to be able to put shared_ptr<PxyFileData>'s into a std::vector and then forget about the deallocation. I.e. fileMan.Close(...) should be done automatically when the objects aren't needed anymore. But since the deallocation isn't simply delete, how can I do this? Thanks! -- Daniel SBG AB

4 3

SUN sparc GNU 2.95.3 build fail
by Naeem ahmad 11 Apr '05

11 Apr '05

Hi all, I am getting this error when try to build on solaris, using g++, I am only using Class shared_ptr g++ -c -I/opt/sfw/lib/g++-include -I/usr/local/include -I/opt/sfw/lib/gcc-lib/sparc-sun-solaris2.8/2.95.3/include -I/usr/local/boost_1_32_0 console_app.cpp In file included from /usr/local/boost_1_32_0/boost/config.hpp:44, from /usr/local/boost_1_32_0/boost/shared_ptr.hpp:17, from console_app.cpp:7: /usr/local/boost_1_32_0/boost/config/stdlib/sgi.hpp:29: Invalid token in _expression In file included from /usr/local/boost_1_32_0/boost/config/platform/solaris.hpp:17, from /usr/local/boost_1_32_0/boost/config.hpp:53, from /usr/local/boost_1_32_0/boost/shared_ptr.hpp:17, from console_app.cpp:7: /usr/local/boost_1_32_0/boost/config/posix_features.hpp:51: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/posix_features.hpp:67: Invalid token in _expression In file included from /usr/local/boost_1_32_0/boost/config.hpp:57, from /usr/local/boost_1_32_0/boost/shared_ptr.hpp:17, from console_app.cpp:7: /usr/local/boost_1_32_0/boost/config/suffix.hpp:34: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:61: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:70: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:97: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:105: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:113: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:121: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:130: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:140: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:200: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:211: Invalid token in _expression /usr/local/boost_1_32_0/boost/config/suffix.hpp:226: Invalid token in _expression In file included from console_app.cpp:7: /usr/local/boost_1_32_0/boost/shared_ptr.hpp:264: Invalid token in _expression /usr/local/boost_1_32_0/boost/shared_ptr.hpp:271: Invalid token in _expression make: *** [console_app.o] Error 1 my cpp file is console_app.cpp #include <map> #include <boost/shared_ptr.hpp> using namespace std; using namespace boost; class mytest { public: mytest() { } ~mytest() { bool b = true; } }; int main() { map<int,shared_ptr<mytest> > m_map1; shared_ptr<mytest> p(new mytest); m_map1[1] = p; m_map1.clear(); return 0; } Thanks, Naeem AIRCOM to present OSS, Planning & Optimization products and services at the IIR Performance Measurement Conference, April 4-7th 2005, Budapest. Visit us at Booth 12. www.iir-conferences.com Disclaimer: The information contained in this e-mail, including any attachments to it, is confidential and intended only for the person(s) to whom it is addressed. Any examination, distribution, disclosure, printing, or copying of this information, or reliance upon this information by any person other than the intended recipient(s) is strictly prohibited. If this e-mail has been misdirected and you are not the intended recipient, please notify the sender immediately and delete this e-mail from your system. The views and opinions contained in this transmission represent those of the author and do not necessarily reflect those of AIRCOM International. AIRCOM International may monitor incoming and outgoing e-mails. By replying to this message, you consent to this monitoring. This e-mail has been scanned by McAfee Group Shield prior to transmission. However, recipients are advised to apply their own antivirus detection measures to this e-mail and any attachments upon receipt. AIRCOM International does not accept liability for any damage or losses arising as a result of receiving this e-mail.

2 1

smart_ptr question
by Serge Skorokhodov 11 Apr '05

11 Apr '05

Hi all, I've encountered a situation when destructors to local objects are not called after an exception is raised. I use Borland C++ version 5.6.4 (Borland C++Builder 6). The examples are compiled with following command to ensure that destructor cleanup is on: bcc32 -RT -x -xd -I<boost_include_path> boosttest.cpp bcc32 -RT -x -xd -I<boost_include_path> boosttest1.cpp The code is attached. Output of boosttest.cpp is: C:\buf\temp\ttt>boosttest1 A is created! Global shared_ptr<A> destroyed! A is created! Local A variable destroyed! A is created! auto_ptr<A> destroyed! A is created! scoped_ptr<A> destroyed! A is created! Local shared_ptr<A> destroyed! Access to global object through the local one! Global shared_ptr<A> destroyed! B is being created! scoped_ptr<A> destroyed! auto_ptr<A> destroyed! Local A variable destroyed! Exception cought: Too bad! Global shared_ptr<A> destroyed! Output of boosttest1.cpp is: C:\buf\temp\ttt>boosttest1 A is created! Global shared_ptr<A> destroyed! A is created! Local A variable destroyed! A is created! auto_ptr<A> destroyed! A is created! scoped_ptr<A> destroyed! A is created! Local shared_ptr<A> destroyed! Access to global object through the local one! Global shared_ptr<A> destroyed! B is being created! scoped_ptr<A> destroyed! auto_ptr<A> destroyed! Local A variable destroyed! Exception cought: Too bad! Global shared_ptr<A> destroyed! The problem is that the object created with the line "shared_ptr<A> spa(new A("Local shared_ptr<A> destroyed!"));" is destroyed in boosttest.cpp and is not destroyed in boosttest1.cpp. If shared_ptr is replaced with plain pointer, everything works fine (see boosttest2.cpp). I would appreciate explaining what's wrong in my code. TIA.

2 1

matrix<double> to double[][] conversion
by Simon Monckton 11 Apr '05

11 Apr '05

Hello all, I'm interested in passing the raw data of a BOOST matrix<double> through a CORBA transaction (mostly founded on simple data types).Given that I'm a newbie to BOOST, Is there a way to convert a BOOST matrix to a double[][] array without element-by-element assignment? -- --------------------------------------------------------------------- Dr. Simon Monckton Defence Scientist Tactical Vehicle Systems Section DRDC Suffield Defence Research and Development Canada Phone: (403) 544-4724 Email: Simon.Monckton(a)drdc-rddc.gc.ca ---------------------------------------------------------------------

1 0

Tuples and stringstream
by CodeLogic 11 Apr '05

11 Apr '05

Hi, I'm trying to use stringstreams in a tuple like fstream fin(filename.c_str(), ios_base::in); tuple<stringstream, stringstream, stringstream, stringstream> test; fin>>test; I also just tried declaring a variable of type: tuple<stringstream> test; However, both, in MS VC++ 7.0 give me the following error: c:\.....\include\boost-1_32\boost\tuple\detail\tuple_basic_no_partial_spec.hpp(190): error C2558: class 'std::basic_stringstream<_Elem,_Traits,_Alloc>' : no copy constructor available or copy constructor is declared 'explicit' with [ _Elem=char, _Traits=std::char_traits<char>, _Alloc=std::allocator<char> ] I'm basically looking for a solution of being able to stream tuples with strings in the them in and out of a file. Any suggestions will be appreciated. Thanks !

2 4

[BGL] Problem with counting paths/custom dfs_visitor
by Pete Donnell 11 Apr '05

11 Apr '05

Hi, I hope you will forgive me for asking a rather simple question. I have been having a lot of trouble writing a visitor for use in depth first search. The algorithm I'm attempting to write is supposed to count the number of different paths between two vertices on a directed graph. The graph may or may not contain cycles, and of course walks that contain cycles are not counted as paths. The way I've approached the problem is to induce a subgraph on the source and sink vertices, by copying the graph and then removing any vertices that do not lie on a path between the source and sink. My plan then is to do a depth first search on the induced subgraph, using a custom visitor that counts the number of forward or cross edges, which I think will be a count of the number of paths between the source and sink. To be honest, I haven't thought too hard about whether this is algorithmically correct, as the main problem is with the visitor. If I figure out to write custom visitors then it shouldn't be too hard to write other algorithms. As things stand, the function to induce a subgraph is working fine (although I am not using the Boost subgraph, mainly because it isn't documented in the book and so I didn't become aware of its existence until after I'd written the code). Incidentally, this function is useful in itself, which is why I have used it. I'm aware that it's not a very efficient way of solving the problem. The code I've written for the visitor to call on the path counting algorithm currently goes like this (I have slightly modified it a lot of times to try and get it to work): template<typename OutputIterator> class EnumeratorVisitor : public boost::dfs_visitor<OutputIterator> { private : long unsigned int pathCount; public : EnumeratorVisitor() : boost::default_dfs_visitor(), pathCount(1) {} EnumeratorVisitor(OutputIterator out) : boost::dfs_visitor<OutputIterator> (out), pathCount (1) {} long unsigned int getPathCount() const { return pathCount; } template <typename Graph, typename Edge> void forward_or_cross_edge(const Edge& e, const Graph& g) { ++pathCount; } }; The code where I use it looks like this: template<typename Graph> long unsigned int enumeratePaths(const Graph& graph, const typename boost::graph_traits<Graph>::vertex_descriptor& startNode,[BGL] problem with const typename boost::graph_traits<Graph>::vertex_descriptor& endNode) { typedef typename boost::graph_traits<Graph>::edge_descriptor Edge; std::vector<Edge> forwardOrCrossEdges; // vector used to store the forward or cross edges Graph* tempGraph = generateSubGraph(graph, startNode, endNode); // this function induces a subgraph as previously mentioned typedef boost::color_traits<boost::default_color_type> Colour; std::vector<boost::default_color_type> colourMap(boost::num_vertices(*tempGraph), Colour::white()); EnumeratorVisitor<typename std::back_insert_iterator<typename std::vector<Edge> > > edgeInserter(std::back_inserter(forwardOrCrossEdges)); depth_first_visit(graph, startNode, edgeInserter, boost::make_iterator_property_map(colourMap.begin(), boost::get(boost::vertex_index, *tempGraph)) ); return edgeInserter.getPathCount(); } I'm sure there are obvious errors in there to those who know what they're doing, but I've been looking at this problem for over a month now without success, so it's got to that stage where I don't really know what's going on anymore. I've hunted through the book, online code and so on, but I can't figure it out. It gives about three pages of template errors at the moment! There have been other minor variants, but all of them have given errors of some kind. If anyone can point out what I'm doing wrong, I'd greatly appreciate it. If more information is needed, I'll happily provide it. By the way, I'm sure that this problem of path counting has been approached before, it anyone has any insights to offer, I'd also appreciate that! Many thanks for your time, Pete

1 1

Bad adjacency_iterator with -O2, -m64 and gcc 3.2.2 on an opteron
by Michal Simecek 11 Apr '05

11 Apr '05

Hi, compiling and linking the following program on a opteron with the following command and the operating system red hat 3 (current enterprise server version) gcc-3.2.2 -c -I. -I../source -I./boost_1_32_0 -O2 -m64 boosttest.cc -o boosttest.o gcc-3.2.2 -m64 -o boosttest boosttest.o -lstdc++ will cause, that the program runs into an endles loop. I figured out, that the pointer in VIter which is compared when comparing VIter and VIterEnd is damaged. With a lot of differen gcc versions and also in 32 bit mode and with lower optimization it works fine. The problem is, I have to run it also compiled with gcc 3.2.2. Is it an optimization bug in the compiler or any mistake I made or a problem in the boost? I was looking for a hint on the net but without success. Can anybody help? Thanks ------------------------------------------------------------------------------- int main (int argc, char **argv) { typedef boost::adjacency_list < boost::listS, boost::listS, boost::undirectedS > my_graph2_t; my_graph2_t MyGraph2; boost::graph_traits<my_graph2_t>::vertex_descriptor MyVDescriptor; boost::graph_traits<my_graph2_t>::vertex_descriptor MyNextVDescriptor; MyVDescriptor = boost::add_vertex(MyGraph2); MyNextVDescriptor = boost::add_vertex(MyGraph2); boost::add_edge(MyVDescriptor, MyNextVDescriptor, MyGraph2); boost::graph_traits<my_graph2_t>::adjacency_iterator VIter; boost::graph_traits<my_graph2_t>::adjacency_iterator VIterEnd; tie(VIter, VIterEnd) = boost::adjacent_vertices(MyVDescriptor, MyGraph2); while ( VIter != VIterEnd ) { std::cout << "loop ..." << std::endl; ++VIter; } return 0; } --------------------------------------------------------------------------------

2 2

Re: You provide gun, I provide foot.
by C. Michailidis 10 Apr '05

10 Apr '05

> > Answer.. Don't take the examples at their face value Likewise. > > you can do this: > > > > class counter > > { > > public: > > counter() : guard(this->mutex) { > > this->count = 0; > > this->guard.unlock(); > > } > > void lock() { > > guard.lock(); > > } > > int increment() { > > assert(this->guard.locked()); > > return ++count; > > } > > void unlock { > > assert(!this->guard.locked()); > > this->guard.unlock(); > > } > > // ..Nothing to do here.. > > // ~counter() { > > // } > > > > private: > > boost::mutex mutex; > > boost::mutex::scoped_lock guard; > > int count; > > }; > > This is not equivalent to the above scenario. You can't have two threads > calling lock() at the same time, because a scoped_lock object (as currently > specified) is not thread safe (whereas a mutex is, by its very nature.) > Ugh, it would seem you are right Peter! Again, I quote the docs: "sharing a lock object between threads results in undefined behavior". Phooey! > > > class counter > > { > > public: > > counter() : count(0) { > > } > > void lock() { > > // nothing, methods act as self monitors > > } > > int increment() { > > boost::mutex::scoped_lock guard(this->mutex); > > return ++count; > > } > > void unlock { > > // nothing, methods act as self monitors > > } > > // ..Nothing to do here.. > > // ~counter() { > > // } > > > > private: > > boost::mutex mutex; > > int count; > > }; > > This is also not quite equivalent to the original. In it, a lock() op1() > op2() unlock() is a transaction; no other thread can inject its own op3 > between op1 and op2. Exactly - this is why I said "likewise" earlier, d-oh! > The closest you can get to the original, while somewhat respecting the > requirement for it to be callable from outside C++, is: > > scoped_lock * lock() > { > return new scoped_lock( mutex ); > } > > void unlock( scoped_lock * lock ) > { > delete lock; > } Although this respects the requirement that the code be callable from outside C++, it completely ignores the requirement that the COM interface (i.e. method prototype) should not change :-( Anyway, the last suggestion (changing the COM interface and returning a pointer to the scoped_lock) is probably the best I can do for now - I have indeed already considered this. The practitioner in me says it should be fine for my purposes. The theorist in me says I should keep moaning and groaning until someone truly feels my pain. soap_box->lock(); I've been making a stink largely because (IMHO) the decision to NOT expose functionality as fundamental as mutex.lock() and mutex.unlock() seems ridiculous! The boost library and accompanying docs should absolutely encourage the use of scoped_locks - I agree 100%. But it certainly shouldn't *disallow* me from using mutexes in the traditional way - to me this is a shortcoming. Even if there is some kind of overly complicated way (perhaps by deriving from mutex and calling some protected lock/unlock methods) I still think lock/unlock functionality should be exposed by mutex objects. Did you ever hear of the expression "you've polished the brass right off of the hinges"? This honestly seems like arrogance on the boost development team's part - why do they know how to use mutexes so much better than the rest of us? What am I, chopped liver over here? It is belittling! I'm not a child, whaaaaa!!!! ;-) There is little sense in going to such extreme lengths to protect developers from themselves - after all they are the ones writing the programs! Believe me, I would love to live to see the day that I simply install the Boost libraries and BINGO by some stroke of genius the program I intended to write is already done. I have a feeling it will be some time before this happens, until then my gun should shoot bullets wherever I point it, and I should be allowed to point it wherever I want (not where the boost developers THINK it should be pointed, but where I KNOW it should be pointed). As they say, "guns don't kill people, people kill people", lol. soap_box->unlock(); Just my 2 cents, C. Michailidis

4 4

Re: You provide gun, I provide foot.
by C. Michailidis 10 Apr '05

10 Apr '05

> Whining won't take you far on this list, sorry. Call it arrogance, call it > indifference, whatever -- don't forget that Boost authors have volunteered > enormous amounts of their own time. Seriously, you have the boost source, if > you don't like the implementation of something in threads go change it and > propose it. Or just use it for yourself. That will get you much further than > soapbox grandstanding any day... > > BTW, I think the question of what to expose was discussed in the library > review, so you might search back thru the mailing lists. Also you should know > that the original threads author has disappeared and the new maintainer is > pretty busy -- so I'd say threads is somewhat undersupported at the moment... > > Jeff Yeah, I've got to agree - you make good points here! However, you have to admit, ranting and raving will (occasionally) make you FEEL better, LOL. In any case, the boost libs still rock! Maybe I'll dig a little deeper and make a proposal; after April 15th of course! Cheers, Dino P.S. Thanks to everyone who put up w/ my moaning and groaning. I just wanted to make sure I wasn't overlooking something dumb, which I will do every now and again ;-)

1 0

Re: You provide gun, I provide foot.
by C. Michailidis 10 Apr '05

10 Apr '05

> do have models. What prevents you from using say, the > boost::mutex::scoped_lock model? (Which has the lock/unlock calls.) Perhaps my initial mailing was too general. I'll try to state my problem more specifically. The following url, http://www.boost.org/libs/thread/example/mutex.cpp , gives an example of how mutexes and scoped_locks are typically used. The counter class shows how an atomic counter is implemented. For completeness I'll copy and paste part of the example into my email, here's the class: class counter { public: counter() : count(0) { } int increment() { boost::mutex::scoped_lock scoped_lock(mutex); return ++count; } private: boost::mutex mutex; int count; }; As I understand it, a thread calling the 'increment' method will be blocked until any other thread that has already called 'increment' has returned from the method call (more or less). When the scoped_lock object is instantiated its constructor locks the mutex until the scoped_lock goes out of scope (at which time the destructor of scoped_lock unlocks the mutex enabling other threads to reach the body of increment). This is all fine and dandy. My problem is that I have an existing COM component which is more similar to: // please excuse the MSFT parlance class counter { public: counter() : count(0) { mutex=CreateMutex(NULL, false, NULL); } void lock() { WaitForSingleObject(mutex, INFINITE); } int increment() { return ++count; } void unlock { ReleaseMutex(mutex); } ~counter() { CloseHandle(mutex); } private: unsigned long mutex; int count; }; When using the COM component the caller is required to call 'lock' before calling any other methods (in this case 'increment'), when you are finished using the component you must call 'unlock'. So... here's my problem, how can I use Boost.Threads to create the same kind of functionality without changing my COM interfaces? Remember that this is just for illustration so my sample code may need changes before compiling ;-) In any case, the actual component is more sophisticated than the simple example I gave, and could actually be called from a language other than C++ (e.g. Visual Basic). AFAIK boost mutexes must be locked using scoped_locks and it would seem that they aren't appropriate for my situation. I can certainly appreciate the benefits of scoped_locks (esp. in a homogeneous environment where all code is written in C++). It just seems silly to force the user to use ONLY scoped_locks when in some situations the additional requirements they have make them unusable. Sure, most of the time the mutex should be unlocked at the end of the block... however when the critical section is composed of code written in more than one language or in a more dynamic algorithm it may easier to unlock it elsewhere, no? Perhaps this is an issue more appropriate for the boost-devel list... but, if there really isn't a way to simply lock/unlock a mutex I think it is awefully rude and arrogant of the developers considering the fact that more straight-forward multi-threaded IPC mechanisms have been around for quite some time and programmers have been able to use them effectively without much trouble. It's my opinion that a great toolkit not only provides robust and sophisticated facilities but *ALSO* gives the developer enough 'rope to hang themselves'. After all, isn't the freedom to shoot yourself in the foot one of the major advantages of writing code in C/C++? I use the Boost library not only to add functionality to my software but to act as a common API in cross-platform environments. Nearly every modern API supports some kind of fundamental lock/unlock mechanism for mutexes, why shouldn't boost? And yes, to answer one of the replys... I am not being forced to use boost, in this case it seems as though I can't! It would be nice however, since I'm using other Boost modules in the project. In summary, since "Lock concepts are the only way to lock and unlock a mutex object: lock and unlock functions are not exposed by any Boost.Threads mutex objects", it seems as though I'm left out in the cold! Any suggestions? Any boost developers reading this? Anyone feel my pain? Am I just being blindly stubborn? LOL, Dino

3 3

Heterogenous properties
by Martin Jynge 10 Apr '05

10 Apr '05

Hi. I'm trying to develop a (bidirectional) graph whose edges contain a property Value, which is a baseclass with different inherited classes dependent upon the type of vertex they are connected to. I attach a pointer to a base class Node to each vertex - the node containing only a virtual method called from a designated parsing algorithm. This method needs to access the Value leafclasses of the vertex's outedges. For example, a particular vertex receives a double from one outedge and a struct xy {double x,y; } from another, does some operation and stores, say, a complex number in a relevant inedge. In essense it's kind of like genetic programming with multiple parents and multiple value types. I would really like to avoid using dynamic_cast in dispatching edge Value descendants. Any thoughts on this?

1 0

BOOST_CHECK_EQUAL compiler warning
by shopper11＠cfl.rr.com 09 Apr '05

09 Apr '05

I get a compiler warning when using BOOST_CHECK_EQUAL in conjunction with BOOST_AUTO_UNIT_TEST. The code and warning are below. Anyone know what I'm doing to cause the warning? Environment: Windows XP with MS VS 2003 #define BOOST_AUTO_TEST_MAIN #include <boost/test/auto_unit_test.hpp> class MyTest { public: MyTest( int newVal = 3 ) : a (newVal) {} int GetA() {return(a);} protected: int a; }; MyTest test1; // _____________________________________ BOOST_AUTO_UNIT_TEST( TestCase1 ) { int b = test1.GetA(); BOOST_CHECK_EQUAL( b, 1 ); } The warning is: c:\Boost\include\boost-1_32\boost\test\detail\wrap_stringstream.hpp(69) : warning C4267: 'argument' : conversion from 'size_t' to 'unsigned int', possible loss of data c:\Boost\include\boost-1_32\boost\test\test_tools.hpp(435) : see reference to function template instantiation 'boost::basic_wrap_stringstream<CharT> &boost::operator <<<char,size_t>(boost::basic_wrap_stringstream<CharT> &,const T &)' being compiled with [ CharT=char, T=size_t ] m:\jclaybau_InWork_view\CHAMELEON\SoftwareDevelopmentFolder\Source\AM\Test\AMTest\AMTest.cpp(20) : see reference to function template instantiation 'bool boost::test_tools::tt_detail::equal_and_continue_impl<int,int>(const Left &,const Right &,boost::wrap_stringstream &,boost::test_tools::const_string,size_t,boost::unit_test::log_level,size_t)' being compiled with [ Left=int, Right=int ]

2 1

Followup to KCC compile error
by Stephen Gross 09 Apr '05

09 Apr '05

To review: > When including "boost/iterator/indirect_iterator.hpp", I get: > > "/usr/local/sagedev/apis/include/boost_1_32_0/boost/detail/is_incrementable.hpp", > line 56: error: > > expression must have arithmetic, enum, or pointer type > > BOOST_STATIC_CONSTANT( > ^ Some new thoughts upon investigation: It is not in the BOOST_STATIC_CAST. Doing manual compiler preprocessing has resulted in the following code, which is what the compiler is complaining about: template <class T> struct impl { static typename remove_cv<T>::type& x; static const bool value = sizeof(is_incrementable_::check(++x,0)) == 1; }; The problem is the ++x, not the static cast. The problem seems to be a question of that x variable. If I replace the typename of x with, say int&, it works with one additional modification (see below), and if I replace it with a non-incrementable object, say 'foo', that also works. My theory was it might be in the remove_cv, but replacing the type with T& does not work. We still get the 'must be of XXX' type message despite T being known to be a type. So, it would seem to be something about the templates. I'm stuck at this point. What I had to do to make known types work: With known types (int, foo), the compile only works when I add an additional set of parentheses around the ++x,0 in the check. I assume this is an order of evaluations thing, to make certain the comma operator is processed before the check function, which since all versions of check are single argument, I assume is the intent here. --Steve (sgross(a)darwin.cwru.edu)

2 1

potential bugs in BGL function "brandes_betweenness_centrality()"
by Qiaofeng Yang 09 Apr '05

09 Apr '05

Hi, I use g++ (GCC) 3.2.2 20030222 (Red Hat Linux 3.2.2-5). What I did is as follows: ===================================================================== 1. Use "brandes_betweenness_centrality()" to calculate the vertex betweenness centrality for all the vertices in the graph. 2. Find the vertex with the highest betweenness value. 3. Delete the vertex from the graph. 4. Repeat step 1 until no vertex left in the graph. ===================================================================== The code is sketched as follows: ======================================================================== typedef property<vertex_name_t, string> VertexName; typedef property<vertex_index_t, int, VertexName> VertexProperty; typedef property<edge_index_t, int> EdgeProperty; typedef adjacency_list<listS, listS, undirectedS, VertexProperty, EdgeProperty> Graph; Graph G; //load graph ... while(num_vertices(G)>0) { int V = num_vertices(G); vector<double> vertex_centrality(V); brandes_betweenness_centrality(G, make_iterator_property_map(vertex_centrality.begin(), get(vertex_index, G), double())); //print the vertex betweenness centrality for all the vertices ... //find the index of the vertex with the highest betweenness centrality ... clear_vertex(...); remove_vertex(...); } ======================================================================== The above code is run on a graph with 8 vertices and 9 edges. Below is the edge list representation of my graph: node0 node4 node0 node1 node0 node2 node0 node3 node1 node2 node2 node3 node4 node5 node4 node6 node4 node7 The problem is as follows: 1. Extremely slow. The first iteration is fast, but you have to wait for a long time before the results of the second iteration to print out. 2. After several iterations, the vertex name printed out is wrong. (In my graph, at the third iteration, the vertex name is printed out wrong) 3. When there are two vertices and no edges in the graph, the program stops printing out anything, basically freezes there. >From my previous experience with BGL, the subgraph function has similar problem. When I create a subgraph from a graph, everything is inherited correctly, including vertex names, edges, etc. When I try to create a subgraph from the subgraph from the previous step, I get segmentation fault when trying to print out vertex names. I think there may be some bugs in the source files dealing with the graph structure modification. Best regards, Qiaofeng

2 1

a question about the vertices in boost graph libary (BGL)
by Vivid Yang 08 Apr '05

08 Apr '05

Hi, I saw all the BGL examples begin with enumeration: // Make convenient labels for the vertices enum { Amherst, Boston, City, Denver, Egypt, Niagara }; So it is convenient to access properties, for example: distance(Boston) = 50; //distance is a property of vertices The problem is that I have to build my graph incrementally and might have to remove some vertices later. So enumeration does not work for me. When I want to set distance(Boston) = 50, I have to find the descriptor for "Boston" first, (It takes O(n) to traverse all the vertices). It is too expensive for a large graph. Is there anyway I can skip this step? I am thinking add a hash table, which maps each city to a descriptor. I have to update the hash table whenever I remove vertices. It is inconvenient neither. Do I think it in the right way? Any suggestions? Thanks a lot. Vivid

2 2

I can't link Boost Thread library
by Ivan Makale 08 Apr '05

08 Apr '05

I tried to use the Boost Thread library with Windows and VC++ 7.1 (.NET IDE) and STLPort-4.6.2 but I didn't succeed. I tried with: - boost jam - generating a DLL from a new project directly in the IDE (dynamic linking) - including the sources in the exe project (static linking) The static linking gives me an error with "tss_cleanup_implemented", which is not accidental but wanted by the developers ("This function's sole purpose is to cause a link error..."), while the dinamyc linking gives me another error: "TestPalantirWrapper error LNK2019: unresolved external symbol "public: __thiscall boost::thread::thread(class boost::function0<void,class _STL::allocator<class boost::function_base> > const &)" (??0thread@boost@@QAE@ABV?$function0@XV?$allocator@Vfunction_base@boost@@@_STL@@@1@@Z) referenced in function _main" (it was th thread.cpp example). A strange thing happens with dynamic linking: using "BOOST_LIB_DIAGNOSTIC", I get the message "Linking to lib file: libboost_thread-vc71-mt-sgdp-1_32.lib" , beginning with "lib", and not the dynamic one (without "lib"). In particular, generating a DLL from the IDE from the the source files: (1) requires the library libboost_thread-vc71-mt-sgdp-1_32.lib (why?) (2) doesn't generate an import library (".lib") but only the .dll Thank you, Ivan Makale __________________________________________________________________ Tiscali Adsl 3 Mega Flat con 3 MESI GRATIS! Con Tiscali Adsl 3 Mega Flat navighi con la Supervelocita' a soli 29.95 euro al mese, senza limiti di tempo. E se attivi entro il 15 Aprile, 3 MESI sono GRATIS! Scopri come risparmiare navigando veloce, su http://abbonati.tiscali.it/adsl/sa/2flat_tc/

2 1

You provide gun, I provide foot.
by C. Michailidis 08 Apr '05

08 Apr '05

Quoting from http://www.boost.org/doc/html/threads/concepts.html#threads.concepts.mutexes "Many C++ threading libraries use a pattern known as Scoped Locking[SchmidtStalRohnertBuschmann] to free the programmer from the need to explicitly lock and unlock mutex objects. With this pattern, a Lock concept is employed where the lock object's constructor locks the associated mutex object and the destructor automatically does the unlocking. The Boost.Threads library takes this pattern to the extreme in that Lock concepts are the only way to lock and unlock a mutex object: lock and unlock functions are not exposed by any Boost.Threads mutex objects. This helps to ensure safe usage patterns, especially when code throws exceptions." Unfortunately, I actually WANT to shoot myself in the foot this time and Boost.Threads won't let me!!! I can understand ENCOURAGING users to write safe code, but forcing them to is outright fascist! My problem is that I have existing code which I would like to make more portable by using Boost.Threads. Now, this wouldn't be a problem except for the fact that I'm (effectively) dealing w/ a COM object that already has its interface defined. There must be millions of lines of code which won't be able to get a minor face-lift because "lock and unlock functions are not exposed". Since when is ensuring safe usage more important than providing common functionality? Ugh, Dino

6 10

random_demo.cpp doesn't work with VC++6.0?
by Vivid Yang 08 Apr '05

08 Apr '05

Hi, I failed to compile random_demo.cpp (www.boost.org/libs/random/random_demo.cpp) with VC++6.0 under WINXP sp2. I have attached the error message below. (I have installed VC++6.0 service pack 4,5 and 6.) Could anybody help? Examples of using boost::random will help too, such as uniform_01 and normal_distribution, etc. Thanks a lot. Vivid (test2.cpp is random_demo.cpp) e:\shared\boost_1_32_0\boost\random\detail\ptr_helper.hpp(29) : error C2529: '<Unknown>' : reference to reference is illegal e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(32) : see reference to class template instantiation 'boost::random::detail::ptr_helper<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\ptr_helper.hpp(30) : warning C4181: qualifier applied to reference type ignored e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(32) : see reference to class template instantiation 'boost::random::detail::ptr_helper<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\ptr_helper.hpp(30) : error C2529: '<Unknown>' : reference to reference is illegal e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(32) : see reference to class template instantiation 'boost::random::detail::ptr_helper<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\ptr_helper.hpp(31) : error C2529: '<Unknown>' : reference to reference is illegal e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(32) : see reference to class template instantiation 'boost::random::detail::ptr_helper<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\ptr_helper.hpp(32) : warning C4181: qualifier applied to reference type ignored e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(32) : see reference to class template instantiation 'boost::random::detail::ptr_helper<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\ptr_helper.hpp(32) : warning C4181: qualifier applied to reference type ignored e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(32) : see reference to class template instantiation 'boost::random::detail::ptr_helper<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\ptr_helper.hpp(32) : error C2529: '<Unknown>' : reference to reference is illegal e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(32) : see reference to class template instantiation 'boost::random::detail::ptr_helper<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\ptr_helper.hpp(32) : error C2529: '<Unknown>' : reference to reference is illegal e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(32) : see reference to class template instantiation 'boost::random::detail::ptr_helper<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(33) : error C2039: 'result_type' : is not a member of '`global namespace'' e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(33) : error C2146: syntax error : missing ';' before identifier 'result_type' e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(33) : error C2868: 'result_type' : illegal syntax for using-declaration; expected qualified-name e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(42) : error C2529: '<Unknown>' : reference to reference is illegal e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(43) : warning C4181: qualifier applied to reference type ignored e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\detail\pass_through_engine.hpp(43) : error C2529: '<Unknown>' : reference to reference is illegal e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(90) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &>' being c ompiled E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(104) : error C2529: '<Unknown>' : reference to reference is illegal E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(105) : warning C4181: qualifier applied to reference type ignored E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(105) : error C2529: '<Unknown>' : reference to reference is illegal E:\temp\test2\test2.cpp(71) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_real<double> >' being compiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(104) : error C2529: '<Unknown>' : reference to reference is illegal E:\temp\test2\test2.cpp(116) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_int<int> >' being compiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(105) : warning C4181: qualifier applied to reference type ignored E:\temp\test2\test2.cpp(116) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_int<int> >' being compiled e:\shared\boost_1_32_0\boost\random\variate_generator.hpp(105) : error C2529: '<Unknown>' : reference to reference is illegal E:\temp\test2\test2.cpp(116) : see reference to class template instantiation 'boost::variate_generator<class boost::random::linear_congruential<long,48271,0,2147483647,399268537> &,class boost::uniform_int<int> >' being compiled E:\temp\test2\test2.cpp(124) : error C2679: binary '<<' : no operator defined which takes a right-hand operand of type 'class boost::random::linear_congruential<long,48271,0,2147483647,399268537>' (or there is no acceptable conversion) Error executing cl.exe.

3 3

Installation issue
by Micha Bieber 07 Apr '05

07 Apr '05

Hi, group After some years staying away from boost, I installed the 1.32 release. The system was WinXP with VC6. I used the .exe variant. Take the following as remarks from an innocent, also if some of the issues seem to be trivial. Even though, I'm a C++ developer for more than 10 years now. I have used literally thousends of programs and libraries and I know, how quickly someone decides to skip the usage of software completely, simply because the installation becomes too strenous. The story: The exe is in fact an archive. This should be stated, because it suggests some form of installer. Starting with bjam "-sTOOLS=msvc" stage first of all I got without bigger (*) problems a bulk of single/multi-threaded/whatever_other_configured libraries. So my next wish was to reduce the diversity. I deleted the stage directory and went on.. The doc states the usage of thread flags (-mt) but I was unable to set up a command line intuitively to build only multi-threaded release versions. One (!) example line should provide a recipe to solve this problem. I guess this is possible, after looking in Boost.Build. The next point is, I need in fact only the BGL. So I tried: v:\src\boost_1_32_0>bjam "-sTOOLS=msvc" --with-graph stage --------------------------------------------------------------------- skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "c:/tools/python/include" You can configure the location of your python installation by setting: PYTHON_ROOT - currently "c:/tools/python" PYTHON_VERSION - The 2-part python Major.Minor version number (e.g. "2.2", NOT "2.2.1") - currently "2.2" The following are automatically configured from PYTHON_ROOT if not otherwise set: PYTHON_LIB_PATH - path to Python library object; currently "c:/tools/python/libs" --------------------------------------------------------------------- don't know how to make stage ...found 1 target... ...can't find 1 target... v:\src\boost_1_32_0> I dont't know, if the python configuration/message is really necessary. Maybe an existing python installation can be found (I have an ActivePython here). But the the last 3 lines are completely meaningless. What shall I do with it ? A command line error ? A problem with graph's dependencies ? Something else ? msvc specific: The library as a heavily template-loaded piece of software should IMO suppress warning 4786 at least in their own implementation files. This makes it easier to spot errors during the installation run. Generally I lack information regarding dependencies for the single libraries. This should be part of the documentation (a must IMO, some accentuated doxygen graphs for the include hierarchy would be very helpful). Boost contains so many different things, and many people don't need all this stuff. It was absolutely no problem in the past, to install BGL (or its predecessor) by simply copying the header (neglecting for the moment the graphviz) interface. IMO, this should be possible further on, maybe some additional helper like iterator. But it should be documented ! Many people prefer lightwight libraries and it seems also current versions of boost _can_ be configured this way (with som acceptable manual adjusting). So a bit emphasis on these things yet in the doumentations "Getting started" section at a would be a nice thing (tm) and raise the libraries acceptance for new users. (*) ...failed updating 24 targets... ...skipped 48 targets... ...updated 1051 targets... Micha --

4 10

Re: Another KCC issue...
by Stephen Gross 07 Apr '05

07 Apr '05

>> When including "boost/iterator/indirect_iterator.hpp", I get: >> >> "/usr/local/sagedev/apis/include/boost_1_32_0/boost/detail/is_incrementa >> ble.hpp", >> line 56: error: >> >> expression must have arithmetic, enum, or pointer type >> >> BOOST_STATIC_CONSTANT( >> >> ^ >> >> "/usr/local/sagedev/apis/include/boost_1_32_0/boost/detail/is_incrementa >> ble.hpp", > > Please try compiling with -DBOOST_NO_INCLASS_MEMBER_INITIALIZATION and let me know if that helps. If that works, I'll know just what fix to make. Alas, it still produces the same error message... --Steve

4 4

boost::filesystem -- "invalid name" error
by Matthias Kaeppler 07 Apr '05

07 Apr '05

Hello, I'm using the boost filesystem library to implement a gtkmm widget which represents a view on the local filesystem. However, while browsing through the files (they are displayed in a TreeView), the application now and then crashs with the following error message: [mkay][~/devel/projects/fb]: ./fb.elf glibmm-ERROR **: unhandled exception (type std::exception) in signal handler: what: boost::filesystem::path: invalid name "lost+found" in path: "lost+found" aborting... Aborted Of course the path names differ, but lost+found is a typical directory found on Linux machines, so this is a representative example for the error I guess. I have no idea what is causing this, any ideas?

1 1

string_algo split iterator
by Martin 07 Apr '05

07 Apr '05

I have a problem with the string_algo split_iterator. Background is that I have a function that finds a string in a range of other strings. template <typename CollectionT, typename RangeT, typename PredicateT> inline unsigned int find_first_in_range(const CollectionT& Input, const RangeT& Search, PredicateT Comp) { typename boost::range_const_iterator<RangeT>::type first = boost::begin(Search), last = boost::end(Search); for (unsigned int index = 1; first != last; ++first, ++index) if (Comp(Input, *first)) return index; return 0; } This function works fine if I send in a std::vector like std::vector<std::string> vec; vec.push_back("Item1"); vec.push_back("Item2"); find_first_in_range(std::string("Item2"), vec, equals_pred()); equals_pred is just a functor version of the equals predicate that don't require the template arguments struct equals_pred { template<typename T1, typename T2> bool operator()(const T1& arg1, const T2& arg2) const { return boost::equals (arg1, arg2); } }; But if I do the same thing with the split_iterator find_first_in_range( std::string("item2"), make_split_iterator( std::string("Item1,Item2,Item3,Item4"), first_finder(",") ), iequals_pred() ); I get an error (VC70) boost\range\detail\const_iterator.hpp(34) : error C2039: 'const_iterator' : is not a member of 'boost::algorithm::split_iterator<IteratorT>' with [ IteratorT=boost::range_result_iterator<std::basic_string<char,std::char_traits< char>,std::allocator<char>>>::type ] boost\range\detail\const_iterator.hpp(118) : see reference to class template instantiation 'boost::range_detail::range_const_iterator_<T>::pts<C>' being compiled with [ T=boost::range_detail::std_container_, C=boost::algorithm::split_iterator<boost::range_result_iterator<std::basic_stri ng<char,std::char_traits<char>,std::allocator<char>>>::type> ]

1 1

How to install only a few libraries
by Marcel Loose 07 Apr '05

07 Apr '05

Hi, Maybe I haven't searched well enough in the installation docs, but I couldn't find an answer to the following. Is is possible to install only one or two libraries. For example, suppose I only want to use boost::smart_ptr. How can I arrange that only the files I really need are being downloaded and installed? Nothing more, nothing less? I've seen the option to bjam --with-<library>, but that only works for libraries, not for header files. When I do an install, I still get all the header files copied to my install directory. Regards, Marcel Loose.

2 1

question of program_options : validator function
by Suresh T 07 Apr '05

07 Apr '05

hello boosters, An old boost library that i was using, provided a validator function (in the value_sematic.hpp file) that could be used for creating user defined parsers and it was handy The signature was something like : void validator<T, char>::operator() (any& v, const std::vector<std::string>& xs); I had a working code that used it and when i tried to recompile my old code with a new boost release it did not compile. I then realized that the validator function is no longer there. Can someone please let me know if this has been substituted by something else (what?) or what i would have to use now in such cases. Thanks in advance. --------------------------------------------------------------------------------------------------------- Warm Regards, Suresh.T ---------------------------------------------------------------------------------------------------------

2 2

minor "enhancement" (?) to boost/test/auto_unit_test.hpp
by Oliver Schoenborn 07 Apr '05

07 Apr '05

I like the auto test feature of Boost.test because it's quick and simple to use. Unfortunately, when BOOST_AUTO_TEST_MAIN is #define'd, the auto suite name is hardcoded. Changing auto_unit_test.hpp so user can, *if desired*, change it, can be done with following patch: $ diff -u ~/downloads/boost_1_32_0/boost/test/auto_unit_test.hpp /c/Boost/inclu de/boost-1_32/boost/test/auto_unit_test.hpp --- boost_1_32_0/boost/test/auto_unit_test.hpp Mon Jul 19 09:12:40 2004 +++ /c/Boost/include/boost-1_32/boost/test/auto_unit_test.hpp Wed Apr 6 12:46:07 2005 @@ -19,6 +19,10 @@ // Boost.Test #include <boost/test/unit_test.hpp> +#ifndef BOOST_AUTO_TEST_SUITE_NAME +#define BOOST_AUTO_TEST_SUITE_NAME "Auto Unit Test" +#endif + // ************************************************************************** // // ************** auto_unit_test_registrar ************** // // ************************************************************************** // @@ -27,10 +31,17 @@ namespace unit_test { namespace ut_detail { +inline const char* +suiteName(const char* name = NULL) +{ + return name ? name : BOOST_AUTO_TEST_SUITE_NAME; +} + inline boost::unit_test::test_suite* auto_unit_test_suite() { - static boost::unit_test::test_suite* inst = BOOST_TEST_SUITE( "Auto Unit Test" ); + static boost::unit_test::test_suite* inst + = BOOST_TEST_SUITE( suiteName(BOOST_AUTO_TEST_MAIN) ); return inst; } This allows you to do any of: 1) Like current (default suite name is "Auto Unit Test"): #define BOOST_AUTO_TEST_MAIN 2) Change from default suite name to what you want: #define BOOST_AUTO_TEST_MAIN "Your suite name" 3) Same, but doesn't "overload" the BOOST_AUTO_TEST_MAIN: #define BOOST_AUTO_TEST_MAIN #define BOOST_AUTO_TEST_SUITE_NAME "Your suite name" This enhancement maintains backward compatibility but allows automated test suites to be distinguishable. Oliver

2 1

Regex trouble (compiling a simple expression fails)
by Bogdan Harjoc 06 Apr '05

06 Apr '05

Hi, I've looked at replacing the pcre library with boost regex,mainly because the C++ interface seems more usable than the plain C functions from pcre. The trouble is, I'm wasn't able to adjust regular expressions to the format boost regex uses. For instance, while pcre and others seem to like the expression "\?", boost throws bad_expression. The same goes for "\(", "\+" and others I'm using. So, I suppose the question is, is there a flag that can be set for the regex constructor that enables compatibility with a certain regex specification or should the regexp I gave as an example not be accepted ? Any hints would be kindly appreciated. Thanks, Bogdan.

3 3

is_same_impl
by Gottlob Frege 06 Apr '05

06 Apr '05

template <typename T> ::boost::type_traits::yes_type BOOST_TT_DECL is_same_tester(T*, T*); ::boost::type_traits::no_type BOOST_TT_DECL is_same_tester(...); template <typename T, typename U> struct is_same_impl { static T t; static U u; BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< (sizeof(type_traits::yes_type) == sizeof(detail::is_same_tester(&t,&u))), (::boost::is_reference<T>::value == ::boost::is_reference::value), (sizeof(T) == sizeof(U)) >::value)); }; Would it be any better to do is_same_tester with just one arg, like this: template <typename T> ::boost::type_traits::yes_type BOOST_TT_DECL is_same_tester(T*); template <typename T> ::boost::type_traits::no_type BOOST_TT_DECL is_same_tester(...); and then the call is:. (sizeof(type_traits::yes_type) == sizeof(detail::is_same_tester<T>(&u))), (and then not need a 'static T t' at all?) And does it make any difference to declare the U as a pointer: static U *u; // and/or leave off the static and then not pass it in by address: (sizeof(type_traits::yes_type) == sizeof(detail::is_same_tester<T>(u))), Or not bother with a U at all, but just cast 0 into a U*: (sizeof(type_traits::yes_type) == sizeof(detail::is_same_tester<T>(static_cast(0)))), Or does none of it really make a difference? And while I am at it, what would the value of 'same' be: struct A { int x; }; struct B : A; static bool same = boost::type_traits::is_same<A, B>::value; I suspect same == true, as B is castable to an A, and sizeof(B) == sizeof(A). checking both is_same_tester<T>(u) and is_same_tester(t) might be better?

3 2

[Regex] Is it possible to assign an alias to a subexpression (to use later instead of its index)?
by jordi 06 Apr '05

06 Apr '05

Hi, I would like to know if it's possible to assign an alias/name to a sub-expression. When using short regex there is no problem nor confusion but when using a long regex then I get lost looking at the correct index to use. It would be much easier if I can assign an alias. So, instead to use a regex like this: "\s*(\d+)\s+(\d+)\s+(\d+)\s+" I would like to be able to use something like: "\s*([$VALUE1]\d+)\s+([$VALUE2]\d+)\s+([$VALUE3]\d+)\s+" I don't know if this feature exists in regex but I haven't found it but maybe I dind't know where to find... Thanks in advance, Jordi

5 9

mpl, for_each, KCC incompatibility
by Stephen Gross 06 Apr '05

06 Apr '05

Hi all... I have a file that includes 'boost/mpl/for_each.hpp'. When compiled with KCC 4.0 on an x86 machine running Redhat Linux (8, I think), I get the following compile error: "boost_1_32_0/boost/mpl/aux_/preprocessed/no_ttp/arg.hpp", line 27: error: more than one instance of overloaded function "boost::mpl::assert_not_arg" matches the argument list: function template "mpl_::assert_not_arg(void (*)(Pred), mpl_::assert_arg_pred<Pred>::type)" function template "mpl_::assert_not_arg(void (*)(Pred), mpl_::assert_arg_pred_not<Pred>::type)" argument types are: (void (*)(boost::mpl::is_na<U1>), int) BOOST_MPL_AUX_ASSERT_NOT_NA(type); Any ideas? Troubleshooting this one is a bit beyond my abilities... Thanks, --Steve (sgross(a)darwin.cwru.edu)

2 1

enable_if and constructors
by Angus Leeming 05 Apr '05

05 Apr '05

I see examples of enable_if used to specify a return type to a function: template <class T> typename enable_if_c<boost::is_arithmetic<T>::value, T>::type foo(T t) { return t; } Is it possible to use enable_if with a constructor? For example, I'd like to define a constructor that allows only certain values of an enum: #include <boost/utility/enable_if.hpp> class foo { public: enum state { state1, state2, state3 }; // This should compile only when passed (s == state2 or s == state3) template<int ID> foo(boost::enable_if_c<some_boolean_condition, state>::type s) : status_(s) {} private: state status_; }; Even if this turns out to be impossible, I'd like to go on and try to define some_boolean_condition if I may. I see that Aleksey plans a contains_c metafunction for 1.33, http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?MPL_TODO_List Equivalent URL: http://tinyurl.com/4toly so my limited understanding leads me to some_boolean_condition is equivalent to: mpl::contains_c< mpl::vector_c< int, state2, state3 >, ID >::value Does that look correct? In the absence of contains_c, I've been trying to use mpl::find_if but my predicate compiles for both "valid" and "invalid" values, so I must be doing something wrong. I'd be grateful if someone could put me back on track. Regards, Angus #include <boost/type_traits/is_same.hpp> #include <boost/mpl/assert.hpp> #include <boost/mpl/end.hpp> #include <boost/mpl/equal_to.hpp> #include <boost/mpl/find_if.hpp> #include <boost/mpl/lambda.hpp> #include <boost/mpl/integral_c.hpp> #include <boost/mpl/not.hpp> #include <boost/mpl/vector_c.hpp> class foo { public: enum state { state1, state2, state3 }; }; int main() { // Should lead to a compile-time failure. #define TESTED_VALUE foo::state1 // Should compile. // #define TESTED_VALUE foo::state2 namespace mpl = boost::mpl; typedef mpl::vector_c< int, foo::state2, foo::state3 > allowable_values; typedef mpl::find_if< allowable_values, mpl::equal_to< mpl::_1, mpl::integral_c<allowable_values::value_type, TESTED_VALUE> > >::type iter; BOOST_MPL_ASSERT(( mpl::not_< boost::is_same< iter::type, mpl::end<allowable_values>::type > > )); return 0; }

2 6

Re: [Boost-users] Filesystem woes
by Sean DeNigris 05 Apr '05

05 Apr '05

I got the posted code to pass with VC7.1, /MDd and /Zc:wchar_t.

2 1

boost::bind() compiler error in MS VC++6.0
by Vivid Yang 05 Apr '05

05 Apr '05

Hi, I have experienced an unexpected compiler error when I tried to use boost::bind(): include\boost\bind\arg.hpp(26) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information The code has been successfully comipled, linked and run under linux. But it failed to compile with MS VC++6.0 under WinXP SP2. I have installed MS VC++ service pack 4, 5 and 6. The project is set to "Debug MultiThreaded". The project option is "/nologo /MTd /W3 /Gm /GX /ZI /Od" . Turning on/off precompiled header file does not help neither. I have googled the problem and tried several ways to solve it. Still no luck so far. Could anybody help? Thanks a lot Vivid

2 1

unordered_map has no lower_bound?
by Martin Wartens 05 Apr '05

05 Apr '05

Hi, I am already using the unordered_map implementation from the file vault. I have got some problems with unordered_map, because it offers no "lower_bound" (it is not a problem of the implementation, it is simply not in the specs). My question is, why is that so and what can I do about it? The use case is an efficient insert when I have to take special actions when the key is already in the container. For a map this would work like: iter = lower_bound(key); which gets the first element greater or equal to key Now I can check if the key is already in the map and execute some action to handle this case. Then I can insert the new element in the map with the "hint"-version of insert: mymap.insert(iter, newelement); The hint-version starts searching at the hint for the correct insertion point, so we don't have to search through the map twice. It is strange that such a hint-insert also exists for the unordered_map. But what hint could I give it, if I don't have lower_bound? Thanks, Martin PS: there is a small problem in hash_table.hpp causing a warning in VC7.1 line 278 should be: return (*prev_ptr)!=0; instead of return *prev_ptr;

4 7

multi_index and VC70 problem
by Martin 05 Apr '05

05 Apr '05

When compiling the following code on VC70 struct tTest { tTest() : x(0), y(0), z(0) int x,y,z; }; typedef multi_index_container< tTest, indexed_by< ordered_unique< composite_key< BOOST_MULTI_INDEX_MEMBER(tTest, int, x) ,BOOST_MULTI_INDEX_MEMBER(tTest, int, y) ) // replaced > with ) since gmane thinks I'm top-posting ) ) ) tTestList; void func() { tTestList u; u.insert(tTest()); } I get an error boost\multi_index\composite_key.hpp(573) : error C2100: illegal indirection boost\multi_index\ordered_index.hpp(562) : see reference to function template instantiation 'boost::multi_index::composite_key<Value,KeyFromValue0,KeyFromVal ue1,KeyFromValue2,KeyFromValue3,KeyFromValue4,KeyFromValue5,KeyFromValue6,KeyFr omValue7,KeyFromValue8,KeyFromValue9>::result_type boost::multi_index::composite_key<Value,KeyFromValue0,KeyFromValue1,KeyFromValu e2,KeyFromValue3,KeyFromValue4,KeyFromValue5,KeyFromValue6,KeyFromValue7,KeyFro mValue8,KeyFromValue9>::operator ()(const ChainedPtr &) const' being compiled with [ Value=boost::multi_index::member_offset<tTest,int,0>, KeyFromValue0=boost::multi_index::member_offset<tTest,int,4>, KeyFromValue1=boost::tuples::null_type, KeyFromValue2=boost::tuples::null_type, KeyFromValue3=boost::tuples::null_type, KeyFromValue4=boost::tuples::null_type, KeyFromValue5=boost::tuples::null_type, KeyFromValue6=boost::tuples::null_type, KeyFromValue7=boost::tuples::null_type, KeyFromValue8=boost::tuples::null_type, KeyFromValue9=boost::tuples::null_type, ChainedPtr=tTest ]

2 3

Re: [Boost-users] Re: lambda dereferencing pointer
by Sean DeNigris 05 Apr '05

05 Apr '05

Sorry my man, include boost/lambda/bind.hpp also.

1 0

How to represent bipartite graphs ?
by Markus Krosche 05 Apr '05

05 Apr '05

Hello together, in my software I have to represent bipartite graphs, in my case petri nets (two disjoint sets - the places and the transitions - and only links between elements of the disjoint sets). I would like to use BGL for this purpose, but I did not find a "nice" solution for this problem. I am quit new to BGL and the only way I see is representing the two types of vertices inside a vertex-property. A better way would be to have two types of vertex properties, but I think this is not possible. Is there anyone who has a solution or an idea for this kind of problem? Thanks and best regards Markus

2 1

Re: [Boost-users] lambda dereferencing pointer
by Sean DeNigris 05 Apr '05

05 Apr '05

> std::partition( m_files.begin(), m_files.end(), > boost::bind( &boost::filesystem::is_directory, > *boost::lambda::_1 ) ); You are using bind from Boost.bind and _1 from Boost.lambda. If you change to boost::lambda::bind it will compile. See http://www.boost.org/doc/html/lambda/s08.html#id547254 for more detail. - Sean

2 1

C++ Template Metaprogramming Answers Page (was: EX 2.1)
by Dave Gomboc 05 Apr '05

05 Apr '05

> > Low-tech solution: "scroll down for next hint" "scroll down for > > solution" > > If you're willing to give up on the goal of "one page per exercise," > and would like to go instead with a finer-grained structure, we can > accomplish any restructuring you wish through the Wiki's > administrative interface; just let us know. Show the first hint, with a link. Clicking the link shows everything the same, but the link is replaced with a second hint, and a third link appears. Repeat until out of hints -- in which case no link appears. For example: http://www.uhs-hints.com/uhsweb/hints/halflife2/8.php Dave

3 2

lambda dereferencing pointer
by Matthias Kaeppler 05 Apr '05

05 Apr '05

Consider m_files to be a vector of pointers to boost::filesystem::pathS: std::partition( m_files.begin(), m_files.end(), boost::bind( &boost::filesystem::is_directory, *boost::lambda::_1 ) ); I want to invoke is_directory on the pointees. The error message is extremely long-winded and expands over several pages. I suppose you don't want to see it :) But maybe you can see immediately what I'm doing wrong? -- Matthias Kaeppler

1 0

lambda dereferencing pointer
by Matthias Kaeppler 05 Apr '05

05 Apr '05

Hello, consider m_files to be a vector of pointers to boost::filesystem::pathS: std::partition( m_files.begin(), m_files.end(), boost::bind( &boost::filesystem::is_directory, *boost::lambda::_1 ) ); I want to invoke is_directory on the pointees. The error message is extremely long-winded and expands over several pages. I suppose you don't want to see it :) But maybe you can see immediately what I'm doing wrong? -- Matthias Kaeppler

1 0

[typeof] MSVC-specific implementation added
by Arkadiy Vertleyb 05 Apr '05

05 Apr '05

Hi all, The recently discussed MSVC-specific trick, by Igor Chesnokov, has been added to the BOOST_TYPEOF submission. As a reminder, this implementation compiles much faster, and doesn't require type/template registration. This implementation covers VC6.5/7.0/7.1, but not VC8.0 (where the loophole seems to have been fixed). Please take it in the Boost sandbox file vault, http://boost-sandbox.sourceforge.net/vault/, typeof.zip. Regards, Arkadiy

1 2

[typeof] MSVC-specific implementation added
by Arkadiy Vertleyb 05 Apr '05

05 Apr '05

Hi all, The recently discussed MSVC-specific trick, by Igor Chesnokov, has been added to the BOOST_TYPEOF submission. As a reminder, this implementation compiles much faster, and doesn't require type/template registration. This implementation covers VC6.5/7.0/7.1, but not VC8.0 (where the loophole seems to have been fixed). Please take it in the Boost sandbox file vault, http://boost-sandbox.sourceforge.net/vault/, typeof.zip. Regards, Arkadiy

1 0

[serialization] Problem serializing uninitialized bools
by Andrew B 05 Apr '05

05 Apr '05

Let me first say "thanks" to everyone involved in Boost, particularly the serialization library. I am continuously impressed with the quality of this project. That said, I think I've encountered an issue that I would label as a bug, but perhaps there's something I'm missing. The following code throws/fails in Visual C++ 7.1 debug build. void boolTest() { bool uninitializedBool1, uninitializedBool2; std::ofstream ofs( "booltest.txt" ); boost::archive::text_oarchive oa( ofs, boost::archive::no_header ); oa << uninitializedBool1; oa << uninitializedBool2; ofs.close(); std::ifstream ifs( "booltest.txt" ); boost::archive::text_iarchive ia( ifs, boost::archive::no_header ); ia >> uninitializedBool1; ia >> uninitializedBool2; ifs.close(); } The reason is clear if you look at the contents of booltest.txt: 204 204 Since those bools are uninitialized, VC has written its standard "garbage" to their contents, which gets serialized as a value other than 0 or 1, which is what what the text_iarchive / ifstream would expect to see. I'm not sure if there's a philosophical opposition to supporting serializing uninitialized data, but the other primitives seem to work, and in my experience, it's not unusual to not initialize ever member of a struct before needing to serialize it. Thanks for your time, Andrew

2 5

boost::mpl::transform
by Lemings, Eric B. (Contr) 05 Apr '05

05 Apr '05

What is the result type of transform if the algorithm is given two sequences of different sizes? Thanks, Eric.

3 3

mpl error message on icc
by Stefan Strasser 05 Apr '05

05 Apr '05

this code has always been working on gcc but doesn't on icc, can anyone tell me what's wrong here: typedef mpl::copy<AMplVector,mpl::back_inserter<mpl::vector<AnotherMplVector> > >::type Type; I removed namespace qualifiers and so on from the error message but it's still not very readable: detected during: instantiation of class "mpl::aux::fold_impl<4, First, Last, State, ForwardOp> [with ... /usr/include/boost/mpl/aux_/preprocessed/plain/fold_impl.hpp(115): error: class "mpl::apply2<mpl::inserter<mpl::vector<Element, Declaration, NameDeclaration, Member, MemberClassifier, TemplateDeclaration, TemplateClassifier, MemberTemplateClassifier , Type, Classifier, Class, MemberClass, TemplateClass, MemberClassifierDefinition, ClassifierDefinition, TemplateClassifierDefinition, ClassDefinition, mpl::na, mpl::na, mpl::na>, mpl::push _back<mpl::na, mpl::na>>::operation, mpl::aux::fold_impl<4, mpl::begin<MemberTemplateClassDefinitionImpl::Bases>::type, mpl::en d<MemberTemplateClassDefinitionImpl::Bases>::type, mpl::inserter<mpl::vector<Element, Declaration, NameDeclaration, Member, MemberClassifier, TemplateDeclaration, TemplateClassifier, MemberTemplateClassifie r, Type, Classifier, Class, MemberClass, TemplateClass, MemberClassifierDefinition, ClassifierDefinition, TemplateClassifierDefinition, ClassDefinition, mpl::na, mpl::na, mpl::na>, mpl::push_back<mpl::na, mpl::na>>::state, mpl::inserter<mpl::vector<Element, Declaration, NameDeclaration, Member, Memb erClassifier, TemplateDeclaration, TemplateClassifier, MemberTemplateClassifier, Type, Classifier, Class, Me mberClass, TemplateClass, MemberClassifierDefinition, ClassifierDefinition, TemplateClassifierDefinition, ClassDefinition, mpl::na, mpl::na, mpl::na>, mpl::push_back<mpl::na, mpl::na>>::operation>::state3, mpl ::deref<mpl::aux::fold_impl<4, mpl::begin<MemberTemplateClassDefinitionImpl::Bases>::type, mpl::end<MemberTemplateClassDefinitionImp l::Bases>::type, mpl::inserter<mpl::vector<Element, Declaration, NameDeclaration, Member, MemberClassifier, TemplateDeclaration, TemplateClassifier, MemberTemplateClassifier, Type, Classifier, Class, MemberClass, TemplateClass, MemberClassifierDefinition, ClassifierDefinition, TemplateClassifierDefinition, ClassDefinition, mpl::na, mpl::na, mpl::na>, mpl::push_back<mpl::na, mpl::na>>::state, mpl::inserter<mpl::vector<Element, Declaration, NameDeclaration, Member, MemberClassifier, Te mplateDeclaration, TemplateClassifier, MemberTemplateClassifier, Type, Classifier, Class, MemberClass, Templ ateClass, MemberClassifierDefinition, ClassifierDefinition, TemplateClassifierDefinition, ClassDefinition, mpl::na, mpl::na, mpl::na>, mpl::push_back<mpl::na, mpl::na>>::operation>::iter3>::type>" has no member "type" typedef typename apply2< ForwardOp, state3, typename deref<iter3>::type >::type state4; regards, -- Stefan Strasser

3 5

about enable_if for member functions
by Yutaka Leon Suematsu 04 Apr '05

04 Apr '05

Dear booster, I have a question related to enable_if. I would like to enable or disable some member functions from a template class, but enable_if is -not enable- to do it :-) Here is the code. template <class T> class A { ... enable_if< boost::is_arithmetic<T>, void > :: type f1() { ... } }; In class A, I want to define function f1 only if the template parameter is arithmetic. It works fine except when the parameter is not arithmetic. I have a compile error "error C2039: 'type' : is not a member of 'boost::enable_if<Cond,T>'" (Working with VC7.1, and boost 3.12) Thank you in advance for any suggestions and help. Sincerely yours, Yutaka Leon Suematsu

3 3

Re: Re: STL algorithms & references (David Abrahams)
by Sean DeNigris 04 Apr '05

04 Apr '05

To anyone interested, I ended up writing for_each<cIterType&>(.) and the algorithm passed the iterators by reference. - Sean >typedef set<int>::const_iterator cIterType; >cIterType bit = mySet.begin(); cIterType eit = >mySet.end(); > >for_each(ref(bit), ref(eit), > if_(bind(boost::next<cIterType>, boost::ref(bit)) != mySet.end()) > [...]

1 0

Re: unordered_map has no lower_bound?
by Gottlob Frege 04 Apr '05

04 Apr '05

> Date: Mon, 04 Apr 2005 16:39:34 +0100 > From: Ben Hutchings <ben.hutchings(a)businesswebsoftware.com> > Subject: Re: [Boost-users] Re: unordered_map has no lower_bound? > To: boost-users(a)lists.boost.org > Message-ID: <42515FB6.9040803(a)businesswebsoftware.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Daniel James wrote: > >> Martin Wartens wrote: > >> > >>> PS: there is a small problem in hash_table.hpp causing a warning in > >>> VC7.1 > >>> line 278 should be: > >>> return (*prev_ptr)!=0; > >>> instead of > >>> return *prev_ptr; > > > > > > Ah, I just found out why I didn't do this before - prev_ptr might be a > > pointer object (depending on the allocator), so the correct line is: > > > > return (*prev_ptr) != link_ptr(); > > > > Which can potentially be inefficient. I think the best thing to do is to > > use a pragma to disable the warning, > > If it's the warning I'm thinking of (C4800: "forcing value to bool > 'true' or 'false'" - well, *duh*) then this is the right approach. > > > or maybe: > > > > return static_cast<bool>(*prev_ptr); > > > > or: > > > > return boost::implicit_cast<bool>(*prev_ptr); > > > > would work. > > Neither of those prevents the warning. > > Ben. > I always use !! to prevent that warning. like return !!*prev_ptr; YMMV.

1 0

C++ Template Metaprogramming -- EX 2.1
by Kelly Burkhart 04 Apr '05

04 Apr '05

I'm going through the excercises in this book and am stumped on the second one I tried. Does anyone have a hint on how to approach this problem? TIA, -K

6 14

Problems on list cover page
by David Abrahams 04 Apr '05

04 Apr '05

HTML tags seem to be showing up as text in the resulting web page: http://lists.boost.org/mailman/listinfo.cgi/boost-users -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

serialization
by Damien * 04 Apr '05

04 Apr '05

has anyone seen this compile error before, and know how to fix it? /usr/local/include/boost-1_32/boost/archive/detail/iserializer.hpp:428: no type named `type' in `struct boost::mpl::eval_if<boost::is_abstract<MyClass>, boost::mpl::identity<boost::archive::detail::load_pointer_type<boost::archive::text_iarchive, MyClass*>::abstract<MyClass> >, boost::mpl::identity<boost::archive::detail::load_pointer_type<boost::archive::text_iarchive, MyClass*>::non_abstract<MyClass> > >' im trying to serialize a polymorphic class that has a pointer to another class of the same type in it. if i comment out that line in the serialization function, the error goes away.

3 7

Re: STL algorithms & references
by David Abrahams 04 Apr '05

04 Apr '05

The following message is a courtesy copy of an article that has been posted to comp.lang.c++.moderated as well. lotusny78(a)yahoo.com writes: > Is there an "easy" way to pass iterators by reference to STL > Algorithms? By easy, I mean not more complicated than using a for > loop. > > e.g. > typedef set<int>::const_iterator cIterType; > cIterType bit = mySet.begin(); > cIterType eit = mySet.end(); > > for_each(ref(bit), ref(eit), > if_(bind(boost::next<cIterType>, boost::ref(bit)) != mySet.end()) > [...] > ); > > The code above, using boost::ref does not compile, at least in part > because boost::reference_wrapper does not contain some STL typedefs. > > If anyone has any ideas, I'd appreciate them. Thanks. This is clearly (to me, but probably not to most other readers of this NG) a Boost.Lambda - related question. If you post it to an appropriate mailing list (see http://www.boost.org/more/mailing_lists.htm) you'll probably get more useful answers. HTH, -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

GNU GPL
by Uzytkownik 04 Apr '05

04 Apr '05

-----BEGIN PGP SIGNED MESSAGE----- Hash: RIPEMD160 Could I use Boost in program under GPL? Regards. - -- Linux user: #376500 (patrz http://counter.li.org/) -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFCTuvOTCh1hBPsbHURA3shAJ4hncUNBBtoM/V0w8501V3IQE51EwCfUjzJ lxP2qbr+XskDCWmhussuxSU= =uJJp -----END PGP SIGNATURE-----

7 8

[string_algo] new flavour of xxx_copy algorithms
by Yuval Ronen 03 Apr '05

03 Apr '05

Hi. Many algorithms in the string-algo library have 3 versions (I'll take to_upper as an example): 1. In-place modification which takes a SequenceT by ref: template<typename MutableCollectionT> void to_upper(MutableCollectionT &); 2. Copy version which takes a SequenceT by const ref, and returns SequenceT: template<typename SequenceT> SequenceT to_upper_copy(const SequenceT &); 3. Copy version which takes a const ref CollectionT and an OutputIteratorT and the OutputIteratorT after using it: template<typename OutputIteratorT, typename CollectionT> OutputIteratorT to_upper_copy(OutputIteratorT, const CollectionT &) I believe there's room for another version - something that takes a const ref CollectionT, and returns a copy in a SequenceT: template<typename SequenceT, typename CollectionT> SequenceT to_upper_copy(const CollectionT &); The benefits are ease of use combined with performance. IMO, a common scenario is to perform a copy algorithm on a char* string, and returning it as a std::string. Such a thing would be easily done with the proposed extension as: std::string str = to_upper_copy<std::string>("something"); As it is now, I either have to make additional copy (if I use the in-place modification version or the SequenceT copy version), or handle the std::string size my self (if I use the OutputIteratorT version). The new version will allow me to do it elegantly and efficiently. The problem is that it probably can't be an overload of to_upper_copy because it has the same number of arguments as one of the existing overloads, so it will have to have a different name :-( Thanks, Yuval

2 2

extending boost::rational to represent infinities
by Jedediah Smith 03 Apr '05

03 Apr '05

I need a type equivelant to rational<int> but supporting two special values, +inf and -inf which compare greater and less (respectively) to all other values besides themselves. I don't need to perform any arithmetic on the inf values so those operations can be undefined. What is the best strategy for creating such a type? Would it be better to subclass rational or create an underlying integer type with the inf values and use rational based on that underlying type? If the former option, how exactly would I do it?

3 2

Re: BGL: Topological Sort plus ordered out edges
by Elisha Berns 03 Apr '05

03 Apr '05

Hi Again, Below (at the bottom) is the initial reply to my previously posted question on the matter of sorting the out edges of an XSD graph of element dependencies sent by Doug Gregor (and also from Jeremy Seik). I repost their response so everyone can be on the same page regarding what the big deal is: (Me) The problem with this solution is that it is easy to imagine a scenario in which the sub-elements, A B C, are also the children of some other type, ElementY, but in some other order: <ElementY> </C> </A> </ElementY> And using the suggestion below will create a non-directed graph due to the bidirectional edges A->B and B->A or B->C and C->B :( And topological sort won't work when that's the case, as everybody knows. So the assumption that the elements A, B and C will always be found in the same order in an XSD content model, is, to say the least, a weak assumption that can only safely hold true for small, highly controlled schemas. But for large schemas, or schemas I have no control over, that reuse common elements in various orders, all bets are off when the suggested fix will break. So I am a wary of *just* creating extra edges as suggested. I would prefer a more complete solution whereby the edges: ElementY->A ElementY->B ElementY->C Can be ordered somehow using a property or modifying the topological sort algorithm to do this, but right now it's not clear to me where to start. So this is really my question here, how to properly solve this problem in a way that accommodates all possible orderings of the child elements. The only safe assumption is that the parent type (such a ElementX) is unique and that is what makes the edges to its children unique. And also, I'm not concerned about multiple occurrences of child elements (such as two elements of B under ElementX) since those edges can be counted and don't affect the working of the sort. Thanks for any help here, Elisha Berns (Greg) Okay, so we have dependencies in the graph that aren't strictly hierarchical. The easiest answer is to add edges A->B and B->C, because that would illustrate the true dependencies in the example. > And therein lies my question, how do I add to the edge data the > information that signifies a fixed, sequential order among vertices, > when required, that is not to be broken by the sort? For the example > above the edges are: > > ElementX -> A (1) > ElementX -> B (2) > ElementX -> C (3) Unfortunately, I don't know of a good way to do this. topological_sort can only be based on the link structure of the graph. However, we might be able to be a little sneaky by putting the edges into the graph in the reverse order of the dependencies. So when enumerating the out_edges of ElementX, we want to get the edges for C, B, and A, in that order. Then when the depth_first_search instead topological_sort runs, it should give the right ordering. Doug Elisha Berns e.berns(a)computer.org tel. (310) 556 - 8332 fax (310) 556 - 2839

1 0

BGL: Topological Sort plus ordered out edges
by Elisha Berns 03 Apr '05

03 Apr '05

Hi, I got off to a wrong start my posting my question(s) privately, so in everyone's best interest, and certainly my own, I'm just reposting my question here in the hope that someone can comment on how to go about solving the following graph problem: Basically, just to define the context of the question, I need to construct the order in which XML elements need to be serialized to an XML document by reading/analysing an XSD schema document. The parent child relationships in the XSD, inside the type and element definitions give me the basic graph object that I need and after a topological sort it gives the basic order of dependencies within the XSD; however, that being said, the order of elements within individual type definitions (and element definitions also) is lost. For example, if some complex content model has 3 children in a fixed order: <ElementX> </A> </C> </ElementX> the results from the topological sort can give the A B C out of order as C B A. So I need to add some information that expresses the fixed, sequential order of the of the content model for whatever element requires it (in XSD lingo it's a <sequence> particle for complex content). And therein lies my question, how do I add to the edge data the information that signifies a fixed, sequential order among vertices, when required, that is not to be broken by the sort? For the example above the edges are: ElementX -> A (1) ElementX -> B (2) ElementX -> C (3) Elisha Berns e.berns(a)computer.org tel. (310) 556 - 8332 fax (310) 556 - 2839

1 0

[Ann] Parallel BGL 0.5.0 alpha available
by Douglas Gregor 02 Apr '05

02 Apr '05

The Parallel BGL builds on the Boost Graph Library (BGL), offering similar data structures, algorithms, and syntax for distributed, parallel computation that the BGL offers for sequential programs. The Parallel BGL is intended primarily as a research platform, to facilitate both experimentation with and comparison of parallel graph algorithms and to provide solid implementations for solving large-scale graph problems in other application areas. At present, an alpha release of the Parallel BGL is available for download, containing distributed graph algorithms and data structures for use with the Message Passing Interface (MPI). Those familiar with the Boost Graph Library will recognize the same algorithms, interfaces, and data structures in the Parallel BGL. Comments, questions, and feedback are always welcome, but *please* direct your comments to me, personally. The Parallel BGL is not a Boost library (although we may seek acceptance at a later date), The Parallel BGL is being developed by the Open Systems Lab, part of the Pervasive Technologies Laboratory at Indiana University. For more information, see http://www.osl.iu.edu/research/pbgl/ Doug Gregor Post-Doctoral Research Fellow Open Systems Lab, Indiana University

1 0

libs/thread/src/read_write_mutex.cpp non-windows compile broken
by boost＠whaite.ca 02 Apr '05

02 Apr '05

CVS changes checked in on 29 March 2005 have broken linux/gcc thread library compile of read_write_mutex.cpp. Its because BOOST_READ_WRITE_MUTEX_TRACE is #defined only when BOOST_HAS_WINTHREADS. -- Peter Whaite

2 1

1_32 compiling xml_grammer
by Jeremy Jurksztowicz 02 Apr '05

02 Apr '05

Hi, I am having problems compiling 1_32 on a G4 darwin system with GCC 3.x. 1_31 compiles fine, but when I the xml_grammer.o is being compiled in 1_32, it seems to take forever... as in forever. My computer seems to be doing things but I wonder if a modern processor should take over 4 hours to compile 1 lousy object file. That is how long I have left the compiler running for, 4 hours, still churning away at xml_grammer.o. Is it normal for xml_grammer to take a long time to compile? Nothing in xml_grammer.hpp (and xml_grammer.ipp) indicates that it should take so long. Perhaps it is my bjam build? I am using the bjam I installed with 1_31 to compile 1_32. Thanks, Jeremy Jurksztowicz

3 2

mingw and boost
by Srinivasan, Rajagopalan (GE Healthcare) 01 Apr '05

01 Apr '05

all, i have mingw g++ version 3.4.2 i got boost compiled and installed on c:\Boost my simple app does not link. Error Message is - C:/DOCUME~1/208004~1/LOCALS~1/Temp/ccK6caaa.o(.text$_ZN5boost15program_options16validation_errorC1ERKSs[boost::program_options::validation_error::validation_error(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)]+0x53):hello.cpp: variable 'vtable for boost::program_options::validation_error' can't be auto-imported. Please read the documentation for ld's --enable-auto-import for details. I cannot seem to find such a switch for ld. also - I am using make. should i be using jam (or bjam?) for my app. If these are in addressed some FAQ please point me. regards srini DISCLAIMER: This e-mail and any attachment is intended only for the exclusive and confidential use of the addressee(s). If you are not the intended recipient, any use, interference with, disclosure or copying of this material is unauthorised and prohibited. If you have received this message in error, please notify the sender by return e-mail immediately and delete the message from your computer without making any copies. Please see http://www.ge.com.au/help/email_privacy_policy.html for information about our privacy practices.

5 13

Directed graphs in Graph Library
by Dimitris Xochelis 01 Apr '05

01 Apr '05

Hi list, I am very interested in the graph library, which I am planning to use quite soon. My biggest concern is whether Graph Library can help me to find a minimum spanning tree in an *directed* graph with weighted edges. I know that for undirected graphs I can use either the Kruskal's algorithm or the Prim's algorithm, that Graph Library already provides. But what if I need to work with directed graphs? Please note (in case it helps): The problem that I am trying to solve does not require the use of weighted edges actually, I only need to enforce some constrains, giving absolute priority to some (directed) edges. I could just as well use Boolean flags instead of weights. Thanks in advance, Jim Xochellis This email and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this email in error please notify the system manager. This message contains confidential information and is intended only for the individual named. If you are not the named addressee you should not disseminate, distribute or copy this e-mail.

2 1

Lambda expression with boost::scoped_array
by Sean DeNigris 01 Apr '05

01 Apr '05

I want to write: vector<int> MyClass::MemFunc(const Cartridge&) const; int numCartridges = Cartridge::size(); scoped_array< vector<int> > vectorArray(new vector<int>[numCartridges]); int i = 0; for_each(CartridgeVector::begin(), CartridgeVector::end(), var(vectArray)[var(i)++] = bind(&MyClass::Memfunc, &db, _1)); I already compiled: vector<int>* vectArray = new vector<int>[CartridgeVector::size()] int i = 0; for_each(CartridgeVector::begin(), CartridgeVector::end(), var(vectArray)[var(i)++] = bind(&MyClass::Memfunc, &db, _1)); But when I add in the scoped_array, I can't get it to work. - Sean

1 0

RE: boost::mpl::transform
by Lemings, Eric B. (Contr) 31 Mar '05

31 Mar '05

I just wrote a quick and dirty test. #include <boost/mpl/vector_c.hpp> namespace mpl = boost::mpl; typedef mpl::vector_c< int, 1,8,0,-2,4 > t1; typedef mpl::vector_c< int, 7,-3,8,0 > t2; // Causes compile error: Passes mpl::void_ type to mpl::plus. //typedef mpl::transform< t1, t2, mpl::plus< _1, _2 > > r; namespace my { template < typename T1, typename T2 > struct plus: mpl::plus< T1, T2 > { }; template < > struct plus< mpl::void_, T > { typedef T type; }; template < > struct plus< T, mpl::void_ > { typedef T type; }; } typedef mpl::transform< t1, t2, my::plus< _1, _2 > > r; Got the following compile error: The class "boost::mpl::vector5<mpl_::integral_c<int, 7>, ..., mpl_::integral_c<int,0>>" has no member "item5". For what it's worth. Eric. > -----Original Message----- > From: Lemings, Eric B. (Contr) > Sent: Thursday, March 31, 2005 4:10 PM > To: 'boost-users(a)lists.boost.org' > Subject: boost::mpl::transform > > > > What is the result type of transform if the algorithm is > given two sequences of different sizes? > > Thanks, > Eric. >

1 0

Re: [Boost-users] Link error Boost.Serialization
by Christian Heinemann 31 Mar '05

31 Mar '05

boost-users(a)lists.boost.org schrieb am 31.03.05 04:11:12: > > On Wed, 30 Mar 2005 13:06:32 +0100, Christian Heinemann wrote > > Hi, > > i want to use serialization library from boost. I'm enthused about > > the functionality. But when i try to compile and link the first > > example (which can be find on > > http://www.boost.org/libs/serialization/doc/index.html) i get the > > following error messages: > > (with g++ -o serialize serialize.cpp -lboost_serialization-gcc > > -I/usr/local/include/boost-1_32) > > It doesn't look like you've told the compiler where to find the serialization > library. You probably need the option: > > -L /usr/local/lib > > assuming that's where the serialization library is installed. I found out that "gcc -o serialize serialize.cpp -lboost_serialization-gcc-d -I/usr/local/include/boost-1_32 -lboost_thread-gcc-mt" works. Exist there a special reason why i should use "boost_serialization-gcc-d" instead of "lboost_serialization-gcc" ? Christian ______________________________________________________________ Verschicken Sie romantische, coole und witzige Bilder per SMS! Jetzt bei WEB.DE FreeMail: http://f.web.de/?mc=021193

1 0

boost and STLport using VC++ 7.1
by Oleg Smolsky 31 Mar '05

31 Mar '05

Hello, I'm trying to build boost using VC++ 7.1 against STLport 5.0 rc2. The very first library that is built is boost_date_time.dll and the compiler chokes on greg_month.cpp. The full bjam output is at the end of the message. Some background info, that may be useful: - I can successfully build boost without STLport using this this command: bjam "-sTOOLS=vc-7_1" "-sBUILD=debug release <runtime-link>dynamic <threading>multi" --prefix=..\boost --builddir=..\boost-obj install - when using STLport I build using: bjam "-sTOOLS=vc-7_1-stlport" "-sSTLPORT_PATH=..\STLport\stlport" "-sBUILD=debug release <runtime-link>dynamic <threading>multi" --prefix=..\boost --builddir=..\boost-obj install - if I let the building process continue, it builds about 60% of all libraries - I need to use STLport5 because it supports VC++ 7.1 out of the box - I've tried building CVS/HEAD version of boost as well as the latest released version 1.32 So, has anybody tried building this combination? Thanks in advance. Here is the full output. Oleg. vc-C++ ..\boost-obj\bin\boost\libs\date_time\build\boost_date_time.dll\vc-7_1-st lport\debug\threading-multi\greg_month.obj greg_month.cpp C:\testing\boost-cvs\boost\lexical_cast.hpp(150) : error C2679: binary '>>' : no operator found which takes a right-hand operand of type 'boost::date_time::date _names_put<Config,charT,OutputIterator>::string_type' (or there is no acceptable conversion) with [ Config=boost::gregorian::greg_facet_config, charT=wchar_t, OutputIterator=std::ostreambuf_iterator<wchar_t,std::char_traits<wch ar_t>> ] C:\testing\boost-cvs\boost\lexical_cast.hpp(189) : see reference to func tion template instantiation 'bool boost::detail::lexical_stream<Target,Source>:: operator >><Target>(InputStreamable &)' being compiled with [ Target=boost::date_time::date_names_put<boost::gregorian::greg_facet _config,wchar_t,std::ostreambuf_iterator<wchar_t,std::char_traits<wchar_t>>>::st ring_type, Source=const char *, InputStreamable=boost::date_time::date_names_put<boost::gregorian::g reg_facet_config,wchar_t,std::ostreambuf_iterator<wchar_t,std::char_traits<wchar _t>>>::string_type ] C:\testing\boost-cvs\boost\date_time\date_names_put.hpp(131) : see refer ence to function template instantiation 'Target boost::lexical_cast<boost::date_ time::date_names_put<Config,charT,OutputIterator>::string_type,const char*>(Sour ce)' being compiled with [ Target=boost::date_time::date_names_put<boost::gregorian::greg_facet _config,wchar_t,std::ostreambuf_iterator<wchar_t,std::char_traits<wchar_t>>>::st ring_type, Config=boost::gregorian::greg_facet_config, charT=wchar_t, OutputIterator=std::ostreambuf_iterator<wchar_t,std::char_traits<wch ar_t>>, Source=const char * ] C:\testing\boost-cvs\boost\date_time\date_names_put.hpp(127) : while com piling class-template member function 'void boost::date_time::date_names_put<Con fig,charT,OutputIterator>::do_put_special_value(boost::date_time::date_names_put <Config,charT,OutputIterator>::iter_type &,boost::date_time::date_names_put<Conf ig,charT,OutputIterator>::special_value_enum) const' with [ Config=boost::gregorian::greg_facet_config, charT=wchar_t, OutputIterator=std::ostreambuf_iterator<wchar_t,std::char_traits<wch ar_t>> ] C:\testing\boost-cvs\boost\date_time\date_names_put.hpp(213) : see refer ence to class template instantiation 'boost::date_time::date_names_put<Config,ch arT,OutputIterator>' being compiled with [ Config=boost::gregorian::greg_facet_config, charT=wchar_t, OutputIterator=std::ostreambuf_iterator<wchar_t,std::char_traits<wch ar_t>> ] C:\testing\boost-cvs\libs\date_time\build\../src\gregorian\greg_month.cp p(129) : see reference to class template instantiation 'boost::date_time::all_da te_names_put<Config,charT>' being compiled with [ Config=boost::gregorian::greg_facet_config, charT=wchar_t ] C:\testing\boost-cvs\boost\lexical_cast.hpp(150) : error C2679: binary '>>' : no operator found which takes a right-hand operand of type 'boost::date_time::date _names_put<Config,charT,OutputIterator>::string_type' (or there is no acceptable conversion) with [ Config=boost::gregorian::greg_facet_config, charT=wchar_t, OutputIterator=std::ostreambuf_iterator<wchar_t,std::char_traits<wch ar_t>> ] C:\testing\boost-cvs\boost\lexical_cast.hpp(189) : see reference to func tion template instantiation 'bool boost::detail::lexical_stream<Target,Source>:: operator >><Target>(InputStreamable &)' being compiled with [ Target=boost::date_time::date_names_put<boost::gregorian::greg_facet _config,wchar_t,std::ostreambuf_iterator<wchar_t,std::char_traits<wchar_t>>>::st ring_type, Source=const unsigned short *, InputStreamable=boost::date_time::date_names_put<boost::gregorian::g reg_facet_config,wchar_t,std::ostreambuf_iterator<wchar_t,std::char_traits<wchar _t>>>::string_type ] C:\testing\boost-cvs\boost\date_time\date_names_put.hpp(189) : see refer ence to function template instantiation 'Target boost::lexical_cast<boost::date_ time::date_names_put<Config,charT,OutputIterator>::string_type,const charT*>(Sou rce)' being compiled with [ Target=boost::date_time::date_names_put<boost::gregorian::greg_facet _config,wchar_t,std::ostreambuf_iterator<wchar_t,std::char_traits<wchar_t>>>::st ring_type, Config=boost::gregorian::greg_facet_config, charT=wchar_t, OutputIterator=std::ostreambuf_iterator<wchar_t,std::char_traits<wch ar_t>>, Source=const wchar_t * ] C:\testing\boost-cvs\boost\date_time\date_names_put.hpp(188) : while com piling class-template member function 'void boost::date_time::date_names_put<Con fig,charT,OutputIterator>::put_string(boost::date_time::date_names_put<Config,ch arT,OutputIterator>::iter_type &,const charT *const ) const' with [ Config=boost::gregorian::greg_facet_config, charT=wchar_t, OutputIterator=std::ostreambuf_iterator<wchar_t,std::char_traits<wch ar_t>> ] "cl" /Zm800 -nologo /EHsc -c -DBOOST_ALL_DYN_LINK=1 -DUSE_DATE_TIME_PRE_1_ 33_FACET_IO -D_STLP_DEBUG=1 -D_STLP_DEBUG_UNINITIALIZED=1 -D_STLP_USE_DYNAMIC_LI B=1 /Z7 /Od /Ob0 /EHsc /GR /MDd /Op /Zc:forScope -I"..\boost-obj\bin\boost\li bs\date_time\build" -I"..\STLport\stlport\STLport-4.6.2\stlport" -I"C:\testing \boost-cvs" -Fo"..\boost-obj\bin\boost\libs\date_time\build\boost_date_time.dl l\vc-7_1-stlport\debug\threading-multi\greg_month.obj" -Tp"C:\testing\boost-cvs \libs\date_time\build\../src/gregorian/greg_month.cpp" ...failed vc-C++ ..\boost-obj\bin\boost\libs\date_time\build\boost_date_time.dll \vc-7_1-stlport\debug\threading-multi\greg_month.obj...

3 3

Cross compiling boost for Embedded Planet ppc_82xx question
by Brad Cox 31 Mar '05

31 Mar '05

I'm trying to cross-compile boost for the Embedded Planet PowerPC 82xx target platform and have a few questions. This is the first time I've used jam so I'm a bit disoriented. Can somebody help? The build platform is a vanilla Redhat 9 system for which the target processor vendor provides a cross-compiler (ppc_82xx_gcc). This is a modified version of gcc that builds applications to run under their Linux kernel/application environment, supplied as a collection of rpm images. These are installed on the host file system and exported to the target platform via NFS. All this is in place now and apparently is working, at least insofar as having compiled ACE/TAO successfully (as yet untested). Question is, how do I compile boost for this platform? I've copied tools/build/v1/gcc-tools.jam to tools/build/v1/ppc_82xx-tools.jam and changed the GCC/GXX settings in that file to ppc_82xx-gcc and ppc_82xx-g++ respectively, which is all that should be needed insofar as their compiler is concerned. Here's what I'm getting: jam needs to be told the target architecture somehow. Question is, how do I do this? /usr/local/tena-tools/i686-pc-linux-gnu/bin/bjam --prefix="/usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d" --builddir="/usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d/build" -sTOOLS="ppc_82xx-gcc" -sBUILD="debug <runtime-link>dynamic <threading>multi" -sGXX="ppc_82xx-gcc" -sGCC="ppc_82xx-gcc" install/usr/local/tena-tools/i686-pc-linux-gnu/bin/bjam --prefix="/usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d" --builddir="/usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d/build" -sTOOLS="ppc_82xx-gcc" -sBUILD="debug <runtime-link>dynamic <threading>multi" -sGXX="ppc_82xx-gcc" -sGCC="ppc_82xx-gcc" install/usr/local/tena-tools/i686-pc-linux-gnu/bin/bjam --prefix="/usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d" --builddir="/usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d/build" -sTOOLS="ppc_82xx-gcc" -sBUILD="debug <runtime-link>dynamic <threading>multi" -sGXX="ppc_82xx-gcc" -sGCC="ppc_82xx-gcc" install ...found 8259 targets... ...updating 226 targets... MkDir1 /usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d/build/bin/boost/libs/python/build/libboost_python.so/ppc_82xx-gcc/debug/shared-linkable-true/threading-multi gcc-C++-action /usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d/build/bin/boost/libs/python/build/libboost_python.so/ppc_82xx-gcc/debug/shared-linkable-true/threading-multi/numeric.o /usr/bin/objcopy: Warning: Output file cannot represent architecture UNKNOWN! gcc-C++-action /usr/local/boost/1.31.0/rh9-gcc322-ppc82xx-d/build/bin/boost/libs/python/build/libboost_python.so/ppc_82xx-gcc/debug/shared-linkable-true/threading-multi/list.o /usr/bin/objcopy: Warning: Output file cannot represent architecture UNKNOWN!

2 5

Boost::test, expected failures with BOOST_AUTO_UNIT_TEST?
by Dave Steffen 31 Mar '05

31 Mar '05

Hi folks, I'm developing a (better) unit test framework for our code; I am very attracted to the simplicity of the BOOST_AUTO_UNIT_TEST framework, but would like to use the "expected failures" feature that is, apparently, only available with the explicit use of the test suite. That is to say: if I explicitly write the init_unit_test_suite function, I add unit tests thusly: test->add( BOOST_TEST_CASE( &mytest), 1 ); with second parameter indicating how many expected failures. However, there is no way to do so using the AUTO framework: BOOST_AUTO_UNIT_TEST( testINFO ) // no second parameter! Is there any way for me to use the AUTO_TEST framework and still indicate expected failures? Thanks! ---------------------------------------------------------------------- Dave Steffen, Ph.D. "Irrationality is the square root of all evil" Numerica Corporation -- Douglas Hofstadter Software Engineer IV "Oppernockity tunes but once." -- anon.

2 1

Will libraries built on WinNT run on Win98? (MinGW)
by Reed Hedges 31 Mar '05

31 Mar '05

I know that Win98 is not really supported, but is there any chance that libraries (specifically thread and regex) that were build on WinNT using MinGW work on Win98 (in MinGW)? My guess is no, but has anyone tried it? thanks reed

2 1

Re: multitoken program_options in vc++6
by James E Taylor 31 Mar '05

31 Mar '05

> To begin with, do you realize the the variables_map class is seriously > broken with vc6 -- you can't call the 'as' method of the variable_value > class that variables_map::operator[] returns. > > Or you know some way around this? > > - Volodya I've been using the boost::any value directly to get around the as<> problem. Is there any way of getting multitoken values working? Thanks, James ___________________________________ NOCC, http://nocc.sourceforge.net

2 1

regex_search: Lazy evaluation of iterators
by David McKelvie 31 Mar '05

31 Mar '05

In previous emails I complained that if one used an extended syntax regex on an InputIterator (or a BidirectionalIterator) then regex_search sought to the end of the iterator before returning the first match. This has obvious disadvantages if one wants to implement lazy matching of regexes on a potentially large input stream. My hypothesis about what is happening is: The seeking to the end is due to the extended syntax wanting to know which is the leftmost match. This is done by asking the distance between the matched substring and the 'end' of the sequence. If the iterator is an InputIterator then STL (at least the version I'm using from gcc 3.3.2) says, the only way I can do this, is to seek to the end of the sequence, to find how far away I am from the end. Thus, the problem. If I redefine the iterator as a RandomAccessIterator, and define operator-, and operator +=, then STL uses operator- to find the distance between the match and the end. Which is better, but still not ideal, as I'm assuming that I dont know at that point where the end is. I'll know when I get there, but not before. I suggest that a cleaner conceptual way of doing this would be to ask how far we are from the start of the iterator. My apologies for any inaccuracies in the above and my ignorance of earlier debates on this or related issues. David

2 11

Re: [Boost-users] Link error Boost.Serialization
by Christian Heinemann 31 Mar '05

31 Mar '05

boost-users(a)lists.boost.org schrieb am 31.03.05 04:11:12: > > On Wed, 30 Mar 2005 13:06:32 +0100, Christian Heinemann wrote > > Hi, > > i want to use serialization library from boost. I'm enthused about > > the functionality. But when i try to compile and link the first > > example (which can be find on > > http://www.boost.org/libs/serialization/doc/index.html) i get the > > following error messages: > > (with g++ -o serialize serialize.cpp -lboost_serialization-gcc > > -I/usr/local/include/boost-1_32) > > It doesn't look like you've told the compiler where to find the serialization > library. You probably need the option: > > -L /usr/local/lib > > assuming that's where the serialization library is installed. The same error occur. I suppose there is a correlation between the link error and the 32bit and 64bit libraries installed on my system (x86_64). Is such a thing possible? There always two library-paths: lib and lib64. Boost is installed in lib. Christian ______________________________________________________________ Verschicken Sie romantische, coole und witzige Bilder per SMS! Jetzt bei WEB.DE FreeMail: http://f.web.de/?mc=021193

1 0

multitoken program_options in vc++6
by James E Taylor 31 Mar '05

31 Mar '05

boost-users, I am trying to use multitoken arguments with MS Visual C++ 6. The problem is my multitoken option description is not being recognised, so when I run the program with more than one token after the --multi flag, I get an exception. A minimalist program is below. Please note the necessary hack of providing 5 args to po::parse_command_line, which I have to do to satisfy the vc6 compiler. I'm linking with libboost_program_options-vc6-sgd.lib Any help would be much appreciated. Thanks, James int main(int argc, char* argv[]) { po::options_description desc("Allowed options"); try { desc.add_options() ("multi", po::value<string>()->multitoken(), "multi token argument") ; po::variables_map vm; /* next line, have to pass 5 args to parse_command_line: seems to be */ /* a compiler problem in vc6 */ po::store(po::parse_command_line(argc, argv, desc, 0, po::ext_parser()), vm); po::notify(vm); cout << "parsed successfully" << endl; } catch ( const std::exception &e ) { cerr << e.what() << endl << desc << endl; return -1; } return 0; } -- James E Taylor ___________________________________ NOCC, http://nocc.sourceforge.net

2 1

RE: [Boost-users] Errors Compiling exception
by Eyal Inbar 31 Mar '05

31 Mar '05

I done it and i get the same error . maybe the problem that the gcc is version 2.96 (Red Hat Linux 7.3 2.96-113)? -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of me22 Sent: Thursday, March 31, 2005 2:50 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Errors Compiling exception On Wed, 30 Mar 2005 11:10:35 +0200, Eyal Inbar <eyalin(a)tadlys.com> wrote: > > > I'm trying to use dijkstra-example and i get > > /usr/local/include/boost/graph/dijkstra_shortest_paths.hpp:137: exception > handling disabled, use > > -fexceptions to enable > > I'm not sure what version i have but i have the folder /i386-glibc21-linux > if its help? > > eyal That's a g++ error message saying that "exception handling [is] disabled" and you need to add the command line switch "'-fexceptions' to enable [it]" in the call to g++ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] Re: MPL Question on crossing the compile \ runtimebarrier with bind | adding to boost profiler abstracted file access
by Brian Braatz 31 Mar '05

31 Mar '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > > "Brian Braatz" <brianb(a)rmtg.com> writes: > > > I can always pass in a functor, but what I really want for Christmas is > > to be able to > > > > Tyepdef MyClass<std::ofstream, > > bind(&std::ofstream::open,_1,"MyFile.txt") > MyNewClass; > > > > This doesn't work because bind returns an actual OBJECT instead of a > > type. (intuitively - it would be cool if I could say > > bind(...)::Type which would give me the TYPE of the generated > > functor) > > > > SO that led me to be up until 3 am reading about mpl::lambda. I am still > > trying to determine if THAT can be used in place, but the dots are not > > connecting for me yet. > > > > Any suggestions or directions pointed GREATLY appreciated. > [Dave Abrahams Writes:] > You want "typeof," a mythical operator not yet in the C++ language -- > but many implementations support some form of it as an extension. > There's a prototype typeof library in the Sandbox files area now, by > Arkadiy Vertleyb and others. Check it out. I suggest you browse the > recent thread on typeof in boost-devel as well. [Brian Braatz Writes:] As always THANK YOU Dave What about the boost\Lambda.bind vs MPL bind?. Is there a way to write the Tyepdef MyClass<std::ofstream,bind(&std::ofstream::open,_1,"MyFile.txt") MyNewClass; As a MPL driven expression, or is the "typeof" the only option (I am ignoring the hand coded functor option). (I am asking partially because I am having a hard time "seeing" the difference between the MPL lambda and the boost lambda- I will keep re-reading the MPL book... :) ) (also don't get me wrong, the typeof looks very cool- I am just trying to connect the dots) ALSO I REALLY WISH I could pass strings to templates, maybe if I am lucky Santa will join the C++ committee....... Thanks again Brian

2 1

Link error Boost.Serialization
by Christian Heinemann 31 Mar '05

31 Mar '05

Hi, i want to use serialization library from boost. I'm enthused about the functionality. But when i try to compile and link the first example (which can be find on http://www.boost.org/libs/serialization/doc/index.html) i get the following error messages: (with g++ -o serialize serialize.cpp -lboost_serialization-gcc -I/usr/local/include/boost-1_32) "/usr/local/lib/gcc/x86_64-unknown-linux-gnu/3.4.3/../../../libboost_serialization-gcc.a(basic_iarchive.o)(.text+0x1ef): Infunction `boost::archive::detail::basic_iarchive::~basic_iarchive()': : undefined reference to `std::__default_alloc_template::_S_force_new' /usr/local/lib/gcc/x86_64-unknown-linux-gnu/3.4.3/../../../libboost_serialization-gcc.a(basic_iarchive.o)(.text+0x254): Infunction `boost::archive::detail::basic_iarchive::~basic_iarchive()': : undefined reference to `std::__default_alloc_template::_S_force_new' /usr/local/lib/gcc/x86_64-unknown-linux-gnu/3.4.3/../../../libboost_serialization-gcc.a(basic_iarchive.o)(.text+0x279): Infunction `boost::archive::detail::basic_iarchive::~basic_iarchive()': .... (~ 10 Pages) " And with "g++ -o serialize serialize.cpp -lboost_serialization-gcc -I/usr/local/include/boost-1_32 -lboost_thread-gcc-mt" only: "`.gnu.linkonce.t._ZNK5boost7archive17archive_exception4whatEv' referenced in section `.rodata' of /usr/local/lib/gcc/x86_64-unknown-linux-gnu/3.4.3/../../../libboost_serialization-gcc.a(basic_iarchive.o): defined in discarded section `.gnu.linkonce.t._ZNK5boost7archive17archive_exception4whatEv' of /usr/local/lib/gcc/x86_64-unknown-linux-gnu/3.4.3/../../../libboost_serialization-gcc.a(basic_iarchive.o) " I use Boost at first time and i'm going to despair.. Maybe it is important: i have installed Boost with gcc 3.4.3 on SuSE 9.2 (x86_64). With gcc 3.3.4 similar error message occur (g++ -o serialize serialize.cpp -lboost_serialization-gcc -I/usr/local/include/boost-1_32 ): "`.gnu.linkonce.t._ZNK5boost7archive17archive_exception4whatEv' referenced in section `.rodata' of /usr/local/lib/libboost_serialization-gcc.a(basic_iarchive.o): defined in discarded section `.gnu.linkonce.t._ZNK5boost7archive17archive_exception4whatEv' of /usr/local/lib/libboost_serialization-gcc.a(basic_iarchive.o) " Thank you for help! Christian _________________________________________________________________________ Mit der Grupppen-SMS von WEB.DE FreeMail können Sie eine SMS an alle Freunde gleichzeitig schicken: http://freemail.web.de/features/?mc=021179

2 1

Errors Compiling exception
by Eyal Inbar 31 Mar '05

31 Mar '05

I'm trying to use dijkstra-example and i get /usr/local/include/boost/graph/dijkstra_shortest_paths.hpp:137: exception handling disabled, use -fexceptions to enable I'm not sure what version i have but i have the folder /i386-glibc21-linux if its help? eyal

2 1

MPL Question on crossing the compile \ runtime barrier with bind | adding to boost profiler abstracted file access
by Brian Braatz 30 Mar '05

30 Mar '05

I have been reading (ahem and re-reading) "C++ Template Metaprogramming" I have a problem I am trying to solve and was up late last night looking for the answer to jump out at me. If nothing else this helps me as I tend to re-read the same chapters over and over. Here is what I am trying to do In working on coded I am adding to the proposed Boost Profiler (started by Chris Diggings, inherited by yours truly). I am using RAII all "over" my program in the extensions I am adding to the profiler. This puts me in a spot where I have MACROs which stuff the profile points in the program. Now the problem is I would like to be able to add a template param to the TYPE of the profile points which gives it the initialization code for the STREAM it is using. The problem is since the objects themselves get created ALL OVER the program, I don't have a single point of construction (because I am using RAII to track the life cycles inside the functions themselves). I.e. I want to be able to use Boost.IOstreams or ofstream or whatever for these objects.I just need to , at the TYPE DEFINITION be able to define how to initialize this passed stream. I need to be able to do something like this Template <typename STREAMTYPE, typename INITFUNCTOR> Class MyClass { Public: STREAMTYPE outstream; MyClass() { INITFUNCTOR f(outstream); // open the file, init iostreams , or whatever } }; I can always pass in a functor, but what I really want for Christmas is to be able to Tyepdef MyClass<std::ofstream, bind(&std::ofstream::open,_1,"MyFile.txt") > MyNewClass; This doesn't work because bind returns an actual OBJECT instead of a type. (intuitively - it would be cool if I could say bind(...)::Type which would give me the TYPE of the generated functor) SO that led me to be up until 3 am reading about mpl::lambda. I am still trying to determine if THAT can be used in place, but the dots are not connecting for me yet. Any suggestions or directions pointed GREATLY appreciated. Is there a way to make this work with MPL::Lambda? Thanks Brian

2 1

RE: [Boost-users] Boost.lambda
by Brian Braatz 30 Mar '05

30 Mar '05

Ah Kindred spirits. I asked a similar question awhile ago (like last year). I am sorry I was not able to find the original message. The answer I was given was that the & is the correct syntax per the CPP standard. What you are doing is taking the address of a memberfunction. What was confusing to me was that some compilers allow you to LEAVE OFF the & while others don't. The ones that do are trying to be helpful but are not conformant. ________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Sean DeNigris Sent: Tuesday, March 29, 2005 7:31 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] Boost.lambda Can anyone explain why the class member functions need their address taken when used in a boost::lambda::bind inside the class? e.g. vector<int> v; MyClass theClass; for_each(v.begin(), v.end(), bind(MyClass::DoSomething, &theClass, _1)); //The above compiles fine, but... class MyClass { public: void DoSomething(const int& i) { ... } void Go() { for_each(myInts.begin(), myInts.end(), /*--------------------->*/ bind(MyClass::DoSomething, this, _1)); } vector<int> myInts; }; The above code does not compile. The marked line needs to be: bind(&MyClass::DoSomething, this, _1)); Why? Thanks. - Sean

1 0

Re: size of libboost_thread-gcc-mt.so
by Vladimir Prus 30 Mar '05

30 Mar '05

Amerio wrote: >>>> After compiling libboost_thread-gcc-mt.so on debian/gcc-2.95.4, >>>> this so weights 195kB > [...] >> Without read_write_mutex the size of gcc/release/shared build is 46K. >> With read_write_mutex the size is 136K. >> >> Wow, that's a difference! >> >> When I comment out explicit template instantiations in that source >> file, the library is becomes 76K. The comment says explicit >> instantination are needed to detect syntax errors in templates but >> those instantination bloat the library. > > Would there be any problem if I comment out the explicit instantations in > this file for production code ? > Are they in there *only* for syntax checking ??? I think that's the case. Adding #ifndef NDEBUG might be a reasonable solution. Note that if you use all of mutex types, you'll still get the code size penalty, but most likely you won't use all of them. > In this case, what about commiting a new rev in the cvs without this ? That's up to Boost.Thread maintainers. > Note : In my case, 100kB wasted is large enough to be an issue (running > low on free space, embedded system) I understand. - Volodya

1 0

size of libboost_thread-gcc-mt.so
by Amerio 30 Mar '05

30 Mar '05

Hello, After compiling libboost_thread-gcc-mt.so on debian/gcc-2.95.4, this so weights 195kB, while libpthread weights only 100kB. Why such a huge difference ? Isn't boost::thread meant to be as lightweight as possible ? What about the raw inpact on runtime memory consumption compared to std pthreads ?

3 2