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

filling in vertex_name_t property for adjacency_list
by Jack Rabbit 13 Mar '03

13 Mar '03

Hi, I'm trying to create a graph that has a name for each vertex. Below is what I've come up with so far. I really don't know what's wrong with it. Can any of you help me out? I'm using boost 1.29.0 with Visual Studio6.0sp5 on win2k. I'm getting some errors on the line that's supposed to get the property map. Then a whole bunch of others because in the end 'name' has the wrong type. kind regards, Dieter Vrancken // create some vertex names typedef std::set<std::string> StringSet; StringSet v_names; std::string names[] = { "v1", "v2", "v3" }; v_names.insert(names, names + sizeof(names)/sizeof(names[0])); // declare the graph typedef boost::adjacency_list<boost::setS, boost::vecS, boost::directedS, boost::vertex_name_t, boost::no_property, boost::graph_name_t, boost::setS> Graph; Graph g(v_names.size()); // get the property map for the vertex names boost::property_map<Graph, boost::vertex_name_t>::type name = boost::get(boost::vertex_name, g); // fill in the names StringSet::const_iterator ss_it = v_names.begin(), ss_end = v_names.end(); int i = 0; for(; ss_it!=ss_end; ++ss_it, ++i) boost::put(name, i, *ss_it);

1 0

Efficient implementation of associative_property_map
by Martin Okrslar 12 Mar '03

12 Mar '03

Dear Boost users, for an application in computational biology I am intendig to use the BGL to compute strongly connected components of a graph with about 600.000 nodes. In the BGL book on page 103 it is mentioned, that "The choice to use std::map to implement the property map is rather inefficient in this case...". Since my graph is large I'm a bit worried about this statement. Could anybody of you please give me a hint, what other datastructure I might use here, to make it efficient? all the best Martin -- ----------------------------------------------------------------------------- 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 -----------------------------------------------------------------------------

7 9

adjacency_matrix
by agiatojon 12 Mar '03

12 Mar '03

Hello all, I'm new to the list and to Boost in general and am trying to use an adjacency_matrix in order to plot coordinates (hopefully that is a good use for it). I just started trying to learn it and have entered the sample program from page 237 into my compiler (VS.NET) Below is the program I have entered. I am getting errors in that print_vertices, print_edges, and print_graph are undefined and are not members of boost. Any help apprechiated! Thanks. /** * adjaMatri.cpp * Nov 7th, 2002 * Boost Graph Library, pg. 237 */ #include <iostream> using std::cout; using std::cin; using std::endl; #include <boost/graph/adjacency_matrix.hpp> using namespace boost; int main() { enum { A, B, C, D, E, F, N }; const char *name = "ABCDEF"; typedef boost::adjacency_matrix<boost::undirectedS> UGraph; UGraph ug(N); add_edge(B, C, ug); add_edge(B, F, ug); add_edge(C, A, ug); add_edge(D, E, ug); add_edge(F, A, ug); cout << "vertex set: "; boost::print_vertices(ug, name); cout << endl; cout << "edge_set: "; boost::print_edges(ug, name); cout << endl; cout << "incident edges: "; boost::print_graph(ug, name); cout << endl; cout << "Press enter to exit..."; cin.get(); return EXIT_SUCCESS; } Jon Agiato JonAgiato(a)nyc.rr.com

2 1

BGL: getting components of graphs with properties
by Martin Okrslar 12 Mar '03

12 Mar '03

