- Boost-users - lists.boost.org

boost/regex How do i link/(create libs) with xlC on aix
by Rick Weiss 16 Dec '06

16 Dec '06

I dont mind using g++ to compile but all of our aix libs are created(and compiled for that matter) with xlC. And I cant seem to use g++ for linking to the xlC linked libs. So i guess I need one of two solutions: 1) make regex libs with xlC OR 2) learn how to link to several (so) libs created with g++ and xlC. Any help is appreciated. Thanks Rick Weiss

2 1

shared_ptr reference conversion and const oddity
by Brian Hassink 15 Dec '06

15 Dec '06

Here's the test case... class A { public: A() {} virtual ~A() {} }; class B : public A { public: B() {} }; class X1 { public: X1(const boost::shared_ptr<A>& a) {} virtual ~X1() {} }; class Y1 : public X1 { public: Y1(const boost::shared_ptr& b) : X1(b) {} }; class X2 { public: X2(boost::shared_ptr<A>& a) {} virtual ~X2() {} }; class Y2 : public X2 { public: Y2(boost::shared_ptr& b) : X2(b) {} }; int main(int argc, char** argv) { boost::shared_ptr b(new B()); Y1 y1(b); // ptr const in constructor, compiler ok Y2 y2(b); // ptr not const in constructor, compiler not ok } My question is why conversion of the shared_ptr reference does not work if it is not declared const? Here's the compiler error (gcc 3.4.4 - cygming special)... compiling main.cpp... main.cpp: In constructor `Y2::Y2(boost::shared_ptr&)': main.cpp:31: error: no matching function for call to `X2::X2(boost::shared_ptr&)' main.cpp:23: note: candidates are: X2::X2(const X2&) main.cpp:25: note: X2::X2(boost::shared_ptr<A>&) make: *** [obj/main.o] Error 1 Thanks, Brian

2 1

[graph] leda_graph.hpp and LEDA 5.0.1
by Jens Müller 15 Dec '06

15 Dec '06

