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

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

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

RE: [Boost-users] Weird freeze with boost::thread on Win2K
by Yarwood, Martin (UK) 12 Jan '04

12 Jan '04

Have you done a sleep(0) or similar to give up thread control so the threading control gives the other one some processor time? > -----Original Message----- > From: Viktor Lundström [mailto:d99-vlu@nada.kth.se] > Sent: 09 January 2004 10:47 > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Weird freeze with boost::thread on Win2K > > > *** WARNING *** > > This mail has originated outside your organization, > either from an external partner or the Global Internet. > Keep this in mind if you answer this message. > > Hi! > I'm using boost::thread on MSVC6/Win2k. > When I start two processes which both use boost::thread, > the second process waits for up to a minute or two before starting. > The process doesn't bug, it just hangs there for a while and then > starts. > Is this a known problem? > > Regards, > Viktor Lundström > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > ******************************************************************** This email and any attachments are confidential to the intended recipient and may also be privileged. If you are not the intended recipient please delete it from your system and notify the sender. You should not copy it or use it for any purpose nor disclose or distribute its contents to any other person. ********************************************************************

1 0

Weird freeze with boost::thread on Win2K
by Viktor Lundström 10 Jan '04

10 Jan '04

Hi! I'm using boost::thread on MSVC6/Win2k. When I start two processes which both use boost::thread, the second process waits for up to a minute or two before starting. The process doesn't bug, it just hangs there for a while and then starts. Is this a known problem? Regards, Viktor Lundström

3 2

NEWBIE QUESTIONS ABOUT BGL
by Hugues Joly 09 Jan '04

09 Jan '04

Hi, I've read most of the online documentation about the Boost Graph Library and I've tried a few examples but some questions remain unanswered: Properties: - Once we have a property map for vertices or edges, do we have to assign a value to each vertex (or edge) of the graph? (My preliminary tests tell me that we have to.) - Is the graph the only mean to iterate through all the elements of a property map that it owns? - What is the difference between a graph and a property graph: when would we choose to use a graph interface instead of a property graph? - How can I attach a local property to an element of a subgraph and still have the original property unchanged for the corresponding element on the parent graph? (At the time beeing it seems impossible to do so.) - How can I define a custom property within a specific namespace? PROBLEMS: It seems that there are compilers' limitations regarding the number of properties (and their value type) that can be attached to an adjacency_list (at least with CodeWarrior). Thanks in advance. __________________________________________________________ Lèche-vitrine ou lèche-écran ? magasinage.yahoo.ca

3 2

MAKING A SEARCHABLE ARCHIVE OF THE boost-users' MAILING LIST
by Hugues Joly 09 Jan '04

09 Jan '04

Hi, I think that a searchable archive would be a big help in providing newcomers with answers on basic topics. At least, a downloadable archive would do the job. Who could take care of that? __________________________________________________________ Lèche-vitrine ou lèche-écran ? magasinage.yahoo.ca

2 1

RE: [Boost-users] MAKING A SEARCHABLE ARCHIVE OF THE boost-users' MAILINGLIST
by John Wilkinson 09 Jan '04

09 Jan '04

