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

is_base_and_derived broken in 1.30.0?
by Jeff Muller 15 May '03

15 May '03

Originally posted this on 5/6, but it never showed up. Here goes again... Hi, The following code: const bool isWS = ::boost::is_base_and_derived<std::wstring,std::wstring>::value; sets isWS false with VS.NET 2003 (_MSC_VER=1310) in version 1.30.0 of the libraries. It is correct with version 1.27.0. Thanks, Jeff

2 1

Using the Python interpreter
by dima_mouromtsev 15 May '03

15 May '03

Hello All! I've the problem with the next code: class MyWindow { ... MyWindow() {} ~MyWindow() {} MyOperation() { Py_Initialize(); handle<> main_module(borrowed(PyImport_AddModule("__main__"))); handle<> namespace(borrowed(PyModule_GetDict(main_module.get()))); try { handle<>(PyRun_String("hello = file('c:\\hello.txt', 'w')\n" "hello.write('Hello world!')\n" "hello.close()", Py_file_input, namespace.get(), namespace.get())); } catch(error_already_set) { ... } Py_Finalize(); } }; When I start this code, that's all right. If I move Py_Finalize() to destructor, the program work, but when I close the program an exeption rise (Py_FatalError("UNREF invalid object")). Next, I exclude Boost classes: ... MyOperation() { PyObject* dict = PyModule_GetDict(PyImport_AddModule("__main__")); PyRun_String("hello = file('c:\\hello.txt', 'w')\n" "hello.write('Hello world!')\n" "hello.close()", Py_file_input, dict, dict); } So the program work well and there is no exeptions at exit. What is my problem? How can I use Boost in right way? Please Help Thanks Dima

2 2

shared_from_this from a destructor
by ostware 15 May '03

15 May '03

(This message is also posted on sourceforge. Please forgive the double posting, but I am still unfamiliar with the community...) version: boost 1.30.0 library: smart pointers I am using the boost::enable_shared_from_this base class from the smart pointer library to implement shared_from_this in my classes. I was amazed to find this class, after hours of thashing trying even to figure out the very problem it solves. So, first off, thanks to the boosters. My problem is that shared_from_this() throws boost::bad_weak_ptr if called from my class's destructor. Is this a design decision? a bug? am I misreading a class requirement? The problem (if it is one...) is that sp_counted_base::release() decrements use_count_ before calling dispose(). Then when my class calls shared_from_this from its destructor (via dispose()), sp_counted_base::add_ref fails (use_count == 0) and throws boost::bad_weak_ptr. I would suggest either setting use_count_ after dispose(), or clarifying in the docs that shared_from_this can't be called from a destructor. (... which would send me back to the drawing board to solve my problem) It would also be handy to have an exception less version of share_from_this which justs returns a null shared_ptr. Thanks for any help. ... Michael Ost Something like this (warning: uncompiled, untested!) ... class T : public enable_shared_from_this { public: T() {} ~T() { shared_ptr<T> ptr = shared_from_this(); // trouble: exception, can't get a shared_ptr } }; main() { shared_ptr<T> ptr = shared_ptr(new T()); ptr.reset(); }

2 3

? Using std::max_element() on a multi_array
by Neil Mackie 15 May '03

15 May '03

I'm looking for advice on using std::max_element() with boost::multi_array. When passing a multi_array to max_element() I was expecting to get an iterator referring to the largest element in return. However my compiler tells me the iterator refers to a sub_array<class RAClass::RAPoint,1> instead, and I don't know why or what to do about it. Its clear that inexperience with multi_array and max_element() is the cause. Is anyone able to shed some light on the subject? Details: ―--- .h file ―--- namespace RAClass { typedef boost::multi_array<RAPoint,2> CELL_TABLE; CELL_TABLE* m_cells; ―--- .cpp file ―--- CELL_TABLE::iterator e = std::max_element(m_cells->begin(),m_cells->end(), RAPoint::lower); // RAPoint::lower() compares two RAPoints int height = e->getHeight(); ―--- compiler output ―--- getHeight' : is not a member of 'sub_array<class RAClass::RAPoint,1>' TIA Neil (J Mackie). By the end of this year the Radiocommunications Agency and all responsibility for regulating the radio spectrum and communications services will become part of Ofcom - the new converged regulator for the communications sector. See the Ofcom transitional website at www.Ofcom.org.uk for more details.

1 0

BGL - misc problems encountered
by Chuck Messenger 14 May '03

14 May '03

I've been testing out the BGL, and have found some small problems. Is this a good forum to post these? If not, please set me straight. I have in mind to post more of these -- in the interest of helping iron out the library. Maybe the developer list would be more appropriate? Or a BGL-specific list, if one exists...? Problem 1: In the documentation, under "Using adjacency_list", subsection "Custom Edge Properties", it shows a method for declaring a custom property tag: > struct flow_t { > typedef edge_property_tag kind; > }; > > struct capacity_t { > typedef edge_property_tag kind; > }; It goes on to say that an alternative method is this: > enum edge_myflow_t { edge_myflow }; > enum edge_mycapacity_t { edge_mycapacity }; > > namespace boost { > BOOST_INSTALL_PROPERTY(edge, myflow); > BOOST_INSTALL_PROPERTY(edge, mycapacity); > } In the rest of the code included in the documentation, it uses the first method. Finally, it says: > The file edge_property.cpp shows the complete source code for this example. However, the code in edge_property.cpp is completely different -- using the second method rather than the first. So, at a minimum, the final sentence is wrong. I suggest the alternative methods should both be shown in the sample code. I made the necessary changes to edge_property.cpp -- here's the diff (against Boost release 1.30.0): 78a79,88 > #define ALTERNATE // comment this out to see an alternate method > > #ifdef ALTERNATE > struct flow_t { > typedef edge_property_tag kind; > }; > struct capacity_t { > typedef edge_property_tag kind; > }; > #else 86c96 < --- > #endif 95c105,109 < property_map<Graph, edge_mycapacity_t>::const_type --- > #ifdef ALTERNATE > typename property_map<Graph, capacity_t>::const_type capacity = get(capacity_t(), G); > typename property_map<Graph, flow_t>::const_type flow = get(flow_t(), G); > #else > typename property_map<Graph, edge_mycapacity_t>::const_type 97c111 < property_map<Graph, edge_myflow_t>::const_type --- > typename property_map<Graph, edge_myflow_t>::const_type 98a113 > #endif 125a141,145 > #ifdef ALTERNATE > typedef property<capacity_t, int> Cap; > typedef property<flow_t, int, Cap> Flow; > typedef adjacency_list<vecS, vecS, bidirectionalS, no_property, Flow> Graph; > #else 129a150 > #endif 163a185,188 > #ifdef ALTERNATE > property_map<Graph, flow_t>::type > flow = get(flow_t(), G); > #else 165a191 > #endif Problem 2: edge_proprety.cpp, as included in Boost release 1.30.0, generates warnings under gcc 3.2.2, since it is missing a couple of typenames. Here's the needed patch: 95c95 < property_map<Graph, edge_mycapacity_t>::const_type --- > typename property_map<Graph, edge_mycapacity_t>::const_type 97c97 < property_map<Graph, edge_myflow_t>::const_type --- > typename property_map<Graph, edge_myflow_t>::const_type - Chuck

1 0

RE: [Boost-Users] Re: find_if and calling a member function
by Tom Matelich 14 May '03

14 May '03

> From: Russell Hind [mailto:yg-boost-users@gmane.org] > > Tom Matelich wrote: > > > > 1) write your own algorithm find_if_equal, then you only > need one bind (~10 > > lines of code separate from your call) > > This is what I was looking for, and I was really wondering (although > didn't say it) if there were such a thing in boost already. > I haven't > found one, but there are quite a few bits of boost I'm not > familiar with > yet. > I don't think boost has any extra general algorithms laying around, unless they're hiding in the details directories. ----------------------------------------------------------------------- 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

Question regarding boolalpha and lexical_cast for 1.30.0
by Paul Wendt 14 May '03

14 May '03

Hello, I'm trying to get lexical_cast to convert a std::string to bool; I realize that this is done with normal IOStreams by using boolalpha. Is there a way to do this with lexical_cast? I saw some old posts in the archives and they were apparently with older code bases because I was unable to get their code snippets to work properly [either that or my compiler is messed up :)]. For reference, I use Visual Studio .NET 2002. Thank you very much for any assistance in advance. --Paul

2 1

RE: [Boost-Users] indentation vs. braces
by Ben Hutchings 14 May '03

14 May '03

Ryan Barrett <rbarrett(a)stanford.edu> wrote: <snip> > incidentally - and this is *way* off-topic - python's control flow is > defined by indentation. iirc, it works just like you'd want. > > however, i should offer the disclaimer that that's pretty much all i > know about python, other than the fact that ESR likes it: <snip> Some people would consider the ESR association a flaw, but that's going way off-topic. However, I do know about Python and would recommend pretty much all programmers to have a look at it.

1 0

RE: [Boost-Users] find_if and calling a member function
by Tom Matelich 14 May '03

14 May '03

Define easier :) Not to be picky, but how little do you expect to have to type? 1) write your own algorithm find_if_equal, then you only need one bind (~10 lines of code separate from your call) 2) write a functor, ObjectNameCompare (less than 15 lines of code separate from your call) > -----Original Message----- > From: Russell Hind [mailto:yg-boost-users@gmane.org] > Sent: Tuesday, May 13, 2003 9:31 AM > To: boost-users(a)yahoogroups.com > Subject: [Boost-Users] find_if and calling a member function > > > I have an object that has a member get_name which returns a > string. I > have a collection of these objects and would like to find one with a > particular name. I am currently using find_if, equal and bind > > find_if(objects.begin(), objects.end(), > bind(equal_to<string>(), name, bind(&object::get_name, _1))); > > Given Lambda doesn't compile under BCB6, is there an easier way to do > this rather than having to make up 2 bind statements? > > Thanks > > Russell > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Rent DVDs Online - Over 14,500 titles. > No Late Fees & Free Shipping. > Try Netflix for FREE! > http://us.click.yahoo.com/YoVfrB/XP.FAA/uetFAA/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/ > > ----------------------------------------------------------------------- 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

Test message from moderator
by Jim.Hyslop 13 May '03

13 May '03

My apologies for the noise, I'm trying to resolve some problems experienced by some users of this list. -- Jim Hyslop Moderator, Boost-users(a)yahoogroups.com

1 0

Inconsistent regexp matching when using quantifiers?
by Dean 13 May '03

13 May '03

Hi all, I'm using regexp from boost-1.28 and experience the following behavior. Consider the following (somewhat artificial) regexp pattern: a{1}b As I expected, that pattern is found in "ab" but not "aab". To my suprise however, the same pattern *is* found in "aaab", "aaaaab", and any other string consisting of an odd number of "a"s followed by a "b". It is not found in strings consisting of an even number of "a"s followed by a "b". This seems odd (no pun intended). I see the same sort of behavior with quantifiers other than "{1}" and where the quantified expression matches other single characters. (Oddly enough, the behavior changes when using a quantified expression that matches multiple characters. "(ab){1}c" is found in "abc", "ababc", "abababc", and any other string containing "abc".) FWIW, I first observed the behavior when trying to find social security numbers with the following pattern: \d{3}-\d{2}-\d{4} As expected, that pattern was found in "123-12-1234" but not in "1234- 12-1234". However it *was* found in "1234567-12-1234". Is this behavior by design or is it a bug? If it's a bug, has it been fixed in a subsequent boost release? Also what is the correct behavior? Should "a{1}b" be found in "aab" (albeit starting at the second character)? FWIW, it's easy enough for me to workaround the current behavior with a pattern like this: (^|[^a])a{1}b Thanks, --Dean

4 9

find_if and calling a member function
by Russell Hind 13 May '03

13 May '03

I have an object that has a member get_name which returns a string. I have a collection of these objects and would like to find one with a particular name. I am currently using find_if, equal and bind find_if(objects.begin(), objects.end(), bind(equal_to<string>(), name, bind(&object::get_name, _1))); Given Lambda doesn't compile under BCB6, is there an easier way to do this rather than having to make up 2 bind statements? Thanks Russell

1 0

RE: [Boost-Users] boost::thread IDs
by Ben Hutchings 13 May '03

13 May '03

Mark Sizer wrote: > I know there was a discussion about the need for these and why > they're not in the library. I can't find it, however. > > I'm having the same problem the original poster had: I'm using > the thread ID as an identifier in a data structure (std::map in > this case). You can do that with Windows thread IDs, because they are simple integers. Unfortunately the Posix thread ID type (pthread_t) is an abstract data type and the only relation defined on it is equality (pthread_equal()). Some implementations use a type that can safely and correctly be compared with std::less, but there's no guarantee of that, so Boost can't offer such a guarantee either. > Now that I'm converting to the Boost threads library, I have to > change that. I'm not sure what to do instead. > > Any help, either a pointer to the original discussion or direct > suggestions, will be much appreciated. How about using pointers to boost::thread objects as IDs (they must of course be the instances used to start the thread, rather than instances created with the default constructor). Store each thread's own pointer in TLS (or TSS as Boost.Threads calls it). (This is tricky, though - you can't pass a thread's own ID to its initial function, as threads start to run immediately. I suppose you could use placement new, but that's a bit gross.) What's the need for thread IDs, anyway? Are you using a thread pool?

4 4

boost::thread IDs
by Mark Sizer 13 May '03

13 May '03

I know there was a discussion about the need for these and why they're not in the library. I can't find it, however. I'm having the same problem the original poster had: I'm using the thread ID as an identifier in a data structure (std::map in this case). Now that I'm converting to the Boost threads library, I have to change that. I'm not sure what to do instead. Any help, either a pointer to the original discussion or direct suggestions, will be much appreciated. Thanks, - Mark P.S. Other than this glitch, my ObjectSpace Toolkit removal has been painless. Great libraries!

2 1

scope of locked variables
by Peter G 12 May '03

12 May '03

hi there... what is the scope of locked variables? assuming that i declare a mutex in say a class scope.. and then lock it in some inner scope - say in a function.. what variables get locked? is it all the variables which are in the scope of the declaration (ie all the variables which are declared in the class)? or is it only the ones which are being used in that particular function (so that perhaps another thread could use the rest at "the same time")? for example: class Class1 { public: Class1::Class1(); ~Class1::Class1(); void f(int new) { boost::mutex::scoped_lock scoped_lock(mutex_outer) ; var1 = new; } void g(int new) { boos::mutex mutex_inner; boost::mutex::scoped_lock scoped_lock(mutex_inner) ; var1 = new; } private: boost::mutex mutex_outer; Class2 some_member_object; int var1; int var2; }; what gets locked when f() is called? when should i use g()? how do I go about just locking say var1 but NOT var2? if i lock the mutex in this class scope, does that mean that all the variables in some_member_object are locked as well? also, should i set up locks anytime i am using an object which might be accesses by another thread (even if I am just reading it) or is it enough to only lock variables when i am changing them? i know that's a lot of questions, but any help would be greatly appreciated. cheers peter

3 3

[uBLAS] binary operation of vector and matrix with different type
by Zhang Le 12 May '03

12 May '03

hi, the following code generates a compile error raising from a macro in /ublas/traits.hpp: BOOST_STATIC_ASSERT ((boost::is_same<T1, T2>::value)); Because I'm trying to prod on a vector of size_t and a matrix of unsigned char. Because I want to save memory (the matrix is really huge) and I know the value in m will never exceed 255. The expression is ok to me (of course the result value is size_t). But the ASSERT prevent me from doing this. Is there a workaround that permits me doing this kind of case without sacrificing the memory efficiency? Using size_t in the matrix will use three times more memory. ublas::vector<size_t> v1(5); matrix<unsigned char> m(5,5); prod(m,v1); the same problem arises when I do prod(m,v2); here v2 is a vector<double> -- Sincerely yours, Zhang Le

2 1

