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

Boost.Statechart: Cannot compile example with GCC 4.0.2?
by Bardur Arantsson 06 Feb '06

06 Feb '06

Hi all, I'm trying to compile the StopWatch.cpp example on SuSE10 and I'm getting a whole bunch of errors (or at least what gcc thinks are errors): $ gcc --version gcc (GCC) 4.0.2 20050901 (prerelease) (SUSE Linux) Copyright (C) 2005 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. $ g++ StopWatch.cpp /usr/include/c++/4.0.2/bits/stl_tree.h: In member function âvoid std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::destroy_node(std::_Rb_tree_node<_Val>*) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â: /usr/include/c++/4.0.2/bits/stl_tree.h:1096: instantiated from âvoid std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_erase(std::_Rb_tree_node<_Val>*) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_tree.h:570: instantiated from âstd::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::~_Rb_tree() [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_map.h:92: instantiated from âboost::statechart::state_machine<MostDerived, InitialState, Allocator, ExceptionTranslator>::state_machine() [with MostDerived = StopWatch, InitialState = Active, Allocator = std::allocator<void>, ExceptionTranslator = boost::statechart::null_exception_translator]â StopWatch.cpp:74: instantiated from here /usr/include/c++/4.0.2/bits/stl_tree.h:389: error: no matching function for call to âstd::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>::destroy(std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >*)â /usr/include/c++/4.0.2/ext/new_allocator.h:109: note: candidates are: void __gnu_cxx::new_allocator<_Tp>::destroy(_Tp*) [with _Tp = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*] /usr/include/c++/4.0.2/bits/stl_tree.h: In member function âstd::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_create_node(const _Val&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â: /usr/include/c++/4.0.2/bits/stl_tree.h:793: instantiated from âtypename std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, const _Val&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_tree.h:902: instantiated from âtypename std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::insert_unique(std::_Rb_tree_iterator<_Val>, const _Val&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_map.h:384: instantiated from âtypename std::_Rb_tree<_Key, std::pair<const _Key, _Tp>, std::_Select1st<std::pair<const _Key, _Tp> >, _Compare, _Alloc>::iterator std::map<_Key, _Tp, _Compare, _Alloc>::insert(typename std::_Rb_tree<_Key, std::pair<const _Key, _Tp>, std::_Select1st<std::pair<const _Key, _Tp> >, _Compare, _Alloc>::iterator, const std::pair<const _Key, _Tp>&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Tp = std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_map.h:339: instantiated from â_Tp& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const _Key&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Tp = std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â ../../../../boost/statechart/state_machine.hpp:576: instantiated from âvoid boost::statechart::state_machine<MostDerived, InitialState, Allocator, ExceptionTranslator>::defer_event(const boost::statechart::event_base&, const boost::statechart::detail::state_base<Allocator, boost::statechart::detail::rtti_policy>*) [with MostDerived = StopWatch, InitialState = Active, Allocator = std::allocator<void>, ExceptionTranslator = boost::statechart::null_exception_translator]â ../../../../boost/statechart/simple_state.hpp:495: instantiated from âboost::statechart::detail::reaction_result boost::statechart::simple_state<MostDerived, Context, InnerInitial, historyMode>::react_impl(const typename Context::inner_context_type::event_base_type&, typename Context::inner_context_type::rtti_policy_type::id_type) [with MostDerived = Stopped, Context = Active, InnerInitial = boost::mpl::list<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::statechart::history_mode historyMode = has_no_history]â StopWatch.cpp:188: instantiated from here /usr/include/c++/4.0.2/bits/stl_tree.h:367: error: no matching function for call to âstd::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>::construct(std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >*, const std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >&)â /usr/include/c++/4.0.2/ext/new_allocator.h:105: note: candidates are: void __gnu_cxx::new_allocator<_Tp>::construct(_Tp*, const _Tp&) [with _Tp = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*] ---- end of output ---- Does anyone have any clues to impart as to what's going on? -- Bardur Arantsson <bardur.arantsson(a)gmail.com> Bardur Arantsson <bardur(a)scientician.net> Bardur Arantsson <bardur(a)imada.sdu.dk>

5 4

Re: [Boost-users] Getting started with Boost: what did you need to know?
by Hickman, Greg 06 Feb '06

06 Feb '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Foster Brereton > Sent: Friday, February 03, 2006 5:20 PM > I have found the mailing list archives proved helpful, but > took an inordinate amount of time to search through. Is it > possible to take threads in the mailing lists that look > something like this: > - A: I have problem XYZ > - B-Z: Oh, you need to do this > - A: That fixed it, thanks! > and convert them to a FAQ or additional documentation? How about encouraging Boost library developers to maintain library-specific FAQs along with their respective library documentation? -Greg Hickman

3 12

Re: [Boost-users] [BGL] there is no in_edges() function for adjacency_matrix<>
by Dmitry Bufistov 06 Feb '06

06 Feb '06

> > >Dmitry Bufistov <dmitry(a)lsi.upc.edu> writes: > > > >>Hi, >>A huge disappointment again came to me today. I used >>boost::adjacency<boost::directedS> class for representation of simple >>Petri net. I was trying to define the following function >>////////////////////////////////////////// >>bool if_enabled(transition_descriptor_t tr, graph_t net) { >> assert((net[tr].m_node_type == TRANSITION) && >>"if_enabled called with non transition node"); >> >> BGL_FORALL_INEDGES_T(tr, ed, net, graph_t) >> { >> if (net[boost::source(ed, net)].m_tokens_number < >>net[ed].m_weight) return false; >> } >> return true; >> } >> >>////////////////////////////////////////////////////////// >>But I failed because of lack of boost::in_edges() function >>specialization for type that I've chosen. >>Am I doing something wrong? >>Any ideas how to implement my function in resonable way would be greatly >>appreciated. >>Note: all works fine with "adjacency_list<vecS, vecS, bidirecrionalS>" >> >> > >By /definition/, BidirectionalGraph is a graph where you can enumerate >the incoming edges for any node. Unless you specify bidirectionalS, >an adjacency list won't be a BidirectionalGraph, and you can't use >in_edges. So everything is working just as I would expect it to. > > > But what about boost::adjacency_matrix<boost::directedS> ? Is there any way to iterate over all incoming edges? Where I can read your answer before I recieve e-mail? Time is very important ) Thank you, --dima

2 1

<smart_ptr> scoped_ptr with an ownership flag?
by Guy Peleg 06 Feb '06

06 Feb '06

Suppose that class A that accepts a pointer to class B. An instance of A class can own the pointer or it can share it with some other A instances. The knowledge of whether or not the A instance should own the pointer is something that depends by the one that construct the instance. Shared_ptr seems as a good candidate for this problem but what if the pointer passed to the A instance might come from a legacy code that works with raw-pointers ? I think that a kind of scoped_ptr with a ownership flag will help here __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

[boost-users] [parameter] Error using positional arguments
by Cromwell Enage 06 Feb '06

06 Feb '06

In one of my projects the header files contain code like the following: #ifndef BOOST_PARAMETER_RANDOM_EXAMPLE_HPP #define BOOST_PARAMETER_RANDOM_EXAMPLE_HPP #include <boost/type_traits/remove_const.hpp> #include <boost/random/uniform_int.hpp> #include <boost/random/variate_generator.hpp> #include <boost/parameter.hpp> namespace example { BOOST_PARAMETER_KEYWORD(tag, rng_engine) BOOST_PARAMETER_KEYWORD(tag, min) BOOST_PARAMETER_KEYWORD(tag, max) BOOST_PARAMETER_KEYWORD(tag, factor) BOOST_PARAMETER_KEYWORD(tag, addend) struct foo_parameters : boost::parameter::parameters< boost::parameter::required<tag::rng_engine> , boost::parameter::required<tag::min> , boost::parameter::required<tag::max> , boost::parameter::optional<tag::factor> , boost::parameter::optional<tag::addend> > { }; BOOST_PARAMETER_FUN(unsigned int, foo, 3, 5, foo_parameters) { typedef typename boost::remove_const< typename boost::parameter::binding< Params , tag::rng_engine >::type >::type RNGEngine; typedef boost::uniform_int<unsigned int> RNGDist; typedef boost::variate_generator<RNGEngine, RNGDist> RNG; RNGEngine rng_engine = p[example::rng_engine]; RNG rng(rng_engine, RNGDist(p[min], p[max])); return rng() * p[factor | 10] + p[addend | 5]; } } // namespace test #endif // BOOST_PARAMETER_RANDOM_EXAMPLE_HPP The following snippet would then exemplify typical user code: #include <iostream> #include <boost/ref.hpp> #include <boost/random/mersenne_twister.hpp> #include "boost_parameter_random_example.hpp" int main() { boost::mt19937 rng; std::cout << "Named: " << example::foo( example::rng_engine = rng , example::min = 12 , example::max = 24 ) << std::endl; // Ok std::cout << "Unnamed: "; std::cout << example::foo(rng, 12, 24); // error std::cout << std::endl; return 0; } MinGW reports: 'static const T& boost::random::detail::ptr_helper<T&>::ref(const T&) [with T = const boost::mt19937]' and 'static T& boost::random::detail::ptr_helper<T&>::ref(T&) [with T = const boost::mt19937]' cannot be overloaded When I wrap boost::ref around rng, the program runs fine. I'm curious as to why I get this error only when specifying positional arguments. Have I run afoul of something fundamental, such as the forwarding problem? Cromwell D. Enage __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 5

Test of e-mail client - please ignore.
by Brian Allison 06 Feb '06

06 Feb '06

I had, but our mail server munges things, and I'm not always aware of the ways in which they're munged. For better or for worse (and yes, I have a NSHO on the matter :/ ) our system admin functionalities are almost black-boxed from the rest of the geeks here. [I don't mention it for discussion, but for explanation.] Well - it should be taken care of now. If it weren't for some of our rather odd mail message requirements, I'd just use the mail command. ObNostalgia: Oh, for the BITNET days... David Abrahams wrote: >Brian Allison writes: > > > >>The test below this line should be 'quoted'. Hopefully the mail gate won't wreck it. >> >>Brian Allison wrote: >> >> Testing quoting other messages... >> >> > >Try turning off HTML messages in your client. > > >

1 0

[signals] calling delete member on connect?
by Evan Carew 06 Feb '06

06 Feb '06

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Ok, am I wrong in assuming this shouldn't be happening on my linux box? [gcc 4.0.2][boost 103200] First the test program, then the output: #include <iostream> #include <cstdlib> #include <boost/signals.hpp> using namespace std; using namespace boost; class tst_out{ public: void operator()() const{ cout << "test out data1" << endl;} ~tst_out(){ cout << "Called del for tst_out" << endl;} }; class tst_out2{ public: void operator()() const{ cout << "test out 2" << endl;} ~tst_out2(){ cout << "Called del for tst_out2" << endl;} }; signal<void ()> sig; int main(int argc, char *argv[]) { tst_out tst1; tst_out2 tst2; sig.connect(tst1); sig.connect(tst2); sig(); cout << "exiting program" << endl; return EXIT_SUCCESS; } Now the output: Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 test out data1 test out 2 exiting program Called del for tst_out2 Called del for tst_out Called del for tst_out Called del for tst_out2 -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFD5RS4pxCQXwV2bJARAkBzAJ9mSmfH79X/IaOlmlquUMk9Ww/dAgCdH9xz /BaVLQC9shMvnYxBPMv13DU= =jU/r -----END PGP SIGNATURE-----

2 5

boost python (compiling an extension)
by Themistoklis Bourdenas 06 Feb '06

06 Feb '06

I'm trying to build a simple python extension similar to the one in boost.python tutorial. I really haven't yet understood the process of creating an extension for python using boost. I have to build boost.python either using bjam or loading its .sln in VS (I've used the second method). Then I write some simple code like that in the tutorial exporting a simple function and then what? I guess I have to build a .dll file for python to link to. I'm building a dynamic link library project in VS8 write the appropriate code and that successfully creates a dll file. However when importing my module python returns a runtime error: ImportError: dynamic module does not define init function (inittest_boost) What is the .pyd created in the tutorial? How is it created? I'm trying to avoid bjam as and use just VS project files. Is that possible? PS - I know I should send this message in c++-sig list but for three days now it can not confirm my subscription for some reason.

2 3

[parameters] Runtime enumeration of parameter list
by Neil Hunt 05 Feb '06

05 Feb '06

>From a post about using strings as an indexing mechanism: "David Abrahams" <dave(a)boost-consulting.com> wrote in message news:ubqzqz3sw.fsf@boost-consulting.com... <snip> >> Since all are known at compile time I'm sure it must be easy to do >> this. I'm pretty sure when someone shows me the obvious solution I >> will be very embarrassed, but until then I can do this with a >> std::map at runtime, but not at compile time. > I'm pretty sure the parameter library is a good -- if not perfect -- > match for your problem. Since I've pointed at it twice now, if you're > not embarrassed yet, I'll stop pushing ;-) I too am quite interested in this process of compile time indexing. Let me think out loud (visibly?). Question at the bottom. I have often used this pattern of access for a vector of a known size (contrived example): enum TabIndices { PERSON_TAB, ADDRESS_TAB, EMPLOYER_TAB, TAB_COUNT }; Window windows[TAB_COUNT]; ... display_window( TabIndices tab_index ) { windows[tab_index].display(); for( int i = 0; i < (int)TAB_COUNT; ++i ) { if( i != (int)tab_index ) windows[i].hide(); } } ... display_window( PERSON_TAB ); Let me have go at converting this to use the parameter keyword system for indexing by using an ArgumentPack. BOOST_PARAMETER_KEYWORD(tag, PERSON_WINDOW) BOOST_PARAMETER_KEYWORD(tag, ADDRESS_WINDOW) BOOST_PARAMETER_KEYWORD(tag, EMPLOYER_WINDOW)XXXX windows( ( PERSON_WINDOW = Window(), ADDRESS_WINDOW = Window(), EMPLOYER_WINDOW = Window() ) ); ... template<class keyword> display_window( keyword tab_index) { windows[tab_index].display(); for( YYYY ) { if( *iterator != tab_index ) windows[iterator].hide(); } } ... display_window( PERSON_TAB ); My two immediate problems are how to declare the type of the ArgumentPack that would actually hold the window objects. (XXXX) And secondly, how to iterate over the windows at runtime. (YYYY). I guess the main thrust of the question is "Does the parameters library support runtime enumeration?" or should I be looking at MPL? Neil

4 7

[date_time] How to create a time_zone_ptr from the machine settings?
by Christian Henning 05 Feb '06

05 Feb '06

Hi there, I would like to know how to create a local_date_time object. The only thing I have is a UTC time object. How do I create a time_zone_ptr from the machine settings. Thanks ahead, Christian

2 1