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

boost::recursive_mutex for thread-safe logging crashing
by Ani Taggu 03 Sep '02

03 Sep '02

Hello: I have a simple class to do simple thread-safe logging using recursive_mutex as shown below. The problem is, once in a while, it causes any thread to die while it tries to log. I haven't been able to isolate why this happens. Is recursive_mutex being used correctly? The logging is done like so: extern FileLogger &TheLog() { static g_log("my.log"); return g_log; } TheLog() << "Hello World" << endl; I am using boost 1_28 with MSVC 6 SP5. ---------------------------------------------------------------------------- ------------------ #include <fstream> #include <string> #include "boost/thread/recursive_mutex.hpp" class FileLogger { public: // set second arg = false to do no logging. FileLogger(const std::string &logName, bool log=true) : log_(log) { if (log_) { strm_.open(logName.c_str(), std::ios::ate); } } // logging can be accessed from any thread. template <typename T> std::ostream & operator<< (T d) { if (log_) { boost::recursive_mutex::scoped_lock l(strmMutex_); strm_ << d; } return strm_; } ~FileLogger() { if (log_) { strm_.close(); } } private: std::ofstream strm_; boost::recursive_mutex strmMutex_; bool log_; };

2 3

RE: [Boost-Users] tuple and enums
by Tom Matelich 03 Sep '02

03 Sep '02

Hello Jaakko, Thanks for replying. It works if the constructor is written cons() {} Is there any purpose to putting those default calls there? Tom > From: Jaakko Jarvi [mailto:jajarvi@cs.indiana.edu] > Sent: Thursday, August 29, 2002 8:16 AM > > Hi Tom, > > Your code compiles fine with gcc 3.x and icc 6 (linux), so it may just > be gcc 2.96 problem. > > Cheers, Jaakko > > On Wed, 28 Aug 2002, Tom Matelich wrote: > > > It appears that an enum cannot be default constructed in > the way that > > tuple > > does, > > cons() : head(), tail() {} > > > > Any idea on how to get around this (besides using an int in > the tuple)? > > > > Thanks, > > Tom > > > > > > <sample_code> > > > > #include <boost/tuple/tuple.hpp> > > #include <string> > > > > enum Foo { Willis, Arnold }; > > > > void test() > > { > > boost::tuple<Foo, std::string> a; > > } > > > > </sample_code> > > > > </error compiler="gcc version 2.96 20000731 (Mandrake Linux 8.2)"> > > > > > /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp: In > > method > > `boost::tuples::cons<HT, > > TT>::cons () [with HT = Foo, TT = boost::tuples::cons<string, > > boost::tuples::null_type>]': > > > /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp:454: > > instantiated from `boost::tuples::tuple<T0, T1, T2, T3, T4, > T5, T6, T7, > > T8, > > T9>::tuple () [with T0 = Foo, T1 = string, T2 = > > boost::tuples::null_type, T3 > > = boost::tuples::null_type, T4 = boost::tuples::null_type, T5 = > > boost::tuples::null_type, T6 = boost::tuples::null_type, T7 = > > boost::tuples::null_type, T8 = boost::tuples::null_type, T9 = > > boost::tuples::null_type]' > > tuple_enum_test.cpp:8: instantiated from here > > > /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp:263: > > cannot convert `int' to `Foo' in > > assignment > > > > </error> > > > > > > > -------------------------------------------------------------- > --------- > > DISCLAIMER: Information contained in this message and/or > > attachment(s) may contain confidential information of Zetec, Inc. > > If you have received this transmission in error, please notify > > the sender by return email. > > > -------------------------------------------------------------- > --------- > > > > Yahoo! Groups Sponsor > > ADVERTISEMENT > > > > Info: <http://www.boost.org> > > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service. > -- -- -- Jaakko Järvi email: jajarvi(a)cs.indiana.edu -- Post Doctoral Fellow phone: +1 (812) 855-3608 -- Pervasive Technology Labs fax: +1 (812) 855-4829 -- Indiana University, Bloomington Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

2 1

RE: [Boost-Users] tokenizer
by Jim.Hyslop 03 Sep '02

03 Sep '02

Vijay (macrodisk(a)yahoo.com) wrote: > Is there anyway I can combine two tokens and check it as single one? > > I want to divide my string when both "-" and ">" occur together: > > Cell 12-1 -> xyz... > > I want to get the first token as Cell 12-1, how can I achive this via > tokenizer? I haven't used the tokenizer, but it seems to me that your TokenizerFunction can peek at the character after the '-' to see if it is a '>', to determine whether it should treat the '-' as a regular character or part of a separator. -- Jim

2 1

Problems with MSVC-STLPORT toolset
by davlet_panech 03 Sep '02

03 Sep '02

Hello, I'm having problems building release 1.28 with MSVC 6/STLPort 4.5.3/bjam on Windows NT 4. It seems that bjam tries to make a very VERY deep directory tree which at some point becomes too large due to path name limitations. By looking at the trace messages it seems something is very wrong there :) -- the directory tree is modelled after the command line options with some of the options repeated with different values at different levels in the tree. For example the following target fails (and there a few cases similar to this one; so that nothing gets compiled): mkdir libs\regex\build\bin\libboost_regex.lib\msvc- stlport\stlport-iostream-on\debug-symbols-on\exception-handling- on\inlining-off\optimization-off\rtti-on\runtime-build-debug\runtime- link-dynamic\stlport-cstd-namespace-std\stlport-iostream-off ...failed MkDir1 libs\regex\build\bin\libboost_regex.lib\msvc- stlport\stlport-iostream-on\debug-symbols-on\exception-handling- on\inlining-off\optimization-off\rtti-on\runtime-build-debug\runtime- link-dynamic\stlport-cstd-namespace-std\stlport-iostream-off... Notice how the path includes both stlport-iostream-off and stlport- iostream-on components. The command line I was using: bjam \ -sTOOLS=msvc-stlport \ -sBUILD=stlport-iostream-on -sSTLPORT_4.5.3_PATH="h:\PROGRA~1\MICROS~1\VC98\INCLUDE\stlport" The MSVC-specific environment was set up correctly (MSVCDir, INCLUDE, LIB). The STLPORT_4.5.3_PATH points to the directory containing the STLPort headers. What am I doing whrong? Thanks, D.P.

2 1

[bind] does bind do overload resolution?
by Alex Henderson 02 Sep '02

02 Sep '02

Hi, I'd like boost::bind to use overloaded member functions, but get an internal compiler error. Does bind support overload resolution, or is my compiler at fault? (...or more likely the code!) system = C++Builder 5 (patched), Win2k, boost_1_28_0 example (simplified) code below Thanks, Alex //-------------------------------------------------------------------- ------- #include <string> #include <vector> #include <iostream> #include <boost/bind.hpp> //-------------------------------------------------------------------- ------- struct part { std::string name; int id; part(std::string name, int id) : name(name), id(id) {} bool is(int test) { return id == test; } // bool is(std::string test) { return name == test; } // uncomment for error }; //-------------------------------------------------------------------- ------- int main() { int x = 6; // swap comments here for error // std::string x("handle"); // swap comments here for error std::vector<part> parts; part a("top", 3); parts.push_back(a); part b("spout", 6); parts.push_back(b); part c("handle", 9); parts.push_back(c); std::vector<part>::iterator it = std::find_if(parts.begin(), parts.end(), boost::bind(&part::is, _1, x)); std::cout << it->name << std::endl; return 0; } //-------------------------------------------------------------------- -------

4 3

Question about scoped_ptr.hpp and config.hpp
by eldritchshadows 31 Aug '02

31 Aug '02

Is there a reason that scoped_ptr.hpp doesn't have config.hpp up at the top like shared_ptr.hpp? When I included it, it got rid of a lot of MSVC++ warnings. Nathan

2 1

shared_ptr and make_indirect_iterator
by Richard Wolf 31 Aug '02

31 Aug '02

Hi I'm trying to use make_indirect_iterator on a container of shared_ptrs as follows: #include <boost/iterator_adaptors.hpp> #include <boost/shared_ptr.hpp> #include <list> #include <algorithm> #include <functional> using std::mem_fun_ref; using std::mem_fun; using std::list; using boost::shared_ptr; using std::for_each; using boost::make_indirect_iterator; class A { public: void f(){} }; int main() { list<A *> List1; list<shared_ptr<A> > List2; // This works for_each(make_indirect_iterator(List1.begin()), make_indirect_iterator(List1.end()), mem_fun_ref(&A::f)); // This doesn't work for_each(make_indirect_iterator(List2.begin()), make_indirect_iterator(List2.end()), mem_fun_ref(&A::f)); } The second use of for each fails to compile (error messages at the end of the message). Is it possible to do this? Am I doing something wrong? I'm using gcc v 2.95.2. and the QNX OS. Thanks Richard QCC -I/home/rwolf/boat/src/includes -I/home/rwolf/boat/src/boost_1_27_0 -Wal l -L/home/rwolf/boat/src/lib -L. -O -g -I/home/rwolf/boat/src/includes -I/h ome/rwolf/boat/src/boost_1_27_0 -Wall test.cpp -o test /usr/include/xutility: In instantiation of `std::iterator_traits<boost::shared_ptr<A> >': /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1104: instantiated from `boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::all ocator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: instantiated from here /usr/include/xutility:81: no type named `iterator_category' in `class boost::shared_ptr<A>' /usr/include/xutility:82: no type named `value_type' in `class boost::shared_ptr<A>' /usr/include/xutility:83: no type named `difference_type' in `class boost::shared_ptr<A>' /usr/include/xutility:84: no type named `difference_type' in `class boost::shared_ptr<A>' /usr/include/xutility:85: no type named `pointer' in `class boost::shared_ptr<A>' /usr/include/xutility:86: no type named `reference' in `class boost::shared_ptr<A>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: In instantiation of `boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::all ocator<boost::shared_ptr<A> > >::iterator>': /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: instantiated from here /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1104: no type named `value_type' in `struct std::iterator_traits<boost::shared_ptr<A> >' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1105: no type named `reference' in `struct std::iterator_traits<boost::shared_ptr<A> >' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1106: no type named `pointer' in `struct std::iterator_traits<boost::shared_ptr<A> >' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: In function `int main()': /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `value_type' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `reference' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `pointer' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 2 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 3 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 5 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: At top level: /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: In instantiation of `boost::make_indirect_iterator<std::list<boost::shared_ptr<A>,std::allocator <boost::shared_ptr<A> > >::iterator>(...)': test.cpp:26: instantiated from here /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `value_type' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `reference' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `pointer' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 2 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 3 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 5 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: In function `{error} boost::make_indirect_iterator<std::list<boost::shared_ptr<A>,std::allocator< boost::shared_ptr<A> > >::iterator>(...)': /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: confused by earlier errors, bailing out cc: /usr/lib/gcc-lib/ntox86/2.95.2/cc1plus error 34 make: *** [test] Error 1

3 5

tokenizer
by Vijay 30 Aug '02

30 Aug '02

Hello, Is there anyway I can combine two tokens and check it as single one? I want to divide my string when both "-" and ">" occur together: Cell 12-1 -> xyz... I want to get the first token as Cell 12-1, how can I achive this via tokenizer? Thank you, Vijay

1 0

msvc-stlport build problems
by David Resnick 30 Aug '02

30 Aug '02

Hi, I'm trying to build boost version 1.28.0, msvc-stlport build, using the following line: bjam -sTOOLS=msvc-stlport -sstlport-iostream=on -sSTLPORT_PATH=c:\etc I have no problems building the msvc build. It seems to me that the problem has to do with the MS Platform SDK that I have installed. When compiling STLPort (version 4.5.3) I had similar warnings. 2 work arounds that I found there were either to remove the platform SDK from the include enviroment variable, or (when I found it) to define _STLP_NEW_PLATFORM_SDK in stl_user_config.h. I've tried variations of that with compiling Boost, but nothing makes a difference. I've included the error messages that I get for most files. ---------------------------- CUT HERE ---------------------------- vc-C++ libs\regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link- dynamic\stlport-cstd-namespace-std\stlport-ios tream-off\stlport-version-4.5.3\c_regex_traits.obj c_regex_traits.cpp C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1011) : error C2733: second C linkage of overloaded function 'InterlockedIncremen t' not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1009) : see declaration of 'InterlockedIncrement' C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1018) : error C2733: second C linkage of overloaded function 'InterlockedDecremen t' not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1016) : see declaration of 'InterlockedDecrement' C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1026) : error C2733: second C linkage of overloaded function 'InterlockedExchange ' not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1023) : see declaration of 'InterlockedExchange' "cl" /Zm400 -nologo -GX -c -DBOOST_REGEX_NO_LIB=1 -DBOOST_REGEX_STATIC_LINK=1 -D_STLP_NO_SGI_IOSTREAMS=1 -D_STLP_DO_IMP ORT_CSTD_FUNCTIONS=1 -D_STLP_DEBUG=1 -D_STLP_DEBUG_UNINITIALIZED=1 -D_STLP_NEW_PLATFORM_SDK=1 /Z7 /Od /Ob0 /GX /GR /MDd -I "libs\regex\build" -I"C:\etc\boost_1_28_0" -I"c:\etc\STLport-4.5.3\stlport" -I"C:\PROGRA~1\MICROS~3\VC98\include" -Fo"libs \regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link-dyna mic\stlport-cstd-namespace-std\stlport-iostream-off\s tlport-version-4.5.3\c_regex_traits.obj" -Tp"libs\regex\build\../src\c_regex_traits.cpp" ...failed vc-C++ libs\regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link- dynamic\stlport-cstd-namespace-std\s tlport-iostream-off\stlport-version-4.5.3\c_regex_traits.obj... ---------------------------- CUT HERE ---------------------------- Thanks in advance, David Resnick MobileSpear Inc.

2 1

BJam and XEmacs on WinXP
by Dan Muller 30 Aug '02

30 Aug '02