This list is available through Gmane (http://www.gmane.org) which is an NNTP interface for mailing lists. They have an archive of about 5100 messages for this list. Other boost lists are also available (http://news.gmane.org/index.php?prefix=gmane.comp.lib.boost) John -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Hugues Joly Sent: Friday, January 09, 2004 10:53 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] MAKING A SEARCHABLE ARCHIVE OF THE boost-users' MAILINGLIST Hi, I think that a searchable archive would be a big help in providing newcomers with answers on basic topics. At least, a downloadable archive would do the job. Who could take care of that? __________________________________________________________ Lèche-vitrine ou lèche-écran ? magasinage.yahoo.ca _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Building from MSVC
by Phil Hornby 09 Jan '04

09 Jan '04

Okay I know that there is this nice build tool called bjam - but I am a simple man and like using my nice friendly IDEs....so I was wondering if anyone has an MSVC 7.1 project that they have set up to build the libraries, i.e. the dlls that bjam produces? If so can I grab a copy as my first quick try didn't work...but then I only put 5 mins into it... -- Phil "Requirements - what are they I just hack something together that does what I think they want" ;)

1 0

boost::signals + pthreads = seg fault on Linux
by Uwe Sander 09 Jan '04

09 Jan '04

Hi, I have a problem with boost::signals when I try to use them in multi threaded projects. I have tried gcc 3.2.3 and gcc 3.3.2, on two different Linux boxes, with the same result. The following test program works fine w/o threads and crashes after the 17th call to connect if I add -pthread to the compile command: #include <boost/signal.hpp> void on_do_something () { } int main () { boost::signal<void ()> sig; for (int i = 0; i < 100; ++i) sig.connect (&on_do_something); } I have tried electric fence, then it crashes immediatly in the first call to pthread_mutex_init, but I can't see any reason for that crash with gdb. Once again, even with electric fence, everything works fine w/o threads, so I see no mem corruption or any reason why it should not work _with_ threads. Any idea? Thanks Uwe

2 3

Test library fails to link on OS X 10.3 Panther
by Scott Lamb 08 Jan '04

08 Jan '04

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 It chugs for a while, but gets link failures. It gives a warning about undefined symbols and dies. The symbols are cpp_main, test_main, and init_unit_test_suite. It doesn't really look like this is a fatal error - it says it's just a warning and that prebinding is disabled. And I think these are to be defined by the user of the library, so isn't it normal for them to be undefined here? In any case, this is the only error I see other than bjam complaining that the command failed. Any ideas how to fix it? Thanks, Scott Lamb The first of the failed commands did this: darwin-Link-DyLib-action ../../../libs/test/build/bin/libboost_prg_exec_monitor. dylib/darwin/debug/runtime-link-static/shared-linkable-true/ libboost_prg_exec_mo nitor.dylib ld: warning prebinding disabled because of undefined symbols ld: Undefined symbols: cpp_main(int, char**) export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "../../../libs/test/build/bin/libboost_prg_exec_moni tor.dylib/darwin/debug/runtime-link-static/shared-linkable-true/ libboost_prg_exe c_monitor.lo" "../../../libs/test/build/bin/libboost_prg_exec_monitor.dylib/dar win/debug/runtime-link-static/shared-linkable-true/execution_monitor.o" "../../. ./libs/test/build/bin/libboost_prg_exec_monitor.dylib/darwin/debug/ runtime-link- static/shared-linkable-true/cpp_main.o" \ && \ c++ -static-libgcc -g -Wl,-dynamic -nostartfiles -Wl,-dylib -Wl,-ldylib1.o -Wl,-dylib_compatibility_version,1.30.2 -W,l-dylib_current_version,1.30.2 -o ". ./../../libs/test/build/bin/libboost_prg_exec_monitor.dylib/darwin/ debug/runtime -link-static/shared-linkable-true/libboost_prg_exec_monitor.dylib" "../../../li bs/test/build/bin/libboost_prg_exec_monitor.dylib/darwin/debug/runtime- link-stat ic/shared-linkable-true/libboost_prg_exec_monitor.lo" \ \ \ && \ rm -f "../../../libs/test/build/bin/libboost_prg_exec_monitor.dylib/darwin/d ebug/runtime-link-static/shared-linkable-true/ libboost_prg_exec_monitor.lo" ...failed darwin-Link-DyLib-action ../../../libs/test/build/bin/libboost_prg_exe c_monitor.dylib/darwin/debug/runtime-link-static/shared-linkable-true/ libboost_prg_exec_monitor.dylib...

2 1

Problems compiling Boost.Function using gcc-3.3 on MacOS X (Jaguar)
by Jens Lindblad 08 Jan '04

08 Jan '04

Hello, I am trying to move a project of mine from gcc-3.1 to gcc-3.3 under MacOS X Jaguar. I'm using Apple's developer tools with the December 2002 updater which included gcc-3.3. Everything compiles just fine under 3.1 but I really need to use precompiled headers which does not work very well. I have managed to precompile my prefix header using 3.3 and I can also compile most of my source files using it. However, as soon as the compiler encounters a source file where Boost.Function is used I get an internal compiler error. So, I wrote a small program (included at the end of this email) which demonstrates the error. It works just fine under 3.1 but not under 3.3. Using preferred or portable syntax makes no difference. Has anyone else experienced this problem, or has it been fixed in Xcode? Perhaps I'm just doing something wrong? I'd really like to know before I file a bug. (I did a couple of searches on lists.boost.org but didn't find anything of interest.) Thanks in advance, Jens ------------------------------------------------------------ #include <iostream> #include <boost/function.hpp> void test( int x ) { std::cout << x << std::endl; } int main( int argc, char* argv[] ) { boost::function<void (int)> __test(test); __test(5); return 0; } ------------------------------------------------------------ Which gives the following error: /Development/Libraries/boost-1.30.2/boost/function/ function_template.hpp: In member function `void boost::function1<R, T0, Allocator>::assign_to(FunctionPtr, boost::detail::function::function_ptr_tag) [with FunctionPtr = void (*)(int), R = void, T0 = int, Allocator = std::allocator<void>]': /Development/Libraries/boost-1.30.2/boost/function/ function_template.hpp:432: instantiated from `void boost::function1<R, T0, Allocator>::assign_to(Functor) [with Functor = void (*)(int), R = void, T0 = int, Allocator = std::allocator<void>]' /Development/Libraries/boost-1.30.2/boost/function/ function_template.hpp:293: instantiated from `boost::function1<R, T0, Allocator>::function1(Functor, typename boost::detail::function::enable_if<boost::type_traits::ice_not<boost::is _same<Functor, int>::value>::value, int>::type) [with Functor = void (*)(int), R = void, T0 = int, Allocator = std::allocator<void>]' /Development/Libraries/boost-1.30.2/boost/function/ function_template.hpp:602: instantiated from `boost::function<R ()(T0), Allocator>::function(Functor, typename boost::detail::function::enable_if<boost::type_traits::ice_not<boost::is _same<Functor, int>::value>::value, int>::type) [with Functor = void (*)(int), R = void, T0 = int, Allocator = std::allocator<void>]' test.cpp:12: instantiated from here /Development/Libraries/boost-1.30.2/boost/function/ function_template.hpp:451: internal compiler error: in c_expand_expr, at c-common.c:4752 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://developer.apple.com/bugreporter> for instructions.

1 0

Using regex with Visual Studio. NET 2003
by Hans Merkl 07 Jan '04

07 Jan '04

Hi, I am porting a project that uses regex from Visual Studio 6 to Visual Studio .NET 2003. It works fine with VS6, but now I am getting linker errors: TestConsole.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::reg_expression<char,class boost::regex_traits<char>,class std::allocator<char> >::~reg_expression<char,class boost::regex_traits<char>,class std::allocator<char> >(void)" (__imp_??1?$reg_expression@DV?$regex_traits@D@boost@@V?$allocator@D@std@@@ boost@@QAE@XZ) referenced in function _main TestConsole.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::reg_expression<char,class boost::regex_traits<char>,class std::allocator<char> >::reg_expression<char,class boost::regex_traits<char>,class std::allocator<char> >(char const *,unsigned int,class std::allocator<char> const &)" (__imp_??0?$reg_expression@DV?$regex_traits@D@boost@@V?$allocator@D@std@@@ boost@@QAE@PBDIABV?$allocator@D@std@@@Z) referenced in function _main I have changed the C-runtime library settings, I have set BOOST_REGEX_STATIC_LINK to make sure I link against the static version, but nothing worked. Looking at the error messages, it seems I am still linking against the DLL version (dllimport). Does anybody have regex working with .NET 2003? Thanks Hans Merkl

3 3

RE: [Boost-users] Spirit Example does not build
by rip snorta 06 Jan '04

06 Jan '04

Hi Ben, >From: "Ben Hutchings" <ben.hutchings(a)businesswebsoftware.com> >Reply-To: Boost Users mailing list <boost-users(a)lists.boost.org> >To: "Boost Users mailing list" <boost-users(a)lists.boost.org> >Subject: RE: [Boost-users] Spirit Example does not build >Date: Tue, 6 Jan 2004 16:27:54 -0000 > > >This is a problem with the standard library implementation. Although >VC++ 6 has some support for template member functions, the library that >comes with it was written for an earlier version that did not and was >not updated to include template member functions. So it does not >define the constructor template for std::deque that takes two iterators >(though it does define a constructor that takes two const T * pointers, >where T is the element type). > >I think the example will work if you install STLPort or Dinkumware's >newer library as a (partial) replacement for VC++ 6's standard library. >_______________________________________________ This was one of the next things I was thinking of doing. I just wanted to see if there was anything simple I was missing before I installed one of the other STLs. Looks like STLPort is the go then! cheers John _________________________________________________________________ Worried about inbox overload? Get MSN Extra Storage now! http://join.msn.com/?PAGE=features/es

1 0

RE: [Boost-users] Spirit Example does not build
by Ben Hutchings 06 Jan '04

06 Jan '04

John <ripsnorta(a)operamail.com> wrote: > I have been trying to get one of the spirit examples, regex_convert > to build using VC6, service pack 5. I am using boost 1-30.2 for this > exercise. I get the following error message. > > error C2664: '__thiscall std::deque<char,class std::allocator<char> > >::std::deque<char,class std::allocator<char> >(unsigned int,const > char&,const class std::allocator<char> &)' That means a constructor for std::deque. > : cannot convert parameter 1 from 'class std::istreambuf_iterator< > char,struct std::char_traits<char> >' to 'unsigned int' > No user-defined-conversion operator available that can > perform this conversion, or the operator cannot be called > > I was wondering if this was a known issue, or if there was something > else that I needed to do. This is a problem with the standard library implementation. Although VC++ 6 has some support for template member functions, the library that comes with it was written for an earlier version that did not and was not updated to include template member functions. So it does not define the constructor template for std::deque that takes two iterators (though it does define a constructor that takes two const T * pointers, where T is the element type). I think the example will work if you install STLPort or Dinkumware's newer library as a (partial) replacement for VC++ 6's standard library.

1 0

Problem Building boost for cygwin g++ with stlport on WinXP
by Markus Ruettimann 06 Jan '04

06 Jan '04

Hi all I'm an enthusiastic user of boost since quite a long time. I used MSVC6.0 so far. How ever, I changed to cygwin g++ 3.3.1 for project reasons. I have succesfuly built the latest STLPort version (4.6) and I also use it successfully. How ever, I am not able to build the toolset gcc-stlport. There are errors in the threadding lib and elsewhere, and such ugly things as "to long path names" errors in the console. Does anybody know how to build this toolset and link them together as one static lib? I use boost-1.30.2 with cygwin g++ 3.3.1 on winXP professional. PS: When I build the bjam stuff, what builds without any errors, it uses the MSVC compiler (the output it creates looks like this). Is this a problem? Thanks for your help Markus. -- Using M2, Opera's revolutionary e-mail client: http://www.opera.com/m2/

2 3

Spirit Example does not build
by John 06 Jan '04

06 Jan '04

Hi, I have been trying to get one of the spirit examples, regex_convert to build using VC6, service pack 5. I am using boost 1-30.2 for this exercise. I get the following error message. error C2664: '__thiscall std::deque<char,class std::allocator<char> >::std::deque<char,class std::allocator<char> >(unsigned int,const char &,const class std::allocator<char> &)' : cannot convert parameter 1 from 'class std::istreambuf_iterator<char,struct std::char_traits<char> >' to 'unsigned int' No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called I was wondering if this was a known issue, or if there was something else that I needed to do. cheers John

1 0

Longest path in a DAG using BGL
by Ramprasad Natrajan 03 Jan '04

03 Jan '04

Hi, I am trying to find the longest path in a DAG using the BGL Dijkstra function. The call I used is: dijkstra_shortest_paths(hcg, s, &p[0], &d[0], weightmap, indexmap, std::greater<int>(), closed_plus<int>(), 0,MAXINT,dijkstra_visitor<null_visitor>()); where MAXINT is set high enough to be greater than the maximum path length. This doesn't seem to do the trick. Any suggestions? Thanks a real lot, Ram _________________________________________________________________ Feeling like a vacation? Then you are in the right place. http://www.msn.co.in/Travel/ Get the best travel deals here!

1 0

how to get started? (not in documentation)
by Tom Weber 01 Jan '04

01 Jan '04

Hello, I downloaded boost today so regard me as a newbie. Boost seems great, but the documentation doesn't mention how I should install boost on my system (redhat 9), and how to link against the built libraries. Sure I can include it in every project (though it's huge!), and make the makefiles link into strange locations such as libs/test/build/bin/libboost_unit_test_framework.a/gcc/debug/runtime-link-static/threading-single/libboost_unit_test_framework.a Is there an easier way? Why aren't packages like boost-[devel-]VERSION.PLATFORM.rpm made? Why aren't all built libraries put in the same directory, with a simple path name? Why isn't the thread library built statically? Is putting a "lib" section with BOOST_THREAD_BUILD_STATIC=1 in the Jamfile a legal fix? (seems to work) Also... I think boost should have a network library. Can anyone recommend a platform-independent network library? I'm thankful for any answer... -- Cheers, Tom Weber http://www.dd.chalmers.se/~np98towe/

6 7

using regex for in-place string modification
by Scott Meyers 29 Dec '03

29 Dec '03

I want to use regex to modify a string in place. In particular, I've read the contents of a file into a string, now I want to do some search/replace functions on the string, then write the modified string back out to the original file. I've looked through the regex documentation, including the October 2001 DDJ article, but I don't see any way to modify a string in place. From what I can tell, regex_merge looks like it does the kind of thing I want, except it doesn't seem to modify in place. I'd prefer to avoid creating two strings of each file's contents, one before regex processsing, one after. Is there functionality in regex that will let me modify a string in place? Thanks, Scott

7 8

problem with regex_fwd.hpp
by Stefan Shishkov 29 Dec '03

29 Dec '03

Hi, I had a small problem using boost::regexp on MS VC 6.0, boost 1.30.2. In one of my headers I included regex_fwd.hpp. The compilation failed with: ..\boost-1.30.2\boost/detail/allocator.hpp(215): error C2065: 'assert': undeclared identifier Allocator.hpp does not include <cassert> probably relying that it will be included before it. I solved this problem by including <cassert> before regex_fwd.hpp but may be it is better to change allocator.hpp? Or probably something is wrong with my configuration? Best regards Stefan

2 1

error C2668 with <boost/regex.hpp>
by Yiftah Frechter 28 Dec '03

28 Dec '03

Hi guys, I'm trying to use boost regex with VC6 Receiving the following error: error C2668: 'sprintf' : ambiguous call to overloaded function there is no "using namespace std" in my code. Appreciate any help. Yiftah

2 1

undirected graph cycle
by magh＠lehigh.edu 27 Dec '03

27 Dec '03

Is there any easy way to use DFS visitors to return a cycle in an undirected graph? The examples show how to detect if a cycle exists. How do you actually extract it? For my instance, I am dealing with an undirected graph that is a 1-tree, i.e., I know there is exactly one cycle. Thanks, Matt ------------------------------------------------- This mail sent through IMP: http://horde.org/imp/

1 0

date_time: number of days between dates
by Lars Schouw 25 Dec '03

25 Dec '03

I found a solution: long no_days(boost::gregorian::date d1, boost::gregorian::date d2) { using namespace boost::gregorian; using namespace boost::posix_time; date_period dp(d1, d2); return dp.length().days(); } --------------------------------- Do you Yahoo!? Yahoo! Photos - Get your photo on the big screen in Times Square

2 1

date_time converting from date to number of days
by Lars Schouw 24 Dec '03

24 Dec '03

I want to find the number of days in-between two days. What is the easiest way to do this? I am using the date_time lib and want to find the number of days from the time_t started. ptime timet_start(date(1970,1,1)); ptime t(d); time_duration diff = t - timet_start; ptime t123(diff); // timeval tv; //drop off the fractional seconds... // tv.tv_sec = diff.ticks()/time_duration::rep_type::res_adjust(); return 0; // return difference.days; Lars Schouw --------------------------------- Do you Yahoo!? Yahoo! Photos - Get your photo on the big screen in Times Square

1 0

lexical_cast and whitespace, part 2
by Miro Jurisic 18 Dec '03

18 Dec '03

I was trying to do the following: class MyString; std::istream oprator>>(std::istream&, MyString&); std::string s1 = "Hello, World"; MyString s2 = lexical_cast <MyString> (s); It doesn't work. The reason for it failing is: a. the semantics of operator>>(std::istream&, MyString&) are identical to the semantics of operator>>(std::istream&, std::string&) b. the semantics of operator>>(std::istream&, std::string&) are to read the stream up to the first whitespace (as per the stream locale) c. lexical_cast uses (via lexical_stream) operator>>(std::istream&, MyString&) to read the data into MyString The upshot of this is that lexical_cast writes "Hello, World" to the stream (via operator<<(std::ostream&, const std::string&)), reads off "Hello," to MyString (via operator>>(std::istream&, MyString&)), and then throws a bad lexical_cast after noticing there's data left on the stream. The natural question is why it is that this works when converting to a std::string; it seems that it should have the same problem. The answer is that boost::detail::lexical_stream has a lexical_stream::operator>>(std::string&) which ignores whitespace, thus working around the problem if (and only if) the target type of the cast is std::string. Attempting to use lexical_cast with any string type other than std::string fails when the source data contains (non-trailing) whitespace. This is suboptimal. I am going to try a workaround shortly, by partially specializing lexical_stream, but that's just a workaround. I don't see any way to do this without a. breaking the lexical_cast abstraction barrier (as I am about to do) or b. making the semantics of operator>>(istream&, MyString&) differ from those of operator>>(istream&, std::string&) I don't think either of those is the rigt answer. Is there one? Shouldn't there be one? Thanks, meeroh

1 0

Problems with Multi Threaded Version
by Zeros and Ones 18 Dec '03

18 Dec '03

So far I was using the Single Threaded Run Time Library and had no trouble with Boost, however I switched to useing the Run Time Versions just now and found that nothing seemed to work and the error that I get is: "Boost_Regex_vc7_mdid.dll was not found. Re-installing the application may fix this problem" However, the instructions on the website state : "Finally when you use regex++ it is only necessary for you to add the <boost> root directory to your list of include directories for that project. It is not necessary for you to manually add a .lib file to the project; the headers will automatically select the correct .lib file for your build mode and tell the linker to include it. " Im using VC7, and I cant understand why I get this error, do I need to change some setting while linking to the multi threaded versions? For now, I copied the two dll's _boost_regex_vc7_mdid.dll and _boost_regex_vc7_mdi.dll to my working directory and I have a working application, but Im foxed and I would like to know what im doing wrong! Thanks. "Zeros Bits and Bytes"

1 0

BGL and reversing / moving edges
by joshrose 17 Dec '03

17 Dec '03

G'day, I was hoping someone might be able to tell me if they've run into any situations using BGL where they needed to move (or reverse (i.e. flip the source and target)) an edge within a graph implemented as an adjacency_list. I'm working on an implementation of an algorithm for max. weight bipartite matching ("the assignment problem"), and one of the assumptions in the algorithm is that non-matched edges are directed from one subgraph, A, to the other subgraph, B, and matched edges are directed the other way. Over the course of growing the matching, a simple way to add and remove edges from the candidate set is just to reverse the edge, thus the need for some way to reverse the edge within BGL. I don't think I can just remove and then re-add the edge in the other direction, primarily because doing so will (I believe) invalidate any edge_descriptors referring to that edge. In particular, there are property maps keeping track of the weight of edges, the predecessors of certain nodes, etc. that use edge descriptors as keys. I've spent a fair bit of time reading the documentation and looking through the implementation of adjacency_lists (incl. edge_list_impl), and I'm not really sure of a way to either move an edge directly within a graph, or even to create a new edge from another s.t. they have the same edge_descriptor (in general a bad thing, probably). Anyone have any thoughts on this? Thanks, -Josh

4 10

Re: [Boost-users] Newbie question: block read inputs to regex
by annirak＠shaw.ca 17 Dec '03

17 Dec '03

----- Original Message ----- From: John Maddock <john(a)johnmaddock.co.uk> Date: Saturday, December 13, 2003 4:06 am Subject: Re: [Boost-users] Newbie question: block read inputs to regex > > I'm using regex_grep() to search through file contents for > matches. I > want to read the file in blocks to keep memory use down for large > files.What I want to know is whether there is some way of adding > the next block of > memory to the grep where the last one left off. > > > > The best solution I can come up with is using some sort of > double-buffering scheme, but that would take an awful lot of > memory copies > and searching some text multiple times. Both things I would > prefer to > avoid. > > > > What can I do? > > Have you looked at the partial match examples - there is one that > searches a > file in chunks. > > John. Ah, thank you, somehow I had missed that. --Brendan

1 0

Boost Software License: redistribute modified works?
by Steve M. Robbins 16 Dec '03

16 Dec '03

Hi, I've a question for the drafters of the Boost Software License - Version 1.0 - August 17th, 2003. Put yourself in the position of someone who wants to redistribute a modified version of Boost. For example, the linux distributors like Debian. The license begins with the permission grant: Permission is hereby granted, free of charge, to any person or organization obtaining a copy of the software and accompanying documentation covered by this license (the "Software") to use, reproduce, display, distribute, execute, and transmit the Software, and to prepare derivative works of the Software, and to permit third-parties to whom the Software is furnished to do so, all subject to the following: [... a restriction and a disclaimer paragraph ...] As I read this, "the Software" means "the unmodified tar or zip file obtained from boost.org". Is that correct? I'm permitted to "prepare derivative works of the Software", but the license doesn't specify what I may do with my derivative works. Clearly, I may distribute "the Software", but may I distribute the derivative work? Some licenses (e.g. the BSD and the GPL) make it clear that the terms apply to both the software and to derivative works. Shouldn't the boost license do likewise? -Steve

2 1

building boost libraries on Solaris
by K. Herman Chen 16 Dec '03

16 Dec '03

Has anyone built Boost Libraries using Sun/Solaris CC? I first built bjam using gcc on Solaris. But in the next step, 'bjam "-sTOOLS=CC"' (ie Solaris CC), it failed miserably. Since CC is not in the Supported Toolsets, does it mean I cannot build Boost libraries using Sun/Solaris CC? Any pointers would be appreciated. Thanks. herman

3 2

msvc-stlport creates name mangled functions with std:: not _STL::
by John Bustard 16 Dec '03

16 Dec '03

I can't seem to link with the filesystem lib when built with the following options: rem Get environment right for compiler -- comment out after first run rem "C:\Program Files\Microsoft Visual Studio\VC98\Bin\VCVARS32.BAT" rem Setup for Boost.Python rem Setup for Boost 'toolset' set STLPORT_PATH=C:\ set STLPORT_4.6_PATH=C:\STLport-4.6 set STLPORT_VERSION=4.6 bin.ntx86\bjam "-sTOOLS=msvc-stlport" "-sBUILD=<stlport-iostream>on" the name mangled function that is exported is ?leaf@path@filesystem@boost@@QBE?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ but the function that msvc tries to link with is: ?leaf@path@filesystem@boost@@QBE?AV?$basic_string@DV?$char_traits@D@_STL@@V? $allocator@D@2@@_STL@@XZ Two things I've noticed that are a bit wierd are that the boost libs are put in stlport-4.5.3 directory even when built with the options directing it to 4.6. Also stlport has an option to put itself in the std namespace but merely #defines std as _STL so I would have expected the exported function from the boost library to be _STL not std. Any ideas, thanks John

2 1

generate_random_graph
by Matthew Galati 16 Dec '03

16 Dec '03

Newbie Question Can someone post a simple example of how to generate a random graph? I do not understand what needs to be sent in the 4th argument for RandNumGen. To keep it simple, how would I generate a random graph on 10 vertices and 20 edges? generate_random_graph(g, 10, 20, ?, false, false); Thanks, Matt

2 1

Couldn't find status of Thread Priority...
by Brian Carlson 15 Dec '03

15 Dec '03

I was searching the boost site, and saw that in the Nov '02 timeframe that thread priority was not implemented. Is that still the case? I'm on XP and want to have one of my logging threads have a lower priority. Thanks, Brian

1 0

RE: [Boost-users] find japanese character with boost regex++
by Ben Hutchings 15 Dec '03

15 Dec '03

John Maddock <john(a)johnmaddock.co.uk> wrote: <snip> > It might be best to add a facility to add new character classes as a > list of characters and ranges to include, something like: > > register_character_class("myname", "d-f"); > > Then we add all the Unicode block ranges as standard for wide > character regexes. Aside from the unified Han characters (kanji/hanzi), characters of the same category generally aren't neatly grouped together in Unicode. The 128-character blocks tend to correspond to locales, communities of use or specific legacy encodings and not to categories. You need a look-up table (or more efficiently two levels of table) to check character categories.

2 1

find japanese character with boost regex++
by jschmid 15 Dec '03

15 Dec '03

Hi, I have just discovered the incredible boost and regex++ libraries but I have encountered some difficulties... I read that the japanese special encoding is handled in regex++, specially using wide char wchar characters. In the regex++ faq, it is presented the system of class , ex. [[:space]], in order to define a set of characters with a same property. I have been looking for a kind of [[:Japanese characters]] class. Actually I have a text with a lot of strange characters and japanese one ( Hiragana, katakan, Kanji everything..!) and I want to find these japanese sentence in order to translate them and replace in the text. I need hence a way in order to identify a japanese sentence . A kind of function const bool isJap( const wchar ) const would be fine. So if somebody has any idea or a some links, I would appreciate it! Thanks! Schmid

3 6

Re: Using graph library in VC++ 6.0 -> Change stl library?
by rohou 15 Dec '03

15 Dec '03

Using Boost graph library in VC++ 6.0, do I have to change the stl dlivered with VC6.0? What is the service pack I should use? Thanks, Boris

1 0

Boost::shared_ptr and memory leaks
by INsideR 15 Dec '03

15 Dec '03

Hello, I have wrote simple programm: using namespace boost; shared_ptr<int> a(new int(10)); shared_ptr<int> b; b=a; a.reset(new int(20)); std::cout<<"a=="<<*a<<" b=="<<*b; return 0; Checking this programm with DevPartner BoundsChecker, i found memory leak: Type Quantity Total (bytes) Allocation Location Sequence Leak exiting program 1 84 setlocale - [setlocal.c, line 547 (Boostt.exe)] 9 Memory Leak Exiting Program: Address 0x00E44F88 (84) allocated by _malloc_dbg. <if ( (ptloci = _malloc_crt( sizeof(threadlocinfo) )) == NULL )> Where is the problem? May be i write incorrect code? Best Wishes, Yury mailto:insider83@inbox.lv

2 1

problem with shared_ptr
by Eyal Fink 14 Dec '03

14 Dec '03

I am using boost share_ptr and I have a very strange problem. it looks to me more like a compiler problem but since it is a boost code I decided to post it here. I haven't succeeded to creating a small example which I can post here and demonstrate the problem (I know it is hard to help that way but I am working on creating an example) so I will just describe it. The symptom is that the shared_ptr call the delete on a random pointer. Going into the shared_ptr and shared_count objects, I sow that the ptr field of sp_counted_base_impl has a wrong value. I have added prints out all over the code and saw that inside the constructor of sp_counted_base_impl the value is set correctly but on the return when I try to look at the value and it is a wrong value. adding some more prints I saw that inside the shared_count constructor: template<class P, class D> shared_count(P p, D d) when casting pi_ to (sp_counted_base_impl<P, D>*) and calling a member function, the sizeof(*this) in side the member function is not the same every time (resulting with a different address to ptr and thus different value). the problem occurs only when compiling -O I am attaching the two file I have changes (shared_count.hpp is from boost/detail/) and the prints there created. I am sorry I can't supplied a complete example, this problems can just disappear when I remove any object file from the compilation. my configuration: compiler: gcc version 3.2 20020903 (Red Hat Linux 8.0 3.2-7) OS: Red Hat Linux release 8.0 (Psyche) boost: boost-1.30.2 any help will be appreciated #ifndef BOOST_SHARED_PTR_HPP_INCLUDED #define BOOST_SHARED_PTR_HPP_INCLUDED // // shared_ptr.hpp // // (C) Copyright Greg Colvin and Beman Dawes 1998, 1999. // Copyright (c) 2001, 2002, 2003 Peter Dimov // // Permission to copy, use, modify, sell and distribute this software // is granted provided this copyright notice appears in all copies. // This software is provided "as is" without express or implied // warranty, and with no claim as to its suitability for any purpose. // // See http://www.boost.org/libs/smart_ptr/shared_ptr.htm for documentation. // #include <boost/config.hpp> // for broken compiler workarounds #if defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) #include <boost/detail/shared_ptr_nmt.hpp> #else #include <boost/assert.hpp> #include <boost/checked_delete.hpp> #include <boost/throw_exception.hpp> #include <boost/detail/shared_count.hpp> #include <boost/detail/workaround.hpp> #include <memory> // for std::auto_ptr #include <algorithm> // for std::swap #include <functional> // for std::less #include <typeinfo> // for std::bad_cast #include <iosfwd> // for std::basic_ostream #ifdef BOOST_MSVC // moved here to work around VC++ compiler crash # pragma warning(push) # pragma warning(disable:4284) // odd return type for operator-> #endif namespace boost { template<class T> class weak_ptr; template<class T> class enable_shared_from_this; namespace detail { struct static_cast_tag {}; struct dynamic_cast_tag {}; struct polymorphic_cast_tag {}; template<class T> struct shared_ptr_traits { typedef T & reference; }; template<> struct shared_ptr_traits<void> { typedef void reference; }; #if !defined(BOOST_NO_CV_VOID_SPECIALIZATIONS) template<> struct shared_ptr_traits<void const> { typedef void reference; }; #endif // enable_shared_from_this support template<class T, class Y> void sp_enable_shared_from_this(boost::enable_shared_from_this<T> * pe, Y * px, shared_count const & pn) { if(pe != 0) pe->_internal_weak_this._internal_assign(px, pn); } inline void sp_enable_shared_from_this(void const *, void const *, shared_count const &) { } } // namespace detail // // shared_ptr // // An enhanced relative of scoped_ptr with reference counted copy semantics. // The object pointed to is deleted when the last shared_ptr pointing to it // is destroyed or reset. // template<class T> class shared_ptr { private: // Borland 5.5.1 specific workaround typedef shared_ptr<T> this_type; public: typedef T element_type; typedef T value_type; typedef T * pointer; typedef typename detail::shared_ptr_traits<T>::reference reference; shared_ptr(): px(0), pn() // never throws in 1.30+ { } template<class Y> explicit shared_ptr(Y * p): px(p), pn(p, checked_deleter<Y>()) // Y must be complete // Eyal Fink changed that!!! //shared_ptr(Y * p): px(p), pn(p, checked_deleter<Y>()) // Y must be complete { print_ptrs(); detail::sp_enable_shared_from_this(p, p, pn); print_ptrs(); } void print_ptrs() { //cout <<"px= "<<px<<" ptr= "<< pn.get_ptr(p, checked_deleter<Y>())<<endl; } // ~shared_ptr() // { // print_ptrs(); // } // // Requirements: D's copy constructor must not throw // // shared_ptr will release p by calling d(p) // template<class Y, class D> shared_ptr(Y * p, D d): px(p), pn(p, d) { detail::sp_enable_shared_from_this(p, p, pn); } // generated copy constructor, assignment, destructor are fine... // except that Borland C++ has a bug, and g++ with -Wsynth warns #if defined(__BORLANDC__) || defined(__GNUC__) shared_ptr & operator=(shared_ptr const & r) // never throws { px = r.px; pn = r.pn; // shared_count::op= doesn't throw return *this; } #endif template<class Y> explicit shared_ptr(weak_ptr<Y> const & r): pn(r.pn) // may throw { // it is now safe to copy r.px, as pn(r.pn) did not throw px = r.px; } template<class Y> shared_ptr(shared_ptr<Y> const & r): px(r.px), pn(r.pn) // never throws { } template<class Y> shared_ptr(shared_ptr<Y> const & r, detail::static_cast_tag): px(static_cast<element_type *>(r.px)), pn(r.pn) { } template<class Y> shared_ptr(shared_ptr<Y> const & r, detail::dynamic_cast_tag): px(dynamic_cast<element_type *>(r.px)), pn(r.pn) { if(px == 0) // need to allocate new counter -- the cast failed { pn = detail::shared_count(); } } template<class Y> shared_ptr(shared_ptr<Y> const & r, detail::polymorphic_cast_tag): px(dynamic_cast<element_type *>(r.px)), pn(r.pn) { if(px == 0) { boost::throw_exception(std::bad_cast()); } } #ifndef BOOST_NO_AUTO_PTR template<class Y> explicit shared_ptr(std::auto_ptr<Y> & r): px(r.get()), pn() { Y * tmp = r.get(); pn = detail::shared_count(r); detail::sp_enable_shared_from_this(tmp, tmp, pn); } #endif #if !defined(BOOST_MSVC) || (BOOST_MSVC > 1200) template<class Y> shared_ptr & operator=(shared_ptr<Y> const & r) // never throws { px = r.px; pn = r.pn; // shared_count::op= doesn't throw return *this; } #endif #ifndef BOOST_NO_AUTO_PTR template<class Y> shared_ptr & operator=(std::auto_ptr<Y> & r) { this_type(r).swap(*this); return *this; } #endif void reset() // never throws in 1.30+ { this_type().swap(*this); } template<class Y> void reset(Y * p) // Y must be complete { BOOST_ASSERT(p == 0 || p != px); // catch self-reset errors this_type(p).swap(*this); } template<class Y, class D> void reset(Y * p, D d) { this_type(p, d).swap(*this); } reference operator* () const // never throws { BOOST_ASSERT(px != 0); return *px; } T * operator-> () const // never throws { BOOST_ASSERT(px != 0); return px; } T * get() const // never throws { return px; } // implicit conversion to "bool" #if defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x530) operator bool () const { return px != 0; } #else typedef T * (this_type::*unspecified_bool_type)() const; operator unspecified_bool_type() const // never throws { return px == 0? 0: &this_type::get; } #endif // operator! is redundant, but some compilers need it bool operator! () const // never throws { return px == 0; } bool unique() const // never throws { return pn.unique(); } long use_count() const // never throws { return pn.use_count(); } void swap(shared_ptr<T> & other) // never throws { std::swap(px, other.px); pn.swap(other.pn); } template<class Y> bool _internal_less(shared_ptr<Y> const & rhs) const { return pn < rhs.pn; } void * _internal_get_deleter(std::type_info const & ti) const { return pn.get_deleter(ti); } // Tasteless as this may seem, making all members public allows member templates // to work in the absence of member template friends. (Matthew Langston) #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS private: template<class Y> friend class shared_ptr; template<class Y> friend class weak_ptr; #endif T * px; // contained pointer detail::shared_count pn; // reference counter }; // shared_ptr template<class T, class U> inline bool operator==(shared_ptr<T> const & a, shared_ptr const & b) { return a.get() == b.get(); } template<class T, class U> inline bool operator!=(shared_ptr<T> const & a, shared_ptr const & b) { return a.get() != b.get(); } #if __GNUC__ == 2 && __GNUC_MINOR__ <= 96 // Resolve the ambiguity between our op!= and the one in rel_ops template<class T> inline bool operator!=(shared_ptr<T> const & a, shared_ptr<T> const & b) { return a.get() != b.get(); } #endif template<class T, class U> inline bool operator<(shared_ptr<T> const & a, shared_ptr const & b) { return a._internal_less(b); } template<class T> inline void swap(shared_ptr<T> & a, shared_ptr<T> & b) { a.swap(b); } template<class T, class U> shared_ptr<T> static_pointer_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::static_cast_tag()); } template<class T, class U> shared_ptr<T> dynamic_pointer_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::dynamic_cast_tag()); } // shared_*_cast names are deprecated. Use *_pointer_cast instead. template<class T, class U> shared_ptr<T> shared_static_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::static_cast_tag()); } template<class T, class U> shared_ptr<T> shared_dynamic_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::dynamic_cast_tag()); } template<class T, class U> shared_ptr<T> shared_polymorphic_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::polymorphic_cast_tag()); } template<class T, class U> shared_ptr<T> shared_polymorphic_downcast(shared_ptr const & r) { BOOST_ASSERT(dynamic_cast<T *>(r.get()) == r.get()); return shared_static_cast<T>(r); } // get_pointer() enables boost::mem_fn to recognize shared_ptr template<class T> inline T * get_pointer(shared_ptr<T> const & p) { return p.get(); } // operator<< #if defined(__GNUC__) && (__GNUC__ < 3) template<class Y> std::ostream & operator<< (std::ostream & os, shared_ptr<Y> const & p) { os << p.get(); return os; } #else # if defined(BOOST_MSVC) && BOOST_WORKAROUND(BOOST_MSVC, <= 1200 && __SGI_STL_PORT) // MSVC6 has problems finding std::basic_ostream through the using declaration in namespace _STL using std::basic_ostream; template<class E, class T, class Y> basic_ostream<E, T> & operator<< (basic_ostream<E, T> & os, shared_ptr<Y> const & p) # else template<class E, class T, class Y> std::basic_ostream<E, T> & operator<< (std::basic_ostream<E, T> & os, shared_ptr<Y> const & p) # endif { os << p.get(); return os; } #endif // get_deleter (experimental) #if defined(__GNUC__) && (__GNUC__ < 3) // g++ 2.9x doesn't allow static_cast<X const *>(void *) template<class D, class T> D * get_deleter(shared_ptr<T> const & p) { void const * q = p._internal_get_deleter(typeid(D)); return const_cast<D *>(static_cast<D const *>(q)); } #else template<class D, class T> D * get_deleter(shared_ptr<T> const & p) { return static_cast<D *>(p._internal_get_deleter(typeid(D))); } #endif } // namespace boost #ifdef BOOST_MSVC # pragma warning(pop) #endif #endif // #if defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) #endif // #ifndef BOOST_SHARED_PTR_HPP_INCLUDED #ifndef BOOST_DETAIL_SHARED_COUNT_HPP_INCLUDED #define BOOST_DETAIL_SHARED_COUNT_HPP_INCLUDED #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // detail/shared_count.hpp // // Copyright (c) 2001, 2002, 2003 Peter Dimov and Multi Media Ltd. // // Permission to copy, use, modify, sell and distribute this software // is granted provided this copyright notice appears in all copies. // This software is provided "as is" without express or implied // warranty, and with no claim as to its suitability for any purpose. // #include <boost/config.hpp> #if defined(BOOST_SP_USE_STD_ALLOCATOR) && defined(BOOST_SP_USE_QUICK_ALLOCATOR) # error BOOST_SP_USE_STD_ALLOCATOR and BOOST_SP_USE_QUICK_ALLOCATOR are incompatible. #endif #include <boost/checked_delete.hpp> #include <boost/throw_exception.hpp> #include <boost/detail/lightweight_mutex.hpp> #if defined(BOOST_SP_USE_QUICK_ALLOCATOR) #include <boost/detail/quick_allocator.hpp> #endif #include <memory> // std::auto_ptr, std::allocator #include <functional> // std::less #include <exception> // std::exception #include <new> // std::bad_alloc #include <typeinfo> // std::type_info in get_deleter #include <cstddef> // std::size_t #ifdef __BORLANDC__ # pragma warn -8026 // Functions with excep. spec. are not expanded inline # pragma warn -8027 // Functions containing try are not expanded inline #endif namespace boost { // Debug hooks #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) void sp_scalar_constructor_hook(void * px, std::size_t size, void * pn); void sp_array_constructor_hook(void * px); void sp_scalar_destructor_hook(void * px, std::size_t size, void * pn); void sp_array_destructor_hook(void * px); #endif // The standard library that comes with Borland C++ 5.5.1 // defines std::exception and its members as having C calling // convention (-pc). When the definition of bad_weak_ptr // is compiled with -ps, the compiler issues an error. // Hence, the temporary #pragma option -pc below. The version // check is deliberately conservative. #if defined(__BORLANDC__) && __BORLANDC__ == 0x551 # pragma option push -pc #endif class bad_weak_ptr: public std::exception { public: virtual char const * what() const throw() { return "boost::bad_weak_ptr"; } }; #if defined(__BORLANDC__) && __BORLANDC__ == 0x551 # pragma option pop #endif namespace detail { class sp_counted_base { private: typedef detail::lightweight_mutex mutex_type; public: sp_counted_base(): use_count_(1), weak_count_(1) { } virtual ~sp_counted_base() // nothrow { } virtual void *get_ptr() { exit(-1); } virtual void set_ptr(void *ptr) { //cout <<"we are not supposed to be here!"<<endl; exit(-1); } // dispose() is called when use_count_ drops to zero, to release // the resources managed by *this. virtual void dispose() = 0; // nothrow // destruct() is called when weak_count_ drops to zero. virtual void destruct() // nothrow { delete this; } virtual void * get_deleter(std::type_info const & ti) = 0; void add_ref() { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif if(use_count_ == 0 && weak_count_ != 0) boost::throw_exception(boost::bad_weak_ptr()); ++use_count_; ++weak_count_; } void release() // nothrow { { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif long new_use_count = --use_count_; if(new_use_count != 0) { --weak_count_; return; } } dispose(); weak_release(); } void weak_add_ref() // nothrow { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif ++weak_count_; } void weak_release() // nothrow { long new_weak_count; { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif new_weak_count = --weak_count_; } if(new_weak_count == 0) { destruct(); } } long use_count() const // nothrow { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif return use_count_; } private: sp_counted_base(sp_counted_base const &); sp_counted_base & operator= (sp_counted_base const &); // inv: use_count_ <= weak_count_ long use_count_; long weak_count_; #if defined(BOOST_HAS_THREADS) mutable mutex_type mtx_; #endif }; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) template<class T> void cbi_call_constructor_hook(sp_counted_base * pn, T * px, checked_deleter<T> const &, int) { boost::sp_scalar_constructor_hook(px, sizeof(T), pn); } template<class T> void cbi_call_constructor_hook(sp_counted_base *, T * px, checked_array_deleter<T> const &, int) { boost::sp_array_constructor_hook(px); } template<class P, class D> void cbi_call_constructor_hook(sp_counted_base *, P const &, D const &, long) { } template<class T> void cbi_call_destructor_hook(sp_counted_base * pn, T * px, checked_deleter<T> const &, int) { boost::sp_scalar_destructor_hook(px, sizeof(T), pn); } template<class T> void cbi_call_destructor_hook(sp_counted_base *, T * px, checked_array_deleter<T> const &, int) { boost::sp_array_destructor_hook(px); } template<class P, class D> void cbi_call_destructor_hook(sp_counted_base *, P const &, D const &, long) { } #endif // // Borland's Codeguard trips up over the -Vx- option here: // #ifdef __CODEGUARD__ # pragma option push -Vx- #endif template<class P, class D> class sp_counted_base_impl: public sp_counted_base { private: D del; // copy constructor must not throw P ptr; // copy constructor must not throw sp_counted_base_impl(sp_counted_base_impl const &); sp_counted_base_impl & operator= (sp_counted_base_impl const &); typedef sp_counted_base_impl<P, D> this_type; public: // pre: initial_use_count <= initial_weak_count, d(p) must not throw sp_counted_base_impl(P p, D d): ptr(p), del(d) { cout <<"IN sp_counted_base_impl ocnstructro ptr="<<ptr<<" p="<<p<<endl; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) detail::cbi_call_constructor_hook(this, p, d, 0); #endif cout <<"sizeof(*this)= "<<sizeof(*this)<<endl; cout <<"IN sp_counted_base_impl end ocnstructro ptr=" <<ptr<<" ptr addr: "<<&ptr<<" p="<<p<<endl; } virtual void dispose() // nothrow { #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) detail::cbi_call_destructor_hook(this, ptr, del, 0); #endif //cout <<"IN boost::dispose ptr="<<ptr<<endl; del(ptr); } P get_ptr() { cout <<"this= "<<this<<" ptr in get_ptr= "<<ptr<<endl; cout <<"sizeof(*this)= "<<sizeof(*this)<<endl; cout <<"ptr addr: "<<&ptr<<endl; return ptr; } void set_ptr(P _ptr) { cout <<"this= "<<this<<" setting ptr to: "<<_ptr<<endl; ptr=_ptr; cout <<"sizeof(*this)= "<<sizeof(*this)<<endl; cout <<"ptr= "<<ptr<<endl; cout <<"ptr addr: "<<&ptr<<endl; } virtual void * get_deleter(std::type_info const & ti) { return ti == typeid(D)? &del: 0; } #if defined(BOOST_SP_USE_STD_ALLOCATOR) void * operator new(std::size_t) { return std::allocator<this_type>().allocate(1, static_cast<this_type *>(0)); } void operator delete(void * p) { std::allocator<this_type>().deallocate(static_cast<this_type *>(p), 1); } #endif #if defined(BOOST_SP_USE_QUICK_ALLOCATOR) void * operator new(std::size_t) { return quick_allocator<this_type>::alloc(); } void operator delete(void * p) { quick_allocator<this_type>::dealloc(p); } #endif }; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) int const shared_count_id = 0x2C35F101; int const weak_count_id = 0x298C38A4; #endif class weak_count; class shared_count { private: sp_counted_base * pi_; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) int id_; #endif friend class weak_count; public: shared_count(): pi_(0) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { } template<class P, class D> shared_count(P p, D d): pi_(0) #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { cout <<"in shared_count: p= "<<p<<endl; #ifndef BOOST_NO_EXCEPTIONS try { pi_ = new sp_counted_base_impl<P, D>(p, d); cout <<"return from new sp_counted_base_impl1: p= "<ptr= "<<pi_->get_ptr()<<endl; } catch(...) { d(p); // delete p throw; } #else pi_ = new sp_counted_base_impl<P, D>(p, d); cout <<"return from new sp_counted_base_impl2: p= "<ptr= "<<pi_->get_ptr()<<endl; if(pi_ == 0) { d(p); // delete p boost::throw_exception(std::bad_alloc()); } #endif ((sp_counted_base_impl<P, D>*)pi_)->set_ptr(p); cout <<"after fix: pi_->ptr= " <<((sp_counted_base_impl<P, D>*)pi_)->get_ptr()<<endl; cout <<"end of shared_count: ptr= "<<pi_->get_ptr()<<endl; } #ifndef BOOST_NO_AUTO_PTR // auto_ptr<Y> is special cased to provide the strong guarantee template<class Y> explicit shared_count(std::auto_ptr<Y> & r): pi_(new sp_counted_base_impl< Y *, checked_deleter<Y> >(r.get(), checked_deleter<Y>())) #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { r.release(); } #endif ~shared_count() // nothrow { if(pi_ != 0) pi_->release(); #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) id_ = 0; #endif } shared_count(shared_count const & r): pi_(r.pi_) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { if(pi_ != 0) pi_->add_ref(); } explicit shared_count(weak_count const & r); // throws bad_weak_ptr when r.use_count() == 0 shared_count & operator= (shared_count const & r) // nothrow { sp_counted_base * tmp = r.pi_; if(tmp != 0) tmp->add_ref(); if(pi_ != 0) pi_->release(); pi_ = tmp; return *this; } void swap(shared_count & r) // nothrow { sp_counted_base * tmp = r.pi_; r.pi_ = pi_; pi_ = tmp; } long use_count() const // nothrow { return pi_ != 0? pi_->use_count(): 0; } bool unique() const // nothrow { return use_count() == 1; } friend inline bool operator==(shared_count const & a, shared_count const & b) { return a.pi_ == b.pi_; } friend inline bool operator<(shared_count const & a, shared_count const & b) { return std::less<sp_counted_base *>()(a.pi_, b.pi_); } void * get_deleter(std::type_info const & ti) const { return pi_? pi_->get_deleter(ti): 0; } template<class P, class D> P get_ptr() { return pi_?((sp_counted_base_impl<P, D>*)pi_)->get_ptr() : 0; } void set_ptr(void *ptr) { if(pi_) pi_->set_ptr(ptr); } }; #ifdef __CODEGUARD__ # pragma option pop #endif class weak_count { private: sp_counted_base * pi_; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) int id_; #endif friend class shared_count; public: weak_count(): pi_(0) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(weak_count_id) #endif { } weak_count(shared_count const & r): pi_(r.pi_) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { if(pi_ != 0) pi_->weak_add_ref(); } weak_count(weak_count const & r): pi_(r.pi_) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { if(pi_ != 0) pi_->weak_add_ref(); } ~weak_count() // nothrow { if(pi_ != 0) pi_->weak_release(); #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) id_ = 0; #endif } weak_count & operator= (shared_count const & r) // nothrow { sp_counted_base * tmp = r.pi_; if(tmp != 0) tmp->weak_add_ref(); if(pi_ != 0) pi_->weak_release(); pi_ = tmp; return *this; } weak_count & operator= (weak_count const & r) // nothrow { sp_counted_base * tmp = r.pi_; if(tmp != 0) tmp->weak_add_ref(); if(pi_ != 0) pi_->weak_release(); pi_ = tmp; return *this; } void swap(weak_count & r) // nothrow { sp_counted_base * tmp = r.pi_; r.pi_ = pi_; pi_ = tmp; } long use_count() const // nothrow { return pi_ != 0? pi_->use_count(): 0; } friend inline bool operator==(weak_count const & a, weak_count const & b) { return a.pi_ == b.pi_; } friend inline bool operator<(weak_count const & a, weak_count const & b) { return std::less<sp_counted_base *>()(a.pi_, b.pi_); } }; inline shared_count::shared_count(weak_count const & r): pi_(r.pi_) #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { if(pi_ != 0) { pi_->add_ref(); } else { boost::throw_exception(boost::bad_weak_ptr()); } } } // namespace detail } // namespace boost #ifdef __BORLANDC__ # pragma warn .8027 // Functions containing try are not expanded inline # pragma warn .8026 // Functions with excep. spec. are not expanded inline #endif #endif // #ifndef BOOST_DETAIL_SHARED_COUNT_HPP_INCLUDED in shared_count: p= 0x8127738 IN sp_counted_base_impl ocnstructro ptr=0x8127738 p=0x8127738 sizeof(*this)= 44 IN sp_counted_base_impl end ocnstructro ptr=0x8127738 ptr addr: 0x8127fd8 p=0x81 27738 this= 0x8127fb0 ptr in get_ptr= 0 sizeof(*this)= 20 ptr addr: 0x8127fc0 return from new sp_counted_base_impl1: p= 0x8127738 pi_->ptr= 0 this= 0x8127fb0 setting ptr to: 0x8127738 sizeof(*this)= 44 ptr= 0x8127738 ptr addr: 0x8127fd8 this= 0x8127fb0 ptr in get_ptr= 0 sizeof(*this)= 20 ptr addr: 0x8127fc0 after fix: pi_->ptr= 0 this= 0x8127fb0 ptr in get_ptr= 0 sizeof(*this)= 20 ptr addr: 0x8127fc0 end of shared_count: ptr= 0

2 2

Newbie question: block read inputs to regex
by annirak＠shaw.ca 13 Dec '03

13 Dec '03

I'm using regex_grep() to search through file contents for matches. I want to read the file in blocks to keep memory use down for large files. What I want to know is whether there is some way of adding the next block of memory to the grep where the last one left off. The best solution I can come up with is using some sort of double-buffering scheme, but that would take an awful lot of memory copies and searching some text multiple times. Both things I would prefer to avoid. What can I do? --Brendan

3 2

Re: Re: find japanese character with boost regex++
by moscao＠free.fr 13 Dec '03

13 Dec '03

>> Actually I have a text with a lot of strange characters and japanese >> one ( Hiragana, Katakana, Kanji everything..!) and I want to find these >>japanese sentence in order to translate them and replace in the text. >>I need hence a way in order to identify a japanese sentence . A kind >>of function const bool isJap( const wchar ) const would be fine. >Do you need to use regexes? I've not tried boost.regex yet so cannot help >there. >Is your text just ascii and Japanese? Or do you need to distinguish from >other languages as well? >If just ascii and Japanese, you could define a Japanese char as anything >that is not ascii (beware shift-jis encoding though, as 2nd byte of a double >byte character is in the ascii range). If your data is unicode it should >also be easy to treat European characters as non-Japanese as well. >Darren Thanks Darren for your reply, Well actually I can avoid using regex but my text is more than ascii and japanese. Actually it is a byte file where some pieces are japanese sentences and others are byte controls like 0x00 ( which introduces more difficulties because you cannot parse the text as a string because 0x00 is an end character... ). So I thinks I have to parse bytes by pair and try to identify them as Shift-JIS when it is the case. Any idea of a function or program that does it? Thanks, jschmid

3 2

R: [Boost-users] filesystem::copy_file throws -- but why?
by Galante Michele 12 Dec '03

12 Dec '03

I think you should rewrite your code either as: int processFile(const fs::path& fileName) { fs::path copyFileName(fileName.string() + ".bak"); fs::copy_file(fileName, copyFileName); } or as: int processFile(const fs::path& fileName) { fs::path copyFileName(fileName.native_file_string() + ".bak", fs::native); fs::copy_file(fileName, copyFileName); } In your example you are creating a fs::path from a string in "native" form by using the default constructor, which expects the string to be in "generic" form. Hope this helps. Regards, Michele Galante Zucchetti Centro Sistemi s.p.a. m.galante(a)centrosistemi.it -----Messaggio originale----- Da: Scott Meyers [mailto:Usenet@aristeia.com] Inviato: giovedì 11 dicembre 2003 7.11 A: boost-users(a)lists.boost.org Oggetto: [Boost-users] filesystem::copy_file throws -- but why? [...] int processFile(const fs::path& fileName) { fs::path copyFileName(fileName.native_file_string() + ".bak"); fs::copy_file(fileName, copyFileName); } This throws an exception: boost::filesystem::path: invalid name "D:\Temp\CDFix\INDEX.HTM.bak" in path: "D:\Temp\CDFix \INDEX.HTM.bak" [...]

4 4

Boost::Variant
by Akim Demaille 12 Dec '03

12 Dec '03

What is the status of Boost::Variant? It used to be documented in replicas of the real Boost documentation, but now these sites seem to be closed, and I can't find any information on boost.org. Thanks!

2 2

Need linking help for boost::filesystem
by Scott Meyers 12 Dec '03

12 Dec '03

I'd like to play with boost::filesystem, and this turns out to be the first boost library I've tried to use that requires that I build something first. I downloaded bjam, and it appears that I have successfully built filesystem libraries for the compilers I care about (VC6, VC7.1, gcc, and como), because there is a subdirectory for each of them under the libboost_filesystem.lib directory, and each subdirectory, if you push down far enough, has .obj files under both debug and release. But I can't get anything to link. I can get the sample filesystem app (simple_ls.cpp) to compile cleanly under all compilers, but nothing will link. It seems clear that I somehow need to tell the linker where to find the appropriate filesystem libraries, but I'm not sure where to point it. Help? I'm running Windows 2000. Thanks, Scott

10 15

newbie BGL problem: core dump due to graph size
by duccio.medini＠tin.it 12 Dec '03

12 Dec '03

Hi all. I am calculating the connected components of af graph with a c++ code written with BGL. My graph is huge (4E+05 vertexes, 10^6 ~ 10^8 edges). The code uses the connected_components algorithm (or, in a different version, directly the depth_first_visit one) and works well up to a "reasonable" number of edges in the graph. Over this threshold it core dumps. I have the same problem both on SPARC Solaris 9 g++3.2.2 and on Intel Linux 2.4 g++3.1 . I know that it should not be a problem of the RAM memory available on the system (or addressable form a single istance). I am able to use up to 6-7 GBs of RAM, and it tipically core dumps at 2.5-5 GBs. I suspect that I'm violating some intrinsic size limit in the BGL adjacency_list class or similar. Are there such limits, and can they be extended? Any clue would be really appreciated. Thanks in advance! Duccio Medini

4 4

Shared_ptr and constness
by cyril.godart＠bnpparibas.com 12 Dec '03

12 Dec '03

Hi, Just out of curiosity. I am increasingly using the smart_ptr and more specifically the shared_ptr but I came to realize that actually it rather violently breaches the constness rules. The example below is one of the many things you can do with a shared pointer that is forbidden with a naked pointer. As the shared_ptr penetrates even further in my code I come to realize that what I am gaining on the comfort side I loose on the safety. Clearly, that's my call but I was curious to know if it is a known fact that it is impossible to enforce constness rules. Cyril Godart Quantitative Analyst BNP Paribas. struct A { int bar; }; typedef boost::shared_ptr<A> A_ptr_t; void foo(const A_ptr_t& a) { a->bar++;//semantically this should not be possible. } int main(int argc, char* argv[]) { A_ptr_t a(new A); a->bar = 1; foo(a); return 0; } This message and any attachments (the "message") is intended solely for the addressees and is confidential. If you receive this message in error, please delete it and immediately notify the sender. Any use not in accord with its purpose, any dissemination or disclosure, either whole or partial, is prohibited except formal approval. The internet can not guarantee the integrity of this message. BNP PARIBAS (and its subsidiaries) shall (will) not therefore be liable for the message if modified. --------------------------------------------- Ce message et toutes les pieces jointes (ci-apres le "message") sont etablis a l'intention exclusive de ses destinataires et sont confidentiels. Si vous recevez ce message par erreur, merci de le detruire et d'en avertir immediatement l'expediteur. Toute utilisation de ce message non conforme a sa destination, toute diffusion ou toute publication, totale ou partielle, est interdite, sauf autorisation expresse. L'internet ne permettant pas d'assurer l'integrite de ce message, BNP PARIBAS (et ses filiales) decline(nt) toute responsabilite au titre de ce message, dans l'hypothese ou il aurait ete modifie.

2 1

ISO C++ does not support `long long'
by Joshua Moore-Oliva 11 Dec '03

11 Dec '03

When compiling programs that use boost, I get multiple warnings along these lines.. /home/josh/boost/type_traits/is_convertible.hpp:274: warning: ISO C++ does not support `long long' /home/josh/boost/type_traits/is_convertible.hpp:274: warning: ISO C++ does not support `long long' In file included from /home/josh/boost/iterator_adaptors.hpp:125, from /home/josh/boost/token_iterator.hpp:15, from /home/josh/boost/tokenizer.hpp:21, Am I doing something wrong? do I need to #define something? Using FreeBSD 4.9, gcc 3.2.3. Thanks, Joshua Moore-Oliva

3 3

filesystem::copy_file throws -- but why?
by Scott Meyers 11 Dec '03

11 Dec '03

I'm trying to use copy_file to, well, copy a file to a backup file (signified by adding ".bak" to the file's name). Here's what I'm doing, chopped way down: int processFile(const fs::path& fileName) { fs::path copyFileName(fileName.native_file_string() + ".bak"); fs::copy_file(fileName, copyFileName); } This throws an exception: boost::filesystem::path: invalid name "D:\Temp\CDFix\INDEX.HTM.bak" in path: "D:\Temp\CDFix \INDEX.HTM.bak" I don't see what's invalid about this name. From what I can tell, I'm fulfilling copy_file's preconditions and not falling into one of the cases where it's supposed to throw. What am I doing wrong? Thanks, Scott

