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

building errors, ( shared_ptr.hpp:253: undefined reference to `AcceptEx@32' )
by sfinks 23 Nov '06

23 Nov '06

Hi. I'm trying to build libtorrent ( http://libtorrent.sf.net ) on xp+mingw+msys and I get some errors regarding boost. Hopefully someone can help.. Sorry if its not much of a boost problem.... I've attached compiler output text as as .txt file... ~/E/libtorrent-0.11 $ make make all-recursive make[1]: Entering directory `/home/devel/E/libtorrent-0.11' Making all in include make[2]: Entering directory `/home/devel/E/libtorrent-0.11/include' make[2]: Nothing to be done for `all'. make[2]: Leaving directory `/home/devel/E/libtorrent-0.11/include' Making all in zlib make[2]: Entering directory `/home/devel/E/libtorrent-0.11/zlib' make[2]: Nothing to be done for `all'. make[2]: Leaving directory `/home/devel/E/libtorrent-0.11/zlib' Making all in src make[2]: Entering directory `/home/devel/E/libtorrent-0.11/src' make[2]: Nothing to be done for `all'. make[2]: Leaving directory `/home/devel/E/libtorrent-0.11/src' Making all in test make[2]: Entering directory `/home/devel/E/libtorrent-0.11/test' /bin/sh ../libtool --tag=CXX --mode=link g++ -ftemplate-depth-50 -I../include -I../include/libtorrent -g -g -O2 -lboost_date_time -lboost_filesystem -lboost_thread -L/boost/lib -o test_piece_picker.exe main.o test_piece_picker.o ../src/libtorrent.la -lws2_32 g++ -ftemplate-depth-50 -I../include -I../include/libtorrent -g -g -O2 -o test_piece_picker.exe main.o test_piece_picker.o -L/boost/lib ../src/.libs/libtorrent.a -lboost_date_time -lboost_filesystem -lboost_thread -lws2_32 ../src/.libs/libtorrent.a(session_impl.o)(.text$_ZN4asio6detail23win_iocp_socket_serviceINS_2ip3tcpEE12async_acceptINS_12basic_socketIS3_NS_21stream_socket_serviceIS3_EEEEN5boost3_bi6bind_tIvNSA_4_mfi3mf3IvN10libtorrent3aux12session_implERKNSA_10shared_ptrINS_19basic_stream_socketIS3_S8_EEEERKNSA_8weak_ptrINS_21basic_socket_acceptorIS3_NS_23socket_acceptor_serviceIS3_EEEEEERKNS_5errorEEENSB_5list4INSB_5valueIPSH_EENS11_ISL_EENS11_IST_EENSA_3argILi1EEEEEEEEEvRNS4_19implementation_typeERT_T0_[void asio::detail::win_iocp_socket_service<asio::ip::tcp>::async_accept<asio::basic_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> >, boost::_bi::bind_t<void, boost::_mfi::mf3<void, libtorrent::aux::session_impl, boost::shared_ptr<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> > > const&, boost::weak_ptr<asio::basic_socket_acceptor<asio::ip::tcp, asio::socket_acceptor_service<asio::ip::tcp> > > const&, asio::error const&>, boost::_bi::list4<boost::_bi::value<libtorrent::aux::session_impl*>, boost::_bi::value<boost::shared_ptr<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> > > >, boost::_bi::value<boost::weak_ptr<asio::basic_socket_acceptor<asio::ip::tcp, asio::socket_acceptor_service<asio::ip::tcp> > > >, boost::arg<1> > > >(asio::detail::win_iocp_socket_service<asio::ip::tcp>::implementation_type&, asio::basic_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> >&, boost::_bi::bind_t<void, boost::_mfi::mf3<void, libtorrent::aux::session_impl, boost::shared_ptr<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> > > const&, boost::weak_ptr<asio::basic_socket_acceptor<asio::ip::tcp, asio::socket_acceptor_service<asio::ip::tcp> > > const&, asio::error const&>, boost::_bi::list4<boost::_bi::value<libtorrent::aux::session_impl*>, boost::_bi::value<boost::shared_ptr<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> > > >, boost::_bi::value<boost::weak_ptr<asio::basic_socket_acceptor<asio::ip::tcp, asio::socket_acceptor_service<asio::ip::tcp> > > >, boost::arg<1> > >)]+0x5a6): In function `ZN10libtorrent3aux12checker_impl12find_torrentERKNS_10big_numberE': E:/mingw/msys/1.0/boost/include/boost-1_33_1/boost/shared_ptr.hpp:253: undefined reference to `AcceptEx@32' ../src/.libs/libtorrent.a(session_impl.o)(.text$_ZN4asio6detail23win_iocp_socket_serviceINS_2ip3tcpEE16accept_operationINS_12basic_socketIS3_NS_21stream_socket_serviceIS3_EEEEN5boost3_bi6bind_tIvNSA_4_mfi3mf3IvN10libtorrent3aux12session_implERKNSA_10shared_ptrINS_19basic_stream_socketIS3_S8_EEEERKNSA_8weak_ptrINS_21basic_socket_acceptorIS3_NS_23socket_acceptor_serviceIS3_EEEEEERKNS_5errorEEENSB_5list4INSB_5valueIPSH_EENS11_ISL_EENS11_IST_EENSA_3argILi1EEEEEEEE18do_completion_implEPNS0_18win_iocp_operationEmj[asio::detail::win_iocp_socket_service<asio::ip::tcp>::accept_operation<asio::basic_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> >, boost::_bi::bind_t<void, boost::_mfi::mf3<void, libtorrent::aux::session_impl, boost::shared_ptr<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> > > const&, boost::weak_ptr<asio::basic_socket_acceptor<asio::ip::tcp, asio::socket_acceptor_service<asio::ip::tcp> > > const&, asio::error const&>, boost::_bi::list4<boost::_bi::value<libtorrent::aux::session_impl*>, boost::_bi::value<boost::shared_ptr<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> > > >, boost::_bi::value<boost::weak_ptr<asio::basic_socket_acceptor<asio::ip::tcp, asio::socket_acceptor_service<asio::ip::tcp> > > >, boost::arg<1> > > >::do_completion_impl(asio::detail::win_iocp_operation*, unsigned long, unsigned int)]+0x549): In function `ZN10libtorrent3aux12checker_impl12find_torrentERKNS_10big_numberE': E:/mingw/msys/1.0/home/devel/E/libtorrent-0.11/src/session_impl.cpp:403: undefined reference to `GetAcceptExSockaddrs@32' ../src/.libs/libtorrent.a(session_impl.o)(.text$_ZN4asio6detail23win_iocp_socket_serviceINS_2ip3tcpEE16accept_operationINS_12basic_socketIS3_NS_21stream_socket_serviceIS3_EEEEN5boost3_bi6bind_tIvNSA_4_mfi3mf3IvN10libtorrent3aux12session_implERKNSA_10shared_ptrINS_19basic_stream_socketIS3_S8_EEEERKNSA_8weak_ptrINS_21basic_socket_acceptorIS3_NS_23socket_acceptor_serviceIS3_EEEEEERKNS_5errorEEENSB_5list4INSB_5valueIPSH_EENS11_ISL_EENS11_IST_EENSA_3argILi1EEEEEEEE18do_completion_implEPNS0_18win_iocp_operationEmj[asio::detail::win_iocp_socket_service<asio::ip::tcp>::accept_operation<asio::basic_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> >, boost::_bi::bind_t<void, boost::_mfi::mf3<void, libtorrent::aux::session_impl, boost::shared_ptr<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> > > const&, boost::weak_ptr<asio::basic_socket_acceptor<asio::ip::tcp, asio::socket_acceptor_service<asio::ip::tcp> > > const&, asio::error const&>, boost::_bi::list4<boost::_bi::value<libtorrent::aux::session_impl*>, boost::_bi::value<boost::shared_ptr<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> > > >, boost::_bi::value<boost::weak_ptr<asio::basic_socket_acceptor<asio::ip::tcp, asio::socket_acceptor_service<asio::ip::tcp> > > >, boost::arg<1> > > >::do_completion_impl(asio::detail::win_iocp_operation*, unsigned long, unsigned int)]+0xa6e): In function `ZN10libtorrent3aux12session_impl9pop_alertEv': E:/mingw/msys/1.0/home/devel/E/libtorrent-0.11/src/session_impl.cpp:1579: undefined reference to `AcceptEx@32' collect2: ld returned 1 exit status make[2]: *** [test_piece_picker.exe] Error 1 make[2]: Leaving directory `/home/devel/E/libtorrent-0.11/test' make[1]: *** [all-recursive] Error 1 make[1]: Leaving directory `/home/devel/E/libtorrent-0.11' make: *** [all] Error 2 ~/E/libtorrent-0.11 $ ls -l /opt/lib/ total 280094 -rw-r--r-- 1 devel Administ 105551252 Nov 22 17:45 libtorrent.a -rw-r--r-- 1 devel Administ 817 Nov 22 17:45 libtorrent.la -rw-r--r-- 1 devel Administ 79398984 Nov 21 16:37 libwx_based-2.6.a -rw-r--r-- 1 devel Administ 12517024 Nov 21 16:37 libwx_based_net-2.6.a -rw-r--r-- 1 devel Administ 2046608 Nov 21 16:37 libwx_based_xml-2.6.a -rw-r--r-- 1 devel Administ 22094294 Nov 21 16:37 libwx_mswd_adv-2.6.a -rw-r--r-- 1 devel Administ 246483262 Nov 21 16:37 libwx_mswd_core-2.6.a -rw-r--r-- 1 devel Administ 28995300 Nov 21 16:37 libwx_mswd_html-2.6.a -rw-r--r-- 1 devel Administ 3661674 Nov 21 16:37 libwx_mswd_media-2.6.a -rw-r--r-- 1 devel Administ 2703630 Nov 21 16:37 libwx_mswd_qa-2.6.a -rw-r--r-- 1 devel Administ 53627348 Nov 21 16:37 libwx_mswd_xrc-2.6.a -rw-r--r-- 1 devel Administ 370560 Nov 21 16:37 libwxexpatd-2.6.a -rw-r--r-- 1 devel Administ 1252132 Nov 21 16:37 libwxjpegd-2.6.a -rw-r--r-- 1 devel Administ 647620 Nov 21 16:37 libwxpngd-2.6.a -rw-r--r-- 1 devel Administ 271688 Nov 21 16:37 libwxregexd-2.6.a -rw-r--r-- 1 devel Administ 13801246 Nov 21 16:37 libwxtiffd-2.6.a -rw-r--r-- 1 devel Administ 199692 Nov 21 16:37 libwxzlibd-2.6.a drwxr-xr-x 4 devel Administ 0 Nov 21 16:37 wx

3 2

[mpl::map] pregeneration of long types map (150 types)
by Ovanes Markarian 23 Nov '06

23 Nov '06

Hello Alexey, using the C++ preprocessor macro to generate map of 150 types works fine and code which uses the new mapN type compiles and runs fine as well. Just as you described it in the post: http://lists.boost.org/boost-users/2006/11/23321.php We have successfully tested it with 115 elements. Then we tried to switch to the second approach with pregenerated types. The problem we face is that the python script generates empty headers. To avoid all errors we just copied <boost_root>\boost\mpl\map\map50.hpp to <boost_root>\boost\mpl\map\map60.hpp and changed the file accordingly. Here the modified source: // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Source: /cvsroot/boost/boost/boost/mpl/map/map50.hpp,v $ // $Date: 2004/09/02 15:40:59 $ // $Revision: 1.2 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include <boost/mpl/map/map50.hpp> #endif #include <boost/mpl/aux_/config/use_preprocessed.hpp> #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER map60.hpp # include <boost/mpl/map/aux_/include_preprocessed.hpp> #else # include <boost/preprocessor/iterate.hpp> namespace boost { namespace mpl { # define BOOST_PP_ITERATION_PARAMS_1 \ (3,(51, 60, <boost/mpl/map/aux_/numbered.hpp>)) # include BOOST_PP_ITERATE() }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_MAP_MAP60_HPP_INCLUDED Afterwards we did the same with the CPP file in <boost_root>\libs\mpl\preprocessed\map\: // Copyright Aleksey Gurtovoy 2003-4004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/map/map50.cpp,v $ // $Date: 2004/09/05 09:45:17 $ // $Revision: 1.3 $ #define BOOST_MPL_PREPROCESSING_MODE #include <boost/config.hpp> #include <boost/mpl/map/map60.hpp> gcc is installed and is registered in the PATH variable. OS Win XP, GCC version: gcc (GCC) 3.4.4 (cygming special) (gdc 0.12, using dmd 0.125) Copyright (C) 2004 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Calling the python script command like: $prompt>python ./preprocess_map.py all E:/global_libs/boost_1_33_1 map60.cpp Produces the output: E:\global_libs\boost_1_33_1\libs\mpl\preprocessed>gcc -E -C -P -IE:/global_libs/ boost_1_33_1 "-D BOOST_USER_CONFIG=<E:/global_libs/boost_1_33_1/libs/mpl/preproc essed/include/plain/user.hpp>" -D BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES E:\global_l ibs\boost_1_33_1\libs\mpl\preprocessed\map\map60.cpp 1>E:\global_libs\boost_1_3 3_1\libs\mpl\preprocessed\map\map60.hpp E:\global_libs\boost_1_33_1\libs\mpl\preprocessed>gcc -E -C -P -IE:/global_libs/ boost_1_33_1 "-D BOOST_USER_CONFIG=<E:/global_libs/boost_1_33_1/libs/mpl/preproc essed/include/typeof_based/user.hpp>" -D BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES E:\g lobal_libs\boost_1_33_1\libs\mpl\preprocessed\map\map60.cpp 1>E:\global_libs\bo ost_1_33_1\libs\mpl\preprocessed\map\map60.hpp E:\global_libs\boost_1_33_1\libs\mpl\preprocessed>gcc -E -C -P -IE:/global_libs/ boost_1_33_1 "-D BOOST_USER_CONFIG=<E:/global_libs/boost_1_33_1/libs/mpl/preproc essed/include/no_ctps/user.hpp>" -D BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES E:\global _libs\boost_1_33_1\libs\mpl\preprocessed\map\map60.cpp 1>E:\global_libs\boost_1 _33_1\libs\mpl\preprocessed\map\map60.hpp But the resulting files in pregenerated directories have the size 0. Doing the same thing by passing map50.cpp works just fine and pregenerates new files. Is there smth, that I miss? With Kind Regards, Ovanes Markarian

2 1

[serialization] Trouble serializing a bitfield
by Ken Roser 23 Nov '06

23 Nov '06

Following is a very short program to test serialization along with the g++ output when compiling it. My problem arises when I try to write a serialization function for a bitfield. As the compiler output shows, the bitfield is the cause of this problem. How should one serialize a bitfield? Have I made some mistake in this code? I can get seriailziation to work if I instead use a save() and load() function that copies each bit to an int before archiving but I'm unsure if this is the best way. #include <stdlib.h> #include <string> #include <iostream> #include <sstream> #include <boost/archive/archive_exception.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/export.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/list.hpp> class Event { friend class boost::serialization::access; template<class Archive> void serialize(Archive &ar, const int version) { ar & bits; ar & field1; }; public: struct s { friend class boost::serialization::access; template<class Archive> void serialize(Archive &ar, const int version) { ar & spare1; }; int spare1 : 1; } bits; int field1; }; main(int argc, char **argv) { Event *evt = new Event; evt->field1 = 0x1234; std::stringstream ofs; boost::archive::binary_oarchive oa(ofs); oa & *evt; // serialize the event } serial2.cpp: In member function 'void Event::s::serialize(Archive&, int) [with Archive = boost::archive::binary_oarchive]': boost/serialization/access.hpp:109: instantiated from 'static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_oarchive, T = Event::s]' boost/serialization/serialization.hpp:81: instantiated from 'void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_oarchive, T = Event::s]' boost/serialization/serialization.hpp:140: instantiated from 'void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_oarchive, T = Event::s]' boost/archive/detail/oserializer.hpp:147: instantiated from 'void boost::archive::detail::oserializer<Archive, T>::save_object_data(boost::archive::detail::basic_oarchive&, const void*) const [with Archive = boost::archive::binary_oarchive, T = Event::s]' serial2.cpp:43: instantiated from here serial2.cpp:29: error: cannot bind bitfield '((Event::s*)this)->Event::s::spare1' to 'int&'

