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

boost::shared_ptr and stl algorithms
by Bill Eidson 15 Apr '05

15 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

Will libraries built on WinNT run on Win98? (MinGW)
by Reed Hedges 31 Mar '05

31 Mar '05

I know that Win98 is not really supported, but is there any chance that libraries (specifically thread and regex) that were build on WinNT using MinGW work on Win98 (in MinGW)? My guess is no, but has anyone tried it? thanks reed

2 1

MultiArray questions
by Dr Mark H Phillips 24 Mar '04

24 Mar '04

Hi, I've recently found out about the existence of MultiArray and I am quite impressed! I was thinking of implementing something similar myself but now hopefully I don't have to! However I have a few questions that I'm hoping someone can answer. Question 1 ---------- In the user documentation there is an example which has some example code: for(index i = 0; i != 3; ++i) for(index j = 0; j != 4; ++j) for(index k = 0; k != 2; ++k) A[i][j][k] = values++; Why can't you change the != into <? Ie, do: for(index i = 0; i < 3; ++i) for(index j = 0; j < 4; ++j) for(index k = 0; k < 2; ++k) A[i][j][k] = values++; or can you? This would be more efficient I should think, and requiring that index types be ordered shouldn't be too onerous should it? Question 2 ---------- If I use the built-in "no-frills" C array type to represent a 2-dimensional array in row-major order, then I would access an element (i, j) by doing: a[ &a[0] + i*n + j ] where a is my m by n array. And if I wish to traverse a, in row-major order, I can do: for (int* ip=&(a[0]); ip<&(a[n*m]); ip+=n) { for (int* ijp=&(ip[0]); ijp<&(ip[n]); ++ijp) { visit(ijp); } } These are a very efficient ways of doing things, but it lacks somewhat in ease-of-generalization and in readbility. This is where the MultiArray library is useful. But do I lose in efficiency by going to MultiArray? Ie, in the simple case where base is 0, stride is 1, and when we traverse in row-major order, is the MultiArray library smart enough to do compile-time optimizations to generate code which is as efficient as the above? I am guessing that this sort of approach is what the Blitz++ library does?? Question 3 ---------- Is it possible to construct a new multi_array/multi_array_ref/const_multi_array_ref from an array_view by doing a deep copy of the view? A view is a nice way of looking at different parts of a MultiArray object in a readable way, but sometimes you might wish to turn this view into a more-efficiently represented object. Is this easy to do in the MultiArray library? Question 4 ---------- Sometimes you might have an object starts off being mostly accessed in row-major order, so you want a representation which works efficiently for this use. But down the track you might wish to change to mostly column-major access. Does MultiArray provide easy ways to transform from one underlying representation to another? Thanks, Mark Phillips.

3 2

[Date-Time] Issues
by Andrew V. Bronnikov 03 Feb '04

03 Feb '04

Hello, All! When I was familiarized with the great Boost Library one of the most inspiring part of it was the Date-Time Library. Date and time issues are very important in our project related with time series, so I immediately started to read docs, and tried to incorporate the lib as it became possible for us. As usual, problems hadn't kept waiting... :) Issues: 1. why gregorian::date and posix_time::ptime have no default constructors (possibly initializing them into some special value - good candidates are not_a_date_time, neg_inf or local_time (see next issue))? Lack of default ctors doesn't allow direct use of date-time objects in tuples and other containers requiring default-constructible classes. 2. why special_values enum has no "local_time" (or "now") item? It seems "special" enough, and - more important - it allows to pass the "initialize as current time" directive as a time initialization policy in templates. 3. why date, ptime, durations have no setters for their components (days, hours, minutes etc)? I guess it related with validity checking issues - am I right, or there are some other reasons? 4. why hours(), minutes() etc are classes, not simple time_duration factory functions? What the another level of inheritance for? Consider using a time_duration in lambda expressions (e.g. in the Spirit semantic actions): posix_time::time_duration dt; .... rule<> hours = uint_p [var(dt) += posix_time::hours(_1)] This will not compile because hours() is not a function. Instead, I must use something like a lazy constructor: rule<> hours = uint_p [var(dt) += bind(constructor<posix_time::hours>(), _1)] but it looks not so short as before. And - surprise! - it doesn't compile too, just because of the next problem: 5. neither of date, ptime or time_duration defines operator+=(). What is the reason for denying it? It seems quite natural to have a set of assignment operators for date_time classes, isn't it? 6. it would be great if GDTL classes will support explicit/implicit conversion functions/operators from/to older standard types like a time_t etc. It will allow smoother transition from old libraries to the GDTL. Thanx for the great work anyway! With best regards, Andrew V. Bronnikov.