Re: (Spirit) Semantic Actions with member functions?
by Slava Akhmechet 12 May '03

12 May '03

I was able to get boost::bind working to bind the semantic action to the member function of MyGrammar. This seems like a superior solution. In any case, I am not sure how to pass custom data to a functor. When specifing a semantic action I have to pass the type of the functor, which implies that spirit creates a temporary object. Am I missing something? > Its time to switch your global function "myaction" into a functor. > Functors are classes that have a function call operator with the same > synopsis as your function. > The advantage is that one can pass custom data to it via a non-default > constructor. > > Functors should be and sometimes must be stateless, so care must be > employeed to use references in member data. > > Slava Akhmechet wrote: > > > I am playing around with Spirit and I seem to run into an architecture > > problem with semantic actions. Here's a small example. > > > > class MyGrammar : public grammar<MyGrammar> > > { > > public: > > template <typename ScannerT> > > struct definition > > { > > definition(MyGrammar const& self) > > { > > TestRule = str_p("test")[&my_action]; > > } > > > > rule<ScannerT> const& > > start() const { return TestRulet; }; > > > > private: > > rule<ScannerT> TestRule; > > }; > > }; > > > > My major problem is related to the fact that I cannot pass any custom > > data to my_action function. Since my_action is a global function, it > > has no knowledge of MyGrammar and must rely on global variables. > > Ideally, I would pass self to my_action to be able to hold state. What > > is a general way to get around this problem? The documention mentions > > a way to specify member functions as semantic action actors using > > boost's bind facilities but I was unable to get it to work. > > Thanks in advance. > > > > P.S. Sorry for a fairly newbie question, I was unable to find the > > answer online or in the docs. > > P.P.S. I might have accidently double posted this. Sorry about that. > > > > > > > > *Yahoo! Groups Sponsor* > > > > <http://rd.yahoo.com/M=247865.3269369.4566997.1261774/D=egroupweb/S=17050067…> > > > > > > > > Info: <http://www.boost.org> > > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> [mailto:boost-users-unsubscribe@yahoogroups.com>] > > > > > > Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service > > <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> [mailto:boost-users-unsubscribe@yahoogroups.com>] > > > Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

3 2

RE: [Boost-Users] Re: Why isn't the "last access time" part of the filesystem library?
by Ben Hutchings 11 May '03

11 May '03