Dear Group, when computing the connected components of a BGL graph one has to create a vector that holds the component integer assigned to each vertex (See http://www.boost.org/libs/graph/example/connected_components.cpp and http://www.boost.org/libs/graph/doc/connected_components.html) OK, that works very well. But how can I get the component number of each vertex? If my graph has internal properties, I can not simply access the vector with an iterator on the graph vertices: component[*vi]; //doesn't work! This doesn't work, because the vertices (to be specific: the vertex desriptors) of the graph aren't integers if the graph has internal properties. Any idea how to get the component of each vertex? all the best Martin -- ----------------------------------------------------------------------------- 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 -----------------------------------------------------------------------------

1 0

[V2] Problems with stage rule
by klapshin 12 Mar '03

12 Mar '03

Hi, I am having few problems on CygWin with latest boost CVS snapshot. I am building project with a number of dlls, and I need a way to run program easily. I tried hardcode-dll-paths=true, but it does not seem to work on CygWin, so I decided to use stage rule to copy all binaries in top/bin folder. First problem was that CP variable is empty and copying of the dlls failed. I worked around this one with bjam -sCP=cp. BTW, was not it supposed to be relinked rather then copied? Next problem was with exe file. Stage failed with following errors: ----------------- /cygdrive/c/work/boost1/tools/build/new/stage.jam:97: in object(stage-exe-gener tor)(a)1.run *** argument error * rule object(file-target)(a)174.depends ( d + ) * called with: ( ) * missing argument d /cygdrive/c/work/boost1/tools/build/new/virtual-target.jam:86:see definition of rule 'object(file-target)(a)174.depends' being called /cygdrive/c/work/boost1/tools/build/new/generators.jam:638: in try-one-generato /cygdrive/c/work/boost1/tools/build/new/generators.jam:885: in construct-withou -caching /cygdrive/c/work/boost1/tools/build/new/generators.jam:937: in generators.const uct /cygdrive/c/work/boost1/tools/build/new/stage.jam:56: in construct /cygdrive/c/work/boost1/tools/build/new/targets.jam:604: in object(stage-target class)(a)3.generate /cygdrive/c/work/boost1/tools/build/new/targets.jam:386: in generate-really /cygdrive/c/work/boost1/tools/build/new/targets.jam:363: in object(main-target) 3.generate /cygdrive/c/work/boost1/tools/build/new/targets.jam:182: in object(project-targ t)(a)1.generate /cygdrive/c/work/boost1/tools/build/new/build-system.jam:140: in load /cygdrive/c/work/boost1/tools/build/new/modules.jam:171: in import /cygdrive/c/work/boost1/tools/build/new/bootstrap.jam:41: in boost-build /cygdrive/c/work/pricing/boost-build.jam:13: in module scope ------------------ One more thing. Suppose I want to install all dlls to bin subfolder of project root. I tried to define path-constant in project-root, and then in one of subprojects apply stage on target and supply path from that path-constant. I end up with dll being copied into bin subfolder of subproject, rather then root. Is it expected behavior? My workaround was to put all stage rules in root Jamfile. - Kirill

1 1

BOOST_PP_NOT documentation
by Staggs Mark - mstagg 11 Mar '03

11 Mar '03

This is a _very_ minor thing, but I noticed in the documentation for BOOST_PP_NOT the following line: If x is non-zero, this macro expands to 1. Otherwise, it expands to 0. Should read: If x is zero, this macro expands to 1. Otherwise, it expands to 0. URL: http://www.boost.org/libs/preprocessor/doc/ref/not.html ---- Mark Staggs Acxiom Corp. ********************************************************************* The information contained in this communication is confidential, is intended only for the use of the recipient named above, and may be legally privileged. If the reader of this message is not the intended recipient, you are hereby notified that any dissemination, distribution, or copying of this communication is strictly prohibited. If you have received this communication in error, please re-send this communication to the sender and delete the original message or any copy of it from your computer system. Thank You.

2 1

boost::thread not started
by justin_michel 11 Mar '03

11 Mar '03

Platform : Windows XP, Pentium 4, Visual C++ 6 sp5 I've traced down my problem with starting a thread from a DLL called from Java JNI. If you look at the source code thread.cpp in boost, you can see that a condition variable is used block the creating thread until the new thread function is started. Basically, what I am seeing is that if you wait on this condition variable, then the thread will never start. If I remove the call to param.wait() at the bottom of the constructor then everything works fine. I can't think of a logical explanation, but it's very repeatable. I was also able to recreate this problem using the latest source from CVS. The simple solution would be to remove the condition variable from thread_param code entirely. This would simplify everything, and I don't really see the value anyway. All that is currently guaranteed is that thread_proxy will be called before the boost::thread() constructor is finished. But it doesn't guarantee that threadfunc() will be called before the constructor is finished. Thanks, Justin Michel OCI

2 3

uBLAS: Can I make my vector<...> derived class 'copy constructible' ?
by speedsnaii 11 Mar '03

11 Mar '03

Hi Joerg, or anyone who can help! As I am still on my spline templates, I came on to the following beast: template<class T> struct index_vector : public vector<std::pair<T, vector<ublas::vector<T>::size_type> > > {}; This should be an index vector that relates to a double (first) a vector of indices (second) which happens to be different for each 'first'. So far so easy. I can say: index_vector<double> IY; IY.resize(5); IY[0].first = 3.14; IY[0].second.reset(vector<double>(3)); IY[0].second[2] = 1; But I cannot: index_vector<double> IZ(IY); or index_vector<double> IZ; IZ = IY; or IZ.reset(IY); This compiles, but gives me runtime assertions because of size mismatches. I think my derived class is not 'copy constructible' and 'assignable'. Is there a simple way to fix this? (I am not even sure whether this is a uBLAS matter. So please simple tell me, and I will try to learn the missing parts.) Thank you, Roland

2 2

How to get extents of multi_array dimensions
by Neil Mackie 11 Mar '03

11 Mar '03

I am using multi-array for the first time, without problems. Now I want to pass the multi_array around and the users of it need to find out what the maximum array indexes are in each dimension. But I do not know how to obtain them from the object. I have read the documentation and the header file but if there are any clues there I have missed them. I have also searched the archives of this list for relevant posts. Is there a call on multi_array to return the array bounds and if so how do you specify which dimension you are requesting the bounds of? Does anyone have an example they could post? Regards, Neil (J Mackie).

1 0

index(*vi) in the BGL quick tour?
by Jack Rabbit 11 Mar '03

11 Mar '03

Hi, My IDE is VC++6.0. I'm on win2k, using boost 1.29.0. I'm trying to get the quick tour (BOOST_HOME/libs/graph/doc/quick_tour.html) of the graph library to compile, but am experiencing a problem. In the example on how to invoke Dijkstra's algorithm, it seems we're calling a function index(*vi). I'm guessing it's supposed to get the node number for the node at vertex_iterator vi. The problem is that my compiler can't find the function ('index' : undeclared identifier). Doing a manual 'search in files' doesn't reveal any legible candidates either. Is this an error in the docs or am I missing something bigger here? kind regards, Dieter Vrancken

1 0

spirit framework...
by Michael Burbidge 10 Mar '03

10 Mar '03

I understand that the spirit compiler framework has been accepted as part of boost. Does anyone know when it will be part of the standard boost distribution. I'm finding that spirit 1.5.1 generally works on Mac OS X using CodeWarrior, but that I'm experiencing runtime assertions running some of the examples. In particular the ast_xml example. Thanks, Michael-

2 1

Problem with tuples::ignore
by Tom Matelich 10 Mar '03

10 Mar '03

I'm sure I've seen posts about this, but have been unable to track it down... Apparently gcc 3.2 only uses the cpp file name to "anonymize" anonymous namespaces. My problem is that Application A links libs B and C, which both have files named foo.cpp. These foo.cpp's both include boost/tuples/details/tuple_basic.hpp, thus causing duplicate symbols of tuples::{anonymous}::ignore. Obviously I can work around this by renaming the cpp files, but I thought I'd see if there was a quicker solution. Thanks Tom pardon the disclaimer... ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

uBLAS: reference to container data & iteratordeclaration
by speedsnaii <speedsnaii＠yahoo.de> 08 Mar '03

08 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

3 10

thread problems with Java JNI
by justin_michel 07 Mar '03

07 Mar '03

A simple test program using boost::thread works fine, but when I try to use boost::thread in a DLL library which is called from a Java thread, the thread blocks forever in the constructor for boost::thread. Looking at the source code for boost::thread, I see that it blocks on a condition waiting for the thread to start. Maybe the thread never starts? So. I modified my code to use _beginthreadex() directly to start my worker thread. I hoped to at least get a better idea of what was going wrong, but the code worked flawlessly. Are there known problems with using boost::thread from a DLL? Any other ideas? Thanks, Justin Michel

1 0

boost-build path discrepancies
by Michael Hunley 07 Mar '03

07 Mar '03

As per my recent post "Installing boost libs for dependant apps," I recently used the boost-build system for my own apps make setup. I found it to be very powerful and useful (more than I could use to begin with). I used the version 1 build system becuase it looked like it would be easier to get up and running, but plan to migrate to v2 soon since it is more powerful and I much prefer the dependency handling of adding sub-projects by name, not path to a Jamfile. But I need to learn it first. I did this on RedHat 8.0 using gcc 3.2.2 with a cut of the Boost CVS from 2/6/2003 on the Boost-Build v1.30.0. I copied most of the main files (features.jam, boost-build.jam, etc) from the main boost build setup in BOOST_ROOT and BOOST_ROOT/tools/build. I ran into two issues with pathing and another with the LinkLibraries rule. I tried a couple of approaches to including externally built libraries to my build hierarchy (several sub-project libs and one app). When I tried LinkLibraries it didn't complain, but the library never got added to my link action in the NEEDLIBS variable. I tried tracing it down and added Echo actions to the LinkLibraries to see what it was adding, which was nothing, but I could have mis-understood the NEEDLIBS on $(<) expression. Regardless, they did not appear in the list of libs passed to the linker. I then tried the <libraryfile> feature in my requirements section. That worked fine. So, is LinkLibraries deprecated (the docs did not mention it that I could find)? I had it first in my list, before my exe target, but in the same file. Was it supposed to go after? I liked LinkLibraries better than the <libraryfile> since it would do the name mangling for me (prefix="lib", suffix=".so" under gcc). The other problem I ran into revolved around use of relative paths and I believe my results are counter to what the documentation claims. First, when I added dependant libraries as source entries in my exe target the docs claim I can make those paths absolute. My setup is a little out of the norm in that my app is at the leaf node of the directory tree, so the relative path to the main lib it needed was $(DOTDOT). However, I have several libs common to other apps, but in the same boost build hierarchy, so those are relative to $(BOOST_ROOT). When I tried having a source line: <lib>$(BOOST_ROOT)/Common/CommonLib from within my Jamfile located at $(BOOST_ROOT)/ServerLib/Server The output when I tried bjam was: (|ServerLib|Server|home|michael|Proj|Common) not found (I am only sure of the folder part of that, the exact error syntax may be slightly off). I had to specify the paths as: $(DOTDOT)/$(DOTDOT)/Common/CommonLib In the second case, it was relative pathing that wouldn't work. I specified most of the common features and settings using template targets that I then imported into each Jamfile (Very nice feature). The one of concern was located in the $(BOOST_ROOT)/ServerLib folder. In the $(BOOST_ROOT)/ServerLib/Server/Jamfile I added a requirement: <include>$(DOTDOT) To get back to ServerLib which it depends on. I swear that worked the first time I got it built, but last night when I did a rebuild all (bjam -a) it failed and claimed it could not find include files. I ended up having to change it to absolute pathing to work. Are the docs wrong on the two pathing issues? Is there something I could be setting up wrong to get the behavior I saw? thanks. michael

1 0

installing boost libs for dependant apps
by Michael Hunley 07 Mar '03

07 Mar '03

I just completed porting our server from XP to Linux, which uses Boost::Thread for the threading library. I found it was infinitely more convenient to publish the libs in their various formats (variant|sub-variant) into a common, top-level folder under BOOST_ROOT. This made it much more managable to both link it into my application (without having to grist the folder name) and add the proper path to my LD_LIBRARY_PATH env var so it could find the shared libraries when I ran. I don't know if there is a prescribed way of doing this already in place, but I did not see anything in the build documentation (like bjam "Install [folder]" or some such). I ended up modifying the BOOST_ROOT/Jamfile to have a stage target that published all the threading libs to BOOST_ROOT/bin with proper suffixes for the variants I cared about (debug and release for the moment). I still had to append the proper suffixes in my own Jamfile (I used BJam for my make as well), but it was a heck of a lot better than a 10 deep folder hierarchy. I have a couple of question and two requests. For reference I am using a cut from CVS around 2/6/2003. How are others doing this sort of thing that are using Boost? Is there a common way to do what I did by doctoring the Jamfile that is less invasive (so I don't have to repeat in the future when I get releases from CVS)? I am new to Linux & Boost, so may not know how I should be getting at these things. My request, if the answers to the above don't address them, is that some form of install or publish to a common location be added to the boost build. If I were more intimately familiar with Boost and the build system (and the various installation platforms) I would volunteer to help, but... My second request may also already be possible, but my limited experiment and reading made it seem not. I'd like to be able to declare a sub-project that points to a whole other boost-build.jam hierarchy; e.g. I want to make Boost a sub-project of mine. This seems much more plausible and likely in the new versoin 2 format where the dependency declarations are more straight-forward (by name, not explicit path). I await your feedback. Thanks. michael

