October 2002 - Boost-users - lists.boost.org

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

14 Apr '05

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

5 9

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

bjam and windows command line problem.
by Fernando Cacciola 07 May '03

07 May '03

Hi, I'm having a hard time trying to use bjam to build boost 1.29.0. I have Win98 in Spanish, and I use Borland C++ Builder 5.0 (its bcc32.exe corresponds to is BCC5.5.1) I have boost 1.29.0 installed at: "C:\Libraries\boost\Repository\boost" I've downloaded bjam for Microsoft Windows: >bjam -v Boost.Jam Version 3.1.0. OS=NT. Copyright 1993-2002 Christopher Seiwald and Perforce Software, Inc. Copyright 2001 David Turner. Copyright 2001-2002 David Abrahams. I've temporarily modified the root 'jamfile' so that it builds only the Test library. and I've done: subst d: "c:\archivos de programa\borland\cbuilder5" set BCCROOT=d: (you'll see why in a moment) If I try: c:\>cd C:\Libraries\boost\Repository\boost" C:\Libraries\boost\Repository\boost> bjam -sTOOLS=borland I receive messages of the form: borland-C++-action libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\threading-s ingle\execution_monitor.obj "d:\bin\bcc32" -j5 -q -c -P -w -Ve -Vx -a8 -v -Od -vi- -tWC -WM- -w-8001 -I"libs\test\build" -I"C:\Libraries\boost\Repository\boost" -I"d:\includ e" -o"libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\thre ading-single\execution_moni Error E2266: No file names given tor.obj" "libs\test\build\../src\execution_monitor.cpp" C:\WINDOWS\TEMP\JAMTMP00.BAT [2] Unknown command "TOR.OBJ" "LIBS\TEST\BUILD\.." "d:\bin\bcc32" -j5 -q -c -P -w -Ve -Vx -a8 -v -Od -vi- -tWC -WM- -w-8001 -I"libs\test\build" -I"C:\Libraries\boost\Repository\boost" -I"d:\includ e" -o"libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\thre ading-single\execution_monitor.obj" "libs\test\build\../src\execution_monitor.cpp" ...failed borland-C++-action libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\threading-s ingle\execution_monitor.obj... If I'm interpreting this output correctly, the problem is that the command line feed to bcc32 exceeds 256 characters. What can be done about this? Is there a way for 'borland-tools.jam' to put the bcc32 parameters in a tmp response file and use: bcc32.exe @tmprsp.rsp? Any help will be appreciated. TIA, -- Fernando Cacciola

4 22

VC7 says 'fatal C1067' compiling multi_array?
by Clift Norris 01 Mar '03

01 Mar '03

Greetings: I'm using VC7 and boost_1_29_0 to compile this code that is using multi_array.hpp. typedef boost::multi_array<double, 4> theta4_t; typedef theta4_t::index index; theta4_t Theta_Trun( boost::extents[10000][2][10][256] ); I'm receiving this error: "fatal error C1067: compiler limit: debug information module size exceeded" Of course, the code compiles fine using the "Release" configuration, but I need the "Debug" one also. Is there a workaround for this, other than the 'make your variables shorter' suggested in the VC7 documentation? Thanks, -Clift

2 1

bug report: boost::tokenizer with VC6
by Navi Singh 09 Feb '03

09 Feb '03

The boost release 1.28.0 of the tokenizer library has the following problem: There are 5 examples, namely, simple_example_1.cpp thru simple_example_5.cpp If I change the main() in each of the 5 to to main1() thru main5() and return 0; the vc60 compiler generates an internal compiler error when parsing the file boost\iterator_adapters.hpp on line 869, where it is parsing the following lines: reference operator*() const { return policies().dereference(*this); }

3 2

Q: Graphs. Sorting edges. Possible? How to?
by stas_fomin 07 Nov '02

07 Nov '02

Hello. I a newbie in BGL and I rewrite my LEDA code now... I have to sort (order) edges according to some functor. For example (simplified): typedef adjacency_list<vecS, vecS, bidirectionalS> MyGraph; typedef graph_traits < MyGraph >::edge_descriptor MyGraphEdge; typedef graph_traits < MyGraph >::edge_iterator MyEdgeIter; class MyCompareEdges{ public: bool operator()(MyGraphEdge e1, MyGraphEdge e2) const { return true; } }; .... { MyGraph Gr(10); MyEdgeIter ei_beg, ei_end; MyCompareEdges comp; tie(ei_beg, ei_end) = edges(Gr); std::sort(ei_beg, ei_end, comp); //Error C2676 } And I have error C2676 (below the message...). Questions: 1. Is it possible to sort edges in the graph? 2. How to... Thanks all in advance... Stas Fomin. P.S. vecS, setS, listS for edge container... - C2676. ------------------------------ d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp(264) : error C2676: binary '+=' : 'class std::list<struct boost::list_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost:: no_property> > >::iterator' does not define this operator or a conversion to a type acceptable to the predefined operator d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp (911) : see reference to function template instantiation 'void __thiscall boost::default_iterator_policies::advance(struct boost::iterator_adaptor<class std::list<struct boost::lis t_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost::no_property> > >::iterator,struct boost::detail::undirected_edge_iter_policies,class boost::detail::edge_desc_impl<struct boost::b idirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int> *,struct boost::multi_pass_input_iterator_tag,int> &,i nt)' being compiled Error executing cl.exe.

4 7

Q: Problems building boost.python under cygwin
by "Schnörr, Claudius Dr." 06 Nov '02

06 Nov '02

Hello, I run into problems building boost under cygwin. It seems to be merely a matter of a wrong configuration or wrong scripts. After running 'bjam -sTOOLS=gcc -n > build.com' in boost/libs/python/build in order to get hands on the statements being executed by bjam, there had to be made a lot of textual replacements to get the statements in build.com run: Just to mention some: - replace '-isystem ' by '-I' - remove '-I""' - change shared library-names from *.so to *.dll - insert '-L <path_to_libpython2.2.dll> -lpython2.2' where shared libs are created In boost/libs/python/test, going the same way, there have in addition this changes to be made: - LD_LIBRARY_PATH=... --> PATH=$PATH:..., because cygwin uses PATH to look for .dlls My question: I think there have to be made more configurations than I did to create the boost.python-stuff under cygwin. Where have they to be done, and what? (I already configured environment variables like GCC_ROOT_DIRECTORY, GXX, PYTHON_ROOT, ...etc...) Any suggestions are welcome! Please send a copy of your answer to schnoerr(a)mailzone.com Thank you in advance, Claudius --------------------------------------------------------- This Mail has been checked for Viruses Attention: Encrypted mails can NOT be checked! ** Diese Mail wurde auf Viren geprueft Hinweis: Verschluesselte mails koennen NICHT auf Viren geprueft werden! ---------------------------------------------------------

2 1

Wrapping a std::list with boost.python
by jefflholle 03 Nov '02

03 Nov '02

I've just started experimenting with version 2 of boost.python. In iterator.cpp, a std::list is wrapped using following code: typedef std::list<int> list_int; void push_back(list_int& x, int y) { x.push_back(y); } int back(list_int& x) { return x.back(); } . . . class_<list_int>("list_int") .def("push_back", push_back) .def("back", back) .def("__iter__", iterator<list_int>()) ; Is it possible to use the container methods instead of user defined functions? I've tried the code: class_<list_int>("list_int") .def("push_back", &list_int::push_back) .def("back", &list_int::back) .def("__iter__", iterator<list_int>()) ; This doesn't work. Am what I'm tried to do possible? If so, how?

2 1

[BGL] How to prune a BFS or exit a BFS
by kweeheong 01 Nov '02

01 Nov '02

I have a custom BFS visitor used to traverse a graph. Is there a built-in way to - prune off a vertex's descendants from the search - exit a BFS These ( pruning and terminating ) are separate situations. I believe the following will work; however, I do not know how to access the relevant data structures. - To prune off a vertex's descendents from the search In the custom BFS visitor's discover_vertex event, set the color of all its adjacent descendants to "black". - To exit a BFS In the custom BFS visitor's discover_vertex event, once the required vertex is found, empty the queue of vertices. How can I access a vertex's color and a BFS's queue? Or is there a better way?

2 2

How to pass result of boost::bind to arg of template function ?
by hugo duncan 31 Oct '02

31 Oct '02

Hi, I want to pass the result of a boost::bind as an argument of a templated function of a class, and am struggling to find a signature that will let me do this. Is this possible? if so what signature should the function have ? Any help much apreciated Hugo #include "boost/function/function1.hpp" #include "boost/bind.hpp" class another_class {}; class my_class { public: typedef another_class ObjectType; //! this works fine passing a boost::function object template <class ReturnType> void add(const boost::function1<ReturnType,ObjectType>& arg) { boost::function1<ReturnType,ObjectType> fn_obj=arg; } //! this should work when passed the result of a boost::bind template <class ReturnType> void add(?what goes here? & arg) { function1<ReturnType,ObjectType> fn_obj(arg); } }; int fn(another_class,int) { return 1; } int main(int, char**) { my_class c; c.add(boost::bind(&fn,_1,1)); }

2 1

[bgl] breadth_first_search for shortest paths (fwd)
by Joel Young 31 Oct '02

31 Oct '02

Dear Jeremy, et al, I am trying to implement a shortest paths algorithm on a directed graph. As I have unit edge weights, I would rather use breadth_first_search rather than dijkstra. // Is this a good candidate for addition? template <class Map, class Tag> struct vertex_marker : public boost::base_visitor<vertex_marker<Map,Tag> > { typedef Tag event_filter; vertex_marker(Map p_map,int p_val) : m_map(p_map),m_val(p_val) { } template <class Vertex, class Graph> void operator()(Vertex v,const Graph&) { boost::put(m_map,v,m_val); } Map m_map; int m_val; }; template <class Map, class Tag> vertex_marker<Map,Tag> mark_vertices(Map p_map, Tag, int p_v) { return vertex_marker<Map,Tag>(p_map,p_v); } boost::breadth_first_search( mygraph, rootnode, boost::visitor(boost::make_bfs_visitor( std::make_pair( boost::record_distances( boost::get(boost::vertex_distance,mygraph), boost::on_tree_edge()) , std::make_pair( mark_vertices( boost::get(boost::vertex_distance,mygraph), boost::on_initialize_vertex(), std::numeric_limits<int>::max()) , mark_vertices( boost::get(boost::vertex_distance,mygraph), boost::on_start_vertex(), 0) ) ) )) ); The problem is that on_start_vertex does not seem to be implemented for breadth_first_search, but it is for depth_first. For dijkstra, the start node seems to be automaticly zeroed. I guess I could mod Am I missing something really obvious here or is there an inconsistency across the algorithms? Shouldn't on_start_vertex be used for all of the graph algorithms? Also, I can't seem to find documentation on neighbor_bfs.hpp Thanks, Joel

2 1

Debug regex++ in VC6
by r_gharavi 31 Oct '02

31 Oct '02

When I build a stand-alone debug xll with regex++ (static linking), Excel refuses to accept it as an addin. It works fine in release mode. Due to reasons beyond my control :-), I am using VC6 STL. Any pointers would be appreciated. Thanks.

1 0

d_heap bug
by Tsvetomir Valtchev 31 Oct '02

31 Oct '02

[I tried to contact the library's author, dietmar.kuehl@claas- solutions.de, but the message bounced back.] Dear Dietmar, I was looking for a better heap class than the one in STL and I was delighted to come across your d_heap class included in the Boost library. Unfortunately, I had a number of problems with it, and I figured you might be interested in some feedback. First, the class didn't compile with VC.NET (and probably won't with VC 6 either). This might be due to non-conformance on the part of Microsoft's compiler and some known limitations with template support, but for some of the issues I think they were due to the non- conformance of the code itself. Second, to my dismay, the code turned out to be seriously flawed. The following simple fragment, for example, causes a crash: THeap::pointer ptrs[10]; ptrs[0] = heap.push(12); ptrs[1] = heap.push(16); heap.remove(ptrs[0]); heap.remove(ptrs[1]); After some debugging and deciphering of the code, I found that the remove() function didn't handle a special case where the node to be 'sifted up' coincided with the last "hole" left in the tree. I think pop() had a similar problem. (In my fixed version, I have expressed pop() in terms of remove(), which resolves the problem and also avoids some code duplication.) I hope some day you get around to publishing an improved version. Another suggestion I have is some way to make sure that the pointer's passed back by client code are valid. Extensive use of assertions throughout the code might also prevent various programming errors. Regards, // Chango V.

1 0

Regex++ and UTF-8
by Gitit 31 Oct '02

31 Oct '02

Hi, We want to use regex++ (version 3.31) with UTF-8 strings. I tried to match a UTF-8 character of 2 bytes to the regex "." and the match failed. It seems regex++ handles these 2 bytes as two separate characters. 1) Is there a "native" way in the regex++ library for using UTF-8 strings? Can we use UTF-8 strings to compare against a compiled regex (the regex is in ASCII only)? Can the regex itself hold UTF-8 characters? 2) Is converting to wchar_t our only option? As far as I understand, wchar_t does not cover the entire range of characters covered by UTF-8, so it may not be enough. Any other ideas? thanks, Gitit.

1 0

Re: [Boost-Users] Re: regex: flag for "global" search?
by dick.bridges＠tais.com 30 Oct '02

30 Oct '02

The boost::regex_search example bumps the start to march through the sub-expressions and the boost::regex_grep examples demonstrate using the 'callback' for each term. I was kinda hoping the library provided a "convenience version" that would take something like "(\\w+)(?:\\.(\\w+))*" and populate the match_results as if the terms had been expanded <e.g.> "(\\w+)(?:\\.(\\w+))?(?:\\. (\\w+))?(?:\\.(\\w+))?"</e.g.> Perhaps to some arbitrary limit? Oh well, given the riches provided, a little while loop now and then is surely a small price to pay. ;) Thanks for the response. I'm continually amazed at the ethos fostered by Boost group members. "Edward Diener" <eddielee@tropic To: boost-users(a)yahoogroups.com soft.com> cc: Sent by: news Subject: [Boost-Users] Re: regex: flag for "global" search? <news(a)main.gmane .org> 10/29/2002 04:54 PM Please respond to Boost-Users Use boost::regex_grep. The boost::regex_search only finds the first match. <dick.bridges(a)tais.com> wrote in message news:OF6181960C.1A0F5C63-ON88256C61.006996C6@tais.net... > I'm trying to capture the sub-expressions in a fqdn (e.g., > one.two.three.com.) One piece of Perl-speak for the expression is: "/ > (\w+)\./g". I've been using boost_search and trying variations on "(?: > (\\w+)\\.)+" but I can't seem to get all the sub-expressions into the > match_results. > > There's got to be a flag I've been overlooking. Any suggestion will be > appreciated. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

