- Boost-users - lists.boost.org

pcap_loop callback with boost::function and boost::bind
by Clemens Gruber 28 Jul '11

28 Jul '11

Hi, I am writing a statistical protocol analyzer running under Windows with WinPcap. The problem is: The pcap_loop function for starting to capture the packets wants a C style callback function, but I need that callback function to have access to several class variables, so this callback function should be a member function. I know that it is not possible to use a member function directly, because of the additional parameter, the pointer to the class. I thought, maybe I could use boost::function and boost::bind, but I am not sure if my solution is correct, so it would be very nice if some of you guys could just look over it and tell me if this is a good way to do this. This is my code for starting the capture: void MyClass::startCapturing() { boost::function < void (u_char *, const struct pcap_pkthdr *, const u_char *) > f; f = boost::bind(&MyClass::packetHandler, this, _1, _2, _3); pcap_handler p = *(f.target<pcap_handler>()); pcap_loop(hnd, 0, p, NULL); } This the callback function I want pcap_loop to call: void MyClass::packetHandler(u_char *param, const struct pcap_pkthdr *header, const u_char *pkt_data) { /* Do something with the packet.. */ } And this is the signature of the callback argument in the pcap_loop function, as defined in pcap.h: typedef void(*) pcap_handler(u_char *param, const struct pcap_pkthdr *pkt_header, const u_char *pkt_data) If you have an alternative, I would be glad to hear it! Maybe there's a much simpler solution, I didn't think about. Best regards, Clemens

2 1

MSVC Visualizers Update
by Filip Konvička 28 Jul '11

28 Jul '11

Hi all, I've just updated the Boost visualizers wiki page at https://svn.boost.org/trac/boost/wiki/DebuggerVisualizers I updated the visualizer for Boost.MultiIndex, which did not work since Boost 1.35. I also added new visualizers for Boost.DateTime (ptime and time_duration) and a simple boost::shared_ptr visualizer. The visualizers are available for checkout via SVN at https://svn.boost.org/svn/boost/sandbox/boost_docs/subprojects/DebuggerVisu… Cheers, Filip

6 7

astar_search_no_init
by anilpanicker 28 Jul '11

28 Jul '11