1 0

boost::signals build and C++Builder 6 Pro in 1.29.0
by Russell Hind 07 Mar '03

07 Mar '03

I have built the boost::signals library with C++Builder 6 Pro Update 4 and am running into problems: a) We tend to use double word alignment, not quad word (which is the default in C++Builder). It appears that the libraries are built with quad word, but the headers don't enforce this, so when I change the options to double word (in our project) and try to construct a signal with boost::signal0<void> s; I get an access violation when constructing a signal (from line 266 of shared_count.hpp) The call stack is 00417F3F __internal_malloc 00417DD8 __internal_malloc 00417539 ___org_malloc 00416EA2 ___org_new 004076E1 boost::detail::shared_count::shared_count(this=:0012FBB4, p=:007F3928, d={ }, =:007F3928) 004063E3 boost::shared_ptr<boost::signals::detail::signal_base_impl>::shared_ptr<boost::signals::detail::signal_base_impl>(this=:0012FBB0, p=:007F3928) 0040546D boost::shared_ptr<boost::signals::detail::signal_base_impl>::reset<boost::signals::detail::signal_base_impl>(this=:0012FF70, p=:007F3928) 00403F51 boost::signals::detail::signal_base::signal_base(this=:0012FF70, comp=:0012FC24) 0040232E boost::signal0<void, boost::last_value<void>, int, _STL::less<int>, boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, _STL::allocator<boost::function_base> > >::signal0<void, boost::last_value<void>, int, _STL::less<int>, boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, _STL::allocator<boost::function_base> > >(this=:0012FF70, c=:0012FC7C, comp=:0012FC74) 00401BF3 main(argc=1, argv=:007F21E4) 00420862 __startup b) If I do use quad word alignment, then the object constructs correctly, but when I connect a method to it with void VoidFunc(void) { } int main(int argc, char* argv[]) { boost::signal0<void> s; s.connect(&VoidFunc); } the program hangs. Turning on CodeGuard shows a similar problem to that above. The object was allocated with a size of 12 bytes, but code is trying to access byte 16 in the object (I guess this is a similar alignment problem). The callstack is 0041E44E boost::counted_base::dispose(this=:00C04360) 00427203 boost::signals::detail::signal_base_impl::connect_slot 00404741 boost::signal0<void, boost::last_value<void>, int, _STL::less<int>, boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, _STL::allocator<boost::function_base> > >::connect(this=:0012FF60, in_slot=:0012FDA8) 004026C5 main(argc=1, argv=:00C021E4) 00433802 __startup It says the this pointer block is only 12 bytes long, but the code is trying to access byte 16. Do (or should) all the bost headers force alignment before all structures/classes and then restore the alignment afterwards? Currently, I have to link directly with the signals source code to get use the library. Has anything to do with this been changed in the builds of 1.30.0? Thanks Russell

