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

Boost 1.32.0 and VS.NET 2005 under AMD64
by p.klotz＠icoserve.com 21 Feb '05

21 Feb '05

There exist a few problems when trying to compile Boost 1.32.0 under AMD64 with VS.NET 2005: * No toolset exists to compile Boost 1.32.0 native on the AMD64 platform (no cross compile). The attached file vc-8_0-amd64-tools.jam fixes that. * InterlockedExchange() in line 44 of lwm_win32.hpp collides with a macro of the same name in WinBase.h One finds in WinBase.h: #elif defined(_M_AMD64) && !defined(RC_INVOKED) ... #define InterlockedExchange _InterlockedExchange I changed the name of Boost's function to InterlockedExchangeBoost() to avoid this problem. * No type long_type exists when compiling with the Microsoft Compiler. The 64Bit part in lwm_win32.hpp seems to have been written for the Intel Compiler. An additional #ifdef now checks if the 64Bit compiler is from Intel or Microsoft. The InterlockedExchange() and long_type issues are fixed by boost_1_32_0-AMD64.patch. Maybe these changes can be integrated in some form in the next version of Boost. Best regards, Peter.

1 0

Creating a mst graph from another, undirected one
by aitor 21 Feb '05

21 Feb '05

Hello, i'm working with a (huge) undirected graph, with severeal internal properties in both vertices and edges, including weights. At one point, i compute the minumim spanning tree of the graph. The question is simple: how can i create another graph (a tree, so a directed graph) from the original undirected graph plus the list of edges conforming the mst ? And how can i do it _efficiently_ (considering that the original graph will be huge) ? Consider this seudo-code: #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/property_map.hpp> #include <boost/graph/properties.hpp> #include <boost/graph/kruskal_min_spanning_tree.hpp> typedef adjacency_list < boost::listS, boost::vecS, boost::undirectedS, VertexProperties, EdgeProperties> UGraph; typedef adjacency_list < boost::listS, boost::vecS, boost::directedS, VertexProperties, EdgeProperties> MSTree; void createGraph() { UGraph g; add_vertices(); add_edges(); compute_edges_weights(); vector<graph_traits<UGraph>::edge_descriptor> mst_edges(num_vertices(g)); kruskal_minimum_spanning_tree(g, back_inserter(mst_edges)); // At this point i want to create another graph of type MSTree from // g and mst_edges. How can i do it efficiently ? } thank you in advance aitor

2 5

Boost graph problem removing last vertex
by gast 128 21 Feb '05

21 Feb '05

Dear all, I have a graph, but when I remove the last vertex, the edge isn't removed. This can even lead to a crash. typedef boost::adjacency_list<boost::listS, boost::vecS, //or listS, same problem boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::string> > > GraphCrash; typedef boost::graph_traits<GraphCrash>::vertex_descriptor vertex_t; typedef boost::graph_traits<GraphCrash>::edge_descriptor edge_t; typedef boost::graph_traits<GraphCrash>::vertex_iterator vertex_iterator; typedef boost::graph_traits<GraphCrash>::edge_iterator edge_iterator; GraphCrash graph; //vertices vertex_t v1 = boost::add_vertex(graph); boost::put(boost::vertex_name, graph, v1, "v1"); vertex_t v2 = boost::add_vertex(graph); boost::put(boost::vertex_name, graph, v2, "v2"); //edges boost::add_edge(v1, v2, graph); //remove last vertex boost::remove_vertex(v2, graph); //should not give any edge, however...: std::pair<edge_iterator, edge_iterator> prEdges; for (prEdges = boost::edges(graph); prEdges.first != prEdges.second; ++prEdges.first) { const edge_t e = *prEdges.first; const vertex_t u = boost::source(e, rGraph); const vertex_t v = boost::target(e, rGraph); } Do I something wrong? I use vc++ 7.1. Wkr, me (btw entering this message through gmane, it bounces back, with error that is is a top posting. Strange...) _________________________________________________________________ Talk with your online friends with MSN Messenger http://messenger.msn.nl/

4 4

regex/string algorithm problem
by The Grumpiest Man You Know 21 Feb '05

21 Feb '05

