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

BGL: A* search & implicit graph
by Damien Maupu 01 Mar '10

01 Mar '10

Hi, Some weeks ago, I wrote on this mailing list, that I succeed achieving an A* search using an implicit graph. A Boost user emailed me to send him an example of my implementation. As the web is lacking of such example, I think the best place to send such example would be here as it might help others in the future. My example might not be the best, the most optimized or most well-coded. I am open to suggestions, corrections and comments. Let me know if something unclear. The code comes below. Few words to quickly explain the code: The goal is to A* search a graph (named m_SearchGraph) that grows (i.e. m_SearchGraph is implicit) based on another graph (named MyGraph). The search starts from 2D point (_startX, _startZ) and must get enough close (less than error "_epsilon") to 2D point (_goalX, _goalZ). The example is dumb and simply increment current position whatever the node in MyGraph (i.e. currX++, currZ++, currWeight += sqrt(2)). User need to adapt this dummy behavior depending on its needs (search for "//to change"). Most adaptations have to be done in "examine_vertex" (and also by providing ref/ptr to needed objects to the visitor constructor) PS: The implementation assumes both graphs are adjacency_list with "vecs" for both edges and vertices (in which a vertex/edge descriptor is equivalent to an "int", for my understanding) PS2: Id == descriptor (e.g. edgeId == edge_descriptor) ==================================================================================== ==================================================================================== astarSearch.h ==================================================================================== #ifndef ASTARSEARCH_H #define ASTARSEARCH_H #include <boost/graph/astar_search.hpp> #include "myGraph.h" class AStarSearch { public: AStarSearch(MyGraph * _myGraph); virtual ~AStarSearch(); bool findPath(MyGraph::VertexId _startMyGraphVertextId, double _startX, double _startZ, double _goalX, double _goalZ, double _epsilon); private: //search graph struct m_Vertex { m_Vertex() { currX = 0.0; currZ = 0.0; refMyGraphVertexId = -1; prevVertexId = -1; double inf = numeric_limits<double>::max BOOST_PREVENT_MACRO_SUBSTITUTION (); distance = inf; cost = inf; color = white_color; } //properties for heuristic / visitor double currX; double currZ; int refMyGraphVertexId; //reference to correspondant vertex in myGraph //properties required by astar_search_no_init(...) int prevVertexId; // == predecessor double distance; double cost; default_color_type color; }; struct m_Edge { m_Edge() { weight = 0.0; } double weight; }; //graph property = save the vertex id when goal is reached //saving goal vertex could be also saved by a reference to an int passed to the visitor class typedef property<graph_name_t, int> m_GraphProperty; typedef adjacency_list<vecS, vecS, directedS, m_Vertex, m_Edge, m_GraphProperty> m_SearchGraph; typedef graph_traits<m_SearchGraph>::vertex_descriptor m_VertexId; typedef graph_traits<m_SearchGraph>::edge_descriptor m_EdgeId; typedef graph_traits<m_SearchGraph>::vertex_iterator m_VertexIt; typedef graph_traits<m_SearchGraph>::adjacency_iterator m_AdjacencyIt; typedef graph_traits<m_SearchGraph>::edge_iterator m_EdgeIt; typedef graph_traits<m_SearchGraph>::out_edge_iterator m_OutEdgeIt; //heuristic class m_Heuristic : public astar_heuristic<m_SearchGraph, double> { public: m_Heuristic(m_SearchGraph & _searchGraph, double _goalX, double _goalZ); virtual ~m_Heuristic(); double operator()(m_VertexId _currVertexId); private: m_SearchGraph & m_searchGraph; double m_goalX; double m_goalZ; }; //exception to end search struct m_endSearch{}; //visitor class m_Visitor : public default_astar_visitor { public: m_Visitor(MyGraph * _myGraph, m_SearchGraph & _searchGraph, double _goalX, double _goalZ, double _epsilon); virtual ~m_Visitor(); void examine_vertex(m_VertexId _currVertexId, const m_SearchGraph & _graph); private: MyGraph * m_myGraph; m_SearchGraph & m_searchGraph; double m_goalX; double m_goalZ; double m_epsilon; }; void m_printSearchGraph(m_SearchGraph & _searchGraph); list<int> m_getPath(m_SearchGraph & _searchGraph, m_VertexId _vertexId); vector< list<int> > m_getAllPaths(m_SearchGraph & _searchGraph); void m_printPath(list<int> _path); void m_printShortestPath(m_SearchGraph & _searchGraph); void m_printAllPaths(m_SearchGraph & _searchGraph); MyGraph * m_myGraph; }; #endif ==================================================================================== ==================================================================================== ==================================================================================== aStarSearch.cpp ==================================================================================== ==================================================================================== #include "aStarSearch.h" AStarSearch::AStarSearch(MyGraph * _myGraph): m_myGraph(_myGraph) { } AStarSearch::~AStarSearch() { } bool AStarSearch::findPath(MyGraph::VertexId _startMyGraphVertextId, double _startX, double _startZ, double _goalX, double _goalZ, double _epsilon) { m_SearchGraph searchGraph; m_Heuristic heuristic(searchGraph, _goalX, _goalZ); m_Visitor visitor(m_myGraph, searchGraph, _goalX, _goalZ, _epsilon); //typedef property maps typedef property_map<m_SearchGraph, vertex_index_t>::type IndexMap; typedef property_map<m_SearchGraph, double m_Edge::*>::type WeightMap; typedef property_map<m_SearchGraph, int m_Vertex::*>::type PredecessorMap; typedef property_map<m_SearchGraph, double m_Vertex::*>::type DistanceMap; typedef property_map<m_SearchGraph, double m_Vertex::*>::type CostMap; typedef property_map<m_SearchGraph, default_color_type m_Vertex::*>::type ColorMap; //create property maps IndexMap indexMap = get(vertex_index, searchGraph); WeightMap weightMap = get(&m_Edge::weight, searchGraph); PredecessorMap predecessorMap = get(&m_Vertex::prevVertexId, searchGraph); DistanceMap distanceMap = get(&m_Vertex::distance, searchGraph); CostMap costMap = get(&m_Vertex::cost, searchGraph); ColorMap colorMap = get(&m_Vertex::color, searchGraph); double inf = numeric_limits<double>::max BOOST_PREVENT_MACRO_SUBSTITUTION (); double zero = double(); //add & init first vertex m_VertexId startVertexId = add_vertex(searchGraph); m_Vertex & startVertex = searchGraph[startVertexId]; startVertex.currX = _startX; startVertex.currZ = _startZ; startVertex.refMyGraphVertexId = _startMyGraphVertextId; startVertex.prevVertexId = startVertexId; startVertex.distance = zero; startVertex.cost = heuristic(startVertexId); try { astar_search_no_init(searchGraph, startVertexId, heuristic, visitor, predecessorMap, costMap, distanceMap, weightMap, colorMap, indexMap, std::less<double>(), std::plus<double>(), inf, zero); } catch(m_endSearch end) { m_printSearchGraph(searchGraph); m_printShortestPath(searchGraph); m_printAllPaths(searchGraph); return true; } return false; } AStarSearch::m_Heuristic::m_Heuristic(m_SearchGraph & _searchGraph, double _goalX, double _goalZ): m_searchGraph(_searchGraph), m_goalX(_goalX), m_goalZ(_goalZ) { } AStarSearch::m_Heuristic::~m_Heuristic() { } double AStarSearch::m_Heuristic::operator()(m_VertexId _currVertexId) { m_Vertex currVertex = m_searchGraph[_currVertexId]; return sqrt(pow(m_goalX - currVertex.currX, 2) + pow(m_goalZ - currVertex.currZ, 2)); //for A* search //return 0; //for BFS search } AStarSearch::m_Visitor::m_Visitor(MyGraph * _myGraph, m_SearchGraph & _searchGraph, double _goalX, double _goalZ, double _epsilon): m_myGraph(_myGraph), m_searchGraph(_searchGraph), m_goalX(_goalX), m_goalZ(_goalZ), m_epsilon(_epsilon) { } AStarSearch::m_Visitor::~m_Visitor() { } void AStarSearch::m_Visitor::examine_vertex(m_VertexId _currVertexId, const m_SearchGraph & _graph) { //get currVertex / currX / currZ m_Vertex currVertex = m_searchGraph[_currVertexId]; double currX = currVertex.currX; double currZ = currVertex.currZ; //check if goal is reached if(sqrt(pow(m_goalX - currX, 2) + pow(m_goalZ - currZ, 2)) < m_epsilon) { set_property(m_searchGraph, graph_name, _currVertexId); //_currVertexId == goal vertex id throw m_endSearch(); } //declare currMyGraphVertexId / nextMyGraphVertexId / currMyGraphEdgeId / currMyGraphEdge MyGraph::VertexId currMyGraphVertexId = currVertex.refMyGraphVertexId; MyGraph::VertexId nextMyGraphVertexId; MyGraph::EdgeId currMyGraphEdgeId; bool currMyGraphEdgeExists; MyGraph::Edge currMyGraphEdge; //declare newVertexId / newEdgeId / newEdge m_VertexId newVertexId; m_EdgeId newEdgeId; bool newEdgeCreated; //generate neighbors to currVertex MyGraph::OutEdgeIt outMyGraph_i, outMyGraph_end; for(tie(outMyGraph_i, outMyGraph_end) = out_edges(currMyGraphVertexId, *m_myGraph); outMyGraph_i != outMyGraph_end ; ++outMyGraph_i) { //get nexMyGraphVertexId / currMyGraphEdgeId / currMyGraphEdge nextMyGraphVertexId = target(*outMyGraph_i, *m_myGraph); tie(currMyGraphEdgeId, currMyGraphEdgeExists) = edge(currMyGraphVertexId, nextMyGraphVertexId, *m_myGraph); if(currMyGraphEdgeExists) currMyGraphEdge = (*m_myGraph)[currMyGraphEdgeId]; else exit(1); //add/set newVertex newVertexId = add_vertex(m_searchGraph); m_Vertex & newVertex = m_searchGraph[newVertexId]; newVertex.currX = currX + 1; //to change newVertex.currZ = currZ + 1; //to change newVertex.refMyGraphVertexId = nextMyGraphVertexId; newVertex.prevVertexId = newVertexId; //add/set newEdge tie(newEdgeId, newEdgeCreated) = add_edge(_currVertexId, newVertexId, m_searchGraph); if(newEdgeCreated) { m_Edge & newEdge = m_searchGraph[newEdgeId]; newEdge.weight = sqrt(2); //to change } else exit(1); } } void AStarSearch::m_printSearchGraph(m_SearchGraph & _searchGraph) { m_Vertex currVertex; m_VertexIt v_i, v_end; printf("id\t"); printf("id prev\t"); printf("id ref\t"); printf("dist\t"); printf("cost\t\t"); printf("color\t"); printf("\n"); for(tie(v_i, v_end) = vertices(_searchGraph); v_i != v_end; ++v_i) { currVertex = _searchGraph[*v_i]; printf("%i\t", *v_i); printf("%i\t", currVertex.prevVertexId); printf("%i\t", currVertex.refMyGraphVertexId); printf("%f\t", currVertex.distance); printf("%f\t", currVertex.cost); printf("%i\t", currVertex.color); printf("\n"); } printf("\n"); } list<int> AStarSearch::m_getPath(m_SearchGraph & _searchGraph, m_VertexId _vertexId) { list<int> path; for(m_VertexId currVertexId = _vertexId; ; //cf if()... break; below for stopping condition currVertexId = _searchGraph[currVertexId].prevVertexId) { path.push_front(currVertexId); if(_searchGraph[currVertexId].prevVertexId == int(currVertexId)) break; } return path; } vector< list<int> > AStarSearch::m_getAllPaths(m_SearchGraph & _searchGraph) { m_VertexIt v_i, v_begin, v_end; for(tie(v_i, v_end) = vertices(_searchGraph); v_i != v_end; ++v_i) { _searchGraph[*v_i].color = white_color; } vector< list<int> > allPaths; tie(v_begin, v_i) = vertices(_searchGraph); for(--v_i;; --v_i) { //printf("curr vertex %i\tcolor:%i\n", *v_i, _searchGraph[*v_i].color); if(_searchGraph[*v_i].color == white_color) { list<int> newPath = m_getPath(_searchGraph, *v_i); list<int>::iterator currVertex; for(currVertex = newPath.begin(); currVertex != newPath.end(); ++currVertex) { _searchGraph[*currVertex].color = black_color; } allPaths.push_back(newPath); } if(v_i == v_begin) break; } return allPaths; } void AStarSearch::m_printPath(list<int> _path) { list<int>::iterator pathIt; for(pathIt = _path.begin(); pathIt != _path.end(); ++pathIt) { printf("%i\t", *pathIt); } printf("\n"); } void AStarSearch::m_printShortestPath(m_SearchGraph & _searchGraph) { printf("shortest path:\n"); m_printPath(m_getPath(_searchGraph, get_property(_searchGraph, graph_name))); } void AStarSearch::m_printAllPaths(m_SearchGraph & _searchGraph) { vector< list<int> > allPaths = m_getAllPaths(_searchGraph); printf("all paths:\n"); vector< list<int> >::iterator currPath; for(currPath = allPaths.begin(); currPath != allPaths.end(); ++currPath) { m_printPath(*currPath); } } ==================================================================================== Cheers, Damien

2 1

Re: [Boost-users] multinomial tree-like container
by Hicham Mouline 01 Mar '10

01 Mar '10

-----Original Message----- From: "Hicham Mouline" [hicham(a)mouline.org] Date: 01/03/2010 10:53 AM To: boost-users(a)lists.boost.org Subject: Re: multinomial tree-like container Hello, Is there a library that provides a public container that has the structure of a tree where there are top nodes, and each node can have 0 to N children? regards, ----------------------------------------------------------------------------- I just found in the boost vault the tree-soc2006 container that seems exactly what I need. Has there been any changes since 2006 in that library? regards,

1 0

boost::asio::deadline_timer precision issues
by Warren Seine 01 Mar '10

01 Mar '10

Hi, I'm writing a timer class which calls a function every n ms. I'm using Boost.Asio to achieve that. Please tell me if there is a better solution. The usual pattern with boost::asio::deadline_timer is to call `expires_from_now()' and `async_wait()' every time the timer expires. The solution works, however the timer seems to have (important) precision issues, as described in the sample code below. A simple counter is incremented every 20 ms, and is displayed (and reset) every 1000 ms. The value displayed should therefore be close to 50. In practice, it's closer to 40, which in unexplainable with such a simple piece of code. $ cat test.cc #include <boost/asio/io_service.hpp> #include <boost/asio/deadline_timer.hpp> #include <boost/function.hpp> #include <boost/bind.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <iostream> static boost::asio::io_service* s_service = 0; static unsigned int s_counter = 0; struct timer { timer(unsigned int delay, boost::function< void () > callback) : m_timer(*s_service), m_callback(callback), m_delay(delay) { } void start() { m_timer.expires_from_now(boost::posix_time::millisec(m_delay)); m_timer.async_wait(boost::bind(&timer::handle_wait, this, _1)); } void handle_wait(const boost::system::error_code& e) { start(); m_callback(); } boost::asio::deadline_timer m_timer; boost::function< void () > m_callback; unsigned int m_delay; }; void increment() { s_counter++; } void display() { std::cout << s_counter << std::endl; s_counter = 0; } int main() { boost::asio::io_service service; s_service = &service; // Display the counter every 1000ms. timer t1(1000, display); // Increment the counter every 20ms. timer t2(20, increment); t1.start(); t2.start(); service.run(); } $ g++ test.cc -o test -lboost_system $ ./test 41 42 43 40 42 43 42 ^C My environment is GNU/Linux within a VM. My compiler is GCC 4.4 and I'm linking with Boost 1.42. Please ask me any detail that might be relevant. If that's an expected behavior, is there any way I can "trust" the timer? I couldn't find any documentation discussing the issue. Thanks, -- Warren Seine

2 3

multi index container descending order, without reverse iterator
by Andrew Kokkalis 01 Mar '10

01 Mar '10

Hello, I'm using a multi_index container, non uniquely ordered by a float. I want to access it by descending order, but when i'm using reverse iterator, i cannot use erase. Is there an way to delete the last element? it--; is not defined. erase(data_set.end()) does not work , end indicates after the last element. Thank you very much, i'm in great hurry, and i don't have time to look the tutorials right now. Thank you in advance, Andrew Kokkalis

2 1

[fusion] clarification on stateful unary function objects
by Matthias Vallentin 01 Mar '10

01 Mar '10

Hi there, While trying to use a stateful unary function objects, I stumbled over and old discussion from 2007 [1]. From the current Fusion documentation, I understand that the functor passed to the for_each algorithm must satisfy the Regular Callable Object concept. I presume that regularity, which I understand as replacing inputs with equal objects results in equal outputs, here implies that operator()(T& x) must be const. In other words, mutable function objects are not supported. As pointed out in [1], it is of course possible to bypass this restriction by defining the state that needs to changed as mutable. I was wondering if this is still the correct way to deal with mutable function objects, as illustrated in the small example below: #include <iostream> #include <string> #include <boost/bind.hpp> #include <boost/fusion/include/algorithm.hpp> #include <boost/fusion/include/container.hpp> struct container { struct printer { template <typename T> void operator()(T& x) const { std::cout << ++i << ": " << x << std::endl; } mutable unsigned i; }; template <typename T> void write(const T& row) { boost::fusion::for_each(row, printer()); } }; int main() { int i = 42; unsigned j = 7; std::string s = "foo"; container c; c.write(boost::fusion::vector_tie(i, j, s)); return 0; } Matthias [1] http://lists.boost.org/boost-users/2007/03/26338.php -- Matthias Vallentin vallentin(a)icsi.berkeley.edu http://www.icir.org/matthias

2 2

Re: [Boost-users] [GIL new_io] range of gil floating point images
by Robert Lupton the Good 01 Mar '10

01 Mar '10

> Float and double are perfectly valid GIL channels, but their scope is ?inf to inf, so you cannot linearly interpolate from a float to an uint8, for example. Thus they are not as useful as bits32f This has been a nuisance for us too --- we use gil to represent data from a telescope, where the scaling is a real pain as the floating point numbers represent the data read from the detectors. It'd be nice if gil came with the needed typedefs for pure floating (32 and 64 bit) images/views (as well as the ones that scale in [0,1] which are presumably what others want). It's too late to call the unscaled types 32f, but isn't 32F still available? R

1 0