8 27

Using Unit Tests w/Codewarrior Pro 8.3
by paul_snively <paul_snively＠yahoo.com> 06 Mar '03

06 Mar '03

Folks, I'd like to be able to run a boost unit test, e.g. is_convertible_test.cpp, as kind of a one-shot apart from having to deal with the rest of boost. So I read the documentation on the unit test framework, and it seems like this should be relatively straightforward. I've created a Carbon Console project in Codewarrior, which contains the following files: is_convertible_test.cpp init.cpp (from type_traits/test) unit_test_main.cpp unit_test_suite.cpp unit_test_result.cpp unit_test_log.cpp unit_test_monitor.cpp execution_monitor.cpp unit_test_parameters.cpp test_tools.cpp This all compiles and links file, which is a relief in and of itself. :-) However, when I simply run the app, I get "*** No errors detected". If I remove is_convertible_test.cpp and rebuild and run again, I get the same result. :-) So my suspicion is that I need to do more to let the framework know that it needs to run is_convertible_test.cpp. Can someone please clue me in as to what that is, in minimal terms? Thanks!

4 4

shared_ptr 1.27 w/gcc 2.96 (VxWorks)
by Brian 06 Mar '03

06 Mar '03

We are using boost 1.27 (I know, I know) with the real-time operating system VxWorks, which ships with its own "special" version of gcc 2.96 (not that same as Red Hats - I know, I know). Today I finally got around to providing a version of atomic_count.hpp for VxWorks. I had to play some games with #defines to get BOOST_HAS_THREADS and all the other things set up right before my implementation would get chosen. Once that was squared away, I put a cout in the constructor of my atomic_count class just be sure it was all working. I then stamped down a shared_ptr<int> and much to my surprise: no text output. I traced it back to the constructor for counted_base_impl (a templated class). That constructor was being called, but it inherits from counted_base, and that constructor was just not getting called! I searched your bug list on source forge but found no mention of this. But then again, its not really a boost bug! I then took a look at boost 1.29 and noticed that lots of things had been reworked in this area, so now looks like the reason to start using 1.29. I'm afraid I am stuck with VxWorks and that compiler though... So I'm just throwing this out in case anyone is remotely in the same situation as we are. I will start using 1.29 and see what happens. Hopefully its not too hard to customize the OS specific part in 1.29. I also suggest a note get added to the shared_ptr documentation about this OS specific mutex stuff thats going on. I got curious about how that was done and decided to look. Had I not done this, my shared_ptr's reference count would not have been thread safe and I wouldn't have known this. Also, is there a "what has changed in this new version of boost" file somewhere? Thanks again everyone. BN