2 2

Problems with boost build setup
by Michael Buksas 31 Jan '04

31 Jan '04

Hi all, I'm having newbie problems with linking against Boost libraries. Here's the situation: I can build the boost libraries without problem, and I'm using the default toolkit for my system, (Fedora Core 1) which is g++. Compiling is no problem, just linking. I can link the object files by hand, but not as part of using Boost.build. As a test, I grabbed an example program from the date_time library and it's corresponding build rule. This code compiles fine as part of Boost, but if I move it to my project space, I get linking errors. Here's my Jamfile: exe time_math : <lib>$(BOOST_ROOT)/build/boost_date_time time_math.cpp : <include>$(BOOST_ROOT) <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG ; and here's my Jamrules in the same directory: project-root ; path-global BOOST_ROOT : "/opt/boost-1.30.2" ; Here's the Jamfile from /opt/boost-1.30.2/libs/date_time/example/ exe time_math : <lib>../build/boost_date_time posix_time/time_math.cpp : <include>$(BOOST_ROOT) <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG ; And the environment variable is set: BOOST_BUILD_PATH=/opt/boost-1.30.2/tools/build When I run bjam from a clean build, here's what I get: gcc-C++-action bin/time_math/gcc/debug/runtime-link-dynamic/time_math.o gcc-Link-action bin/time_math/gcc/debug/runtime-link-dynamic/time_math bin/time_math/gcc/debug/runtime-link-dynamic/time_math.o(.gnu.linkonce.t._ZN5boost9date_time15month_formatterINS_9gregorian10greg_monthENS0_13simple_formatEE12format_monthERKS3_RSo+0x3a): In function `boost::date_time::month_formatter<boost::gregorian::greg_month, << edited for brevity >> In function `boost::date_time::month_formatter<boost::gregorian::greg_month, << edited for brevity >> collect2: ld returned 1 exit status export LD_LIBRARY_PATH g++ -g -o "bin/time_math/gcc/debug/runtime-link-dynamic/time_math" "bin/time_math/gcc/debug/runtime-link-dynamic/time_math.o" -Wl,-rpath-link,. ...failed gcc-Link-action bin/time_math/gcc/debug/runtime-link-dynamic/time_math... ...failed updating 1 target... So things are compiling, but not linking. I must not have the configuration for Boost.build correct, but I've tried everything I can think of. Any help would be appreciated. Thanks, Mike Buksas -- Michael Buksas -- michael(a)buksas.net -- www.buksas.net

2 1

Properties in a subgraph
by Hugues Joly 30 Jan '04

30 Jan '04

Hi, I'd like to clarify a point about the graph properties accessed through a subgraph. According to the documentation of get(PropertyTag, subgraph& g): vertex and edge properties are shared by all subgraphs, so changes to a property through a local vertex descriptor for one subgraph will change the property for the global vertex descriptor, and therefore for all other subgraphs (c.f. boost-1.30.2/libs/graph/doc/subgraph.html). Here, I'm sending you a small program inspired by the boost-1.30.2/libs/graph/example/subgraph.cpp example. >From its behavior, it seems that: 1) A property value is not shared between the global descriptor and its corresponding local descriptors. 2) we need to initialize property values for each of the subgraphs. For example, if I set a name "A" for the global vertex descriptor A, that property is not seen through the corresponding local vertex descriptors. Is this a case of misuse or is it a bug? __________________________________________________________ Lèche-vitrine ou lèche-écran ? magasinage.yahoo.ca

2 2

Re: [Boost-users] Using boost::format with Lambda expressions
by Shawn Church 29 Jan '04