1 0

RE: [Boost-users] Re: Re: Need linking help for boost::filesystem
by Ben Hutchings 10 Dec '03

10 Dec '03

Scott Meyers <Usenet(a)aristeia.com> wrote: > > Try a slight variation: > > > > cl /TP /W4 /WL /GX /GR -ID:\C++\Boost\Current simple_ls.cpp > > %BOOST_FILESYSTEM_LIB% > > Alas, that doesn't help. I still get multiply defined symbols. > This is with 1.30.2. It looks like your program and the filesystem library are built against different versions of the C/C++ run-time library. Under the control of #pragma directives, Visual C++ compiler can insert references into object files that tell the linker which libraries to link with. In this case the linker tries to link with both run-time libraries and finds conflicting definitions. Check that you're linking with the right build of the filesystem library. > Is there any reason to expect that the > problem will magically go away if the get the CVS version? Perhaps. The Boost headers are now using the abovementioned pragma to (hopefully) select the right library to link with. Ben.

2 1

Need linking help for boost::filesystem
by Witz 10 Dec '03

10 Dec '03

I had the same problem on VC7.1 - multiply defined symbols and thought i was just being dumb - with Scott having the same problem, maybe i wasn't :) I got round it by including the source files in the project i was working on - not the solution i'd have liked but it has the benefit of working and allowing me to get on with doing my 'proper' coding. So, are we going to be seeing 'Effective Boost' in the near future then Scott? :) Ian Whittley

