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

Regex++ newbie problems
by Bruce Adams [TSP Sunbury] 20 Mar '03

20 Mar '03

Hi, I've just started using Regex++ (from boost 1.29.0) and I'm experiencing some strangeness that don't seem to be mentioned in the faq. Firstly I found that [-A-Za-z]+ matched spaces and punctuation characters unexpectedly rather than plain alphabetic characters and hyphens only as desired. Reading the documentation I altered this to [-:alpha:] & [-:upper::lower] with no effect. So I decided to experiment with adding ^[:space:]. When finally I reached the expression below I got a coredump where the expression was declared. The intention of this expression was to strip and keep leading and trailing punctuation and spaces as well as extracting a word from the middle. static const boost::regex Word_expression("([:punct::space:]*)([-:upper::lower:^[:punct::space:]]+)([: punct::space:]*)"); Is it right that 'bad' expressions should coredump? And if so in what way is the above expression bad? (as an aside maybe we could catch bad ones better by replacing regex strings with overloaded operators the way streams have superceded printf) I found I still get rogue matches on punctuation and spaces when I use the manually expanded form below: ([-abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ]+) What is going wrong? Regards, Bruce A. Full source attached: E.g. try running e.g. ReadWord ",; token-alpha; ," I would desire the matches to be: what[1] -> ",; " what[2] -> "token-alpha" what[3] -> "; ," ----cut here---- #include <iostream> #include <fstream> #include "boost/regex.hpp" int main(int argc,const char* const argv[]) { int Status = 0; // static const boost::regex Word_expression("[a-zA-Z]+"); // causes coredump // static const boost::regex Word_expression("([:punct::space:]*)([-:upper::lower:^[:punct::space:]]+)([: punct::space:]*)"); static const boost::regex Word_expression("([:punct::space:]*)([-abcdefghijklmnopqrstuvwxyzABCDEFGHIJK LMNOPQRSTUVWXYZ]+)([:punct::space:]*)"); // dump arguments for(int argNo=0;argNo != argc;argNo++) { std::cout << "argNo " << argNo << " = '" << argv[argNo] << "'" << std::endl; boost::cmatch what; if(regex_search(argv[argNo], what, Word_expression)) { std::cout << "Whole = " << what[0].first << std::endl; int resultNo = 1; while(what[resultNo].matched == true) { std::cout << "sub[" << resultNo << "] = " << "'" << what[resultNo].first << "'" << std::endl; resultNo++; } } } if (argc <= 1) { std::cout << "Usage: ReadWord <filename>..." << std::endl; Status = 1; } else { for(int argNo=1;argNo != argc;argNo++) { std::ifstream In(argv[argNo]); if (!In) { std::cout << "Error: could not open file: " << argv[argNo] << std::endl; } else while((In) && (In.eof() == false)) { std::string InputLine; In >> InputLine; std::cout << InputLine << std::endl; } } } return Status; } //main ============================================================================ Any opinions expressed in this e-mail are those of the individual and not necessarily those of Tyco Safety Products. Any prices for the supply of goods or services are only valid if supported by a formal written quotation. This e-mail and any files transmitted with it, including replies and forwarded copies (which may contain alterations) subsequently transmitted from Tyco Saftey Products are confidential and solely for the use of the intended recipient. If you are not the intended recipient or the person responsible for delivery to the intended recipient, be advised that you have received this e-mail in error and that any use is strictly prohibited. In this event, please notify us via e-mail at 'helpdesk.tepg(a)tycoint.com' or telephone on 0121 255 6499 and then delete the e-mail and any copies of it. ============================================================================

2 1

Help with my first compilation with uBLAS
by Zdenek Hurak 20 Mar '03

20 Mar '03

Hello, Could anybody help me with my first compilation of a simple code using MATRIX class from uBLAS library? Namely, I can't set all the "include" properly. Have a look at the code snipet: ---------------------------------------------------------------------------------- #include <iostream.h> #include <stdlib.h> #include <boost/numeric/ublas/matrix.hpp> int main(int argc, char *argv[]) { using namespace boost::numeric::ublas; matrix<double> m (3, 3); for (int i = 0; i < m.size1 (); ++ i) for (int j = 0; j < m.size2 (); ++ j) m (i, j) = 3 * i + j; std::cout << m << std::endl; } ------------------------------------------------------------------------------------ I get an error message: main.cpp:21:42: boost/numeric/ublas/matrix.hpp: No such file or directory I use gcc/g++ on i386-linux and I set a parameter of the compiler to: --x-includes=/home/hurak/Documents/cpluspluswork/boost_1_29_0/ which is exactly the parent directory of "boost/numeric/ublas/matrix.hpp". Could you please explain to me what is still missing? I cannot find any example on the BOOST web. I am not much experienced in all this "include" stuff. Before delving deeper into the compiler options I would like to know if everything else is correct. Thanks Zdenek Hurak

4 4

return type of bind object
by Faheem Mitha 20 Mar '03

20 Mar '03

