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

difference between .output and .run files
by TC MA 22 Nov '04

22 Nov '04

After bjam is executed, both .output and .run files are executed. However, they are the same in content. Why not just use one file, why need both .output and .run files? ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

2 1

dijkstra_shortest_paths performance problem
by Gustavo Sÿffffe1nchez 22 Nov '04

22 Nov '04

Hello, all We are doing a algorithm based on the graph boost library. Actually, it will be a Dinamic Link Library(dll). Our problem is when we execute it in console mode, it costs 12 seconds to finish, while it costs 120 seconds more or less when we are calling it as a DLL from Visual Basic. We have traced into the source code and found that is the dijkstra_shortest_paths function from the boost library which costs us 10 times more in the dll than the console mode. We call the dijkstra_shortest_paths like this: dijkstra_shortest_paths(g,s,predecessor_map(&p[0]).distance_map(&d[0]). visitor(make_dijkstra_visitor(_buscaVia(g,on_finish_vertex(),vinfo,edge_comp,via,p) ))); ///////below is the codes for visitor template <class Graph, class Tag> struct buscaVia : public boost::base_visitor<buscaVia<Graph, Tag> > { typedef Tag event_filter; buscaVia(typename property_map<Graph, vertex_info_t>::type & vinfo_, property_map<UGraph, edge_component_t>::type & ecomp,Vertex & _via,vector<Vertex> &p) :vinfo(vinfo_),encontrada(false),_ecomp(ecomp),via(_via),_p(p){} template <class Vertex, class Graph> void operator() (Vertex v, Graph& g){ bool hay_comp=false; Vertex a=v; if( vinfo[v].is_via && ! encontrada ){ while(_p[a]!=a){// mientras no hayamos llegado al origen if( _ecomp[edge(a,_p[a],g).first]->isComponentCaerTension() ){hay_comp=true; break;} else a=_p[a]; //pasamos al anterior } if(hay_comp==false){ // encontramos la via de la bobina DEBUG_CODE(cout << " via encontrada: " << vinfo[v].vertex_name << endl;) via = v; encontrada=true; } } DEBUG_CODE(else cout << "pasamos por vertice: " << vinfo[v].vertex_name << endl;) } private: typename property_map<Graph, vertex_info_t>::type & vinfo; property_map<UGraph, edge_component_t>::type & _ecomp; bool encontrada; Vertex & via; vector<Vertex> &_p; }; template<class Graph, class Tag> inline buscaVia<Graph,Tag> _buscaVia(Graph &g, Tag,typename property_map<Graph, vertex_info_t>::type & vinfo, property_map<UGraph, edge_component_t>::type & ecomp, Vertex & _via, vector<Vertex> &p){ return buscaVia<Graph,Tag>(vinfo,ecomp,_via,p); } ///////end of codes for visitor We appreciate your kind help! Yang ---------------------------------

2 1

Boost Documentation build
by Robert Ramey 22 Nov '04

22 Nov '04

I've updated my local boost directory from cvs. The links to library documentation generated by boost book documentaition don't work. I would to download the latest (missing) pages on to my local directory. How do I do this - where do I find the missing pages. Robert Ramey

1 0

newbie: Graph library - bundled properties
by TC MA 22 Nov '04

22 Nov '04

