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

[Thread] How to wait for a thread until it stopped
by Christian Henning 10 Aug '05

10 Aug '05

Hi there, I'm still working on the transistion from an old thread lib to the boost thread lib. I have two threads, the GUI thread and a worker thread. The worker thread is always inside a loop that only breaks if someone set the flag. The GUI thread has from time to time to stop the worker thread. This is currently done by setting a flag ( _bStop ) and the worker thread will eventually stop like: void run() { boost::mutex::scoped_lock oLock( _oRunMutex ); do { ... if( _bStop ) _oRunCondition.wait( oLock ); } while( _bTerminate == false ); } I believe that this implemention can lead to deadlocks. But how can I implement the behavior that the GUI thread will break until the worker thread has stopped. Thanks, Christian

1 0

Question concerning boost::tuples::length (1.33 RC2)
by Daniel Krügler 10 Aug '05

10 Aug '05

(Note: The following contribution is essentially a copy of a former one, which was, due to several administrative problems on my side, probably overlooked by the majority of concerned programers) Dear Boosters, its quite a while that I could participate in this newsgroup, so maybe my request is ol' stuff and has been answered 100 times. In case of that I apologize for the following question: I observe that boost::tuple::length in version 1.32+1.33RC2 exist two template specializations for empty tuples, namely template<> struct length<tuple<> > { BOOST_STATIC_CONSTANT(int, value = 0); }; template<> struct length<null_type> { BOOST_STATIC_CONSTANT(int, value = 0); }; which lead to the unexpected effect that e.g. typedef const tuple<> ConstEmptyTuple; int k = length<ConstEmptyTuple>::value; (modulo namespace issues) does not compile. The reason is obvious, because deduction of boost::tuples::length<ConstEmptyTuple> extracts "const tuple<>", which leads to the generic template definition: template<class T> struct length { BOOST_STATIC_CONSTANT(int, value = 1 + length<typename T::tail_type>::value); }; which does not compile in this case, because const oost::tuples::tuple<> has no tail_type. Similar situations arise for const null_type arguments and corresponding volatile variants thereof. To my humble opinion tuples::length should work independent of cv qualification of the template arguments, but this route should of course be gone in accordance to similar situations of "template predicates" in boost::mp/type_traits. One further indirection and usage of boost::remove_cv<T> could simply resolve the described problem, such as: // Define length_impl + 2 specialisation for tuple<> and null_type as // currently done for length namespace details { template <typename T> struct length_impl { .. // as before; }; template <> struct length_impl<null_type> { .. // as before; }; template <> struct length_impl<tuple<null_type, ...> > { .. // as before; }; } // One single - not specialized - length template handling all cases: template <typename T> struct length { static const int value = details::length_impl< typename ::boost::remove_cv<T>::type >::value; }; What do you think? Greetings from Bremen, Daniel Krügler

1 0

Re: [Boost-users] shared_ptr conundrum
by Timothy Ritchey 10 Aug '05

10 Aug '05

I need to append my comments with a very import observation I just made regarding the shared_ptr issue I am having. I just copied over the binary created on my SMP machine to my UP machine, and it is showing the same problem with releasing the underlying shared pointer resource. I had been compiling the full code on both machines (including the boost threading library dll), and comparing those results, and not actually comparing the results of the same binary. The two machines are: Dell Precision 450 Workstation Dual 2.4Ghz Xeon Processors Windows XP SP2 Visual Studio 2003 Intel 8.1.??? Home Build Single AMD Athlon-64 3200+ Windows XP SP2 Visual Studio 2003 Intel 8.1.025 I just realized I don't know the exact rev of Intel I have on my machine at work, but will check it in the morning. I know it is at least 8.1.019. I seem to be looking at a problem with either SMP vs. UP builds or minor revision changes in the Intel compiler. 8.1.025 being the known working version in this case. Also, I've gotten the same results with 1.32 and 1.33 RC2. Also, thanks for a great library. We have been using it pretty extensively throughout our app; including threading, shared_ptr, spirit, date_time, bind, filesystem and multi_index (there may even be more that I can't think of right now). boost has been great fun to work with. Cheers, tim

1 0

determinant of Matrices
by Vivid Yang 10 Aug '05

10 Aug '05

Hi, I browsed the document of ublas for a long time and did not find a convenient way to compute the determinant of a matrix. Isn't it a basic function of matrix or did I miss something? And are there functions to compute the singular values/vectors of a matrix? How about the inverse of a square full-rank matrix? btw. what is new in the new boost library version 1.33? Vivid

4 3

hash function for edge_descriptor
by Wolfram Koska 09 Aug '05

09 Aug '05

Hello there, I was trying to create hash_maps with vertex_descriptors and edge_descriptors. The first one was easy with vertex_descriptors being just void*'s, and there is even an example in the boost detail namespace (although it's not activated using gcc): template <> struct hash< void* > { std::size_t operator()(void* v) const { return (std::size_t)v; } } But the edge_descriptors give me some serious headache. How could I create a hash function for them? Is using the source and target a good idea in graphs where there could easily be more than one edge between two vertices? Or is there a great method I cannot come up with? I hope that somebody can help me out here :) Thanks, Wolfram Koska

3 5

string algo problem
by Giampiero Gabbiani 09 Aug '05

09 Aug '05

