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

Wrong visitor type when using depth_first_search with start location
by Jean-Olivier Racine 07 May '08

07 May '08

Good day, I’ve been trying several things to fix my problem, yet, I just get more errors when I do. So here’s my best shot: I have an adjacent_list graph define as such: typedef adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int, ObjectID>, Relationships> Graph; My visitor is define as class DFSTreeVisitor : public default_dfs_visitor { public: DFSTreeVisitor(ModelTreeIF::ExplorerIF& Explorer, ModelTreeIF& Tree) : m_Tree(Tree), m_Explorer(Explorer) {}; template<typename VertexType, typename GraphType> void discover_vertex(VertexType V, const GraphType& G); template<typename VertexType, typename GraphType> void finish_vertex(VertexType V, const GraphType& G); private: ModelTreeIF& m_Tree; ModelTreeIF::ExplorerIF& m_Explorer; }; When doing a depth first search using a start location: depth_first_search(*GetGraph(RootID), visitor(Visitor), get(vertex_index, *GetGraph(RootID)), m_Vertices[StartID]); I get the following errors: Error 1 error C2039: 'initialize_vertex' : is not a member of 'boost::bgl_named_params<T,Tag,Base>' …\boost\graph\depth_first_search.hpp 197 Error 2 error C2039: 'start_vertex' : is not a member of 'boost::bgl_named_params<T,Tag,Base>' …\boost\graph\depth_first_search.hpp 200 Error 3 error C2039: 'start_vertex' : is not a member of 'boost::bgl_named_params<T,Tag,Base>' …\boost\graph\depth_first_search.hpp 207 Yet, if I use the two argument version of the function: depth_first_search(*GetGraph(RootID), visitor(Visitor)); It works fine. What wrong with my visitor? Or is it an unrelated problem in my code that causes this? Thanks you very much for you help, Jean-Olivier No virus found in this outgoing message. Checked by AVG. Version: 7.5.524 / Virus Database: 269.23.9/1417 - Release Date: 5/6/2008 8:07 AM

2 4

Understanding MPL and using '::type'
by Edward Diener 07 May '08

07 May '08

I am making another effort to understand MPL. I have the book by David Abrahams and Aleksey Gurtovoy, "C++ Template Programming", which is my basic source for learning the library, and I have the Boost documentation for the MPL. After reading chapter 3 again I think I understand the basic concepts more easily. However I am still missing something basic, which I think can be given the name: "How do I understand when to append and when not to append the '::type' to a metaprogramming construct built with MPL". Let me first say that I fully understand that '::type' is the way that the MPL returns compile time data in its metafunctions. Also that I understand that '::type' may refer to compile time numeric data ( including bool ) in the eventual form of '::type::value' and that '::value' is often supplied as a shorthand for compile time numeric data. Finally I do understand that to pass metafunctions around when a type is needed the MPL uses a metafunction class, which is a type and not a template. What I am missing is how to determine when using MPL functionality, whether it be data types, sequences, iterators, algorithms, or views being manipulated, when to append '::type' to the end of the intermediary expression or not. Let me give some examples of my confusion based on my reading in the MPL book listed above. I am reading about algorithms and I see an example whose logic I perfectly understand, and whose syntax goes like this: template<class Seq> struct biggest_float_as_double : mpl::deref < typename mpl::max_element < typename mpl::replace < Seq, float, double >::type, mpl::less < mpl::sizeof_<_1>, mpl::sizeof_<_2> > >::type > {}; In two cases in the nested construct above one uses the 'typename xxx<...>::type' construct whereas in one case one does not. There seems to be some logic or rule about this but I do not understand what it is. A few pages later in the text I see: typedef mpl::vector < mpl::vector_c<int, 1, 2, 3>, mpl::vector_c<int, 4, 5, 6>, mpl::vector_c<int, 7, 8, 9> > S; typedef mpl::transform < S, mpl::front<_>, mpl::inserter < mpl::int_<0>, mpl::plus<_,_> > > ::type sum; Here we have another nested mpl construct and I do understand the logic of it, but here there are no internal nested '::type' statements. Once again I am utterly puzzled about the whys and wherefores of using or not using '::type'. Finally I turn the page and I see this MPL construct: template<class Seq> struct reverse : mpl::fold < Seq, typename mpl::clear<Seq>::type, mpl::push_front<_,_> > {}; Once again I can follow the logic and the explanation of mpl::fold, but I have no idea by what rule one of the nested constructs has '::type' appended and the next one does not. As a naive learner of the MPL I would have thought it would have been much easier to use if every MPL construct ( mpl::xxx... ) returned a '::type', and then this business of when to use and when not to use '::type' would have been regularized, but evidently MPL does not work that way. Since I still do not understand the rule about this, hopefully someone who knows MPL, and who realizes that while I understand the basic concepts I am still trying to understand it, can enlighten me on this subject.