Beman Dawes wrote: > At 06:13 AM 5/8/2003, Peter Dimov wrote: <snip> > >This is a misunderstanding. Last access time (struct > >stat::st_atime) and creation time (st_ctime) aren't universal. Unix's ctime is actually change time, not creation time - it is the time when certain metadata were last changed. > >Modification time (st_mtime) is common, except on read-only > >filesystems, which typically only have ctime. > > > >Judging by your "last altered" remark, you mean mtime but call > >it "last access." > > > >I think that it would be entirely reasonable (and very useful - > >can avoid reading a file if it hasn't changed since last read) > >to provide mtime. On read-only filesystems, the creation time > >should be returned. You're mixing the concepts of filesystem API and the filesystem on disk. Normally the same filesystem API can be used for any file- system supported by the OS, and file times on an inherently read- only filesystem can appear as modification time and (if the OS supports the notion) as creation or change time. > Yes, I had a similar thought. > > What format should be used to report the mtime? I'd prefer to > keep the coupling to other Boost libraries low, so I guess that > would mean just using std::time_t. That also has the advantage > of not promising higher resolution than can actually be > delivered by most platforms. Seems reasonable to me. > What to do if the filesystem doesn't attach any time at all to > a file? Fail at compile time? Always return some date in the > past, like January 1, 1900, that is impossible as a real mdate > (since computers were not invented yet) and so can be relied > upon to indicate "no date available"? Use std::time_t(-1) to be consistent with std::time and std::mktime.

2 2

MSVC 6.0 and BOOST_HAS_PARTIAL_STD_ALLOCATOR
by Joaquín Mª López Muñoz 10 May '03

10 May '03

Shouldn't BOOST_HAS_PARTIAL_STD_ALLOCATOR be defined for MSVC 6.0? Seems it is not. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

(Spirit) Semantic Actions with member functions?
by Slava Akhmechet 09 May '03

09 May '03

I am playing around with Spirit and I seem to run into an architecture problem with semantic actions. Here's a small example. class MyGrammar : public grammar<MyGrammar> { public: template <typename ScannerT> struct definition { definition(MyGrammar const& self) { TestRule = str_p("test")[&my_action]; } rule<ScannerT> const& start() const { return TestRulet; }; private: rule<ScannerT> TestRule; }; }; My major problem is related to the fact that I cannot pass any custom data to my_action function. Since my_action is a global function, it has no knowledge of MyGrammar and must rely on global variables. Ideally, I would pass self to my_action to be able to hold state. What is a general way to get around this problem? The documention mentions a way to specify member functions as semantic action actors using boost's bind facilities but I was unable to get it to work. Thanks in advance. P.S. Sorry for a fairly newbie question, I was unable to find the answer online or in the docs. P.P.S. I might have accidently double posted this. Sorry about that.

3 2

Help using Boost Graph Library with C++Builder 6
by asterixthegaul2003 09 May '03

09 May '03

Hi, Has anyone successfully used to Boost Graph Library (BGL) with C++Builder 6? I'm getting compilation errors. Here's what I've done: I downloaded the latest Boost (1.30.0) from boost.org and installed it. I then tried to compile the quick-tour.cpp file using the mingw compiler - no problem. I then tried to compile using the C++Builder IDE and I get the following compile errors: [C++ Error] tuple_basic.hpp(158): E2238 Multiple declaration for 'element<N,T>' [C++ Error] tuple_basic.hpp(143): E2344 Earlier declaration of 'element<N,T>' I also tried using the command line compiler (bcc32.exe - version 5.6), but get the same errors (and more). Can someone tell me what I'm doing wrong? Do I need to do something special to prepare the boost libraries for use with Borland (e.g., using the Boost Jam stuff)? Some of the documentation said I should only have to set the include path. This seemed to work with mingw. Thanks, Craig

3 4

RE: [Boost-Users] Re: Why isn't the "last access time" part of the filesystem library?
by Ben Hutchings 09 May '03

09 May '03

richard_fanta <richard.fanta(a)morganstanley.com>: > --- In Boost-Users(a)yahoogroups.com, "Ben Hutchings" > <ben.hutchings@b...> wrote: > > richard_fanta <richard.fanta@m...> wrote: > > > Beman Dawes <bdawes@a...> wrote: > > > > At 01:02 AM 5/6/2003, richard_fanta wrote: > > > > >Looking at the filesystem library and the attributes work in > > > > >boost-sandbox, I don't immediately see "last access time" > > > > >being available for a file or directory. > > > > > > > > > >"Last access time" was included in Dietmar Kuehl's original > > > > >dir_it. > > > > > > > > > >Can someone kindly tell me why this was removed? It's highly > > > > >useful, and part of every filesystem that I've seen. <snip> > > > > Perhaps we should do more to support attribute query within the > > > > main library, but I don't really think we should include any > > > > that aren't reliably supported by at least POSIX, Windows, and > > > > ISO-9660 systems. > > > > > > Your point is well made. However, it does seem odd that a > > > feature that is useful for >95% of all typical usage shouldn't be > > > in the library. > > > > What does that figure refer to, if anything? > > Typical application usage. Yes, mileage can vary. > > Out of the last 50 apps you wrote that did file access, how many > involved CD-ROMS/DVDs that were ISO 9660 filesystems? I think most of them could quite happily have worked with files on CD-ROMs, but then I tend to write general-purpose code rather than very specific applications. A few of them needed to know file modification times. <snip> > > and updates to them may be disabled because the volume is read- > > only (whether or not the underlying medium is read-only) or > > purely to avoid the cost of updating them. > > Even if the volume is read-only from one machine, it might still > help to know when the file was last altered. > > > Note that Windows NT maintains > > access times at quite a low resolution, to reduce this cost. > > Low resolution or not, it's there. When the file changes, the > timestamp is updated. That's information that many applications > would find useful. <snip> What you're talking about is the modification time, not the access time. I agree that *that* is useful and widely supported, but it's not what you were originally asking for!

1 0

combinations of boost::condition
by Joshua Napoli 09 May '03

09 May '03

Is there any way to wait for one of several condition objects to become ready? Is there some reason that this capability is omitted from the thread library? I would like to do something like this: mutex monitorA, monitorB; condition conditionA, conditionB; double_condition conditionAB(conditionA,conditionB); void executeNextEvent() { lock lkA(monitorA); lock lkB(monitorB); //Wait for either conditionA or conditionB to become ready. conditionAB.wait(lkA,predicateA,lkB,predicateB); if(predicateA()) { executeEventA(); } else { executeEventB(); } } [Non-text portions of this message have been removed]

2 1

RE: [Boost-Users] Re: Why isn't the "last access time" part of the filesystem library?
by Ben Hutchings 09 May '03

09 May '03

richard_fanta <richard.fanta(a)morganstanley.com> wrote: > Beman Dawes <bdawes@a...> wrote: > > At 01:02 AM 5/6/2003, richard_fanta wrote: > > > > >Looking at the filesystem library and the attributes work in boost- > > >sandbox, I don't immediately see "last access time" being available > > >for a file or directory. > > > > > >"Last access time" was included in Dietmar Kuehl's original dir_it. > > > > > >Can someone kindly tell me why this was removed? It's highly useful, > > >and part of every filesystem that I've seen. > > > > ISO/IEC 9660:1999 filesystems don't supply a "last access" time stamp, > > perhaps because the original uses were on write-once media. > > Which filesystems adhere to this spec other than CD-ROMs? Many DVDs use this too, but for most purposes they're basically just higher-capacity CDs. > > Perhaps we should do more to support attribute query within the main > > library, but I don't really think we should include any that aren't > > reliably supported by at least POSIX, Windows, and ISO-9660 systems. > > Your point is well made. However, it does seem odd that a feature > that is useful for >95% of all typical usage shouldn't be in the > library. What does that figure refer to, if anything? > Other options: > -For ISO 9660 filesystems, use the time created as the "last > access" time stamp. > -Throw a "FeatureNotSupportedException" or somesuch. Then the feature won't be at all portable, and might as well not be supported at all. Access times are far from a universal OS feature, and updates to them may be disabled because the volume is read-only (whether or not the underlying medium is read-only) or purely to avoid the cost of updating them. Note that Windows NT maintains access times at quite a low resolution, to reduce this cost.

6 9

RE: [Boost-Users] call_traits and MSVC 7.1
by Randy Bowen 08 May '03

08 May '03

Thanks for the info. This is illegal code. That it compiled in MSVC 7.0 was a bug. The template parameter '_Source' can not be deduced from the callsite of doSomething. 14.8.2.4 in the ISO/IEC 14882 lists the forms in which template parameters can be deduced, but a qualified name involving nested types is not one of them. I suspect it's because of something like this: [Non-text portions of this message have been removed]

1 0

Compiling smart_ptr library
by l＠lo 08 May '03

08 May '03

Hi everybody! I'm trying to compile the smart_ptr library using the Jamfile in the test directory. Some of the test *.cpp files are compiled successfully, but some of them drops the following error: sunpro-Link-action ../../../libs/smart_ptr/test/bin/shared_ptr_alloc_ test.test/sunpro/debug/runtime-link-dynamic/shared_ptr_alloc_test Undefined first referenced symbol in file boost::__RTTI__1nFboostPchecked_deleter4nBZ___ /rest/proj/users/kercsoj/boost/boost_1_30_0/libs/s mart_ptr/test/bin/shared_ptr_alloc_test.test/sunpr o/debug/runtime-link-dynamic/ SunWS_cache/CC_obj__/_iANwWXwaw2nbnjBybyL.o [Hint: static member boost::__RTTI__1nFboostPchecked_deleter4nBZ___ must be defined in the program] It's seems, it is a common error, because it appears several times in the error output of the compiler. Has anybody any ideea, why this error message comes, and how could be corrected? Thanks, lalo

4 5

Indirect Iterator Adaptor, std::set and MSVC 6.5
by Joaquín Mª López Muñoz 08 May '03

08 May '03

The following produces an internal compiler crash in MSVC 6.5 #include <set> #include <boost/iterator_adaptors.hpp> int main() { typedef std::set<int *> type0; typedef boost::indirect_iterator_generator< type0::iterator,const int>::type type1; type0 s; type1 it(s.begin()); return 0; } This happens for std::set only, using say std::vector instead works fine. Is some workaround known? TIA Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Regex issue under Visual Studio 2003
by Frank Schwab 08 May '03

08 May '03

I have an inherited VC++ program that I am trying to port to Microsoft Visual Studio 2003 (it compiles and runs fine in Visual Studio 6.0). I've downloaded the 1.30.0 release, and the following problem still occurs. The (exceptionally) verbose error message I receive from the compiler is: error C2664: 'bool boost::regex_match<std::char_traits<char>,std::allocator<_Ty>,Allocator,char ,boost::regex_traits<charT>,std::allocator<_Ty>>(const std::basic_string<_Elem,_Traits,_Ax> &,boost::match_results<iterator,Allocator> &,const boost::reg_expression<charT,traits,Allocator> &,unsigned int)' : cannot convert parameter 2 from 'boost::cmatch' to 'boost::match_results<iterator,Allocator> &' with [ _Ty=char, Allocator=std::allocator<char>, charT=char, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, iterator=std::basic_string<char,std::char_traits<char>,std::allocator<char>> ::const_iterator, traits=boost::regex_traits<char> ] and [ iterator=std::basic_string<char,std::char_traits<char>,std::allocator<char>> ::const_iterator, Allocator=std::allocator<char> ] The Code fragment I get the error on is: // lpcszDeviceName is a function parameter defined as LPCTSTR lpcszDeviceName TSTRING strName = lpcszDeviceName; boost::regex expr("IW\\s+[A-Za-z]+\\s+([0-9]+)"); boost::cmatch matches; if (boost::regex_match(strName, matches, expr)) { ... } with the error message pointing to: if (boost::regex_match(strName, matches, expr)) This may be related to a Microsoft note: http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vccore/html /vclrfsomeiteratorsarenolongersameaspointers.asp but, then again, it may not. Anyone have any suggestions? I am well out of my depth in trying to understand the incantations here, and have a dozen spots in the code where this occurs. TIA, /frank

2 1

call_traits and MSVC 7.1
by Randy Bowen 08 May '03

08 May '03

We have been using call_traits from Boost version 1.29.0 in conjunction with MSVC 7.0. When attempting to recompile this code under MSVC 7.1, using either Boost 1.29.0 or 1.30.0, we now encounter compilation errors. A simple example of the usage pattern is: ############################################################### #include <boost/call_traits.hpp> class A { public: template<typename _Source> void doSomething ( typename boost::call_traits<_Source>::param_type value ) { } }; class B { public: explicit B(double d = 1.0, int i = 42) : _d(d), _i(i) {} B(B const& b) : _d(b._d), _i(b._i) {} private: double _d; int _i; }; extern "C" int main(int argc, char* argv[]) { A a; B b; a.doSomething(b); return 0; } ############################################################# The new compiler generates the error message: c:\Documents and Settings\rbowen\My Documents\Projects\CallTraitsTest\CallTraitsTest.cpp(34) : error C2783: 'void A::doSomething (boost::call_traits<_Source>::param_type)' : could not deduce template argument for '_Source' c:\Documents and Settings\rbowen\My Documents\Projects\CallTraitsTest\CallTraitsTest.cpp(11) : see declaration of 'A::doSomething' As an experiment, I manually included the older logic for call_traits by cutting and pasting the relevant classes into my source from 'detail/ob_call_traits.hpp' and still encountered the same error. Has anyone else experienced this? Is this (yet another) MS compiler bug?

2 1

Static thread library missing in 1_30_0
by yss15632 08 May '03

08 May '03

Hi, I am using boost on a linux system. I upgraded from boost_1_29_0 to 1_30_0. However, if I build the library just by typing "bjam" I cannot find the static library libboost_thread.a, in contrary to version 1_29_0. How can I generate it? Thank you very much, Stefan

3 2

date_time link or compile problem
by Jimmy Pritts 08 May '03

08 May '03

I have boost 1.29 and gcc 3.2.2 on Linux. Here is the simple code I am trying to compile: #include <string> #include "boost/date_time/gregorian/gregorian.hpp" int main() { using namespace std; using namespace boost::gregorian; string ds("2002/1/25"); date d1(from_string(ds)); return 0; } I get the following link error: make g++ main.cc -lstdc++ -o test /tmp/ccph1inq.o(.gnu.linkonce.t._ZN5boost9date_time4dateINS_9gregorian4dateENS2_18gregorian_calendarENS0_13date_durationIlEEEC2ERKNS0_19year_month_day_baseINS2_9greg_yearENS2_10greg_monthENS2_8greg_dayEEE+0x11): In function `boost::date_time::date<boost::gregorian::date, boost::gregorian::gregorian_calendar, boost::date_time::date_duration<long> >::date[not-in-charge](boost::date_time::year_month_day_base<boost::gregorian::greg_year, boost::gregorian::greg_month, boost::gregorian::greg_day> const&)': : undefined reference to `boost::date_time::gregorian_calendar_base<boost::date_time::year_month_day_base<boost::gregorian::greg_year, boost::gregorian::greg_month, boost::gregorian::greg_day>, unsigned long>::day_number(boost::date_time::year_month_day_base<boost::gregorian::greg_year, boost::gregorian::greg_month, boost::gregorian::greg_day> const&)' collect2: ld returned 1 exit status make: *** [test] Error 1 The missing symbol does not seem to be in the static library libboost_date_time.a, so I don't think I need to link to that. Any suggestions? Thanks in advance, Jimmy.

2 1

RE: [Boost-Users] call_traits and MSVC 7.1
by Arjun Bijanki 08 May '03

08 May '03

> From: Randy Bowen [mailto:rbowen@stamps.com] > Sent: Wednesday, May 07, 2003 5:46 PM > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] call_traits and MSVC 7.1 > > We have been using call_traits from Boost version 1.29.0 in > conjunction with MSVC 7.0. When attempting to recompile this code > under MSVC 7.1, using either Boost 1.29.0 or 1.30.0, we now > encounter compilation errors. A simple example of the usage pattern > is: <code snipped> This is illegal code. That it compiled in MSVC 7.0 was a bug. The template parameter '_Source' can not be deduced from the callsite of doSomething. 14.8.2.4 in the ISO/IEC 14882 lists the forms in which template parameters can be deduced, but a qualified name involving nested types is not one of them. I suspect it's because of something like this: template<typename T> struct S { typedef T type; }; template<> struct S<char> { typedef int type; }; template<typename T> void foo(typename S<T>::type); int main() { foo(3); //what is T deduced to be? } I'd guess the documentation for call_traits discusses typical usage patterns, and may help. You can also explicitly specify the template argument. Hope this helps. Arjun Bijanki Microsoft Visual C++

1 0

ublas: identity_matrix and row()
by Alexander G Winbow 08 May '03

08 May '03

It seems that identity_matrix does not work with row(); is this supposed to be the case? For example: ----------- code excerpt ----------- #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/vector.hpp> int main () { using namespace boost::numeric::ublas; //matrix<double> im(3,3); // this works identity_matrix<double> im(3); // this does not boost::numeric::ublas::vector<double> v = row(im,1); } ------------------------------------ Using matrix<> im, the code works fine, but using identity_matrix<> im, g++ blows up with four or five errors of the form included below, on lines 529, 61, 100, 104, and 84 of matrix_proxy.hpp. I've got quite a lot of questions on ublas, even after combing through the ublas and boost documentation, wiki, and mailing lists at great length. Is this an appropriate forum to pepper with questions, or is there some other manual I can RTFM first? Thanks, -Alex -------- errors excerpt compiling the above --------- /home/linux/phcomp/ph141w/ph141wam/libraries/boost_1_30_0/boost/numeric/ublas/matrix_proxy.hpp: In instantiation of `boost::numeric::ublas::matrix_row<boost::numeric::ublas::identity_matrix<double> >': rowtest.cpp:10: instantiated from here /home/linux/phcomp/ph141w/ph141wam/libraries/boost_1_30_0/boost/numeric/ublas/matrix_proxy.hpp:529: no type named `closure_type' in `class boost::numeric::ublas::identity_matrix<double>' /home/linux/phcomp/ph141w/ph141wam/libraries/boost_1_30_0/boost/numeric/ublas/matrix_proxy.hpp:529: template argument 3 is invalid -----------------------------------------------------------

2 1

Why isn't the "last access time" part of the filesystem library?
by richard_fanta 07 May '03

07 May '03

Looking at the filesystem library and the attributes work in boost- sandbox, I don't immediately see "last access time" being available for a file or directory. "Last access time" was included in Dietmar Kuehl's original dir_it. Can someone kindly tell me why this was removed? It's highly useful, and part of every filesystem that I've seen. Thanks, Rick

2 2

RegEx Split function dies.
by tfandango 07 May '03

07 May '03

Hi- I am attempting to parse email headers using the boost regex library. I would prefer that each email address in the TO field (delimited by a comma) would be placed into a vector<string>. Currently, I am able to obtain the entire to line (all the to addresses). I can use another regular expression to seperate it out but I'd rather do it all in one. However, If I try to add another more to this I get an exception: "Max regex search depth exceeded." I am assuming that this is because I've created a infinite loop. I'm not sure how to extend this expression to place every email address in the vector seperatly. Thanks here's my code snippet: char * expression_text = //Any possible leading whitespace: "^[ ]*" //The "To" field name in any case: "TO" //Any more whitespace: "[ ]*" //Then a colon: ":" //More white space potentially "[ ]*" //Everything here is an address up to "\r\n"; "([-(a)_\\.\"<>A-Za-z0-9]+),?"; //Create the expression class to use: RegEx expression(expression_text, true); //Attempt to grep the mail_buffer: int num_recv = 0; try { num_recv = expression.Split(to, mail_buffer); } catch (...){ //throw some exception } }

2 2

bjam and windows command line problem.
by Fernando Cacciola 07 May '03

07 May '03

Hi, I'm having a hard time trying to use bjam to build boost 1.29.0. I have Win98 in Spanish, and I use Borland C++ Builder 5.0 (its bcc32.exe corresponds to is BCC5.5.1) I have boost 1.29.0 installed at: "C:\Libraries\boost\Repository\boost" I've downloaded bjam for Microsoft Windows: >bjam -v Boost.Jam Version 3.1.0. OS=NT. Copyright 1993-2002 Christopher Seiwald and Perforce Software, Inc. Copyright 2001 David Turner. Copyright 2001-2002 David Abrahams. I've temporarily modified the root 'jamfile' so that it builds only the Test library. and I've done: subst d: "c:\archivos de programa\borland\cbuilder5" set BCCROOT=d: (you'll see why in a moment) If I try: c:\>cd C:\Libraries\boost\Repository\boost" C:\Libraries\boost\Repository\boost> bjam -sTOOLS=borland I receive messages of the form: borland-C++-action libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\threading-s ingle\execution_monitor.obj "d:\bin\bcc32" -j5 -q -c -P -w -Ve -Vx -a8 -v -Od -vi- -tWC -WM- -w-8001 -I"libs\test\build" -I"C:\Libraries\boost\Repository\boost" -I"d:\includ e" -o"libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\thre ading-single\execution_moni Error E2266: No file names given tor.obj" "libs\test\build\../src\execution_monitor.cpp" C:\WINDOWS\TEMP\JAMTMP00.BAT [2] Unknown command "TOR.OBJ" "LIBS\TEST\BUILD\.." "d:\bin\bcc32" -j5 -q -c -P -w -Ve -Vx -a8 -v -Od -vi- -tWC -WM- -w-8001 -I"libs\test\build" -I"C:\Libraries\boost\Repository\boost" -I"d:\includ e" -o"libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\thre ading-single\execution_monitor.obj" "libs\test\build\../src\execution_monitor.cpp" ...failed borland-C++-action libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\threading-s ingle\execution_monitor.obj... If I'm interpreting this output correctly, the problem is that the command line feed to bcc32 exceeds 256 characters. What can be done about this? Is there a way for 'borland-tools.jam' to put the bcc32 parameters in a tmp response file and use: bcc32.exe @tmprsp.rsp? Any help will be appreciated. TIA, -- Fernando Cacciola

4 22

RE: PP Library...
by Eric Robert 07 May '03

07 May '03

Ok, I see that there are 3 ways of doing this now. What is the recommendation for something small like 2 or 3 lines for each native types i.e. more or less 12 iterations? Eric "Paul Mensonides" <yg-boost-users(a)m.gmane.org> wrote > Tanton Gibbs wrote: > > You can use BOOST_PP_LIST_FOR_EACH > > > > #define ARG_LIST (char, (int, (unsigned int, (long, ...)))) > > #define DO_IT(r, data, elem) void foo( elem ); > > > > BOOST_PP_LIST_FOR_EACH( DO_IT, , ARG_LIST ) > ^ > This empty argument is undefined in C++. In C99, it is allowed and called a > "placemarker." Instead of passing nothing, just pass anything and ignore it. > > // ----- // > > #include <boost/preprocessor/list/for_each.hpp> > > #define ARG_LIST \ > (char, (int, (unsigned, (long, BOOST_PP_NIL)))) \ > /**/ > #define DO_IT(r, ignored, elem) \ > void foo( elem ); \ > /**/ > > BOOST_PP_LIST_FOR_EACH( DO_IT, ?, ARG_LIST ) > > #undef ARG_LIST > #undef DO_IT > > // ----- // > > Note that there are other ways to do this also. For instance, use of > "sequences" makes the definition of ARG_LIST easier: > > // ----- // > > #include <boost/preprocessor/seq/for_each.hpp> > > #define ARGS \ > (char)(int)(unsigned)(long) \ > /**/ > #define DO_IT(r, ignored, elem) \ > void foo( elem ); \ > /**/ > > BOOST_PP_SEQ_FOR_EACH( DO_IT, ?, ARGS ) > > #undef ARGS > #undef DO_IT > > // ----- // > > Of course, if what you want to generate is much larger, you might want to use > some form of vertical repetition: > > // ----- // > > #include <boost/preprocessor/iteration/local.hpp> > #include <boost/preprocessor/seq/elem.hpp> > > #define ARGS \ > (char)(int)(unsigned)(long) \ > /**/ > > #define BOOST_PP_LOCAL_MACRO(n) \ > void foo( BOOST_PP_SEQ_ELEM(n, ARGS) ); \ > /**/ > #define BOOST_PP_LOCAL_LIMITS \ > (0, BOOST_PP_SEQ_SIZE(ARGS) - 1) \ > /**/ > #include BOOST_PP_LOCAL_ITERATE() > > #undef ARGS > > // ----- // > > Regards, > Paul Mensonides [Non-text portions of this message have been removed]

3 8

RE: [Boost-Users] bug in pthreads implementation of recursive_mut ex
by Feldman, Yulik 06 May '03

06 May '03

Thanks Alexander for the pointer to this long and interesting discussion. I'll check my design whether I could get rid of the recursive mutexes in order to reduce the probability of not holding invariants when the wait() is called, especially since the code still doesn't behave correctly, even after the Boost bug is fixed :) William, unfortunately I don't have a small testcase for the bug and it seems that it will be too time-consuming for me to try to prepare a small "working" testcase. Thanks for confirming the bug report (it makes me feel better that the debugging time was not wasted). --Yulik. -----Original Message----- From: William E. Kempf [mailto:wekempf@cox.net] Sent: Monday, May 05, 2003 6:44 PM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] bug in pthreads implementation of recursive_mutex Feldman, Yulik said: > Hi, > > > > It looks that there is a bug in > .../boost_1_30_0/libs/thread/src/recursive_mutex.cpp. The bug shows in > the pthreads implementation of the recursive_mutex when the mutex is > used with the "condition" synchronization primitive. Here is the > description of the bug: You're evaluation of the bug is correct. I'll fix this in CVS shortly. Do you maybe have a test case for this that I could add to the regression tests? BTW, Mr. Terekhov does provide a good resource in his posting on this subject. I disagree with some points in the thread he posted, but it is quite true that you absolutely must gaurantee that invariants hold at the point cond.wait() is called, and that doing so is complicated by the use of recursive locks. Either avoid recursive locks entirely, avoid condition variables with recursive mutexes, or be very sure of the design and the state of your invariants. -- 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/

2 1

Problems with mpl::push_back
by joaquintides 06 May '03

06 May '03

#include <boost/mpl/list.hpp> #include <boost/mpl/push_back.hpp> int main() { typedef boost::mpl::list<> type0; typedef boost::mpl::push_back<type0,int>::type type1; typedef boost::mpl::push_back<type1,char>::type type2; return 0; } This fails in MSVC 6.5 and gcc 3.2. The error seems to indicate that push_back does not provide a type named 'type'. If I replace push_back with push_front, eveything works wonderfully. Am I doing any gross error, is the documentation wrong, ideas, clues? Thanx in advance. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

boost::shared_ptr templated constructor?
by Lehrer, Joshua 06 May '03

06 May '03

WRT boost::shared_ptr<>, why not template the explicit constructor that takes a T*? This way, it could select the correct destructor at construction time: struct base { ~base(); }; struct sub : public base { ~sub() }; boost::shared_ptr<base>(new sub); The above code currently only calls ~base(); Templating the explicit single argument constructor would allow the above code to call ~sub(). The constructor now takes only a T*, and therefore populates the pointer to the destructor function with a call to ~T(), which is ~base() in the above example. If, however, the constructor took an X*, the above example would pass a sub*, and it could populate the default destructor function with a pointer to ~X(). Comments? Joshua Lehrer FactSet Research Systems NYSE:FDS

3 2

BGL leaky?
by Martin Okrslar 06 May '03

06 May '03

Dear Boost users, is the BGL leaky? For example the code added below produces memory leaks (as seen from also added valgrind output). When I comment out the line marked by /* THIS LINE DOES IT */, there are no leaks. I am running BGL 1.29 and gcc 3.2. Any ideas for a work-around? cheers Martin #include <iostream> // for std::cout #include <utility> // for std::pair #include <algorithm> // for std::for_each #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> using namespace boost; int main(int,char*[]) { // create a typedef for the Graph type typedef adjacency_list<vecS, vecS, bidirectionalS> Graph; // Make convenient labels for the vertices enum { A, B, C, D, E, N }; const int num_vertices = N; // writing out the edges in the graph typedef std::pair<int, int> Edge; Edge edge_array[] = { Edge(A,B), Edge(A,D), Edge(C,A), Edge(D,C), Edge(C,E), Edge(B,D), Edge(D,E), }; int num_edges = sizeof(edge_array)/sizeof(edge_array[0]); // declare a graph object Graph* g = new Graph(num_vertices); // add the edges to the graph object for (int i = 0; i < num_edges; ++i) add_edge(edge_array[i].first, edge_array[i].second, *g); /* THIS LINE DOES IT */ delete g; return 0; } okrslar@liebrich:~/molgen/domclust/src/test> valgrind --leak-check=yes --show-reachable=yes ./domclust ==23473== valgrind-1.0.4, a memory error detector for x86 GNU/Linux. ==23473== Copyright (C) 2000-2002, and GNU GPL'd, by Julian Seward. ==23473== Estimated CPU clock rate is 2412 MHz ==23473== For more details, rerun with: -v ==23473== ==23473== ==23473== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0) ==23473== malloc/free: in use at exit: 384 bytes in 1 blocks. ==23473== malloc/free: 3 allocs, 2 frees, 544 bytes allocated. ==23473== For counts of detected errors, rerun with: -v ==23473== searching for pointers to 1 not-freed blocks. ==23473== checked 6470036 bytes. ==23473== ==23473== definitely lost: 0 bytes in 0 blocks. ==23473== possibly lost: 0 bytes in 0 blocks. ==23473== still reachable: 384 bytes in 1 blocks. ==23473== ==23473== 384 bytes in 1 blocks are still reachable in loss record 1 of 1 ==23473== at 0x4004A3A8: __builtin_new (vg_clientfuncs.c:125) ==23473== by 0x4004A3F6: operator new(unsigned) (vg_clientfuncs.c:138) ==23473== by 0x4035E4F1: ??? (bits/stl_alloc.h:482) ==23473== by 0x4035E40D: ??? (bits/stl_alloc.h:532) ==23473== ==23473== LEAK SUMMARY: ==23473== definitely lost: 0 bytes in 0 blocks. ==23473== possibly lost: 0 bytes in 0 blocks. ==23473== still reachable: 384 bytes in 1 blocks. ==23473== -- ----------------------------------------------------------------------------- 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 -----------------------------------------------------------------------------

2 1

More Mac Compiler Woes - Boost 1.30.0 - Thread and type_traits
by Bobby Thomale 05 May '03

05 May '03

Hey guys, I am having some more problems getting Boost 1.30 to compile on the Mac. I am using CW Pro 8.3, compiling a TARGET_CARBON project. I am having trouble getting the MP implementation of threads to compile. It seems to be having trouble with function pointers where the syntax function<type> is used. I remember at one point it was mentioned that: function<type, type...> was deprecated and we were to use either the more universally supported: functionN<type,type...> or the cleaner: function<void myfuncSig()> instead if our compiler supported it. (Mine doesn't support that last one yet I don't think.) I am guessing that the oldest syntax was removed and no one has bothered to update the Mac carbon thread implementaton to compile again since then? That one seems pretty easy to fix - just update to a supported syntax? (I could do this, update to the functionN<type,type...> syntax since that is what my compiler supports. If someone wants me to make and submit the changes to them for inclusion I'd be happy to, if I knew who to send them to...) Or is there a better/easier workaround? Secondly, the Signals library is not compiling. It's actually not a Signals problem, I think it is a type_traits problem. I am getting a bunch of strange compile errors, in a boost::type_traits file called: is_base_and_derived.hpp It looks like there is a template near the top that is the first thing that fails. There is a define that goes into an alternate implementation for certain broken compilers. Perhaps CodeWarrior needs to be added to the list of compilers that compiles the "broken compiler" version of the stuff in this header? Thanks in advance for your help! -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ ---------------------------------------------------------------------

5 6

bug in pthreads implementation of recursive_mutex
by Feldman, Yulik 05 May '03

05 May '03

Hi, It looks that there is a bug in .../boost_1_30_0/libs/thread/src/recursive_mutex.cpp. The bug shows in the pthreads implementation of the recursive_mutex when the mutex is used with the "condition" synchronization primitive. Here is the description of the bug: When the client code calls wait() function on a condition sending as a parameter a lock object associated with a recursive_mutex ("m_Condition.wait(Lock)"), the following functions get called: boost::condition::wait(L& Lock) at condition.hpp:91 boost::condition::do_wait(M& mutex) at condition.hpp:137 boost::detail::thread::lock_ops<boost::recursive_mutex>::unlock(Mutex& m, lock_state& state) at lock.hpp:54 boost::recursive_mutex::do_unlock(cv_state& state) The implementation of the last function on "winthreads" and "mptasks" resets the 'm_count' data member to zero. The "pthreads" implementation at recursive_mutex.cpp:399 doesn't reset the 'm_count' to zero. As a result, when the calling thread enters pthread_cond_wait() and the mutex is unlocked by the pthreads the 'm_count' still remains non-zero. Starting from this point, the things may go bad. Consider, for example, that another thread tries to acquire the mutex. The thread calls: boost::recursive_mutex::scoped_lock Lock(m_Mutex) boost::detail::thread::scoped_lock<boost::recursive_mutex>::scoped_lock<boos t::recursive_mutex>(Mutex& mx, initially_locked = true) at lock.hpp:66 boost::detail::thread::scoped_lock<boost::recursive_mutex>::lock() at lock.hpp:76 boost::detail::thread::lock_ops<boost::recursive_mutex>::lock(Mutex& m) at lock.hpp:34 boost::recursive_mutex::do_lock() at recursive_mutex.cpp:307 The last function locks the mutex again, and, if BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE is defined, increments the counter to 2. Now, since the count is more than 1, the function unlocks the mutex. As a result, the mutex remains unlocked, after the lock function is called. The same problem exists in recursive_try_mutex and recursive_timed_mutex. I've tried to fix the code as follows, which seemed to help in my particular case: ---------------------------------------------------------------------------- ------------------------------------ *** recursive_mutex.cpp.orig Sun Feb 23 19:38:11 2003 --- recursive_mutex.cpp Sat May 3 17:32:44 2003 *************** *** 412,417 **** --- 412,418 ---- state.pmutex = &m_mutex; state.count = m_count; + m_count = 0; } recursive_try_mutex::recursive_try_mutex() *************** *** 608,613 **** --- 609,615 ---- state.pmutex = &m_mutex; state.count = m_count; + m_count = 0; } recursive_timed_mutex::recursive_timed_mutex() *************** *** 787,792 **** --- 789,795 ---- state.pmutex = &m_mutex; state.count = m_count; + m_count = 0; } #elif defined(BOOST_HAS_MPTASKS) ---------------------------------------------------------------------------- ------------------------------------ Any comments? Is this indeed a bug? Is the fix correct? Thanks, Yulik. [Non-text portions of this message have been removed]