The example doesn't work with LEDA 5.0.1 any longer: C++ topo-sort-with-leda.o topo-sort-with-leda.cpp: In function `int main()': topo-sort-with-leda.cpp:14: error: expected init-declarator before '<' token topo-sort-with-leda.cpp:14: error: expected `,' or `;' before '<' token topo-sort-with-leda.cpp:15: error: `graph_t' undeclared (first use this function) topo-sort-with-leda.cpp:15: error: (Each undeclared identifier is reported only once for each function it appears in.) topo-sort-with-leda.cpp:15: error: expected `;' before "leda_g" [Many more errors follow] Compiler is g++ 4.1.0. Has anyone made LEDA 5.0.1 work with a BGL wrapper?

2 2

[BGL] Max (min) cycle ratio
by Dmitry 15 Dec '06

15 Dec '06

Dear all, For a some time I've been using my own implementation for calculating of the minimum cycle ratio of the directed multigraph, it based on the approach described in the paper "Numerical Computation of Spectral Elements in MAX-PLUS algebra" and seems has complexity close to linear in the respect of the edges number (both in memory and time). Does current BGL has some solutions for cycle ratio problem? I would like to try to contribute my "perfect" implementation to BGL if it's possible. What is need to be done for it? WBR, Dima.

2 1

Re: [Boost-users] BOOST_ASSERT and others
by Maarten Nieber 15 Dec '06

15 Dec '06

I use the trick assert( 2 + 2 == 4 || "Adding numbers failed!" ) This will probably work for BOOST_ASSERT as well. Kind regards Maarten ----- Original Message ---- From: Gennadiy Rozental <gennadiy.rozental(a)thomson.com> To: boost-users(a)lists.boost.org Sent: Thursday, December 14, 2006 4:03:15 PM Subject: Re: [Boost-users] BOOST_ASSERT and others "abir basak" <abirbasak(a)gmail.com> wrote in message news:elr59r$sho$1@sea.gmane.org... > > Hi, > Hi, if any assert is there like BOOST_ASSERT or assert where I can > pass a custom message to print on assert failure ? > i.e. something like > BOOST_ASSERT(condition, message) > > Also, is there any debug print version for boost? > Something like, I want a message should be printed only when the > application is running in DEBUG version (whatever flag the system > provides for that). > The message can be cout or printf kind of thing. A little safety is > better sometimes like debug print can't change the value of the variable > etc. > Thanks Google for smart_assert. There was one by john torjo. Gennadiy _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Computing a path while traversing a graph with a search algorithm
by Roger Leigh 15 Dec '06

15 Dec '06

Hi folks, I've written a program which makes use of the Boost Graph library to construct a graph. I've then attached properties to both the vertices and edges, giving a result like this: http://www-users.york.ac.uk/~rl522/test.pdf However, I want to now search the graph in order to do this: 1. When the edge is the last, i.e. the outdegree of the target is 0: 2. Total the edge values for all the edges followed to get here all the way back to the root, and add 19. 3. If this total is the same value as the root node value, set a particular property on each vertex those edges are connected to. I've tried a depth_first_search using a Visitor. I wanted to push each edge onto a temporary vector as I found it, and then pop it when the algorithm backtracked, but this doesn't work. The aim here was to know the path taken to get to a particular edge when that edge was found. I'm completely new to using graphs (I'm actually a Biologist), and I think I'm missing how I should really be using the depth_first_search or breadth_first_search visitors to do what I need. It also doesn't appear to like me using the visitor to alter the properties on the vertices or edges during the search. Is this allowed? I'm not altering the graph, just wanting to set a few property values (internally stored, in this case). I would be very grateful for any ideas or suggestions for approaching this problem. Many thanks, Roger Leigh PS. This is the visitor I wrote, but this appears to be completely wrong. The full source is at http://www-users.york.ac.uk/~rl522/massgraph-0.1.0.tar.gz (ms_analysis.cc|h). class peak_visitor : public boost::default_dfs_visitor { public: peak_visitor(double target_mass, ms_analysis::vertex_set& vs, std::vector<ms_analysis::edge_stack>& v): target_mass(target_mass), vs(vs), v(v), s() {} template < typename Edge, typename Graph > void tree_edge(Edge e, Graph & g) { s.push_back(e); double smass = 0.0; for (ms_analysis::edge_stack::const_iterator pos = s.begin(); pos != s.end(); ++pos) { smass += g[*pos].aa_data.get_distance(); std::cout << g[*pos].aa_data.get_distance() << '\t'; } std::cout << std::endl; smass += 19.0; std::cout << "T=" << target_mass << ", S=" << smass << std::endl; if (smass > target_mass - 0.5 && smass <= target_mass + 0.5) { for (ms_analysis::edge_stack::const_iterator pos2 = s.begin(); pos2 != s.end(); ++pos2) { ms_analysis::graph::vertex_descriptor v1, v2; v1 = source(e, g); v2 = target(e, g); // Setting properties fails to compile. //g[v1].valid = true; //g[v2].valid = true; vs.insert(v1); vs.insert(v2); } } v.push_back(s); } } template < typename Edge, typename Graph > void back_edge(Edge e, const Graph & g) { // This is *never* called. std::cout << "BACK" << std::endl; s.pop_back(); } double target_mass; ms_analysis::vertex_set vs; std::vector<ms_analysis::edge_stack>& v; ms_analysis::edge_stack s; }; -- .''`. Roger Leigh : :' : Debian GNU/Linux http://people.debian.org/~rleigh/ `. `' Printing on GNU/Linux? http://gutenprint.sourceforge.net/ `- GPG Public Key: 0x25BFB848 Please GPG sign your mail.

2 1

The fibonacci heap is behaving strange
by Magnus Ekdahl 15 Dec '06

15 Dec '06

Hi, I put in 0,1,2,3,4 into a Fibonacci heap, manipulate some and get 0,2,4,1,25 back. With the relaxed heap I get 0,2,4,1,3 back, which is as expected with my code. AFAIK this is due to a bug in the Fibonacci heap? Anyway here is code adopted from the cvs (fibonacci_heap.cpp) that reproduces the result on two different machines (intel/amd), where the programs are compiled using g++ 4.0.4. Any help in clearing out this confusing result is appreciated :) #include <iostream> #include <cstdlib> #include <vector> #include <boost/pending/Fibonacci_heap.hpp> #include <boost/pending/relaxed_heap.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/pending/indirect_cmp.hpp> using namespace std; using namespace boost; int main(int argc, char *argv[]) { typedef indirect_cmp<unsigned*,std::less<unsigned> > ICmp; unsigned current; const unsigned N=5; vector<unsigned> w(N); ICmp cmp(&w[0], std::less<unsigned>()); Fibonacci_heap<unsigned, ICmp> Q(N, cmp); //relaxed_heap<unsigned, ICmp> Q(N, cmp); Q.push(0); current=Q.top(); cout << current << " "; Q.pop(); w[1]=180428938; Q.push(1); w[2]=84693088; Q.push(2); w[3]=168169277; Q.push(3); w[4]=171463691; Q.push(4); current = Q.top(); cout << current << " "; Q.pop(); w[3]=164976049; Q.update(3); w[4]=59651664; Q.update(4); current = Q.top(); cout << current << " "; Q.pop(); w[1]=71988538; Q.update(1); w[3]=118964142; Q.update(3); current = Q.top(); cout << current << " "; Q.pop(); w[3]=42423833; Q.update(3); current = Q.top(); cout << current << " "; Q.pop(); return EXIT_SUCCESS; }

