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

Boost python: cannot compile lambda
by chun ping wang 04 Jun '07

04 Jun '07

---------- Forwarded message ---------- From: chun ping wang <cablepuff(a)gmail.com> Date: May 31, 2007 1:24 PM Subject: Boost python: cannot compile lambda To: boost-users(a)list.boost.org hi , while trying to compile boost.python i get these following errors. ar: creating ./lib/libOperatingSystem.a ranlib ./lib/libOperatingSystem.a rm -f ./lib/DeadLockAvoid.o ./lib/ContainerOperation.o make[1]: Leaving directory `C:/CPW/cs_classes' g++.exe -Wall -D__DEBUG__ -c ./cs540/c++/DeadLockPythonWrapper.cpp -o ./boost_py thon/DeadLockPythonWrapper.o -I"C:/Boost/include/boost_1_34" -I"C:/Python25/inc lude" -I"./Scripts" -ansi -fexceptions -fverbose-asm -fexpensive-optimization s -O3 -pg -g3 In file included from ./cs540/c++/DeadLockPythonWrapper.cpp:7: ./cs540/c++/cppdef/ContainerOperation.cpp: In function `CONT<T, std::allocator<_ CharT> > operator-(CONT<T, std::allocator<_CharT> >, CONT<T, std::allocator<_Cha rT> >)': ./cs540/c++/cppdef/ContainerOperation.cpp:32: error: `_1' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp:32: error: (Each undeclared identifier is reported only once for each function it appears in.) ./cs540/c++/cppdef/ContainerOperation.cpp:32: error: `_2' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp: In function `CONT<T, std::allocator<_ CharT> > operator+(CONT<T, std::allocator<_CharT> >, CONT<T, std::allocator<_Cha rT> >)': ./cs540/c++/cppdef/ContainerOperation.cpp:44: error: `_1' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp:44: error: `_2' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp: In function `CONT<T, std::allocator<_ CharT> > operator*(CONT<T, std::allocator<_CharT> >, CONT<T, std::allocator<_Cha rT> >)': ./cs540/c++/cppdef/ContainerOperation.cpp:56: error: `_1' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp:56: error: `_2' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp: In function `CONT<T, std::allocator<_ CharT> > operator/(CONT<T, std::allocator<_CharT> >, CONT<T, std::allocator<_Cha rT> >)': ./cs540/c++/cppdef/ContainerOperation.cpp:68: error: `_1' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp:68: error: `_2' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp: In function `CONT<T, std::allocator<_ CharT> > operator%(CONT<T, std::allocator<_CharT> >, CONT<T, std::allocator<_Cha rT> >)': ./cs540/c++/cppdef/ContainerOperation.cpp:80: error: `_1' undeclared (first use this function) ./cs540/c++/cppdef/ContainerOperation.cpp:80: error: `_2' undeclared (first use this function) Is there a way to integerate lambda into boost python. OperatingSystemLib.mak works .. i just can't put lambda inside implementation file for boost.python. thanks.

2 2

[program_options] allow_unregistered() function for parse_environment
by Chris Weed 04 Jun '07

04 Jun '07

Hi, I would like to parse the environment variables on my system, but also allow unregistered options, similar to <http://www.boost.org/doc/html/program_options/howto.html#id1593176> with the command line parser. Is this possible? I can't seem to get it to work. Thanks, Chris

1 0

[multi_index] MSVC 8.0 visualizers for boost::multi_index_container
by Filip Konvička 04 Jun '07

04 Jun '07

Hello all, here is another version of MSVC 2005 visualizers for multi_index_container. Thanks to Joaquín for his invaluable support! This version supports sequenced, random_access, ordered and hashed indices. Hashed indices are visualized including the internal bucket structure, indicating empty bucket, single-item bucket and multiple-item bucket (see the example below). As in the previous version, contents of autoexp.dat.txt go into Microsoft Visual Studio 8\Common7\Packages\Debugger\autoexp.dat For your container to be visualized, you need to call the VISUALIZE_MULTI_INDEX_CONTAINER macro at the global namespace level (see the attached example, test2.cpp, and a screenshot of a test2.cpp debugging session, sample_hash.png). I strongly recommend using #define BOOST_MULTI_INDEX_LIMIT_INDEXED_BY_SIZE 5 #define BOOST_MULTI_INDEX_LIMIT_TAG_SIZE 3 #define BOOST_MULTI_INDEX_LIMIT_COMPOSITE_KEY_SIZE 5 in order to reduce symbol name lengths, because otherwise the resulting symbols are too long for the visualizer to work (this typically happens with more than 1 index in a multi_index_container). Also beware, using type hiding techniques described at http://boost.org/libs/multi_index/doc/compiler_specifics.html#type_hiding will cause visualizers to fail. Enjoy! Cheers, Filip ;------------------------------------ ; boost::multi_index_container - base boost::multi_index::multi_index_container<*,*,*>{ preview(#($c.node_count, " items (multi_index_container)")) children( #( data:((msvc_helpers::multi_index_helper_2<boost::multi_index::multi_index_container<$T1,$T2,$T3> >*)&$c)->header, original members: [$c,!] ) ) } ;----------------------------------------------- ; boost::multi_index_container - sequenced index boost::multi_index::detail::header_holder<boost::multi_index::detail::sequenced_index_node<*>,*>{ preview(#("sequenced index")) children( #( #list( head : *(((boost::multi_index::detail::sequenced_index_node_impl*)(boost::multi_index::detail::sequenced_index_node_trampoline<$T1>*)($c.member))->next_), size : (($T2*)&$c)->node_count, next : next_ ) : ((msvc_helpers::multi_index_helper<boost::multi_index::detail::sequenced_index_node<$T1> >*)(boost::multi_index::detail::sequenced_index_node<$T1>*)(boost::multi_index::detail::sequenced_index_node_trampoline<$T1>*)(&$e))->value ) ) } ;--------------------------------------------------- ; boost::multi_index_container - random access index boost::multi_index::detail::header_holder<boost::multi_index::detail::random_access_index_node<*>,*>{ preview(#("random access index")) children( #( #array( expr: (($T2*)&$c)->ptrs.spc.data_[$i], size: (($T2*)&$c)->node_count ) : ((msvc_helpers::multi_index_helper<boost::multi_index::detail::random_access_index_node<$T1> >*)(boost::multi_index::detail::random_access_index_node<$T1>*)(boost::multi_index::detail::random_access_index_node_trampoline<$T1>*)&$e)->value ) ) } ;-------------------------------------------- ; boost::multi_index_container - hashed index boost::multi_index::detail::header_holder<boost::multi_index::detail::hashed_index_node<*>,*>{ preview(#("hashed index - ", (($T2*)&$c)->node_count, " in ", (($T2*)&$c)->buckets.size_, " buckets")) children( #( #array( expr : (($T2*)&$c)->buckets.spc.data_[$i], size : (($T2*)&$c)->buckets.size_ ) : (msvc_helpers::multi_index_helper_3<boost::multi_index::detail::hashed_index_node<$T1> >*)(void*)&$e ) ) } msvc_helpers::multi_index_helper_3<boost::multi_index::detail::hashed_index_node<*> >{ preview(#if ( ((boost::multi_index::detail::hashed_index_node_impl*)&$c)->next_==((boost::multi_index::detail::hashed_index_node_impl*)&$c) ) ; no data at all (#("---")) #else ( #if ( ((boost::multi_index::detail::hashed_index_node_impl*)&$c)->next_->next_==((boost::multi_index::detail::hashed_index_node_impl*)&$c) ) ( ; 1 item: preview as _value_ #( ((msvc_helpers::multi_index_helper<boost::multi_index::detail::hashed_index_node<$T1> >*)(boost::multi_index::detail::hashed_index_node<$T1>*)(boost::multi_index::detail::hashed_index_node_trampoline<$T1>*)(((boost::multi_index::detail::hashed_index_node_impl*)&$c)->next_))->value) ) #else ( ; multiple items: preview as [_value_ ...] #("[", ((msvc_helpers::multi_index_helper<boost::multi_index::detail::hashed_index_node<$T1> >*)(boost::multi_index::detail::hashed_index_node<$T1>*)(boost::multi_index::detail::hashed_index_node_trampoline<$T1>*)(((boost::multi_index::detail::hashed_index_node_impl*)&$c)->next_))->value, " ...]") ) ) ) children( #( ; multiple items: view as list #list( head: ((boost::multi_index::detail::hashed_index_node_impl*)&$c)->next_, next: next_, skip: ((boost::multi_index::detail::hashed_index_node_impl*)&$c) ) : ((msvc_helpers::multi_index_helper<boost::multi_index::detail::hashed_index_node<$T1> >*)(boost::multi_index::detail::hashed_index_node<$T1>*)(boost::multi_index::detail::hashed_index_node_trampoline<$T1>*)(&$e))->value ) ) } ;--------------------------------------------- ; boost::multi_index_container - ordered index boost::multi_index::detail::header_holder<boost::multi_index::detail::ordered_index_node<*>,*>{ preview(#("ordered index")) children( #( #tree( head : *(boost::multi_index::detail::ordered_index_node_compressed_base*)(boost::multi_index::detail::ordered_index_node_impl*)(void*)(((boost::multi_index::detail::ordered_index_node_trampoline<$T1>*)($c.member))->parentcolor_&~1U), size : (($T2*)&$c)->node_count, left : left_, right : right_, skip : 0 ) : ((msvc_helpers::multi_index_helper<boost::multi_index::detail::ordered_index_node<$T1> >*)(boost::multi_index::detail::ordered_index_node<$T1>*)(boost::multi_index::detail::ordered_index_node_trampoline<$T1>*)(&$e))->value ) ) } #define BOOST_MULTI_INDEX_LIMIT_INDEXED_BY_SIZE 5 #define BOOST_MULTI_INDEX_LIMIT_TAG_SIZE 3 #define BOOST_MULTI_INDEX_LIMIT_COMPOSITE_KEY_SIZE 5 #include "mic_visualizer.hpp" #include <string> #include <boost/multi_index_container.hpp> #include <boost/multi_index/sequenced_index.hpp> #include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/random_access_index.hpp> using namespace boost::multi_index; using std::wstring; using namespace std; struct test { wstring x; wstring y; test(wchar_t const *str, wchar_t const *str2=L"def") : x(str), y(str2) {} bool operator<(test const& other) const { return x<other.x; } bool operator==(test const& other) const { return x==other.x; } }; namespace boost { inline std::size_t hash_value(test const& t) { return hash_value(t.x); } } typedef multi_index_container<test, indexed_by<hashed_non_unique<identity<test> > > > cont; VISUALIZE_MULTI_INDEX_CONTAINER(cont); int wmain() { cont test_cont; test_cont.insert(test(L"aaa")); test_cont.insert(test(L"aaa", L"other")); test_cont.insert(test(L"aac")); return 0; // see screenshoxt } #ifndef MIC_VISUALIZER_HPP #define MIC_VISUALIZER_HPP #if !defined(_DEBUG)||!defined(_MSC_VER)||(_MSC_VER<1400) #define VISUALIZE_MULTI_INDEX_CONTAINER(Type) /* empty def */ #else namespace msvc_helpers { template<typename T> struct multi_index_helper { }; template<typename T> struct multi_index_helper_2 { }; template<typename T> struct multi_index_helper_3 { }; } #define __VISUALIZE_MIC_INDEX_DEF(Type) \ boost::multi_index::detail::multi_index_node_type< \ Type::value_type, \ Type::index_specifier_type_list, \ std::allocator<Type::value_type> >::type /// Enables MSVC visualizers for multi_index_container Type #define VISUALIZE_MULTI_INDEX_CONTAINER(Type) \ namespace msvc_helpers { \ template<> \ struct multi_index_helper_2<Type> { \ typedef __VISUALIZE_MIC_INDEX_DEF(Type) index_node_type; \ typedef \ boost::base_from_member< \ boost::detail::allocator::rebind_to< \ std::allocator<Type::value_type>, \ index_node_type \ >::type> \ base_type; \ typedef \ boost::multi_index::detail::header_holder< \ index_node_type, Type> \ header_holder_type; \ typedef \ boost::multi_index::detail::multi_index_base_type< \ Type::value_type, \ Type::index_specifier_type_list, \ std::allocator<Type::value_type> >::type \ index_type; \ /* mimic multi_index_container layout */ \ base_type base; \ header_holder_type header; \ index_type index; \ unsigned int node_count; \ /* ensure that the debugger sees this template instance */ \ static void get() { \ multi_index_helper_2<Type> *ensure_inst=0; \ } \ }; \ template<> \ struct multi_index_helper_3<__VISUALIZE_MIC_INDEX_DEF(Type)> { \ /* ensure that the debugger sees this template instance */ \ static void get() { \ multi_index_helper_3< \ __VISUALIZE_MIC_INDEX_DEF(Type)> *ensure_inst=0; \ } \ }; \ template<> \ struct multi_index_helper<__VISUALIZE_MIC_INDEX_DEF(Type)> { \ typedef __VISUALIZE_MIC_INDEX_DEF(Type) index_node_type; \ /* mimic index_node_base<Type::value_type> layout */ \ Type::value_type value; \ /* ensure that the debugger sees this template instance */ \ static void get() { \ multi_index_helper<index_node_type> *ensure_inst=0; \ } \ }; \ } #endif #endif

1 0

[mpi] cvs, 2 errors, build missing -fPIC and install duplicate target
by Chris Fairles 04 Jun '07

04 Jun '07

--build-configuration notice: found boost-build.jam at /home/cfairles/repos/boost/boost-build.jam notice: loading Boost.Build from /home/cfairles/repos/boost/tools/build/v2 searching "/etc" "/home/cfairles" "/usr/share/boost-build" "/home/cfairles/repos/boost/tools/build/v2" "/home/cfairles/repos/boost/tools/build/v2/kernel" "/home/cfairles/repos/boost/tools/build/v2/util" "/home/cfairles/repos/boost/tools/build/v2/build" "/home/cfairles/repos/boost/tools/build/v2/tools" "/home/cfairles/repos/boost/tools/build/v2/new" "/home/cfairles/repos/boost/tools/build/v2/." for "site-config.jam" notice: loading site-config.jam from /home/cfairles/repos/boost/tools/build/v2/site-config.jam Loading explicitly specifier user configuration file: user-config.jam notice: using gcc libraries :: <toolset>gcc-4.1.1 :: /usr/lib64/ccache/bin /usr/lib64/ccache/lib /usr/lib64/ccache/lib32 /usr/lib64/ccache/lib64 notice: using gcc archiver :: <toolset>gcc-4.1.1 :: ar warning: toolset gcc initialization: can't find tool windres warning: initialized from notice: using rc compiler :: <toolset>gcc-4.1.1 :: as notice: looking for python 2.4 notice: searching for python binaries in /usr/bin notice: trying Python interpreter command /usr/bin/python2.4 notice: /usr/bin/python2.4 invokes actual Python (major,minor) version 2.4 notice: qualifying Python interpreter found notice: Python interpreter command is /usr/bin/python2.4 notice: Python include path is /usr/include/python2.4 notice: Python library path is /usr/lib/python2.4/config ===============MPI Auto-configuration=============== Found recent LAM-MPI or Open MPI wrapper compiler: mpic++ MPI compilation flags: -I/usr/include/openmpi -I/usr/include/openmpi/openmpi -m64 -pthread MPI link flags: -m64 -pthread -L/usr/lib64/openmpi -lmpi_cxx -lmpi -lorte -lopal -ldl -Wl,--export-dynamic -lnsl -lutil -lm -ldl MPI build features: <include>/usr/include/openmpi <include>/usr/include/openmpi/openmpi <threading>multi <cxxflags>-m64 <threading>multi <library-path>/usr/lib64/openmpi <find-shared-library>mpi_cxx <find-shared-library>mpi <find-shared-library>orte <find-shared-library>opal <find-shared-library>dl <find-shared-library>nsl <find-shared-library>util <find-shared-library>m <find-shared-library>dl <linkflags>-m64 <linkflags>-Wl,--export-dynamic MPI launcher: mpirun -np ==================================================== notice: iostreams: using prebuilt zlib notice: iostreams: using prebuilt bzip2 user-config.jam: using gcc; using python : 2.4 : /usr ; using mpi ; Error #1: Building with: ./tools/jam/src/bin.linux/bjam -d+2 -sICU_PATH=/usr variant=release threading=multi --layout=system --user-config=user-config.jam --with-date_time --with-filesystem --with-function_types --with-iostreams --with-mpi --with-program_options --with-python --with-serialization --with-signals --with-system --with-thread --with-test I obtained the following linker error. /usr/bin/ld: bin.v2/libs/mpi/build/gcc-4.1.1/release/link-static/threading-multi/collectives.o: relocation R_X86_64_32 against `__dso_handle' can not be used when making a shared object; recompile with -fPIC Solved by adding using gcc : : : <cxxflags>-fPIC ; to user-config.jam Error #2: ./tools/jam/src/bin.linux/bjam -d+2 -sICU_PATH=/usr variant=release threading=multi --layout=system --user-config=user-config.jam --prefix=/home/cfairles/usr --exec-prefix=/home/cfairles/usr --libdir=/home/cfairles/usr/lib64 --includedir=/home/cfairles/usr/include --with-date_time --with-filesystem --with-function_types --with-iostreams --with-mpi --with-program_options --with-python --with-serialization --with-signals --with-system --with-thread --with-test install /home/cfairles/repos/boost/tools/build/v2/build/virtual-target.jam:996: in virtual-target.register-actual-name from module virtual-target error: Duplicate name of actual target: <p/home/cfairles/usr/lib64>mpi.so error: previous virtual target { common%common.copy-mpi.so.PYTHON_EXTENSION { gcc%gcc.link.dll-mpi.so.PYTHON_EXTENSION { gcc%gcc.compile.c++-collectives.o.OBJ { python/collectives.cpp.CPP } } { gcc%gcc.compile.c++-py_communicator.o.OBJ { python/py_communicator.cpp.CPP } } { gcc%gcc.compile.c++-datatypes.o.OBJ { python/datatypes.cpp.CPP } } { gcc%gcc.compile.c++-documentation.o.OBJ { python/documentation.cpp.CPP } } { gcc%gcc.compile.c++-py_environment.o.OBJ { python/py_environment.cpp.CPP } } { gcc%gcc.compile.c++-py_exception.o.OBJ { python/py_exception.cpp.CPP } } { gcc%gcc.compile.c++-module.o.OBJ { python/module.cpp.CPP } } { gcc%gcc.compile.c++-py_request.o.OBJ { python/py_request.cpp.CPP } } { gcc%gcc.compile.c++-skeleton_and_content.o.OBJ { python/skeleton_and_content.cpp.CPP } } { gcc%gcc.compile.c++-status.o.OBJ { python/status.cpp.CPP } } { gcc%gcc.compile.c++-py_timer.o.OBJ { python/py_timer.cpp.CPP } } { gcc%gcc.link.dll-libboost_mpi_python-mt.so.SHARED_LIB { gcc%gcc.compile.c++-serialize.o.OBJ { python/serialize.cpp.CPP } } { gcc%gcc.link.dll-libboost_python-mt.so.SHARED_LIB { gcc%gcc.compile.c++-numeric.o.OBJ { numeric.cpp.CPP } } { gcc%gcc.compile.c++-list.o.OBJ { list.cpp.CPP } } { gcc%gcc.compile.c++-long.o.OBJ { long.cpp.CPP } } { gcc%gcc.compile.c++-dict.o.OBJ { dict.cpp.CPP } } { gcc%gcc.compile.c++-tuple.o.OBJ { tuple.cpp.CPP } } { gcc%gcc.compile.c++-str.o.OBJ { str.cpp.CPP } } { gcc%gcc.compile.c++-slice.o.OBJ { slice.cpp.CPP } } { gcc%gcc.compile.c++-aix_init_module.o.OBJ { aix_init_module.cpp.CPP } } { gcc%gcc.compile.c++-from_python.o.OBJ { converter/from_python.cpp.CPP } } { gcc%gcc.compile.c++-registry.o.OBJ { converter/registry.cpp.CPP } } { gcc%gcc.compile.c++-type_id.o.OBJ { converter/type_id.cpp.CPP } } { gcc%gcc.compile.c++-enum.o.OBJ { object/enum.cpp.CPP } } { gcc%gcc.compile.c++-class.o.OBJ { object/class.cpp.CPP } } { gcc%gcc.compile.c++-function.o.OBJ { object/function.cpp.CPP } } { gcc%gcc.compile.c++-inheritance.o.OBJ { object/inheritance.cpp.CPP } } { gcc%gcc.compile.c++-life_support.o.OBJ { object/life_support.cpp.CPP } } { gcc%gcc.compile.c++-pickle_support.o.OBJ { object/pickle_support.cpp.CPP } } { gcc%gcc.compile.c++-errors.o.OBJ { errors.cpp.CPP } } { gcc%gcc.compile.c++-module.o.OBJ { module.cpp.CPP } } { gcc%gcc.compile.c++-builtin_converters.o.OBJ { converter/builtin_converters.cpp.CPP } } { gcc%gcc.compile.c++-arg_to_python_base.o.OBJ { converter/arg_to_python_base.cpp.CPP } } { gcc%gcc.compile.c++-iterator.o.OBJ { object/iterator.cpp.CPP } } { gcc%gcc.compile.c++-stl_iterator.o.OBJ { object/stl_iterator.cpp.CPP } } { gcc%gcc.compile.c++-object_protocol.o.OBJ { object_protocol.cpp.CPP } } { gcc%gcc.compile.c++-object_operators.o.OBJ { object_operators.cpp.CPP } } { gcc%gcc.compile.c++-wrapper.o.OBJ { wrapper.cpp.CPP } } { gcc%gcc.compile.c++-import.o.OBJ { import.cpp.CPP } } { gcc%gcc.compile.c++-exec.o.OBJ { exec.cpp.CPP } } } { gcc%gcc.link.dll-libboost_mpi-mt.so.SHARED_LIB { gcc%gcc.compile.c++-broadcast.o.OBJ { broadcast.cpp.CPP } } { gcc%gcc.compile.c++-communicator.o.OBJ { communicator.cpp.CPP } } { gcc%gcc.compile.c++-computation_tree.o.OBJ { computation_tree.cpp.CPP } } { gcc%gcc.compile.c++-content_oarchive.o.OBJ { content_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-environment.o.OBJ { environment.cpp.CPP } } { gcc%gcc.compile.c++-exception.o.OBJ { exception.cpp.CPP } } { gcc%gcc.compile.c++-graph_topology.o.OBJ { graph_topology.cpp.CPP } } { gcc%gcc.compile.c++-group.o.OBJ { group.cpp.CPP } } { gcc%gcc.compile.c++-mpi_datatype_cache.o.OBJ { mpi_datatype_cache.cpp.CPP } } { gcc%gcc.compile.c++-mpi_datatype_oarchive.o.OBJ { mpi_datatype_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_iarchive.o.OBJ { packed_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_oarchive.o.OBJ { packed_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_skeleton_iarchive.o.OBJ { packed_skeleton_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_skeleton_oarchive.o.OBJ { packed_skeleton_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-point_to_point.o.OBJ { point_to_point.cpp.CPP } } { gcc%gcc.compile.c++-request.o.OBJ { request.cpp.CPP } } { gcc%gcc.compile.c++-text_skeleton_oarchive.o.OBJ { text_skeleton_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-timer.o.OBJ { timer.cpp.CPP } } { gcc%gcc.link.dll-libboost_serialization-mt.so.SHARED_LIB { gcc%gcc.compile.c++-basic_archive.o.OBJ { basic_archive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iarchive.o.OBJ { basic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iserializer.o.OBJ { basic_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_oarchive.o.OBJ { basic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_oserializer.o.OBJ { basic_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_iserializer.o.OBJ { basic_pointer_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_oserializer.o.OBJ { basic_pointer_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_serializer_map.o.OBJ { basic_serializer_map.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_iprimitive.o.OBJ { basic_text_iprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_oprimitive.o.OBJ { basic_text_oprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_xml_archive.o.OBJ { basic_xml_archive.cpp.CPP } } { gcc%gcc.compile.c++-binary_iarchive.o.OBJ { binary_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-binary_oarchive.o.OBJ { binary_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-codecvt_null.o.OBJ { codecvt_null.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info.o.OBJ { extended_type_info.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_no_rtti.o.OBJ { extended_type_info_no_rtti.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_typeid.o.OBJ { extended_type_info_typeid.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_iarchive.o.OBJ { polymorphic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_oarchive.o.OBJ { polymorphic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-stl_port.o.OBJ { stl_port.cpp.CPP } } { gcc%gcc.compile.c++-text_iarchive.o.OBJ { text_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-text_oarchive.o.OBJ { text_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-void_cast.o.OBJ { void_cast.cpp.CPP } } { gcc%gcc.compile.c++-xml_grammar.o.OBJ { xml_grammar.cpp.CPP } } { gcc%gcc.compile.c++-xml_iarchive.o.OBJ { xml_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-xml_oarchive.o.OBJ { xml_oarchive.cpp.CPP } } } } { gcc%gcc.link.dll-libboost_serialization-mt.so.SHARED_LIB { gcc%gcc.compile.c++-basic_archive.o.OBJ { basic_archive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iarchive.o.OBJ { basic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iserializer.o.OBJ { basic_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_oarchive.o.OBJ { basic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_oserializer.o.OBJ { basic_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_iserializer.o.OBJ { basic_pointer_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_oserializer.o.OBJ { basic_pointer_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_serializer_map.o.OBJ { basic_serializer_map.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_iprimitive.o.OBJ { basic_text_iprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_oprimitive.o.OBJ { basic_text_oprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_xml_archive.o.OBJ { basic_xml_archive.cpp.CPP } } { gcc%gcc.compile.c++-binary_iarchive.o.OBJ { binary_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-binary_oarchive.o.OBJ { binary_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-codecvt_null.o.OBJ { codecvt_null.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info.o.OBJ { extended_type_info.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_no_rtti.o.OBJ { extended_type_info_no_rtti.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_typeid.o.OBJ { extended_type_info_typeid.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_iarchive.o.OBJ { polymorphic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_oarchive.o.OBJ { polymorphic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-stl_port.o.OBJ { stl_port.cpp.CPP } } { gcc%gcc.compile.c++-text_iarchive.o.OBJ { text_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-text_oarchive.o.OBJ { text_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-void_cast.o.OBJ { void_cast.cpp.CPP } } { gcc%gcc.compile.c++-xml_grammar.o.OBJ { xml_grammar.cpp.CPP } } { gcc%gcc.compile.c++-xml_iarchive.o.OBJ { xml_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-xml_oarchive.o.OBJ { xml_oarchive.cpp.CPP } } } } { gcc%gcc.link.dll-libboost_mpi-mt.so.SHARED_LIB { gcc%gcc.compile.c++-broadcast.o.OBJ { broadcast.cpp.CPP } } { gcc%gcc.compile.c++-communicator.o.OBJ { communicator.cpp.CPP } } { gcc%gcc.compile.c++-computation_tree.o.OBJ { computation_tree.cpp.CPP } } { gcc%gcc.compile.c++-content_oarchive.o.OBJ { content_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-environment.o.OBJ { environment.cpp.CPP } } { gcc%gcc.compile.c++-exception.o.OBJ { exception.cpp.CPP } } { gcc%gcc.compile.c++-graph_topology.o.OBJ { graph_topology.cpp.CPP } } { gcc%gcc.compile.c++-group.o.OBJ { group.cpp.CPP } } { gcc%gcc.compile.c++-mpi_datatype_cache.o.OBJ { mpi_datatype_cache.cpp.CPP } } { gcc%gcc.compile.c++-mpi_datatype_oarchive.o.OBJ { mpi_datatype_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_iarchive.o.OBJ { packed_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_oarchive.o.OBJ { packed_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_skeleton_iarchive.o.OBJ { packed_skeleton_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_skeleton_oarchive.o.OBJ { packed_skeleton_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-point_to_point.o.OBJ { point_to_point.cpp.CPP } } { gcc%gcc.compile.c++-request.o.OBJ { request.cpp.CPP } } { gcc%gcc.compile.c++-text_skeleton_oarchive.o.OBJ { text_skeleton_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-timer.o.OBJ { timer.cpp.CPP } } { gcc%gcc.link.dll-libboost_serialization-mt.so.SHARED_LIB { gcc%gcc.compile.c++-basic_archive.o.OBJ { basic_archive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iarchive.o.OBJ { basic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iserializer.o.OBJ { basic_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_oarchive.o.OBJ { basic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_oserializer.o.OBJ { basic_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_iserializer.o.OBJ { basic_pointer_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_oserializer.o.OBJ { basic_pointer_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_serializer_map.o.OBJ { basic_serializer_map.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_iprimitive.o.OBJ { basic_text_iprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_oprimitive.o.OBJ { basic_text_oprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_xml_archive.o.OBJ { basic_xml_archive.cpp.CPP } } { gcc%gcc.compile.c++-binary_iarchive.o.OBJ { binary_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-binary_oarchive.o.OBJ { binary_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-codecvt_null.o.OBJ { codecvt_null.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info.o.OBJ { extended_type_info.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_no_rtti.o.OBJ { extended_type_info_no_rtti.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_typeid.o.OBJ { extended_type_info_typeid.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_iarchive.o.OBJ { polymorphic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_oarchive.o.OBJ { polymorphic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-stl_port.o.OBJ { stl_port.cpp.CPP } } { gcc%gcc.compile.c++-text_iarchive.o.OBJ { text_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-text_oarchive.o.OBJ { text_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-void_cast.o.OBJ { void_cast.cpp.CPP } } { gcc%gcc.compile.c++-xml_grammar.o.OBJ { xml_grammar.cpp.CPP } } { gcc%gcc.compile.c++-xml_iarchive.o.OBJ { xml_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-xml_oarchive.o.OBJ { xml_oarchive.cpp.CPP } } } } { gcc%gcc.link.dll-libboost_serialization-mt.so.SHARED_LIB { gcc%gcc.compile.c++-basic_archive.o.OBJ { basic_archive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iarchive.o.OBJ { basic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iserializer.o.OBJ { basic_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_oarchive.o.OBJ { basic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_oserializer.o.OBJ { basic_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_iserializer.o.OBJ { basic_pointer_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_oserializer.o.OBJ { basic_pointer_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_serializer_map.o.OBJ { basic_serializer_map.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_iprimitive.o.OBJ { basic_text_iprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_oprimitive.o.OBJ { basic_text_oprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_xml_archive.o.OBJ { basic_xml_archive.cpp.CPP } } { gcc%gcc.compile.c++-binary_iarchive.o.OBJ { binary_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-binary_oarchive.o.OBJ { binary_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-codecvt_null.o.OBJ { codecvt_null.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info.o.OBJ { extended_type_info.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_no_rtti.o.OBJ { extended_type_info_no_rtti.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_typeid.o.OBJ { extended_type_info_typeid.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_iarchive.o.OBJ { polymorphic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_oarchive.o.OBJ { polymorphic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-stl_port.o.OBJ { stl_port.cpp.CPP } } { gcc%gcc.compile.c++-text_iarchive.o.OBJ { text_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-text_oarchive.o.OBJ { text_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-void_cast.o.OBJ { void_cast.cpp.CPP } } { gcc%gcc.compile.c++-xml_grammar.o.OBJ { xml_grammar.cpp.CPP } } { gcc%gcc.compile.c++-xml_iarchive.o.OBJ { xml_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-xml_oarchive.o.OBJ { xml_oarchive.cpp.CPP } } } } } error: created from ./install-proper-lib error: another virtual target { common%common.copy-mpi.so.PYTHON_EXTENSION { gcc%gcc.link.dll-mpi.so.PYTHON_EXTENSION { gcc%gcc.compile.c++-collectives.o.OBJ { python/collectives.cpp.CPP } } { gcc%gcc.compile.c++-py_communicator.o.OBJ { python/py_communicator.cpp.CPP } } { gcc%gcc.compile.c++-datatypes.o.OBJ { python/datatypes.cpp.CPP } } { gcc%gcc.compile.c++-documentation.o.OBJ { python/documentation.cpp.CPP } } { gcc%gcc.compile.c++-py_environment.o.OBJ { python/py_environment.cpp.CPP } } { gcc%gcc.compile.c++-py_exception.o.OBJ { python/py_exception.cpp.CPP } } { gcc%gcc.compile.c++-module.o.OBJ { python/module.cpp.CPP } } { gcc%gcc.compile.c++-py_request.o.OBJ { python/py_request.cpp.CPP } } { gcc%gcc.compile.c++-skeleton_and_content.o.OBJ { python/skeleton_and_content.cpp.CPP } } { gcc%gcc.compile.c++-status.o.OBJ { python/status.cpp.CPP } } { gcc%gcc.compile.c++-py_timer.o.OBJ { python/py_timer.cpp.CPP } } { gcc%gcc.archive-libboost_mpi_python-mt.a.STATIC_LIB { gcc%gcc.compile.c++-serialize.o.OBJ { python/serialize.cpp.CPP } } } { gcc%gcc.archive-libboost_python-mt.a.STATIC_LIB { gcc%gcc.compile.c++-numeric.o.OBJ { numeric.cpp.CPP } } { gcc%gcc.compile.c++-list.o.OBJ { list.cpp.CPP } } { gcc%gcc.compile.c++-long.o.OBJ { long.cpp.CPP } } { gcc%gcc.compile.c++-dict.o.OBJ { dict.cpp.CPP } } { gcc%gcc.compile.c++-tuple.o.OBJ { tuple.cpp.CPP } } { gcc%gcc.compile.c++-str.o.OBJ { str.cpp.CPP } } { gcc%gcc.compile.c++-slice.o.OBJ { slice.cpp.CPP } } { gcc%gcc.compile.c++-aix_init_module.o.OBJ { aix_init_module.cpp.CPP } } { gcc%gcc.compile.c++-from_python.o.OBJ { converter/from_python.cpp.CPP } } { gcc%gcc.compile.c++-registry.o.OBJ { converter/registry.cpp.CPP } } { gcc%gcc.compile.c++-type_id.o.OBJ { converter/type_id.cpp.CPP } } { gcc%gcc.compile.c++-enum.o.OBJ { object/enum.cpp.CPP } } { gcc%gcc.compile.c++-class.o.OBJ { object/class.cpp.CPP } } { gcc%gcc.compile.c++-function.o.OBJ { object/function.cpp.CPP } } { gcc%gcc.compile.c++-inheritance.o.OBJ { object/inheritance.cpp.CPP } } { gcc%gcc.compile.c++-life_support.o.OBJ { object/life_support.cpp.CPP } } { gcc%gcc.compile.c++-pickle_support.o.OBJ { object/pickle_support.cpp.CPP } } { gcc%gcc.compile.c++-errors.o.OBJ { errors.cpp.CPP } } { gcc%gcc.compile.c++-module.o.OBJ { module.cpp.CPP } } { gcc%gcc.compile.c++-builtin_converters.o.OBJ { converter/builtin_converters.cpp.CPP } } { gcc%gcc.compile.c++-arg_to_python_base.o.OBJ { converter/arg_to_python_base.cpp.CPP } } { gcc%gcc.compile.c++-iterator.o.OBJ { object/iterator.cpp.CPP } } { gcc%gcc.compile.c++-stl_iterator.o.OBJ { object/stl_iterator.cpp.CPP } } { gcc%gcc.compile.c++-object_protocol.o.OBJ { object_protocol.cpp.CPP } } { gcc%gcc.compile.c++-object_operators.o.OBJ { object_operators.cpp.CPP } } { gcc%gcc.compile.c++-wrapper.o.OBJ { wrapper.cpp.CPP } } { gcc%gcc.compile.c++-import.o.OBJ { import.cpp.CPP } } { gcc%gcc.compile.c++-exec.o.OBJ { exec.cpp.CPP } } } { gcc%gcc.archive-libboost_mpi-mt.a.STATIC_LIB { gcc%gcc.compile.c++-broadcast.o.OBJ { broadcast.cpp.CPP } } { gcc%gcc.compile.c++-communicator.o.OBJ { communicator.cpp.CPP } } { gcc%gcc.compile.c++-computation_tree.o.OBJ { computation_tree.cpp.CPP } } { gcc%gcc.compile.c++-content_oarchive.o.OBJ { content_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-environment.o.OBJ { environment.cpp.CPP } } { gcc%gcc.compile.c++-exception.o.OBJ { exception.cpp.CPP } } { gcc%gcc.compile.c++-graph_topology.o.OBJ { graph_topology.cpp.CPP } } { gcc%gcc.compile.c++-group.o.OBJ { group.cpp.CPP } } { gcc%gcc.compile.c++-mpi_datatype_cache.o.OBJ { mpi_datatype_cache.cpp.CPP } } { gcc%gcc.compile.c++-mpi_datatype_oarchive.o.OBJ { mpi_datatype_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_iarchive.o.OBJ { packed_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_oarchive.o.OBJ { packed_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_skeleton_iarchive.o.OBJ { packed_skeleton_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-packed_skeleton_oarchive.o.OBJ { packed_skeleton_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-point_to_point.o.OBJ { point_to_point.cpp.CPP } } { gcc%gcc.compile.c++-request.o.OBJ { request.cpp.CPP } } { gcc%gcc.compile.c++-text_skeleton_oarchive.o.OBJ { text_skeleton_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-timer.o.OBJ { timer.cpp.CPP } } } { gcc%gcc.archive-libboost_serialization-mt.a.STATIC_LIB { gcc%gcc.compile.c++-basic_archive.o.OBJ { basic_archive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iarchive.o.OBJ { basic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_iserializer.o.OBJ { basic_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_oarchive.o.OBJ { basic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-basic_oserializer.o.OBJ { basic_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_iserializer.o.OBJ { basic_pointer_iserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_pointer_oserializer.o.OBJ { basic_pointer_oserializer.cpp.CPP } } { gcc%gcc.compile.c++-basic_serializer_map.o.OBJ { basic_serializer_map.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_iprimitive.o.OBJ { basic_text_iprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_text_oprimitive.o.OBJ { basic_text_oprimitive.cpp.CPP } } { gcc%gcc.compile.c++-basic_xml_archive.o.OBJ { basic_xml_archive.cpp.CPP } } { gcc%gcc.compile.c++-binary_iarchive.o.OBJ { binary_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-binary_oarchive.o.OBJ { binary_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-codecvt_null.o.OBJ { codecvt_null.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info.o.OBJ { extended_type_info.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_no_rtti.o.OBJ { extended_type_info_no_rtti.cpp.CPP } } { gcc%gcc.compile.c++-extended_type_info_typeid.o.OBJ { extended_type_info_typeid.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_iarchive.o.OBJ { polymorphic_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-polymorphic_oarchive.o.OBJ { polymorphic_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-stl_port.o.OBJ { stl_port.cpp.CPP } } { gcc%gcc.compile.c++-text_iarchive.o.OBJ { text_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-text_oarchive.o.OBJ { text_oarchive.cpp.CPP } } { gcc%gcc.compile.c++-void_cast.o.OBJ { void_cast.cpp.CPP } } { gcc%gcc.compile.c++-xml_grammar.o.OBJ { xml_grammar.cpp.CPP } } { gcc%gcc.compile.c++-xml_iarchive.o.OBJ { xml_iarchive.cpp.CPP } } { gcc%gcc.compile.c++-xml_oarchive.o.OBJ { xml_oarchive.cpp.CPP } } } } } error: created from ./install-proper-lib error: added properties: <define>BOOST_PYTHON_STATIC_LIB <library>object(file-target)@20365 <library>object(file-target)@20426 <library>object(file-target)@20523 <library>object(file-target)@20535 <link>static error: removed properties: <define>BOOST_PYTHON_DYNAMIC_LIB <library>object(file-target)@575 <library>object(file-target)@676 <library>object(file-target)@856 <link>shared <xdll-path>/home/cfairles/repos/boost/bin.v2/libs/mpi/build/gcc-4.1.1/release/threading-multi <xdll-path>/home/cfairles/repos/boost/bin.v2/libs/python/build/gcc-4.1.1/release/threading-multi <xdll-path>/home/cfairles/repos/boost/bin.v2/libs/serialization/build/gcc-4.1.1/release/threading-multi /home/cfairles/repos/boost/tools/build/v2/build/virtual-target.jam:459: in actualize-no-scanner from module object(file-target)@20868 /home/cfairles/repos/boost/tools/build/v2/build/virtual-target.jam:111: in object(file-target)(a)20868.actualize from module object(file-target)@20868 /home/cfairles/repos/boost/tools/build/v2/build-system.jam:476: in load from module build-system /home/cfairles/repos/boost/tools/build/v2/kernel/modules.jam:261: in import from module modules /home/cfairles/repos/boost/tools/build/v2/kernel/bootstrap.jam:132: in boost-build from module /home/cfairles/repos/boost/boost-build.jam:9: in module scope from module Not all Boost libraries built properly. Haven't found a workaround yet. Chris

