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

newbie boost thread build under Linux help
by Mark Sizer 11 Jun '03

11 Jun '03

I had such success with Boost under Windows, that I'm now trying to get it up and running under Linux. This is not a happy experience. I got it to work, but this can't be the way it's supposed to be done: I'm using boost_1_30_0. I installed the bjam RPM (boost_jam_3.1.4-1.i386.rpm). bjam "-sTOOLS=gcc" from a bash command line. I had all sorts of very strange error messages, so I set about upgrading my Linux environment. I boostrapped the gcc 3.3 compiler (I had 2.6 something). Same error messages. I upgraded libstdc++ to libstdc++-v3.0.97-gcc-3.1.x.tar.gz (I'm seeing the gcc version mismatch as I type this, but it is the latest libstdc++). The "merging into an existing compiler" instructions seemed really complicated so I installed it and re-bootstrapped the compiler. Got a more sensible error message: Unknown compiler version please run the configure tests and report the results. (from gnu.hpp) I hacked gnu.hpp to allow the 3.3 compiler. The error message changed to being unable to find the std:: headers (first one was <utility> from select_stdlib.hpp). I seem to have at least four versions: /usr/include/g++-2/utility /usr/include/g++-3/utility /usr/include/g++-v3/utility (judging by the dates, this seems the correct one) /usr/local/include/c++/utility Obviously, none of these are in the compiler's include path. bjam "-sTOOLS=gcc" "-sGCC_INCLUDE_DIRECTORY=/usr/include/g++-v3" Wasn't helpful: "bits/c++config.h" can't be found. That's in /usr/include/g++-v3/i686-pc-linux-gnu. However, there doesn't seem to be a way to specify more than one include directory (neither multiple "-s" nor delimited paths in a single "-s" worked). So I copied everything from i686-pc-linux-gnu/bits to ../../bits. It built. This can't be normal. How is this process supposed to work? Thanks, - Mark

2 1

Mutex scoped_lock compile errors
by Darren Vincent Hart 10 Jun '03

10 Jun '03

Esteemed Boost Gurus, I am trying to compile a method with a scoped_lock call. If I use a mutex object declared in the class implementation file (logger.cpp) it builds, if I use a mutex of the same type declared as a private member of the logger class (in logger.h), I get the following compiler error: logger.cpp: In member function `void pel::logger::info(const std::string&, const std::string&, int, const std::string&) const': logger.cpp:36: error: no matching function for call to ` boost::detail::thread::scoped_lock<boost::mutex>::scoped_lock(const boost::mutex&)' /usr/include/boost/thread/detail/lock.hpp:62: error: candidates are: boost::detail::thread::scoped_lock<boost::mutex>::scoped_lock(const boost::detail::thread::scoped_lock<boost::mutex>&) /usr/include/boost/thread/detail/lock.hpp:67: error: boost::detail::thread::scoped_lock<Mutex>::scoped_lock(Mutex&, bool = true) [with Mutex = boost::mutex] make: *** [logger.o] Error 1 The relevant method from the implementation file is as follows: void logger::info(const std::string& msg, const std::string& file, int line, const std::string& function) const { // io_mutex is declared above in the pel namespace boost::mutex::scoped_lock scoped_lock(io_mutex); // no problem // mutex is a private member of the logger class boost::mutex::scoped_lock scoped_lock2(mutex); // line 36, fails std::cout << "...blah..." << std::endl; } Can someone explain why these are treated differently by the compiler ? Thanks, Darren Hart dvhart(a)byu.edu

3 4

RE: [Boost-Users] Struggling with bind
by Jean-Marc Prud'homme 10 Jun '03

10 Jun '03

Hi Paul, _1 is a placeholder argument. When you write bind(&CDocumentAttachments::Execute, _1, _T("print")) you are creating a functor that can be called with a single argument of type CDocumentAttachments. This is what is required by the for_each algorithm. It is equivalent to bind<HINSTANCE>(mem_fn(&CDocumentAttachments::Execute), _1, _T("print")) Look at the mem_fn doc. You still need this kind of functor if you add more arguments to CDocumentAttachments::Execute. This should create the functor you need bind(&CDocumentAttachments::Execute, _1, _T("print"), false) Hope this helps, Jean-Marc -----Original Message----- From: Paul Thompson [mailto:friedegg@ntlworld.com] Sent: Tuesday, June 10, 2003 7:54 AM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Struggling with bind Hi all. I've been using boost::bind to work around deficiencies with std::mem_fun_ref and std::bind2nd under MSVC6. I have a class called CDocumentAttachments which had a member function thus: HINSTANCE Execute(LPCTSTR verb) const; I was using bind with this as follows: for_each(filenames.begin(), filenames.end(), bind(&CDocumentAttachments::Execute, _1, _T("print"))); "filenames" is a const vector of CDocumentAttachments objects. This worked fine. A little later on in development, I changed the function signature for CDocumentAttachments::Execute to: HINSTANCE Execute(LPCTSTR verb, bool visible) const; How will I pass the extra bool to bind? I can't find any examples of passing more than one parameter to a member function. I thought about (among many others) for_each(filenames.begin(), filenames.end(), bind(&CDocumentAttachments::Execute, _2, _T("print"), false)); but the compiler (VC6) complains with two of the following: k:\vc\include\boost\bind.hpp(760) : error C2679: binary '[' : no operator defined which takes a right-hand operand of type 'const class boost::arg<2>' (or there is no acceptable conversion) k:\vc\include\boost\bind\bind_template.hpp(33) : see reference to function template instantiation 'struct HINSTANCE__ *__cdecl boost::_bi::evaluator3<struct HINSTANCE__ *>::eval(const class boost::_bi::list3<class boost::arg<2>,class boost:: _bi::value<char *>,class boost::_bi::value<bool> > &,struct boost::_mfi::cmf2<struct HINSTANCE__ *,class CDocumentAttachments,char const *,bool>,class boost::_bi::list1<class CDocumentAttachments const &> &)' being compiled I know I'm being really thick here, and I'm sure there's something really obvious that I'm missing, but reading through the documentation hasn't helped me. Thank you very much. Paul -- Paul Thompson Programmer McLellan Software Design Ltd. 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

to_simple_string and Windows?
by adutoit 10 Jun '03

10 Jun '03

Hi. I have used the boost::date_time library in Linux with no problems, but the same can not be said of my experience with it in Windows... My current pain in Windows is with the "to_simple_string" method used to convert a boost::date_time value to guess what, a string. This works fine in Linux, but not in stupid Windows. The following line just borks: std::cout << to_simple_string(date(2003,4,30)) << std::endl; Any little unknown configuration tricks etc. I need to be aware of here? Has anyone used the "to_simple_string" method without problems in Windows? I'll appreciate any help in this regard. Greetings, A. [Non-text portions of this message have been removed]

2 3

New file uploaded to Boost-Users
by Boost-Users＠yahoogroups.com 10 Jun '03

10 Jun '03

Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the Boost-Users group. File : /uBLA Performance 2.pdf Uploaded by : sumohurd <matt(a)finray.net> Description : Simplistic uBLA Performance chart, second version You can access this file at the URL http://groups.yahoo.com/group/Boost-Users/files/uBLA%20Performance%202.pdf To learn more about file sharing for your group, please visit http://help.yahoo.com/help/us/groups/files Regards, sumohurd <matt(a)finray.net>

1 0

[crc] Simple example please
by Vladimir Prus 10 Jun '03

10 Jun '03

Hi Alex, > I'd like to calculate a value for a cyclic redundancy check (crc) for a > number of files. > > This isn't going to be transmitted anywhere, I simply want to compare the > values to see whether the files are exactly the same. I know I can simply > check byte for byte, but I've got a few thousand files and it's easier to > calculate the crc for each and see whether any are the same first. Here's the function that I use for the same purpose. Might not be optimal, but works: unsigned file_crc(const string& name) { #if defined(__GNUC__) && __GNUC__ < 3 ifstream ifs(name.c_str(), ios::binary); #else ifstream ifs(name.c_str(), ios_base::binary); #endif if (!ifs) return 0; else { using namespace boost; crc_32_type crc32; int c; while( (c = ifs.rdbuf()->sbumpc()) != -1) crc32.process_byte(char(c)); return crc32.checksum(); } } I believe some example of this kind should be included... Daryle, what do you think? HTH, Volodya

3 2

Lapack for uBlas
by Achim Domma 10 Jun '03

10 Jun '03

Hi, does somebody know a Lapack implementation which can be used with uBlas? I need a solver for an linear equation system and would prefer to not rewrite it by hand. Achim

2 3

vector ranges
by cerenoc 10 Jun '03

10 Jun '03

Hello, I just wanted to clarify if the following behavior is correct. As far as I understood, in matrix and vector range function, the 1st argument defines the starting point and the second defines the length of the range. The following code I ran on gcc 2.96 shows that the behavior is different when starting at 0 and starting somewhere else. Is this a bug, or am I misunderstanding something? Thank you, Julian // define some vector r(3) std::cout << r << "\n\n"; boost::numeric::ublas::vector<double> rr = r(range(0, 0)); std::cout << rr << "\n\n"; rr = r(range(0, 1)); std::cout << rr << "\n\n"; rr = r(range(0, 2)); std::cout << rr << "\n\n"; rr = r(range(0, 3)); std::cout << rr << "\n\n"; //rr = r(range(1, 0)); // THIS RESULTS IN ASSERTION ERROR //std::cout << rr << "\n\n"; rr = r(range(1, 1)); std::cout << rr << "\n\n"; rr = r(range(1, 2)); std::cout << rr << "\n\n"; rr = r(range(1, 3)); std::cout << rr << "\n\n"; OUTPUT: [3](0,1,2) [0]() [1](0) [2](0,1) [3](0,1,2) [0]() [1](1) [2](1,2)

3 2

confused by matrix assignment
by cerenoc 10 Jun '03

10 Jun '03

Hi, I'm sorry I am new to this and also not up on the math notation you guys are using. I am confused by the definitions of slices and strides. I am trying to perform a reasonably simple operation of e.g. assigning a vector v(2) to a (sub)matrix m(3,3). In matlab notation, for instance: m = 0 1 2 3 4 5 6 7 8 v = 15 16 m(2, 1:2) = v Resulting in m = 0 1 2 15 16 5 6 7 8 What is the best way to do this with uBLAS? Thank you very much Julian

2 2

RE: [Boost-Users] Re: Tree Object Needed!
by Jim.Hyslop 09 Jun '03

09 Jun '03

Hossein Haeri wrote: > Does the method you mentioned work for my problem in > which there is no ordering? If yes, please explain it > in more detail (with an example). Trees are generally used with ordered sequences, aren't they? If your data are not ordered, then how do you propose to insert them into the tree? What, well, order would they appear in the tree? If you provide a little more information about the problem domain, we can help you figure out the best container to use. -- Jim

4 8

RE: [Boost-Users] Re: Tree Object Needed!
by Mark Storer 09 Jun '03

09 Jun '03

I don't mean to come off like a hard case, and I may well be wrong but... This whole line of questioning has that "homework assignment" smell to it. The initial question was _highly_ school-related: > I need to have some template doing the jobs of an > ordinary BST (Binary Search Tree). Nothing that fancy, > but something at the level we all have been educated > in CS1/FCS1, or similar courses. Does boosts > repository contain such an object? The utter lack of background detail leads me to believe that this is just a toy problem... a homework assignment. And then there's the yahoo email address... most proffesional programmers have @mybusiness addresses, though that doesn't mean everyone here is a proffesional. Oh, and the final bit of oddness: > Why don't I write it myself? Simply, because I want to > optimise the time! How is waiting a week or so for some mailing list to hand you an answer "optimizing the time"? This has just been bothering me, I felt the need to speak out. If I'm wrong, then I offer my heartfelt appoligies. This may be what Mr. Hyslop was trying to dig at, I'm just not a patient or subtle person. And I don't mind appologizing for my mistakes (lots of practice, as you might imaging with this sort of behavior). --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typdef std::disclaimer<Cardiff> Discard;

2 1

Threads Library
by Brian Plummer 09 Jun '03

09 Jun '03

Atomic operations (atomic_add, atomic_subtract etc) are not handled in the Boost Threads library. My guess is that this is because this cannot be accomplished, based on what I know about this topic (which isn't too much), in a portable way. Is this the reason? If not, having these operations in the Threads library would be a big benefit. Thanks, Brian

2 1

counted_base vs. sp_counted_base - boost 1.30.0 functionality deprecated
by Anders Hybertz 09 Jun '03

09 Jun '03

Hi Up to and including version 1.29.0 of the boost library I had an object which inherited from boost::counted_base, and could actually within that object control when it should be deleted. The object spawned a thread which was listening on a queue, when there was pushed an shutdown message on the queue, I could safely delete the object. In boost 1.30.0 the counted_base changed name and namespace to boost::detail::sp_counted_base, but the way it works also changed - so now my object's destructor is called whenever it's going out of scope - which I don't want. Any ideas - or should I provide a small sandbox example Thanks in advance Anders Hybertz

3 4

[crc] Simple example please
by Alex Henderson 09 Jun '03

09 Jun '03

Hi, I'd like to calculate a value for a cyclic redundancy check (crc) for a number of files. This isn't going to be transmitted anywhere, I simply want to compare the values to see whether the files are exactly the same. I know I can simply check byte for byte, but I've got a few thousand files and it's easier to calculate the crc for each and see whether any are the same first. I've looked at the crc library, but can't get my head round the example. It seems to test the library rather than show how its used. I'm after something like std::vector<char> MyStream1; // the whole file (about 500kb) boost::SomeCRCTypeThatIsOptimisedForSafetyAndLargeishBlocks<???> x; long = x.checkme(MyStream1); Could someone please point me to some code where a simple example is detailed? Thanks, Alex

1 0

confused by ublas submatrix assignment
by cerenoc 08 Jun '03

08 Jun '03

Hi, I am new to this and am confused by the (sub)matrix operations and also not up on the math nomenclature this group is using such as slices and strides. I am trying a reasonably simple operation of assigning a vector v(2) to a submatrix (3,3). For example, in matlab notation: m = 0 1 2 3 4 5 6 7 8 v = 15 16 m(2, 1:2) = v resulting in: m = 0 1 2 15 16 5 6 7 8 What is the best way to do this with ublas? I suppose I need to convert the vector into another type first, but which one - a slice, a range? I tried both with no success. Thanks a lot, Julian

2 1

uBLA performance
by Matt Hurd 07 Jun '03

07 Jun '03

Hi, Ran off a simple test of the uBLA performance for sqare matrix multiplication. Looks quite good. Put in Intels Math Kernel Library for good measure using uBLA as the data holder but with a call to dgemm. Do you think these are the kind of numbers I should be expecting? Numbers below. Added a chart to the files section http://groups.yahoo.com/group/Boost-Users/files/ called uBLA Performance.pdf Used head of CVS from today. Regards, Matthew Hurd ___________________________________________ Figures in the raw: Matrix Size intel7.1 vc7.0 mingw intel_mkl6.0_vc7.0 ___________________________________________ 1 2 2 2 1 2 13 12 13 11 3 32 30 34 31 4 51 46 59 70 5 67 59 85 109 7 70 78 92 180 9 85 94 113 262 12 99 115 139 304 16 110 131 159 362 20 118 127 178 355 26 125 135 196 334 33 132 148 209 390 42 134 158 217 389 53 130 163 228 451 67 133 171 233 459 84 138 177 241 467 105 133 176 239 473 132 133 178 241 468 166 106 174 233 448 208 90 148 196 445 261 40 63 63 427 327 24 43 45 434 409 24 44 45 421 512 11 12 12 404 640 12 12 12 459 800 36 38 38 455 1000 36 37 38 448 ___________________________________________

1 0

Newbie query: no "deamon" thread?
by dick.bridges＠tais.com 06 Jun '03

06 Jun '03

I need to spawn worker threads that simply perform a task and exit. All the examples I can find seem to use join() to cleanup the thread resources from another thread. Isn't there some way to declare worker threads so that they "do the right thing" as they exit the thread function? TIA

3 4

[BGL] bad edge iterator range returned by boost::out_edges(v,g)?
by Chris Russell 06 Jun '03

06 Jun '03

This is weird... I'm still using BGL from Boost 1_29_0 (which may be an issue?). Anyway, I've got a graph as so: typedef boost::property<vertex_forest_property_t, CProteinCircuitForestVertexProperty, boost::property<boost::vertex_index_t, long, boost::property<boost::vertex_color_t, boost::default_color_type> > > forest_vertex_property_maps_declaration_t; typedef boost::adjacency_list<boost::listS /*edges*/, boost::listS /*vertices*/, boost::bidirectionalS, forest_vertex_property_maps_declaration_t> forest_graph_t; I've done a lot with this class, including all kinds of edge traversal. Now suddenly I have a case where boost::out_edges seems to be returning an invalid iterator range. I'm absolutely certain the vertex descriptor is correct, boost::out_degree returns the expected number of out edges, however I fault inside my access loop because the iterator has gone out of range.... typedef boost::graph_traits<forest_graph_t>::vertex_descriptor forest_vertex_descriptor_t; typedef boost::graph_traits<forest_graph_t>::vertex_descriptor forest_vertex_descriptor_t; typedef boost::graph_traits<forest_graph_t>::edges_size_type forest_edges_size_t; typedef boost::graph_traits<forest_graph_t>::out_edge_iterator forest_edge_out_iterator_t; forest_edge_out_iterator_t edgeoutiterBegin, edgeoutiterEnd, edgeoutiterCurrent; boost::tie(edgeoutiterBegin, edgeoutiterEnd) = boost::out_edges(v/*forest_vertex_descriptor_t*/,g/*forest_graph_t); for (edgeoutiterCurrent = edgeoutiterBegin; edgeoutiterCurrent != edgeoutiterEnd ; ++edgeoutiterCurrent) { // works fine through the expected out edges - faults because the loop fails to terminate forest_vertex_descriptor_t vertexTarget = boost::target(*edgeoutiterCurrent, g); } // end for Any suggestions would be greatly appreciated. I'm really scratching my head because I've done this exact operation in several other places in the algorithm and it works just fine.... TIA - Chris

4 11

Tree Object Needed!
by Hossein Haeri 06 Jun '03

06 Jun '03

Dear all, I need to have some template doing the jobs of an ordinary BST (Binary Search Tree). Nothing that fancy, but something at the level we all have been educated in CS1/FCS1, or similar courses. Does boosts repository contain such an object? Why don't I write it myself? Simply, because I want to optimise the time! Thank you, --Hossein __________________________________ Do you Yahoo!? Yahoo! Calendar - Free online calendar with sync to Outlook(TM). http://calendar.yahoo.com

2 2

boost::filesystem help needed
by ericd 06 Jun '03

06 Jun '03

Hi all, I have compiled the boost::filesystem using bjam and that seemed to have gone well. The first question I have concerning this is if it is normal NOT to have a libfilesystem.so. I can only find the libfilesystem.a. The path where this lives is quite deep. /usr/local/boost_1_30_0/boost/libs/filesystem/build/bin/libboost_filesystem.a/gcc/release/runtime-link-dynamic and /usr/local/boost_1_30_0/boost/libs/filesystem/build/bin/libboost_filesystem.a/gcc/debug/runtime-link-dynamic My current setup is an Ultra 80 running Solaris 9. I use both gcc version 3.2.3 for compiling and linking. The version of Boost is 1.30.0. For my second question. Having this built, I have tried to use it but come up with undefined symbols The output follows: g++ -lboost_filesystem -o io main.o Undefined first referenced symbol in file boost::filesystem::path::native_directory_string() constmain.o boost::filesystem::path::native_file_string() constmain.o boost::filesystem::path::path[in-charge](char const*, boost::filesystem::path_fo rmat)main.o boost::filesystem::directory_iterator::directory_iterator[in-charge](boost::file system::path const&)main.o boost::filesystem::path::leaf() constmain.o boost::filesystem::initial_path() main.o boost::filesystem::system_complete(boost::filesystem::path const&)main.o boost::filesystem::directory_iterator::m_inc() main.o boost::filesystem::directory_iterator::directory_iterator[in-charge]()main.o boost::filesystem::is_directory(boost::filesystem::path const&)main.o boost::filesystem::directory_iterator::m_deref() constmain.o boost::filesystem::exists(boost::filesystem::path const&)main.o ld: fatal: Symbol referencing errors. No output written to io Now I am quite sure that the path to the filesystem library is correct and therefore, cannot figure out why this will not link properly. But then again, I might be mistaken. Here is a snip from my makefile. On second thought, here is the whole thing: SHELL = /bin/sh # PROJECTLOCATION = /home/ericd/Projects/FileSystemTest EXEDIR = $(PROJECTLOCATION)/bin # LIBPATH = -L/usr/local/lib # Sources, includes and the likes.. also output names SELFTESTSRC = main.cpp INCLUDE = -I/usr/local/boost_1_30_0/boost SELFTEST = io # ifeq (,$(filter _%,$(notdir $(CURDIR)))) include target.mk else VPATH = $(SRCDIR) # Compiler Linker Defines for test exe CXX = g++ LD = g++ DEBUG = -g CXXSELFTEST = $(DEBUG) $(INCLUDE) -c -O2 -W -Wall -Wno-unused -Wno-multichar -fexceptions LDSELFTESTFLAGS = -lboost_filesystem # Building options all: test test: CXXFLAGS = $(CXXSELFTEST) test: $(SELFTEST) # SELFTESTOBJ = $(SELFTESTSRC:.cpp=.o) # pull in dependency info for *existing* .o files -include $(SELFTESTOBJ:.o=.d) # Compile and generate dependency info %.o: %.cpp $(CXX) $(CXXFLAGS) -MMD $(SRCDIR)/$*.cpp -o $@ @mv -f $*.d $*.d.tmp @sed -e 's|.*:|$*.o:|' < $*.d.tmp > $*.d @sed -e 's/.*://' -e 's/\\$$//' < $*.d.tmp | fmt -1 | sed -e 's/^ *//' -e 's/$$/:/' >> $*.d @rm -f $*.d.tmp # Link all Object Files and copy them over to our bin $(SELFTEST): $(SELFTESTOBJ) $(LD) $(LDSELFTESTFLAGS) -o $(SELFTEST) $(SELFTESTOBJ) cp $(SELFTEST) $(EXEDIR)/$(SELFTEST) # endif I have added in my .cshrc at the LD_LIBRARY_PATH var the location of my filesystem library. Being relatively new to gcc my guess is that something has to be wrong with the flags I give it. I did do an nm -C libfilesystem.a and all missing symbols reported by the link are there. Does anyone have any clue as to why this aint working? Thanks in advance for your input, Eric

3 3

Re: Can't find a clear example of disallowing parallel edges
by Arthur 06 Jun '03

06 Jun '03

The section pointed out says to use a set instead of list if you don't want parallel edges. I guess I was hoping to have parallel edge removal using a list (insertion/deletion consideration appear to make the list a better choice for me). A --- In Boost-Users(a)yahoogroups.com, "Arthur" <arthurc@t...> wrote: > Saw that... didn't help. Too many program fragments and not enough > complete code examples IMHO. I guess I'll just have to figure it out > the hard way. > > A > > --- In Boost-Users(a)yahoogroups.com, "Chris Russell" <cdr@e...> wrote: > > Arthur, > > > > see the following: > > > > http://www.boost.org/libs/graph/doc/using_adjacency_list.html > > ^- see specifically "Choosing the EdgeList type".. Sequence vs. > > AssociativeContainer vs. UniqueAssociativeContainer > > > > http://cvs.sourceforge.net/cgi- > bin/viewcvs.cgi/boost/boost/libs/graph/example/container_gen.cpp? > rev=1.1&content-type=text/vnd.viewcvs-markup > > ^- container_gen.cpp example > > > > HTH - Chris > > > > > > > > "Arthur" <arthurc@t...> wrote in message > > news:bbnl0i+k498@e... > > > I'm trying to use this graph class without detailed reading. I > can't > > > find a decent, clear example of doing this. I have a simple > graph: > > > > > > typedef adjacency_list<list, listS, bidirectionalS> Graph; > > > > > > What do I do to prevent parallel edges to be inserted? > > > > > > Thanks for any help offered, > > > Arthur

2 1

How do I use Boost with the Visual Studio IDE?
by Ken Fogel 06 Jun '03

06 Jun '03

I can get the threads examples to compile and link with bjam but I am unable to get it to work from within the Visual Studio IDE (versions 6 or 7.1). Does anyone have a basic project structure that could be used in the IDE for threads? I am writing console applications rather than GUI apps.

2 2

Re: [Boost-Users] Re: Newbie query: no "deamon" thread?
by dick.bridges＠tais.com 06 Jun '03

06 Jun '03

I was asking this question for someone else. Except for trivial programs, I always use one form of pool or another. Spend a lot of time reading "pattern" books. To tell the truth, I have no idea what the "real" cost of creating & killing threads is for the various OSs. I just treat it like small object memory allocation: if you don't have a custom allocator, try to avoid doing it. ;) Mark Sizer <yg-boost-users@m To: boost-users(a)yahoogroups.com .gmane.org> cc: Sent by: news Subject: [Boost-Users] Re: Newbie query: no "deamon" thread? <news(a)main.gmane. org> 06/05/2003 05:23 PM Please respond to Boost-Users BTW: Is there enough of a penalty to creating threads that a thread pool should be used rather than creating them on-demand? I'm curious because I'm using a pool pulling from a work queue. - Mark P.S. I realize "enough" is a bit vague. Mark Sizer wrote: > What is "the right thing"? > > You don't HAVE to join(). The creating thread will just keep going if > you don't. If you join, it waits. > > If you're passing ownership (e.g. delete responsibility) across thread > boundaries, you have to be careful, but that doesn't have much to do > with join(). > > After starting the thread, you can use a condtional in the creator to > wait for the thread to "get going" and accept ownership, sort of a > "started()" rather than an "ended()", like join(). Or you can flip it > around and have the started thread wait on the conditional whilst the > creator thread continues to use what will eventually be given to the thread. > > Is that at all helpful? > > - Mark > > dick.bridges(a)tais.com wrote: > > >>I need to spawn worker threads that simply perform a task and exit. All >>the examples I can find seem to use join() to cleanup the thread resources >>from another thread. Isn't there some way to declare worker threads so >>that they "do the right thing" as they exit the thread function? >> >>TIA >> >> >> >>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/ >> >> >> >> >> > > > > > > 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/ > > > > 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

[BGL] vistor works w/DFS, won't compile w/DFV - appearent concept check violation - but why?
by Chris Russell 06 Jun '03

06 Jun '03

I initially posted this to the devel list. Apologies for reposting it to the user list but this is really a library _user_ question - not a devel question. I've now screwed around with this for the better part of a day and haven't figured it out. I'm off re-reading BGL book 2.5 concept checking explanation but I'll still baffled. I will post the compiler errors if anyone is willing to give me hand understanding why I can't get what I believe should be quite a simple case working. Here's the problem statement: --- I've got a struct derived from boost::default_dfs_visitor that I've been using w/out any problems in an invocation of boost::depth_first_search. The call that works looks like: boost::depth_first_search(g, boost::visitor(MyDfsVisitor)); ^- NP. compiles and executes fine. Now I'm trying to use the exact same visitor in the context of a boost::depth_first_visit call (so I can set the starting vertex). But I'm having big troubles. I tried this: boost::depth_first_visit(g, s, boost::vistor(MyDfsVisitor), boost::get(boost::vertex_color, g)) // note I'm using an internal, default color map ^- this won't compile. It seems to be balking duing Jeremy's visitor concept checking? The compiler errors are extensive and it looks like none of the visitor methods are being correctly identified. (e.g. missing vis.InitializeVertex ... etc. etc..) p.172 of the BGL book on DFS notes: IN: visitor(DFSVisitor vis) whereas p.175 on DFV notes: IN: DFSVisitor visitor. So I guessed and tried this syntax: boost:depth_first_visit(g, s, MyDfsVisitor, boost::get(boost::vertex_color, g)) ^- this compiles. But I'm getting an exception fault during visitor invocation somewhere deep inside the the RTL. Can anyone enlighten me about what's going on here? What exactly does boost::vistor(X) do? And why is it needed on the DFS call, and apparently rejected in the DFV call? Any help would be sincerely appreciated. - Regards Chris

1 0

uBLAS file io
by cerenoc 06 Jun '03

06 Jun '03

Hi, I'm new to BOOST/uBLAS. I would like to use uBLAS on a matrix that I read in from a file. How does file io work with uBLAS? What are the specific formats? If someone could provide a small example it would be much appreciated. Thank you, Julian

4 3

Warning - Format library adds 48 KB
by Tom 05 Jun '03

05 Jun '03

Boost::Format adds 36KB (VC7.1) or 48 KB (VC6) to my release executable! Details: Take one C++ Win32 application which uses both MFC and the VC STL, but not std::string. Optimizations are set for minimum size. In VC7.1 the release exe is 552 KB. Add std::string, adds 4 KB. Add boost::format, adds another 36 KB. (For each I just added one statement.) For VC6 SP5 the release exe is also 552 KB. Add just the '#include's for string & format libraries, adds 20 KB (VC7.1 didn't do this). Add std::string and boost::format, adds another 32 KB. Total added by format is (20 + 32 - 4) = 48. This is not acceptable for my application. Is there a better way to use C-style printf statements with std::string? Tom. (Thanks to Gmane for making this list usenet accessible!)

1 0

Can't find a clear example of disallowing parallel edges
by Arthur 05 Jun '03

05 Jun '03

I'm trying to use this graph class without detailed reading. I can't find a decent, clear example of doing this. I have a simple graph: typedef adjacency_list<list, listS, bidirectionalS> Graph; What do I do to prevent parallel edges to be inserted? Thanks for any help offered, Arthur

2 1

AW: [Boost-Users] Tree Object Needed!
by Jasper, Alexander 05 Jun '03

05 Jun '03

Isn't std::map what you want? > -----Ursprüngliche Nachricht----- > Von: Hossein Haeri [mailto:powerprogman@yahoo.com] > Gesendet: Dienstag, 3. Juni 2003 21:23 > An: Boost-Users(a)yahoogroups.com > Betreff: [Boost-Users] Tree Object Needed! > > > Dear all, > > I need to have some template doing the jobs of an > ordinary BST (Binary Search Tree). Nothing that fancy, > but something at the level we all have been educated > in CS1/FCS1, or similar courses. Does boosts > repository > contain such an object? > > Why don't I write it myself? Simply, because I want to > optimise the time! > > Thank you, > --Hossein > > __________________________________ > Do you Yahoo!? > Yahoo! Calendar - Free online calendar with sync to Outlook(TM). > http://calendar.yahoo.com > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Get A Free Psychic Reading! Your Online Answer To Life's > Important Questions. > http://us.click.yahoo.com/Lj3uPC/Me7FAA/ySSFAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > >

5 4

Deprecated shared_ptr functionality in boost 1.30
by Anders Hybertz 05 Jun '03

05 Jun '03

Hi all I have simplified my previous question about this issue to the following sandbox code. ----------------------------------------------------------------- #include <iostream> #include <boost/shared_ptr.hpp> struct Test : public boost::counted_base { Test() : boost::counted_base( 1, 1 ) { std::cout << "Construction" << std::endl; } ~Test() { std::cout << "Destruction" << std::endl; } }; int main() { { boost::shared_ptr<Test> spTest( new Test ); } // In boost 1.29 the program output is : // Construction return 0; }----------------------------------------------------------------- Under boost 1.29.0 the program only writes out the text from the construction of the Test object - the destructor is never being called. I want the same functionality under boost 1.30.0 - but without changing any code in then main function - basically preserving the interface. I tried to used the boost::detail::sp_counted_base under 1.30.0 but that did not work. Any ideas ? Thanks in advance Anders Hybertz

1 0

norm_inf type-related error
by cerenoc 05 Jun '03

05 Jun '03

Can somebody help me with this? The following simple piece of code compiles fine if m, v, and s are declared as type <double> but not for type <int> as shown. Why is that? Can I cast vectors and matrices from int to double easily? ...define some matrix <int>m... boost::numeric::ublas::vector<int> v = row(m, 1); int s = norm_inf(v); The complaint is as follows: /tmp/ccA7KBD2.o: In function `boost::numeric::ublas::type_traits<int>::norm_inf(int const &)': /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x12): undefined reference to `boost::numeric::ublas::type_traits<int>::imag(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x21): undefined reference to `boost::numeric::ublas::type_traits<int>::abs(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x31): undefined reference to `boost::numeric::ublas::type_traits<int>::real(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x40): undefined reference to `boost::numeric::ublas::type_traits<int>::abs(int const &)' collect2: ld returned 1 exit status Thanks, Julian

2 1

Newbie needs thread lib sample code
by dick.bridges＠tais.com 04 Jun '03

04 Jun '03

I'm pretty sure I've seen sample code at www.boost.org that's pretty close to being a tutorial for using the thread library but I can't for the life of me find it. Anyone got a link?

2 1

building decision trees with mpl
by Markus Werle 04 Jun '03

04 Jun '03

Hi! The following piece of code works (finally, sigh), but I would like to hear some comments on whether and how one can do better. #include "boost/mpl/apply_if.hpp" #include "boost/mpl/identity.hpp" #include "boost/mpl/lower_bound.hpp" #include "boost/mpl/deref.hpp" #include "boost/mpl/find.hpp" #include "boost/mpl/vector.hpp" #include "boost/mpl/pair.hpp" #include "boost/mpl/bool.hpp" #include "boost/mpl/select1st.hpp" #include "boost/mpl/select2nd.hpp" #include "boost/mpl/lambda.hpp" #include "boost/type_traits/is_same.hpp" #include <typeinfo> #include <iostream> namespace mpl = boost::mpl; template <int m, int n> class ComplicatedDecision { private: template <int i> struct C { // typedef probably_very_expensive_template type; }; // order matters typedef mpl::vector < mpl::pair<mpl::bool_< (m == n) >, C<0> >, mpl::pair<mpl::bool_< (m == -n) >, C<1> >, mpl::pair<mpl::bool_< (m == 1) >, C<2> >, mpl::pair<mpl::bool_< (m < 0) >, C<3> >, mpl::pair<mpl::bool_< true >, C<4> > > decision_sequence; typedef typename mpl::find_if< decision_sequence, boost::is_same<mpl::select1st<mpl::_1>, mpl::bool_<true> > > iter_; typedef typename iter_::type::type pair_; public: typedef typename mpl::select2nd<pair_>::type type; }; int main() { std::cerr << typeid(ComplicatedDecision<1,1>::type).name() << std::endl; std::cerr << typeid(ComplicatedDecision<-1,1>::type).name() << std::endl; std::cerr << typeid(ComplicatedDecision<1,2>::type).name() << std::endl; std::cerr << typeid(ComplicatedDecision<-1,2>::type).name() << std::endl; std::cerr << typeid(ComplicatedDecision<2,3>::type).name() << std::endl; } best regards, Markus -- Compile time analytic differentiation? Yes, at http://daixtrose.sourceforge.net/

2 2

stlport-4.5.3+boost-1.30.0+msvc6(sp5)+platform sdk(5.2.3663.0)
by gong_wentao 04 Jun '03

04 Jun '03

I tried to build boost thread library on my computer,the following are my computer's configuration: stlport-4.5.3+boost-1.30.0+msvc6(sp5)+platform sdk(5.2.3663.0) I added boost installation directory into system's path variables, and i enter into the directory "boost_1_30_0\libs\thread\build\",Each time i typed command "bjam -sTOOLS=msvc-stlport -sSTLPORT_VERSION=4. 5.3 -sSTLPORT_PATH=D: -sSTLPORT_IOSTREAM=on >>d:\log1.txt", i got the following result: CALL "C:\Program Files\Microsoft Visual Studio\VC98 \bin\VCVARS32.BAT" >nul "C:\Program Files\Microsoft Visual Studio\VC98\bin\cl" /Zm800 - nologo -GX -c -DBOOST_THREAD_BUILD_DLL=1 -D_STLP_NO_SGI_IOSTREAMS=1 - D_STLP_DO_IMPORT_CSTD_FUNCTIONS=1 -D_STLP_DEBUG=1 - D_STLP_DEBUG_UNINITIALIZED=1 /Z7 /Od /Ob0 /GX /GR /MDd - I"..\..\..\libs\thread\build" -I"D:\STLport-4.5.3\stlport" - I"D:\boost_1_30_0" - Fo"..\..\..\libs\thread\build\bin\boost_thread.dll\msvc- stlport\debug\runtime-link-dynamic\stlport-cstd-namespace-std\stlport- iostream-off\stlport-version-4.5.3\threading-multi\condition.obj" - Tp"../src\condition.cpp" ...failed vc-C++ ..\..\..\libs\thread\build\bin\boost_thread.dll\msvc- stlport\debug\runtime-link-dynamic\stlport-cstd-namespace-std\stlport- iostream-off\stlport-version-4.5.3\threading-multi\condition.obj... It seems some configuration problem exists. Can anybody tell me why? Thanks in advance!

1 0

Multi-array usage problem - Bug or me?
by David Johnson 03 Jun '03

03 Jun '03

I have the following code that I don't feel is doing the right thing. Did I make some mistake or is the Multi-array code buggy? int nrows = 2; int aSize = 6; typedef array_type::extent_range range; array_type B(boost::extents[range(1,nrows)][range(1,aSize)],boost::fortran_storage_orde r()); B[1][1] = 1.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[2][1] = 2.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[3][1] = 3.0; B[4][1] = 4.0; B[5][1] = 5.0; B[6][1] = 6.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[1][2] = 7.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[2][2] = 8.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[3][2] = 9.0; B[4][2] = 10.0; B[5][2] = 11.0; B[6][2] = 12.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); Which when I ran it produced: first B11 1.000000 0.000000 0.000000 0.000000 0.000000 0.000000 first B21 0.000000 0.000000 0.000000 0.000000 -0.000000 -2656983832617227100000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 000000000000000000000000000000000000000000.000000 first B11 1.000000 2.000000 0.000000 0.000000 0.000000 0.000000 first B21 2.000000 0.000000 0.000000 0.000000 -0.000000 -2656983832617227100000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 000000000000000000000000000000000000000000.000000 first B11 1.000000 2.000000 3.000000 4.000000 5.000000 5.000000 first B21 2.000000 3.000000 4.000000 5.000000 6.000000 -26569838326172271000000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 00000000000000000000000000000000000000000.000000 first B11 1.000000 7.000000 3.000000 4.000000 5.000000 5.000000 first B21 7.000000 3.000000 4.000000 5.000000 6.000000 -26569838326172271000000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 00000000000000000000000000000000000000000.000000 first B11 1.000000 7.000000 8.000000 4.000000 5.000000 5.000000 first B21 7.000000 8.000000 4.000000 5.000000 6.000000 -26569838326172271000000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 00000000000000000000000000000000000000000.000000 first B11 1.000000 7.000000 8.000000 9.000000 10.000000 10.000000 first B21 7.000000 8.000000 9.000000 10.000000 11.000000 12.000000 THis first thing to note is that i get 2 in two places in the output after only inputing it once. Why is B[1][2] identical with B[2][1] ? I have also tried referencing it as [1-6][1-2] and it still has garbage in the array( same results after adding [1][2], as I can see the same value in [2][1]). I also had the assignment statements as [1-2][1-6] with no change in the output for [1][2] and [2][1]. Any help greatly appreciated on this since it is really confusing me. I found that using the documention wasn'te much help since it seems to contain errors. I had to look in the examples to see that fortran_storage_order was a function that needed the parenthesis, since the doc left them out in the text. But the examples had them. Dave

2 1

Enabling boost::date_time::posix_time::nanosec().
by adutoit 03 Jun '03

03 Jun '03

Hi. Is there a quick way to determine whether one's operating system supports the nanosecond precision clock? Also; I realise that BOOST_DATE_TIME_HAS_NANOSECONDS needs to be defined to use nanosec() method. But; should I be able (if my operating system supports it) to define support for nanosecond time resolution at installation time? I.e. would it suffice to use a bjam commandline parameter defining nanosecond support when building the Boost date_time libraries? Also; how do I configure nanosecond support for subsequent compilation of programs which use Boost and require nanosecond posix_time resolution? Greetings, Andre. [Non-text portions of this message have been removed]

2 1

Agree totally.
by Dan Dimerman 03 Jun '03

03 Jun '03

Can anyone who successfuly wrote some code with BGL post it somewhere ?

2 1

RE: [Boost-Users] int64_t problem
by Jim.Hyslop 02 Jun '03

02 Jun '03

Sigis wrote: > I am using OpenInventor and boost 1.29 librariess. Both of > them have defined > int64_t: > > typedef __int64 int64_t; [...] > The only solution I found is to add #undef just before define at > boost/cstdint.hpp: > #undef int64_t > typedef __int64 int64_t; > > But it looks as dirty solution. Maybe it is possilbe to solve > this problme in > more elegant way? First step is to send a complaint (or enhancement request, if you prefer :=) to OpenInventor - any new types they introduce should be wrapped in their own namespace. Also, if #undef really *does* work, then that means either your compiler is buggy (#undef should only work on macros, not typedefs), or OpenInventor are using a #define, not a typedef - double penalty points for that! (well, I suppose if it's a C library, that _might_ be acceptable. Barely.) If it is a #define, you could try wrapping the OpenInventor headers in another header: // Wrapper file for using OpenInventor with Boost [include guard #ifdefs] #include "OpenInventorHeader.h" #undef int64_t #endif // #include guard In any source file that uses both Boost and OpenInventor, include the wrapper header instead of the OpenInventor header. You'll want to check for any include order problems, i.e. you may have to ensure all Boost headers are included after all OpenInventor headers. Subtle issue, though - could this violate the ODR (One Definition Rule)? I think we'd have to see exactly how OpenInventor defines/typedefs int64_t to be sure. Other possible solutions: - Decouple Boost and OpenInventor, by wrapping the OpenInventor objects you are using in proxy objects. The proxies will use an opaque handle to the OpenInventor objects. Use these proxy objects wherever you currently use OpenInventor. This, by the way, has the advantage of decoupling your application from OpenInventor, allowing you the option to move to a different library if you ever decide that should be necessary. - If OpenInventor's int64_t is a typedef, put it inside an OpenInventor namespace (this probably won't work if you do not have the source code to OI in order to rebuild the binaries). If it's not a typedef, then make it a typedef in an OpenInventor namespace (same caveats). - If OpenInventor really does use a typedef, and if the typedef is inside an OI namespace, then hunt down and destroy any using directives (i.e. "using namespace OI;" or "using OI::whatever;") in any headers, and move any using directives inside your source files *after* all #include directives. If you find a "using namespace" directive in any of the OpenInclude directives, then that's triple penalty points against them, and definite cause for a complaint (not an enhancement request :=). - [radical solution, probably unrealistic] change library vendors, and be sure to tell OI why you are dropping them (because they don't play well with everyone else). - <sigh> change library vendors, and be sure to tell Boost why you are dropping them :=( Boost plays nicely - int64_t is a typedef, and it is declared inside namespace boost. -- Jim

2 1

No more than 10 types in boost::tuple?
by Tarjei Knapstad 02 Jun '03

02 Jun '03

I tried constructing a tuple with 12 types today without much luck. I've read through the headers to see if there was any obvious way of getting around the 10 limit but couldn't find one (I half expected to find something along the way of vectorxx<>, in MPL). Am I being stupid, or is there really no way of constructing a tuple with more than 10 elements? Also, are there any plans of integrating and/or making boost::tuple dependant on the MPL? I realize that tuple predates the MPL, but there's no use in duplicating efforts. boost::tuple has it's own compile time IF<> and also provides it's own typelist class which are both readily available in the MPL. Cheers, -- Tarjei

2 3

How to compile jam.exe with Visual Studio .NET (Win2000) where to download it?
by rasasenkuviene 01 Jun '03

01 Jun '03

I was trying to build boost-jam and boost-build executable with build.bat in Visual Studio .NET (Windows 2000) from downloaded sources. However, ended with single non-functional jam0.exe and truncated to zero length my own compiler cl.exe from Visual Studio .NET. Nmake coul'nt be used, because makefiles were not included. What is going on? How to compile or obtain needed boost-jam or boost-build executables under Windows2000? Or this BOOST is intended for UNIX only?

3 2

Newbee Questions on Directory Structure of Boost Libs.
by Adalbert Perbandt 01 Jun '03

01 Jun '03

Hi there, I'm new to Boost and have some problems understanding the way Boost libs. are built and installed. I downloaded boost_1_30_0. unpacked the archive and built the test library (I had installed bjam previously). I did the build step on two different platforms and with different compilers: - On Linux (RedHat 7.3) with gcc/3.2.2 and - on Sun SPARC Solaris 2.7 with Sun's Forte 6.2 compiler. I created an installation directory /opt/boost_1.30.0. Into this directory I copied the directory tree below boost/test and libs/test: /opt/boost_1.30.0/boost/test/... /opt/boost_1.30.0/libs/test/... I think so far everything is correct, isn't it? I do not completely understand the directory structure generated during the build process: ../boost_1_30_0/libs/test/build/bin/libboost_prg_exec_monitor.a /libboost_prg_exec_monitor.so /libboost_test_exec_monitor.a /libboost_test_exec_monitor.so /libboost_unit_test_framework.a /libboost_unit_test_framework.so Below the directories given above a specific subdirectory tree was created. Example: .../libboost_prg_exec_monitor.a/ /sunpro/ /debug/ /runtime-link-dynamic/ /runtime-link-static/ /threading-multi/libboost_prg_exec_monitor.a /threading-single/libboost_prg_exec_monitor.a >From this I conclude: 1. The builds are separated from each other in compiler specific subdirectory trees, e.g. the "sunpro" subtree contains the build results from $ bjam "-sTOOLS=sunpro" i.e. the sun forte 6.2 compiler and the "gcc" subtree contains the build results from $ bjam "-sTOOLS=gcc" i.e. the gcc 3.2.2 compiler on Linux. Obviously there is no separation by OS platform (Solaris or Linux). What would I have to do to build the lib. with gcc on Solaris? Where would the products be installed? Furthermore there is no separation by compiler version (e.g. gcc 2.95.2 is not separated from gcc 3.2.2). Is this considered unnecessary? 2. The libs were built with debug symbols (-g option) only), correct? I'm not familiar with jam and therefore don't know what to do to get them built with optimization active. It seems to me as if this should be rather simple because in ../boost_1_30_0/tools/build/sunpro-tools.jam obviously two variants of the CFLAGS variable for optimization are defined: flags sunpro CFLAGS <optimization>speed : -fast -O4 ; flags sunpro CFLAGS <optimization>space : -O2 -xspace ; Any hints are welcome. Thanks, Adalbert Perbandt.

3 3

RE: [Boost-Users] Regex: matching either of 2 fields, in any order
by john.wismar＠alldata.com 31 May '03

31 May '03

That's it exactly. And your explanation was a lot more succinct than mine, too! Thanks. ------------------------------ John Wismar BSA - AllData Offline Products john.wismar(a)alldata.com > -----Original Message----- > From: Jim.Hyslop [mailto:jim.hyslop@leitch.com] > Sent: Friday, May 30, 2003 6:10 AM > To: 'Boost-Users(a)yahoogroups.com' > Subject: RE: [Boost-Users] Regex: matching either of 2 > fields, in any orde r > > > John Maddock wrote: > [unknown] wrote (please try to attribute quotes) > > > I can see how I could do this in a loop to replace the different > > > subfields. Is there another step I would need to take to > > > guarantee that > > > there is at most one of each type of subfield? > > > > Well if you search for "C(\\d+)|O(\\w+)" it can only match > > one or the other > > can't it? Or am I missing something? > I could be wrong, but I interpreted the OP's question to mean: is it > possible to have the regex generate an error if more than one > sub-field of a > specific type is found, i.e. the following would be invalid: > > ~C123~C345 > > The original poster can correct me if I've misinterpreted anything. > > -- > Jim > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Get A Free Psychic Reading! Your Online Answer To Life's > Important Questions. > http://us.click.yahoo.com/Lj3uPC/Me7FAA/ySSFAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > >

2 1

Using Bind with Signals (version 2)
by Darren Vincent Hart 30 May '03

30 May '03

Similar to my last post, this is a slightly different implementation where the handler has a signal of its own. Now I can't seem to bind to the handler functor, getting a compiler message like: /usr/include/boost/bind.hpp:60: error: `bool (handler::*)(char)' is not a class, struct, or union type The goal is that when the keypress signal is emitted, it will execute the handler which will receive the char (key), test it, and emit its signal (sig) if appropriate. Any help would again be much appreciated, the short code follow, with the problematic bind statement commented: Thanks in advance, Darren Hart compile: g++ test.cpp -o test -lboost_signals // test.cpp ---------------------------------------------------- #include <iostream> #include <boost/signal.hpp> #include <boost/function.hpp> #include <boost/bind.hpp> #include <boost/bind/apply.hpp> using namespace std; struct widget { boost::signal<bool ()> sig; boost::signal<bool (char)> keypress; bool test() { cout << "widget::test() - sig empty: " << (sig.empty() ? "true" : "false") << endl; sig(); return true; } }; struct handler { char key_; boost::signal<bool ()> sig; handler(char key) : key_(key) { } bool operator()(char key) { cout << "handler::operator() - received a " << key << endl; if (!sig.empty() && key == key_) { cout << "\texecuting slot\n\t"; sig(); } cout << endl; return true; } }; struct no_op { bool operator()() { cout << "no_op::operator() - doing nothing" << endl; return true; } bool test() { cout << "no_op::test()" << endl; return true; } }; int main() { // instantiate two widgets widget widget_a; widget widget_b; // instanstiate the functions object (and test them) no_op no_op_; handler handler_a('A'); handler_a.sig.connect(no_op_); no_op_(); handler_a('A'); // connect the function objects to the widgets widget_a.sig.connect(no_op_); // THE PROBLEM IS HERE - HOW DO I BIND TO handler_a.test(char) ? widget_b.keypress.connect( boost::bind(&handler::operator(), &handler_a) ); // END PROBLEM cout << "signalling widget_b.keypress('B')" << endl; widget_b.keypress('B'); // call the handler 3 times, but never execute its slot cout << "\nsignalling widget_b.keypress('A')" << endl; widget_b.keypress('A'); // call the handler 3 times, executing the slot return 0; }

2 1

Re: Using Bind on Signals
by Peter Dimov 30 May '03

30 May '03

darrenvhart wrote: > --- In Boost-Users(a)yahoogroups.com, "Peter Dimov" <pdimov@m...> wrote: >> >> You can use apply<> from <boost/bind/apply.hpp> instead of 'call': >> >> bind(apply<bool>(), bind(&widget::sig, &widget_a)) (); // should call >> widget_a->sig > > Thank you for the reply. > > I have changed the line to use apply<bool>() and included the header > file, but it won't compile complaining about noncopyable members of > the signal of the widget. Any ideas what that is all about ? Please change every 'F f' to 'F & f' in boost/bind/apply.hpp; this will take care of the problem. I've already updated the CVS version. The problem is that a signal is noncopyable and cannot be passed by value.

1 0

Using Bind on Signals
by Darren Vincent Hart 30 May '03

30 May '03

I am building a widget set using the signals and slots library. I have the need to be able create a functor (FA) that receives another (FB) as an argument to its constructor. I will connect FA to the signal of a widget, when FA is run it will perform a test and execute FB if appropriate. I want to be able to use the signal member of another widget as FB, so I am trying to use bind to get that function object for the signal. I am experiencing two problems: 1) When the member functor (FB) is bound to the signal of another widget, the slots don't get called. (No error results, but the connected slot doesn't print anything so I am assuming it isn't being executed). 2) I can't get it to compile when the signal has a <bool ()> signature, I can only get it to compile with a <void ()> signature. I am trying to assign the result of bind to a boost::function<bool ()> but I get an error saying it can't make the conversion, what type should I be using if not boost::function (note that it works if the signal is void())? The following is a commented test_case demonstrating the problem. Any assistance in binding to signals and compiling those with a bool() signature would be greatly appreciated. Thanks in advance, Darren Hart compile with: g++ test.cpp -o test -lboost_signals // test.cpp ---------------------------------------------------------- #include <iostream> #include <boost/signal.hpp> #include <boost/function.hpp> #include <boost/bind.hpp> using namespace std; struct widget { boost::signal<bool ()> sig; boost::signal<bool (char)> keypress; bool test() { cout << "widget::test() - sig empty: " << (sig.empty() ? "true" : "false") << endl; sig(); return true; } }; template <typename T> struct handler { boost::function<T ()> slot_; handler(boost::function<T ()> slot) : slot_(slot) { } bool operator()(char letter) { cout << "handler::operator() - received a " << letter << endl; if (letter == 'A') { cout << "\texecuting slot\n\t"; slot_(); cout << endl; } return true; } }; struct no_op { bool operator()() { cout << "no_op::operator() - doing nothing" << endl; return true; } bool test() { cout << "no_op::test()" << endl; return true; } }; int main() { // instantiate two widgets widget widget_a; widget widget_b; /* The goal is to connect the hanlder to widget_b which will then call * widget_a's sig signal. The problem is that even though widget_a's * test says that sig() isn't empty, it doesn't execute when bound * directly in handler_b. It does however work when called as part * of the test() member function as in handler_c. We must get * handler_b to work in order to do this in libstk! We can't compile * at all if the signal returns a bool. */ // instanstiate the function objects no_op no_op_; // bind to a no_op member, successul handler<bool> handler_a( boost::bind(&no_op::test, &no_op_) ); // bind to a widget signal handler, BROKEN //handler<bool> handler_b( boost::bind<bool>(&widget::sig, &widget_a) ); // <-- Broken // bind to a widget member, successul handler<bool> handler_c( boost::bind(&widget::test, &widget_a) ); // connect the function objects to the widgets widget_a.sig.connect(no_op_); widget_b.keypress.connect(0, handler_a); //widget_b.keypress.connect(1, handler_b); // fix handler_b above, then uncomment this widget_b.keypress.connect(2, handler_c); cout << "attempting to bind to widget_a's sig signal" << endl; // store the function object returned by binding a widget signal, BROKEN //boost::function<bool ()> fp = boost::bind(&widget::sig, &widget_a); // <-- BROKEN // executre the functor returned by binding a widget signal, BROKEN // (builds, but doesn't really call widget_a.sig()) boost::bind(&widget::sig, &widget_a)(); // <-- Test if binding works at all, it doesn't // signal the keypress signals, they will test the character and execute their // slots if it equals 'A' cout << "signalling widget_b.keypress('B')" << endl; widget_b.keypress('B'); // call the handler 3 times, but never execute its slot cout << "***\nThis correctly executed the three handlers which, also correctly," << " do not execute their slots\n***" << endl; cout << "signalling widget_b.keypress('A')" << endl; widget_b.keypress('A'); // call the handler 3 times, executing the slot cout << "***\nThis executes the three handlers, but handler_b calls slot_() " << "and widget_a's signal does not execute the slot it has, which the " << "test() in handler_c successfully executes.\n***" << endl; return 0; } // --------------------------------------------------------------------

3 2

RE: [Boost-Users] Regex: matching either of 2 fields, in any order
by john.wismar＠alldata.com 30 May '03

30 May '03

The detail I'm concerned about -- and it may not be a problem because I may be overlooking something -- is that the string I'm matching against can have zero or one 'C' field and zero or one 'O' fields. It looks like the "C(\\d+)|O(\\w+)" expression will match either of them if at least one is present, but after that, I would need optionally to match the other one. Matching the same field again would be an error. In other words: ~C12345~OF <-- valid (1 of each) ~OF <-- valid (1 'O' field) ~C12345 <-- valid (1 'C' field) ~ZAQ~C12345 <-- valid (1 'C' field) ~OV~C67890 <-- valid (1 of each) ~A23~OV~DFG~C67890~ZAQ <-- valid (1 of each) ~A23~DFG <-- valid (neither) ~C12345~OF~C67890 <-- invalid (2 'C' fields) ~C12345~OF~OV <-- invalid (2 'O' fields) ~ASD~C12345~OF~OV <-- invalid (2 'O' fields) Thanks again for your help!! ------------------------------ John Wismar BSA - AllData Offline Products john.wismar(a)alldata.com > -----Original Message----- > From: John Maddock [mailto:john_maddock@compuserve.com] > Sent: Friday, May 30, 2003 3:43 AM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] Regex: matching either of 2 > fields, in any order > > > > I can see how I could do this in a loop to replace the different > > subfields. Is there another step I would need to take to > guarantee that > > there is at most one of each type of subfield? > > Well if you search for "C(\\d+)|O(\\w+)" it can only match > one or the other > can't it? Or am I missing something? > > John.

1 0

int64_t problem
by Sigis 30 May '03

30 May '03

Hi, I am using OpenInventor and boost 1.29 librariess. Both of them have defined int64_t: typedef __int64 int64_t; During compiling I get some errors: d:\work\projects\medint\dist\include\boost\cstdint.hpp(240) : error C2632: '__int64' followed by '__int64' is illegal d:\work\projects\medint\dist\include\boost\cstdint.hpp(240) : warning C4091: 'typedef ' : ignored on left of '__int64' when no variable is declared d:\work\projects\medint\dist\include\inttypes.h(75) : error C2632: '__int64' followed by '__int64' is illegal d:\work\projects\medint\dist\include\inttypes.h(75) : warning C4091: 'typedef ' : ignored on left of '__int64' when no variable is declared The only solution I found is to add #undef just before define at boost/cstdint.hpp: #undef int64_t typedef __int64 int64_t; But it looks as dirty solution. Maybe it is possilbe to solve this problme in more elegant way? P.S. adding #undef int64_t to boost/config/user.hpp only reduces the count of errors from 10 to 6. -- Sigis

1 0

RE: [Boost-Users] newbie: trouble composing with boost::bind
by Tom Matelich 30 May '03

30 May '03

http://groups.yahoo.com/group/Boost-Users/message/4086 > -----Original Message----- > From: Jacques A. Vidrine [mailto:nectar/boost@celabo.org] > Sent: Wednesday, May 28, 2003 6:19 AM > To: boost-users(a)yahoogroups.com > Subject: [Boost-Users] newbie: trouble composing with boost::bind > > > [Apologies if this is a duplicate. I posted this shortly after I > subscribed, but I didn't see it come across.] > ----------------------------------------------------------------------- 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

RE: [Boost-Users] Regex: matching either of 2 fields, in any orde r
by Jim.Hyslop 30 May '03

30 May '03

John Maddock wrote: [unknown] wrote (please try to attribute quotes) > > I can see how I could do this in a loop to replace the different > > subfields. Is there another step I would need to take to > > guarantee that > > there is at most one of each type of subfield? > > Well if you search for "C(\\d+)|O(\\w+)" it can only match > one or the other > can't it? Or am I missing something? I could be wrong, but I interpreted the OP's question to mean: is it possible to have the regex generate an error if more than one sub-field of a specific type is found, i.e. the following would be invalid: ~C123~C345 The original poster can correct me if I've misinterpreted anything. -- Jim

1 0

RE: [Boost-Users] Regex: matching either of 2 fields, in any order
by john.wismar＠alldata.com 30 May '03

30 May '03

> -----Original Message----- > From: John Maddock [mailto:john_maddock@compuserve.com] > Sent: Thursday, May 29, 2003 4:10 AM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] Regex: matching either of 2 > fields, in any order > > > Is it possible to do this in a single > > operation, given that the order of the fields is arbitrary? > > Yes do a conditional search and replace: > > search for "C(\\d+)|O(\\w+)" > > and replace with "(?1first-text)(?2second-text)" > > don't forget to set the flag format_all when calling > regex_merge to do this > (in future conditional replacements will only be enabled when actually > requested). Thanks for the reply! I can see how I could do this in a loop to replace the different subfields. Is there another step I would need to take to guarantee that there is at most one of each type of subfield? ------------------------------ John Wismar BSA - AllData Offline Products john.wismar(a)alldata.com

2 1

Problems Using boost:date_time library
by Carl Waldbieser 29 May '03

29 May '03

I recently tried some simple tests of the Boost date-time library (Boost 1.30.0 MSVC6) and ran into problems. I don't have the original code in front of me (unfortunately I left it at work), but more or less, it looked like this: #include "boost/date_time/gregorian/gregorian.hpp" #include <iostream> int main() { using namespace boost::gregorian; date today = day_clock::local_day(); month_iterator it(today); std::advance(it, 3); std::string strDate(to_simple_string(*it)); std::cout << "New date is " << strDate << std::endl; return 0; } The first problem I ran into was that I got a linker error because the class greg_month (in greg_month.hpp) did not provide definitions for the following member functions: const char* as_short_string() const; const char* as_long_string() const; I quicky wrote some inline switch statements to get past that hurdle, but then the compiler started complaining when I tried to use std::advance. It is unfortunate that I do not have the exact error in front of me right now, but I did trace the problem to the definition of month_iterator. I found that if I derived its base implementation class from the class template iterator that it would compile without problems. Is this a problem with the STL that ships with MSVC6? Anyway, I was wondering if maybe there was something I had not set up correctly with my compiler that was causing me to get these errors. Any help would be appreciated. Carl Waldbieser waldbie(at-sign-goes-here)attglobal.net

2 3