2 1

RE: [Boost-users] Re: newbie question: graph library with gcc 3.2.1
by Vikram Anantha 09 Dec '03

09 Dec '03

Answered my own question. I replaced libbgl-viz with bgl-viz in lib/graph/example/Jamfile. I seem to be getting a little further. I'll get back with the other harder questions. Didn't want to waste people's time with questions I can answer myself :) Thanks Vik -----Original Message----- From: Vikram Anantha Sent: Tuesday, December 09, 2003 9:56 AM To: Boost Users mailing list Subject: RE: [Boost-users] Re: newbie question: graph library with gcc 3.2.1 I am using the released version 1.30.2. I had to make a change to the lib/graph/Jamfile.v2 as detailed in this email http://aspn.activestate.com/ASPN/Mail/Message/boost/1802962 in order to make the graph library compile. If at all possible, I would like to not use the current snaphot on CVS and make small local changes based on the released version. If possible, could somebody give me a little diff on the jamfile or something like that. Also, Volodya, Do your changes fix the problem with the graph examples failing or do they fix the warnings in the graph library? Thanks Vik -----Original Message----- From: Vladimir Prus [mailto:ghost@cs.msu.su] Sent: Monday, December 08, 2003 10:13 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: newbie question: graph library with gcc 3.2.1 Hi Vikram, > I tried building the graph library and the graph examples with bjam. I > am using gcc 3.2.1 on Solaris 2.8. > > The library seemed to build successfully but did have warnings. The > examples failed to build complaining that it could not find the > dependent graph library which seems to be a problem with my > LD_LIBRARY_PATH or something like that. The build outputs for both > cases are given below. I did not do any customizing for either of > these builds. My cmd line was bjam "-sTOOLS=gcc" > > Any help is appreciated. Thanks in advance What version of Boost are you using? If it's CVS version, then you might try to run "cvs up" now and try again. I've fixed some typos which were causing the above error. - Volodya _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] Re: newbie question: graph library with gcc 3.2.1
by Vikram Anantha 09 Dec '03

