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

Missing function 'vertex' from reverse graph
by Mangal 24 Nov '09

24 Nov '09

I am using boost 1.40.0. Reverse_graph.hpp seems to be missing the following function template <class BidirectionalGraph, class GRef> typename graph_traits<BidirectionalGraph>::vertex_descriptor vertex(const typename graph_traits<BidirectionalGraph>::vertices_size_type n, const reverse_graph<BidirectionalGraph,GRef>& g) { return vertex(n, g.m_g); } currently calling the function vertex (someIndex, reversegraph) returns an error. -- View this message in context: http://old.nabble.com/Missing-function-%27vertex%27-from-reverse-graph-tp26… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Re: [Boost-users] [Phoenix] Ignore last post.
by James Knight 24 Nov '09

24 Nov '09

I realized some of the things I was doing in the sample code are pretty stupid. I'm still not sure why the compilation was failing on the phoenix code. I'll repost once I figure out what I'm doing. Sorry for the noise. On Tue, Nov 24, 2009 at 12:09 PM, James Knight <james.nate.knight(a)gmail.com>wrote: > I'm having a problem using Boost.Phoenix. I'm currently building against > Boost 1.41 using gcc 4.3.2. > > I've simplified my use case quite a bit, so please forgive the obtuseness > of the example. The following code fails to compile: > > ~~~~~~~~~~~~~~~~~~~~ > > #include <boost/fusion/include/std_pair.hpp> > #include <boost/spirit/home/phoenix/core/argument.hpp> > #include <boost/spirit/home/phoenix/fusion.hpp> > #include <boost/spirit/home/phoenix/operator.hpp> > > #include > <vector> > > #include > <map> > #include <algorithm> > > namespace phx = boost::phoenix; > using namespace phx::arg_names; > using phx::at_c; > using std::map; > > using std::multimap; > using std::vector; > > int main() > { > > typedef map<vector<char>,int> > char_int_map_t; > typedef multimap<int,char_int_map_t::iterator> > int_iter_map_t; > typedef map<vector<char>, char_int_map_t::iterator> > char_iter_map_t; > > > int int_key = > 5; > > > > char_int_map_t > int_map; > > int_iter_map_t > int_iter_map; > > > > char_iter_map_t char_iter_map1, > char_iter_map_t2; > > > int_iter_map_t::iterator > start,stop; > > std::pair<int_iter_map_t::iterator,int_iter_map_t::iterator> > > er = int_iter_map.equal_range(int_key); > > std::set_intersection( > char_iter_map1.begin(), char_iter_map1.end(), > er.first,er.second, > inserter(char_iter_map_t2,char_iter_map_t2.begin()), > phx::at_c<0>(arg1) < phx::at_c<0>(*phx::at_c<1>(arg2)) // <- > COMPILE FAILURE > ); > } > > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ > > Here is the information I can offer, > > 1) When the key in char_int_map_t and char_iter_map_t is a char rather than > a vector<char> this compiles without problems. > 2) The gcc error shows that the arguments to the generated function object > are being switched (I think, see below) > > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ > ... > .../comparison.hpp:29:5: error: no match for ‘operator<’ in > ‘result_of_less<const int&, const vector<char>&>::x < result_of_less<const > int&, const vector<char>&>::y’ > .../comparison.hpp: In instantiation of ‘const int result_of_less<const > int&, const vector<char>&>::index’: > .../comparison.hpp:29: instantiated from ‘result_of_less<const int&, > const vector<char>&>’ > .../mpl/eval_if.hpp:38: instantiated from ‘eval_if<or_<is_actor<const > int&>, is_actor<const vector<char>&>, mpl_::bool_<false>, > mpl_::bool_<false>, mpl_::bool_<false> >, re_curry<less_eval, const int&, > const vector<char>&>, result_of_less<const int&, const vector<char, > allocator<char> >&> >’ > .../comparison.hpp:39: instantiated from ‘ > > boost::phoenix::less_eval::result< > boost::phoenix::basic_environment< > > std::pair< > // This should be the second argument, no? > const > int, > > std::_Rb_tree_iterator<std::pair<const std::vector<char, > std::allocator<char> >, int>> > >, > std::pair< > const std::vector< char, std::allocator<char> >, > std::_Rb_tree_iterator<std::pair<const std::vector<char, > std::allocator<char> >, int>> > > > >, > boost::phoenix::composite< > boost::phoenix::at_eval<0>, > boost::fusion::vector< > boost::phoenix::argument<0> > > > >, > boost::phoenix::composite< > boost::phoenix::at_eval<0>, > boost::fusion::vector< > boost::phoenix::composite< > boost::phoenix::dereference_eval, > boost::fusion::vector< > boost::phoenix::composite< > boost::phoenix::at_eval<1>, > boost::fusion::vector< > boost::phoenix::argument<1> > > > > > > > > > > > > > > > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ > > 3) Finally, if I use the expression > > phx::at_c<0>(arg1) < *phx::at_c<1>(arg2) > > the code still fails to compile (obviously), but does seem to get the > arguments in the correct order. > > Any ideas? > > Thanks > Nate >