This may be a tad off-topic, but I couldn't find any reference to this relative to XEmacs, and the problem seems to be peculiar to bjam. If I try to run bjam under XEmacs, e.g. via M-x compile, M-x shell-command, or even from inside an XEmacs shell buffer (running CMD), I get the error "spawn: Invalid argument". More specifically, if I run it via shell-command, I get this: ===================== ...found 331 targets... ...updating 1 target... gcc-Archive-action ..\phys_sim\bin\libphys_sim.lib\gcc-nocygwin\debug\architecture-native\debug-symbols-on\inlining-off\optimization-off\profiling-off\rtti-on\runtime-build-debug\runtime-link-dynamic\threading-single\vtable-thunks-default\libphys_sim.lib spawn: Invalid argument ====================== ... which indicates that bjam is in fact starting, but has some problem. Or maybe the tools do. If I run it in the same directory from a regular command window, it works fine. I'm running XEmacs 21.4, with recently updated packages. The bjam executable was downloaded yesterday. (I'm trying to use it for something other than Boost, BTW.) The toolset I'm using is MinGW, the latest stable full-package release, with no package updates. Anyone have an idea what might be wrong? I'm getting tired of looking at my build output in a command window and then hunting for line numbers in my source code. :-)

2 3

problem with preprocessing library
by Ellis Cohen 30 Aug '02

30 Aug '02

Using the Boost preprocessor library, I'm getting an unexpected diagnostic from the HP-UX C++ compiler (aCC, version "HP ANSI C++ B3910B A.03.34"). The generated output -- see the last line of "Compiler output", below -- *is* correct. I'm using Boost_1_28_0. Is my use of the preprocessor library incorrect? Ellis Cohen ======================================================================== Code fragment triggering the diagnostic: #include <boost/preprocessor/cat.hpp> #include <boost/preprocessor/comma_if.hpp> #include <boost/preprocessor/repeat.hpp> #include <boost/preprocessor/tuple/elem.hpp> #define FOO0 (0, double, some_value) #define FOO1 (0, double, some_other_value) #define FOO2 (0, double, some_other_other_value) #define FOO_CNT 3 #define PPV(I) FOO##I #define PPV_FLAG(I) BOOST_PP_TUPLE_ELEM(3,0,PPV(I)) #define PPV_TYPE(I) BOOST_PP_TUPLE_ELEM(3,1,PPV(I)) #define PPV_NAME(I) BOOST_PP_TUPLE_ELEM(3,2,PPV(I)) #define BOOST_PP_DEF(I,_) BOOST_PP_COMMA_IF(I) BOOST_PP_CAT(d_,PPV_NAME(I))(BOOST_PP_CAT(other.d_,PPV_NAME(I))) BOOST_PP_REPEAT(FOO_CNT, BOOST_PP_DEF, _) #undef BOOST_PP_DEF ======================================================================== Compiler command: /opt/aCC/bin/aCC \ -Iboost_includes \ -Wc,-ansi_for_scope,on \ -Aa \ +inst_compiletime +inst_v \ -E -c Isrc/boost_bug.C -o boost_bug.o ======================================================================== Compiler output: Warning (anachronism) 823: "Isrc/boost_bug.C", line 18 # Redundant preprocessing concatenation operation results in two valid preprocessing tokens. Depending on this implementation defined behavior will result in non-portable code. BOOST_PP_REPEAT(FOO_CNT, BOOST_PP_DEF, _) ^^^^^^^^^^^^^^^ Warning (anachronism) 823: "Isrc/boost_bug.C", line 18 # Redundant preprocessing concatenation operation results in two valid preprocessing tokens. Depending on this implementation defined behavior will result in non-portable code. BOOST_PP_REPEAT(FOO_CNT, BOOST_PP_DEF, _) ^^^^^^^^^^^^^^^ Warning (anachronism) 823: "Isrc/boost_bug.C", line 18 # Redundant preprocessing concatenation operation results in two valid preprocessing tokens. Depending on this implementation defined behavior will result in non-portable code. BOOST_PP_REPEAT(FOO_CNT, BOOST_PP_DEF, _) ^^^^^^^^^^^^^^^ #line 1 "Isrc/boost_bug.C" #line 1 "boost_includes/boost/preprocessor/cat.hpp" #line 2 "Isrc/boost_bug.C" #line 1 "boost_includes/boost/preprocessor/comma_if.hpp" #line 1 "boost_includes/boost/preprocessor/comma.hpp" #line 17 "boost_includes/boost/preprocessor/comma_if.hpp" #line 1 "boost_includes/boost/preprocessor/empty.hpp" #line 18 "boost_includes/boost/preprocessor/comma_if.hpp" #line 1 "boost_includes/boost/preprocessor/if.hpp" #line 1 "boost_includes/boost/preprocessor/logical/bool.hpp" #line 17 "boost_includes/boost/preprocessor/if.hpp" #line 1 "boost_includes/boost/preprocessor/tuple/elem.hpp" #line 18 "boost_includes/boost/preprocessor/if.hpp" #line 19 "boost_includes/boost/preprocessor/comma_if.hpp" #line 3 "Isrc/boost_bug.C" #line 1 "boost_includes/boost/preprocessor/repeat.hpp" #line 4 "Isrc/boost_bug.C" #line 18 d_some_value( other.d_some_value) , d_some_other_value( other.d_some_other_value) , d_some_other_other_value( other.d_some_other_other_value)

3 2

RE: [Boost-Users] boost::any and operator ==
by Jim.Hyslop 29 Aug '02

29 Aug '02

> How do I compare two boost::any values for equality? How to I compare > two containers of boost::any's for equality? > > Why doesn't boost::any define this operator? There has to be > a reason. There is. boost::any can, quite literally, hold *anything*. In order to compare the objects being held, you must first know if they _can_ be compared. Consider: const char * initialMessage = "Snowflakes keep falling on my head"; void f() { boost::any multiA(42L); boost::any multiB(initialMessage); //... It doesn't make sense to compare the two 'any' objects. I suppose boost::any could coerce the pointer into a long, and then apply a comparison operator, but the results of that comparison would be meaningless. In order to compare the objects, you'll have to extract them from the any container using an any_cast. Which, of course, means you'll have to know the exact type of the object being held (or which type of a known set of types). -- Jim

2 1

Sorting a container of shared_ptr<T>
by alejandro_escalante_medina 29 Aug '02

29 Aug '02

Hello to everyone. I'm starting to take a look on Boost and was happy to find things like better smart pointers. Though, in my tests, I haven't been able to sort, say, a vector of shared_ptr without defining special comparators. I thought that the overload for the < operator would help me for that, but that operator compares pointers, not objects, so it doesn't do the work that I expected. I guess I'm not understanding this well. Could someone explain this to me? Saludos, Alex

2 1

threads and signals question
by lparrab 29 Aug '02

29 Aug '02

Hi all, I guess my question is not specific to Boost.Thread, but to threading in general (I'm new at it)... still hope you can help me out, either directly or by redirecting me to the right place (links are very much appreciated) I'm starting a multi-threaded program using Boost.Thread library: it is a "server", in which a thread loops around a "select" to accept new connections and see when a socket has data to be read, in which case puts the fds in queue from which other threads are taking them out to read the data. The problem I have, is that when a "ReceiverThread" finishes reading the data from the socket, it puts the fd back in the "all connections list", but by this time the other ("main")thread already copied the fds from the list and got into the next "select" loop, which means the socket from which the "receiver" just finished reading, will not be "selected" (monitored) untill the next select loop, which will not be untill a) a new connection comes or b)one of the other connected sockets gets some data that takes makes the main thread return from select. reading the select man, I thought I could just use a signal to force select to return when the "receiver" has put the fd back in the "all connection list": the threads are now executing something like: main_thread { *put all fds from "all sockets" list into a fdset *make a select on the fdset (block till something interesting happens) *take the fds with data out of "all sockets" and put them into "sockets with data" *loop } receiver{ *get a fd from "sockets with data" (if nothing there blocks till the main_thread sends us a fd through the queue) *read from fd *put fd back into "all sockets" (problem: main_thread may be (is!) already into the select) *raise(SIGUSR1) (to force select to return and enter the loop again, but this time with our fd) } the signal handler for SIGUSR1 does nothing, it just serves to force select to return, but the code is not really working as I expected, and I realized that the problem is that each thread has its own pid, so it seems raise is actually sending a signal to the wrong thread.... as I said, I am new to mulithreading, but I thought all threads run in a process, which means, they all have the same pid. ->if I first find out the "pid" of the main_thread and change raise(SIGUSR1) to kill(pid,SIGUSR1) it works ok. so my question: why does each thread have a own pid?? how can then I send signals from one thread to another?? I discovered there is a "pthread_kill" function to send signals to specific threads, the problem is I only have boost::thread objects, no pthread_t structures. or am I talking nonsense and shouldnt be using signals with Boost.Thread? if so, how do I solve the select problem?? thanx! luis

5 5

BGL: adjacency_list: remove_edge problems
by Matthias Kronenberger 29 Aug '02

29 Aug '02

I'm using a undirected grap with hash_setS as the Edge List container and vecS as the Vertex List Container I'm using MSVC60 with SP5 as soon as i'm trying to use remove_edge(vertex1,vertex2,graph) i get the following error message. I dont understand the error message. It means, that my edgelist is a std::vector allthough i compile with boost::hash_setS. Could it be, that some BGL config file detects MSVC and concludes, that hash sets are not available in the MSVC stl?? d:\matthias\programmieren\boost\boost\graph\detail\adjacency_list.hpp(665): error C2039: 'find': Ist kein Element von 'vector<boost::detail::sei_<unsigned int,list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,float,boost:: no_property>>>::iter,boost::property<enum boost::edge_weight_t,float,boost::no_property>>,allocator<boost::detail::sei _<unsigned int,list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,float,boost::no_property>>>::iter,boost ::property<enum boost::edge_weight_t,float,boost::no_property>>>>' find is not an element of vector the corresponding code fragment is. template <class Graph, class EdgeList, class Vertex> inline void remove_edge_and_property(Graph& g, EdgeList& el, Vertex v, boost::disallow_parallel_edge_tag) { typedef typename EdgeList::value_type StoredEdge; typename EdgeList::iterator i = el.find(StoredEdge(v)), end = el.end(); if (i != end) { g.m_edges.erase((*i).get_iter()); el.erase(i); } }

3 6

Re: [Boost-Users] threads and signals question
by dick.bridges＠tais.com 29 Aug '02

29 Aug '02

My $.02. Check out the description of the Leader-Follower thread pattern described in Schmidt, et al, Pattern-Oriented Software Architecture, Volume 2, Patterns for Concurrent and Networked Objects. Sure is easy to implement with Boost libraries. Thank you everyone! Luis De la Parra <lparrab(a)gmx.net To: tomhoward(a)users.sourceforge.net, Boost-Users(a)yahoogroups.com > cc: Subject: Re: [Boost-Users] threads and signals question 08/29/2002 09:37 AM Please respond to Boost-Users > IMHO I wouldn't use select. Each time a new connections is initiated, you > can simply start a new thread to receive data from that socket. I don't > know what performance impact this would have, but the code will certainly > be simpler and easier to maintain. as I said, I'm new to threads.. and I know they are much more "leightweighted" than a normal process, but imagine a server, like an application server, which can have *a lot* of clients connected at the same time, but in which the clients are not really all requesting thigs all the time, they are "just connected" I think having a thread waiting on each open connection is not the right approach here, so I thought of going a kind of "production line" approach in which a few threads (5-10) are reading the data from a bunch of open connections (50-100), the only thing they do is read the data, parse it and form a "Request" which they put in a queue for further processing and then go on to service the other connections. Then another group of threads is taking this requests and doing something, and putting Response objects in yet another queue, which another group of threads "Sender" is taking and sending thorugh the socket. I think you get the idea: a frew threads just doing one thing and then passing the processing to another gorup of threads. I know having a thread dedicated to each connection would be much easier, but since this project is mostly for fun (and to learn!) I'd like to take a "better" approach (note that I am not saying the approach I just described is the best one, but right now it sounds more efficient and scalable to me than the one-trhead-per-connection approach) regards, luis.l Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

tuple and enums
by Tom Matelich 29 Aug '02

29 Aug '02

It appears that an enum cannot be default constructed in the way that tuple does, cons() : head(), tail() {} Any idea on how to get around this (besides using an int in the tuple)? Thanks, Tom <sample_code> #include <boost/tuple/tuple.hpp> #include <string> enum Foo { Willis, Arnold }; void test() { boost::tuple<Foo, std::string> a; } </sample_code> </error compiler="gcc version 2.96 20000731 (Mandrake Linux 8.2)"> /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp: In method `boost::tuples::cons<HT, TT>::cons () [with HT = Foo, TT = boost::tuples::cons<string, boost::tuples::null_type>]': /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp:454: instantiated from `boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::tuple () [with T0 = Foo, T1 = string, T2 = boost::tuples::null_type, T3 = boost::tuples::null_type, T4 = boost::tuples::null_type, T5 = boost::tuples::null_type, T6 = boost::tuples::null_type, T7 = boost::tuples::null_type, T8 = boost::tuples::null_type, T9 = boost::tuples::null_type]' tuple_enum_test.cpp:8: instantiated from here /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp:263: cannot convert `int' to `Foo' in assignment </error> ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

2 1

shared_ptr const problem
by Olaf Petzold 28 Aug '02

28 Aug '02

Hi, now I have a new problem - const correctness. ---8<--- #include <iostream> #include <algorithm> #include <iterator> #include <vector> #include <boost/shared_ptr.hpp> class Doc { public: virtual ~Doc() { } public: const std::vector<double>& foo() const { return m_foo; } protected: std::vector<double>& foo() { return m_foo; } private: std::vector<double> m_foo; }; using namespace std; int main() { boost::shared_ptr<Doc> lp_doc( new Doc ); std::copy(lp_doc->foo().begin(), lp_doc->foo().end(), std::ostream_iterator<double>(cout, " ") ); cout << endl; } --->8--- `std::vector<double, std::allocator<double> >& Doc::foo()' is protected I hoped std::copy takes the const foo() member function. Thanks olaf

2 2

iterator_adaptors on mipspro 7.3.1.3m
by marcinzalewski 28 Aug '02

28 Aug '02

Hi, I am trying to use iterator adaptors on mipspro and am unsuccessfull as for now. I was wandering if any of you has experience with boost and mipspro. Here are some examples of errors I am getting: ----------- cc-1132 CC: ERROR File = ../../boost_1_28_0/boost/iterator.hpp, Line = 54 The namespace "std" has no member "ptrdiff_t". template <class Category, class T, class Distance = std::ptrdiff_t, ^ or cc-3307 CC: ERROR File = ../../boost_1_28_0/boost/type_traits/array_traits.hpp, Line = 24 Invalid partial specialization--class "boost::is_array<<error-type>>" is already fully specialized. template <typename T, std::size_t N> struct is_array<T[N]> ----------- Please, let me know if you did this before. :) -m ^

2 2

[BGL] undirectedS self-loop add_edge assertion
by Chris Russell 27 Aug '02

27 Aug '02

Just a quick mention: A call to add_edge with u == v causes an assertion if Directed == undirectedS. adjacency_list.hpp line 843: assert( u != v ); // don't allow self-loops ^- boost_1_28_0 Avoiding the assertion is easy enough but this is inconsistent w/section 14.1.1 p.220 of the BGL book: "... Also if u and v are descriptors for the same vertex (creating self loop) and the graph is undirected, then the edge will not be created and the flag will be false." Am having tons of fun - the BGL and the book are super. Thanks! - Chris

2 1

lambda library usage
by khuroth 27 Aug '02

27 Aug '02

I have a View class that has some widgets, and a Controller class that controls the view, so the View class has a GetController() member function that returns a reference to its controller. When the View's constructor is called, GetController() would return a bad ref, but it would return a valid reference by the time a button is clicked... so what I'm trying to do is, inside the View constructor: my_button.on_click = bind( (_1 ->* &A::GetController).DoSomething(), this ); but that obviously doesn't work... I'm even having trouble just saving the first part: my_button.on_click = bind<Controller&>(_1 ->* &A::GetController, this); also doesn't work... I tried defining the on_click member of the button as a boost::function<void> or a boost::function0<void> in the first example, and a boost::function<Controller&> or boost::function0<Controller&> in the second snip... I get immense compiler errors, so I'm not sure where I messed up. What am I doing wrong?

3 8

shared_ptr swap problems
by Olaf Petzold 27 Aug '02

27 Aug '02

Hello, I've trouble with the follwong snippet: #include <iostream> #include <boost/shared_ptr.hpp> struct A { A(const char* n) : name(n) { } const char* name; }; struct B : public A { B(const char* n) : A(n) { std::cout << "construct " << name << std::endl; } ~B() { std::cout << "destruct " << name << std::endl; } }; struct BaseC { virtual void set(const boost::shared_ptr<A>& ptr) = 0; }; struct C : public BaseC { C() : b( new B("C::b") ) { } void set(const boost::shared_ptr<A>& ptr) { b.swap( boost::shared_static_cast<B>( ptr ) ); // L21 } void print() { std::cout << b->name << std::endl; } boost::shared_ptr<B> b; }; using namespace std; int main() { boost::shared_ptr<A> b( new B("b") ); C c; c.print(); c.set( b ); c.print(); } t.cc: In member function `virtual void C::set(const boost::shared_ptr<A>&)': t.cc:21: no matching function for call to `boost::shared_ptr<B>::swap(boost::shared_ptr<B>)' /usr/include/boost/shared_ptr.hpp:234: candidates are: void boost::shared_ptr<T>::swap(boost::shared_ptr<T>&) [with T = B] I did try boost::shared_polymorphic_cast to get a std::bad_cast exception - but it doesn't compile too. How can get it working? Thanks Olaf

3 7

RE: [Boost-Users] How can checkout the files in Attic (hidden) fr om the cvs server?
by Jim.Hyslop 27 Aug '02

27 Aug '02

> I'm using WinCvs to checkout the current version of boost from the > cvs server. However, I found that I can not checkout some of the > libs which are put in the Attic, though I can browse them through my > internet browser. Anyone knows how to check these files out? (for > example, the mpl lib) Any files in the Attic are either obsolete, or have been added only on a branch and have not been merged to the trunk yet. Unless you are having a specific problem that requires a file from the Attic, then don't worry about what's up there (I suspect that's probably why it's called the "Attic" - out of sight, out of mind ;-) -- Jim

1 0

How can checkout the files in Attic (hidden) from the cvs server?
by li_lirong 27 Aug '02

27 Aug '02

I'm using WinCvs to checkout the current version of boost from the cvs server. However, I found that I can not checkout some of the libs which are put in the Attic, though I can browse them through my internet browser. Anyone knows how to check these files out? (for example, the mpl lib) Thanks in advance, Lirong

1 0

boost::any and operator ==
by billrobertson42 27 Aug '02

27 Aug '02

How do I compare two boost::any values for equality? How to I compare two containers of boost::any's for equality? Why doesn't boost::any define this operator? There has to be a reason. Thanks!

1 0

What's your wish list?
by Kevin S. Van Horn 26 Aug '02

26 Aug '02

I'm teaching a graduate class on generic programming this semester, and I'm looking for some solid, meaningful projects for my students. If there are extensions to existing Boost libraries that you would like, or some new C++ library that you would like written, please contact me. -- Kevin S. Van Horn kevin.vanhorn(a)ndsu.nodak.edu

1 0

Using Hash with Graph
by Sandeep Bhutani 26 Aug '02

26 Aug '02

Hi, I am trying to use hash feature with the graph library. Here are the various details: Solaris: SunOS 5.7 Compiler: KAI 4.0 STL: Native Sun Hash: A hacked up version of SGI/STLPort I can get graph to work with vectors/lists. I can't get it to work with the hash_set or hash_map. I get a message from the "concept_checks.h" file in my hash which essentially tells me that the hash function is not defined. I am reproducing the message from the compiler at the bottom. I am trying to make all this work by using the adjacency_list.cpp file in the examples directory. Here is the change I have made to that file: typedef adjacency_list<hash_setS, listS, undirectedS, VertexProperty, EdgeProperty> Graph; // New typedef adjacency_list<vecS, listS, undirectedS, VertexProperty, EdgeProperty> Graph; // Old Can you please help? Has anyone used the has feature in the graph library. I had to edit the line number 166 in adjacency_list.hpp to replace hash_set with hash_map. Thanks -Sandeep The message: "/lsi/home/bhutani/hash/include/concept_checks.h", line 289: error: call of an object of a class type without appropriate operator() or conversion functions to pointer-to-function type return __f(__arg); ^ detected during instantiation of "_Ret _STL_UNARY_FUNCTION_ERROR<_Func, _Ret, _Arg>::__unary_function_requirement_violation(_Func &, const _Arg &) [with _Func=std::hash<boost::detail::adj_list_gen<boost::adjacenc y_list<boost::hash_setS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>, boost::listS, boost::hash_setS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>::config::StoredEdge>, _Ret=size_t, _Arg=boost::detail::adj_list_gen<boost::adjacency_list<boos t::hash_setS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>, boost::listS, boost::hash_setS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>::config::StoredEdge]" at line 95 of "adjacency_list.cpp" 1 error detected in the compilation of "adjacency_list.cpp". KCC: Compilation failed. boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>, boost::listS, boost::hash_setS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>::config::StoredEdge]" at line 95 of "adjacency_list.cpp" 1 error detected in the compilation of "adjacency_list.cpp". KCC: Compilation failed.

3 3

Had to change typename to class in template declaration of ref.hpp
by Matthias Kronenberger 26 Aug '02

26 Aug '02

Is that a known bug of MSVC? changing all the typename to class removed the error messages.

1 0

Trouble with boost::bind
by stupid_newcomer 26 Aug '02

26 Aug '02

I'm trying to play with boost::bind and boost::mem_fn, however, i have some difficulties with the member function with more than 2 arguments. I have tried a number of time and gone through the documentation , but still can't found an answer. Example: #include <boost/shared_ptr.hpp> #include <boost/mem_fn.hpp> #include <boost/bind.hpp> #include <iostream> #include <vector> #include <algorithm> using namespace std; class B { public: void print0() const { cout << "B::print0 " << endl; } void print1(int i) const { cout << "B::print1 " << i << endl; } void print2(int i, int j) const { // how to call?? cout << "B::print2 " << i << ' '<< j << endl; } }; int main() { typedef boost::shared_ptr<B> Ptr; vector<Ptr> v; for (int i = 0; i < 3; ++i) { v.push_back(boost::shared_ptr<B>(new B())); } // zero argument, OK for_each(v.begin(), v.end(), boost::mem_fn(&B::print0)); // one argument, OK for_each(v.begin(), v.end(), boost::bind(&B::print1, _1, 5)); // two argument, how to call B::print2 ? // for_each(v.begin(), v.end(), /* B::print2 */); return 0; } Thanks for your help!

2 1

regex_match question
by yg-boost-users＠m.gmane.org 25 Aug '02

25 Aug '02

hello everybody i have a trouble with regex_match function. when i try to match a string with a pattern like "(abc)*", and if the string beeng matched contains several subexpressions 'abc', regex_match returns only one match so that i can't iterate through all of them. so, it counts subexp's in the pattern, not in the string. why it happens (i use default flags for regex_match, which must perform what i expect)? and what is the solution to the problem (the one i found so far is to parse in 2 phases - once with regex_match to be sure that the whole string matched, and then to use regex_split. but i'd like to parse the string only once and obtain all the subexp's)? thanks in advance aram

3 4

JAM and boost.pythyon
by sashan 24 Aug '02

24 Aug '02

Hi I've built the Python library and a few of my own test projects. I have problems when trying to link with an external library. Basically I get the 'unresolved external' link error. So I look at the jamfile I'm using and in the dependencies section add the following <dll>E:/code/Library/MyLib Then I run bjam again and the first error I get is E:/Code/Library/Jamfile: No such file or directory So I guess its looking for a Jamfile in that directory. Problem is I don't know what to put inside the Jamfile. Can someone please help? Thank you Sashan

2 1

REGEX - expression doesn't match
by Fr�d�ric Mayot 24 Aug '02

24 Aug '02

Hi, My problem is really simple : I have several regular expressions (like (19[4-9]\d)|(200\d)|( [09]\d ) ) which work when they correspond to the entire string, e.g. : "2002" OK; "something 2002 something" NOT OK. Everythings worked fine with the GRETA library, and now, it doesn't. Does anyone have an idea ? Thanks. Fred

3 5

Re: [Boost-Users] Re: REGEX - expression doesn't match
by dan.ellis＠sophos.com 23 Aug '02

23 Aug '02

> It's simple : I have a string and a regular expression. I only want to > find the FIRST sub-string which matches my regular expression (S), then > to extract the sub-string before S and the sub-string after S. Off the top of my head, it sounds like you want: (.+)(200\d)(.*) -- Dan Ellis, Software Engineer, Sophos Anti-Virus Email: dan.ellis(a)sophos.com, DDI: 01235 540204 Real Business/CBI Growing Business Awards: Company of the Year Tel: 01235 559933, Web: http://www.sophos.com/

1 0

Graph - return edge_descriptor
by Shaw, Richard A 23 Aug '02

23 Aug '02

Can anybody tell my why the find_edge function in the code below fails to get a property if I return the first edge in the list. This is what happens - Find_edge looks for edge A - B It winds it and prints out the edge descriptor, and the weight of the edge It the returns the edge The main code prints out the edge descriptor and the fails when trying to print the weight. BTW - Is there a ready made function to find an edge based on the vertices ? #include <boost/config.hpp> #include <iostream> #include <fstream> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> using namespace boost; // Find edge template <class Graph> std::pair<bool, graph_traits<Graph>::edge_descriptor> find_edge(graph_traits<Graph>::vertex_descriptor u, graph_traits<Graph>::vertex_descriptor v, Graph g) { graph_traits<Graph>::out_edge_iterator ei, edge_end; for (boost::tie(ei,edge_end) = out_edges(u, g); ei != edge_end; ++ei) { if (target(*ei, g) == v) { std::cout << "Inside " << *ei << " " << get(edge_weight, g, *ei) << std::endl; return std::make_pair(true, *ei); } } return std::make_pair(false, *ei); // Is there a null edge that I can return ? } int main(int, char *[]) { typedef adjacency_list < listS, vecS, directedS, no_property, property < edge_weight_t, int > > graph_t; typedef graph_traits < graph_t >::vertex_descriptor vertex_descriptor; typedef graph_traits < graph_t >::edge_descriptor edge_descriptor; typedef std::pair<int, int> Edge; const int num_nodes = 5; enum nodes { A, B, C, D, E }; Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E), Edge(C, B), Edge(C, D), Edge(D, E), Edge(E, A), Edge(E, B) }; int weights[] = { 1, 2, 1, 2, 7, 3, 1, 1, 1 }; int num_arcs = sizeof(edge_array) / sizeof(Edge); #ifdef BOOST_MSVC graph_t g(num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); for (std::size_t j = 0; j < num_arcs; ++j) { edge_descriptor e; bool inserted; tie(e, inserted) = add_edge(edge_array[j].first, edge_array[j].second, g); weightmap[e] = weights[j]; } #else graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); #endif graph_traits < graph_t >::edge_descriptor e; bool found; std::cout << "List All" << std::endl; graph_traits < graph_t >::edge_iterator ei, ei_end; for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) { std::cout << *ei << get(weightmap, *ei) << std::endl; } std::cout << "List Not First" << std::endl; tie(found, e) = find_edge< graph_t >(E, A, g); std::cout << "Outside " << e << get(weightmap, e) << std::endl; // This edge is OK std::cout << "List First" << std::endl; tie(found, e) = find_edge< graph_t >(A, C, g); std::cout << "Outside " << e << get(weightmap, e) << std::endl; // This line fails to get the weight return EXIT_SUCCESS; } Richard Shaw ¤º°`°º¤ø,¸¸,ø¤º°`°º¤ø¤º°`°º¤ø,¸¸,ø¤º°`°º¤ø¤º°`°º¤ø,¸¸,ø¤ Atkins Transport Systems Woodcote Grove Ashley Road Epsom KT18 5BW Direct Dial.: +44 (0) 1372 756407 Switchboard: +44 (0) 1372 726140 Fax: +44 (0) 1372 740055 www.atkinsglobal.com/transportsystems <www.atkinsglobal.com/transportsystems> This email and any attached files are confidential and copyright protected. If you are not the addressee, any dissemination of this communication is strictly prohibited. Unless otherwise expressly agreed in writing, nothing stated in this communication shall be legally binding.

