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

RE: [Boost-Users] boost::any and operator ==
by Jim.Hyslop 29 Aug '02

29 Aug '02

> How do I compare two boost::any values for equality? How to I compare > two containers of boost::any's for equality? > > Why doesn't boost::any define this operator? There has to be > a reason. There is. boost::any can, quite literally, hold *anything*. In order to compare the objects being held, you must first know if they _can_ be compared. Consider: const char * initialMessage = "Snowflakes keep falling on my head"; void f() { boost::any multiA(42L); boost::any multiB(initialMessage); //... It doesn't make sense to compare the two 'any' objects. I suppose boost::any could coerce the pointer into a long, and then apply a comparison operator, but the results of that comparison would be meaningless. In order to compare the objects, you'll have to extract them from the any container using an any_cast. Which, of course, means you'll have to know the exact type of the object being held (or which type of a known set of types). -- Jim

2 1

Sorting a container of shared_ptr<T>
by alejandro_escalante_medina 29 Aug '02

29 Aug '02

Hello to everyone. I'm starting to take a look on Boost and was happy to find things like better smart pointers. Though, in my tests, I haven't been able to sort, say, a vector of shared_ptr without defining special comparators. I thought that the overload for the < operator would help me for that, but that operator compares pointers, not objects, so it doesn't do the work that I expected. I guess I'm not understanding this well. Could someone explain this to me? Saludos, Alex

2 1

threads and signals question
by lparrab 29 Aug '02

29 Aug '02

Hi all, I guess my question is not specific to Boost.Thread, but to threading in general (I'm new at it)... still hope you can help me out, either directly or by redirecting me to the right place (links are very much appreciated) I'm starting a multi-threaded program using Boost.Thread library: it is a "server", in which a thread loops around a "select" to accept new connections and see when a socket has data to be read, in which case puts the fds in queue from which other threads are taking them out to read the data. The problem I have, is that when a "ReceiverThread" finishes reading the data from the socket, it puts the fd back in the "all connections list", but by this time the other ("main")thread already copied the fds from the list and got into the next "select" loop, which means the socket from which the "receiver" just finished reading, will not be "selected" (monitored) untill the next select loop, which will not be untill a) a new connection comes or b)one of the other connected sockets gets some data that takes makes the main thread return from select. reading the select man, I thought I could just use a signal to force select to return when the "receiver" has put the fd back in the "all connection list": the threads are now executing something like: main_thread { *put all fds from "all sockets" list into a fdset *make a select on the fdset (block till something interesting happens) *take the fds with data out of "all sockets" and put them into "sockets with data" *loop } receiver{ *get a fd from "sockets with data" (if nothing there blocks till the main_thread sends us a fd through the queue) *read from fd *put fd back into "all sockets" (problem: main_thread may be (is!) already into the select) *raise(SIGUSR1) (to force select to return and enter the loop again, but this time with our fd) } the signal handler for SIGUSR1 does nothing, it just serves to force select to return, but the code is not really working as I expected, and I realized that the problem is that each thread has its own pid, so it seems raise is actually sending a signal to the wrong thread.... as I said, I am new to mulithreading, but I thought all threads run in a process, which means, they all have the same pid. ->if I first find out the "pid" of the main_thread and change raise(SIGUSR1) to kill(pid,SIGUSR1) it works ok. so my question: why does each thread have a own pid?? how can then I send signals from one thread to another?? I discovered there is a "pthread_kill" function to send signals to specific threads, the problem is I only have boost::thread objects, no pthread_t structures. or am I talking nonsense and shouldnt be using signals with Boost.Thread? if so, how do I solve the select problem?? thanx! luis

5 5

BGL: adjacency_list: remove_edge problems
by Matthias Kronenberger 29 Aug '02

29 Aug '02

