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

[Boost.Serialization] St8bad_cast during serialization
by sadrok 07 Jan '07

07 Jan '07

Hi, This would be my first post here. Needless to say I'm relatively a newbie when it comes to using Boost. I've recently decided to look into using Boost to ease some tasks in my future programming projects. I've stumbled upon Boost.Serialization and was amazed at the ease and power it provides. I've decided to use this to replace a hand-wrapped serialization library I created for a project I'm involved with since I foresee in the future more difficult serialization tasks that my library wouldn't be able to handle. So far so good, but during replacing my code with Boost.Serialization and going through various static asserts I've come to a obstacle I cannot figure out. My application saves message classes derived from a Message base class (it has a virtual deconstructor) and sends this serialized data over a UNIX socket for IPC between interconnected processes. The sending side seems to work fine as can be seen from the debugging output below: In base/module.cpp line 111 function SendMessage : [ 22 serialization::archive 3 4 core 10 LogMessage -1209954316 1 18 Sadrok::LogMessage 1 0 0 0 1168098092 55 Loaded module log from file modules/liblog.so pid 14250 ] However on the receiving side I have this: ia & BOOST_SERIALIZATION_NVP(msginfo.msg); which ends up throwing an bad_cast exception Unhandled exception: St8bad_cast msginfo.msg is Message* I even tried loading into a LogMessage * with the same error. I have (in the logmessage header) BOOST_CLASS_EXPORT for the LogMessage (otherwise Boost would've thrown unregistered_class while saving). I can provide more information although I wouldn't know what else to post. Generally I'd like to know if anyone has any idea why I'm getting the bad_cast exception, where it gets thrown, or at least how to figure out where the problem exists so I can fix it. Thank you Sadrok sadrok.za(a)gmail.com Yahoo! IM: sadrok_za Jabber ID: sadrok(a)jabber.obsidian.co.za

3 9

How to build boost library's document
by Bo Yang 07 Jan '07

07 Jan '07

Hi, I download the boost source code from the CVS repository, and build it with bjam. Only found that there is no document builded in the libs directory. How to build boost library's document?

3 3

Re: [Boost-users] Boost-users Digest, Vol 1140, Issue 1
by Peter 07 Jan '07

07 Jan '07

Hi, Sorry I forgot to add that I am using RC_1_34_0 version updated from this morning. Thanks, Peter > > Message: 6 > Date: Sun, 7 Jan 2007 18:25:34 +1100 > From: "Peter" <pjfoley(a)bigpond.com> > Subject: [Boost-users] [BOOST.TEST] [BOOST.WARN] Output weirdness > To: <boost-users(a)lists.boost.org> > Message-ID: <000701c7322d$04f85850$1100a8c0(a)Billswan.local> > Content-Type: text/plain; charset="utf-8" > > Hi, > > I am new to Boost.Test so not sure if this is expected behaviour or not. > > Based on this minimal test: > > |----------------------------8?------------------------------------| > #include <boost/test/unit_test.hpp> > using boost::unit_test::test_suite; > > // most frequently you implement test cases as a free functions > void my_test() > { > > int i=2; > BOOST_WARN( sizeof(int) == sizeof(short) ); > BOOST_CHECK( i == 1 ); > BOOST_REQUIRE( i > 5 ); > BOOST_CHECK( i == 6 ); // will never reach this check > } > > test_suite* > init_unit_test_suite( int, char* [] ) { > test_suite* test= BOOST_TEST_SUITE( " Test Suite!" ); > > // this example will pass cause we know ahead of time number of > expected failures > test->add( BOOST_TEST_CASE( & my_test ), 0 /* expected one error */ ); > > return test; > } > |----------------------------8?------------------------------------| > > Taken from this url: http://tinyurl.com/t54th (Click on BOOST_WARN). > > I expect to see this output (as mentioned at the above link): > > c:/development/code/practice/ test/mytest.cpp (14) : warning in test_main: > condition sizeof(int) == sizeof(short) is not satisfied > c:/development/code/practice/ test/mytest.cpp (15) : error in test_main: > test i==1 failed > c:/development/code/practice/ test/mytest.cpp (16) : fatal error in > test_main: test i>5 failed > > But I see this output > > Running 1 test case... > c:/development/code/practice/ test/mytest.cpp(15): error in " my_test ": > check i == 1 failed > c:/development/code/practice/ test/mytest.cpp (16): fatal error in " > my_test ": critical check i > 5 failed > > *** 2 failures detected (2 failures expected) in test suite "Master Test > Suite" > > It seems that the BOOST_WARN is not outputting a message. Is this > expected behaviour? > > Also another minor point in the code I have named the BOOST_TEST_SUITE > ?Test Suite!? but in the output it is calling it ?Master Test Suite?. Is > this something I am not setting right? > > Thanks, > > Peter. >

1 0

boost signals, boost bind, visit_each + gcc 4.1 = broken ?
by Koen Deforche 06 Jan '07

06 Jan '07

All, I encountered a problem using boost signals, with gcc 4.1.1 although all is fine using gcc 3.4.4. I am using boost 1.33.1. I get an error which terminates with: /usr/include/boost/bind.hpp: In function 'void boost::visit_each(V&, const boost::_bi::value<T>&, int) [with V = boost::signals::detail::bound_objects_visitor, T = AlignmentWidget*]': /usr/include/boost/bind.hpp:239: instantiated from 'void boost::_bi::list1<A1>::accept(V&) const [with V = boost::signals::detail::bound_objects_visitor, A1 = boost::_bi::value<AlignmentWidget*>]' /usr/include/boost/bind/bind_template.hpp:150: instantiated from 'void boost::_bi::bind_t<R, F, L>::accept(V&) const [with V = boost::signals::detail::bound_objects_visitor, R = void, F = boost::_mfi::mf0<void, AlignmentWidget>, L = boost::_bi::list1<boost::_bi::value<AlignmentWidget*> >]' /usr/include/boost/bind.hpp:1213: instantiated from 'void boost::visit_each(V&, const boost::_bi::bind_t<R, F, L>&, int) [with V = boost::signals::detail::bound_objects_visitor, R = void, F = boost::_mfi::mf0<void, AlignmentWidget>, L = boost::_bi::list1<boost::_bi::value<AlignmentWidget*> >]' /usr/include/boost/visit_each.hpp:25: instantiated from 'void boost::visit_each(Visitor&, const T&) [with Visitor = boost::signals::detail::bound_objects_visitor, T = boost::_bi::bind_t<void, boost::_mfi::mf0<void, AlignmentWidget>, boost::_bi::list1<boost::_bi::value<AlignmentWidget*> > >]' /usr/include/boost/signals/slot.hpp:121: instantiated from 'boost::slot<SlotFunction>::slot(const F&) [with F = boost::_bi::bind_t<void, boost::_mfi::mf0<void, AlignmentWidget>, boost::_bi::list1<boost::_bi::value<AlignmentWidget*> > >, SlotFunction = boost::function0<void, std::allocator<boost::function_base> >]' /usr/local/include/WSignal:603: instantiated from 'boost::signals::connection Wt::EventSignal<void>::connect(T*, void (T::*)()) [with T = AlignmentWidget]' /home/kdforc0/project/c++/sequencetool/src/web/AlignmentWidget.C:59: instantiated from here /usr/include/boost/bind.hpp:1208: error: no matching function for call to 'visit_each(boost::signals::detail::bound_objects_visitor&, AlignmentWidget* const&, int)' Since AlignmentWidget inherits indirectly from boost::signals::trackable, this specialisation should really exist ? Is this is a bug in gcc 4.1.1 or with boost ? Is there a workaround for making it work with gcc 4.1.1 ? Regards, koen

2 1

Re: [Boost-users] Mapping from type to value (Ovanes Markarian)
by Johan Torp 06 Jan '07

06 Jan '07

Wow, two perfect answer in such a short time! Thanks a lot. Are there more parts of MPL that are undocumented? When I've learned more about MPL I wouldn't mind helping to document some parts of it. It's probably a good way to learn it too :) Best Regards, -- System Developer TouchTable AB Tel: +46 (0)31 773 68 12 johan.torp(a)touchtable.se

3 2

portland group compilers (pg++, pgi, pgCC)
by Server Levent Yilmaz 05 Jan '07

05 Jan '07