29 Jan '04

Jaakko Jarvi (jajarvi(a)cs.indiana.edu) wrote: > Lambda and format don't play well together, I noticed :( > Here's a code that works however, with some explanation. > Not pretty. > > Best, Jaakko > ... > format f("%-10s|") ; > for_each(Foos.begin(), Foos.end(), > cout << ret<format&>(var(f) % bind(&foo::name, _1))); > > } > > // format defines operator% as a member, which takes precedence over > // % defined by lambda. Therefore one must make the format object to > // be a lambda functor. var does that. > // Var, however, cannot take a temporary object (it holds a reference to > // the wrapped object). That's why the variable f. > // ret<format&> informs lambda about the return type of formats % operator. OK, that is just what I was looking for, thanks!!! I tried all of those things but not in the right combination. Is there any resources (i.e. example programs or additional documentation) available for the lambda library. I have read through the test code already. Thanks,

2 1

Using boost::format with Lambda expressions
by Shawn Church 29 Jan '04

29 Jan '04

I may be missing something simple here but I have tried everything I can think of and cannot get the following to work (simplified from a project I am working on): Given a class such as: class foo{ public: foo(const char* name): _name(name) {} const char* name() const {return _name.c_str();} private: std::string _name;}; I can do the following without any problems: std::vector<foo> Foos; ... for_each(Foos.begin(), Foos.end(),cout << bind(&foo::name, _1) << "|"); This prints a list of all the names in the vector of Foo objects by calling the Foo::name() method. It would be nice to be able to do something like the following: for_each(Foos.begin(), Foos.end(), cout << format("%-10s|") % bind(&foo::name, _1); I have tried everything I can think of including extending the return type deduction of the lambda library to include the "%" operator as used by format and binding directly to the basic_format::operator% method. In every case I get 40 or so compile errors explaining why my 30 character statement is wrong :-) Does anyone have an example of this usage that works? This is not a high priority as I can obviously just format the value returned by the Foo::name() method but it would be nice to have this technique available when the need arises. I adapated the code above from a test program that demonstrates the problem in detail. I can provide the test program if anyone is interested (just tell me what to do with it). Thankyou for any help you can provide, Shawn Church sl_church(a)sbc_global.net

4 3

Storing vertex objects and edge objects in a BGL graph?
by Hugues Joly 29 Jan '04

29 Jan '04

Hi, I'd like to know if it's possible to create a BGL graph that uses custom-made classes for the nodes and the edges. While looking to your documentation, I came across the following: "Many graph representations (such as adjacency lists) do not store actual vertex objects, while others do (e.g., pointer-linked graphs)." (c.f. boost-1.30.2/libs/graph/doc/quick_tour.html) Is the pointer-linked graph implementation supplied from boost or do I have to create one and use external adaptation for using it with your library? Thanks in advance. __________________________________________________________ Lèche-vitrine ou lèche-écran ? magasinage.yahoo.ca

2 3

1.31.0??
by Phil Hornby 29 Jan '04

29 Jan '04

Hi all, Just wondering when a release of 1.31.0 is planned for? Thanks... -- Phil "Requirements - what are they I just hack something together that does what I think they want" ;)

2 3

RE: [Boost-users] Re: MultiArray questions
by Ben Hutchings 28 Jan '04

28 Jan '04