09 Dec '03

I am using the released version 1.30.2. I had to make a change to the lib/graph/Jamfile.v2 as detailed in this email http://aspn.activestate.com/ASPN/Mail/Message/boost/1802962 in order to make the graph library compile. If at all possible, I would like to not use the current snaphot on CVS and make small local changes based on the released version. If possible, could somebody give me a little diff on the jamfile or something like that. Also, Volodya, Do your changes fix the problem with the graph examples failing or do they fix the warnings in the graph library? Thanks Vik -----Original Message----- From: Vladimir Prus [mailto:ghost@cs.msu.su] Sent: Monday, December 08, 2003 10:13 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: newbie question: graph library with gcc 3.2.1 Hi Vikram, > I tried building the graph library and the graph examples with bjam. I > am using gcc 3.2.1 on Solaris 2.8. > > The library seemed to build successfully but did have warnings. The > examples failed to build complaining that it could not find the > dependent graph library which seems to be a problem with my > LD_LIBRARY_PATH or something like that. The build outputs for both > cases are given below. I did not do any customizing for either of > these builds. My cmd line was bjam "-sTOOLS=gcc" > > Any help is appreciated. Thanks in advance What version of Boost are you using? If it's CVS version, then you might try to run "cvs up" now and try again. I've fixed some typos which were causing the above error. - Volodya _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