Dear People, I have defined a function as follows. double accept_prob_fn(const double x, const double be, const double theta, const double a, const double b); Now, I define the temporary function object bind(accept_prob_fn, _1, be, theta, a, b); So this function object would return the first argument, x. However, I want to save this function object to a function object called foo, say. So I want to do something like Type foo = bind(accept_prob_fn, _1, be, theta, a, b); However, the problem I have is that I'm not sure what type foo should be. I forced an error with my compiler (to try to see what it thought the type of the rhs should be) by using Type as double, but all I got was brent.cc:9: cannot convert `boost::_bi::bind_t<double, double (*)(double, double, double, double, double), boost::_bi::list5<boost::arg<1>, boost::_bi::value<double>, boost::_bi::value<double>, boost::_bi::value<double>, boost::_bi::value<double> > >' to `double' in initialization Eww. I've tried looking at the documentation, but I find it pretty much incomprehensible. Could someone a) Tell me what "Type" should be. b) Give me some brief indication of the reasoning by which one might arrive at this conclusion, with appropriate references to the documentation? Thanks. Feel free to cc a copy of any reply to me. I'll check the mailing list via gmane in any case. Faheem.

5 9

inner class functionlity with smart ptr.
by Saffi 19 Mar '03

19 Mar '03

Hi It is very common in Java when using pattern as EventListener having an inner class Adapter as the listener. I wanted that and more, I couldn't use "this" as the source of a shared ptr since then we will have to ref cnt to the same object ... Such scenario will cause a problem when one of the ref cnts will reach zero will delete the object and the other ref will point to a destructed object. The Problem : how define an inner class which would delegate functionality of the main class and break the ever annoying problem of giving ref to the main class. In Short two things are required : a. getSelf() functionality instead of "this" as a base for reference b. a glue to connect inner class to outer (in Java in terms of this example : ObjectWithAdapter.this) ---------------------------------------------------------------------------- -------------------------------------------------------------- Example : ObjectWithAdapter : the main class that need to register as listener IListener : listener interface ObjectWithAdapter::Adapter is the implementation of the IListener and delegates the message to the main class class IListener { virtual void helloListener(char *str)=0; }; class ObjectWithAdapter : public TMe<ObjectWithAdapter> { typedef RStrong<ObjectWithAdapter> RObjectWithAdapter; public: void helloListener(char *str) { // called from adapter } public: class Adapter : public TSon<ObjectWithAdapter>, IListener {public: void helloListener(char *str) { if (getPapa()) { getPapa()->helloListener(str); } } Adapter() { // register } virtual ~Adapter(void ) {// unregister } }; typedef RStrong<Adapter> RAdapter; RAdapter _adapter; ObjectWithAdapter() { } void initSons() { _adapter = RAdapter(new Adapter()); _adapter->initSon(getSelf()); } ~ObjectWithAdapter() { } }; typedef RStrong<ObjectWithAdapter> RObjectWithAdapter; ---------------------------------------------------------------------------- ---------------------------------------------------------------------------- ------------------------------------ Is such functionality is worthy piece of code for boost ? BTW my implementation works fine for me. -- Saffi

1 0

boost smart pointers with memory managers
by shanypozin2003 19 Mar '03

19 Mar '03

Hi Is there a way to work with boost's smart pointers , for memory allocated by a memory manager ? I have a memory manager the pre allocates memory , and when i need new memory , i use the manager to supply it , and when i am finished, i return the memory to the memory manager . did i make my self clear ?. thanks shany

2 1

AW: [Boost-Users] boost smart pointers with memory managers
by Jasper, Alexander 19 Mar '03

19 Mar '03

Hello Shany! > Is there a way to work with boost's smart pointers , > for memory allocated by a memory manager ? The smart pointer aren't actually responsible for allocation the memory. One option is overloading operator new and delete in the right way. If've done that and we use the smart pointers in conjuction with boost::pool. hope this helps. alex

1 0

confusion on using date_time library
by jarry_cf＠hotmail.com 19 Mar '03

19 Mar '03

I am a newbie of boost and i want to use boost date_time library i have build the libboost_date_time.lib and boost_date_time.dll and put them in the lib path My devlope entironment is vc71 final beta+latest boost i get from cvs yesterday when i use some small code to test date_time_lib,i enconter with such error: error LNK2019: unresolved external symbol "public: char const * __thiscall boost::gregorian::greg_month::as_long_string(void)const " (? as_long_string@greg_month@gregorian@boost@@QBEPBDXZ) referenced in function "public: static class std::basic_ostream<char,struct std::char_traits<char> > & __cdecl boost::date_time::month_formatter <class boost::gregorian::greg_month,class boost::date_time::simple_format>::format_month(class boost::gregorian::greg_month const &,class std::basic_ostream<char,struct std::char_traits<char> > &)" (?format_month @?$month_formatter@Vgreg_month@gregorian@boost@@Vsimple_format@date_time@ 3@@date_time@boost@@SAAAV?$basic_ostream@DU? $char_traits@D@std@@@std@@ABVgreg_month@gregorian@3@AAV45@@Z) code as follows: #ifndef DATE_TIME_INLINE #define DATE_TIME_INLINE #endif #include <boost/date_time/posix_time/posix_time.hpp> #include <iostream> using namespace boost::posix_time; int main(int , char*[] ) { std::cout << to_simple_string(second_clock::local_time()) << std::endl; } i use vc71 command line to compile anyone can tell me how to resolve such problems?thanks

2 1

Problem with boost::timer on BCB
by sophtware 19 Mar '03

19 Mar '03

Hi All, Just an FYI for those interested. When compiling an application in RELEASE mode in BCB 5 the function std::clock() does not always return what you expect it to. In those cases, either an overflow or an invalid operation exception occurs. Using a "long double" for the return type prevents the exceptions, but the values are still incorrect (and way off!). If you don't need a resolution greater than one second, consider using the time(NULL) function instead. This one does work. -- Mike

1 0

Using BOOST_CURRENT_FUNCTION
by Alisdair Meredith 19 Mar '03

19 Mar '03

We are updating our logging library at the moment, and as we now support multiple compilers I am looking to use BOOST_CURRENT_FUNCTION rather than many compiler checks through our code! Two questions: i/ Does it work with Borland C++Builder6? Although it seems to detect the correct macro, this is expanding to an empty string when used. ii/ Why is the logic implemented inside an empty function inside the ::boost::detail namespace? As everything is preprocessor based I do not see the benefit this brings, but assume it must have been done for a good reason so I am darned curious! <g> -- AlisdairM

1 0

Poisson distribution for large mean
by kgolod0641 18 Mar '03

18 Mar '03

Hi, I am using poisson distribution (boost/random/poisson_distribution.hpp), and have encountered a problem when using a large mean. Let's say I'm setting up my poisson distribution with mean = MEAN, and repicking a sequence of 1000 random numbers. If I average out these 1000 numbers, I would expect to get MEAN (or very close to it). This works OK for mean < 745. Afterwards, no matter how large I set the mean, the same sequence of numbers is generated, with average of 745. Any help would be greatly appreciated!! Thank you, Ksenia

1 0

RE: [Boost-Users] Re: help with mersenne_twister
by scleary＠jerviswebb.com 18 Mar '03

18 Mar '03

> -----Original Message----- > From: Jon Agiato [mailto:JonAgiato@nyc.rr.com] > > Thanks again for all the help! I was looking through > random-generators.html and see that there are in addition to > the Mersenne Twister, Linear Congruential, and Lagged > Fibonacci, five others: const_mod, additive_combined, > shuffle_output, rand48, and inversive_congruential. I am > assuming these are all good RNGs to use for comparison, am I wrong? const_mod: not an RNG; it is used as an implementation helper for other RNGs rand48: uses Linear Congruential algorithm additive_combined, shuffle_output: modifications to the Linear Congruential to try to make it better; so these two require Linear Congruential generator(s) as input > > And lastly (don't want to wear out my welcome.. lol), do > > you think there would be any benefit to using the advanced > > RNG classes in my research? > > Actually, I think it might be a good idea to do so for your > project. The > specializations provided by Boost.Random are well-known > RNGs that have been > published in research papers and used extensively. There > are undoubtedly > many other good specializations out there, but few are used > (mainly because > it is very hard to define what a "good RNG" is). > > Anyway, what I was thinking is that you might make some of your own > specializations that are known to be bad RNGs, and discuss > why they are bad. > Here is where my knowledge about RNGs end; I'm sure that > there are known bad > RNGs, but I don't know what they are. > > -Steve > > That's a great idea Steve, thanks! I am rather new to RNG > research but agree that a comparison of sorts would be good. > Could you or anyone here provide assistance, perhaps a short > example on how one would use one of the advanced RNGs Boost > provides? I use Boost a lot, and think that one of the > things it could really benefit from is more in depth > documentation, especially for those of us struggling to > utilize the library as quickly as possible. Then again, I > know that 1_30_0 should be out soon, so these developers have > enough to do on their plates. Look at the docs again; they explain what is necessary to specialize the generic algorithms. Note that you should be familiar with the generic RNG algorithms before attempting to specialize. For example, looking at the Linear Congruential RNG (which is the only RNG algorithm I'm familiar with), the algorithm is -- as specified in the Boost.Random docs: x(n+1) := (a * x(n) + c) mod m and boost::random::linear_congruential is declared as: template<class IntType, IntType a, IntType c, IntType m, IntType val> class linear_congruential; with a constructor of: explicit linear_congruential_fixed(IntType x0 = 1); Given this, the specialization boost::minstd_rand, declared as: typedef random::linear_congruential<long, 48271L, 0, 2147483647L, 399268537L> minstd_rand; uses the specific Linear Congruential algorithm: x(n+1) := (48271 * x(n)) mod 2147483647 again, x(0) is given by the constructor. (The last template argument is used for implementation validation, and does not affect the algorithm). You can experiment with adding your own specializations, or those defined by other people that are not found in Boost.Random. For example, here's one from "Numerical Recipes in C": typedef boost::random::linear_congruential<long, 69621L, 0, 2147483647L, 0> ParkMiller; As far as the Boost.Random docs go, I think that they are quite good (with the exception that the "val" template parameter is inconsistently documented). Most users of this library just need a random number generator, and the comparision chart with the general recommendation of mt19937 suits the bill for anyone who wants to quickly use the library. What you want to do is not just quickly use a single RNG; you have much more extensive needs, covering a larger range of RNG algorithms. Naturally, more time will be necessary to learn all the algorithms and the Boost implementations of them. -Steve

1 0

RE: [Boost-Users] boost install and library linking
by Michael Hunley 18 Mar '03

18 Mar '03

Yes, but as of the last version I got from CVS (threads/Jamfile dated 1/30/03) it put it in a folder [$(BOOST)/libs/thread/bin-stage] that is not common with other produced libs. This is better than the gristed folders, but still not as useful or convenient as a top level common folder [like $(BOOST)/bin-stage]. When I need to specify in Linux where to look for shared libs, or when I want to add the .lib to link with in MSVC, I prefer the one-stop-shopping for all my boost libs. Perhaps I'm just being lazy, but that is the mother of invention, after all ;). I hear tell that the new v2 boost will have an "install" (don't know if it is a build target or something else) which will probably be far superior still. michael At 12:07 PM 3/17/2003 -0600, you wrote: >Michael Hunley said: > > I posted a solution to this for the v1 jambuild on the jambuild list, > > but not sure if anything will come of it since most of the effort is > > going into v2. My solution (for threads only) was to add a simple > > stage target at the end of the root Jamfile. Here it is: > > > > stage bin > > : ## Source Files ## > > <dll>libs/thread/build/boost_thread > > : ## Tags ## > > <tag><debug>"d" > > : ## default variants ## > > debug > > release > > ; > >Such a target already exists in the thread library's Jamfile (not the root). > >-- >William E. Kempf > > > > >Info: <http://www.boost.org> >Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> >Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > >Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

RE: [Boost-Users] Re: help with mersenne_twister
by scleary＠jerviswebb.com 18 Mar '03

18 Mar '03

> -----Original Message----- > From: Jon Agiato [mailto:JonAgiato@nyc.rr.com] > > Thanks for your suggestions and corrections, you made my > day for sure! I am sort of embarrassed as I have a decent > amount of experience with C++ but this was my first attempt > at writing to a binary file, incorrectly apparently! ;-) If > you do not mind, I would like to ask a few additional questions: I think everyone makes that same mistake; I know I have! :) > I notice there is mt19937 for the mersenne twister, and > mt11213b for the mersenne twister. What is the difference > between the two? Check out the first chart in libs\random\random-generators.html - it compares a few properties of the various specializations. > What other deterministic random number generators does > boost offer, and can I use them in the same fashion as > mt19937 as far as object instantiation? Linear congruential and lagged Fibonacci. All RNGs in Boost.Random follow the same interface, given by the RNG concept documentation in libs\random\random-concepts.html > I have Linux in VMWare as well as a standalone Linux box so > I should be able to utilize the non-deterministic generator. > Do you have any suggestions that I might keep in mind before I begin? No; I've never actually used it myself. > And lastly (don't want to wear out my welcome.. lol), do > you think there would be any benefit to using the advanced > RNG classes in my research? Actually, I think it might be a good idea to do so for your project. The specializations provided by Boost.Random are well-known RNGs that have been published in research papers and used extensively. There are undoubtedly many other good specializations out there, but few are used (mainly because it is very hard to define what a "good RNG" is). Anyway, what I was thinking is that you might make some of your own specializations that are known to be bad RNGs, and discuss why they are bad. Here is where my knowledge about RNGs end; I'm sure that there are known bad RNGs, but I don't know what they are. -Steve

2 1

gcc - cygwin - warning: too many 'l' suffixes in integer constant
by Bruce Adams [TSP Sunbury] 18 Mar '03

18 Mar '03

Hi, I have just begun using boost with gcc-3.2 on a vanilla PC-cygwin platform. Up until deciding to use boost I have been compiling with warnings treated as errors. I am getting warning too many 'l' suffixes in integer constant. See output below. Does anyone know what is going on here? The lines in the boost header file of interest use ULL as suffix. I presume this is intended to mean unsigned long long though I could not track down the #define (ULL being a rather common string). I have discovered that using ull in the preprocessor gives this warning though it is legal when declaring a constant in the language itself. This looks like an inconsistency within gcc. Perhaps because long long isn't officially in ISO C++ yet only C99 (correct me if I'm wrong). I managed to remove all but two occurances of the warning by taking the dubious action of changing ull to ul in boost in cstdint.h & limits.h but I could not track down the remaining instances. Are these suffixes necessary for these constants anyway? If the constant is big enough to need to be a long long the compiler should detect that and do any promotions necessary before comparison, shouldn't it? If its just for buggy compilers (assuming gcc isn't one of them in this case) can't ULL be #defined away? Where can I find this definition? Apologies for wasting bandwidth with this newbie error but can someone recommend a preferred course of action. Thanks & regards, Bruce A. (not actually using long longs in this particular application - yet) gcc -c -x c++ -gstabs -fcheck-new -fstrict-aliasing -fstack-check -frtti -Wall - Wno-long-long -pedantic ReadWord.cpp -o ReadWord.o -I../General -I../Boost/boost_1_29_0 In file included from ../Boost/boost_1_29_0/boost/regex/config.hpp:95, from ../Boost/boost_1_29_0/boost/cregex.hpp:27, from ../Boost/boost_1_29_0/boost/regex.h:26, from ReadWord.cpp:18: ../Boost/boost_1_29_0/boost/cstdint.hpp:202:49: warning: too many 'l' suffixes in integer constant ../Boost/boost_1_29_0/boost/cstdint.hpp:202:105: warning: too many 'l' suffixes in integer constant ../Boost/boost_1_29_0/boost/cstdint.hpp:202:105: warning: too many 'l' suffixes in integer constant ../Boost/boost_1_29_0/boost/cstdint.hpp:202:123: warning: too many 'l' suffixes in integer constant ../Boost/boost_1_29_0/boost/cstdint.hpp:202:195: warning: too many 'l' suffixes in integer constant Note: warning: ISO C++ does not support `long long' warning: ISO C89 forbids long long integer constants are suppressed by -Wno-long-long ============================================================================ Any opinions expressed in this e-mail are those of the individual and not necessarily those of Tyco Safety Products. Any prices for the supply of goods or services are only valid if supported by a formal written quotation. This e-mail and any files transmitted with it, including replies and forwarded copies (which may contain alterations) subsequently transmitted from Tyco Saftey Products are confidential and solely for the use of the intended recipient. If you are not the intended recipient or the person responsible for delivery to the intended recipient, be advised that you have received this e-mail in error and that any use is strictly prohibited. In this event, please notify us via e-mail at 'helpdesk.tepg(a)tycoint.com' or telephone on 0121 255 6499 and then delete the e-mail and any copies of it. ============================================================================