[ptr_container] view_clone_allocator with associative containers
by Matthias Vallentin 01 Mar '10

01 Mar '10

I cannot get the view_clone_allocator to work with associative containers, as in the example below: boost::ptr_vector<int> vec; boost::ptr__map<std::string, int, boost::view_clone_allocator> map; int* i = new int(42); vec.push_back(i); std::string k("foo"); map.insert(k, i); >From the error message, it seems that the CloneAllocator is still of type boost::heap_clone_allocator. Why is this failing? It seems intuitive to specify the allocator as third parameter, similar to the example with ptr_vector where the allocator is the second argument. Matthias -- Matthias Vallentin vallentin(a)icsi.berkeley.edu http://www.icir.org/matthias

2 2

array definition
by Damien MATTEI 01 Mar '10

01 Mar '10

hello, i have this definition that works: array_2D_double psf_cartesian_centered(boost::extents[range_ext(indiceBegin,indiceEnd+1)][range_ext(indiceBegin,indiceEnd+1)]); but i want to use this writing to improve reading of my code in a more natural way: array_2D_double psf_cartesian_centered2[ boost::indices[indiceBegin <= array_2D_double::index_range() < indiceEnd][indiceBegin <= array_2D_double::index_range() < indiceEnd] ]; unfornunately this does not work , i read one hundred times the boost tutorial and documention qhere it is written something like this should ... what is my error? regards, damien

1 0

Have Boost random Library contained the function for generating Gaussian noise ? Can any one with kindness help me?
by fmingu 01 Mar '10

01 Mar '10

I am a new comer and using Boost library for math works. I want to know whether Boost Random Library contained the function for generating Gaussian noise. Or Gaussian noise can be easily generated by the functions in Boost Random Library? Or any other library compatible with the Boost Random Library? Can any one with kindness help me?

2 1

best boost cc-mode style
by Russell L. Carter 01 Mar '10

01 Mar '10

Hi folks, I'm starting to get heavy into templates and it seems my ancient cc-mode customizations are a disaster when trying to format complicated template code. I'm now using emacs23 with cc-mode version 5.31.7. What's the best out-of-the-box cc-mode style for boost style template formatting? (Some googling revealed that Dave A. a long time ago made some mods to cc-mode, what style did they end up in?) tnks, Russell

1 0

[Exceptions] Custom type in error_info value?
by Andrew Chinkoff 01 Mar '10

01 Mar '10

This is the test program I would like to be explained to me: #include <iostream> #include <string> #include <boost/exception.hpp> struct MyException: virtual boost::exception{ }; class MyClass { char* s; public: MyClass(const char* msg) : s(strdup(msg)){ } MyClass(const MyClass& c){ s = strdup(c.s); } ~MyClass(){ free(s); } }; void main() { MyException ex; ex << boost::error_info<struct my_tag1, MyClass>("qweqwe"); ex << boost::error_info<struct my_tag2, std::string>("asdasd"); std::cout << boost::diagnostic_information(ex); } This is the program output: > Throw in function (unknown) > Dynamic exception type: struct MyException > [PAUmy_tag1@?1?main@] = [ type: ?AV?$error_info@Umy_tag1@?1?main@VMyClass @@@boo > t@@, size: 8, dump: 50 69 10 01 b8 18 7f 00 ] > [PAUmy_tag2@?1?main@] = asdasd So, my question: what should I do with 'MyClass' to see the output like this: > Throw in function (unknown) > Dynamic exception type: struct MyException > [PAUmy_tag2@?1?main@] = qweqwe (Wow !!! Terrible dump is replaced with readable string here !!!???) > [PAUmy_tag2@?1?main@] = asdasd Thanks, Andrew.

2 2

boost test: How to make boost test a friend ?
by Avi Bahra 01 Mar '10

01 Mar '10

I am looking into boost test. I dont not want to expose some member functions as public. However I need to access them for testing, is there any way making boost test a friend of this class ? Any help appreciated. Best regards, Ta, Avi

3 2

asio guidance
by Paul Dugas 28 Feb '10

28 Feb '10

I'm writing code to implement an existing communication protocol that uses a packet with a fixed header and variable payload (depending on a header field). I started using a previously recorded file and fstream::read() calls; i.e. read(buf,1) looking for the start-of-packet, read(buf, HEADER_LEN), extract the payload size and read the remainder. I am now looking to hook up the receiver logic to the actual gear and need to handle timeouts and such. I'm new to asio but it looks like what I may need given that I have to support device connections via serial ports and sockets but I also need to retain the ability to read from files. I'm wondering if anyone could suggest an approach to support all three comm schemes with the same packet reception logic. The idea would be for the receive routine to return message pointers or throw on timeouts or partial packets Paul

3 3

[lambda]
by Marcin Zalewski 28 Feb '10

28 Feb '10

I am trying to use lambda's constructor [1] with fusion's fused [2]. Fused requires that the function object passed to it has a following valid expression: boost::result_of< F(T1 ...TN) >::type Unfortunately, constructor does not support result_of. Its implementation contains the following piece of code: template <class U> struct sig { typedef T type; }; This happens to be exactly what's necessary for constructor to support result_of, but sig would have to be renamed to result. I guess I do not really have a question here but rather a request to make constructor compatible with result_of. There seems to be no reason not to do it, and I could not figure out a much nicer way to construct objects with fusion sequences than combining lambda's constructor and fusion's fused. It comes so close, but if only sig was result... Cheers, Marcin [1] http://www.boost.org/doc/libs/1_42_0/doc/html/lambda/le_in_details.html#lam… [2] http://www.boost.org/doc/libs/1_42_0/libs/fusion/doc/html/fusion/functional…

4 9

Problems with property_maps
by Trevin Murakami 28 Feb '10

28 Feb '10

Hello all. I'm having issues getting property maps to work properly with my custom adjacency_list. Here's a snippet of the code: // Definitions // define some of the properties the graphs will have // http://www.boost.org/doc/libs/1_42_0/libs/graph/doc/using_adjacency_list.ht… struct posx_t { typedef vertex_property_tag kind; }; struct posy_t { typedef vertex_property_tag kind; }; typedef property<posx_t, int> VertexPosX; // chain to add in posy typedef property<posy_t, int, VertexPosX> VertexPos; // chain to add in vertex_index typedef property<vertex_index_t, int, VertexPos> VertexProperty; // define our special graph typedef adjacency_list<listS, listS, undirectedS, VertexProperty, property<edge_weight_t, int> > AGraph; ... template<class T> void boostToVAGraph(const AGraph & g, const int num_nodes, const int num_edges, T ** idata, T ** odata, unsigned int ** segment_descriptor, unsigned int ** cross_pointers, unsigned int ** head_flags, T ** reference, const testrigOptions & testOptions) { typedef AGraph Graph; // define the manipulator for our special properties // http://www.boost.org/doc/libs/1_42_0/libs/graph/doc/using_adjacency_list.ht… // requires property_map.hpp // BROKEN!!!!! property_map<AGraph, posx_t>::type getposx = get(posx_t(), g); property_map<AGraph, posy_t>::type getposy = get(posy_t(), g); ... I used another function to generate the AGraph and apply values. And using property map there seems to work. However, I then pass it to this function using: boostToVAGraph(g, num_nodes, num_edges, idata, odata, segment_descriptor, cross_pointers, head_flags, reference, testOptions); On compile, I get this error: 1>agraph.cpp 1>c:/Documents and Settings/All Users/Application Data/NVIDIA Corporation/NVIDIA GPU Computing SDK/C/src/test/agraph.cpp(94) : error C2440: 'initializing' : cannot convert from 'boost::adj_list_vertex_property_map<Graph,ValueType,Reference,Tag>' to 'boost::adj_list_vertex_property_map<Graph,ValueType,Reference,Tag>' 1> with 1> [ 1> Graph=AGraph, 1> ValueType=int, 1> Reference=const int &, 1> Tag=posx_t 1> ] 1> and 1> [ 1> Graph=AGraph, 1> ValueType=int, 1> Reference=int &, 1> Tag=posx_t 1> ] 1> No constructor could take the source type, or constructor overload resolution was ambiguous Ideas? -Trevin "new to Boost" Murakami

2 2

[Review] ITL review extended until March 7th
by Hartmut Kaiser 28 Feb '10

28 Feb '10

Hey all, After getting the approval from our review wizards we decided to extend the review period of Joachim Faulhabers ITL library until March 7th, 2010. That should give everybody some more time to finish their reviews. Regards Hartmut --------------- Meet me at BoostCon www.boostcon.com

1 0

[TR1] Using Boost.TR1 installed in /usr/include with GCC
by Anthony Foglia 28 Feb '10

28 Feb '10

We're running into problems compiling the boost math library with GCC's TR1. The problem comes from Boost.TR1, and I believe the #include_next preprocessor directive. We are using the Ubuntu packages for g++ and for Boost 1.40 which installs the headers in /usr/include/boost. Here's a simple example which fails to compile: ---- #define BOOST_HAS_TR1_TUPLE 1 #include <boost/tr1/tuple.hpp> int main() { return 0; } ---- $ g++ -I/usr/include -c -o tr1_test.o tr1_test.cpp In file included from tr1_test.cpp:2: /usr/include/boost/tr1/tuple.hpp:13:43: error: no include path in which to search for tr1/tuple ---- From the docs, defining BOOST_TR1_DISABLE_INCLUDE_NEXT should work, but does not. I have tried inserting the following lines before the #include, to no effect. #define BOOST_TR1_DISABLE_INCLUDE_NEXT #define BOOST_TR1_GCC_INCLUDE_PATH /usr/include/c++/4.4 The only workaround I could find is to explicitly include boost/tr1/detail/config.hpp and undef BOOST_HAS_INCLUDE_NEXT. Am I missing something in the documentation? What is the proper solution? PS: I see a similar problem mentioned over a year ago: <http://lists.boost.org/Archives/boost/2008/12/146552.php>. But would the changes mentioned have been included in 1.40? I see no obvious changes between trunk and 1.40 for the tuple and config headers, though I haven't diffed them. -- Anthony Foglia Princeton Consultants (609) 987-8787 x233

2 1

Re: [Boost-users] [serialization] class versioning changes in boost 1.42 [patch]
by Brian Wood 28 Feb '10

28 Feb '10

Robert Ramey writes: >David Raulo wrote: > >> - this is not mentionned anywhere in the documentation or in the API. >> - you have at least one user who lost backward archive compatibility >> because of this. >> >> See below a patch against svn. Can we please discuss its advantages >> and drawbacks? >> - what good does it do: obviously in my case, restore backward >> compatibility. > > Why can't you just patch your own copy? > >From a comedic standpoint I think that's a good answer. >> - it gives more flexibility to the versioning scheme. Two usefull >> such schemes were described previously in the discussion, where >> classes still have increasing integer versions, but are not possible >> with 8 bits storage. >> >> - what downsides does appying this patch have? Maybe occuring a >> slight overhead on 16-bits platforms? If true, can this be actually >> measured? >> - Would this patch cause any regression? Break any user code which was >> working fine before? Break user archive backward compatibilty? >> > > Would this not break compatibility with binary_?archive ? > Currently binary archive stores the version as a 16 bit > integer. Maybe it wouldn't but it's another thing that would > have to be considered. Even if it didn't, this would break > the "guarentee" that any serialization which works for one > archive class is guarenteed to work with any other one. I've wondered if Robert deliberately misspells guarantee in order to emphasize that there is no guarantee. -- Brian Wood Ebenezer Enterprises http://www.webEbenezer.net (651) 251-9384

3 3

Re: [Boost-users] TR1 unordered_set: compilation failure with initialization
by Aman Sinha 28 Feb '10

28 Feb '10

I want to pass in my own hash functor and comparator to an unordered_set initialization. It fails compilation on g++ 4.2.1, boost version 1.42. It's not clear why, since a similar initialization of an STL set container seems to work fine... see below for the code and compilation failure. Any insight would be highly appreciated. #include <set> #include <boost/tr1/unordered_set.hpp> class foo_compare { public: foo_compare(bool is_gt) : m_is_gt(is_gt) {} bool operator() (int a, int b) { if (m_is_gt) return a > b; else return a < b; } bool m_is_gt; }; class foo_hash1 { public: foo_hash1() {} ~foo_hash1() {} size_t operator() (int val) const { return val % 19; } }; using namespace std; typedef set<int, foo_compare> MySetT; typedef std::tr1::unordered_set<int, foo_hash1, foo_compare> MyUnorderedSetT; size_t hash_func_1(int val) { return val % 19; } class Foo { public: Foo(bool is_gt) : m_set(foo_compare(is_gt)), // this initialization is OK m_unordered_set(foo_hash1() , // this one fails compilation! why ? foo_compare(is_gt)) {} MySetT m_set; MyUnorderedSetT m_unordered_set; }; int main() { bool is_greater_than = true; Foo myfoo(is_greater_than); return 0; } g++ my_unordered.cpp -I ~/temp/boost_1_42_0 my_unordered.cpp: In constructor Foo::Foo(bool)â: my_unordered.cpp:43: error: no matching function for call to âboost::unordered_set<int, foo_hash1, foo_compare, std::allocator<int> >::unordered_set(foo_hash1, foo_compare)â /home/asinha/temp/boost_1_42_0/boost/unordered/unordered_set.hpp:175: note: candidates are: boost::unordered_set<T, H, P, A>::unordered_set(boost::unordered_detail::move_from<boost::unordered_set<T, H, P, A> >) [with T = int, H = foo_hash1, P = foo_compare, A = std::allocator<int>] /home/asinha/temp/boost_1_42_0/boost/unordered/unordered_set.hpp:121: note: boost::unordered_set<T, H, P, A>::unordered_set(const boost::unordered_set<T, H, P, A>&, const A&) [with T = int, H = foo_hash1, P = foo_compare, A = std::allocator<int>] /home/asinha/temp/boost_1_42_0/boost/unordered/unordered_set.hpp:115: note: boost::unordered_set<T, H, P, A>::unordered_set(const A&) [with T = int, H = foo_hash1, P = foo_compare, A = std::allocator<int>] /home/asinha/temp/boost_1_42_0/boost/unordered/unordered_set.hpp:110: note: boost::unordered_set<T, H, P, A>::unordered_set(size_t, const H&, const P&, const A&) [with T = int, H = foo_hash1, P = foo_compare, A = std::allocator<int>] /home/asinha/temp/boost_1_42_0/boost/unordered/unordered_set.hpp:43: note: boost::unordered_set<int, foo_hash1, foo_compare, std::allocator<int> >::unordered_set(const boost::unordered_set<int, foo_hash1, foo_compare, std::allocator<int> >&) Aman Sinha

2 2

complexity problem using multi_index insert()
by Andrew Kokkalis 28 Feb '10

28 Feb '10