Dr Mark H Phillips <mark(a)austrics.com.au> wrote: > On Sun, 2004-01-25 at 04:47, garcia wrote: <snip> > > >Why can't you change the != into <? Ie, do: > > > > > > for(index i = 0; i < 3; ++i) > > > for(index j = 0; j < 4; ++j) > > > for(index k = 0; k < 2; ++k) > > > A[i][j][k] = values++; > > > > > >or can you? This would be more efficient I should think, and > > >requiring that index types be ordered shouldn't be too onerous > > >should it? > > > > > You can change the != into a < if you like. I don't see any > > good reason why one should be more efficient than the other. I > > personally use != because it more closely matches how I write > > for loops using iterators. > > So in short, that's a matter of personal preference. > > I would have thought < was more efficient. Isn't "i != j" > implemented, at machine level, more or less by "i > j || i < j". > So one compare would be cheaper than two. Or have I got this > wrong? <snip> A test for i != j typically compiles to an instruction sequence like: CISC: RISC: CMP j,i LD r1,i BEQ test_failed LD r2,j SUB. r0,r1,r2 BEQ test_failed (CMP is a subtraction which doesn't store its result but sets condition flags. BEQ is branch-if-equal. RISC processors need to have all arithmetic operands in registers, but generally they have a lot of registers so the variables may well be in registers already, making the LDs unnecessary.) A test for i < j (assuming i and j are unsigned) would be like: CISC: RISC: CMP i,j LD r1,i BCC test_failed LD r2,j SUB. r0,r2,r1 BCC test_failed (BCC is branch-if-carry-flag-clear. Order of arguments varies between assembly languages, so don't worry too much about that.) These instruction sequences usually have identical timing properties (the exact time taken depends on caching and branch prediction). Theoretically, an architecture which had a combined comparison and conditional branch could make != a little faster since it requires only bitwise comparison whereas < requires carrying between bits (longer signal propagation time). However, the world is moving away from such architectures - even x86 processors are designed to make the simple instructions run fast, not the complex ones. For a generic algorithm that uses iterators, comparing with < requires that the iterators be random-access. If this isn't essential to the algorithm, it would be better to use !=. So it's a good habit to use i != j as the loop condition if i can definitely never be greater than j.

2 1

Using boost::shared_ptr<> with G++'s -fno-rtti
by Jonathan Lennox 28 Jan '04

28 Jan '04

Is it possible to use boost::shared_ptr<> without RTTI being enabled? I'm trying to port some code to the Sharp Zaurus, and its GUI libraries are all compiled with the G++ flags -fno-exceptions -fno-rtti. Boost seems to support the former flag just fine, but has problems with the latter: g++ -g -O2 -Wall -fno-rtti -fno-exceptions -o sipua/main.o -c ../sipua/main.cpp In file included from ../libcine/boost/shared_ptr.hpp:27, from ../rtplib++/rtptypes.h:8, from ../rtplib++/rtpsession.h:14, from ../sipua/radio.h:11, from ../sipua/main.cpp:18: ../libcine/boost/detail/shared_count.hpp: In member function `virtual void* boost::detail::sp_counted_base_impl<P, D>::get_deleter(const std::type_info&)': ../libcine/boost/detail/shared_count.hpp:267: error: cannot use typeid with -fno-rtti In file included from ../rtplib++/rtptypes.h:8, from ../rtplib++/rtpsession.h:14, from ../sipua/radio.h:11, from ../sipua/main.cpp:18: ../libcine/boost/shared_ptr.hpp: In function `D* boost::get_deleter(const boost::shared_ptr&)': ../libcine/boost/shared_ptr.hpp:431: error: cannot use typeid with -fno-rtti What is the typeid call in the get_deleter functions doing? Is there any way to work around or disable this? Thanks. -- Jonathan Lennox lennox at cs dot columbia.edu

2 2

Disabling synchronization in Boost.Thread
by Aaron W. LaFramboise 28 Jan '04

28 Jan '04

Hi, Is there some easy way to disable all of the synchronization primatives in Boost.Thread, or in other words, make them all no-ops? I have written some generic code to be used in both singlethreaded and multithreaded environments, and it would be convenient for me to simply be able to 'switch off' synchronization when I know that I am in a singlethreaded environment, without having to uglify my code with ifdef's or similar. Simply disabling threads in Boost seems to cause synchronization primatives to fail to compile at all. Aaron

3 2

Re: MultiArray questions
by garcia 28 Jan '04

28 Jan '04

Dr Mark H Phillips <mark(a)austrics.com.au> wrote: >Hi, > >I've recently found out about the existence of MultiArray and I >am quite impressed! I was thinking of implementing something >similar myself but now hopefully I don't have to! However I have >a few questions that I'm hoping someone can answer. > > > Hi Mark. Thank you for the compliments on MultiArray. I hope that it meets your needs, and if not, I hope I can be of some service. >Question 1 >---------- > >In the user documentation there is an example which has >some example code: > > for(index i = 0; i != 3; ++i) > for(index j = 0; j != 4; ++j) > for(index k = 0; k != 2; ++k) > A[i][j][k] = values++; > >Why can't you change the != into <? Ie, do: > > for(index i = 0; i < 3; ++i) > for(index j = 0; j < 4; ++j) > for(index k = 0; k < 2; ++k) > A[i][j][k] = values++; > >or can you? This would be more efficient I should think, and >requiring that index types be ordered shouldn't be too onerous >should it? > > > You can change the != into a < if you like. I don't see any good reason why one should be more efficient than the other. I personally use != because it more closely matches how I write for loops using iterators. So in short, that's a matter of personal preference. >Question 2 >---------- > >If I use the built-in "no-frills" C array type to represent a >2-dimensional array in row-major order, then I would access >an element (i, j) by doing: > > a[ &a[0] + i*n + j ] > >where a is my m by n array. And if I wish to traverse a, in >row-major order, I can do: > > for (int* ip=&(a[0]); ip<&(a[n*m]); ip+=n) { > for (int* ijp=&(ip[0]); ijp<&(ip[n]); ++ijp) { > visit(ijp); > } > } > >These are a very efficient ways of doing things, but it lacks >somewhat in ease-of-generalization and in readbility. This is where >the MultiArray library is useful. But do I lose in efficiency by >going to MultiArray? Ie, in the simple case where base is 0, stride >is 1, and when we traverse in row-major order, is the MultiArray >library smart enough to do compile-time optimizations to generate >code which is as efficient as the above? > > > The MultiArray implementation doesn't currently do anything special for the case that the base is 0. I'm in the midst of doing some performance analysis on the library, and so far, to be honest, it looks like there is a performance hit. I'm investigating what is happening, and I hope to translate my findings into performance improvements. I would liket hose to be available by May of this year. >Is it possible to construct a new >multi_array/multi_array_ref/const_multi_array_ref from an array_view >by doing a deep copy of the view? > >A view is a nice way of looking at different parts of a MultiArray >object in a readable way, but sometimes you might wish to turn this >view into a more-efficiently represented object. Is this easy to do >in the MultiArray library? > > It is my intention that a new multi_array be constructible from an existing view, but on looking back through my code and test cases, the library does not currently support it. This is an oversight on my part. I hope to have this functionality available in CVS by the end of this coming week (which coincides with the end of the month). I'm afraid that the functionality won't make the upcoming Boost release however. >Question 4 >---------- > >Sometimes you might have an object starts off being mostly >accessed in row-major order, so you want a representation which works >efficiently for this use. But down the track you might wish to change >to mostly column-major access. Does MultiArray provide easy ways to >transform from one underlying representation to another? > > > There is no direct means to change the underlying representation of an existing array. The layout of an array is determined at construction. You can however assign a row-major multi_array to a column-major multi_array. >Thanks, > > > My pleasure. Thank you for your questions and comments. Incidentally, I am now subscribed to Boost-Users. I apologize for any discussion I have missed or inaccessibility resulting from my absence. Cheers, ron

2 1

Interfacing the .pyd with other .dll
by Shukla, Nitin (Export) 28 Jan '04

28 Jan '04

Hello, I am trying to build an application where my Python/C interface dynamic library (built using boost) is to call on function in another (windows) dll file containing the C function. I am using the 'bjam' tool to build the my Python/C interface (.pyd) file built it is giving me error. The C source file (which calls the function in another dll and used by boost to build the python/C interface ".pyd" files) gets compiled to generate the object file but linker fails to built the respective ".lib" and ".pyd" files as it doesn't get to link to the dll file defining a C function. I am fairly new to using bjam tool and my jamfile is a simple one. It looks like this: # Specify our location in the boost project hierarchy subproject libs/python/example/tutorial/nitin ; # Include definitions needed for Python modules import python ; extension world # Declare a Python extension called hello : main.cpp # source <dll>../../../build/boost_python # dependencies ; I do not know how can I specify bjam to compile and link with other dll for build the ".pyd" and ".lib" file. Can anyone help me how can I specify this in my jam file? It will be usefully for me if some one can tell where I can get documentation on writing jam files. I am using WinPython 2.3.2. I have built boost on Windows 2000 using MinGW compilers. Thanks in advance, Nitin

2 1

Test library fails to link on OS X 10.3 Panther
by Pierre-Michel Tremblay 27 Jan '04

27 Jan '04

Scott Lamb! I have the exact same set up as you have and I end up with the same error message as you do. Same as your earlier message: I've downloaded boost-1.30.2 and boost-jam-3.1.7 to my PowerBook running Mac OS X 10.3 (Panther). After installing boost-jam without problems, I'm attempting to build the boost test library as follows: $ uname -a Darwin spiff.local 7.2.0 Darwin Kernel Version 7.2.0: Thu Dec 11 16:20:23 PST 2003; root:xnu/xnu-517.3.7.obj~1/RELEASE_PPC Power Macintosh powerpc $ gcc_select Current default compiler: gcc version 3.3 20030304 (Apple Computer, Inc. build 1495) $ cd boost-1.30.2/libs/test/build $ bjam -sTOOLS=darwin ----- Same errors as you: ...failed darwin-Link-DyLib-action libs/test/build/bin/libboost_prg_exec_monitor.dylib/darwin/debug/ runtime-link-static/shared-linkable-true/ libboost_prg_exec_monitor.dylib... ... ...failed darwin-Link-DyLib-action libs/test/build/bin/libboost_test_exec_monitor.dylib/darwin/debug/ runtime-link-static/shared-linkable-true/ libboost_test_exec_monitor.dylib... ... ...failed darwin-Link-DyLib-action libs/test/build/bin/libboost_unit_test_framework.dylib/darwin/debug/ runtime-link-static/shared-linkable-true/ libboost_unit_test_framework.dylib... ... ...failed updating 6 targets... ...updated 283 targets... Have you or anyone successfully resolved the problem? Thanks. PM

1 0

compilation problem with property_map?
by lr 27 Jan '04

27 Jan '04

hello all, i was wondering if anyone could help me with this compilation error. gcc indicates that the error is in put(), specifically it cannot match the operator for [bool&] on property_map.hpp:316. the full output is included below. the origin of the error is caused in destructor code (when objects get out of scope in testgdlgraph.cpp). if i need to supply more information about the code i am writing let me know. i am hesitant because it is fairly complicated, as i am having trouble trying to replicate this problem in a simple example. thanks leonid ps. boost rocks, keep up the good work! the compiler error: /usr/include/boost/property_map.hpp: In function `void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*&, void*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag>, Reference = ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*&, K = bool, V = const ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*]': testgdlgraph.cpp:1488: instantiated from `void boost::put(Property, boost::adj_list_helper<Config, Base>&, const Key&, const Value&) [with Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>, boost::listS, boost::setS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>::config, Base = boost::bidirectional_graph_helper_with_property<boost::detail::adj_list_gen<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, st1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>, boost::listS, boost::setS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>::config>, Property = ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, Key = bool, Value = const ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*]' testgdlgraph.cpp:533: instantiated from `boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::edge_descriptor ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::add_edge(boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::vertex_descriptor&, boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::vertex_descriptor&) [with parameter_t = par_t, domain_value_t = dv_t, sr_element_t = test1()::ser_t]' testgdlgraph.cpp:104: instantiated from here /usr/include/boost/property_map.hpp:316: no match for `const boost::adj_list_edge_property_map<boost::bidirectional_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*&, void*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag>& [bool&]' operator /usr/include/boost/graph/detail/adjacency_list.hpp:2383: candidates are: Ref boost::adj_list_edge_property_map<Directed, Value, Ref, Vertex, Property, Tag>::operator[](boost::detail::edge_desc_impl<Directed, Vertex>) const [with Directed = boost::bidirectional_tag, Value = ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, Ref = ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*&, Vertex = void*, Property = boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, Tag = ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag] /usr/include/boost/property_map.hpp: In function `void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, const ngdl::domain_map<par_t, dv_t>*, const ngdl::domain_map<par_t, dv_t>*&, void*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag>, Reference = const ngdl::domain_map<par_t, dv_t>*&, K = bool, V = const ngdl::domain_map<par_t, dv_t>*]': testgdlgraph.cpp:1488: instantiated from `void boost::put(Property, boost::adj_list_helper<Config, Base>&, const Key&, const Value&) [with Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>, boost::listS, boost::setS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>::config, Base = boost::bidirectional_graph_helper_with_property<boost::detail::adj_list_gen<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, st1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>, boost::listS, boost::setS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_vertex_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, boost::no_property, boost::listS>::config>, Property = ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, Key = bool, Value = const ngdl::domain_map<par_t, dv_t>*]' testgdlgraph.cpp:537: instantiated from `boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::edge_descriptor ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::add_edge(boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::vertex_descriptor&, boost::graph_traits<boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_vertex_vertex_tag, ngdl::GDLvertex::GDL_vertex_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_table_tag, ngdl::GDLtable<parameter_t, domain_value_t, sr_element_t>*, boost::property<ngdl::GDLgraph<parameter_t, domain_value_t, sr_element_t>::GDL_edge_domain_map_tag, ngdl::GDLvertex<parameter_t, domain_value_t, sr_element_t>::domain_map_type*, boost::no_property> >, boost::no_property, boost::listS> >::vertex_descriptor&) [with parameter_t = par_t, domain_value_t = dv_t, sr_element_t = test1()::ser_t]' testgdlgraph.cpp:104: instantiated from here /usr/include/boost/property_map.hpp:316: no match for `const boost::adj_list_edge_property_map<boost::bidirectional_tag, const ngdl::domain_map<par_t, dv_t>*, const ngdl::domain_map<par_t, dv_t>*&, void*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag>& [bool&]' operator /usr/include/boost/graph/detail/adjacency_list.hpp:2383: candidates are: Ref boost::adj_list_edge_property_map<Directed, Value, Ref, Vertex, Property, Tag>::operator[](boost::detail::edge_desc_impl<Directed, Vertex>) const [with Directed = boost::bidirectional_tag, Value = const ngdl::domain_map<par_t, dv_t>*, Ref = const ngdl::domain_map<par_t, dv_t>*&, Vertex = void*, Property = boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_table_tag, ngdl::GDLtable<par_t, dv_t, test1()::ser_t>*, boost::property<ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag, const ngdl::domain_map<par_t, dv_t>*, boost::no_property> >, Tag = ngdl::GDLgraph<par_t, dv_t, test1()::ser_t>::GDL_edge_domain_map_tag] make[2]: *** [testgdlgraph.o] Error 1 make[1]: *** [check-am] Error 2 make: *** [check-recursive] Error 1

