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

RE: [Boost-Users] Re: Extended use of BGL File Dependency Example
by Tom Matelich 23 Dec '02

23 Dec '02

> From: Tom Matelich [mailto:tmatelich@zetec.com] > Sent: Sunday, December 01, 2002 9:11 PM > > From: David Abrahams [mailto:dave@boost-consulting.com] > > Tom Matelich <tmatelich(a)zetec.com> writes: > > > > > From: David Abrahams [mailto:dave@boost-consulting.com] > > > Sent: Sunday, December 01, 2002 5:58 AM > > >> Tom Matelich <tmatelich(a)zetec.com> writes: > > >> > > >> > trying to make my graphviz representation look nicer and I > > >> was wondering if > > >> > there is an algorithm already for simplifying: > > > > > > -----B\ > > > A--< \ > > > --------C > > > D----------/ > > > > > > to: > > > > > > A---B---C > > > D------/ > > > > > > This eliminated the A-C edge. > > > > > > Thanks for considering my problem. > > > > Maybe you want a minimum spanning tree, where the weight of > > each edge in the tree is determined by the distance between its > > vertices in some topological sort? > > > > That seems to solve the cases shown above pretty nicely. > > I had looked at the minimum spanning tree docs a bit, I > thought it looked pretty good. The docs say undirected graph though. I'm > currently using a directed graph. I suppose I could create a separate graph. > Oh, I see, create an undirected graph with weights as you said, and use > the minimum spanning algorithm to choose the useful edges. I like it, > hope it works. > Well, I finally got back to this and it almost worked. Things look a lot nicer, the only problem is some edges were lost that I would want to keep. I'll give a list of edges rather than try to draw ascii graphs. So I start out with edges: [1,0], [2,0], [3,0], [4,0], [3,1], [4,2], [4,3] Ideally I want this reduced to: [1,0], [2,0], [3,1], [4,2], [4,3] What I'm getting is: [1,0], [3,1], [4,2], [4,3] Of course my graph is bigger and I have a lot more dead ends than just at 2. 0 is a place holder I have for a "Valid System", so every thing should hit that eventually. I implemented this in the following manner: [create typedefs for undirected graph to be minimized] [get the order from the topological sort in a vector] [create the undirected graph with all edges from dependency graph, assigning weight to be the distance between source and target in the topological sort] [create a vector of edges called spanning_tree] [call kruskal_minimum_spanning_tree(undirected_graph, std::back_inserter(spanning_tree)); ] [then I recreated the directed graph out of the edges in spanning_tree, so I could have my arrows in graphviz] I'm going to try using prim_minimum_spanning_tree, I assume I should expect the same results, but I'll see. Thanks for any advice, Tom ----------------------------------------------------------------------- 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

Error in testing class tuple
by agiatojon <JonAgiato＠nyc.rr.com> 23 Dec '02

23 Dec '02

Happy Holidays to everyone! I am getting aquainted with the tuple class but am encountering the following error: c:\BGL\boost_1_29_0\boost\tuple\tuple_comparison.hpp(119): error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] with the following program: /** * tupleTest.cpp * Test of Boost library class tuple * A tuple is a fixed size collection of elements * Stored objects may be of different types * Current support of tuples with 0-10 objects * Objects may be any valid C++ type except void and function types * Jon Agiato * 12-23-02 */ #include <iostream> using std::cout; using std::cin; using std::ostream; using std::cerr; #include <cstdlib> #include <boost/tuple/tuple.hpp> using boost::tuple; // both tuple_io.hpp and tuple_comparison.hpp include tuple.hpp // tuple_io must be included for tuple input and output operators #include <boost/tuple/tuple_io.hpp> // tuple_comparison.hpp must be included for comparison operators #include <boost/tuple/tuple_comparison.hpp> #include <string> using std::string; #include <exception> using std::exception; class A { friend ostream &operator<<(ostream &output, const A &a) { output << a.S; return output; } public: A(string s = "Testing"):S(s) {;} string S; }; class B { friend ostream &operator<<(ostream &output, const B &b) { output << b.D; return output; } public: B(double d = 3.501):D(d) {;} double D; }; class C { friend ostream &operator<<(ostream &output, const C &c) { output << c.state; return output; } public: C(bool st = true):state(st) {;} double state; }; int main() { try { tuple<A, B, C> testTuple; cout << testTuple << '\n'; tuple<B, A> test2Tuple; if(testTuple == test2Tuple) cout << testTuple << " is equal to " << test2Tuple << '\n'; else cout << testTuple << " is not equal to " << test2Tuple << '\n'; cout << "Press enter to exit..."; cin.get(); return EXIT_SUCCESS; } catch(const exception &E) { cerr << "Standard library exception: " << E.what() << '\n'; return EXIT_FAILURE; } catch(...) { cerr << "Unknown exception thrown.\n"; return EXIT_FAILURE; } } I am using Visual Studio.NET Enterprise Architect Thanks! Jon Agiato JonAgiato(a)nyc.rr.com