5 12

[enable_if] enable if member function present
by Bill Buklis 07 May '08

07 May '08

I would like to able to provide two versions of a function where one is enabled for only POD types and other another if the object provides a usable member function (mainly used for compatible non POD types). Anything else should fail to compile. The first part is easy. I can do this with: template< class T > typename boost::enable_if< boost::is_pod<T>, void >::type DoSomething( T& object ) { ... } But, I'm not sure how to do the second part. For example: template< class T > typename boost::enable_if< has "DoSomething" member, void >::type DoSomething( T& object ) { Object.DoSomething(); } Perhaps it would be easier to check for a defined typedef inside the object? But, I'm not sure on that either. Additionally, if possible: If both conditions can be satisfied then the second version (member function) should be preferred. Is this possible? Thanks, -- Bill --

2 1

[ptr_list] erase_if issue - bug or feature?
by Sergey Sadovnikov 07 May '08

07 May '08

Hi all. There is an issue found with erase_if algorithm for ptr_list container. Here is a bit of code: class A; boost::ptr_list<A> m_sheeps; class A { public: A(int i) : m_i(i) {} operator int () { return this->m_i; } void mydelete (int i) { m_sheeps.erase_if(std::bind2nd(std::less<int>(), i)); } public: int m_i; }; ////////////////////////////////////////////////////////////////////////// int main() { m_sheeps.push_back(new A(1)); m_sheeps.push_back(new A(3)); m_sheeps.push_back(new A(4)); for (boost::ptr_list<A>::iterator iter = m_sheeps.begin(); iter != m_sheeps.end();) { std::cout << (*iter).m_i; (*iter++).mydelete(2); } return 0; } This code outputs following sequence to the console: 14 This sequence does not contains '3' because of erase_if modify underlaying list container with stable_partition algorithm also. If I replace boost::ptr_list to std::list the output will correct (i. e. '134') Main question is following: is such behavior correct for certain kind of container? I suspect what ptr-containers preserve standard semantic of corresponded standard containers. And erasing from the ptr_list does not invalidate iterators to this list (exclude cases described in the Standard). Or ptr_list::erase_if algorithm does not preserve semantic of ptr_list::remove_if algorithm? But there is nothing about such behavior in the documentation. PS: I know what erase_if algorithm has generic implementation (in the ptr_sequence class) and has not special implementation for ptr_list. But documentation has the following sentence: " Iterators are invalidated as in the corresponding standard container Because the containers in this library wrap standard containers, the rules for invalidation of iterators are the same as the rules of the corresponding standard container. For example, for both boost::ptr_vector<T> and std::vector<U> insertion and deletion only invalidates the deleted element and elements following it; all elements before the inserted/deleted element remain valid. " (http://www.boost.org/doc/libs/1_35_0/libs/ptr_container/doc/conventions.htm…) -- Best Regards Sergey mailto:flex_ferrum@artberg.ru

2 3

error when "shared_array" goes out of scope
by Abhishek Soni 07 May '08

07 May '08