1 1

Re: [Boost-Users] Unable to BOOST_INSTALL_PROPERTY
by Administrator 06 Mar '03

06 Mar '03

Martin, I did a simple search through the Boost website, and on http://www.boost.org/libs/graph/doc/using_adjacency_list.htm, I found this: You can also use enum's instead of struct's to create tag types. Create an enum type for each property. The first part of the name of the enum type must be edge, vertex, or graph followed by an underscore, with a _t at the end. Inside the enum, define a value with the same name minus the _t. Then invoke the BOOST_INSTALL_PROPERTY macro. enum edge_myflow_t { edge_myflow }; enum edge_mycapacity_t { edge_mycapacity }; namespace boost { BOOST_INSTALL_PROPERTY(edge, myflow); BOOST_INSTALL_PROPERTY(edge, mycapacity); } compared to: > namespace boost{ > enum vertex_xx_t { vertex_xx = 1111}; > BOOST_INSTALL_PROPERTY(vertex,vertex_xx); > } which means it should be: > enum vertex_xx_t { vertex_xx = 1111}; > namespace boost{ > BOOST_INSTALL_PROPERTY(vertex,xx); > } Dale

1 0

[BGL] Preconditioned color maps?
by Tarjei Knapstad 05 Mar '03

05 Mar '03