1 0

Newbie: customizing dfs
by Gil Shallom 23 Dec '02

23 Dec '02

Hi, Sorry if I missed anything in any FAQ. I would like to customize dfs so it would go over an edge only if satisfies certain properties. The library allows to take actions using visitors, but I haven't found a nice way to modify its decision so it would scan only part of the tree according to certain properties. I can change depth_first_visit_impl in depth_first_search.hpp or maybe define a new algorithm in a new namespace, but all I actualy want is something like my visitor returning false/true thus telling the algorithm whether to continue scanning an edge or not. Does anyone think of a nice way to do this? Or have I missed a feature already implemented in BGL? Any help would be appreciated, Thanks, Gil Shallom

1 0

boost::python : project outside boost tree
by Juerg Tschirren 22 Dec '02

22 Dec '02

I have trouble getting a boost::python project to compile outside the boost directory tree. I can compile the "hello, world" example in {boost}/libs/python/example/tutorial witout problem. But now I would like to start my own project outside the boost tree. To start with I copied the above "tutorial" directory into my home-directory and modified the Jamfile to: #--- begin Jamfile # Include definitions needed for Python modules SEARCH on python.jam = $(BOOST_BUILD_PATH) ; include python.jam ; extension hello : hello.cpp <dll>$(BOOST_ROOT)/libs/python/build/boost_python : <sysinclude>$(BOOST_ROOT) ; #---- end Jamfile I set export PYTHON_ROOT=/usr export PYTHON_VERSION=2.2 export BOOST_BUILD_PATH=/usr/lib/boost_1_29_0 export BOOST_ROOT=/usr/lib/boost_1_29_0 (boost is in /usr/lib/boost_1_29_0 and Python 2.2.1 is in /usr/lib/python2.2 and /usr/include/python2.2) When I now call bjam I get the messages: ../../../Jamrules: No such file or directory /usr/lib/boost/tools/build/boost-base.jam:1455: in find-compatible-subvariant *** argument error * rule is-link-compatible ( feature : value1 : value2 ) * called with: ( <target-type> : PYD : ) * missing argument value2 /usr/lib/boost/tools/build/boost-base.jam:1416:see definition of rule 'is-link-compatible' being called /usr/lib/boost/tools/build/boost-base.jam:1502: in link-libraries /usr/lib/boost/tools/build/boost-base.jam:1712: in subvariant-target /usr/lib/boost/tools/build/boost-base.jam:1797: in main-target /usr/lib/boost/tools/build/boost-base.jam:1330: in declare-local-target /usr/lib/boost/tools/build/python.jam:302: in extension Jamfile:29: in load-jamfiles /usr/lib/boost/tools/build/bootstrap.jam:15: in boost-build /usr/lib/boost/boost-build.jam:2: in module scope I suspect something is wrong with my Jamfile, but what? Any help would be greatly appreciated. Juerg

2 3

[BGL] Possible bug in minimum_degree_ordering
by Jeppe N. Madsen 22 Dec '02

22 Dec '02