2 1

vector_indexing_suite issue
by Jeff Holle 27 Jan '04

27 Jan '04

I am successfully using vector_indexing_suite in following code: class_<std::vector >("vector_B") .def(vector_indexing_suite<std::vector >()) ; However, I find that it requires that the B class conforms to the Equality Comparable concept where the STL standard only demands it to conform to the Assignable concept. I'm wondering if this is necessary, and if so how the operator== method should be coded. Can it simply always return true or false? Or compare "this" pointers?

2 1

CVS head build problem
by Jeff Holle 26 Jan '04

26 Jan '04

I downloaded the boost CVS head this morning and in attempting a re-build it, I found that my compiler, gcc v3.3, choked on the parmeter "-Wno-long-double". This problem was solved by changing line 61 of boost/tools/build/v1/gcc-tools.jam to: flags gcc CFLAGS : ; Suspect this wasn't a proper changed, but it worked for me.

2 1

boost::mpl:: operators ...power metafunction?
by Andy Little 26 Jan '04

26 Jan '04

Hi, I am implementing the mpl math operators for my physical_quantities type. Ideally I would like to declare a boost::mpl::power<A,B> metafunction. I would like to do: typedef Power_type<...> P ; pq_xx a; boost::mpl::power< pq_xx, P >::type b = run_time_power( a); OTOH: boost::mpl::power< P, pq_xx >::type b = run_time_power( a); (param order ... TBD) I am assuming it is ok to specialise plus, minus, multiplies etc in the boost::mpl namespace? I could of course put power (or whatever name) outside the boost::mpl namespace but that is not ideal. Any thoughts? regards Andy Little