hi to all, I'm trying to implementing a string class as a std::list of elements that can be common char, wchar_t or something else (as utf-16 chars, for example). In order to obtain this, I've defined a collection as a template class, and used with different value_type(s). When I try to use the collection with char or wchar_t, the boost algo to_upper works fine but, when I use the collection template with a UTF16::Char (a class that implements the UTF-16 encoding) I obtain the following exception: Exception catch:St8bad_cast The following code is the definition of the Char class and an example of its use with the standard list and the boost algo: namespace UTF16 { class Char { public: Char(); Char(const char c); // UTF-16 encoding constructor Char(wchar_t v); bool operator == (const Char& c) const; bool operator != (const Char& c) const; operator wchar_t () const; Char(const Char& chr); Char(Char& chr); ~Char(); Char& operator = (const Char& chr); Char& operator = (Char& chr); private: u_int16_t* _value; size_t _size; }; } int main(int argc, char *argv[]) { try { list<UTF16::Char> l; l.push_back(UTF16::Char('a')); // THE FOLLOWING LINE PRODUCES A 'bad_cast' exception... boost::algorithm::to_upper(l); } catch(const exception& error) { cout << "Exception catch:" << error.what() << endl; } catch(...) { cerr << "Unhandled exception.\n"; } return EXIT_SUCCESS; } Is there something wrong/missing in the definition of the Char class? Or maybe the boost string algos are usable only with char and wchar_t? Thanks in advance Giampiero.

2 1

[BGL] connected_components of filtered_graph
by Yoshi Fujiwara 09 Aug '05

09 Aug '05

With boost_1_32_0, i want to find connected components of a filtered graph. What is an appropriate second argument of algorithm, connected_components, which is applied to a filtered graph? The following obviously fails for finding components' ID for each vertex of filtered graph. // Filtered graph Graph g; // graph to be filtered typedef property_map<Graph, vertex_flag_t>::type VertexFlagMap; filter_vertex_flag<VertexFlagMap> v_filter(v_flag); typedef property_map<Graph, edge_flag_t>::type EdgeFlagMap; filter_edge_flag<EdgeFlagMap> e_filter(e_flag); typedef filtered_graph< Graph, filter_edge_flag<EdgeFlagMap>, filter_vertex_flag<VertexFlagMap> > FGraph; FGraph fg(g, e_filter, v_filter); // Connected components std::vector<int> comp(n_fg); int n_comp = connected_components(fg, make_iterator_property_map(comp.begin(), get(vertex_index,fg))); where n_fg is the number of vertices in the filtered graph. Instead make std::vector<int> comp(num_vertices(g)); and iterates over vertices in the filtered graph to see assigned components' ID, it's fine, but then i need to have extra space than necessary when a graph to be filtered is large but the filtered one is quite small. wondering what is appropriate for the second argument in my case. Though i tried to find an example in tutorial samples and checked the ML archive, i could not find a similar question before. i appreciate any help or "look at here". Yoshi

2 1

how can I sign up to get just Boost Graph library messages?
by Aaron Archer 09 Aug '05

09 Aug '05

Does anyone know how I can sign up to receive just messages pertaining to the Boost Graph library? On the Boost-users mailing list membership configuration page, there is an option to filter the messages by topic categories, but it says "no topics defined" and has no obvious place to click, so I can't figure out how to use this option.

2 1

Re: [Boost-users] [multi_index] - iterator validity?
by JOAQUIN LOPEZ MU?Z 09 Aug '05

09 Aug '05

----- Mensaje original ----- De: Stuart Dootson <stuart.dootson(a)gmail.com> Fecha: Martes, Agosto 9, 2005 2:26 pm Asunto: Re: [Boost-users] [multi_index] - iterator validity? > On 8/9/05, JOAQUIN LOPEZ MU?Z <joaquin(a)tid.es> wrote: [...] > > So, you can see stability is referred to in the reference > > section of each type of index. For instance, for ordered indices > > stability is (succintly) stated in > > > > > http://boost.org/libs/multi_index/doc/reference/ord_indices.html#ord_in > dices > > > > Does this clear things up for you? > > > > Best, > > > > Joaquín M López Muñoz > > Telefónica, Investigación y Desarrollo > > > > Thanks - that's exactly what I wanted. Just one thing - this statement > doesn't appear to be made generally for sequenced indices, just for > certain methods (that's in the 1.33 RC2 documentation). > Umm... yes you're right, I'll fix that bit when I regain access to the CVS in a couple of weeks or so. Thanks for spotting this. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[Serialization] 1.33 RC1 unexpected header dependency?
by Richard Jennings 09 Aug '05

09 Aug '05

I'm finding an apparent dependency between some non-serialization headers and the use of BOOST_CLASS_EXPORT. If boost/optional.hpp or boost/format.hpp or boost/bind.hpp are included before BOOST_CLASS_EXPORT is used then I get the compilation error: [C++ Error] export.hpp(210): E2102 Cannot use template 'boost::type<T>' without specifying specialization parameters [C++ Error] export.hpp(210): E2293 ) expected If they are included after then everything's ok. This is BCB 5.6.4. This precludes me having optional/bind/format in a precompiled header and also means it's a bit tricky ensuring the correct inclusion order for a large project. Richard ========================================== Here's the code to demonstrate it: #pragma hdrstop #include <boost/archive/xml_oarchive.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/export.hpp> #pragma link "libboost_serialization-bcb-mt-d-1_33.lib" // !! These can't be included here //#include <boost/format.hpp> //#include <boost/bind.hpp> //#include <boost/optional.hpp> class A { public: template <class ArchiveT> serialize(ArchiveT & ar, unsigned int) { }; }; BOOST_CLASS_EXPORT(A) // Including here is ok #include <boost/format.hpp> #include <boost/bind.hpp> #include <boost/optional.hpp> #pragma argsused int main(int argc, char* argv[]) { boost::optional<int> SomeValue; A InstanceOfA; return 0; }

4 3