- 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

are namespaces of boost libs required to be lowercase?
by Markus Werle 28 Feb '03

28 Feb '03

Hi! If someone wants to contribute code to boost: Is she required to provide the names of all namespaces lowercase? E.g. someone provides Elefant, the big library. Is she allowed to have namespace Elefant and perhaps namespace Elefant::Private, etc. I could not find any hint except this here, which did not really help me, since I do not know the standard library's conventions. Any link/ hint appreciated: -- citation from the boost docs -- "Naming conventions rationale The C++ standard committee's Library Working Group discussed this issue in detail, and over a long period of time. The discussion was repeated again in early boost postings. A short summary: Naming conventions are contentious, and although several are widely used, no one style predominates. Given the intent to propose portions of boost for the next revision of the C++ standard library, boost decided to follow the standard library's conventions." best regards, Markus

4 6

poisson_distribution header file
by kgolod0641 <kgolod＠engmail.uwaterloo.ca> 28 Feb '03

28 Feb '03

Hi, I am using boost_1_29_0 to implement random distribution functions. The standard download included implementation of uniform, normal and exponential distributions - and they work great. I also need an implementation of poisson distribution, and I have noticed that poisson_distribution.hpp was added to CVS last October. I got the file, and put it into the boost/random/ directory, with the other random distribution files. However, when I try using poisson distribution, I get a series of 0's instead of a series of random numbers, although I'm using it exactly the same way as with the other distributions. I am not sure whether the problem is due to incorrect installation of the new file, or due to bugs in the implementation. I tried cleaning the boost_1_29_0 directory, and running bjam again, but still no luck. Is there anything else I should do to include this new header file? Any help would be greatly appreciated. Thank you, Ksenia

2 2

NDEBUG, affects floating point math?
by Stephen Crowley 28 Feb '03

28 Feb '03

I'm getting some seriously strange problems with regard to numerical accuracy when computing matrix products that depends on whether or not NDEBUG is defined when I compile. I wrote a small piece of C code to calculate a symmetric-matrix by row-matrix product by directly accessing the memory (which btw is about 1000% faster than ublas's generated code with gcc 3.2.3 and -O3, why is ublas so slow?) And when I compile with -DNDEBUG the results differ by around +/- 1e-16, but when its not defined the results match almost perfectly. Is there something strange going on with regard to FPU control words or types or anything? I'm using type double btw. If more info is needed I can post a test case, but I thought it'd make a quick inquery to see if there is a fast answer. -- Stephen -------- This message was scanned for viruses by Digital Passage.

1 0

Re: [Boost-Users] Problem with time_period
by Jeff Garland 28 Feb '03

28 Feb '03

Alex wrote: >... start omitted ... >time_period p(ptime(date(2003, 03, 25)), ptime(date(2003, 04, >25))); >date_duration duration(days(1)); >p.shift(duration); >---------------------------------------------------- I'm not sure where 'days' is coming from -- its not a class in the library. Based on the compiler error it looks like the issue is using date_duration intead of time duration with the time_period. So instead you could do something like: hours duration(24); Or if you really want a class called days you can do something like: class days : public boost::posix_time::time_duration { public: days(int day_count) : boost::posix_time::time_duration(day_count*24) {} }; HTH. And, BTW in the upcoming 1.30 release you will be able to get rid of all the DATE_TIME_INLINE stuff... Jeff

2 2

mpl::if_ or mpl::apply_if?
by Markus Werle 27 Feb '03

27 Feb '03

Hi! I am trying to migrate some parts of my code from loki to boost::mpl. Q1: which is the best way to perform nested if-then-else? Assume given "values": bool B1, bool B2; class ff, class tf, class ft, class tt; I replaced ----------------------------------------------------------- typedef typename Loki::Select<B1, typename Loki::Select<B2, tt, tf>::Result, typename Loki::Select<B2, ft, ff>::Result >::Result type; ----------------------------------------------------------- with typedef typename apply_if < bool_c<B1>, apply_if < bool_c<B2>, identity<tt>, identity<tf> >, apply_if < bool_c<B2>, identity<ft>, identity<ff> > >::type type; Q2: Is apply_if always to be preferred over if_? Q3: (OT) Is there a mpl-equivalent to run-time case? best regards, Markus

4 10