In an algorithm I'm working on I need to do an undirected_dfs using a visitor for analysis. I know my starting vertex, and I also want the DFS to skip one of the starting vertex's adjacent vertices (i.e. don't proceed in the "direction" from the starting vertex). Example: d-e-f / a-b-c \ g-h-i Starting vertex is 'c' and I want to eliminate the "d-e-f" branch, so the DFS finds "c-b-a" and "c-g-h-i". My first idea was to set up a vertex color map, and set the color to black for vertex 'd' in the example above, but that doesn't do much good as the undirected_dfs sets all colors to white initially. My second thought was to feed the vertex I want to eliminate and the vertex color map to my dfs_visitor implementation, something like: discover_vertex(u, g) { if (u == blocked) { vertex_colormap[u] = black; } } Will the latter approach work satisfactory? If not, is there some other way which I can use to precondition the color maps used in the BGL algorithms? Thanks, -- Tarjei

4 10

Re: [Boost-Users] NDEBUG, affects floating point math?
by Stephen Crowley 05 Mar '03

05 Mar '03

On Fri, Feb 28, 2003 at 09:53:56AM +0100, Joerg Walter wrote: > > 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?) > > If you have *not* defined NDEBUG, ublas uses many internal consistency > checks and usually no expression templates. I was referring to the case when NDEBUG is defined and comparing symmetric_matrix by general_matrix products. uBLAS is quite slow with this operation. However, I compared my symmetric_matrix by general_matrix_transpose product and ublas was only 3-4 times slower than the optimized C, not too bad. > > And when I compile with -DNDEBUG the results differ > > by around +/- 1e-16, but when its not defined the results match almost > > perfectly. > > You've probably hit a bug, may be an old one (please consider to check > against CVS, too). Could you please send or post a small sample, if the > problem persists? I think I know the source of the problem now, and I'm not sure if it's one that boost should handle or not. I attached my test code at the end of this email, only 2.7k, I hope it isn't inappropriate for the list. 387 floating point registers are stored as 80 bits internally and rounded to 64 bits when assigned to memory. SSE2 floating-point registers are stored in the native 64-bit format. The following table lists the compiler flags used and the accumulated absolute difference between the two products over 100 randomly generated matrices. gcc version 3.2.3 20030221 (Debian prerelease) no compiler flags diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -DNDEBUG diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -O1 diff sum [5,3]((2.91694e-15,2.65348e-15,2.7027e-15),(4.4049e-15,3.29251e-15,3.44863e-15),(4.10436e-15,4.14816e-15,3.24393e-15),(3.57873e-15,3.75741e-15,2.64068e-15),(5.03091e-15,2.79637e-15,4.06099e-15)) -O1 -DNDEBUG diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -O2 diff sum [5,3]((4.37584e-15,4.8659e-15,3.61516e-15),(4.61783e-15,3.77736e-15,4.04169e-15),(4.46691e-15,5.10876e-15,5.00576e-15),(3.64118e-15,4.91968e-15,5.17641e-15),(3.97273e-15,4.25528e-15,3.75394e-15)) -O2 -DNDEBUG diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -O3 diff sum [5,3]((4.96131e-15,3.88968e-15,4.34245e-15),(5.07754e-15,5.91974e-15,4.19109e-15),(4.89539e-15,4.29279e-15,5.06344e-15),(4.79781e-15,4.66033e-15,3.77996e-15),(4.75227e-15,4.72539e-15,3.33414e-15)) -O3 -DNDEBUG diff sum [5,3]((4.60569e-15,2.67928e-15,2.7079e-15),(3.21054e-15,2.98112e-15,2.61249e-15),(3.91701e-15,3.60822e-15,2.93515e-15),(3.23006e-15,3.42434e-15,3.53363e-15),(3.18105e-15,2.77035e-15,3.67198e-15)) -O1 -mfpmath=sse,387 -march=pentium4 -msse2 diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -O1 -mfpmath=sse,387 -march=pentium4 -msse2 -DNDEBUG diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -O2 -mfpmath=sse,387 -march=pentium4 -msse2 diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -O2 -mfpmath=sse,387 -march=pentium4 -msse2 -DNDEBUG diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -O3 -mfpmath=sse,387 -march=pentium4 -msse2 diff sum [5,3]((0,0,0),(0,0,0),(0,0,0),(0,0,0),(0,0,0)) -O3 -mfpmath=sse,387 -march=pentium4 -msse2 -DNDEBUG diff sum [5,3]((3.62991e-15,3.74006e-15,4.62824e-15),(4.00548e-15,4.5311e-15,3.60129e-15),(3.48332e-15,5.11743e-15,3.08174e-15),(3.49373e-15,4.05752e-15,4.2865e-15),(4.81169e-15,4.51549e-15,4.18589e-15)) Is this perhaps a compiler bug? Part of the problem actually comes from whether the products are accumulated into a register by the compiler, or whether they are accumulated into memory. If accumulated into a 387 register it has higher-precision before it is rounded back down to 64-bits to be stored into memory. If the compiler generates code to accumulate the products directly into memory then the results of each individual product are rounded to 64-bits at every iteration and the result will be slightly less accurate. Now, when the -msse2 flag is used, the registers are 64-bit only and thus no accuracy is gained by using them, only speed. -- Stephen [Non-text portions of this message have been removed]

