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

RE: [Boost-users] MultiArray questions
by Neil Mackie 23 Jan '04

23 Jan '04

I'm responding to Mark Phillips series of questions about MultiArray. I began using MultiArray last year and quickly realised I was unclear how to use the library. Posting to this list did not help and I resorted to emailing the developer. He had not responded, as he is not subscribed to this list. However he was helpful in answering my questions. My advice is to follow the same procedure as I did, contact details are available at http://www.boost.org/libs/multi_array/doc/index.html although the email address I used was garcia at cs dot indiana .edu. Please post your replies back to the list as I too wonder about the efficiency of MultiArray. It is nice to see a well formed set of questions and I look forward to seeing an equally clear set of answers. Regards, Neil (J Mackie). *********************************************************************************** Ofcom is the regulator for the UK communications industry, with responsibilities across television, radio, telecommunications and wireless communications services. Ofcom exists to further the interests of citizen-consumers as the communications industries enter the digital age. Ofcom has taken over the responsibilities and assumed the powers of the five former regulators it has replaced - the Broadcasting Standards Commission, the Independent Television Commission, Oftel, the Radio Authority and the Radiocommunications Agency. This email and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this email in error please notify the originator of the message. This footer also confirms that this email message has been scanned for the presence of computer viruses. Any views expressed in this message are those of the individual sender, except where the sender specifies and with authority, states them to be the views of Ofcom. ***********************************************************************************

1 0

jweb
by Emre Turkay 21 Jan '04

21 Jan '04

Hi All, I was trying to compile the boost-graph library documentation (pdf) and I've done the following, and got the error shown. -bash-2.05b$ pwd /home/emre/boost/boost-1.30.2/libs/graph/doc -bash-2.05b$ make jweb -np isomorphism-impl-v3.w make: jweb: Command not found make: *** [isomorphism-impl-v3.tex] Error 127 -bash-2.05b$ Can someone tell me what this "jweb" is ? Thanks, emre

2 1

RE: [Boost-users] tuple problems 2
by Ben Hutchings 19 Jan '04

19 Jan '04

Programmer_blabla <Programmer_blabla(a)hotmail.com> wrote: > Ok thank you, I will post this on microsoft.public.vc.language. > > About the other thing, I originally thinked about that. But what to > specifiy, using the typedef's won't work either (see below): > > int i; > boost::tuple<int> data(27); > > i = boost::tuples::get<0, boost::tuple<int>::head_type, > boost::tuple<int>::tail_type>(data); //ok > i = boost::bind(&boost::tuples::get<0, boost::tuple<int>::head_type, > boost::tuple<int>::tail_type>, _1)(data); //error <snip> Yes, I see, there's ambiguity as to whether this means template<int N, class HT, class TT> typename access_traits<typename element<N, cons<HT, TT> >::type> ::non_const_type get(cons<HT, TT> & c); or template<int N, class HT, class TT> typename access_traits<typename element<N, cons<HT, TT> >::type> ::const_type get(const cons<HT, TT> & c); You can resolve the ambiguity by writing: typedef const int & const_int_getter( const boost::tuple<int>::inherited &); i = boost::bind(static_cast<const_int_getter *>(&boost::get<0>), _1) (data);

2 1

Converting from const to non-const with iterator_adaptor
by Keith MacDonald 19 Jan '04

19 Jan '04