newbie question: graph library with gcc 3.2.1
by Vikram Anantha 09 Dec '03

09 Dec '03

I tried building the graph library and the graph examples with bjam. I am using gcc 3.2.1 on Solaris 2.8. The library seemed to build successfully but did have warnings. The examples failed to build complaining that it could not find the dependent graph library which seems to be a problem with my LD_LIBRARY_PATH or something like that. The build outputs for both cases are given below. I did not do any customizing for either of these builds. My cmd line was bjam "-sTOOLS=gcc" Any help is appreciated. Thanks in advance Vik Anantha <GRAPH EXAMPLES BEGIN> unknown dependent target <libs!graph!build>liblibbgl-viz.a </GRAPH EXAMPLES END> <BGL BUILD BEGIN> ...patience... ...found 437 targets... ...updating 11 targets... MkDir1 ../../../libs/graph/build/bin MkDir1 ../../../libs/graph/build/bin/libbgl-viz.a MkDir1 ../../../libs/graph/build/bin/libbgl-viz.a/gcc MkDir1 ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug MkDir1 ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug/inlining-on MkDir1 ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug/inlining-on/runtime -link-dynamic gcc-C++-action ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug/inlining-on/runtime -link-dynamic/graphviz_graph_lex.o lex.yy.c:1169: warning: `void yyunput(int, char*)' defined but not used gcc-C++-action ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug/inlining-on/runtime -link-dynamic/graphviz_digraph_lex.o lex.yy.c:1169: warning: `void yyunput(int, char*)' defined but not used gcc-C++-action ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug/inlining-on/runtime -link-dynamic/graphviz_graph_parser.o graphviz_parser.y: In function `void boost::read_graphviz(const std::string&, boost::GraphvizGraph&)': graphviz_parser.y:492: warning: unused variable `void*in' graphviz_parser.y: In function `void boost::read_graphviz(FILE*, boost::GraphvizGraph&)': graphviz_parser.y:497: warning: unused variable `void*in' /home/installs/boost-1.30.2/boost/tuple/detail/tuple_basic.hpp: At top level: graphviz_parser.y:81: warning: `const std::string& graphviz::get_graph_name(const graphviz::Subgraph&)' defined but not used gcc-C++-action ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug/inlining-on/runtime -link-dynamic/graphviz_digraph_parser.o graphviz_parser.y: In function `void boost::read_graphviz(const std::string&, boost::GraphvizDigraph&)': graphviz_parser.y:492: warning: unused variable `void*in' graphviz_parser.y: In function `void boost::read_graphviz(FILE*, boost::GraphvizDigraph&)': graphviz_parser.y:497: warning: unused variable `void*in' /home/installs/boost-1.30.2/boost/tuple/detail/tuple_basic.hpp: At top level: graphviz_parser.y:81: warning: `const std::string& graphviz::get_graph_name(const graphviz::Subgraph&)' defined but not used gcc-Archive-action ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug/inlining-on/runtime -link-dynamic/libbgl-viz.a ar: creating ../../../libs/graph/build/bin/libbgl-viz.a/gcc/debug/inlining-on/runtime -link-dynamic/libbgl-viz.a ...updated 11 targets... </BGL BUILD END>

2 1

link fail against boost_filesystem on FreeBSD 5 with gcc 3.3.3
by Ying-Chieh Liao 04 Dec '03

04 Dec '03

It's my first time using boost I'm using boost 1.30.2 with FreeBSD 5, where gcc version is 3.3.3 following is my code, quite simple <code> #include <boost/filesystem/operations.hpp> #include <boost/filesystem/fstream.hpp> #include <string> #include <iostream> namespace fs = boost::filesystem; const std::string LogFileName = "ggyy"; int main(void) { fs::ifstream LogFile(LogFileName); return 0; } </code> it compiles well, but failed on linking : <error> g++ -L/usr/local/lib -lboost_filesystem -o LogParser LogParser.o LogParser.o: In function `main': LogParser.o(.text+0x27): undefined reference to `boost::filesystem::path::path(std::string const&)' LogParser.o(.text+0x51): undefined reference to `boost::filesystem::path::native_file_string() const' *** Error code 1 </error> My boost is built from the ports system, and I'm sure I have libboost_filesystem.a and other related boost libraries TEST [/usr/local/lib] -ijliao- ls -al *boost* -r--r--r-- 1 root wheel 4058 Dec 1 11:51 libboost_date_time.a -r-xr-xr-x 1 root wheel 4524 Dec 1 11:51 libboost_date_time.so -r--r--r-- 1 root wheel 66680 Dec 1 11:51 libboost_filesystem.a -r--r--r-- 1 root wheel 23888 Dec 1 11:51 libboost_prg_exec_monitor.a -r-xr-xr-x 1 root wheel 15524 Dec 1 11:51 libboost_prg_exec_monitor.so -r--r--r-- 1 root wheel 524054 Dec 1 11:51 libboost_regex.a -r-xr-xr-x 1 root wheel 352124 Dec 1 11:51 libboost_regex.so -r--r--r-- 1 root wheel 3861324 Dec 1 11:51 libboost_regex_debug.a -r-xr-xr-x 1 root wheel 496028 Dec 1 11:51 libboost_regex_debug.so -r--r--r-- 1 root wheel 167428 Dec 1 11:51 libboost_signals.a -r-xr-xr-x 1 root wheel 82980 Dec 1 11:51 libboost_signals.so -r--r--r-- 1 root wheel 192482 Dec 1 11:51 libboost_test_exec_monitor.a -r-xr-xr-x 1 root wheel 106912 Dec 1 11:51 libboost_test_exec_monitor.so -r-xr-xr-x 1 root wheel 31636 Dec 1 11:51 libboost_thread.so -r-xr-xr-x 1 root wheel 53920 Dec 1 11:51 libboost_threadd.so -r--r--r-- 1 root wheel 185892 Dec 1 11:51 libboost_unit_test_framework.a -r-xr-xr-x 1 root wheel 103008 Dec 1 11:51 libboost_unit_test_framework.so so... could someone tell me how to solve this problem ? -- KISS : Keep It Simple, Stupid.

1 1

Re: regex static lib for x86 emulator
by Reuti_Raman_Babu＠sdc.canon.co.in 03 Dec '03

03 Dec '03