4 4

RE: [Boost-Users] Re: boost::object_pool
by scleary＠jerviswebb.com 22 Aug '02

22 Aug '02

> -----Original Message----- > From: wugui [mailto:yg-boost-users@m.gmane.org] > > another question: > > how make boost::object_pool thread_safe? To make a pool object thread-safe, guard all access with a mutex. -Steve

1 0

RE: [Boost-Users] boost::object_pool
by scleary＠jerviswebb.com 22 Aug '02

22 Aug '02

> -----Original Message----- > From: wugui [mailto:yg-boost-users@m.gmane.org] > > class A; > class B; > class AB : virtual public A, virtual public B; > > all destruct is virtual > > boost::object_pool<AB> pool_ab; > > B * pb = pool_ab.constuct(); > pool_ab.destroy(pb); // is this right? This looks right to me; what "pool_ab.destroy(pb);" does is: pb->~AB(); free(pb); // puts pb back in the free list of pool_ab -Steve

1 0

Kai C++ for Linux and Solaris
by Wintermantel , Marc 22 Aug '02

22 Aug '02

Hi everybody, We really badly need the latest version available of Kai C++ Compiler for Linux and Solaris. If someone wants to sell his copy, please write me!!! We would really be grateful. Yours truly, Marc Wintermantel Marc Wintermantel IMES - Structures Technology ETH Zurich, LEO C4 Leonhardstrasse 27 CH- 8092 Zurich Tel. ++41 1 633 35 32 Fax. ++41 1 632 17 02 [Non-text portions of this message have been removed]

1 0

boost::object_pool
by wugui 22 Aug '02

22 Aug '02

class A; class B; class AB : virtual public A, virtual public B; all destruct is virtual boost::object_pool<AB> pool_ab; B * pb = pool_ab.constuct(); pool_ab.destroy(pb); // is this right?

1 1

boost lambda library compile error
by khuroth 21 Aug '02

21 Aug '02

I have searched already in this list and the dev list for these MSVC compiler errors, but none of the solutions have worked so far. I have turned off precompiled headers, built clean, tried defining BOOST_NO_MEMBER_TEMPLATES before including "boost/lambda/lambda.hpp" (or "boost/lambda/bind.hpp"), and I still always get this error under Visual C++ 6 SP5 (Win2k Pro SP3), in both the Debug and Release configurations: Deleting intermediate files and output files for project 'dWin - Win32 Release'. --------------------Configuration: dWin - Win32 Release--------------- ----- Compiling... dwin-button.cpp dwin-common-control.cpp dwin-dialog.cpp C:\TMP\BOOST\BOOST_1_28_0\boost/lambda/detail/lambda_fwd.hpp(31) : 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 Not sure what I'm doing wrong..

4 6

Boost Concept Check Library
by igor_bashkirov 21 Aug '02

21 Aug '02

Hello, I work on big software project that is ported to several platforms/compilers, including Linux,Solaris/GCC 2.95.2,3.0.4); Windows/MSVC 6.0; AIX/VisualAge; MacOS X / GCC 2.95.2 (Apple). Recently, I decided to make use of Boost library (v 1.28) and the first thing I tried was Boost Concept Check Library (BCCL). Unfortunately, the use of the library wasn't as smooth as I expected, namely, with respect to BOOST_CLASS_REQUIRES macro. Thus, I'd like to submit a couple of observations and one proposal regarding usage of this macro. Let's start with observations: following is the snippet from <boost/concept_check.hpp> header: [code // The BOOST_CLASS_REQUIRES macros use function pointers as // template parameters, which VC++ does not support. #if defined(BOOST_NO_FUNCTION_PTR_TEMPLATE_PARAMETERS) #define BOOST_CLASS_REQUIRES(type_var, concept) .... #else #define BOOST_CLASS_REQUIRES(type_var, concept) \ typedef void (concept <type_var>::* func##type_var##concept)(); \ .... end code] As you could see, BOOST_CLASS_REQUIRES macros evaluate to nothing if BOOST_NO_FUNCTION_PTR_TEMPLATE_PARAMETERS symbol is defined. But, to my great surprise, I didn't find any more references to BOOST_NO_FUNCTION_PTR_TEMPLATE_PARAMETERS symbol throughout the Boost library. Moreover, the above comment about VC++ not supporting function pointers as template parameters is wrong (at least for MSVC 6.0 with SP5). Not to be unfounded, I will provide following sample program successfully compiled and run under MSVC 6.0 with SP5: [code #include <iostream> using namespace std; typedef void(*FP)(); template <FP T> class X { FP fp_; public: X() : fp_(T) {} void print() const { cout << fp_ << endl; } }; void f() {} int main(int, char**) { X<&f> x1; x1.print(); return 0; } end code] The same is true for pointers to member functions of both ordinary and template classes. OK, this observation could be treated as "cosmetic" one, but the following won't. Let's look at the definition of BOOST_CLASS_REQUIRES macro: [code #define BOOST_CLASS_REQUIRES(type_var, concept) \ typedef void (concept <type_var>::* func##type_var##concept)(); \ template <func##type_var##concept _Tp1> \ struct concept_checking_##type_var##concept { }; \ typedef concept_checking_##type_var##concept< \ BOOST_FPTR concept <type_var>::constraints> \ concept_checking_typedef_##type_var##concept end code] and at a typical usage of this macro (taken from Boost documentation): [code template <class T> struct generic_library_class { BOOST_CLASS_REQUIRES(T, EqualityComparableConcept); // ... }; end code] Here, the "EqualityComparableConcept" is a concept checking class defined in the "boost" namespace. OK, that's great and works fine until "generic_library_class" is also declared in the "boost" namespace. Let's now suppose "generic_library_class" is declared in namespace "ns1". Then, BOOST_CLASS_REQUIRES macro evaluates to following: [code namespace ns1 { template <class T> struct generic_library_class { typedef void (EqualityComparableConcept <T>::* funcTEqualityComparableConcept)(); ... }; } end code] Did you see the problem places? Yes, it's where "concept" parameter of the macro is substituted for "EqualityComparableConcept". This name is not declared in the namespace "ns1"! The first itch could be to specify "boost::EqualityComparableConcept" as a value of the second parameter of the macro, but, "not so fast, Skywalker!" - in this case we will end up with "funcTboost::EqualityComparableConcept" name for the pointer to member function that is not a legal name of C/C++ identifier. Someone could say "What a big deal?! Just write 'using namespace boost;' or 'using boost::EqualityComparableConcept;' just before declaring 'generic_library_class'.". Well, the declaration of "generic_library_class" seems to be in the header, right? And what do you think about writing "using-directives" in header files? Yes, right, - it's evil! Especially for large production code. Just check your favorite C++ book. Though, the use of "using-declarations" in headers is a moot point, I also consider it as evil for the same reasons as for "using- directives". Anyway, "using-declarations" won't help us, - they just don't work under MSVC 6.0 in our case. So, what do we have, - "exclusive circle"? I hope not. Finally, I got to the proposal that should help us to eliminate defects of the macro and to obviate above-stated difficulties. What if to add one more parameter, say, "ns", to the BOOST_CLASS_REQUIRES macro to pass the name of the namespace the concept checking class belongs to? Let's look at the new definition of the macro: [code #define BOOST_CLASS_REQUIRES(type_var, ns, concept) \ typedef void (ns::concept <type_var>::* func##type_var##ns##concept) (); \ template <func##type_var##ns##concept _Tp1> \ struct concept_checking_##type_var##ns##concept { }; \ typedef concept_checking_##type_var##ns##concept< \ BOOST_FPTR ns::concept <type_var>::constraints> \ concept_checking_typedef_##type_var##ns##concept; end code] and at it's usage: [code namespace ns1 { template <class T> struct generic_library_class { BOOST_CLASS_REQUIRES(T, boost, EqualityComparableConcept); // ... }; } end code] that will evaluate to the following: [code namespace ns1 { template <class T> struct generic_library_class { typedef void (boost::EqualityComparableConcept <T>::* funcTboostEqualityComparableConcept)(); ... }; } end code] That's it. Moreover, this solution does not suffer from yet another drawback inherent to the original one, viz, name clashing when using in the same class concept checking classes with the same name, but from different namespaces. The only issue I could see with my suggestion was impossibility to use concept checking classes declared at the global scope, but, I hope nobody would think of such thing, because it's evil (sorry for repetition). I hope the proposed solution will increase usability of the BCCL. Best regards, Igor Bashkirov.

3 2

Upgrade VisC++ compiler
by sen_al2002 20 Aug '02

20 Aug '02

Hi, I am a newbie to all this programmer stuff. I am a physics student doing some computer simulations. I was trying to use the special function atanh from boost libraries but couldn't. The error message reads d:\boost_1_28_0\atanh.hpp(77) : error C2989: 'atanh_helper1_t<T,0>' : template class has already been defined as a non-template class Some advised me to update my VisC++ ver 6.0 compiler. How can I do that? Does anybody out there have any better advise? Thanks sen

4 4

boost python link error
by kiminkim 20 Aug '02

20 Aug '02

I want to export C++ class...use boost lib but link error occured... help me. #include <windows.h> #include <boost/python/class_builder.hpp> #include <string> namespace python = boost::python; class CBaseBox { public: CBaseBox() {}; void move(); private: std::string a; }; void CBaseBox::move() { MessageBox(NULL, "kkm", "kkm", MB_OK); } BOOST_PYTHON_MODULE_INIT(tuesday) { python::module_builder this_module("tuesday"); python::class_builder<CBaseBox> CBaseBox_class(this_module, "CBaseBox"); CBaseBox_class.def(&CBaseBox::move , "move"); } --------------------Configuration: tuesday - Win32 Debug-------------------- Compiling... export.cpp Linking... Creating library pyds\./tuesday_d.lib and object pyds\./tuesday_d.exp export.obj : error LNK2001: unresolved external symbol "class CBaseBox & __cdecl from_python(struct _object *,struct boost::python::type<class CBaseBox &>)" (?from_python@@YAAAVCBaseBox@@PAU_object@@U?$type@AAVCBaseBox@@@python@boost @@@Z) pyds\.\tuesday_d.pyd : fatal error LNK1120: 1 unresolved externals Error executing link.exe.

1 0

Boost Python error handling
by cseymour＠interchange.ubc.ca 19 Aug '02

19 Aug '02

Here is a sample program which shows the problem i've been having (posted in earlier messages). When I import the module "sample" and run the function test(), I get the following output: This is a test Raising an error Aborted When I should get a message saying it caught the error, and then a Python error, instead of it Aborting and quitting Python. /* sample.c */ #include "Python.h" #include "boost/python/class_builder.hpp" namespace py = boost::python; void test() { std::cout << "This is a test" << std::endl; std::cout << "Raising an error" << std::endl; PyErr_SetString(PyExc_TypeError, "This is the error"); throw py::argument_error(); } BOOST_PYTHON_MODULE_INIT(sample) { try { py::module_builder this_module("sample"); this_module.def(test, "test"); } catch (...) { std::cout << "Caught an error" << std::endl; py::handle_exception(); } }

1 0

Newbie and shared_ptr
by Ian Mold 19 Aug '02

19 Aug '02

I have been looking at the shared_ptr class, and I have made a change to include an assignment from a standard pointer. I have done this so that I don't have to create a new shared_ptr just to reassign an existing shared_ptr. // Assignment to a 'normal' pointer. shared_ptr & operator=(T * r) { this_type(r).swap(*this); return *this; } I have a few questions. 1) Is this necessary? 2) Does this do the job? 3) Is there any reason this wasn't included in the first place? I welcome any comments. Regards, IanM

3 2

BGL: Loops in undirected graph
by Tarjei Knapstad 19 Aug '02

19 Aug '02

Is there any "standard best way" of detecting loops in an undirected graph? I had a look at chapter 4.2 in the book (which does an implementation for bidirectional graphs), and tried to adapt this implementation, but with no particular luck :) The graph I've set up in my test suite looks like this (I hope my mail prog. doesn't screw up the formatting) H15 | H8 C2 \ / \ H9-C0-C1 C3-O7-H14 / | | H10 C6 C4 / \ / \ H11 C5 H13 | H12 I'm working with molecules, so the letters denote the type of atom, but that's of no importance here. The numbers are the vertex descriptors. What I'm trying to create is an algorithm that will return the set of vertices [1, 2, 3, 4, 5, 6] defining. Now, my first step is (exactly like in the book) to record every back edge in the graph. As my graph is undirected, and there is allways a path from any one vertex to any other vertex, I thought I could just do a DFS from the first vertex in any such graph and record the back edges. In the above example, starting from 'C0', I'd expect the set of back edges obtained from a DFS to be 1-2, 2-3, 3-4, 4-5, 5-6 and 6-1, a total of 6 edges. The actual result obtained however also includes the following edges: 1-0, 11-6, 12-5, 13-4, 7-3, 14-7, 15-2, 8-0, 9-0 and 10-0. Why is this? I'm assuming there's something I missed out on, regarding graph theory and how the basic DFS works, but I cannot see any logic in this. If so, how could I modify my DFS visitor to record the (in my problem domain) "correct" back edges? This problem also gives me further trouble when trying to detect which vertices are part of each cycle. Does any of you have any suggestion for an effective implementation of the "find vertices that are part of each cycle" part of the algorithm? Any help appreciated. Cheers, -- Tarjei Knapstad

