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

[boost bimap]- question on use of optional sorting predicate for set_of declarations
by Curtis Himel 27 Nov '09

27 Nov '09

I have a question with sorting of sets in the bimap framework. I have a bimap declared thus: //Boost Bimap requires this predicate struct setup struct AreDecalIDsInCorrectRenderOrderStruct { bool operator() (const short nDecalID1, const short nDecalID2) const { //Do comparison } }; typedef boost::bimap<boost::bimaps::unordered_multiset_of<int>, boost::bimaps::set_of<short, AreDecalIDsInCorrectRenderOrderStruct>> intMultisetShortSetBimap; intMultisetShortSetBimap m_mStructureIDToLinkedDecalID; The problem is this isn't working as I expected. I'm expecting that when I insert elements using: m_mStructureIDToLinkedDecalID.insert(intMultisetShortSetBimap ::value_type(nStructureID, nDecalID)); and then later retrieve them using: pair<intMultisetShortSetBimap ::left_const_iterator, intMultisetShortSetBimap ::left_const_iterator> equalRange = m_mStructureIDToLinkedDecalID.left.equal_range(nStructureID); that the retrieved elements with equal range would be sorted according to the predicate I used. But they aren't. Instead their order is dependent on the order they were inserted. I've verified that my predicate is being called on insertions. Am I misunderstanding the purpose of passing a sorting predicate to a set_of declaration? If so, what does the sorting actually do and is there a way to get boost::bimap to do what I want? Thanks for any help. -Curtis _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ This e-mail and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this e-mail in error please notify the originator of the message. This footer also confirms that this e-mail message has been scanned for the presence of computer viruses. Any views expressed in this message are those of the individual sender, except where the sender specifies and with authority, states them to be the views of Indra Systems, Inc.

2 1

[GIL] Performance warning...
by Eloi Du Bois 27 Nov '09

27 Nov '09

Hi all, I am creating a bunch of function for channel merging, thus I was looking in channel_algorithm.hpp and I saw something that may slow down processes... I don't know if I'm right, but on line 362: /// \ingroup ChannelConvertAlgorithm > /// \brief Converting from one channel type to another. > template <typename DstChannel, typename SrcChannel> // Model ChannelConcept > (could be channel references) > inline typename channel_traits<DstChannel>::value_type channel_convert(*SrcChannel > src*) { > return channel_converter<typename > channel_traits<SrcChannel>::value_type, > typename > channel_traits<DstChannel>::value_type>()(src); > } > There is no reference on parameter ***src*.* *That* *not* *a very good idea because references aren't hold by templates function (even if inlined). This may invoke copy constructor and can slow down the processes a "lot"... Here is an example that shows I'm right in theory: // "Slow" on big objects > template<typename P> > inline void testPtr1(P a) { > std::cout << "In called function inequality ptr of a: " << (int)&a << > std::endl; > } > > // Better > template<typename P> > inline void testPtr2(P &a) { > std::cout << "In called function equality ptr of a: " << (int)&a << > std::endl; > } > > template<typename P> > void test(const P & a) { > std::cout << "Base ptr of a: " << (int)&a << std::endl; > testPtr1(a); > } > > int main() { > int a = 0; > test(a); > return 0; > } >

2 1

[bimap] Creating a bimap fom a std::map
by Edward Diener 27 Nov '09

27 Nov '09