2 2

how to create fixtures in unit test framework
by eli＠ce.berkeley.edu 25 Jan '04

25 Jan '04

1 0

bind1st and bind2nd together
by Hossein Haeri 25 Jan '04

25 Jan '04

Dear all, I've got a ternary function (which is std::find), and want to bind the first and second parameters (to the begining and the end of a std::vector). Then send the result to compose2 to check the equality for the end of the vector. Here is what I did: copy_if(istream_iterator<Terminal>(cin), istream_iterator<Terminal>(), back_inserter(temp), compose2(equal<set<Terminal>::iterator>(), bind1st(bind1st_3(ptr_fun(f), V_.begin()), V_.end()), V_.end()))); (I've prepared any goodie needed by ternary functions for the above statement: ptr_fun, bind1st_3, ...) Dev-C++ 4.9.8.0 (GCC 3.3.2 I think), gives me several errors (including "Reference to Reference" problem), and I'm nearly convinced not to continue it this way. Now, how do you, boost guys, do that? TIA, --Hossein __________________________________ Do you Yahoo!? Yahoo! SiteBuilder - Free web site building tool. Try it! http://webhosting.yahoo.com/ps/sb/

2 2

MPL Issue in apply.hpp in CVS
by Martin Ecker 25 Jan '04

25 Jan '04