I try to use the Boost Graph library bundled properties which is introduced in 1.32.0. I modify the sample program libs/graph/example/graph_property.cpp which then fail to compile, I don't know enough about bundled properties to fix it. Please help. Thanks. I use gcc version 3.4.2 (Gentoo Linux 3.4.2-r2, ssp-3.4.1-1, pie-8.7.6.5). graph_property.cpp source code is: int main() { using namespace boost; using std::string; struct edgeStruct { int weight; }; typedef adjacency_list<vecS, vecS, directedS,no_property, edgeStruct, property<graph_name_t, string> > graph_t; graph_t g; get_property(g, graph_name) = "graph"; graph_t::vertex_descriptor v = *vertices(graph_t).first; graph_t::edge_descriptor e = *out_edges(v, graph_t).first; g[e].weight = 1; std::cout << "name: " << get_property(g, graph_name) << std::endl; typedef subgraph<graph_t> subgraph_t; subgraph_t sg; get_property(sg, graph_name) = "subgraph"; std::cout << "name: " << get_property(sg, graph_name) << std::endl; return exit_success; } //compile output is: gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp: In function `int main()': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:21: error: `main()::edgeStruct' uses local type `main()::edgeStruct' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:21: error: trying to instantiate `template<class OutEdgeListS, class VertexListS, class DirectedS, class VertexProperty, class EdgeProperty, class GraphProperty, class EdgeListS> class boost::adjacency_list' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:21: error: ISO C++ forbids declaration of `graph_t' with no type /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:24: error: no matching function for call to `get_property(main::graph_t&, boost::graph_name_t)' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:25: error: `graph_t' is not a class or namespace /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:25: error: `vertex_descriptor' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:25: error: (Each undeclared identifier is reported only once for each function it appears in.) /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:25: error: expected `;' before "v" /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:26: error: `graph_t' is not a class or namespace /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:26: error: `edge_descriptor' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:26: error: expected `;' before "e" /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:27: error: `e' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:29: error: no matching function for call to `get_property(main::graph_t&, boost::graph_name_t)' /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp: At global scope: /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp: In instantiation of `boost::graph_traits<main::graph_t>': /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:66: instantiated from `boost::subgraph<main::graph_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:41: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:42: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:43: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:44: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:45: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:46: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:47: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:49: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:50: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:51: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:53: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:54: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:55: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:63: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: In instantiation of `boost::subgraph<main::graph_t>': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:66: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:67: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:68: error: no type named `directed_category' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:69: error: no type named `edge_parallel_category' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:70: error: no type named `traversal_category' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:73: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:79: error: no type named `out_edge_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:80: error: no type named `degree_size_type' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:83: error: no type named `adjacency_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:86: error: no type named `vertex_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:87: error: no type named `vertices_size_type' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:90: error: no type named `edge_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:91: error: no type named `edges_size_type' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:93: error: no type named `in_edge_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:95: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:96: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:99: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:108: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:112: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:162: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:166: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:173: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:177: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:186: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp: In instantiation of `boost::detail::edge_property_map<main::graph_t, boost::edge_index_t>': /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:219: instantiated from `boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:247: instantiated from `boost::subgraph<main::graph_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:160: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:161: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:162: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:164: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:164: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:165: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:165: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:166: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:166: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp: In instantiation of `boost::property_map<main::graph_t, boost::edge_index_t>': /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:247: instantiated from `boost::subgraph<main::graph_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:219: error: no type named `type' in `struct boost::detail::edge_property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:220: error: no type named `const_type' in `struct boost::detail::edge_property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: In instantiation of `boost::subgraph<main::graph_t>': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:247: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:248: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: `value' is not a member of `<declaration error>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: `value' is not a member of `<declaration error>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: size of array has non-integral type `<type error>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:254: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:256: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:257: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:258: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:259: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:264: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp: In instantiation of `boost::graph_property<main::graph_t, boost::graph_name_t>': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:34: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:235: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp: In function `int main()': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:34: error: no matching function for call to `get_property(main()::subgraph_t&, boost::graph_name_t)' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:36: error: no matching function for call to `get_property(main()::subgraph_t&, boost::graph_name_t)' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: In constructor `boost::subgraph<Graph>::subgraph() [with Graph = main::graph_t]': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:106: error: unnamed initializer for `boost::subgraph<main::graph_t>', which has no base classes set -e "g++" -c -Wall -ftemplate-depth-255 -g -O0 -Wno-inline -I"../../../bin/boost/libs/graph/example" -I "/home/tcma/cpp/boost_1_32_0" -o "/home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o" "/home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp" "/usr/bin/objcopy" --set-section-flags .debug_str=contents,debug "/home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o" ...failed gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property for lack of </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>graph_property.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property.run for lack of </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property... ...failed updating 1 target... ...skipped 3 targets... ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

2 1

Re: [sigc] Re: [Boost-users] Signals & Slots
by Edward Diener 22 Nov '04

22 Nov '04

Carl Nygard wrote: > On Thu, 2004-11-18 at 14:09, Doug Gregor wrote: >> On Nov 18, 2004, at 1:10 PM, Murray Cumming wrote: > >> I'm not in a position to do this at the moment, although possibly in >> the future. It would be *wonderful* if someone went off and studied >> both libraries in-depth to make this comparison, especially if that >> person was not intimately familiar with either library beforehand. >> > > Available: http://www.3sinc.com/opensource/boost.bind-vs-sigc2.html > > Updates for code samples from Chris Vine and Jonathan Brandmeyer will > be forthcoming. > > I could use some suggestions on how to incorporate common code into > the code comparison tables. > > And of course, any other comments, flames, etc. will be welcome. I'm > only doing this as a service for keeping track of comments. I'd like > to see some of this stuff make it into the C++ standard library. As of the upcoming release, the Boost signals library does make a guarantee of the order of signals within a particular group. The order within a particular group is FIFO.

4 4

(no subject)
by alansa＠ati-uk.com 22 Nov '04

22 Nov '04