4 5

[Boost] formal release dates for 1.34
by Andy Stevenson 15 Dec '06

15 Dec '06

Hi, Got any firm dates for when 1.34 will be released formally as the main boost distribution and what will/will not be in it in terms of libraries? Andy Stevenson Andy Stevenson CEO Fujitsu Telecommunications Europe Limited Tel: +44 121 717 6440 P Please consider the environment - do you really need to print this email?

1 0

composite key, want to use compatible key on part of it
by bert hubert 15 Dec '06

15 Dec '06

Hi everybody, I have this boost::multi_index container (I'm very very happy with boost::multi_index!): typedef multi_index_container< CacheEntry, indexed_by < ordered_unique< composite_key< CacheEntry, member<CacheEntry,string,&CacheEntry::d_qname>, member<CacheEntry,uint16_t,&CacheEntry::d_qtype> >, composite_key_compare<CIStringCompare, std::less<uint16_t> > >, sequenced<> > > cache_t; For details on CacheEntry, see http://wiki.powerdns.com/cgi-bin/trac.fcgi/browser/trunk/pdns/pdns/recursor… What I want to do is use a compatible key ('char *') to search only on d_qname. I've tried: struct string_char_comp { bool operator()(const char* x, const tuple<string,uint16_t>& )const { return false; // bogus, just compile testing } bool operator()(const tuple<string,uint16_t>&, const char* x )const { return false; } }; Followed by: cache_t d_cache; // ... d_cachecache=d_cache.equal_range(qname.c_str(), string_char_comp()); But this doesn't compile with famously huge template errors (I've shortened boost::multi_index to bi::): ord_index_ops.hpp:87: error: no match for call to `(const string_char_comp) (bi::composite_key_result<bi::composite_key<MemRecursorCache::CacheEntry, bi::member<MemRecursorCache::CacheEntry, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, &MemRecursorCache::CacheEntry::d_qname>, bi::member<MemRecursorCache::CacheEntry, short unsigned int, &MemRecursorCache::CacheEntry::d_qtype>, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> >, const char* const&)' These errors make me wonder if what I want is even possible - unless I make my comparison function accept a composite_key_result with lots of bi internals in it. Joaquin? -- http://www.PowerDNS.com Open source, database driven DNS Software http://netherlabs.nl Open and Closed source services

2 2

[Graph] clear_vertex() bug?
by Silvia Richter 15 Dec '06

15 Dec '06

Hi, I'm new to Boost, and hope you can help me. When the attached source file is compiled with: gcc version 3.2.3 20030502 (Red Hat Linux 3.2.3-47.fc4) or gcc version 3.3.6 (Ubuntu 1:3.3.6-13ubuntu2) or gcc version 4.0.4 20060630 (prerelease) (Ubuntu 4.0.3-4), then running the program gives a segfault on line 27. When compiled with: gcc version 4.0.2 20051125 (Red Hat 4.0.2-8), no error occurs. To my understanding, no error should occur: I am using "listS" for both edges and vertices in adjacency_list. According to the documentation, clear_vertex() should not invalidate the adjacency_iterator in this case. However, in my code that's exactly what happens. I call adjacent_vertices() on a vertex A, which gives me an adjacency_iterator. Then I remove all edges from A by calling clear_vertex(). Then I want to use the adjacency_iterator obtained previously to check the new degrees of all (previous) neighbours of the removed vertex v. But the program crashes with a segmentation fault, when I try to use the iterator. Has anyone experienced this before? Is that a bug of the library? Cheers, Silvia -------------------------------------------------------------------------- This email and any attachments may be confidential. They may contain legally privileged information or copyright material. You should not read, copy, use or disclose them without authorisation. If you are not an intended recipient, please contact us at once by return email and then delete both messages. We do not accept liability in connection with computer virus, data corruption, delay, interruption, unauthorised access or unauthorised amendment. This notice should not be removed.

1 0