1 0

RE: [Boost-Users] Re: help with mersenne_twister
by scleary＠jerviswebb.com 17 Mar '03

17 Mar '03

> Hello Steve, and thank you for your kind help. I am trying to use > the boost library as part of a project in which I demonstrate the > validity of various random number generation algorithms and > methodologies. I wanted to use boost to demonstrate what can be > achieved through top class C++ generic programming. It sounds like Boost.Random may be a good choice for this. > I used mt19937 as you directed and my example did compile but when I > ran the binary file through Diehard it failed every single test > every time. I am sure this can not be due to the algorithm, but I > can not pinpoint what I could be doing in error. Here is the code I > used to create a binary file for diehard: I am not familiar with the "Diehard" tests. But I see a couple of problems in your example code: you are not creating a binary file, and you are not generating random numbers. > ofstream file("MTRNG.bin", ios::binary); "ios::binary" means open the output text file without \n -> \r\n conversions. It does not make insertions and extractions binary. > file << MT; This means to save the current state of the random number generator in the text output file. To output the generated random numbers (instead of the random number generator state), use: file << MT(); To output the generated random numbers to a binary file, use: const mt19937::result_type x = MT(); file.write((const char *) &x, sizeof(x)); > I was intending on using boost::random to demonstrate various > deterministic and non-deterministic RNGs and their validity as far > as randomness using Diehard. A last note: Boost.Random currently only provides one non-deterministic RNG, and it only works on Linux. -Steve