Hi all For past three days am trying to figure out the cause of error. I am using shared_array, allocating it memory equal to size of data am populating it with and then storing the data in the "shared_array". but when shared_ptr goes out of scope and is internally deallocated, error is thrown.... I am populating my shared_array type data with data fetched from database.... here's part of my code ******************************************************************************************************************************************************************************* // ***********Main function*************** #include <stdio.h> #include <occi.h> #include <iostream> #include <pthread.h> #include "RtShDataDao.hpp" //My own class with function declarations including rtGetRepositoryData(RtRepositoryDataVo & r_repositoryData,const RtU32T id,const RtU32T aliasOrPublic, const RtC8T * p_serviceIndication) //RtU32T is unsigned int of size 32 bytes, RtC8t is Signed Char #include <string> #include <exception> using namespace std; using namespace oracle::occi; int main() { void get_RepositoryData(); get_RepositoryData(); } void get_RepositoryData() { RtShDataDao shDataDaoObj; RtU32T id = 8; RtU32T aliasOrPublic = 1; RtRepositoryDataVo repositoryData;// = new RtRepositoryDataVo(); // RtRepositoryDataVo is class containing variables m_seq and mp_data repositoryData.m_seq = 0; RtC8T serviceIndication[50] = "service indication 8"; printf("\nAddress in shared ptr is %p\n",repositoryData.mp_data.get()); try { shDataDaoObj.rtGetRepositoryData(repositoryData,id,aliasOrPublic,serviceIndication); } catch (RtExceptionUD &eud) { cout<<"Error---------------------"<<eud.errString<<endl; } catch (SQLException &se) { cout << " SQL Exception -----------------"<<se.what() <<endl; } catch (exception & e) { cout << " Exception ----------"<<e.what() ; } cout<<" Returned from RtGetRepositoryData "<<endl; cout<<endl<<" sequence "<<repositoryData.m_seq <<endl; cout<<"repositoryData.mp_data "<<(repositoryData.mp_data.get())<<endl; } //*************** RtShDataDao.cpp*********************** // this class contains definitions of functions //RtSpChar is defined as typedef shared_array<RtU8T> RtSpChar; in RtShared_ptr.hpp #include <occi.h> #include "RtExceptionUD.hpp" #include <iostream> using namespace std; using namespace oracle::occi; extern StatelessConnectionPool *g_scp; #include "RtShDataDao.hpp" void RtShDataDao::rtGetRepositoryData(RtRepositoryDataVo & r_repositoryData,const RtU32T id,const RtU32T aliasOrPublic, const RtC8T * p_serviceIndication) throw (RtExceptionUD &, exception &,SQLException &) { if(p_serviceIndication == NULL) { throw RtExceptionUD(" p_serviceIndication initialized with NULL"); } if( aliasOrPublic < 0 ) { throw RtExceptionUD(" aliasOrPublic initialized with unexpected value "); } if( id <= 0 ) { throw RtExceptionUD(" id initialized with unexpected value "); } Connection *l_conn = g_scp->getConnection(); Statement *l_stmt = l_conn->createStatement(); ResultSet * l_rs; int l_countRow = 0; ub2 rc = 0, rc1 = 0; sb2 ind = 0, ind1 = 0; switch (aliasOrPublic) { case 0: { Clob l_repData; l_stmt->setSQL(GET_REPOSITORY_DATA_PUBLIC); ub2 l_lenInt = sizeof(int); l_stmt->setDataBuffer(1,(void *)&id,OCCIINT,l_lenInt,&l_lenInt); ub2 l_lenString = strlen (p_serviceIndication)+1; l_stmt->setDataBuffer(2,(dvoid *)p_serviceIndication,OCCI_SQLT_STR, l_lenString, &l_lenString); l_rs = l_stmt->executeQuery(); l_rs->setDataBuffer(1,(void *)&r_repositoryData.m_seq,OCCIINT,l_lenInt,&l_lenInt, &ind, &rc); ub2 l_lenClob; l_repData.setEmpty(l_conn); l_rs->setDataBuffer(2,&l_repData,OCCI_SQLT_CLOB, l_lenClob, &l_lenClob, &ind1, &rc1); while (l_rs->next()) { if(!ind1) { unsigned int l_offset = 1; r_repositoryData.mp_data = RtSpChar (new RtU8T(l_repData.length()+1)); l_repData.read(l_repData.length(),(unsigned char*)(r_repositoryData.mp_data.get()),l_repData.length(),l_offset); r_repositoryData.mp_data[l_repData.length()] = '\0'; printf("address of the mp_data %p /n",r_repositoryData.mp_data.get()); getchar(); } ++l_countRow; } break; } case 1: { Clob l_repData; l_stmt->setSQL(GET_REPOSITORY_DATA_ALIAS); ub2 l_lenInt = sizeof(int); l_stmt->setDataBuffer(1,(void *)&id,OCCIINT,l_lenInt,&l_lenInt); ub2 l_lenString = strlen (p_serviceIndication)+1; l_stmt->setDataBuffer(2,(dvoid *)p_serviceIndication,OCCI_SQLT_STR, l_lenString, &l_lenString); l_rs = l_stmt->executeQuery(); l_rs->setDataBuffer(1,(void *)&r_repositoryData.m_seq,OCCIINT,l_lenInt,&l_lenInt, &ind, &rc); ub2 l_lenClob; l_repData.setEmpty(l_conn); l_rs->setDataBuffer(2,&l_repData,OCCI_SQLT_CLOB, l_lenClob, &l_lenClob, &ind1, &rc1); while (l_rs->next()) { if(!ind1) { unsigned int l_offset = 1; r_repositoryData.mp_data = RtSpChar (new RtU8T(l_repData.length()+1)); l_repData.read(l_repData.length(),(unsigned char*)(r_repositoryData.mp_data.get()),l_repData.length(),l_offset); r_repositoryData.mp_data[l_repData.length()] = '\0'; printf("address of the mp_data %p /n",r_repositoryData.mp_data.get()); getchar(); } // unsigned int l_offset = 1; // r_repositoryData.mp_data = RtSpChar(new RtU8T(l_repData.length())); // l_repData.read(l_repData.length(),(unsigned char *)r_repositoryData.mp_data.get(),l_repData.length(),l_offset); ++l_countRow; } break; } } l_stmt->closeResultSet(l_rs); l_conn->terminateStatement(l_stmt); g_scp->releaseConnection(l_conn); if(l_countRow == 0) throw RtExceptionUD("RtShDataDao::getRepositoryData::No data fetched ...."); } // This class contains definitions for variable m_seq and mp_data #ifndef _RTREPOSITORYDATAVO_H #define _RTREPOSITORYDATAVO_H #include "RtDataType.h" #include "RtShared_ptr.hpp" using namespace boost; // This class is a value object that shall have the repository data corresponding to the public identity id or alias grp id. class RtRepositoryDataVo { public: // It is identity used for a set of service related transparent data. RtC8T mp_serviceInd[30]; // The seqn is the sequence number which is used in order to maintain a uniformity in data shared AS and HSS. RtU32T m_seq; // The data is the transparent data. RtSpChar mp_data; //shared_ptr<RtU8T> mp_data; // ~RtRepositoryDataVo(){cout<<"Destruc Use count is "<<mp_data.use_count()<<endl;} }; #endif //_RTREPOSITORYDATAVO_H //this class contains definitions for RtC8t and RtU32T #ifndef _RTDATATYPE_H #define _RTDATATYPE_H // unsigned char typedef unsigned char RtU8T; // unsigned short typedef unsigned short RtC16T; // unsigned int typedef unsigned int RtU32T; // unsigned long typedef unsigned long RtU64T; // signed char typedef signed char RtS8T; // signed short typedef signed short RtS16T; // signed int typedef signed int RtS32T; // signed long typedef signed long RtS64T; // char typedef char RtC8T; #endif //_DATATYPE_H ******************************************************************************************************************************************************************************* and here's the error am getting Address in shared ptr is (nil) address of the mp_data 0x82fa708 /n Returned from RtGetRepositoryData sequence 0 repositoryData.mp_data data clob to be populated with information *** glibc detected *** ./a.out: free(): invalid next size (fast): 0x082fa708 *** ======= Backtrace: ========= /lib/libc.so.6[0x431a2f7d] /lib/libc.so.6(cfree+0x90)[0x431a65d0] /usr/lib/libstdc++.so.6(_ZdlPv+0x21)[0x43dacef1] /usr/lib/libstdc++.so.6(_ZdaPv+0x1d)[0x43dacf4d] ./a.out[0x8061193] ./a.out[0x80611a7] ./a.out[0x8061296] ./a.out[0x805774c] ./a.out[0x8057776] ./a.out[0x8057806] ./a.out[0x805781c] ./a.out[0x8054ad2] ./a.out[0x8057556] /lib/libc.so.6(__libc_start_main+0xdc)[0x43152dec] ./a.out(__gxx_personality_v0+0x3bd)[0x804ce91] ======= Memory map: ======== 00110000-00294000 r-xp 00000000 fd:00 13844169 /app/oracle/product/11.1.0/db/lib/libnnz11.so 00294000-002b9000 rwxp 00184000 fd:00 13844169 /app/oracle/product/11.1.0/db/lib/libnnz11.so 002b9000-002ba000 rwxp 002b9000 00:00 0 002ba000-002bb000 r-xp 00000000 fd:00 14018711 /usr/lib/libaio.so.1.0.1 002bb000-002bc000 rwxp 00000000 fd:00 14018711 /usr/lib/libaio.so.1.0.1 002bc000-002ed000 r-xp 00000000 fd:00 13835865 /app/oracle/product/11.1.0/db/lib/libskgxp11.so 002ed000-002ef000 rwxp 00031000 fd:00 13835865 /app/oracle/product/11.1.0/db/lib/libskgxp11.so 002ef000-002f0000 --xp 002ef000 00:00 0 002f0000-002ff000 rwxp 002f0000 00:00 0 0037b000-00384000 r-xp 00000000 fd:00 7071017 /lib/libnss_files-2.5.so 00384000-00385000 r-xp 00008000 fd:00 7071017 /lib/libnss_files-2.5.so 00385000-00386000 rwxp 00009000 fd:00 7071017 /lib/libnss_files-2.5.so 0048e000-00493000 r-xp 00000000 fd:00 13844145 /app/oracle/product/11.1.0/db/lib/libnque11.so 00493000-00494000 rwxp 00005000 fd:00 13844145 /app/oracle/product/11.1.0/db/lib/libnque11.so 00612000-00a77000 r-xp 00000000 fd:00 13819009 /app/oracle/product/11.1.0/db/lib/liborasdkbase.so.11.1 00a77000-00a94000 rwxp 00464000 fd:00 13819009 /app/oracle/product/11.1.0/db/lib/liborasdkbase.so.11.1 00a94000-00a97000 rwxp 00a94000 00:00 0 00b71000-00b72000 r-xp 00b71000 00:00 0 [vdso] 00b72000-02486000 r-xp 00000000 fd:00 13844118 /app/oracle/product/11.1.0/db/lib/libclntsh.so.11.1 02486000-02527000 rwxp 01913000 fd:00 13844118 /app/oracle/product/11.1.0/db/lib/libclntsh.so.11.1 02527000-0253f000 rwxp 02527000 00:00 0 0253f000-03aef000 r-xp 00000000 fd:00 13819013 /app/oracle/product/11.1.0/db/lib/liborasdk.so.11.1 03aef000-03b7d000 rwxp 015b0000 fd:00 13819013 /app/oracle/product/11.1.0/db/lib/liborasdk.so.11.1 03b7d000-03b92000 rwxp 03b7d000 00:00 0 08048000-08114000 r-xp 00000000 fd:00 1276920 /home/abhisheks/projects/HSS/Implementation/app/a.out 08114000-08117000 rwxp 000cc000 fd:00 1276920 /home/abhisheks/projects/HSS/Implementation/app/a.out 082fa000-083a0000 rwxp 082fa000 00:00 0 4276e000-42787000 r-xp 00000000 fd:00 7072496 /lib/ld-2.5.so 42787000-42788000 r-xp 00018000 fd:00 7072496 /lib/ld-2.5.so 42788000-42789000 rwxp 00019000 fd:00 7072496 /lib/ld-2.5.so 427f2000-42804000 r-xp 00000000 fd:00 7072509 /lib/libnsl-2.5.so 42804000-42805000 r-xp 00012000 fd:00 7072509 /lib/libnsl-2.5.so 42805000-42806000 rwxp 00013000 fd:00 7072509 /lib/libnsl-2.5.so 42806000-42808000 rwxp 42806000 00:00 0 4313d000-43274000 r-xp 00000000 fd:00 7072497 /lib/libc-2.5.so 43274000-43276000 r-xp 00137000 fd:00 7072497 /lib/libc-2.5.so 43276000-43277000 rwxp 00139000 fd:00 7072497 /lib/libc-2.5.so 43277000-4327a000 rwxp 43277000 00:00 0 4327c000-432a1000 r-xp 00000000 fd:00 7072499 /lib/libm-2.5.so 432a1000-432a2000 r-xp 00024000 fd:00 7072499 /lib/libm-2.5.so 432a2000-432a3000 rwxp 00025000 fd:00 7072499 /lib/libm-2.5.so 432a5000-432a7000 r-xp 00000000 fd:00 7072498 /lib/libdl-2.5.so 432a7000-432a8000 r-xp 00001000 fd:00 7072498 /lib/libdl-2.5.so 432a8000-432a9000 rwxp 00002000 fd:00 7072498 /lib/libdl-2.5.so 432ab000-432be000 r-xp 00000000 fd:00 7072500 /lib/libpthread-2.5.so 432be000-432bf000 r-xp 00012000 fd:00 7072500 /lib/libpthread-2.5.so 432bf000-432c0000 rwxp 00013000 fd:00 7072500 /lib/libpthread-2.5.so 432c0000-432c2000 rwxp 432c0000 00:00 0 43ceb000-43cf6000 r-xp 00000000 fd:00 7072519 /lib/libgcc_s-4.1.1-20070105.so.1 43cf6000-43cf7000 rwxp 0000a000 fd:00 7072519 /lib/libgcc_s-4.1.1-20070105.so.1 43cf9000-43dd9000 r-xp 00000000 fd:00 14021099 /usr/lib/libstdc++.so.6.0.8 43dd9000-43ddc000 r-xp 000e0000 fd:00 14021099 /usr/lib/libstdc++.so.6.0.8 43ddc000-43dde000 rwxp 000e3000 fd:00 14021099 /usr/lib/libstdc++.so.6.0.8 43dde000-43de4000 rwxp 43dde000 00:00 0 b7d00000-b7d21000 rwxp b7d00000 00:00 0 b7d21000-b7e00000 --xp b7d21000 00:00 0 b7e16000-b7e69000 rwxp b7e16000 00:00 0 b7e69000-b7ecd000 r-xp 00000000 fd:00 13823471 /app/oracle/product/11.1.0/db/oracore/zoneinfo/timezlrg.dat b7ecd000-b7ef4000 rwxp b7ecd000 00:00 0 b7efe000-b7f02000 rwxp b7efe000 00:00 0 bfe9c000-bfeb0000 rwxp bfe9c000 00:00 0 [stack] bfeb0000-bfeb1000 rw-p bfeb0000 00:00 0 Aborted (core dumped) there's another problem that am facing with the code.... its like that if i change the size of the data then for some data size it does not give any error, the programm executes smoothely..... Am running the code on limited user on a linux machine, but if I run the same code for a root user there's never an error..... Kindly help me.. am stuck in it for past three days.... any help will be appreciated