2 4

boost::function/bind Usage Again
by Albrecht Fritzsche 19 Aug '02

19 Aug '02

Here I want to extend simple callbacks so that these callbacks take an argument void fun(int i) { std::cout << "Hi fun " << i << std::endl; } struct Foo { void bar(int i) { std::cout << "Hi bar " << i << std::endl; } }; template <class Value> struct CallFunction { CallFunction(const Value& v) : mValue(value) {} // defined outside void operator()(const boost::function<void, Value>& fun) { if (fun) fun(mValue); } const Value& mValue; }; int main() { std::vector< boost::function<void, int> > funs; Foo foo; funs.push_back(&fun); funs.push_back(boost::bind(&Foo::bar, &foo, _1)); ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ int value = 7; std::for_each(funs.begin(), funs.end(), CallFunction<int>(value)); return 0; } Is this the right usage of the /_1/ here? This code runs (at least on my machine:-), but I'm quite unsure about this place holder. And since the online docu... Ah, now I see - in the online doc there are some links missing. In the files section not only the bind_template.hpp link refers to that very file but also the arg.hpp and placeholders.hpp links and many more. Having checked now the sources makes not everything clear, but at least clearer. So, I would be happy if anyone could let me know if my usage includes some misuse etc... Thanks Ali

3 2

Using gcc's typeof and boost.lambda together.
by Matthew Dempsky 19 Aug '02

19 Aug '02

I was just playing around with the boost.lambda library and thought of playing a bit with it using gcc's typeof extension... this is the code I used (just slightly modified documentation code): typedef typeof(_1 = 1) assign_one; list<int> v(10); for_each(v.begin(), v.end(), assign_one()); I was hoping it would work the same as the documentation's code, but instead it generates a few big errors about lambda_functor_base<...>::lambda_functor_base() not existing. I know typeof is a gnu extension and it's not really portable to use it in code, but does anyone have any ideas of how to get something like this to work correctly? -jivera

2 1

bug in regex 3.31 (boost 1.28)?
by emarkp 19 Aug '02

19 Aug '02

I sent this originally to James Maddock, but realized this is probably a better place to post it. At work we've been testing out regex (nice work BTW) in some of our code, and appear to have found a bug. We ran into it parsing HTML, and I've written a test C++ app to reproduce it. In the program below, the output should be the same for both searches as far as I can tell, but it's not. I don't know if it's some interaction with the quote character or something like that. We attempted to use other quantifiers (after '?', we tried '*', '{0,1}', ["]?) to no avail. I'm confident this is not user error. The extra grouping is annoying (in "goodPatternStr"), but is an acceptable workaround. The strange thing is that a non-capturing group doesn't fix it. Ideas? --Mark Ping -------------------------------------------------------------------------------------- output: input: <input type="hidden" name="MfcISAPICommand" value="SellYourItem" badOut :<input type="hidden" name="MfcISAPICommand" value="SellYourItem badOutName : badOutValue:SellYourItem goodOut :<input type="hidden" name="MfcISAPICommand" value="SellYourItem goodOutName :MfcISAPICommand goodOutValue:SellYourItem Press any key to continue -------------------------------------------------------------------------------------- #include <iostream> #include <string> #include <boost/regex.hpp> using namespace boost; using namespace std; int main() { const char* badPatternStr = "<input[^>]*name=\"?([^> \"]*)[^>]*value=\"?([^> \"]*)"; const char* goodPatternStr = "<input[^>]*name=(\"?)([^> \"]*)[^>]*value=\"?([^> \"]*)"; // ^^^^^ //note that the only difference between bad and good is that "good" //has grouping around the optional " after 'name=' // //In both versions of the matches, the second group is matched. //Only the first group has this problem. boost::match_results<std::string::const_iterator> what; std::string in = "<input type=\"hidden\" name=\"MfcISAPICommand\" value=\"SellYourItem\""; std::string::const_iterator start, end; start = in.begin(); end = in.end(); unsigned int flags = boost::match_default; std::string badOut, badOutName, badOutValue; if(regex_search(start, end, what, regex(badPatternStr), flags)) { badOut = what[0]; int numGroups = what.size(); // name badOutName = what[1]; badOutValue = what[2]; } std::string goodOut, goodOutName, goodOutValue; if(regex_search(start, end, what, regex(goodPatternStr), flags)) { goodOut = what[0]; int numGroups = what.size(); // name goodOutName = what[2]; goodOutValue = what[3]; } cout << "input: "; cout << in << endl << endl; cout << "badOut :" << badOut << endl; cout << "badOutName :" << badOutName << endl; cout << "badOutValue:" << badOutValue << endl; cout << endl; cout << "goodOut :" << goodOut << endl; cout << "goodOutName :" << goodOutName << endl; cout << "goodOutValue:" << goodOutValue << endl; return 0; }

2 5

RE: [Boost-Users] detail/lightweight_mutex.hpp
by Tom Matelich 17 Aug '02

17 Aug '02

> From: Tom Matelich [mailto:tmatelich@zetec.com] > > From: Peter Dimov [mailto:pdimov@mmltd.net] > > From: "Tom Matelich" <tmatelich(a)zetec.com> > > > I'm attempting to go to Boost 1.28 on our HPUX 10.20 boxes. > > I've run into > > a > > > problem with an assumption about the type of pthread_mutexattr_t. > > > detail\lwm_pthreads.hpp calls: > > > > > > pthread_mutex_init(&m_, 0); > > > > > > HP's pthread.h (10.20 uses DCE) has that defined as: > > > > > > int pthread_mutex_init (pthread_mutex_t *,pthread_mutexattr_t); > > > > I don't know what to do about it. My POSIX draft says > > > > int pthread_mutex_init(pthread_mutex_t *restrict mutex, const > > pthread_mutexattr_t *restrict attr); > > > > and goes on to specify that 0/NULL for the second argument > > causes default > > attributes to be used. > > > > I know little - if anything - about HPUX 10.20; if you find a > > solution let > > me know, and I'll incorporate it into lwm_pthreads.hpp. Sorry. > > > > The dce documentation I see says to use pthread_mutexattr_default. > http://www.transarc.ibm.com/Library/documentation/dce/1.1/pthread_mutex_init .html > >So, it looks like I need to find a version to if or ifdef off of. I found a define in dce/cma.h (appended to my original email) which seems to fit the bill: /* * Define a symbol which client code can test to determine whether the * underlying threads package is DECthreads or not. This is especially * important to clients of the Pthreads interface who may want to use * certain DECthreads extensions, such as the global lock and non-real-time * scheduling policies, on the DECthreads platform while maintaining * portability to a "vanilla" pthreads implementation. */ #define _DECTHREADS_ 1 Although, I'm not sure how to find out if this should be used generally, or only on HP. ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

2 1

regex performance
by Paul Dubuc 17 Aug '02

17 Aug '02

I'm doing some performance comparisons between Rogue Wave's Regexp class (http://www.roguewave.com/support/docs/tlsref/rwcregexp.cfm) and boost::regex using simple expressions like "^metal.*" and "[0-9]+" with regex_search(). regex is slower by a factor of 6, measuring cpu time (on a SunBlade 100 runing Solaris 8). Is there anything I can do to speed it up? I tried using different values of boost::regbase::flag_type_ to adjust how the regular expressions are interpreted, but with little effect. Any other ideas? (I'm using boost_1_27_0.) Thanks, -- Paul M. Dubuc

7 12

request for comment on possible submission to library
by DrXenos 17 Aug '02

17 Aug '02

I was wondering if anyone would be interested in a Set Library, similar to Pascal's set type for ordinal types. I want to make sure someone would fine it useful (and not trivial, done-to-death, etc.) before I take the time to "Boostify" it and get a release from my employer. A while ago I needed a set type that was compact, fast, and avoided heap allocation. The number of elements was constant for a particular set type, and the element type could be any integral type (primarily enums). Similar types from STL are set, vector<bool>, and bitset, but none quite suited the application. My set type (Set) stores elements at the bit level, like vector<bool> and bitset, but it allows the creation of compile-time set constants. Also, with a good optimizing compiler, operations on constant sets will be done at compile-time, though as of yet, there is no direct support for guaranteeing this in the code. The class provides the usual set operations. For efficiency, set operations are done in parallel groups of the machine's word size. So, set types whose max. number of elements is less than or equal to the machine's word size, will have most of its operations done in constant time (usually one machine instruction per operation). Sets whose max. number of elements is greater than the machine's word size will be done in linear time, usually in E / Wb cycles, where E is the max. number of elements and Wb is the machine's word size in bits. Though, with a good compile (through inlining and loop unrolling), this linear time would only be E / Wb instructions. On an average 32-bit processor, that's just 8 instructions to perform the union or intersection of a set of 256 elements. Originally, I avoided loops and used metatemplates to inline the operations, but this resulted in very long compile-times without any gains in performance! And sometimes it resulted in worse performance. That will teach me not to try and second guess today's optimizing compilers! As I stated above, the class template may be instantiated with any integral type, but it was primarily meant for enumerations with will give you the added bonuses of type-safely and symbolic names for the elements. The class assumes that the range given is not disjoint (i.e., 0-63 and not 0 - 16, 19, 63). You may use disjoint ranges, but your sets will contain wasted space. The only requirement is that the range of values is greater than or equal to zero, and that the element type has a representation for -1 (used as a (hidden) sentinel in argument lists of elements). You could even conceivably use a class that was "castable" to int. For example: // element type enum Color {red, orange, yellow, green, blue, violet, NumColors, NilColor = -1}; // type for set of colors typedef Set<Color, NumColors> ColorSet; // set constant const ColorSet rgb = ColorSet::SetOf<red, green, blue>::value(); // this is done at compile-time void foo() { // construction ColorSet s = ColorSet::SetOf<orange, yellow, violet>::value(); // this is done at compile-time ColorSet s1 = ColorSet(a); // this *may* be at compile-time ColorSet s2 = ColorSet(orange, yellow, violet); // this is NOT done at compile-time // (but allows non-constant elements) // operations, some of which *may* be done at compile-time by a smart compiler ColorSet a = s; // assignment ColorSet b = s + rgb; // union ColorSet c = s * rgb; // intersection ColorSet d = s - rgb; // difference ColorSet e = s / rgb; // symmetric difference bool b1 = s == rgb; // equality bool b1 = s != rgb; // unequality bool b3 = s >= rgb; // superset bool b4 = s > rgb; // proper superset bool b5 = s < rgb; // subset bool b6 = s > rgb; // proper subset if (b.contains(red)) // test for set membership std::cout << "b contains the element red" << std::endl; if (red == b) // same as above. can anyone suggest a better operator? // maybe use red -> b and use NULL for false? // or maybe remove and just use b.contains(red)? std::cout << "b contains the element red" << std::endl; } What do you think? Thanks, Rich (spamjunk(a)stny.rr.com)

1 0

RE: [Boost-Users] detail/lightweight_mutex.hpp
by Tom Matelich 16 Aug '02

16 Aug '02

> From: Peter Dimov [mailto:pdimov@mmltd.net] > > From: "Tom Matelich" <tmatelich(a)zetec.com> > > I'm attempting to go to Boost 1.28 on our HPUX 10.20 boxes. > I've run into > a > > problem with an assumption about the type of pthread_mutexattr_t. > > detail\lwm_pthreads.hpp calls: > > > > pthread_mutex_init(&m_, 0); > > > > HP's pthread.h (10.20 uses DCE) has that defined as: > > > > int pthread_mutex_init (pthread_mutex_t *,pthread_mutexattr_t); > > I don't know what to do about it. My POSIX draft says > > int pthread_mutex_init(pthread_mutex_t *restrict mutex, const > pthread_mutexattr_t *restrict attr); > > and goes on to specify that 0/NULL for the second argument > causes default > attributes to be used. > > I know little - if anything - about HPUX 10.20; if you find a > solution let > me know, and I'll incorporate it into lwm_pthreads.hpp. Sorry. > The dce documentation I see says to use pthread_mutexattr_default. http://www.transarc.ibm.com/Library/documentation/dce/1.1/pthread_mutex_init .html So, it looks like I need to find a version to if or ifdef off of. ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

detail/lightweight_mutex.hpp
by Tom Matelich 16 Aug '02

16 Aug '02

I'm attempting to go to Boost 1.28 on our HPUX 10.20 boxes. I've run into a problem with an assumption about the type of pthread_mutexattr_t. detail\lwm_pthreads.hpp calls: pthread_mutex_init(&m_, 0); HP's pthread.h (10.20 uses DCE) has that defined as: int pthread_mutex_init (pthread_mutex_t *,pthread_mutexattr_t); after tracing the typedef's down to <dce/cma.h>, I found pthread_mutexattr_t is this: typedef struct CMA_T_HANDLE { cma_t_address field1; short int field2; short int field3; } cma_t_handle; where cma_t_address is a void*. The error message is: .../boost/detail/lwm_pthreads.hpp: In method `boost::detail::lightweight_mutex::lightweight_mutex()': .../boost/detail/lwm_pthreads.hpp:40: conversion from `int' to non-scalar type `CMA_T_HANDLE' requested I'm not sure what solution to use here. Ifdefs are troublesome because it is hard to distinguish between HP 10.x and 11.x, which use different threading models. I don't know a lot about threads on HP, we use ACE so that we don't have to. One thing I do remember is that they conform to a fairly old revision of POSIX. I think attachments are prohibited on this list, so I will append pthread.h and dce/cma.h below. Thanks for your help, Tom <"pthread.h"> /* * (c) Copyright 1990, 1991, 1992, 1993 OPEN SOFTWARE FOUNDATION, INC. * ALL RIGHTS RESERVED * COPYRIGHT NOTICE * Copyright (c) 1990, 1991, 1992, 1993, 1994 Open Software Foundation, Inc. * ALL RIGHTS RESERVED (DCE). See the file named COPYRIGHT.DCE for * the full copyright text. */ /* * @(#)HP DCE/9000 1.5 * @(#)Module: pthread.h $Revision: /main/HPDCE02/5 $ $Date: 1995/07/11 17:25 UTC $ */ /* */ /* * %W% (DEC OSF/1) %G% */ /* * Copyright (c) 1990, 1992 by * Digital Equipment Corporation, Maynard Massachusetts. * All rights reserved. * * This software is furnished under a license and may be used and copied * only in accordance with the terms of such license and with the * inclusion of the above copyright notice. This software or any other * copies thereof may not be provided or otherwise made available to any * other person. No title to and ownership of the software is hereby * transferred. * * The information in this software is subject to change without notice * and should not be construed as a commitment by DIGITAL Equipment * Corporation. * * DIGITAL assumes no responsibility for the use or reliability of its * software on equipment which is not supplied by DIGITAL. */ /* * FACILITY: * * Common Multithread Architecture (CMA) services; POSIX 1003.4 interface * * ABSTRACT: * * External definitions for CMA's pthreads services * * AUTHORS: * * Dave Butenhof * * CREATION DATE: * * 20 February 1990 * * MODIFIED BY: * * Dave Butenhof * Paul Curtin * Webb Scales */ #ifndef PTHREAD #define PTHREAD #if !defined(__STDC__) && defined(_CMA_HP_INT_NONANSI) # include <dce/pthread_int.h> #else #ifdef vms # include <cma.h> #else# include <dce/cma.h> # include <signal.h> #endif #ifdef __cplusplus extern "C" { #endif /* * The implementation makes these basic decisions */ #ifndef _POSIX_THREADS # define _POSIX_THREADS #endif#ifndef _POSIX_THREAD_ATTR_STACKSIZE # define _POSIX_THREAD_ATTR_STACKSIZE #endif#if _CMA_KTHREADS_ != _CMA__MACH # define _POSIX_THREADS_REALTIME_SCHEDULING 1 #else#if defined (_POSIX_THREADS_REALTIME_SCHEDULING) # undef _POSIX_THREADS_REALTIME_SCHEDULING #endif#endif#ifndef _POSIX_THREADS_PER_PROCESS_SIGNALS_1 # define _POSIX_THREADS_PER_PROCESS_SIGNALS_1 1 #endif /* * Implement push and pop for cancellation handlers, using TRY and ENDTRY */ #define pthread_cleanup_push(routine,arg) \ { \ pthread_cleanup_t _XXX_proc = (pthread_cleanup_t)(routine); \ pthread_addr_t _XXX_arg = (arg); \ int _XXX_completed = 0; \ TRY { #define pthread_cleanup_pop(execute) \ _XXX_completed = 1;} \ FINALLY { \ int _XXX_execute = execute; \ if ((! _XXX_completed) || (_XXX_execute)) _XXX_proc (_XXX_arg);} \ ENDTRY} #define pthread_equal_np(thread1,thread2) \ (((thread1).field1 == (thread2).field1) \ && ((thread1).field2 == (thread2).field2) \ && ((thread1).field3 == (thread2).field3)) #define pthread_equal(thread1,thread2) \ (((thread1).field1 == (thread2).field1) \ && ((thread1).field2 == (thread2).field2) \ && ((thread1).field3 == (thread2).field3)) #define pthread_getunique_np(handle) \ ((unsigned int)((pthread_t *)handle)->field2) /* * Sample decisions for the environment types */ typedef cma_t_key pthread_key_t; typedef cma_t_address pthread_addr_t; /* * For compatibility with OSF/1 pthreads */ typedef pthread_addr_t any_t; typedef void (*pthread_cleanup_t) (pthread_addr_t); /* * Sample decision for a one-time initialization control block and its * initialization macro. * * Declare a one time initialization control block as: * * static pthread_once_t block = pthread_once_init; */ typedef cma_t_once pthread_once_t; #define pthread_once_init cma_once_init #define CANCEL_ON 1 #define CANCEL_OFF 0 /* * The following are the portable pthread definitions */ /* * Operations on Handles */ /* * Operations on attributes objects */ typedef cma_t_attr pthread_attr_t; /* * An attributes object is created to specify the attributes of other CMA * objects that will be created. */ int pthread_attr_create (pthread_attr_t *); /* * An attributes object can be deleted when it is no longer needed. */ int pthread_attr_delete (pthread_attr_t *); /* * Operations on threads */ typedef cma_t_thread pthread_t; typedef cma_t_start_routine pthread_startroutine_t; /* * For compatibility with OSF/1 pthreads */ typedef pthread_startroutine_t pthread_func_t; #define PTHREAD_INHERIT_SCHED ((int)cma_c_sched_inherit) #define PTHREAD_DEFAULT_SCHED ((int)cma_c_sched_use_default) #define SCHED_FIFO ((int)cma_c_sched_fifo) #define SCHED_RR ((int)cma_c_sched_rr) #define SCHED_FG_NP ((int)cma_c_sched_throughput) #define SCHED_BG_NP ((int)cma_c_sched_background) /* For compatibility with namespace collision due to POSIX.4 includes */ #ifndef _SYS_SCHED_INCLUDED # define SCHED_OTHER ((int)cma_c_sched_throughput) #endif #define PRI_FIFO_MIN ((int)cma_c_prio_fifo_min) #define PRI_FIFO_MAX ((int)cma_c_prio_fifo_max) #define PRI_RR_MIN ((int)cma_c_prio_rr_min) #define PRI_RR_MAX ((int)cma_c_prio_rr_max) #define PRI_FG_MIN_NP ((int)cma_c_prio_through_min) #define PRI_FG_MAX_NP ((int)cma_c_prio_through_max) #define PRI_BG_MIN_NP ((int)cma_c_prio_back_min) #define PRI_BG_MAX_NP ((int)cma_c_prio_back_max) #define PRI_OTHER_MIN ((int)cma_c_prio_through_min) #define PRI_OTHER_MAX ((int)cma_c_prio_through_max) /* * Operations to define thread creation attributes */ /* * Set or obtain the default thread priority. */ int pthread_attr_setprio (pthread_attr_t *,int); int pthread_attr_getprio (pthread_attr_t); /* * Set or obtain the default scheduling algorithm */ int pthread_attr_setsched (pthread_attr_t *,int); int pthread_attr_getsched (pthread_attr_t); /* * Set or obtain whether a thread will use the default scheduling attributes, * or inherit them from the creating thread. */ int pthread_attr_setinheritsched (pthread_attr_t *,int); int pthread_attr_getinheritsched (pthread_attr_t); /* * Set or obtain the default stack size */ int pthread_attr_setstacksize (pthread_attr_t *,long); long pthread_attr_getstacksize (pthread_attr_t); /* * Set or obtain the default guard size */ int pthread_attr_setguardsize_np (pthread_attr_t *,long); long pthread_attr_getguardsize_np (pthread_attr_t); /* * The following procedures can be used to control thread creation, * termination and deletion. */ /* * To create a thread object and runnable thread, a routine must be specified * as the new thread's start routine. An argument may be passed to this * routine, as an untyped address; an untyped address may also be returned as * the routine's value. An attributes object may be used to specify details * about the kind of thread being created. */ int pthread_create (pthread_t *,pthread_attr_t,pthread_startroutine_t,pthread_addr_t); /* * A thread object may be "detached" to specify that the return value and * completion status will not be requested. */ int pthread_detach (pthread_t *); /* * A thread may terminate it's own execution. */ void pthread_exit (pthread_addr_t); /* * A thread can await termination of another thread and retrieve the return * value of the thread. */ int pthread_join (pthread_t,pthread_addr_t *); /* * Thread Scheduling Operations */ /* * The current user_assigned priority of a thread can be changed. */ int pthread_setprio (pthread_t,int); /* * The current user_assigned scheduler algorithm of a thread can be changed. */ int pthread_setscheduler (pthread_t,int,int); /* * A thread may tell the scheduler that its processor can be made available. */ void pthread_yield (void); /* * Thread Information Operations */ /* * A thread may obtain a copy of its own thread handle. */ pthread_t pthread_self (void); /* * The current user_assigned priority of a thread can be read. */ int pthread_getprio (pthread_t); /* * The current user_assigned scheduler algorithm of a thread can be read. */ int pthread_getscheduler ( pthread_t); /* * Operations on Mutexes */ #define MUTEX_FAST_NP 0 #define MUTEX_RECURSIVE_NP 1 #define MUTEX_NONRECURSIVE_NP 2 typedef cma_t_attr pthread_mutexattr_t; typedef cma_t_mutex pthread_mutex_t; int pthread_mutexattr_create (pthread_mutexattr_t *); int pthread_mutexattr_delete (pthread_mutexattr_t *); int pthread_mutexattr_setkind_np (pthread_mutexattr_t *,int); int pthread_mutexattr_getkind_np (pthread_mutexattr_t); /* * The following routines create, delete, lock and unlock mutexes. */ int pthread_mutex_init (pthread_mutex_t *,pthread_mutexattr_t); int pthread_mutex_destroy (pthread_mutex_t *); int pthread_mutex_lock (pthread_mutex_t *); int pthread_mutex_trylock (pthread_mutex_t *); int pthread_mutex_unlock (pthread_mutex_t *); /* * Operations on condition variables */ typedef cma_t_attr pthread_condattr_t; typedef cma_t_cond pthread_cond_t; int pthread_condattr_create (pthread_condattr_t *); int pthread_condattr_delete (pthread_condattr_t *); /* * A thread can create and delete condition variables. */ int pthread_cond_init (pthread_cond_t *,pthread_condattr_t); int pthread_cond_destroy (pthread_cond_t *); /* * A thread can signal to and broadcast on a condition variable. */ int pthread_cond_broadcast (pthread_cond_t *); int pthread_cond_signal (pthread_cond_t *); int pthread_cond_signal_int_np (pthread_cond_t *); /* * A thread can wait for a condition variable to be signalled or broadcast. */ int pthread_cond_wait (pthread_cond_t *,pthread_mutex_t *); /* * Operations for timed waiting */ /* * A thread can perform a timed wait on a condition variable. */ int pthread_cond_timedwait (pthread_cond_t *,pthread_mutex_t *,struct timespec *); /* * Operations for client initialization. */ typedef void (*pthread_initroutine_t) (void); int pthread_once (pthread_once_t *,pthread_initroutine_t); /* * Operations for per-thread context */ typedef cma_t_destructor pthread_destructor_t; /* * A unique per-thread context key can be obtained for the process */ int pthread_keycreate (pthread_key_t *,pthread_destructor_t); /* * A thread can set a per-thread context value identified by a key. */ int pthread_setspecific (pthread_key_t,pthread_addr_t); /* * A thread can retrieve a per-thread context value identified by a key. */ int pthread_getspecific (pthread_key_t,pthread_addr_t *); /* * Operations for alerts. */ /* * The current thread can request that a thread terminate it's execution. */ int pthread_cancel (pthread_t); /* * The current thread can poll for alert delivery. */ void pthread_testcancel (void); /* * The current thread can enable or disable alert delivery (PTHREAD * "cancels"); it can control "general cancelability" (CMA "defer") or * just "asynchronous cancelability" (CMA "asynch disable"). */ int pthread_setasynccancel (int); int pthread_setcancel (int); _CMA_IMPORT_ pthread_attr_t pthread_attr_default; _CMA_IMPORT_ pthread_mutexattr_t pthread_mutexattr_default; _CMA_IMPORT_ pthread_condattr_t pthread_condattr_default; /* * Define nonportable extensions */ extern int pthread_get_expiration_np (struct timespec *,struct timespec *); extern int pthread_delay_np (struct timespec *); #if (_CMA_UNIX_TYPE == _CMA__SVR4) extern unsigned int pthread_delay_unsigned_np (unsigned int ); #endif /* (_CMA_UNIX_TYPE == _CMA__SVR4) */ extern void pthread_lock_global_np (void); extern void pthread_unlock_global_np (void); # if _CMA_OS_ != _CMA__VMS extern int pthread_signal_to_cancel_np (sigset_t *,pthread_t *); # endif #ifdef __hpux extern int pthread_is_multithreaded_np (void); #endif #ifdef __cplusplus } #endif #endif /* _CMA_HP_INT_NONANSI */ #endif </"pthread.h"> <"dce/cma.h"> /* * (c) Copyright 1990, 1991, 1992, 1993 OPEN SOFTWARE FOUNDATION, INC. * ALL RIGHTS RESERVED * COPYRIGHT NOTICE * Copyright (c) 1990, 1991, 1992, 1993, 1994 Open Software Foundation, Inc. * ALL RIGHTS RESERVED (DCE). See the file named COPYRIGHT.DCE for * the full copyright text. * * (c) Copyright 1991, 1992 Siemens-Nixdorf Information Systems * Burlington, MA, USA */ /* * @(#)HP DCE/9000 1.5 * @(#)Module: cma.h $Revision: /main/HPDCE02/3 $ $Date: 1995/09/07 19:35 UTC $ */ /* */ /* * %W% (DEC OSF/1) %G% */ /* * Copyright (c) 1988, 1992 by * Digital Equipment Corporation, Maynard Massachusetts. * All rights reserved. * * This software is furnished under a license and may be used and copied * only in accordance with the terms of such license and with the * inclusion of the above copyright notice. This software or any other * copies thereof may not be provided or otherwise made available to any * other person. No title to and ownership of the software is hereby * transferred. * * The information in this software is subject to change without notice * and should not be construed as a commitment by DIGITAL Equipment * Corporation. * * DIGITAL assumes no responsibility for the use or reliability of its * software on equipment which is not supplied by DIGITAL. */ /* * FACILITY: * * Digital's Proprietary Interface to DECthreads (CMA) * * ABSTRACT: * * External definitions for CMA services * * AUTHORS: * * Dave Butenhof * * CREATION DATE: * * 2 November 1988 * * MODIFIED BY: * * Dave Butenhof * Bob Conti * Paul Curtin * Hans Oser * Webb Scales */ #ifndef CMA_INCLUDE #define CMA_INCLUDE /* * Define a symbol which client code can test to determine whether the * underlying threads package is DECthreads or not. This is especially * important to clients of the Pthreads interface who may want to use * certain DECthreads extensions, such as the global lock and non-real-time * scheduling policies, on the DECthreads platform while maintaining * portability to a "vanilla" pthreads implementation. */ #define _DECTHREADS_ 1 /* * The implementation makes these basic decisions */ #if defined(vms) || defined(__vms) || defined (VMS) || defined(__VMS) || defined(__vms__) # include <cma_config.h> /* configuration symbols */ #else# include <dce/cma_config.h> /* configuration symbols */ #endif /* For HP_UX, specifies which version of the operating system we are building on */ #if _CMA_VENDOR_ == _CMA__HP # include <dce/hpdce_platform.h> #endif /* Fix ordering problem with "wait" definition in HP-UX 1010 header files */ #if defined(__hpux1010p) # define wait cma_wait #endif #if (_CMA_UNIX_TYPE == _CMA__SVR4) && (_CMA_REENTRANT_CLIB_) # if defined _libcma_code_ # include <cma_libc_redefs.h> # endif#endif #if _CMA_OS_ != _CMA__VMS # include <sys/types.h> # include <sys/time.h> #endif #if _CMA_OS_ == _CMA__VMS # include <exc_handling.h> /* Bring in exception services */ #else# include <dce/exc_handling.h> /* Bring in exception services */ #endif #if (_CMA_OSIMPL_ == _CMA__OS_OSF) && _CMA_REENTRANT_CLIB_ # define _REENTRANT 1 /* Enable reentrant errno.h */ #endif #if (_CMA_VENDOR_ == _CMA__HP) && _CMA_REENTRANT_CLIB_ # ifndef _REENTRANT # define _REENTRANT 1 # endif#endif #ifdef __cplusplus extern "C" { #endif /* * Sample decisions for the environment types */ typedef int cma_t_integer; typedef unsigned int cma_t_boolean; typedef unsigned int cma_t_natural; typedef float cma_t_interval; typedef int cma_t_key; typedef int cma_t_status; typedef int cma_t_priority; #if _CMA_VOID_ typedef void *cma_t_address; #elsetypedef char *cma_t_address; #endif #define cma_c_false (cma_t_boolean)0 #define cma_c_true (cma_t_boolean)1 #define cma_c_null_ptr (cma_t_address)0 #define cma_c_prio_fifo_min 16 #define cma_c_prio_fifo_mid 24 #define cma_c_prio_fifo_max 31 #define cma_c_prio_rr_min 16 #define cma_c_prio_rr_mid 24 #define cma_c_prio_rr_max 31 #define cma_c_prio_through_min 8 #define cma_c_prio_through_mid 12 #define cma_c_prio_through_max 15 #define cma_c_prio_back_min 1 #define cma_c_prio_back_mid 4 #define cma_c_prio_back_max 7 #define cma_c_prio_ada_low_min 0 #define cma_c_prio_ada_low_mid 4 #define cma_c_prio_ada_low_max 7 /* * The implementation of the cma_t_date_time type should match the "native * time" of the platform: that allows clients to use the full set of platform * time operations, rather than just "cma_get_expiration", to compute and * test timed waits. * * This section assumes the platform is either "VMS" or "UNIX-ish". Others * will require changes. */ #if _CMA_OS_ == _CMA__VMS typedef struct CMA_T_DATE_TIME { unsigned long int low; unsigned long int high; } cma_t_date_time; #elsetypedef struct timeval cma_t_date_time; #endif #ifdef __hpux /* * Structure for C++ callbacks */ typedef struct CB_STRUCT { void (*start)(); void (*end)(); void (*out)(); void (*in)(); } _ctxcb_spec_t; #endif /* * Sample decisions for what handles shall be */ typedef struct CMA_T_HANDLE { cma_t_address field1; short int field2; short int field3; } cma_t_handle; #define cma_thread_get_unique(handle) \ ((unsigned int)((cma_t_thread *)handle)->field2) #define cma_c_handle_size sizeof(cma_t_handle) typedef cma_t_handle cma_t_mutex; /* Needed for CMA_ONCE_BLOCK */ /* * Predefined null handle */ #ifndef _CMA_SUPPRESS_EXTERNALS_ _CMA_IMPORT_ cma_t_handle cma_c_null; #endif /* * Sample decision for a one-time initialization control block and its * initialization macro. * * Declare a one time initialization control block as: * * static cma_t_once block = cma_once_init; */ typedef struct CMA_T_ONCE { cma_t_integer field1; cma_t_integer field2; cma_t_integer field3; } cma_t_once; #define cma_once_init {0, 0, 0} /* * Sample decision for a variable to save the current alert state. */ typedef struct CMA_T_ALERT_STATE { cma_t_integer state1; cma_t_integer state2; } cma_t_alert_state; /* * The following are the portable CMA definitions */ /* * Operations on Handles */ /* * The value of a handle can be assigned the value of another handle. */ extern void cma_handle_assign (cma_t_handle *, cma_t_handle *); /* * The value of a handle can be compared to the value of another handle. */ extern cma_t_boolean cma_handle_equal ( cma_t_handle *, cma_t_handle *); /* * Operations on attributes objects */ typedef cma_t_handle cma_t_attr; /* * An attributes object is created to specify the attributes of other CMA * objects that will be created. */ extern void cma_attr_create (cma_t_attr *,cma_t_attr *); /* * An attributes object can be deleted when it is no longer needed. */ extern void cma_attr_delete (cma_t_attr *); /* * Operations on threads */ typedef cma_t_handle cma_t_thread; typedef cma_t_address (*cma_t_start_routine) (cma_t_address); typedef enum CMA_T_EXIT_STATUS { cma_c_term_error = 0, cma_c_term_normal = 1, cma_c_term_alert = 2 } cma_t_exit_status; typedef enum CMA_T_SCHED_INHERIT { cma_c_sched_inherit = 0, cma_c_sched_use_default = 1 } cma_t_sched_inherit; typedef enum CMA_T_SCHED_POLICY { cma_c_sched_fifo = 0, cma_c_sched_rr = 1, cma_c_sched_throughput = 2, cma_c_sched_background = 3, cma_c_sched_ada_low = 4 } cma_t_sched_policy; #define cma_c_sched_default cma_c_sched_throughput #define cma_c_sched_other cma_c_sched_default /* * The following procedures can be used to control thread creation, * termination and deletion. */ /* * To create a thread object and runnable thread, a routine must be specified * as the new thread's start routine. An argument may be passed to this * routine, as an untyped address; an untyped address may also be returned as * the routine's value. An attributes object may be used to specify details * about the kind of thread being created. */ extern void cma_thread_create (cma_t_thread *,cma_t_attr *,cma_t_start_routine,cma_t_address); /* * A thread object may be "detached" to specify that the return value and * completion status will not be requested. */ extern void cma_thread_detach (cma_t_thread *); /* * A thread may terminate it's own execution. */ extern void cma_thread_exit_error (void); extern void cma_thread_exit_normal (cma_t_address); /* * A thread can await termination of another thread and retrieve the return * value and completion status of the thread. */ extern void cma_thread_join (cma_t_thread *,cma_t_exit_status *,cma_t_address *); /* * Operations to define thread creation attributes */ /* * Set or obtain the default thread priority. */ extern void cma_attr_set_priority (cma_t_attr *,cma_t_priority); extern void cma_attr_get_priority (cma_t_attr *,cma_t_priority *); /* * Set or obtain the default scheduling algorithm */ extern void cma_attr_set_sched (cma_t_attr *,cma_t_sched_policy ,cma_t_priority); extern void cma_attr_get_sched (cma_t_attr *,cma_t_sched_policy *); /* * Set or obtain whether a thread will use the default scheduling attributes, * or inherit them from the creating thread. */ extern void cma_attr_set_inherit_sched (cma_t_attr *,cma_t_sched_inherit); extern void cma_attr_get_inherit_sched (cma_t_attr *,cma_t_sched_inherit *); /* * Set or obtain the default stack size */ extern void cma_attr_set_stacksize (cma_t_attr *,cma_t_natural); extern void cma_attr_get_stacksize (cma_t_attr *,cma_t_natural *); /* * Set or obtain the default guard size */ extern void cma_attr_set_guardsize (cma_t_attr *,cma_t_natural); extern void cma_attr_get_guardsize (cma_t_attr *,cma_t_natural *); /* * Thread Scheduling Operations */ /* * The current user_assigned priority of a thread can be changed. */ extern void cma_thread_set_priority (cma_t_thread *,cma_t_priority); /* * The current user_assigned scheduler algorithm of a thread can be changed. */ extern void cma_thread_set_sched (cma_t_thread *,cma_t_sched_policy,cma_t_priority); /* * A thread may tell the scheduler that its processor can be made available. */ extern void cma_yield (void); #ifndef _HP_CMA_PERF_ extern void cma_yield_noselect (void); #endif /* _HP_CMA_PERF_ */ /* * A thread may enter a wait state for a speciifed period of time. */ extern void cma_delay (cma_t_interval); /* * Thread Information Operations */ /* * A thread may obtain a copy of its own thread handle. */ extern void cma_thread_get_self (cma_t_thread *); /* * The current user_assigned priority of a thread can be read. */ extern void cma_thread_get_priority (cma_t_thread *,cma_t_priority *); /* * The current user_assigned scheduler algorithm of a thread can be read. */ extern void cma_thread_get_sched (cma_t_thread *,cma_t_sched_policy *); /* * Operations on Mutexes */ typedef enum CMA_T_MUTEX_KIND { cma_c_mutex_fast = 0, cma_c_mutex_recursive = 1, cma_c_mutex_nonrecursive = 2 } cma_t_mutex_kind; /* * Operations to define mutex creation attributes */ /* * Set or obtain whether mutex locks can nest. */ extern void cma_attr_set_mutex_kind (cma_t_attr *,cma_t_mutex_kind); extern void cma_attr_get_mutex_kind (cma_t_attr*,cma_t_mutex_kind *); /* * The following routines create, delete, lock and unlock mutexes. */ extern void cma_mutex_create (cma_t_mutex *,cma_t_attr *); extern void cma_mutex_delete (cma_t_mutex *); extern void cma_mutex_lock (cma_t_mutex *); extern cma_t_boolean cma_mutex_try_lock (cma_t_mutex *); extern void cma_mutex_unlock (cma_t_mutex *); extern void cma_lock_global (void); extern void cma_unlock_global (void); /* * Operations on condition variables */ typedef cma_t_handle cma_t_cond; /* * A thread can create and delete condition variables. */ extern void cma_cond_create (cma_t_cond *,cma_t_attr *); extern void cma_cond_delete (cma_t_cond *); /* * A thread can signal to and broadcast on a condition variable. */ extern void cma_cond_broadcast (cma_t_cond *); extern void cma_cond_signal (cma_t_cond *); extern void cma_cond_signal_int (cma_t_cond *); /* * A thread can wait for a condition variable to be signalled or broadcast. */ extern void cma_cond_wait (cma_t_cond *,cma_t_mutex *); /* * Operations for timed waiting */ /* * A thread can perform a timed wait on a condition variable. */ extern cma_t_status cma_cond_timed_wait (cma_t_cond *,cma_t_mutex *,cma_t_date_time *); /* * A thread may perform some operations on absolute date-time and intervals. */ extern void cma_time_get_expiration (cma_t_date_time *,cma_t_interval ); /* * Operations for CMA and client initialization. */ /* * Initialize the CMA facility. */ extern void cma_init (void); /* * A thread can declare a one-time initialization routine. The address of * the init block and routine are passed as parameters. */ typedef void (*cma_t_init_routine) (cma_t_address); extern void cma_once (cma_t_once *_block,cma_t_init_routine,cma_t_address); /* * Operations for per-thread context */ typedef void (*cma_t_destructor) (cma_t_address); /* * A unique per-thread context key can be obtained for the process */ extern void cma_key_create (cma_t_key *,cma_t_attr *,cma_t_destructor); /* * A thread can set a per-thread context value identified by a key. */ extern void cma_key_set_context (cma_t_key,cma_t_address); /* * A thread can retrieve a per-thread context value identified by a key. */ extern void cma_key_get_context (cma_t_key,cma_t_address *_value); /* * Operations for alerts. */ /* * The current thread can request that a thread terminate it's execution. */ extern void cma_thread_alert (cma_t_thread *); /* * The current thread can poll for alert delivery. */ extern void cma_alert_test (void); /* * The current thread can disable asynchronous alert delivery, restore the * previous state of asynchronous alert delivery, or enable asynchronous * alert delivery. */ extern void cma_alert_disable_asynch (cma_t_alert_state *); extern void cma_alert_disable_general (cma_t_alert_state *); extern void cma_alert_enable_asynch (void); extern void cma_alert_enable_general (cma_t_alert_state *); extern void cma_alert_restore (cma_t_alert_state *); /* * Operations on stacks */ typedef cma_t_handle cma_t_stack_np; typedef void (*cma_t_call_routine) (void); /* * Allocate stack space */ extern void cma_stack_allocate_np (cma_t_integer,cma_t_address *); /* * Assign a stack to a thread */ extern void cma_stack_assign_np (cma_t_stack_np *,cma_t_thread *); /* * Call a routine on a new stack */ extern void cma_stack_call_routine_np (cma_t_stack_np *,cma_t_call_routine,cma_t_address,cma_t_address *); /* * Check stack limit */ extern cma_t_boolean cma_stack_check_limit_np (cma_t_integer); /* * Create a new stack */ extern void cma_stack_create_np (cma_t_stack_np *,cma_t_attr *); /* * Delete a stack */ extern void cma_stack_delete_np (cma_t_stack_np *); /* * Debug threads */ extern void cma_debug (void); extern void cma_debug_cmd (char *, ...); #ifndef _CMA_SUPPRESS_EXTERNALS_ _CMA_IMPORT_ void (*cma_g_debug) (void); #endif #ifdef __cplusplus } #endif # if defined(_HP_LIBC_R) && defined(__hpux1010p) # define sigaction _sigaction_sys # endif # if _CMA_OS_ == _CMA__VMS # include <cma_px.h> # else# include <dce/cma_px.h> # endif #if _CMA_UNIPROCESSOR_ # if _CMA_OS_ == _CMA__VMS # include <cmalib_crtlx.h> # else# include <dce/cmalib_crtlx.h> # endif#endif # ifndef _CMA_NOWRAPPERS_ # if !_CMA_REENTRANT_CLIB_ # if _CMA_OS_ == _CMA__VMS # include <cmalib_crtlx.h> # else# include <dce/cma_errno.h> # include <dce/cmalib_crtlx.h> # include <dce/cma_stdio.h> # endif# elif (_CMA_UNIX_TYPE == _CMA__SVR4) /* * SVR4 reentrant libraries do not have per-thread errno. */ # include <dce/cma_errno.h> # endif# if _CMA_OS_ == _CMA__UNIX # include <dce/cma_ux.h> # endif# if _CMA_OS_ == _CMA__VMS # include <cma_sigwait.h> # else# include <dce/cma_sigwait.h> # endif# endif # ifdef _HP_LIBC_R # undef wait # include <cma_libc_calls.h> # endif #endif </"dce/cma.h> ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

2 1

boost python error catching
by cseymour＠interchange.ubc.ca 15 Aug '02

15 Aug '02

Hi, I have some code that worked fine with Python 2.1, but now in Python 2.2.1 it segfaults mysteriuosly. I've narrowed it down to weirdness with the throw/catch of errors. When I do a throw "boost::python::error_already_set();", the "catch(...)" in my module cpp file is supposed to catch it. But it never gets to there. After it's thrown, Python just segfaults and dies. In Python 2.1 it worked perfectly but not in 2.2.1. Any suggestions?

1 0

Boost 1.28 and compile failure in use_count_is_zero class
by david_at_2good 15 Aug '02

15 Aug '02

I am using the free C++Builder Compiler version 5.5.1 for Win32. (http://www.borland.com/products/downloads/download_cbuilder.html) I have used Boost 1.27 without problems, but when compiling the same code with Boost 1.28 I get this error message for the compiler: Error E2113 c:\borland\boost_1_28_0\boost/detail/shared_count.hpp 39: Virtual function 'use_count_is_zero::what() const throw()' conflicts with base class 'exception' The class use_count_is_zero (new in Boost 1.28) inherits from std::exception, and it seems like the method prototype for what() is different in the Borland include files and Boost. Boost: class use_count_is_zero: public std::exception { public: virtual char const * what() const throw() { return "use_count_is_zero"; } }; Borland, who seem to use STL from Rogue Wave Software: class _RWSTDExport exception { public: exception () _RWSTD_THROW_SPEC_NULL { ; } exception (const exception&) _RWSTD_THROW_SPEC_NULL { ; } #if defined(_MSC_VER) && !defined(__BORLANDC__) exception (const char *s) _RWSTD_THROW_SPEC_NULL { ; } #endif exception& operator= (const exception& e) _RWSTD_THROW_SPEC_NULL { return *this; } virtual ~exception () _RWSTD_THROW_SPEC_NULL; virtual const char * what () const _RWSTD_THROW_SPEC_NULL { return __RWSTD::__rw_stdexcept_NoNamedException; } }; The content of _RWSTD_THROW_SPEC_NULL is set in the file stdcomp.h, and it seems like it is empty for the Borland compiler, so I tried to copy the declaration from Borland like below, but got the same error. class use_count_is_zero: public std::exception { public: virtual const char * what () const _RWSTD_THROW_SPEC_NULL { return "use_count_is_zero"; } }; Any suggestions? \David

2 4

boost.bind and g++ 2.95.3 woes
by yg-boost-users＠m.gmane.org 15 Aug '02

15 Aug '02

Hi there, I have a problem compiling the following code with g++ 2.95.3 and boost 1.28.0. ---%<--- #include <boost/bind.hpp> #include <boost/function/function0.hpp> struct A { A(boost::function0<void> const &) { } }; void foo(boost::function0<void> const &) {} void bar(unsigned int) {} int main(int argc, char *argv[]) { boost::bind(foo, boost::bind(bar, 0)); // ok A a1(boost::bind(bar, 0)); // ok A a2(boost::bind(foo, boost::bind(bar, 0))); // error return 0; } --->%--- The line marked with error gives me a whole flood of error messages. Is this a problem with my version of gcc? Or am I doing a stupid mistake? TIA, Markus PS: Here are the errors I get: /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp: In method `boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int>::function0<void>(void)': /opt/ginit/lib/boost-1.28.0/boost/bind.hpp:163: instantiated from `boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > >::operator ()<void, void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &), boost::_bi::list0>(boost::_bi::type<void>, void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &), boost::_bi::list0 &) const' /opt/ginit/lib/boost-1.28.0/boost/bind/bind_template.hpp:21: instantiated from `boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >::operator ()()' /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:127: instantiated from `boost::detail::function::void_function_obj_invoker0<boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >,void>::invoke(boost::detail::function::any_pointer)' /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:437: instantiated from `boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int>::assign_to<boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > > >(boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >, boost::detail::function::function_obj_tag)' /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:388: instantiated from `boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int>::assign_to<boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > > >(boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >)' /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:274: instantiated from `boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int>::function0<boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > > >(boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >)' test_bind.cpp:16: instantiated from here /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:271: parameter `f' declared void /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:274: `f' undeclared (first use this function) /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:274: (Each undeclared identifier is reported only once /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:274: for each function it appears in.) /opt/ginit/lib/boost-1.28.0/boost/bind.hpp: In method `void boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > >::operator ()<void, void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &), boost::_bi::list0>(boost::_bi::type<void>, void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &), boost::_bi::list0 &) const': /opt/ginit/lib/boost-1.28.0/boost/bind/bind_template.hpp:21: instantiated from `boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >::operator ()()' /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:127: instantiated from `boost::detail::function::void_function_obj_invoker0<boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >,void>::invoke(boost::detail::function::any_pointer)' /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:437: instantiated from `boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int>::assign_to<boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > > >(boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >, boost::detail::function::function_obj_tag)' /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:388: instantiated from `boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int>::assign_to<boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > > >(boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >)' /opt/ginit/lib/boost-1.28.0/boost/function/function_template.hpp:274: instantiated from `boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int>::function0<boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > > >(boost::_bi::bind_t<void,void (*)(const boost::function0<void,boost::empty_function_policy,boost::empty_function_mixin,int> &),boost::_bi::list1<boost::_bi::bind_t<void,void (*)(unsigned int),boost::_bi::list1<boost::_bi::value<int> > > > >)' test_bind.cpp:16: instantiated from here /opt/ginit/lib/boost-1.28.0/boost/bind.hpp:163: Internal compiler error in `emit_move_insn_1', at expr.c:2829 Please submit a full bug report. See <URL:http://www.gnu.org/software/gcc/bugs.html> for instructions.

3 2

gcc 2.95.3 vs gcc 3.1.1 vs intel c++ 6.0 with BGL and MTL
by Wintermantel , Marc 15 Aug '02

15 Aug '02

Hi, We are working on a Finite Element Library (FELyX - http://felyx.sourceforge.net <http://felyx.sourceforge.net/> ) that makes intensive use of the Boost Graph Library (BGL) as well as the Matrix Template Library (MTL). Up to now we worked with gcc 2.95.3 on Linux (AMD XP2000+ and P4 2.2GHz). Due to several sources on the internet we heard, that gcc 3.1.1 should be at least as fast as gcc 2.95.3 and the Intel c++ 6.0 should be even quite a bit faster then the other two. We used with all three of them -O3 Optimization, but our results up to now are rather disappointing. For a typical calculation we received the following results: Gcc 2.95.3 3.5 sec Gcc 3.1.1 3.9 sec Intel C++ 6.0 8.2 sec The results were quasi identical on both machines. We also tried a Intel PIII 850MHz in a notebook, and the times just scaled up. Further we looked at BGL, MTL and our own code separately and it came out that every part of the code loses almost equally compared to 2.95.3. Has anybody similar experiences or a hint what we could do wrong? Yours truly, Marc Wintermantel Marc Wintermantel IMES - Structures Technology ETH Zurich, LEO C4 Leonhardstrasse 27 CH- 8092 Zurich Tel. ++41 1 633 35 32 Fax. ++41 1 632 17 02 [Non-text portions of this message have been removed]

1 0

re: python weirdness
by cseymour＠interchange.ubc.ca 14 Aug '02

14 Aug '02

hi, i fixed that problem, by using linux_gcc.mak instead of gcc.mak, though now i'm back to where i was with older Boost, where i'm getting seg faults instead of Python errors. (btw linux_gcc.mak is kind of off: the suggested path for the BOOST macro is incorrect, and where $(BOOST) is used I found actually $(ROOT) should be used)

1 0

boost python weirdness - python2.2.1
by cseymour＠interchange.ubc.ca 14 Aug '02

14 Aug '02

hi, I had this extension module for python working fine with older versions of Boost and Python 2.1 but now we've updated to gcc 3 and Python 2.2 and it crashes weirdly, so I decided to try the latest version of Boost. I built the boost python library using /libs/python/build/gcc.mak. Everything seems okay, but when I try to load my library in Python I get: ImportError: ./HDF.so: undefined symbol: do_call__CQ45boost6python6detail4initP7_objectT1 when I check the symbols in my library I have this: U do_call__CQ45boost6python6detail4initP7_objectT1 and a whole lot of things like this: 00199d70 W do_call__CQ45boost6python6detailt24wrapped_function_pointer2ZQ23hdf11HDFVariableZPMQ23hdf7HDFFileFPQ23hdf7HDFFileRCQ35boost6python6stringcRCQ35boost6python5tuple_Q23hdf11HDFVariableP7_objectT1

1 0

graph: edge cuts
by Matthew Galati 14 Aug '02

14 Aug '02

is this a place for simple usage questions? i am a newbie... i want to use graph to return the set of edges in a cut for an undirected graph... that is, for some subset W of N, i want all e = {i in N, j in N} in E such that i is in W and j is not in W is there something built into graph to do this? or should i just do it manually from the adjacency list? thanks, matt -- Matthew Galati Lehigh University, Bethlehem, PA - Operations Research, M.S. Stetson University, Deland, FL - Mathematics, B.S. Office Phone: 610-758-4042 Email: magh(a)lehigh.edu URL: http://www.lehigh.edu/~magh/magh.html

2 1

adge properties getting corrupted when removing edge
by Jakub Plichta 13 Aug '02

13 Aug '02

Hello I have encountered the following problem and so far I have not been able to find a workaround. I start with a bidirectional graph with 4 nodes A, B, C and D. There is a integer edge property installed and I have following edges and their respective properties: E1 = C->B; prop[E1] = 0 E2 = D->B; prop[E2] = 1 E3 = B->A; prop[E3] = 0 I am removing edge E3 and immediately after remove_edge the property for E1 is 1 which is wrong. Is this a known issue? I would really appreciate any suggestions. Thanks Jakub Plichta [Non-text portions of this message have been removed]

1 0

boost::function Usage Question
by Albrecht Fritzsche 13 Aug '02

13 Aug '02

Consider the following code: class Publisher { typedef boost::function<void> Function; public: void SetChecker(const Function& Callback){ } }; class Manager { public: Manager(); private: void Check() {} }; Manager::Manager() { Publisher d; d.SetChecker(std::mem_fun(&Manager::Check)); } How can I get this to work? I always get an error when compiling the last line stating "..boost\function\function_template.hpp(127) : error C2660: '()' : Funktion akzeptiert keine 0 Parameter" Ah, the compiler is VisC++ 6. Thanks for any help Ali

3 6

How to add user's rule to ALL?
by Lev Assinovsky 13 Aug '02

13 Aug '02

Hello folks! I defined my own rule to provide resource compilation. I put invocation of the rule in my Jambase file. But when I run bjam (not jam!) it skipped my rule. I believe that happens because my rule doesn't belong to 'all' list :"exe, lib ..." Should I try to define my rule in the style of EXE or there is more easy way to provide user''s rule invocation in BJAM? Any help will be appreciated! msvc-tools.jam: ------------------ cut here ------------------------ # resource rules for NT rule rescomp { DEPENDS $(<) : $(>) ; rescomp-impl $(<) : $(>) ; } actions rescomp-impl { rc /l "0x409" /d "_DEBUG" "$(>)" } ------------------------------------------------------- Jamfile: ---------------- cut here -------------------------- subproject ICIDM ; rescomp ICIDM.res : ICIDM.rc ; dll ICIDM : ICIDM.cpp ICIDMInterfaces.cpp SWMRGuard.cpp SysDep.cpp : <include>$(ADC_ROOT) <include>$(BOOST_ROOT) ; exe test : test.cpp <dll>ICIDM : <include>$(ADC_ROOT) <include>$(BOOST_ROOT) ; ------------------------------------------------------- ---- Lev Assinovsky Aelita Software Corporation O&S Core Division, Programmer ICQ# 165072909 [Non-text portions of this message have been removed]

1 0

Problem with using special function
by sen_al2002 12 Aug '02

12 Aug '02

Hi, I am new to boost libraries. I just downloaded the whole BOOST_1_28_0 and I added the directory to compiler's list of #include<...> search paths but I still get error when I try to use the atanh() function. I am using Visual C++ v6.0 The error message reads d:\boost_1_28_0\atanh.hpp(77) : error C2989: 'atanh_helper1_t<T,0>' : template class has already been defined as a non-template class Could someone please help me out. Thanks Sen

2 1

RE: [Boost-Users] Getting the hang of Boost::Bind
by Tom Matelich 12 Aug '02

12 Aug '02

> -----Original Message----- > From: Douglas Gregor [mailto:gregod@cs.rpi.edu] > Sent: Friday, August 09, 2002 3:32 PM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] Getting the hang of Boost::Bind > > > On Friday 09 August 2002 06:08 pm, Tom Matelich wrote: > > I have a vector of > > > > class Landmark > > { > > public: > > std::string const& getName() const; > > ... > > }; > > > > I want to do a find_if for a name that I have. > > > > something like > > std::find_if(begin, end, boost::bind(std::equal<std::string>(???, > > name_to_find))); > > > > What do I put for the ??? ? > > I presume that [begin, end) is an iterator sequence of > Landmark instances? > Then ??? = boost::bind(&Landmark::getName, _1), meaning that > the first > parameter to std::equal<std::string>::operator() is a call to > Landmark::getName where the object parameter (this) is the > first argument > (_1) to the bind function object. Thanks for the quick reply. That's what I thought. To make things more concrete... std::vector<Landmark> v; ... std::vector<Landmark>::const_iterator iter = std::find_if(v.begin(), v.end(), boost::bind(std::equal<std::string>, boost::bind(ZLandmark::Landmark::getName, _1), name_to_find)); Is what I think you're telling me. Perhaps I should mention now that I am using VC6. Compiling the above line I get many errors, here are the first three: inspdoc.cpp(453) : error C2780: 'class boost::_bi::bind_t<R,class boost::_mfi::dm<R,T>,class boost::_bi::list1<class boost::_bi::value<R> > > __cdecl boost::bind(R T::*,A1)' : expects 2 arguments - 3 provided c:\dev\opt\include\boost/bind.hpp(1362) : see declaration of 'bind' inspdoc.cpp(453) : error C2780: 'class boost::_bi::bind_t<R,struct boost::_mfi::cmf8<R,T,B1,B2,B3,B4,B5,B6,B7,B8>,class boost::_bi::list9<class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R> > > __cdecl boost::bind(R (__thiscall T::*)(B1,B2,B3,B4,B5,B6,B7, B8) const,A1,A2,A3,A4,A5,A6,A7,A8,A9)' : expects 10 arguments - 3 provided c:\dev\opt\include\boost/bind/bind_mf_cc.hpp(223) : see declaration of 'bind' inspdoc.cpp(453) : error C2780: 'class boost::_bi::bind_t<R,struct boost::_mfi::mf8<R,T,B1,B2,B3,B4,B5,B6,B7,B8>,class boost::_bi::list9<class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R>,class boost::_bi::value<R> > > __cdecl boost::bind(R (__thiscall T::*)(B1,B2,B3,B4,B5,B6,B7,B 8),A1,A2,A3,A4,A5,A6,A7,A8,A9)' : expects 10 arguments - 3 provided c:\dev\opt\include\boost/bind/bind_mf_cc.hpp(212) : see declaration of 'bind' Oh, and I guess that should be std::equal_to, right? Didn't work either though. Thanks, Tom PS Unfortunately, I have to run. I'll be looking at this again this weekend though. ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

3 3

Changes I made to get boost::pool code to compile/execute under CW 8.1
by Ray S. Gallimore 12 Aug '02

12 Aug '02

Here is what I did to get boost::pool to compile/execute on CW 8.1: test_pool_alloc.cpp ============= 1) To execute w/o memory access violations, define BOOST_NO_PROPER_STL_DEALLOCATE sys_allocator.hpp =========== 1) To compile, change signature of allocate in both allocators from: static pointer allocate(const size_type n, const pointer = 0) to: static pointer allocate(const size_type n, const void* = 0) 2) To get time_pool_alloc.cpp to execute w/o memory access violations, change definition of new_delete_allocator from: { delete [] p; } to: { delete [] (char*)p; } Ray Gallimore