Hi, I'm fairly new to BGL so this may not be a bug after all......but I get a fair number of warnings about possible loss of data due to conversions (mainly between signed/unsigned types) with MSVC7 trying to compile the example below. Some may be ignored but at least line 188 of minimum_degree_ordering.hpp seems wrong: data[id[i]] = - (id[j] + offset); id[j] is unsigned, making (id[j] + offset) unsigned thus making the unary minus rather spurious. Also, compile time checks for correctly using signed types for the permutations would be nice :-) rgds Jeppe #include <iostream> #include <boost/graph/adjacency_list.hpp> #include "boost/graph/minimum_degree_ordering.hpp" #include <iostream> #include <boost/graph/adjacency_list.hpp> #include "boost/graph/minimum_degree_ordering.hpp" using namespace std; using namespace boost; int main(int, char **) { typedef adjacency_list <vecS, vecS, directedS> Graph; Graph G; add_edge(0, 1, G); add_edge(1, 0, G); add_edge(0, 2, G); add_edge(2, 0, G); add_edge(0, 5, G); add_edge(5, 0, G); add_edge(1, 2, G); add_edge(2, 1, G); add_edge(1, 3, G); add_edge(3, 1, G); add_edge(1, 6, G); add_edge(6, 1, G); add_edge(2, 4, G); add_edge(4, 2, G); add_edge(3, 4, G); add_edge(4, 3, G); add_edge(4, 5, G); add_edge(5, 4, G); std::vector<size_t> degree(num_vertices(G), 0); std::vector<int> inverse_perm(num_vertices(G), 0), perm(num_vertices(G), 0); std::vector<size_t> supernode_sizes(num_vertices(G), 1); property_map<Graph, vertex_index_t>::type id = get(vertex_index, G); minimum_degree_ordering (G, make_iterator_property_map(&degree[0], id, degree[0]), &inverse_perm[0], &perm[0], make_iterator_property_map(&supernode_sizes[0], id, supernode_sizes[0]), 0, id); for(size_t i = 0; i < num_vertices(G); ++i) std::cout << inverse_perm[i] << "\n"; return 0; }

1 0

boost::python abstract base class
by John Hunter 20 Dec '02

20 Dec '02

I am trying to get raw pointers and abstract base classes working properly with boost::python v2. I am working on an example inspired by the tutorial http://www.boost.org/libs/python/doc/tutorial/doc/inheritance.html. In my case, the base class has a pure virtual function, but I don't need to override it in python and call it from c++, so I don't think I need to do a BaseWrap. The problem is that if I try and expose Base to python, I get the compiler (gcc 3.2) error: g++ -isystem/usr/local/include -I/usr/local/include/python2.2 -fPIC -ftemplate-depth-100 -c rawpointer.cpp /usr/local/include/boost/python/object/value_holder.hpp: In instantiation of `boost::python::objects::value_holder<Base>': /usr/local/include/boost/type_traits/alignment_of.hpp:52: instantiated from `boost::detail::alignment_of_impl<boost::python::objects::value_holder<Base> >' /usr/local/include/boost/python/object/instance.hpp:29: instantiated from `boost::alignment_of<boost::python::objects::value_holder<Base> >' ...snip... rawpointer.cpp:47: instantiated from here /usr/local/include/boost/python/object/value_holder.hpp:36: cannot declare field `boost::python::objects::value_holder<Base>::m_held' to be of type ` Base' /usr/local/include/boost/python/object/value_holder.hpp:36: because the following virtual functions are abstract: rawpointer.cpp:15: virtual const std::string& Base::get_name() rawpointer.cpp:14: virtual void Base::sayit() const make: *** [rawpointer.o] Error 1 and if I only expose the derived classes, the code compiles but then I get a runtime error when I try and import the class in python >>> import rawpointer Traceback (most recent call last): File "<stdin>", line 1, in ? RuntimeError: extension class wrapper for base class 4Base has not been created yet >>> Below is my example code. Suggestions welcomed! John Hunter // work with raw pointers #include <iostream> #include <string> #include <boost/python.hpp> #include <boost/python/manage_new_object.hpp> using namespace boost::python; class Base { public: virtual ~Base() {}; virtual void sayit() const=0; virtual const std::string& get_name()=0; private: }; class Foo : public Base { public: Foo() : _name("Foo") {} void sayit() const { std::cout << "Foo" << std::endl; } const std::string& get_name() {return _name;} private: const std::string _name; }; class Bar : public Base { public: Bar() : _name("Bar") {} void sayit() const { std::cout << "Bar" << std::endl; } const std::string& get_name() {return _name;} private: const std::string _name; }; Base* barfactory(){ return new Bar(); } Base* foofactory(){ return new Foo(); } std::string simonsays(Base* p) {return p->get_name();} BOOST_PYTHON_MODULE_INIT(rawpointer) { class_<Base>("Base", no_init) .def("sayit", &Base::sayit); class_<Foo, bases<Base> >("Foo") .def("sayit", &Foo::sayit); class_<Bar, bases<Base> >("Bar") .def("sayit", &Bar::sayit); def("foofactory", foofactory, return_value_policy<manage_new_object>()); def("barfactory", barfactory, return_value_policy<manage_new_object>()); def("simonsays", simonsays); }

