- Boost-users - lists.boost.org

Multiple Versions of Boost in the Same Executable
by Aaron_Wright＠selinc.com 09 Oct '12

09 Oct '12

I have a large executable that loads shared libraries as plugins. Some of those shared libraries dynamically link with an old boost version that's part of the system (/usr/lib) when they are loaded. I want to build my own plugin shared library, but I want to use a newer boost version. I tend to link boost in statically. My question is, will it cause any issues if I create a shared library that is statically linked with a newer version of boost, and have it loaded by the same executable that is dynamically linked with an old version of boost? I hoping this'll work, as I can't upgrade the system boost very easily. --- Aaron Wright

3 3

boost::bind issues
by Littlefield, Tyler 09 Oct '12

09 Oct '12

Hello all: I'm trying to boost::bind a couple of callbacks and was getting errors; could someone help me figure out what's going on? First, the errors: 19:22:36: Compiling staticObject.cpp. staticObject.cpp: In constructor â€˜StaticObject::StaticObject()â€™: staticObject.cpp:20:143: error: no matching function for call to â€˜OlcStringEntry::OlcStringEntry(std::string, int, boost::_bi::bind_t<std::basic_string<char>, boost::_mfi::cmf0<std::basic_string<char>, BaseObject>, boost::_bi::list1<boost::_bi::value<StaticObject*> > >, boost::_bi::bind_t<void, boost::_mfi::mf1<void, BaseObject, const std::basic_string<char>&>, boost::_bi::list2<boost::_bi::value<StaticObject*>, boost::arg<1> > >)â€™ staticObject.cpp:20:143: note: candidates are: In file included from staticObject.h:7:0, from staticObject.cpp:5: olc.h:48:3: note: OlcStringEntry::OlcStringEntry(const string&, FLAG, StringGetter&, StringSetter&) olc.h:48:3: note: no known conversion for argument 3 from â€˜boost::_bi::bind_t<std::basic_string<char>, boost::_mfi::cmf0<std::basic_string<char>, BaseObject>, boost::_bi::list1<boost::_bi::value<StaticObject*> > >â€™ to â€˜StringGetter& {aka boost::function<std::basic_string<char>()>&}â€™ olc.h:42:7: note: OlcStringEntry::OlcStringEntry(const OlcStringEntry&) olc.h:42:7: note: candidate expects 1 argument, 4 provided now, here's how I call it: AddOlc(new OlcStringEntry(std::string("name"), OF_NORMAL, boost::bind(&BaseObject::GetName, this), boost::bind(&BaseObject::SetName, this, _1))); baseobject's relevant methods look like: virtual std::string GetName() const; virtual void SetName(const std::string &s); and the relevant tidbits from olc.h: typedef boost::function<std::string()> StringGetter; typedef boost::function<void (const std::string&)> StringSetter; and OlcStringEntry's ctor looks like: OlcStringEntry(const std::string &name, FLAG flag, StringGetter& get, StringSetter& set); Any info here would be appreciated. Thanks, -- Take care, Ty http://tds-solutions.net The aspen project: a barebones light-weight mud engine: http://code.google.com/p/aspenmud He that will not reason is a bigot; he that cannot reason is a fool; he that dares not reason is a slave.

2 1

CSR graph and Dijkstra's to lower graph memory
by jer.k 08 Oct '12

08 Oct '12