3 3

program_options inconsistent dll linkage
by Elsbeth 23 Nov '06

23 Nov '06

Hi We were having problems while linking boost program_options dynamically in Visual Studio.NET Linking to lib file: boost_program_options-vc71-mt-gd-1_33.lib d:\Develop\SDK and Libraries\boost_1_33_0\boost\program_options\variables_map.hpp(130) : warning C4273: 'boost::program_options::store' : inconsistent dll linkage d:\Develop\SDK and Libraries\boost_1_33_0\boost\program_options\variables_map.hpp(138) : warning C4273: 'boost::program_options::store' : inconsistent dll linkage Problem is that in file variables_map.hpp 'BOOST_PROGRAM_OPTIONS_DECL ' is missing in friend declaration of function 'store'. so: ======================= class BOOST_PROGRAM_OPTIONS_DECL variables_map : public abstract_variables_map, public std::map<std::string, variable_value> { ... friend void store(...); }; ... BOOST_PROGRAM_OPTIONS_DECL void store(...); ======================= should be: ======================= class BOOST_PROGRAM_OPTIONS_DECL variables_map : public abstract_variables_map, public std::map<std::string, variable_value> { ... friend void BOOST_PROGRAM_OPTIONS_DECL store(...); }; ... BOOST_PROGRAM_OPTIONS_DECL void store(...); =======================