regex: flag for "global" search?
by dick.bridges＠tais.com 30 Oct '02

30 Oct '02

I'm trying to capture the sub-expressions in a fqdn (e.g., one.two.three.com.) One piece of Perl-speak for the expression is: "/ (\w+)\./g". I've been using boost_search and trying variations on "(?: (\\w+)\\.)+" but I can't seem to get all the sub-expressions into the match_results. There's got to be a flag I've been overlooking. Any suggestion will be appreciated. TIA

3 2

Gcc-3.2, statistic_tests.cpp and <limits>
by pcarlini.rm 29 Oct '02

29 Oct '02

Hi, the PR libstdc++/6718 in the Gcc bug database is about a run time problem with this Boost testcase: paolo:~/Programming/c++/boost_1_29_0/libs/random> a.out Confidence level: 0.99; 1-alpha = 0.01; chi_square(19, 36.191) = 0.99 Running tests on minstd_rand KS: 4750* [0] 9500* [0] equidistribution: a.out: statistic_tests.hpp:571: void generic_counter<RandomA ccessContainer>::operator()(int) [with RandomAccessContainer = std::vector<int, std::allocator<int> >] : Assertion `static_cast<unsigned int>(i) < container.size()' failed. Abort According to Nathan Sidwell and Gaby Dos Reis analysis the problem is due to well known issues with numeric_limits<double>::infinity of 3.2's run time library for which unexpectedly Boost provides no work arounds. On the contrary, 2.95.x worked just fine. Please let me know if you need any additional information, ciao, Paolo.

1 1

AW: [Boost-Users] boost::bind problem
by Jasper, Alexander 29 Oct '02

29 Oct '02

-----Ursprüngliche Nachricht----- Von: Mark Snelling [mailto:mark@bakedbeans.com] Gesendet: Dienstag, 29. Oktober 2002 17:44 An: Boost-Users(a)yahoogroups.com Betreff: [Boost-Users] boost::bind problem [...] typedef priority_queue<shared_ptr<Functor>, vector<shared_ptr<Functor> >, bind(less<int(), bind(&Functor::priority, _1), bind(&Functor::priority, _2))> MyQueue; As far as I know you can't call a function in a typedef. bind(..) is a function call returning a predicate. But does s.o. know how to use bind in this manner. I failed to, since the type of what bind returns is far to complex. And it is required if you want to to use bind in conjunction with maps or the priority_queue's. You have to wrap the call in your own predicate. alex

1 0

boost::bind problem
by Mark Snelling 29 Oct '02

29 Oct '02

Hello, I was wondering if anyone out there in Boost land could give me a hand here? Here's the problem: I have a class A: class A { public: A(int i) : _priority(i) {} int priority() {return _priority;} private: int _priority; }; What I want to do is create a std::priority_queue based on boost::shared_ptr<A> and use boost::bind/compose to create the sorting function required by std::priority_queue. However, when I try and typedef the queue (to save a lot of typing) I get compiler errors on VS.NET. using namespace std; using namespace boost; typedef priority_queue<shared_ptr<Functor>, vector<shared_ptr<Functor> >, bind(less<int(), bind(&Functor::priority, _1), bind(&Functor::priority, _2))> MyQueue; Am I going about this the right way? Any help appreciated. TIA Mark.

1 0

Graph library: parallel edges
by Juerg Tschirren 29 Oct '02

29 Oct '02

With the Boost Graph Library, I try do create an undirected graph that does not allow parallel edges, so far without success. Does anybody have a small example that shows how to do this? Juerg

2 1

Graph library: vertex type
by Juerg Tschirren 29 Oct '02

29 Oct '02

In the Boost Graph Library, is it possible to have a custom-defined type for vertices, e.g., I would like to have boost::graph_traits<Graph>::vertex_descriptor map to std::pair<int,int> Can this be done? If yes, how? Juerg

2 1

Re: [Boost-Users] MSVCNT not used anymore?
by dick.bridges＠tais.com 28 Oct '02

28 Oct '02

Thanks! That worked. The MSVCNT example on http://www.boost.org/tools/build/build_system.htm must be left over from a previous version. Appreciate the quick response. sashan <sashang(a)ihug.co To: Boost-Users(a)yahoogroups.com .nz> cc: Subject: Re: [Boost-Users] MSVCNT not used anymore? 10/29/2002 04:20 AM Please respond to Boost-Users dick.bridges(a)tais.com wrote: >I'm having a senior moment. > >MSVCNT is set to C:\Program Files\Microsoft Visual Studio\VC98 and bjam is >invoked with "-sTOOLS=msvc" but the command line that gets invoked is C: >\Program Files\Microsoft Visual C++\VC98\bin\cl and, of course I get: "The >system cannot find the file specified." > >Where's the instructions for compiling with VC6, SP4? > > This is my command line (saved in a batch file): bjam -sTOOLS=msvc -sBUILD=release -sMSVC_ROOT=D:\msvs\VC98 -sVISUALC=D:\msvs\VC98 I don't think MSVCNT is used see http://www.boost.org/tools/build/msvc-tools.html -- P: Egad! You astound me, Brain! B: That's a simple task, Pinky. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

MSVCNT not used anymore?
by dick.bridges＠tais.com 28 Oct '02

28 Oct '02

I'm having a senior moment. MSVCNT is set to C:\Program Files\Microsoft Visual Studio\VC98 and bjam is invoked with "-sTOOLS=msvc" but the command line that gets invoked is C: \Program Files\Microsoft Visual C++\VC98\bin\cl and, of course I get: "The system cannot find the file specified." Where's the instructions for compiling with VC6, SP4?

2 1

are examples on maual page ready to run?
by J-S Lin 28 Oct '02

28 Oct '02

The error message is as follows, --------------------------------- g:\C++ notes\test_boost\test_matrix.cpp(14) : error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::numeric::ublas::matrix' (or there is no acceptable conversion) with [ T=double, F=boost::numeric::ublas::row_major, A=boost::numeric::ublas::unbounded_array ] ------------------------------ Much appreciated. J-S Lin

2 2

lexical_cast fails to convert std::string to boost::dynamic_bitset<>
by Klaus Nowikow 28 Oct '02

28 Oct '02

Hi! I am trying to convert a string to a boost::dynamic_bitset using boost::lexical_cast, as in this example: template <class Value> bool GetValue(const std::string& str, Value& val) { try { val = boost::lexical_cast<Value>(str); } catch(boost::bad_lexical_cast&) { return false; } return true; } int main() { std::string str = "01"; boost::dynamic_bitset<> bits; if(!GetValue(str, bits)) { [...] } } The lexical_cast always throws an exception. The problem seems to be in lexical_cast.hpp, where a temporary object is created: Target result; if(!(interpreter << arg) || !(interpreter >> result) || !(interpreter >> std::ws).eof()) throw bad_lexical_cast(); and in dynamic_bitset.hpp, where operator>>(std::basic_istream<CharT, Traits>&, dynamic_bitset<Block, Allocator>&) iterates over the bitset using the size() (which is, of course, 0). I sure could solve my particular problem by providing an explicit template instantiation of the GetValue() function, but I don't want to do this because the code is for a library, and I want to reduce references to other libraries to an absolute minimum. Did I miss something here, or is there a workaround for this problem? Regards, Klaus

1 0

Date_Time undefined reference
by David Clark 27 Oct '02

27 Oct '02

Hi, I am having a problem compiling the following example #include "boost/date_time/gregorian/gregorian.hpp" #include "boost/date_time/date_parsing.hpp" #include <iostream> #include <string> int main() { using namespace boost::gregorian; std::string s("2002-10-15"); date d(from_string(s)); std::cout << to_simple_string(d) << std::endl; return 0; }; The linker is complaining about an undefined reference to boost::gregorian::greg_month::as_short_string() const and boost::gregorian::greg_month::as_long_string() const using g++ 3.0.4 g++ test.cpp -o test -DDATE_TIME_INLINE Seems the problem is in the call to to_simple_string(d) Is there something obvious I'm missing here. Thanks David.

6 9

Unexpected result in parsing a regular expression
by abhinkar 27 Oct '02

27 Oct '02

Hi, I recently downloaded the boost regex library and am trying to use the search and replace (regex_merge) API. But I am not getting the expected result. Here is what I am trying to do. I am trying to replace a single quoted string with something. But, the catch here is that the string in single quotes can have zero or many 2 consecutive single quotes. For example: Input (Ignore the angle brackets>: <foo='string with '' consecutive '' single ''quotes' bar='string with no single quotes'> To be replaced by 'XXX'. So the output that I want: <foo=XXX bar=XXX> Here is the regular expression that I wrote in Perl: /(\'[^']*(\'\')*[^']*\')/ I get the expected result in Perl. So, to test this with regex library I wrote a sample program to use the regex_merge API and try the replace functionality. ---------------------------replace.cc-------------------------------- #include <boost/regex.hpp> #include <string> #include <iostream> #include <sstream> #include <iterator> using namespace std; using namespace boost; const std::string formatstr("XXX"); std::string processexp(string resp) { regex expression("(\'[^']*(\'\')*[^']*\')"); std::string result; std::ostringstream t; std::ostream_iterator<char, char> oi(t); cout << "Response:" << resp << endl; result = boost::regex_merge(resp, expression, formatstr, boost::format_all); return result; } int main(int argc) { std::string res; res = processexp("foo='string with '' consecutive '' single ''quotes' bar='string with no single quotes'"); cout << "results=" << res << endl; return 0; } --------------------------------------------------------------------- The output I get is: foo=REPLACEDREPLACED bar=REPLACED I tried several ways, but couldn't get the regular expression to work to return the expected result. I WOULD really appreciate if someone could help me. Thanks in advance, Sameer

2 1

vecS versus listS
by aaronyinyong 26 Oct '02

26 Oct '02

compare the following codes: 1.First I create Graph using vecS parameter: typedef boost::adjacency_list<vecS,vecS,directedS,VertexProperty,EdgeProperty> Graph; ..... E edge_array[num_edges]={E(0,1),E(0,2),E(0,3),E(2,3)}; boost::add_edge(edge_array[i].first,edge_array[i].second,g); ..... This is OK! 2.Then I changed the parameter "vecS" to "listS". typedef boost::adjacency_list<listS,listS,directedS,VertexProperty,EdgePropert y> Graph; ..... E edge_array[num_edges]={E(0,1),E(0,2),E(0,3),E(2,3)}; boost::add_edge(edge_array[i].first,edge_array[i].second,g); It can't be compiled.The VC7 tells me "int can't be converted to void*". So what's wrong? Is there any difference which could be caused by "vecS" and "listS"?

2 1

[BGL] Making GraphvizDigraph bidirectional
by kweeheong 26 Oct '02

26 Oct '02

Hi, For convenience, I am using Graphviz digraphs, reading them into BGL, running my algorithms and writing them out to view the results (with Graphviz dotty ). My compiling environment is VC6. After some compilation failures, I realized that Graphviz digraphs did not support in_edges and other functionality of the bidirectional graphs. Graphviz digraphs is currently defined in graphviz.hpp as : typedef subgraph<adjacency_list<boost::vecS, boost::vecS, boost::directedS, GraphvizVertexProperty, GraphvizEdgeProperty, GraphvizGraphProperty> > GraphvizDigraph; There are 2 potential solutions I see ( there may be others ): Solution 1 : ------------ - Read in Graphviz digraph and then copy it into a working bidirectional graph to run the algorithms. - Copy back to Graphviz digraph to view the results. Solution 2 : ------------ - Change the definition of GraphvizDigraph to : typedef subgraph<adjacency_list<boost::vecS, boost::vecS, boost::bidirectonalS, GraphvizVertexProperty, GraphvizEdgeProperty, GraphvizGraphProperty> > GraphvizDigraph; - Recompile bglviz.lib - Now GraphvizDigraph is bidirectional I prefer Solution 2 because it leverages the generic way that BGL has been written. I am able to rebuild bglviz.lib and my minimal testing shows the bidrectional GraphvizDigraph seems to work so far. I would like feedback whether there are any gotchas with Solution 2. Thanks,

2 1

RE: [Boost-Users] are examples on maual page ready to run?
by Mark Storer 25 Oct '02

25 Oct '02

Which error? What's the compiler saying? We (okay: I) need more info for a proper diagnosis. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

are examples on maual page ready to run?
by J-S Lin 25 Oct '02

25 Oct '02

I just download boost and tried to get a hang of it by running examples out of the doc page. But I am not sure if these examples are ready to run or simply like a pseudo-code? A point in the case: This simple matrix example int main () { using namespace boost::numeric::ublas; matrix<double> m (3, 3); for (int i = 0; i < m.size1 (); ++ i) for (int j = 0; j < m.size2 (); ++ j) m (i, j) = 3 * i + j; std::cout << m << std::endl; } I copied it and added the following includes: #include <boost/numeric/ublas/matrix.hpp> #include <iostream> But the compiler (VC7) flag an error on cout. So is this line " std::cout << m << std::endl;" supposed to work, or it is a pseudo-code. Thanks. J-S Lin

1 0

How do I use boost::multi_array with a templated argument?
by Björn Lindberg 25 Oct '02

25 Oct '02

I cannot get the code below to compile with g++-3.2 on GNU/Linux. The error message is: exempel.cpp: In member function `void functor<T>::operator()() [with T = P]': exempel.cpp:26: instantiated from here exempel.cpp:18: `nodetab' has incomplete type exempel.cpp:18: confused by earlier errors, bailing out Since everything is visible at compile time, I can't understand why I'm getting this error message, or what to do about it. ------------- #include <boost/multi_array.hpp> struct P {}; template<typename T> struct functor { typedef boost::multi_array<T, 3> table_t; typedef typename table_t::array_view<2>::type nodetab_t; typedef typename table_t::index_range range; void operator()() { table_t table(boost::extents[5][6][7]); nodetab_t nodetab = table[boost::indices[1][range()][range()]]; } }; int main() { functor<P> vis; vis(); return 0; } ------------- Björn