Hi All, Please correct me if this is off topic here.. I sadly realized that there is no compiler toolset available for Portland Group Compilers (http://www.pgroup.com/) Before submitting an entry in the Support Request, and digging in (probably REALLY deep), I was wondering if there is anyone that has any experience with these compilers (failure or success, *nix or win), particularly for the following libraries: serialization multi_array bind lambda filesystem thank you, levent

3 4

How am I misusing boost::lambda::bind?
by Jason House 05 Jan '07

05 Jan '07

I hope the sheer size of this post doesn't scare those who can help me away :( Depending on how I use the code at the bottom of this post, things either work or they blow up with varying error messages deep within the boost libraries. The very last function in the code below is the last consistent "source" of the errors. As best as I understand it, that line is correct. I'm scratching my head on how to diagnose what's going wrong. The simplest error I got seemed to complain about const qualifiers that seem to have been added internally to boost::lambda::bind. I'm not sure which error message to pick out from other error scenarios (such as 3 input parameters (types T0, T1, and T2)). This error had R0=void, and no input arguments (T0, T1, etc...). The code at the bottom of this post compiles with R0=void and T0=int. actions.hpp:87: error: no matching function for call to ‘boost::lambda::function_adaptor< GTPInternalResponse (*)( boost::function0<void, std::allocator<boost::function_base> >*, GTPCommand)> ::apply( GTPInternalResponse (* const&)( boost::function0<void, std::allocator<boost::function_base> >*, GTPCommand), boost::function0<void, std::allocator<boost::function_base> >* const&)’ As clarification for understanding the code: GTPInternalResponse can be thought of a string and GTPCommand as a tokenized string. The extract<>() function consumes some string tokens and returns a value of the specified type (T0,T1,T2,T3, etc...) The only big impact on this code externally (besides the calls to GTPFunctionObjectN) is #define's for GTP_PARAM_COUNT and GTP_PARAM_COUNT_PLUS_ONE. GTP_PARAM_COUNT_PLUS_ONE == GTP_PARAM_COUNT. The useful range for GTP_PARAM_COUNT is between 0 and 3 (inclusive). > #include <boost/preprocessor/enum_params.hpp> // expands for 0 ... N-1 > #include <boost/preprocessor/repetition/enum_shifted_params.hpp> // expands for 1 ... N-1 > > #if GTP_PARAM_COUNT == 0 > # define GTP_OPTIONAL_COMMA > #else > # define GTP_OPTIONAL_COMMA , > #endif > > > // GTP_PARMS expands to " typename T0, typename T1, typename T2" if GTP_PARAM_COUNT is 3 > #define GTP_TEMPLATE_PARAMS BOOST_PP_ENUM_PARAMS(GTP_PARAM_COUNT, typename T) > > // expands to "typename R0 , typename T0, typename T1, typename T2" if GTP_PARAM_COUNT is 3 > #define GTP_FULL_TEMPLATE_PARAMS typename R0 GTP_OPTIONAL_COMMA GTP_TEMPLATE_PARAMS > > // GTP_PARAM expands to " T3 a3" if INDEX is 3 > #define GTP_PARAM(UNKNOWN1,INDEX,UNKNOWN2) BOOST_PP_CAT(T,I) BOOST_PP_CAT(a,I) > > // GTP_PARAMS expands to " T0 a0, T1 a1, T2 a2" if GTP_PARAM_COUNT is 3 > #define GTP_PARAMS BOOST_PP_ENUM(GTP_PARAM_COUNT,GTP_PARAM,BOOST_PP_EMPTY) > > // GTP_PARAM_TYPES expands to " T0, T1, T2" if GTP_PARAM_COUNT is 3 > #define GTP_PARAM_TYPES BOOST_PP_ENUM_PARAMS(GTP_PARAM_COUNT, T) > > // expands to "R0 , T0, T1, T2" if GTP_PARAM_COUNT is 3 > #define GTP_FULL_PARAM_TYPES R0 GTP_OPTIONAL_COMMA GTP_PARAM_TYPES > > // GTP_PARAM_NAMES expands to " a0, a1, a2" if GTP_PARAM_COUNT is 3 > #define GTP_PARAM_NAMES BOOST_PP_ENUM_PARAMS(GTP_PARAM_COUNT, a) > > // expands to "boost::function3 < R0 , T0, T1, T2 >" when GTP_PARAM_COUNT is 3 > #define GTP_BOOST_FUNCTION BOOST_PP_CAT(boost::function,GTP_PARAM_COUNT) < GTP_FULL_PARAM_TYPES > > > // expands to "boost::function3 < void , T0, T1, T2 >" when GTP_PARAM_COUNT is 3 > #define GTP_BOOST_FUNCTION_VOID BOOST_PP_CAT(boost::function,GTP_PARAM_COUNT) < void GTP_OPTIONAL_COMMA GTP_PARAM_TYPES > > > // expands to type_wrapper3 when GTP_PARAM_COUNT is 3 > #define GTP_TYPE_WRAPPER BOOST_PP_CAT(type_wrapper,GTP_PARAM_COUNT) > > ////////////////////////////////////////////////////////////// > // gtp_detail::type_wrapper for converting all input arguments > namespace gtp_detail{ > > template < GTP_FULL_TEMPLATE_PARAMS > > struct GTP_TYPE_WRAPPER{ > static GTPInternalResponse wrap(GTP_BOOST_FUNCTION *(callback_function), GTPCommand cmd){ > unsigned int position = 0; > /// \bug Must figure out how to auto generate this repetative body > #if GTP_PARAM_COUNT >= 1 > assert(position < cmd.GetArgumentCount()); > T0 a0 = extract<T0>(cmd, position); > #endif > #if GTP_PARAM_COUNT >= 2 > assert(position < cmd.GetArgumentCount()); > T1 a1 = extract<T1>(cmd,position); > #endif > #if GTP_PARAM_COUNT >= 3 > assert(position < cmd.GetArgumentCount()); > T2 a2 = extract<T2>(cmd,position); > #endif > assert(position == cmd.GetArgumentCount()); > return converter<R0, GTPInternalResponse>( (*callback_function)(GTP_PARAM_NAMES) ); > } > }; > > template < GTP_TEMPLATE_PARAMS > > struct GTP_TYPE_WRAPPER < void GTP_OPTIONAL_COMMA GTP_PARAM_TYPES >{ > static GTPInternalResponse wrap(GTP_BOOST_FUNCTION_VOID *(callback_function), GTPCommand cmd){ > unsigned int position = 0; > /// \bug Must figure out how to auto generate this repetative body > #if GTP_PARAM_COUNT >= 1 > assert(position < cmd.GetArgumentCount()); > T0 a0 = extract<T0>(cmd, position); > #endif > #if GTP_PARAM_COUNT >= 2 > assert(position < cmd.GetArgumentCount()); > T1 a1 = extract<T1>(cmd,position); > #endif > #if GTP_PARAM_COUNT >= 3 > assert(position < cmd.GetArgumentCount()); > T2 a2 = extract<T2>(cmd,position); > #endif > assert(position == cmd.GetArgumentCount()); > (*callback_function)(GTP_PARAM_NAMES); > return GTPInternalResponse(); > } > }; > > }; > > /////////////////////////////////////////////////////// > // GTPCommandCallBack accepting a boost function object > > // expands to GTPFunctionObject3 when GTP_PARAM_COUNT is 3 > #define GTP_COMMAND_CALLBACK BOOST_PP_CAT(GTPCommandCallBack,GTP_PARAM_COUNT) > > // expands to " boost::lambda::_1, boost::lambda::_2, boost::lambda::_3" if GTP_PARAM_COUNT is 3 > #define GTP_LAMBDA_PARAMS BOOST_PP_ENUM_SHIFTED_PARAMS(GTP_PARAM_COUNT_PLUS_ONE, boost::lambda::_) > > template< GTP_FULL_TEMPLATE_PARAMS > inline > GTPFunctionObject* GTP_COMMAND_CALLBACK(GTP_BOOST_FUNCTION *callback_function){ > return new GTPFunctionObject(boost::lambda::bind((&gtp_detail::GTP_TYPE_WRAPPER<GTP_FULL_PARAM_TYPES>::wrap), callback_function GTP_OPTIONAL_COMMA GTP_LAMBDA_PARAMS)); > }

3 3

[spirit] closures and actions
by Hugh Hoover 04 Jan '07

04 Jan '07

I'm trying to build a parser that does a fairly simple transformation of an input string - kind of like an L-System. I can get rules to properly match the input string, but I'm having real trouble with DOING anything. For testing, I've created some simple actions and a grammar (and rules) with a closure. When I don't use the closure for "temporary" variables, I seem to be able to proceed, but when I do anything except assign a value to my closure result, I'm getting failures to compile. This is using gcc4.01 on MacOSX and spirit 1.8.3 (from boost 1.34). The specific compiler error is: ../../src/lsystem/catalog_lsystem.cpp: In member function 'void do_appender::act(T&, const IteratorT&, const IteratorT&) const [with T = phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >, IteratorT = __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >]': <snip> ../../src/lsystem/catalog_lsystem.cpp:211: error: no matching function for call to 'std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string (phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >&)' From the error, it appears that I need some transformation from phoenix::actor back into my closure member, which is a String (typedef for std::basic_string<char>). Any suggestions? do_appender (a simple example actor) looks like: struct do_appender { template <typename T, typename ValueT> void act(T& ref, ValueT const &val) const { ref += val; } template <typename T, typename IteratorT> void act(T& ref, IteratorT const &first, IteratorT const & last) const { String s(first, last); ref += s; } }; template <typename T> inline ref_value_actor<T, do_appender> do_append(T& lhs) { return ref_value_actor<T, do_appender>(lhs); } template <typename T, typename ValueT> inline ref_const_ref_actor<T, ValueT, do_appender> do_append(T& lhs, ValueT const& val) { return ref_const_ref_actor<T, ValueT, do_appender>(lhs,val); } and the closure and grammar (stripped slightly) look like: struct ProductionClosure : boost::spirit::closure<ProductionClosure, String, size_t, String> { member1 m_result; member2 m_count; member3 m_temporary; }; struct ParameterLSystem::ProductionGrammar : public grammar<ParameterLSystem::ProductionGrammar, ProductionClosure::context_t> { String * m_append; ProductionGrammar(String * ap) : m_append(ap) {} template <typename ScannerT> struct definition { typedef rule<ScannerT, ProductionClosure::context_t> rule_t; typedef rule<ScannerT> srule_t; srule_t r_segment; rule_t r_segments; srule_t r_leaf; rule_t r_leaves; srule_t r_push; srule_t r_pop; rule_t r_start; rule_t r_terminalLeaves; rule_t r_branch; rule_t r_top; definition(ProductionGrammar const& self) { // basics r_leaf = ch_p('L'); r_leaves = (+r_leaf)[r_leaves.m_result = construct_<String>(arg1, arg2)]; r_segment = ch_p('S'); r_segments = (+r_segment)[r_segments.m_result = construct_<String>(arg1, arg2)]; r_push = ch_p('['); r_pop = ch_p(']'); r_terminalLeaves = r_push[do_append (r_terminalLeaves.m_result)]; r_top = r_branch[self.m_result = arg1]; } rule_t const& start() const { return r_top; } }; }; }; String is a typedef for std::basic_string<char> in my namespace. When I use m_append for a "temporary", I can get things to "work", i.e., it compiles and generates the correct output but the grammar will get more complex and I don't believe I can get away without using a closure variable. The full error stack from the compiler is: ../../src/lsystem/catalog_lsystem.cpp: In member function 'void do_appender::act(T&, const IteratorT&, const IteratorT&) const [with T = phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >, IteratorT = __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >]': ../../../../opensource/opt/include/boost/spirit/actor/ ref_value_actor.hpp:59: instantiated from 'void boost::spirit::ref_value_actor<T, ActionT>::operator()(const IteratorT&, const IteratorT&) const [with IteratorT = __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, T = phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >, ActionT = do_appender]' ../../../../opensource/opt/include/boost/spirit/core/scanner/ scanner.hpp:146: instantiated from 'static void boost::spirit::attributed_action_policy<boost::spirit::nil_t>::call (const ActorT&, boost::spirit::nil_t, const IteratorT&, const IteratorT&) [with ActorT = boost::spirit::ref_value_actor<phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >, do_appender>, IteratorT = __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >]' ../../../../opensource/opt/include/boost/spirit/core/scanner/ scanner.hpp:161: instantiated from 'void boost::spirit::action_policy::do_action(const ActorT&, AttrT&, const IteratorT&, const IteratorT&) const [with ActorT = boost::spirit::ref_value_actor<phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >, do_appender>, AttrT = boost::spirit::nil_t, IteratorT = __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >]' ../../../../opensource/opt/include/boost/spirit/core/composite/ actions.hpp:109: instantiated from 'typename boost::spirit::parser_result<boost::spirit::action<ParserT, ActionT>, ScannerT>::type boost::spirit::action<ParserT, ActionT>::parse(const ScannerT&) const [with ScannerT = boost::spirit::scanner<__gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, boost::spirit::scanner_policies<boost::spirit::iter_policy_t, boost::spirit::match_policy, boost::spirit::action_policy> >, ParserT = boost::spirit::rule<boost::spirit::scanner<__gnu_cxx::__normal_iterator< char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, boost::spirit::scanner_policies<boost::spirit::iter_policy_t, boost::spirit::match_policy, boost::spirit::action_policy> >, boost::spirit::nil_t, boost::spirit::nil_t>, ActionT = boost::spirit::ref_value_actor<phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >, do_appender>]' ../../../../opensource/opt/include/boost/spirit/core/non_terminal/ impl/rule.ipp:233: instantiated from 'typename boost::spirit::match_result<ScannerT, ContextResultT>::type boost::spirit::impl::concrete_parser<ParserT, ScannerT, AttrT>::do_parse_virtual(const ScannerT&) const [with ParserT = boost::spirit::action<boost::spirit::rule<boost::spirit::scanner<__gnu_c xx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, boost::spirit::scanner_policies<boost::spirit::iter_policy_t, boost::spirit::match_policy, boost::spirit::action_policy> >, boost::spirit::nil_t, boost::spirit::nil_t>, boost::spirit::ref_value_actor<phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >, do_appender> >, ScannerT = boost::spirit::scanner<__gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, boost::spirit::scanner_policies<boost::spirit::iter_policy_t, boost::spirit::match_policy, boost::spirit::action_policy> >, AttrT = String]' ../../src/lsystem/catalog_lsystem.cpp:547: instantiated from here ../../src/lsystem/catalog_lsystem.cpp:211: error: no matching function for call to 'std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string (phoenix::actor<phoenix::closure_member<0, phoenix::closure<String, size_t, String> > >&)'

3 2

Serialization : Deserializing members not present in archive
by Booster Booster 04 Jan '07

04 Jan '07

Hey, I have a class with a few data members that is serializable. Note that, I already have an archive ( test.txt ). Now, I want to serialize a couple more members. I went ahead and added the new members to my serialize functions. When I read from the archive ( test.txt ) , I get an exception. This is understandable, because the archive doesn't have the new members that I'm trying to read out. My question is, is there a way to check for the existence of a member before deserializing an object from the archive ? Thanks in advance, Sandeep.

2 1

Re: [Boost-users] asio has a very confusing name - should be changed or made asynchronous
by Christopher Kohlhoff 04 Jan '07

04 Jan '07

Hi Marc, On Fri, 29 Dec 2006 11:15:12 +0100, "Marc Lehmann" <schmorp(a)schmorp.de> said: > I just saw that asio went into the boost cvs. > > I was interested because asio claims to provide an "asynchronous I/O > model", which sounds great. > > However, looking at current asio, there is nothing asynchronous, asio > is completely synchronous by API Hmmm, maybe we have different ideas about what an asynchronous I/O model looks like :) > (and on POSIX platforms): > > * the asio API is synchronous because it requires blocking calls to > io_service.run (), making it completely synchronous by API because > no I/O is done asynchronously to the program. The asio API is, not coincidentally, similar in design to the POSIX async I/O functions, as well as the Extended Sockets API (ES-API) also defined by the Open Group, and of course overlapped I/O on Windows. For example: * Asynchronous operations are initiated using a function call specific to the operation being requested: asio - basic_stream_socket::async_receive() POSIX aio - aio_read() ES-API - exs_recv() Windows - WSARecv() * The application must provide the buffer for the operation when calling the initiating function, and ensure that it remains valid (and also not attempt to access it) until the operation completes. * A blocking call is used to wait for operations to complete: asio - io_service::run() POSIX aio - aio_suspend() ES-API - exs_qdequeue() Windows - GetQueuedCompletionStatus() The main difference with asio is that, by default, it combines waiting for the operations to complete with dispatching the associated completion handler. > * on POSIX at least it calls select (or poll), which are synchronous > by nature (see > http://www.opengroup.org/onlinepubs/009695399/functions/select.html, > "select - synchronous I/O multiplexing"). Yes, the asio API can be implemented in terms of synchronous I/O demultiplexers, such as select (or epoll or kqueue). I see this as one of asio's key strengths, as it enables the API to be implemented portably. It is also intended that the API can be implemented in terms of native asynchronous I/O if available (and if the implementation actually has decent performance). This is currently the case for asio on Windows. The asio API is still asynchronous even if it is implemented in terms of a synchronous demultiplexer. All that the interface "says" is that when you initiate an asynchronous operation, the "observable behaviour" (i.e. the data copy to or from kernel space) will occur some time between the start of the initiating function until immediately before the completion handler is called. This means the observable behaviour is asynchronous with respect to the program's flow of control. > * it seems to work only on non-blocking filehandles on POSIX, either, so > file I/O is either not possible or not asynchronous. Asio doesn't do file I/O at this time (although it is planned for the future). > Is it planned to change the API into an asynchronous API and provide > asynchronous I/O later? If not, I think it might be better to change > the name into something that reflects the contents ("synchronous I/O > model sounds a bit boring, how about "network/nonlinear I/O model" or > even "standard I/O model"). > > Otherwise we would end up with a synchronous I/O model called > "asynchronous", which will likely confuse a lot of people who want a > real asynchronous I/O model (as provided by POSIX for example). > > Maybe asynchronous was confused with event-based when naming the > library? Just because I/O is not done linearly anymore does not mean > its not done in an asynchronous way, though. Of course, event-based programming and asynchronous I/O are not mutually exclusive. IMHO the asio API is both asynchronous and event-based in terms of what it provides to the library user. That asio can be implemented using synchronous mechanisms doesn't change this. Cheers, Chris

3 2

Re: [Boost-users] COM and boost::intrusive_ptr
by Nat Goodspeed 04 Jan '07

04 Jan '07

________________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Philipp Henkel Sent: Thursday, January 04, 2007 12:34 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] COM and boost::intrusive_ptr 1. I need to access the address of the raw pointer (to use QueryInterface). Therefore I implemented operator& for intrusive_ptr. Like in COM this pointer-pointer will only be used for intialization purposes. My implementation relies on the intrusive_ptr's memory layout and returns reinterpret_cast<T**>(addressof(ptr)). I know, this is evil... CComPtr-like usage: boost::intrusive_ptr<IVideo> video; someObject->QueryInterface(IID_IVideo,(void**)&video); Is there a better way? How do you bring intrusive_ptr and QueryInterface together? [Nat] Sorry if this is naïve... Wouldn't it work to do something like this? IVideo* temp_video = NULL; someObject->QueryInterface(IID_IVideo, &temp_video); boost::intrusive_ptr<IVideo> video(temp_video);

2 1

boost::bind - using boost::weak_ptr
by Remigiusz �ukowski 04 Jan '07

04 Jan '07

hello, Callback mechanism defined by boost::function and by means boost::bind instead of using callback virtual class is very comfortable, but has one big shortcoming: using callback class, passing object can be stored as weak_ptr and if weak_ptr is invalid the callback can be automatically unregistered. I've tried to implement such behaviour with boost::function and boost::bind with some helper class holding weak_ptr: template<typename T> class my_wptr { boost::weak_ptr<T> m_wptr; constructors etc... }; and two helper functions: template<typename T> T* get_pointer( my_wptr &_wptr ) { boost::shared_ptr<T> sptr = _wptr.m_wptr.lock(); if( !sptr ) throw some_exception; return _wptr.get(); } and template<typename T> my_wptr<T> wptr_from( boost::weak_ptr<T> &_sptr ) { return my_wptr( _sptr ); } now I can use standard shared_ptr version: boost::function<void()> f1 = boost::bind( &class::method, some_shared_ptr ); or my version holding weak_ptr: boost::function<void()> f2 = boost::bind( &class::method, wptr_from( some_weak_ptr )); This works, but is unsafe - after get_pointer succesfully returns pointer to the object, the object is unlocked and can be deleted during class::method execution. Can anyone help me solving this problem ? regards Remigiusz Zukowski, Poland --------------------- Panorama Internetu - prognoza pogody, poczta e-mail z największym załącznikiem, SMS, wyszukiwarki: Gooru, Anonser, serwisy: randki, ogłoszenia, wakacje, program TV, Kina, muzyka, DVD, newsy, inne. http://www.panoramainternetu.pl/ (http://www.epf.pl/)

2 1

use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>
by Miguel Silvestre 04 Jan '07

04 Jan '07

Hi folks! I've just installed the serialization boost library and I'm trying to run it but I get the error in the subject. I'm trying to integrate the serialization in my project and for the begining I'm trying to follow the very simple example :-/. I've already searched the internet for this error, and I get some pages but without any answer... So here is the code: class A { private: friend class boost::serialization::access; int dumbi; float dumbf; template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & dumgf; ar & dumbi; } public: A():dumbi(12), dumbf(69.69f) { } A(int dumb1, float dumb2) : dumbi(dumb1), dumbf(dumb2) { } }; class SilvTask { private: typedef DefaultTask Parent; int dumbi; float dumbf; A testA; bool m_save, m_xml; std::string m_filename; public: SilvTask():m_save(false), dumbf(69.69f), dumbi(7), m_xml(false) { } int SilvTask::ParseArguments(const std::vector<std::string>& args) { for(uint32 i = 0; i < (uint32)args.size(); i++) { if(args[i].find("-xml")) m_xml = true; if(args[i].find("-save=") != std::string::npos) { m_filename = args[i].substr(6); m_save = true; } else if(args[i].find("-load=") != std::string::npos) { m_filename = args[i].substr(6); m_save = false; } } return FE_OK; } int SilvTask::LoadData() { if(m_save) WriteObject(); else LoadObject(); return FE_OK; } int SilvTask::WriteObject() { A aux(12, 69.69f); // create and open a character archive for output std::ofstream ofs(m_filename.c_str()); boost::archive::text_oarchive oa(ofs); //write class instance to archive oa << aux; return FE_OK; } int SilvTask::LoadObject() { A newAux; std::ifstream ifs(m_filename.c_str(), std::ios::binary); boost::archive::text_iarchive ia(ifs); // read class state from archive ia >> newAux; return FE_OK; } }; any ideias? Thanks -- Miguel Silvestre

1 0

[asio] Address already in use / reuse_address
by Maximilian Szengel 04 Jan '07

04 Jan '07

Hi list, I am having problems using asio. When I create a server (or take one of the examples from the website), start it and connect to it via telnet, then close the server (by closing all sockets, so io_service::run returns) and then want to restart the server again, I always get: "Address already in use." asio::error exception. I tried setting asio::ip::tcp::acceptor::reuse_address(true), but that didn't change anything. Any help/hint would be appreciated. Greetings, Max

3 2

mpl::inherit_linearly question
by Ovanes Markarian 04 Jan '07

04 Jan '07

Hi! I am trying to create a static visitor using metapgramming. This approach worked fine in some test code, but now I face some problems. Let me first show some example: I've define an item_visitor template class: template <class Pair> //mpl::pair obtained from map sequence struct item_visitor { public: typedef typename Pair::second value_type; virtual void visit(value_type const& t) { assert(0 && "This function must be overriden in the concrete handler class!"); } }; template<class Seq> struct base_sequence_visitor : public boost::mpl::inherit_linearly < Seq , boost::mpl::inherit<boost::mpl::_1, item_visitor<boost::mpl::_2> > >::type {}; This example works fine and I can dispatch my type. Now I have some additional type, which provides a view to my structure. And I would like my visit to implemented as: virtual void visit(GenericView<Pair::second> const& t) { ... } In such a case I have to introduce a second parameter to the item_visitor template: template<class Pair, template<class> SomeView> struct item_visitor { ... }; Therefore the base_sequence_visitor must be updated as well to forward the View template: template<class Seq, template<class> SomeView> struct base_sequence_visitor : public boost::mpl::inherit_linearly < Seq , boost::mpl::inherit<boost::mpl::_1, item_visitor<boost::mpl::_2, SomeView> > >::type {}; Using this construct I get an error, that mpl::arg<2> does not have a type second. That means that the placeholder _2 does not get expanded. So I tried to "code around" and used the following trick: template<class> calss SomeView; template<class Pair> struct some_visitor : item_visitor<Pair, SomeView> {}; Then I added to the base_sequence_visitor template an additional argument, which specifies an item visitor class to be used: template<class Seq, template<class> ItemVisitor> struct base_sequence_visitor : public boost::mpl::inherit_linearly < Seq , boost::mpl::inherit<boost::mpl::_1, ItemVisitor<boost::mpl::_2> > >::type {}; And it compiles fine! But when I try to cast the base_sequence_visitor to some complete item_visitor type, which is really in the sequence I receive a compiler error, that cannot convert from 'base_sequence_visitor<Seq,ItemVisitor>' to 'ClassWhereSimpleVisitorIsDefined::simple_visitor<PairType> &' Do I miss something? With Kind Regards, Ovanes Markarian