1 0

boost::graph - Newbie question about vertex properties
by Stephen Karmann 24 Nov '09

24 Nov '09

Hello dear mailing list members, i'm new to this mailing list and hope i'm right here and that my english is not too annoying. I have to to some distance calculation and decided to use the boost::graph-framework to do this as i have to develop a C++ application using Visual C++ Express Edition 2008. I have to include some background details information in the vertices and edges of my graph and chose to append such meta info objects to the vertices and edges with the help of properties. I defined the following types in the Header-Class: [code] struct vtx_ref_t { typedef boost::vertex_property_tag kind; }; struct edge_ref_t { typedef boost::edge_property_tag kind; }; // VtxMetaClass and EdgeMetaClass are some Classes containing some // infos needed for calculation typedef boost::property<vtx_ref_t, VtxMetaClass*> VtxProperty; typedef boost::property<edge_ref_t, EdgeMetaClass*> EdgeProperty; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VtxProperty, EdgeProperty> MyGraphType; typedef boost::graph_traits<MyGraphType>::vertex_descriptor vertex_t; typedef boost::graph_traits<MyGraphType>::edge_descriptor edge_t; [/code] In the Main-Method i tried to use the function boost::put to append such a meta class object infoobj to a vertex (whose vertex descriptor vtx i only have) i have created somewhere else where i cannot append the infoobject cause i don't know at that time which one to append. [code] MyGraphType graph(100); vertex_t vtx = boost::add_vertex(graph); VtxMetaClass* infoobj; ... boost::property_map<MyGraphType, vtx_ref_t>::type vtxref = get(vtx_ref_t(), graph); boost::put(vtxref, graph, vtx, infoobj); [/code] But i only get a compilation error telling me that: 1>e:\development\VC++\project\include\boost/pending/property.hpp(46) : error C2039: 'kind': is no element of 'boost::vec_adj_list_vertex_property_map<Graph,GraphPtr,ValueType,Reference,Tag>' What is wrong with that, i did what was suggested in the online manual ? I know there's also the possibility to use boost::put with the index of the vertex that has to be manipulated, but i don't know how to query the index from the vertex_descriptor i have, perhaps you came across a way to do this yet ... Perhaps you could help me with this problem ? Thank you very much in anticipation, Stephen

2 1

[Phoenix]
by James Knight 24 Nov '09

24 Nov '09