1 0

Borland 6 Graph example 1
by chongwhite001 25 Oct '02

25 Oct '02

Hi All, I am attempting to run the 1st example (file dependancy) of Boost Graph library with Borland C++Builder 6. It compiles ok but crashes when run in exception.hpp with a call, or rather THROW to negative_edge exception. If anyone can provide any light into this I would be most grateful. (details below) Thanks Christian _________________________________________________________ Fault occurs in: dijkstra_shortest_paths.hpp: void examine_edge(Edge e, Graph& g) { if (m_compare(get(m_weight, e), m_zero)) throw negative_edge(); m_vis.examine_edge(e, g); } The actual fault is in exception.hpp at the point: struct negative_edge : public bad_graph { negative_edge() : bad_graph("The graph may not contain an edge with negative weight."){ } }; The error is: --------------------------- Debugger Exception Notification --------------------------- Project Boost_Ex1_Console.exe raised exception class boost::negative_edge with message 'Exception Object Address: 0x896912'. Process stopped. Use Step or Run to continue. --------------------------- OK Help ---------------------------

2 3

Fwd: uBLAS vs MTL for sparse matrices
by Paul C. Leopardi 25 Oct '02

25 Oct '02

Hi, I posted the following message to boost and have so far had no response. Maybe boost-users is the correct mailing list? Hi, Thanks to Joerg Walter's original conversion of GluCat ( http://glucat.sf.net ) to uBLAS, I have fairly painlessly been able to get GluCat going with the version of uBLAS now promoted to Boost. I'm using sparse matrices: boost::numeric::ublas::sparse_matrix< Scalar_T, boost::numeric::ublas::row_major> and comparing performance to MTL: mtl::matrix< Scalar_T, mtl::rectangle<>, mtl::compressed<>, mtl::row_major >::type The operation I'm performing is quite complicated. Basically, I am generating a large number of sparse matrices, and computing the inner product of a given matrix with each of these matrices in turn. ( If you have a copy of GluCat, see basis_element() in matrix_multi_imp.h ) Because these sparse matrices have only one non-zero per row, operations on an n x n matrix are typically O(n), and seem to be so using MTL: Size vs speed for MTL: Size Time (ms) 32 10 64 20 128 80 256 160 512 700 But with uBLAS, essentially the same operations seem to be O(n^2): Size Time (ms) Slowdown 32 30 3 64 70 3.5 128 830 10.4 256 1940 12.1 512 31770 45.4 o Is there a more appropriate data type in uBLAS? o Do you have any tips on where to tweak uBLAS to get better (ie. O(n) ) performance? o What is BOOST_UBLAS_USE_CANONICAL_ITERATOR and what effect should it have on performance? Thanks