Hello, This is my first post and I'm very new to BOOST, so please let me know if I have missed some of the mailing list etiquette :) When I run Dijkstra's on my graph, I quickly run out of memory and I'm trying to find ways to lower the memory needed to store the graph. My graphs has around ~3,600,000 nodes and ~580,000,000 edges (I will eventually need a graph at least 5x this number - more if possible). I only store a weight (double) at each edge (I don't need to store any information at each node) and find that while this only takes about 1.5 hrs to run, this takes up around ~95GB (I have access to a cluster so I can run these high memory jobs). I use an adjacency_list to store this graph. typedef adjacency_list < setS, vecS, undirectedS, no_property, property < edge_weight_t, double > > graph_t; My two questions are: 1) Is this a reasonable amount of memory to expect a graph of this size using an adjacency_list? Or am I doing some terribly wrong? This is much more memory needed than I expected. 2) From what I understand, the compressed sparse row (CSR) graph is a possible solution to lowering the memory requirements as I know the number of edges and the number of nodes prior to forming the graph. I've been going through the documentation and I followed this tread <http://boost.2283326.n4.nabble.com/Graph-On-Dijkstra-SSSP-performance-td444…> which had an example of using a CSR instead of an adjacency_list and running Dijkstra's. However I can't seem to get the last step (last reply by Jeremiah Willcock) of > "plus adding the weight map parameter explicitly > to the call to dijkstra_shortest_paths_no_color_map" to work successfully. I guess I'm not sure how to add the weigh map parameter to the Dijkstra's call. The following is the relevant code dealing with edge weights. ======= ... struct Edge_Cost { double weight;}; // Needed for bundled properties. Edge_Cost *edgeCosts = new Edge_Cost[2]; // Add 3 edges costs. edgeCosts[0].weight = (2.0); edgeCosts[1].weight = (5.2); edgeCosts[2].weight =(3.33); ... typedef compressed_sparse_row_graph<directedS, WebPage, // From the example docs on CSR Edge_Cost // The struct. > graph_t; graph_t g(boost::edges_are_unsorted, &the_edges[0], &the_edges[0] + numEdges, edgeCosts, // Add the weights here??? numNodes); ... boost::dijkstra_shortest_paths(g, // The graph. s, // VertexDescriptor - the source vertex. &p[0], &d[0], edgeCosts, // <--- WHAT DO I PUT HERE?? indexmap, std::less<int>(), closed_plus<int>(), (std::numeric_limits<int>::max)(), 0, default_dijkstra_visitor() ); ======= When I run this, I get several errors, the first is: error C2664: 'boost::get' : cannot convert parameter 2 from 'boost::detail::csr_edge_descriptor<Vertex,EdgeIndex>' to 'ptrdiff_t' c:\boost_1_49_0\boost_1_49_0\boost\graph\dijkstra_shortest_paths.hpp 162 I might be totally off here so please let me know :) Thanks! - Jeremy -- View this message in context: http://boost.2283326.n4.nabble.com/CSR-graph-and-Dijkstra-s-to-lower-graph-… Sent from the Boost - Users mailing list archive at Nabble.com.

4 9

Determining whether a key already exists in a labeled graph
by eric 08 Oct '12

08 Oct '12

Is there a way to tell if a labeled graph already contains a key? As I'm constructing my graph from database data, I would like to check whether a node's parent already exists, and if not create it. -- View this message in context: http://boost.2283326.n4.nabble.com/Determining-whether-a-key-already-exists… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Linking problem - boost 1.51
by Daniel Santos 07 Oct '12

07 Oct '12

Dear list, I'm starting with boost (Boost.Asio) and I'm following the tutorial available at Boost.Asio web-page. I'm stuck at part 5 (Timer.5) because I'm getting the following linker error: *timer_5.cpp:(.text+0xb3): undefined reference to `boost::thread::~thread()' * *timer_5.cpp:(.text+0xe1): undefined reference to `boost::thread::~thread()' * *collect2: error: ld returned 1 exit status* I'm linking boost_system, boost_thread and pthread (I compiled the boost libraries and at some point I thought that I was including .hpp files from a different version of the libraries but I specified the paths of both .hpp and libraries and the problem remains). The system runs GNU/Linux 64bits (Fedora 17) with GCC 4.7.2 and boost 1.51.0. Any idea? Thanks i advance, -- Daniel

2 4

[Sandbox - endian] Why is endian still in sandbox?
by Nathaniel J Fries 07 Oct '12

07 Oct '12

A fairly novel (at least when put up against more intricate labours like asio, filesystem, and their like) project which appears to be finished and would be a very useful companion to existing libraries sits in the sandbox. Is there a reason for this?

3 3

[exception,serialization] transporting exceptions
by Brian Budge 05 Oct '12

05 Oct '12

Hi all - I like that boost::exception provides a mechanism to copy exceptions. This can be used to transport an exception across thread boundaries, which is nice. I'm running a program that can optionally start nodes using MPI to do back-end computations. I'd like to be able to "copy" the exception from one node to another. Are there any existing tools for something like a serialization of these kinds of exceptions? In non-MPI mode, I'd like to transport the exception across thread boundaries, pass it through some functions (causing actions to be taken along the way), and then finally to rethrow the exception. In MPI mode I want all of that PLUS, in place of one of the function calls, I'd like to transport the exception across MPI in some way. Are there any semi-automatic tools already in existence that will get me this (or close)? Or do I need to implement boost serialization for my entire exception hierarchy? If I do the latter, it seems I will need to operator new the exception, and will not easily be able to know when I can delete in a catch? Thanks, Brian