2 1

CGAL and the BGL
by Andreas Fabri 04 Jun '07

04 Jun '07

The CGAL Open Source Project is pleased to announce the release 3.3 of CGAL, the Computational Geometry Algorithms Library, a robust, easy-to-use, and efficient C++ software library of geometric data structures and algorithms. We don't post the full announcement here, because that would be off-topic, but we want to point out that CGAL comes with partial specializations of the boost::graph_traits for several CGAL data structures and overloaded versions of the global functions for graph traversal. This is done for the 2D triangulations, the 2D arrangements of curves, and the polyhdral surface, that is for data structures with vertices and edges. This allows for example to compute the Euclidean minimum spanning tree of a point set in the plane, by running the BGL minimum spanniung tree algorithms on a CGAL 2D Delaunay triangulation, without converting the latter to a BGL graph. For more iformation see http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/packages.html#Pkg:BGL

2 1

[multi_index] MSVS 2005 visualizers?
by Filip Konvička 04 Jun '07

04 Jun '07

Hi, I just wanted to know if anyone succeeded creating a visualizer for multi_index containers. I'd love to spend some time doing that for the good of the community (and my own, of course :-)), but I could not find any data members for exploration in the debugger's watch window. Any suggestions? See the following blog for more info: http://www.virtualdub.org/blog/pivot/entry.php?id=120 Some info can be found in the autoexp.dat file directly - there are pre-defined visualizers for eg. std::map (which works nice). Thanks, Filip