2 1

assign a scalar to boost::numeric::ublas::matrix?
by Michael Na Li 24 Oct '02

24 Oct '02

Hi, having tried various matrix classes, I was excited to see boost finally includes a "standard" matrix class. Thanks for the good work. I have one question, though. How do I initialize a matrix to a scalar value? There is no constructor of the form 'matrix (nr, nc, value)' nor 'matrix::operator=( T value )'. I think both would be nice to have. Michael -- ---------------------------------------------------------------------------- Michael Na Li Email: lina(a)u.washington.edu Department of Biostatistics, Box 357232 University of Washington, Seattle, WA 98195 ---------------------------------------------------------------------------

1 0

[BUG] Macos.hpp configuration woes
by Bobby Thomale 24 Oct '02

24 Oct '02

Yesterday I was trying to help my wife get the Boost libraries to compile in her application. It reminded me of an issue I thought I brought up a while ago (maybe I forgot) that still exists in the boost Macos.hpp config file. In the MacOS.hpp file, it checks to see if you are compiling a Mach-O target. If you are, it reasons, you must be using the Apple BSD headers as well. This logic is even documented in a comment: // If __MACH__, we're using the BSD standard C library, not the MSL: #if __MACH__ The problem with this is that, starting with CW Pro 8, it is actually possible to build a Mach-O target and use the MSL in place of the BSD libraries. Lots of people are apparently doing this, including my wife. (I am still on CFM and have not made the transition to Mach-o yet, but I will eventually and I will potentially be in the same boat. The newer Carbon APIs are Mach-o only so that is where all the carbon programmers will eventually go, and as long as Codewarrior is around, MSL will be there as an option for people.) There are also people who use other STL implementations, such as STLPORT. When it defines all of the stuff it does in there, for the BSD libraries, the mach-o MSL code does not compile. Instead, I get hundreds of compile errors. The only way I could get this to compile for her was to force it to use the TARGET_CARBON stuff at the bottom, after the #else (meaning "not mach-o"), by commenting the __MACH__ stuff out. Obviously, that was a "see if this is really her problem" solution, also to get her up and running, and not a long-term fix. :-) It worked by the way. The config.hpp stuff seperates out your platform settings from your standard library settings. Is there a reason that standard library implementation-specific settings are being set by platform and binary format? If there is magic that needs to happen that is specific to Apple's BSD headers, shouldn't there maybe be a "BSD.hpp" or even "AppleBSD.hpp" for BOOST_STDLIB_CONFIG instead? Or am I missing something? Anyway. That is just a question/suggestion, take it or leave it. It makes sense that the TARGET_CARBON stuff at the bottom is platform specific, but the stuff above it seems like it should go somewhere else. In any case, whether that stuff is moved or not, something needs to change to alleviate the pain for those using Mach-o and MSL together, because right now boost is broken for those users. (Am I reporting this to the right list by the way?) -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ ---------------------------------------------------------------------