2 3

Trouble w/ fruchterman-reingold
by eric 05 Oct '12

05 Oct '12

I'm seeing a weird problem in fruchterman_reingold.hpp that after the displacements are calculated for every vertex, it gets down to the loop where it updates the positions (starting on line 327), and all the displacements are (0,0) by that point (they had been sensible values up in the calculation loop). Any idea what I could be doing to cause that? Here is my code: struct spring_attractive_force { template<typename Graph, typename T> T operator()(typename graph_traits<Graph>::edge_descriptor, T k, T d, const Graph&) const { return d; } }; struct magnetic_repulsive_force { template<typename Graph, typename T> T operator()(typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, T k, T d, const Graph&) const { return 1 / (d * d); } }; typedef adjacency_list<listS, listS, undirectedS, // Vertex properties property<vertex_index_t, int, property<vertex_position_t, point> >, // Edge properties property<edge_weight_t, double> > Graph; enum {A, B, C, D, E, F, G, H}; simple_edge triangular_edges[14] = { {A, B}, {B, C}, {C, A}, {D, E}, {E, F}, {F, G}, {G, H}, {H, D}, {D, F}, {F, H}, {H, E}, {E, G}, {G, D} }; Graph g(&triangular_edges[0], &triangular_edges[13], 8); // Generate (x,y) coordinates for every node // - Randomly layout vertices of graph minstd_rand gen; rectangle_topology<> rect_top(gen, -25, -25, 25, 25); random_graph_layout(g, get(vertex_position, g), rect_top); // - Run Fruchterman Reingold algorithm on them typedef square_topology<> Topology; Topology topology(gen, 50.0); fruchterman_reingold_force_directed_layout(g, get(vertex_position, g), topology, attractive_force(spring_attractive_force()). repulsive_force(magnetic_repulsive_force()). force_pairs(all_force_pairs()). cooling(linear_cooling<double>(100))); -- View this message in context: http://boost.2283326.n4.nabble.com/Trouble-w-fruchterman-reingold-tp4636494… Sent from the Boost - Users mailing list archive at Nabble.com.

2 13

link errors with boost serialization
by xavier 05 Oct '12

05 Oct '12

I have just built boost_1_51_1 with no problems on linux redhat 5.5 64-bit machine However, when i try to link a program that uses the g++ client_test.o -rdynamic -L/opt/boost_1_51_0/stage/lib -lboost_serialization -lboost_wserialization -o client_test it gives the following error: client_test.o: In function `boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::extended_type_info_typeid_1()': client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEC1Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::extended_type_info_typeid_1()]+0x12): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::extended_type_info_typeid_0()' client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEC1Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::extended_type_info_typeid_1()]+0x27): undefined reference to `boost::serialization::extended_type_info::self_register()' client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEC1Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::extended_type_info_typeid_1()]+0x3a): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::~extended_type_info_typeid_0()' client_test.o: In function `boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::~extended_type_info_typeid_1()': client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionED0Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::~extended_type_info_typeid_1()]+0x1d): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::~extended_type_info_typeid_0()' client_test.o: In function `boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::~extended_type_info_typeid_1()': client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionED1Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::~extended_type_info_typeid_1()]+0x1d): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::~extended_type_info_typeid_0()' client_test.o:(.rodata._ZTVN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEE[vtable for boost::serialization::detail::extended_type_info_typeid_1<gps_position const>]+0x10): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::less_than(boost::serialization::extended_type_info const&) const' client_test.o:(.rodata._ZTIN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEE[typeinfo for boost::serialization::detail::extended_type_info_typeid_1<gps_position const>]+0x10): undefined reference to `typeinfo for boost::serialization::detail::extended_type_info_typeid_0 What could be causing the problem ? -- View this message in context: http://boost.2283326.n4.nabble.com/link-errors-with-boost-serialization-tp4… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Boost TraitsType Question
by Rawate, Vishal CIV NAVAIR-WD-5-2-7-1-1-0-E., 527110E 04 Oct '12

04 Oct '12

Hello, I am writing a function using templates in C++.I want to find the type of variable that is being to the function. I was wondering if I could use the Boost TypeTraits library or is there another library that I can use. I would highly appreciate any help. Thanking in advance. Vishal CodeSnipet: Template<typename T> Void setTag(T myVariable) { If(T == short) { Do something; } If(T == long) { Do something; } }

4 5