3 4

GCC 3.2 compiler error using Boost::Threads::Mutex::scoped_lock
by Michael Hunley 05 Mar '03

05 Mar '03

Disclaimer: I am relatively new to gcc, linux and Boost. I'm hoping someone out in the group who is much more knowledgable about all of them can help me get past a hurdle in code I am porting from Windows. I am getting a vague error message from g++ (gcc 3.2-7 under Redhat Linux 8.0) in my code using the Boost scoped_lock. I have wrapped the Boost versions of mutex and mutex::scoped_lock as: class PMutex { public: PMutex() {} virtual ~PMutex() {} protected: boost::mutex m_Mutex; friend class PScopedLock; }; class PScopedLock { public: explicit PScopedLock( PMutex& M ) : m_ScopedLock(M.m_Mutex) {} virtual ~PScopedLock() {} static PScopedLock* Create( PMutex& M ) { return (PScopedLock*) ::new PScopedLock(M); } void Destroy( void ) { delete this; } protected: void* operator new(size_t) {} // disallowed, must declare on the stack boost::mutex::scoped_lock m_ScopedLock; friend class PCondition; }; The error is "ISO C++ forbids declarations of 'type name' with no type". I get that error on several lines, but most notably on a simple declaration like: PScopedLock Lock(MyMutex); From what little I can find on the newsgroups, this sort of error has been noted when use of template template parameters are not declared quite correctly (without the trailing ::template from what I can gather). But as far as I can tell, I should not be having that issue. I am not knowledgeable enough about templates, Boost or gcc/g++ to sort out what I am running into. Boost builds fine under gcc, the code I am porting compiles fine under MSVC6 and Kylix3, but not gcc. Can anyone help me out? thanks. michael

2 2

Has anyone compiled Boost successfully on OS390?
by kant_rakesh <kant_rakesh＠yahoo.com> 04 Mar '03

04 Mar '03

Hi, I am trying to get boost compiled on OS390. Has anyone done it successfully so far? The compiler on OS390(version2 release10) is complaining of empty template parameter. It does not like 'template <>', which is being used frequently in the library. Any ideas about how to successfully build this on OS390? Thanks and Regards Rakesh Kant

2 1

boost-users@lists.boost.org ?
by speedsnaii <speedsnaii＠yahoo.de> 04 Mar '03

04 Mar '03

I tried to subscribe to the list boost-users(a)lists.boost.org I was thinking that this is just an alias list of this one. But it seems not to be true, is it? I would prefer to use the mail interface. Can anyone enligthen me if this is possible, please? Thank you, roland

1 0

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 02 Mar '03

02 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