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

from matrix to vectors
by Virili 07 Apr '11

07 Apr '11

Hi to all, I'm trying to have a vector (for example a row or a column) from a matrix. like in Matlab : my_column_vector = my_matrix(:,3) or my_row_vector = my_matrix(1,:); I know that it will be a stupid thing, but can you post a reference or a pseudo code?? Thanks!!

2 1

[range] for_each and std::map of std::list
by Mark Snelling 07 Apr '11

07 Apr '11

Hi, Consider a map defined as... std::map< int, std::list< std::string > > my_map; I'm wondering if/how it's possible to use Boost.Range to call a function on each std::string in each of the lists contained in the map. I have an implementation below which works using a C++0x lambda function but am curious if this can be done purely using Boost.Range? boost::for_each( boost::adaptors::values( my_map), []( const std::list< std::string >& my_list ) { boost::for_each( my_list, some_func ); } ); ideas anyone?

5 8

a question on boost::spirit with a quick program.
by Littlefield, Tyler 07 Apr '11

07 Apr '11

Hello all: Sorry for all the questions; I am kind of easing into boost and finding cool things i can do with it, as well as uses for a couple of projects. Eventually I would like to write a small scripting language using boost::spirit, just to do it and get the practice using it. As a starting point, I wrote a quick calculator (that just does small single operations like x+x, x*x, etc). Now i have two questions. 1) My rule seems to be off. the first number comes through clearly, but no matter what I put in, I always get the first number and then a 42. 2) How would I go about extending this to implement order of operations, parenthases, and longer operations (like 3+3*3)? I'm going to try to implement a small function table so I can do tan(3), so I assume I will need nultiple rules, how might that be accomplished? Any comments and suggestions would be welcome. I have pasted the code below. I was working from a tutorial, so early appologies if it feels messy; I plan to clean up the namespace aliases and the using keywords. /* A simple calculator, supports multiplication, division, addition and subtraction. */ #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <iostream> #include <string> #include <boost/fusion/include/adapt_struct.hpp> #include <boost/fusion/container/vector.hpp> #include <boost/fusion/container/vector/convert.hpp> #include <boost/fusion/include/io.hpp> namespace qi = boost::spirit::qi; namespace ascii = boost::spirit::ascii; namespace phoenix = boost::phoenix; using qi::double_; using qi::_1; using ascii::space; using phoenix::ref; using std::cout; using std::endl; typedef struct { int a, b; char op; } calculation; BOOST_FUSION_ADAPT_STRUCT(calculation, (int, a) (int, b) (char, op) ) template <typename iterator> class CParser:public qi::grammar<iterator, calculation(), ascii::space_type> { qi::rule <iterator, calculation(), ascii::space_type> crule; public: CParser():CParser::base_type(crule) { using ascii::char_; using qi::int_; crule %= (int_ >> (char_('+')|char_('-')|char_('*')|char_('/')) >> int_); } }; int main() { using std::cout; using std::cin; using std::endl; using boost::fusion::vector; CParser<std::string::iterator> p; std::string str; calculation result; cout << "Enter your calculation>"; cin >> str; bool r = phrase_parse(str.begin(), str.end(), p, ascii::space, result); if (r) { cout << result.a << " " << result.b << " " << result.op << endl; switch(result.op) { case '+': cout << "Result: " << (result.a + result.b) << endl; break; case '-': cout << "result: " << (result.a - result.b) << endl; break; case '*': cout << "Result: " << (result.a * result.b) << endl; break; case '/': if (result.a == 0) { cout << "Division by zero error." << endl; break; } cout << "result: " << (result.a / result.b) << endl; break; default: cout << "Invalid operation." << endl; } } else { cout << "Invalid input." << endl; } return 0; } -- Thanks, Ty

4 3

[Spirit 2] on_error to string
by Vincent Agnus 07 Apr '11

07 Apr '11