2 1

RE: [Boost-Users] help with mersenne_twister
by scleary＠jerviswebb.com 17 Mar '03

17 Mar '03

> -----Original Message----- > From: Jon Agiato [mailto:JonAgiato@nyc.rr.com] > > I am having difficulty in understanding the documentation regarding > the use of the pseudo-random number generators in boost::random. > Below, I have created a small sample program of the type I am trying > to create in order to use the various classes in boost::random with > Diehard (requires a binary file of 32 bit integers for testing). > This program does not compile as it says that mersenne_twister > requires template arguments. I understand what that means of > course, but am unsure as to what arguments should go in there. I am > using MSVC++ 7.0 and would really apprechiate any assistance. > Thanks! The Boost.Random library defines fully-generic random number generator algorithms, e.g., boost::random::mersenne_twister, boost::random::linear_congruential, etc. These are only for advanced users. The Boost.Random library also provides specializations of those generic random number generator algorithms for use by normal users. e.g., boost::mt19937 and boost::mt11213b are both specializations of the Mersenne twister; and boost::minstd_rand is a specialization of the linear congruential algorithm. So, unless you have really exceptional random number requirements, you should be using boost::mt19937 instead of boost::random::mersenne_twister: > using boost::random::mersenne_twister; using boost::mt19937; > mersenne_twister MT; mt19937 MT; Then your example should compile. -Steve

2 1

help with mersenne_twister
by agiatojon 17 Mar '03

17 Mar '03

Hello all, I am having difficulty in understanding the documentation regarding the use of the pseudo-random number generators in boost::random. Below, I have created a small sample program of the type I am trying to create in order to use the various classes in boost::random with Diehard (requires a binary file of 32 bit integers for testing). This program does not compile as it says that mersenne_twister requires template arguments. I understand what that means of course, but am unsure as to what arguments should go in there. I am using MSVC++ 7.0 and would really apprechiate any assistance. Thanks! #include <iostream> using std::cout; using std::cin; #include <cstdlib> #include <boost/random/mersenne_twister.hpp> using boost::random::mersenne_twister; #include <iomanip> using std::ios; #include <fstream> using std::ofstream; int main() { ofstream file("MTRNG.bin", ios::binary); const unsigned int N = 10; unsigned int i = 0; mersenne_twister MT; for(; i != N; ++i) { file << MT; } cin.get(); return EXIT_SUCCESS; } Jon Agiato JonAgiato(a)nyc.rr.com

2 1

RE: [Boost-Users] boost install and library linking
by scleary＠jerviswebb.com 17 Mar '03

17 Mar '03

> Clearly, I need to link to one of the boost::test library. How > should I be linking to this library? All libraries that were built > have a .lib extention and are spread over a huge directory > structure. How can I tell which library I need? I'm not that familiar with Boost.Test (yet), so I really can't answer this one. > Is there a way to finnish the build process so that all of the > statically-linked debug libraries are in one place? If somebody > would send me a make file or let me know what is a good approach to > building applications with boost, I'd appreciate it. AFAIK, there is no way to place all the .lib files in a single directory. The phrase "building applications with boost" leads me to state: Boost is not a library. Rather, Boost is a collection of libraries. Most of the Boost libraries (such as Boost.Random) are header libraries, which means that you add ${BOOST} to the include path of your compiler and you're done with the "installation". There are a few Boost libraries (Python, Regex, Signals, Test, and Thread) that produce actual .lib library files. If you are not using those libraries, you do not need to build the .lib files. HTH, -Steve

2 1

Re: [boost] Re: Regressions in type_traits and lexical_cast (was: Re: Questionabout boost::function)
by Douglas Gregor 15 Mar '03

15 Mar '03

On Saturday 15 March 2003 06:03 pm, Andreas Huber wrote: > [ ... ] > > > Index: is_class.hpp > > =================================================================== > > RCS file: /cvsroot/boost/boost/boost/type_traits/is_class.hpp,v > > retrieving revision 1.5 > > retrieving revision 1.6 > > diff -r1.5 -r1.6 > > 84a85 > > > > > ::boost::type_traits::ice_not< ::boost::is_function<T>::value > > >:: > > >::value > > > > John? > > This is due to the missing comma I reported in > > http://lists.boost.org/MailArchives/boost/msg45211.php > > Regards, > > Andreas Ah, yes it is. I've applied the patch (actually, Daniel Frey's version: no need to duplicate code) on mainline and the RC_1_30_0 branch. Doug

2 1

boost install and library linking
by adam_speight 15 Mar '03

15 Mar '03

I have a general question about finnishing the install process for boost. I have built boost on Cygwin/Gcc3.x/winXP and now have many versions of various libraries in a deep directory tree. Now, suppose I want to compile something, say random_test.cpp from http://www.boost.org/libs/random/index.html I get the following compiler error /cygdrive/c/DOCUME~1/aspeight/LOCALS~1/Temp/ccQGyqEq.o (.text$_Z8validateIN5boost6rand48EEvRKSsRKT_+0x103):random_test.cpp: undefined reference to `boost::test_toolbox::detail::test_and_continue_impl(bool, boost::test_toolbox::detail::wrapstrstream const&, char const*, int, bool, boost::unit_test_framework::report_level)' Clearly, I need to link to one of the boost::test library. How should I be linking to this library? All libraries that were built have a .lib extention and are spread over a huge directory structure. How can I tell which library I need? Is there a way to finnish the build process so that all of the statically-linked debug libraries are in one place? If somebody would send me a make file or let me know what is a good approach to building applications with boost, I'd appreciate it. Thanks, Adam

1 0

Generic output manipulator for lists
by Reece H Dunn 14 Mar '03

14 Mar '03

I have a manipulator that will display lists in the basic form: [ i1, i2, ... , in ] It has a usage for a container where it prints the entire container in the list notation; it also has the ability to select the range to be displayed: template< typename ForwardIterator > inline formatlist_t< ForwardIterator > formatlist( ForwardIterator first, ForwardIterator last ); template< typename Container > inline formatlist_t< typename Container::iterator > formatlist( Container & c ); Example usage of the manipulator is thus: std::vector< int > v( 10 ); std::generate( v.begin(), v.end(), std::rand ); // basic list formatting std::cout << "list = " << stl::formatlist( v ) << '\n'; // use the form :- ( i1, ..., in ) std::cout << "list = " << stl::formatlist( v ).format( '(', ')' ) << '\n'; // use the form :- [ i1 | ... | in ] std::cout << "list = " << stl::formatlist( v ).format( '|' ).space( true, true ) << '\n'; You can currently configure the opening and closing elements of the list (default to '[' and ']'); the seperator used (defaults to ','); the spacing around the list (default true) and before/after the seperator (defaults to after the seperator only). I would like to submit it into the boost library. Are there any comments/suggestions/questions? I have currently only tested it with MS VC++.NET 7, but have written the code to not use any MS specific features so it should be usable on most of the current compilers. -rhd- mailto:msclrhd@hotmail.com

2 1

boost::random examples of pseudo-random number generation
by agiatojon 14 Mar '03

14 Mar '03

Hello all, I would like to use boost for a project I am doing but have not been able to find an example of how one would use each class. I am sure it must be me but I am finding the doumentation a bit hard to read, and I am sure it is much easier than I am finding it. In case it is relevant, I am using MSVC++ 7.0. Thanks for any and all help/suggestions! Jon Agiato JonAgiato(a)nyc.rr.com

2 1

Regex++ bug?
by sugi＠dream.big.or.jp 14 Mar '03

14 Mar '03