6 32

[date_time] UNICODE and wcout problems
by Filip Konvička 04 Jun '07

04 Jun '07

Hi, in MSVC 8.0 _UNICODE build, after I send a ptime to wcout, I can no longer print "international" characters. When I use a temporary wostringstream for printing the ptime, everything is OK. Minimal repro see below (the "2" at the end is never printed). With some characters like the "š" in the example, the output is totally cut off; with others, like "á", the codepage is changed, so the characters are displayed incorrectly. Any suggestions? Thanks, Filip // _UNICODE must be defined; the "2" is never printed. #include <string> #include <iostream> #include <sstream> #include <locale.h> #include <boost/date_time/posix_time/posix_time.hpp> using boost::posix_time::ptime; using boost::date_time::not_a_date_time; int main() { wstring intl=L"\x161"; wostringstream ss; ss << ptime(not_a_date_time); wcout << ss.str() << endl; wcout << intl << endl; wcout << L"1" << endl; wcout << ptime(not_a_date_time) << endl; wcout << intl << endl; wcout << L"2" << endl; }

4 10

[thread_safe_signals] won't compile on VC71
by David Matz 04 Jun '07

04 Jun '07

Hello, I'm very impressed from Mr. Hess' work on thread safe signals for the boost library. In my opinion it's a great step to provide thread safe signals in a common library like boost and I like to use it as replacement for third party libs. Unfortunately I going in trouble when using the latest version of this module (thread_safe_signals-2007-03-19.tgz which is the same as out of the cvs). I can't get it compile on Microsoft VS71. I tried with gcc and VS8 and it works but for the VS71 compiler which we are working it fails. As mentioned in the documentation I included the headers of thread_safe_signals before the normal boost headers which are in fact 1_33_1 (same results with 1_34_0). The I picked up a sample project signal_test.cpp from boost/test/ and start to compile it but it fails with the following compiler hints: Kompilieren... signal_test.cpp ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot0<R,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot1<R,T1,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot2<R,T1,T2,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot3<R,T1,T2,T3,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot4<R,T1,T2,T3,T4,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot5<R,T1,T2,T3,T4,T5,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot6<R,T1,T2,T3,T4,T5,T6,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot7<R,T1,T2,T3,T4,T5,T6,T7,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot8<R,T1,T2,T3,T4,T5,T6,T7,T8,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot9<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,SlotFunction>' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(95) : error C2143: Syntaxfehler: Es fehlt ',' vor '&' ...\thread_safe_signals\boost\thread_safe_signals\detail\slot_template.hpp(109): Siehe Verweis auf Instanziierung der kompilierten Klassenvorlage 'boost::slot10<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,SlotFunction>' The same error comes up with other example snippets like doc_view.cpp or something else. At this stage I can't understand what is going on. Any help is very welcome. -- David Matz ---------------------------- Software Developer Spatial View GmbH david.matz<at>spatialview.com registration court: Amtsgericht Dresden, HRB 21104 managing directors: Wolfgang Opel, Jens Wiegrebe