Thank for the earlier responses. It seems almost impossible to build regex lib to Pocket PC platform. I am getting following errors: regexs.lib(src.obj) : error LNK2001: unresolved external symbol "public: __cdecl boost::w32_regex_traits<unsigned short>::w32_regex_traits<unsigned short>(void)" (??0?$w32_regex_traits@G@boost@@QAA@XZ) regexs.lib(src.obj) : error LNK2019: unresolved external symbol CreateFileMappingA referenced in function "public: void __cdecl boost::re_detail::mapfile::open(char const *)" (?open@mapfile@re_detail@boost@@QAAXPBD@Z) regexs.lib(src.obj) : error LNK2019: unresolved external symbol CreateFileA referenced in function "public: void __cdecl boost::re_detail::mapfile::open(char const *)" (?open@mapfile@re_detail@boost@@QAAXPBD@Z) regexs.lib(src.obj) : error LNK2019: unresolved external symbol FindFirstFileA referenced in function "public: __cdecl boost::re_detail::file_iterator::file_iterator(char const *)" (??0file_iterator@re_detail@boost@@QAA@PBD@Z) regexs.lib(src.obj) : error LNK2019: unresolved external symbol FindNextFileA referenced in function "public: void __cdecl boost::re_detail::file_iterator::next(void)" (?next@file_iterator@re_detail@boost@@QAAXXZ) regexs.lib(src.obj) : error LNK2019: unresolved external symbol "public: static class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __fastcall boost::re_detail::w32_traits_base::error_string(unsigned int)" (?erro This error description "regexs.lib(src.obj) : error LNK2001: unresolved external symbol "public: __cdecl boost::w32_regex_traits<unsigned short>::w32_regex_traits<unsigned short>(void)" (??0?$w32_regex_traits@G@boost@@QAA@XZ)" doesn't make much sense to me. Others are not supported by Pocket PC 2003 SDK.Although unicode version of corresssponding API is supported. Please suggest any solution . Regards, Reuti "John Maddock" <john@johnmaddock To: <Reuti(a)sdc.canon.co.in> .co.uk> cc: Subject: Re: regex static lib for x86 emulator 11/20/2003 06:57 PM > I can build static library for ARM processor. > But when building for X86 emulator I am getting following error. > > LINK : fatal error LNK1104: cannot open file 'boost_regex_vc6_sss.lib' > > Please help. You shouldn't see that when building the source, only when trying to link a dll of exe that uses the lib - but in any case defining BOOST_REGEX_NO_LIB when building your code will stop the headers from looking for a lib to link to, and allow you to specify your own lib to link to. I hope that makes it clear :-) John.

2 1

bind/function/??? - accessing global function static type with runtime dll
by Jeff Flinn 01 Dec '03

01 Dec '03

I'm interfacing with several 'C' dynamic link libraries each with the same interface. The appropriate libraries get loaded/unloaded at run time. The following is an attempt create a wrapper that returns a function pointer of the proper static type as declared for the 'C' functions. //------------------------------ class DLL { HMODULE mDLLHdl; public: ~DLL(){ FreeLibrary( mDLLHdl ); } DLL( const std::string& aDLLName ) :mDLLHdl( LoadLibrary( aDLLName.c_str() ) ){} operator bool()const{ return mDLLHdl; } operator HMODULE()const{ return mDLLHdl; } template< typename TFnc > TFnc Fnc( const std::string& aName, TFnc )const { return (TFnc)GetProcAddress( mDLLHdl, aName.c_str() ); } }; //------------------------------ With: typedef int (FAR WINAPI *FARPROC)(); FARPROC GetProcAddress( HMODULE hModule, // handle to DLL module LPCSTR lpProcName // function name ); For example, it's used as follows: //------------------------------ // declared in an included header with extern "C" int DoAttach( const char* aName, int attachMode ); DLL lSomeDll( "Some.dll" ); boost::function0<int> lFnc = boost::bind( lSomeDll.Fnc( "DoAttach", DoAttach ), "Name", 123 ); //------------------------------ Which compiles fine, but results in unresolved external symbols errors during linking for 'DoAttach' in this example. I can force-link and run the resulting executable w/out problem. Is there a way to get the type of the function without the compiler needing to use the function pointer itself? Thanks, Jeff

1 0

ublas + msvc 7.1
by Witz 01 Dec '03

01 Dec '03

hi, I seem to be having problems with ublas in combination with msvc 7.1. Compiling the code below results in a whole slew of errors of the form: 'use of undefined type 'boost::numeric::SOME_MATRIX_TYPE<ARGS>::const_iterator2' Am i doing something dumb or is something broken? #include <boost/numeric/ublas/triangular.hpp> int main() { using namespace boost::numeric::ublas; triangular_matrix<int,lower> ldm(4,4); } I.M.Whittley

3 2

Vertex descriptors in adjacancy_list
by Ali Tofigh 01 Dec '03

01 Dec '03

Is there any guarantee that Vertex descriptors are some kind of integers? In the examples provided add_edge is called with integers as vertex descriptors. Does the choice of parameters for the adjacency_list graph make a difference on this issue? E.g. whether the we choose vecS or listS as VertexList? If future flexibility of the program being written is a factor (e.g. if we want it to be easy to change the definition of the graphs without necessarily changing other parts of the code) is it better to use add_vertex, followed by add_edge using the vertex descriptors returned by add_vertex? Regards, A. T.

3 4

Re: [Boost-users] Re: ublas + msvc 7.1
by cyril.godart＠bnpparibas.com 01 Dec '03

01 Dec '03