Hi, I have some trouble to retreive error parsing information using qi::on_error<fail> to work on a std::string. The documentation propose the following code : on_error<fail> ( start , std::cout << val("constituent: expected ") << _4 // what failed? << val(" here: \"") << construct<std::string>(_3, _2) // iterators to error-pos, end << val("\"") << std::endl ); * On my First attempt. I have define a class member (std::stringstream m_error) in my grammar class and replace std::cout by phx::ref(m_error). But this code generate a compilation error * For the second attempt, I declare class member m_error as std::string and use this error handler: namespace qi = boost::spirit::qi; namespace phx = boost::phoenix; on_error< qi::fail> ( start , phx::ref(m_error) = ( phx::construct<std::string>(phx::val("Error! Expecting ")) // + qi::_4 REMARK1 + phx::construct<std::string>( phx::val(" here: \"") ) + phx::construct<std::string>(qi::_3, qi::_2) + phx::construct<std::string>( phx::val("\"") ) ) ); that's work perfectly. On error my string is correctly filled. But my problem is that I can't get the expected token (_4) (REMARK1), If I uncomment line REMARK1, I get a compilation error, same result using the code phx::construct<std::string>(qi::_4). How can a get qi::_4 as string ? Can any one with kindness help me?

2 5

(no subject)
by Gabriel Marchand 07 Apr '11

07 Apr '11

Hi, I am new to boost and I face the same problem mentioned here with "connected_components()" using a mutable graph (hence using a list for the vertex container). I try the detailed solution of Aaron Windsor in the previous post but I still get some errors at compilation. Here is my little code: #include <boost/graph/adjacency_list.hpp> #include <boost/graph/connected_components.hpp> using namespace std; using namespace boost; Box& b = conf.GetBox(); if (!ai) { ai = new AtomList(); *ai = conf.GetAtoms().AtomSelector(selecti, b); } typedef boost::adjacency_list< listS, listS, undirectedS, property<vertex_index_t, size_t>, no_property> > graph_t; graph_t g(ai->size()); property_map<graph_t, vertex_index_t>::type index = get(vertex_index, g); graph_traits<graph_t>::vertex_iterator vi, vi_end; graph_traits<graph_t>::vertices_size_type cnt = 0; for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi) put(index, *vi, cnt++); for (unsigned int i = 0; i < ai->size(); ++i) { Cartesian& crdi = ai->GetElement(i)->pos; for (unsigned int j = i + 1; j < ai->size(); ++j) { Cartesian& crdj = ai->GetElement(j)->pos; double r = conf.GetBox().CartesianDistance(crdi, crdj); if (r < rcut) { add_edge(vertex(i,g), vertex(j,g), g); // Add edge to Map if distance criteria is satisfied } } } vector<int> component(num_vertices(g)); int num_clusters = connected_components(g, &component[0], vertex_index_map(index)); The compilation is successfull until I add the last line: int num_clusters = connected_components(g, &component[0], vertex_index_map(index)); Hope somebody can give a hint gabriel

2 7

[phoenix] [range] I think I'm missing a couple things w/ these libs
by Jake Brownson 07 Apr '11

07 Apr '11

I love the ideas behind these libs, but I think I need to figure out a bit more before I can use them. Here's an example that models what I'm trying to do for real as an experiment w/ using phoenix and range. I can't quite get it to build. I think I'm really close. I tried it w/ lambda before I found phoenix and I had to do some ret<> things to get past some errors, but I'm not sure what the equivalent in phoenix is, or if I should really need them. Also, I think there should be a way to instantiate a vector directly from a range w/o having to use begin() and end() somehow, but I can't find it. I've tried various approaches with <something> including transformed_range<> and any_range<> and haven't gotten them to work. The transformed line gives me errors complaining about missing result_type, iterator_category, value_type, difference_type, pointer, reference. I'm using GCC 4.2 on OS X Thanks! ---- #include <boost/range/adaptor/transformed.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/spirit/include/phoenix_bind.hpp> #include <vector> class A {}; class B { public: A a; }; class C { public: static B BFromA(const A& a) { return B(); } }; std::vector<C> CsFromBs(std::vector<B> bs) { <something> cs = bs | boost::adaptors::transformed(boost::phoenix::bind(&C::BFromA, boost::phoenix::bind(&B::a, boost::phoenix::arg_names::arg1))); return std::vector<C>(boost::begin(cs), boost::end(cs)); }

4 9

a quick question regarding extending a class with boost::function
by Littlefield, Tyler 06 Apr '11

06 Apr '11

Hello all: I am working on a mud engine (essentially a game engine), and I had a quick question. I have an event class (yes, I know about boost::signal, but I don't want to go back and it doesn't support delayed events). I would like to set up my event class so that it will take a function object as it's callback, which allows someone extending the engine to add their own content to use global functions, member functions, lambdas, etc etc. Now, here is my problem, and this may be more of a c++ question than a boost question; I'm not really sure. Right now, every time an event gets called, I pass in the object that called it, as well as an EventArgs pointer. So an event callback function might look like this: void OnMouseDown(Object* obj, OnMouseDownArgs* args); Now, it might be useful to have the x and y coordenates where the OnMouseDown event was called, which means I end up doing something like: class OnMouseDownArgs:public EventArgs { public: int x, y; }; which essentially means that for every new type of event, I have to declare an EventArgs class for that. So here was my idea; I thought it would be kind of cool to do something like: Event* OnMouseDown<int, int> = new Event<int, int>(); which leads me to a question. given that template, how would I define a function object with those arguments? better yet, how would I accept an arbitrary number of arguments to the template, then take those arguments and create a boost::function object with them, as well as extend the .Call method to take the arguments I passed in? So in summary, I am trying to extend the boost::function object to accept a set of arguments passed in through a template when the Event object was created, as well as extend the Call method on the Event object to take the two ints as in the MouseDownEvent as arguments. Thanks, Ty

2 2

Boost.Regex Build Failure with CPP Locale and No Win32 on WinXP using Visual Studio 2010 SP1
by David Hauck 06 Apr '11

06 Apr '11

Hello, I'm attempting to build Boost.Regex v1.46.1 with the following user.hpp settings: #define BOOST_REGEX_USE_CPP_LOCALE #define BOOST_REGEX_NO_W32 However, this is failing with the following commands (from the root Boost directory) on WinXP using Visual Studio 2010 SP1: bjam --clean link=shared regex bjam link=shared regex compile-c-c++ bin.v2\libs\regex\build\msvc-10.0\debug\threading-multi\usinstances.obj usinstances.cpp c:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\map(38) : warning C4273: 'id' : inconsistent dll linkage c:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\xlocmes(58) : see previous definition of 'public: static std::locale::id std::messages<unsigned short>::id' c:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\xlocmes(58) : while compiling class template static data member 'std::locale::id std::messages<_Elem>::id' with [ _Elem=unsigned short ] C:\eng\natools\boost\1_46_1\boost/regex/v4/cpp_regex_traits.hpp(216) : see reference to function template instantiation 'bool std::has_facet<std::messages<_Elem>>(const std::locale &) throw()' being compiled with [ _Elem=unsigned short ] C:\eng\natools\boost\1_46_1\boost/regex/v4/cpp_regex_traits.hpp(211) : while compiling class template member function 'std::locale boost::re_detail::cpp_regex_traits_base<charT>::imbue(const std::locale &)' with [ charT=unsigned short ] C:\eng\natools\boost\1_46_1\boost/regex/v4/cpp_regex_traits.hpp(973) : see reference to function template instantiation 'boost::shared_ptr<T> boost::re_detail::create_cpp_regex_traits<charT>(const std::locale &)' being compiled with [ T=const boost::re_detail::cpp_regex_traits_implementation<unsigned short>, charT=unsigned short ] C:\eng\natools\boost\1_46_1\boost/regex/v4/cpp_regex_traits.hpp(971) : while compiling class template member function 'boost::cpp_regex_traits<charT>::locale_type boost::cpp_regex_traits<charT>::imbue(boost::cpp_regex_traits<charT>::locale_type)' with [ charT=unsigned short ] C:\eng\natools\boost\1_46_1\boost/regex/v4/regex_traits.hpp(74) : see reference to class template instantiation 'boost::cpp_regex_traits<charT>' being compiled with [ charT=unsigned short ] C:\eng\natools\boost\1_46_1\boost/regex/v4/basic_regex.hpp(312) : see reference to class template instantiation 'boost::regex_traits<charT>' being compiled with [ charT=unsigned short ] C:\eng\natools\boost\1_46_1\boost/regex/v4/instances.hpp(90) : see reference to class template instantiation 'boost::basic_regex<charT,traits>' being compiled with [ charT=unsigned short, traits=boost::regex_traits<unsigned short> ] c:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\map(38) : error C2491:'std::messages<_Elem>::id' : definition of dllimport static data member not allowed with [ _Elem=unsigned short ] c:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\map(38) : warning C4273: 'id' : inconsistent dll linkage c:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\locale(48) : see previous definition of 'public: static std::locale::id std::collate<unsigned short>::id' c:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\locale(48) : while compiling class template static data member 'std::locale::id std::collate<_Elem>::id' with [ _Elem=unsigned short ] C:\eng\natools\boost\1_46_1\boost/regex/v4/cpp_regex_traits.hpp(218) : see reference to function template instantiation 'const _Facet &std::use_facet<std::collate<_Elem>>(const std::locale &)' being compiled with [ _Facet=std::collate<unsigned short>, _Elem=unsigned short ] c:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\map(38) : error C2491:'std::collate<_Elem>::id' : definition of dllimport static data member not allowed with [ _Elem=unsigned short ] call "c:\Program Files\Microsoft Visual Studio 10.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\regex\build\msvc-10.0\debug\threading-multi\usinstances.obj.rsp" ...failed compile-c-c++ bin.v2\libs\regex\build\msvc-10.0\debug\threading-multi\usinstances.obj... ...skipped <pbin.v2\libs\regex\build\msvc-10.0\debug\threading-multi>boost_regex-vc100-mt-gd-1_46_1.dll for lack of <pbin.v2\libs\regex\build\msvc-10.0\debug\threading-multi>usinstances.obj... ...skipped <pbin.v2\libs\regex\build\msvc-10.0\debug\threading-multi>boost_regex -vc100-mt-gd-1_46_1.lib for lack of <pbin.v2\libs\regex\build\msvc-10.0\debug\threading-multi>usinstances.obj... ...skipped <pbin.v2\libs\regex\build\msvc-10.0\debug\threading-multi>boost_regex-vc100-mt-gd-1_46_1.pdb for lack of <pbin.v2\libs\regex\build\msvc-10.0\debug\threading-multi>usinstances.obj... ...failed updating 1 target... ...skipped 3 targets... ...updated 16 targets... Any ideas? BTW, ICU is properly identified as not being available. Also, all the previous modules are compiled successfully. Thanks, -David

2 2

Re: [Boost-users] (no subject)
by Gabriel Marchand 06 Apr '11

06 Apr '11

I forgot to attach the code in the previous mail! Here it is. Hi Cedric and thank you for your reply. Actually I need the mutable graph type (using listS as vertex container) because I'll need to use the functions clear_vertex() and remove_vertex(). And I am facing the problem to create this index map property to the vertices to use the function connected_components(). I wrote a more consistent version of the code (test.cpp attached), following the instructions in a previous post by Aaron Windsor: http://boost.2283326.n4.nabble.com/connected-components-td2576097.html It compiles until I added the last line: "int num_clusters = connected_components(G, &component[0], vertex_index_map(index));" The compiler tells: gmarchand@bohr:~/TMP$ g++ test.cpp In file included from /usr/include/c++/4.4/backward/hash_set:60, from /usr/include/boost/graph/adjacency_list.hpp:25, from test.cpp:3: /usr/include/c++/4.4/backward/backward_warning.h:28:2: warning: #warning This file includes at least one deprecated or antiquated header which may be removed without further notice at a future date. Please use a non-deprecated interface with equivalent functionality instead. For a listing of replacement headers and interfaces, consult the file backward_warning.h. To disable this warning use -Wno-deprecated. In file included from /usr/include/boost/graph/adjacency_list.hpp:42, from test.cpp:3: /usr/include/boost/property_map/property_map.hpp: In member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*, Key = void*]’: /usr/include/boost/concept/detail/has_constraints.hpp:40: instantiated from ‘const bool boost::concept::not_satisfied<boost::WritablePropertyMapConcept<int*, void*> >::value’ /usr/include/boost/concept/detail/has_constraints.hpp:43: instantiated from ‘boost::concept::not_satisfied<boost::WritablePropertyMapConcept<int*, void*> >’ /usr/include/boost/mpl/if.hpp:67: instantiated from ‘boost::mpl::if_<boost::concept::not_satisfied<boost::WritablePropertyMapConcept<int*, void*> >, boost::concept::constraint<boost::WritablePropertyMapConcept<int*, void*> >, boost::concept::requirement<boost::WritablePropertyMapConcept<int*, void*> > >’ /usr/include/boost/concept/detail/general.hpp:19: instantiated from ‘boost::concept::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, void*>)>’ /usr/include/boost/concept_check.hpp:43: instantiated from ‘void boost::function_requires(Model*) [with Model = boost::WritablePropertyMapConcept<int*, void*>]’ /usr/include/boost/graph/connected_components.hpp:67: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, typename boost::enable_if_c<boost::is_base_and_derived::value, boost::graph::detail::no_parameter>::type) [with Graph = main()::graph_t, ComponentMap = int*, P = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, long unsigned int, long unsigned int&, boost::vertex_index_t>, T = boost::vertex_index_t, R = boost::no_property]’ test.cpp:54: instantiated from here /usr/include/boost/property_map/property_map.hpp:195: error: no matching function for call to ‘put(int*&, void*&, int&)’ In file included from test.cpp:4: /usr/include/boost/graph/connected_components.hpp: In member function ‘void boost::detail::components_recorder<ComponentsMap>::discover_vertex(Vertex, Graph&) [with Vertex = void*, Graph = const boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, ComponentsMap = int*]’: /usr/include/boost/graph/depth_first_search.hpp:103: instantiated from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, DFSVisitor = boost::detail::components_recorder<int*>, ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, long unsigned int, long unsigned int&, boost::vertex_index_t> >, TerminatorFunc = boost::detail::nontruth2]’ /usr/include/boost/graph/depth_first_search.hpp:201: instantiated from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, DFSVisitor = boost::detail::components_recorder<int*>, ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, long unsigned int, long unsigned int&, boost::vertex_index_t> >]’ /usr/include/boost/graph/depth_first_search.hpp:296: instantiated from ‘void boost::depth_first_search(const VertexListGraph&, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, P = boost::detail::components_recorder<int*>, T = boost::graph_visitor_t, R = boost::bgl_named_params<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, long unsigned int, long unsigned int&, boost::vertex_index_t>, boost::vertex_index_t, boost::no_property>]’ /usr/include/boost/graph/connected_components.hpp:75: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, typename boost::enable_if_c<boost::is_base_and_derived::value, boost::graph::detail::no_parameter>::type) [with Graph = main()::graph_t, ComponentMap = int*, P = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, long unsigned int, long unsigned int&, boost::vertex_index_t>, T = boost::vertex_index_t, R = boost::no_property]’ test.cpp:54: instantiated from here /usr/include/boost/graph/connected_components.hpp:46: error: no matching function for call to ‘put(int*&, void*&, int&)’ /usr/include/boost/graph/connected_components.hpp: In member function ‘void boost::detail::components_recorder<ComponentsMap>::discover_vertex(Vertex, Graph&) [with Vertex = void*, Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, ComponentsMap = int*]’: /usr/include/boost/graph/depth_first_search.hpp:38: instantiated from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<int*>, Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>]’ /usr/include/boost/concept/detail/has_constraints.hpp:40: instantiated from ‘const bool boost::concept::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS> > >::value’ /usr/include/boost/concept/detail/has_constraints.hpp:43: instantiated from ‘boost::concept::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS> > >’ /usr/include/boost/mpl/if.hpp:67: instantiated from ‘boost::mpl::if_<boost::concept::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS> > >, boost::concept::constraint<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS> > >, boost::concept::requirement<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS> > > >’ /usr/include/boost/concept/detail/general.hpp:19: instantiated from ‘boost::concept::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS> >)>’ /usr/include/boost/concept_check.hpp:43: instantiated from ‘void boost::function_requires(Model*) [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS> >]’ /usr/include/boost/graph/depth_first_search.hpp:191: instantiated from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, DFSVisitor = boost::detail::components_recorder<int*>, ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, long unsigned int, long unsigned int&, boost::vertex_index_t> >]’ /usr/include/boost/graph/depth_first_search.hpp:296: instantiated from ‘void boost::depth_first_search(const VertexListGraph&, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, P = boost::detail::components_recorder<int*>, T = boost::graph_visitor_t, R = boost::bgl_named_params<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, long unsigned int, long unsigned int&, boost::vertex_index_t>, boost::vertex_index_t, boost::no_property>]’ /usr/include/boost/graph/connected_components.hpp:75: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, typename boost::enable_if_c<boost::is_base_and_derived::value, boost::graph::detail::no_parameter>::type) [with Graph = main()::graph_t, ComponentMap = int*, P = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, long unsigned int, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, long unsigned int, long unsigned int&, boost::vertex_index_t>, T = boost::vertex_index_t, R = boost::no_property]’ test.cpp:54: instantiated from here /usr/include/boost/graph/connected_components.hpp:46: error: no matching function for call to ‘put(int*&, void*&, int&)’ gmarchand@bohr:~/TMP$ I hope it is more clear now, Gabriel --- En date de : Mer 6.4.11, Cedric Laczny <cedric.laczny(a)gmx.de> a écrit : De: Cedric Laczny <cedric.laczny(a)gmx.de> Objet: Re: [Boost-users] (no subject) À: boost-users(a)lists.boost.org Date: Mercredi 6 avril 2011, 16h15 Hi, On Wednesday, 6. April 2011 12:55:52 Gabriel Marchand wrote: > Hi, I am new to boost and I face the same problem mentioned here with > "connected_components()" using a mutable graph (hence using a list for the > vertex container). I try the detailed solution of Aaron Windsor in the > previous post but I still get some errors at compilation. Here is my > little code: > > > > #include <boost/graph/adjacency_list.hpp> > #include <boost/graph/connected_components.hpp> > > using namespace std; > using namespace boost; > > Box& b = conf.GetBox(); > You seem to use your own classes and you do not provide the definition. Thus this is unfortunately not a minimal example. So in the future, it might facilitate help from others to you, with this in the back of your head. > > if (!ai) { > ai = new AtomList(); > *ai = conf.GetAtoms().AtomSelector(selecti, b); > } > > typedef boost::adjacency_list< > listS, > listS, > undirectedS, > property<vertex_index_t, size_t>, > no_property> > > > graph_t; > > graph_t g(ai->size()); > property_map<graph_t, vertex_index_t>::type index = get(vertex_index, > g); With listS as the vertex container, I would expect it to fail here. An adjacency_list with listS does not automatically create a vertex_index property. So you might give vecS a try. Especially, if you insert most of the vertices (if not all) at one specific moment and you are not constantly changing the number of vertices in the graph, I think it will make no big difference in performance whether you use vecS or listS. But you have the benefit of automatic vertex_index property-creation. I can however not compile your example (s. above) nor did you provide the error message you get, so I can't tell you for sure if this is the source of error. > graph_traits<graph_t>::vertex_iterator vi, vi_end; > graph_traits<graph_t>::vertices_size_type cnt = 0; > for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi) > put(index, *vi, cnt++); > > for (unsigned int i = 0; i < ai->size(); ++i) { > Cartesian& crdi = ai->GetElement(i)->pos; > for (unsigned int j = i + 1; j < ai->size(); ++j) { > Cartesian& crdj = ai->GetElement(j)->pos; > double r = conf.GetBox().CartesianDistance(crdi, crdj); > if (r < rcut) { > add_edge(vertex(i,g), vertex(j,g), g); // Add edge to Map > if distance criteria is satisfied > > } > } > } > > vector<int> component(num_vertices(g)); > int num_clusters = connected_components(g, &component[0], > vertex_index_map(index)); > > > > > The compilation is successfull until I add the last line: > int num_clusters = connected_components(g, &component[0], > vertex_index_map(index)); This confuses me a bit, as I would expect the error in an earlier line. So you might look forward to provide your error message or a really working, minimal example. > > > Hope somebody can give a hint Hope this helps. > gabriel Best, Cedric _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

write_xml()
by Иван 06 Apr '11

06 Apr '11

Hi, I use write_xml() function and boost-1.46.0-4 on arch linux. void create() { ... out_file.save("/machines/"+name); .... void serializer::save (const std::string &filename) { boost::property_tree::xml_parser::xml_writer_settings<char> gramma(' ',8); write_xml(filename, pt, std::locale(), gramma); } This function don't chroot. readlink -f /proc/5682/cwd /home/iwan Write_xml() create the /machines/+name But it must create a path /home/iwan/machines/+name Why? It is bug? I am sorry for my bad english.

2 1