>> Hmmm no linker errors or warnings. I've set my main exe to statically >> link. if i use the version of threads that statically links to >> msvcrt71 or dynamically to msvcrt71.dll it doesn't seem to make any >> difference. Our boost libraries where compiled here for msvcrt71 and i >> can confirm this. >> >> As i say if my main exe uses msvcrt71.dll then theres no leak. >Are you using tls code? >TLS currently (as to my knowledge) contains a "intentional" leak which >however is harmless. >Could you post the messages? >Did you track down the leak? Hi Roland In order to clear random influences from other areas of the software i'm working on, I have created a simple program with the code that i listed before. nothing else, no tls code. The intentinal leak would be harmless if it did not keep increasing. If I let the program run for long enough i will run out of memory. Sorry which messages would you like me to post? Haven't tracked down the leak yet. My problem is solved for the time being by using msvcrt71.dll as i said before. However it would be nice to be able to using the static lib. I replace the code in the loop which constantly starts and stop threads with my own code that did the same thing. This code was pretty much the same as the code for boost::thread using the windows api functions. This did not leak. However the big difference between my code and boost::thread is that my code didn't use boost::function. Therefore I suspect the leak could be in there! Looking at function it certainly isn't as trivial as thread. One thing i have noticed is that there is an option to get function to use "new" instead of std::allocator with the macro BOOST_NO_STD_ALLOCATOR. (function_template.hpp). I haven't got round to trying this yet though. Alan

1 0

Re: Re: FW: Leak when using boost threads under VC .NET using usi ng statically linked CRT
by alansa＠ati-uk.com 22 Nov '04

22 Nov '04

>> The interesting part is that it doesn't leak if use the version of threads >> built using the CRT as a .dll rather than static link. I also believe that >> the actual culprit is somewhere in boost.function since the code for >> boost.thread is so straight forward. >This sounds more like a mismatch between the runtime libraries that >Boost was compiled for (MSVCRT.DLL I'm pretty sure) and the one you're >linking with. Do you get a linker error indicating that there are >conflicting libraries? Hmmm no linker errors or warnings. I've set my main exe to statically link. if i use the version of threads that statically links to msvcrt71 or dynamically to msvcrt71.dll it doesn't seem to make any difference. Our boost libraries where compiled here for msvcrt71 and i can confirm this. As i say if my main exe uses msvcrt71.dll then theres no leak.

2 1

boost 1.32 breaks my code 2
by gast 128 22 Nov '04

22 Nov '04

Ok I have an example, int f(int, int); struct X { int m_i; }; X x; int i = boost::bind(&f, 1, _1)(boost::bind(&KTstbX::m_i, _1)(x)); UNREF(i); I guess the new boost does not return ref for members (in react on a previous email). Be aware however that functions them selves can still return references. Wkr, me _________________________________________________________________ Talk with your online friends with MSN Messenger http://messenger.msn.nl/

3 2

hello world with codewarrior
by jwjang 22 Nov '04

22 Nov '04

Hi all, I've just installed the boost library on my windows machine. I was using bjam with codewarrior compiler (mwcc) to build those libraries. After installation of libraries, I tried to run a "hello world" program with the same IDE (metrowerks codewarrior) but I couldn't make that work. The example I used is C:\boost_1_31_0\libs\graph\example\adjacency_list.cpp and I got a lot of error messages like below ... Error : undefined identifier 'std::size_t' (included from: cwchar:8 localeimp:18 istream:147 niostream:17 iostream:33 hello.cpp:12) wchar.h line 25 using std::size_t; I actually have no idea what this means. Please help me if anyone know anything about this. Thank you so much. jay

4 4

[Review] Named Parameters library (ongoing)
by Doug Gregor 22 Nov '04

22 Nov '04

Today is the last day of the review of the Named Parameters library by David Abrahams and Daniel Wallin. Let's hear some more comments! The original announcement follows: The Named Parameters library provides a framework for writing functions that can accept arguments by name or by position. The use of named parameters can improve the readability of calls to these functions, especially when the functions have many parameters with default values. The Named Parameters library allows one to write a new_window function that allows a call such as: window* w = new_window("alert2", movable = true); The library is available in the Boost sandbox here: boost/named_params.hpp libs/utility And in the files area (login required): http://groups.yahoo.com/group/boost/files/named_params.zip Reviewers may wish to compare this solution to the named parameters already used by the Boost Graph Library, documented here: http://www.boost.org/libs/graph/doc/bgl_named_params.html Please send your reviews either to the Boost list or to me personally. The former is preferred, because it allows the community to consider your review as well. When writing your review, you may wish to consider the following questions (from http://www.boost.org/more/formal_review_process.htm#Comments) - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? As always, please remember to clearly state whether you believe the library should be accepted into Boost. Thank you Doug Gregor Review Manager, Named Parameters library

1 0