I'm using a undirected grap with hash_setS as the Edge List container and vecS as the Vertex List Container I'm using MSVC60 with SP5 as soon as i'm trying to use remove_edge(vertex1,vertex2,graph) i get the following error message. I dont understand the error message. It means, that my edgelist is a std::vector allthough i compile with boost::hash_setS. Could it be, that some BGL config file detects MSVC and concludes, that hash sets are not available in the MSVC stl?? d:\matthias\programmieren\boost\boost\graph\detail\adjacency_list.hpp(665): error C2039: 'find': Ist kein Element von 'vector<boost::detail::sei_<unsigned int,list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,float,boost:: no_property>>>::iter,boost::property<enum boost::edge_weight_t,float,boost::no_property>>,allocator<boost::detail::sei _<unsigned int,list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,float,boost::no_property>>>::iter,boost ::property<enum boost::edge_weight_t,float,boost::no_property>>>>' find is not an element of vector the corresponding code fragment is. template <class Graph, class EdgeList, class Vertex> inline void remove_edge_and_property(Graph& g, EdgeList& el, Vertex v, boost::disallow_parallel_edge_tag) { typedef typename EdgeList::value_type StoredEdge; typename EdgeList::iterator i = el.find(StoredEdge(v)), end = el.end(); if (i != end) { g.m_edges.erase((*i).get_iter()); el.erase(i); } }

3 6

Re: [Boost-Users] threads and signals question
by dick.bridges＠tais.com 29 Aug '02

29 Aug '02

My $.02. Check out the description of the Leader-Follower thread pattern described in Schmidt, et al, Pattern-Oriented Software Architecture, Volume 2, Patterns for Concurrent and Networked Objects. Sure is easy to implement with Boost libraries. Thank you everyone! Luis De la Parra <lparrab(a)gmx.net To: tomhoward(a)users.sourceforge.net, Boost-Users(a)yahoogroups.com > cc: Subject: Re: [Boost-Users] threads and signals question 08/29/2002 09:37 AM Please respond to Boost-Users > IMHO I wouldn't use select. Each time a new connections is initiated, you > can simply start a new thread to receive data from that socket. I don't > know what performance impact this would have, but the code will certainly > be simpler and easier to maintain. as I said, I'm new to threads.. and I know they are much more "leightweighted" than a normal process, but imagine a server, like an application server, which can have *a lot* of clients connected at the same time, but in which the clients are not really all requesting thigs all the time, they are "just connected" I think having a thread waiting on each open connection is not the right approach here, so I thought of going a kind of "production line" approach in which a few threads (5-10) are reading the data from a bunch of open connections (50-100), the only thing they do is read the data, parse it and form a "Request" which they put in a queue for further processing and then go on to service the other connections. Then another group of threads is taking this requests and doing something, and putting Response objects in yet another queue, which another group of threads "Sender" is taking and sending thorugh the socket. I think you get the idea: a frew threads just doing one thing and then passing the processing to another gorup of threads. I know having a thread dedicated to each connection would be much easier, but since this project is mostly for fun (and to learn!) I'd like to take a "better" approach (note that I am not saying the approach I just described is the best one, but right now it sounds more efficient and scalable to me than the one-trhead-per-connection approach) regards, luis.l 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

tuple and enums
by Tom Matelich 29 Aug '02

29 Aug '02

It appears that an enum cannot be default constructed in the way that tuple does, cons() : head(), tail() {} Any idea on how to get around this (besides using an int in the tuple)? Thanks, Tom <sample_code> #include <boost/tuple/tuple.hpp> #include <string> enum Foo { Willis, Arnold }; void test() { boost::tuple<Foo, std::string> a; } </sample_code> </error compiler="gcc version 2.96 20000731 (Mandrake Linux 8.2)"> /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp: In method `boost::tuples::cons<HT, TT>::cons () [with HT = Foo, TT = boost::tuples::cons<string, boost::tuples::null_type>]': /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp:454: instantiated from `boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::tuple () [with T0 = Foo, T1 = string, T2 = boost::tuples::null_type, T3 = boost::tuples::null_type, T4 = boost::tuples::null_type, T5 = boost::tuples::null_type, T6 = boost::tuples::null_type, T7 = boost::tuples::null_type, T8 = boost::tuples::null_type, T9 = boost::tuples::null_type]' tuple_enum_test.cpp:8: instantiated from here /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp:263: cannot convert `int' to `Foo' in assignment </error> ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

2 1

shared_ptr const problem
by Olaf Petzold 28 Aug '02

28 Aug '02