Hi, I think this is a bug but I'm willing to believe I'm misusing something. As a side point, I'm unsure of how to choose the regex syntax. I think I use boost::regex::perl as the second argument to the constructor but I haven't had much look with either that or the char_classes value. Anyway for me the snippet below the ----s hangs in the second find_all_regex. Ok, it may not hang, it may be building up a nice big core to dump but I only leave it for 20 seconds or so. This started with me trying to use find_regex which segfaulted when I tried to increment the iterator for the first time. I thought that might be me so I tried the safer way of just asking someone else to do all the real work :). This might prompt calls of "known issue." if I haven't messed up. In which case would someone care to hit me with a clue stick as to how I should check before bugging the list? Thanks for your time. Using Debian unstable: ii libboost-regex 1.32.0-2 regular expression library for C++ ii libboost-regex 1.32.0-2 regular expression library for C++ which I'm pretty sure is one for the library and one for the dev headers but I'm a noob there too, so I could be wrong. The compiler is: $ g++ -v Reading specs from /usr/lib/gcc-lib/i486-linux/3.3.5/specs Configured with: ../src/configure -v --enable-languages=c,c++,java,f77,pascal,objc,ada,treelang --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --with-gxx-include-dir=/usr/include/c++/3.3 --enable-shared --with-system-zlib --enable-nls --without-included-gettext --enable-__cxa_atexit --enable-clocale=gnu --enable-debug --enable-java-gc=boehm --enable-java-awt=xlib --enable-objc-gc i486-linux Thread model: posix gcc version 3.3.5 (Debian 1:3.3.5-8) -------------- #include <string> #include <iostream> #include <boost/algorithm/string_regex.hpp> template<class T> std::ostream& operator<<(std::ostream& cout, const std::vector<T>& v) { std::copy(v.begin(), v.end(), std::ostream_iterator<T>(cout, " ")); return cout; } main() { std::string line1("word -opt 5 -opt 45M -flag word -flag -opt word"); typedef boost::find_iterator<std::string::iterator> fi; for (fi i = boost::make_find_iterator(line1, boost::first_finder("word", boost::is_equal())); ! i.eof(); ++i) { std::cout << boost::copy_iterator_range<std::string>(*i) << std::endl; } std::vector<std::string> result; boost::regex rx1(" [-a-z]*"); boost::find_all_regex(result, line1, rx1); std::cout << result.size() << result << std::endl; result.clear(); boost::regex rx2("[-a-z]*"); boost::find_all_regex(result, line1, rx2); std::cout << result.size() << result << std::endl; std::cout << line1 << std::endl; } -- Blue Skies

2 1

Errors in date_time module
by Markus Petermann 20 Feb '05

20 Feb '05

Hello! I tried to build the date_date libraries of Boost 1.31.0 with a gcc 2.95.2 compiler on a SuSE 7.0 Linux system. I discovered several problems: 1. Several header and source files try to include the sstream header file. This header is not available for gcc 2.95.2. I solved this problem by using #if defined(BOOST_NO_STRINGSTREAM) ... #else ... #endif constructions to include the correct header file and use the correct class. 2. In order to trigger the correct header file from error no. 1 the flag BOOST_NO_STRINGSTREAM must be set. This should be done by the config system (e.g. in boost/config/compiler/gcc.hpp). 3. I tried to include the date_time header files into a source file that also uses the Xerces library. This resulted in an error in file boost/date_time/gregorian_calendar.ipp, function gregorian_calendar_base<ymd_type_,date_int_type_>::day_number(const ymd_type& ymd) because of two + operators the compiler can use ( the buildin operator+(int, int) and second one from Xerces ). This error can be solved by doing a static cast to unsigned int for the three classes boost::gregorian::greg_year, greg_month and greg_day. The unsigned int operator is defined for all three classes. I have created two patch files for boost versions 1.31.0 and 1.32.0: http://home.arcor-online.de/markus.petermann/boost_1_31_0.patch http://home.arcor-online.de/markus.petermann/boost_1_32_0.patch Maybe these corrections can be considered for future releases. Best regards, Markus Petermann

4 5

RE: Program options: terminating parsing.
by The Grumpiest Man You Know 20 Feb '05

20 Feb '05

Since I might still be in the moderation queue I don't know how useful this is but ... Thanks for the ears :) I did infact make an object that changed the words to all be a dummy option and it seems to work fine. If there is a simple control I overlooked I'd be happy to hear about it but after sending the late night message and sleeping I think the solution I mumbled is quite fitting. -- Blue Skies

1 0

Singleton factories, shared_ptr, and serialization, oh my!
by Bill Lear 20 Feb '05

20 Feb '05