1 0

Why does BGL use friend instead of member functions?
by Louis Lavery 11 Aug '02

11 Aug '02

Hi, It appears, to me, that the boost graph classes use friend functions and apposed to member functions. What are the reasons for this design decision (I like it) and why is the graph passed as the last argument? Thanks, Louis. PS. Great graph - great book.

2 1

Bad rules in bjam
by Lev Assinovsky 10 Aug '02

10 Aug '02

Hi folks! I found out that two major rules (from "allyourbase.jam") differ from classic Jam and can't work with full power (with gcc on solaris8-x86 at least). * Thus 'EXE' rule doesn't allow you linking with 3-rd party library (flag LINKFLAGS is ignored). * 'Main' rule skips compilation phase, though it's declared in the same allyourbase.jam: # Main image : source ; link executable from compiled sources Anyone experienced this? P.S. I had to built bjam since distribution doesn't have a pre-built version for solaris8-x86. ---- Lev Assinovsky Aelita Software Corporation O&S Core Division, Programmer ICQ# 165072909 [Non-text portions of this message have been removed]

2 1

Getting the hang of Boost::Bind
by Tom Matelich 09 Aug '02

09 Aug '02

I have a vector of class Landmark { public: std::string const& getName() const; ... }; I want to do a find_if for a name that I have. something like std::find_if(begin, end, boost::bind(std::equal<std::string>(???, name_to_find))); What do I put for the ??? ? Thanks, Tom ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