2 1

Re: [Boost-users] debugging templates
by Hughes, James 23 Nov '06

23 Nov '06

> > Berenguer Blasi wrote: > > > > Is there a way to debug templates? with kdbg preferrably? > > What's your specific problem in debugging template code? > Certainly you could debug templated C++ code with any gdb > frontend. As James already said, this could get rather > confusing, but it's possible without a doubt. > > > > James Hughes wrote: > > Kgdb??? The Linux kernel debugger?? Since the kernel is all > C, how can > > you > use templates > in it? > > > > Forgive me if I am missing something!! > > I think he means the KDE frontend to gdb, usually embedded > into KDevelop. Ah, OK. Too many TLA's... As an aside, I use the Eclipse IDE, with the CDT, and that has a good enough front end for GDB to debug most stuff. Latest version is much better than the one from a year back or so. > > Regards > Hendrik > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

1 0

Combining static and dynamic policies
by Jens Müller 23 Nov '06

23 Nov '06

Hi, I have the following task: There is an algorithm where you can set different behaviors for creating a BFS tree. Currently this is done by setting a policy object (dynamic), a function of which is called to perform the search. I'd like to use static policies here (as is done in generic Boost algorithms), but still keep the possibility of setting the behavior manually. The reason for this is: You can set the behavior using a command line parameter, and it would be impractical to instantiate all templates and then use a huge switch (think of combinations of several policies) to choose the appropriate instantiation. Here a wrapper (dynamic polymorphism) would be needed anyway, or any code using the algorithm would need to be duplicated as well. So my idea is as follows: There is a template parameter for a policy class. Static policy exist for each possible behavior, as well for a dynamic behavior. The "dynamic" policy class has virtual member functions and there exists an inheriting dynamic class for each behavior.[1] The algorithm then has a named param for the policy class. Default value if to default-construct an object of the policy class. (If useful, the template might have a default value for the policy template parameter as well, so the user needn't do anything). Has someone already taken this or a similiar approach? If so, could you point me to a reference? What do you think of the approach? Greeting, Jens [1] Hmmm ... Could this inheriting class be used as template parameter without overhead? Other solution would be: class dyn_behavior{ public: virtual void perform_search(something ...) = 0; } class specific_dyn_behavior<class T> : dyn_behavior { T behavior; public: void perform_search(something ...){ behavior.perform_search(something ...); } }