I would have thought, naively enough, that one of the common uses of a bimap was that one should be able to create a bimap from a std::map as long as the relation between the two types was unique both ways. I was disconcerted when I did not see a bimap constructor that accepted a std::map of the same types, but then I saw the constructor which takes two iterators and decided to try that, like so: std::map<int,std::string> myMap; // ... fill myMap boost::bimap<int,std::string> myBimap(myMap.begin(),myMap.end()); I was met with, in VC9 using Boost 1.40: "c:\utilities\boost\boost_1_40_0\boost\multi_index_container.hpp(232) : error C2664: 'std::pair<_Ty1,_Ty2> boost::multi_index::multi_index_container<Value,IndexSpecifierList,Allocator>::insert_(const Value &,boost::multi_index::detail::ordered_index_node<Super> *)' : cannot convert parameter 1 from 'std::pair<_Ty1,_Ty2>' to 'const boost::bimaps::relation::mutant_relation<TA,TB,Info,force_mutable> &' 1> with 1> [ 1> _Ty1=boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>,std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>>>> *, 1> _Ty2=bool, 1> Value=boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>, 1> IndexSpecifierList=boost::bimaps::detail::bimap_core<int,TString,boost::mpl::na,boost::mpl::na,boost::mpl::na>::core_indices, 1> Allocator=std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>, 1> Super=boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>,std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>>> 1> ] 1> and 1> [ 1> _Ty1=const int, 1> _Ty2=TString 1> ] 1> and 1> [ 1> TA=boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>, 1> TB=boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>, 1> Info=boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info, 1> force_mutable=true 1> ] 1> Reason: cannot convert from 'std::pair<_Ty1,_Ty2>' to 'const boost::bimaps::relation::mutant_relation<TA,TB,Info,force_mutable>' 1> with 1> [ 1> _Ty1=const int, 1> _Ty2=TString 1> ] 1> and 1> [ 1> TA=boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>, 1> TB=boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>, 1> Info=boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info, 1> force_mutable=true 1> ] 1> No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called 1> c:\utilities\boost\boost_1_40_0\boost\bimap\bimap.hpp(247) : see reference to function template instantiation 'boost::multi_index::multi_index_container<Value,IndexSpecifierList,Allocator>::multi_index_container<InputIterator>(InputIterator,InputIterator,const boost::tuples::cons<HT,TT> &,const std::allocator<_Ty> &)' being compiled 1> with 1> [ 1> Value=boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>, 1> IndexSpecifierList=boost::bimaps::detail::bimap_core<int,TString,boost::mpl::na,boost::mpl::na,boost::mpl::na>::core_indices, 1> Allocator=std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>, 1> InputIterator=std::_Tree<std::_Tmap_traits<int,TString,std::less<int>,std::allocator<std::pair<const int,TString>>,false>>::iterator, 1> HT=boost::tuples::tuple<boost::multi_index::member<boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,true>,std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,pointer-to-member(0x4)>,std::less<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>>>, 1> TT=boost::tuples::cons<boost::tuples::tuple<boost::multi_index::member<boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,true>,int,pointer-to-member(0x0)>,std::less<int>>,boost::multi_index::detail::index_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>,boost::bimaps::detail::bimap_core<int,TString,boost::mpl::na,boost::mpl::na,boost::mpl::na>::core_indices,std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>>::ctor_args_list>, 1> _Ty=boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true> 1> ] 1> c:\programming\programs\vc9\xxx\current\yyyyyyyyyy\zzzzzzzzzzzzzzzz.cpp(338) : see reference to function template instantiation 'boost::bimaps::bimap<KeyTypeA,KeyTypeB>::bimap<std::_Tree<_Traits>::iterator>(InputIterator,InputIterator)' being compiled 1> with 1> [ 1> KeyTypeA=int, 1> KeyTypeB=TString, 1> _Traits=std::_Tmap_traits<int,TString,std::less<int>,std::allocator<std::pair<const int,TString>>,false>, 1> InputIterator=std::_Tree<std::_Tmap_traits<int,TString,std::less<int>,std::allocator<std::pair<const int,TString>>,false>>::iterator 1> ]" So evidently that does not work. What is the problem with creating a bimap from the data in a std::map ? It seems as if it should be a no-braine and one of the chief selling points of using a bimap.

4 10

Compiler warnings from Macs, IBM acc, Borland, Comeau, Metroworks, et al - are they a Problem?
by Paul A. Bristow 27 Nov '09

27 Nov '09

https://svn.boost.org/trac/boost/wiki/Guidelines/MaintenanceGuidelines (bottom of the page) has a collection of suggestions for 'quieting' warnings on MSVC and GCC, but no information on other compilers yet. Can users of these compilers please 1 Assert that they never have a problem with unhelpful compiler warnings from Boost stuff, or 2 Send common warnings and suggestions for dealing with them by suppressing or by 'fixing' the code (so that I can add to the guidelines. Thanks Paul --- Paul A. Bristow Prizet Farmhouse Kendal, UK LA8 8AB +44 1539 561830, mobile +44 7714330204 pbristow(a)hetp.u-net.com