2 2

Why file_system build on msvc 6.5 is only dynamic?
by Daniel Yerushalmi 20 Dec '02

20 Dec '02

Hi All I got filesyetm from the CVS and build it using bjam (no args with VCVARS32.BAT of msvc 6.5) Only the folder: runtime-link-dynamic was created under bin/lisbfs.lib/msvc. Other libraies (i.e. thread) build by default also runtime-link-static. What should I do to do the build with static run time library? Thanks Daniel

3 5

Re: [Boost-Users] Re: Re: Preprocessor library question
by Tanton Gibbs 20 Dec '02

20 Dec '02

> Are all the record lengths constant at any given time? > > Paul Mensonides Yes, for any given invocation of the program the record lengths and the record field lengths are constant. It is only with different invocations of the program that the record lengths or field lengths can change.

1 0

Re: [Boost-Users] Re: Preprocessor library question
by Tanton Gibbs 20 Dec '02

20 Dec '02

Thanks for your response, I'll look through it and try to get a full grasp on everything you said. Basically, my problem is this I have to read in a file of fixed length records, manipulate them (e.g., sort, dedup, group, some custom processing ) and then write them out. There are about 40M records, so I want it to be as fast as possible. If I know the length of the record fields ahead of time, it is MUCH more efficient. However, I would like the field lengths to be customizable at runtime...I thought if I could precompute the program for various values of the 3 fields, then I could have the best of both worlds. However, I forgot about all the template instantiations...perhaps they'll just have to recompile when they want a new field length. Tanton ----- Original Message ----- From: "Paul Mensonides" <yg-boost-users(a)m.gmane.org> To: <boost-users(a)yahoogroups.com> Sent: Thursday, December 19, 2002 1:56 AM Subject: [Boost-Users] Re: Preprocessor library question > > "Tanton Gibbs" <thgibbs(a)deltafarms.com> wrote in message > news:024e01c2a725$6814d720$b048cc18@Corp.Acxiom.net... > > I'm trying to create a template class based on user input. For example: > > > > template< int i, int j, int k > class T {}; > > > > int main() { > > int i, j, k; > > cin >> i >> j >> k; > > T<i, j, k> t; > > } > > > > Naturally, this is not possible, as i, j, and k must be constants. > Therefore, I would like to limit the maximum value of i, j, and k to 100 and > create all permutations for T<i,,j,k> at compile time. Basically, something > like this: > > Hi Tanton, > > You realize that this will give you a 101*101*101 permutation right? While > the pp-lib can generate it, that is a pretty big block of code to be inside > a single function. I would try to separate it into separate functions if > possible: > > template<int i, int j, int k> struct bound { > static void target() { > T<i, j, k> t; > // ... > } > }; > > typedef void (* pf)(); > > template<int i, int j> pf bind(int k) { > switch (k) { > case 0: > return &bound<i, j, 0>::target; > break; > case 1: > return &bound<i, j, 1>::target; > break; > > // ... > > default: > return 0; > } > } > > template<int i> pf bind(int j, int k) { > switch (j) { > case 0: > return bind<i, 0>(k); > case 1: > return bind<i, 1>(k); > > // ... > > default: > return 0; > } > } > > pf bind(int i, int j, int k) { > switch (i) { > case 0: > return bind<0>(j, k); > case 1: > return bind<1>(j, k); > > // ... > > default: > return 0; > } > } > > int main() { > int i, j, k; > std::cin >> i >> j >> k; > bind(i, j, k)(); > // ... > } > > Will something like that work for you? Something similar to this is *way* > better than having an if structure with 101*101*101 conditional tests. If > so, here is an implementation: > > #include <iostream> > #include <boost/preprocessor/iteration/local.hpp> > > #define LIMIT 100 > > template<int i, int j, int k> struct bound { > static void target() { > std::cout << i << ' ' << j << ' ' << k << &std::endl; > return; > } > }; > > void overflow() { > std::cout << "overflow" << &std::endl; > return; > } > > typedef void (* pbound_f)(); > > template<int i, int j> pbound_f bind(int k) { > switch (k) { > #define BOOST_PP_LOCAL_MACRO(k) \ > case k: \ > return &bound<i, j, k>::target; \ > /**/ > #define BOOST_PP_LOCAL_LIMITS (0, LIMIT) > #include BOOST_PP_LOCAL_ITERATE() > default: > return &overflow; > } > } > > template<int i> pbound_f bind(int j, int k) { > switch (j) { > #define BOOST_PP_LOCAL_MACRO(j) \ > case j: \ > return bind<i, j>(k); \ > /**/ > #define BOOST_PP_LOCAL_LIMITS (0, LIMIT) > #include BOOST_PP_LOCAL_ITERATE() > default: > return &overflow; > } > } > > pbound_f bind(int i, int j, int k) { > switch (i) { > #define BOOST_PP_LOCAL_MACRO(i) \ > case i: \ > return bind<i>(j, k); \ > /**/ > #define BOOST_PP_LOCAL_LIMITS (0, LIMIT) > #include BOOST_PP_LOCAL_ITERATE() > default: > return &overflow; > } > } > > int main() { > int i, j, k; > std::cin >> i >> j >> k; > bind(i, j, k)(); > return 0; > } > > This works, but takes forever to compile--at least on Comeau C++. The > reason is not the use of the pp-lib though (that is fast), it is because of > the sheer amount of template instantiations. E.g. you get 101 > instantiations of the one-template-argument "bind," 10,201 instantiations of > the two-template-argument "bind," and 1,030,301 instantiations of the > "target" function (+ 1,030,301 instantiations of "T"). Even if you use the > "if/else if" statements (or nested switches), you still going to get > instantiations of "T" in the millions. That means that you have to 1) bite > the bullet and give up trying to do whatever you're doing with compile-time > values or 2) seriously reduce the maximum value (to about 10, for example). > In any case, the pp-lib can generate this, direct nested switches, or even > the permutations along the lines of "if/else if." The problem is massive > instantiation and massive code bloat no matter how you do it. IMHO, it just > isn't worth it. > > Another idea is to have an array of function pointers: > > pbound_f array[101][101][101] = { ... }; > > ...and initialize the elements with instantiations of some fully bound > function template (the pp-lib can, of course, do this as well). And use it > like this: > > array[i][j][k](); > > This will only avoid the first 10,302 instantiations though. You are still > going to get template instantiation in the millions. What are you trying to > do exactly? Maybe there is a better way. > > > Naturally, I don't want to type all that in myself, so I was hoping the > boost preprocessor library could do it for me. If someone knows of a way to > do it, please let me know. > > Regards, > Paul Mensonides > > > > > > > > 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/ > > > >