I'm having a problem using Boost.Phoenix. I'm currently building against Boost 1.41 using gcc 4.3.2. I've simplified my use case quite a bit, so please forgive the obtuseness of the example. The following code fails to compile: ~~~~~~~~~~~~~~~~~~~~ #include <boost/fusion/include/std_pair.hpp> #include <boost/spirit/home/phoenix/core/argument.hpp> #include <boost/spirit/home/phoenix/fusion.hpp> #include <boost/spirit/home/phoenix/operator.hpp> #include <vector> #include <map> #include <algorithm> namespace phx = boost::phoenix; using namespace phx::arg_names; using phx::at_c; using std::map; using std::multimap; using std::vector; int main() { typedef map<vector<char>,int> char_int_map_t; typedef multimap<int,char_int_map_t::iterator> int_iter_map_t; typedef map<vector<char>, char_int_map_t::iterator> char_iter_map_t; int int_key = 5; char_int_map_t int_map; int_iter_map_t int_iter_map; char_iter_map_t char_iter_map1, char_iter_map_t2; int_iter_map_t::iterator start,stop; std::pair<int_iter_map_t::iterator,int_iter_map_t::iterator> er = int_iter_map.equal_range(int_key); std::set_intersection( char_iter_map1.begin(), char_iter_map1.end(), er.first,er.second, inserter(char_iter_map_t2,char_iter_map_t2.begin()), phx::at_c<0>(arg1) < phx::at_c<0>(*phx::at_c<1>(arg2)) // <- COMPILE FAILURE ); } ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Here is the information I can offer, 1) When the key in char_int_map_t and char_iter_map_t is a char rather than a vector<char> this compiles without problems. 2) The gcc error shows that the arguments to the generated function object are being switched (I think, see below) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ... .../comparison.hpp:29:5: error: no match for ‘operator<’ in ‘result_of_less<const int&, const vector<char>&>::x < result_of_less<const int&, const vector<char>&>::y’ .../comparison.hpp: In instantiation of ‘const int result_of_less<const int&, const vector<char>&>::index’: .../comparison.hpp:29: instantiated from ‘result_of_less<const int&, const vector<char>&>’ .../mpl/eval_if.hpp:38: instantiated from ‘eval_if<or_<is_actor<const int&>, is_actor<const vector<char>&>, mpl_::bool_<false>, mpl_::bool_<false>, mpl_::bool_<false> >, re_curry<less_eval, const int&, const vector<char>&>, result_of_less<const int&, const vector<char, allocator<char> >&> >’ .../comparison.hpp:39: instantiated from ‘ boost::phoenix::less_eval::result< boost::phoenix::basic_environment< std::pair< // This should be the second argument, no? const int, std::_Rb_tree_iterator<std::pair<const std::vector<char, std::allocator<char> >, int>> >, std::pair< const std::vector< char, std::allocator<char> >, std::_Rb_tree_iterator<std::pair<const std::vector<char, std::allocator<char> >, int>> > >, boost::phoenix::composite< boost::phoenix::at_eval<0>, boost::fusion::vector< boost::phoenix::argument<0> > >, boost::phoenix::composite< boost::phoenix::at_eval<0>, boost::fusion::vector< boost::phoenix::composite< boost::phoenix::dereference_eval, boost::fusion::vector< boost::phoenix::composite< boost::phoenix::at_eval<1>, boost::fusion::vector< boost::phoenix::argument<1> > > > > > > > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 3) Finally, if I use the expression phx::at_c<0>(arg1) < *phx::at_c<1>(arg2) the code still fails to compile (obviously), but does seem to get the arguments in the correct order. Any ideas? Thanks Nate

1 0

C/C++/Java-like language in Boost Spirit
by Bilokon, Paul 24 Nov '09

24 Nov '09

Hi all, Has anyone written any C/C++/Java-like language parsers in Boost Spirit? If so, could you point me in the direction of some code examples? I have searched the web for something similar but unfortunately couldn't find any useful examples. Best wishes, Paul Paul Bilokon, Vice President Citigroup | FX - Options Trading | Quants 33 Canada Square | Canary Wharf | Floor 3 London, E14 5LB Phone: +44 20 798-62191 paul.bilokon(a)citi.com<mailto:paul.bilokon@citi.com>

4 4

[asio] Receiving data larger than buffer.
by Sajjan Kalle 24 Nov '09

24 Nov '09

Hi, I have a few questions regarding asio, and the network sockets in particular. I'm using TCP sockets to transfer data across a network. The problem I have is when data that is larger than the receive buffer. In this case num bytes reported == receive buffer size, however, is there a way to distinguish the case when I receive exactly buffer size amounts of data, and when the case when there's more left to complete the transfer? How does asio handle transfer of really large buffers? Will it dispatch it client side in receive buffer sized chunks as it enters, or will it wait for the entire payload to enter some internal buffer before dispatching?

2 2

2nd Call for Participation - BoostCon 2010
by Hartmut Kaiser 24 Nov '09