Hi, I'm stuck trying to use iterator_adaptor from the CVS head. I simply want to derive a non-const iterator from a const one derived from iterator_facade, as shown in the code below. When I compile it with VC7.1, the line marked "/* *ERROR* */" generates one of those impenetratable error messages that starts with: cannot convert from 'const Node' to 'boost::iterator_facade<Derived,Value,CategoryOrTraversal,Reference,Differen ce>::reference' If I delete that line, so the default is used, dereferencing a non-const iterator returns a const Node. This seems such a simple requirement that there must be an easy way to do it. What am I doing wrong? Thanks, Keith MacDonald /* ========================= Code Begins ========================= */ #include <boost/iterator/iterator_facade.hpp> #include <boost/iterator/iterator_adaptor.hpp> class Node { // ... // Iteration: public: class iterator; class const_iterator; // Read-only, bidirectional iterator: typedef boost::iterator_facade< const_iterator, const Node, std::bidirectional_iterator_tag > boost_const_iterator; class const_iterator : public boost_const_iterator { public: const_iterator() {} const_iterator(const iterator& it) : m_pNode(it.base().m_pNode) {} explicit const_iterator(const Node* pNode) : m_pNode(pNode) {} friend class iterator; friend class boost::iterator_core_access; private: // Interface required by iterator_facade: reference dereference() const { return *m_pNode; } void increment() { m_pNode = m_pNode->next(); } void decrement() { m_pNode = m_pNode->prev(); } bool equal(const_iterator it) const { return m_pNode == it.m_pNode; } protected: const Node* m_pNode; }; // Read-write, bidirectional iterator, // adapted from const_iterator: typedef boost::iterator_adaptor< iterator, const_iterator, Node /* *ERROR* */ > iterator_base; class iterator : public iterator_base { public: iterator() {} explicit iterator(Node* pNode) : iterator_base(const_iterator(pNode)) {} }; const_iterator begin() const { return const_iterator(m_pChild); } const_iterator end() const { return const_iterator(NULL); } iterator begin() { return iterator(m_pChild); } iterator end() { return iterator(NULL); } private: Node* m_pChild; Node* m_pPrev; Node* m_pNext; }; /* ========================= Code Ends ========================= */

4 27

re: BGL: BOOST_DEF_PROPERTY, BOOST_INSTALL_PROPERTY
by Vikram Anantha 18 Jan '04

18 Jan '04