2 1

Using Boost.Build for non Boost projects?
by Felix E. Klee 19 Dec '02

19 Dec '02

Hi, from the Boost.Build documentation it is not clear to me whether Boost.Build is a system specifically designed for building Boost libraries or whether it is a general purpose build system. For example in the "Getting Started" section there are examples for setting up an independent project whereas in the "Design Criteria" section it is shown that Boost.Build was specifically designed for building Boost libraries. Now I wonder whether it is wise to use Boost.Build for non Boost projects or whether I should set up my own build system based on the original Perforce Jam (eg. because Boost.Build might become tightly integrated with Boost in the future). Felix

2 1

Build boost with vc7 toolset failed.
by Black Ice 19 Dec '02

19 Dec '02

vc 7 boost 1.29.0 set BOOST_ROOT=D:\boost\boost_1_29_0 set VISUALC="C:\Program Files\Microsoft Visual Studio .NET\Vc7" bjam "-sTOOLS=vc7" Command line error D2016 : '/Za' and '/Ze' command-line options are incompatible Any suggestion are appreciated.

2 1

Another threads question...
by Martin Johnson 19 Dec '02

19 Dec '02

Hi, Just to get it through my thick skull. >The threadmon.dll is a seperate library that's always dynamically linked. Then why not make threads a dynamic lib. As an exercise I attempted this though as I found that the template methods of condition a little troublesome. Could this not be reworked by reworking or typing the condition class. I am able to build the lib as a dll with threadmon.cpp included. It involves exporting all classes and crude hack to condition *just* to get it to work. It would appear to function correctly as far as I can see. With the cleanup handlers being called without requiring a seperate dll, though I guess this puts a static link a little out of the picture. But why would I static link anyway, for distribution purposes, but I have to distribute threadmon.dll What do you think? I am just trying to think of a way around it, I know you have been there done that but i just need to appreciate this a little better. Regards Martin Johnson