24 Nov '09

Please distribute! -------------------------------- 4th Annual Boost Conference 2010 -------------------------------- Aspen CO, USA, May 4-10, 2010, www.boostcon.com 2nd Call for participation ---------------------- We invite you to submit session proposals to the 4th Annual Boost Conference: BoostCon 2010 (Aspen CO, USA, May 10-14, 2010). Traditionally the main face-to-face event for all things Boost (www.boost.org), BoostCon 2010 will present leading speakers from the whole C++ community. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and the new C++ Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at two constituencies: Boost end-users and hard-core Boost library and tool developers. The program fosters interaction and engagement within and across those two groups, with an emphasis on hands-on, participatory sessions. Session topics -------------- Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing 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 * C++0x and how it will change life for users and library writers * 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 * Other topics likely to be of great interest to Boost users and developers Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and 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 Boost and Boost users. Panels Panels feature three or four people presenting their ideas and experiences relating to 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 Boost-relevant skills. 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 90 minute, 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 have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon10. 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 BoostCon website and will be available to attendees. For general information on the BoostCon 2010 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon10(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 BoostCon. Important dates --------------- Proposal submissions due: Dec 10th, 2009. Proposals decisions sent (tentative program available): Jan 15th, 2010. Fully scheduled program available: Feb 5th, 2010. Session materials due: Apr 15th, 2010. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Using boost::bind with boost::function
by maruthilakshman-boost＠yahoo.com 24 Nov '09

24 Nov '09

I'm using Boost ver 1.39.0 I have a module to which other modules can register callbacks. This module will call those callbacks with a couple of arguments - as an example registerCallBack(void (*callbackFunc)(int)); At the time of callback it will call: (*callbackFunc)(3); To allow for any function to be registered (each module's callback may have a different signature etc, but everyone can allow for this one last arg), I declared it to take a boost::function<void (int)> I was hoping that if I have a twoarg_callback(int, int) function, I can register it with the module by using boost::bind to bind the first argument, but that is not possible. I am unable to assign the return value of boost::bind to a boost::function<void (int)> object by binding one argument. However, assigning the return value of boost::bind where all the arguments of a function are bound (so the resulting object is a void() function) seems to work. I'm trying to decipher the errors, but would appreciate any help I can get. I get errors both on VisualStudio 2008, as well as g++ 4.1.2, so I'm guessing it's not some compiler problem rather it's my usage. Attached a sample source file. I commented out the 4 lines that were giving me errors. Thanks, Lakshman. The INTERNET now has a personality. YOURS! See your Yahoo! Homepage. http://in.yahoo.com/

4 6

[serialization] usage of polymorphic archives generate linker errors
by Christoph Heindl 24 Nov '09

24 Nov '09

Hi everyone, the attached example [1] generates a couple of linker [2] errors on msvc 9.0 / boost 1.40.0 all related to missing archive_serializer_map symbols. when switching from polymorphic archives to corresponding non-polymorphic archives the attached example runs fine. It seems that the usage of BOOST_CLASS_EXPORT in conjunction with polymorphic archives triggers the linker error. I tried to add explicit template instantiations, such as [3], for the missing types to boost archive, recompiled boost and was able to get rid of the linker error. The problem then, however, is that the example fails at runtime with an assertion that a type-lookup did not succeed. So I guess adding the explicit template instantiations was not the correct approach. Any ideas? Best regards, Christoph [1] example_boost_class_export.cpp [2] linker_errors.txt [3] polymorphic_xml_iarchive.cpp

1 1

[MultiIndex] insert with and without position hint
by Igor R 24 Nov '09

24 Nov '09

Hello, For some reason, the "hinted" version of insert() returns just an iterator, while the "unhinted" one returns pair: std::pair<iterator,bool> insert(const value_type& x); iterator insert(iterator position,const value_type& x); I've got a container with 1 ordered unique index. From one hand, I have to know whether the insertion was succesful, but from the other hand, 99% of the objects are inserted in their natural ascending order, so I use the hinted version: container_.insert(container_.end(), newObj); So my question is whether there's any performance benefit of the "hinted" version in such case, or I can move to the simple one w/o any performance loss? Thanks.

2 2