I'm trying to compile the puzzle 8 given in this link http://www.cs.rpi.edu/~beevek/research/astar_bgl04.pdf using astar_search_no_init() but I get this error "error C2106: '=' : left operand must be l-value" I'm using VS2010. Can someone please help me Here is my entire code #include<boost/graph/adjacency_list.hpp> #include<boost/graph/astar_search.hpp> #include<iostream> #include<vector> #include<list> using namespace std; using namespace boost; class puzzle_state_t: public vector<int> { public: int m_row,m_col; // row and columns puzzle_state_t(){} puzzle_state_t(int r,int c): vector<int>(r*c),m_row(r),m_col(c){} //another ctor with some iterator template<typename IteratorType> puzzle_state_t(int r,int c,IteratorType beg,IteratorType en): vector<int>(beg,en)m_row(r),m_col(c){} //find the cell in the vector // rows are numbered 0,1,2 // cols are numbered 0,1,2 inline int cell(int r, int c) const { return r*m_col+c; //gives the index of vector } //get value of a cell inline int get(int r, int c) const { int index= cell(r,c); return operator[] (index);// returns value } //move between two cells inline void move(int i,int j) { int tmp=operator[] (j); operator[](j)=operator[](i); operator[](i)=tmp; } //find coordinates of an offset inline void coords(int i, int &r, int &c) const { r=i/m_col; c=i%m_col; } friend ostream& operator <<(ostream &out, const puzzle_state_t &p) { for(int i = 0; i < p.m_row; ++i) { for(int j = 0; j < p.m_col; ++j) { if(p.get(i, j) > 0) cout << p.get(i, j)<<"\t" ; else cout << "-"<<"\t"; } cout << endl; } return out; } }; //1. find out the cell with zero void generate_children(const puzzle_state_t &p, list<puzzle_state_t> &children ) { puzzle_state_t::const_iterator const_it= find(p.begin(),p.end(),0); int soffset= const_it-p.begin(); //index of array int sr,sc; p.coords(soffset,sr,sc);// got the cell if(sc>0) {//mode tile to left children.push_back(p); children.back().move(soffset,p.cell(sr,sc-1) ); } if(sc<p.m_col-1) {//move to right children.push_back(p); children.back().move(soffset,p.cell(sr,sc+1)); } if(sr>0) {//move tile to above children.push_back(p); children.back().move(soffset,p.cell(sr-1,sc) ); } if(sr<p.m_row-1) { children.push_back(p); children.back().move(soffset,p.cell(sr+1,sc) ); } } //Graph and related types //a new property tag struct vertex_puzzle_state_t { typedef vertex_property_tag kind; }; //define VertexProperties typedef property<vertex_color_t, default_color_type, property<vertex_rank_t, unsigned int, property<vertex_distance_t, unsigned int, property<vertex_predecessor_t, unsigned int, property<vertex_puzzle_state_t, puzzle_state_t, property<vertex_index_t,unsigned int> > > > > > VertexProperties; //define EdgeProperties typedef property<edge_weight_t, unsigned int> EdgeProperties; //Define Graph_type typedef adjacency_list<listS,vecS,undirectedS,VertexProperties,EdgeProperties,no_property,listS> graph_t; typedef graph_traits<graph_t>::vertex_descriptor vertex_t; typedef graph_traits<graph_t>::edge_descriptor edge_t; typedef graph_traits<graph_t>::vertex_iterator vit; typedef graph_traits<graph_t>::edge_iterator eit; //property maps //Named Parameter version //IN:weight_map- length of each edge //IN: vertex_index_map- typedef property_map<graph_t,edge_weight_t>::type WeightMap; typedef property_map<graph_t,vertex_index_t>:: type IndexMap; //OUT: predecessor_map //Out: distance_map //OUT: rank_map //OUT: color_map typedef property_map<graph_t,vertex_predecessor_t>::type PredMap; typedef property_map<graph_t,vertex_distance_t>::type DistanceMap; typedef property_map<graph_t,vertex_rank_t>::type RankMap; typedef property_map<graph_t,vertex_color_t>::type ColorMap; // custom mpa typedef property_map<graph_t,vertex_puzzle_state_t>::type StateMap; struct found_goal{}; template<typename Vertex> class puzzle_visitor : public boost::default_astar_visitor { private: list<vertex_t> &m_verticesList; puzzle_state_t &m_goal_state; public: puzzle_visitor(list<vertex_t> & vlist,puzzle_state_t &goal): m_verticesList(vlist),m_goal_state(goal){} template <class Graph> void examine_vertex(Vertex u, Graph& g) {// add states and break if it reached goal state StateMap smap= get(vertex_puzzle_state_t,g); WeightMap wmap= get(edge_weight_t,g); ColorMap cmap= get(vertex_color_t,g); if(smap[u]==m_goal) throw found_goal(); //add successors of state list<puzzle_state_t> new_vertices; generate_children(smap[u],new_vertices ); list<puzzle_state_t>::iterator it; for(it=new_vertices.begin(); it != new_vertices.end(); ++it) { //make sure this is a new state vit vi,vend; for(tie(vi,vend)=vertices(g); vi != vend; ++vi) { if(*vi== *it ) break; } if(vi != vend)//not new { pair<edge_t,bool> eAdded=add_edge(u,*vi,g); if(eAdded) put(wmap,eAdded.first); }else {//new Vertex v= add_vertex(g); put(cmap,v,white_color); pair<edge_t,bool> eAdded=add_edge(u,v,g); if(eAdded) put(wmap,eAdded.first) } } } }; // the distance huristics // sum of (row_goal-row_current) + (col_goal-col_current) for all tiles class manhattan_dist: public astar_heuristic<graph_t,unsigned int> { puzzle_state_t &m_goal_state; StateMap m_smap; inline unsigned int myabs(int i) { return static_cast<unsigned int> (i<0 ? -i:i); } public: manhattan_dist(puzzle_state_t &goal, StateMap &smap): m_goal_state(goal),m_smap(smap){} unsigned int operator() (vertex_t u) { unsigned int md=0; puzzle_state_t::const_iterator it_i,it_j; int ir,ic,jr,jc; for(it_i=m_smap[u].begin(); it_i != m_smap[u].end(); ++it_i) { it_j=find(m_goal_state.begin(),m_goal_state.end(),*it_i); m_smap[u].coords(it_i - m_smap[u].begin(), ir, ic); m_goal_state.coords(it_j - m_goal_state.begin(), jr, jc); md += myabs(jr - ir) + myabs(jc - ic); } return md; } }; int main() { //set up start_state and goal_puzzle state graph_t g; list<vertex_t> examine_seq; //maps //IN IndexMap indexMap= get(vertex_index,g); WeightMap wmap= get(edge_weight_t (),g); //OUT DistanceMap dmap= get(vertex_distance,g); ColorMap cmap= get(vertex_color,g); PredMap predessors= get(vertex_predecessor,g); RankMap rmap= get(vertex_rank,g); //custom map StateMap smap= get(vertex_puzzle_state_t (),g); //add first vertex vertex_t start = add_vertex(g); put(cmap,start,white_color); put(dmap,start,0); // int sstart []= {1,3,4,8,0,2,7,6,5}; int sgoal []= {1,2,3,8,0,4,7,6,5}; //smap[start]= puzzle_state_t(3,3,&sstart[0],&sstart[9] ); puzzle_state_t p(3,3); puzzle_state_t goal(3,3); for(int i=0; i<9; ++i) { p[i]=sstart[i]; goal[i]=sgoal[i]; } smap[start]= p; cout<<"Start state"<<endl<<endl; cout<< smap[start]<<endl; cout<<"Goal state"<<endl<<endl; cout<<goal<<endl; // puzzle_visitor<vertex_t> vis(examine_seq,goal); manhattan_dist m_dist_heuristic(goal,smap); astar_search_no_init(g, start, //source m_dist_heuristic,// heuristic visitor(vis).// vis vertex_index_map(indexMap).// IN: index_map weight_map(wmap).//IN: weight_map predecessor_map(predessors).//OUT distance_map(dmap).//OUT color_map(cmap).//OUT rank_map(rmap)//OUT ); return 0; } -- View this message in context: http://boost.2283326.n4.nabble.com/astar-search-no-init-tp3680535p3680535.h… Sent from the Boost - Users mailing list archive at Nabble.com.