2 1

MacOS X MSL Mach-O Problem with Threads
by Bobby Thomale 19 Dec '02

19 Dec '02

It's me again with weird problems compiling Boost on the Mac! :-) I just converted my MacOS X code from CFM to Mach-O and I ran into another small compilation problem. This time, it is the thread code. Now that I am moved over to Mach-O, the _POSIX_THREADS flag is true, causing posix_features.hpp to set BOOST_HAS_PTHREADS to true. This seems to be causing all sorts of compiler errors. Probably due to the fact that, even though some of the posix headers are being included, I am using the MSL headers rather than the BSD headers, and my understanding is that none of that posix stuff will actually work until I eject the MSL in favor of the Unix C headers, which I am not prepared to do right now. That and the fact that since I am using Carbon, TARGET_CARBON is also true, therefore BOOST_HAS_MPTASKS is getting set to true. So anyway ... BOOST_HAS_PTHREADS and BOOST_HAS_MPTASKS are both getting defined. I would like to be able to control whether BOOST_HAS_PTHREADS gets defined, because I am actually wanting to use the MP libraries instead, despite _POSIX_THREADS being defined. It looks like how you handled this same problem with Windows was by adding a !defined(BOOST_HAS_WINTHREADS) to the condition as follows: # if defined(_POSIX_THREADS) && (_POSIX_THREADS+0 >= 0) && !defined(BOOST_HAS_WINTHREADS) # define BOOST_HAS_PTHREADS # endif One solution would be to add an additional check for MP Tasks as follows: # if defined(_POSIX_THREADS) && (_POSIX_THREADS+0 >= 0) && !defined(BOOST_HAS_WINTHREADS) && !defined(BOOST_HAS_MPTASKS) # define BOOST_HAS_PTHREADS # endif I did this in my local working copy and it seems to have fixed the problem. I had to add an additional "#define BOOST_HAS_MPTASKS" to my user.hpp to make sure that BOOST_HAS_MPTASKS got defined before the above check. I am not sure if this is the best way or if there is a better way to solve this problem. I suppose another approach would be to check for !defined(TARGET_CARBON) in the above check - if carbon is on, MP Tasks will get turned on. Or you could in the place where BOOST_HAS_MPTASKS gets defined, undef the BOOST_HAS_PTHREADS. But the way I solved it in my local copy (shown above) using !defined(BOOST_HAS_MPTASKS) seemed the cleanest to me, especially since it looks like it is how you solved the same problem for Windows. Anyway - I tried hard to find a way to make this compile without changing anything but my user.hpp but I failed. (If someone has any ideas I'd love to hear them.) -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ ---------------------------------------------------------------------

2 2

compilation error with boost_1.29.0
by Volker Boerchers 19 Dec '02

19 Dec '02