3 4

[graph] leda_graph.hpp: edge property maps
by Jens Müller 04 Jan '07

04 Jan '07

leda_graph.hpp has an adapter for leda::node_array's as property maps. Could the same code (replacing node by edge, where appropriate) be used to make an adapter for leda::edge_array's? Well, I'll try this out right now ...

1 2

Mapping from type to value
by Johan Torp 04 Jan '07

04 Jan '07

What is the best practice for creating a map from a type to a value? Currently I do it like this: ===================================== struct SomeMap { template<typename T> static const std::string& LookUp(); }; template <> const std::string& SomeMap::LookUp<int>() { static const std::string s("int"); return s; } ===================================== ...but this seems far from optimal. -- System Developer TouchTable AB Tel: +46 (0)31 773 68 12 johan.torp(a)touchtable.se

2 2

Simple MPL question: Generate code from type sequence
by Johan Torp 04 Jan '07

04 Jan '07

I would like to generate one call to a templated function for each type in an MPL sequence. Which is the best way to do this? E.g.: typedef vector<float,double,long double> SomeVector; template <typename T> write_size() { std::cout << sizeof(T) << " "; } Should somehow expand to: write_size<float>(); write_size<double>(); write_size<long double>(); I have managed to do this "manually" in a fairly general way, what I'm looking for is some part of boost which replaces my ForEach struct below or some nicer way of writing the same code: ============================================== struct WriteSize { template<typename T> void Call() {write_size<T>();} }; template <class It, class End> struct ForEach { template <class Func> static void Call(Func& func) { func.Call<typename It::type>(); ForEach<typename next<It>::type, End>::Call(func); } }; template <class End> struct ForEach<End, End> { template <class Func> static void Call(Func&) {} }; // Then I can generate the calls by WriteSize ws; ForEach<begin<SomeVector;>::type, end<SomeVector;>::type>::Call(ws); ============================================== -- System Developer TouchTable AB Tel: +46 (0)31 773 68 12 johan.torp(a)touchtable.se

2 1

[BGL] How to get at a specific vertex and check out degree?
by Ferng, Andrew D 04 Jan '07

04 Jan '07

Hi all, I've been reading the docs and have gotten more and more confused. Figure I better stop and ask for directions. So far, I've been successful in using the following (basically copied the connected component example): adjacency_list<vecS, vecS, undirectedS> G; vector<int> linkPath(num_vertices(G)); int num = connected_components(G, &linkPath[0]); cout << "Total number of linkPaths: " << num << endl; So from the output of the algorithm, I examine all the different paths found and are interested in certain vertices. For example, for some component, I want to know if a certain vertex has degrees over 2. I'm using undirected so I assume out_degree will give me the total degrees? >From the docs: out_degree(vertex_descriptor u, const adjacency_list& g) and graph_traits<adjacency_list>::vertex_descriptor I think the 2nd param in out_degree is just G. But what about the first param? Is that like an iterator? how do I specify the vertex that I'm interested in? Thanks!

1 1

Re: [Boost-users] [Boost.Multi-Index] ICE w/ VC7.1
by Marc Viala 03 Jan '07

03 Jan '07