3 3

bind with mem_fn style in Visual Studio 8
by John M. Dlugosz 28 Jul '11

28 Jul '11

My compiler crashes when I write: bind(&S::bar, &s1); is there some known issue with VS8? It's right after a warning issued in the mem_fn header concerning superfluous modifiers.

6 12

[Review] Lockfree review: today (July 28th) is the last day
by Hartmut Kaiser 28 Jul '11

28 Jul '11

All, Today is the last day of the review of Tim Blechmann's Lockfree library. If you're interested in this library, please consider contributing a review! If you need more time, please contact me privately. Please see the original (slightly corrected) announcement below: ----------------------------------------------------- About the library: Boost.Lockfree provides implementations of lock-free data structures. Lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. Lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines. The following data structures are provided: - boost::lockfree::fifo, a lock-free fifo queue - boost::lockfree::stack, a lock-free stack - boost::lockfree::ringbuffer, a wait-free single-producer/single-consumer ringbuffer. The library is accessible from here: http://tim.klingt.org/boost_lockfree.tar.gz. Boost.Lockfree depends on C++0x atomics. They are not well supported with current compilers yet. For this reason Boost.Lockfree depends on the *unreviewed* Boost.Atomic library, that emulates C++0x atomics for C++98. This review is about Boost.Lockfree and not about Boost.Atomic, although it is included in the tarball and the git repository. If Boost.Lockfree will be accepted, it won't be merged into trunk before Boost.Atomic is accepted. --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Regards Hartmut Review Manager

1 0

Odd Warning in transform_iterator.hpp ?
by John M. Dlugosz 28 Jul '11

28 Jul '11

I'm using the current Boost library on Microsoft Visual Studio 2005. I'm getting a warning on line 121 of transform_iterator.hpp, complaining "returning address of local variable or temporary". The line in question is the body of this function: typename super_t::reference dereference() const { return m_f(*this->base()); } My m_f supplied to the template is ordinary enough; it returns a value. The exact same situation in a unit test gives no complaint! Any idea what this is all about?

2 3

Linker options
by Sergiy Nazarenko 28 Jul '11

28 Jul '11

Hi everyone! I'm begginers to use bjam and boost. I've built python-extension. I successfully compiled it by bjam. My Jamroot file like this: use-project boost : ../../.. ; project : requirements <library>/boost/python//boost_python ; python-extension myext : myext.cpp ; And I have custom shared library with extra functions . Now I'm trying to use extra functions in python library. My questions is how put linker options in bjam project? Something like this: -L/path/to/my/library/lib64/ -lmylib.0.1 If I append include options for a file, my MyLib.h is found but linker does not find library itself. I append like this: python-extension myext : myext.cpp <include>/path/to/my/library/include; I've tried to use following # <library-path>/path/to/my/library/lib64/ # <library-file>mylib.0.1.so but with these options my extension is not compiled. Cheers,

1 0

Boost Shared Memory Compilation Issue
by Nathan Lewis 27 Jul '11

27 Jul '11