I have noticed something similar with msvc 7.1. Could you try please to locate the first occurence of the error and prefix any template deduced type with "typename". In the example you give: typename boost::numeric::SOME_MATRIX_TYPE<ARGS>::const_iterator2 and check that this precise compile error disappears ? (I have realised the code is boost::ublas'). This does not intend to solve your problem but to point to what vc7.1 is expecting. I am not sure whether that should be strict ISO C++. Regards, Cyril Godart. Internet fuxiaowei9999@hotmail.com@lists.boost.org - 25/11/2003 12:21 Please respond to boost-users(a)lists.boost.org Sent by: boost-users-bounces(a)lists.boost.org To: boost-users cc: Subject: [Boost-users] Re: ublas + msvc 7.1 Hi Whittley: I think this may be a bug in VC7.1. I try it successly under VC6.0 and find that the ublas is develop under VC6.0 with Dinkumware STL in its document. Yours f_x_w ----- Original Message ----- From: "Witz" <witz(a)nildram.co.uk> Newsgroups: gmane.comp.lib.boost.user Sent: Monday, November 24, 2003 9:09 AM Subject: ublas + msvc 7.1 > hi, > > I seem to be having problems with ublas in combination with msvc 7.1. > Compiling the code below results in a whole slew of errors of the form: > > 'use of undefined type > 'boost::numeric::SOME_MATRIX_TYPE<ARGS>::const_iterator2' > > Am i doing something dumb or is something broken? > > #include <boost/numeric/ublas/triangular.hpp> > > int main() > { > using namespace boost::numeric::ublas; > triangular_matrix<int,lower> ldm(4,4); > } > > I.M.Whittley _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users This message and any attachments (the "message") is intended solely for the addressees and is confidential. If you receive this message in error, please delete it and immediately notify the sender. Any use not in accord with its purpose, any dissemination or disclosure, either whole or partial, is prohibited except formal approval. The internet can not guarantee the integrity of this message. BNP PARIBAS (and its subsidiaries) shall (will) not therefore be liable for the message if modified. --------------------------------------------- Ce message et toutes les pieces jointes (ci-apres le "message") sont etablis a l'intention exclusive de ses destinataires et sont confidentiels. Si vous recevez ce message par erreur, merci de le detruire et d'en avertir immediatement l'expediteur. Toute utilisation de ce message non conforme a sa destination, toute diffusion ou toute publication, totale ou partielle, est interdite, sauf autorisation expresse. L'internet ne permettant pas d'assurer l'integrite de ce message, BNP PARIBAS (et ses filiales) decline(nt) toute responsabilite au titre de ce message, dans l'hypothese ou il aurait ete modifie.

2 1

Help! Error in quote.hpp...
by Dan W. 01 Dec '03

01 Dec '03

Hi, first-time poster. Got an automated reply to the effect that my first post would be moderated; but later I got another automated email about the moderator being on vacation; and I'm in a hurry, so I hope it's okay for me to re-post here. I'm using latest betas for Digital Mars, STLport and BOOST, and I'm trying to compile a state-machine using boost's fsm::state_machine. My include line is as follows: G:\boost-1.30.2;G:\boost-1.30.2\boost\mpl;G:\boost-1.30.2\libs\mpl\example\fsm;G:\dm\STLport-5.0-1031\stlport;G:\dm\include Here's the top of my file: ............................................................................... #include <iostream> #include "boost/mpl/list.hpp" #include "state_machine.hpp" namespace mpl = boost::mpl; class rec_frm_sm : fsm::state_machine<rec_frm_sm> { public: ............................................................................... What I get on the output window is: sc rec_frm.cpp -Ae -Aa -r -mn -C -WA -S -3 -a8 -c -gf -IG:\boost-1.30.2 -IG:\boost-1.30.2\boost\mpl -IG:\boost-1.30.2\libs\mpl\example\fsm -IG:\dm\STLport-5.0-1031\stlport -IG:\dm\include -orec_frm.obj Error: G:\boost-1.30.2\boost/mpl/aux_/preprocessed/plain /quote.hpp(7): no type for argument 'T' Error: G:\boost-1.30.2\boost/mpl/aux_/has_type.hpp(23): no type for argument 'T' ..................................... Build failed I'm not sure how to track the include path for quote.hpp and has_type.hpp. I notice there's a link at www.boost.org for tracking header file inclusion, but the link appears to be broken. Any help would be appreciated. Yours. dan

2 1

Re: [Boost-users] Help with function and/or bind libraries
by John.Wismar＠alldata.com 30 Nov '03

30 Nov '03

On Sun, 30 Nov 2003 Douglas Paul Gregor <gregod(a)cs.rpi.edu> wrote: > You can replace the body of get_total with: > > return std::accumulate(myVec.begin(), myVec.end(), 0, > boost::bind(std::plus<int>(), //bind 1 > _1, > boost::bind(&B::stretch_it, //bind 2 > this, > boost::bind(&A::size, //bind 3 > _2)))); > > You can decide whether that's better than the hand-coded loop or not :) >From a maintainability standpoint, I don't think I'll make that switch. ; -) Thanks for the reply, though! (Now I just have to try to figure out what it's doing!) --------------------- John Wismar -- RPI '90 john.wismar(a)alldata.com

1 0

Help with function and/or bind libraries
by John.Wismar＠alldata.com 30 Nov '03

30 Nov '03

Here's the situation I'm trying to remedy, boiled down: class A { public: int size() const; }; class B { public: int stretch_it(int size) const; int get_total() const; private: std::vector<A> myVec; }; int B::get_total() const { int retVal = 0; for (std::vector<A>::const_iterator it = myVec.begin(); it != myVec.end (); ++it) { retVal += stretch_it(it->size()); } return retVal; } I'd love to use std::accumulate() or equivalent instead of a hand-coded loop, but I don't know if it's possible to specify a combination of operations like I have here.... Or if the result would be readable! Any suggestions would be much appreciated! --------------------- John Wismar john.wismar(a)alldata.com

2 1

boost::function - why does this work??
by Matt S Trentini 29 Nov '03

29 Nov '03

Heya Everyone, I am trying to create a generic way to extract a list of objects from another list of objects. Let me explain! Say I have a vector (or any container with fwd iterators and value_type) that contains objects that have a function which returns a long (could actually be any type). I want to iterate over that vector and extract each of the longs into a list (or any container that supports push_back and defines value_type). Something like the following: class HandleClass { public: long handle() const { return val_++; } private: static long val_; }; // ... std::vector<HandleClass> listOfHcs; // ... fill listOfHcs here std::list<long> needToFill; OK so far. I then wrote this extraction function (yes, there are many ways I could have done this - with a functor and using foreach is another possibility worth exploring, but not now :) ). template < class ReturnContainer, class FwdIterator > void Extract(const FwdIterator & itBegin, const FwdIterator & itEnd, ReturnContainer & container, boost::function1<ReturnContainer::value_type, FwdIterator::value_type> f) { for (FwdIterator it = itBegin ;it != itEnd; ++it) { container.push_back(f(*it)); } }; And I was able to do this: Extract(listOfHcs.begin(), listOfHcs.end(), needToFill, &HandleClass::handle); And it worked like a charm. needToFill gets filled and I was happy. :) However we also had containers of _pointers_to_ HandleClasses. So in some cases our vector looked like: std::vector<HandleClass *> listOfHcs; Yet the same code worked! I couldn't, and can't, for the life of me understand what was going on (I expected that I would have to wrap the (*it) in a boost::remove_pointer which worried me because my compiler - MSVC7.0 - doesn't support partial template specialization). Don't get me wrong, I'm happy that it work but can anyone explain what fandangelory is going on inside boost::function (or perhaps it's some C++ magic?) to allow this? Cheers, Matt

2 4

Compilation troubles on BSD..
by Joshua Moore-Oliva 28 Nov '03

28 Nov '03

I'm having trouble compiling code on BSD with boost, specifically boost_filesystem. I'm using gcc 3.2.3 On linux, there is no problem, buit on BSD.. this is what happens. Notice that there is no trouble FINDING -lboost_filesystem to link with, but that I'm getting undefined references to anything boost-related. This compiles without any errors on both BSD and linux, but the linking on BSD is the problem. Has anyone had any experiences getting boost to work on BSD before? Thanks, Josh. <snip> signalConfigReload.o \ signalShutdown.o -o Batcher -L. -lChatsUtils -lConfig -lFfm -lFfmStream -lShared -lboost_filesystem -L/usr/local/pqxx/lib -lpqxx markFinished.o: In function `Batcher::markFinished()': /home/josh/src/mastermailings/code/daemons/Batcher/Batcher/markFinished.cpp:9: undefined reference to `boost::filesystem::path::path[in-charge](std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)' /home/josh/src/mastermailings/code/daemons/Batcher/Batcher/markFinished.cpp:9: undefined reference to `boost::filesystem::path::path[in-charge](std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)' /home/josh/src/mastermailings/code/daemons/Batcher/Batcher/markFinished.cpp:9: undefined reference to `boost::filesystem::rename(boost::filesystem::path const&, boost::filesystem::path const&)' restore.o: In function `Batcher::restore(Ffm&, std::basic_ifstream<char, std::char_traits<char> >&)': /home/josh/src/mastermailings/code/daemons/Batcher/Batcher/restore.cpp:8: undefined reference to `boost::filesystem::path::path[in-charge](std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)' /home/josh/src/mastermailings/code/daemons/Batcher/Batcher/restore.cpp:8: undefined reference to `boost::filesystem::exists(boost::filesystem::path const&)' collect2: ld returned 1 exit status

1 0

graph library: internal property problem
by Vasco Lohrenscheit 28 Nov '03

28 Nov '03

Hello, I have some problems with graph properties. For a project I created a layer above the boost graph library. So i have: template <typename N, typename E, typename GT> GraphNode : public N {} template <typename N, typename E, typename GT> GraphEdge : public E {} template <typename N, typename E> Graph {} with BGL properties like: typedef GraphNode<N,E,GraphTraits> tNode; typedef property <typename tNode::vertex_property, tNode*> NodeProperty; As internal graph properties i use pointers to GraphNode and GraphEdge with property tags defined in N and E, e.g. class LogicState { public: enum vertex_state_t {vertex_state=123;} static const vertex_state_t PropertyTag; } const LogicState::vertex_state_t LogicState::PropertyTag=vertex_state; and template specialization for property_kind: template <> struct property_kind <GraphEdge<LogicState, LogicConstraint, GraphTraits> > { typedef vertex_property_tg type; }; with using put(tNode::PropertyTag, graph, somestate); i get the following compile error: error C2679: binary '=' : no operator found which takes a right-hand operand of type 'GraphEdge<N,E,G> ' (or there is no acceptable conversion) with [ N=LogicState, E=LogicConstraint, G=Graph<LogicState,LogicConstraint>::tGraphTraits ] in line 316 in property_map.hpp: "static_cast<const PropertyMap&>(pa)[k] = v;" I'm using the current cvs version of boost and vc++7.1. Any ideas what can cause this problem ? Why there exist no "=" operator ? Where should it be defined/generated in normal cases ? Without my layer, with pure BGL and BOOST_INSTALL_PROPERTY I had it already working. Shouldn't it also be of type GraphEdge<N,E,G>* ? I've checked my code and everywhere I used pointers (in the property definition and with the put). Then another questions: The online docs for the BGL weren't very helpfull for me. Is the BGL book better, or is it only an enhanced version of the online docs ? best regards, Vasco Lohrenscheit

1 0

Re: [Boost-install] Installing BOOST1_30_2 under HP UX 11.11 - URGENT
by David Abrahams 27 Nov '03

27 Nov '03

"Lalit Seth" <laalit_seth(a)hotmail.com> writes: > hi all, > > I m trying to install BOOST1_30_2 under HPUX11.11 > i did bjam to make > I m hving gcc3.2 on HPUX11.11 > > Its giving me failed 22 targets, > skipped 15 targets > done 384 targets. > > Is this right or do i have to change / add parameters to bjam. > > ITS QUITE URGENT. > > Rgds > Lalit Seth Lalit, First please take your Boost installation problems to the Boost.Users list or Boost.Build list (http://www.boost.org/more/mailing_lists.htm#jamboost) This list is out of commission. Second of all, though I am not sure why we don't have the 1.30.2 regression logs posted so I can check, it's not entirely surprising to see 22 targets failing with GCC-3.2. IIRC It does have bugs which prevent a few libraries from compiling. -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

C++Builder and Boost Graph Library
by Guilherme Mello de Moura 26 Nov '03

26 Nov '03

Hi guys, My name is Guilherme and I'm trying to use Boost Graph Library with Borland C++Builder.. I'm getting several compilation errors.. I downloaded the latest BGL version (1.30.2) and tried to compile the first graph example I saw.. Here's what I got: Using Boost Graph Library (BGL) version 1.30.2 with C++Builder 5.0 (6.0).. [C++ Error] tuple_basic.hpp(158): E2434 Template declaration missing template parameters ('template<...>') [C++ Error] tuple_basic.hpp(158): E2238 Multiple declaration for 'element<N,T>' [C++ Error] tuple_basic.hpp(143): E2344 Earlier declaration of 'element<N,T>' I also tried to compile the example tests that come with BGL .. And I got some problems with some of them .. Has anybody had the same problem ?!?! Am I doing something wrong ?!?! Regards, Guilherme Mello de Moura

1 0

unit_test_framework - redirect output
by Steven Ketcham 25 Nov '03

25 Nov '03

Perhaps I am making this difficult or even missing the point but... Can I create tests with the unit_test_framework and redirect the output to a GUI? As it stands this is not possible because of int main(...) being defined. Using Windows 2000. Thanks! -- Using M2, Opera's revolutionary e-mail client: http://www.opera.com/m2/

2 1

[BGL] Using default_dfs_visitor on a graph with std::list as the vertex type
by sashan 25 Nov '03

25 Nov '03

I'm trying to use a vistitor class on a graph I have defined. The visitor class is very simple and inherits from default_dfs_visitor: class OpenGLVisitor : public boost::default_dfs_visitor { public: OpenGLVisitor(void); virtual ~OpenGLVisitor(void); }; My graph type is: typedef adjacency_list < vecS, listS, directedS > graph_t; The code to perform a dfs on the graph is as follows: graph_t g; depth_first_search(g, visitor(OGLVisitor)); However I get the compiler error (see attachment). If I change the typedef to typedef adjacency_list < vecS, vecS, directedS > graph_t; then there is no error. This seems odd since it should also work when the vertices of the graph use the std::list as their container class. I'm using VC++7.1.

3 2

Using boost::lamba with a vector of shared_ptr's
by Allen Bierbaum 24 Nov '03

24 Nov '03

Hello all. I am having trouble with the boost lambda library. I am convinced that my troubles come from some little thing I am overlooking, but for the life of me I can't seem to find the problem. I have been looking at it for the entire afternoon with no solution in sight. I have included some sample code below showing the basic idea of what I am trying to accomplish. Can anyone provide me with a working solution? The summary is: - I have a vector of shared_ptr's to a class A - That class has a method that returns a value I would like to test for in a find_if call ============================================================ namespace bl = boost::lambda class A { int getInt(); }; class Foo { A bar(); } std::vector<shared_ptr<Foo> > foos; shared_ptr<Foo> foo_ptr; A test_val; test_val = (bl::_1 ->* &Foo::bar )(foo_ptr); int find_int = 10; iter found = find_if(foos.begin(), foos.end(), (bl::_1->* &Foo::bar).getInt() == child_guid); ==================================================================== Can anyone tell me how I can call a method from a lamda method iterating over a sequence of shared_ptrs? And then how do I have this method also call another method? Thanks, Allen

4 7

regex question
by Paul Scruby 24 Nov '03

24 Nov '03

I have question about match_result. How can I find out what was matched from the regular expression? In the boost documentation, the example for regex_search does something similar to this... regex needle("foo|bar"); string haystack("blah bar blah"); string::const_iterator start = haystack.begin(); string::const_iterator end = haystack.end(); boost::match_results<string::const_iterator> what; *unsigned* *int* flags = boost::match_default; * while*(regex_search(start, end, what, expression, flags)) { // please output 'bar' string match(string(what[5].first, what[5].second) + std::string(what[6].first, what[6].second)); cout << "Found '" << match << "'\n"; start = what[0].second; flags |= boost::match_prev_avail; flags |= boost::match_not_bob; } However, this is outputing nothing. I also tried what.str(), but that gave me nothing too. Thanks again, Paul

2 1

problem with lexical_cast<int>(std::wstring)
by Ronnie Lazar 24 Nov '03

24 Nov '03

Hi, I'm trying to use lexical_cast<int>(std::wstring), on msvc6 with STLPort, and I get compilation errors. The reason for them is that DISABLE_WIDE_CHARS_SUPPORT is defined in the beginning of lexical_cast.hpp. If I add a line to undef this, in the file, it compiles and works fine, which leads me to belice that this define sould not really be defined. I searched a little more and found that it is defined because BOOST_NO_INTRINSIC_WCHAR_T is defined. My understanding is that this define specifies that the environment does not have wchar_t as a real type, but as a typedef. Why should this interfere with lexical_cast? Any suggestions on how to work around this (apart from changing lexical_cast.hpp source at my site? Thanks Ronnie Lazar

1 0

problem using function lib in MSVC6
by Kim 22 Nov '03

22 Nov '03

Boost version: 1.30.2 Boost Lib: Function OS: Windows XP Pro SP 1 Dev. Env.: Microsoft VS6 SP 6, .NET 2003 Platform SDK Feb 2003, DirectX9 SDK Problem: Can't get an example similar to the one found in the tutorial to work. // ************************************* #include <boost/function.hpp> #include <functional> struct X { int foo(int v) { return v;} }; int main(int argc, char* argv[]) { boost::function1<int, int> f; X x; f = std::bind1st ( std::mem_fun(&X::foo), &x ); f(5); // Call x.foo(5) return 0; } //*************************************** I get this error message: : error C2784: 'class std::mem_fun_t<_R,_Ty> __cdecl std::mem_fun(_R (__thiscall _Ty::*)(void))' : could not deduce template argument for '<Unknown>' from 'int (__thiscall X::*)(int)'

2 1

Boost.Thread problem with thread_specific_ptr<>::release ?
by Roland 21 Nov '03

21 Nov '03

Dear Boosters! As I am still trying to figure out how to use the thread local storage pointer I found another strange behaviour. Perhaps I am misunderstanding the docs, or this might be a bug. System: VC6.0 CVS Head Problem: When using release on a tss variable, the associated automatic cleanup routine seems not to be updated correctly as it tries to delete the original pointer, instead of the 0-pointer. Example (simple modification of tss.cpp example): boost::thread_specific_ptr<int> value; void increment() { int* p = value.get(); ++*p; } void thread_proc() { value.reset(new int(0)); // initialize the thread's storage for (int i=0; i<10; ++i) { increment(); int* p = value.get(); assert(*p == i+1); } //******** added the following two lines int* p = value.release(); delete p; // deleting the released pointer //******* } int main(int argc, char* argv[]) { boost::thread_group threads; for (int i=0; i<5; ++i) threads.create_thread(&thread_proc); threads.join_all(); } In the debug version the program faults at exit, as the pointers are beeing freed a second time. I suspect the problem lies in the following function, as it does not set the cleanup handler if the value is 0 bool tss::set(void* value) { if (value && m_cleanup) { cleanup_handlers* handlers = get_handlers(); assert(handlers); if (!handlers) return false; cleanup_info info(m_cleanup, value); (*handlers)[m_key] = info; } return !!TlsSetValue(m_key, value); } Regards, Roland Schwarz

2 2

When to use which functors?
by Bruce Johnston 21 Nov '03

21 Nov '03

I'm somewhat new to Boost, but pretty familiar with STL and Loki. I'm a bit puzzled by the wide array of similar-sounding libraries in Boost for dealing with function objects: Lambda, Function, Functional, and Bind/Mem_fn. Why are there so many of these libraries and under what circumstances would I want to choose one over the other? Thanks. - Bruce Johnston Simba Technologies

2 1

RE: [Boost-users] lexical_cast causes level 4 warnings w/ VC7.1
by Sam Partington 21 Nov '03

21 Nov '03

Peter Dimov <mailto:pdimov@mmltd.net> wrote: > Sam Partington wrote: >> >> 4511 and 4512 are useless warnings. They are telling you that the >> copy constructor and assignment operator are inaccessible. Even >> though you're not trying to call them. [...] > >> C4127 is also awkward. As it gives warnings for some common idioms. >> It refers to conditional expressions being constant. > > These warnings can be annoying, but they aren't useless. They do find > bugs. I agree that 4127 can help you find bugs. But I can't think of any situation where 4511 or 4512 will help you find a bug. If you actually try to call an inaccesible copy constructor or assignement operator, then the compiler (correctly) fails to compile it. Thats why I used the word "awkward" rather than "useless" for 4127. I'll happily be proved wrong though. Sam ****************** 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.

2 1