2 1

set_difference with lists strangeness
by Torsten Sadowski 06 May '08

06 May '08

Hi, I have a bug when using set_difference with lists which puzzles me. The code runs like this: list<int> nids,gnids,rnids; //fill nids and gnids nids.sort(); gnids.sort(); set_difference(nids.begin(), nids.end(), gnids.begin(), gnids.end(), rnids.begin()); It works as expected in debug mode (-O0) but crashes in optimized mode (-O3). rnids is still empty after set_difference and the program crashes as soon as I try to use rnids. If I use a vector of the right size for rnids everything works. Obviously the memory allocation for the receiving list is optimized away. Is this not against the idea of the STL algorithms? Cheers, Torsten

2 1

[program_options] Configuration file syntax (or how to fill a vector from the configuration file)
by Stefan Walk 06 May '08

06 May '08

Hi, is there a general description of the config file syntax that program_options uses available? Like if it's case-sensitive, if you can quote arguments, etc ... currently i'm wondering if I can fill a vector from one line, like val = foo bar baz with foo, bar, and baz as the values ... is this possible with some separator? Regards, Stefan

9 22

BGL write_graphviz won't compile with listS or setS
by James Sutherland 05 May '08

05 May '08

I cannot get calls to write_graphviz to work when using anything other than vecS for the vertex and edge descriptors. I get the following error: graphviz.hpp:255: error: no matching function for call to ‘get (boost ::bgl_named_params <boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, VertInfo, boost::no_property, boost::no_property, boost::listS>, size_t, VertInfo, int>, boost::vertex_index_t, boost::no_property>&, const long unsigned int&)’ I am using bundled properties for the vertex properties, as shown below. Any ideas as to why the setS and listS containers do not work with write_graphvis? James --------------------------------- struct VertInfo { string name; int index; }; template<typename GraphT> struct VertWriter{ typedef typename graph_traits<GraphT>::vertex_descriptor Vertex; VertWriter( GraphT& _g ) : g(_g) {} void operator()( ostream& os, const Vertex& v ) const{ os << "[label=\"" << g[v].name << "\"]"; } private: GraphT& g; }; int main() { // typedef adjacency_list< vecS, vecS, directedS, VertInfo > Graph; // works. typedef adjacency_list< listS, listS, directedS, VertInfo > Graph; // doesn't work. Graph G; // populate the graph with vertex info set on each vertex... VertWriter<Graph> vw(G); boost::default_writer dw; write_graphviz( cout, G, vw, dw, dw ); } ----------------------------------- NOTE: I have also tried write_graphviz( cout, G, vw, dw, dw, vertex_index_map( boost::get(&VertInfo::index,G) ) ); which gives the same compiler error.

4 6

[boost test] feature
by Ovanes Markarian 05 May '08

05 May '08

Hello Gennadiy, I have a question on may be existing or potential feature. I works with a group of developers on a huge project. Our current intention is to test some (huge) software parts on the target using boost::test framework. Unfortunately the software produces some gigs of executables, so that we can not (and probably should not test all of them). I know we could group the test cases into the test suites and build dependencies between them, but that requires a lot of time for the system, which is being developed for some years. Speaking with the collegues I came accross an issue to write test code inbetween the productive code and include only required files in the final test suites. Is it an utopic idea and do you think that could be implemented in boost::test? A small example: productive_header.h productive_impl.cpp some class defined here this class implemented here some use cases declared here & compiled if test code compilation test case implementations here as well After all I can compile: <productive executable> without tests by simply including productive_header.h <test executable> with test by defining BOOST_TEST_MAIN and including productive_header.h May be this already works so and you can point me to the documentation, where it is stated. Many thanks, Ovanes

2 5

Is there any program that generates the Jamfile automatically?
by ajay gopalakrishnan 05 May '08

05 May '08

Hi all, First of all, a lot of thanks for the boost users community for all the prompt responses that I have been getting on this mailing list. It is really helping me get started and running quickly. Like we have tools in IDEs that generate the Makefiles automatically, do we have tools that generate these Jamfiles automatically. I think writing our own Jamfiles and maintaining it for huge projects would be very cumbersome and error prone. Also, when we use bjam, do these Boost libraries and header files get included automatically? How do that configure Boost/bjam so that it always includes a set of includes and some libraries whenever it compiles any file? Which config file is for that? I have recently installed the Boost Bindings and installed them separately. But I dont think Bjam is including it automatically. Thanks,. Ajay G.

1 0