2 2

[interprocess]
by Aaron W. LaFramboise 03 Jun '07

03 Jun '07

I just got Boost.Interprocess working, and it's really an amazing library. Ion, it's obvious you've put a lot of time into this library, and the result is really nice. However, I've had these issues so far: (1) Is there a way to get a managed_shared_memory segment to tell me allocation statistics? What I'd like is something that can tell me. (a) Segment size (b) Allocated memory (c) Most importantly, free memory (2) It's been brought up before, but there seriously needs to be a way to grow managed shared memory segments. I understand that this is really tricky to implement, and probably just as tricky to use safely, but it's an important feature, in my opinion. I guess the main difficulties here are the potential change of base, and atomicity? (3) Regarding priv_open_or_create() in managed_open_or_create_impl.hpp, this implementation creates some small annoyances for me by throwing. I don't have any idea how to tell if POSIX O_CREAT actually created anything or not. However, I'm using Windows, and on Windows, you always can tell, as far as I know, both for file creation and named shared memory object creation. Would it be difficult to avoid throwing for the Windows case?

3 4

Re: [Boost-users] newbie ordering question forboost::multi_index::ordered_non_unique
by "JOAQUIN LOPEZ MU?Z" 02 Jun '07

02 Jun '07

Hello Kevin, ----- Mensaje original ----- De: Kevin McMahon <kevinmcm(a)alum.mit.edu> Fecha: Sábado, Junio 2, 2007 4:15 pm Asunto: [Boost-users] newbie ordering question forboost::multi_index::ordered_non_unique Para: boost-users(a)lists.boost.org > I'd like to pop items in my data set ordered by a key, but if the > key is identical then ordered in the order I inserted them. > Is there a good way to do that? I guess I could make a > composite key using an increasing id. Although it is not documented (and I think I should document it in light of LWG issue 233), non-hinted insertion always happens at the end of all previously stored elements with equivalent key. Is this what you want? Are you observing otherwise? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

