- 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, … [View More]

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() … [View More]

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: ―--- .… [View More]

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: > … [View More]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 [View Less]

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. … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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. … [View More]

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: … [View More]

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 … [View More]

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 … [View More]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/ [View Less]

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 "… [View More]

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 … [View More]

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] … [View More]

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" … [View More]

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,… [View More]

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. > > > > &… [View More]

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/… [View More]

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<… [View More]

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&… [View More]

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.… [View More]

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&… [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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, , … [View More]

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. … [View More]

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 … [View More]

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 … [View More]

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 <… [View More]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 ----------------------------------------------------------------------------- [View Less]

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...&… [View More]

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& … [View More]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] [View Less]

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 … [View More]

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 … [View More]

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, --… [View More]

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 > … [View More]

1 0