3 2

RE: [Boost-Users] Getting the hang of Boost::Bind
by Tom Matelich 09 Aug '02

09 Aug '02

> -----Original Message----- > From: Duane Murphy [mailto:duanemurphy@mac.com] > Sent: Friday, August 09, 2002 3:23 PM > To: Boost Users > Subject: Re: [Boost-Users] Getting the hang of Boost::Bind > > > --- At Fri, 9 Aug 2002 15:08:06 -0700, Tom Matelich wrote: > > >I have a vector of > > > >class Landmark > >{ > >public: > > std::string const& getName() const; > >... > >}; > > > >I want to do a find_if for a name that I have. > > > >something like > >std::find_if(begin, end, boost::bind(std::equal<std::string>(???, > >name_to_find))); > > > >What do I put for the ??? ? > > Nothing. Your done. :-) bind takes a pointer to a function > (among other > things) as the first parameter. It then calls that function with the > parameters you specify. You use _1, etc for parameters that > are input to > bind. In your case: > > std::find_if(begin, end, boost::bind(std::equal<std::string>, > name_to_find, _1))); > But I have to compare name_to_find to the result of _1.getName() don't I? ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

Signals - no linking
by michael graves ii 09 Aug '02

09 Aug '02

hey, when trying to run a program using boost::signal i am getting a lot of unresolved errors. [output window] --------------------Configuration: my_dlls - Win32 Release-------------------- Linking... delegate_main.obj : error LNK2001: unresolved external symbol "public: __thiscall boost::signals::detail::signal_base::~signal_base(void)" (??1signal_base@detail@signals@boost@@QAE@XZ) delegate_main.obj : error LNK2001: unresolved external symbol "protected: __thiscall boost::signals::trackable::~trackable(void)" (??1trackable@signals@boost@@IAE@XZ) delegate_main.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::signals::connection::disconnect(void)const " (?disconnect@connection@signals@boost@@QBEXXZ) delegate_main.obj : error LNK2001: unresolved external symbol "protected: void __thiscall boost::signals::detail::slot_base::create_connection(void)" (?create_connection@slot_base@detail@signals@boost@@IAEXXZ) delegate_main.obj : error LNK2001: unresolved external symbol "public: __thiscall boost::signals::detail::signal_base_impl::signal_base_impl(class boost::function2<bool,class boost::any,class boost::any,struct boost::empty_function_policy,struct boo st::empty_function_mixin,int> const &)" (??0signal_base_impl@detail@signals@boost@@QAE@ABV?$function2@_NVany@boost@@ V12@Uempty_function_policy@2@Uempty_function_mixin@2@H@3@@Z) delegate_main.obj : error LNK2001: unresolved external symbol "public: class boost::signals::connection __thiscall boost::signals::detail::signal_base_impl::connect_slot(class boost::any const &,class boost::any const &,class std::vector<class boost ::signals::trackable const *,class std::allocator<class boost::signals::trackable const *> > const &)" (?connect_slot@signal_base_impl@detail@signals@boost@@QAE?AVconnection@34@AB Vany@4@0ABV?$vector@PBVtrackable@signals@boost@@V?$allocator@PBVtracka ble@signals@boost@@@std@@@std@@@Z) delegate_main.obj : error LNK2001: unresolved external symbol "public: __thiscall boost::signals::detail::call_notification::~call_notification(void)" (??1call_notification@detail@signals@boost@@QAE@XZ) delegate_main.obj : error LNK2001: unresolved external symbol "public: __thiscall boost::signals::detail::call_notification::call_notification(class boost::shared_ptr<class boost::signals::detail::signal_base_impl> const &)" (??0call_notification@de tail@signals@boost@@QAE@ABV?$shared_ptr@Vsignal_base_impl@detail@signals@boo st@@@3@@Z) delegate_main.obj : error LNK2001: unresolved external symbol "public: __thiscall boost::signals::detail::signal_base_impl::~signal_base_impl(void)" (??1signal_base_impl@detail@signals@boost@@QAE@XZ) Release/my_dlls.exe : fatal error LNK1120: 9 unresolved externals Error executing link.exe. my_dlls.exe - 10 error(s), 0 warning(s) [/output window] so in semi-readable for these are the unresolved symbols: signal_base::~signal_base(void) trackable::~trackable(void) void connection::disconnect(void)const void slot_base::create_connection(void) signal_base_impl::signal_base_impl(class boost::function2<bool,class boost::any,class boost::any,struct boost::empty_function_policy,struct boost::empty_function_mixin,int> const &) connection signal_base_impl::connect_slot(class boost::any const &,class boost::any const &,class std::vector<class boost::signals::trackable const *,class std::allocator<class boost::signals::trackable const *> >const &) call_notification::~call_notification(void) call_notification::call_notification(class boost::shared_ptr<class boost::signals::detail::signal_base_impl> const &) signal_base_impl::~signal_base_impl(void) i downloaded the signals library out of the CVS Repository. i see that some people have gotten signals to work so i guess i'm missing something=( i like this lib a lot (and it saves me from coding it=), but i would have went with a delegate/callback naming scheme instead of signal/slot. i guess that's what find and replace is for=). michael graves ii