[date_time] nanosec resolution compile problem
by Christopher Lux 02 Jun '07

02 Jun '07

Hi, i am trying to use date_time with nanosec resolution for the fractional seconds part. So i define BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG in my projects using date_time. Now i get the compiler warning below. I found out that the problem in the said function is that in boost/date_time/date_duration.hpp the struct duration_traits_adapted defines the int_type as long and not as int_64t. The warning is generated in the add_time_duration() funtion of the split_timedate_system class. So i imagine that this is a bigger issue, because if the durations get bigger than what a long can hold (what will happen fast with nanosec resolution) the problems will come. Can this be resolved with an small fix to the duration_traits_adapted struct or have there to be more fixes? Here the compiler warning (VS.net 2005 SP1) boost\boost/date_time/time_system_split.hpp(189) : warning C4244: 'initializing' : conversion from '__int64' to 'long', possible loss of data D:\_devel\schism_wc_x86\schism\projects\cmake\..\..\ext\inc\boost\boost/date_time/time_system_split.hpp(180) : while compiling class template member function 'boost::posix_time::simple_time_rep boost::date_time::split_timedate_system<config>::add_time_duration(const boost::posix_time::simple_time_rep &,boost::posix_time::time_duration)' with [ config=boost::posix_time::posix_time_system_config ] D:\_devel\schism_wc_x86\schism\projects\cmake\..\..\ext\inc\boost\boost/date_time/time.hpp(52) : see reference to class template instantiation 'boost::date_time::split_timedate_system<config>' being compiled with [ config=boost::posix_time::posix_time_system_config ] D:\_devel\schism_wc_x86\schism\projects\cmake\..\..\ext\inc\boost\boost/date_time/posix_time/ptime.hpp(32) : see reference to class template instantiation 'boost::date_time::base_time<T,time_system>' being compiled with [ T=boost::posix_time::ptime, time_system=boost::posix_time::posix_time_system ] -chris -- Christopher Lux | | Bauhaus University Weimar | Faculty of Media - Virtual Reality Systems Group