Hi, I'm getting the following error on Linux 2.2.16 / Suse 7.0 / g++ 2.95.2 / glibc 2.1.3: ../../../../../include/boost/pool/detail/ct_gcd_lcm.hpp:43: sorry, not implemented: `static_cast_expr' not supported by dump_expr ../../../../../include/boost/pool/detail/ct_gcd_lcm.hpp:43: sorry, not implemented: `static_cast_expr' not supported by dump_expr The following patch fixes it: --- include/boost/pool/detail/ct_gcd_lcm.hpp.orig Thu Dec 19 15:10:54 2002 +++ include/boost/pool/detail/ct_gcd_lcm.hpp Thu Dec 19 14:58:41 2002 @@ -38,7 +38,7 @@ BOOST_STATIC_CONSTANT(unsigned, A_mod_B_ = A % B); BOOST_STATIC_CONSTANT(unsigned, value = (::boost::details::pool::details::ct_gcd_helper< - B, static_cast<unsigned>(A_mod_B_), + B, A_mod_B_, ::boost::type_traits::ice_eq<A_mod_B_, 0>::value >::value) ); }; What is the cast good for anyway? It seems redundant. Regards, Volker -- Volker Boerchers <vboerchers(a)tecon.de> System Engineer TECON Systems AG, Perlengraben 2, 50676 Köln, http://www.tecon.de Tel: +49-221-92007-55, Fax: +49-221-92007-77

1 0

Preprocessor library question
by Tanton Gibbs 19 Dec '02

19 Dec '02

I'm trying to create a template class based on user input. For example: template< int i, int j, int k > class T {}; int main() { int i, j, k; cin >> i >> j >> k; T<i, j, k> t; } Naturally, this is not possible, as i, j, and k must be constants. Therefore, I would like to limit the maximum value of i, j, and k to 100 and create all permutations for T<i,,j,k> at compile time. Basically, something like this: int main() { int i, j, k; cin >> i >> j >> k; if( i == 0 && j == 0 && k == 0 ) { T<0,0,0> t; } else if( i == 0 && j == 0 && k == 1 ) { T<0,0,1> t; } ... else if( i == 100 && j == 100 && k == 100 ) { T<100,100,100> t; } } Naturally, I don't want to type all that in myself, so I was hoping the boost preprocessor library could do it for me. If someone knows of a way to do it, please let me know. Thanks! Tanton [Non-text portions of this message have been removed]

2 1

Matrix-Matrix reference
by Wilken, Marc 18 Dec '02

18 Dec '02

Hello, does ublas support a matrix method like blitz++ .reference() method? (This method allows different matrices to share the same matrix datas.) Marc Wilken This e-mail contains confidential information for the exclusive attention of the intended addressee. Any access of third parties to this e-mail is unauthorised. Any use of this e-mail by unintended recipients such as copying, distribution, disclosure etc. is prohibited and may be unlawful. When addressed to our clients the content of this e-mail is subject to the General Terms and Conditions of GL's Group of Companies applicable at the date of this e-mail. GL's Group of Companies does not warrant and/or guarantee that this message at the moment of receipt is authentic, correct and its communication free of errors, interruption etc.

2 2

Problem with "this" and shared_ptr
by Michael Brinkmann 18 Dec '02

18 Dec '02

Hello, given the following code which uses shared_ptrs, I'm getting a double-free onto an object of type A: ------------------------------------------------------ #include <boost/shared_ptr.hpp> #include <list> #include <iostream> class A { public: A(void){} void makeSomething(void); void makeSomethingOther(void) { std::cout << "A" << std::endl; } }; typedef boost::shared_ptr<A> APtr; class B { public: B(const APtr& a) : mA(a) {} void makeSomething(void) { std::cout << "B" << std::endl; mA->makeSomethingOther(); } private: APtr mA; }; void A::makeSomething(void) { B b(this); // here I want to hand over the "A" shared pointer to "B", but I have only my "this" at hand. std::cout << "A" << std::endl; b.makeSomething(); } int main(void) { APtr a(new A); a->makeSomething(); } ------------------------------------------------------ (please don't ask me about why I'm doing it in that way, the code is stripped down from a much bigger program) I understand that the problem results from the accesss to "this" in the commented line. Is there an elegant way to get the shared_ptr pointing to "this" from "this", which would be the solution to the fault? Or do I have to store a shared_ptr member variable referencing "this" in the class A which is set by a A::method from outside of A to reference it? (not very beautiful) Sorry if this is a FAQ, but I didn't find a solution on news.gmane.org kind regards Michael

4 6

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