Hi, now I have a new problem - const correctness. ---8<--- #include <iostream> #include <algorithm> #include <iterator> #include <vector> #include <boost/shared_ptr.hpp> class Doc { public: virtual ~Doc() { } public: const std::vector<double>& foo() const { return m_foo; } protected: std::vector<double>& foo() { return m_foo; } private: std::vector<double> m_foo; }; using namespace std; int main() { boost::shared_ptr<Doc> lp_doc( new Doc ); std::copy(lp_doc->foo().begin(), lp_doc->foo().end(), std::ostream_iterator<double>(cout, " ") ); cout << endl; } --->8--- `std::vector<double, std::allocator<double> >& Doc::foo()' is protected I hoped std::copy takes the const foo() member function. Thanks olaf

2 2

iterator_adaptors on mipspro 7.3.1.3m
by marcinzalewski 28 Aug '02

28 Aug '02

Hi, I am trying to use iterator adaptors on mipspro and am unsuccessfull as for now. I was wandering if any of you has experience with boost and mipspro. Here are some examples of errors I am getting: ----------- cc-1132 CC: ERROR File = ../../boost_1_28_0/boost/iterator.hpp, Line = 54 The namespace "std" has no member "ptrdiff_t". template <class Category, class T, class Distance = std::ptrdiff_t, ^ or cc-3307 CC: ERROR File = ../../boost_1_28_0/boost/type_traits/array_traits.hpp, Line = 24 Invalid partial specialization--class "boost::is_array<<error-type>>" is already fully specialized. template <typename T, std::size_t N> struct is_array<T[N]> ----------- Please, let me know if you did this before. :) -m ^

2 2

[BGL] undirectedS self-loop add_edge assertion
by Chris Russell 27 Aug '02

27 Aug '02

Just a quick mention: A call to add_edge with u == v causes an assertion if Directed == undirectedS. adjacency_list.hpp line 843: assert( u != v ); // don't allow self-loops ^- boost_1_28_0 Avoiding the assertion is easy enough but this is inconsistent w/section 14.1.1 p.220 of the BGL book: "... Also if u and v are descriptors for the same vertex (creating self loop) and the graph is undirected, then the edge will not be created and the flag will be false." Am having tons of fun - the BGL and the book are super. Thanks! - Chris

2 1

lambda library usage
by khuroth 27 Aug '02

27 Aug '02

I have a View class that has some widgets, and a Controller class that controls the view, so the View class has a GetController() member function that returns a reference to its controller. When the View's constructor is called, GetController() would return a bad ref, but it would return a valid reference by the time a button is clicked... so what I'm trying to do is, inside the View constructor: my_button.on_click = bind( (_1 ->* &A::GetController).DoSomething(), this ); but that obviously doesn't work... I'm even having trouble just saving the first part: my_button.on_click = bind<Controller&>(_1 ->* &A::GetController, this); also doesn't work... I tried defining the on_click member of the button as a boost::function<void> or a boost::function0<void> in the first example, and a boost::function<Controller&> or boost::function0<Controller&> in the second snip... I get immense compiler errors, so I'm not sure where I messed up. What am I doing wrong?

3 8

shared_ptr swap problems
by Olaf Petzold 27 Aug '02

27 Aug '02