2 2

converting ptime to/from CLR (.NET) DateTime
by Jens Schluetter 02 Jun '07

02 Jun '07

Hi, I'm kinda stuck. I'm working on an inter op library to glue C++ code that uses ptime with C# code that uses (of course) the .NET DateTime format. Since the system needs the outmost performance I'm looking for a way to use binary conversion. Conversion from .NET to ptime is easy since there is a from_ftime<> conversion method, however the other direction is somewhat blocked since no ptime to FILE_TIME conversion exists. My current workaround is using ISO time strings but performance is somewhat dismal since there is a lot of string <> binary conversion. Does anyone know of a more straight forward (binary)way of converting? And just in case, using regular time_t as common denominator is not an option since at leas millisecond resolution is required. I'd be greatful for any recommendations/ideas. Cheers, Jens.

2 1

datetime istream and ostream operators don't match
by Lothar Werzinger 02 Jun '07

02 Jun '07

compile the attached cppunit test with -DHIDE_BOOST_DATETIME_BUGS=false to see where datetime ostream operator produces an output that the datetime istream operator can not digest. Lothar -- Lothar Werzinger Dipl.-Ing. Univ. framework & platform architect Tradescape Inc. 111 West St. John Street, Suite 200 San Jose, Ca 95113 email: lothar(a)tradescape.biz web: http://www.tradescape.biz

