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

Re: [Boost-Users] Re: Thread library: get thread id
by dick.bridges＠tais.com 18 Dec '02

18 Dec '02

<alternative exemplar> When I implemented the Leader-Follower thread pattern described by Schmidt, et al in Pattern-Oriented Software Architecture, I couldn't figure out a way around comparing the thread id to the current leader in the promote_new_leader function. Probably lack of imagination and/or experience on my part, but having the thread id sure made it easier. </alternative exemplar> "William E. Kempf" To: <Boost-Users(a)yahoogroups.com> <wekempf(a)cox.net cc: > Subject: Re: [Boost-Users] Re: Thread library: get thread id 12/16/2002 01:20 PM Please respond to Boost-Users olivier_debels said: > --- In Boost-Users(a)yahoogroups.com, "William E. Kempf" <wekempf@c...> > wrote: >> >> olivier_debels said: >> > >> > I'm using boost_1_29_0 and need to get the id of the current > thread. >> >> Why? >> > I have several threads which pop messages from the queue. I want to > keep track of what each thread pops (depending on some rules) without > adding an extra parameter (threadId) in the pop-function. I don't follow this. > By this way threads just call the pop-function (they don't know > anything about the internal cooking of the queue). They get a > message, which fulfills the rules (one of the rules is f.e. that no > two threads can handle the same message at the same time). How does a thread id figure into this? What little of this description I understand gives no need for a thread id. 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/

3 4

switching to BGL
by Daniel Varga 18 Dec '02

18 Dec '02

Hi, I'm planning to throw away my own little undirected graph implementation in favor of Boost Graphs. My implementation is based on an STL map< Node,set<Node> > adjecency map. I see that it's very easy to get the same functionality using the BGL adjecency_list. But what I really like about my implementation is that I have const set<Node>& Graph::lookupNeighbours(const Node&) const; This means that in no time I can get a _container_ of the neighbours, and not just a pair of iterators. Of course teoretically they are equivalent. But I want to rewrite as little code as possible, so I would like to wrap my old graph interface around the Boost Graph. (Not hiding its own, better interface, of course. :) ) Should I write a wrapper container class simulating const set<Node>? Or does adjecency_list expose the very same const set<Node>& for me?

1 0

Threads question
by Martin Johnson 18 Dec '02

18 Dec '02

Hi, This has probably been asked before. I cant find doco giving detail. So excuse me if this is old topic. I am involved with GPL project that uses boost::threads. I have a problem understanding implementation and what threadmon.dll is for. I see that the code is attempting to manage tss stuff. How is the tss stuff managed when lib is a static link under win32? Is it correct that if I wish to static link that I need this other threadmon.dll as well. Has it been suggested that structured exceptions can perform the same function on win32 with a finally() handler from within thread_proxy? This is a gurantee of invocation. The cleanup attempt could though win32 doco states cleanup is guranteed, though couldnt a lib global could easily handle main thread cleanup? Regards Martin Johnson

2 1

Thread library: get thread id
by olivier_debels <olivier_debels＠yahoo.com> 17 Dec '02

17 Dec '02

I'm using boost_1_29_0 and need to get the id of the current thread. Is there a way to get the id of the current thread using boost? I don't see how I can access the current thread (Is there some sort of current function?). If I could access the current thread, I could write a getId() function (in a class subclassed from boost::thread). Only problem there is the return type. It seems the id is an int in windows environment, a pthread_t in POSIX and a MPTaskID in MACOS. Those last two seems to be pointers to struct. I guess it is possible to cast all of them to long (using reinterpret casting), but maybe I am overlooking something then. thanks, Olivier.

4 7

Issues on getting the reference of the held value of boost::any
by Seishi Onishi <looper2k＠yahoo.com> 17 Dec '02

17 Dec '02