De la part de John Maddock > Marc Viala wrote: > > Before trying to recompile some codes from B.MI/test to crash my > > compiler w/ an ICE, I've just played with some compilation options in > > my IDE and the results are: > > > > In Debug mode: > > If the C/C++ options "/Zi" & "/Gm" are set: KO -> w/ ICE in > > apply_wrap.hpp > > If the C/C++ options "/ZI" & "/Gm" are set: KO -> w/ ICE in > > apply_wrap.hpp > > If the C/C++ option "/Gm" is not set and "Zi" or "ZI" is set: OK > > > > > > In Release mode: > > with or without the "/Gm" option set: OK > > > > Funny... It seems that the /Gm option is quite unstable in debug > > mode? I don't know exactly the goal of this option but our project > > template set this option by default in this mode. > > > > Joaquin or John, do you know the meaning of this compilation option > > for VC7.1? Do you know the recommended options w/ this compiler to > > use Boost libraries, more specifically B.MI? For information, up to > > now, we use "/ZI" or "/Zi" in conjunction with "/Gm" option with all > > other Boost libraries. > > With apologies I think I misread your original post: I took your post to > mean you were seeing a runtime crash, but you mean an internal compiler > error: and I did see that at one point when testing your original code. I > use the same project options as you BTW /Zi and /Gm: the /Zi enables build > and continue, /Gm enables a minimal rebuild (compile only the changes to a > source). Generally they work quite well, but if you see an internal > compiler error the trick is just to do a clean, then rebuild, and that > usually clears the problem. Of course cleaning and rebuilding a large > project can wipe out the advantages that /Zi /Gm normally bring :-( Thanks a lot this explanation... It does clarify for me the signification of these options. Now that I'm aware of /Gm option behaviour I would pay more attention. > > Strangely I was unable to reproduce the internal error this morning no > matter options I used: it seems to be very dependent on whatever VC has in > it's cache. > Yes, that's a pity... I can now go ahead with B.MI. Best regards Marc

1 0

Re: [Boost-users] [boost] Boost threads + MSVSC + /Za + client code
by Sohail Somani 03 Jan '07

03 Jan '07

Hi Anthony, Thanks for your response. > if BOOST_DISABLE_WIN32 is > defined and > BOOST_HAS_PTHREADS is not; the implication is that if you > can't use the > Windows headers, then you can't use the Windows thread API, > so if we haven't > got pthread-win32 configured, you can't use Boost threads. This pretty much sums it up, yes. > I am not sure what we can do about this. One issue is that > currently the > thread lib requires windows.h, and therefore compiler > extensions, when the > library sources are built. I'm not sure whether it is safe to > link something > compiled with extensions on against something compiled with > extensions off --- > is the ABI the same? If it *is* safe, then we should remove > this define from > boost/config/suffix.hpp, since the boost thread headers don't > explicitly > include windows.h. I think this is correct but I think the restriction only makes sense if you are building the thread library. Atleast the 1.33.1 code appears to have been written such that headers don't require language extensions. My gut feeling is that a solution like this should work: // BOOST_BUILDING is defined whenever building a boost library #if defined(BOOST_BUILDING) && defined(BOOST_MSVC) # define BOOST_REQUIRE_MSVC_LANGUAGE_EXTENSIONS #endif #include <boost/config/requires_threads.hpp> #if defined(BOOST_REQUIRE_MSVC_LANGUAGE_EXTENSIONS) # undef BOOST_REQUIRE_MSVC_LANGUAGE_EXTENSIONS #endif > OTOH, someone put the restriction there for a reason, and I > wouldn't want to > remove it without careful thought. Of course. Thanks again, Sohail

1 0

Using serialization of a class with a wrapped shared_ptr - compil ation and run-time issues !!!
by Jon Belinfante 03 Jan '07

03 Jan '07

Hi I am at present introducing myself to Boost Serialization which from my first impressions of is very impressive to use and I like what I see. I have an ongoing set of classes to serialiise and find most of the problems I have found can be resolved from the Boost documentation. However one problem I have is that a huge bulk of my classes used boost::smart_ptrs each of which seem to add an extra level of complexity and at present I can not see my own resolution to. I have one simple case of a smart string class - as shown below which causes me a problem. This source code is to create a smart string class which uses a wrapped shared_ptr to a std::string - the idea behind this Smart String class is to reduce memory sizes for huge quantity of repeated strings in an application. -Please see source code. This class works fine apart the serialization which either does not compile or crashes with assertion errors. Please see below source code. As this code stands with line in the serialization block ar & m_stringPtr; I get a long compilation error - c:\Boost\boost_1_33_1\boost\serialization\shared_ptr.hpp(235) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' - with it complatining with the line oa << a; which is in the main code block. However if I change to code ar & * m_stringPtr; The code compiles correctly and it serializes the SmartString - however it run-time throws in trying to de-serialise at ia >> b; Any ideas here where I am going wrong - I would be most greatful. Thanks /********************************************/ #include <set> #include <vector> #include <string> #include <boost/shared_ptr.hpp> #include <boost/scoped_ptr.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/shared_ptr.hpp> BOOST_SERIALIZATION_SHARED_PTR(std::string) /** Smart String Class Basically holds a String only by a ptr and the pimpl method. Idea is to only ever store a shared_ptr and let boost do a reference count on its usage. Idea to of course save time/speed of string storage. */ class SmartString { public: /** overriden stream operator */ friend std::ostream& operator<< (std::ostream &os, const SmartString &cSmartString); SmartString() { m_stringPtr.reset(); } SmartString( const std::string& s) { boost::shared_ptr< std::string > tempPtr( new std::string( s) ); m_stringPtr = tempPtr; } SmartString( const char* s) { boost::shared_ptr< std::string > tempPtr( new std::string( s) ); m_stringPtr = tempPtr; } SmartString( const SmartString& other) { m_stringPtr = other.m_stringPtr; } SmartString& operator=(const SmartString& other) { m_stringPtr = other.m_stringPtr; return *this; } inline SmartString& operator=( const std::string& otherStr) { boost::shared_ptr< std::string > tempPtr( new std::string( otherStr) ); m_stringPtr = tempPtr; return *this; } bool operator() ( const SmartString& t1, const SmartString& t2) const; inline bool operator<( const SmartString& otherStr) { const std::string other= *otherStr.m_stringPtr; return *m_stringPtr < other; } inline bool operator<=( const SmartString& otherStr) { const std::string other= *otherStr.m_stringPtr; return *m_stringPtr <= other; } inline bool operator>( const SmartString& otherStr) { const std::string other= *otherStr.m_stringPtr; return *m_stringPtr > other; } inline bool operator>=( const SmartString& otherStr) { const std::string other= *otherStr.m_stringPtr; return *m_stringPtr >= other; } inline bool operator==( const SmartString& otherStr ) { return *m_stringPtr == *otherStr.m_stringPtr; } inline bool operator==( const SmartString& otherStr ) const { return *m_stringPtr == *otherStr.m_stringPtr; } inline bool operator==( const std::string& otherStr ) { return *m_stringPtr == otherStr; } inline bool operator==( const char* c ) { int x = ::strcmp( (*m_stringPtr).c_str(), c); return x? false:true; } inline const std::string& getString( ) const { return *m_stringPtr; } inline bool operator!=( const SmartString& otherStr) { const std::string other= *otherStr.m_stringPtr; return *m_stringPtr != other; } inline bool operator!= ( const std::string& otherStr) { return *m_stringPtr != otherStr; } inline const char& operator[] (const int index) const { if ( (index >=0) && ( index <= static_cast<int>((*m_stringPtr).size() ))) return (*m_stringPtr)[index]; else { std::string message( "Out of range index on " + (*m_stringPtr) ); throw std::out_of_range(message); } } /** overriden + operation to retunn addition of two strings */ friend SmartString operator+(const SmartString& s1,const SmartString &s2); virtual ~SmartString(){} friend class boost::serialization::access; protected: template <class Archive> void serialize ( Archive& ar, const unsigned long file_version) { ar & m_stringPtr; } boost::shared_ptr<std::string> m_stringPtr; }; std::ostream& operator<< (std::ostream &os, const SmartString& cSmartString) { const std::string str( cSmartString.getString() ); os << str.c_str(); return os; } SmartString operator+(const SmartString& s1,const SmartString &s2) { std::string str = s1.getString(); str += s2.getString(); return SmartString ( str.c_str() ); } int main( int, const char*[] ) { const SmartString a("ABC"); const char* fileName = "smartStringFile"; { std::ofstream ofs(fileName); boost::archive::text_oarchive oa( ofs ); oa << a; } SmartString b; { std::ifstream ifs( fileName, std::ios::binary ); boost::archive::text_iarchive ia( ifs ); ia >> b; } } /********************************************/ ********************************************************** Mitsubishi UFJ Securities International plc ("MUSI") is registered in England, company number 1698498 and registered office at 6 Broadgate, London EC2M 2AA. MUSI is part of the Mitsubishi UFJ Financial Group and is authorised and regulated by The Financial Services Authority. This message is intended solely for the individual addressee named above. The information contained in this e-mail is confidential and may be legally privileged. If you are not the intended recipient please delete in its entirety. Messages sent via this medium may be subject to delays, non-delivery and unauthorised alteration. The information contained herein or attached hereto has been obtained from sources we believe to be reliable but we do not represent that it is accurate or complete. Any reference to past performance should not be taken as an indication of future performance. The information contained herein or attached hereto is not to be construed as an offer or solicitation to buy or sell any security, instrument or investment. MUSI or any affiliated company, may have an interest, position, or effect transactions, in any investment mentioned herein. Any opinions or recommendations expressed herein are solely those of the author or analyst and are subject to change without notice.

2 1

Using filter_iterator in a for loop
by David Ward 03 Jan '07

03 Jan '07

I want to use a boost::filter_iterator to iterate through a std::vector using a for-style loop. I haven't been able to find any examples of the proper way to do this in the Boost documentation (or how to do this for any other Boost iterator, for that matter). >From searching this newsgroup, I found that it is possible to do: for (boost::filter_iterator< ... > iter(myVector.begin(), myVector.end()); iter != boost::filter_iterator< ... >(myVector.end()); ++iter ) { ... } However, iter is quite aware of when it has reached the end of the vector, since that is the second parameter in its constructor. Is it really necessary to create a second filter_iterator, set it to the end of the vector, and then test iter against it? Can't I somehow test iter alone to see if it has reached the end of the vector? If I use std::for_each, it needs both a beginning and ending iterator as parameters, leading to the same situation as above. I've also looked at the Boost Range library and BOOST_FOREACH (described at http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/foreach.html) However, from my understanding, I don't think either of these apply to or work with Boost iterators. Whatever method is appropriate, I would ask that someone please exapnd the Boost iterator documentation to include an example of using Boost iterators in a for-style loop. I feel that this is a very basic and common usage of iterators which was not addressed. Thank you. -- David Ward Communications and Networking Division Information Technology and Telecommunications Laboratory Georgia Tech Research Institute

2 1

Re: [Boost-users] [Boost.Multi-Index] ICE w/ VC7.1
by Marc Viala 03 Jan '07

03 Jan '07

Hello Joaquin & John, > > > So I gave up at that point. Adding your example programs to the > > same VC7.1 IDE project did compile so I don't think it's a > > setup issue. > > That's fine, your help has been invaluable. It definitely > looks like a local problem, I hope Marc can provide me with > more info wrt his particular environment. Thank you very much, Thanks for your help John. Before trying to recompile some codes from B.MI/test to crash my compiler w/ an ICE, I've just played with some compilation options in my IDE and the results are: In Debug mode: If the C/C++ options "/Zi" & "/Gm" are set: KO -> w/ ICE in apply_wrap.hpp If the C/C++ options "/ZI" & "/Gm" are set: KO -> w/ ICE in apply_wrap.hpp If the C/C++ option "/Gm" is not set and "Zi" or "ZI" is set: OK In Release mode: with or without the "/Gm" option set: OK Funny... It seems that the /Gm option is quite unstable in debug mode? I don't know exactly the goal of this option but our project template set this option by default in this mode. Joaquin or John, do you know the meaning of this compilation option for VC7.1? Do you know the recommended options w/ this compiler to use Boost libraries, more specifically B.MI? For information, up to now, we use "/ZI" or "/Zi" in conjunction with "/Gm" option with all other Boost libraries. Thanks for your help. The code snipped during my compilation test is the following: #include <boost/config.hpp> #include <boost/multi_index_container.hpp> #include <boost/multi_index/composite_key.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/key_extractors.hpp> // STL #include <string> using namespace boost::multi_index ; struct Item { const std::string& getCls() const { return _cls ; } const std::string& getId() const { return _id ; } std::string _cls ; std::string _id ; int _i ; int _j ; } ; void main() { typedef const_mem_fun< Item , const std::string& , &Item::getCls > key_cls ; typedef const_mem_fun< Item , const std::string& , &Item::getId > key_id ; typedef composite_key<Item,key_cls,key_id> ckey_clsid ; typedef multi_index_container< Item, indexed_by< ordered_non_unique<key_id> , ordered_non_unique<key_cls> , ordered_unique<ckey_clsid> > > ObjectContainer ; ObjectContainer c ; }

2 1

Re: [Boost-users] Boost threads + MSVSC + /Za + client code
by Sohail Somani 03 Jan '07

03 Jan '07

Hi, Any takers? The workaround I've found for the problem below is to #define _MSC_EXTENSIONS before including any boost thread headers. It /appears/ that this is only necessary when separately compiling boost threads. Sorry for the cross-post. > With Visual C++, I can't seem to determine why if I simply include > boost/threads/once.hpp, I need to enable language extensions for that > translation unit. I'm going to dig into this further today but I would > appreciate if someone has figured out a solution short of allowing > language extensions. I can understand requiring it for building boost > threads (as windows.h seems to have some extended syntax) but I'm not > sure of the logic behind requiring client code to use it as well. Thanks! Sohail

2 1

[threads] Compiling boost.threads on Linux
by Hugo Vinicius Alves Soares 03 Jan '07

03 Jan '07

Hey everybody, I'm a newbie on Boost Libraies, I'm starting with the thread library. I'm using Ubuntu and a install it using apt-get, the headers are in /usr/include/boost/ but when I use g++ to compile my test codes an error message is returned: undefined reference to methods of the library classes. I know this errors are link errors, what option I must pass to g++? Thanks for everyone that answer my ask. Hugo Vinícius __________________________________________________ Fale com seus amigos de graça com o novo Yahoo! Messenger http://br.messenger.yahoo.com/

2 1

Re: [Boost-users] [Boost.Multi-Index] ICE w/ VC7.1
by Marc Viala 02 Jan '07

02 Jan '07

Hello Joaquin and happy New Year, Sorry for my late reply but our mail server was down in the night of 31th; this is not a joke. I've just changed the code snippet with your recommendation but without success: I've got the same ICE with VC7.1. Just to clarify my report: I've also compiled some code snippets from the MultiIndex documentation and get the same ICE. My compiler version corresponds to the VC7.1 with the service pack #1. Best regards, Marc Viala > -----Message d'origine----- > De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De > la part de "JOAQUIN LOPEZ MU?Z" > Envoyé : dimanche 31 décembre 2006 01:08 > À : boost-users(a)lists.boost.org > Objet : Re: [Boost-users] [Boost.Multi-Index] ICE w/ VC7.1 > > Hello Marc, > > ----- Mensaje original ----- > De: Marc Viala <mviala(a)acticm.com> > Fecha: Viernes, Diciembre 29, 2006 7:25 pm > Asunto: [Boost-users] [Boost.Multi-Index] ICE w/ VC7.1 > Para: boost-users(a)lists.boost.org > > > I'm just trying to use Boost.MultiIndex in a large project but I'm > not > > being able to compile this library with VC 7.1.6030: I've got an > > ICE in file "apply_wrap.hpp" of Boost.MPL. I've tried to change the > > headers order but without success. > > > > My environment is: > > - Windows XP > > - Boost 1.33.1 > > - VC 7.1.6030 > > > > To demonstrate this ICE, you will find hereafter a code snippet. > > > > Thanks in advance. > > > > Marc Viala > [...] > > typedef composite_key< > > Item > > , ordered_non_unique<member<Item,int,&Item::_i> > > > , ordered_non_unique<member<Item,int,&Item::_j> > > > > ckey_ij ; > > I think the problem lies here: you must provide composite_key<> > with *key extractors*, not index specifiers. Please try > rewriting ckey_ij like this: > > typedef composite_key< > Item > , member<Item,int,&Item::_i> > , member<Item,int,&Item::_j> > > ckey_ij ; > > Problem solved? I'm sorry I can't try the snippet you > provide myself, so please report back. Thanks for using > Boost.MultiIndex! > > Joaquín M López Muñoz > Telefónica, Investigación y Desarrollo > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 6

Re: [Boost-users] fatal error LNK1561: entry point must be definedbuilding boost libs with win32 port of pthread
by Andrew Marlow 02 Jan '07

02 Jan '07

boost-users-bounces(a)lists.boost.org wrote: > "Andrew Marlow" <Andrew.Marlow(a)icap.com> writes: > >> I am trying to build boost using the win32 port of pthreads. Although I got it working I did have to apply a small hack which I feel I have to mention. The file lib/thread/build/threads.jam refers to the PTW32_LIB directory via a subdirectory pre-built. So unless the lib and include subdirs are in a subdir called 'pre-built' it does not work. I removed "/pre-built" from the jam file and then all was ok. I am not sure why 'pre-built' is there since a pre-built library can be installed in any location that people want. Shouldn't this be removed? If not then perhaps PTW32_LIB can be added as additional directory to search for the lib and include files without the 'pre-built' qualifier. Regards, Andrew Marlow ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

1 0

[Boost.Function] (too) loosly treated argument types
by Slawomir Lisznianski 02 Jan '07

02 Jan '07

Given example below, is there any way to enforce parameter type strictness? [-- Example begin: #include <boost/function.hpp> using namespace boost; // some kind of callback sig. // typedef function1<void, int &> signature; void fn1(int v) // notice arg by-value (say, user typo) { // here, assignments to `v' are lost after // return } void fn2(int & v) // OK { // here, assignments to `v' are // preserved after return } int main(int, char**) { // I want this to fail at compile-time... signature f1 = fn1; // ...and this to work signature f2 = fn2; return 0; } -- code end] On my compiler (g++ (GCC) 4.0.2 20051125) everything compiles fine but ideally, I'd like to fail the first case. Rationale: Users of my library register callbacks and occasionally mistype their function signature which causes them to modify temporaries rather than "out" variables. Thanks, -- Slawomir Lisznianski Paramay Group, LLC "Programs for Research Machinery"

3 2

Re: [Boost-users] fatal error LNK1561: entry point must be definedbuilding boost libs with win32 port of pthread
by Andrew Marlow 02 Jan '07

02 Jan '07

boost-users-bounces(a)lists.boost.org wrote: > "Andrew Marlow" <Andrew.Marlow(a)icap.com> writes: > >> I am trying to build boost using the win32 port of pthreads. It turns out that this is a red herring for the build problem I was having. I get the problem even just using the win32 threads API. > Well, that's interesting; I can think of no reason that the > pthreadwin32 options shouldn't affect anything about the > build of the Regex library. Do you get the same results if > you leave out the -sPTW32_XXX options? Yes, I do :-( >> The CMD file just contains a list of the object files. > > Also interesting; the linker warning claims there were no object > files specified. I agree this is very odd. >> Any ideas please? > > I'm afraid I have no idea. I would probably start by > whittling down the command line issued by bjam until you get > sometihng that seems to be more-or-less correct, so you can identify > what the problem is. I tried downloading and running the boost "exe" from sourceforge. This distribution builds ok with the win32 port of pthreads. I have not diff'd it with the tarball I was using earlier but I suppose there must be differences to get this different behaviour. Very strange. Oh well, at least I have a working boost now. Regards, Andrew Marlow ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

1 0

fatal error LNK1561: entry point must be defined building boost libs with win32 port of pthread
by Andrew Marlow 02 Jan '07

02 Jan '07

I am trying to build boost using the win32 port of pthreads. The command I use is: bjam -STOOLS=vc-7_1 -sPTW32_DIR="where-i-put-win32-pthreads" -sPTW32_LIB="pthreadVC.lib" stage The error I get is: LINK : warning LNK4001: no object files specified; libraries used LINK : warning LNK4068: /MACHINE not specified; defaulting to X86 LINK : fatal error LNK1561: entry point must be defined Would be nice of Mico$oft said ***which*** entrypoint is missing. Without that little snippet of information I can only guess.... The log shows the linker command line used: CALL "C:\Program Files\Microsoft Visual Studio .NET 2003\VC7\bin\VCVARS32.BAT" >nul "C:\Program Files\Microsoft Visual Studio .NET 2003\VC7\bin\link" /nologo /INCREMENTAL:NO /LIBPATH:e:\work\overnight\win_extern\lib" /DEBUG /DLL /subsystem:console /out:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\vc-7_1\debug\t hreading-multi\ boost_regex-vc71-mt-gd-1_33_1.dll" /IMPLIB:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\vc-7_1\debu g\threading-multi\ boost_regex-vc71-mt-gd-1_33_1.lib" @"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\vc-7_1\debug\threa ding-multi\ boost_regex-vc71-mt-gd-1_33_1.CMD" The CMD file just contains a list of the object files. Any ideas please? I am tearing my hair out here. A quick google reveals that a few other people across the world also have this problem, but not many. Those people posted their question to various forums and unfortunately got no reply :-( Regards, Andrew Marlow ---- There is an emerald here the size of a plover's egg! Don't top-post http://www.catb.org/~esr/jargon/html/T/top-post.html Plain text mails only, please http://www.expita.com/nomime.html ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

3 2

Undefined Reference (newbie) solved & followup question
by mailbox44＠swissmail.org 02 Jan '07

02 Jan '07

>From my previous post. I was linking the wrong file. The correct linkage (or at least one that compiled) g++ test.cpp -lboost_thread-gcc-mt-d-1_33_1 A few more questions. There is also a libboost_thread-gcc-mt-d-1_33_1.so file. What is the -d represent?? Why does the linker not know to use the given library? Based on other sources I put the path /usr/local/lib in my /etc/ld.so.conf file and then ran /sbin/ldconfig What do I need to do so that I do not have to include all the boost libraries in the compile line? Thanks much. Steve

3 4

Undefined Reference (newbie)
by mailbox44＠swissmail.org 02 Jan '07

02 Jan '07

I think my problem is a simple linking problem. I have looked through the archives and tried a few things to no avail. I am trying to compile the simple thread example from the boost site (see end of message). I am using 64 bit Redhat linux on a dual core opteron box. g++ -v Reading specs from /usr/lib/gcc/x86_64-redhat-linux/3.4.6/specs Configured with: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --enable-shared --enable-threads=posix --disable-checking --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-java-awt=gtk --host=x86_64-redhat-linux Thread model: posix gcc version 3.4.6 20060404 (Red Hat 3.4.6-3) I believe the boost libraries come pre-installed on linux, but just in case I followed all the directions online and installed the libraries (I just used whatever defaults the installed runs). I compile the program below with: g++ test.cpp (I renamed the sample program test) and get these errors: /tmp/cctHP3Df.o(.text+0x169): In function `main': : undefined reference to `boost::thread::thread(boost::function0<void, std::allocator<boost::function_base> > const&)' /tmp/cctHP3Df.o(.text+0x19b): In function `main': : undefined reference to `boost::thread::join()' /tmp/cctHP3Df.o(.text+0x1ae): In function `main': : undefined reference to `boost::thread::~thread()' /tmp/cctHP3Df.o(.text+0x1c4): In function `main': : undefined reference to `boost::thread::~thread()' /tmp/cctHP3Df.o(.gnu.linkonce.t._ZN12thread_alarmclEv+0x16): In function `thread_alarm::operator()()': : undefined reference to `boost::xtime_get(boost::xtime*, int)' /tmp/cctHP3Df.o(.gnu.linkonce.t._ZN12thread_alarmclEv+0x2f): In function `thread_alarm::operator()()': : undefined reference to `boost::thread::sleep(boost::xtime const&)' collect2: ld returned 1 exit status Based on a few previous messages from the archives, I tried linking in the thread library (shouldn't gcc find it by itself??) g++ test.cpp -lboost_thread and get these errors: /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/libboost_thread.a(t hrea d.o)(.text+0x54): In function `boost::thread::~thread()': : undefined reference to `pthread_detach' /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/libboost_thread.a(t hrea d.o)(.text+0x74): In function `boost::thread::~thread()': : undefined reference to `pthread_detach' /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/libboost_thread.a(t hrea d.o)(.text+0xca): In function `boost::thread::join()': : undefined reference to `pthread_join' /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/libboost_thread.a(t hrea d.o)(.text+0x251): In function `boost::thread_group::join_all()': : undefined reference to `pthread_join' /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/libboost_thread.a(t hrea d.o)(.text+0x8b4): In function `boost::thread_group::~thread_group()': : undefined reference to `pthread_detach' /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/libboost_thread.a(t hrea d.o)(.text+0x924): In function `boost::thread_group::~thread_group()': : undefined reference to `pthread_detach' /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/libboost_thread.a(t hrea d.o)(.text+0xb4e): In function `boost::thread_group::create_thread(boost::functi on0<void, std::allocator<boost::function_base> > const&)': : undefined reference to `pthread_detach' collect2: ld returned 1 exit status Thanks in advance for any help. Steve test.cpp: #include <boost/thread/thread.hpp> #include <boost/thread/xtime.hpp> #include <iostream> struct thread_alarm { thread_alarm(int secs) : m_secs(secs) { } void operator()() { boost::xtime xt; boost::xtime_get(&xt, boost::TIME_UTC); xt.sec += m_secs; boost::thread::sleep(xt); std::cout << "alarm sounded..." << std::endl; } int m_secs; }; int main(int argc, char* argv[]) { int secs = 5; std::cout << "setting alarm for 5 seconds..." << std::endl; thread_alarm alarm(secs); boost::thread thrd(alarm); thrd.join(); }

2 1

[Boost.Multi-Index] ICE w/ VC7.1
by Marc Viala 31 Dec '06

31 Dec '06

I'm just trying to use Boost.MultiIndex in a large project but I'm not being able to compile this library with VC 7.1.6030: I've got an ICE in file "apply_wrap.hpp" of Boost.MPL. I've tried to change the headers order but without success. My environment is: - Windows XP - Boost 1.33.1 - VC 7.1.6030 To demonstrate this ICE, you will find hereafter a code snippet. Thanks in advance. Marc Viala // MultiIndex Container #include <boost/config.hpp> #include <boost/multi_index_container.hpp> #include <boost/multi_index/composite_key.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/key_extractors.hpp> // STL #include <string> using namespace boost::multi_index ; struct Item { const std::string& getCls() const { return _cls ; } const std::string& getId() const { return _id ; } std::string _cls ; std::string _id ; int _i ; int _j ; } ; void main() { typedef const_mem_fun< Item , const std::string& , &Item::getCls > key_cls ; typedef const_mem_fun< Item , const std::string& , &Item::getId > key_id ; typedef composite_key<Item,key_cls,key_id> ckey_clsid ; typedef composite_key< Item , ordered_non_unique<member<Item,int,&Item::_i> > , ordered_non_unique<member<Item,int,&Item::_j> > > ckey_ij ; typedef multi_index_container< Item, indexed_by< ordered_non_unique<key_id> , ordered_non_unique<key_cls> , ordered_unique<ckey_ij> > > ObjectContainer ; ObjectContainer c ; }

2 1

[serialization and asio] Trying to serialize asio IPs
by Eoin O'Callaghan 30 Dec '06

30 Dec '06

Hello, my name is Eoin O'Callaghan. I wasn't sure if this email should have been sent to ASIOs own mailing list or this Boost one, hopefully this was an ok place. My bit of bother is in trying to use Boost.Serialization to save some IP addresses stored internally as Boost.ASIO asio::ip::address_v4 and address_v6 classes. I wonder has anyone any pointers as my attempts thus far are not getting me anywhere? The IP classes can be constructed from, and exported to, boost::array<unsigned char, ##> types so a solution for boost::arrays would probably be one road to a solution but unfortunately I can't successfully write a serialize function for boost::array. I've held back from posting my own attempts to save myself from embarrassment. But will do so if someone wants to see what I've tried. Kind regards, Eoin. -- Eoin O'Callaghan <eoin(a)zl.vc>

3 3

[Thread] condition.cc test doesn't work..
by Giacomo Piccolo 29 Dec '06

29 Dec '06

Hello everybody, I've got a synchronization problem with two threads and I need a semaphore or a condition class in which a thread can wait on until that condition is verified. In other words i need to synchronize two or more threads and I need the wait() and notify() routines. I found some useful code in boost::thread libraries, but it seems I could not use it because it seems not completely built...or.. boh I don't really know. I tried also to build it lauching an executable builder I downloaded from the internet but I can't use it because don't have the root priviledges. I attach the source code and the errors I got. Is there anyone so kind to help me solving this little question? Thank you in advance! Giacomo

2 1

Boost threads + MSVSC + /Za + client code
by Sohail Somani 29 Dec '06

29 Dec '06

Hi, With Visual C++, I can't seem to determine why if I simply include boost/threads/once.hpp, I need to enable language extensions for that translation unit. I'm going to dig into this further today but I would appreciate if someone has figured out a solution short of allowing language extensions. I can understand requiring it for building boost threads (as windows.h seems to have some extended syntax) but I'm not sure of the logic behind requiring client code to use it as well. Thanks for listening :) Sohail

1 0

Solving a synch problem with the Boost::Thread library.
by luca 28 Dec '06

28 Dec '06

Hello all, I have a set of modules (ie classes, say the Module class and some Module derived classes) which calculate (or generate) data, and two different module instances could be connected together: one would use as input data the output of the other one. I have also a class which manages (say the ModulesManager class) the interconnections of those modules and it triggers the calculation of all the modules. The calculation is triggered in an worker boost::thread at a given rate (i.e. when the ModulesManager::trig () method is called). The modules have an internal state (upon which its calculation is based on), which could be changed by another thread calling some method of the Module class, say Module::setOffset(int offset). The problem is that I would like that any change to the internal state of any module happen not when the network of modules is being triggered by the ModulesManager, but it could be possible only between a call to trig() and its subsequent call. I would like to have a suggestion on how to modelize that in an elegant way. I thought about using something like the following: struct ModulesManager { ModulesManager::trig () { recursive_mutex::scoped_lock (*mutex); for (each Module mod) { mod->calculate (....); }//for } shared_ptr<recursive_mutex> ModulesManager::getMutex () const {return mutex;} } Then any thread could change the internal state of any Module just by using a code such as: AnyClassRunningInAnotherThread::setModuleXInternalState () { recursive_mutex::scoped_lock (*modulesManagerInstance->getMutex ()); moduleX->setOffset (newOffset); } Thanks in advance for any better proposal, Luca

1 0

Re: [Boost-users] help needed picking up pthread.h with Visual Studio .NET 2003
by Andrew Marlow 28 Dec '06

28 Dec '06

boost-users-bounces(a)lists.boost.org wrote: > Ok the mist is rasing ;-) > > There should be no problem mixing pthread and Boost.Thread. > I.e. your inherited lib can use pthread while your new code > can use Boost.Thread on the native API. I agree. But I have to deal with a great fear factor here. People think there will be a problem and the only way to deal with it is to (truthfully) say that everything is using the win32 port of pthreads. It is the only approach that will be accepted :-( > > But if on the other hand for whatever reason you want to take > the additional (IMHO unnecessary step) to build boost thread > on top of pthread you can. Here is how we go: > > Open the file BOOST_ROOT/libs/thread/build/threads.jam > Follow the instructions found there and set up your > environment variables accordingly. Excellent. This is exactly what I was looking for. Thanks very much, I will give this a try. > Again the whole mess isn't worth doing it. Technically, I agree. Politically......deep sigh....... The build is now in progress and it is time for me to go home and eat more mince pies :-) I will pick up on this again in the New Year. Many thanks again and Happy New Year! -Andrew Marlow ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

1 0

Re: [Boost-users] help needed picking up pthread.h with Visual Studio .NET 2003
by Andrew Marlow 28 Dec '06

28 Dec '06

boost-users-bounces(a)lists.boost.org wrote: > Andrew Marlow wrote: >>> 1) Building the boost library on top of pthread instead of native >>> WinThreads? >> >> Yes. Once the boost libs (and a few examples) have built ok I will >> then release these as prebuilts. > > Sorry this does not make sense to me, as this would imply > your project will be using the boost library: Boost.Thread. Yes it will. > So normally you wouldn't want to have them use the pthread > implementation in turn. Things are not normal here. My app has to use an in-house lib that was coded using pthreads. When that lib had to be available on windoze they did it by using the win32 port of pthreads. My app has to use this in-house lib, hence I have to link with the win32 port of pthreads. But I also want to do my own threading. I want to do it in a platform-independent way so I choose boost threads. > The only exception I can think of is > when you are doing some performance testing. Nope. > Usually the Boost.Thread on native windows API will be faster > than on top of pthreads, since there is one emulation layer less. Agreed. And if it was not for the in-house lib being built on the win32 port of pthreads then we would probably use boost threads throughout with a default build that uses the win32 api. But that is not an option. We do not want any apps to contain a mixture of win32 pthreads and win32 API threads. > >> I will have to do this for a number of versions of Visual Studio. >> Then for VC71 I will use the prebuilt boost lib to build my own >> project. It will be developed using the VC71 IDE but will be built >> overnight by a perl script that uses msdev in command line mode. >> This overnight job will not build boost, it will pick up the boost >> prebuilt. > > So I assume you are attempting to build the boost library? Yes, but I want to build it with a version of the win32 port of pthreads that lives in a special (non-std place). > If so, simply read the getting started from the boost > homepage and then precompiler your library, which basically > has to be done from the boost root directory: bjam > -s"TOOLS=vc-7_1" install which will install to C:\Boost directory by > default. (The above is for version 1.33, upcoming 1.34 is different. ) I don't think that works. I already tried it and it builds to the WIN32 API, not to the win32 port of pthreads that I have. > As an alternative you might also download the prebuilt binary > versions of the lib. I thought of that, but that won't work either. The boost that I wind up with MUST be one that is built wrt the win32 port of pthreads that comes with this in-house lib. Even if there was a prebuilt version of boost built with the win32 port of pthread even that would not do. It must be the particular version of the win32 port of pthreads that the in-house lib was built with. Wot a pain, eh? -Andrew M. ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

2 1

Re: [Boost-users] help needed picking up pthread.h with Visual Studio .NET 2003
by Andrew Marlow 28 Dec '06

28 Dec '06

boost-users-bounces(a)lists.boost.org wrote: > Andrew Marlow wrote: >> I am trying to build boost 1.33.1 on Windoze using Visual Studio .NET >> 2003 (aka vc71). This seems to be build just fine using the default >> settings (bjam -sTOOLS=vc-7_1) but I need to do the build such that a >> win32 port of pthreads can be picked up. >> I need some help with this please. > > What do you want to achieve? > > 1) Building the boost library on top of pthread instead of > native WinThreads? Yes. Once the boost libs (and a few examples) have built ok I will then release these as prebuilts. I will have to do this for a number of versions of Visual Studio. Then for VC71 I will use the prebuilt boost lib to build my own project. It will be developed using the VC71 IDE but will be built overnight by a perl script that uses msdev in command line mode. This overnight job will not build boost, it will pick up the boost prebuilt. > Please try to precise as possible, describing what you are > trying to do, since there are a lot of possible scenarios to > use the boost libraries. Hopefully this is a bit clearer now.... -Andrew ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

2 1

help needed picking up pthread.h with Visual Studio .NET 2003
by Andrew Marlow 28 Dec '06

28 Dec '06

I am trying to build boost 1.33.1 on Windoze using Visual Studio .NET 2003 (aka vc71). This seems to be build just fine using the default settings (bjam -sTOOLS=vc-7_1) but I need to do the build such that a win32 port of pthreads can be picked up. I need some help with this please. Eventually I hacked boost/config/platform/win32.hpp, and added "#define BOOST_HAS_PTHREADS". Is this what we are expected to do? I could find no help in this particular area of configuration. This hack does indeed make it try to #include <pthread.h> but I don't know how to tell the build where to look for this header. Hence, I now get loads of compilation errors. My app uses a proprietary library that is built on the win32 port of pthreads. So in order for my app to use boost I need it to work with the win32 port of pthreads that the proprietary library was built with. This means picking up pthread.h from the proprietary library source directory, rather than picking it up from std places. How is this done please? Regards, Andrew Marlow ---- There is an emerald here the size of a plover's egg! Don't top-post http://www.catb.org/~esr/jargon/html/T/top-post.html Plain text mails only, please http://www.expita.com/nomime.html ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

2 1

fail to pick up win32 port of pthreads lib at link time
by Andrew Marlow 28 Dec '06

28 Dec '06

I am still stuck on building boost with the win32 port of pthreads. After hacking win32.h to turn on pthreads I hacked msvc-tools.jam, adding an include option to the compilers command line, telling it in which directory pthread.h may be found. So now it all compiles. But it fails to link. I do not know enough about how boost jam works to be able to do a similar tweak to the linkers command line. And I am very uneasy at having to do these sorts of hacks. Surely there must be a better way. Can anyone help please? Regards, Andrew Marlow ---- There is an emerald here the size of a plover's egg! Don't top-post http://www.catb.org/~esr/jargon/html/T/top-post.html Plain text mails only, please http://www.expita.com/nomime.html ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

1 0

[Multi-Index] find returning false positives?
by David Brownell 28 Dec '06

28 Dec '06

When comparing the results of the find method to the end iterator in the code below, it appears that find is finding elements that are not in the container. Am I using multi-index in the wrong way? Thanks for the help! #include <boost/multi_index_container.hpp> #include <boost/multi_index/sequenced_index.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/shared_ptr.hpp> #include <iostream> struct MyObject : private boost::noncopyable { explicit MyObject(int i) : _i(i) {} int Get(void) const { return(_i); } bool operator <(MyObject const &rhs) const { return(_i < rhs._i); } private: int _i; }; typedef boost::shared_ptr<MyObject> MyObjectPtr; using namespace boost::multi_index; typedef multi_index_container<MyObjectPtr, indexed_by<sequenced<>, ordered_unique<identity<MyObject> > > > MyContainer; struct CompareFunc { bool operator()(MyObject const &o, int i) const { return(i == o.Get()); } bool operator()(int i, MyObject const &o) const { return(o.Get() == i); } }; int main(void) { MyContainer c; c.push_back(boost::shared_ptr<MyObject>(new MyObject(3))); c.push_back(boost::shared_ptr<MyObject>(new MyObject(4))); c.push_back(boost::shared_ptr<MyObject>(new MyObject(1))); MyContainer::nth_index<1>::type const & r = c.get<1>(); std::cout << (r.find(1, CompareFunc()) == r.end() ? "Not found" : "found") << "\n"; std::cout << (r.find(13, CompareFunc()) == r.end() ? "Not found" : "found") << "\n"; // This should not be found return(0); }

2 1

[Boost.Threads] Exiting Thread Properly
by Soren Dreijer 28 Dec '06

28 Dec '06

Hi, I'm new to Boost.Threads and have previously been using Windows events to signal threads to shut down. Since the Boost.Threads library does not include an Event type I'm wondering what the best approach is to signal a thread to exit. Let's say the thread is a worker thread which loops around every time it has finished its job and then wants to determine if it should shut down or not. Thanks, Soren

4 6

Boost::Timer does not tick
by Christoph 27 Dec '06

27 Dec '06

I've tried to use Boost::Timer together with Qt. However, the elapsed() function always does return the same value. I've found hints (see http://www.gerd-riesselmann.net/development/std-clock-threading-and-linux) that this might be related to the threading (used in Qt4). Is this a known issue? What is the suggested workaround (apart from using something else for timing? Best regards Christoph

2 1

Re: [Boost-users] [Boost.Threads] Exiting Thread Properly
by Søren Dreijer 27 Dec '06

27 Dec '06

Ah, excellent! I seem to recall a post somewhere mentioning that relying on volatile might not always work on multiprocessor systems. Is that something to worry about?Quick follow-up question: Why do you use auto_ptr<bool> when passing the flag_guard to the thread when you release it right afterwards? Is there a chance that thread's constructor or bind() might throw an exception?Thanks for the quick response, Soren > Date: Wed, 27 Dec 2006 20:45:40 +0100> From: sebastian.redl(a)getdesigned.at> To: boost-users(a)lists.boost.org> Subject: Re: [Boost-users] [Boost.Threads] Exiting Thread Properly> > Soren Dreijer wrote:> > I'm wondering what the best approach is to signal a> > thread to exit.> Just allocate a boolean variable for each thread and pass the address to> the thread starting function. The loop of the thread breaks if the flag> is reset; the thread exits. This scheme is so simple that it doesn't> even require synchronization beyond making the pointer the thread> accesses volatile.> You could use a shared_ptr to manage the memory, but personally I would> simply use a scoped_ptr in the thread's main function.> The following code is conceptual. I can't remember the exact API of> Boost.Threads.> > void thread_proc(volatile bool *flag)> {> scoped_ptr<bool> guard(flag);> while(*flag) {> // Work> }> }> > map<threadid, bool *> flags;> > void create_worker()> {> auto_ptr<bool> flag_guard(new bool(true));> thread t(bind(&thread_proc, flag_guard.get()));> // Thread is started. This ensures that it will release the memory.> bool *b = flag_guard.release();> > flags.insert(make_pair(t.get_id(), b));> }> > // Note: this function needs to synchronize if you can't ensure that it> will only be ever called once> // for any given thread id.> void signal_worker(threadid id)> {> flag_iterator i = flags.find(id);> if(i != flags.end()) {> bool *b = i->second;> flags.remove(id);> *b = false;> }> }> > You will need to synchronize map access, of course.> > Sebastian Redl> _______________________________________________> Boost-users mailing list> Boost-users(a)lists.boost.org> http://lists.boost.org/mailman/listinfo.cgi/boost-users _________________________________________________________________ Call friends with PC-to-PC calling -- FREE http://get.live.com/messenger/overview

2 1

Read-only access to boost repository via WinCVS
by alexmark 27 Dec '06

27 Dec '06

Hi! I need read-only access to boost repositiry. I've downloaded and installed WinCVS+Python but cannot open the repository. In Remote->Init Settings->CVSROOT I've checked it and entered: pserver:anonymous@boost.cvs.sourceforge.net:/cvsroot/boost and the response was: cvs -d pserver:anonymous@boost.cvs.sourceforge.net:/cvsroot/boost init cvs init: warning: unrecognized response `'ssh' is not recognized as an internal or external command, ' from cvs server cvs init: warning: unrecognized response `operable program or batch file. ' from cvs server cvs [init aborted]: end of file from server (consult above messages if any) What's wrong? TYA

4 7

graph library: finding single-pair shortest path
by Matthew Reid 27 Dec '06

27 Dec '06

2 1

Installation problems
by Yutaka Leon Suematsu 27 Dec '06

27 Dec '06

Hello Dear Boosters! Merry X'MAS and Happy New Year! I have some problems when installing the current version from cvs. I tried in Windows XP with VC++ 2003 and Python 2.5. * Command 1 C:\Source\boost>bjam -sTOOLS=vc-7_1 --with-python-version=2.5 --with- python-root=C:\Python25 --prefix="C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7" install * Result error: wrong library name 'python-version=2.5' in the --with- <library> option. ------- *Command 2 C:\Source\boost>bjam -sTOOLS=vc-7_1 --with-python-root=C:\Python25 -- with-python-version=2.5 --prefix="C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7" install *Result error: wrong library name 'python-root=C:\Python25' in the --with- <library> option. -------- * Command 3 ( Defining PYTHON_ROOT and PYTHON_VERSION) C:\Source\boost>bjam -sTOOLS=vc-7_1 --prefix="C:\Program Files \Microsoft Visual Studio .NET 2003\Vc7" install * Result The mpi module has not been initialized; MPI libraries will not be built. hint: add "using mpi ;" to user-config.jam to enable MPI support. warning: Python location is not configured warning: the Boost.Python library won't be built Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). warning: No toolsets are configured. warning: Configuring default toolset "msvc". warning: If the default is wrong, you may not be able to build C++ programs. warning: Use the "--toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult ECHO warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html -------- *** From this message, it can also be observed that even though "vc-7_1" was defined as toolset, bjam is using "msvc" I tried to install the same version in a Mac and problem is the same. Any ideas or fixes to this problem? I should notice that I am using the bjam (from source) obtained from the cvs version of boost Thank you in advance. Yutaka Leon Suematsu.

4 3

proposal of type_traits extensions
by Daniel 26 Dec '06

26 Dec '06

Hello, I am looking for set of templates which will help while working with class member pointers. I am sending my wish list so you can tell if my suggestions are worth implementing or not: - is_const_member_function_pointer<T> - true_type for const member function pointers (e.g. void (Test::*)() const) (BTW, is is possible to check this using current version of type_traits library?); - is_member_pointer_of<T, TClass> - true_type if T is member pointer of class TClass; - add_membership<T, TClass> - make T a pointer to member of class TClass; - remove_membership<T> - convert T TClass::* to T, and also similarly for member function pointers; - get_membership<T> - for member pointers, return class type; - member_traits<T> - returns class name and type of member pointers (can be obtained sepately by member_of<T> and remove_membership<T>); - member_function_traits<T> - similar to function_traits, but should also return class name and if function is const; Also I am looking for template which can change 'pointer to member function' to 'pointer to const member function' and vice-versa. Daniel

1 0

BOOST graph- shortest path which including a node set?
by Terence Wilson 26 Dec '06

26 Dec '06

What I need is a version of Dijkstra's shortest path where the path includes a specified set of nodes. Does this exist? TIA

2 3

Re: [Boost-users] Spamming through boost???
by Ovanes Markarian 24 Dec '06

24 Dec '06

Well, I googled for my name and found on the first page an entry from the boost archive at Gmane: >From: Ovanes Markarian <om_boost <at> xxx.xxx> Subject: [mpl::map] pregeneration of ... Is there smth, that I miss? With Kind Regards, Ovanes Markarian. To parse the string: <om_boost <at> xxx.xxx> is really silly and can be easily done with your regex lib. With Kind Regards, Ovanes Markarian On Thu, December 7, 2006 10:31, John Maddock wrote: > Sebastian Redl wrote: >> Ovanes Markarian wrote: >>> Now I really think, there must be email servers inbetween, which simply log the sender and put them to the spamming lists. >> We had this discussion a few months ago. >> In short, the easiest way to get at your e-mail address is to simply register with the boost list, and then have a bot listening and collecting. It's pretty much the same thing that some list archives do. You can't really prevent it, either. Unlike spammers, such >> accounts don't really make their presence known. Should all accounts that just listen and never post be banned? > > In addition the Boost mailing list is available via a newsgroup bridge, and gets archived on the web, indexed by Google etc (although I confess a Google search for your address didn't show anything up). As Sebastian has already said, these spammers are cunning folks whow really will stop at nothing to get these addresses :-( > > You > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > With Kind Regards, Ovanes Markarian

5 7

Platform independent system time in milliseconds.
by Barry Andrews 23 Dec '06

23 Dec '06

Hi Boost Users, I am attempting to use the boost library date_time to create a platform independent function to get the system time in milliseconds. Basically, I need a millisecond precision timing mechanism. I read over the docs and looked at the examples from this library and came up with something that I thought would work, but it doesn't. :( ptime time_t_epoch(date(1970,1,1)); time_zone_ptr zone(new posix_time_zone("MST-07")); local_date_time dt_epoch(time_t_epoch, zone); time_zone_ptr zone2(new posix_time_zone("MST-07")); local_date_time ldt = local_microsec_clock::local_time(zone2); time_duration diff = ldt.utc_time() - dt_epoch.utc_time(); long milli = diff.total_milliseconds(); cout << milli << endl; What I get is a negative number. The function I want should have the exact same behavior as java.lang.System.currentTimeMillis() which returns "the difference, measured in milliseconds, between the current time and midnight, January 1, 1970 UTC." Is there a way to achieve this with boost? Is so, can someone please give me some hints as to how I can do this? many thanks for your help! -B

1 0

fusion_2 won't compile one it's map examples with g++3.4.3
by David Minor 23 Dec '06

23 Dec '06

This example, from the docs, won't compile with linux g++3.4.3 typedef map< pair<int, char> , pair<double, std::string> > map_type; map_type m( make_pair<int>('X') , make_pair<double>("Men")); int main() { std::cout << at<int>(m) << std::endl; std::cout << at<double>(m) << std::endl; }

2 1

shared_ptr and
by gast128 22 Dec '06

22 Dec '06

Dear all, I just typed something like this: void Foo(void (I::*pmf)()) { boost::shared_ptr ptr(new I); (ptr->*pmf)(); } but this does not compile. Is there are rationale behind this? I have no experience in ovelroading operator->*, so maybe this question arises from ignorance. Wkr, me

2 2

[date_time] timezone rules for different years
by Stephen Turner 22 Dec '06

22 Dec '06

For my application, I need to be able to get the local time of any UTC time in the last five years in any location. As far as I can see, the date_time library doesn't provide this. The documentation says that date_time_zonespec.csv is "based on data found in the zoneinfo datebase", but whereas the zoneinfo database contains historical information about daylight saving time changes, date_time_zonespec.csv only seems to allow you to specify a single rule for each timezone. And I can't find another mechanism to do it. Am I missing something, or is this capability not present? And if not, is there any plan to add it? Or a workaround? I anticipate that this will become more of a problem when the rules for the U.S. change by several weeks next year. Thanks in advance for any tips, and Happy Christmas, -- Stephen Turner, Cambridge, UK http://homepage.ntlworld.com/adelie/stephen/ "The internet is a reflection of our society. If we do not like what we see, the problem is not to fix the mirror, we have to fix society." (Vint Cerf)

1 0

[program_options] crashes when calling po::store
by Jens Müller 21 Dec '06

21 Dec '06

[Note: I already posted this on -devel. The used CVS version of Boost is now about one week old.] I have the following program: #include <string> #include <iostream> #include <boost/program_options.hpp> namespace po = boost::program_options; int main(char argc,char** argv) { using std::string; // Kommandozeile parsen po::options_description desc("Allowed options"); desc.add_options() ("help,H", "print help message") ; po::variables_map vm; po::store(po::parse_command_line(argc, argv, desc), vm) ; po::notify(vm); if (vm.count("help")) { std::cout << desc << "\n"; return 1; } } Results when building with 1.33.1 headers and linking against 1.33.1 libs: $ cc -c -o separator2.o -g -Wall -Wno-deprecated -pipe -O -I. -I/home/jmueller/software/boost/include separator2.cpp $ cc -lboost_program_options-gcc-d -L/home/jmueller/software/boost/lib -o separator2 separator2.o $ ./separator2 $ ./separator2 --help Allowed options: -H [ --help ] print help message Results when building with CVS headers and linking against CVS libs: $ cc -c -o separator2.o -g -Wall -Wno-deprecated -pipe -O -I. -I/home/jmueller/software/boost-cvs/include separator2.cpp $ cc -lboost_program_options-gcc-d -L/home/jmueller/software/boost-cvs/lib -o separator2 separator2.o $ ./separator2 --help Segmentation fault My compiler: $ cc -v Using built-in specs. Target: i586-suse-linux Configured with: ../configure --enable-threads=posix --prefix=/usr --with-local-prefix=/usr/local --infodir=/usr/share/info --mandir=/usr/share/man --libdir=/usr/lib --libexecdir=/usr/lib --enable-languages=c,c++,objc,fortran,java,ada --enable-checking=release --with-gxx-include-dir=/usr/include/c++/4.1.0 --enable-ssp --disable-libssp --enable-java-awt=gtk --enable-gtk-cairo --disable-libjava-multilib --with-slibdir=/lib --with-system-zlib --enable-shared --enable-__cxa_atexit --enable-libstdcxx-allocator=new --without-system-libunwind --with-cpu=generic --host=i586-suse-linux Thread model: posix gcc version 4.1.0 (SUSE Linux) Has anyone an idea what's going wrong here? If you need further info, please ask.

2 4

compiling only regex library
by I.B. 21 Dec '06

21 Dec '06

Hi , i want to use boost regex++ for my project but dont want to compile all boost libraries for now, so i compiled using option: --with-regex got no errors, and result library: boost_regex-gcc-1_33_1.a copied all boost_<version>/boost headers to $HOME/include directory is like this: $HOME/include/boost/regex.hpp have a simple test.cpp file that uses: boost::regex_search(...) i compiled like this: g++ -o trun test.cpp -I/home/ig3/include -L/home/ig3/lib -lboost_regex-gcc-1_33_1 got following error: test.cpp: In function `int main(int, char**)': test.cpp:26: no matching function for call to `regex_search( __gnu_cxx::__normal_iterator<const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >&, __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, boost::cmatch&, boost::regex&)' i wonder why is that. Thought iterator is a template that shouldnt be compiled. Headers should be enough. I dont have problems compiling all boost libraries. I do understand c++ but libraries make my head heart yet. please, anyone, explain me ~igrek

2 2

Linking to boost::iostreams, frustrated.
by Bo Peng 21 Dec '06

21 Dec '06

Dear all, I have tried several hours to link to a mingw built boost_iostreams under windows without success. Out of desperation, I turned to linux where I have a boost/cvs installed. Using a very simple test program: #include <boost/iostreams/filtering_stream.hpp> #include <boost/iostreams/filter/gzip.hpp> #include <boost/iostreams/device/file.hpp> namespace io = boost::iostreams; int main(int argc, char ** argv) { io::filtering_ostream ofs; ofs.push(io::gzip_compressor()); ofs.push(io::file_sink("test.txt")); ofs << "this is a test script\n"; return(0); } And > g++ -I/usr/include/boost-1_35 -lboost_iostreams-gcc34-d test.cpp would success and run fine, but > g++ -I/usr/include/boost-1_35 -static -lboost__iostreams-gcc34-d test.cpp will generate a bunch of undefined references like: /tmp/cc2T22tx.o(.text+0x1af): In function `main': : undefined reference to `boost::iostreams::zlib::default_strategy' /tmp/cc2T22tx.o(.text+0x1c0): In function `main': : undefined reference to `boost::iostreams::zlib::deflated' /tmp/cc2T22tx.o(.text+0x1c6): In function `main': : undefined reference to `boost::iostreams::zlib::default_compression' /tmp/cc2T22tx.o(.gnu.linkonce.t._ZN5boost9iostreams21basic_gzip_compressorISaIcEEC1ERKNS0_11gzip_paramsEi+0x1e8): In function `boost::iostreams::basic_gzip_compressor<std::allocator<char> >::basic_gzip_compressor(boost::iostreams::gzip_params const&, int)': Can anyone guess what is going on? Bo

4 6

Boost.Python tutorial: not exporting inithello w/ MinGW
by Maximilian Wilson 21 Dec '06

21 Dec '06

[Re-send] I have an issue which seems to have come up earlier this year, and I was wondering if it had been resolved: http://groups.google.com/group/boost-list/browse_frm/thread/53bbf2a4e0e94e6… This is the same as my problem except I haven't verified with a manual build. When I build the tutorial example, hello.pyd doesn't appear to contain an inithello method: C:\Temp\shedskin-0.0.15>python Python 2.4.3 - Enthought Edition 1.0.0 (#69, Aug 2 2006, 12:09:59) [MSC v.1310 32 bit (Intel)] on win32 Type "help", "copyright", "credits" or "license" for more information. >>> import hello Traceback (most recent call last): File "<stdin>", line 1, in ? ImportError: dynamic module does not define init function (inithello) >>> I built the .dll and .pyd straight from the unmodified Boost.Python tutorial files, using MinGW g++ 3.4.5 and Python 2.4. Is there something I'm leaving out, or is this a bug in MinGW and/or bjam? Thanks, Max -- Be pretty if you are, be witty if you can, But be cheerful if it kills you. Everything in Windows is very simple, but the simplest thing is difficult. -Clausewitz -- Be pretty if you are, be witty if you can, But be cheerful if it kills you. Everything in Windows is very simple, but the simplest thing is difficult. -Clausewitz

2 1

interprocess exception problem
by Sunil Chomal 21 Dec '06

21 Dec '06

Dear All, I am trying to use the new "interprocess" library in Boost. I am working on a fedora core 5 machine. If I try to execute the first two sample codes given in the documents I get the following error: ********************** terminate called after throwing an instance of 'boost::interprocess::interprocess_exception' what(): Aborted ********************* Can someone help me sort this error. Regards, Sunil Chomal

2 1

boost::regex segmentation fault
by Pete Cilliers 21 Dec '06

21 Dec '06

Hi I am running boost 1.31.1 on Fedora Core 6 with gcc 4.1.1 I get the following error when using boost::regex: Program received signal SIGSEGV, Segmentation fault. 0x0015efaf in boost::object_cache<boost::re_detail::cpp_regex_traits_base<char>, boost::re_detail::cpp_regex_traits_implementation<char> >::do_get () from /opt/viamedia/dependencies/lib/boost/libboost_regex-gcc-mt-1_33_1.so.1.33.1 Here is a copy of the backtrace: (gdb) bt #0 0x0015efaf in boost::object_cache<boost::re_detail::cpp_regex_traits_base<char>, boost::re_detail::cpp_regex_traits_implementation<char> >::do_get () from /opt/viamedia/dependencies/lib/boost/libboost_regex-gcc-mt-1_33_1.so.1.33.1 #1 0x0015fbd9 in boost::object_cache<boost::re_detail::cpp_regex_traits_base<char>, boost::re_detail::cpp_regex_traits_implementation<char> >::get () from /opt/viamedia/dependencies/lib/boost/libboost_regex-gcc-mt-1_33_1.so.1.33.1 #2 0x001767f7 in boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign () from /opt/viamedia/dependencies/lib/boost/libboost_regex-gcc-mt-1_33_1.so.1.33.1 #3 0x007a0e0a in boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign ( this=0xbfd3f030, p1=0x98bff24 "database#name\"vmcrm\"\\.(.*)", p2=0x98bff3e "", f=0) at /opt/viamedia/dependencies/include/boost/regex/v4/basic_regex.hpp:254 #4 0x007a0e4f in boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign ( this=0xbfd3f030, p=0x98bff24 "database#name\"vmcrm\"\\.(.*)", f=0) at /opt/viamedia/dependencies/include/boost/regex/v4/basic_regex.hpp:239 #5 0x007a0e98 in basic_regex (this=0xbfd3f030, p=0x98bff24 "database#name\"vmcrm\"\\.(.*)", f=0) at /opt/viamedia/dependencies/include/boost/regex/v4/basic_regex.hpp:208 Any help would be much appreciated! thanks

2 1

boost::algorithm::join
by Maxim Volkov 21 Dec '06

21 Dec '06

Hi, all. Why there is no boost::algorithm::join in boost_1_33_1. There's no join.hppfile at all. But it is decribed in the documentation. So what's wrong? And where can I get a version with this algorithm?

2 2

Re: [Boost-users] [Threads-devel] Idea for a boost::barrier::scoped_wait class
by Tim Day 20 Dec '06

20 Dec '06

On Tue, 2006-12-19 at 10:40 -0500, Stuart A. Malone wrote: > However, I don't think that join_all() is an option in this case, > because I need to be inside a Mac event loop in order to receive the > messages that will launch the additional threads. Since join_all() > would block until the existing threads had completed, I would never > receive the events telling me that I needed to launch additional > threads. [Diverting to boost-users because this regards boost-threads usage, not development]. You might find the attached code interesting as an example of how things could be structured. The loop in main() spends most of it's time blocked on a getc call (which would presumably correspond to some sort of event pump in your app), but a separate thread (the "master") manages a pool of worker threads (initially 1; another one is added each time you hit return on the console). Each thread runs for 10s printing '.' every second then terminates; if the worker count reaches zero the master terminates too. To be concise the code uses volatile bools to communicate state between threads; in any sort of real code these would probably be mutex-protected structures or std::deques. The real key to the whole thing is the boost::condition, which allows the master thread to notice both keypresses from main() and completing workers. Note there's no boost::barriers to be seen. [Attached code compiles with gcc threadmaster.cpp -o threadmaster \ -g -pthread -lboost_thread -lpthread on Debian Sarge with appropriate boost packages installed]. Tim

1 0

[Graph] Python BGL memory leak (or not...)
by Hugo Ferreira 20 Dec '06

20 Dec '06

Hi, It seems I'm having a memory leak after calling dijkstra_shortest_paths several times. Either I'm wrong, or the predecessor_map is not being deleted. The call I have is something like this: p = self.graph.vertex_property_map('vertex') boost.dijkstra_shortest_paths(self.graph, self.vertexes[src], predecessor_map = p, weight_map = self.weights) Then I manipulate p to get the shortest_path between two points, and exit the function. Still, even after a gc.collect(), the memory keeps getting bigger (and because my graph has about 1 million vertexes, it gets REALLY bigger). Any thoughts on how to force the memory allocation for the predecessor_map? Thanks in advance, Hugo Ferreira -- GPG Fingerprint: B0D7 1249 447D F5BB 22C5 5B9B 078C 2615 504B 7B85

2 1

Re: [Boost-users] BOOST_ASSERT and others
by Maarten Nieber 20 Dec '06

20 Dec '06

Sorry, I should have checked! It should be: assert( 2 + 2 == 4 && "Adding numbers failed!" ) Maarten ----- Original Message ---- From: David Abrahams <dave(a)boost-consulting.com> To: boost-users(a)lists.boost.org Sent: Friday, December 15, 2006 5:19:05 PM Subject: Re: [Boost-users] BOOST_ASSERT and others Maarten Nieber <hallomaarten(a)yahoo.com> writes: > I use the trick > > assert( 2 + 2 == 4 || "Adding numbers failed!" ) > > This will probably work for BOOST_ASSERT as well. Are you sure about that || ? Looks to me like it would never fire. -- Dave Abrahams Boost Consulting www.boost-consulting.com _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

5 5

Re: [Boost-users] Problem with multi_index and shared_ptr
by johneddy101＠comcast.net 20 Dec '06

20 Dec '06

Joaquin, Thanks for the quick response and the quick fix. I inserted your new code and everything seems to be fine. Prior to inserting the code, I was doing 150,000 insertions and subsequent erasures from a container. It would always fault at some point during the erasures but exactly where was unreliable. It does not seem to fault now even if I bump it up to 1,500,000 which is very strong evidence that your solution has worked. Thanks again for the great lib, John Joaquín Mª López Muñoz ha escrito: Hello John, johneddy101 <at> comcast.net ha escrito: I'm running into a problem while using hashed indices in a container storing shared_ptr's. The problem is occuring in the hashed_index::erase(key) method in both the 1_33_1 release and the CVS head version. This is what the problem seems to be: It is possible that the call to erase (or final_erase_) occurring within the do loop causes destruction of the passed in key object. The key object (k) is then used in a comparison in the while portion of the loop (y!=x&&eq(k, key())). The default predicate uses == in this comparison but one of the items (the left hand side) will have already been destroyed. Umm... Thank you for spotting this, indeed the key passed to erase() can become invalid during the process if it physically belongs to one of the elements to be erased. Matter of fact, the problem is not specifically related to shared_ptr's. I don't know if it's too late to try to fix this on time for Boost 1.34; in case I find the time and permission to do it I'll let you know. An update on this. The following rewrite of erase(key) in hashed_index.hpp should clear the problem: size_type erase(key_param_type k) { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; size_type s=0; std::size_t buc=buckets.position(hash(k)); hashed_index_node_impl* x=buckets.at(buc); hashed_index_node_impl* y=x->next(); while(y!=x){ if(eq(k,key(node_type::from_impl(y)->value()))){ bool b; do{ hashed_index_node_impl* z=y->next(); b=z!=x&&eq( key(node_type::from_impl(y)->value()), key(node_type::from_impl(z)->value())); this->final_erase_( static_cast<final_node_type*>(node_type::from_impl(y))); y=z; ++s; }while(b); break; } y=y->next(); } return s; } Would you mind pasting this into your local copy of hashed_index.hpp (CVS version) and report whether your prior problems get solved? I'm writing a testcase for the issue and running my entire regression tests, if everything goes OK I think I'll be able to commit this into the CVS before the week ends. Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

lambda parse tree access
by Sascha Krissler 20 Dec '06

20 Dec '06

Hello, i am writing a multiple dispatch framework and as i am feeling scientific i am gonna try to add a predicate dispatch fearure to it. For that i need to build big nested expression template instances that represent the predicates, so that i cant evaluate them at the time of method invocation. As an additional feature i want to sort the predicates for specifity (one predicate is true at a subset of cases of another predicate and is as such more specific) and for that i need access to the parse tree of a lambda expression. Is there documentation available on this topic and does lambda have a public interface for that? Does it make sense to use lambda as a library for writing expression template algorithms? Thanks in advance

5 6

Re: [Boost-users] Problem with multi_index and shared_ptr
by Joaquín Mª López Muñoz 20 Dec '06

20 Dec '06

Hello John, johneddy101(a)comcast.net ha escrito: > I'm running into a problem while using hashed indices in a container > storing shared_ptr's. > The problem is occuring in the hashed_index::erase(key) method in both > the 1_33_1 > release and the CVS head version. This is what the problem seems to > be: > > It is possible that the call to erase (or final_erase_) occurring > within the do loop > causes destruction of the passed in key object. The key object (k) is > then used in a > comparison in the while portion of the loop (y!=x&&eq(k, key())). The > default predicate uses > == in this comparison but one of the items (the left hand side) will > have already been destroyed. Umm... Thank you for spotting this, indeed the key passed to erase() can become invalid during the process if it physically belongs to one of the elements to be erased. Matter of fact, the problem is not specifically related to shared_ptr's. I don't know if it's too late to try to fix this on time for Boost 1.34; in case I find the time and permission to do it I'll let you know. > I'm afraid that I don't know a good solution to this problem. I see > from your commit > logs on this file that there is a problem using something like is done > in the ordered_indices > (deleting equal_range items) whereby it increases the complexity. I > can see from the > implementation of equal_range on hashed indices that this is a > potentially expensive > operation for non-unique collections with many collisions. However, > since speed is a > secondary consideration for me, this is the solution I'm using for > now. > Do you mean that instead of c.erase(k); you do the following? std::pair<iterator,iterator> p=c.equal_range(k); c.erase(p.first,p.second); This is a viable solution. The potential performance problem you point out is actually present in both methods. On the other hand, the different problem I talk about in the commit logs only affects to erase(first,last), not erase(k), and is exposed here: http://open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2023.pdf An alternative solution is to do the following: c.erase(key_type(k)); i.e. doing an external copy of the key before calling erase(k). This is the solution I'd use if your keys are cheap to copy. > Thanks, > > John Thank you for reporting, good luck with your project. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 1

[boost.multiindex] Recommended way of having a list of keys to a multi-index container
by Charles Tolman 20 Dec '06

20 Dec '06

Hi, Boost newbie question regarding indexing of multi_index_containers. First a great big thank you to Joaquín M López Muñoz for sorting this library out. Lovely job. OK I have a question about indexing. Probably one for Joaquin. I have a structure that can be indexed on the following keys: 0: identity -- unique - this is fine. 1: int position; -- non_unique - this is fine. 2: int priority; -- non_unique - this is also fine. 3: vector<MyStringType> -- non_unique - but NOT fine. So number 3 is the problem. Am I right in thinking that the multi_index_container does not handle this case? i.e. where you would want a given SINGLE element to be indexed on a variable (unknown) number of keys, in this case as many strings as are in the vector. Although strictly they are not actually separate keys, there is just one non-unique key, but a given element can have multiple instances for this one key. Of course I can workaround this by having another structure to handle this or alternatively wrap up the element a multiple number of times, as many as required by the length of the vector of strings. But I was wondering if there are any ways of handling this in the basic library. Apologies if I have missed something and it is in an FAQ somewhere, although I have done an initial search. TIA Charles Tolman

2 2

[Serialization] Boost 1.33 serialization const problem
by vermaaso 20 Dec '06

20 Dec '06

Hello list, currently I am trying to get serialization to work. It worked well when I was using boost 1.32, but since I upgraded to 1.33 I'm having some problems. In short; I have an abstract base class and a derived class. I try to serialize/deserialize the derived class through a pointer to the base class. This worked well when I was using 1.32. When I upgraded to 1.33 I got the static assert which trapped the 'saving non const error' (I hope this makes sense ..). So I fixed it by following instructions from other posts dealing with the same problem (basically just by changing 'base *b' to 'const base * const b'). The fix resolved the compile error, only now I'm getting a segfault at runtime. The segfault happens during deserialization (when trying to 'reconstruct' the original object). The funny thing is, I've tested it on a system (suse enterprise system 9, gcc 3.3.3) and it chrashes. On another system (gcc version 4.0.3 (Ubuntu 4.0.3-1ubuntu5)) it works fine. I reproduced the problem in a very small program located at the end of this post. Maybe someone can have a look at the code and tell me whether there are obvious problems with my code or not. If I know for sure that my code should run correctly, I'll just move on to an other linux distro .. Thanks in advance, Oscar #include<boost/archive/text_oarchive.hpp> #include<boost/archive/text_iarchive.hpp> #include<boost/serialization/base_object.hpp> #include<boost/serialization/export.hpp> #include<iostream> #include<sstream> using namespace std; class base { public: virtual void do_it() const = 0; private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int){ cout << "serializing base" << endl; } }; class derived: public base { public: derived(int field1, string field2){ _field1 = field1; _field2 = field2; } virtual void do_it() const { cout << "doing it with " << _field1 << " and " << _field2 << endl; } private: friend class boost::serialization::access; derived(){}; virtual ~derived(){}; template<class Archive> void serialize(Archive & ar, const unsigned int){ cout << "derived being serialized" << endl; ar & boost::serialization::base_object<base>(*this); ar & _field1; ar & _field2; } int _field1; string _field2; }; BOOST_IS_ABSTRACT(base); BOOST_CLASS_EXPORT(derived); string serialize(const base * const b){ stringstream str; boost::archive::text_oarchive oa(str); oa << b; return str.str(); } base *deserialize(string s){ stringstream str(s); base *b; boost::archive::text_iarchive ia(str); ia >> b; return b; } int main(){ base *d1 = new derived(52,"a string"); d1->do_it(); string serialized = serialize(d1); base *d2 = deserialize(serialized); d2->do_it(); return 0; }

2 10

signals and threads
by Noah Roberts 20 Dec '06

20 Dec '06

The boost::signals library faq says that the library is not thread safe and is in fact dangerous. Does anyone know why? What are the implications of using the signals library in a threaded environment? Would I be better off implementing an event or observer architecture with boost::function instead? thanks

1 0

ptr_container: ptr_map.insert() not compiling?
by Duane Murphy 19 Dec '06

19 Dec '06

I'm trying to use boost::ptr_map<> and cannot get calls insert to compile. I'm on Mac OS X using gcc 3.3 with Xcode. Even the most basic code fails to compile: boost::ptr_map< in, int* > my_map; int * val = new int( 22 ); my_map.insert( 1, val ); This fails with: error: no matching function for call to `boost::ptr_map<int, int*, std::less<int>, boost::heap_clone_allocator, std::allocator<std::pair<const int, void*> > >::insert(int, int*&)' error: candidates are: std::pair<typename boost::ptr_container_detail::ptr_map_adapter_base<T, VoidPtrMap, CloneAllocator>::iterator, bool> boost::ptr_map_adapter<T, VoidPtrMap, CloneAllocator>::insert(typename boos t::ptr_container_detail::ptr_map_adapter_base<T, VoidPtrMap, CloneAllocator>::key_type&, typename boost::ptr_container_detail::ptr_map_adapter_base<T, VoidPtrMap, CloneAllocator>::value_type) [with T = int*, VoidPtrMap = std::map<int, void*, std::less<int>, std::allocator<std::pair<const int, void*> > >, CloneAllocator = boost::heap_clone_allocator] This looks like it's recommending the function that should be working. I've been poking at this for quite a while and cannot find a clue why this is not working. Thank you for the help, ...Duane ...Duane

4 6

[variant] make_recursive_variant and std::map
by Richard Crossley 19 Dec '06

19 Dec '06

I would like to be able to use a recursive variant similar to the way it's shown in the documentation but using a std::map instead of std::vector. i.e. boost::make_recursive_variant< int,std::map<float,boost::recursive_variant_> >::type var; Is there a way to do this? VC8.1 complains with: utility(54) : error C2079: 'std::pair<_Ty1,_Ty2>::second' uses undefined struct 'boost::recursive_variant_' with [ _Ty1=const float, _Ty2=boost::recursive_variant_ ] Regards, Richard.

2 2

Problem with multi_index and shared_ptr
by johneddy101＠comcast.net 19 Dec '06

19 Dec '06

I'm running into a problem while using hashed indices in a container storing shared_ptr's. The problem is occuring in the hashed_index::erase(key) method in both the 1_33_1 release and the CVS head version. This is what the problem seems to be: It is possible that the call to erase (or final_erase_) occurring within the do loop causes destruction of the passed in key object. The key object (k) is then used in a comparison in the while portion of the loop (y!=x&&eq(k, key())). The default predicate uses == in this comparison but one of the items (the left hand side) will have already been destroyed. I'm afraid that I don't know a good solution to this problem. I see from your commit logs on this file that there is a problem using something like is done in the ordered_indices (deleting equal_range items) whereby it increases the complexity. I can see from the implementation of equal_range on hashed indices that this is a potentially expensive operation for non-unique collections with many collisions. However, since speed is a secondary consideration for me, this is the solution I'm using for now. Thanks, John

1 0

Re: [Boost-users] Boost Serialization make_binary & XML/ASCII
by Javier Estrada 19 Dec '06

19 Dec '06

Terence, We use Spirit in a similar way to SAX: we read binary data from a serial port, assemble it into discrete units (messages) and push them through parser generated by Spirit, which in turn calls a function upon finding a match. Some of our messages are multi-part, so we need to keep some form of state that allows us to assemble the final message. I would imagine that there would be a way to break from the parsing. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Terence Wilson Sent: Saturday, December 09, 2006 2:55 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Boost Serialization make_binary & XML/ASCII Robert, XML is normally parsed using a DOM or SAX parser. DOM reads the whole file into memory, SAX behaves like a recursive descent parser with callbacks to the client application. By placing the data block at the start of the file I should be able to get good performance from SAX or Spirit. Both would be good choices, however, I want to write some 'reference' code using standard tools since my work will be part of an SDK. Regards, Terence > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Robert Ramey > Sent: Saturday, December 09, 2006 2:10 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Boost Serialization make_binary & XML/ASCII > > Well, now I'm out of my depth. Some have commented that the spirit > parser is slower than other xml parsers.I don't know. I would have > hoped that since spirit does a lot of the heavy lifting at compile > time, it would be pretty fast. I haven't seen too much data on this so I really don't know. > Any parser has to scan every character in the file so its not clear to > me that a SAX parser or any other can be know a priore to be faster > than any other one. > > My reason for using spirit was > > a) it was already part of boost > b) it was - after some learning curve - a good fit with what I wanted > to do. > c) well documented. > d) customizable - serialization only uses a portion of the full xml so > it seemed the most efficient. > e) all done at compile time so it wouldn't include dead code. > f) portability to all compilers boost supports. > g) By exercising a little care in code organization I was able to > arrange things so that the module containing the parsing didn't depend > on the rest of the program. So the long compile time is not an issue. > It is in the library and is only recompiled when the grammar changes. > > It is the last feature that suggests that you can easily use this to > do your own actions upon parsing the serialization library. > > After some initial pain figuring out how to use it, I have to say I > have been extremely pleased with this application of spirit. I never > wanted to do xml serialization as I felt it was a pain in the neck and > of relatively little utility in my view. I had anticipated a > maintainence nightmare so more and more obscure corners of xml syntax > were touched. I'm pleased to say this thing has been fantastic as far > as I'm concerned. After the intial one time pain - I haven't had to > touch it since 2002 - and this (through spirt 1.6x - still available) > is still compatible with Borland 5.51. And all the hacks required to > make this so portable are only compiled into the platforms that need > them. > > This has been one of the most significant implementations in making > the serialization library possible. (the other one would probably be mpl). > > So if this were my problem I would: > > a) Include the xml grammar and parser from the serialization library - > add my own actions. > b) finish my code. Really this I would expect it would be 100 lines. > c) If its too slow - and if profiling suggests that the spirit parser > is the bottleneck - then I would look at tweaking the grammar to speed > up parsing or replacing the spirit parser with a faster one. This is > my rule: "First make it work ASAP - then make it faster if necessary" > > But I already am somewhat familiar with spirit so it might not be an > interesting option for you. But then yo might be able to use the > current parser unchanged. Of course this would bring the huge benefit > that if the xml_archive parser is tweaked for some reason (there are a > couple of issues with special characters), you would automatically > inherit these changes and still be in sync. > > I made the choice to invest the effort to figure out spirit rather > than write my 10,000th file parser. Of course that was my decision and > may not be everyone's preference. > > > Good Luck > > Terence Wilson wrote: > > Robert, > > > > The utility I am writing needs to be able to extract a small portion > > from a large XML file generated by your library. Since it is > > performance sensitive I chose to use a SAX parser in order to avoid > > reading the whole file. Would it be much work to do this with the > > Spirit parser? > > > > As always, thanks for the super-fast response. > > > > Best regards, > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[Boost.thread] Desire to check mutex locked state for debug builds
by Kai Brüning 19 Dec '06

19 Dec '06

Hi, I am new to this list, although not completely new to using Boost. When working with mutexes and locks, it is common to have functions which are part of critical sections but do not lock themselves. A typical example for this is the thread safe interface design pattern, which moves all locking to the publicly available interface functions of a class and all implementation to internal functions which expect to be called with a lock in effect. I would feel much more confident if I could check "expect to be called with a lock in effect" in debug builds. That is, if I could test whether a mutex is locked for a specific thread (in my case, "current thread" would suffice). Especially if some functions need locking and others don't and the goal is to minimize locking for performance's sake, pure convention and documentation without runtime checks seems to me dangerously error prone. Is there any way to do this test which I overlooked? Is my desire sensible? Or are there other/better ways to make sure necessary locking is done? Best regards, Kai Brüning -- RagTime GmbH Tel: [49] (2103) 9657-0 Neustraße 69 Fax: [49] (2103) 9657-96 D-40721 Hilden mailto:kai@RagTime.de Deutschland http://www.RagTime.de/

1 0

Re: [Boost-users] format: show uint8_t as a number, not a char?
by Phil Endecott 19 Dec '06

19 Dec '06

>> This does what I want: >> >> uint8_t i = 65; >> printf("i = %d\n",i); [snip] >> uint8_t i = 65; >> cout << boost::format("i = %d\n") % i; >> >> But it seems to have the same, unwanted, behaviour as cout<<i. [snip] >> At the moment I have to write things like >> >> cout << "i = " << static_cast<unsigned int>(i) << "\n";> > You can just cast the value to an int Yes, as I mentioned towards the end of my message. But I find that obfuscated. It's particularly problematic when the value is a field in a struct whose type I don't exactly remember, and I forget the need to cast it; the result is control characters being written to the terminal, which can be hard to debug. Surely, since I have asked for %d in the format string, format() can do the cast? i.e. something like (PSEUDOCODE) template <typename T> operator%(T val) { .... if (format_char='d') int val1 = static_cast<int>(val) ... } or have I missed some additional complexity? Phil.

3 2

format: show uint8_t as a number, not a char?
by Phil Endecott 18 Dec '06

18 Dec '06

Dear All, This does what I want: uint8_t i = 65; printf("i = %d\n",i); It prints "65". This doesn't: uint8_t i = 65; cout << "i = " << i << "\n"; It treats i as a char, since uint8_t is a typedef for char deep in some header file somewhere, and prints "A". I was hoping that boost::format would do what I wanted: uint8_t i = 65; cout << boost::format("i = %d\n") % i; But it seems to have the same, unwanted, behaviour as cout<<i. Is there anything that I can do to my code to get the effect that I want? If not, is there anything that can be changed in boost::format to make it do what I want? At the moment I have to write things like cout << "i = " << static_cast<unsigned int>(i) << "\n"; which is a lot of typing and obfuscates what is actually going on. Any suggestions would be much appreciated. Cheers, Phil.

2 1

vertex descriptors
by Luis Quesada 18 Dec '06

18 Dec '06

Dear all, Sorry for the newbie question! Given the index of a vertex, how can I get its descriptor? I guess function vertex (page 225 of The Boost Graph Library) does that but the function is not defined. In fact, what I want to do is to check whether an edge belongs to a graph in a context where descriptors get invalidated after vertex removals? Suppose I have done this: // create a typedef for the Graph type typedef adjacency_list<vecS, vecS, bidirectionalS> Graph; // Make convenient labels for the vertices enum { A, B, C, D, E, N }; const int num_vertices = N; const char* name = "ABCDE"; // writing out the edges in the graph typedef std::pair<int, int> Edge; Edge edge_array[] = { Edge(A,B), Edge(A,D), Edge(C,A), Edge(D,C), Edge(C,E), Edge(B,D), Edge(D,E) }; const int num_edges = sizeof(edge_array)/sizeof(edge_array[0]); // declare a graph object Graph g(num_vertices); Then I remove some vertices. Now I want to check whether edge <A,B> is still there. Calling edge(A,B,g) would not be OK because the descriptors are no longer referring to the same vertices.... Thanks in advance for your answer, Luis

6 15

[GIL] Add a constant value to an image
by Sylvain Berlemont 18 Dec '06

18 Dec '06

Hi, I would like to know what is the most readable way to write in GIL: Y = X + t, where X, Y are 2 gray32f images and t is a bits32f constant value. Best regards, Sylvain

1 0

[Announce] Mailing list outage on December 19th
by Doug Gregor 18 Dec '06

18 Dec '06

Due to a scheduled power outage at Indiana University, all of the Boost mailing lists hosted at lists.boost.org will be unavailable at the following times on December 19th, 2006: - 5:00am-9:00am Pacific US time - 6:00am-10:00am Mountain US time - 7:00am-11:00am Central US time - 8:00am-12:00pm (Noon) Indiana time - 8:00am-12:00pm (Noon) Eastern US time - 1:00pm-5:00pm GMT Doug Gregor Open Systems Lab @ Indiana University

1 0

Re: [Boost-users] BOOST_ASSERT and others
by james.jones＠firstinvestors.com 18 Dec '06

18 Dec '06

From: Sebastian Redl <sebastian.redl(a)getdesigned.at> > Maarten Nieber wrote: > > Sorry, I should have checked! > > It should be: > > > > assert( 2 + 2 == 4 && "Adding numbers failed!" ) > > That still won't fire. The concept is flawed. You cannot use assert()s > to print debug messages, because when an assert() prints a message, it > also stops the program. Why won't it fire? Let's say I normally would do this: assert( statement ); If I do this instead: assert( statement && "Statement that 2 + 2 == 4 failed" ); then if "statement" is false, the argument of assert() is false so it fires, and (more importantly), the whole argument, including the diagnostic "Statement that 2 + 2 == 4 failed" is output. Am I missing something? This seems like a clever idea to me (a bit limited, maybe, but useful for prototyping if nothing else). - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

1 0

How get file attributes in boost::filesystem ?
by sidle 18 Dec '06

18 Dec '06

How get file attributes in boost::filesystem ?

2 1

mpl::for_each documentation
by Jens Müller 17 Dec '06

17 Dec '06

Where can I find documentation for mpl::for_each? It's no listed in http://www.boost.org/libs/mpl/doc/refmanual/refmanual_toc.html I'm trying to understand what's going on in graph-tool's graphml-hpp in mutate_graph_impl::set_*_property ...

2 2

building boost-python under cvs (python v2.5)
by craigp 17 Dec '06

17 Dec '06

is there a way to get boost-python (cvs HEAD) built for python v2.5? i can't even seem to specify the library on the command line: >bjam --with-python-root=c:\python25 error: wrong library name 'python-root=c:\python25' in the --with-<library> option. i noticed there was a TODO for getting the python options in the jamfile... is there a work-around for now? thanks, --craig __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

serializing enums (and arrays)
by craigp 17 Dec '06

17 Dec '06

I can't figure out how to override serializating enums (and arrays) - without hacking the source code, that is. save_enum_type is defined in boost/archive/detail/oserializer.hpp, and converts them into ints (btw, would longs be safer?). I tried defining a serialize function and specifying the implementation level to object_serializable, but that didn't work (and given how it's defined and used, there seems to be no way of overriding via template specialization). Perhaps save_enum_type and save_array_type could be put into a separate header (out of the archive/detail and maybe into boost/serialization along with vector.hpp, etc)? BTW, thanks for the great library! --craig ____________________________________________________________________________________ Any questions? Get answers on any topic at www.Answers.yahoo.com. Try it now.

3 4

CircularBuffer from the boost-sandbox
by Luca Cappa 17 Dec '06

17 Dec '06

Hi all, I would like to use the circularbuffer class provided by boost-sandbox, and I would like if someone could tell me which are the rules to include the boost-sandbox files (either the .cpp and the .h) in my building process, i.e. should I copy only the relevant files into the actual boost installation directory, or anything else? Greetings, Luca

3 2

Good guide for using Boost with Visual Studio 2005?
by Laran Evans 16 Dec '06

16 Dec '06

I'm an admitted C++ novice, definitely a VS novice. thanks

2 1

atomic_count default constructor
by Clark S. Cox III 16 Dec '06

16 Dec '06

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 A couple of questions: Is there any rational behind the fact that boost::detail::atomic_count doesn't have a default constructor? For what reason is atomic_count an implementation detail, and not available for general use? (i.e. why is it in boost::detail, and not boost::) - -- Clark S. Cox III clarkcox3(a)gmail.com -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (Darwin) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFFgxMRXkPInUR5a8wRApfMAJoCiK/xH7K0u2GZnn3QoEk42bqznwCfQ9r0 s60aQuCL2IC1CB1Xi5uhBqQ= =roHz -----END PGP SIGNATURE-----

2 2

Problems installing: "spawn: No such file or directory"
by Laran Evans 16 Dec '06

16 Dec '06

I've got Python 2.5 installed, PYTHON_ROOT is set to C:\Python25 and PYTHON_VERSION is set to 2.5. I manually created C:\Boost, C:\Boost\lib and C:\Boost\include. I get the error output below when I try to build. How do I get past these? --- C:\Documents and Settings\Me\Desktop\boost_1_33_1>vcvars32 C:\Documents and Settings\Me\Desktop\boost_1_33_1>"C:\Program Files\Mic rosoft Visual Studio 8\Common7\Tools\vsvars32.bat" Setting environment for using Microsoft Visual Studio 2005 x86 tools. C:\Documents and Settings\Me\Desktop\boost_1_33_1>bjam "-sTOOLS=vc-8_0" install ****************************************************** Building Boost.Iostreams with bzip2 support disabled. To enable bzip2, consult the Boost.Iostreams documentation ****************************************************** ****************************************************** Building Boost.Iostreams with zlib and gzip support disabled. To enable zlib and gzip, consult the Boost.Iostreams documentation ****************************************************** Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). ...patience... ...patience... ...found 13373 targets... ...updating 4938 targets... MkDir1 bin spawn: No such file or directory C:\Documents and Settings\Me\Desktop\boost_1_33_1>

3 2

Tuple how to get the TYPE of the n-th element?
by Seweryn Habdank-Wojewódzki 16 Dec '06

16 Dec '06

Hi I working with tuples, and that tuples are constructed by K elements. For me interesting are 1-st, 2-nd and 3-rd. 0-th and others not. Inside my procedure I want to know what are the types on the positions 1, 2, 3. How can I get them? The example: somewhere in the code: typedef tuple < std::string, double, double, double, int, std::string > Foo; typedef tuple < std::string, long double, long double, long double, long , std::map<int,std::string> > Bar; My part: template < typename Tuple > // somethink like: typename Tuple::get_type<1> calculate ( Tuple & t ) { // here I need for some calculations know what are the types // on the positions 1,2,3? }; And proposition of usage: calculate ( /*Foo*/ foo ); calculate ( /*Bar*/ bar ); Best regards, -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/'

2 2

boost/regex How do i link/(create libs) with xlC on aix
by Rick Weiss 16 Dec '06

16 Dec '06

I dont mind using g++ to compile but all of our aix libs are created(and compiled for that matter) with xlC. And I cant seem to use g++ for linking to the xlC linked libs. So i guess I need one of two solutions: 1) make regex libs with xlC OR 2) learn how to link to several (so) libs created with g++ and xlC. Any help is appreciated. Thanks Rick Weiss

2 1

shared_ptr reference conversion and const oddity
by Brian Hassink 15 Dec '06

15 Dec '06

Here's the test case... class A { public: A() {} virtual ~A() {} }; class B : public A { public: B() {} }; class X1 { public: X1(const boost::shared_ptr<A>& a) {} virtual ~X1() {} }; class Y1 : public X1 { public: Y1(const boost::shared_ptr& b) : X1(b) {} }; class X2 { public: X2(boost::shared_ptr<A>& a) {} virtual ~X2() {} }; class Y2 : public X2 { public: Y2(boost::shared_ptr& b) : X2(b) {} }; int main(int argc, char** argv) { boost::shared_ptr b(new B()); Y1 y1(b); // ptr const in constructor, compiler ok Y2 y2(b); // ptr not const in constructor, compiler not ok } My question is why conversion of the shared_ptr reference does not work if it is not declared const? Here's the compiler error (gcc 3.4.4 - cygming special)... compiling main.cpp... main.cpp: In constructor `Y2::Y2(boost::shared_ptr&)': main.cpp:31: error: no matching function for call to `X2::X2(boost::shared_ptr&)' main.cpp:23: note: candidates are: X2::X2(const X2&) main.cpp:25: note: X2::X2(boost::shared_ptr<A>&) make: *** [obj/main.o] Error 1 Thanks, Brian

2 1

[graph] leda_graph.hpp and LEDA 5.0.1
by Jens Müller 15 Dec '06

15 Dec '06

The example doesn't work with LEDA 5.0.1 any longer: C++ topo-sort-with-leda.o topo-sort-with-leda.cpp: In function `int main()': topo-sort-with-leda.cpp:14: error: expected init-declarator before '<' token topo-sort-with-leda.cpp:14: error: expected `,' or `;' before '<' token topo-sort-with-leda.cpp:15: error: `graph_t' undeclared (first use this function) topo-sort-with-leda.cpp:15: error: (Each undeclared identifier is reported only once for each function it appears in.) topo-sort-with-leda.cpp:15: error: expected `;' before "leda_g" [Many more errors follow] Compiler is g++ 4.1.0. Has anyone made LEDA 5.0.1 work with a BGL wrapper?

2 2

[BGL] Max (min) cycle ratio
by Dmitry 15 Dec '06

15 Dec '06

Dear all, For a some time I've been using my own implementation for calculating of the minimum cycle ratio of the directed multigraph, it based on the approach described in the paper "Numerical Computation of Spectral Elements in MAX-PLUS algebra" and seems has complexity close to linear in the respect of the edges number (both in memory and time). Does current BGL has some solutions for cycle ratio problem? I would like to try to contribute my "perfect" implementation to BGL if it's possible. What is need to be done for it? WBR, Dima.

2 1

Re: [Boost-users] BOOST_ASSERT and others
by Maarten Nieber 15 Dec '06

15 Dec '06

I use the trick assert( 2 + 2 == 4 || "Adding numbers failed!" ) This will probably work for BOOST_ASSERT as well. Kind regards Maarten ----- Original Message ---- From: Gennadiy Rozental <gennadiy.rozental(a)thomson.com> To: boost-users(a)lists.boost.org Sent: Thursday, December 14, 2006 4:03:15 PM Subject: Re: [Boost-users] BOOST_ASSERT and others "abir basak" <abirbasak(a)gmail.com> wrote in message news:elr59r$sho$1@sea.gmane.org... > > Hi, > Hi, if any assert is there like BOOST_ASSERT or assert where I can > pass a custom message to print on assert failure ? > i.e. something like > BOOST_ASSERT(condition, message) > > Also, is there any debug print version for boost? > Something like, I want a message should be printed only when the > application is running in DEBUG version (whatever flag the system > provides for that). > The message can be cout or printf kind of thing. A little safety is > better sometimes like debug print can't change the value of the variable > etc. > Thanks Google for smart_assert. There was one by john torjo. Gennadiy _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Computing a path while traversing a graph with a search algorithm
by Roger Leigh 15 Dec '06

15 Dec '06

Hi folks, I've written a program which makes use of the Boost Graph library to construct a graph. I've then attached properties to both the vertices and edges, giving a result like this: http://www-users.york.ac.uk/~rl522/test.pdf However, I want to now search the graph in order to do this: 1. When the edge is the last, i.e. the outdegree of the target is 0: 2. Total the edge values for all the edges followed to get here all the way back to the root, and add 19. 3. If this total is the same value as the root node value, set a particular property on each vertex those edges are connected to. I've tried a depth_first_search using a Visitor. I wanted to push each edge onto a temporary vector as I found it, and then pop it when the algorithm backtracked, but this doesn't work. The aim here was to know the path taken to get to a particular edge when that edge was found. I'm completely new to using graphs (I'm actually a Biologist), and I think I'm missing how I should really be using the depth_first_search or breadth_first_search visitors to do what I need. It also doesn't appear to like me using the visitor to alter the properties on the vertices or edges during the search. Is this allowed? I'm not altering the graph, just wanting to set a few property values (internally stored, in this case). I would be very grateful for any ideas or suggestions for approaching this problem. Many thanks, Roger Leigh PS. This is the visitor I wrote, but this appears to be completely wrong. The full source is at http://www-users.york.ac.uk/~rl522/massgraph-0.1.0.tar.gz (ms_analysis.cc|h). class peak_visitor : public boost::default_dfs_visitor { public: peak_visitor(double target_mass, ms_analysis::vertex_set& vs, std::vector<ms_analysis::edge_stack>& v): target_mass(target_mass), vs(vs), v(v), s() {} template < typename Edge, typename Graph > void tree_edge(Edge e, Graph & g) { s.push_back(e); double smass = 0.0; for (ms_analysis::edge_stack::const_iterator pos = s.begin(); pos != s.end(); ++pos) { smass += g[*pos].aa_data.get_distance(); std::cout << g[*pos].aa_data.get_distance() << '\t'; } std::cout << std::endl; smass += 19.0; std::cout << "T=" << target_mass << ", S=" << smass << std::endl; if (smass > target_mass - 0.5 && smass <= target_mass + 0.5) { for (ms_analysis::edge_stack::const_iterator pos2 = s.begin(); pos2 != s.end(); ++pos2) { ms_analysis::graph::vertex_descriptor v1, v2; v1 = source(e, g); v2 = target(e, g); // Setting properties fails to compile. //g[v1].valid = true; //g[v2].valid = true; vs.insert(v1); vs.insert(v2); } } v.push_back(s); } } template < typename Edge, typename Graph > void back_edge(Edge e, const Graph & g) { // This is *never* called. std::cout << "BACK" << std::endl; s.pop_back(); } double target_mass; ms_analysis::vertex_set vs; std::vector<ms_analysis::edge_stack>& v; ms_analysis::edge_stack s; }; -- .''`. Roger Leigh : :' : Debian GNU/Linux http://people.debian.org/~rleigh/ `. `' Printing on GNU/Linux? http://gutenprint.sourceforge.net/ `- GPG Public Key: 0x25BFB848 Please GPG sign your mail.

2 1

The fibonacci heap is behaving strange
by Magnus Ekdahl 15 Dec '06

15 Dec '06

Hi, I put in 0,1,2,3,4 into a Fibonacci heap, manipulate some and get 0,2,4,1,25 back. With the relaxed heap I get 0,2,4,1,3 back, which is as expected with my code. AFAIK this is due to a bug in the Fibonacci heap? Anyway here is code adopted from the cvs (fibonacci_heap.cpp) that reproduces the result on two different machines (intel/amd), where the programs are compiled using g++ 4.0.4. Any help in clearing out this confusing result is appreciated :) #include <iostream> #include <cstdlib> #include <vector> #include <boost/pending/Fibonacci_heap.hpp> #include <boost/pending/relaxed_heap.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/pending/indirect_cmp.hpp> using namespace std; using namespace boost; int main(int argc, char *argv[]) { typedef indirect_cmp<unsigned*,std::less<unsigned> > ICmp; unsigned current; const unsigned N=5; vector<unsigned> w(N); ICmp cmp(&w[0], std::less<unsigned>()); Fibonacci_heap<unsigned, ICmp> Q(N, cmp); //relaxed_heap<unsigned, ICmp> Q(N, cmp); Q.push(0); current=Q.top(); cout << current << " "; Q.pop(); w[1]=180428938; Q.push(1); w[2]=84693088; Q.push(2); w[3]=168169277; Q.push(3); w[4]=171463691; Q.push(4); current = Q.top(); cout << current << " "; Q.pop(); w[3]=164976049; Q.update(3); w[4]=59651664; Q.update(4); current = Q.top(); cout << current << " "; Q.pop(); w[1]=71988538; Q.update(1); w[3]=118964142; Q.update(3); current = Q.top(); cout << current << " "; Q.pop(); w[3]=42423833; Q.update(3); current = Q.top(); cout << current << " "; Q.pop(); return EXIT_SUCCESS; }

4 5