- Boost-users - lists.boost.org

Fix location STL/boost containers?
by Bo Peng 23 Apr '05

23 Apr '05

Dear list, I need direct access ( save and use element pointers) to container elements in my application. std::vector<obj> can not be used since vector::push_back etc may relocate objs. std::list<obj> seems to be working but I could not find any guarantee that an element will not be moved around because of operations on other elements. Is there a std or boost container that fits my need? Many thanks in advance. Bo

5 7

RE: [Boost-users] Re: A Simple Problem: File Transfer...
by Sliwa, Przemyslaw (London) 23 Apr '05

23 Apr '05

Ace is good, but it is huuuuuuuuuuuuuuuuugeeeeeeeeeeeeee -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Sarvex Jatasra Sent: 19 April 2005 09:57 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Re: A Simple Problem: File Transfer... What i feel is ACE is a good library for network programming in C++ http://www.cs.wustl.edu/~schmidt/ACE.html With Regards Sarvex Jatasra Software Engineer +91-9891989156 +91-9350933295 _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

2 1

RE: [Boost-users] Re: A Simple Problem: File Transfer...
by Sliwa, Przemyslaw (London) 23 Apr '05

23 Apr '05

Here you are: http://www.huihoo.org/ace_tao/ACE-5.2+TAO-1.2/ACE_wrappers/docs/tutorial s/001/page01.html -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Hossein Haeri Sent: 22 April 2005 09:39 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Re: A Simple Problem: File Transfer... Caleb, > > Yes, you're right. As I told in another posting to > the > > list, I need sth "freely downloadible". Sorry for > not > > being specific enough... > > ACE is entirely free. There are books and support > you can pay for, > but all the code is totally open source. I see that I still haven't been specific enough. Sorry! What I was (and am) asking for is a free tutorial. I already know that the code is freely downloadble. Thanks, --Hossein Send instant messages to your online friends http://uk.messenger.yahoo.com _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

2 1

a question about incremental_component and disjoint_sets.
by Vivid Yang 23 Apr '05

23 Apr '05

Hi, I have a question about incremental_component and disjoint_sets. Here is the context: I have a class object initialized with an empty boost::graph. The algorithm incrementally builds the graph with the function add_vertex(graph). At the same time, I have to maintain the connected components of the graph. Here is the question: I know incremental_component.hpp can deal with the case edges are being added. Could it deal with the case that vertices are being added? Especially at the beginning, the graph is empty. And it seems I cannot declare an empty disjoint_sets variable in the class: classe X { ...... protected: //.... some graph typedef std::vector<graph_vertex_size_type> rank; std::vector<graph_vertex_descriptor> parent; disjoint_sets<Rank, Parent> ds; ...... }; Here is the compiler error: error C2248: 'disjoint_sets<unsigned int *,void * *,struct boost::find_with_full_path_compression>::disjoint_sets<unsigned int *,void * *,struct boost::find_with_full_path_compression> ' : cannot access private member declared in class 'boost::disjoint_sets<unsigned int *,void * *,struct boost::find_with_full_path_compression>' e:\temp\boost\boost_1_32_0\boost\pending\disjoint_sets.hpp(68) : see declaration of 'disjoint_sets<unsigned int *,void * *,struct boost::find_with_full_path_compression>::disjoint_sets<unsigned int *,void * *,struct boost::find_with_full_pat h_compression>' Could anybody help? Thanks a lot. Vivid

2 1

test library: run a single test
by Daniel van der Zee 23 Apr '05

23 Apr '05

I am using the unit testing framework with the BOOST_AUTO_UNIT_TEST macros. While debugging, is there a way to run a single test instead of running them all everytime? This is probably a FAQ, but I couldn't find it. Thanks, Daniel

7 16

BGL example correction?
by Peter Kümmel 23 Apr '05

23 Apr '05

Hello, here maybe a small correction for boost_1_32_0\libs\graph\example\file_dependencies.cpp, line 176 : dijkstra_shortest_paths_no_init (g, *i, &pred[0], &time[0], weight, indexmap, - compare, combine, 0, // Since we are using > instead of >, we + compare, combine, //0, // Since we are using > instead of >, we (std::numeric_limits<int>::max)(), // flip 0 and inf. default_dijkstra_visitor()); And I don't understand the comment '> instead of >' or what means '>,' ??? If I compile with zero distance the program crashes, although the declaration is: dijkstra_shortest_paths_no_init (const VertexListGraph& g, typename graph_traits<VertexListGraph>::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, -> DistZero zero, DijkstraVisitor vis) Regrads, Peter

2 1

graph type used in BGL function "connected_components()"
by Qiaofeng Yang 23 Apr '05

23 Apr '05

Hi, I have a question about the graph type used in BGL function "connected_components()". When I define the graph type to be: adjacency_list<vecS, vecS, undirectedS> Everything is OK. When I change the graph type to be: adjacency_list<listS, listS, undirectedS> I got a lot of compilation error messages. Anybody knows why is so? Was "connected_components()" only implemented on one particular implementaton of graphs like vecS? Best regards, Qiaofeng

3 2

wrong library extension on HP-UX
by Oliver Kowalke 22 Apr '05

22 Apr '05

Hi, my previous 2 emails were silently droped - so I try it a 3thd time. I've compiled boost on HP/UX with gcc. The extension of the shared libraries is *.so. I think it should be *.sl ! how can I fix this? thx, Oliver

2 1

recommended gcc for boost users on opteron (64-Bit)
by Michal Simecek 22 Apr '05

22 Apr '05

Hi all, Does somebody know, which gcc is recommended for boost users especially BGL users working on opterons, with linux on it, compiling with optimisation (-O2) and 64-bit mode. I run in some problems with gcc 3.2.2 thus I try to find out which compiler is the best choice for that system. Thanks

2 1

(no subject)
by Sliwa, Przemyslaw (London) 22 Apr '05

22 Apr '05

All, I have found a very strange behaviour (for me at least!) in boost.Thread. The same dummy code: boost::mutex M; void functionA(int j) { for(int i=0; i<j; ++i) { boost::mutex::scoped_lock lock(M); sqrt(static_cast<double>(i)); } } void functionB(int j) { for(int i=0; i<j; ++i) { boost::mutex::scoped_lock lock(M); sqrt(static_cast<double>(i)); } } int main() { thread A(bind(&functionA, 1000000000)), AA(bind(&functionA, 1000000000)), B(bind(&functionB, 100000000)), BB(bind(&functionA, 100000000)); A.join(); B.join(); AA.join(); BB.join(); } executed on a two processor machine uses the resourced differently depending if the line boost::mutex::scoped_lock lock(M); is comennted or not. If we do not lock the mutex then both processors are used on 100%. However, in case the line is uncommented (we lock the mutex) only one processor is used. Can anyone explain me why? Thanks in advance Pshemek -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

2 1