3 6

VC++ 6.0 ,SGI STL and Boost
by Joshua 23 Oct '02

23 Oct '02

I'm just trying to include the files for the shared_ptr class and keep having problems. I was able to fix a problem with a duplicate definition of 'max' and 'min' (in suffix.hpp, it was conflicting with a file from the SGI STL implementation) I mainly just commented it out, if someone has a better plan on how to fix it I would love to know how to fix it. I have tried Boost 1.28 and 1.29 and still got the same set of errors. In addition to the 'max' and 'min' conflict I am getting these errors : e:\programming projects\c++ projects\boost_1_28_0\boost\checked_delete.hpp(24) : error C2061: syntax error : identifier 'T' e:\programming projects\c++ projects\boost_1_28_0\boost\checked_delete.hpp(24) : error C2061: syntax error : identifier 'T' e:\programming projects\c++ projects\boost_1_28_0\boost\checked_delete.hpp(30) : error C2061: syntax error : identifier 'T' e:\programming projects\c++ projects\boost_1_28_0\boost\checked_delete.hpp(30) : error C2061: syntax error : identifier 'T' e:\programming projects\c++ projects\boost_1_28_0\boost\detail\shared_count.hpp(184) : error C2504: 'counted_base' : base class undefined e:\programming projects\c++ projects\boost_1_28_0\boost\detail\shared_count.hpp(206) : see reference to class template instantiation 'detail::counted_base_impl<P,D>' being compiled e:\programming projects\c++ projects\boost_1_28_0\boost\detail\shared_count.hpp(253) : error C2061: syntax error : identifier 'Y' e:\programming projects\c++ projects\boost_1_28_0\boost\detail\shared_count.hpp(254) : error C2065: 'Y' : undeclared identifier e:\programming projects\c++ projects\boost_1_28_0\boost\detail\shared_count.hpp(390) : fatal error C1506: unrecoverable block scoping error So I'm not sure if I'm doing something wrong (like not setting up the include order correctly) or if Microsoft is once again making my life hell. I am being bad and using the __int64 data type but I may need to rethink it and convert it to standard C++ (well sorta standard, I think gcc supports a longlong to get a 64bit int.. if not I may change it around to a bit_vector or something). But if anyone can shed some light on why I'm getting these errors listed above I'd really appreciate it. thanks. Joshua.