3 2

uBlas - matrix comparison A == B -> how-to guide ...
by geert_ceuppens 05 May '03

05 May '03

Sharing my effort in working with ublas ... Forgive me if this is described already somewhere - I could not find it immediately in the doc so I looked around in the code ; ) Matrix comparison is implemented using the equals() method defined in matrix_assign.hpp: bool equals (const matrix_expression<E1> &e1, const matrix_expression<E2> &e2) Code snippet: ublas::matrix<double> A(5,5), B(5,5); // Initialise A somehow init_matrix(A); B = A; // This does not compile ... bool equal = ( A == B ); // But this does (and it works ...) bool equal = ublas::equals ( A, B );

1 0

RE: [Boost-Users] How To Build Boost 1.30 With Dev-CPP?
by bjorn.karlsson＠readsoft.com 04 May '03

04 May '03

> From: firingme [mailto:yg-boost-users@m.gmane.org] > E:\LY\boost_1_30_0>bjam sTOOS=mingw This should read sTOOLS, not sTOOS. Bjorn

5 5

RE: [Boost-Users] Code Fail
by Jim.Hyslop 02 May '03

02 May '03

Hossein Haeri [mailto:powerprogman@yahoo.com] wrote: > There is a tiny cpp file attached to this message > that raises the following exception while running: No, there isn't ;-) The email list strips out attachments. If it truly is tiny, then paste it inline. If it's not-so-tiny, then you can upload it to the files area: http://groups.yahoo.com/group/Boost-Users/files/ -- Jim

1 0

RE: [Boost-Users] Re: Is there a "known issues" page anywhere?
by Jim.Hyslop 02 May '03

02 May '03

Alisdair Meredith [mailto:yg-boost-users@gmane.org] wrote: > "Jim.Hyslop" wrote: > > > There is a "Known Issues" section on the wiki (see the link in the > > auto-appended .sig) which is intended to document these > common "gotchas". I > > haven't looked at it for a while, so I don't know how > up-to-date it is. > > I tried looking there first, and after your message went back for a > second look. > Perhaps I am being dense, but I really can't find it. > Closest match is > the 'build issues' page, which I think is for a different thing. > 'Search' the wiki did not help either. That's the page I meant - CommonBuildProblems: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?CommonBuildPr oblems Sorry about the confusion. Your problem with the lexical_cast is the precise reason I created the page. > Could you post a link to the precise page you were thinking > about? And > I think a more prominent link on the front page may be useful too. There's one under the "Quick Links" section, but as you say it's not very prominent. Remember, the point of a wiki is that *anyone* can change the information. If you think it deserves a more prominent position, then you are free to give it one :=) -- Jim

1 0

PP library...
by Eric Robert 02 May '03

02 May '03

Hi, I think the preprocessor library could help me here but I'm having problems understanding it. Maybe someone will be so kind to explain it to me a bit. Here is what I want to produce: void foo(char); void foo(int); void foo(unsigned int); .... You got the idea. Something that repeats a list of things i.e. here, types. How can I do that? Thanks! Eric [Non-text portions of this message have been removed]

3 3

Code Fail
by Hossein Haeri 02 May '03

02 May '03

Dear all, There is a tiny cpp file attached to this message that raises the following exception while running: "Project ConstStatProject.exe raised exception class EAccessViolation with message 'Access violation at adress ...'. Process stopped. Use Step or Run to continue." and stops at the following line of the share_ptr library: if(use_count_ == 0 && weak_count_ != 0) boost::throw_exception(boost::bad_weak_ptr()); Can anybody help me? BTW, I'm using BCB6. Thanks, --Hossein __________________________________ Do you Yahoo!? The New Yahoo! Search - Faster. Easier. Bingo. http://search.yahoo.com [Non-text portions of this message have been removed]

1 0

[BGL] Online Graph Algorithms (fwd)
by David Pearce 02 May '03

02 May '03

Hello, I am interested in how boosters think online graph algorithms should be written. I have looked at the connected_components algorithm and feel that it breaks some of the ideas behind generic programming. For example, consider the following: > typedef adjacency_list <vecS, vecS, undirectedS> Graph; > Graph G(6); > add_edge(0, 1, G); > add_edge(1, 4, G); > > // create the disjoint-sets structure, which requires > // rank and parent vertex properties > ... > initialize_incremental_components(G, ds); > incremental_components(G, ds); > > generic_algorithm_which_adds_edges(G); At this point, the connected_components data structures may be out-of-sync. Now, I suppose that we could write a wrapper class which looked like a "Graph" and provides its own add_edge to update "ds" correctly. However, this seems overly cumbersome. It strikes me that a better way of doing this would be to use an abstract base class, like so: > template<class T, ...> > class connected_components : public T { > ... > }; > > template<class T> > pair<T::edge_descriptor, bool> > add_edge(connected_components<T>::vertex_descriptor t, ...) { > // do stuff > return add_edge(static_cast<T::vertex_descriptor>(t), ...); > } Thus, we supply "Graph" as the base class and can then safely pass it to "generic_algorithm_which...". So, does anyone know of any reasons not to do this? Cheers, David J. Pearce

1 0

const shared_ptr<>
by Hossein Haeri 02 May '03

02 May '03

Dear all, I'm a newbie in boost! I want to know what the following means: int a = 5; const boost::shared_ptr<int> sp(&a); Does it mean that the following line is an error? *sp = 7; If so, what are the guarantees? Is there any documented guarantee? (I couldn't find anything in the documentation. Excuseme if I'm careless!) Thanks, --Hossein __________________________________ Do you Yahoo!? The New Yahoo! Search - Faster. Easier. Bingo. http://search.yahoo.com

3 11

RE: [Boost-Users] Is there a "known issues" page anywhere?
by Jim.Hyslop 02 May '03

02 May '03

Alisdair Meredith [mailto:yg-boost-users@gmane.org] wrote: > Is there a place where known problems for libraries/compilers are > stored? > > For instance, trying to use boost/time we hit a problem with MSVC7 and > lexical_cast unless we enable the "wchar_t as a native type" option. > While this may be good practice <g> it is not the default, > and caught us > out (and the error is none-too helpful) > > I can imagine this sort of issue is discovered and re-discovered on a > regular basis, and wonder where to look for such known issues before > using list bandwidth. There is a "Known Issues" section on the wiki (see the link in the auto-appended .sig) which is intended to document these common "gotchas". I haven't looked at it for a while, so I don't know how up-to-date it is. If that issue's not documented there, would you mind adding it? -- Jim

3 2

graph (BGL): bad documentation
by schlumpfi106 01 May '03

01 May '03

I just tried to use the boost graph library to create a spanning tree generation algorithm. After wasting a whole day I gave up and wrote all the graph code myself. I'm quiet upset about the useless online documentation for the graph library. Maybe I have to buy the book to be able to use it? Normally I would rely on some good, instructive examples and start my own program by copy-and-paste. Here, there are only a few examples and they are either too simple or too specific. Most documentation topics provide no examples at all. Sometimes I head to guess through the template-loaded headerfiles because there was no documentation. I failed in creating a graph from a given adjacency matrix. I failed in understanding the "interior property" concept. I failed in printing a graph and its properties to graphviz. To the developers: Please, before you implement anything new -- document the old things.

1 0

RE: [Boost-Users] Regexp Homework :-)
by Ben Hutchings 01 May '03

01 May '03

Simon Brown <simon.brown(a)kns.ch> wrote: > A few days ago I received great help with a regexp question - > now here's > another which I doubt can be done. > > Question: if the text string contains three words AAA BBB AAA > then return > the string (if any) which is repeated two or three times. > > Examples: > AAA AAA AAA return AAA > AAA BBB AAA return AAA > AAA AAA BBB return AAA > AAA BBB CCC return <nothing> > > Can this be done with a regular expression? Match against "(\\w+) (?:\\1 \\w+|\\w+ \\1)|\\w+ (\\w+) \\2" and return the match for whichever sub-expression (1 or 2) was matched. (I tested this with Python not Boost regex, but they should be compatible.)

2 1

Is there a "known issues" page anywhere?
by Alisdair Meredith 01 May '03

01 May '03

Is there a place where known problems for libraries/compilers are stored? For instance, trying to use boost/time we hit a problem with MSVC7 and lexical_cast unless we enable the "wchar_t as a native type" option. While this may be good practice <g> it is not the default, and caught us out (and the error is none-too helpful) I can imagine this sort of issue is discovered and re-discovered on a regular basis, and wonder where to look for such known issues before using list bandwidth. -- AlisdairM

1 0

regexp match question
by Simon Brown 01 May '03

01 May '03

Hi All, Here's a question I can't answer. I'm using regexp to dig out strings from data received via Ham Radio, so the txt often is corrupted. What I want to match is two consecutive callsigns separated by whitespace, for example 'hb9drv hb9drv' but not 'hb9drv hb9drX'. I can define the match condition for a callsign, but can I use the match option {2,3} somehow to match the same callsign two or three times? Effectively match the same word two or three times? Help received with much thanks, Simon Brown, Casa Bergenia, CH-7031 Laax www.hb9drv.ch [Non-text portions of this message have been removed]

3 5

Licence terms
by Ben Hutchings 30 Apr '03

30 Apr '03

Where should I post to ask questions and make suggestions about licence terms for Boost libraries? I am specifically concerned about the large number of slightly different wordings of some of the licences, which I think would all have to be included in documentation of a program using the covered libraries.

1 0

RE: [Boost-Users] const shared_ptr<>
by Tom Matelich 30 Apr '03

30 Apr '03

> From: Hossein Haeri [mailto:powerprogman@yahoo.com] > Sent: Wednesday, April 30, 2003 8:29 AM > > I want to know what the following means: > > int a = 5; > const boost::shared_ptr<int> sp(&a); > I assume you know this, but this code is in error. When the last shared_ptr referencing &a goes away, it will try to delete a, which is illegal. There is a workaround defined at http://www.boost.org/libs/smart_ptr/sp_techniques.html#static , though. ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

ptime and time_duration
by Andre du Toit 30 Apr '03

30 Apr '03