Hi. I found some strange behaviors in Regex++. For details, please see the following source. These are bugs? or do I have mistaken? boost's version is 1.29.0. --- #include <iostream> #include <boost/regex.hpp> using namespace std; void p(const char *r, const char *s){ cout << endl << "*********" << endl; cout << "regex: " << r << endl; cout << "string: " << s << endl; cout << "result: " << (boost::RegEx(r).Search(s) ? "found" : "not found") << endl; } int main(){ // I think this must not match, but this do. p("a\\Z", "a\nb"); // These match. Correct behaviors. p("()", "abc"); p("^()", "abc"); p("^()+", "abc"); p("^(){1}", "abc"); // But these don't match. // Are these wrong? p("^(){2}", "abc"); p("^((){2})", "abc"); // I feel these somewhat strange. // But I have little confidence to say that this is a bug. p("()", ""); // found (OK) p("()\\1", ""); // not found (this must match?) p("()\\1", "a"); // found (OK) p("a()\\1b", "ab"); // found (OK) p("a()b\\1", "ab"); // not found (this must match?) return 0; } --- Kouhei Yanagita

2 2

filling in vertex_name_t property for adjacency_list
by Dieter Vrancken 14 Mar '03

14 Mar '03

Hi, I'm trying to create a graph that has a name for each vertex. Below is what I've come up with so far. I really don't know what's wrong with it. Can any of you help me out? I'm using boost 1.29.0 with Visual Studio6.0sp5 on win2k. I'm getting some errors on the line that's supposed to get the property map. Then a whole bunch of others because in the end 'name' has an incomplete type. kind regards, Dieter Vrancken // create some vertex names typedef std::set<std::string> StringSet; StringSet v_names; std::string names[] = { "v1", "v2", "v3" }; v_names.insert(names, names + sizeof(names)/sizeof(names[0])); // declare the graph typedef boost::adjacency_list<boost::setS, boost::vecS, boost::directedS, boost::vertex_name_t, boost::no_property, boost::graph_name_t, boost::setS> Graph; Graph g(v_names.size()); // get the property map for the vertex names boost::property_map<Graph, boost::vertex_name_t>::type name = boost::get(boost::vertex_name, g); // fill in the names StringSet::const_iterator ss_it = v_names.begin(), ss_end = v_names.end(); int i = 0; for(; ss_it!=ss_end; ++ss_it, ++i) boost::put(name, i, *ss_it);

3 3

What is the relationship between BGL's edge_descriptor and edge_iterator?
by Jeff Holle 14 Mar '03

14 Mar '03

What is the relationship between an "edge_descriptor" and what an edge_iterator dereferences? I'm having problems coding the following: myFunct(GraphT& g) { typedef graph_traits<GraphT>::edge_descriptor Edge; typedef map< Edge, Edge_Datum> Edge_Data; Edge_Data edge_data; graph_traits<GraphT>::edge_iterator ei, ei_end; for(tie(ei,ei_end)=edges(graph);ei!=ei_end;++ei) edge_data.insert( make_pair(*ei, Edge_Data())); << blows up here. }

1 1

Minor bug in docu of lambda library
by Peter Klotz 13 Mar '03

13 Mar '03

URL: http://www.boost.org/libs/lambda/doc/ar01s03.html#id2741989 The code fragment template <class T> : public binary_function<T, T, T> struct plus { should read template <class T> struct plus : public binary_function<T, T, T> { Best regards, Peter.

1 0

slightly off-topic: recommendation for algorithm timing?
by Alejandro Escalante Medina 13 Mar '03

13 Mar '03

This is may a little out of the topic, but maybe you could recommend me some good class for measuring code execution times... Thanks, Alex _________________________________________________________ Do You Yahoo!? La mejor conexión a internet y 25MB extra a tu correo por $100 al mes. http://net.yahoo.com.mx

3 2

Blind dynamic cast
by lorydido 13 Mar '03

13 Mar '03

Good morning, First of all, thank you very much for your help in advance. I have a problem in dynamic casting. sc_object *o = (sc_object*)(x[i]); if (typeid(*o)==typeid(sc_out<bool>)) sc_out<bool> *thisPort=dynamic_cast<sc_out<bool> *>(o); sc_out<T> type is a polymorphic template class that inherits sc_object class. I would like to cast the polymorphic object (*o) without to know the template type T of sc_out<T>. I would avoid all the possible casts that can result in an enormous computational burden. I would like to access to the methods of sc_out<T> type.I cannot modify the code of sc_out<T> and sc_object.Does exist any way to perform this "blind" operation? Does exist a boost library that allows the use of the string typeid.name() as type in dynamic cast operation? thank you very much in advance Lorenzo PIERALISI

2 1

compose_f_gx problem
by pirx 13 Mar '03

13 Mar '03

hi, I've got a question regarding the compose_f_gx function object. I tried to use it in combination with this small example. class Element { public: explicit Element(int nVal) : m_nValue(nVal) {} const int getValue() const { return m_nValue; } private: int m_nValue; }; Element el(3); // a == true; bool a = bind<bool>(equal_to<int>(), _1, 3)(3); // b == 3; int b = mem_fn(&Element::getValue)(el); // c == true bool c = bind<bool>(equal_to<int>(), _1, 3) (mem_fn(&Element::getValue)(el)); // d should also be true, but does not compile bool d = compose_f_gx(bind<bool>(equal_to<int>(), _1, 3), mem_fn(&Element::getValue))(el); The last line does not compile. I don't know why. So what's wrong? thanks, andreas

2 1

Re: [Boost-Users] slightly off-topic: recommendation for algorithm timing?
by Paul Grenyer 13 Mar '03

13 Mar '03

Hi > This is may a little out of the topic, but maybe you > could recommend me some good class for measuring code > execution times... Would boost's timer do what you want? Regards Paul Paul Grenyer Email: pjgrenyer(a)iee.org Web: www.paulgrenyer.co.uk "So long and thanks for all the fish."

1 0

filling in vertex_name_t property for adjacency_list
by Jack Rabbit 13 Mar '03

13 Mar '03

Hi, I'm trying to create a graph that has a name for each vertex. Below is what I've come up with so far. I really don't know what's wrong with it. Can any of you help me out? I'm using boost 1.29.0 with Visual Studio6.0sp5 on win2k. I'm getting some errors on the line that's supposed to get the property map. Then a whole bunch of others because in the end 'name' has the wrong type. kind regards, Dieter Vrancken // create some vertex names typedef std::set<std::string> StringSet; StringSet v_names; std::string names[] = { "v1", "v2", "v3" }; v_names.insert(names, names + sizeof(names)/sizeof(names[0])); // declare the graph typedef boost::adjacency_list<boost::setS, boost::vecS, boost::directedS, boost::vertex_name_t, boost::no_property, boost::graph_name_t, boost::setS> Graph; Graph g(v_names.size()); // get the property map for the vertex names boost::property_map<Graph, boost::vertex_name_t>::type name = boost::get(boost::vertex_name, g); // fill in the names StringSet::const_iterator ss_it = v_names.begin(), ss_end = v_names.end(); int i = 0; for(; ss_it!=ss_end; ++ss_it, ++i) boost::put(name, i, *ss_it);

1 0

Efficient implementation of associative_property_map
by Martin Okrslar 12 Mar '03

12 Mar '03

Dear Boost users, for an application in computational biology I am intendig to use the BGL to compute strongly connected components of a graph with about 600.000 nodes. In the BGL book on page 103 it is mentioned, that "The choice to use std::map to implement the property map is rather inefficient in this case...". Since my graph is large I'm a bit worried about this statement. Could anybody of you please give me a hint, what other datastructure I might use here, to make it efficient? all the best Martin -- ----------------------------------------------------------------------------- Martin Okrslar MPI for Molecular Genetics phone: ++ 49 + 30 / 8413-1166 Computational Molecular Biology Fax: ++ 49 + 30 / 8413-1152 Ihnestrasse 73 email: okrslar(a)molgen.mpg.de D-14195 Berlin URL: http://cmb.molgen.mpg.de -----------------------------------------------------------------------------