I'm using a collection of boost::any for the variable container class which has this map member. std::map<std::string, boost::any> m_collection; As you imagine, the container class can keep anything even the container class itself recursively. You know, an boost::any may hold copy expensive object. So I need a method to get the reference of the value held in boost::any not to make the expensive copy. But I found that the current any_cast implementation was not well support the reference. Issue 1: The following code causes compiler error on VC6&7. boost::any dany = double(1.2); double& rd = boost::any_cast<double>(dany); Issue 2: The following code works but one copy constructer called. class Foo foo; boost::any fany( foo ); class Foo& rfoo = boost::any_cast<class Foo>(fany); Actually, I found the way to sneak out of the issues. double& rd = *boost::any_cast<double>(&dany); class Foo& rfoo = *boost::any_cast<class Foo>(&fany); But the problem is these codes won't throw bad_any_cast. And I also wonder this *any_cast usage may not be the way the developer supposed. So I expect that the current any_cast code will be changed to well support the reference access. It can be, template<typename ValueType> const ValueType& any_cast(const any & operand) { const ValueType * result = any_cast<ValueType>(&operand); if(!result) throw bad_any_cast(); return *result; } template<typename ValueType> ValueType& any_cast(any & operand) { ValueType * result = any_cast<ValueType>(&operand); if(!result) throw bad_any_cast(); return *result; } -Seishi

1 0

[Boost-Users][BGL] Permutation of a graph
by Paolo Fosser 17 Dec '02

17 Dec '02

Hi all, I'm using BGL in some graph matching algorithms. Now I have to shuffle a bit one of the graphs I'm comparing. I think it all ends up in considering the nodes in a different order when cycling on them. (BTW am I right?). So my question: is there an elegant way to do this in BGL? The only solution that comes into my mind is to build up a map from the range of vertex descriptors to a permutation of them. TIA, Paolo -- Do you want to live forever? Alex Chiu has invented a device which will give you physical immortality. Click here! http://www.alexchiu.com/affiliates/clickthru.cgi?id=pfosser

2 3

testing if shared_ptr has been assigned
by TEA Hartmann, Steven 16 Dec '02

16 Dec '02

I need some help in testing for the condition of whether a shared_ptr has been assigned. In the following example, the "if( b != NULL ) does not work. How would I do this test? typedef boost::shared_ptr<int> IPtr; int i( 0 ); IPtr a( i ); IPtr b; if( some condition ) b = a; if( b != NULL ) { // How should this really be coded? } Best Regards, Steve [Non-text portions of this message have been removed]

5 4

Borland: Cannot generate template specialization
by Felix E. Klee 16 Dec '02

16 Dec '02

Hi, I'm trying to compile C++ code that uses the boost/numeric/ublas matrix library with the Kylix C++ Compiler (BC++ 5.7 for LINUX). However, I get several error messages, among them: Error E2299 boost_1_29_0/boost/numeric/ublas/matrix.hpp 522: Cannot generate template specialization from 'container_reference<C>' in function matrix<complex<double>,row_major,unbounded_array<complex<double> > >::iterator1::iterator1(matrix<complex<double>,row_major,unbounded_array<complex<double> > > &,complex<double> * const &) Any ideas how to work around this problem? Felix

3 4

Use vc7 toolset for VC7.1?
by Dick Bridges 16 Dec '02

16 Dec '02

Is there a VC7.1-specific toolset or should I continue to use the vc7 toolset? I'd like to avoid the VC6 and VC7.0 workarounds if possible.

2 1

Building problems with regex on a SuSE 8.1 installation
by beat.schaer＠ruag.com 15 Dec '02

15 Dec '02

Hi I tried to compile boost 1.29.0 on a SuSE 8.1 machine and got the following error: gcc-C++-action libs/regex/build/bin/libboost_regex.so/gcc/release/runtime-link-dynamic/shar ed-linkable-true/cregex.o /home/adtsbuilder/boost_1_29_0/boost/regex/detail/regex_match.hpp: In member function `unsigned int boost::RegEx::GrepFiles(bool (*)(const char*, const boost::RegEx&), const char*, bool, unsigned int)': /home/adtsbuilder/boost_1_29_0/boost/regex/detail/regex_match.hpp:1902: Internal compiler error in expand_call, at calls.c:3049 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://www.gnu.org/software/gcc/bugs.html> for instructions. The used compiler is the one delivered with SuSE 8.1. It is a gcc 3.2. Does anybody knows what the problem might be? Regards Beat

4 3