2 3

VC++ 6.0 with SGI STL and Boost
by Joshua 23 Oct '02

23 Oct '02

I'm using VC++ 6.0 with the SGI implementation of the STL. I'm trying to use the shared_ptr but when I try to include the <boost/shared_ptr.hpp> file I get about 40 errors. Most are related to errors redefining template functions. Its conflicting with the SGI STL header files but I'm not sure how to fix it. I keep thinking that I need to adjust the include order (Currently the Boost files are first, the the STL, then Microsofts includes. It doesn't matter where the Boost include directory is though I still get the same errors : this is a small sample --------------------Configuration: DryDock - Win32 Debug-------------------- Compiling... AbstractComponent.cpp e:\programming projects\c++ projects\boost_1_29_0\boost\config\suffix.hpp(256) : error C2995: 'min' : template function has already been defined e:\programming projects\c++ projects\drydock\drydock\stl\stl_algobase.h(106) : see declaration of 'min' e:\programming projects\c++ projects\boost_1_29_0\boost\config\suffix.hpp(260) : error C2995: 'max' : template function has already been defined e:\programming projects\c++ projects\drydock\drydock\stl\stl_algobase.h(112) : see declaration of 'max' e:\programming projects\c++ projects\boost_1_29_0\boost\checked_delete.hpp(24) : error C2061: syntax error : identifier 'T' e:\programming projects\c++ projects\boost_1_29_0\boost\checked_delete.hpp(24) : error C2061: syntax error : identifier 'T' e:\programming projects\c++ projects\boost_1_29_0\boost\checked_delete.hpp(30) : error C2061: syntax error : identifier 'T' e:\programming projects\c++ projects\boost_1_29_0\boost\checked_delete.hpp(30) : error C2061: syntax error : identifier 'T' e:\programming projects\c++ projects\boost_1_29_0\boost\detail\shared_count.hpp(213) : error C2504: 'counted_base' : base class undefined e:\programming projects\c++ projects\boost_1_29_0\boost\detail\shared_count.hpp(235) : see reference to class template instantiation 'detail::counted_base_impl<P,D>' being compiled And it goes on like that to a grand total of 40 errors. I know its probably just something like the order of the includes or I need to add something to specify the namespace correctly. Has any tried using this combination of libraries (VC++, SGI STL, Boost) and gotten it to work? Thanks.