Hi. Since time_duration uses <long> to represent each of the fields (H:M:S:FS), I should be able to add any hour offset to a ptime, as long as the resultant ptime is inside the date/time range representable by boost? With the date ranges of boost being 1400-Jan-1 00:00:00 -> 10000-Jan-1 00:00:00, the number of hours between these dates is (very roughly!) 7.534E7. This is less than the <long> limit on my system, which is +/- 2.147E9. That is good. So; doing the following: ptime t_max( date(10000,Jan,1) ); ptime t_min( date(1400,Jan,1) ); time_duration td = t_max - t_min; std::cout << to_simple_string( td ) << std::endl; should produce something like : 7.534E7:0:0 or if you want to write it out: 7533600:0:0 not? Instead; the output I get is : 224112:19:12. This corresponds to a timespan of roughly 25 years which means I just ran into some overflow/underflow problem somewhere. What gives? What time range is supported by time_duration if it does not use the <long> limits? I have difficulty deducing this information from the header files, the source for the lib is not too helpfull either! What am I missing here? Greetings, Andre.

2 1

Re: Re: running regression tests
by Dave Abrahams 30 Apr '03

30 Apr '03

Peter Dimov wrote: > David Abrahams wrote: >> BTW, Vaclav, the place to post about Boost.Build issues is >> jamboost(a)yahoogroups.com. >> >> http://groups.yahoo.com/group/jamboost/ > > ... and the place to announce mailing lists is > > http://www.boost.org/more/mailing_lists.htm Updated.

1 0

running regression tests
by Vaclav Vesely 30 Apr '03

30 Apr '03

It's possible to execute all regression tests so it's possible to execute one test suite: bjam test or bjam filesystem But it's impossible to execute several (but not all) test suits at once: bjam config filesystem Only the last (filesystem) suit is executed. It's possible to improve testing.jam to allow it? Can someone give a bit of advice? Thanks and regards, w

4 5

boost::spirit multiline comment parsing - how?
by Markus Werle 30 Apr '03

30 Apr '03

Hi! While playing around with the examples of the spirit library I feel like I missed some essential points. The far goal I have is to parse a file containing C/C++ comments and assignments of the form name = value; where I drop the comments and store the assignments in a map<string, string>. If You have done something similar, please share Your knowledge with the rest of us. Below is a modifed version of comments.cpp. Here I only try to output any comment found while dropping the other stuff. Why does the parser drop stuff after the 1st assignment? the output of the code is Parsed C-comment successfully! Matched (27) characters: "//test2 /* test1 */// test Any help appreciated. Also I would like not to gather all commenst in one string ... -------- #include "boost/spirit.hpp" #include <iterator> #include <string> #include <iostream> #include <cassert> #include <fstream> #include <map> #include <cassert> /////////////////////////////////////////////////////////////////////////////// // actor called after successfully matching a single character class actor_string { public: actor_string(std::string &rstr) : matched(rstr) { } void operator() (const char *pbegin, const char *pend) const { matched += std::string(pbegin, pend-pbegin); } private: std::string &matched; }; /////////////////////////////////////////////////////////////////////////////// // actor called after successfully matching a C++-comment void actor_cpp (const char *pfirst, const char *plast) { std::cerr << "Parsing C++-comment" << std::endl; std::cerr << "Matched (" << plast-pfirst << ") characters: "; char cbbuffer[128]; strncpy(cbbuffer, pfirst, plast-pfirst); cbbuffer[plast-pfirst] = '\0'; std::cerr << "\"" << cbbuffer << "\"" << std::endl; } /////////////////////////////////////////////////////////////////////////////// // main entry point int main () { using namespace boost::spirit; ///////////////////////////////////////////////////////////////////////////// char const* pCComment = "//test2\n/* test1 */\n\n// test\nalpha = 3.0;\n\n// beta is soo important\nbeta=5.6;\n\n/* \n\nSometimes comments are\ngood since\nbeta = 4.5;\nis a good choice, too\n\n*/"; typedef skipper_iteration_policy<> iter_policy_t; typedef scanner_policies<iter_policy_t> scanner_policies_t; typedef scanner<char const*, scanner_policies_t> phrase_scanner_t; rule<phrase_scanner_t> cpp_comment, ignored, all; cpp_comment = comment_p("/*", "*/") // rule for C-comments | comment_p("//") // rule for C++ comments ; std::string comment_c; all = ( *cpp_comment[actor_string(comment_c)] | *anychar_p ) ; ignored = (space_p | chlit<char>('\n')); parse_info<> result; result = parse (pCComment, all, space_p); if (result.hit) { std::cerr << "Parsed C-comment successfully!" << std::endl; std::cerr << "Matched (" << comment_c.size() << ") characters: "; std::cerr << "\"" << comment_c << "\"" << std::endl; } else { std::cerr << "Failed to parse C/C++-comment!" << std::endl; } std::cerr << std::endl; } Markus -- Compile time analytic differentiation? Yes, at http://daixtrose.sourceforge.net/

2 1

bjam, targets from another projects
by Vaclav Vesely 30 Apr '03

30 Apr '03

Hi, It's possible to specify dependency on a target from another project tree? I want to write to my project's "Jamfile" something like this: --- Jamfile --- exe test : test.cpp <dll>$(BOOST_ROOT)/libs/threads/build/boost_thread : <include>$(BOOST_ROOT) ; --- Thanks and regards, w

2 1

bjam - several projects and ALL_LOCATE_TARGET
by Vaclav Vesely 30 Apr '03

30 Apr '03

Hi, I would like to ask for help with using bjam. I want to have more project directory trees, for example: C:\src\boost C:\src\my_projects\first C:\src\my_projects\first and I want to compile binaries to separate directories: C:\build\boost C:\build\my_projects\first C:\build\my_projects\second So I have to set different values of the ALL_LOCATE_TARGET environment variable for each project. It's unconfortable to set that value each time I want to inovoke the bjam, so I want to set it in the Jamfile of each project. I mean somethin like this: --- C:\src\my_first_project\Jamfile --- project-root ; ALL_LOCATE_TARGET = C:\build\my_projects\first --- Of course, this doesn't work. Can someone propose the solustion? BTW it would be handy to use the "project-root" directive for this reason: --- C:\src\my_first_project\Jamfile --- project-root my_projects/first ; --- The specified path is ment as relative to the ALL_LOCATE_TARGET. Thanks and regards, w

2 1

tokenizer: finding the last element. is it possible?
by Vincent LaBella 29 Apr '03

29 Apr '03

Hello, I'm using boost::tokenizer and want to goto the last token in the sequence, so I tried Tok::iterator last = tok.end(); last--; // error decrement not defined last = tok.begin(); advance(last,tok.size()-1); // error size() not defined. Is it possible to add decrement or a back() reference to tokenizer? Thanks Vince

3 4

scoped_ptr(auto_ptr) constructor
by Daniel Franklin 29 Apr '03

29 Apr '03

Is the constructor for scoped_ptr that takes an auto_ptr argument part of the proposed standard? The boost documentation makes no mention of it, yet it exists in the implementation as: explicit scoped_ptr(std::auto_ptr<T> p): ptr(p.release()) // never throws { } Personally I think it should be included in the proposed standard if it is not. I can't see any reason why it shouldn't be, as it doesn't seem to break the fundamental concepts behind auto_ptrs (ownership transferal) or scoped_ptrs (sole ownership). Ownership of the object is transfered from the auto_ptr to the scoped_ptr, and thereafter retained solely by that scoped_ptr. Regards, Daniel Franklin

1 0

[PP] Getting the size of a tuple
by Sam Partington 29 Apr '03

29 Apr '03

Hello, I've just started using the preprocessor library, for a fairly simple task. Essentially I have the have a macro called DECLARE_TESTS, which I use like the following DECLARE_TESTS(2, (Test1, Test2) ) which expands into the following void Test1(); void Test2(); suite() { ADDTEST(Test1); ADDTEST(Test2); } Now the problem: it is inconvenient to have to specify the size of the the tuple in the first macro. Is there any way to deduce the size? The macros I'm using are below. Thanks in advance for any help (positive or otherwise) Sam PS Before you suggest using Boost.Test, we have looked at it, and feel that it is not quite what we're looking for, and I don't want to get into that discussion! :-) #define DECLARE_TESTS(test_count, test_list) \ BOOST_PP_LIST_FOR_EACH(UNITTESTS_DECLARE_TEST, _, BOOST_PP_TUPLE_TO_LIST(test_count, test_list)) \ public: \ ClassToTest() \ { \ BOOST_PP_LIST_FOR_EACH(UNITTESTS_ADD_TEST, _, BOOST_PP_TUPLE_TO_LIST(test_count, test_list)) \ } // implementation macros #define UNITTESTS_DECLARE_TEST(R, _, name) void name(); #define UNITTESTS_ADD_TEST(R, _, name) ADDTEST(name)

1 0

uBLAS compile fail on sparse matrix debug code
by Zhang Le 29 Apr '03

29 Apr '03

Hi all, I just write a simple program to test the efficiency of sparse matrix operation in uBLAS and get the following error message on a FreeBSD with gcc 2.95 : !gmake 2>&1| tee /tmp/v446688/2g++ -c test.cpp -I. -I/usr/local/include -Wall -g -O2 -march=i686 -pipe -ftemplate-depth-30 -g3 -O0 -o test.o g++ test.o -o a.out test.o: In function `pair<unsigned int, unsigned int> * __copy_backward<pair<unsigned int, unsigned int> *, pair<unsigned int, unsigned int> *, int>(pair<unsigned int, unsigned int> *, pair<unsigned int, unsigned int> *, pair<unsigned int, unsigned int> *, random_access_iterator_tag, int *)': /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.norm_inf__Q45boost7numeric5ublast11type_traits1ZUiRCUi+0x15): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::imag(unsigned int const &)' /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.norm_inf__Q45boost7numeric5ublast11type_traits1ZUiRCUi+0x24): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::abs(unsigned int const &)' /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.norm_inf__Q45boost7numeric5ublast11type_traits1ZUiRCUi+0x3a): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::real(unsigned int const &)' /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.norm_inf__Q45boost7numeric5ublast11type_traits1ZUiRCUi+0x49): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::abs(unsigned int const &)' /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.equals__H2ZQ45boost7numeric5ublast6vector2ZUiZQ45boost7numeric5ublast15unbounded_array1ZUiZQ45boost7numeric5ublast6vector2ZUiZQ45boost7numeric5ublast15unbounded_array1ZUi_Q35boost7numeric5ublasRCQ45boost7numeric5ublast17vector_expression1ZX01RCQ45boost7numeric5ublast17vector_expression1ZX11_b+0x2e): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::sqrt(unsigned int const &)' If I comment out the second prod() or use -DNDEBUG everything is ok. So I suspect the error is caused by debug code in sparse matrix prod operation. here is the main code block: int main(int argc,char* argv[]) { try { namespace ublas = boost::numeric::ublas; using namespace ublas; size_t d = 7000; ublas::vector<unsigned> v(d); ublas::matrix<unsigned> m (d,d); ublas::sparse_matrix<unsigned> ms (d,d); for (size_t i = 0;i < 10000;++i) { size_t r = (size_t)(drand48() * d); size_t c = (size_t)(drand48() * d); ++m(r,c); ++ms(r,c); ++v(r); ++v(c); } { progress_timer t; std::cout << "matrix * vector" << endl; ublas::prod(m,v); } { progress_timer t; std::cout << "sparse matrix * vector" << endl; ublas::prod(ms,v); } }

2 1

Trouble building 1.30.0 on Linux
by Garen Parham 29 Apr '03

29 Apr '03

When I try to build boost with this method: ./build.sh gcc || die "couldn't build bjam" cd $srcdir ./tools/build/jam_src/bin.linux${ARCH}/bjam -j2 \ -sBOOST_ROOT=${S} \ -sPYTHON_ROOT=/usr \ -sPYTHON_VERSION=2.2 \ -sTOOLS=gcc This happens: ...failed updating 6 targets... ...updated 539 targets... On the other hand, if I restart the build it seems to..magically work: ### ### Using 'gcc' toolset. ### rm -rf bootstrap.gcc mkdir bootstrap.gcc gcc -o bootstrap.gcc/jam0 command.c compile.c execnt.c execunix.c execvms.c expand.c filent.c fileos2.c fileunix.c filevms.c glob.c hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c newstr.c option.c parse.c pathunix.c pathvms.c regexp.c rules.c scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c pwd.c ./bootstrap.gcc/jam0 -f build.jam --toolset=gcc --toolset-root= ...found 44 targets... ...found 3407 targets... ...updating 6 targets... FileClone libs/python/build/bin-stage/libboost_python_debug.so.1.30.0 FileClone libs/python/build/bin-stage/libboost_python.so.1.30.0 FileClone libs/regex/build/bin-stage/libboost_regex_debug.so.1.30.0 FileClone libs/regex/build/bin-stage/libboost_regex.so.1.30.0 FileClone libs/thread/build/bin-stage/libboost_threadd.so.1.30.0 FileClone libs/thread/build/bin-stage/libboost_thread.so.1.30.0 ...updated 6 targets... That didn't happen with 1.29. Is there a cleaner way not documented to get it to build nicely? I had less luck trying to build with icc.

1 0

bug in testing.jam
by Vaclav Vesely 29 Apr '03

29 Apr '03

There is missing enclosing parenthesis. Regards, w Index: tools/build/testing.jam =================================================================== RCS file: /cvsroot/boost/boost/tools/build/testing.jam,v retrieving revision 1.16 diff -u -r1.16 testing.jam --- tools/build/testing.jam 3 Mar 2003 19:59:45 -0000 1.16 +++ tools/build/testing.jam 26 Apr 2003 23:09:40 -0000 @@ -99,7 +99,7 @@ if $(files) { # make relative to the project root instead of "." - local file = $(files[1]:R=$(SUBDIR_TOKENS:J=/) ; + local file = $(files[1]:R=$(SUBDIR_TOKENS:J=/)) ; # try to undo absolute paths source-files += [ relative-path $(file) ] ; begin 666 testing.jam.patch M26YD97@Z('1O;VQS+V)U:6QD+W1E<W1I;F<N:F%M#0H]/3T]/3T]/3T]/3T] M/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T] M/3T]/3T]/3T]#0I20U,@9FEL93H@+V-V<W)O;W0O8F]O<W0O8F]O<W0O=&]O M;',O8G5I;&0O=&5S=&EN9RYJ86TL=@T*<F5T<FEE=FEN9R!R979I<VEO;B Q M+C$V#0ID:69F("UU("UR,2XQ-B!T97-T:6YG+FIA;0T*+2TM('1O;VQS+V)U M:6QD+W1E<W1I;F<N:F%M"3,@36%R(#(P,#,@,3DZ-3DZ-#4@+3 P,# ),2XQ M-@T**RLK('1O;VQS+V)U:6QD+W1E<W1I;F<N:F%M"3(V($%P<B R,# S(#(S M.C Y.C0P("TP,# P#0I 0" M.3DL-R K.3DL-R! 0 T*(" @(" @(" @:68@ M)"AF:6QE<RD-"B @(" @(" @('L-"B @(" @(" @(" @(" C(&UA:V4@<F5L M871I=F4@=&\@=&AE('!R;VIE8W0@<F]O="!I;G-T96%D(&]F("(N(@T*+2 @ M(" @(" @(" @(&QO8V%L(&9I;&4@/2 D*&9I;&5S6S%=.E(])"A354)$25)? M5$]+14Y3.DH]+RD@.PT**R @(" @(" @(" @(&QO8V%L(&9I;&4@/2 D*&9I M;&5S6S%=.E(])"A354)$25)?5$]+14Y3.DH]+RDI(#L-"B @(" @(" @(" @ M(" -"B @(" @(" @(" @(" C('1R>2!T;R!U;F1O(&%B<V]L=71E('!A=&AS M#0H@(" @(" @(" @(" @<V]U<F-E+69I;&5S("L](%L@<F5L871I=F4M<&%T 0:" @)"AF:6QE*2!=(#L-"@`` ` end

2 1

Patch for the bjam's build script
by Vaclav Vesely 29 Apr '03