7 9

adjacency_matrix
by agiatojon 12 Mar '03

12 Mar '03

Hello all, I'm new to the list and to Boost in general and am trying to use an adjacency_matrix in order to plot coordinates (hopefully that is a good use for it). I just started trying to learn it and have entered the sample program from page 237 into my compiler (VS.NET) Below is the program I have entered. I am getting errors in that print_vertices, print_edges, and print_graph are undefined and are not members of boost. Any help apprechiated! Thanks. /** * adjaMatri.cpp * Nov 7th, 2002 * Boost Graph Library, pg. 237 */ #include <iostream> using std::cout; using std::cin; using std::endl; #include <boost/graph/adjacency_matrix.hpp> using namespace boost; int main() { enum { A, B, C, D, E, F, N }; const char *name = "ABCDEF"; typedef boost::adjacency_matrix<boost::undirectedS> UGraph; UGraph ug(N); add_edge(B, C, ug); add_edge(B, F, ug); add_edge(C, A, ug); add_edge(D, E, ug); add_edge(F, A, ug); cout << "vertex set: "; boost::print_vertices(ug, name); cout << endl; cout << "edge_set: "; boost::print_edges(ug, name); cout << endl; cout << "incident edges: "; boost::print_graph(ug, name); cout << endl; cout << "Press enter to exit..."; cin.get(); return EXIT_SUCCESS; } Jon Agiato JonAgiato(a)nyc.rr.com

2 1

BGL: getting components of graphs with properties
by Martin Okrslar 12 Mar '03

12 Mar '03

Dear Group, when computing the connected components of a BGL graph one has to create a vector that holds the component integer assigned to each vertex (See http://www.boost.org/libs/graph/example/connected_components.cpp and http://www.boost.org/libs/graph/doc/connected_components.html) OK, that works very well. But how can I get the component number of each vertex? If my graph has internal properties, I can not simply access the vector with an iterator on the graph vertices: component[*vi]; //doesn't work! This doesn't work, because the vertices (to be specific: the vertex desriptors) of the graph aren't integers if the graph has internal properties. Any idea how to get the component of each vertex? all the best Martin -- ----------------------------------------------------------------------------- Martin Okrslar MPI for Molecular Genetics phone: ++ 49 + 30 / 8413-1166 Computational Molecular Biology Fax: ++ 49 + 30 / 8413-1152 Ihnestrasse 73 email: okrslar(a)molgen.mpg.de D-14195 Berlin URL: http://cmb.molgen.mpg.de -----------------------------------------------------------------------------

1 0

[V2] Problems with stage rule
by klapshin 12 Mar '03

12 Mar '03

Hi, I am having few problems on CygWin with latest boost CVS snapshot. I am building project with a number of dlls, and I need a way to run program easily. I tried hardcode-dll-paths=true, but it does not seem to work on CygWin, so I decided to use stage rule to copy all binaries in top/bin folder. First problem was that CP variable is empty and copying of the dlls failed. I worked around this one with bjam -sCP=cp. BTW, was not it supposed to be relinked rather then copied? Next problem was with exe file. Stage failed with following errors: ----------------- /cygdrive/c/work/boost1/tools/build/new/stage.jam:97: in object(stage-exe-gener tor)(a)1.run *** argument error * rule object(file-target)(a)174.depends ( d + ) * called with: ( ) * missing argument d /cygdrive/c/work/boost1/tools/build/new/virtual-target.jam:86:see definition of rule 'object(file-target)(a)174.depends' being called /cygdrive/c/work/boost1/tools/build/new/generators.jam:638: in try-one-generato /cygdrive/c/work/boost1/tools/build/new/generators.jam:885: in construct-withou -caching /cygdrive/c/work/boost1/tools/build/new/generators.jam:937: in generators.const uct /cygdrive/c/work/boost1/tools/build/new/stage.jam:56: in construct /cygdrive/c/work/boost1/tools/build/new/targets.jam:604: in object(stage-target class)(a)3.generate /cygdrive/c/work/boost1/tools/build/new/targets.jam:386: in generate-really /cygdrive/c/work/boost1/tools/build/new/targets.jam:363: in object(main-target) 3.generate /cygdrive/c/work/boost1/tools/build/new/targets.jam:182: in object(project-targ t)(a)1.generate /cygdrive/c/work/boost1/tools/build/new/build-system.jam:140: in load /cygdrive/c/work/boost1/tools/build/new/modules.jam:171: in import /cygdrive/c/work/boost1/tools/build/new/bootstrap.jam:41: in boost-build /cygdrive/c/work/pricing/boost-build.jam:13: in module scope ------------------ One more thing. Suppose I want to install all dlls to bin subfolder of project root. I tried to define path-constant in project-root, and then in one of subprojects apply stage on target and supply path from that path-constant. I end up with dll being copied into bin subfolder of subproject, rather then root. Is it expected behavior? My workaround was to put all stage rules in root Jamfile. - Kirill

1 1

BOOST_PP_NOT documentation
by Staggs Mark - mstagg 11 Mar '03

11 Mar '03

This is a _very_ minor thing, but I noticed in the documentation for BOOST_PP_NOT the following line: If x is non-zero, this macro expands to 1. Otherwise, it expands to 0. Should read: If x is zero, this macro expands to 1. Otherwise, it expands to 0. URL: http://www.boost.org/libs/preprocessor/doc/ref/not.html ---- Mark Staggs Acxiom Corp. ********************************************************************* The information contained in this communication is confidential, is intended only for the use of the recipient named above, and may be legally privileged. If the reader of this message is not the intended recipient, you are hereby notified that any dissemination, distribution, or copying of this communication is strictly prohibited. If you have received this communication in error, please re-send this communication to the sender and delete the original message or any copy of it from your computer system. Thank You.

2 1

boost::thread not started
by justin_michel 11 Mar '03

11 Mar '03

Platform : Windows XP, Pentium 4, Visual C++ 6 sp5 I've traced down my problem with starting a thread from a DLL called from Java JNI. If you look at the source code thread.cpp in boost, you can see that a condition variable is used block the creating thread until the new thread function is started. Basically, what I am seeing is that if you wait on this condition variable, then the thread will never start. If I remove the call to param.wait() at the bottom of the constructor then everything works fine. I can't think of a logical explanation, but it's very repeatable. I was also able to recreate this problem using the latest source from CVS. The simple solution would be to remove the condition variable from thread_param code entirely. This would simplify everything, and I don't really see the value anyway. All that is currently guaranteed is that thread_proxy will be called before the boost::thread() constructor is finished. But it doesn't guarantee that threadfunc() will be called before the constructor is finished. Thanks, Justin Michel OCI

2 3

uBLAS: Can I make my vector<...> derived class 'copy constructible' ?
by speedsnaii 11 Mar '03

11 Mar '03

Hi Joerg, or anyone who can help! As I am still on my spline templates, I came on to the following beast: template<class T> struct index_vector : public vector<std::pair<T, vector<ublas::vector<T>::size_type> > > {}; This should be an index vector that relates to a double (first) a vector of indices (second) which happens to be different for each 'first'. So far so easy. I can say: index_vector<double> IY; IY.resize(5); IY[0].first = 3.14; IY[0].second.reset(vector<double>(3)); IY[0].second[2] = 1; But I cannot: index_vector<double> IZ(IY); or index_vector<double> IZ; IZ = IY; or IZ.reset(IY); This compiles, but gives me runtime assertions because of size mismatches. I think my derived class is not 'copy constructible' and 'assignable'. Is there a simple way to fix this? (I am not even sure whether this is a uBLAS matter. So please simple tell me, and I will try to learn the missing parts.) Thank you, Roland

2 2

How to get extents of multi_array dimensions
by Neil Mackie 11 Mar '03

11 Mar '03

I am using multi-array for the first time, without problems. Now I want to pass the multi_array around and the users of it need to find out what the maximum array indexes are in each dimension. But I do not know how to obtain them from the object. I have read the documentation and the header file but if there are any clues there I have missed them. I have also searched the archives of this list for relevant posts. Is there a call on multi_array to return the array bounds and if so how do you specify which dimension you are requesting the bounds of? Does anyone have an example they could post? Regards, Neil (J Mackie).

1 0

index(*vi) in the BGL quick tour?
by Jack Rabbit 11 Mar '03

11 Mar '03

Hi, My IDE is VC++6.0. I'm on win2k, using boost 1.29.0. I'm trying to get the quick tour (BOOST_HOME/libs/graph/doc/quick_tour.html) of the graph library to compile, but am experiencing a problem. In the example on how to invoke Dijkstra's algorithm, it seems we're calling a function index(*vi). I'm guessing it's supposed to get the node number for the node at vertex_iterator vi. The problem is that my compiler can't find the function ('index' : undeclared identifier). Doing a manual 'search in files' doesn't reveal any legible candidates either. Is this an error in the docs or am I missing something bigger here? kind regards, Dieter Vrancken

1 0

spirit framework...
by Michael Burbidge 10 Mar '03

10 Mar '03

I understand that the spirit compiler framework has been accepted as part of boost. Does anyone know when it will be part of the standard boost distribution. I'm finding that spirit 1.5.1 generally works on Mac OS X using CodeWarrior, but that I'm experiencing runtime assertions running some of the examples. In particular the ast_xml example. Thanks, Michael-

2 1

Problem with tuples::ignore
by Tom Matelich 10 Mar '03

10 Mar '03

I'm sure I've seen posts about this, but have been unable to track it down... Apparently gcc 3.2 only uses the cpp file name to "anonymize" anonymous namespaces. My problem is that Application A links libs B and C, which both have files named foo.cpp. These foo.cpp's both include boost/tuples/details/tuple_basic.hpp, thus causing duplicate symbols of tuples::{anonymous}::ignore. Obviously I can work around this by renaming the cpp files, but I thought I'd see if there was a quicker solution. Thanks Tom pardon the disclaimer... ----------------------------------------------------------------------- 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

uBLAS: reference to container data & iteratordeclaration
by speedsnaii <speedsnaii＠yahoo.de> 08 Mar '03

08 Mar '03

Hi, *) First question: I am trying to get a reference to data of a container in the following way: matrix<double> m(3,3); vector<double>& v(m.column(2)); But this seems not to be possible. Is there a way to achieve this behaviour? What I basically want to achive is having functor object that holds a reference to a row/column of my container matrix. >From my questions about argument types I know that m.column(2) is a kind of an expression. How can I get the underlying reference to data if there even is one? *) Second question: matrix<double> m(10,3); ... fill the matrix ... matrix<double>::iterator it; // wrong this does not work!! for (it = m.column(2).begin(); it != m.colum(2).end(); ++it) { cout << *it << " " << foo(*it) << endl; } How would I declare my iterator? I understand when I use std::library-algorithms the automatic template parameter defer will give me the correct type from begin(). But in my case how should I declare the iterator? Thank you for help. Roland