2 1

Requesting boost x64 getting started documentation
by Daniel Svensson 02 Jun '07

02 Jun '07

Would someone who know how to do it add information about how to build boost for x64 to the online "getting started" documentation. An example command line like "bjam address-model=64 install" would probably be sufficient. See the "Boost 1.34 and VC++ x64" thread; > > Cory Nelson wrote: >> >> This was pretty straightforward for 1.33, but 1.34 using BB2 seems to >> >> have changed things a bit. There doesn't seem to be any documentation >> >> on compiling 1.34 for x64 with VC++ - can anyone offer some insight? > > > > Yea, as with previous Boost.Build versions those options are not > > documented :-) Just add an "address-model=64" argument when building. > > > >

1 0

[BGL] boost::bind fails to compile when used with edge iterators in for_each
by Sashan Govender 01 Jun '07

01 Jun '07

Hi I'm trying to run a functor over edges from a graph using for_each however it fails when the iterators are edges. The same technique works for iterators to vertices. Here is the compiler error: g++ -o bind_edge_test bind_edge_test.cpp /usr/lib/gcc/i686-pc-linux-gnu/4.1.1/include/g++-v4/bits/stl_algo.h: In function '_Function std::for_each(_InputIterator, _InputIterator, _Function) [with _InputIterator = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::property<boost::edge_name_t, unsigned int, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, int>, _Function = boost::_bi::bind_t<void, Op, boost::_bi::list2<boost::arg<1>, boost::_bi::value<int> > >]': bind_edge_test.cpp:79: instantiated from here /usr/lib/gcc/i686-pc-linux-gnu/4.1.1/include/g++-v4/bits/stl_algo.h:159: error: no match for call to '(boost::_bi::bind_t<void, Op, boost::_bi::list2<boost::arg<1>, boost::_bi::value<int> > >) (boost::detail::edge_desc_impl<boost::undirected_tag, void*>)' I've attached the file. Thanks for the help. -- sashan http://sashang.orcon.net.nz/

3 3

[iostreams] skip bug (repost)
by Phillip Seaver 01 Jun '07

01 Jun '07

I ran into a problem when using restrict on a file_source. The problem was that it decided that the stream wasn't seekable and called the version of skip that reads a character at a time until it gets to the requested offset, instead of just calling seek. The code was similar to this: namespace io = boost::iostreams; std::string filename; io::filtering_istream rstr(io::restrict(io::file_source(filename), 10, 100)); I've attached a patch that solved my problem. It was checking to see if the device was seekable (which means input_seekable and output_seekable), but since it was an input device, it was just input_seekable. Phillip Seaver --- skip.hpp.orig 2007-03-20 16:20:55.253000000 -0400 +++ skip.hpp 2007-03-20 16:11:51.096750000 -0400 @@ -67,7 +67,17 @@ void skip(Device& dev, stream_offset off) { typedef typename mode_of<Device>::type mode; - detail::skip(dev, off, is_convertible<mode, seekable>()); + typedef mpl::or_< + mpl::and_< + is_convertible<mode, input>, + is_convertible<mode, input_seekable> + >, + mpl::and_< + is_convertible<mode, output>, + is_convertible<mode, output_seekable> + > + > can_seek; + detail::skip(dev, off, can_seek()); } template<typename Filter, typename Device>

2 1

Problem with 1.34 Regex Package
by Jeffery Cavallaro 01 Jun '07

01 Jun '07

Hi, all! I am a bit of a newbie, so forgive if this has already been covered. The 1.34 regex package (or at least my build of it on FC6) appears to be broken. Please consider the following: #include <iostream> #include <iomanip> #include <boost/regex.hpp> int main(int argc, char *argv[]) { boost::regex rl("ab"); boost::regex ru("AB"); bool pass = regex_search("ab", rl); std::cout << std::boolalpha << pass << std::endl; pass = regex_search("AB", ru); std::cout << std::boolalpha << pass << std::endl; return EXIT_SUCCESS; } When built with 1.33 (as delivered with FC6), both tests return true. When built under 1.34 (downloaded and built), the uppercase test returns false. Yuck. Am I missing something? (probably...) -- Jeffery Cavallaro POSTINI Engineering Group 650-486-8342 ----------------------------------------------------------- This message may contain confidential and/or privileged information. This information is intended to be read only by the individual or entity to whom it is addressed. If you are not the intended recipient, you are on notice that any review, disclosure, copying, distribution or use of the contents of this message is strictly prohibited. If you have received this message in error, please notify the sender immediately and delete or destroy any copy of this message.