Hello, I've trouble with the follwong snippet: #include <iostream> #include <boost/shared_ptr.hpp> struct A { A(const char* n) : name(n) { } const char* name; }; struct B : public A { B(const char* n) : A(n) { std::cout << "construct " << name << std::endl; } ~B() { std::cout << "destruct " << name << std::endl; } }; struct BaseC { virtual void set(const boost::shared_ptr<A>& ptr) = 0; }; struct C : public BaseC { C() : b( new B("C::b") ) { } void set(const boost::shared_ptr<A>& ptr) { b.swap( boost::shared_static_cast( ptr ) ); // L21 } void print() { std::cout << b->name << std::endl; } boost::shared_ptr b; }; using namespace std; int main() { boost::shared_ptr<A> b( new B("b") ); C c; c.print(); c.set( b ); c.print(); } t.cc: In member function `virtual void C::set(const boost::shared_ptr<A>&)': t.cc:21: no matching function for call to `boost::shared_ptr::swap(boost::shared_ptr)' /usr/include/boost/shared_ptr.hpp:234: candidates are: void boost::shared_ptr<T>::swap(boost::shared_ptr<T>&) [with T = B] I did try boost::shared_polymorphic_cast to get a std::bad_cast exception - but it doesn't compile too. How can get it working? Thanks Olaf

3 7

RE: [Boost-Users] How can checkout the files in Attic (hidden) fr om the cvs server?
by Jim.Hyslop 27 Aug '02

27 Aug '02

> I'm using WinCvs to checkout the current version of boost from the > cvs server. However, I found that I can not checkout some of the > libs which are put in the Attic, though I can browse them through my > internet browser. Anyone knows how to check these files out? (for > example, the mpl lib) Any files in the Attic are either obsolete, or have been added only on a branch and have not been merged to the trunk yet. Unless you are having a specific problem that requires a file from the Attic, then don't worry about what's up there (I suspect that's probably why it's called the "Attic" - out of sight, out of mind ;-) -- Jim

1 0

How can checkout the files in Attic (hidden) from the cvs server?
by li_lirong 27 Aug '02

27 Aug '02

I'm using WinCvs to checkout the current version of boost from the cvs server. However, I found that I can not checkout some of the libs which are put in the Attic, though I can browse them through my internet browser. Anyone knows how to check these files out? (for example, the mpl lib) Thanks in advance, Lirong

1 0

boost::any and operator ==
by billrobertson42 27 Aug '02

27 Aug '02

How do I compare two boost::any values for equality? How to I compare two containers of boost::any's for equality? Why doesn't boost::any define this operator? There has to be a reason. Thanks!

1 0

What's your wish list?
by Kevin S. Van Horn 26 Aug '02

26 Aug '02

I'm teaching a graduate class on generic programming this semester, and I'm looking for some solid, meaningful projects for my students. If there are extensions to existing Boost libraries that you would like, or some new C++ library that you would like written, please contact me. -- Kevin S. Van Horn kevin.vanhorn(a)ndsu.nodak.edu

1 0

Using Hash with Graph
by Sandeep Bhutani 26 Aug '02

26 Aug '02

Hi, I am trying to use hash feature with the graph library. Here are the various details: Solaris: SunOS 5.7 Compiler: KAI 4.0 STL: Native Sun Hash: A hacked up version of SGI/STLPort I can get graph to work with vectors/lists. I can't get it to work with the hash_set or hash_map. I get a message from the "concept_checks.h" file in my hash which essentially tells me that the hash function is not defined. I am reproducing the message from the compiler at the bottom. I am trying to make all this work by using the adjacency_list.cpp file in the examples directory. Here is the change I have made to that file: typedef adjacency_list<hash_setS, listS, undirectedS, VertexProperty, EdgeProperty> Graph; // New typedef adjacency_list<vecS, listS, undirectedS, VertexProperty, EdgeProperty> Graph; // Old Can you please help? Has anyone used the has feature in the graph library. I had to edit the line number 166 in adjacency_list.hpp to replace hash_set with hash_map. Thanks -Sandeep The message: "/lsi/home/bhutani/hash/include/concept_checks.h", line 289: error: call of an object of a class type without appropriate operator() or conversion functions to pointer-to-function type return __f(__arg); ^ detected during instantiation of "_Ret _STL_UNARY_FUNCTION_ERROR<_Func, _Ret, _Arg>::__unary_function_requirement_violation(_Func &, const _Arg &) [with _Func=std::hash<boost::detail::adj_list_gen<boost::adjacenc y_list<boost::hash_setS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>, boost::listS, boost::hash_setS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>::config::StoredEdge>, _Ret=size_t, _Arg=boost::detail::adj_list_gen<boost::adjacency_list<boos t::hash_setS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>, boost::listS, boost::hash_setS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>::config::StoredEdge]" at line 95 of "adjacency_list.cpp" 1 error detected in the compilation of "adjacency_list.cpp". KCC: Compilation failed. boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>, boost::listS, boost::hash_setS, boost::undirectedS, boost::property<boost::vertex_index_t, size_t, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>>, boost::property<boost::edge_name_t, std::string, boost::no_property>, boost::no_property, boost::listS>::config::StoredEdge]" at line 95 of "adjacency_list.cpp" 1 error detected in the compilation of "adjacency_list.cpp". KCC: Compilation failed.

3 3

Had to change typename to class in template declaration of ref.hpp
by Matthias Kronenberger 26 Aug '02

26 Aug '02

Is that a known bug of MSVC? changing all the typename to class removed the error messages.

1 0

Trouble with boost::bind
by stupid_newcomer 26 Aug '02

26 Aug '02

I'm trying to play with boost::bind and boost::mem_fn, however, i have some difficulties with the member function with more than 2 arguments. I have tried a number of time and gone through the documentation , but still can't found an answer. Example: #include <boost/shared_ptr.hpp> #include <boost/mem_fn.hpp> #include <boost/bind.hpp> #include <iostream> #include <vector> #include <algorithm> using namespace std; class B { public: void print0() const { cout << "B::print0 " << endl; } void print1(int i) const { cout << "B::print1 " < Ptr; vector<Ptr> v; for (int i = 0; i < 3; ++i) { v.push_back(boost::shared_ptr(new B())); } // zero argument, OK for_each(v.begin(), v.end(), boost::mem_fn(&B::print0)); // one argument, OK for_each(v.begin(), v.end(), boost::bind(&B::print1, _1, 5)); // two argument, how to call B::print2 ? // for_each(v.begin(), v.end(), /* B::print2 */); return 0; } Thanks for your help!

2 1

regex_match question
by yg-boost-users＠m.gmane.org 25 Aug '02

25 Aug '02

hello everybody i have a trouble with regex_match function. when i try to match a string with a pattern like "(abc)*", and if the string beeng matched contains several subexpressions 'abc', regex_match returns only one match so that i can't iterate through all of them. so, it counts subexp's in the pattern, not in the string. why it happens (i use default flags for regex_match, which must perform what i expect)? and what is the solution to the problem (the one i found so far is to parse in 2 phases - once with regex_match to be sure that the whole string matched, and then to use regex_split. but i'd like to parse the string only once and obtain all the subexp's)? thanks in advance aram

3 4

JAM and boost.pythyon
by sashan 24 Aug '02

24 Aug '02

Hi I've built the Python library and a few of my own test projects. I have problems when trying to link with an external library. Basically I get the 'unresolved external' link error. So I look at the jamfile I'm using and in the dependencies section add the following <dll>E:/code/Library/MyLib Then I run bjam again and the first error I get is E:/Code/Library/Jamfile: No such file or directory So I guess its looking for a Jamfile in that directory. Problem is I don't know what to put inside the Jamfile. Can someone please help? Thank you Sashan

2 1

REGEX - expression doesn't match
by Fr�d�ric Mayot 24 Aug '02

24 Aug '02

Hi, My problem is really simple : I have several regular expressions (like (19[4-9]\d)|(200\d)|( [09]\d ) ) which work when they correspond to the entire string, e.g. : "2002" OK; "something 2002 something" NOT OK. Everythings worked fine with the GRETA library, and now, it doesn't. Does anyone have an idea ? Thanks. Fred

3 5

Re: [Boost-Users] Re: REGEX - expression doesn't match
by dan.ellis＠sophos.com 23 Aug '02

23 Aug '02

> It's simple : I have a string and a regular expression. I only want to > find the FIRST sub-string which matches my regular expression (S), then > to extract the sub-string before S and the sub-string after S. Off the top of my head, it sounds like you want: (.+)(200\d)(.*) -- Dan Ellis, Software Engineer, Sophos Anti-Virus Email: dan.ellis(a)sophos.com, DDI: 01235 540204 Real Business/CBI Growing Business Awards: Company of the Year Tel: 01235 559933, Web: http://www.sophos.com/

1 0

Graph - return edge_descriptor
by Shaw, Richard A 23 Aug '02

23 Aug '02

Can anybody tell my why the find_edge function in the code below fails to get a property if I return the first edge in the list. This is what happens - Find_edge looks for edge A - B It winds it and prints out the edge descriptor, and the weight of the edge It the returns the edge The main code prints out the edge descriptor and the fails when trying to print the weight. BTW - Is there a ready made function to find an edge based on the vertices ? #include <boost/config.hpp> #include <iostream> #include <fstream> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> using namespace boost; // Find edge template <class Graph> std::pair<bool, graph_traits<Graph>::edge_descriptor> find_edge(graph_traits<Graph>::vertex_descriptor u, graph_traits<Graph>::vertex_descriptor v, Graph g) { graph_traits<Graph>::out_edge_iterator ei, edge_end; for (boost::tie(ei,edge_end) = out_edges(u, g); ei != edge_end; ++ei) { if (target(*ei, g) == v) { std::cout << "Inside " << *ei << " " << get(edge_weight, g, *ei) << std::endl; return std::make_pair(true, *ei); } } return std::make_pair(false, *ei); // Is there a null edge that I can return ? } int main(int, char *[]) { typedef adjacency_list < listS, vecS, directedS, no_property, property < edge_weight_t, int > > graph_t; typedef graph_traits < graph_t >::vertex_descriptor vertex_descriptor; typedef graph_traits < graph_t >::edge_descriptor edge_descriptor; typedef std::pair<int, int> Edge; const int num_nodes = 5; enum nodes { A, B, C, D, E }; Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E), Edge(C, B), Edge(C, D), Edge(D, E), Edge(E, A), Edge(E, B) }; int weights[] = { 1, 2, 1, 2, 7, 3, 1, 1, 1 }; int num_arcs = sizeof(edge_array) / sizeof(Edge); #ifdef BOOST_MSVC graph_t g(num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); for (std::size_t j = 0; j < num_arcs; ++j) { edge_descriptor e; bool inserted; tie(e, inserted) = add_edge(edge_array[j].first, edge_array[j].second, g); weightmap[e] = weights[j]; } #else graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); #endif graph_traits < graph_t >::edge_descriptor e; bool found; std::cout << "List All" << std::endl; graph_traits < graph_t >::edge_iterator ei, ei_end; for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) { std::cout << *ei << get(weightmap, *ei) << std::endl; } std::cout << "List Not First" << std::endl; tie(found, e) = find_edge< graph_t >(E, A, g); std::cout << "Outside " << e << get(weightmap, e) << std::endl; // This edge is OK std::cout << "List First" << std::endl; tie(found, e) = find_edge< graph_t >(A, C, g); std::cout << "Outside " << e << get(weightmap, e) << std::endl; // This line fails to get the weight return EXIT_SUCCESS; } Richard Shaw ¤º°`°º¤ø,¸¸,ø¤º°`°º¤ø¤º°`°º¤ø,¸¸,ø¤º°`°º¤ø¤º°`°º¤ø,¸¸,ø¤ Atkins Transport Systems Woodcote Grove Ashley Road Epsom KT18 5BW Direct Dial.: +44 (0) 1372 756407 Switchboard: +44 (0) 1372 726140 Fax: +44 (0) 1372 740055 www.atkinsglobal.com/transportsystems <www.atkinsglobal.com/transportsystems> This email and any attached files are confidential and copyright protected. If you are not the addressee, any dissemination of this communication is strictly prohibited. Unless otherwise expressly agreed in writing, nothing stated in this communication shall be legally binding.

4 4

RE: [Boost-Users] Re: boost::object_pool
by scleary＠jerviswebb.com 22 Aug '02

22 Aug '02

> -----Original Message----- > From: wugui [mailto:yg-boost-users@m.gmane.org] > > another question: > > how make boost::object_pool thread_safe? To make a pool object thread-safe, guard all access with a mutex. -Steve

1 0

RE: [Boost-Users] boost::object_pool
by scleary＠jerviswebb.com 22 Aug '02

22 Aug '02

> -----Original Message----- > From: wugui [mailto:yg-boost-users@m.gmane.org] > > class A; > class B; > class AB : virtual public A, virtual public B; > > all destruct is virtual > > boost::object_pool<AB> pool_ab; > > B * pb = pool_ab.constuct(); > pool_ab.destroy(pb); // is this right? This looks right to me; what "pool_ab.destroy(pb);" does is: pb->~AB(); free(pb); // puts pb back in the free list of pool_ab -Steve

1 0