March 2003 - Boost-users - lists.boost.org

uBLAS: reference to container data & iterator declaration
by Roland Schwarz 04 Mar '03

04 Mar '03

Hi, *) First question: I am trying to get a reference to data of a container in the following way: matrix<double> m(3,3); vector<double>& v(m.column(2)); But this seems not to be possible. Is there a way to achieve this behaviour? What I basically want to achive is having functor object that holds a reference to a row/column of my container matrix. >From my questions about argument types I know that m.column(2) is a kind of an expression. How can I get the underlying reference to data if there even is one? *) Second question: matrix<double> m(10,3); ... fill the matrix ... matrix<double>::iterator it; // wrong this does not work!! for (it = m.column(2).begin(); it != m.colum(2).end(); ++it) { cout << *it << " " << foo(*it) << endl; } How would I declare my iterator? I understand when I use std::library-algorithms the automatic template parameter defer will give me the correct type from begin(). But in my case how should I declare the iterator? Thank you for help. Roland

1 0

multivoque application algorithms
by Alexandre Carsac 03 Mar '03

03 Mar '03

I applologize, perhaps this is the wrong place, Just wondering if the boost Graph library can be used for multivoque application. ------------------------------------------------------------------------------------------- let be : E = {x0, x1, ...,xp} F = {y0, y1, ...,yq} G': y -> {xa.....xm} and card G'(y) = constant = m G : x -> {ya.....yn} and card G(x) < M for all x belongs to E G' is the reverse application of G. G is irregular. h : x -> h(x) whose values are in [0,1] The problem is to find the y0 so that G'(y0) maximise h(xa), ...,h(xm). (assume that h(xi) near of 1 for all xi in G'(y0) ) One simple approch would be to calculate h(x) for all x associated to all y and keep the maximum, but this lead to too much calculations. ------------------------------------------------------------------------------------------------- I try to organized E into a binary tree. The idee is to shrink E so that each schink step truncate the search space. lets take x0 so that card G(x0) be maximum. We have the composed application of G with its reverse one G': G o G' (x0) = {xaa....xpa, xab,...xpb, xpa,....xpn} means that x0 is tied to some other x's in E by G. if h(x0) is the not near 1, then the y we are looking for will have fewer chance to belongs to G'(x0), so it is not worth to look at all the h(xaa), ...h(xpn). This would create a bi-partion on E and so on. --------------------------------- Do You Yahoo!? -- Une adresse @yahoo.fr gratuite et en français ! Testez le nouveau Yahoo! Mail [Non-text portions of this message have been removed]

1 0

Re: [Boost-Users] stop a thread
by William E. Kempf 03 Mar '03

03 Mar '03

> From: "hlh771 <hlh771(a)yahoo.com.cn>" <hlh771(a)yahoo.com.cn> > > How to stop(or cancel) a thread? Suppose I have a main thread and a > worker thread, the worker thread does something looply,and when the > main thread get a message indicating the process should exit, I want > stop the worker thread,how to do that?I have read other thread > library,their thread class supply a method called stop or cancel > which stops the thread. Their Implementation is:the thread class has > a data member indicating whether the thread should stop,and the > thread function looply check the data member whether the thread > should stop.Generally the data member's type is a bool or Event. > Is it the best way to stop the thread? How the boost to deal with > this? > Thanks in advance. Today you should use a flag and a condition/mutex combination. Direct support for cancellation is being provided in a future release. William E. Kempf wekempf(a)cox.net

3 4

Exporting references into boost::python
by Nicholas Francis 02 Mar '03

02 Mar '03

A newbie question regarding boost::python. I need to make a templatized function that returns a boost::python::object containing a reference to an object I already have. Basically: template<class T> object convertToPython (T &obj) { return object (obj) } All classes I pass through T are already wrapped (they are also not copy-constructible). I tried with the code found at python.orgs wiki: template<class T> T& identity(T& x) { return x; } template<class T> object get_object_reference (T& x) { object f = make_function (&identity<T>, return_value_policy<reference_existing_object()); return f(x); } this code gave me a compile error (on CW 8.3, Mac OS X). Apparently CW is convinced that the &identity<T> maps to void. I then tried to hardcode a type just to see if it worked at all: InputManager &identity (InputManager &x) { return x; } object get_object_reference (InputManager &x) { object f = make_function ( &identity, return_value_policy<reference_existing_object()); return f(x); } This compiled, but gave me a typeerror at runtime: (No to_python (by-value) converter found for c++ type: InputManager) I've seccesfully wrapped functions like this: InputManager &GetInputManager(); BOOST_PYTHON_MODULE (Engine) { def ( "GetInputManager", &GetInputManager, return_value_policy<reference_existing_object() ); } So it should be able to work. Any help would be greatly appreciated.... TIA, Nicholas

2 1

VC7 says 'fatal C1067' compiling multi_array?
by Clift Norris 01 Mar '03

01 Mar '03

Greetings: I'm using VC7 and boost_1_29_0 to compile this code that is using multi_array.hpp. typedef boost::multi_array<double, 4> theta4_t; typedef theta4_t::index index; theta4_t Theta_Trun( boost::extents[10000][2][10][256] ); I'm receiving this error: "fatal error C1067: compiler limit: debug information module size exceeded" Of course, the code compiles fine using the "Release" configuration, but I need the "Debug" one also. Is there a workaround for this, other than the 'make your variables shorter' suggested in the VC7 documentation? Thanks, -Clift

2 1