- Boost-users - lists.boost.org

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 23 Dec '02

23 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