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

Multiple containers within same boost shared memory file
by Rajalakshmi Iyer 18 Dec '12

18 Dec '12

Hello, Is it possible to have 2 separate boost inter-process containers within the same shared memory file , each guarded by its own named mutex? Please advise. Thanks, Raj -- *Twitter: @Blismedia <http://twitter.com/#%21/blismedia> BlisMedia 32 Percy Street, London W1T 2DE www.blismedia.com* *This email and any attachments to it may be confidential and are intended solely for the use of the individual to whom it is addressed. Any views or opinions expressed are solely those of the author and do not necessarily represent those of Blis Media Ltd, a company registered in England and Wales with registered number 06455773. Its registered office is 32 Percy Street, London W1T 2DE, United Kingdom.* *If you are not the intended recipient of this email, you must neither take any action based upon its contents, nor copy or show it to anyone. Please contact the sender if you believe you have received this email in error. *

2 1

Calling dijkstra_shortest_paths while including boost/graph/graphviz.hpp fails
by Brammert Ottens 18 Dec '12

18 Dec '12

Hi, when I try to compile the following code it fails, but when I remove the graphviz part of the code it works just fine. Below I've added both my code and the error I get. Am I doing something wrong, or is this a bug in boost? The method ParseDIMECSGraph::ParseGraph simply parses a DIMECS challenge graph. #include "stdafx.h" #include "ParseDIMECSGraph.h" #include <boost/config.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_traits.hpp> using namespace boost; int _tmain(int argc, _TCHAR* argv[]) { typedef adjacency_list<listS, vecS, directedS, no_property, property < edge_weight_t, int >> Graph; typedef graph_traits < Graph >::edge_descriptor edge_descriptor; Graph g = *ParseDIMECSGraph::ParseGraph("sample.gr"); std::ofstream ofs( "test.dot" ); write_graphviz(ofs, g); ofs.flush(); ofs.close(); typedef boost::graph_traits < Graph >::vertex_descriptor Vertex; std::vector<Vertex> predecessor(boost::num_vertices(g)); std::vector<int> distances(boost::num_vertices(g)); Vertex source = vertex(0, g); Vertex target = vertex(5, g); property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g); property_map<Graph, vertex_index_t>::type indexmap = get(vertex_index, g); boost::dijkstra_shortest_paths( g, source, &predecessor[0], &distances[0], weightmap, indexmap, std::less<int>(), closed_plus<int>(), (std::numeric_limits<int>::max)(), 0, default_dijkstra_visitor()); return 0; } ------ Build started: Project: kShortestPath, Configuration: Release Win32 ------ 1>Compiling... 1>kShortestPath.cpp 1>C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/detail/utility/sequence_stack.hpp(225) : warning C4996: 'std::fill_n': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' 1> C:\Program Files (x86)\Microsoft Visual Studio 8\VC\include\xutility(3073) : see declaration of 'std::fill_n' 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/detail/utility/sequence_stack.hpp(223) : while compiling class template member function 'boost::xpressive::detail::sub_match_impl<BidiIter> *boost::xpressive::detail::sequence_stack<T>::push_sequence(size_t,const T &,boost::xpressive::detail::fill_t)' 1> with 1> [ 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, 1> T=boost::xpressive::detail::sub_match_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/match_results.hpp(96) : see reference to class template instantiation 'boost::xpressive::detail::sequence_stack<T>' being compiled 1> with 1> [ 1> T=boost::xpressive::detail::sub_match_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/smart_ptr/intrusive_ptr.hpp(96) : see reference to class template instantiation 'boost::xpressive::detail::results_extras<BidiIter>' being compiled 1> with 1> [ 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/smart_ptr/intrusive_ptr.hpp(95) : while compiling class template member function 'boost::intrusive_ptr<T>::~intrusive_ptr(void)' 1> with 1> [ 1> T=boost::xpressive::detail::results_extras<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/match_results.hpp(1345) : see reference to class template instantiation 'boost::intrusive_ptr<T>' being compiled 1> with 1> [ 1> T=boost::xpressive::detail::results_extras<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/regex_algorithms.hpp(257) : see reference to class template instantiation 'boost::xpressive::match_results<BidiIter>' being compiled 1> with 1> [ 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/graphviz.hpp(71) : see reference to function template instantiation 'bool boost::xpressive::regex_match<std::string,std::_String_const_iterator<_Elem,_Traits,_Alloc>>(BidiRange &,const boost::xpressive::basic_regex<BidiIter> &,boost::xpressive::regex_constants::match_flag_type,void *)' being compiled 1> with 1> [ 1> _Elem=char, 1> _Traits=std::char_traits<char>, 1> _Alloc=std::allocator<char>, 1> BidiRange=std::string, 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/graphviz.hpp(262) : see reference to function template instantiation 'std::string boost::escape_dot_string<std::string>(const T &)' being compiled 1> with 1> [ 1> T=std::string 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/graphviz.hpp(290) : see reference to function template instantiation 'void boost::write_graphviz<Graph,VertexPropertiesWriter,EdgePropertiesWriter,GraphPropertiesWriter,boost::vec_adj_list_vertex_id_map<Property,Vertex>>(std::ostream &,const Graph &,VertexPropertiesWriter,EdgePropertiesWriter,GraphPropertiesWriter,VertexID,boost::graph::detail::no_parameter)' being compiled 1> with 1> [ 1> Graph=Graph, 1> VertexPropertiesWriter=boost::default_writer, 1> EdgePropertiesWriter=boost::default_writer, 1> GraphPropertiesWriter=boost::default_writer, 1> Property=boost::no_property, 1> Vertex=__w64 unsigned int, 1> VertexID=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/graphviz.hpp(301) : see reference to function template instantiation 'void boost::write_graphviz<Graph,boost::default_writer,boost::default_writer,boost::default_writer>(std::ostream &,const Graph &,VertexPropertiesWriter,EdgePropertiesWriter,GraphPropertiesWriter,boost::graph::detail::no_parameter)' being compiled 1> with 1> [ 1> Graph=Graph, 1> VertexPropertiesWriter=boost::default_writer, 1> EdgePropertiesWriter=boost::default_writer, 1> GraphPropertiesWriter=boost::default_writer 1> ] 1> .\kShortestPath.cpp(22) : see reference to function template instantiation 'void boost::write_graphviz<Graph>(std::ostream &,const Graph &,boost::graph::detail::no_parameter)' being compiled 1> with 1> [ 1> Graph=Graph 1> ] 1>C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/detail/utility/sequence_stack.hpp(113) : warning C4996: 'std::fill_n': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' 1> C:\Program Files (x86)\Microsoft Visual Studio 8\VC\include\xutility(3073) : see declaration of 'std::fill_n' 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/detail/utility/sequence_stack.hpp(99) : while compiling class template member function 'boost::xpressive::detail::sub_match_impl<BidiIter> *boost::xpressive::detail::sequence_stack<T>::grow_(size_t,const T &)' 1> with 1> [ 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, 1> T=boost::xpressive::detail::sub_match_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1>C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(140) : error C2784: 'EdgeIndex boost::detail::get(const boost::detail::csr_edge_index_map<Vertex,EdgeIndex> &,const boost::detail::csr_edge_descriptor<Vertex,EdgeIndex> &)' : could not deduce template argument for 'const boost::detail::csr_edge_index_map<Vertex,EdgeIndex> &' from 'int *__w64 ' 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/detail/compressed_sparse_row_struct.hpp(68) : see declaration of 'boost::detail::get' 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(88) : see reference to function template instantiation 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor,UpdatableQueue,WeightMap,PredecessorMap,DistanceMap,BinaryFunction,BinaryPredicate>::gray_target<boost::detail::edge_desc_impl<Directed,Vertex>,const IncidenceGraph>(Edge,Graph &)' being compiled 1> with 1> [ 1> UniformCostVisitor=boost::dijkstra_visitor<>, 1> UpdatableQueue=MutableQueue, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> BinaryFunction=boost::closed_plus<int>, 1> BinaryPredicate=std::less<int>, 1> Directed=boost::directed_tag, 1> Vertex=__w64 unsigned int, 1> IncidenceGraph=Graph, 1> Edge=boost::detail::edge_desc_impl<boost::directed_tag,__w64 unsigned int>, 1> Graph=Graph 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(105) : see reference to function template instantiation 'void boost::breadth_first_visit<IncidenceGraph,Buffer,BFSVisitor,ColorMap,__w64 unsigned int*>(const IncidenceGraph &,SourceIterator,SourceIterator,Buffer &,BFSVisitor,ColorMap)' being compiled 1> with 1> [ 1> IncidenceGraph=Graph, 1> Buffer=MutableQueue, 1> BFSVisitor=boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>, 1> ColorMap=boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>>, 1> SourceIterator=__w64 unsigned int * 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(333) : see reference to function template instantiation 'void boost::breadth_first_visit<Graph,MutableQueue,boost::detail::dijkstra_bfs_visitor<UniformCostVisitor,UpdatableQueue,WeightMap,PredecessorMap,DistanceMap,BinaryFunction,BinaryPredicate>,ColorMap>(const IncidenceGraph &,__w64 unsigned int,Buffer &,BFSVisitor,ColorMap)' being compiled 1> with 1> [ 1> Graph=Graph, 1> UniformCostVisitor=boost::dijkstra_visitor<>, 1> UpdatableQueue=MutableQueue, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> BinaryFunction=boost::closed_plus<int>, 1> BinaryPredicate=std::less<int>, 1> ColorMap=boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>>, 1> IncidenceGraph=Graph, 1> Buffer=MutableQueue, 1> BFSVisitor=boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(385) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths_no_init<VertexListGraph,DijkstraVisitor,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistZero,ColorMap>(const Graph &,__w64 unsigned int,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistZero,DijkstraVisitor,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> DijkstraVisitor=boost::dijkstra_visitor<>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>, 1> Compare=std::less<int>, 1> Combine=boost::closed_plus<int>, 1> DistZero=int, 1> ColorMap=boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>>, 1> Graph=Graph 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(356) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<VertexListGraph,DijkstraVisitor,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,boost::two_bit_color_map<IndexMap>>(const VertexListGraph &,__w64 unsigned int,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,DijkstraVisitor,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> DijkstraVisitor=boost::dijkstra_visitor<>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>, 1> Compare=std::less<int>, 1> Combine=boost::closed_plus<int>, 1> DistInf=std::numeric_limits<int>::_Ty, 1> DistZero=int, 1> ColorMap=boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(404) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<VertexListGraph,DijkstraVisitor,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,char,boost::detail::unused_tag_type,boost::no_property>(const VertexListGraph &,__w64 unsigned int,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,DijkstraVisitor,const boost::bgl_named_params<T,Tag> &,boost::graph::detail::no_parameter)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> DijkstraVisitor=boost::dijkstra_visitor<>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>, 1> Compare=std::less<int>, 1> Combine=boost::closed_plus<int>, 1> DistInf=std::numeric_limits<int>::_Ty, 1> DistZero=int, 1> T=char, 1> Tag=boost::detail::unused_tag_type 1> ] 1> .\kShortestPath.cpp(46) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<Graph,boost::dijkstra_visitor<>,__w64 unsigned int*__w64 ,int*__w64 ,boost::adj_list_edge_property_map<Directed,Value,Ref,Vertex,Property,Tag>,boost::vec_adj_list_vertex_id_map<boost::no_property,Vertex>,std::less<_Ty>,boost::closed_plus<T>,std::numeric_limits<int>::_Ty,int>(const VertexListGraph &,__w64 unsigned int,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,DijkstraVisitor)' being compiled 1> with 1> [ 1> Directed=boost::directed_tag, 1> Value=int, 1> Ref=int &, 1> Vertex=__w64 unsigned int, 1> Property=boost::property<boost::edge_weight_t,int>, 1> Tag=boost::edge_weight_t, 1> _Ty=int, 1> T=int, 1> VertexListGraph=Graph, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>, 1> Compare=std::less<int>, 1> Combine=boost::closed_plus<int>, 1> DistInf=std::numeric_limits<int>::_Ty, 1> DistZero=int, 1> DijkstraVisitor=boost::dijkstra_visitor<> 1> ] 1>C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(140) : error C2784: 'EdgeIndex boost::detail::get(const boost::detail::csr_edge_index_map<Vertex,EdgeIndex> &,const boost::detail::csr_edge_descriptor<Vertex,EdgeIndex> &)' : could not deduce template argument for 'const boost::detail::csr_edge_index_map<Vertex,EdgeIndex> &' from 'int *__w64 ' 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/detail/compressed_sparse_row_struct.hpp(68) : see declaration of 'boost::detail::get' 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(45) : see reference to function template instantiation 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor,UpdatableQueue,WeightMap,PredecessorMap,DistanceMap,BinaryFunction,BinaryPredicate>::gray_target<boost::detail::edge_desc_impl<Directed,Vertex>,Graph>(Edge,Graph &)' being compiled 1> with 1> [ 1> UniformCostVisitor=boost::dijkstra_visitor<>, 1> UpdatableQueue=MutableQueue, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> BinaryFunction=boost::closed_plus<int>, 1> BinaryPredicate=std::less<int>, 1> Directed=boost::directed_tag, 1> Vertex=__w64 unsigned int, 1> Graph=Graph, 1> Edge=boost::detail::edge_desc_impl<boost::directed_tag,__w64 unsigned int> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(37) : while compiling class template member function 'void boost::BFSVisitorConcept<Visitor,Graph>::constraints(void)' 1> with 1> [ 1> Visitor=boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>, 1> Graph=Graph 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/concept/detail/has_constraints.hpp(42) : see reference to class template instantiation 'boost::BFSVisitorConcept<Visitor,Graph>' being compiled 1> with 1> [ 1> Visitor=boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>, 1> Graph=Graph 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/concept/detail/msvc.hpp(53) : see reference to class template instantiation 'boost::concepts::not_satisfied<Model>' being compiled 1> with 1> [ 1> Model=boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>,Graph> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(68) : see reference to class template instantiation 'boost::concepts::require<Model>' being compiled 1> with 1> [ 1> Model=boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>,Graph> 1> ] 1>kShortestPath - 2 error(s), 2 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========

2 1

allocate_shared and allocation size
by Olivier Tristan 18 Dec '12

18 Dec '12

Hi Guys, What would be the best way to get the size required by the allocation of a shared_ptr used when using allocate_shared ? So far, it looks like to be something related to the sizeof sp_counted_impl_pda< P, D, A >, but I would like to know the cleaner way of getting this info. The goal is to preallocate my pool with the right number of planned shared_ptr in order to avoid allocation.(real time thread) Thanks ! -- Olivier Tristan uvi.net

1 0

[Boost.MultiArray]: size question
by gast128 18 Dec '12

18 Dec '12

Dear all, we use here the multi_array as a 2 dimensional matrix. Often we want to resize the row or column dependent on some GUI event. Code could be: void Bla::ResizeRows(size_t nRows) { m_matrix.resize(boost::extents[nRows][m_matrix[0].size()]); } However this uses the 0-index of row count (i.e. 'm_matrix[0].size()') to determine the size of the columns. Will this not crash if you have 0 rows? And if so is there a better alternative? wkr.

3 8

Boost MPI on homogeneous machines
by Kyle Joseph Berger 17 Dec '12

17 Dec '12

Hello, Has anyone successfully used the homogeneous options in boost MPI before? I build boost mpi after uncommenting the appropriate line in the boost mpi config.cpp file and enabled BOOST_IS_BITWISE_SERIALIZABLE([classname]) for several of my classes that I pass, but I saw no change in performance, so I am not sure if it is enabled. The documentation says the following: More optimizations are possible on homogeneous machines, by avoiding MPI_Pack/MPI_Unpack calls but using direct bitwise copy. This feature can be enabled by defining the macro BOOST_MPI_HOMOGENEOUS when building Boost.MPI and when building the application. In addition all classes need to be marked both as is_mpi_datatype and as is_bitwise_serializable, by using the helper macro of Boost.Serialization: I defined the macro when building boost and marked the classes, but I could find no information anywhere on what to do when building the application, so I am thinking maybe this is what I am missing. Any help would be much appreciated. Thanks, Kyle

1 0

error while installing boost 1.36 and 1.52
by naveen kumar 17 Dec '12

17 Dec '12

Dear Boost user, while installing boost, i am getting many error messages as below, how to overcome these errors, please help me thanking you in advance Naveen Building the Boost C++ Libraries. Performing configuration checks - 32-bit : no - 64-bit : yes - x86 : yes - has_icu builds : no warning: Graph library does not contain MPI-based parallel components. note: to enable them, add "using mpi ;" to your user-config.jam - iconv (libc) : yes - icu : no - icu (lib64) : no - gcc visibility : yes - long double support : yes warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. Component configuration: - chrono : building - context : building - date_time : building - exception : building - filesystem : building - graph : building - graph_parallel : building - iostreams : building - locale : building - math : building - mpi : building - program_options : building - python : building - random : building - regex : building - serialization : building - signals : building - system : building - test : building - thread : building - timer : building - wave : building ...patience... ...patience... ...patience... ...patience... ...found 8697 targets... ...updating 824 targets... gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi/bzip2.o libs/iostreams/src/bzip2.cpp:20:56: error: bzlib.h: No such file or directory libs/iostreams/src/bzip2.cpp:31: error: ‘BZ_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:32: error: ‘BZ_RUN_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:33: error: ‘BZ_FLUSH_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:34: error: ‘BZ_FINISH_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:35: error: ‘BZ_STREAM_END’ was not declared in this scope libs/iostreams/src/bzip2.cpp:36: error: ‘BZ_SEQUENCE_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:37: error: ‘BZ_PARAM_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:38: error: ‘BZ_MEM_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:39: error: ‘BZ_DATA_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:40: error: ‘BZ_DATA_ERROR_MAGIC’ was not declared in this scope libs/iostreams/src/bzip2.cpp:41: error: ‘BZ_IO_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:42: error: ‘BZ_UNEXPECTED_EOF’ was not declared in this scope libs/iostreams/src/bzip2.cpp:43: error: ‘BZ_OUTBUFF_FULL’ was not declared in this scope libs/iostreams/src/bzip2.cpp:44: error: ‘BZ_CONFIG_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:48: error: ‘BZ_FINISH’ was not declared in this scope libs/iostreams/src/bzip2.cpp:49: error: ‘BZ_RUN’ was not declared in this scope libs/iostreams/src/bzip2.cpp: In static member function ‘static void boost::iostreams::bzip2_error::check(int)’: libs/iostreams/src/bzip2.cpp:62: error: ‘BZ_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:63: error: ‘BZ_RUN_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:64: error: ‘BZ_FLUSH_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:65: error: ‘BZ_FINISH_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:66: error: ‘BZ_STREAM_END’ was not declared in this scope libs/iostreams/src/bzip2.cpp:68: error: ‘BZ_MEM_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp: In constructor ‘boost::iostreams::detail::bzip2_base::bzip2_base(const boost::iostreams::bzip2_params&)’: libs/iostreams/src/bzip2.cpp:80: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:80: error: expected ‘)’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp: In destructor ‘boost::iostreams::detail::bzip2_base::~bzip2_base()’: libs/iostreams/src/bzip2.cpp:83: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:83: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:83: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:83: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:83: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:83: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp: In member function ‘void boost::iostreams::detail::bzip2_base::before(const char*&, const char*, char*&, char*)’: libs/iostreams/src/bzip2.cpp:88: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:88: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:88: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:88: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:88: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:88: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:88: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp: In member function ‘void boost::iostreams::detail::bzip2_base::after(const char*&, char*&)’: libs/iostreams/src/bzip2.cpp:97: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:97: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:97: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:97: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:97: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:97: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:97: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp: In member function ‘int boost::iostreams::detail::bzip2_base::check_end(const char*, const char*)’: libs/iostreams/src/bzip2.cpp:104: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:104: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:104: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:104: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:104: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:104: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:104: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp: In member function ‘void boost::iostreams::detail::bzip2_base::end(bool)’: libs/iostreams/src/bzip2.cpp:118: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:118: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:118: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:118: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:118: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:118: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:118: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp:121: error: ‘BZ2_bzCompressEnd’ was not declared in this scope libs/iostreams/src/bzip2.cpp:122: error: ‘BZ2_bzDecompressEnd’ was not declared in this scope libs/iostreams/src/bzip2.cpp: In member function ‘int boost::iostreams::detail::bzip2_base::compress(int)’: libs/iostreams/src/bzip2.cpp:128: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:128: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:128: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:128: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:128: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp: In member function ‘int boost::iostreams::detail::bzip2_base::decompress()’: libs/iostreams/src/bzip2.cpp:133: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:133: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:133: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:133: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:133: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp: In member function ‘void boost::iostreams::detail::bzip2_base::do_init(bool, void* (*)(void*, int, int), void (*)(void*, void*), void*)’: libs/iostreams/src/bzip2.cpp:144: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:144: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:144: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:144: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:144: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:144: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:144: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp:161: error: ‘BZ2_bzCompressInit’ was not declared in this scope libs/iostreams/src/bzip2.cpp:164: error: ‘BZ2_bzDecompressInit’ was not declared in this scope "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_DYN_LINK=1 -DBOOST_IOSTREAMS_USE_DEPRECATED -DNDEBUG -I"." -c -o "bin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi/bzip2.o" "libs/iostreams/src/bzip2.cpp" ...failed gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi/bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi>libboost_iostreams.so.1.52.0 for lack of <pbin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi>bzip2.o... ...skipped <pstage/lib>libboost_iostreams.so.1.52.0 for lack of <pbin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi>libboost_iostreams.so.1.52.0... ...skipped <pstage/lib>libboost_iostreams.so for lack of <pstage/lib>libboost_iostreams.so.1.52.0... gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/posix/posix_backend.o common.mkdir bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/codecvt.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/collate.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/converter.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/numeric.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/std_backend.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/util/gregorian.o gcc.link.dll bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/libboost_locale.so.1.52.0 common.copy stage/lib/libboost_locale.so.1.52.0 ln-UNIX stage/lib/libboost_locale.so common.mkdir bin.v2/libs/math/build common.mkdir bin.v2/libs/math/build/gcc-4.4.6 common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release/threading-multi common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release/threading-multi/.. common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release/threading-multi/../src common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release/threading-multi/../src/tr1 . . . . . . . gcc.link.dll bin.v2/libs/program_options/build/gcc-4.4.6/release/threading-multi/libboost_program_options.so.1.52.0 common.copy stage/lib/libboost_program_options.so.1.52.0 ln-UNIX stage/lib/libboost_program_options.so common.mkdir bin.v2/libs/python common.mkdir bin.v2/libs/python/build common.mkdir bin.v2/libs/python/build/gcc-4.4.6 common.mkdir bin.v2/libs/python/build/gcc-4.4.6/release common.mkdir bin.v2/libs/python/build/gcc-4.4.6/release/threading-multi gcc.compile.c++ bin.v2/libs/python/build/gcc-4.4.6/release/threading-multi/numeric.o In file included from ./boost/python/detail/prefix.hpp:13, from ./boost/python/numeric.hpp:8, from libs/python/src/numeric.cpp:6: ./boost/python/detail/wrap_python.hpp:50:23: error: pyconfig.h: No such file or directory ./boost/python/detail/wrap_python.hpp:75:24: error: patchlevel.h: No such file or directory ./boost/python/detail/wrap_python.hpp:78:2: error: #error Python 2.2 or higher is required for this version of Boost.Python. ./boost/python/detail/wrap_python.hpp:142:21: error: Python.h: No such file or directory In file included from ./boost/python/object/pointer_holder.hpp:14, from ./boost/python/to_python_indirect.hpp:10, from ./boost/python/converter/arg_to_python.hpp:10, from ./boost/python/call.hpp:15, from ./boost/python/object_core.hpp:14, from ./boost/python/object.hpp:9, from ./boost/python/tuple.hpp:10, from ./boost/python/numeric.hpp:10, from libs/python/src/numeric.cpp:6: ./boost/python/instance_holder.hpp:34: error: ‘PyObject’ has not been declared ./boost/python/instance_holder.hpp:41: error: expected ‘;’ before ‘(’ token ./boost/python/instance_holder.hpp:45: error: ‘PyObject’ has not been declared In file included from ./boost/python/object/pointer_holder.hpp:21, . . . . .

3 2

Deadline extension: C++ Now 2013, Call for Submissions
by Hartmut Kaiser 15 Dec '12

15 Dec '12

Please see below for the extended deadline. ---------------------------------------------------------------------------- C++ NOW CONFERENCE 2013 - Aspen CO, USA, May 13-17, 2013, www.cppnow.org ---------------------------------------------------------------------------- CALL FOR SUBMISSIONS -------------------- We invite you to submit session proposals to the 2nd annual C++ Now Conference (Aspen CO, USA, May 13-17, 2013). Building upon the resounding success of C++ Now 2012 and five years of BoostCon, C++ Now 2013 will present leading speakers from the whole C++ community. The C++ Now Conference is dedicated to discussion and education about C++, an open and free language and standard. Our Conference will focus on discussion and education about open source software usage and developments in the C++ developer and user community. To reflect the breadth of the C++ and Boost communities, the conference includes sessions aimed at three constituencies: C++ and Boost end-users, hard-core Boost library and tool developers, and researchers pushing the boundaries of computation. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. As a multi-paradigm language, C++ is a melting pot where the most compelling ideas from other programming communities are blended in powerful ways. Historically, some of the most popular sessions at C++ Now have highlighted these concepts, from DSLs to functional programming to transactional memory and more. Bring your C#, Python, Ruby or Haskell influences to bear in an environment that will broaden their exposure. At C++ Now 2013 we would like to focus on parallel and distributed computing with C++. However, by no means this is intended to restrict the topics of proposals we hope to see. Any other topic related to C++ as outlined below is perfectly fine for submission. IMPORTANT DATES --------------- New proposal submissions due: January 5th, 2013. Proposals decisions sent (tentative program available): January 30th, 2013. Fully scheduled program available: February 24th, 2013. BEST PRESENTATION AWARDS ------------------------ We know how much effort it takes to prepare talks for our conference. For this reason we will award the best presentations in the following categories: Best Presentation, Best Short Presentation, Best Tutorial, and Best Workshop. The awards will be given based on the audience's voting. Each award will include the author's name listed on the cover of the C++ Now website for that year and a plaque containing all the C++ Now conference information. SESSION TOPICS -------------- Topics of interest include, but are not restricted to, the following: * Parallelism in the new C++11 standard * Parallel, distributed and GPGPU topics relating to C++ * C++11 and how it changes life for users and library writers * General tutorial sessions on C++11, the C++11 Standards library, and one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to C++ users and developers Interactive and collaborative sessions are encouraged, as this is the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. SESSION FORMATS --------------- Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to C++11, Boost and users. Panels Panels feature three or four people presenting their ideas and experiences relating to C++11 and Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific skills relevant to C++11 and Boost. Workshops Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. SUBMITTING A PROPOSAL --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions Or multiples of 90-minutes. Fractional proposals will be grouped into 90 Minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). SUBMISSION DETAILS ------------------ All submissions should be made through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=cppnow2013. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the C++ Now website and will be available to attendees. For general information on the C++ Now 2013 paper submission or the scope of technical papers solicited; please refer to the conference website at www.cppnow.org. For any other questions about the submission process or paper format, please contact the Program Committee at cppnow2013(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to C++ Now. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) Dave Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

[regex] match_results: signatures of position(sub) and length(sub) are different, why?
by Frédéric Bron 14 Dec '12

14 Dec '12

Hi, On the following link, we can see that length and position member functions have different signatures: http://www.boost.org/doc/libs/1_52_0/libs/regex/doc/html/boost_regex/ref/ma… difference_type length(int sub = 0) const; difference_type position(unsigned int sub = 0) const; Why int for length(sub) and unsigned int for position(sub)? Frédéric

2 4

[boost-python] some general questions
by Ovanes Markarian 14 Dec '12

14 Dec '12

Hello *, we are now considering to use some Python/C++ bindings and here came Boost Python to my mind. I would like to ask what is the state of the library? Is it still maintained? As far as I can see the library's doc is dated back to 2003 (some of the doc's parts are from 2005) and the latest python version to be known to work is Python 2.2.2. Is Python 2.7.2 going to work or supported at all? I also searched for some docs on how Boost Python bindings are going to work with PyPy. Found some really old post describing the problems to support Boost Python binding and some messages from the mailing list, which describe, which functions must be implemented to support Boost Python in PyPy. Any info would be great! Thanks, Ovanes

2 3

[preprocessor] BOOST_PP_VARIADIC_SIZE() and g++ in 1.52
by Nat Linden 13 Dec '12

13 Dec '12

I'm trying to use a variadic macro to solve a problem. We use a third-party function I can't modify -- actually a family of functions of arbitrary arity. Before each call to that function, I want to examine and possibly modify its first argument. (So not completely arbitrary arity: there's always at least one argument.) What I'd really like is a variadic function. Unfortunately the compilers we use don't yet support those. We do have cross-platform support for variadic macros, albeit with idiosyncratic syntax. My problem is that I need: intercept(first, second, third) to expand to: targetfunc(transform(first), second, third) but I need: intercept(first) to expand to: targetfunc(transform(first)) // <= no trailing comma This is the role of BOOST_PP_COMMA_IF(). In Visual Studio 2010 I can write BOOST_PP_COMMA_IF(BOOST_PP_VARIADIC_SIZE(__VA_ARGS__)), and the code behaves as expected. In g++ 4.1, 4.2 and 4.4, however, my first problem is that BOOST_PP_VARIADICS is not set by default. When I set it explicitly, as permitted by the documentation[0], a call such as intercept("first", "second") (comma required) succeeds, but a call such as intercept("first") (comma forbidden) fails. Using -E and examining the preprocessed output from intercept("first") makes clear that BOOST_PP_COMMA_IF() is expanding to a comma, hence BOOST_PP_VARIADIC_SIZE() is expanding to nonzero. In fact, when I change the definition of the intercept() macro below to: #define intercept(FIRST, ARGS...) \ targetfunc(transform(FIRST) \ , boost::lexical_cast<std::string>(BOOST_PP_VARIADIC_SIZE(ARGS))) I see that BOOST_PP_VARIADIC_SIZE() expands to 1 for intercept("first") as well as for intercept("first", "second"). Is it possible to achieve what I want with my present suite of compilers? Is there some workaround we could use until (at some point in the indefinite future) we've upgraded all our compilers so that even the oldest of them supports variadic functions? [0] http://www.boost.org/doc/libs/1_52_0/libs/preprocessor/doc/topics.html ================ source code follows ================ #include <iostream> #include <string> #include <boost/preprocessor/variadic/size.hpp> #include <boost/preprocessor/punctuation/comma_if.hpp> // no targetfunc(void) void targetfunc(const std::string& first) { std::cout << "targetfunc('" << first << "')\n"; } void targetfunc(const std::string& first, const std::string& second) { std::cout << "targetfunc('" << first << "', '" << second << "')\n"; } // ... assume a family of targetfunc() arities ... // want to implicitly "do something" to targetfunc()'s first arg std::string transform(const std::string& arg) { return "transformed " + arg; } #if defined(_MSC_VER) // anonymous variadic arguments and __VA_ARGS__ keyword #define intercept(FIRST, ...) \ targetfunc(transform(FIRST) \ BOOST_PP_COMMA_IF(BOOST_PP_VARIADIC_SIZE(__VA_ARGS__)) \ __VA_ARGS__) #else // collectively-named variadic arguments #define intercept(FIRST, ARGS...) \ targetfunc(transform(FIRST) \ BOOST_PP_COMMA_IF(BOOST_PP_VARIADIC_SIZE(ARGS)) \ ARGS) #endif int main(int argc, char *argv[]) { std::cout << "BOOST_PP_VARIADICS = " << BOOST_PP_VARIADICS << "\n"; intercept("first", "second"); intercept("first"); // <= this line has trouble with g++ 4.1, 4.2, 4.4 return 0; }

4 6

(no subject)
by Rydinare 12 Dec '12

12 Dec '12

http://internetwealthbuilderinstitute.com/wp-content/plugins/akismet/google…

1 0

[Exception] Expected<T> C++03
by Szymon Gatner 12 Dec '12

12 Dec '12

Hi, I trying to implement Andrei's Expected<T> from his "Systematic Error Handling in C++" talk ( http://channel9.msdn.com/Shows/Going+Deep/C-and-Beyond-2012-Andrei-Alexandr…) in C++03 / BOOST In short: Expected<T> holds either T or exception_ptr holding exception that prevented T's creation. Think of single threaded future<T>. One of main purposes of this type is efficiency - code that computes T would normally throw in case of errors but instead it returns exception by value which causes Expected<T> to be initiated with exception type instead of actual value of T. Important part is that no throwing happens in library code (making it fast). As with future<T> throwing of stored exception only happens upon client's request - a call to get() in case of invalid computation (Expected<T>::valid() may be called beforehand to check if computation succeeded). To the point: Andrei's code uses std::make_exception_ptr() which I assume is std version of boost::copy_exception(). Now problem with copy_exception() is that it actually throws! So the whole idea of not throwing is gone by the fact that I don't know how to transform (const Exception&) into boost::exception_ptr (without throwing via copy_exception()). How does std::make_exception_ptr() work (as I assume it does not throw & return current_exception() as boost::copy_exception does)? Any suggestions welcome. Cheers. Szymon Gatner

3 3

boost::fusion::set
by Lukasz K 12 Dec '12

12 Dec '12

Could someone explain to me why the following is a valid definition of a boost::fusion::set? typedef boost::fusion::set<char,char,char> S; S s('a','b','c'); Especially, given that according to description: "set is an Associative Sequence of heteregenous typed data elements. Type identity is used to impose an equivalence relation on keys. The element's type is its key. A set may contain at most one element for each key. Membership testing and element key lookup has constant runtime complexity (see Overloaded Functions). " Src: http://www.boost.org/doc/libs/1_52_0/libs/fusion/doc/html/fusion/container/… Thanks, Lukasz

1 0

Compile boost for Windows Phone 8
by stren tler 12 Dec '12

12 Dec '12

Hi, i need to compile "date_time" and "system" for the windows phone 8 development enviroment. Any advice how setup bjam? thx

1 0

[serialization] performance issue when deserializing long string in a xml file
by jean-charles.quillet＠alyotech.fr 12 Dec '12

12 Dec '12

Hello, Since I discovered the boost serialization library, I'm using it in every single project I'm working on. I just cant figure how I was doing before. Makes life so much easier. I usually serialize all my objects in XML format. On my current project, I have a couple of big 500x500 complex matrices (ublas) that need to be serialized in my files. Serializing the matrices with the default boost functions results quite big files. So I've implemented the following: - I serialize the matrix in memory in binary format - I compress the data with the zlib - I encode the resulting data in base64 then copy it in a string - And I serialize the resulting string in my file It's working great but I've found out that deserializing this long string takes a huge amount of time. It bothers me and I don't really understand why. As I've got a filter reporting the bytes read to watch the progress. It seems that the time is spent after that all data has been read ! It confuses me. Has anybody experienced this or have any idea to solve my problem ? Thanks, Jean-Charles

2 3

Slow build with clang?
by Richard Hadsell 12 Dec '12

12 Dec '12

I have been building the Boost libraries with g++ for many years. Someone recommended trying Clang, so I downloaded 1.52.0 and built it first with g++ 4.5.1 on Fedora 14. Then I started a build with clang 3.3, and it is taking forever. I have not made any measurements, but it must be at least an order of magnitude slower than g++. The math library seems to take the longest, but maybe there are other slow-building libraries yet to come. Am I doing something wrong, or should I expect the clang build to be very slow? In myuser-config I have this: using clang : 3.3 : /directory_where_we_installed_clang/bin/clang :<compileflags>"-fPIC"<linkflags>"-fPIC" ; The command line is this: bin/bjam --user-config=myuser-config threading=multi instruction-set=core2 address-model=64 variant=release link=static,shared --stagedir=stageF14C clean The clang version is: clang version 3.3 (trunk 169541) (llvm/trunk 169537) The OS is Linux Fedora 14. -- Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studios http://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560

3 4

Regular expression problem using literals
by Neil Sutton 11 Dec '12

11 Dec '12

Hello, I am learning the basics of regular expression syntax and have been looking at the following example: #include <iostream> #include <fstream> #include <string> #include <boost/regex.hpp> #include <boost/xpressive/xpressive.hpp> using namespace boost::xpressive; int main() { std::ifstream input("myfile"); if(input) std::cout << "Success\n"; else std::cout << "fail\n"; std::string line; std::string data; while (getline(input, line)) { data += line; } std::string const &ref = data; mark_tag day(1), month(2), year(3), delim(4); sregex date = (month= repeat<1,2>(_d)) // find the month ... >> (delim= (set= '/','-')) // followed by a delimiter ... >> (day= repeat<1,2>(_d)) >> delim // and a day followed by the same >> (year= repeat<1,2>(_d >> _d)); // and the year. smatch what; if( regex_search(ref, what, date ) ) { std::cout << what[0] << '\n'; // whole match std::cout << what[day] << '\n'; // the day std::cout << what[month] << '\n'; // the month std::cout << what[year] << '\n'; // the year std::cout << what[delim] << '\n'; // the delimiter } return 0; } My problem is very simple and I am sorry to be asking about it. I want to include some literal wording in my regular expression. For example, before the program outputs the date it also searches for the words "Football results for" - (then date is output). Please can you show me how to prefix this regular expression with the literal words? My compiler see the 'for' as a c++ keyword, without more. Kind Regards

2 1

Property Tree with boost:any
by Olivier Tristan 11 Dec '12

11 Dec '12

Hello, I'm trying to use a property tree with a boost::any like in custom_data_type.cpp from the examples folder. So far, so good. My only issue arise when I'm trying to use write_json from json_parser. I understand that boost::any do not provide direct conversion to something that can be written into a stream, but I was wondering if there is a way to provide some conversion function just like it's done for get and put inside the property tree itself. Thanks ! -- UVI <http://www.uvi.net/> Olivier Tristan| Research & Development o.tristan(a)uvi.net Facebook <http://www.facebook.com/UVI.Official> Twitter <http://twitter.com/UVIofficial> Youtube <http://www.youtube.com/user/UVIofficial> SoundCloud <http://soundcloud.com/uvi-official> Blog UVI <http://blog.uvi.net/>

2 2

Building Boost for backwards compatibility
by Tim Burgess 11 Dec '12

11 Dec '12

Hi, I'm using Boost to build projects for the Mac. What I don't understand is how to build the libraries to support previous Mac OSX SDK versions. I'm having to build using XCode 4.5 on Mountain Lion (10.8), but want to ensure that my projects will run on 10.7 as a minimum. All advice gratefully accepted. Best wishes. Tim Burgess Raised Bar Ltd. Tel: +44 (0)1827 719822 Web: http://www.raisedbar.net

1 0

Registration for C++Now 2013 is now open
by Boris Kolpackov 11 Dec '12

11 Dec '12

The seventh annual C++Now Conference (formerly BoostCon) will be held at the Aspen Center for Physics in Aspen, Colorado, May 12th to 17th, 2013. "We are thrilled to announce the second annual C++Now conference, the whole-language edition of BoostCon covering all the coolest topics in C++," said Dave Abrahams, Conference Co-Chair. "In 2012, we broadened the conference scope by adding a third track and offering more C++11 coverage than any other event, and the community responded with an unprecedented number of registrations. In 2013, we are going to build on that success with foundational sessions integrating what we've all learned about using C++11 during the past year, while continuing the exploration of cutting-edge topics that BoostCon attendees have come to expect." Early Bird Savings Deadlines! Early Bird conference registration, which ends April 14th, 2013, costs $599. After that date, the registration fee is $699. Register now at our registration page <http://www.eventbrite.com/event/2717332615>. Early Bird hotel registration ends December 31st, 2012 and saves $20 per night. Please reserve your room using the Aspen Meadows online reservation system <https://resweb.passkey.com/go/cplusplusnow2013> Speakers If you are interested in presenting, we are currently accepting proposals <http://cppnow.org/2013-call-for-submissions/>. Registration fee is waived for one speaker of every standard session presentation. Shorter sessions are prorated. Student/Volunteers Registration fees will be waived for a limited number of individuals that wish to attend as volunteers. Volunteer work consists of helping to run the conference and will not prevent volunteers from attending sessions. This is the first year this opportunity is being offered. If you are interested in applying to attend as a volunteer, contact us at <organizers(a)cppnow.org>. Sponsors For a copy of the conference Sponsorship Prospectus contact sponsorship(a)cppnow.org. C++Now is presented by Boost in-cooperation with ACM. Permanent link for this announcement is: http://cppnow.org/2013-registration-announcement/

1 0

boost mpi message truncated error
by Kyle Joseph Berger 10 Dec '12

10 Dec '12

Hello, I am using boost mpi and I am having issues getting the message truncation error upon receiving a message. It is not always the same message, but it does always happen and I have been unable to figure out why. Here is the code of interest: //send particles for(int i=0;i<world.size();i++) { world.isend(i,i,particles_to_be_sent[i]); } //receive particles int receive_counter=0; boost::optional<boost::mpi::status> msginfo=world.iprobe(mpi::any_source, world.rank()); while (receive_counter<world.size()) { if (msginfo) { world.recv(msginfo->source(),world.rank(),particles_received); for (unsigned int i=0;i<particles_received.size();i++) { //add particle to its associated box in the particle grid particle_grid[particles_received[i].location_number()].insert(pair<int,Particle>(particles_received[i].global_part_num(),particles_received[i])); //check to see if the particle is contained within the box if (particles_received[i].position().y()>grid_locations[particles_received[i].location_number()].bottom() && particles_received[i].position().y()<grid_locations[particles_received[i].location_number()].top() && particles_received[i].position().x()>grid_locations[particles_received[i].location_number()].west() && particles_received[i].position().x()<grid_locations[particles_received[i].location_number()].east() && particles_received[i].position().z()>grid_locations[particles_received[i].location_number()].south() && particles_received[i].position().z()<grid_locations[particles_received[i].location_number()].north()) { //if particle is in box, then denote it as such in the particle properties particle_properties[particles_received[i].global_part_num()].particle_in_box()[particles_received[i].location_number()]=true; } } receive_counter++; } msginfo=world.iprobe(mpi::any_source, world.rank()); } I have left out variable definitions, but everything has the right type (including sending and receiving the same type-particles_to_be_sent[i] and particles_received are both vector<Particle>, where Particle is a type I've created). I thought that boost mpi is supposed to take care of making the receive buffer the right size on its own, but something isn't working here. Any help would be appreciated. Thanks, Kyle

2 1

[exception, system] using boost::system::error_code with boost::exception
by Marco Craveiro 10 Dec '12

10 Dec '12

Hi boost users, I'm a very happy user of both error_code and exception, but now I found a new use case which is to combine them. So I'm looking for an example of how to add an error_code into an exception and get it all nicely formatted with diagnostic_information. I can see how to use error_info [1] but not error_code. Any pointers would be appreciated. Cheers Marco -- So young, and already so unknown -- Pauli blog: http://mcraveiro.blogspot.com [1] http://www.boost.org/doc/libs/1_52_0/libs/exception/doc/tutorial_transporti…

2 1

Oven, regular and Boost
by Robert Jones 10 Dec '12

10 Dec '12

The 'Oven' port... http://dl.dropbox.com/u/1682460/git/OvenToBoost/libs/range/doc/html/range_e… makes much of its 'regular' operator, which is used to fix this problem using boost::lambda::_1; for_each_(r | filtered(_1 % 2 == 0), f); // Error! Can't default construct/copy assign for_each_(r | filtered(regular(_1 % 2 == 0)), f); // OK However, AFAICS this is not a problem in current-ishBoost (1.47). Has this ever been a problem? Can anyone comment on its general provenance? Thx, Rob.

3 5

[Range] Sliced... less than it could be.
by Robert Jones 10 Dec '12

10 Dec '12

I was disappointed to discover that I can't write range | filtered( some_predicate ) | sliced( n, m ) | ..... because sliced requires a random access range, and filtered produces a forward range! Piffle. It seems such a useful and obvious use-case. Is this restriction really necessary? Thx, Rob.

3 6

[overloaded_function] Why does it define f_ as const?
by Felipe Magno de Almeida 10 Dec '12

10 Dec '12

Hello, I'm trying to use overloaded_function. But unfortunately it defines f_ as const, which makes it not Assignable. Which seems to me, like a unnecessary limitation. I looked at the docs, but couldn't find any mention of assignment nor a rationale for this behavior. Is there a specific reason for overloaded_function to not be Assignable? Regards, -- Felipe Magno de Almeida

1 0