29 Apr '03

When compiling the bjam under MSVC or VC7 tools and the LIB environment variable ends with a backslash, for example: LIB=C:\PROGRA~1\MICROS~3\VC98\LIB\ than the build.bat script fails. I've spend quite a long time with looking for the cause. The attached patch fixes it: Regards, w begin 666 jam_src.patch M26YD97@Z('1O;VQS+V)U:6QD+VIA;5]S<F,O8G5I;&0N8F%T#0H]/3T]/3T] M/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T] M/3T]/3T]/3T]/3T]/3T]#0I20U,@9FEL93H@+V-V<W)O;W0O8F]O<W0O8F]O M<W0O=&]O;',O8G5I;&0O:F%M7W-R8R]B=6EL9"YB870L=@T*<F5T<FEE=FEN M9R!R979I<VEO;B Q+C$Q#0ID:69F("UU("UR,2XQ,2!B=6EL9"YB870-"BTM M+2!T;V]L<R]B=6EL9"]J86U?<W)C+V)U:6QD+F)A= DR,2!!<'(@,C P,R P M-#HS-CHR.2 M,# P, DQ+C$Q#0HK*RL@=&]O;',O8G5I;&0O:F%M7W-R8R]B M=6EL9"YB870),C@@07!R(#(P,#,@,C,Z-#0Z-3$@+3 P,# -"D! ("TQ.#@L M-R K,3@X+#<@0$ -"B!I9B B7R5"3T]35%]*04U?5$]/3%-%5"5?(B ]/2 B M7VUS=F-?(B H#0H@(" @(&EF(&YO=" B7R5"3T]35%]*04U?5$]/3%-%5%]2 M3T]4)5\B(#T](")?7R(@* T*(" @(" @(" @<V5T(%!!5$@])5!!5$@E.R5" M3T]35%]*04U?5$]/3%-%5%]23T]4)6)I;BD-"BT@(" @<V5T($)/3U-47TI! M35]#0STB)4)/3U-47TI!35]43T],4T547U)/3U0E8FEN7&-L+F5X92(@+VYO M;&]G;R O1UH@+UII("]-3" M1$Y4("U$65E$14)51R O3$E"4$%42#HB)4Q) M0B4B(&ME<FYE;#,R+FQI8@T**R @("!S970@0D]/4U1?2D%-7T-#/2(E0D]/ M4U1?2D%-7U1/3TQ3151?4D]/5"5B:6Y<8VPN97AE(B O;F]L;V=O("]'6B O M6FD@+TU,("U$3E0@+419641%0E5'("],24)0051(.B(E3$E")3LB(&ME<FYE M;#,R+FQI8@T*(" @("!S970@0D]/4U1?2D%-7T]05%]*04T]+T9E8F]O='-T M<F%P+B5"3T]35%]*04U?5$]/3%-%5"5<:F%M, T*(" @("!S970@0D]/4U1? M2D%-7T]05%]-2TI!34)!4T4]+T9E8F]O='-T<F%P+B5"3T]35%]*04U?5$]/ M3%-%5"5<;6MJ86UB87-E, T*(" @("!S970@0D]/4U1?2D%-7T]05%]964%# M0STO1F5B;V]T<W1R87 N)4)/3U-47TI!35]43T],4T54)5QY>6%C8S -"D! M("TR,#,L-R K,C S+#<@0$ -"B!I9B B7R5"3T]35%]*04U?5$]/3%-%5"5? M(B ]/2 B7W9C-U\B("@-"B @(" @:68@;F]T(")?)4)/3U-47TI!35]43T], M4T547U)/3U0E7R(@/3T@(E]?(B H#0H@(" @(" @("!S970@4$%42#TE4$%4 M2"4[)4)/3U-47TI!35]43T],4T547U)/3U0E8FEN*0T*+2 @("!S970@0D]/ M4U1?2D%-7T-#/2(E0D]/4U1?2D%-7U1/3TQ3151?4D]/5"5B:6Y<8VPN97AE M(B O;F]L;V=O("]'6B O6FD@+TU,("U$3E0@+419641%0E5'("],24)0051( M.B(E3$E")2(@:V5R;F5L,S(N;&EB#0HK(" @('-E="!"3T]35%]*04U?0T,] M(B5"3T]35%]*04U?5$]/3%-%5%]23T]4)6)I;EQC;"YE>&4B("]N;VQO9V\@ M+T=:("]::2 O34P(a)+41.5" M1%E91$5"54<@+TQ)0E!!5$@Z(B5,24(E.R(@ M:V5R;F5L,S(N;&EB#0H@(" @('-E="!"3T]35%]*04U?3U!47TI!33TO1F5B M;V]T<W1R87 N)4)/3U-47TI!35]43T],4T54)5QJ86TP#0H@(" @('-E="!" M3T]35%]*04U?3U!47TU+2D%-0D%313TO1F5B;V]T<W1R87 N)4)/3U-47TI! M35]43T],4T54)5QM:VIA;6)A<V4P#0H@(" @('-E="!"3T]35%]*04U?3U!4 M7UE904-#/2]&96)O;W1S=')A<"XE0D]/4U1?2D%-7U1/3TQ3150E7'EY86-C M, T*26YD97@Z('1O;VQS+V)U:6QD+VIA;5]S<F,O8G5I;&0N:F%M#0H]/3T] M/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T] M/3T]/3T]/3T]/3T]/3T]/3T]#0I20U,@9FEL93H@+V-V<W)O;W0O8F]O<W0O M8F]O<W0O=&]O;',O8G5I;&0O:F%M7W-R8R]B=6EL9"YJ86TL=@T*<F5T<FEE M=FEN9R!R979I<VEO;B Q+C(T#0ID:69F("UU("UR,2XR-"!B=6EL9"YJ86T- M"BTM+2!T;V]L<R]B=6EL9"]J86U?<W)C+V)U:6QD+FIA;0DR-"!!<'(@,C P M,R Q,3HT,#HS." M,# P, DQ+C(T#0HK*RL@=&]O;',O8G5I;&0O:F%M7W-R M8R]B=6EL9"YJ86T),C@@07!R(#(P,#,@,C,Z-#0Z-3(@+3 P,# -"D! ("TQ M,3<L-R K,3$W+#<@0$ -"B!T;V]L<V5T(&US=F,@8VP@.B O1F4@.B M1 T* M(" @(" Z("]N;VQO9V\@+TU,("]/,B O3V(R("]'>2 O1T8@+T=!("]'0@T* M(" @(" Z("]N;VQO9V\@+TU,9" O1$5"54<@+UHW("]/9" O3V(P#0HM(" @ M(#H@+TQ)0E!!5$@Z)"A,24(Z2CTB("(I(&ME<FYE;#,R+FQI8B [#0HK(" @ M(#H@+TQ)0E!!5$@Z)"A,24(Z2CTB("(I.R!K97)N96PS,BYL:6(@.PT*(",C M(%-U;B!7;W)K<VAO<" V($,K*PT*('1O;VQS970@<W5N<')O($-#(#H@(BUO M("(@.B M1 T*(" @(" Z("US("UF87-T("U/- T*0$ @+3$S-"PW("LQ,S0L M-R! 0 T*('1O;VQS970@=F,W(&-L(#H@+T9E(#H@+40-"B @(" @.B O;F]L M;V=O("]-3" O3S(@+T]B,B O1WD@+T=&("]'02 O1T(-"B @(" @.B O;F]L M;V=O("]-3&0@+T1%0E5'("]:-R O3V0@+T]B, T*+2 @(" Z("],24)0051( M.B0H3$E".DH](B B*2!K97)N96PS,BYL:6(@.PT**R @(" Z("],24)0051( M.B0H3$E".DH](B B*3L@:V5R;F5L,S(N;&EB(#L-"B C(R!635,O3W!E;E9- M4R!$14,@0PT*('1O;VQS970@=FUS(&-C(#H@+T]"2D5#5#T@.B O1$5&24Y% :/0T*(" @(" Z("]35$%.1$%21#U605A##0H` ` end

1 0

Finite State Machine example
by b_trask 28 Apr '03

28 Apr '03

Hello, I am looking at http://www.boost.org/libs/mpl/doc/paper/html/example.html I have a dumb question or perhaps I am missing something (or both). Where is the state_machine class template that the player derives from using the curiously recurring template pattern? class player : state_machine<player> // where is the code for this class? { Regards, Bruce

2 1

enable_shared_from_this and constructor
by Petr Ferschmann 28 Apr '03

28 Apr '03

Hello, why is not possible to call this: -- cut here -- #include <boost/enable_shared_from_this.hpp> class Trida; boost::shared_ptr<Trida> trida; class Trida : public boost::enable_shared_from_this<Trida> { public: Trida() { trida = this->shared_from_this(); }; }; int main() { boost::shared_ptr<Trida> tr(new Trida()); return 0; } -- cut here -- It throws in constructor of shared_count(weak_count const & r). I think the problem is that there is no one shared_ptr instance that owns object tr yet when calling constructor. May be it is BUG (and I don't know how to handle that). Can be at least note in documentation? -- Petr "Fers" Ferschmann -=[ petr(a)ferschmann.cz ]==[ http://petr.ferschmann.cz/ ]=- -=[ Koukni na http://www.postcard.cz/ ]==[ +420 604/781 009 ]=- GPG Fingerprint: [83B0 6378 7A9D D993 035E 60BD FEEC F665 D2C8 1B9A] [Non-text portions of this message have been removed]

2 1

RE: [Boost-Users] Circular Buffer
by Tom Matelich 28 Apr '03

28 Apr '03

I've seen several implementations of things like this come up on the boost mailing list in the past. My impression is a lot of people gave up when confronted with all the different options that would have to be considered to make it through a Boost review. I did see cyclic_buffer.zip in the Files section at the old yahoo group site ( http://groups.yahoo.com/group/boost/files/ ). > -----Original Message----- > From: Joe Mariadassou [mailto:joemar@vcisnet.net] > Sent: Wednesday, April 23, 2003 11:56 PM > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] Circular Buffer > > > Does boost or any other open source have an implementation of > a bounded > circular buffer? My search in boost and google yielded naught. > The main purpose of this container is to pipeline messages in > a typical > producer-consumer scenario. I was surprised not to find any > implementation. > TIA > Joe > > > > [Non-text portions of this message have been removed] > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Get 128 Bit SSL Encryption! > http://us.click.yahoo.com/xaxhjB/hdqFAA/bW3JAA/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/ > > ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

3 3

uBlas - diagonal_matrix
by Patrick Kowalzick 28 Apr '03

28 Apr '03

Dear all, I can use a banded_matrix to represent a diagonal matrix, but while some math for a diagonal matrix is a little bit easier than for a rectangular matrix, it would be nice to have such a type. In my case: I use a SVD A = U * S * V.T to calculate the moore-penrose-inverse A+. Therfore I use A+ = V * S+ * U.T (i do not remember exact, but focus on S+) with S+ as the moore-penrose-inverse of S which is very easy to calculate. but to use something like pinv(S) , do I need a symmetric_matrix type? Or can I implement a pinv() for a banded_matrix wich must fulfil the constraint of being diagonal? Thanks a lot Patrick

3 3

Re: pool_allocator problems on VC7.1 (real rele ase)
by scleary＠jerviswebb.com 26 Apr '03

26 Apr '03

> -----Original Message----- > From: John Harris [mailto:john.harris@tradingtechnologies.com] > > I can test this for you tomorrow (I'm about to go drinking now). In > return, could you possibly tell me how to change pool_allocator so > that it uses my own tag? My goal is to have a totally local > allocator for some special parts of the code. Why, BTW, does it have > to use the Singleton pool interface instead of the object pool > interface? The latter, I think is what I'm after. I'm going to start with a brief overview of the Boost.Pool interfaces: pool<> (pool.hpp): "The" pool interface. Provides allocation and deallocation of memory. object_pool<> (object_pool.hpp): Restricts access to the pool<> interface. Provides allocation and deallocation of memory for a single object type; and, when destroyed, will call the destructor for any non-deallocated objects allocated from that object_pool. singleton_pool<> (singleton_pool.hpp): Provides access to the pool<> interface as a singleton, distinguished mainly by size of the memory allocations and a tag. pool_allocator<> (pool_alloc.hpp): Restricts access to the singleton_pool<> interface. Provides a Standard-compliant Allocator interface. To answer the specific questions: 1) The pool_allocator<> (and fast_pool_allocator<>) can be relatively easily extended to use other tags for the singleton_pool<> interface underlying them - pass an additional template parameter (after the UserAllocator parameter), defaulting to the currently-used tag. This is a good idea, and I'll put it in when I can. 2) pool_allocator<> uses the singleton_pool<> interface instead of the object_pool<> interface for the following reasons: A) Standard Allocators only handle the allocation and deallocation of memory, and do not deal with actual object types [+]. The intent of object_pool<> is to cleanly call destructors for objects that were never deallocated. Such an action: 1) is unneeded (since all containers should free whatever memory they allocate, and destroy any objects they construct), and 2) would cause the Allocator to get into construction/destruction semantics, which is contrary to the Standard Allocator concept. B) Standard-compliant Allocators that can be used with STL-provided containers must be stateless. This requires an underlying singleton interface. Encapsulating a non-singleton interface within the Allocator, or even sharing one with the handle/body idiom does not satisfy the stateless requirement. [+] The object-related Allocator requirements (construct()/destroy()) do not have anything to do with allocation/deallocation, and are generally considered to be a useless overspecification. Please let me know if I haven't been clear enough - I've been a little lacking in sleep lately ;) -Steve

2 1

RE: [Boost-Users] NRVO (was Re: "Correct" way to return empty shared_ptr?)
by dick.bridges＠tais.com 25 Apr '03

25 Apr '03