What an great library! I am trying to extend one of the shared memory examples but I am getting a compilation error. Basically I have added a vector of char_strings to the complex object and added a method to add a string to the vector. If anyone would take a moment to give me suggestion for how to fix this issue or a suggestion for how I should better add strings to this vector I would appreciate your input. The error is: error C2664: 'void boost::container::vector<T,A>::push_back(const boost::interprocess::rv<T> &)' : cannot convert parameter 1 from 'char_string *' to 'const boost::interprocess::rv<T> &' with [T=char_string, A=char_allocator] and[T=boost::container::basic_string<char,std::char_traits<char>,char_allocator>] Reason: cannot convert from 'char_string *' to 'const boost::interprocess::rv<T>' with [T=boost::container::basic_string<char,std::char_traits<char>,char_allocator>] No constructor could take the source type, or constructor overload resolution was ambiguous The code is: #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/containers/map.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/containers/string.hpp> using namespace boost::interprocess; //Typedefs of allocators and containers typedef managed_shared_memory::segment_manager segment_manager_t; typedef allocator<void, segment_manager_t> void_allocator; typedef allocator<int, segment_manager_t> int_allocator; typedef vector<int, int_allocator> int_vector; typedef allocator<int_vector, segment_manager_t> int_vector_allocator; typedef vector<int_vector, int_vector_allocator> int_vector_vector; typedef allocator<char, segment_manager_t> char_allocator; typedef basic_string<char, std::char_traits<char>, char_allocator> char_string; typedef vector<char_string, char_allocator> char_string_vector_vector; class complex_data { public: //Obviously making the variables of complex_data public isn't a good idea I am just playing here for the moment int id_; char_string char_string_; char_string_vector_vector char_string_vector_vector_; double price_; //Since void_allocator is convertible to any other allocator<T>, we simplify //the initialization taking just one allocator for all inner containers. complex_data(int id, const char *name, double prce, const void_allocator &void_alloc) : id_(id), char_string_(name, void_alloc), char_string_vector_vector_(void_alloc), price_(prce) {} // add a string --> Error is on the next line void addStringItem(char_string* s){char_string_vector_vector_.push_back(s);} }; int main () { //Remove shared memory on construction and destruction struct shm_remove { shm_remove() { shared_memory_object::remove("MySharedMemory"); } ~shm_remove(){ shared_memory_object::remove("MySharedMemory"); } } remover; //Create shared memory managed_shared_memory segment(create_only,"MySharedMemory", 65536); //An allocator convertible to any allocator<T, segment_manager_t> type void_allocator alloc_inst (segment.get_segment_manager()); //Construct the shared memory map and fill it complex_data *mymap = segment.construct<complex_data>("Complex_Data")(7, "hi", 7.0, alloc_inst); // return 0; }

4 14

[Boost][Serialization] ASSERT triggered during reading 1.40 binary archive w/ Boost 1.47
by Marc Perso 27 Jul '11

27 Jul '11

Hello Booster, We are trying to jump from Boost 1.40 to Boost 1.47 but we are facing an issue: an ASSERT is raised in debug mode when reading back binary archive generated by Boost.Serialization 1.40 with the Boost.Serialization 1.47. This ASSERT is at line 116 in basic_archive.hpp: BOOST_ASSERT(t_ <= boost::integer_traits<base_type>::const_max) And it occurs with the following platform: MSVC 8.0 and Windows XP/32bits or Win7/64bits. Looking at the load_override and save_override implementations for class_id_type in #1.40, they seem loading and saving an 'int_least16_t' (equiv. to a short for our platform) while load_override(class_id_type) for #1.47 attempts to read an 'int' (file: basic_binary_iarchive.hpp @ line 98). My questions are: - This assert suggests that we can't read back previous binary archives (#1.40 at least) with Boost.Serialization 1.47, is this a known pending issue for Boost.Serialization? - If yes, how we can manage that and how we can complete the migration to 1.47 in our case (it should be noted that we must be able to read back our 1.40 binary archives)? Is there any known patch for this problem? Any assistance will be greatly appreciated. Best regards, Marc Viala PS: I'm not sure but ticket #5567 seems already opened on this issue but has not been yet fixed (https://svn.boost.org/trac/boost/ticket/5567)

1 0

TR1 on Mac OS X
by John M. Dlugosz 27 Jul '11

27 Jul '11

It seems that the CLANG compiler that is used for Mac development, Apple LLVM 2.1, is missing _some_ of the TR1 headers. For example, it has <array>, but does not find <type_traits>. If the |boost-install-path/boost/tr1/tr1 is put first in the include path, is it set up to use the native stuff that does exist, and Boost for the rest? What about the per-feature usage that is used within the library, <boost/tr1/xxxxx.hpp> ? Will that bring in the native <array>, but the Boost type_traits.hpp? Any general suggestions on writing portable code on the Mac that will use TR1 and whatever newer features are available? Thanks, —John |

2 1