I have a long question on how to combine a Singleton factory, serialization, shared pointers and an object hierarchy half of which will be created by a factory, and half of which will not. I think solving this problem in an elegant way might be very useful for others, so if someone with more experience with these things could take the time to plough through this, we might get something that is very valuable to the rest of the community. I have a base class (Base) and several derived classes that fall into two categories: production classes that are created by a singleton factory, and test derived classes that are created "by hand" in test code: Base DerivedProductionA DerivedProductionB DerivedTestA DerivedTestB A Singleton factory is used to create "production" Base objects by examining a string key and available data on the file system. If certain conditions obtain, DerivedProductionA is created, otherwise DerivedProductionB is created, and the key used to create the object is used to set a property in the object so it "knows" its creation key. The created object is stored in a hash map by key and a reference (currently, a raw pointer, but I'm contemplating using shared_ptr) to the object is returned. The Base object is used by other objects that need to be serialized: class Thing { Base* my_base; template <class Archive> void save(Archive& ar, unsigned int) const { // TBD } template <class Archive> void load(Archive& ar, unsigned int) { // TBD } }; Currently, the save/load methods inspect the Base object's creation key. If the key is blank, the object is serialized directly (a test class). If the key is not blank, the creation key is serialized (thus, a "production" class). Before this is done, a boolean flag is serialized indicating that a creation key was used to store the object or the object itself was stored. This is it, in rough form: template <class Archive> void save(Archive& ar, unsigned int) const { bool flag = key.size() != 0; ar << flag; if (flag) { ar << my_base->key(); } else { ar << my_base; } } template <class Archive> void load(Archive& ar, unsigned int) { bool flag; ar >> flag; if (flag) { string key; ar >> key; my_base = Factory::create(key); } else { ar >> my_base; } } Now, this works just fine, but it is a bit inelegant (a friend calls this uninheritance). I would prefer to be able to encapsulate the logic of serialization in a separate class, something like this: class BaseHandle { Base* my_base; template <class Archive> void save(Archive& ar, unsigned int) const { // As above. } template <class Archive> void load(Archive& ar, unsigned int) { // As above. } }; Then, the Thing class, and any other class that would want to serialize a Base object would be straightforward: class Thing { Base* my_base; template <class Archive> void save(Archive& ar, unsigned int) const { ar << my_base; } template <class Archive> void load(Archive& ar, unsigned int) { ar >> my_base; } }; My question is: Has anyone else run across this type of pattern? I would prefer to use a shared pointer to the Base class throughout and to hide the constructors of all Base (and its derived classes), to force allocation of these objects through special static alloc methods that create shared_ptr-wrapped objects. My problem is I don't quite know how to combine all of these ideas. For example, using shared_ptr, class Thing would be quite simple: typedef shared_ptr<Base> BasePtr; class Thing { BasePtr my_base; template <class Archive> void save(Archive& ar, unsigned int) const { ar << my_base; } template <class Archive> void load(Archive& ar, unsigned int) { ar >> my_base; } }; However, now I've broken the previous work: I'd have to go back and put all of the serialization logic for factory construction back in the Thing class itself. If I try to combine all of this in the BaseHandle class, I run into difficulties: typedef shared_ptr<Base> BasePtr; class BaseHandle { BasePtr my_base; template <class Archive> void save(Archive& ar, unsigned int) const { bool flag = key.size() != 0; ar << flag; // Ok, now what? Do I just proceed as before and // pick up the pieces in the load method?? if (flag) { ar << my_base->key(); } else { ar << my_base; } } template <class Archive> void load(Archive& ar, unsigned int) { bool flag; ar >> flag; // Ok, now I know how my BasePtr was created: either // through the factory, or through the static alloc() method. // But, is the following appropriate? if (flag) { string key; ar >> key; my_base = Factory::create(key); } else { ar >> my_base; } } }; I tried sketching this out with BaseHandle inheriting from shared_ptr (don't even know if that's possible or at all advisable), which seemed to me to be the most elegant solution: typedef shared_ptr<Base> BasePtr; class BaseHandle : BasePtr { template <class Archive> void save(Archive& ar, unsigned int) const { bool flag = key.size() != 0; ar << flag; // Is this reasonable? Base* my_base = get(); if (flag) { ar << my_base->get(); } else { ar << my_base; } } template <class Archive> void load(Archive& ar, unsigned int) { bool flag; ar >> flag; // Oy, now what?? Base* my_base; if (flag) { string key; ar >> key; my_base = Factory::create(key); } else { ar >> my_base; } // OK, I've got Base* now, fully built. // how do I make "this" (shared_ptr) wrap // this?? // Do I do this? : *this = BasePtr(my_base); // or this??: reset(my_base); } }; If someone could help out here, I'd really appreciate it. Thanks. Bill

2 2

proposed modif for boost connection
by frantz.maerten＠igeoss.com 19 Feb '05

19 Feb '05

I took a look at libsidc++ and found very interresting the way of blocking/unblocking connections. I added some small modifications in boost::signals lib in order to have this functionality (2 patches in attachment to apply at the parent of the boost_1_32_0 distrib). Only the interface of connection has changed (3 new methods), and I added a boolean flag in basic_connection struct. So, my questions are: 1) is it interresting to incorporate it (for me, YES, it is veru useful)? 2) is it a safe implementation? You can test it like that: MySignal sig ; boost::signals::connection conn1 = sig.connect(&fct1) ; boost::signals::connection conn2 = sig.connect(&fct2) ; sig(10) ; // call fct1 and fct2 conn1.block() ; sig(20) ; // call only fct2 conn1.unblock() ; sig(30) ; // call fct1 and fct2

2 1

boost::fsm and templated states
by Jan Eickmann 19 Feb '05

19 Feb '05

Hi, I'm trying to get templated states to work with boost::fsm. Background is that I want to create an OptionsDialog I can show from different screens. So for now this works: template<class ParentState> class OptionsDialog : public boost::fsm::simple_state< OptionsDialog<ParentState>, ParentState, boost::mpl::list< boost::fsm::transition<EvOptionsExit, ParentState>, boost::fsm::custom_reaction<EvOptionsSound>, boost::fsm::custom_reaction<EvOptionsSoundExit> > > { //... }; This works perfectly so far. Now, what I want to do is have inside of the OptionsDialog substates (one for the sound-panel, one for video, etc.). This is my attempt so far: template <class Parent> class InnerInitial; template<class ParentState> class OptionsDialog : public boost::fsm::simple_state< OptionsDialog<ParentState>, ParentState, boost::mpl::list< boost::fsm::transition<EvOptionsExit, ParentState>, boost::fsm::custom_reaction<EvOptionsSound>, boost::fsm::custom_reaction<EvOptionsSoundExit> > >, InnerInitial< OptionsDialog<ParentState> { //... }; template <class Parent> class InnerInitial : public fsm::simple_state<InnerInitial<Parent>, Parent> { }; When trying to compile this (and of course using the OptionsDialog as a substate somewhere) I get the following compiler errors (sorry, I know it's long, but I couldn't make any sense of it so I don't know whats important). Could anyone shed some light on this? Thanks a lot, Jan Eickmann f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(191) : error C2039: 'inner_context_type' : is not a member of 'Xenocide::Client::UI::Common::OptionsDialog<ParentState>' with [ ParentState=Xenocide::Client::UI::Geoscape::PlanetviewState ] f:\xenocide\xenocide\src\client\ui\optionsdialog\optionsdialog.h(175) : see reference to class template instantiation 'boost::fsm::simple_state<MostDerived,Context>' being compiled with [ MostDerived=Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>>, Context=Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState> ] f:\xenocide\devpack.net2003\dependencies\include\boost\mpl\aux_\has_tag.hpp(20) : see reference to class template instantiation 'Xenocide::Client::UI::Common::InnerInitial<Parent>' being compiled with [ Parent=Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState> ] f:\xenocide\devpack.net2003\dependencies\include\boost\mpl\sequence_tag.hpp(112) : see reference to class template instantiation 'boost::mpl::aux::has_tag<T>' being compiled with [ T=Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>> ] f:\xenocide\devpack.net2003\dependencies\include\boost\mpl\begin_end.hpp(33) : see reference to class template instantiation 'boost::mpl::sequence_tag<Sequence>' being compiled with [ Sequence=Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>> ] f:\xenocide\devpack.net2003\dependencies\include\boost\mpl\is_sequence.hpp(94) : see reference to class template instantiation 'boost::mpl::begin<Sequence>' being compiled with [ Sequence=Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>> ] f:\xenocide\devpack.net2003\dependencies\include\boost\mpl\if.hpp(63) : see reference to class template instantiation 'boost::mpl::is_sequence<T>' being compiled with [ T=Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>> ] f:\xenocide\devpack.net2003\dependencies\include\boost\mpl\eval_if.hpp(40) : see reference to class template instantiation 'boost::mpl::if_<T1,T2,T3>' being compiled with [ T1=boost::mpl::is_sequence<Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>>>, T2=boost::mpl::identity<Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>>>, T3=boost::mpl::identity<boost::mpl::list<Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>>>> ] f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(71) : see reference to class template instantiation 'boost::mpl::eval_if<C,F1,F2>' being compiled with [ C=boost::mpl::is_sequence<Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>>>, F1=boost::mpl::identity<Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>>>, F2=boost::mpl::identity<boost::mpl::list<Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>>>> ] f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(82) : see reference to class template instantiation 'boost::fsm::detail::make_list<T>' being compiled with [ T=Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>> ] f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(191) : see reference to class template instantiation 'boost::fsm::detail::simple_state_base_type<MostDerived,Context,InnerInitial>' being compiled with [ MostDerived=Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>, Context=boost::fsm::simple_state<Xenocide::Client::UI::Geoscape::PlanetviewState,Xenocide::Client::UI::RunningGameState,boost::mpl::list<boost::fsm::custom_reaction<Xenocide::Client::UI::Geoscape::EvXNet>,boost::fsm::custom_reaction<Xenocide::Client::UI::Geoscape::EvOptions>,boost::fsm::custom_reaction<Xenocide::Client::UI::Common::EvOptionsAbandonGame>>,Xenocide::Client::UI::Geoscape::PlanetviewNoOpInnerInitial,has_no_history>::inner_context_type, InnerInitial=Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>> ] f:\xenocide\xenocide\src\client\ui\optionsdialog\optionsdialog.h(57) : see reference to class template instantiation 'boost::fsm::simple_state<MostDerived,Context,Reactions,InnerInitial>' being compiled with [ MostDerived=Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>, Context=Xenocide::Client::UI::Geoscape::PlanetviewState, Reactions=boost::mpl::list<boost::fsm::transition<Xenocide::Client::UI::Common::EvOptionsExit,Xenocide::Client::UI::Geoscape::PlanetviewState>,boost::fsm::custom_reaction<Xenocide::Client::UI::Common::EvOptionsSound>,boost::fsm::custom_reaction<Xenocide::Client::UI::Common::EvOptionsSoundExit>>, InnerInitial=Xenocide::Client::UI::Common::InnerInitial<Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>> ] f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(693) : see reference to class template instantiation 'Xenocide::Client::UI::Common::OptionsDialog<ParentState>' being compiled with [ ParentState=Xenocide::Client::UI::Geoscape::PlanetviewState ] f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(303) : see reference to function template instantiation 'boost::fsm::result boost::fsm::simple_state<MostDerived,Context,Reactions,InnerInitial,historyMode>::transit_impl<DestinationState,MostDerived,boost::fsm::detail::no_transition_function>(const TransitionAction &)' being compiled with [ MostDerived=Xenocide::Client::UI::Geoscape::PlanetviewState, Context=Xenocide::Client::UI::RunningGameState, Reactions=boost::mpl::list<boost::fsm::custom_reaction<Xenocide::Client::UI::Geoscape::EvXNet>,boost::fsm::custom_reaction<Xenocide::Client::UI::Geoscape::EvOptions>,boost::fsm::custom_reaction<Xenocide::Client::UI::Common::EvOptionsAbandonGame>>, InnerInitial=Xenocide::Client::UI::Geoscape::PlanetviewNoOpInnerInitial, historyMode=has_no_history, DestinationState=Xenocide::Client::UI::Common::OptionsDialog<Xenocide::Client::UI::Geoscape::PlanetviewState>, TransitionAction=boost::fsm::detail::no_transition_function ] f:\xenocide\xenocide\src\client\ui\planetview\planetview.cpp(371) : see reference to function template instantiation 'boost::fsm::result boost::fsm::simple_state<MostDerived,Context,Reactions,InnerInitial,historyMode>::transit<Xenocide::Client::UI::Common::OptionsDialog<ParentState>>(void)' being compiled with [ MostDerived=Xenocide::Client::UI::Geoscape::PlanetviewState, Context=Xenocide::Client::UI::RunningGameState, Reactions=boost::mpl::list<boost::fsm::custom_reaction<Xenocide::Client::UI::Geoscape::EvXNet>,boost::fsm::custom_reaction<Xenocide::Client::UI::Geoscape::EvOptions>,boost::fsm::custom_reaction<Xenocide::Client::UI::Common::EvOptionsAbandonGame>>, InnerInitial=Xenocide::Client::UI::Geoscape::PlanetviewNoOpInnerInitial, historyMode=has_no_history, ParentState=Xenocide::Client::UI::Geoscape::PlanetviewState ] f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(191) : error C2146: syntax error : missing ',' before identifier 'inner_context_type' f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(191) : error C2065: 'inner_context_type' : undeclared identifier f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(191) : error C2976: 'boost::fsm::detail::simple_state_base_type' : too few template arguments f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(99) : see declaration of 'boost::fsm::detail::simple_state_base_type' f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(191) : error C2955: 'boost::fsm::detail::simple_state_base_type' : use of class template requires template argument list f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(99) : see declaration of 'boost::fsm::detail::simple_state_base_type' f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(191) : error C2955: 'boost::fsm::detail::simple_state_base_type' : use of class template requires template argument list f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(99) : see declaration of 'boost::fsm::detail::simple_state_base_type' f:\xenocide\devpack.net2003\dependencies\include\boost\fsm\simple_state.hpp(192) : fatal error C1903: unable to recover from previous error(s); stopping compilation xnet.cpp