return shared_ptr<int>(); works with VC6.0 but elicits the [AFAICT] uninformative <emsg>parse error before `;'</emsg> from gcc version 2.96 20000731 (Red Hat Linux 7.3 2.96-110). Drat! "Duane Murphy" <duanemurphy@mac To: "Boost Users" <Boost-Users(a)yahoogroups.com> .com> cc: Subject: RE: [Boost-Users] NRVO (was Re: "Correct" way to return empty shared_ptr?) 04/24/2003 09:40 AM Please respond to Boost-Users --- At Thu, 24 Apr 2003 16:56:40 +0100, Ben Hutchings wrote: <snip> shared_ptr<int> maybe_get_a_pointer() { return shared_ptr<int>(); } is perfectly reasonable and can also be optimized. Is there more recent and complete discussion concerning this optimization? Is naming actually required? ...Duane Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

RE: [Boost-Users] Re: pool_allocator problems on VC7.1 (real rele ase)
by scleary＠jerviswebb.com 25 Apr '03

25 Apr '03

> -----Original Message----- > From: John Harris [mailto:john.harris@tradingtechnologies.com] > > Since it seems to work on VC7.1, it would be nice if the author had > access to that compiler and could do some testing. In the mean time, > I'll try some stuff with this new toy and report any further problems. Some command-line tools ship with their DDK, so I do have a version of "cl.exe" that reports "13.00.9176" - no idea how this fits in with the VC versions, though. And the DDK doesn't include an STL anyway. There is one "common" failure case with some implementations of STL containers: passing 0 to Allocator::deallocate. When used with std::allocator, the 0 is passed through to operator delete() which of course ignores it. When used with pool_alloc, this generally causes a segfault. IIRC, STLPort's std::vector will do this if you construct & destroy an empty vector. Since I don't have the VC STL, could you do that test case for me? Thanks, -Steve

2 2

MP3 and C++
by steelgig 25 Apr '03

25 Apr '03

Hi, I'm working on a project for the university and I'm looking for some C++ library or application that could help me. My goal is to extract some kind of information related to the spectra of a signal coded in MP3. I'm looking for a spectrum analyzer that localizes peaks in the power spectrum (better if it works on a user-specified band) and allows the detection of the temporal occurence of each peak and its intensity. I also need to retrieve some sample of frequency components (or the MDCT coefficients) near the identified peaks. Every suggestion is welcome (even something that satisfies only partially the requests or that indicates a better place to found an answer to this message). Thanks in advance for the help, Gio PS: even some function that works on the MP3 file without decoding it, for example only partial decoding actions (IMDCT, Huffman decoding) or subband value retrieval function, could be useful.

1 0

Circular Buffer
by Joe Mariadassou 24 Apr '03

24 Apr '03

Does boost or any other open source have an implementation of a bounded circular buffer? My search in boost and google yielded naught. The main purpose of this container is to pipeline messages in a typical producer-consumer scenario. I was surprised not to find any implementation. TIA Joe [Non-text portions of this message have been removed]

2 1

Test for endian using MPL or PP(Wave?)
by Mike Wilson 24 Apr '03

24 Apr '03

Hi, There is an application I use that always produces a little endian binary file. I have written a program to process this file. As my program can port to both little/big endian platforms I have a #define (LITTLE_ENDIAN_TARGET) acting as a flag for the necessary byte swapping that is needed on the big-endian platforms. I was wondering if there is a better way to do this, so I searched the Web & boost archives. I found the following code snippet in the boost archives. bool isLittleEndian() { int temp = 1; return (*(char*)&temp) != 0; } which is of some help (eliminating my #define). However, I was wondering if there is a PP or mpl way of testing for endian-ness at compile time. For example, I'd like to do something like the following: const bool IsLittleEndian = ..to be determined automatically..; I've got a gut feeling that I can't do the above at complile time, but maybe something like Wave may do the job? Thanks for any assistance in this matter. Mike

4 4

RE: [Boost-Users] Re: "Correct" way to return empty shared_ptr?
by Ben Hutchings 24 Apr '03

24 Apr '03

dick.bridges(a)tais.com wrote: > This is one of the places where I get *REALLY* confused - the 'real' code > has multiple returns. Apologies: I should have included this psuedo code > in the original example. It looks like this. > > <snippet> > // v is populated somewhere else > typedef vector<shared_ptr<int> > V; > V v; > > shared_ptr<int> maybe_get_a_pointer() > { > shared_ptr<int>::iterator itr; > itr = find_if(v.begin(), v.end(), some_op); > > if(itr != v.end) > return(*itr); > > shared_ptr<int> p; > return(p); > } > </snippet> > > Are compilers supposed to be able to match *itr to p in order to apply the > NRVO? I don't know what you mean by "match *itr to p". The NRVO should be possible for the second return statement, because if p is constructed then it's always returned. However, optimisations are by definition optional so the implementation isn't "supposed to" perform them.

1 0

RE: [Boost-Users] NRVO (was Re: "Correct" way to return emptyshared_ptr?)
by Ben Hutchings 24 Apr '03

24 Apr '03

Duane Murphy <duanemurphy(a)mac.com> wrote: > --- At Thu, 24 Apr 2003 16:56:40 +0100, Ben Hutchings wrote: > >dick.bridges(a)tais.com wrote: > >> I don't understand C++ well enough to grok a compiler's interpretation of > >> the code, but I seems like I'm creating an extra copy for the return. > ><snip> > > > >Logically the local variable is copied to the the caller, but since the type > >of the returned expression matches the return type the compiler is allowed > >to optimise away that copy, even though the return type has a user-defined > >copy constructor. In this case you always return a certain named variable, > >so the compiler can arrange to construct it in the memory location where the > >caller expects the returned value. This is called the named-return-value > >optimisation, or NRVO. > > I dont want to start any kind of war, and this is a bit off topic, but I > was investigating NVRO and found a few discussions with Scott Meyers that > indicated that naming is not relevant to the optimization. That this: > > shared_ptr<int> maybe_get_a_pointer() > { > return shared_ptr<int>(); > } > > is perfectly reasonable and can also be optimized. > > Is there more recent and complete discussion concerning this > optimization? Is naming actually required? I realise that the implementation is allowed to optimise out the copy whether the return value is named or not. Actually doing so requires quite different treatment of the two cases, so it's worth considering them as separate optimisations. For NRVO to be possible at some return statement, there must not be any return statements reachable after the construction of the returned object that return any other object. The optimisation involves changing the code generated for the definition of the object, rather than the code for the return statement. So the implementation has to consider the whole function when doing this. Anonymous RVO is a very local optimisation, so it should require less work to apply.

1 0

RE: [Boost-Users] Re: "Correct" way to return empty shared_ptr?
by dick.bridges＠tais.com 24 Apr '03

24 Apr '03

This is one of the places where I get *REALLY* confused - the 'real' code has multiple returns. Apologies: I should have included this psuedo code in the original example. It looks like this. <snippet> // v is populated somewhere else typedef vector<shared_ptr<int> > V; V v; shared_ptr<int> maybe_get_a_pointer() { shared_ptr<int>::iterator itr; itr = find_if(v.begin(), v.end(), some_op); if(itr != v.end) return(*itr); shared_ptr<int> p; return(p); } </snippet> Are compilers supposed to be able to match *itr to p in order to apply the NRVO? "Ben Hutchings" <ben.hutchings@businesswebso To: <Boost-Users(a)yahoogroups.com> ftware.com> cc: Subject: RE: [Boost-Users] Re: "Correct" way to return empty shared_ptr? 04/24/2003 08:56 AM Please respond to Boost-Users dick.bridges(a)tais.com wrote: > I don't understand C++ well enough to grok a compiler's interpretation of > the code, but I seems like I'm creating an extra copy for the return. <snip> Logically the local variable is copied to the the caller, but since the type of the returned expression matches the return type the compiler is allowed to optimise away that copy, even though the return type has a user-defined copy constructor. In this case you always return a certain named variable, so the compiler can arrange to construct it in the memory location where the caller expects the returned value. This is called the named-return-value optimisation, or NRVO. 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: "Correct" way to return empty shared_ptr?
by Ben Hutchings 24 Apr '03

24 Apr '03

dick.bridges(a)tais.com wrote: > I don't understand C++ well enough to grok a compiler's interpretation of > the code, but I seems like I'm creating an extra copy for the return. <snip> Logically the local variable is copied to the the caller, but since the type of the returned expression matches the return type the compiler is allowed to optimise away that copy, even though the return type has a user-defined copy constructor. In this case you always return a certain named variable, so the compiler can arrange to construct it in the memory location where the caller expects the returned value. This is called the named-return-value optimisation, or NRVO.

2 1

Re: [Boost-Users] Re: "Correct" way to return empty shared_ptr?
by dick.bridges＠tais.com 24 Apr '03

24 Apr '03

I don't understand C++ well enough to grok a compiler's interpretation of the code, but I seems like I'm creating an extra copy for the return. Oh well, if the snippet seems ok, far be it from me to throw asparagus on it. ;) Thanks for the help. "Edward Diener" <eddielee@tropic To: boost-users(a)yahoogroups.com soft.com> cc: Sent by: news Subject: [Boost-Users] Re: "Correct" way to return empty shared_ptr? <news(a)main.gmane .org> 04/23/2003 05:47 PM Please respond to Boost-Users dick.bridges(a)tais.com wrote: > What is the 'correct' way to return a NULL/empty shared_ptr? For > example, this works > > <snippet> > shared_ptr<int> maybe_get_a_pointer() > { > shared_ptr<int> p; > return(p); > } > </snippet> > > but seems 'klunky'. I've clearly missed something in the > docs/examples somewhere. Can someone point me in the right direction? What is klunky about it ? It seems pretty normal to me. Another other possibility is to passed a reference to a shared_ptr<> and have your function above fill it in with an actual pointer to int and return a bool true if it succeeded or false if it did not. Another possibility is to use boost::optional<>. Another one to pass back a bool,shared_ptr<> std::pair or boost::tuple. But I prefer the method you used originally. 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

uBlas Lapack binds from Sandbox - VC6 workaround
by geert_ceuppens 24 Apr '03

24 Apr '03

As an introduction; my goal is to link together the uBlas matrix/vector classes with the Intel MKL library (I looked at ATLAS, but the Lapack coverage was insufficient). I have tried the bindings code in the Boost Sandbox (on which Toon and Kresimir are working), but VC6 falls over. I managed to work around the partial template specialisation problem (see my previous postings), thanks to Kresimir's and Toon's feedback. There is however one remaining question I need some help with. First the question; after that I post all the code which I've hacked together to assist other interested users using VC6. Due to my ignorance, I am obliged to pass the orientation as a template parameter to the matrix_traits class. What I would like to do is to obtain this information from the matrix class directly. The issue is that matrix_type::functor_type does not exist for all matrix classes. For example, hermitian, triangular and symmetrix matrix use matrix_type::functor2_type to store the orientation of the matrix. With a good compiler (i.e. *NOT* VC6), one could specialise matrix_traits for these matrix classes (at least that is what I think - but this isn't done yet in the ublas_matrix.hpp file in the Sandbox), here however I'm stuck. As a hack, I allow the orientation to be passed as a template parameter. Is there a better way to do this (the matrix class M knows the orientation already)? // M is type of matrix, RC is the row/column orientation template <typename M, // type of matrix typename RC = boost::numeric::ublas::row_major> struct matrix_traits { public: typedef RC row_column_major; typedef M matrix_type; ... static int stride1 (matrix_type& m) { //return matrix_type::functor_type::one1 (m.size1(), m.size2 ()); return row_column_major::one1 (m.size1(), m.size2()); } ... }; Here is the code I wrote: ---------------------//---------------------- traits.h: // (-*- C++ -*- header) /* * * Copyright (c) Kresimir Fresl and Toon Knapen 2002 * * Permission to copy, modify, use and distribute this software * for any non-commercial or commercial purpose is granted provided * that this license appear on all copies of the software source code. * * Authors assume no responsibility whatsoever for its use and makes * no guarantees about its quality, correctness or reliability. * * First author acknowledges the support of the Faculty of Civil * Engineering, University of Zagreb, Croatia. * * --> Modified/simplified for VC6 */ #ifndef BOOST_NUMERIC_BINDINGS_TRAITS_TRAITS_HPP #define BOOST_NUMERIC_BINDINGS_TRAITS_TRAITS_HPP #include <cstddef> //namespace boost { namespace numeric { namespace bindings { namespace traits { // vector_traits<> base: // .. implementation -- do not use it directly template <typename V, typename T = typename V::value_type> struct default_vector_traits { typedef T value_type; typedef T* pointer; // assumption: iterator==pointer // .. e.g. ublas::(un)bounded_array static pointer storage (V& v) { return v.begin(); } static const T* storage (const V& v) { return v.begin(); } static int size (V& v) { return v.size(); } static int size (const V& v) { return v.size(); } static int stride (V& v) { return 1; } static int stride (const V& v) { return 1; } }; // vector_traits<> generic version: template <typename V> struct vector_traits : default_vector_traits<V> {}; // matrix structure tags: struct general_t {}; struct symmetric_t {}; struct symmetric_packed_t {}; struct hermitian_t {}; struct hermitian_packed_t {}; // triangular, banded etc. struct unknown_structure_t {}; /* // matrix_traits<> generic version: template <typename M> struct matrix_traits { // typedefs: // matrix_structure // value_type // pointer // ordering_type // static functions: // pointer storage() // int storage_size() // int size1() // int size2() // int leading_dimension() // not all matrix types // symmetric/hermitian typedefs: // uplo_type }; */ // storage ordering tags: struct row_major_t {}; struct column_major_t {}; // upper/lower tags: struct upper_t {}; struct lower_t {}; // free accessor functions: template <typename VectorT> inline typename vector_traits<VectorT>::pointer vector_storage (VectorT& v) { return vector_traits<VectorT>::storage (v); } template <typename VectorT> inline int vector_size (VectorT& v) { return vector_traits<VectorT>::size (v); } template <typename VectorT> inline int vector_stride (VectorT& v) { return vector_traits<VectorT>::stride (v); } // All the matrix_traits<MatrixT> code has been removed here ... }}}} #endif // BOOST_NUMERIC_BINDINGS_TRAITS_TRAITS_HPP ---------------------//---------------------- ublas_matrix.h: // (-*- C++ -*- header) /* * * Copyright (c) Kresimir Fresl and Toon Knapen 2002 * * Permission to copy, modify, use and distribute this software * for any non-commercial or commercial purpose is granted provided * that this license appear on all copies of the software source code. * * Authors assume no responsibility whatsoever for its use and makes * no guarantees about its quality, correctness or reliability. * * First author acknowledges the support of the Faculty of Civil * Engineering, University of Zagreb, Croatia. * * --> Modified/simplified for VC6 */ #ifndef BOOST_NUMERIC_BINDINGS_TRAITS_UBLAS_MATRIX_H #define BOOST_NUMERIC_BINDINGS_TRAITS_UBLAS_MATRIX_H #include <boost/numeric/ublas/matrix.hpp> #include "traits.h" namespace boost { namespace numeric { namespace bindings { namespace traits { // Need to find a way to extract the orientation class (row / column) template <typename M, // type of matrix typename RC = boost::numeric::ublas::row_major> // row or column major struct matrix_traits { public: typedef RC row_column_major; typedef general_t matrix_structure; typedef M::value_type value_type; typedef M::value_type *pointer; typedef M matrix_type; static pointer storage (matrix_type& m) { typedef typename matrix_type::array_type array_type; return vector_traits<array_type>::storage (m.data()); } static const value_type *storage (const matrix_type& m) { typedef typename matrix_type::array_type array_type; return vector_traits<array_type>::storage(m.data()); } static int size1 (matrix_type& m) { return m.size1(); } static int size1 (const matrix_type& m) { return m.size1(); } static int size2 (matrix_type& m) { return m.size2(); } static int size2 (const matrix_type& m) { return m.size2(); } static int storage_size (matrix_type& m) { return size1 (m) * size2 (m); } static int storage_size (const matrix_type& m) { return size1 (m) * size2 (m); } // stride1 == distance (m (i, j), m (i+1, j)) static int stride1 (matrix_type& m) { //return matrix_type::functor_type::one1 (m.size1(), m.size2 ()); return row_column_major::one1 (m.size1(), m.size2()); } static int stride1 (const matrix_type& m) { //return matrix_type::functor_type::one1 (m.size1(), m.size2 ()); return row_column_major::one1 (m.size1(), m.size2()); } // stride2 == distance (m (i, j), m (i, j+1)) static int stride2 (matrix_type& m) { //return matrix_type::functor_type::one2 (m.size1(), m.size2 ()); return row_column_major::one2 (m.size1(), m.size2()); } static int stride2 (const matrix_type& m) { //return matrix_type::functor_type::one2 (m.size1(), m.size2 ()); return row_column_major::one2 (m.size1(), m.size2()); } static int leading_dimension (matrix_type& m) { //return matrix_type::functor_type::size2 (m.size1(), m.size2 ()); return row_column_major::size2 (m.size1(), m.size2()); } static int leading_dimension (const matrix_type& m) { //return matrix_type::functor_type::size2 (m.size1(), m.size2 ()); return row_column_major::size2 (m.size1(), m.size2()); } }; }}}} #endif ---------------------//---------------------- boost_mkl_lapack.cpp: namespace ublas = boost::numeric::ublas; #ifdef BOOST_MSVC #pragma warning (disable: 4355) #pragma warning (disable: 4503) #pragma warning (disable: 4786) #endif #define BOOST_UBLAS_USE_EXCEPTIONS #include <iostream> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/symmetric.hpp> #include <vector> // Intel MKL Lapack #include <mkl/include/mkl_lapack64.h> #include "ublas_matrix.h" // To make life easiertypedef ublas::matrix<double,ublas::row_major> Matrix; typedef std::vector<int> IntVector; template<class M> int getrf(M& a, IntVector& ipiv) { typedef matrix_traits<M> mtraits; typedef vector_traits<IntVector> vtraits; int m = a.size1(); int n = a.size2(); assert(ipiv.size() == (m < n ? m : n)); double *aStorage = mtraits::storage(a); int lda = mtraits::leading_dimension(a); int *ipivStorage = vtraits::storage(ipiv); int info; // return status dgetrf(&m, &n, aStorage, &lda, ipivStorage, &info); return info; } template<class M> int getrs(const M& a, const IntVector& ipiv, M& b, char trans = 'N' ) { typedef matrix_traits<M> mtraits; typedef vector_traits<IntVector> vtraits; int m = a.size1(); int n = a.size1(); assert(ipiv.size() == (m < n ? m : n)); // Note: we need to cast away the const for a and ipiv double *aStorage = const_cast<double*>(mtraits::storage(a)); double *bStorage = mtraits::storage(b); int lda = mtraits::leading_dimension(a); int ldb = mtraits::leading_dimension(b); int *ipivStorage = const_cast<int*>(vtraits::storage(ipiv)); // if b is column major, take size2 (i.e. columns) int nrhs = mtraits::size1(b); int info; // return status dgetrs(&trans, &n, &nrhs, aStorage, &lda, ipivStorage, bStorage, &ldb, &info); return info; } template <typename M> void init_symm (M& m, char uplo = 'f') { size_t n = matrix_traits<M>::size1 (m); for (size_t i = 0; i < n; ++i) { m(i, i) = n; for (size_t j = i + 1; j < n; ++j) { if (uplo == 'u' || uplo == 'U') m(i, j) = n - (j - i); else if (uplo == 'l' || uplo == 'L') m(j, i) = n - (j - i); else m(i, j) = m(j, i) = n - (j - i); } } } // printing: template <typename M> void print_m (const M& m, char const* ch = 0) { if (ch) std::cout << ch << ":\n"; size_t sz1 = matrix_traits<M>::size1 (m); size_t sz2 = matrix_traits<M>::size2 (m); for (std::size_t i = 0 ; i < sz1 ; ++i) { for (std::size_t j = 0 ; j < sz2 ; ++j) std::cout << m(i, j) << " "; std::cout << std::endl; } // std::cout << std::endl; } // printing: template <typename V> void print_v (V const& v, char const* ch = 0) { if (ch) std::cout << ch << ": "; size_t sz = vector_traits<V>::size (v); for (std::size_t i = 0; i < sz; ++i) std::cout << v[i] << " "; std::cout << std::endl; } using std::size_t; void main(void) { size_t n = 3; Matrix a(n, n), acopy(n, n); IntVector ipiv(n); init_symm(a); acopy = a; print_m (a, "A"); // Now factor int status = getrf(a, ipiv); print_v(ipiv, "ipiv"); print_m (a, "A"); // The solution (and the right hand side) are row oriented size_t nrhs = 2; Matrix b(nrhs, n), x(nrhs, n); int i; for(i = 0; i < n; i++) { x(0,i) = (double)i + 1; x(1,i) = (double)i + 4.0; } b = ublas::trans(ublas::prod(acopy, ublas::trans(x))); print_m (b, "b original"); print_m (x, "x original"); status = getrs (a, ipiv, b); // solve from factorization print_m (b, "X"); std::cout << std::endl; // Now try the same for a symmetrix matrix ublas::symmetric_matrix<double, ublas::lower> ml(n, n); init_symm(ml); print_m(ml, "symmetric matrix"); status = getrf(ml, ipiv); print_v(ipiv, "ipiv"); print_m (a, "A"); } You will need your project settings to be such that you link with the Intel lib files and the DLL should be in your path (see Intel MKL documentation). Your link tab in project/settings should contain (the lib directory is set using tools/options, same for the include): mkl_c.lib mkl_p3.lib mkl_lapack.lib You may want to do this in a different namespace than the boost namespace (I actually commented out all the namespace stuff above, but reintroduced it in this posting - if it does not compile, than that's probably the reason). More binds to Lapack still need to be done, but this is a start already. Geert

2 1

Intel compiler (7.0), STLport (4.3.5) and Boost?
by Andre du Toit 24 Apr '03

24 Apr '03

Is it possible to build bjam and the boost libraries using the Intel compiler (7.0) in conjunction with STLport(4.3.5) under Windows (2000)? If not, please tell me and do not bother reading the rest of this email! I did manage to build bjam and the boost libraries using msvc-stlport toolset, but we use the Intel compiler in conjunction with STLport for our Windows applications. Now I know I can't just start using the Intel compiler with source using boost libraries which were built with a different toolset (or could I?). I get a number of errors regarding multiple definitions of ptime iostream operators. But before I present the exact error messages, I would like to clear up the Intel + STLport issue. I would appreciate any suggestions. Greetings, Andre.

1 0

VC7 internal compiler error in mpl using graph & spirit
by Julius Muschaweck 24 Apr '03

24 Apr '03

Hi, with VC 7.0, with both boost_1_30 and the current CVS, and with both release and debug mode, #include <boost/graph/adjacency_list.hpp> #include <boost/spirit/core.hpp> gives an Internal Compiler Error 1001 at line 52 of h:\jmj\C++\Include\boost_1_30_0\boost\mpl\aux_\preprocessed\msvc70\apply.hpp while the error disappears when changing the order of the include files. I can live with the workaround of course, but maybe someone in charge of mpl would like to go after this. Regards, Julius

1 0

RE: [Boost-Users] Sorting list < shared_ptr < foo > > using std::list::sort()
by Ben Hutchings 24 Apr '03

24 Apr '03

heath_r_davis <1heathdavis(a)msn.com> wrote: > I have experienced some difficulty with sorting lists of type: > > list < shared_ptr < foo > > <snip> You need to specify your own ordering predicate, because shared_ptr<T>::operator< does *not* call T::operator< . Also remember that if operator< is a member function it should be const.

1 0

uBlas matrix - storage class
by geert_ceuppens 24 Apr '03

24 Apr '03

Is there a performance difference between the different storage classes for matrix and vector? If so, which one is the most performant? I could not find any reference to this in the documentation ... :^( Many thanks - Geert

2 1

"Correct" way to return empty shared_ptr?
by dick.bridges＠tais.com 24 Apr '03

24 Apr '03

What is the 'correct' way to return a NULL/empty shared_ptr? For example, this works <snippet> shared_ptr<int> maybe_get_a_pointer() { shared_ptr<int> p; return(p); } </snippet> but seems 'klunky'. I've clearly missed something in the docs/examples somewhere. Can someone point me in the right direction? TIA

2 1

RE: [Boost-Users] Re: pool_allocator problems on VC7.1 (real release)
by Ben Hutchings 23 Apr '03

23 Apr '03

John Harris <john.harris(a)tradingtechnologies.com> wrote: > Ben Hutchings wrote: > > I compiled almost the exact same code: > > > > #include <boost/pool/pool_alloc.hpp> > > #include <map> > > #include <utility> > > > > typedef std::basic_string<char, std::char_traits<char>, > > boost::pool_allocator<char> > t; > > > > int main() > > { > > std::map<t, t, std::less<t>, > > boost::pool_allocator<std::pair<const t, t> > > m; > > } > > > > with VC++ 7.0 and Boost 1.29, and got no warnings or errors at all. > > > > Ah, yes, that works for me, too (no warning, either), but try adding > a line of code that actually uses the map, like this: > > m["abc"] = "def"; > > and you get the following cascade of errors: <snip> Which all indicates that operator< is not defined for t, because we didn't include <string>. Let's not be so quick to blame the compiler. VC++ 7 is a long way ahead of version 6.

2 1

Sorting list < shared_ptr < foo > > using std::list::sort()
by heath_r_davis 23 Apr '03

23 Apr '03

I have experienced some difficulty with sorting lists of type: list < shared_ptr < foo > > Here is the expected (sorted) program output: 424238335 596516649 719885386 846930886 1189641421 1649760492 1681692777 1714636915 1804289383 1957747793 Instead, I end up with: 1804289383 846930886 1681692777 1714636915 1957747793 424238335 719885386 1649760492 596516649 1189641421 Below is the code in question: //////////////////////////////////////////////// #include <iostream> #include <list> using namespace std; #include <boost/shared_ptr.hpp> using namespace boost; //////////////////////////////////////////////// class my_class { public: int m_val; public: my_class(); bool operator<(const my_class&); void Display(); }; //////////////////////////////////////////////// my_class::my_class() { m_val = rand(); } bool my_class::operator<(const my_class& arg) { return m_val < arg.m_val; } void my_class::Display() { cout << m_val << "\n"; } //////////////////////////////////////////////// int main( int argc, char **argv ) { // list < my_class > my_list; // list < my_class >::iterator my_iter; list < shared_ptr < my_class > > my_list; list < shared_ptr < my_class > >::iterator my_iter; //populate my_list for (int x=0; x<10; x++) { // my_class tmp_obj; shared_ptr < my_class > tmp_obj; tmp_obj.reset(new my_class); my_list.push_back(tmp_obj); } //sort the list my_list.sort(); //display contents of my_list my_iter = my_list.begin(); while (my_iter != my_list.end()) { // (*my_iter).Display(); (*my_iter)->Display(); ++my_iter; } return 0; } //////////////////////////////////////////////// Thanks in advance for any help you may render...

1 0

RE: [Boost-Users] Problems linking with Boost 1.29.0 thread lib, Linux/g++ 3.2.2 -r2
by Ben Hutchings 23 Apr '03

23 Apr '03

subsample <knuarv(a)nith.no> wrote: > Failing to link a program with libboost_thread, even though I supply > the -lboost_thread directive in the makefile. I'm kind of new to > makefiles, having only used Visual C++ in Windows untill recently. I > 've tried changing things around a bit, doesn't help. A minimal test > program I wrote links fine with boost_thread though. My makefile looks > like this: > CC=g++ > CFLAGS=-g > LDFLAGS=-L/home/sub/Libs/alsa/lib -lasound -lboost_thread -lpthread > > alsatest: alsatest.o > $(CC) $(LDFLAGS) -o alsatest SmallObj.o alsatest.o <snip> ld doesn't work this way. -l is just a shortcut for finding a library file. The libraries specified with -l are part of the file list, same as the object files and any library files specified by their full file name. The nasty thing is that backwards references are only resolved in object files, not in library files, so library files must be listed after the object files (and any other library files) that reference them. You need to take the libraries from LDFLAGS (perhaps into another variable) and put them at the end of the command line. Also you should be using CXX and CXXFLAGS for compiling C++ code, not CC and CFLAGS. Since you're building a pthreads program, you *must* define the macro _REENTRANT to get a threadsafe C library. As a shortcut, include -pthread in CXXFLAGS (this causes linking with -lpthread, too).

2 1

RE: [Boost-Users] pool_allocator problems on VC7.1 (real release)
by Ben Hutchings 23 Apr '03

23 Apr '03

John Harris <john.harris(a)tradingtechnologies.com> wrote: > scleary(a)jerviswebb.com wrote: > > John - > > > > Sorry, Boost.Pool does not currently support MSVC, due to that compiler's > > extreme lack of template support. > > > > I also tried this on the real released VC7.1 (which has been on MSDN > subscriber downloads for a couple of weeks, now), and, while it > compiles, I get warnings that point me to some code that looks like > it's losing precision (size_type reduced to bool) in a calculation. VC++ has produced that warning for a while now, and it's totally bogus. Notice that it's a "performance warning" not an "are you sure this is that you want?" warning, and it's being generated here for *casts* not implicit conversions. <snip> > Another test I tried was a map<string,string>, actually declared like > this: > > typedef > std::basic_string<char,std::char_traits<char>,boost::pool_allocator<ch > ar> > t; > std::map<t, t, std::less<t>, boost::pool_allocator<std::pair<const t, > t> > > m; > > ...and got these errors: <snip> I compiled almost the exact same code: #include <boost/pool/pool_alloc.hpp> #include <map> #include <utility> typedef std::basic_string<char,std::char_traits<char>,boost::pool_allocator<char > > t; int main() { std::map<t, t, std::less<t>, boost::pool_allocator<std::pair<const t, t> > > m; } with VC++ 7.0 and Boost 1.29, and got no warnings or errors at all. The command line was: cl /D__WIN32__ /EHsc /I"c:\program files\boost" test.cpp I repeated this with Boost 1.30 and again got no warnings or errors. I don't have VC++ 7.1 to hand, but I would be surprised if it broke anything that worked in 7.0.

2 1

Signal/Slot copy semantics.
by Jesper Bojesen 23 Apr '03

23 Apr '03

I have a problem with the sematics of the the signal connect method. Consider this simple program: #include <iostream> #include <boost/signal.hpp> struct HelloWorld { void operator()() const { std::cout << "Hello, World!, the parallel world exist at " << (void *) this << std::endl; } }; int main () { // Connect a HelloWorld slot HelloWorld hello; std::cout << "Main world at " << (void *) &hello << std::endl; boost::signal<void ()> sig; sig.connect(hello); sig (); std::cout << "Thats all folks!\n"; return 0; } It produces this output: >Main world at 0xbffff2e0 >Hello, World!, the parallel world exist at 0x8056128 >Thats all folks! My problem is that the object signalled is not the same object that I subscribed to the signal. Is this really what was inteded ? Is the any rationale behind this behaviour ? -- Jesper Bojesen Medical Insight Email: jbb(a)medical-insight.com Phone mobile: (+45) 40 99 55 03 Phone direct: (+45) 46 55 04 42 Fax: (+45) 46 55 11 66

3 5

UBLAS and algorithms
by David Johnson 23 Apr '03

23 Apr '03

Hi, I'm looking to solve some matrix problems using conjugate gradient methods. CGS and GMRES to name a couple. I see where the matricies can be stored by the UBLAS classes, but I don't see any of the algorithms available in boost. Are they available somewhere? I've looked at packages like IML++ and see them there, but they appear to use different storage classes. Can anyone point me in the direction of where some boost compatible algorithms are? Thanks, Dave

1 0

RE: pool_allocator problems on VC7.1 (real release)
by scleary＠jerviswebb.com 23 Apr '03

23 Apr '03

> -----Original Message----- > From: John Harris [mailto:john.harris@tradingtechnologies.com] > I also tried this on the real released VC7.1 (which has been on MSDN > subscriber downloads for a couple of weeks, now), and, while it > compiles, I get warnings that point me to some code that looks like > it's losing precision (size_type reduced to bool) in a calculation. > The pool code about which the following warnings complain: > > const size_type num_chunks = total_req_size / partition_size + > static_cast<bool>(total_req_size % partition_size); > The cast is intentional. The intent is to add one if the result of the modulus is non-zero. I don't know why the compiler is producing warnings, since I'm using an explicit cast. > Another test I tried was a map<string,string>, actually declared like > this: I'm having a hard time deciphering the compiler errors (I'm not used to MSVC errors), but it looks like it might be a problem in the STL. Have you tried this with STLPort? > If you have an example of a map<string,string> using pool_allocator > that compiles on VC7.1, I'd *love* to see it. That's all I'm really > after, here. Is MSVC available for download for non-MSDN subscribers? If so, I can download it and try to get it working. -Steve

2 1

Trouble grokking iterator adaptors
by Kris Braun 23 Apr '03

23 Apr '03

Hi there, I could really use the features provided by iterator adaptors part of the library, but I'm having a lot of trouble getting a nested set of adaptors to compile. In one case, I'd like to return an iterator into std::map< std::string, boost::shared_ptr< ApiOption > >, and have it return references to options in which option->isTemplate( ) is false. Conceptually, I'd like a filter_iterator->indirect_iterator- >projection_iterator chain. I've been using this typedef to project onto the second member of the pair: typedef boost::projection_iterator_pair_generator< select_second< std::string, boost::shared_ptr< ApiOption > >, OptionMap::iterator, OptionMap::const_iterator > OptionMapIterators; but I've been at a loss to add indirect_iterator and filter_iterator into the mix. Can anyone help me get unstuck? Thank you in advance, Kris

5 7