1 0

shared_ptr. circular references
by bringiton bringiton 23 Nov '06

23 Nov '06

Can anyone offer advice on detecting circular references with shared_ptrs. I have a large app, 50+ classes, and most objects are managed with shared_ptrs. No consideration has gone into avoid circular references, so I'm sure there will be a few in there. I thinking that looking though all the classes and their attributes will take a while. Any suggestions/advice in finding circular references (so i can use weak_ptrs)? I was thinking of maybe getting a tool that draws the class diagram. Or having a base class for all my classes that reference count to a global variable to detect the number of leaks. It seems the shared_ptr is a good idea for memory management, but it opens up the original problem of memory leaks...

4 3

[serialization] linking
by Deane Yang 23 Nov '06

23 Nov '06

I am using bjam with Boost Build v2 to compile and link an executable that calls the boost serialization library using MSVC++ 8.0. For some reason, it tries to link to a library named "libboost..." but the actual library is called "boost...." (no "lib" prefix). Why is this happening and how do I fix it? It doesn't happen when I compile the same executable in Linux.

5 11

[BGL] working file_dependencies.cpp
by Alexander Holler 22 Nov '06

22 Nov '06

Hello, I've already though some time that something does not work as expected using the way the various file_dependencies.cpp examples have done for calculating what files could be compiled in parallel. Because I've now got to a point where I really need something working, I've just done it myself. ;) My solution is pretty simple, and it basically works like it is described in the documentation for the example, walk through the tree and calculate the maximum distance. To achieve that, I'm just using the result from topological_sort and calculating the maximum through a walk through the in_edges of the vertices. Because a diff is almost as large as the resulting example, I've just attached the modified example. It might not look as nice as the original example, but it works as expected. ;) Kind regards, Alexander Holler //======================================================================= // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= // Some small modifications are done by Alexander Holler /* Paul Moore's request: As an example of a practical problem which is not restricted to graph "experts", consider file dependencies. It's basically graph construction, plus topological sort, but it might make a nice "tutorial" example. Build a dependency graph of files, then use the algorithms to do things like 1. Produce a full recompilation order (topological sort, by modified date) 2. Produce a "parallel" recompilation order (same as above, but group files which can be built in parallel) 3. Change analysis (if I change file x, which others need recompiling) 4. Dependency changes (if I add a dependency between file x and file y, what are the effects) */ #include <boost/config.hpp> // put this first to suppress some VC++ warnings #include <iostream> #include <iterator> #include <algorithm> #include <time.h> #include <boost/utility.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/topological_sort.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/visitors.hpp> using namespace std; using namespace boost; enum files_e { dax_h, yow_h, boz_h, zow_h, foo_cpp, foo_o, bar_cpp, bar_o, libfoobar_a, zig_cpp, zig_o, zag_cpp, zag_o, libzigzag_a, killerapp, N }; const char* name[] = { "dax.h", "yow.h", "boz.h", "zow.h", "foo.cpp", "foo.o", "bar.cpp", "bar.o", "libfoobar.a", "zig.cpp", "zig.o", "zag.cpp", "zag.o", "libzigzag.a", "killerapp" }; struct print_visitor : public bfs_visitor<> { template <class Vertex, class Graph> void discover_vertex(Vertex v, Graph&) { cout << name[v] << " "; } }; struct cycle_detector : public dfs_visitor<> { cycle_detector(bool& has_cycle) : m_has_cycle(has_cycle) { } template <class Edge, class Graph> void back_edge(Edge, Graph&) { m_has_cycle = true; } protected: bool& m_has_cycle; }; int main(int,char*[]) { typedef pair<int,int> Edge; Edge used_by[] = { Edge(dax_h, foo_cpp), Edge(dax_h, bar_cpp), Edge(dax_h, yow_h), Edge(yow_h, bar_cpp), Edge(yow_h, zag_cpp), Edge(boz_h, bar_cpp), Edge(boz_h, zig_cpp), Edge(boz_h, zag_cpp), Edge(zow_h, foo_cpp), Edge(foo_cpp, foo_o), Edge(foo_o, libfoobar_a), Edge(bar_cpp, bar_o), Edge(bar_o, libfoobar_a), Edge(libfoobar_a, libzigzag_a), Edge(zig_cpp, zig_o), Edge(zig_o, libzigzag_a), Edge(zag_cpp, zag_o), Edge(zag_o, libzigzag_a), Edge(libzigzag_a, killerapp) }; const std::size_t nedges = sizeof(used_by)/sizeof(Edge); typedef adjacency_list<vecS, vecS, bidirectionalS, property<vertex_distance_t, int> > Graph; #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 // VC++ can't handle the iterator constructor Graph g(N); for (std::size_t j = 0; j < nedges; ++j) { graph_traits<Graph>::edge_descriptor e; bool inserted; tie(e, inserted) = add_edge(used_by[j].first, used_by[j].second, g); } #else Graph g(used_by, used_by + nedges, N); #endif typedef graph_traits<Graph>::vertex_descriptor Vertex; // Determine ordering for a full recompilation // and the order with files that can be compiled in parallel { typedef list<Vertex> MakeOrder; MakeOrder make_order; property_map<Graph, vertex_distance_t>::type distance = get(vertex_distance, g); topological_sort(g, std::front_inserter(make_order)); cout << "make ordering: "; for (MakeOrder::iterator i = make_order.begin(); i != make_order.end(); ++i) { cout << name[*i] << " "; // Walk through the in_edges an calculate the maximum distance. Graph::in_edge_iterator j, j_end; tie(j, j_end) = in_edges(*i, g); if(j==j_end) distance[*i]=0; else { int maxdist=0; // Through the order from topological sort, we are sure that every // distance we are using here is already initialized. for (; j != j_end; ++j) maxdist=std::max(distance[source(*j, g)], maxdist); distance[*i]=maxdist+1; } } cout << endl << endl; cout << "parallel make ordering, " << endl << "vertices with same group number can be made in parallel" << endl; graph_traits<Graph>::vertex_iterator i, iend; for (tie(i,iend) = vertices(g); i != iend; ++i) cout << "time_slot[" << name[*i] << "] = " << distance[*i] << endl; } cout << endl; // if I change yow.h what files need to be re-made? { cout << "A change to yow.h will cause what to be re-made?" << endl; print_visitor vis; breadth_first_search(g, vertex(yow_h, g), visitor(vis)); cout << endl; } cout << endl; // are there any cycles in the graph? { bool has_cycle = false; cycle_detector vis(has_cycle); depth_first_search(g, visitor(vis)); cout << "The graph has a cycle? " << has_cycle << endl; } cout << endl; // add a dependency going from bar.cpp to dax.h { cout << "adding edge bar_cpp -> dax_h" << endl; add_edge(bar_cpp, dax_h, g); } cout << endl; // are there any cycles in the graph? { bool has_cycle = false; cycle_detector vis(has_cycle); depth_first_search(g, visitor(vis)); cout << "The graph has a cycle now? " << has_cycle << endl; } return 0; }

2 2

[enable_if] Compiler workaround for constructor overloads
by Michael Marcin 22 Nov '06

22 Nov '06

Hello I'm working with a Codewarrior compiler (Nokia Codewarrior C/C++ Compiler for Windows/x86 version 3.2.3 build 451). The following test code finds the proper overload for MSVC 2005 and doesn't for the Codewarrior compiler but only with the = syntax. Does anyone have any idea how to make "c" find its overload as well? It would make the client code a lot cleaner to read/write. #include <boost/type_traits/is_integral.hpp> #include <boost/utility/enable_if.hpp> struct tester { int value; tester( float f ) : value((int)f) { } tester( double d ) : value((int)d) { } template< typename T > tester( T val, typename boost::enable_if< boost::is_integral<T> >::type* = 0 ) : value(val) { zzz } }; void main() { tester a = 1.f; // works (chooses float overload) tester b(1); // works (i.e. error on zzz) tester c = 1; // works on vc2005 (i.e. error on zzz) // fails on cw (ambiguous overload looking at float and double) }

1 0