5 9

lexical_cast and wstring on VC 2003
by steve ahlgren 18 Feb '05

18 Feb '05

Hello : I would like to use lexical_cast to convert to/from std::wstring on vc 2003 but I'm failing. These fail : int foo = boost::lexical_cast< int >( std::wstring( L"1" ) ); std::string bar = boost::lexical_cast< std::string >( std::wstring( L"a" ) ); std::wstring fred = boost::lexical_cast< std::wstring >( std::string( "Fred" ) ); Any hints would be greatly appreciated and kindly rewarded with good programming karma. Thanks in advance; Steve a.

2 1

New article on BOOST_FOREACH
by Eric Niebler 18 Feb '05

18 Feb '05

For anybody interested in peeking under the hood of BOOST_FOREACH, there is a new article about it at The C++ Source (http://www.artima.com/cppsource/index.jsp) It focuses mainly on the conditional operator and how to use it to write macrco's that do not reevaluate their arguments. -- Eric Niebler Boost Consulting www.boost-consulting.com

1 0

problem with lambda and function<>
by Arturo_Cuebas＠bpmicro.com 18 Feb '05

18 Feb '05

Given: #include <map> #include <boost/mem_fn.hpp> #include <boost/function.hpp> #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> using namespace std; using namespace boost; using namespace boost::lambda; struct s { int key (){return 1;} int value(){return 2;} }; typedef map<int, int> int_map; int_map m; var_type<int_map>::type delayed_m(var(m)); template<class F> void execute(F f) { s o; f(o); } Why does this work?: int main() { execute ( delayed_m[lambda::bind(&s::key, lambda::_1)] = lambda::bind(&s::value, lambda::_1) ); } But this doesn’t?: int main() { function<int (s &)> key (mem_fn(&s::key )), value(mem_fn(&s::value)); execute ( delayed_m[key] = value //compile error instantiation backtrace leads to here ); } I’m using VC7.1. Here's the error (sorry that it's so noisy): c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\boost\lambda\detail\operator_lambda_func_base.hpp(255) : error C2440: '=' : cannot convert from 'const boost::tuples::cons<HT,TT>::stored_head_type' to 'int' with [ HT=const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type, TT=boost::tuples::detail::map_tuple_to_cons<boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>::type ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\boost\lambda\detail\lambda_functors.hpp(153) : see reference to function template instantiation 'RET boost::lambda::lambda_functor_base<Act,Args>::call<boost::lambda::lambda_functor_base<Act,Args>::sig<SigArgs>::type,A,const boost::tuples::null_type,const boost::tuples::null_type,const boost::tuples::null_type>(A &,B &,C &,Env &) const' being compiled with [ RET=boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::assignment_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::subscript_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::identity<int_map &>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::sig<boost::tuples::tuple<s &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::type, Act=boost::lambda::other_action<boost::lambda::assignment_action>, Args=boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boos t::lambda::other_action<boost::lambda::subscript_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::identity<int_map &>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, SigArgs=boost::tuples::tuple<s &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, A=s, B=const boost::tuples::null_type, C=const boost::tuples::null_type, Env=const boost::tuples::null_type ] c:\TestApps\GeneralTests\GeneralTests.cpp(27) : see reference to function template instantiation 'boost::lambda::lambda_functor_base<Act,Args>::sig<SigArgs>::type boost::lambda::lambda_functor<T>::operator ()<s>(A &) const' being compiled with [ Act=boost::lambda::other_action<boost::lambda::assignment_action>, Args=boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::subscript_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::identity<int_map &>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, SigArgs=boost::tuples::tuple<s &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, T=boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::assignment_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::subscript_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::identity<int_map &>>,const boost::lambda::detail: :parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>, A=s ] c:\TestApps\GeneralTests\GeneralTests.cpp(47) : see reference to function template instantiation 'void Execute<boost::lambda::lambda_functor<T>>(F)' being compiled with [ T=boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::assignment_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::subscript_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::identity<int_map &>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>, F=boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::assignment_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::subscript_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::identity<int_map &>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost ::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const boost::lambda::detail::parameter_traits_<const boost::function<int (s &)>,const boost::lambda::detail::IF<false,const boost::function<int (s &)> &,const boost::function<int (s &)>>::RET>::type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>> ]

1 0

I'm looking for applications using Boost and STL with source code available
by Matthew Johnson 18 Feb '05

18 Feb '05

I would like to study a gui application designed from the ground up with modern C++ techniques and built on top of STL and Boost. Ideally I am looking for an application that abstracts the system specific ui components (windows, controls, etc) as much as possible. The ideal application would: Implement significant, non-trivial functionality. Be elegant and efficient. Use modern C++ and implementation design techniques. Be built on top of STL and Boost. Use the best techniques for the job (metaprogramming, generic programming, functional programming, oo, etc) Have source code available for study (not necessarily available for legal use). Last but not least, a native Mac OS X application would be ideal. Does anyone here know of any applications that meet these requirements? I have been studying modern C++ for a while now and would like to study real world applications and uses of the these techniques and libraries as a next step in this study. Thanks, Matthew

6 13

unit test and BOOST_CHECK_CLOSE
by Thomas Lemaire 17 Feb '05

17 Feb '05

dear list, When executing a test defined by: BOOST_CHECK_CLOSE(t3.x(3), 0.0, epsilon); I get the message: difference between t3.x(3){2.34188e-17} and 0.0{0} exceeds 1e-08% where obviously the difference does not exceeds the given threshold 1e-08... What's going on ? -- thomas

3 2

metaprogramming exercise 2-0
by Chris Goller 17 Feb '05

17 Feb '05

I just finished the first exercise in the C++ meta programming book. Then I checked what had been done before on this mailing list. Here is my solution: using namespace boost; template <bool use_ref, typename T> struct add_const_ref_impl { typedef T const & type; }; template <typename T> struct add_const_ref_impl<true, T> { typedef T type; }; template<class T> struct add_const_ref { typedef typename add_const_ref_impl<is_reference<T>::value, T>::type type; }; From Bruce Trask comes: using namespace boost; template<typename T> struct add_const_ref { typedef typename add_reference<typename add_const<T>::type>::type type; }; His solution is SO much better then mine. However, when I first saw it I thought it must be wrong because I assumed that add_const on a reference would would return a const reference. In other words, the code below would be false: bool a = is_same<add_const<int &>::type, int &>::value; However! bool "a" is true. So my question is why is "a" true? Why isn't add_const<int &>::type == int const &? Thanks, Chris

5 7

Re: [Boost-users] unit test and BOOST_CHECK_CLOSE
by Vladimir Krasovsky 17 Feb '05

17 Feb '05

Hello Thomas, Thursday, February 17, 2005, 1:35:48 PM, you wrote: Thomas> dear list, Thomas> When executing a test defined by: Thomas> BOOST_CHECK_CLOSE(t3.x(3), 0.0, epsilon); Thomas> I get the message: Thomas> difference between t3.x(3){2.34188e-17} and 0.0{0} exceeds 1e-08% Thomas> where obviously the difference does not exceeds the given threshold 1e-08... Thomas> What's going on ? As I remember, tolerance should be given in percents. See http://www.boost.org/libs/test/doc/components/test_tools/floating_point_com… for more detailed description of algorithm used in BOOST_CHECK_CLOSE. Either I do not understand something or you cannot use BOOST_CHECK_CLOSE for direct comparison with 0.0. Inequations given never satisfied in case one of arguments is zero. I think you could write BOOST_CHECK(t3.x(3) >= -epsilon && t3.x(3) <= epsilon); given that epsilon is non-negative. -- Best regards, Vladimir mailto:vkrasovsky@yandex.ru

1 0

Interval Arithmetic Tribool
by Robert Ferguson 16 Feb '05

16 Feb '05

Dear list, I hope I am writing to the correct place, and that this isn't a frequently asked question.. but I'd like to know alittle about comparisons and the Interval library. I am using intervals in a search algorithm to take advantage of the natural inclusion function as proposed in a paper I'm trying to implement. So far so good, except that I'm a little unhappy that I have to use "try" and "catch" to detect the indeterminate case. I'd like to use the boost::logic::tribool to identify the semi-frequent indeterminant case. For example: tribool cmp = interval1 < interval2; if (!indeterminate(cmp)) { if (cmp) { // something } else { // something else } else { // something } When I do this and the indeterminate case happens, an exception triggers and the function quits. This could be an error on my behalf, but it seems like this the default behavior. Its not that I can't do the try, catch, its just a matter of style. Can I have my cake and eat it too? Best, Robert Ferguson

2 1

Program runs OK in Cygwin, but got "Segment Fault" in Linux
by Welson Sun 16 Feb '05

16 Feb '05

Hi, The program is really simple, it creates a graph and output to a .dot file using the graphviz library in the BGL. It runs well in Cygwin, but in Linux, it got a segment fault when outputing the vertex id. Can you C++ gurus see what is going on? Thanks! Welson

1 1

[Important] Mailing list downtime this Saturday, February 19
by Doug Gregor 16 Feb '05

16 Feb '05

The Open Systems Lab, which hosts most of the Boost mailing lists, will be migrating to new hardware this Saturday. The outage will be this Saturday, February 19 starting at noon Eastern Standard Time and should not last more than 8 hours. lists.boost.org will be unavailable during the outage as will the mailing lists themselves. Thanks, Doug Gregor

1 0

[Boost.Test] and assert()
by Richard Jennings 16 Feb '05

16 Feb '05

When testing my program using the Unit Test Framework I find that if the program fails an assert() it is aborted with the message "Abnormal program termination" and no more tests are run. Is this the expected behaviour? The release notes for Boost.Test v1.30.0 say that a handler was added for SIGABRT (raised by abort() called by assert()) so I was expecting the test framework to catch this exception and report it in a similar way to a divide-by-zero error. I have my code compiled in debug with Borland C++ Builder 6.0 running on Windows XP. The behaviour is the same whether the command line option --catch_system_errors=yes or no. Richard

1 0

starting to learn Boost MPL and type_trait
by Sharon Galtzur 16 Feb '05

16 Feb '05

Hello all, I am trying to start learning the Boost MPL. The internals are more interesting for me then the usage I read both Abrahams&Gurtovoy and Alexandrescu books (both excelent btw) Some things i still don't quite understand: 1. How (or rather Why) does is_class works. 2. Same for is_enum 3. Can someone explain how MPL lambda works specially how the "_" works I tried to scan some of the archives but could not find any definite answer - i guess the discussions if they were are lost. P.S. neat trick to someone who try to learn the internals is to make a program that just include the header u interested to learn and just do the "pre-compile" stage (/EP /P flags in VC7.1 iirc) - you get a nice header without the unreadable MACROS. Thanks

5 12

Inserting elements in extensible associative sequences
by Lemings, Eric B. (Contr) 15 Feb '05

15 Feb '05

The semantics of MPL's insert metafunction for an extensible associative sequence is defined as: "For any Extensible Associative Sequence s, iterator pos in s, and arbitrary type x: typedef insert<s,x>::type r; Semantics: r is concept-identical and equivalent to s, except that at< r, key_type<s,x>::type >::type is identical to value_type<s,x>::type." What happens if the key type of x is already in s? Thanks, Eric.

2 1

OT: std::map<>::operator[] and default constructor
by Noel Yap 15 Feb '05

15 Feb '05

Please direct me to a more appropriate list if this is too off topic: It's come to my attention that our vendor's std::map<>::operator[] /always/ calls the default constructor of the key even when the key already exists in the map. This is what they say: It turned out to be a documentation bug. Our implementation is in sync with the standard. From 23.3.1.2 [lib.map.access]: T& operator[](const key_type& x); -1- Returns: (*((insert(make_pair(x, T()))).first)).second. Notice the T() in the call to make_pair() above: that's an invocation of the default ctor of the mapped type (i.e., Aoeu in the user's test case). So the program behaves as expected. If you do not like this behavior, replacing the expression map[16] in the program with map.find (16)->second will avoid the construction of the unused temporary. I modified the test case to incorporate this change. My inclination is to say the standard is a spec, not an implementation. Allowing std::map<>::operator[] not to call the default constructor requires no more and promises no less than the spec. All this is true unless, of course, there's some order of complexity issue I'm missing. But someone else had said, "an implementation has to have the same 'observable behaviour' as the abstract machine defined in the standard. Calling the default ctor definitely counts as observable behaviour, so I don't think RW have any choice but to implement it this way". What's the best place to get an official answer to the real intent of std::map<>::operator[]? Must it /always/ call the default constructor? Thanks, Noel

3 2

[serialization] memory leak in xml_wiarchive_impl ctor
by Sergey Skorniakov 15 Feb '05

15 Feb '05

Hello, All! If init() member of xml_wiarchive_impl throws an exception (for example, xml_archive_exception from basic_xml_grammar::init()), gimpl member is not deleted. With best regards, Sergey.

1 0

date_time: time_duration operator bug?
by Donato Petrino 15 Feb '05

15 Feb '05

Hello, I noticed that the "operator/()" isn't declared "const", I think this is an error. If so, can I correct it in my copy of boost (1_32) and hope that in the next version this is fixed? Further, I miss the "operator/(const time_duration&)", is there a reason why there isn't such a thing? BTW, I just read an old thread (Sep. 2003) about double arithmetic for the time_duration operators '*' and '/'. What's the plan here, is it going to stay 'int'-based (because I wrote my own double-based ones, not really nice I have to say). tia Donato

2 1