2 1

Newbie trying to use multi_array ...
by Jon Pendergrass 23 Oct '02

23 Oct '02

I'm new to Boost, so please excuse my lack of knowledge. I'm trying to use the multi_array class and have hit a small snag. I'd like to have a class with a 4-D array. Initially it won't contain any data. However, Microsoft Visual C++ v6.0 complains about not finding a constructor. I want to do something like this: #include "boost/multi_array.hpp" typedef boost::multi_array<std::complex<double>, 4> t_Array4D; class foobar { t_Array4D ar; }; void foobar::SetValue() { // set extents code // set value this->ar[0][0][0][0] = 2.0; }

2 1

Error in date_time example -- exp-time_periods.html
by David Clark 22 Oct '02

22 Oct '02

date_time/doc/exp-time_periods.html class day_period : public { should be class day_period : public time_period {

1 0

Smart Pointers and Autocomplete
by eldritchshadows 21 Oct '02

21 Oct '02

Has anybody ever found a program which worked under Visual C++ that would list the member functions of the pointers wrapped by smart pointers. An example of what I'm talking about would be Visual Assist (except it doesn't seem to work). It would make life easier. Thanks in advance. Nathan Janken

1 0

Error in date_time example -- exp-print_month.html
by David Clark 21 Oct '02

21 Oct '02

There are two errors in the date_time/doc/exp-print_month.html example. std::cout<<"Enter Year: "; int should be std::cout << "Enter Year: "; int year,month; and //Use the calendar to get the last day of the month int eom_day = gregorian_calendar::end_of_month_day( should be int eom_day = gregorian_calendar::end_of_month_day(year,month);

3 2

[BGL] Why does depth_first_search not accept a source vertex parameter?
by kweeheong 20 Oct '02

20 Oct '02

Hi, I'm just learning about the BGL, and I've been sucessful in compiling and learning with examples on my VC6 Windows machine. I have a newbie question that someone with more knowledge of BGL might be able to answer : Q : Why does depth_first_search not accept a source vertex parameter, while breadth_first_search do? Is this just to be consistent with the historical definition of DFS? However, depth_first_visit and breadth_first_visit both accept a source vertex parameter. It would seem that DFS is more useful ( output is more deterministic ) if the source vertex can be specified, just like BFS. Reference : ( from the online BGL documentation ) template <class VertexListGraph, class P, class T, class R> void breadth_first_search(VertexListGraph& G, typename graph_traits<VertexListGraph>::vertex_descriptor s, const bgl_named_params<P, T, R>& params); template <class IncidenceGraph, class P, class T, class R> void breadth_first_visit(IncidenceGraph& G, typename graph_traits<IncidenceGraph>::vertex_descriptor s, const bgl_named_params<P, T, R>& params); template <class VertexListGraph, class class P, class T, class R> void depth_first_search(VertexListGraph& G, const bgl_named_params<P, T, R>& params); template <class IncidenceGraph, class DFSVisitor, class ColorMap> void depth_first_visit(IncidenceGraph& g, typename graph_traits<IncidenceGraph>::vertex_descriptor s, DFSVisitor& vis, ColorMap color);

1 0

Error in date_time example -- exp-print_holidays.html
by David Clark 20 Oct '02

20 Oct '02

Two errors in date_time/doc/exp-print_holidays.html In function print_date std::cout << d << " [" << d. should be std::cout << d << " [" << d.day_of_week().as_short_string() << "]\n"; and year is not defined in main() std::cout << "Enter Year: "; int should be std::cout << "Enter Year: "; int year;

2 2

A New Boost Mailing List
by Jon Kalb 18 Oct '02

18 Oct '02

As you know there are currently three Boost mailing lists: Boost - the discussion list for Boost library developers Boost-Users - the discussion list for Boost library users Boost-Announce - for library review and release announcements But we feel the need for an additional list. This list, Boost-Interest, will be an announcement list for items of interest to members of the Boost community. We see this as a low volume, moderated list on which commercial announcements are acceptable if relevant. We have written a proposed charter (below), but we invite comments and volunteers to moderate this list. Boost-Interest: Proposed Charter Boost-Interest is a moderated mailing list of announcements of interest to the Boost community. On topic messages will include announcements of books, magazine articles, papers, talks, seminars, products, tools, events, or conferences on advanced uses of C++, generic/generative/meta-programming, and, of course, the Boost libraries. Off topic will be discussions of any kind and job postings. If you are have comments on this list or its charter please send them to either or both Doug and Jon (addresses below). Also contact us if you are interested in moderating this list. Please do not ask for subscription information yet. We will announce details when we know them. -- Doug Gregor <gregod(a)cs.rpi.edu> Jon Kalb <Kalb(a)LibertySoft.com>

2 1

^M
by Felix E. Klee 18 Oct '02

18 Oct '02

Hi, I found that at least part of the Boost code contains DOS style carriage returns. Why is that? This causes parsing errors on UNIX. Felix

1 1

RE: [Boost-Users] Re: Error in Date_Time example - exp-days_alive.html
by Jeff Garland 17 Oct '02

17 Oct '02

David wrote: > I just checked the example code in > libs/date_time/example/gregorian/date_alive.cpp > > the correction should be > > else if (days_alive < date_duration(0)) { Thx -- I'll clean that up. Jeff

1 0

Template class static boost::mutex initialization !?!?!
by Luc Bergeron 17 Oct '02

17 Oct '02

Hello everyone, i'm currently trying to implement a thread safe singleton using template. In the class I need to use a boost::mutex in order to protect access to the singleton pointer. The problem i'm currently encountering is that I need to initialize this static boost::mutex, but how !?!?!?! I tried using a pointer to a mutex and initialize it to null but that didn't work. I also tried to new it in the initialization but that failed too. :( Can someone help me on this one ??? Thanks in advance for any help. Luc. P.S. I'm using boost 1.29 :) P.S.S Here is my current class definition : (A link to where I got this implementation : http://www.drizzle.com/~scottb/publish/gpgems1_singleton.htm) template <typename T> class ThreadSafeSingleton { static T* d_ThreadSafeSingleton; static boost::mutex d_mutex; public: ThreadSafeSingleton() { assert(!d_ThreadSafeSingleton); int offset = (int)(T*)1 - (int)(ThreadSafeSingleton <T>*)(T*)1; d_ThreadSafeSingleton = (T*)((int)this + offset); } ~ThreadSafeSingleton() { assert(d_ThreadSafeSingleton); d_ThreadSafeSingleton = 0; } static T& GetSingleton(void) { boost::mutex::scoped_lock scoped_lock(d_mutex); assert(d_ThreadSafeSingleton); return *d_ThreadSafeSingleton; } static T* GetSingletonPtr(void) { boost::mutex::scoped_lock scoped_lock(d_mutex); return d_ThreadSafeSingleton; } }; template <typename T> T* ThreadSafeSingleton <T>::d_ThreadSafeSingleton = 0;

1 1

RE: [Boost-Users] min & max #undef'd by config.hpp?
by richard_cox＠dell.com 17 Oct '02

17 Oct '02

On 17 October 2002 09:14, Chris Russell [mailto:cdr@encapsule.com] wrote: > > I'm confused. Using MS Visual Studio 6.0 w/the Intel 6.0 > compiler (or the > native VC compiler for that matter) the min and max macros > are defined in > the MS header WINDEF.H. It seems that config.hpp #undef's > these (although I > haven't figured out where or why yet). My environment seems > to be perfectly > happy using std::min/std::max. But what of all these > MS-defined macros that > use the undecorated min/max? I really don't want to go > chasing these down in > the MS + third-party headers if I can avoid it. Will someone > please explain > to me what's going on with config.hpp? There is nothing in windows.h that uses min & max. In fact if you define NOMINMAX *before* you include windows.h they will not be defined. > --- simple example --- > > #include <windows.h> > #include <boost/config.hpp> > #if defined(min) > #pragma message "min is defined" > #else > #pragma message "min not defined" > #endif > #if defined(max) > #pragma message "max is defined" > #else > #pragma message "max not defined" > #endif > int main(int argc, char* argv[]) > { > int a = 10, b = 20; int c = min(a,b); int d = max(a,b); > return 0; > } You either need: using std::min; using std::max; or fully qualify those names... > > Deleting intermediate files and output files for project 'test - Win32 > Debug'. > --------------------Configuration: test - Win32 > Debug-------------------- > Compiling... > StdAfx.cpp > test.cpp > . . . Boost configuring for Intel C++ compiler > min not defined > max not defined > L:\boost\test\test.cpp(24): error: identifier "min" is undefined > int c = min(a,b); ... hence this error, there is no ::min. > L:\boost\test\test.cpp(25): error: identifier "max" is undefined > int d = max(a,b); > ^ Richard Cox Senior Software Developer Dell Technology Online All opinions and statements mine and do not in any way (unless expressly stated) imply anything at all on behalf of my employer

2 1

Trivial doc error in http://boost.org/libs/smart_ptr/shared_ptr.htm
by Smith, Eric V. 17 Oct '02

17 Oct '02

Not sure if this is the right place to send this, but here goes. About half way down the page, "rile" should be "rule".

2 1