<Rant> Is there really a need for using Macros (really evil macros with ## at that too) in a C++ library that espouses type safe generic programming. I wasted a couple of hours searching for the definition of vertex_name_t and edge_name_t. C'mon guys. No more gotchas. OK?? Friends dont let friends use ## macros. </Rant> Vik

1 0

RE: [Boost-users] tuple problems
by Ben Hutchings 17 Jan '04

17 Jan '04

programmer blabla <programmer_blabla(a)hotmail.com> wrote: > Dear Booster's Booster's what? > I have a problem compiling a tuple containing an enum in a > namespace. For example: > > namespace TestTuple > { > enum ETestTuple > { > eTestTuple0 = 0, > eTestTuple1 = 1 > }; > } > > void Testtuple5() > { > typedef boost::tuple<TestTuple::ETestTuple> Tuple; > Tuple tpl; > } > > does not compile. I am using MSVC 2003.net (7.1 version), > just native code. Is this a M$ problem or is tuple broken? Looks like a compiler bug to me. > Also I get problem with > the combination > of boost::bind and tuple, for example: > > int i; > boost::tuple<int> data; > > i = data.get<0>(); //ok > i = boost::tuples::get<0>(data); //ok > i = boost::bind(&boost::tuples::get<0>, _1)(data); //error > > Has anyone a clue? boost::tuples::get has three template parameters - index, head type and tail type. Usually the type arguments can be deduced, but since you're passing the address to another template function you need to specify all three arguments. > Btw searching lists.boost.org is very hard, because google > is out of sync with the list. Try <http://news.gmane.org/index.php?prefix=gmane.comp.lib.boost> instead.

2 1

[BGL] Custom edge-removing visitor.
by Kili2x＠netscape.net 17 Jan '04

17 Jan '04

Hello, all. I'm working on an algorithm that takes a graph and two path iterators (begin and past-the-end) as input, and removes "cross edges" (is that the right term in this case?) from the graph until the path described by the iterators is the only simple path between those two vertices. The implementation I have so far consists of a function template and three visitor class templates built on top of the boost::depth_first_visit function template. I'm still improving on it (too many out-edges from the path itself are being removed), but for now the function works as it should. Now, the graph reference passed to the operator() member function in the boost::base_visitor class template (from which I inherited) must be a constant reference, so I can't pass it to the boost::remove_edge function. Furthermore, looking at the source code included in <boost/graph/depth_first_search.hpp> (both 1.30.2 and CVS versions), the edge passed to vis.forward_or_cross_edge cannot be removed without invalidating the out_edge_iterator used in the depth-first traversal. I've worked around the first issue by keeping a non-constant reference to the graph as a member of my custom visitor class and passing that reference to boost::remove_edge, and I'm using the boost::on_finish_vertex event filter instead of boost::on_forward_or_cross_edge (adjusting the code as appropritate) in order to overcome the second issue. The workarounds look rather kludgey in code, so removing the const modifier and/or adding an extra iterator to store the current edge while incrementing the traversing iterator might enable me to come up with a more elegant solution. Would such changes to <boost/graph/depth_first_search.hpp> break compatibility with older code? Or are there other particular issues in play? BTW, Is this the appropriate list for seeking such help? TIA! Cromwell Enage __________________________________________________________________ New! Unlimited Netscape Internet Service. Only $9.95 a month -- Sign up today at http://isp.netscape.com/register Act now to get a personalized email address! Netscape. Just the Net You Need.

1 0

question about mpl::list
by Istvan Buki 16 Jan '04

16 Jan '04

Hi all, I'm using the mpl::list template in one of my aplications but I just hit what seems to be a limit. list compile fine with 10 parameters but not with 11. I saw in the documentation that there are several header files like : #include "boost/mpl/list/list50.hpp" Are they meant to be used in cases like mine and if it is the case could someone point me to a short example ? Thanks for your help, Istvan

2 2

interest in a glob_iterator? (directory_iterator with regex)
by Rich Johnson 16 Jan '04

16 Jan '04

Folks-- Is there general interest in a "globbing" iterator? If so I've got one I'm willing to re-package for submission. (Or at least discuss with folks for improvement) If you're interested, read on: glob_iterator aggregates a directory_iterator and regex to provide shell-style "*", "?", "{....}", "[....]" and "[^...]" wildcarding. boost components used: filesystem::directory_iterator filesystem::path filter_iterator reg_expression c_regex_traits Usage example: //...do something to all .cpp and .c files glob_iterator start( "*.{c,cpp}" ); glob_iterator end; while( start != end ){ std::string filename( start->leaf() ); //...do something with/to filename ++start; }

8 11

Boost.Python Feature Request
by Jenna Louis 16 Jan '04

16 Jan '04

Are there any patches or plans to add the following features to Boost.Python/Pyste? 1. A major usability problem of Boost generated proxies is that IDEs are not able to show any details about the expected parameters. Since Boost already knows everything about the function then it makes sense to at least make some information known about it via a docstring and then these tools can at least show that. 2. Another feature would append a docstring with the descriptive text to the specified Class, Function, or Method. 3. I often generate modules that require a very specific order of initialization for the proxies it contains. I often have to rearrange the _main.cpp's BOOST_PYTHON_MODULE code as depicted below to get my module to work. This: BOOST_PYTHON_MODULE(Sim) { Export_SzCoordPos(); Export_SzCoordAng(); Export_SzCoord(); Export_SzMath(); Export_SzPolyUtils() } To This: BOOST_PYTHON_MODULE(Sim) { Export_SzCoord(); Export_SzMath(); Export_SzPolyUtils() Export_SzCoordPos(); Export_SzCoordAng(); } It would be nice if this list would be generated in the order in which the pyste files are specified on the command line. 4. I would like a way to add pickling code to my class from pyste. I realize its not practical to generate this code automatically but I would at least like to be able to inline this in my pyste file. I can already insert code into the proxy with the declaration_code() feature to handle the pickle struct but I also need to be able to add a pickle method i.e.(".def_pickle(world_pickle_suite())" to the class definition I specify. Thanks, Jenna --------------------------------- Do you Yahoo!? Yahoo! Hotjobs: Enter the "Signing Bonus" Sweepstakes

2 1

RE: [Boost-users] Re: interest in a glob_iterator? (directory_ite rator with regex)
by Jim.Hyslop 15 Jan '04

15 Jan '04

Angus Leeming [mailto:angus.leeming@btopenworld.com] wrote: > Jeff Flinn wrote: > > And a more descriptive, less jargon-ish name. > > Why? Rich is proposing something that would iterate over the files > returned by the unix 'glob' function. As much as you might hate to admit it, you must recognize that the world does not revolve around UNIX (and before anyone claims otherwise, nor does the world revolve around Windows). To my knowledge, "glob" is not a standard computer term, nor a standard C++ term, it is a standard UNIX term. Now, I could be wrong, but my understanding of the ISO standardization process is make everything platform-independent (and keep in mind that one of the original goals of Boost was to be included in the Standard). The *concept* of the "glob" is pretty much platform independent, but the term is not, so it should have (to paraphrase Jeff) a more descriptive, less platform-specific name. -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. (<http://www.leitch.com/>) Columnist, C/C++ Users Journal (<http://www.cuj.com/experts>)

3 2

boost::scoped_ptr and std::auto_ptr interoperability
by Sam Partington 15 Jan '04

15 Jan '04

Hi all, Is there any reason why boost::scoped_ptr::reset doesn't provide a std::auto_ptr overload? Take the following code : class A {}; std::auto_ptr<A> factory(); // ... boost::scoped_ptr<A> a; a.reset(factory().release()); wheras a.reset(factory()); would be neater. (Trivial difference I know, but it does add to readability) Sam --LongSig ****************** This e-mail has been sent from Imagination Technologies Limited. PowerVR, Metagence, Ensigma and PURE Digital are divisions of Imagination Technologies Limited. The information contained in this e-mail, including any attachment, is confidential and may be legally privileged. It is intended solely for the addressee(s) and access to this e-mail by anyone else is unauthorised. If you are not the intended recipient, any disclosure, copying or distribution or use of the information contained in this e-mail, is prohibited and may be unlawful. If you have received this e-mail in error, please notify the sender by return e-mail and then delete it from your system. Internet communications cannot be guaranteed to be secure, error or virus-free. The sender does not accept liability for any errors or omissions which arise as a result. Any views expressed in this message are those of the author, except where the author specifies and, with authority, states them to be the views of Imagination Technologies Ltd.

1 0

boost on Mac OS X 10.3 (Panther)
by Vineet Mehta 15 Jan '04

15 Jan '04

Has anyone been able to successfully build and install boost on Mac OS X 10.3 (panther). I am using gcc 3.3, the latest xcode. The python variables were configured to: export PYTHON_ROOT=/System/Library/Frameworks/Python.framework/Versions/2.3 export PYTHON_VERSION=2.3 I have bjam installed. I used bjam "-sTOOLS=darwin" in the boost root directory. However at the yields a number of warning and error messages, and ends with : ...failed updating 70 targets... .. .. Any suggestions ? -Vineet

8 9

Problems with Reverse Cuthill-Mckee?
by Kris Vorwerk 14 Jan '04

14 Jan '04

Hello, I'm a fairly new Boost user, so please forgive me if I'm completely out of whack here. I'm presently using Boost's reverse Cuthill-Mckee ordering to reduce the bandwidth of some very large symmetric, positive definite sparse matrices that I'm investigating. Generally, the cuthill_mckee_ordering() has worked quite well, although a short while ago, I began noticing that it occasionally gave an invalid ordering (i.e., the permutations spit out by the algorithm would have multiple vertexes all the same, which, when used to permute my matrices, would destroy my problem). It took me a while to figure out what was going on, but I've finally distilled a small enough example that exhibits the problem. Consider the following matrix: Matrix: 6x6 [ [3.66667,0,-0.5,0,0,0], [0,2.66667,0,-0.222222,0,0], [-0.5,0,1.66667,0,0,-0.222222], [0,-0.222222,0,3.33333,-2.22222,0], [0,0,0,-2.22222,4.66667,0], [0,0,-0.222222,0,0,4.66667] ] Using fairly straightforward code, I loop through the non-zeros, and add edges to an undirected Boost graph (basically the same as the cuthill_mckee_ordering.cpp example in the docs). Here is the graph that gets created for the above problem, in Graphviz format: graph G { 0; 1; 2; 3; 4; 5; 0--0 ; 0--2 ; 1--1 ; 1--3 ; 2--2 ; 2--5 ; 3--3 ; 3--4 ; 4--4 ; 5--5 ; } And, if I run this example using the cuthill_mckee_ordering technique (or if I modify cuthill_mckee_ordering.cpp to use these vertices and edges), I get the following permutation (using the pseudo-peripheral heuristic): Inv_perm: 0 0 0 0 2 5 You can see, from the Graphviz output, that this graph has two disconnected sets of vertices, which is where I think the problem lies. It may be a problem in my understanding of how to setup the Boost graph, or perhaps a problem in the reordering technique. You'll notice that, in my example, I've eliminated the duplicate edges (such as 2-5 being the same as 5-2) -- I've tried adding them in, too, but it hasn't changed the result. I've noticed that, if one of my matrices produces a graph in which there are no disconnected sets of vertices, the RCM ordering works fine. It's only when the graph is disconnected in this fashion that the ordering fails. I've also noticed that, when using this kind of disconnected graph, if I sometimes select a random starting vertex (instead of the pseudo-peripheral pair heuristic), the cuthill_mckee_ordering segfaults. I've attached some sample code below that seems to exhibit the problem. I'm certainly open to the possibility that it's a problem in my understanding of how to use the library. Also, my Boost version is: 1.30.2 (Redhat RPM) Any thoughts would be appreciated. regards, Kris ============================================================== (borrowed and slightly modified from cuthill_mckee_ordering.cpp) #include <boost/config.hpp> #include <vector> #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/cuthill_mckee_ordering.hpp> #include <boost/graph/properties.hpp> #include <boost/graph/bandwidth.hpp> int main( int, char *[] ) { using namespace boost; using namespace std; typedef adjacency_list < vecS, vecS, undirectedS, property < vertex_color_t, default_color_type, property < vertex_degree_t, int > > > Graph; typedef graph_traits < Graph >::vertex_descriptor Vertex; typedef graph_traits < Graph >::vertices_size_type size_type; typedef std::pair < std::size_t, std::size_t > Pair; //graph G {0;1;2;3;4;5;0--0 ;0--2 ;1--1 ;1--3 ;2--2 ;2--5 ;3--3 ;3--4 ;4--4 ;5--5 ;} Pair edges[] = { Pair( 0, 0 ), Pair( 0, 2 ), Pair( 1, 1 ), Pair( 1, 3 ), Pair( 2, 2 ), Pair( 2, 5 ), Pair( 3, 3 ), Pair( 3, 4 ), Pair( 4, 4 ), Pair( 5, 5 )}; Graph G( 6 ); for( int i = 0; i < 10; ++i ) { std::cout << edges[i].first << ", " << edges[i].second << std::endl; add_edge( edges[i].first, edges[i].second, G ); } graph_traits < Graph >::vertex_iterator ui, ui_end; property_map < Graph, vertex_degree_t >::type deg = get( vertex_degree, G ); for( boost::tie( ui, ui_end ) = vertices( G ); ui != ui_end; ++ui ) { deg[*ui] = degree( *ui, G ); } property_map < Graph, vertex_index_t >::type index_map = get( vertex_index, G ); std::cout << "original bandwidth: " << bandwidth( G ) << std::endl; std::vector < Vertex > inv_perm( num_vertices( G ) ); std::vector < size_type > perm( num_vertices( G ) ); // reverse cuthill_mckee_ordering cuthill_mckee_ordering( G, inv_perm.rbegin(), get( vertex_color, G ), make_degree_map( G ) ); cout << "Reverse Cuthill-McKee ordering:" << endl; cout << " "; for( std::vector < Vertex >::const_iterator i = inv_perm.begin(); i != inv_perm.end(); ++i ) { cout << index_map[*i] << " "; } cout << endl; for( size_type c = 0; c != inv_perm.size(); ++c ) { perm[index_map[inv_perm[c]]] = c; } std::cout << " bandwidth: " << bandwidth( G, make_iterator_property_map( &perm[0], index_map, perm[0] ) ) << std::endl; return 0; }

2 3

Re:[Boost-users] interest in a glob_iterator? (directory_ite
by rlyon＠comgroup.net.au 14 Jan '04

14 Jan '04

I can use it. Hopefully you will use regex++ from boost to handle the regular expressions. Regards ... ____________________Reply Separator____________________ Subject: [Boost-users] interest in a glob_iterator? (directory_iterat Author: Rich Johnson <rjohnson(a)dogstar-interactive.com> Date: 13/01/2004 6:45 PM Folks-- Is there general interest in a "globbing" iterator? If so I've got one I'm willing to re-package for submission. (Or at least discuss with folks for improvement)

1 0

tuple problems
by programmer blabla 14 Jan '04

14 Jan '04

Dear Booster's I have a problem compiling a tuple containing an enum in a namespace. For example: namespace TestTuple { enum ETestTuple { eTestTuple0 = 0, eTestTuple1 = 1 }; } void Testtuple5() { typedef boost::tuple<TestTuple::ETestTuple> Tuple; Tuple tpl; } does not compile. I am using MSVC 2003.net (7.1 version), just native code. Is this a M$ problem or is tuple broken? Also I get problem with the combination of boost::bind and tuple, for example: int i; boost::tuple<int> data; i = data.get<0>(); //ok i = boost::tuples::get<0>(data); //ok i = boost::bind(&boost::tuples::get<0>, _1)(data); //error Has anyone a clue? Btw searching lists.boost.org is very hard, because google is out of sync with the list. With kind regards, Me.

1 0

int64_t in boost/cstdint.h with GCC -std=c++98 or -ansi
by Aaron W. LaFramboise 14 Jan '04

14 Jan '04

Hi, I noticed that boost/cstdint.h does not define int64_t when GCC is in strict mode (-ansi or -std=c++98) on MinGW, Cygwin, and probably other major platforms. This seems to be because boost/cstdint.h refuses to define the type if ULLONG_MAX (or ULONG_LONG_MAX or ULONGLONG_MAX) is not defined, even if BOOST_HAS_LONG_LONG is defined. GCC, quite correctly, will not define these macros in strict mode. However, the library still probably should be defining this type. Ideally, there would be a GCC-specific work-around to prevent warnings on the use of long long in strict mode. In particular, I am using the date_time library which depends on int64_t. It would be very unfortunate and a little silly if I could not use date_time in GCC's strict mode. How would it be best to fix this? Aaron

2 2

d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(31) : error C2039: 'item' : is not a member of 'Node'
by pixellent＠stodge.net 14 Jan '04

14 Jan '04

Hi, I'm trying to use Luabind in my application, and Luabind uses BOOST. I'm getting the following error: d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(31) : error C2039: 'item' : is not a member of 'Node' d:\development\ogre\ogrenew\ogremain\include\ogrenode.h(50) : see declaration of 'Node' d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(31) : error C2146: syntax error : missing ';' before identifier 'type' d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(31) : error C2208: 'struct boost::type' : no members defined using this type d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(32) : error C2039: 'next' : is not a member of 'Node' d:\development\ogre\ogrenew\ogremain\include\ogrenode.h(50) : see declaration of 'Node' d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(32) : error C2146: syntax error : missing ',' before identifier 'next' d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(32) : error C2065: 'next' : undeclared identifier d:\sdk\boost\boost\mpl\list\aux_\iterator.hpp(33) : see reference to class template instantiation 'boost::mpl::list_iterator<Node>' being compiled d:\development\ogre\ogrenew\plugins\ogrelua\luabind\luabind\detail\primitives.hpp(91) : fatal error C1506: unrecoverable block scoping error Error executing cl.exe. Nature.obj - 7 error(s), 0 warning(s) Is this a bug in BOOST or am I doing something silly? Thanks Mike

1 0

Seeking permission to include Boost with book CD
by Matthew Wilson 13 Jan '04

13 Jan '04

Hi chaps / chappettes I am interested in including the latest released copy of Boost with the CD for my forthcoming book, Imperfect C++, to be published by Addison-Wesley this year. I have two questions: 1. Is Boost redistributable in this form? If so, from whom do I get written permission to do so? 2. What is the likely latest version of Boost that will be available around the end of Feb / beginning of March? Thanks in advance -- Matthew Wilson Director, Synesis Software (www.synesis.com.au) STLSoft moderator (http://www.stlsoft.org) Contributing editor, C/C++ Users Journal (www.synesis.com.au/articles.html#columns) -----------------------------------------------------

2 2

re: API documentation ?
by Vikram Anantha 13 Jan '04

13 Jan '04

Is there any place where I can look at the complete API documentation for the boost libraries. Something generated by doxygen or doc++ or something like that. Thanks Vik

2 1

cross compiling boost libs
by Uwe Sander 12 Jan '04

12 Jan '04

Hi, I would like to compile the boost libs for the Win32 platform using mingw on Linux. I have the required stuff installed and I know how to do such a cross compilation if I have a 'configure' based project but I do not know how to tell bjam what I am trying to achieve. Any hint? Thanks Uwe

2 1

Boost Include headers
by jling＠cmmt.ubc.ca 12 Jan '04

12 Jan '04

I need to include the following line in my code. #include "boost/type_traits/object_traits.hpp" My source file is in the root directory of the boost package that I extracted. But, I get errors like: boost/type_traits/object_traits.hpp:19: boost/type_traits/ice.hpp: No such file or directory boost/type_traits/object_traits.hpp:22: boost/type_traits/fwd.hpp: No such file or directory boost/type_traits/object_traits.hpp:25: boost/type_traits/composite_traits.hpp: No such file or directory etc ... I noticed that in say "boost/type_traits/ice.hpp" it also has header files it refers to, that look in "boost/type_traits/" directory, but relative to that header file, ice.hpp, there is no such directory path ... only from the root where my source file is, does that path exist. How does this work and how to I get my code to compile? Thanks, John

4 3

Using Smart Assert Library with MSVC 7.0 and 7.1
by Ferentinos, Jerry 12 Jan '04

12 Jan '04

Hi All, I'm having some trouble getting John Torjo's Smart Assert library to work with MSVC 7.0 and 7.1. Here's the error I get when compiling the example in boost_root\libs\smart_assert\example\enforce.cpp on MSVC 7.0 (7.1 yields a similar error): --snip-- c:\Program Files\Microsoft Visual Studio .NET\Vc7\include\vector(95) : error C2664: 'std::_Vector_val<_Ty,_Alloc>::_Vector_val(_Alloc)' : cannot convert parameter 1 from 'const std::_Vector_val<_Ty,_Alloc>::_Alty' to 'boost::smart_assert::Private::smart_assert_alloc<type>' with [ _Ty=boost::smart_assert::assert_context::val_and_str, _Alloc=boost::smart_assert::Private::smart_assert_alloc<boost::smart_assert: :assert_context::val_and_str> ] and [ _Ty=boost::smart_assert::assert_context::val_and_str, _Alloc=boost::smart_assert::Private::smart_assert_alloc<boost::smart_assert: :assert_context::val_and_str> ] and [ type=boost::smart_assert::assert_context::val_and_str ] No constructor could take the source type, or constructor overload resolution was ambiguous c:\Program Files\Microsoft Visual Studio .NET\Vc7\include\vector(93) : while compiling class-template member function 'std::vector<_Ty,_Ax>::vector(const std::vector<_Ty,_Ax>::_Myt &)' with [ _Ty=boost::smart_assert::assert_context::val_and_str, _Ax=boost::smart_assert::Private::smart_assert_alloc<boost::smart_assert::as sert_context::val_and_str> ] c:\boost_1_30_0\boost\smart_assert\priv\fwd\smart_assert_context.hpp(155) : see reference to class template instantiation 'std::vector<_Ty,_Ax>' being compiled with [ _Ty=boost::smart_assert::assert_context::val_and_str, _Ax=boost::smart_assert::Private::smart_assert_alloc<boost::smart_assert::as sert_context::val_and_str> ] --snip-- I hand instantiated "const std::_Vector_val<_Ty,_Alloc>::_Alty" and I got "boost::smart_assert::Private::smart_assert_alloc<type>" (where _Ty, _Alloc, and type have been replaced by their actual parameter values) so why is MSVC reporting an error? Has anyone else come across this problem? If so, how did you solve it? I tried searching the archive and came up with nothing, mostly because clicking on a search result brings you to an altogether different message. Any clues? Jerry Ferentinos ------------------------------------------------------------------------------ Notice: This e-mail message, together with any attachments, contains information of Merck & Co., Inc. (One Merck Drive, Whitehouse Station, New Jersey, USA 08889), and/or its affiliates (which may be known outside the United States as Merck Frosst, Merck Sharp & Dohme or MSD) that may be confidential, proprietary copyrighted and/or legally privileged, and is intended solely for the use of the individual or entity named on this message. If you are not the intended recipient, and have received this message in error, please immediately return this by e-mail and then delete it. ------------------------------------------------------------------------------

1 0

RE: [Boost-users] Boost Include headers
by Ben Hutchings 12 Jan '04

12 Jan '04

jling(a)cmmt.ubc.ca wrote: > I need to include the following line in my code. > > #include "boost/type_traits/object_traits.hpp" > > My source file is in the root directory of the boost package that I > extracted. > > But, I get errors like: > boost/type_traits/object_traits.hpp:19: boost/type_traits/ice.hpp: No > such file or directory <snip> Don't put your source file in the Boost directory. Put it somewhere else and add the Boost directory to the include search path (on the command line this is usually done with a -I option).

1 0

globbing with regex??
by Rich Johnson 12 Jan '04

12 Jan '04

I'm new to regex and would like to use it to match filenames, but I'd like to stick with a csh/bash syntax. Is this advisable? If so, would anyone have a set of regex traits for this syntax? If not, could someone point me in the right direction? Thanks, --rich An sample usage is: namespace fs = boost::filesystem char * dirname; /*...glob_regex_traits definition */ boost::regex expr( "*.cpp" , /*...glob_regex_traits...*/ ); for( fs::directory_iterator iter( fs:path( dirname ) ) ; iter != fs::directory_iterator() ; ++iter ) { boost::cmatch match_data if( regex_match( iter->leaf().c_str(), match_data, expr ) ) { /*...do something...*/ } }

2 1