3 6

No time/date class in boost?
by Sean Shubin 09 Aug '02

09 Aug '02

I would have expected to find a time/date class in boost. Was it determined to be unnecessary, or is it simply that no one has gotten around to implementing one?

4 3

Regex issue on WIN32
by Rob Reece 09 Aug '02

09 Aug '02

I'm trying to get the regex lib (boost 1.28.0) built on win32 (MSVC v6, stlport 4.5.3). The standard build that is provided with regex appears to work fine and I get the full compliment of regex libraries (debug, static/dynamic, etc.). However, when I attempt to build the credit_card_example file, the link fails with unresolved external symbols. I then added the 13 regex source files to a msdev project along with the credit_card_example source file and linked everything statically (using BOOST_REGEX_STATIC_LINK or whatever it is). That worked fine. So this leads me to believe that something is going on with BOOST_REGEX_DECL macro. I put some #pragma message(...) statements into some headers and determined that the macro is being defined correctly. Is it possible that this macro is missing on some functions/classes or is it more likely a build option or macro issue? The first unresolved symbol I have is boost::re_detail::match_results_base<...>::m_free(...) As I was looking around for that symbol, I discovered in regex.hpp that match_results_base did not have BOOST_REGEX_DECL macro on the class definition. I added it and rebuilt and I ended up with more unresolved symbols. So obviously that isn't the direction to go. I have, however, not been able to find the actual definition of m_free yet (still looking). Thanks -Rob

2 1

Graph: Generic access to vertex/edge properties
by Tarjei Knapstad 09 Aug '02

09 Aug '02

Hi. I'm currently trying to implement a generic pattern matching (aka subgraph isomorphism) algorithm for use with the Boost Graph Library. My first-attempt function signature looks like this (comments included for further description of what I'm attempting) //! Seeks to find matches of the graph \a g2 in the graph \a g1. /*! This is called "graph pattern matching", or "subgraph homomorphism/isomorphism". The results are returned in a std::list of std::maps where the maps' key is the node_descriptor in \a g2 and the values are the corresponding node_descriptors in \a g1. The size of the returned list represents the number of matches. If \a properties is true it means that all vertex and edge properties must be equal in both structures for a match to be found. Otherwise, only the graph structure itself will be checked. \sa positioned_pattern_match */ template <class Graph> std::list< std::map<typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor> > pattern_match(const Graph& g1, const Graph& g2, bool properties = true); For the case where the 'properties' switch is false I have everything I need, but if 'properties' is true I'm a bit unsure on how to proceed. The problem, as I see it, is to do a generic consecutive access of all the properties of the current vertex/edge being checked and see if they're equal in both 'g1' and 'g2'. Could anyone provide me a solution/clue on how to solve this problem in a generic way so that the algorithm can be used for any graph? Regards, -- Tarjei Knapstad

3 2

VC7 build error without #define BOOST_DISABLE_WIN32
by Martin Schuerch 08 Aug '02

08 Aug '02

Hi I have an application with MFC / ATL and also some files compiled with the /clr option. Throuout the application boost is used a lot. All builds well as long as #define BOOST_DISABLE_WIN32 is set in the user.hpp file. Without this option a) the build hangs during registration after linking or b) link error due to differently defined custom attributes (in a file using /clr option) Did anybody had similar problems already? Regards Martin

1 0

iterator_adaptor and operator-> for input iterators
by Beman Dawes 07 Aug '02

07 Aug '02