Hello, I wanted to use boost::variant, so I got the Boost libraries from CVS. While developing a small test program I discovered an issue in the MPL header file apply.hpp that prevented successful compilation on MSVC 7.1. In particular, starting on line 245 in boost/mpl/apply.hpp it says // ISO98 C++, with minor concession to vc7 template< typename F, AUX_APPLY_N_PARAMS(i, typename T) > struct BOOST_PP_CAT(apply,i) { // Metafunction forwarding confuses vc7 typedef typename F::template apply< AUX_APPLY_N_PARAMS(i, T) >::type BOOST_MPL_AUX_LAMBDA_SUPPORT( BOOST_PP_INC(i) , BOOST_PP_CAT(apply,i) , (F, AUX_APPLY_N_PARAMS(i,T)) ) }; The first typedef in that struct should be // Metafunction forwarding confuses vc7 typedef typename F::template apply< AUX_APPLY_N_PARAMS(i, T) >::type type; Regards, Martin ---------------------------------------------------------------- Visit my pages on the Web: XEngine Project Page: http://xengine.sourceforge.net Private homepage: http://members.liwest.at/GroovingArts

2 2

Interval Library?
by David Brownell 25 Jan '04

25 Jan '04

I think I am looking for functionality that is contained with the Interval library, but am having a hard time digesting the documentation for this particular library. I would like an Interval that goes from a min_value to a max_value, where each value is the previous value + N. For example, the interval {2, 6, 10, 14, 18} has a minimum value of 2, a maximum value of 18, and increments by 4. Given this interval, I would like a function, Foo, that works as follows: Interval(2, 18, 4) i; i.Foo(2) == 2 i.Foo(6) == 2 i.Foo(0) == 2 i.Foo(18) == 18 i.Foo(20) == 18 i.Foo(5) == 6 i.Foo(3) == 6 Is this something that can be done with the Interval library, or am I missing the point? :) Thanks in advance for your help! David Brownell

3 3

Import Error: DLL load Failed
by Shukla, Nitin (Export) 24 Jan '04

24 Jan '04

Hello, I fairly new to the Boost tool. I have just build the Boost.Python 1.30.2. To get started I used the examples "getting_started1.cpp and getting_started2.cpp." and build the required DLLs using the bjam tool. I get following error when I try to import the module "getting_started1" into python : "ImportError: DLL load failed: The specified module could not be found." Can someone help me resolve this error? I am using PythonWin 2.2.1. Nitin

3 2