3 10

thread problems with Java JNI
by justin_michel 07 Mar '03

07 Mar '03

A simple test program using boost::thread works fine, but when I try to use boost::thread in a DLL library which is called from a Java thread, the thread blocks forever in the constructor for boost::thread. Looking at the source code for boost::thread, I see that it blocks on a condition waiting for the thread to start. Maybe the thread never starts? So. I modified my code to use _beginthreadex() directly to start my worker thread. I hoped to at least get a better idea of what was going wrong, but the code worked flawlessly. Are there known problems with using boost::thread from a DLL? Any other ideas? Thanks, Justin Michel

1 0

boost-build path discrepancies
by Michael Hunley 07 Mar '03

07 Mar '03

As per my recent post "Installing boost libs for dependant apps," I recently used the boost-build system for my own apps make setup. I found it to be very powerful and useful (more than I could use to begin with). I used the version 1 build system becuase it looked like it would be easier to get up and running, but plan to migrate to v2 soon since it is more powerful and I much prefer the dependency handling of adding sub-projects by name, not path to a Jamfile. But I need to learn it first. I did this on RedHat 8.0 using gcc 3.2.2 with a cut of the Boost CVS from 2/6/2003 on the Boost-Build v1.30.0. I copied most of the main files (features.jam, boost-build.jam, etc) from the main boost build setup in BOOST_ROOT and BOOST_ROOT/tools/build. I ran into two issues with pathing and another with the LinkLibraries rule. I tried a couple of approaches to including externally built libraries to my build hierarchy (several sub-project libs and one app). When I tried LinkLibraries it didn't complain, but the library never got added to my link action in the NEEDLIBS variable. I tried tracing it down and added Echo actions to the LinkLibraries to see what it was adding, which was nothing, but I could have mis-understood the NEEDLIBS on $(<) expression. Regardless, they did not appear in the list of libs passed to the linker. I then tried the <libraryfile> feature in my requirements section. That worked fine. So, is LinkLibraries deprecated (the docs did not mention it that I could find)? I had it first in my list, before my exe target, but in the same file. Was it supposed to go after? I liked LinkLibraries better than the <libraryfile> since it would do the name mangling for me (prefix="lib", suffix=".so" under gcc). The other problem I ran into revolved around use of relative paths and I believe my results are counter to what the documentation claims. First, when I added dependant libraries as source entries in my exe target the docs claim I can make those paths absolute. My setup is a little out of the norm in that my app is at the leaf node of the directory tree, so the relative path to the main lib it needed was $(DOTDOT). However, I have several libs common to other apps, but in the same boost build hierarchy, so those are relative to $(BOOST_ROOT). When I tried having a source line: <lib>$(BOOST_ROOT)/Common/CommonLib from within my Jamfile located at $(BOOST_ROOT)/ServerLib/Server The output when I tried bjam was: (|ServerLib|Server|home|michael|Proj|Common) not found (I am only sure of the folder part of that, the exact error syntax may be slightly off). I had to specify the paths as: $(DOTDOT)/$(DOTDOT)/Common/CommonLib In the second case, it was relative pathing that wouldn't work. I specified most of the common features and settings using template targets that I then imported into each Jamfile (Very nice feature). The one of concern was located in the $(BOOST_ROOT)/ServerLib folder. In the $(BOOST_ROOT)/ServerLib/Server/Jamfile I added a requirement: <include>$(DOTDOT) To get back to ServerLib which it depends on. I swear that worked the first time I got it built, but last night when I did a rebuild all (bjam -a) it failed and claimed it could not find include files. I ended up having to change it to absolute pathing to work. Are the docs wrong on the two pathing issues? Is there something I could be setting up wrong to get the behavior I saw? thanks. michael

1 0

installing boost libs for dependant apps
by Michael Hunley 07 Mar '03

07 Mar '03