1 1

newbie ordering question for boost::multi_index::ordered_non_unique
by Kevin McMahon 01 Jun '07

01 Jun '07

I'd like to pop items in my data set ordered by a key, but if the key is identical then ordered in the order I inserted them. Is there a good way to do that? I guess I could make a composite key using an increasing id. -kevin

1 0

[Boost.Test 1.34] Multiple instances of unit_test_log_t singleton
by Kolya 01 Jun '07

01 Jun '07

Hi, All! I am using Boost.Test library in my own application and I have included boost/test/unit_test.hpp in many my cpp-files. When I used boost version 1.33.1 all works fine. But in version 1.34 I have following compiler error: file1.obj : error LNK2005: "class unit_test_log_t::boost::unit_test_log_t & boost::unit_test::`anonymous namespace'::unit_test_log" (?unit_test_log@?A0xa35d3712@unit_test@boost@@3AAVunit_test_log_t@23@A) already defined in file2.obj After including boost/test/unit_test.hpp class unit_test_log has multiple instances. See boost/test/unit_test_log.hpp for details: BOOST_TEST_SINGLETON_INST( unit_test_log ) It means that following code will be included in many cpp-files! namespace { unit_test_log_t & inst = unit_test_log_t::instance(); } When I replace BOOST_TEST_SINGLETON_INST( unit_test_log ) in boost/test/unit_test_log.hpp with namespace {extern unit_test_log_t & unit_test_log;} and in one of my cpp-files add: namespace boost { namespace unit_test { BOOST_TEST_SINGLETON_INST( unit_test_log ) } } all works fine May be I do not understand something? Is there any legal workaround from this situation? I do not like touch boost core files by myself. Thank you! VC++ 7.1, boost 1.34, xp sp2.

4 6

Bind: more convenience operators?
by Arno Schoedl 01 Jun '07

01 Jun '07

Bind has operator! overloaded to allow convenient notting of bound functions. Is there a specific reason not to overload all other operators in a similar way, for example for defining an AND of two predicates f and g as boost::bind( f, _1 ) && boost::bind( g, _1 )? Arno

2 1

[TR1] Configuration macros
by Scott Meyers 01 Jun '07

01 Jun '07

I'm having trouble understanding the information at http://www.boost.org/doc/html/boost_tr1/config.html, and having already spent a fair amount of time running test programs and pouring over the output of the preprocessor for various compilers, I'm hoping that somebody in the know can just explain things to me. My goal is simple: use Boost.TR1 such that if my compiler ships with a library with support for whatever TR1 component I want to use, I'll get that native support. But if the library that ships with the compiler lacks support for the TR1 component I need, I want to fall back on the Boost implementation, if there is one. And I want to uniformly refer to TR1 components as if they are in the namespace std::tr1. My reading of the above-referenced page leads me to believe that this is the behavior I'm supposed to get by default. And it's consistent with the tests I've performed using VC8 and g++ 4.1. But then I read this: > The configuration macros used by each TR1 component are documented in each library section (and all together in the Boost.Config documentation), but defining BOOST_HAS_TR1 will turn on native TR1 support for everything (if your standard library has it), which can act as a convenient shortcut. This kind of suggests that I should define BOOST_HAS_TR1. Should I? So far I have not. And then I read this: > Boost.TR1 does not currently enable gcc's native TR1 implementation as this is currently in an early stage of development. However, you may choose to do so by defining BOOST_HAS_GCC_TR1. This pretty clearly suggests that I should define BOOST_HAS_GCC_TR1. Should I? So far, I have. I've also found that unless I define it like this, > #ifdef __GNUC__ > #define BOOST_HAS_GCC_TR1 > #endif compilation with VC8 fails, which I find kind of strange. Here's an error I get: > D:\C++\Boost\Current\boost/tr1/type_traits.hpp(11): fatal error C1083: Cannot open include file: 'type_traits': No such file or dire > ctory Why should defining BOOST_HAS_GCC_TR1 have any effect on a VC8 compilation? All clarification about the correct settings of TR1 configuration macros for at least VC8 and g++ 4.1 would be much appreciated. Thanks, Scott

3 5

[bind] Convenience operator overloads
by Arno Schödl 01 Jun '07

01 Jun '07

Hello, are there any plans to provide more convenience operator overloads, such as operator! which is already implemented? I don't see any reason why not to overload all operators in that fashion. Thanks, Arno -- Arno Schoedl · aschoedl(a)think-cell.com Technical Director think-cell Software GmbH · Invalidenstr. 34 · 10115 Berlin, Germany http://www.think-cell.com · phone +49-30-666473-10 · fax +49-30-666473-19 Geschäftsführer: Dr. Markus Hannebauer, Arno Schoedl · Amtsgericht Charlottenburg, HRB 85229

1 0

[tokenizer] position of tokenizer
by Seweryn Habdank-Wojewódzki 01 Jun '07

01 Jun '07

Hi Is that possible to take actual position of the tokenizer in the parsed string? The question is motivated by such a case: 1. there is a line with data separated by e.g. "\t' sign 1 23 3.45 21 2093 494 3.4 2. important is only some of them let say from 2nd token to 5th token, but after parsing them I want to pass tokens from 6th to the end to the other string. Now I am iterating tokenizer to the end, and concatenate it. If I have had a position of tokenizer on the string I can simply create new substring with out iteration. Maybe there is other solution for that. Regards. -- |\/\/| Seweryn Habdank-Wojewódzki \/\/

1 0

Bind & Memory Leakage
by Sudhir Parikh 01 Jun '07

01 Jun '07

BoundsChecker is reporting a memory leak for every 'bind' call. I am using the threadpool includes, v 0.2.3, with "libboost_thread-vc71-mt-gd-1_33_1.lib", MSVC 7.1. Any help is appreciated. The usage is similar to the following working example: void task(int param1) { // performs some task printf("%d : Param1 : %d\n", GetCurrentThreadId(), param1); Sleep(1000); } void foo() { boost::threadpool::pool tp(5); // Threadpool with 5 threads while (1) { for (int i = 0; i < 10; i++) { // Seems like there is memory allocation which is not // deallocated after returning from the function call. tp.schedule(boost::bind(task, i)); } tp.wait(); // wait to finish off the remaining tasks Sleep(5000); // sleep for 5 seconds } }

2 1

[Unit Test] default FPC_STRONG limtations when checking close to 0.
by Chris Fairles 01 Jun '07

01 Jun '07

After wondering why my BOOST_CHECK_CLOSE(some_number_close_to_zero, 0.0) hadn't been working, I found that the default comparison type is FPC_STRONG which means the ration between the abs val of the difference and BOTH values must be < tolerance but this doesn't turn out to be true (running through what safe_fpt_division outputs atm ... difference between 0.0{0} and 0.0 std::numeric_limits<double>::epsilon(){-2.2204460492503131e-16} exceeds 0.01% It should work using FPC_WEAK but I can't find a way through the test_tools to easily change this. I have three solutions at this time. 1) Use BOOST_CHECK_SMALL. However, I have code that loops through matrix indicies like: for (int j = 0; j < matrix.col; j++) for (int i = 0; i < matrix.row; i++) BOOST_CHECK_CLOSE(matrix(i,j), data(i,j), tolerance); I'm going to have to use an if statement for the special case where I'm testing against 0 and it doesn't use the tolerance anyway so the test is completely different. Theres another number to determine "how small" the number should be. 2) Use check_is_close explicitly and change the default comparison type to FPC_WEAK. This means going outside the nice auto-unit-test and test-tools framework which although I'm fine with, other programmers writing test cases on my team might not be. 3) Define my own macro to simplify solution 2. Something along the lines of: CHECK_IS_CLOSE_WEAK(x,y,t) { check_is_close(x ,y,t, FPC_WEAK); } Are there any other recommended solutions?

2 3