2 1

[boost serialization] Build SQL database from data in web pages
by Boost lzw 27 Nov '09

27 Nov '09

Hello folks, I am wondering if I can use boost, boost serialization in particular, to build a SQL database from data in web pages. For example, I want to build a SQL database based on data from web page link such as this one: http://tubic.tju.edu.cn/deg/information.php?ac=DEG10010001 Since the data would be collected from thousands of such link, I want to write code for doing it automatically. Can anyone suggest how to do it with boost? Thanks a lot in advance, Robert

3 2

Re: [Boost-users] gcc problems on mac os 10.6...
by Wong Hua 27 Nov '09

27 Nov '09

Thanks for the answer ! It seems that you have a custom Python installed in /Library/Frameworks/Python. framework, and the build process prefers this one instead of the "system" /System/Library/Frameworks/Python.framework. When I installed the custom 2.5 one from python.org, I had the same error, because the build process picked up this custom install of Python. I uninstalled it, and the build picked up the system python, which worked well. The thing is that the Python from Python.org is 32 bits. The python installed with mac os 10.6 is 64 bits. I checked that using : >>>import struct >>>struct.calcsize("P")*8 Returns 32 on the python installed from python.org (in fact you have to specify you want a 64 bit python when configuring I think)

2 1

uuid?
by Maróy Ákos 27 Nov '09

27 Nov '09

Hi, I searched through the boost-users mailing list archives, and found a few references of a to-be-released uuid implementation, but nothing really tangilbe. Is there a uuid implementation available under or around boost? Thanks, Akos

9 13

Re: [Boost-users] BOOST_FOREACH and boost::bimap
by pete＠pcbartlett.com 27 Nov '09

27 Nov '09

On Fri 27/11/09 08:08 , Conoscenza Silente <abruzzoforteegentile(a)gmail.com> wrote: > Hi All > I tried to use BOOST_FOREACH with bimap but it doesn't compile. .. > BOOST_FOREACH( BMapKIt it, myBimap) // this line doesnt' ... Bimap is no different from any other container when it comes to FOREACH, you need "BMapVal v" not "BMapKlt it" in the macro.

2 1

[Statechart] How to model this scenario?
by Zachary Turner 27 Nov '09

27 Nov '09

Suppose I have a character in a game. He can run, and do two types of attacks. He can initiate either an attack first or a jump first, and then initiate the other second and it will perform both at the same time until one finishes, then go back to just one until that one is also finished, and finally go back to just running on the ground. Additionally, he can be knocked back either on the ground or while already in the air. The system has the following properties: - If he is attacking (regardless of whether it be on the ground or in the air), he cannot initiate another attack until the first one is done. Otherwise he can always initiate an attack (even in the air). - If he is jumping, he cannot jump again until the first jump is finished. - Regardless of whether he is jumping or on the ground, he can initiate attack 1, initiate attack 2, or jump. All of this is only possible if he is not currently being knocked back. - There are separate animations for: jumping attack 1 while on the ground attack 2 while on the ground attack 1 while jumping attack 2 while jumping knockback If being knocked back, the knockback animation takes priority over whatever other animation was being played at the time. After the knockback is complete, it will continue from the previous animation, assuming that state has not finished. I feel like I should use some type of concurrent states here, but I'm not sure how to model the combinatorial factor (i.e. playing different animations depending on the *combination* of states). I'm also not sure how to model the priority of the knockback animation. In fact, this is not just related to the Statechart library, but I'm unclear how to do this using UML State Machines as well. Any advice appreciated. Zach

2 1

finite state machine performance info
by Conoscenza Silente 27 Nov '09

27 Nov '09

Hi All Yesterday I started playing with Boost State Chart library implementing state machines for my applications. Each time I am moving into a new state I noticed that a new state is created; this means that the constructor of the boost::statechart::state class is called each time ( and the destructor for the state that I am leaving ). I would like to fasten up the whole process; let's say that I would like to avoid the creation/destruction of the class each time using object already allocated in memory that are deleted only at the exit of the application. Is this a good way in your opinion ? I saw that there is an allocator template argument but at the state where I am now I would lilke to not spend time in doing a new allocator for that: do you know if there already in place something that I can reuse for my purpose? Thanks CS

5 9