Hello, this is my third e-mail regarding multi_index containers. I'm using them for the process of clustering a huge amount of data (posts from an aple blog from the last 4-5 years) I'm counting Euclidean distance between two clusters, which I store in a multi_index container like the above *typedef multi_index_container< cluster_d, indexed_by< ordered_unique< tag<cluster_pair>, composite_key< cluster_d, BOOST_MULTI_INDEX_MEMBER(cluster_d, int, cluster1), BOOST_MULTI_INDEX_MEMBER(cluster_d, int, cluster2)> >, ordered_non_unique< tag<cluster_distance>, BOOST_MULTI_INDEX_MEMBER(cluster_d, float, distance)> > > cluster_index;* My problem is that I have to count 9500! (! = factorial) distances, and store them in the multi_index container. The process of counting distances is costing me 13minutes ( that is because the dimension of each of the two vectors is nearly 1000 or more for which i have to access STL's maps). Another 9 minutes takes the insertion using "std::pair<iterator,bool> insert(const value_type& x);". I would like to know if there is another way to do faster insertion. I've seen you use mailing list for much complicated problems, and I'm sorry for being a noob.But since i chose to use boost I'd like to stick with that, so I'm kindly asking for your help! Thank you in advance Andrew Kokkalis

4 10

[units] conversion_factor in the two directions
by alfC 28 Feb '10

28 Feb '10

Hi, I managed to make CONVERSION_FACTOR definitions to work between to unit systems (atomic and SI). I definied atomic system by following the si example. I can manage to transform lengths (probably because they are base dimensions in both systems, but when I try to do the same for energies (that is a base_dimension only in the atomic system) I can't compile the line with the declaration "en3". The first question is why the first ...CONVERSION_FACTOR doesn't work in the two directions (as it did for lengths). second, why the second ...CONVERSION_FACTOR doesn't help to compile en3. BOOST_UNITS_DEFINE_CONVERSION_FACTOR( atomic::hartree_energy_base_unit, si::energy, double, 4.359744e-18 ); //compiles but doesn't help for en3 BOOST_UNITS_DEFINE_CONVERSION_FACTOR( si::energy, atomic::hartree_energy_base_unit, double, 1./4.359744e-18 ); int main(){ quantity<si::length> l1(1.*si::meter); //works quantity<si::length> l2(1.*atomic::bohr); //works quantity<atomic::length> l3(1.*atomic::bohr); //works quantity<atomic::length> l4(1.*si::meter); //works quantity<si::energy> en1(1.*si::joules); //works quantity<si::energy> en2(1.*atomic::hartree); //works quantity<atomic::energy> en3(1.*atomic::hartree); //work quantity<atomic::energy> en4(1.*si::joules); //does not work, compilation error return 0; } Thank you, Alfredo

2 6

Compile boost for arm-eabi
by Carlos 28 Feb '10

28 Feb '10

Hi How I could compile boost for another arquitecture? I thougth I have done it right, but when compiling my program with a static link to a boost library I'm getting this message: /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /home/carlos/Arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: /usr/local/boost_1_42_0/lib/libboost_system.a(error_code.o): Relocations in generic ELF (EM: 3) /usr/local/boost_1_42_0/lib/libboost_system.a: could not read symbols: File in wrong format collect2: ld returned 1 exit status I'm getting around this problem and I found that it might be because I don't compile boost in the right way. Any ideias how I do that?

3 5

Re: [Boost-users] Compile boost for arm-eabi (Carlos)
by Nikolai Burtsev 28 Feb '10

28 Feb '10

> How I could compile boost for another arquitecture? I know this is not the right way for cross-compile the boost libs, but it works (i have used it for boost-41) cd to boost libraries and create software links there: ln -s /opt/crosstools/bin/arm-linux-g++ g++ ln -s /opt/crosstools/bin/arm-linux-ar ar ln -s /opt/crosstools/bin/arm-linux-ranlib ranlib ln -s /opt/crosstools/bin/arm-linux-as as ln -s /opt/crosstools/bin/arm-linux-ld ld set your PATH export PATH= ". :$PATH" then build it (as it was for gcc)

1 0

[spirit] need advise for parsing a set of integer alternatives
by Zhi Tan 28 Feb '10

28 Feb '10

say I am parsing a message in this format: 2-byte message length + 2-byte instruction code + message body, where the 2-byte instruction code is a predefined set of constants, e.g. 0x01, 0x01234 etc. I could use this parser: short_>>short_>>*char_. and resort to the attributes of short_in a post-check to check whether the instruction code is legal or not . what if I want to embed the legal instruction code set in the parser itself, and determine whether this is a legal message at one go? .i.e. short_>>(what to put here)>>*char? Thanks.

1 0

BOOST_AUTO_TEST_CASE_EXPECTED_FAILURES and BOOST_FAIL
by Rhys Ulerich 27 Feb '10

27 Feb '10

Is there a way to flag that a Boost.Test auto test case is expected to utterly fail per BOOST_FAIL? BOOST_AUTO_TEST_CASE_EXPECTED_FAILURES does not seem to handle this use case correctly. Running Boost.Test 1.42's example 22 [1] returns EXIT_SUCCESS to the operating system. When I replace BOOST_CHECK with BOOST_FAIL within the sample's my_test1 test case the binary returns EXIT_FAILURE to the OS. I have attached the modified version. I see the same behavior for BOOST_REQUIRE_MESSAGE(false,...). The question arises because I'm using BOOST_FAIL within an error handling callback that I provide to a library. When the library issues the callback, all hope is lost and I need to unwind the test case to continue sanely. Thanks, Rhys [1] http://www.boost.org/doc/libs/1_42_0/libs/test/doc/html/utf/user-guide/test…

2 1

unordered_map: user object as key
by André Santee 27 Feb '10

27 Feb '10

I know it has probably been asked a million times here, but I couldn't find any example that I could use. I want to create an unordered_map whose key is an object that I made (vector2), what's the best way of implementing a hash function to it? Can I have an example? struct vector2 { vector2(); vector2(const vector2 &v2); vector2(float fx, float fy); vector2 operator * (float num) const; vector2 operator * (const vector2& v2) const; vector2 operator / (float num) const; vector2 operator / (const vector2& v2) const; vector2 operator - (float num) const; vector2 operator - (const vector2& v2) const; vector2 operator + (float num) const; vector2 operator + (const vector2& v2) const; bool operator == (const vector2& v2) const; bool operator != (const vector2& v2) const; vector2& operator += (const vector2& v2); vector2& operator -= (const vector2& v2); vector2& operator *= (float f); vector2& operator /= (float f); float x,y; }; boost::unordered_map<vector2, int> won't work.

3 4

[Boost MPI]Problems with the installation of boost MPI
by Juliet Villanueva 27 Feb '10

27 Feb '10

Hi: I intet mpi program in boots, but when trying to compile a program, tells me that I need libs some one is libboost_mpi-vc90-mt-gd-1_40. lib, which tells me that is not installed, trying MPI boost installing again, I realized, that performs all the library facilities, but skips the installation of boost MPI do not know if someone could tell me step by step which is what I do to boost MPI install, from scratch, because I have almost 3 months trying to install it without success, another of my concerns is if I can install on a Windows XP, Vista, windows 7 and windows server and I have read some pages and tell me that I can only install on windows server This result also gave me hope I can help. Juliet Encuentra las mejores recetas en Yahoo! Cocina. http://mx.mujer.yahoo.com/cocina/

3 2

How to get return value of scoped_try_lock (boost:thread)
by David Kaplan 27 Feb '10

27 Feb '10

How do I know if my scoped_try_lock has been successful? I notice there is a try_lock non-member function, but that's not a scoped trylock is it?

2 3

[filesystem] Using basic_path in char-type generic code
by Adam Badura 27 Feb '10

27 Feb '10

I have a char-type generic function (character type is template argument). I use only char and wchar_t character types with this function and I don't care for other character types. I wanted to use basic_path in that function so that I will get either path or wpath depending on the template argument. But I failed to do that since basic_path has second template argument (Traits) which - as opposed to basic_string - does not default to anything. Even more, there is no (or at least documentation does not mention that) default path_traits template which could be parametrized with the desired character type. Why is it so? How to overcome it (otherwise then writing my own auxiliary type selector)? (I am using version boost 1.39 and will - hopefully, if it will correct compilation errors - switch to 1.43 when it will be released.) Adam Badura

3 3

[Review] ITL review planned to end tomorrow, February 28th
by Hartmut Kaiser 27 Feb '10

27 Feb '10

Hey all, We're almost at the planned end of Joachim Faulhabers ITL review (see the original review announcement here: http://comments.gmane.org/gmane.comp.lib.boost.announce/253) Now would be a good time to submit your reviews. If you need more time, please let me know. Regards Hartmut --------------- Meet me at BoostCon www.boostcon.com

1 0

Re: [Boost-users] boost::asio::read_until w/ boost::function
by marty 27 Feb '10

27 Feb '10

Thanks for your response. I've sidestepped the issue by implementing a workaround. Thus, I'm not desperate to get this working (or upgrade the compiler). However, I've confirmed that this behavior is still present in boost 1.42.0 so perhaps it should be filed as a bug... or at least, docs should warn about 3.4.6 incompatibilities. > AMDG > > marty wrote: > >> Thanks for your input. Unfortunately; no dice. It still doesn't >> compile (below), and the error(also below) provides little insight in >> my relatively inexperienced assessment. I have a feeling that the >> enable_if mechanism is not behaving properly on my particular system. >> > > It isn't the enable_if per se that is causing the problem. > is_match_condition doesn't seem to work > properly. > > >> (the fact that others have successfully compiled this implies that the >> boost::function must have the correct signature to satisfy the >> enable_if....) >> >> >> ----error >> >> /usr/local/include/boost/asio/read_until.hpp:60: error: enumerator >> value for `value' not integer constant >> ../src/temp.cpp: In constructor `MyClass::MyClass()': >> > > The compiler doesn't seem to like the implementation of has_result_type > here. > > >> I'm following up my original post with some actual code an interested >> person might try to compile, as well as the specific errors I'm getting. >> boost 1.41.0, gcc 3.4.6 >> > Can you use a more recent compiler? > > It also /might/ work if you replace has_result_type with > BOOST_MPL_HAS_XXX_TRAIT_DEF(result_type) > and add #include <boost/mpl/has_xxx.hpp>. > > In Christ, > Steven Watanabe >

1 0

1.39 serialisation: buggy warning message for shared_ptr
by Avi Bahra 27 Feb '10

27 Feb '10

When I want to serialise a vector of shared ptrs to concrete types, there are no warnings on gcc/Linux. and program runs correctly. However when I compile on HP-UX, I get the following: .../boost_1_39_0/boost/serialization/export.hpp", line 137: warning #2414-D: delete of pointer to incomplete class BOOST_STATIC_WARNING(boost::is_polymorphic<T>::value); .... It appears that boost shared ptr serialisation has made the assumption that the pointer must be polymorphic! Is this assumption correct ? i.e are we allowed to serialize shared ptrs to concrete types ? To get rid of the message I simply add a virtual member function. It appears in this case that HPUX compiler is more accurate, and I don't understand why this same warning does not appear with gcc. Best regards, Ta, Avi

3 2

Re: [Boost-users] [C++-sig] Boost python exception translation failure on BlueGene/P
by James Amundson 26 Feb '10

26 Feb '10

On 02/18/2010 04:24 PM, James Amundson wrote: > Boost Python seems to be failing to catch and translate C++ exceptions > for me on a BlueGene/P installation. I really don't know what to do > next in debugging the problem, so I would appreciate any advice. I have finally solved this problem myself -- I am responding to my own message on these mailing lists in case this information is useful to others. In the end the solution was to add the flag "-dynamic" to the libboost_python link line. Without the flag, boost::python mostly works on BlueGene/P, but exceptions are not caught. With the flag, boost_python passes all tests I have done. I spent some time trying to understand how to tell bjam to add a flag to the boost_python link line, but I gave up after about fifteen minutes. With the CMake build of boost, it was easy: I simply did cmake -DCMAKE_SHARED_LINKER_FLAGS="-dynamic" Overall, I found dealing with the cmake build of boost so much more pleasant than dealing with bjam that I don't understand why the CMake build hasn't taken over the mainstream yet. --Jim Amundson P.S. The original problem report: > I have a simple test module, pyexcept > ------------------------------------------------------------ > #include <boost/python.hpp> > #include <iostream> > #include <stdexcept> > > > void > foo() > { > std::cout << "in foo, about to raise exception\n"; > throw std::runtime_error("runtime_error from foo"); > std::cout << "this should never be seen\n"; > } > > using namespace boost::python; > > BOOST_PYTHON_MODULE(pyexcept) > { > def("foo",foo); > } > ------------------------------------------------------------ > > I test it with the following python script: > ------------------------------------------------------------ > #!/usr/bin/env python > > import pyexcept > > print "about to run pyexcept.foo, catching exception" > try: > pyexcept.foo() > except RuntimeError,e: > print "caught RuntimeError,",e > ------------------------------------------------------------ > > On my Linux machine I see: > ------------------------------------------------------------ > about to run pyexcept.foo, catching exception > in foo, about to raise exception > caught RuntimeError, runtime_error from foo > ------------------------------------------------------------ > > On the BlueGene/P machine I see: > ------------------------------------------------------------ > about to run pyexcept.foo, catching exception > in foo, about to raise exception > terminate called after throwing an instance of 'std::runtime_error' > what(): runtime_error from foo > ------------------------------------------------------------ > > I have (cross-)compiled boost myself using the system's installed > version of the gnu compilers, 4.1.2: > ------------------------------------------------------------ > |login2>mpicxx.gnu --version > powerpc-bgp-linux-g++ (GCC) 4.1.2 (BGP) > ------------------------------------------------------------ > > (The mpicxx.gnu script is a wrapper around the cross-compiling g++.) > Has anyone seen a problem like this? Any ideas as to how to debug it? > > Thanks for any advice. > > --Jim Amundson > > _______________________________________________ > Cplusplus-sig mailing list > Cplusplus-sig(a)python.org > http://mail.python.org/mailman/listinfo/cplusplus-sig

3 2

Static link boost library using arm compiler
by Carlos 26 Feb '10

26 Feb '10

Hi I'm some weeks trying to resolve a problem in static linking a boost library. The compiler finds the library but it says that it is incompatible. I already try to compile boost again with arm compiler, use boost 1_33_1 and boost_1_42_0 but with no results. I think it's missing something but I can't find what. ./configure -host=arm-eabi CC=arm-none-linux-gnueabi-gcc CXX=arm-none-linux-gnueabi-g++ CXXFLAGS=-static --with-boost=/usr/local/boost_1_42_0/ configure: WARNING: If you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used. checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for arm-eabi-strip... no checking for strip... strip checking for a thread-safe mkdir -p... /bin/mkdir -p checking for gawk... no checking for mawk... mawk checking whether make sets $(MAKE)... yes checking for arm-eabi-gcc... arm-none-linux-gnueabi-gcc checking for C compiler default output file name... a.out checking whether the C compiler works... yes checking whether we are cross compiling... yes checking for suffix of executables... checking for suffix of object files... o checking whether we are using the GNU C compiler... yes checking whether arm-none-linux-gnueabi-gcc accepts -g... yes checking for arm-none-linux-gnueabi-gcc option to accept ISO C89... none needed checking for style of include used by make... GNU checking dependency style of arm-none-linux-gnueabi-gcc... gcc3 checking whether we are using the GNU C++ compiler... yes checking whether arm-none-linux-gnueabi-g++ accepts -g... yes checking dependency style of arm-none-linux-gnueabi-g++... gcc3 checking for boostlib >= 1.31... yes checking build system type... i686-pc-linux-gnu checking whether the Boost::Thread library is available... yes checking for exit in -lboost_thread... no checking for exit in -lboost_thread... (cached) no checking for exit in -lboost_thread... (cached) no configure: error: Could not link against boost_thread ! * Config.log:* configure:4066: checking whether the Boost::Thread library is available configure:4098: arm-none-linux-gnueabi-g++ -c -pthread -static -I/usr/local/boost_1_42_0//include conftest.cpp >&5 configure:4098: $? = 0 configure:4113: result: yes configure:4142: checking for exit in -lboost_thread configure:4167: arm-none-linux-gnueabi-gcc -o conftest -g -O2 -I/usr/local/boost_1_42_0//include -L/usr/local/boost_1_42_0//lib conftest.c -lboost_thread >&5 conftest.c:20: warning: conflicting types for built-in function 'exit' /home/carlos/arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: skipping incompatible /usr/local/boost_1_42_0//lib/libboost_thread.so when searching for -lboost_thread /home/carlos/arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: skipping incompatible /usr/local/boost_1_42_0//lib/libboost_thread.a when searching for -lboost_thread /home/carlos/arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: skipping incompatible /home/carlos/arm/arm-2009q3/bin/../arm-none-linux-gnueabi/libc/usr/lib/libboost_thread.a when searching for -lboost_thread /home/carlos/arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: skipping incompatible /home/carlos/arm/arm-2009q3/bin/../arm-none-linux-gnueabi/libc/usr/lib/libboost_thread.a when searching for -lboost_thread /home/carlos/arm/arm-2009q3/bin/../lib/gcc/arm-none-linux-gnueabi/4.4.1/../../../../arm-none-linux-gnueabi/bin/ld: cannot find -lboost_thread collect2: ld returned 1 exit status

4 11

[variant] Variant call forwarding?
by Rutger ter Borg 26 Feb '10

26 Feb '10

Hello, I'm wondering what's the easiest way to enable call forwarding by a variant to contained function objects accepting the same arguments? I.e., variant< F, G > m_funcs; m_funcs = f; m_funcs( a, b, c ); m_funcs = g; m_funcs( a, b, c ); Thanks, Cheers, Rutger

5 10

boost::asio::read_until w/ boost::function
by marty 26 Feb '10

26 Feb '10

I'm having some trouble resolving the call to read_until (see snippet below) Is there some reason I am not be able to use a boost::function as the MatchCondition object? Thanks, ...m _______________ [MyClass.h] class MyClass { ... typedef boost::asio::buffers_iterator<boost::asio::streambuf::const_buffers_type> t_Iterator; typedef std::pair<t_Iterator, bool> t_ConditionPair; boost::asio::serial_port _port; boost::asio::streambuf _readBuffer; t_ConditionPair myCondition(t_Iterator begin, t_Iterator end); void doRead(); ... }; [MyClass.cpp] MyClass::t_ConditionPair myCondition(t_Iterator begin, t_Iterator end) { t_ConditionPair theCondition; theCondition.first = end; theCondition.second = true; return theCondition; } void MyClass::doRead() { ... boost::asio::read_until( _port, _readBuffer, boost::bind( &MyClass::myCondition, this, _1, _2 ) ); ... }

4 4

Some questions about using BOOST_CLASS_EXPORT_KEY macro of boost.serialization library
by ZouLei 26 Feb '10

26 Feb '10

Dear all , The library version I used was boost_1_42, and the IDE was VS2008 . When I attempt to use the BOOST_CLASS_EXPORT_KEY macro, I met some problems. In my word, I think it doesn't work as expected . My project files are listed following (just five tiny files) : // Base.h #ifndef _BASE_H #define _BASE_H #include <boost/serialization/access.hpp> #include <boost/serialization/export.hpp> #include <boost/serialization/type_info_implementation.hpp> #include <boost/serialization/extended_type_info_no_rtti.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/shared_ptr.hpp> class Base { public: Base() ; Base(int a) ; virtual ~Base(); private: friend class boost::serialization::access ; template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar & a_ ; } private: int a_ ; }; BOOST_CLASS_EXPORT_KEY(Base) BOOST_SERIALIZATION_SHARED_PTR(Base) #endif //_BASE_H // Base.cpp #include "Base.h" Base::Base(): a_(0){ } Base::Base( int a ): a_(a){ } Base::~Base(){ } BOOST_CLASS_EXPORT_IMPLEMENT(Base) //Derived.h #ifndef _DERIVED_H #define _DERIVED_H #include "base.h" class Derived : public Base { public: Derived(); Derived(int a, int b); ~Derived(); private: friend class boost::serialization::access ; template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar & boost::serialization::base_object<Base>(*this) ; ar & b_ ; } private: int b_ ; }; BOOST_CLASS_EXPORT_KEY(Derived) BOOST_SERIALIZATION_SHARED_PTR(Derived) #endif // _DERIVED_H // Drived.cpp #include "StdAfx.h" #include "Derived.h" Derived::Derived(): b_(0){ } Derived::Derived( int a, int b ): Base(a), b_(b){ } Derived::~Derived(){ } BOOST_CLASS_EXPORT_IMPLEMENT(Derived) // main.cpp #include <fstream> #include <iostream> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/shared_ptr.hpp> #include "Derived.h" int _tmain(int argc, _TCHAR* argv[]) { boost::shared_ptr<Base> base_ptr(new Derived(10,15)) ; std::ofstream ofs("test.txt") ; boost::archive::text_oarchive oa(ofs) ; oa << base_ptr ; return 0; } There are no errors in compile-time. But when I executed the program, a memory error caused ! I don't know what is wrong about my program. Whether my usage of BOOST_CLASS_EXPORT_KEY/BOOST_CLASS_EXPORT_IMPLEMENT was wrong ? And, how can I fix the problems ? Thanks, and with my best wishes. Lei

4 4

[Statechart] Question regarding state_machine event handling
by Arne Babnik 26 Feb '10

26 Feb '10

Hi, I'm currently working with the the statechart library in version 1.42.0 and have some difficulties with the way the simple state_machine processes its events. For my work I need several independent state machines, which communicate with each other using process_event/post_event. For various reasons I do not want to use the asynchroneous_state_machine - mostly because my application is built around a global event/message handler and I do not want to use multiple threads with their necessary synchronization. It basically works because in my hierarchy state_machine<>::process_event() is called only in one direction, while in the "opposite" direction (or if unsure) state_machine<>::post_event() is being used. E.g. A calls B->process_event(), B calls C->process_event(), but C calls B->post_event() and B calls A->post_event(). This works so far, and since the process_event() function also processes events posted from within its execution context I do not see any problems with this. However, what I could really make use of are two functions: a) a query function to check if there are any events in the state machine queue (if additional post_event() calls have been made outside the process_event() context); and b) a process_event() function that does not need an event argument, but only processes the queue. Currently I use a "dummy" event for this, but this is rather ugly. Does anybody know why such functions are not available? For b) there is a function named "process_queued_events()" that does exactly what I need, but unfortunately this function is declared private.For a), a simple "eventQueue_.empty()" wrapper would suffice. An even bigger problem for me is that process_event() executes the event argument _first_. I'm rather used to state machines that process their events in-order regardless of the way they got queued up, so I had expected that process_event() first executes the events already in the queue before processing the given event (in other words, the given event argument is only put to the end of the queue initially, and then the queue is processed). Any ideas why the state machine works this way? What is the rationale for this behaviour? Thanks, Arne

3 4

Re: [Boost-users] 1.39 serialisation: buggy warning message for shared_ptr
by Avi Bahra 26 Feb '10

26 Feb '10

Robert Ramey wrote >> The only reason to export a type is if one needs to >> serialize it through a base class pointer. So, to me >> the best way to suppress the warning would be >> to not export the type. The warning message appears even if you don't export the type: Here is a simple test case //================================== #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/shared_ptr.hpp> // no need to include shared_ptr #include <boost/serialization/export.hpp> class Concrete { public: Concrete(const std::string& name ) : name_(name) {} Concrete() {} private: std::string name_; friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar,const unsigned int){ ar & name_; } }; class Base { public: Base(const std::string& name ) : name_(name) {} Base() {} virtual ~Base(){} private: std::string name_; *std::vector<boost::shared_ptr<Concrete> > vec_*; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & name_; ar & vec_; } }; class Derived : public Base { public: Derived(const std::string& name ) : Base(name) {} Derived() {} private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & boost::serialization::base_object<Base>(*this); } }; BOOST_CLASS_EXPORT(Derived); //================================== Notice that I have not exported Concrete, but the serialisation will spit out a warning message, about class Concrete. ... boost_1_39_0/boost/serialization/extended_type_info_typeid.hpp", line 88: warning #2414-D: delete of pointer to incomplete class BOOST_STATIC_WARNING(boost::is_polymorphic<T>::value); ^detected during: instantiation of "const boost::serialization::extended_type_info *boost::serialization::extended_type_info_typeid<T>::get_derived_extended_type_info(const T &) const [with T=Concrete]" at line 92 of "/scratch/ma/emos/ma0/hpia64/boost/boost_1_39_0/boost/archive/shared_ptr_helper.hpp" It looks like if we are serialising via a base ptr, and the base class is serialising concrete data member via a shared ptr, it has assumed that the type must be polymorphic. This does not seem right to me ? Best regards, Ta, Avi

3 2

Multiple key types map
by Michele Caini 26 Feb '10

26 Feb '10

Hi all, I'm looking for a map that has no matter about key types, so I can use such map storing int indexed objects and also, i.e., char indexed objects, as all-in-one container. It can be useful to have such type of key-type unaware containers, as we can find with other languages. What about existing one?

5 5

[program_options] allow_guessing issue
by Filip Konvička 26 Feb '10

26 Feb '10

Hi, I've just upgraded to boost 1.42 from 1.40, and it seems that the new feature 'allow_guessing', a default setting, breaks my existing code. I have two options: "lang" and "lang-dir", the first obviously a prefix of the other, and when my program is run with "--lang=en_US --lang-dir=.", the first argument is interpreted as "lang-dir". Even though the documentation says somewhere that one argument should not be a prefix of another with 'allow_guessing' on, this is a breaking change and should be put in a big red box somewhere on the front page :-) If the change is intended to be kept for the future, it would be wise to detect the problem by examining the options, rather than wait until another problem occurs (in my case, the runtime exception is 'multiple_options' when the user uses both options, and - much worse! - the option gets misinterpreted without a warning if he only uses the shorter option). Cheers, Filip

2 2

Property tree example debug_settings.cpp
by Mauricio Gomes 26 Feb '10

26 Feb '10

Hi, In http://www.boost.org/doc/libs/1_42_0/libs/property_tree/examples/debug_sett… FOREACH lines are commented out. <debug> <filename>debug.log</filename> <modules> <module>Finance</module> <module>Admin</module> <module>HR</module> </modules> <level>2</level> </debug> Then I compiled and tested the program and noticed it wrote only one value for the <modules> tag above. Here it is the output: <?xml version="1.0" encoding="utf-8" ?> - <#> <debug> <filename>debug.log</filename> <level>2</level> - <#> <modules> <module>HR</module> </modules> </debug What is the status of this library ? Is this a known bug or it is just the example that is not uptodate ? If the latter, can anyone provide a functional version of debug_settings.cpp ? Thanks ! -- Mauricio

2 1

[fusion] Introspection of fused objects?
by Rutger ter Borg 26 Feb '10

26 Feb '10

Suppose I have a function object created on the basis of a sequence of fused function objects, where I would like to do shuffle the call order on the basis of some criterion. template< typename SeqOfFused > struct merge_fused { merge_fused( SeqOfFused f ): m_functions( f ) {} typedef void result_type; template< int N, typename Seq > void operator()( Seq& seq ) { // normal dispatch call would be fusion::at_c<N>(m_functions)( seq ); if ( some case ) { store seq for later use } else { call appropriate fused object with parts of stored stuff } } SeqofFused m_functions; // some state / memory specific to this group of fused objects some_state m_state; }; I'm doing a static cast to a superclass to get rid of the int N template parameter, to make the merge_fused look exactly like a fused function object. This works fine. Storing stuff is what my question is about: is there any way to know the type of Seq from its Fused counterpart? Looking at the code, the answer is no, but perhaps there exists introspection code in fusion which I am unaware of? One solution would be to simply use static casting based on Seq in operator(), but then my question would be: is that safe? Thanks, Rutger

2 3

valgrind and boost.datetime
by Matwey V. Kornilov 26 Feb '10

26 Feb '10

Hi, I initialize time input facet in such way: new boost::posix_time::time_input_facet( std::string("%Y-%m-%d %H:%M: %S") ) and valgrind --track-origins=yes tells me: ==30317== Conditional jump or move depends on uninitialised value(s) ... ==30317== Uninitialised value was created by a stack allocation ==30317== at 0x806C486: std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > boost::date_time::gather_weekday_strings<char>(std::locale const&, bool) (strings_from_facet.hpp:84) Is there way to fix the problem? The problem is located within boost according to valgrind, but I assume that it can be produced by incorrect usage. Thanks gcc 4.4.1 boost 1.39.0

2 3

Strange iterator_traits of iterator_facade
by Swerts, Benjamin 26 Feb '10

26 Feb '10

Hello all, I have a class that is templated on an iterator type. As it only works with bidirectional and random access iterators, I thought I would impose that as follows: template<typename T> class A { A() { checkIterator(std::iterator_traits<T>::iterator_category()); }; template<typename Tag> void checkIterator( Tag ); void checkIterator( std::bidirectional_iterator_tag ) {}; void checkIterator( std::random_access_iterator_tag ) {}; void checkIterator( boost::random_access_traversal_tag ) {}; }; This works when T is a standard iterator but not when it's one of my iterator_facade subclasses. For example: class const_iterator : public iterator_facade<const_iterator, const B, boost::random_access_traversal_tag, B> When using this class with A<const_iterator> I get a linker error because the checkIterator function is called with: boost::detail::iterator_category_with_traversal<struct std::input_iterator_tag,struct boost::random_access_traversal_tag> I certainly cannot add a specialization of checkIterator with this tag to class A. Could anyone shed some light on this problem? I'm working with Boost 1.39.0 on MSVC2008SP1. Thanks a lot in advance! Greets, Ben

2 3

[boost-users][filesystem] some missing function
by Sascha Ochsenknecht 26 Feb '10

26 Feb '10

Hi, in Boost.Filesystem I can find a function: template <class Path> std::time_t last_write_time(const Path& p); which is corresponding to st_mtime (last modification time) of the stat structure. Within the stat structure, their are also st_atime and st_ctime defined, but there are no corresponding functions. Is there a special reason for that? Maybe not portabel? Couldn't they be added? E.g. template <class Path> std::time_t last_access_time(const Path& p); template <class Path> std::time_t last_status_change_time(const Path& p); Cheers, Sascha

1 0

understanding Xcode and Boost
by David Rangel 26 Feb '10

26 Feb '10

Hello, Thanks to Igor R for helping me get started with the compilation problems of the regex test program at http://www.boost.org/doc/libs/1_35_0/more/getting_started/unix-variants.htm… Xcode. I renamed all id occurrences to idd in the regex headers, but still get errors. Also, I don't understand why this is necessary for Xcode but not using the command line compilation suggested in the getting started guide. Is Xcode generally more problematic when using libraries like Boost or GSL? Is there a better recommended development environment than Xcode, or is it simple once the error is tracked down? Thanks again for any input. Message: 7 Date: Wed, 24 Feb 2010 23:52:22 +0200 From: Igor R <boost.lists(a)gmail.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Xcode and Boost Message-ID: <cfe0a3cf1002241352v15440e32wc44f9885861e2efc(a)mail.gmail.com > Content-Type: text/plain; charset=UTF-8 > I am interested in using Xcode on OSX to develop some code, and have been > having some troubles compiling the regex example given at: > http://www.boost.org/doc/libs/1_35_0/more/getting_started/unix-variants.html > I can compile using the command line, but not in Xcode. Rename all the occurrences of local variables named "id" in the relevant regex headers.

3 4

Re: [Boost-users] result_of protocol
by Hicham Mouline 26 Feb '10

26 Feb '10

>---------------------------------------------------------------------------------- >struct extract_rule { > > template <typename Sig> struct result; > > template <typename Holder> >struct result< extract_rule(const Holder) > { > typedef const typename Holder::type& type; > }; > template <typename Holder> > typename result< extract_rule(const Holder) >::type > operator()( const Holder& h ) const > { > return h.rule; > } >}; >---------------------------------------------------------------------------------- >1> with >1> [ >1> Sig=extract_rule (const onevariantrule<parameters_t,0,boost::spirit::istream_iterator> ) >1> ] >The template onevariantrule<> is defined _before_ extract_rule. >------------------------------------------------------------------------------------------- >template <typename parameters_t, unsigned n, typename Iterator> >struct onevariantrule { > typedef .... type; >}; >------------------------------------------------------------------------------------------- >Holder matches onevariantrule<parameters_t,0,boost::spirit::istream_iterator>. >That template instantiation is indeed a class. Both specializations template <typename Holder> struct result< extract_rule(const Holder) > { }; and template <typename Holder> struct result< extract_rule(const Holder& ) > { ///// the reference was missing here, doh! typedef const typename Holder::type& type; }; were needed. Sorry for the spam,

1 0

Boost.ASIO "deasynchronisation"
by Igore Dmit. 26 Feb '10

26 Feb '10

Hello, I'm developing networking library that provides RTMP-like networking using Boost.ASIO library. My problem is that any synchronous-access function breaks into many little functions that do some part of job and invoke async operation with "next" function as a handler, it makes the code really ugly and obfuscating. E.g. void hadshake that reads N bytes from peer, responds with those bytes + same count of other bytes, reads N bytes back and checks that they are the same. It breaks into: void start_handshake_wait(); void handle_handshake_wait(const boost::system::error_code&, std::size_t, buffer_ptr &); void handle_handshake_wait_write_dup(..same as above..); void handle_handshake_wait_write_mine(...); void handle_handshake_wait_read_mine_check(...); Every function uses boost::bind, so for some quite simple operation a lot of code is produced. Receiving a chunk of data breaks into: void read_header_head(); // header size depends on first byte void parse_header_head(); void parse_header_body(); void parse_chunk_body(); The only idea I came to is to use some tricks like coroutines. (Sorry for big listings) template<class T> class Context : public boost::enable_shared_from_this< Context<T> > { public: typedef boost::shared_ptr<Context<T> > ptr; private: typedef boost::shared_ptr<T> objptr_t; typedef void (T::*funcptr_t) (const BSYSECode&, std::size_t, Context<T>::ptr, buffer_ptr); objptr_t objptr_; funcptr_t funcptr_; public: std::map< std::string, buffer_ptr > buffers; int state; Context(objptr_t op, funcptr_t fp) : objptr_(op), funcptr_(fp), buffers(), state(0) { } template<typename AsyncReadStream> void async_read(AsyncReadStream &s, buffer_ptr buf) { boost::asio::async_read(s, *buf, boost::bind(funcptr_, objptr_, BASIOPErr, BASIOPBytes, this->shared_from_this(), buf)); } template<typename AsyncWriteStream> void async_write(AsyncWriteStream &s, buffer_ptr buf) { boost::asio::async_write(s, *buf, boost::bind(funcptr_, objptr_, BASIOPErr, BASIOPBytes, this->shared_from_this(), buf)); } }; #define CTX_PROLOG(c) \ if(!c) \ return; \ \ if(c->state == 0) { \ #define CTX_READ(c, s, b) \ c->state=__LINE__; \ c->async_read(s, b); \ return; \ } else if(c->state == __LINE__) { \ #define CTX_WRITE(c, s, b) \ c->state=__LINE__; \ c->async_write(s, b); \ return; \ } else if(c->state == __LINE__) { \ #define CTX_EPILOG \ } buffer_ptr is actually a shared_ptr to buffer, it's used to get buffer back to pool as it goes out of scope. With all this handshake becomes something more readable (to me, but it still cryptic; again, sorry for posting that much): class Handshaker : public boost::enable_shared_from_this<Handshaker> { private: Connection::ptr conn_; public: typedef boost::shared_ptr<Handshaker> ptr; typedef Context<Handshaker> context; Handshaker(Connection::ptr conn) : conn_(conn) { } void shake() { context::ptr ctx(new context(shared_from_this(), &Handshaker::perform)); perform(BSYSECode(), 0, ctx, buffer_ptr()); } private: void perform(const BSYSECode& err, std::size_t sz, context::ptr ctx, buffer_ptr buf) { if(err) return; CTX_PROLOG(ctx); CTX_READ(ctx, conn_->socket(), conn_->pool()->allocate(HandshakeSize)); CTX_WRITE(ctx, conn_->socket(), buf); ctx->buffers["mybuf"] = conn_->pool()->allocate(HandshakeSize); CTX_WRITE(ctx, conn_->socket(), ctx->buffers["mybuf"]); CTX_READ(ctx, conn_->socket(), conn_->pool()->allocate(HandshakeSize)); buffer_ptr mybuf = ctx->buffers["mybuf"]; buffer_ptr hisbuf = buf; if(boost::asio::buffer_size(*mybuf) != boost::asio::buffer_size(*hisbuf)) return; if(memcmp( boost::asio::buffer_cast<void*>(*mybuf), boost::asio::buffer_cast<void*>(*hisbuf), boost::asio::buffer_size(*mybuf) )) return; CTX_EPILOG; } }; Finally, the question: is there any library that provides functionality like that? I'd like to stick with it cause it looks like my implementation is really bad, HUGE bunch of limitations on code written that way, cryptic look, usage of macro, any local variable has to resort in ctx to survive async call.

4 3

Re: [Boost-users] result_of protocol
by Hicham Mouline 26 Feb '10

26 Feb '10

-----Original Message----- >From: "Hicham Mouline" [hicham(a)mouline.org] >Date: 26/02/2010 09:40 AM >To: boost-users(a)lists.boost.org >Subject: Re: result_of protocol. >---------------------------------------------------------------------------------- >struct extract_rule { > > template <typename Sig> struct result; > > template <typename Holder> >struct result< extract_rule(const Holder) > { > typedef const typename Holder::type& type; > }; > template <typename Holder> > typename result< extract_rule(const Holder) >::type > operator()( const Holder& h ) const > { > return h.rule; > } >}; >---------------------------------------------------------------------------------- >1> with >1> [ >1> Sig=extract_rule (const onevariantrule<parameters_t,0,boost::spirit::istream_iterator> ) >1> ] >The template onevariantrule<> is defined _before_ extract_rule. >------------------------------------------------------------------------------------------- >template <typename parameters_t, unsigned n, typename Iterator> >struct onevariantrule { > typedef .... type; >}; >------------------------------------------------------------------------------------------- >Holder matches onevariantrule<parameters_t,0,boost::spirit::istream_iterator>. >That template instantiation is indeed a class. In the snippet above, I replaced Holder by what the compiler tells me it is in the error log, as ------------------------------------------------------------ struct extract_rule { template <typename Sig> struct result; template <typename Holder> struct result< extract_rule(const Holder) > { typedef const onevariantrule<parameters_t,0,boost::spirit::istream_iterator>::type& type; }; ------------------------------------------------------------ And this works. If msvc is able to see that Holder is that particular template instantiation in the error log, isn't it able to know then that Holder is a class? regards,

1 0

[graph] parallel named graph and redistribute
by Andreas Zilian 26 Feb '10

26 Feb '10

Hello boost.graph users, I would like to use the PBGL with named vertices and later redistribute the graph. Unfortunately, I cannot compile the attached code, which - following the documentation - should work, since redistribute() just needs a property_map containing the new rank id's. A minimal example is shown below and a more verbose in the attachment. The example on redistribution in the tests of course works, but uses no named vertices. Are there any users of the parallel BGL who managed to solve this issue? And how? Moreover, could the new (serial) labeled_graph be an option? Thank you very much, Andreas #include <boost/graph/use_mpi.hpp> #include <boost/graph/distributed/adjacency_list.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> using namespace boost; using boost::graph::distributed::mpi_process_group; //----------------------------------------------------------------------------- struct Topo { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & user_id & rank_id ; } Topo( int uid=0, int rid=-1 ) : user_id(uid), rank_id(rid) {} int user_id; int rank_id; friend std::ostream& operator<< (std::ostream& o, const Topo& t) { o << "uid = " << t.user_id << ", rid = " << t.rank_id; return o; } }; //----------------------------------------------------------------------------- // named vertices in a graph namespace boost { namespace graph { template<> struct internal_vertex_name< Topo > { typedef multi_index::member< Topo, int, &Topo::user_id > type; }; template<> struct internal_vertex_constructor< Topo > { typedef vertex_from_name< Topo > type; }; }} typedef adjacency_list< vecS, distributedS< mpi_process_group, vecS >, directedS, Topo > Graph; int main(int argc, char* argv[]) { boost::mpi::environment env(argc,argv); Graph g; property_map< Graph, int Topo::*>::type rid_map = get(&Topo::rank_id, g); g.redistribute( rid_map ); return 0; }

1 0

result_of protocol
by Hicham Mouline 26 Feb '10

26 Feb '10

Hello, I get the following msvc2008 error: error C2825: 'Holder': must be a class or namespace when followed by '::' in the following code ---------------------------------------------------------------------------------- struct extract_rule { template <typename Sig> struct result; template <typename Holder> struct result< extract_rule(const Holder) > { typedef const typename Holder::type& type; }; template <typename Holder> typename result< extract_rule(const Holder) >::type operator()( const Holder& h ) const { return h.rule; } }; ---------------------------------------------------------------------------------- 1> with 1> [ 1> Sig=extract_rule (const onevariantrule<parameters_t,0,boost::spirit::istream_iterator> ) 1> ] The template onevariantrule<> is defined _before_ extract_rule. ------------------------------------------------------------------------------------------- template <typename parameters_t, unsigned n, typename Iterator> struct onevariantrule { typedef .... type; }; ------------------------------------------------------------------------------------------- Holder matches onevariantrule<parameters_t,0,boost::spirit::istream_iterator>. That template instantiation is indeed a class. It has the inner field called "type". Any ideas would be appreciated,

1 0

for help, some error of boost regx
by pirate-king 26 Feb '10

26 Feb '10

Hello everyone, When I use boost_1_41_0 of regx in vs2005, I met this runtime error: boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::regex_error> > I search a lot, but there is not valid method to solve it. Can you do me a favor to give me the way to solve it. Thanks a lot my code is #include <boost/regex.hpp> #include <iostream> boost::regex e("(\\d{3, 4})[- ]?(\\d{4)})[- ]?(\\d{4})[- ]?(\\d{4})"); void print_captures(const std::string& regx, const std::string& text) { boost::regex e(regx); boost::smatch what; std::cout << "Expression: \"" << regx << "\"\n"; std::cout << "Text: \"" << text << "\"\n"; if (boost::regex_match(text, what, e, boost::match_extra)) { unsigned i, j; std::cout << "** Match found **\n Sub-Expressions: \n"; for (i = 0; i < what.size(); ++i) std::cout << " $" << i << " = \"" << what[i] << "\"\n"; std::cout << " Captures:\n"; for (i = 0; i < what.size(); ++i) { std::cout << " $" << i << " = {"; for (j = 0; j < what.captures(i).size(); ++j) { if (j) std::cout << ", "; else std::cout << " "; std::cout << "\"" << what.captures(i)[j] << "\""; } std::cout << "}\n"; } } else { std::cout << "** No match found **\n"; } } int main(int , char* []) { print_captures("(([[:lower:]]+)|([[:upper:]]+))+", "aBBcccDDDDeeeeeee"); return 0; }

3 2

io_service run thread exits on network disconnect (chat server example)
by A.Agrawal＠patrick.com.au 26 Feb '10

26 Feb '10

Hello, My code is similar to the one in chat_server example in boost documentation. In my program I use boost asio to communicate with server. Client has following code to connect to the server: Class Members: class DJClient { tcp::socket *_socket; boost::asio::io_service io_service; boost::thread *t; ............................MORE........................................... } void DJClient::Connect() //To Connect to the server { tcp::resolver resolver(io_service); tcp::resolver::query query("10.21.7.5", "50000"); tcp::resolver::iterator endpoint_iterator = resolver.resolve(query); _socket = new tcp::socket(io_service); tcp::endpoint endpoint = *endpoint_iterator; _socket->async_connect(endpoint, boost::bind(&DJClient::handle_connect, this, boost::asio::placeholders::error, ++endpoint_iterator)); t = new boost::thread(boost::bind(&boost::asio::io_service::run, &io_service)); return; } //Callback function after connection has been attempted, also reads data asynchronously from the server void DJClient::handle_connect(const boost::system::error_code& error, tcp::resolver::iterator endpoint_iterator) { if (!error) { boost::asio::async_read(*_socket, boost::asio::buffer(_inbound_data_length), boost::bind(&DJClient::handle_read_data_length, this, boost::asio::placeholders::error)); } else if (endpoint_iterator != tcp::resolver::iterator()) { _socket->close(); tcp::endpoint endpoint = *endpoint_iterator; _socket->async_connect(endpoint, boost::bind(&DJClient::handle_connect, this, boost::asio::placeholders::error, ++endpoint_iterator)); } } Client writes to the server using the following code, this happens in the main thread (the one that called Connect), asynchronously void DJClient::GetAllWIs(const char* oow_id) { io_service.post(boost::bind(&DJClient::write_wis_for_oow_req, this, oow_id)); } void DJClient::write_wis_for_oow_req(const char* oow_id) { boost::asio::async_write(*_socket, oow_id, boost::bind(&DJClient::handle_write, this, boost::asio::placeholders::error)); } Everything works fine without any problem until network cable is unplugged. After network cable is unplugged, a call to GetAllWI does not call write_wis_for_oow_req. I can see an exit thread message in Visual Studio output window. I suspect that io_service::run exits and io_service is no longer valid and that is why it does not call the method. My program needs to handle this scenario and Client should be able to detect network problem and reconnect. 1. It would be great help if someone can suggest a way to handle this scenario. Is there a way to know this io_service::run has exited. 2. I can see in watch window that io_service._impl.stopped changes its value from 0 to 1. But I do not know how to access it programmatically. Any response will be greatly appreciated as I am not very experience in using boost. Thanks in advance Anil Agrawal Patrick Technology & Systems

2 1

[boost-program-options] Minor documentation bug
by mmocny 26 Feb '10

26 Feb '10

To whom it may concern, The last code example in the section "Option Details" on page http://www.boost.org/doc/libs/1_42_0/doc/html/program_options/tutorial.html, the line: $bin/gcc/debug/options_description ...should be bold, to match the rest of the syntax. I found the example confusing until I properly parsed what was meant to be written. Might I also suggest a space after the $ or even* "shell> command" * -Michal Mocny

3 2

[boost-users][array] Passing by reference
by Ryan McConnehey 26 Feb '10

26 Feb '10

I'm wanting to pass a boost::array by reference to a function. Normally, this isn't a problem. My first approach yielded a compiler error stating boost::array needs template parameters. When adding the template parameters (approach 2) the compiler then states boost::array needs T to be a compile time constant. I want the function to be able to take different boost::array sizes. Can boost::array be passed by reference without knowing the size of the array at compile time? Any help would be great. Ryan Approach 1 void extract (boost::array & var) {} Approach 2 template<typename T, typename S> void extract (boost::array<T, S> & var) {}

2 2

Boost.Serialization warning C4540 on MSVC
by Antti Alho 26 Feb '10

26 Feb '10

Hi, I'm using Boost.Serialization for my project and have run into a cryptic warning message. Although it doesn't seem to actually do any harm on run-time I would like to know what it means, and possibly how I can fix it without #pragma disabling it. The relevant code and the entire warning can be found here: Codepad paste <http://codepad.org/MVx2O6dC> The error message was produced by Visual Studio 2008. Since I'm not perfectly sure what the correct syntax is supposed to be regarding lines 74 and 75 when dealing with classes using multiple inheritance and since I couldn't find documentation regarding the subject those could very well be the source of my problems (although it seems to do what it is expected to do). All help greatly appreciated, thanks in advance.

3 2

[program_options][1.35] validating string value
by Soumen 26 Feb '10

26 Feb '10

Hi, My option (say, "opt1") can take any of only few possible string type values (say, "value1", "value2", "value3" and "value4"). Is there anyway to specify this such that if any other value, say - "valueXX", is passed to "opt1", it throws an error? If yes, can someone point me to documentation or sample code snippet to show how to do this? Or, explicitly, checking against these possible values is my only option? Regards, ~ Soumen -- View this message in context: http://old.nabble.com/-program_options--1.35--validating-string-value-tp276… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Combing 2 memory pools
by Michael Kennard 26 Feb '10

26 Feb '10

Short version: I'm using the boost pool library for allocation of a linked list of small objects. Now I want to append one linked list onto the end of another. Thus I also want to combine the memory pools. I don't see this functionality in the interface documentation. Is there a way to easily combine two memory pools? Longer version: The list is a member of a class which manages it and has methods for creating and deleting list elements. The memory pool is also a member of this class. Before using the memory pool, each list element was allocated individually and deleted individually. With the pool, deletion is easier because you just destroy the pool instead of deleting each list element individually. Merging two lists together before I used the pool was just a matter of appending one linked list onto the end of the other (easy, and code not shown). But now that I'm using the pool I've got to figure out how to merge the two pools into one. Here's a simplified version of the code (which I haven't tried to compile): struct element { int m_data; element* m_next; }; class MyList { public: MyList(); // constructor void NewElement (int data) { element* new_element = static_cast<element*>(m_pool.malloc()); new_element->m_data = data; // add to beginning of list new_element->next = m_list; m_list = new_element; } element* m_list; boost::pool m_pool; }; -- Michael Kennard Aquaveo (www.aquaveo.com)

2 1

fusion Transformation function passed to transform
by Hicham Mouline 26 Feb '10

26 Feb '10

Hello, The transformation function to pass to fusion::transform() function and metafunction are hard to get right, in particular the embedded inner result struct because of the fact that the template argument of result is a "function signature" There is only the 1 simple example in libs/fusion/doc/html/fusion/algorithm/transformation/metafunctions/transform.html I for one would love to see another example where the fusion vector has different types, and where the result of transformation function depends on each type of the sequence transform is applied on. In the meantime, I am writing something like this: struct extract_rule { template <typename Signature> struct result; //// primary template template <typename Holder> struct result< extract_rule(const Holder) > { //// is this always a specialization of the primary? typedef .... type; }; template <typename Holder> typename result<extract_rule(const Holder)>::type operator()( const Holder& h ) const { .... } }; Does this look right? regards,

2 1

function pointers and anys
by Alan Tennant 25 Feb '10

25 Feb '10

I created a pointer to a function, I am able to call the function though the pointer as well as move the pointer, as I would expect. I put it into a boost::any. How do I get the pointer out of the any so that I can call it? I'm having difficulty using the any_cast to do it.

2 2

[Asio] streambuf exceptions
by Dylan Klomparens 25 Feb '10

25 Feb '10

I'm using an asio::streambuf to read and write data to a socket. Despite my best efforts, I can't get the streambuf to throw an exception if I consume too much. I'm trying to get it to throw an exception so I can test an error case. The documentation says streambuf::consume will throw an std::length error if the requested amount to read is greater than the input stream size ( http://www.boost.org/doc/libs/1_42_0/doc/html/boost_asio/reference/basic_st…) But in my test program, this did not happen. Do I need to enable exception throwing somehow? Or is streambuf working as intended and not supposed to throw an exception? Here is my test program: #include <iostream> #include <boost/asio.hpp> using namespace std; int main() { char in[] = "hello"; char out[6] = {0, 0, 0, 0, 0, 0}; boost::asio::streambuf s; s.sputn(in, sizeof(in)); s.sgetn(out, sizeof(in)); cout << out << endl << s.size() << endl; s.consume(1000); return 0; }

2 1

[graph] [parallel graph] property and distributedS
by Andreas Zilian 25 Feb '10

25 Feb '10

Hello, using the parallel graph library, I try to combine the property definition for a vertex typedef property<vertex_rank_t, int, VVV> vertex_property_t; with the vertex storage type distributedS in a distributed adjacency_list. Unfortunately this does not compile in the form listed below. Now, I would like to learn why the code actually compiles fine if a) distributedS is changed to vecS (see typdef vertex_storage_t), b) property<vertex_rank_t, int, VVV> is changed to VVV (see typedef vertex_property_t). I need the property vertex_rank_t for redistribution of the graph. Thank you very much, Andreas #include <boost/graph/use_mpi.hpp> #include <boost/graph/distributed/adjacency_list.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> using namespace boost; using boost::graph::distributed::mpi_process_group; struct VVV { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { } }; //typedef vecS vertex_storage_t ; typedef distributedS<mpi_process_group, vecS> vertex_storage_t ; //typedef VVV vertex_property_t; typedef property<vertex_rank_t, int, VVV> vertex_property_t; typedef adjacency_list<vecS, vertex_storage_t, directedS, vertex_property_t> G; int main (int argc, char* argv[]) { boost::mpi::environment env(argc,argv); G g(10); }

1 0

Problem creating a circular buffer in shared memory using Boost
by Cuneyt Taskiran 25 Feb '10

25 Feb '10

Hi, I am trying to create a circular buffer in shared memory using Boost circular_buffer and Interprocess libraries. I compiled and ran the the example given in the Interprocess documentation<http://www.boost.org/doc/libs/1_42_0/doc/html/interprocess/quick_guide.html…>for creating a vector in shared memory with no problem. However, when I modify it to use the Boost circular_buffer as: int main(int argc, char *argv[]) { managed_shared_memory segment(create_only, "MySharedMemory", 65536); const ShmemAllocator alloc_inst (segment.get_segment_manager()); MyCircBuffer *myCircBuf = segment.construct<MyCircBuffer>("MyCircBuffer")(alloc_inst); return 0; } I get a compilation error (caused by segment.construct()). Any idea what I am doing wrong? Is it because circular_buffer is not one of the containers listed in /boost/interprocess/containers, i.e. it's not compatible with Interprocess? Thanks, C

2 2

Detect typedef in class
by Hansjoerg 25 Feb '10

25 Feb '10

Hello, is there some way to detect if a class has an typedef with boost 1.34.1? I want to detect typedef T value_type; in a class... Thanks Hansjörg

3 2

[phoenix] How to determine if a phoenix functor is callable?
by Jesse Perla 25 Feb '10

25 Feb '10

So there any ways to implement a metafunction can_be_called on a phoenix functor s.t.: auto f = _1 + _2; static_assert(is_callable<decltype(f), double, double>::value, ""); static_assert(!is_callable<decltype(f), double, NonArithmeticType>::value, ""); static_assert(!is_callable<decltype(f), double>::value, ""); //Needs 2 args A while back, I was pointed towards the following from proto to determine if a functor was callable: http://www.boost.org/doc/libs/1_42_0/doc/html/proto/appendices.html#boost_p… pendices.implementation.function_arity This seemed to work well for most of my custom built functors, but as far as I can tell, the trick doesn't work for either boost::lambda or boost::phoenix functors (or std::tr1::bind for that matter). I can post a test case for phoenix if people think that it should work. -Jesse

2 2

[karma] Losing attribute?
by Sebastian Redl 25 Feb '10

25 Feb '10

Hi, I've got a Karma generator that should emit a vector of records, writing out the index of every entry at the start. My code looks like this (note that GEOPOINT is a fusion-adapted struct of two doubles): typedef std::vector<GEOPOINT> Contour; typedef std::vector<Contour> Poly; rule<Iterator, GEOPOINT()> point; rule<Iterator, Contour(int)> contour; rule<Iterator, locals<int>, Poly()> polygon; rule<Iterator, Poly()> start; point = L';' << double_ << L';' << double_; contour = L";SUBPOLYGON " << lit(_r1 - 1) << L" POINTS " << lit(phoenix::size(_val)) << L" MASK XOR" << *point; polygon = L"POLYGON COUNT " << lit(phoenix::size(_val)) << *(contour(_a)[++_a]); start = polygon; This doesn't work. If I take away the modification of _a, it works, except that of course the index is 0 in every iteration. But the moment I modify _a in any way (including assigning to it anywhere in the polygon rule), suddenly contour seems to get an incorrect attribute: it never fails, but never emits points either, i.e. I get an endless string of ";SUBPOLYGON 1 POINTS 0 MASK XOR;SUBPOLYGON 2 POINTS 0 MASK XOR;SUBPOLYGON 3 POINTS 0 MASK XOR...". Any idea why that is? Sebastian

2 3

[program_options] Parsing Config File
by Christian Meesters 25 Feb '10

25 Feb '10

Hi, I'd like to use/abuse boost::program_options to parse a configuration file like this: [project1] parameter=x ... [project2] parameter=y ... [project3] parameter=z ... and so on. Point is that I cannot now how many 'project' entries there will be in advance. Is there a way to parse this and retrieve a list of project keys from boost::program_options::variables_map? Or (the 'abuse' above already suggested that I'm not certain whether this library is the most suited one) is there a better approach? Christian

1 0

[MPL] Filtering a sequence to leave only most-derived types
by Sebastian Redl 25 Feb '10

25 Feb '10

Hi, I've got an MPL sequence containing a (rather small) number of classes. I want to filter this sequence so that all classes that are a base of another class in the sequence are filtered out. I thought I'd do something like this (in pseudo-code): is_strict_base_of(Base, Derived) = !is_same(Base, Derived) && is_base_of(Base, Derived) Result = remove_if( Interfaces, find_if( Interfaces, is_strict_base_of(outer_value, inner_value) ) != end(Interfaces) ) where outer_value is the iteration value of the remove_if loop, and inner_value is the iteration value of the count_if loop. Yes, this is N², but since the length of the initial sequence is very unlikely to exceed 8, I can live with that. In MPL syntax: template <typename Base, typename Derived> struct is_strict_base_of : mpl::and_< mpl::not_<boost::is_same<Base, Derived> >, boost::is_base_of<Base, Derived> > {}; typedef typename mpl::remove_if< Interfaces, // Remove from Interfaces mpl::not_<mpl::equal< mpl::find_if< Interfaces, // if there is any value in interfaces // that this is a base of is_strict_base_of<???> >, mpl::end<Interfaces> > > >::type Bases; How do I represent outer_value and inner_value in this expression? It seems I can't simply put mpl::_1 and mpl::_2 there, since that gives me a static assertion failure (argument is not available). I think I have to put an apply somewhere in there, but I can't figure out where. Sebastian

2 2

accessing a pair<> element of multi_index container, uniquely ordered
by Andrew Kokkalis 25 Feb '10

25 Feb '10

I have the following problem using a multi index container which is uniquely ordered on a pair <int,int>. Each time i want to find every pair i that contains a specific integer. The other value of the pair is irrelevant. An example: <0,1> <0,2> <0,3> <1,2> <1,3> <2,3> and I want to find all the pairs with the value 0 as the first integer. function find() wants the whole pair and iterator find(const CompatibleKey& x,const CompatibleCompare& comp)const; doesn't help ,too. * **Here is the declaration of my container** typedef pair<int, int> clusterset; struct cluster { clusterset pair; float distance; cluster(clusterset pair, float distance) : pair(pair), distance(distance) {} }; struct cluster_pair{}; struct cluster_distance{}; typedef multi_index_container< cluster, indexed_by< ordered_unique< tag<cluster_pair>, BOOST_MULTI_INDEX_MEMBER(cluster, clusterset, pair)>, ordered_non_unique< tag<cluster_distance>, BOOST_MULTI_INDEX_MEMBER(cluster, float, distance)> > > cluster_index;* Any ideas?

2 1

Re: [Boost-users] [serialization] Polymorphic serialization withpolymorphic archives problem...
by Bogdan 25 Feb '10

25 Feb '10

Robert Ramey <ramey <at> rrsd.com> writes: > > > > ================================================== > > What is worrisome though, isomorphic serialization of > > polymorphic_derived1 as an object followed by polymorphic > > serialization through a pointer to the base class FAILS WITH ACCESS > > VIOLATION: > > > > > > ================================================== > > Isomorphic serialization of a class not related to the hierarchy as > > an object followed by polymorphic serialization through a pointer to > > the base class WORKS AS EXPECTED. > > I'm not sure what the above means. > I hoped this would help narrow the 'access violation' issue: - mixing isomorphic and polymorphic serialization seems to be problematic whenever the object using isomorphic serialization is also a part of the hierarchy for which we use polymorphic serialization. - on the other hand, if the object belongs to a totally independent class we do not have this issue. Is it possible this is also related to the registration of serializers? Bogdan

1 0

how can I use jamfile complie WinMain?
by l.jay Yuan 25 Feb '10

25 Feb '10

how can I use jamfile complie WinMain? my cpp code: #include <windows.h> int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nCmdShow) { return 0; } my jamfile: exe main : [ glob-tree *.cpp *.c : .svn ] ; install . : main : <install-type>EXE ; compile use msvc7.1, I got error LNK2019(___tmainCRTStartup) can bjam do it? someone help me, please, thanks vey much!!!

3 4

message_peek
by David Kaplan 25 Feb '10

25 Feb '10

How do I perform a peek instead of a read (which removes data from the buffer)? I found socket_base::message_peek, how do I use that together with my socket and asio::read()?

1 1

Re: [Boost-users] [serialization] Polymorphic serialization withpolymorphic archives problem...
by Martin Lederhilger 25 Feb '10

25 Feb '10

Hello Robert, hello Bogdan, I have quite the same problem (Exception multiple_code_instantiation thrown in basic_serializer_map.cpp at line 48) as Bogdan. It can be reproduced by changing the pointer type from polymorphic_base to polymorphic_derived2 in the original test_dll_exported.cpp example, which comes with the library. void save_exported(const char *testfile) { test_ostream os(testfile, TEST_STREAM_FLAGS); test_oarchive oa(os, TEST_ARCHIVE_FLAGS); polymorphic_base *rb1 = new polymorphic_derived1; polymorphic_derived2 *rb2 = new polymorphic_derived2; // export will permit correct serialization // through a pointer to a base class oa << BOOST_SERIALIZATION_NVP(rb1); oa << BOOST_SERIALIZATION_NVP(rb2); delete rb1; delete rb2; } I think the problem is that when oa << BOOST_SERIALIZATION_NVP(rb2); is called, that the system registers an type in oserializer.hpp, which leads to creation of the singletons also in the executeable. I have this problem when serializing a shared_ptr<A> in class B in B.dll to an object of class A in A.dll. I tried to simply comment out this check, but it seems that I get problems with tracking later. I have a class hierarchy like this: C derives from B derives from A. A has a weak_ptr<A> to itself (something like boost::enable_shared_from_this). If I serialize an object of type C via a base pointer of type B the serialization walks like this: C::serialize, B::serialize, A::serialize, and again C::serialize (with a wrong this pointer - and it should not do that). Maybe my second problem depends on the first one. I hope that my report can be of help. Thanks in advance for your answers, Martin Lederhilger

2 3

list all boost tests
by Martin Ankerl 25 Feb '10

25 Feb '10

Hi all, we are using BOOST_AUTO_TEST_SUITE() and BOOST_AUTO_TEST_CASE() to create lots of tests. Is it possible to list all the tests available in an executable? I have tried to create a special test "help" that calls boost::unit_test::traverse_test_tree(), but this only shows the tests that are selected for this test run. Martin

1 0

Re: [Boost-users] [serialization] Polymorphic serialization withpolymorphic archives problem...
by Bogdan 25 Feb '10

25 Feb '10

Robert Ramey <ramey <at> rrsd.com> writes: > > Martin Lederhilger wrote: > > Hello Robert, hello Bogdan, > > > > I have quite the same problem (Exception multiple_code_instantiation > > thrown in basic_serializer_map.cpp at line 48) as Bogdan. It can be > > reproduced by changing > > the pointer type from polymorphic_base to polymorphic_derived2 in the > > original test_dll_exported.cpp example, which comes with the library. > > I think the problem is that when oa << BOOST_SERIALIZATION_NVP(rb2); > > is called, that the system registers an type in oserializer.hpp, which > > leads to creation of the singletons also in the executeable. > > Ahhhh - a very useful hint. So the rule would be that if a class > is polymorphic is to be serialized through a pointer, it should ONLY > be done through a base class pointer? That is, if ALL polymorphic > base classes are abstract - this problem will never occur? > > I'll have to think about this. > > > I have this problem when serializing a shared_ptr<A> in class B in > > B.dll to an object of class A in A.dll. > > > > I tried to simply comment out this check, but it seems that I get > > problems with tracking later. I have a class hierarchy like this: > > C derives from B derives from A. A has a weak_ptr<A> to itself > > (something like boost::enable_shared_from_this). If I serialize an > > object of type C via a base pointer of type B the serialization walks > > like this: C::serialize, B::serialize, A::serialize, and again > > C::serialize (with a wrong this pointer - and it should not do that). > > Hmmm - why should it not do that? You may have a cycle - but > the library handles that. Seems unrelated to the other problem. > > > Maybe my second problem depends on the first one. I hope that my > > report can be of help. > > > > Thanks in advance for your answers, > > And thanks for your useful information. > > > Martin Lederhilger > Hello Robert, On your suggestion I have run a few tests. I hope they help: I commented out the registration macro associated to the base class in ExportDll.dll: - //BOOST_CLASS_EXPORT_IMPLEMENT(polymorphic_base) To make the example more realistic I modified the inheritance hierarchy as follows: class polymorphic_base{}; class polymorphic_derived1 : public polymorphic_base{}; class polymorphic_derived2 : public polymorphic_derived1{}; I added one integer data member to polymorphic_derived1 and polymorphic_derived2. Here are the results: ================================================== Polymorphic serialization through a pointer to polymorphic_base WORKS AS EXPECTED: // Save code ----------------------------- polymorphic_base *rb0 = new polymorphic_derived1(100); polymorphic_base *rb1 = new polymorphic_derived1(10); polymorphic_base *rb2 = new polymorphic_derived2(10,20); oa << BOOST_SERIALIZATION_NVP(rb0); oa << BOOST_SERIALIZATION_NVP(rb1); oa << BOOST_SERIALIZATION_NVP(rb2); // Load code ----------------------------- polymorphic_base *rb0 = NULL; polymorphic_base *rb1 = NULL; polymorphic_base *rb2 = NULL; ia >> BOOST_SERIALIZATION_NVP(rb0); ia >> BOOST_SERIALIZATION_NVP(rb1); ia >> BOOST_SERIALIZATION_NVP(rb2); The serialized content is presented below: - for polymorphic_xml_[io]archive <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="7"> <rb0 class_id="1" class_name="polymorphic_derived1" tracking_level="1" version="0" object_id="_0"> <polymorphic_base class_id="0" tracking_level="0" version="0"></polymorphic_base> <m_d1_>100</m_d1_> </rb0> <rb1 class_id_reference="1" object_id="_1"> <polymorphic_base></polymorphic_base> <m_d1_>10</m_d1_> </rb1> <rb2 class_id="2" class_name="polymorphic_derived2" tracking_level="1" version="0" object_id="_2"> <polymorphic_derived1 object_id="_3"> <polymorphic_base></polymorphic_base> <m_d1_>20</m_d1_> </polymorphic_derived1> <m_d2_>10</m_d2_> </rb2> </boost_serialization> - for polymorphic_text_[io]archive 22 serialization::archive 7 1 20 polymorphic_derived1 1 0 0 0 0 100 1 1 10 2 20 polymorphic_derived2 1 0 2 3 20 10 ================================================== Polymorphic serialization through a pointer to polymorphic_derived1 (i.e. the class in the middle of the hierarchy) FAILS WITH THE SAME EXCEPTION thrown about multiple registration (see the beginning of this thread). ================================================== What is worrisome though, isomorphic serialization of polymorphic_derived1 as an object followed by polymorphic serialization through a pointer to the base class FAILS WITH ACCESS VIOLATION: // Save code ----------------------------- polymorphic_derived1 rb0(100); polymorphic_base *rb1 = new polymorphic_derived1(10); polymorphic_base *rb2 = new polymorphic_derived2(10,20); oa << BOOST_SERIALIZATION_NVP(rb0); oa << BOOST_SERIALIZATION_NVP(rb1); oa << BOOST_SERIALIZATION_NVP(rb2); // Load code ----------------------------- polymorphic_derived1 rb0; polymorphic_base *rb1 = NULL; polymorphic_base *rb2 = NULL; ia >> BOOST_SERIALIZATION_NVP(rb0); ia >> BOOST_SERIALIZATION_NVP(rb1); ia >> BOOST_SERIALIZATION_NVP(rb2); The code above fails in basic_iarchive.cpp(line 469) with access violation (bpis is 0). if(! tracking){ bpis_ptr->load_object_ptr(ar, t, co.file_version); } The serialized content is presented below: - using polymorphic_xml_[io]archive <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="7"> <rb0 class_id="0" tracking_level="0" version="0"> <polymorphic_base class_id="1" tracking_level="0" version="0"></polymorphic_base> <m_d1_>100</m_d1_> </rb0> <rb1 class_id_reference="0" object_id="_0"> <polymorphic_base></polymorphic_base> <m_d1_>10</m_d1_> </rb1> <rb2 class_id="2" class_name="polymorphic_derived2" tracking_level="1" version="0" object_id="_1"> <polymorphic_derived1 object_id="_2"> <polymorphic_base></polymorphic_base> <m_d1_>20</m_d1_> </polymorphic_derived1> <m_d2_>10</m_d2_> </rb2> </boost_serialization> - using polymorphic_text_[io]archive 22 serialization::archive 7 0 0 0 0 100 0 0 10 2 20 polymorphic_derived2 1 0 1 2 20 10 ================================================== Isomorphic serialization of a class not related to the hierarchy as an object followed by polymorphic serialization through a pointer to the base class WORKS AS EXPECTED. ================================================== I am looking forward to hearing your conclusions. Thank you, Bogdan

2 1

boost::asio acceptor::cancel() behavior.
by Jivan Amara 25 Feb '10

25 Feb '10

Hi all, I'm looking at the documentation for acceptor::cancel(), which states that it will: "Cancel all asynchronous operations associated with the acceptor.", then in the detailed description states: "This function causes all outstanding asynchronous connect, send and receive operations to finish immediately, and the handlers for cancelled operations will be passed the |boost::asio::error::operation_aborted| error. " The wording is unclear to me. What are send and receive operations associated with the acceptor? Are these reads and writes performed using sockets that were connected through this acceptor, or just the network overhead required to perform accepts? Thanks, Jivan

1 0

[Proto] Processing Lists
by David Greene 25 Feb '10

25 Feb '10

I want to process a list that looks something like this: struct List : or_< comma< List, Item >, Item > {}; But rather than processing each item separately, I want to pass a fusion (or some other) sequence to a semantic action: when< List, SomeAction(...) > {}; Ideally the argument to SomeAction would be a fusion sequence but I don't know how to produce one. This doesn't work: when< List, SomeAction(flatten(_)) > {}; because flatten is not a transform. I don't want to use fold_tree because I don't want to actually fold the sequence. SomeAction is something like this: struct SomeAction : callable { template<typename Seq> void operator()(Seq range) { typedef ... iterator; // Is this legal for fusion sequences? for(iterator i = begin(range), iend = end(range); i != iend; i = next(i)) { ... } } } Is there a way to do this? On a related note, I know I can use varag<> to match a function call expression with an arbitrary number of operands and invoke a transform on each operand. But how would I generate a fusion sequence of all the operands? In other words, with: proto::function< X, proto::vararg<Y> > how do I talk about the vararg<> part in a semantic action? CalculatorGrammar has a use of vararg but it uses fold<> to process it. I don't want to fold a sequence, I want to pass it to a transform. Thanks! -Dave

4 3

Newbie Xpressive Help Needed
by Timothy Sassone 25 Feb '10

25 Feb '10

I'm new to both boost and Xpressive, but I've worked with regex before. I've been able figure most of it out from the Xpressive user guide, but I'm having some trouble with a particular expression. I'm using Xpressive to "parse" files from a game called Dwarf Fortress, and one of the lines in the file has a couple places where some information is printed in a different format, or entirely excluded. The lines are describing the history of the game, specifically the rulers. For example, one line might look like this: *[*] Flichlikus (b.??? d. 3, Reign Began: 1), *** Original Line, Married (d. 91)* While another would look like this: *[*] Thufuchrunkin (b.3, Reign Began: 97), Inherited from mother, Married (d. 160)* Thus far, I've got it finding the ruler's name, and their birth date (or "???"). However, since the date of death is sometimes completely absent, I need some way to get the number if it's there, and skip it otherwise. From what I understand, I'll need to use the lookahead or lookbehind constructs, but they're well beyond what I've done with regex before, so I don't really even know where to begin. How would I go about retrieving the date of death if it's there, and otherwise skipping it entirely (or better yet, set it to a default value...)? Here's what I'm using to parse up through the date of birth... *mark_tag RU_Name(1), RU_Birth(2), RU_Death(3), RU_ReignBegin(4), RU_Line(5), RU_Married(6);* *sregex Reg_Ruler = " [*] " >> ( RU_Name = +(+_w|_s) ) >> "(b." >> (RU_Birth = (+(_d)|"???"));* * * Any help would be much appreciated, and a link to a decent tutorial to help me with Xpressive in general would be even better. Thanks! Tim

2 1

Re: [Boost-users] fusion struct adapted, latest trunk changes
by Hicham Mouline 25 Feb '10

25 Feb '10

-----Original Message----- From: "Hicham Mouline" [hicham(a)mouline.org] Date: 24/02/2010 10:17 AM To: boost-users(a)lists.boost.org Subject: Re: fusion struct adapted, latest trunk changes Christopher, <snip> 1. temporarily, which files should I add this tweak to (boost\fusion\adapted\struct\extension.hpp is gone) 2. I understand your changes are about adapting class/struct templates. Where should I add this tweak to if I wish to use it for adapted templates, -------------------------------------------------------------------------------- Attached are the 2 files I have changed to trunk now. It works for my non template struct case, I haven't tested yet for struct templates /classes/ class templates Regards, ps: I hope to be able to add this later for the other headers. attached: boost\fusion\adapted\struct\detail\adapt_base.hpp attached: boost\fusion\adapted\struct\detail\extension.hpp

3 2

[iostream] exception propogation
by Anand Patel 24 Feb '10

24 Feb '10

I came across interesting exception propagation behavior across different platform (win32, linux). I have created several filters and custom filtering stream with my filters (boost 1.38-1.41). My filter throws BOOST_IOSTREAMS_FAILURE("some message"); whenever error condition occurs. On Linux exception gets propagated all the way to user using my stream. On Windows XP (VS 2008) it gets caught somewhere in boost framework or Windows. Moreover, after exception is silently caught and dropped, all the filters close method is called. This is where I run into issue. Is there anyway to ensure that upon exception no more data processing takes place withing filtering_stream and its chain? -Anand

2 2

Xcode and Boost
by David Rangel 24 Feb '10

24 Feb '10

Boost Users: I am interested in using Xcode on OSX to develop some code, and have been having some troubles compiling the regex example given at: http://www.boost.org/doc/libs/1_35_0/more/getting_started/unix-variants.html I can compile using the command line, but not in Xcode. I do not know if this is the correct forum on which to post, but after some searching for my question on the web, I have not found a suitable answer. I am able to compile the simple first example using Xcode, by directing it to look for the header files and libraries. The same procedure does not work for the second example and the compilation fails. I am not sure if anyone is using the XCode development development environment and has run into this problem, but any hints would be appreciated. Thank you

2 1

[GIL] Fixed version
by Eloi Du Bois 24 Feb '10

24 Feb '10

Hi all, I downloaded the last version of boost (1.42), and I saw that there still remains errors I reported before. I give you the fixed version of both incorrect files. Example of error: channel.hpp:368: warning: left shift count >= width of type I hope this will help in making a stronger version of bgil :) Good luck, Eloi Du Bois.

2 3

boost::filesystem is not detecting symlinks on Linux /sys/devices directory
by Conrad Whelan 24 Feb '10

24 Feb '10

Hi, I'm writing some code to query the PCI bus for active devices. It should be pretty straightforward, as sysfs maps device information into the linux filesystem in the /sys directory. I simply need to recursively scan this directory until I find the device file corresponding to the devices of interest. I am having trouble with the scanning, using the boost::filesystem library. It seems that the is_symlink function on a path iterator is not correctly detecting a symlink. It correctly determines that the symlink is a directory, but not that it's a symlink. Simply put, I want my recursive code to follow normal directories, but not symlink directories... as it is, there is circular linkage through the /sys directory if I follow symlinks, so the loop goes infinite. Does anyone know how to distinguish between normal directories and symlink directories using boost::filesystem? thanks, conrad

1 0

Boost.Test and QProcess (Linux) memory access violation at address 0x00000000
by ariasgore＠gmx.de 24 Feb '10

24 Feb '10

Hello, Since boost do not provide a convenient way of calling processed I had to use Qt and QProcess to invoke an executable. I also have written tests for this situation. Which run great but fail while on OpenSuse 11.1 32 bit with boost test in 1.41.0 package. the test is fairly simple BOOST_AUTO_TEST_CASE(test_) { Myobject g; // wrong path, this should throw BOOST_REQUIRE_NO_THROW(g.checkGdalwarp()); } The checkGdalwarp code is void checkGdalwarp() { QProcess testproc(this); testproc.start(MyObject::GDALWARP_PATH.c_str()); bool finished = testproc.waitForFinished(); if(!finished || ( finished && testproc.exitStatus()!=QProcess::NormalExit )) { throw errors::GdalWarpNotLocated(); } } The function works if called without boost test but it terribly fails while in the auto test case. Sometimes I get "exception thrown" in the test, if I repeat the method again I get a memory access violation at address 0x00000000 and this test method is stuck. So the execution of the test never finished (at least not the 10 hours since yesterday) This perfectly works on windows but never on linux. Thanks Sam -- GRATIS für alle GMX-Mitglieder: Die maxdome Movie-FLAT! Jetzt freischalten unter http://portal.gmx.net/de/go/maxdome01

2 1

Syntax error when using BOOST_CHECK_PREDICATE
by Andrew J. Leer 24 Feb '10

24 Feb '10

Reading this article: http://www.ibm.com/developerworks/aix/library/au-ctools1_boost/?S_TACT=105A… I'm using Boost 1.40.0 and Visual Studio 2005 with Visual C++ 8.0. I've entered Listing 14 with a few additional lines of logging code: #include "stdafx.h" #define BOOST_TEST_MODULE example #include <boost/test/included/unit_test.hpp> std::list<int> user_defined_func( ) { std::cout << "BEGIN: user_defined_func" << std::endl; std::list<int> l; l.push_back(8); l.push_back(0); std::cout << "END: user_defined_func" << std::endl; return l; } bool validate_list(std::list<int> &L1) { std::cout << "BEGIN: validate_list" << std::endl; std::list<int>::iterator it1 = L1.begin(); for(; it1 != L1.end(); ++it1) { if(*it1<= 1){ std::cout << "Validation failed because an item in the list was less than or equal to 1." << std::endl; std::cout << "END: validate_list" << std::endl; return false; } } std::cout << "Test passed because all of the items in the list were greater than or equal to 1" << std::endl; std::cout << "END: validate_list" << std::endl; return true; } BOOST_AUTO_TEST_SUITE( test ) BOOST_AUTO_TEST_CASE( test ) { std::list<int>& list1 = user_defined_func(); BOOST_CHECK_PREDICATE( validate_list, list1 ); } BOOST_AUTO_TEST_SUITE_END() Now when I go to compile this, it ends up giving me an error: 1>------ Build started: Project: UnitTestTests, Configuration: Debug Win32 ------ 1>Compiling... 1>UnitTestTests.cpp 1>c:\program files (x86)\boost\boost_1_40\boost\test\impl\execution_monitor.ipp(904) : warning C4535: calling _set_se_translator() requires /EHa 1>c:\program files (x86)\boost\boost_1_40\boost\test\utils\runtime\config.hpp(90) : warning C4996: 'putenv': The POSIX name for this item is deprecated. Instead, use the ISO C++ conformant name: _putenv. See online help for details. 1> c:\program files (x86)\microsoft visual studio 8\vc\include\stdlib.h(900) : see declaration of 'putenv' 1>c:\program files (x86)\boost\boost_1_40\boost\test\utils\runtime\cla\char_parameter.ipp(36) : warning C4244: 'argument' : conversion from 'boost::rtti::id_t' to 'const int', possible loss of data 1>c:\program files (x86)\boost\boost_1_40\boost\test\utils\runtime\cla\named_parameter.ipp(41) : warning C4244: 'argument' : conversion from 'boost::rtti::id_t' to 'const int', possible loss of data 1>c:\program files (x86)\boost\boost_1_40\boost\test\utils\runtime\env\environment.ipp(82) : warning C4996: 'getenv': This function or variable may be unsafe. Consider using _dupenv_s instead. To disable deprecation, use _CRT_SECURE_NO_WARNINGS. See online help for details. 1> c:\program files (x86)\microsoft visual studio 8\vc\include\stdlib.h(483) : see declaration of 'getenv' 1>c:\users\andy\documents\visual studio 2005\projects\unittesttests\unittesttests\unittesttests.cpp(45) : error C2146: syntax error : missing ')' before identifier 'BOOST_PP_IIF_BOOST_PP_BOOL_0' 1>c:\users\andy\documents\visual studio 2005\projects\unittesttests\unittesttests\unittesttests.cpp(45) : error C2780: 'bool boost::test_tools::tt_detail::check_frwd(Pred,const boost::unit_test::lazy_ostream &,boost::test_tools::const_string,size_t,boost::test_tools::tt_detail::tool_level,boost::test_tools::tt_detail::check_type,const Arg0 &,const char *,const Arg1 &,const char *,const Arg2 &,const char *,const Arg3 &,const char *,const Arg4 &,const char *)' : expects 16 arguments - 6 provided 1> c:\program files (x86)\boost\boost_1_40\boost\test\test_tools.hpp(523) : see declaration of 'boost::test_tools::tt_detail::check_frwd' 1>c:\users\andy\documents\visual studio 2005\projects\unittesttests\unittesttests\unittesttests.cpp(45) : error C2780: 'bool boost::test_tools::tt_detail::check_frwd(Pred,const boost::unit_test::lazy_ostream &,boost::test_tools::const_string,size_t,boost::test_tools::tt_detail::tool_level,boost::test_tools::tt_detail::check_type,const Arg0 &,const char *,const Arg1 &,const char *,const Arg2 &,const char *,const Arg3 &,const char *)' : expects 14 arguments - 6 provided 1> c:\program files (x86)\boost\boost_1_40\boost\test\test_tools.hpp(523) : see declaration of 'boost::test_tools::tt_detail::check_frwd' 1>c:\users\andy\documents\visual studio 2005\projects\unittesttests\unittesttests\unittesttests.cpp(45) : error C2780: 'bool boost::test_tools::tt_detail::check_frwd(Pred,const boost::unit_test::lazy_ostream &,boost::test_tools::const_string,size_t,boost::test_tools::tt_detail::tool_level,boost::test_tools::tt_detail::check_type,const Arg0 &,const char *,const Arg1 &,const char *,const Arg2 &,const char *)' : expects 12 arguments - 6 provided 1> c:\program files (x86)\boost\boost_1_40\boost\test\test_tools.hpp(523) : see declaration of 'boost::test_tools::tt_detail::check_frwd' 1>c:\users\andy\documents\visual studio 2005\projects\unittesttests\unittesttests\unittesttests.cpp(45) : error C2780: 'bool boost::test_tools::tt_detail::check_frwd(Pred,const boost::unit_test::lazy_ostream &,boost::test_tools::const_string,size_t,boost::test_tools::tt_detail::tool_level,boost::test_tools::tt_detail::check_type,const Arg0 &,const char *,const Arg1 &,const char *)' : expects 10 arguments - 6 provided 1> c:\program files (x86)\boost\boost_1_40\boost\test\test_tools.hpp(523) : see declaration of 'boost::test_tools::tt_detail::check_frwd' 1>c:\users\andy\documents\visual studio 2005\projects\unittesttests\unittesttests\unittesttests.cpp(45) : error C2780: 'bool boost::test_tools::tt_detail::check_frwd(Pred,const boost::unit_test::lazy_ostream &,boost::test_tools::const_string,size_t,boost::test_tools::tt_detail::tool_level,boost::test_tools::tt_detail::check_type,const Arg0 &,const char *)' : expects 8 arguments - 6 provided 1> c:\program files (x86)\boost\boost_1_40\boost\test\test_tools.hpp(523) : see declaration of 'boost::test_tools::tt_detail::check_frwd' 1>c:\users\andy\documents\visual studio 2005\projects\unittesttests\unittesttests\unittesttests.cpp(45) : error C2059: syntax error : ')' 1>Build log was saved at "file://c:\Users\andy\Documents\Visual Studio 2005\Projects\UnitTestTests\UnitTestTests\Debug\BuildLog.htm" It seems to have some real problems with the BOOST_CHECK_PREDICATE macro why is this? Thank you, Andrew J. Leer 1>UnitTestTests - 7 error(s), 5 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========

2 7

Generic Properties and serializable boost::any.
by Mauricio Gomes 24 Feb '10

24 Feb '10

Dear All, Googling the subject I see there were some discussion about the subject sometime ago. Does anybody has implemented a serializable version (in the sense of the boost serialization library) of boost::any ? If you do, would you mind sharing it ? I want to implement a generic Property class. I have taken a look at Property Tree but that requires an homogeneous container (it requires to pass the data type in the constructor template parameter. I would like to pass only the key type and use boost::any to store the values. However I need it to be serializable. I am learning generic programming and I am a bit out of my league here so I would like to check if anybody has already ventured in making boost::any serializable before I try it myself. The goal would be to get something that would give me functionality similar to get<T>(key) as we can find in Property Tree but requiring the data type in a set<T>(key) method instead of asking for it in the constructor. Does it make sense ? Am I in the right path using boost::any ? Is it even possible in C++ ? Thank you for your attention, -- Mau

3 3

[graph] [parallel graph] property and distributedS
by Andreas Zilian 24 Feb '10

24 Feb '10

Hello, using the parallel graph library, I try to combine the property definition for a vertex typedef property<vertex_rank_t, int, VVV> vertex_property_t; with the vertex storage type distributedS in a distributed adjacency_list. Unfortunately this does not compile in the form listed below. Now, I would like to learn why the code actually compiles fine if a) distributedS is changed to vecS (see typdef vertex_storage_t), b) property<vertex_rank_t, int, VVV> is changed to VVV (see typedef vertex_property_t). I need the property vertex_rank_t for redistribution of the graph. Thank you very much, Andreas #include <boost/graph/use_mpi.hpp> #include <boost/graph/distributed/adjacency_list.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> using namespace boost; using boost::graph::distributed::mpi_process_group; struct VVV { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { } }; //typedef vecS vertex_storage_t ; typedef distributedS<mpi_process_group, vecS> vertex_storage_t ; //typedef VVV vertex_property_t; typedef property<vertex_rank_t, int, VVV> vertex_property_t; typedef adjacency_list<vecS, vertex_storage_t, directedS, vertex_property_t> G; int main () { G g(10); }

1 0

linking problems
by Christian Meesters 24 Feb '10

24 Feb '10

Hi, Perhaps a bit off-topic, but I'm new to boost, so I don't know better. My program is named yamas. Now, when I do g++ -o trunk/yamas.o -c -fopenmp -O3 -Wall trunk/yamas.cpp there aren't any warnings or errors, but g++ -o yamas -fopenmp trunk/yamas.o tells me yamas.cpp:(.text+0x362): undefined reference to `boost::program_options::options_description::m_default_line_length' and goes on with many more compiler messages. My question now is, how can I make g++ aware of boost during the linking process. I tinkered with -L/usr/local/lib (where my boost libraries are), but without success. Specifically stating -llibboost_program_options lets g++ tell me that I cannot find this library. However, /usr/local/lib is in LD_LIBRARY_PATH and libboost_program_options.so in there - installed today. Any hints for me? TIA Christian

2 2

[BGL] adjacency_iterator invalidation with adjacency_list<listS, listS, unorderedS>
by cobalto 24 Feb '10

24 Feb '10

According to http://www.boost.org/doc/libs/1_39_0/libs/graph/doc/adjacency_list.html, adjacency_iterators into adjacency_list<listS, listS, unorderedS, ... > graphs should not be invalidated by calls to clear_vertex() and remove_vertex(). However, running the below code results in iterator invalidation directly following the call to clear_vertex() >From most likely to least likely, am I 1) doing something wrong, 2)misreading something in the documentation, or 3) encountering a bug? using namespace boost; typedef property<vertex_name_t, unsigned short> usVertName; typedef boost::adjacency_list< listS, listS, undirectedS, usVertName > Graph; typedef boost::graph_traits<Graph>::vertex_descriptor Vertex; void RemoveVertAndNeighbors(Vertex v, Graph& g) { typedef boost::graph_traits<Graph>::adjacency_iterator AdjVertIt; AdjVertIt avi, avinext, av_end; tie(avi, av_end)=adjacent_vertices(v,g); for (avinext=avi; avi != av_end; avi=avinext) { ++avinext; //avinext is a valid iterator here clear_vertex(*avi,g); //Should Invalidate Edge Iterators and Edge Refs that touch Vertex *avi //******ERROR: avinext appears invalid*******// //either no longer points to the same element or otherwise crashes the program remove_vertex(*avi,g); //Should Invalidate avi and any other Vertex Reference pointing to *avi //But should not affect avinext } remove_vertex(v,g); } Any Help is greatly Appreciated -- View this message in context: http://old.nabble.com/-BGL--adjacency_iterator-invalidation-with-adjacency_… Sent from the Boost - Users mailing list archive at Nabble.com.

2 5

fusion struct adapted, latest trunk changes
by Hicham Mouline 24 Feb '10

24 Feb '10

Christopher, I had a temporary tweak to boost\fusion\adapted\struct\adapt_struct.hpp and boost\fusion\adapted\struct\extension.hpp where I added a struct_member_name template that returned the const char * name of a given member of the struct. In boost\fusion\adapted\struct\extension.hpp, there was the primary template template <typename Struct, int i> struct_member_name; and in boost\fusion\adapted\struct\adapt_struct.hpp, I added in the BOOST_FUSION_ADAPT_STRUCT_C macro (given to me by Joel) the following: template <> \ struct struct_member_name<name, i> \ { \ typedef char const* type; \ static type call() \ { \ return BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(2, 1, xy)); \ } \ }; I had promised Joel I would add this to the other adapted "things" (other headers). Then a user API (not extension API) would be added to access these. 1. temporarily, which files should I add this tweak to (boost\fusion\adapted\struct\extension.hpp is gone) 2. I understand your changes are about adapting class/struct templates. Where should I add this tweak to if I wish to use it for adapted templates, regards,

1 0

Re: [Boost-users] multi_array : using double** from 3rd party lib
by Hicham Mouline 24 Feb '10

24 Feb '10

-----Original Message----- From: "alfC" [alfredo.correa(a)gmail.com] Date: 24/02/2010 08:24 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] multi_array : using double** from 3rd party lib > and I wish to pass the "subarray" as a double** argument and call their function .It's not possible, is it? you have to create the array of pointers: double trace(double** arr){ double ret=0; for(unsigned i=0; i!=4; ++i){ ret+=arr[i][i]; } return ret; } int main(){ boost::multi_array<double, 7> a(boost::extents[2][2][2][2][2][4] [4]); a[1][1][1][1][1][0][0]=8; a[1][1][1][1][1][3][3]=3; double** sarr=new double*[4]; for(unsigned i=0; i!=4; ++i){ sarr[i]=(&a[1][1][1][1][1][i][0]); } std::cout<< trace( sarr ) <<std::endl; //outputs 11 return 0; } , but probably you wanted something simpler. > I am actually able to override their function that takes in a double** data. > > Can it work then? If you can "override" (sic) the function that takes the data, can't you just replace by some multi_array<double, 2>, if there is no pointer arithmetic in the function then that it is easy to do. right? Alfredo _______________________________________________ The function is a virtual member function of a class. It has signature virtual f(double** data, ....) So I can override in my derived class, but then I can only override it with the same signature. creating the array of pointers is what the library does in their default implementation. But for me, I have the data already in the array, so it is a waste of runtime and memory, anyways, you confirmed there is no way around this, thanks very much,

1 0

multi_array : using double** from 3rd party lib
by Hicham Mouline 24 Feb '10

24 Feb '10

Hello, I have a 3rd party library which exposes a function that takes a double** data argument. I looked into its source and saw that they use this notation data[i][j] with i and j varying from imin to imax and j from jmin to jmax Now I have a boost::multi_array<double, 7> marray and I have 2 dimensions that are given to me by the user at runtime, between 0 and 6. They may be contiguous or not. and I wish to pass the "subarray" as a double** argument and call their function .It's not possible, is it? I am actually able to override their function that takes in a double** data. Can it work then? regards,

3 2

Boost and Pipes
by 'Buser' 24 Feb '10

24 Feb '10

Hi, I am looking to use Named Pipes cross platform with non-blocking read & writes. Looking through the boost documentation, I couldn't find any Pipe Abstraction in boost. I was wondering if there is anything in the works for pipes support in Boost or if anyone has some existing implementation which can be used? ---- This message was sent using MailFool. Message id: "GMM12481917PKNR". Visit http://www.MailFool.com for more info or if you doubt the authenticity of the e-mail.

1 0

[unit testing][build] basic guidance needed, please
by er 24 Feb '10

24 Feb '10

Hello, I'm making first (wrong) steps with the unit test suite. Could someone please guide me in troubleshooting the problems below? The command is executed from directory /boost_1_41_0/libs/assign/test Apparently the command generates some objects files in both /bin.v2/libs/assign/test and /bin.v2/libs/test/build/gcc-4.2.1/link-static as well as libboost_unit_test_framework.a in the latter directory. Thanks. $ bjam debug release warning: No toolsets are configured. warning: Configuring default toolset "gcc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html ...patience... ...patience... ...found 1491 targets... ...updating 140 targets... gcc.compile.c++ ../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/debug/basic.o gcc.link ../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/debug/basic ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/debug/basic" -Wl,--start-group "../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/debug/basic.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/debug/basic... ...skipped <p../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/debug>basic.run for lack of <p../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/debug>basic... gcc.compile.c++ ../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/debug/std.o gcc.link ../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/debug/std ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/debug/std" -Wl,--start-group "../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/debug/std.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/debug/std... ...skipped <p../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/debug>std.run for lack of <p../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/debug>std... gcc.compile.c++ ../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/debug/list_of.o gcc.link ../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/debug/list_of ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/debug/list_of" -Wl,--start-group "../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/debug/list_of.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/debug/list_of... ...skipped <p../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/debug>list_of.run for lack of <p../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/debug>list_of... gcc.compile.c++ ../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/debug/ptr_list_of.o gcc.link ../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/debug/ptr_list_of ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/debug/ptr_list_of" -Wl,--start-group "../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/debug/ptr_list_of.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/debug/ptr_list_of... ...skipped <p../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/debug>ptr_list_of.run for lack of <p../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/debug>ptr_list_of... gcc.compile.c++ ../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/debug/static_list_of.o gcc.link ../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/debug/static_list_of ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/debug/static_list_of" -Wl,--start-group "../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/debug/static_list_of.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/debug/static_list_of... ...skipped <p../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/debug>static_list_of.run for lack of <p../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/debug>static_list_of... gcc.compile.c++ ../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/debug/tuple_list_of.o gcc.link ../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/debug/tuple_list_of ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/debug/tuple_list_of" -Wl,--start-group "../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/debug/tuple_list_of.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/debug/tuple_list_of... ...skipped <p../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/debug>tuple_list_of.run for lack of <p../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/debug>tuple_list_of... gcc.compile.c++ ../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/debug/list_inserter.o gcc.link ../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/debug/list_inserter ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/debug/list_inserter" -Wl,--start-group "../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/debug/list_inserter.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/debug/list_inserter... ...skipped <p../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/debug>list_inserter.run for lack of <p../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/debug>list_inserter... gcc.compile.c++ ../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/debug/ptr_list_inserter.o gcc.link ../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/debug/ptr_list_inserter ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/debug/ptr_list_inserter" -Wl,--start-group "../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/debug/ptr_list_inserter.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/debug/ptr_list_inserter... ...skipped <p../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/debug>ptr_list_inserter.run for lack of <p../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/debug>ptr_list_inserter... gcc.compile.c++ ../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/debug/ptr_map_inserter.o gcc.link ../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/debug/ptr_map_inserter ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/debug/ptr_map_inserter" -Wl,--start-group "../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/debug/ptr_map_inserter.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/debug/ptr_map_inserter... ...skipped <p../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/debug>ptr_map_inserter.run for lack of <p../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/debug>ptr_map_inserter... gcc.compile.c++ ../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/debug/list_of_workaround.o gcc.link ../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/debug/list_of_workaround ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/debug/list_of_workaround" -Wl,--start-group "../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/debug/list_of_workaround.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/debug/list_of_workaround... ...skipped <p../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/debug>list_of_workaround.run for lack of <p../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/debug>list_of_workaround... gcc.compile.c++ ../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/debug/email_example.o gcc.link ../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/debug/email_example ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/debug/email_example" -Wl,--start-group "../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/debug/email_example.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/debug/email_example... ...skipped <p../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/debug>email_example.run for lack of <p../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/debug>email_example... gcc.compile.c++ ../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/debug/my_vector_example.o gcc.link ../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/debug/my_vector_example ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/debug/my_vector_example" -Wl,--start-group "../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/debug/my_vector_example.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/debug/my_vector_example... ...skipped <p../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/debug>my_vector_example.run for lack of <p../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/debug>my_vector_example... gcc.compile.c++ ../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/debug/multi_index_container.o gcc.link ../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/debug/multi_index_container ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/debug/multi_index_container" -Wl,--start-group "../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/debug/multi_index_container.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/debug/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g ...failed gcc.link ../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/debug/multi_index_container... ...skipped <p../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/debug>multi_index_container.run for lack of <p../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/debug>multi_index_container... common.mkdir ../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/release/basic.o common.mkdir ../../../bin.v2/libs/test/build/gcc-4.2.1/release common.mkdir ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/compiler_log_formatter.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/debug.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/exception_safety.o In file included from ../../../boost/detail/lcast_precision.hpp:16, from ../../../boost/lexical_cast.hpp:31, from ../../../boost/test/interaction_based.hpp:27, from ../../../boost/test/impl/exception_safety.ipp:30, from ../../../libs/test/src/exception_safety.cpp:16: ../../../boost/integer_traits.hpp:164:66: warning: use of C99 long long integer constant ../../../boost/integer_traits.hpp:164:77: warning: use of C99 long long integer constant ../../../boost/integer_traits.hpp:170:70: warning: use of C99 long long integer constant gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/execution_monitor.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/framework.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/interaction_based.o In file included from ../../../boost/detail/lcast_precision.hpp:16, from ../../../boost/lexical_cast.hpp:31, from ../../../boost/test/interaction_based.hpp:27, from ../../../boost/test/impl/interaction_based.ipp:26, from ../../../libs/test/src/interaction_based.cpp:16: ../../../boost/integer_traits.hpp:164:66: warning: use of C99 long long integer constant ../../../boost/integer_traits.hpp:164:77: warning: use of C99 long long integer constant ../../../boost/integer_traits.hpp:170:70: warning: use of C99 long long integer constant gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/logged_expectations.o In file included from ../../../boost/detail/lcast_precision.hpp:16, from ../../../boost/lexical_cast.hpp:31, from ../../../boost/test/interaction_based.hpp:27, from ../../../boost/test/impl/logged_expectations.ipp:28, from ../../../libs/test/src/logged_expectations.cpp:16: ../../../boost/integer_traits.hpp:164:66: warning: use of C99 long long integer constant ../../../boost/integer_traits.hpp:164:77: warning: use of C99 long long integer constant ../../../boost/integer_traits.hpp:170:70: warning: use of C99 long long integer constant gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/plain_report_formatter.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/progress_monitor.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/results_collector.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/results_reporter.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/test_tools.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/unit_test_log.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/unit_test_main.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/unit_test_monitor.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/unit_test_parameters.o In file included from ../../../boost/detail/lcast_precision.hpp:16, from ../../../boost/lexical_cast.hpp:31, from ../../../boost/test/utils/runtime/interpret_argument_value.hpp:28, from ../../../boost/test/utils/runtime/cla/argument_factory.hpp:25, from ../../../boost/test/utils/runtime/cla/typed_parameter.hpp:25, from ../../../boost/test/utils/runtime/cla/basic_parameter.hpp:21, from ../../../boost/test/utils/runtime/cla/named_parameter.hpp:21, from ../../../boost/test/utils/runtime/cla/dual_name_parameter.hpp:21, from ../../../boost/test/impl/unit_test_parameters.ipp:31, from ../../../libs/test/src/unit_test_parameters.cpp:16: ../../../boost/integer_traits.hpp:164:66: warning: use of C99 long long integer constant ../../../boost/integer_traits.hpp:164:77: warning: use of C99 long long integer constant ../../../boost/integer_traits.hpp:170:70: warning: use of C99 long long integer constant gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/unit_test_suite.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/xml_log_formatter.o gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/xml_report_formatter.o gcc.archive ../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a gcc.link ../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/release/basic ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/release/basic" -Wl,--start-group "../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/release/basic.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/release/basic... ...skipped <p../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/release>basic.run for lack of <p../../../bin.v2/libs/assign/test/basic.test/gcc-4.2.1/release>basic... common.mkdir ../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/release/std.o gcc.link ../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/release/std ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/release/std" -Wl,--start-group "../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/release/std.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/release/std... ...skipped <p../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/release>std.run for lack of <p../../../bin.v2/libs/assign/test/std.test/gcc-4.2.1/release>std... common.mkdir ../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/release/list_of.o gcc.link ../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/release/list_of ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/release/list_of" -Wl,--start-group "../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/release/list_of.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/release/list_of... ...skipped <p../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/release>list_of.run for lack of <p../../../bin.v2/libs/assign/test/list_of.test/gcc-4.2.1/release>list_of... common.mkdir ../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/release/ptr_list_of.o gcc.link ../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/release/ptr_list_of ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/release/ptr_list_of" -Wl,--start-group "../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/release/ptr_list_of.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/release/ptr_list_of... ...skipped <p../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/release>ptr_list_of.run for lack of <p../../../bin.v2/libs/assign/test/ptr_list_of.test/gcc-4.2.1/release>ptr_list_of... common.mkdir ../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/release/static_list_of.o gcc.link ../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/release/static_list_of ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/release/static_list_of" -Wl,--start-group "../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/release/static_list_of.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/release/static_list_of... ...skipped <p../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/release>static_list_of.run for lack of <p../../../bin.v2/libs/assign/test/static_list_of.test/gcc-4.2.1/release>static_list_of... common.mkdir ../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/release/tuple_list_of.o gcc.link ../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/release/tuple_list_of ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/release/tuple_list_of" -Wl,--start-group "../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/release/tuple_list_of.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/release/tuple_list_of... ...skipped <p../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/release>tuple_list_of.run for lack of <p../../../bin.v2/libs/assign/test/tuple_list_of.test/gcc-4.2.1/release>tuple_list_of... common.mkdir ../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/release/list_inserter.o gcc.link ../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/release/list_inserter ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/release/list_inserter" -Wl,--start-group "../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/release/list_inserter.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/release/list_inserter... ...skipped <p../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/release>list_inserter.run for lack of <p../../../bin.v2/libs/assign/test/list_inserter.test/gcc-4.2.1/release>list_inserter... common.mkdir ../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/release/ptr_list_inserter.o gcc.link ../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/release/ptr_list_inserter ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/release/ptr_list_inserter" -Wl,--start-group "../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/release/ptr_list_inserter.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/release/ptr_list_inserter... ...skipped <p../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/release>ptr_list_inserter.run for lack of <p../../../bin.v2/libs/assign/test/ptr_list_inserter.test/gcc-4.2.1/release>ptr_list_inserter... common.mkdir ../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/release/ptr_map_inserter.o gcc.link ../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/release/ptr_map_inserter ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/release/ptr_map_inserter" -Wl,--start-group "../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/release/ptr_map_inserter.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/release/ptr_map_inserter... ...skipped <p../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/release>ptr_map_inserter.run for lack of <p../../../bin.v2/libs/assign/test/ptr_map_inserter.test/gcc-4.2.1/release>ptr_map_inserter... common.mkdir ../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/release/list_of_workaround.o gcc.link ../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/release/list_of_workaround ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/release/list_of_workaround" -Wl,--start-group "../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/release/list_of_workaround.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/release/list_of_workaround... ...skipped <p../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/release>list_of_workaround.run for lack of <p../../../bin.v2/libs/assign/test/list_of_workaround.test/gcc-4.2.1/release>list_of_workaround... common.mkdir ../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/release/email_example.o gcc.link ../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/release/email_example ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/release/email_example" -Wl,--start-group "../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/release/email_example.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/release/email_example... ...skipped <p../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/release>email_example.run for lack of <p../../../bin.v2/libs/assign/test/email_example.test/gcc-4.2.1/release>email_example... common.mkdir ../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/release/my_vector_example.o gcc.link ../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/release/my_vector_example ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/release/my_vector_example" -Wl,--start-group "../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/release/my_vector_example.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/release/my_vector_example... ...skipped <p../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/release>my_vector_example.run for lack of <p../../../bin.v2/libs/assign/test/my_vector_example.test/gcc-4.2.1/release>my_vector_example... common.mkdir ../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/release gcc.compile.c++ ../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/release/multi_index_container.o gcc.link ../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/release/multi_index_container ld: unknown option: --start-group collect2: ld returned 1 exit status "g++" -o "../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/release/multi_index_container" -Wl,--start-group "../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/release/multi_index_container.o" "../../../bin.v2/libs/test/build/gcc-4.2.1/release/link-static/libboost_unit_test_framework.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -Wl,--strip-all ...failed gcc.link ../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/release/multi_index_container... ...skipped <p../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/release>multi_index_container.run for lack of <p../../../bin.v2/libs/assign/test/multi_index_container.test/gcc-4.2.1/release>multi_index_container... ...failed updating 26 targets... ...skipped 52 targets... ...updated 62 targets...

2 2

Help make boost::multi_array code generic!
by Joey Mukherjee 24 Feb '10

24 Feb '10

I have some code which makes use of boost::multi_array that I would like to make more generic, but I am incapable of groking the error messages. I am hoping some one can shed some light on this. I have a one dimensional array of number which is actually a tensor of variable size. I have a vector (vinfo._sizes) which contains the size of each of the dimensions. In this case, I am using the 3D version. I have another vector (local_subsensors) which contains a specific slice of the 3D view (i.e. reduce the 3D to 2D) that I am seeking or a -1 to mean I want everything in the row/column. I am also given an X/Y variable to return out a specific value from this new 2D matrix. This code works in constructing a view of this type: typedef boost::const_multi_array_ref <double, 3>array_type; array_type::index_gen indices; array_type multi_array (&(vals [0]), vinfo._sizes); if ((local_subsensors [0] == -1) &&(local_subsensors [1] == -1)) { ret_val = (array_type::const_array_view<2>::type (multi_array [indices [range ()][range()][local_subsensors[2]]])) [whichX][whichY]; } else if ((local_subsensors [0] == -1) &&(local_subsensors [2] == -1)) { ret_val = (array_type::const_array_view<2>::type (multi_array [indices [range()][local_subsensors[1]][range()]])) [whichX][whichY]; } else if ((local_subsensors [1] == -1) &&(local_subsensors [2] == -1)) { ret_val = (array_type::const_array_view<2>::type (multi_array [indices [local_subsensors[0]][range ()][range()]])) [whichX][whichY]; } Here's my attempt at making this generic and it does not work. Can someone tell me why? range Dim [3]; for (unsigned int i = 0; i < vinfo._sizes.size(); ++i) if (local_subsensors [i] == -1) Dim [i] =range (); else Dim [i] = range (local_subsensors [i]); slice = multi_array [indices [Dim [0]][Dim [1]][Dim [2]]]; Thanks in advance! Joey

1 0

shared_ptr / auto_ptr
by Chard 23 Feb '10

23 Feb '10

We've recently been evaluating a move from boost 1.38 to 1.42 [MSVC71], and we had some code that breaks down to the following: [1] struct T {}; [2] std::auto_ptr<T> ap; [3] boost::shared_ptr<T> sp = ap; Line [3] stopped compiling because of the 'explicit' introduced (in shared_ptr.hpp) at line [L] (below). >From smart_ptr/shared_ptr.hpp: [A] template<class Y> [B] explicit shared_ptr(std::auto_ptr<Y> & r): px(r.get()), pn() [C] { [D] Y * tmp = r.get(); [E] pn = boost::detail::shared_count(r); [F] boost::detail::sp_enable_shared_from_this( this, tmp, tmp ); [G] } [H] [I]#if !defined( BOOST_NO_SFINAE ) && !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) [J] [K] template<class Ap> [L] explicit shared_ptr( Ap r, typename boost::detail::sp_enable_if_auto_ptr<Ap, int>::type = 0 ): px( r.get() ), pn() [M] { [N] typename Ap::element_type * tmp = r.get(); [O] pn = boost::detail::shared_count( r ); [P] boost::detail::sp_enable_shared_from_this( this, tmp, tmp ); [Q] } The fix is trivial, but what I am curious about is: - the 'explicit' appears to have been removed at version 1.35 (i.e. it was there at 1.34) and then re-introduced at 1.39. Is there some history to this? and - it looks like our code was falling into the second overload with 1.38 (the first overload was always explicit); with a fix it will now select the first overload, so for what case does the second overload now exist? --

4 3

atomic_count overflow/underflow behaviour
by Narcoleptic Electron 23 Feb '10

23 Feb '10

What is the behaviour of boost::detail::atomic_count overflow? I realize that overflow for a signed long is undefined, but it is possible that each platform-specific atomic increment operator handles overflow in some documented way, which in sum would constitute a defined behaviour for atomic_count overflow. Documenting this behaviour (along with that of underflow, which is presumably the same) in the atomic_count documentation would be extremely helpful.

1 1

[BGL] Very slow adjacency_list deallocation/reallocation for debug builds
by T MacAdam 23 Feb '10

23 Feb '10

Does anyone know a way to speed up adjacency_list deallocation for debug builds? I've done some timing tests (see code below - should build as-is in VC9) and found the adjacency_list creates quite quickly, but is terrible during deallocation (actually, it can be as bad on creation of the graph, too, if you are building up the graph incrementally using a vecS for your vertex storage that requires reallocation as the size grows). In a release build, everything is blazing fast, but it's so slow when linked against the debug CRT that I essentially cannot debug my app. And the graph doesn't have to be too big (see code below, 50K results in a deallocation time of 171 sec if I use vecS and 268 sec if I use listS, and that's on a quite good workstation; my production graphs are > 100K vertices). BTW, I'm building with Visual C++ 9 (2008). #include <time.h> #include <iostream> #include <algorithm> #include <boost/graph/adjacency_list.hpp> using namespace std; int _tmain(int argc, _TCHAR* argv[]) { const int size = 50000; //typedef boost::adjacency_list< boost::listS, boost::vecS, boost::bidirectionalS > MyGraphType; // try storing vertices in vector<> typedef boost::adjacency_list< boost::listS, boost::listS, boost::bidirectionalS > MyGraphType; // try storing vertices in list<> typedef boost::graph_traits< MyGraphType >::vertex_descriptor MyVertexDescriptor; typedef boost::graph_traits< MyGraphType >::edge_descriptor MyEdgeDescriptor; MyGraphType *myGraph = new MyGraphType(); vector<MyVertexDescriptor> vertices(size); { cout << "Adding vertices...Started:" << endl; clock_t m_clockStart = ::clock(); for( int i = 0; i < size; ++i ) vertices[i] = boost::add_vertex(*myGraph); cout << "Adding vertices...Done: " << (double)((::clock()-m_clockStart)/CLOCKS_PER_SEC) << " seconds" << endl; } { cout << "Adding edges...Started:" << endl; clock_t m_clockStart = ::clock(); for( int i = 0; i < size-1; ++i ) boost::add_edge( vertices[i+1], vertices[i], *myGraph ); cout << "Adding edges...Done: " << (double)((::clock()-m_clockStart)/CLOCKS_PER_SEC) << " seconds" << endl; } { cout << "Deallocating graph...Started:" << endl; clock_t m_clockStart = ::clock(); delete myGraph; cout << "Deallocating graph...Done: " << (double)((::clock()-m_clockStart)/CLOCKS_PER_SEC) << " seconds" << endl; } return 0; } __________________________________________________________________ Looking for the perfect gift? Give the gift of Flickr! http://www.flickr.com/gift/

3 2

Memory Leak with ASIO SSL examples on Linux in Boost 1.40
by Madhan Kanagavel 23 Feb '10

23 Feb '10

Hello, We have been running a Boost ASIO 1.40 based server successfully for a while, handling hundreds of connections without any issues. But we recently saw some unusual memory usage and started digging into it a bit. We use Asynchronous IO with SSL. We are seeing that in the server side every time a connection occurs some memory is being used up and never getting really freed after the connection goes away. We use Resident Memory value of the server to measure memory usage of the server process. This occurs only in Linux, works fine under Windows. This is easy to reproduce: simply take the server sample and run it under Linux. http://www.boost.org/doc/libs/1_37_0/doc/html/boost_asio/example/ssl/server… (The only change there being to make SSL verification to none.) For the client side, make a lot of connections: typedef boost::shared_ptr<client> client_ptr; std::vector<client_ptr> clients; for (int idx = 0; idx < 200; idx++) { client_ptr new_client(new client(io_service, ctx, iterator)); clients.push_back(new_client); } At the end of the client test program run, the server would have grown in memory by about 10 MB. If you run the client program again, by another 10 MB. We also ran valgrind on the server side, but nothing significant showed up on where the memory is going. Doing the same with non-SSL sample program works fine, no change in server memory. If you need additional information, please let me know, or if we are making some stupid mistake, any help pointing us in the right direction would be much appreciated. Thanks and Best Regards, M.

3 2