I just completed porting our server from XP to Linux, which uses Boost::Thread for the threading library. I found it was infinitely more convenient to publish the libs in their various formats (variant|sub-variant) into a common, top-level folder under BOOST_ROOT. This made it much more managable to both link it into my application (without having to grist the folder name) and add the proper path to my LD_LIBRARY_PATH env var so it could find the shared libraries when I ran. I don't know if there is a prescribed way of doing this already in place, but I did not see anything in the build documentation (like bjam "Install [folder]" or some such). I ended up modifying the BOOST_ROOT/Jamfile to have a stage target that published all the threading libs to BOOST_ROOT/bin with proper suffixes for the variants I cared about (debug and release for the moment). I still had to append the proper suffixes in my own Jamfile (I used BJam for my make as well), but it was a heck of a lot better than a 10 deep folder hierarchy. I have a couple of question and two requests. For reference I am using a cut from CVS around 2/6/2003. How are others doing this sort of thing that are using Boost? Is there a common way to do what I did by doctoring the Jamfile that is less invasive (so I don't have to repeat in the future when I get releases from CVS)? I am new to Linux & Boost, so may not know how I should be getting at these things. My request, if the answers to the above don't address them, is that some form of install or publish to a common location be added to the boost build. If I were more intimately familiar with Boost and the build system (and the various installation platforms) I would volunteer to help, but... My second request may also already be possible, but my limited experiment and reading made it seem not. I'd like to be able to declare a sub-project that points to a whole other boost-build.jam hierarchy; e.g. I want to make Boost a sub-project of mine. This seems much more plausible and likely in the new versoin 2 format where the dependency declarations are more straight-forward (by name, not explicit path). I await your feedback. Thanks. michael

1 0

boost::signals build and C++Builder 6 Pro in 1.29.0
by Russell Hind 07 Mar '03

07 Mar '03

I have built the boost::signals library with C++Builder 6 Pro Update 4 and am running into problems: a) We tend to use double word alignment, not quad word (which is the default in C++Builder). It appears that the libraries are built with quad word, but the headers don't enforce this, so when I change the options to double word (in our project) and try to construct a signal with boost::signal0<void> s; I get an access violation when constructing a signal (from line 266 of shared_count.hpp) The call stack is 00417F3F __internal_malloc 00417DD8 __internal_malloc 00417539 ___org_malloc 00416EA2 ___org_new 004076E1 boost::detail::shared_count::shared_count(this=:0012FBB4, p=:007F3928, d={ }, =:007F3928) 004063E3 boost::shared_ptr<boost::signals::detail::signal_base_impl>::shared_ptr<boost::signals::detail::signal_base_impl>(this=:0012FBB0, p=:007F3928) 0040546D boost::shared_ptr<boost::signals::detail::signal_base_impl>::reset<boost::signals::detail::signal_base_impl>(this=:0012FF70, p=:007F3928) 00403F51 boost::signals::detail::signal_base::signal_base(this=:0012FF70, comp=:0012FC24) 0040232E boost::signal0<void, boost::last_value<void>, int, _STL::less<int>, boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, _STL::allocator<boost::function_base> > >::signal0<void, boost::last_value<void>, int, _STL::less<int>, boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, _STL::allocator<boost::function_base> > >(this=:0012FF70, c=:0012FC7C, comp=:0012FC74) 00401BF3 main(argc=1, argv=:007F21E4) 00420862 __startup b) If I do use quad word alignment, then the object constructs correctly, but when I connect a method to it with void VoidFunc(void) { } int main(int argc, char* argv[]) { boost::signal0<void> s; s.connect(&VoidFunc); } the program hangs. Turning on CodeGuard shows a similar problem to that above. The object was allocated with a size of 12 bytes, but code is trying to access byte 16 in the object (I guess this is a similar alignment problem). The callstack is 0041E44E boost::counted_base::dispose(this=:00C04360) 00427203 boost::signals::detail::signal_base_impl::connect_slot 00404741 boost::signal0<void, boost::last_value<void>, int, _STL::less<int>, boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, _STL::allocator<boost::function_base> > >::connect(this=:0012FF60, in_slot=:0012FDA8) 004026C5 main(argc=1, argv=:00C021E4) 00433802 __startup It says the this pointer block is only 12 bytes long, but the code is trying to access byte 16. Do (or should) all the bost headers force alignment before all structures/classes and then restore the alignment afterwards? Currently, I have to link directly with the signals source code to get use the library. Has anything to do with this been changed in the builds of 1.30.0? Thanks Russell

8 27

Using Unit Tests w/Codewarrior Pro 8.3
by paul_snively <paul_snively＠yahoo.com> 07 Mar '03

07 Mar '03

Folks, I'd like to be able to run a boost unit test, e.g. is_convertible_test.cpp, as kind of a one-shot apart from having to deal with the rest of boost. So I read the documentation on the unit test framework, and it seems like this should be relatively straightforward. I've created a Carbon Console project in Codewarrior, which contains the following files: is_convertible_test.cpp init.cpp (from type_traits/test) unit_test_main.cpp unit_test_suite.cpp unit_test_result.cpp unit_test_log.cpp unit_test_monitor.cpp execution_monitor.cpp unit_test_parameters.cpp test_tools.cpp This all compiles and links file, which is a relief in and of itself. :-) However, when I simply run the app, I get "*** No errors detected". If I remove is_convertible_test.cpp and rebuild and run again, I get the same result. :-) So my suspicion is that I need to do more to let the framework know that it needs to run is_convertible_test.cpp. Can someone please clue me in as to what that is, in minimal terms? Thanks!

4 4

shared_ptr 1.27 w/gcc 2.96 (VxWorks)
by Brian 06 Mar '03

06 Mar '03

We are using boost 1.27 (I know, I know) with the real-time operating system VxWorks, which ships with its own "special" version of gcc 2.96 (not that same as Red Hats - I know, I know). Today I finally got around to providing a version of atomic_count.hpp for VxWorks. I had to play some games with #defines to get BOOST_HAS_THREADS and all the other things set up right before my implementation would get chosen. Once that was squared away, I put a cout in the constructor of my atomic_count class just be sure it was all working. I then stamped down a shared_ptr<int> and much to my surprise: no text output. I traced it back to the constructor for counted_base_impl (a templated class). That constructor was being called, but it inherits from counted_base, and that constructor was just not getting called! I searched your bug list on source forge but found no mention of this. But then again, its not really a boost bug! I then took a look at boost 1.29 and noticed that lots of things had been reworked in this area, so now looks like the reason to start using 1.29. I'm afraid I am stuck with VxWorks and that compiler though... So I'm just throwing this out in case anyone is remotely in the same situation as we are. I will start using 1.29 and see what happens. Hopefully its not too hard to customize the OS specific part in 1.29. I also suggest a note get added to the shared_ptr documentation about this OS specific mutex stuff thats going on. I got curious about how that was done and decided to look. Had I not done this, my shared_ptr's reference count would not have been thread safe and I wouldn't have known this. Also, is there a "what has changed in this new version of boost" file somewhere? Thanks again everyone. BN

1 1

Re: [Boost-Users] Unable to BOOST_INSTALL_PROPERTY
by Administrator 06 Mar '03

06 Mar '03

Martin, I did a simple search through the Boost website, and on http://www.boost.org/libs/graph/doc/using_adjacency_list.htm, I found this: You can also use enum's instead of struct's to create tag types. Create an enum type for each property. The first part of the name of the enum type must be edge, vertex, or graph followed by an underscore, with a _t at the end. Inside the enum, define a value with the same name minus the _t. Then invoke the BOOST_INSTALL_PROPERTY macro. enum edge_myflow_t { edge_myflow }; enum edge_mycapacity_t { edge_mycapacity }; namespace boost { BOOST_INSTALL_PROPERTY(edge, myflow); BOOST_INSTALL_PROPERTY(edge, mycapacity); } compared to: > namespace boost{ > enum vertex_xx_t { vertex_xx = 1111}; > BOOST_INSTALL_PROPERTY(vertex,vertex_xx); > } which means it should be: > enum vertex_xx_t { vertex_xx = 1111}; > namespace boost{ > BOOST_INSTALL_PROPERTY(vertex,xx); > } Dale

1 0