I wrote an iterator to do recursive directory iteration. The heart of it is: template< typename Predicate > class recursive_directory_iterator : public boost::iterator_adaptor< boost::shared_ptr< detail::rdi_imp< Predicate > >, detail::rdi_policies, const boost::filesystem::path, const boost::filesystem::path &, const boost::filesystem::path *, std::input_iterator_tag, std::ptrdiff_t > { ... }; Works fine as long as you stay away from operator->. For example, fs::recursive_directory_iterator<pred_type> rdi( dir , dummy ); fs::recursive_directory_iterator<pred_type> rdi_end; for ( ; rdi != rdi_end; ++rdi ) { // std::cout << rdi->generic_path() << std::endl; std::cout << (*rdi).generic_path() << std::endl; } works as expected. But if you uncomment the commented line, the program fails in the call to operator->. What "fails" means depends on the execution environment; whatever is happening seems to confuse the debugger, stepping doesn't shed much light on the problem. Same symptoms with both VC++7 and Intel 6.0. I suppose I'm doing something stupid, but don't have a clue as to what. I notice in iterator_adaptor_test.cpp that operator-> is not actually exercised. Is it possible there is a bug in it for input iterators? I've not had similar problems with iterator_adaptor for bidirectional iterators. Any help appreciated, --Beman

1 0

Newbie and his template for comments.
by Kamil Burzynski 07 Aug '02

07 Aug '02

Hello. I'm a C++ developer, who is learning STL recently, and loving it :) I've encountered Boost library, which seems to extending STL funcationality a lot :) I've also created a sampel template for usage in my company, and I would like to get comments about it: is this code ok, exception safe, somebody did it better things like that. In my projects I'm often using structures like map<T1, T2 *>, e.g. map<int, Point *> or map<string, Person*> or something like this. So, often I want to do something like that: map<int, Point *> my_map; map<int, Point *>::iterator it; /* .. */ for( it=my_map.begin();it!=my_map.end();++it ) { it->second->Reset(); //sets x,y to 0,0 } example may be stupid, but shows what I'm trying to explain. To improve it I've created a template (given below), so I ca use it like that: for_each( my_map.begin(), my_map.end(), map_fun( &Point::Reset ) ); Which i think is much better. My template is as follows (style is kept from GCC includes, so it may be not as readable as it could be :) template <class _Ret, class _Tp> class map_fun_t : public unary_function<_Tp*,_Ret> { public: explicit map_fun_t(_Ret (_Tp::*__pf)()) : _M_f(__pf) {} template< class _Mp> _Ret operator()(_Mp &__p) const { return ((__p.second)->*_M_f)(); } private: _Ret (_Tp::*_M_f)(); }; template <class _Ret, class _Tp> inline map_fun_t<_Ret,_Tp> map_fun(_Ret (_Tp::*__f)()) { return map_fun_t<_Ret,_Tp>(__f); } What do you think about it? Has it any flaws? Somebody done it already? Is it usable for anyone except me? :) Thanks in advance. -- Best regards from Kamil Burzynski Senior Design Engineer Advanced Digital Broadcast Poland, LTD. - - "Yes, I'm criminal. My crime is that of curiosity."

4 6

Regex++ link problem with VC6 when building with _UNICODE defined
by Edward Diener 07 Aug '02

07 Aug '02

If I build boost 1.28 regex with _UNICODE defined and then attempt to link the static mssd.lib version with a _UNICODE application using the library, I get: boost_regex_vc6_mssd.lib(w32_regex_traits.obj) : error LNK2005: _iswspace already defined in libcmtd.lib(_wctype.obj) boost_regex_vc6_mssd.lib(c_regex_traits.obj) : error LNK2005: _iswalpha already defined in libcmtd.lib(_wctype.obj) boost_regex_vc6_mssd.lib(c_regex_traits.obj) : error LNK2005: _iswupper already defined in libcmtd.lib(_wctype.obj) boost_regex_vc6_mssd.lib(c_regex_traits.obj) : error LNK2005: _iswlower already defined in libcmtd.lib(_wctype.obj) boost_regex_vc6_mssd.lib(c_regex_traits.obj) : error LNK2005: _iswdigit already defined in libcmtd.lib(_wctype.obj) boost_regex_vc6_mssd.lib(c_regex_traits.obj) : error LNK2005: _iswxdigit already defined in libcmtd.lib(_wctype.obj) boost_regex_vc6_mssd.lib(c_regex_traits.obj) : error LNK2005: _iswspace already defined in libcmtd.lib(_wctype.obj) boost_regex_vc6_mssd.lib(c_regex_traits.obj) : error LNK2005: _iswpunct already defined in libcmtd.lib(_wctype.obj) boost_regex_vc6_mssd.lib(c_regex_traits.obj) : error LNK2005: _iswcntrl already defined in libcmtd.lib(_wctype.obj) Debug/TestRegularExpressionGUIStatic.exe : fatal error LNK1169: one or more multiply defined symbols found Error executing link.exe. This only occurs in the debug multi-threaded static library version. Has anyone else seen this or know why it might occur ? If I change the build options for this library from /Od /Gz to /O2, everything works fine and no linker errors occur.

2 1

[BGL] Common children for vertices in DAG
by Erik Arner 07 Aug '02

07 Aug '02

Is there a fast way, with or without preprocessing of the graph, for checking if two non-adjacent vertices in a DAG have one or more common children? Any pointers to components of the BGL that implement, or can be used to implement, this task would be much appreciated. Thanks, Erik

2 4

Tuple from cons list
by j1k1cki 07 Aug '02

07 Aug '02

Hi, Is there a simple way of obtaining a tuple type out of cons list? It also seems natural to build tuple type from two MPL iterators. Is such code available anywhere already? Best regards

1 0

BGL: Problem with parallel edges and filtered_graph
by Michael Kettner 06 Aug '02

06 Aug '02

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi Jeremy, I think I discovered a problem concerning filtered_graphs and parallel edges: Assume I have a graph containing two edges E1 and E2 connecting node A and node B. Now I crate a boost::filtered_graph (myFilteredGraph) with a filter that returns true for only E1. When I now try to get E1 by calling edge = boost::edge( A, B, myFilteredGraph ).first; the result is undefined. Looking at the code (filtered_graph.hpp) I found out that the edge is return by: edge(typename filtered_graph<G, EP, VP>::vertex_descriptor u, typename filtered_graph<G, EP, VP>::vertex_descriptor v, const filtered_graph<G, EP, VP>& g) { typename G::edge_descriptor e; bool exists; tie(e, exists) = edge(u, v, g.m_g); return std::make_pair(e, exists && g.m_edge_pred(e)); } Here, the line tie(e, exists) = edge(u, v, g.m_g); returns _some_ edge, but not necessarily the _right_ one. The call edge(...) is not called for the filtered graph and g.m_edge_pred(e) is called _after_ getting the wrong edge (resulting in a return value FALSE). One solution would be to call boost::edge_range(A, B, myFilteredGraph) on my filtered_graph to get all visible edges, but this function is not provided. Any ideas how to solve my problem? Michael - -- http://www.ive.uni-hannover.de # kettner(a)ive.uni-hannover.de -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (GNU/Linux) Comment: For info see http://www.gnupg.org iD8DBQE9TqUAkCdGnb0kVFMRAlsLAJwKJJ2NSLRu2HUv/H4sAhr4W5WdkACdHXZ6 3kz8fBDvysWKc1vxd5rf/CE= =l+NV -----END PGP SIGNATURE-----

2 3

BGL: dijkstra_shortest_paths and parallel edges
by Michael Kettner 06 Aug '02

06 Aug '02

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, my former posting leads me to another question: How does the dijkstra_shortest_paths behave if applied to a multigraph? And how does the dijkstra_shortest_paths behave if applied to a filtered_(multi)graph containing parallel edges, but with only _one_ of the parallel edges visible respectively? Michael - -- http://www.ive.uni-hannover.de # kettner(a)ive.uni-hannover.de -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (GNU/Linux) Comment: For info see http://www.gnupg.org iD8DBQE9TqprkCdGnb0kVFMRApGUAJ9nzr3Y4ijbrNnWENzxYIwcdLy8iQCfX2fx dl0M/IUt2bWFL0H9ovwajm4= =+FTJ -----END PGP SIGNATURE-----

2 1

BGL example boost_web_graph.expected
by Arjun Bijanki 06 Aug '02

06 Aug '02

When I compile and run Boost_1_28_0/libs/graph/example/boost_web_graph.cpp my output differs from the expected output: 1c1 < The diameter of the boost web-site graph is 2 --- > The diameter of the boost web-site graph is 3 Is the expected file current? Thanks, Arjun Bijanki Microsoft VC++ [Non-text portions of this message have been removed]

2 1

Why stop building with error "Thread support is unavailable!"
by xuejm 06 Aug '02

06 Aug '02

Hi, I installed boost1.28.0 with microsoft visual c++ .NET and regex worked very well, but when I build a very simple example to test boost.thread, it stop building with error "Thread support is unavailable!". I found out that it's because that there's not a pre-define variable defined. Can I define the variable? How can I use boost.thread in my vc++ .net? TIA Phipps Xue

2 1

Re: [Boost-Users] Re: Logical AND
by dan.ellis＠sophos.com 05 Aug '02

05 Aug '02

On 08/03/2002 05:04:26 PM news wrote: > > I need a match on "a AND is" when searching a sentence like "This is a > > test". >Regular expressions match sequences of characters. Your match says to match >a string when both of 2 different matching possibilities exist anywhere in >the string. To do this you must use 2 separate regular expression matches >separating them by the normal C++ "&&" operator. Maybe I'm misunderstanding what's wanted, but wouldn't is.*a do what he wants? Or if they need to be matched in either order: (is.*a)|(a.*is) It doesn't scale well, of course. -- Dan Ellis, Software Engineer, Sophos Anti-Virus Email: dan.ellis(a)sophos.com, DDI: 01235 540204 Real Business/CBI Growing Business Awards: Company of the Year Tel: 01235 559933, Web: http://www.sophos.com/

2 1

uBLAS Observation: terrible execution speed for prod(matrix,prod(matrix,prod(matrix,matrix)))
by Walter Bowen 05 Aug '02

05 Aug '02

Hi, I am new to uBLAS. I am looking to see if it will be useful for my application (I develop 6-Degrees-of-freedom flight simulations used to analyze avionics systems.) I have benchmarked a few lines of code with RogueWave's Math.h++ (testing for execution speed) and made the following observation. Observation 1) For matrix products of two small (~3-by-3) matrices ( i.e., prod(smallMat1, smallMat2) ) uBLAS executes MUCH FASTER than Math.h++. Observation 2) For matrix produces of two large matrices (100 by 100) uBLAS and Math.h++ give similar execuation speed. Obervation 3) (This is the kicker...) for strung-together matrix products like "Mat1 * Mat2 * Mat3 * Mat4 * Mat5", which I am implementing as "prod(Mat1, prod(Mat2, prod( Mat3, prod(Mat4,Mat5) ) ) ) Math.h++ is MUCH MUCH FASTER than uBLAS. -- by ~2 orders OF MAGNITUDE! I believe that this is a characteristic of the scalability of template expressions. My question is this: Is there a way I an instruct uBLAS not to use template expressions when for strung-together matrix products? Regards, Walt

5 4

Logical AND
by Mads M.P. 05 Aug '02

05 Aug '02

I've been looking for a parameter like "AND" when using regular expressions (from boost 1.28). I need a match on "a AND is" when searching a sentence like "This is a test". Is there a way to create such a search string by using regular expressions ? Regards Mads c(a)medit.dk

3 2

Boost 1.28 Regex and VC6 link problem
by Edward Diener 04 Aug '02

04 Aug '02

Using Boost 1.28 and regex I get linker errors regarding raw_storage. I believe someone has brought this up before but I didn't save the previous answer. error LNK2001: unresolved external symbol "public: class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> __fastcall boost::re_detail::raw_storage<class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> >::allocator(void)const " error LNK2001: unresolved external symbol "public: class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> __fastcall boost::re_detail::raw_storage<class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> >::allocator(void)const " error LNK2001: unresolved external symbol "public: __thiscall boost::re_detail::raw_storage<class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> >::raw_storage<class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> >(class re_detail::detail::allocator_adapter<char,class boost::detail::simple_alloc> const &)" error LNK2001: unresolved external symbol "public: __thiscall boost::re_detail::raw_storage<class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> >::raw_storage<class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> >(class re_detail::detail::allocator_adapter<char,class boost::detail::simple_alloc> const &)" error LNK2001: unresolved external symbol "public: void * __fastcall boost::re_detail::raw_storage<class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> >::insert(unsigned int,unsigned int)" error LNK2001: unresolved external symbol "public: void __fastcall boost::re_detail::raw_storage<class boost::detail::allocator_adapter<char,class boost::detail::simple_alloc> >::resize(unsigned int)" It seems to be related to these lines in instances.hpp template class re_detail::raw_storage< BOOST_DEFAULT_ALLOCATOR BOOST_REGEX_CHAR_T) >; template class BOOST_REGEX_DECL re_detail::raw_storage<BOOST_DEFAULT_ALLOCATOR(BOOST_REGEX_CHAR_T) >; Are these lines in error ? Should one or both of them be removed ? My guess is that the line with BOOST_REGEX_DECL needs to be removed.

1 1

Problems with mpl::find and std library
by Tanton Gibbs 03 Aug '02

03 Aug '02

I had a problem with using mpl::find and the std::find at the same time. Basically, my compiler, Compaq C++ V6.5-026, notes an ambiguity in find.hpp between the find_if that it uses and the find_if in the STL. I changed the line that reads struct find : find_if< Sequence, same_as<T> > {}; to be struct find : mpl::find_if< Sequence, same_as<T> > {}; and it works fine. I'm not sure if this is a compiler bug or if we need to find other occurences like this one and fix them. Any help is appreciated. Tanton

2 2

boost.python - from_python for obj.__class__
by Nikolay Mladenov 02 Aug '02

02 Aug '02

Hi, I have exported some classes to python with boost.python, and now I am wondering: Does any body know how can I convert obj.__class__ (of an exported object from C++) to a class specific value( for example typeid(corespondong_cpp_class) )? Thanks in advance, Nikolay

1 0

bjam issue related to boost::python
by Srivatsan Raghavan 02 Aug '02

02 Aug '02

hi all , i created a c++ extension module using python which worked fine.. then i wanted to embed a call to PyRun_SimpleFile in another app, and the script i was calling is attempting to use my extension module but i was getting telling me that the interpreter wasn't initialized after much searching, research, and work with msvc's Dependency Walker i narrowed it down to the fact that boost_python_debug.dll is trying to link to the release version of python22.dll , whereas it should be linking to python22_d.dll (which unfortunately does not come with the python installer , that has to be compiled manually ) at any rate, how can the boost::python Jamfile be modified to try this check when it comes boost::python ? --vat ==.sig== Evil requires nothing more to win than that good men do nothing

1 0

[BGL] Vertex removal without iterator invalidation?
by Erik Arner 01 Aug '02

01 Aug '02

Yet another question from the BGL newbie... I understand that performing remove_vertex() on graphs with vertexList=vecS will result in invalidated itarors and descriptors for the graph. However, some toy examples i made suggest that if I remove a vertex in such a graph, the vertex descriptors and vertex iterators for vertices with *lower* ID than the removed vertex remain valid after removal, while those for higher ID vertices are invalidated. Is this a true feature of a graph with Vertexlist=vecS, or is my observation a mere coincidence? Is it safe to write code that exploits this "feature"? If it indeed is a feature, I can construct a sorted list of vertices to remove, and remove the vertices in descending order in an easy fashion. If it is not a feature, any suggestions on how to perform this task i.e. removing a list of vertices while keeping the VertexList type vecS? Thanks, Erik

2 2

collection container
by Bohdan 01 Aug '02

01 Aug '02

Has boost any plans on creating container, that holds data by pointer, not by value? Rationale: It is impossible to use normally vector<...> for types that do not have copy constructor. Interface of vector< shared_ptr<...> > doesn't seems to be very convenient( for example with std::algorithms ). And most of all it is not good idea to show vector< shared_ptr<...> > interface to user of my lib, that wants to have container::iterator with normal behavior. AFAIK majority of existing libraries have/need such container ? As to me it is strange that neither stl nor boost have such class. I'm missing 'something' and there are important reasons for not doing this ?

2 5

Creating groups of regular expressions
by cyndi_r2002 01 Aug '02

01 Aug '02

Hi, I have started using Regex++ and like it a lot but is there a way to use grouping constructs using Regex++ / any alternative that would provide the same functionality? Thanks, Cyndi

2 1

Newbie link problem
by Lev Assinovsky 01 Aug '02

01 Aug '02

Hi all! I would like to do a very simple thing: link my main tst.cpp with the third party library $(MYDIR)/libfoo.a. The final command line should be: g++ -o tst tst.cpp -L$(MYDIR) -lfoo Currently I have in my Jamfile: exe tst : tst.cpp : <include>$(ADC_ROOT) <include>$(BOOST_ROOT) <include>"$(HOME)/inc" ; What must be added to provide linking with libfoo.a? (adding of variable LINKLIBS=$(MYDIR)/libfoo.a DOESN'T WORK) Thanks in advance! ---- Lev Assinovsky Aelita Software Corporation O&S Core Division, Programmer ICQ# 165072909 [Non-text portions of this message have been removed]

1 0

boost working with CGAL ??
by Matthias Kronenberger 31 Jul '02

31 Jul '02

I want to use CGAL from http://www.cgal.org together with the boost library. I'm using MSVC 6.5 There seem to be some problems related to namespace issues. I'm getting the following kind of errors: d:\matthias\programmieren\cgal\include\cgal\number_utils.h(236): error C2955: 'is_integral': Fuer die Verwendung einer Vorlagenklasse ist eine Vorlagen-Argumentliste erforderlich d:\matthias\programmieren\boost\boost\type_traits\arithmetic_traits.hpp(38): Siehe Deklaration von 'is_integral'

1 0

Cannot put .o File with Graph Code into .a File
by Adalbert Perbandt 30 Jul '02

30 Jul '02

Hi there, while trying to setup the BGL for use in my environment I'm facing a strange behavior when I try to put a C++ object file which contains instanciations of BGL templates into an object library. My environment: - Sun SPARC machine with Solaris 2.7 (SunOS 5.7) - gcc 2.95.2 The problem shows up when I try to put an .o file into a library file. I can reproduce the error with the file adjacency_list.cpp from the BGL's examples directory: $ pwd /home/perbandt/boost_1_28_0/libs/graph/example $ g++ --version 2.95.2 $ g++ -g -I../../../../boost_1_28_0 -c adjacency_list.cpp $ ls -l adjacency_list.o -rw-r--r-- 1 perbandt relman 3367052 Jul 19 18:40 adjacency_list.o $ which ar /usr/ccs/bin/ar $ ar rv libtest.a adjacency_list.o a - adjacency_list.o Bus error When I try a .a file with already one or more .o files in it I get a segmentation fault. With another file that contains instantiations of BGL templates the problem does appear only when it was compiled with the -g option given. Is this a known problem? Seems to me as if ar would have trouble handling the very long symbol names in the .o file. Or is something wrong with my environment? Thanks, Adalbert Perbandt.

3 4

RE: [Boost-Users] absolute beginner, trying to compile
by James Zappia 30 Jul '02

30 Jul '02

It should be /usr/include/boost Then you can do: #include <boost/whatever.h> /usr/include is the base directory. So how you have it now it would be: #include <boost_1_28_0/boost/whatever.h> And you definitely don't want to do that. Regards, James -----Original Message----- From: thomas strack [mailto:yg-boost-users@gmane.org] Sent: Tuesday, July 30, 2002 10:17 AM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] absolute beginner, trying to compile hi there, unfortunately im not very experienced in c/c++. but i want to try out some functions from the boost libs. so i downloaded and extracted the files (1_28_0) to /usr/include/boost_1_28_0. i think i should be able to use most of the functions now(i hope i didnt misunderstand the doc). i want to use dir_it lib, but i cant compile the testfile coming along with boost. it includes <boost/directory.h> and g++ cant find this file. i dont know exactly how to use the -I and -l options. it would be great if someone could help me out. thx,tommi Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

absolute beginner, trying to compile
by thomas strack 30 Jul '02

30 Jul '02

hi there, unfortunately im not very experienced in c/c++. but i want to try out some functions from the boost libs. so i downloaded and extracted the files (1_28_0) to /usr/include/boost_1_28_0. i think i should be able to use most of the functions now(i hope i didnt misunderstand the doc). i want to use dir_it lib, but i cant compile the testfile coming along with boost. it includes <boost/directory.h> and g++ cant find this file. i dont know exactly how to use the -I and -l options. it would be great if someone could help me out. thx,tommi

1 0

Boost.Lambda - Invoking functors stored in a vector
by Thomas Wenisch 30 Jul '02

30 Jul '02

Hi all, I am storing a set of functors to be invoked in a vector, like this: std::vector< boost::function<void> > functors; At a later time, I would like to invoke each of the functors in the vector. I am trying to do this using Boost.Lambda, to start learning about the Lambda library, but I can't figure out what to write. if I write: std::for_each(functors.begin(), functors.end(), _1); None of the functions are invoked. if I try: for_each(funtors.begin(), functors.end(), _1()); I get compile errors. I suspect this is because the lamda expression is being executed immediately instead of getting passed in to for_each. Everything works fine when I use a separate Invoker function in the usual fashion, like this: void Invoker( boost::function<void> functor) { functor(); } std::for_each(funtors.begin(), functors.end(), Invoker); How can I get the lambda library to invoke each function in the vector? More generally, if the functions were function<void, T>, how could I bind the T parameter in the lambda expression? Thanks for any help, Tom Wenisch Computer Architecture Lab Carnegie Mellon University

2 1